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>
33 static unsigned n(struct isl_dim *dim, enum isl_dim_type type)
36 case isl_dim_param: return dim->nparam;
37 case isl_dim_in: return dim->n_in;
38 case isl_dim_out: return dim->n_out;
39 case isl_dim_all: return dim->nparam + dim->n_in + dim->n_out;
44 static unsigned pos(struct isl_dim *dim, enum isl_dim_type type)
47 case isl_dim_param: return 1;
48 case isl_dim_in: return 1 + dim->nparam;
49 case isl_dim_out: return 1 + dim->nparam + dim->n_in;
54 unsigned isl_basic_map_dim(const struct isl_basic_map *bmap,
55 enum isl_dim_type type)
60 case isl_dim_cst: return 1;
63 case isl_dim_out: return isl_dim_size(bmap->dim, type);
64 case isl_dim_div: return bmap->n_div;
65 case isl_dim_all: return isl_basic_map_total_dim(bmap);
70 unsigned isl_map_dim(const struct isl_map *map, enum isl_dim_type type)
72 return map ? n(map->dim, type) : 0;
75 unsigned isl_set_dim(const struct isl_set *set, enum isl_dim_type type)
77 return set ? n(set->dim, type) : 0;
80 unsigned isl_basic_map_offset(struct isl_basic_map *bmap,
81 enum isl_dim_type type)
83 struct isl_dim *dim = bmap->dim;
85 case isl_dim_cst: return 0;
86 case isl_dim_param: return 1;
87 case isl_dim_in: return 1 + dim->nparam;
88 case isl_dim_out: return 1 + dim->nparam + dim->n_in;
89 case isl_dim_div: return 1 + dim->nparam + dim->n_in + dim->n_out;
94 unsigned isl_basic_set_offset(struct isl_basic_set *bset,
95 enum isl_dim_type type)
97 return isl_basic_map_offset(bset, type);
100 static unsigned map_offset(struct isl_map *map, enum isl_dim_type type)
102 return pos(map->dim, type);
105 unsigned isl_basic_set_dim(const struct isl_basic_set *bset,
106 enum isl_dim_type type)
108 return isl_basic_map_dim((const struct isl_basic_map*)bset, type);
111 unsigned isl_basic_set_n_dim(const struct isl_basic_set *bset)
113 return isl_basic_set_dim(bset, isl_dim_set);
116 unsigned isl_basic_set_n_param(const struct isl_basic_set *bset)
118 return isl_basic_set_dim(bset, isl_dim_param);
121 unsigned isl_basic_set_total_dim(const struct isl_basic_set *bset)
123 return isl_dim_total(bset->dim) + bset->n_div;
126 unsigned isl_set_n_dim(const struct isl_set *set)
128 return isl_set_dim(set, isl_dim_set);
131 unsigned isl_set_n_param(const struct isl_set *set)
133 return isl_set_dim(set, isl_dim_param);
136 unsigned isl_basic_map_n_in(const struct isl_basic_map *bmap)
138 return bmap ? bmap->dim->n_in : 0;
141 unsigned isl_basic_map_n_out(const struct isl_basic_map *bmap)
143 return bmap ? bmap->dim->n_out : 0;
146 unsigned isl_basic_map_n_param(const struct isl_basic_map *bmap)
148 return bmap ? bmap->dim->nparam : 0;
151 unsigned isl_basic_map_n_div(const struct isl_basic_map *bmap)
153 return bmap ? bmap->n_div : 0;
156 unsigned isl_basic_map_total_dim(const struct isl_basic_map *bmap)
158 return bmap ? isl_dim_total(bmap->dim) + bmap->n_div : 0;
161 unsigned isl_map_n_in(const struct isl_map *map)
163 return map->dim->n_in;
166 unsigned isl_map_n_out(const struct isl_map *map)
168 return map->dim->n_out;
171 unsigned isl_map_n_param(const struct isl_map *map)
173 return map->dim->nparam;
176 int isl_map_compatible_domain(struct isl_map *map, struct isl_set *set)
181 m = isl_dim_match(map->dim, isl_dim_param, set->dim, isl_dim_param);
184 return isl_dim_tuple_match(map->dim, isl_dim_in, set->dim, isl_dim_set);
187 int isl_basic_map_compatible_domain(struct isl_basic_map *bmap,
188 struct isl_basic_set *bset)
193 m = isl_dim_match(bmap->dim, isl_dim_param, bset->dim, isl_dim_param);
196 return isl_dim_tuple_match(bmap->dim, isl_dim_in, bset->dim, isl_dim_set);
199 int isl_map_compatible_range(__isl_keep isl_map *map, __isl_keep isl_set *set)
204 m = isl_dim_match(map->dim, isl_dim_param, set->dim, isl_dim_param);
207 return isl_dim_tuple_match(map->dim, isl_dim_out, set->dim, isl_dim_set);
210 int isl_basic_map_compatible_range(struct isl_basic_map *bmap,
211 struct isl_basic_set *bset)
216 m = isl_dim_match(bmap->dim, isl_dim_param, bset->dim, isl_dim_param);
219 return isl_dim_tuple_match(bmap->dim, isl_dim_out, bset->dim, isl_dim_set);
222 isl_ctx *isl_basic_map_get_ctx(__isl_keep isl_basic_map *bmap)
224 return bmap ? bmap->ctx : NULL;
227 isl_ctx *isl_basic_set_get_ctx(__isl_keep isl_basic_set *bset)
229 return bset ? bset->ctx : NULL;
232 isl_ctx *isl_map_get_ctx(__isl_keep isl_map *map)
234 return map ? map->ctx : NULL;
237 isl_ctx *isl_set_get_ctx(__isl_keep isl_set *set)
239 return set ? set->ctx : NULL;
242 struct isl_dim *isl_basic_map_get_dim(struct isl_basic_map *bmap)
246 return isl_dim_copy(bmap->dim);
249 struct isl_dim *isl_basic_set_get_dim(struct isl_basic_set *bset)
253 return isl_dim_copy(bset->dim);
256 struct isl_dim *isl_map_get_dim(struct isl_map *map)
260 return isl_dim_copy(map->dim);
263 struct isl_dim *isl_set_get_dim(struct isl_set *set)
267 return isl_dim_copy(set->dim);
270 __isl_give isl_basic_map *isl_basic_map_set_tuple_name(
271 __isl_take isl_basic_map *bmap, enum isl_dim_type type, const char *s)
273 bmap = isl_basic_map_cow(bmap);
276 bmap->dim = isl_dim_set_tuple_name(bmap->dim, type, s);
279 bmap = isl_basic_map_finalize(bmap);
282 isl_basic_map_free(bmap);
286 const char *isl_basic_map_get_tuple_name(__isl_keep isl_basic_map *bmap,
287 enum isl_dim_type type)
289 return bmap ? isl_dim_get_tuple_name(bmap->dim, type) : NULL;
292 __isl_give isl_map *isl_map_set_tuple_name(__isl_take isl_map *map,
293 enum isl_dim_type type, const char *s)
297 map = isl_map_cow(map);
301 map->dim = isl_dim_set_tuple_name(map->dim, type, s);
305 for (i = 0; i < map->n; ++i) {
306 map->p[i] = isl_basic_map_set_tuple_name(map->p[i], type, s);
317 const char *isl_map_get_tuple_name(__isl_keep isl_map *map,
318 enum isl_dim_type type)
320 return map ? isl_dim_get_tuple_name(map->dim, type) : NULL;
323 __isl_give isl_set *isl_set_set_tuple_name(__isl_take isl_set *set,
326 return (isl_set *)isl_map_set_tuple_name((isl_map *)set, isl_dim_set, s);
329 const char *isl_basic_set_get_tuple_name(__isl_keep isl_basic_set *bset)
331 return bset ? isl_dim_get_tuple_name(bset->dim, isl_dim_set) : NULL;
334 const char *isl_set_get_tuple_name(__isl_keep isl_set *set)
336 return set ? isl_dim_get_tuple_name(set->dim, isl_dim_set) : NULL;
339 const char *isl_basic_map_get_dim_name(__isl_keep isl_basic_map *bmap,
340 enum isl_dim_type type, unsigned pos)
342 return bmap ? isl_dim_get_name(bmap->dim, type, pos) : NULL;
345 const char *isl_basic_set_get_dim_name(__isl_keep isl_basic_set *bset,
346 enum isl_dim_type type, unsigned pos)
348 return bset ? isl_dim_get_name(bset->dim, type, pos) : NULL;
351 const char *isl_map_get_dim_name(__isl_keep isl_map *map,
352 enum isl_dim_type type, unsigned pos)
354 return map ? isl_dim_get_name(map->dim, type, pos) : NULL;
357 const char *isl_set_get_dim_name(__isl_keep isl_set *set,
358 enum isl_dim_type type, unsigned pos)
360 return set ? isl_dim_get_name(set->dim, type, pos) : NULL;
363 __isl_give isl_basic_map *isl_basic_map_set_dim_name(
364 __isl_take isl_basic_map *bmap,
365 enum isl_dim_type type, unsigned pos, const char *s)
369 bmap->dim = isl_dim_set_name(bmap->dim, type, pos, s);
374 isl_basic_map_free(bmap);
378 __isl_give isl_map *isl_map_set_dim_name(__isl_take isl_map *map,
379 enum isl_dim_type type, unsigned pos, const char *s)
386 map->dim = isl_dim_set_name(map->dim, type, pos, s);
390 for (i = 0; i < map->n; ++i) {
391 map->p[i] = isl_basic_map_set_dim_name(map->p[i], type, pos, s);
402 __isl_give isl_basic_set *isl_basic_set_set_dim_name(
403 __isl_take isl_basic_set *bset,
404 enum isl_dim_type type, unsigned pos, const char *s)
406 return (isl_basic_set *)isl_basic_map_set_dim_name(
407 (isl_basic_map *)bset, type, pos, s);
410 __isl_give isl_set *isl_set_set_dim_name(__isl_take isl_set *set,
411 enum isl_dim_type type, unsigned pos, const char *s)
413 return (isl_set *)isl_map_set_dim_name((isl_map *)set, type, pos, s);
416 int isl_basic_map_is_rational(__isl_keep isl_basic_map *bmap)
420 return ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL);
423 int isl_basic_set_is_rational(__isl_keep isl_basic_set *bset)
425 return isl_basic_map_is_rational(bset);
428 static struct isl_basic_map *basic_map_init(struct isl_ctx *ctx,
429 struct isl_basic_map *bmap, unsigned extra,
430 unsigned n_eq, unsigned n_ineq)
433 size_t row_size = 1 + isl_dim_total(bmap->dim) + extra;
438 bmap->block = isl_blk_alloc(ctx, (n_ineq + n_eq) * row_size);
439 if (isl_blk_is_error(bmap->block))
442 bmap->ineq = isl_alloc_array(ctx, isl_int *, n_ineq + n_eq);
447 bmap->block2 = isl_blk_empty();
450 bmap->block2 = isl_blk_alloc(ctx, extra * (1 + row_size));
451 if (isl_blk_is_error(bmap->block2))
454 bmap->div = isl_alloc_array(ctx, isl_int *, extra);
459 for (i = 0; i < n_ineq + n_eq; ++i)
460 bmap->ineq[i] = bmap->block.data + i * row_size;
462 for (i = 0; i < extra; ++i)
463 bmap->div[i] = bmap->block2.data + i * (1 + row_size);
467 bmap->c_size = n_eq + n_ineq;
468 bmap->eq = bmap->ineq + n_ineq;
477 isl_basic_map_free(bmap);
481 struct isl_basic_set *isl_basic_set_alloc(struct isl_ctx *ctx,
482 unsigned nparam, unsigned dim, unsigned extra,
483 unsigned n_eq, unsigned n_ineq)
485 struct isl_basic_map *bmap;
486 bmap = isl_basic_map_alloc(ctx, nparam, 0, dim, extra, n_eq, n_ineq);
487 return (struct isl_basic_set *)bmap;
490 struct isl_basic_set *isl_basic_set_alloc_dim(struct isl_dim *dim,
491 unsigned extra, unsigned n_eq, unsigned n_ineq)
493 struct isl_basic_map *bmap;
496 isl_assert(dim->ctx, dim->n_in == 0, goto error);
497 bmap = isl_basic_map_alloc_dim(dim, extra, n_eq, n_ineq);
498 return (struct isl_basic_set *)bmap;
504 struct isl_basic_map *isl_basic_map_alloc_dim(struct isl_dim *dim,
505 unsigned extra, unsigned n_eq, unsigned n_ineq)
507 struct isl_basic_map *bmap;
511 bmap = isl_calloc_type(dim->ctx, struct isl_basic_map);
516 return basic_map_init(dim->ctx, bmap, extra, n_eq, n_ineq);
522 struct isl_basic_map *isl_basic_map_alloc(struct isl_ctx *ctx,
523 unsigned nparam, unsigned in, unsigned out, unsigned extra,
524 unsigned n_eq, unsigned n_ineq)
526 struct isl_basic_map *bmap;
529 dim = isl_dim_alloc(ctx, nparam, in, out);
533 bmap = isl_basic_map_alloc_dim(dim, extra, n_eq, n_ineq);
537 static void dup_constraints(
538 struct isl_basic_map *dst, struct isl_basic_map *src)
541 unsigned total = isl_basic_map_total_dim(src);
543 for (i = 0; i < src->n_eq; ++i) {
544 int j = isl_basic_map_alloc_equality(dst);
545 isl_seq_cpy(dst->eq[j], src->eq[i], 1+total);
548 for (i = 0; i < src->n_ineq; ++i) {
549 int j = isl_basic_map_alloc_inequality(dst);
550 isl_seq_cpy(dst->ineq[j], src->ineq[i], 1+total);
553 for (i = 0; i < src->n_div; ++i) {
554 int j = isl_basic_map_alloc_div(dst);
555 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total);
557 ISL_F_SET(dst, ISL_BASIC_SET_FINAL);
560 struct isl_basic_map *isl_basic_map_dup(struct isl_basic_map *bmap)
562 struct isl_basic_map *dup;
566 dup = isl_basic_map_alloc_dim(isl_dim_copy(bmap->dim),
567 bmap->n_div, bmap->n_eq, bmap->n_ineq);
570 dup_constraints(dup, bmap);
571 dup->flags = bmap->flags;
572 dup->sample = isl_vec_copy(bmap->sample);
576 struct isl_basic_set *isl_basic_set_dup(struct isl_basic_set *bset)
578 struct isl_basic_map *dup;
580 dup = isl_basic_map_dup((struct isl_basic_map *)bset);
581 return (struct isl_basic_set *)dup;
584 struct isl_basic_set *isl_basic_set_copy(struct isl_basic_set *bset)
589 if (ISL_F_ISSET(bset, ISL_BASIC_SET_FINAL)) {
593 return isl_basic_set_dup(bset);
596 struct isl_set *isl_set_copy(struct isl_set *set)
605 struct isl_basic_map *isl_basic_map_copy(struct isl_basic_map *bmap)
610 if (ISL_F_ISSET(bmap, ISL_BASIC_SET_FINAL)) {
614 bmap = isl_basic_map_dup(bmap);
616 ISL_F_SET(bmap, ISL_BASIC_SET_FINAL);
620 struct isl_map *isl_map_copy(struct isl_map *map)
629 void isl_basic_map_free(struct isl_basic_map *bmap)
637 isl_ctx_deref(bmap->ctx);
639 isl_blk_free(bmap->ctx, bmap->block2);
641 isl_blk_free(bmap->ctx, bmap->block);
642 isl_vec_free(bmap->sample);
643 isl_dim_free(bmap->dim);
647 void isl_basic_set_free(struct isl_basic_set *bset)
649 isl_basic_map_free((struct isl_basic_map *)bset);
652 static int room_for_con(struct isl_basic_map *bmap, unsigned n)
654 return bmap->n_eq + bmap->n_ineq + n <= bmap->c_size;
657 int isl_basic_map_alloc_equality(struct isl_basic_map *bmap)
663 isl_assert(ctx, room_for_con(bmap, 1), return -1);
664 isl_assert(ctx, (bmap->eq - bmap->ineq) + bmap->n_eq <= bmap->c_size,
666 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
667 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
668 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_IMPLICIT);
669 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
670 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
671 if ((bmap->eq - bmap->ineq) + bmap->n_eq == bmap->c_size) {
673 int j = isl_basic_map_alloc_inequality(bmap);
677 bmap->ineq[j] = bmap->ineq[bmap->n_ineq - 1];
678 bmap->ineq[bmap->n_ineq - 1] = bmap->eq[-1];
685 isl_seq_clr(bmap->eq[bmap->n_eq] + 1 + isl_basic_map_total_dim(bmap),
686 bmap->extra - bmap->n_div);
690 int isl_basic_set_alloc_equality(struct isl_basic_set *bset)
692 return isl_basic_map_alloc_equality((struct isl_basic_map *)bset);
695 int isl_basic_map_free_equality(struct isl_basic_map *bmap, unsigned n)
699 isl_assert(bmap->ctx, n <= bmap->n_eq, return -1);
704 int isl_basic_set_free_equality(struct isl_basic_set *bset, unsigned n)
706 return isl_basic_map_free_equality((struct isl_basic_map *)bset, n);
709 int isl_basic_map_drop_equality(struct isl_basic_map *bmap, unsigned pos)
714 isl_assert(bmap->ctx, pos < bmap->n_eq, return -1);
716 if (pos != bmap->n_eq - 1) {
718 bmap->eq[pos] = bmap->eq[bmap->n_eq - 1];
719 bmap->eq[bmap->n_eq - 1] = t;
725 int isl_basic_set_drop_equality(struct isl_basic_set *bset, unsigned pos)
727 return isl_basic_map_drop_equality((struct isl_basic_map *)bset, pos);
730 void isl_basic_map_inequality_to_equality(
731 struct isl_basic_map *bmap, unsigned pos)
736 bmap->ineq[pos] = bmap->ineq[bmap->n_ineq - 1];
737 bmap->ineq[bmap->n_ineq - 1] = bmap->eq[-1];
742 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
743 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
744 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
745 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
748 static int room_for_ineq(struct isl_basic_map *bmap, unsigned n)
750 return bmap->n_ineq + n <= bmap->eq - bmap->ineq;
753 int isl_basic_map_alloc_inequality(struct isl_basic_map *bmap)
759 isl_assert(ctx, room_for_ineq(bmap, 1), return -1);
760 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_IMPLICIT);
761 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
762 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
763 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
764 isl_seq_clr(bmap->ineq[bmap->n_ineq] +
765 1 + isl_basic_map_total_dim(bmap),
766 bmap->extra - bmap->n_div);
767 return bmap->n_ineq++;
770 int isl_basic_set_alloc_inequality(struct isl_basic_set *bset)
772 return isl_basic_map_alloc_inequality((struct isl_basic_map *)bset);
775 int isl_basic_map_free_inequality(struct isl_basic_map *bmap, unsigned n)
779 isl_assert(bmap->ctx, n <= bmap->n_ineq, return -1);
784 int isl_basic_set_free_inequality(struct isl_basic_set *bset, unsigned n)
786 return isl_basic_map_free_inequality((struct isl_basic_map *)bset, n);
789 int isl_basic_map_drop_inequality(struct isl_basic_map *bmap, unsigned pos)
794 isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
796 if (pos != bmap->n_ineq - 1) {
798 bmap->ineq[pos] = bmap->ineq[bmap->n_ineq - 1];
799 bmap->ineq[bmap->n_ineq - 1] = t;
800 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
806 int isl_basic_set_drop_inequality(struct isl_basic_set *bset, unsigned pos)
808 return isl_basic_map_drop_inequality((struct isl_basic_map *)bset, pos);
811 __isl_give isl_basic_map *isl_basic_map_add_eq(__isl_take isl_basic_map *bmap,
816 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
819 k = isl_basic_map_alloc_equality(bmap);
822 isl_seq_cpy(bmap->eq[k], eq, 1 + isl_basic_map_total_dim(bmap));
825 isl_basic_map_free(bmap);
829 __isl_give isl_basic_set *isl_basic_set_add_eq(__isl_take isl_basic_set *bset,
832 return (isl_basic_set *)
833 isl_basic_map_add_eq((isl_basic_map *)bset, eq);
836 __isl_give isl_basic_map *isl_basic_map_add_ineq(__isl_take isl_basic_map *bmap,
841 bmap = isl_basic_map_extend_constraints(bmap, 0, 1);
844 k = isl_basic_map_alloc_inequality(bmap);
847 isl_seq_cpy(bmap->ineq[k], ineq, 1 + isl_basic_map_total_dim(bmap));
850 isl_basic_map_free(bmap);
854 __isl_give isl_basic_set *isl_basic_set_add_ineq(__isl_take isl_basic_set *bset,
857 return (isl_basic_set *)
858 isl_basic_map_add_ineq((isl_basic_map *)bset, ineq);
861 int isl_basic_map_alloc_div(struct isl_basic_map *bmap)
865 isl_assert(bmap->ctx, bmap->n_div < bmap->extra, return -1);
866 isl_seq_clr(bmap->div[bmap->n_div] +
867 1 + 1 + isl_basic_map_total_dim(bmap),
868 bmap->extra - bmap->n_div);
869 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
870 return bmap->n_div++;
873 int isl_basic_set_alloc_div(struct isl_basic_set *bset)
875 return isl_basic_map_alloc_div((struct isl_basic_map *)bset);
878 int isl_basic_map_free_div(struct isl_basic_map *bmap, unsigned n)
882 isl_assert(bmap->ctx, n <= bmap->n_div, return -1);
887 int isl_basic_set_free_div(struct isl_basic_set *bset, unsigned n)
889 return isl_basic_map_free_div((struct isl_basic_map *)bset, n);
892 /* Copy constraint from src to dst, putting the vars of src at offset
893 * dim_off in dst and the divs of src at offset div_off in dst.
894 * If both sets are actually map, then dim_off applies to the input
897 static void copy_constraint(struct isl_basic_map *dst_map, isl_int *dst,
898 struct isl_basic_map *src_map, isl_int *src,
899 unsigned in_off, unsigned out_off, unsigned div_off)
901 unsigned src_nparam = isl_basic_map_n_param(src_map);
902 unsigned dst_nparam = isl_basic_map_n_param(dst_map);
903 unsigned src_in = isl_basic_map_n_in(src_map);
904 unsigned dst_in = isl_basic_map_n_in(dst_map);
905 unsigned src_out = isl_basic_map_n_out(src_map);
906 unsigned dst_out = isl_basic_map_n_out(dst_map);
907 isl_int_set(dst[0], src[0]);
908 isl_seq_cpy(dst+1, src+1, isl_min(dst_nparam, src_nparam));
909 if (dst_nparam > src_nparam)
910 isl_seq_clr(dst+1+src_nparam,
911 dst_nparam - src_nparam);
912 isl_seq_clr(dst+1+dst_nparam, in_off);
913 isl_seq_cpy(dst+1+dst_nparam+in_off,
915 isl_min(dst_in-in_off, src_in));
916 if (dst_in-in_off > src_in)
917 isl_seq_clr(dst+1+dst_nparam+in_off+src_in,
918 dst_in - in_off - src_in);
919 isl_seq_clr(dst+1+dst_nparam+dst_in, out_off);
920 isl_seq_cpy(dst+1+dst_nparam+dst_in+out_off,
921 src+1+src_nparam+src_in,
922 isl_min(dst_out-out_off, src_out));
923 if (dst_out-out_off > src_out)
924 isl_seq_clr(dst+1+dst_nparam+dst_in+out_off+src_out,
925 dst_out - out_off - src_out);
926 isl_seq_clr(dst+1+dst_nparam+dst_in+dst_out, div_off);
927 isl_seq_cpy(dst+1+dst_nparam+dst_in+dst_out+div_off,
928 src+1+src_nparam+src_in+src_out,
929 isl_min(dst_map->extra-div_off, src_map->n_div));
930 if (dst_map->n_div-div_off > src_map->n_div)
931 isl_seq_clr(dst+1+dst_nparam+dst_in+dst_out+
932 div_off+src_map->n_div,
933 dst_map->n_div - div_off - src_map->n_div);
936 static void copy_div(struct isl_basic_map *dst_map, isl_int *dst,
937 struct isl_basic_map *src_map, isl_int *src,
938 unsigned in_off, unsigned out_off, unsigned div_off)
940 isl_int_set(dst[0], src[0]);
941 copy_constraint(dst_map, dst+1, src_map, src+1, in_off, out_off, div_off);
944 static struct isl_basic_map *add_constraints(struct isl_basic_map *bmap1,
945 struct isl_basic_map *bmap2, unsigned i_pos, unsigned o_pos)
950 if (!bmap1 || !bmap2)
953 div_off = bmap1->n_div;
955 for (i = 0; i < bmap2->n_eq; ++i) {
956 int i1 = isl_basic_map_alloc_equality(bmap1);
959 copy_constraint(bmap1, bmap1->eq[i1], bmap2, bmap2->eq[i],
960 i_pos, o_pos, div_off);
963 for (i = 0; i < bmap2->n_ineq; ++i) {
964 int i1 = isl_basic_map_alloc_inequality(bmap1);
967 copy_constraint(bmap1, bmap1->ineq[i1], bmap2, bmap2->ineq[i],
968 i_pos, o_pos, div_off);
971 for (i = 0; i < bmap2->n_div; ++i) {
972 int i1 = isl_basic_map_alloc_div(bmap1);
975 copy_div(bmap1, bmap1->div[i1], bmap2, bmap2->div[i],
976 i_pos, o_pos, div_off);
979 isl_basic_map_free(bmap2);
984 isl_basic_map_free(bmap1);
985 isl_basic_map_free(bmap2);
989 struct isl_basic_set *isl_basic_set_add_constraints(struct isl_basic_set *bset1,
990 struct isl_basic_set *bset2, unsigned pos)
992 return (struct isl_basic_set *)
993 add_constraints((struct isl_basic_map *)bset1,
994 (struct isl_basic_map *)bset2, 0, pos);
997 struct isl_basic_map *isl_basic_map_extend_dim(struct isl_basic_map *base,
998 struct isl_dim *dim, unsigned extra,
999 unsigned n_eq, unsigned n_ineq)
1001 struct isl_basic_map *ext;
1011 dims_ok = isl_dim_equal(base->dim, dim) &&
1012 base->extra >= base->n_div + extra;
1014 if (dims_ok && room_for_con(base, n_eq + n_ineq) &&
1015 room_for_ineq(base, n_ineq)) {
1020 isl_assert(base->ctx, base->dim->nparam <= dim->nparam, goto error);
1021 isl_assert(base->ctx, base->dim->n_in <= dim->n_in, goto error);
1022 isl_assert(base->ctx, base->dim->n_out <= dim->n_out, goto error);
1023 extra += base->extra;
1025 n_ineq += base->n_ineq;
1027 ext = isl_basic_map_alloc_dim(dim, extra, n_eq, n_ineq);
1033 ext->sample = isl_vec_copy(base->sample);
1034 flags = base->flags;
1035 ext = add_constraints(ext, base, 0, 0);
1038 ISL_F_CLR(ext, ISL_BASIC_SET_FINAL);
1045 isl_basic_map_free(base);
1049 struct isl_basic_set *isl_basic_set_extend_dim(struct isl_basic_set *base,
1050 struct isl_dim *dim, unsigned extra,
1051 unsigned n_eq, unsigned n_ineq)
1053 return (struct isl_basic_set *)
1054 isl_basic_map_extend_dim((struct isl_basic_map *)base, dim,
1055 extra, n_eq, n_ineq);
1058 struct isl_basic_map *isl_basic_map_extend_constraints(
1059 struct isl_basic_map *base, unsigned n_eq, unsigned n_ineq)
1063 return isl_basic_map_extend_dim(base, isl_dim_copy(base->dim),
1067 struct isl_basic_map *isl_basic_map_extend(struct isl_basic_map *base,
1068 unsigned nparam, unsigned n_in, unsigned n_out, unsigned extra,
1069 unsigned n_eq, unsigned n_ineq)
1071 struct isl_basic_map *bmap;
1072 struct isl_dim *dim;
1076 dim = isl_dim_alloc(base->ctx, nparam, n_in, n_out);
1080 bmap = isl_basic_map_extend_dim(base, dim, extra, n_eq, n_ineq);
1083 isl_basic_map_free(base);
1087 struct isl_basic_set *isl_basic_set_extend(struct isl_basic_set *base,
1088 unsigned nparam, unsigned dim, unsigned extra,
1089 unsigned n_eq, unsigned n_ineq)
1091 return (struct isl_basic_set *)
1092 isl_basic_map_extend((struct isl_basic_map *)base,
1093 nparam, 0, dim, extra, n_eq, n_ineq);
1096 struct isl_basic_set *isl_basic_set_extend_constraints(
1097 struct isl_basic_set *base, unsigned n_eq, unsigned n_ineq)
1099 return (struct isl_basic_set *)
1100 isl_basic_map_extend_constraints((struct isl_basic_map *)base,
1104 struct isl_basic_set *isl_basic_set_cow(struct isl_basic_set *bset)
1106 return (struct isl_basic_set *)
1107 isl_basic_map_cow((struct isl_basic_map *)bset);
1110 struct isl_basic_map *isl_basic_map_cow(struct isl_basic_map *bmap)
1115 if (bmap->ref > 1) {
1117 bmap = isl_basic_map_dup(bmap);
1120 ISL_F_CLR(bmap, ISL_BASIC_SET_FINAL);
1124 struct isl_set *isl_set_cow(struct isl_set *set)
1132 return isl_set_dup(set);
1135 struct isl_map *isl_map_cow(struct isl_map *map)
1143 return isl_map_dup(map);
1146 static void swap_vars(struct isl_blk blk, isl_int *a,
1147 unsigned a_len, unsigned b_len)
1149 isl_seq_cpy(blk.data, a+a_len, b_len);
1150 isl_seq_cpy(blk.data+b_len, a, a_len);
1151 isl_seq_cpy(a, blk.data, b_len+a_len);
1154 static __isl_give isl_basic_map *isl_basic_map_swap_vars(
1155 __isl_take isl_basic_map *bmap, unsigned pos, unsigned n1, unsigned n2)
1163 isl_assert(bmap->ctx,
1164 pos + n1 + n2 <= 1 + isl_basic_map_total_dim(bmap), goto error);
1166 if (n1 == 0 || n2 == 0)
1169 bmap = isl_basic_map_cow(bmap);
1173 blk = isl_blk_alloc(bmap->ctx, n1 + n2);
1174 if (isl_blk_is_error(blk))
1177 for (i = 0; i < bmap->n_eq; ++i)
1179 bmap->eq[i] + pos, n1, n2);
1181 for (i = 0; i < bmap->n_ineq; ++i)
1183 bmap->ineq[i] + pos, n1, n2);
1185 for (i = 0; i < bmap->n_div; ++i)
1187 bmap->div[i]+1 + pos, n1, n2);
1189 isl_blk_free(bmap->ctx, blk);
1191 ISL_F_CLR(bmap, ISL_BASIC_SET_NORMALIZED);
1192 bmap = isl_basic_map_gauss(bmap, NULL);
1193 return isl_basic_map_finalize(bmap);
1195 isl_basic_map_free(bmap);
1199 static __isl_give isl_basic_set *isl_basic_set_swap_vars(
1200 __isl_take isl_basic_set *bset, unsigned n)
1205 nparam = isl_basic_set_n_param(bset);
1206 dim = isl_basic_set_n_dim(bset);
1207 isl_assert(bset->ctx, n <= dim, goto error);
1209 return isl_basic_map_swap_vars(bset, 1 + nparam, n, dim - n);
1211 isl_basic_set_free(bset);
1215 static __isl_give isl_set *isl_set_swap_vars(__isl_take isl_set *set,
1219 set = isl_set_cow(set);
1223 for (i = 0; i < set->n; ++i) {
1224 set->p[i] = isl_basic_set_swap_vars(set->p[i], n);
1230 ISL_F_CLR(set, ISL_SET_NORMALIZED);
1234 struct isl_basic_map *isl_basic_map_set_to_empty(struct isl_basic_map *bmap)
1240 total = isl_basic_map_total_dim(bmap);
1241 isl_basic_map_free_div(bmap, bmap->n_div);
1242 isl_basic_map_free_inequality(bmap, bmap->n_ineq);
1244 isl_basic_map_free_equality(bmap, bmap->n_eq-1);
1246 i = isl_basic_map_alloc_equality(bmap);
1250 isl_int_set_si(bmap->eq[i][0], 1);
1251 isl_seq_clr(bmap->eq[i]+1, total);
1252 ISL_F_SET(bmap, ISL_BASIC_MAP_EMPTY);
1253 isl_vec_free(bmap->sample);
1254 bmap->sample = NULL;
1255 return isl_basic_map_finalize(bmap);
1257 isl_basic_map_free(bmap);
1261 struct isl_basic_set *isl_basic_set_set_to_empty(struct isl_basic_set *bset)
1263 return (struct isl_basic_set *)
1264 isl_basic_map_set_to_empty((struct isl_basic_map *)bset);
1267 void isl_basic_map_swap_div(struct isl_basic_map *bmap, int a, int b)
1270 unsigned off = isl_dim_total(bmap->dim);
1271 isl_int *t = bmap->div[a];
1272 bmap->div[a] = bmap->div[b];
1275 for (i = 0; i < bmap->n_eq; ++i)
1276 isl_int_swap(bmap->eq[i][1+off+a], bmap->eq[i][1+off+b]);
1278 for (i = 0; i < bmap->n_ineq; ++i)
1279 isl_int_swap(bmap->ineq[i][1+off+a], bmap->ineq[i][1+off+b]);
1281 for (i = 0; i < bmap->n_div; ++i)
1282 isl_int_swap(bmap->div[i][1+1+off+a], bmap->div[i][1+1+off+b]);
1283 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1286 /* Eliminate the specified n dimensions starting at first from the
1287 * constraints using Fourier-Motzkin. The dimensions themselves
1290 __isl_give isl_map *isl_map_eliminate(__isl_take isl_map *map,
1291 enum isl_dim_type type, unsigned first, unsigned n)
1300 map = isl_map_cow(map);
1303 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
1304 first += pos(map->dim, type) - 1;
1306 for (i = 0; i < map->n; ++i) {
1307 map->p[i] = isl_basic_map_eliminate_vars(map->p[i], first, n);
1317 /* Eliminate the specified n dimensions starting at first from the
1318 * constraints using Fourier-Motzkin. The dimensions themselves
1321 __isl_give isl_set *isl_set_eliminate(__isl_take isl_set *set,
1322 enum isl_dim_type type, unsigned first, unsigned n)
1324 return (isl_set *)isl_map_eliminate((isl_map *)set, type, first, n);
1327 /* Eliminate the specified n dimensions starting at first from the
1328 * constraints using Fourier-Motzkin. The dimensions themselves
1331 __isl_give isl_set *isl_set_eliminate_dims(__isl_take isl_set *set,
1332 unsigned first, unsigned n)
1334 return isl_set_eliminate(set, isl_dim_set, first, n);
1337 __isl_give isl_basic_map *isl_basic_map_remove_divs(
1338 __isl_take isl_basic_map *bmap)
1340 bmap = isl_basic_map_eliminate_vars(bmap, isl_dim_total(bmap->dim),
1345 return isl_basic_map_finalize(bmap);
1348 __isl_give isl_basic_set *isl_basic_set_remove_divs(
1349 __isl_take isl_basic_set *bset)
1351 return (struct isl_basic_set *)isl_basic_map_remove_divs(
1352 (struct isl_basic_map *)bset);
1355 __isl_give isl_map *isl_map_remove_divs(__isl_take isl_map *map)
1364 map = isl_map_cow(map);
1368 for (i = 0; i < map->n; ++i) {
1369 map->p[i] = isl_basic_map_remove_divs(map->p[i]);
1379 __isl_give isl_set *isl_set_remove_divs(__isl_take isl_set *set)
1381 return isl_map_remove_divs(set);
1384 struct isl_basic_map *isl_basic_map_remove_dims(struct isl_basic_map *bmap,
1385 enum isl_dim_type type, unsigned first, unsigned n)
1389 isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
1393 bmap = isl_basic_map_eliminate_vars(bmap,
1394 isl_basic_map_offset(bmap, type) - 1 + first, n);
1397 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY) && type == isl_dim_div)
1399 bmap = isl_basic_map_drop(bmap, type, first, n);
1402 isl_basic_map_free(bmap);
1406 /* Return true if the definition of the given div (recursively) involves
1407 * any of the given variables.
1409 static int div_involves_vars(__isl_keep isl_basic_map *bmap, int div,
1410 unsigned first, unsigned n)
1413 unsigned div_offset = isl_basic_map_offset(bmap, isl_dim_div);
1415 if (isl_int_is_zero(bmap->div[div][0]))
1417 if (isl_seq_first_non_zero(bmap->div[div] + 1 + first, n) >= 0)
1420 for (i = bmap->n_div - 1; i >= 0; --i) {
1421 if (isl_int_is_zero(bmap->div[div][1 + div_offset + i]))
1423 if (div_involves_vars(bmap, i, first, n))
1430 /* Remove all divs (recursively) involving any of the given dimensions
1431 * in their definitions.
1433 __isl_give isl_basic_map *isl_basic_map_remove_divs_involving_dims(
1434 __isl_take isl_basic_map *bmap,
1435 enum isl_dim_type type, unsigned first, unsigned n)
1441 isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
1443 first += isl_basic_map_offset(bmap, type);
1445 for (i = bmap->n_div - 1; i >= 0; --i) {
1446 if (!div_involves_vars(bmap, i, first, n))
1448 bmap = isl_basic_map_remove_dims(bmap, isl_dim_div, i, 1);
1453 isl_basic_map_free(bmap);
1457 __isl_give isl_map *isl_map_remove_divs_involving_dims(__isl_take isl_map *map,
1458 enum isl_dim_type type, unsigned first, unsigned n)
1467 map = isl_map_cow(map);
1471 for (i = 0; i < map->n; ++i) {
1472 map->p[i] = isl_basic_map_remove_divs_involving_dims(map->p[i],
1483 __isl_give isl_set *isl_set_remove_divs_involving_dims(__isl_take isl_set *set,
1484 enum isl_dim_type type, unsigned first, unsigned n)
1486 return (isl_set *)isl_map_remove_divs_involving_dims((isl_map *)set,
1490 /* Return true if the definition of the given div is unknown or depends
1493 static int div_is_unknown(__isl_keep isl_basic_map *bmap, int div)
1496 unsigned div_offset = isl_basic_map_offset(bmap, isl_dim_div);
1498 if (isl_int_is_zero(bmap->div[div][0]))
1501 for (i = bmap->n_div - 1; i >= 0; --i) {
1502 if (isl_int_is_zero(bmap->div[div][1 + div_offset + i]))
1504 if (div_is_unknown(bmap, i))
1511 /* Remove all divs that are unknown or defined in terms of unknown divs.
1513 __isl_give isl_basic_map *isl_basic_map_remove_unknown_divs(
1514 __isl_take isl_basic_map *bmap)
1521 for (i = bmap->n_div - 1; i >= 0; --i) {
1522 if (!div_is_unknown(bmap, i))
1524 bmap = isl_basic_map_remove_dims(bmap, isl_dim_div, i, 1);
1530 __isl_give isl_map *isl_map_remove_unknown_divs(__isl_take isl_map *map)
1539 map = isl_map_cow(map);
1543 for (i = 0; i < map->n; ++i) {
1544 map->p[i] = isl_basic_map_remove_unknown_divs(map->p[i]);
1554 __isl_give isl_set *isl_set_remove_unknown_divs(__isl_take isl_set *set)
1556 return (isl_set *)isl_map_remove_unknown_divs((isl_map *)set);
1559 __isl_give isl_basic_set *isl_basic_set_remove_dims(
1560 __isl_take isl_basic_set *bset,
1561 enum isl_dim_type type, unsigned first, unsigned n)
1563 return (isl_basic_set *)
1564 isl_basic_map_remove_dims((isl_basic_map *)bset, type, first, n);
1567 struct isl_map *isl_map_remove_dims(struct isl_map *map,
1568 enum isl_dim_type type, unsigned first, unsigned n)
1575 map = isl_map_cow(map);
1578 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
1580 for (i = 0; i < map->n; ++i) {
1581 map->p[i] = isl_basic_map_eliminate_vars(map->p[i],
1582 isl_basic_map_offset(map->p[i], type) - 1 + first, n);
1586 map = isl_map_drop(map, type, first, n);
1593 __isl_give isl_set *isl_set_remove_dims(__isl_take isl_set *bset,
1594 enum isl_dim_type type, unsigned first, unsigned n)
1596 return (isl_set *)isl_map_remove_dims((isl_map *)bset, type, first, n);
1599 /* Project out n inputs starting at first using Fourier-Motzkin */
1600 struct isl_map *isl_map_remove_inputs(struct isl_map *map,
1601 unsigned first, unsigned n)
1603 return isl_map_remove_dims(map, isl_dim_in, first, n);
1606 static void dump_term(struct isl_basic_map *bmap,
1607 isl_int c, int pos, FILE *out)
1610 unsigned in = isl_basic_map_n_in(bmap);
1611 unsigned dim = in + isl_basic_map_n_out(bmap);
1612 unsigned nparam = isl_basic_map_n_param(bmap);
1614 isl_int_print(out, c, 0);
1616 if (!isl_int_is_one(c))
1617 isl_int_print(out, c, 0);
1618 if (pos < 1 + nparam) {
1619 name = isl_dim_get_name(bmap->dim,
1620 isl_dim_param, pos - 1);
1622 fprintf(out, "%s", name);
1624 fprintf(out, "p%d", pos - 1);
1625 } else if (pos < 1 + nparam + in)
1626 fprintf(out, "i%d", pos - 1 - nparam);
1627 else if (pos < 1 + nparam + dim)
1628 fprintf(out, "o%d", pos - 1 - nparam - in);
1630 fprintf(out, "e%d", pos - 1 - nparam - dim);
1634 static void dump_constraint_sign(struct isl_basic_map *bmap, isl_int *c,
1635 int sign, FILE *out)
1639 unsigned len = 1 + isl_basic_map_total_dim(bmap);
1643 for (i = 0, first = 1; i < len; ++i) {
1644 if (isl_int_sgn(c[i]) * sign <= 0)
1647 fprintf(out, " + ");
1649 isl_int_abs(v, c[i]);
1650 dump_term(bmap, v, i, out);
1657 static void dump_constraint(struct isl_basic_map *bmap, isl_int *c,
1658 const char *op, FILE *out, int indent)
1662 fprintf(out, "%*s", indent, "");
1664 dump_constraint_sign(bmap, c, 1, out);
1665 fprintf(out, " %s ", op);
1666 dump_constraint_sign(bmap, c, -1, out);
1670 for (i = bmap->n_div; i < bmap->extra; ++i) {
1671 if (isl_int_is_zero(c[1+isl_dim_total(bmap->dim)+i]))
1673 fprintf(out, "%*s", indent, "");
1674 fprintf(out, "ERROR: unused div coefficient not zero\n");
1679 static void dump_constraints(struct isl_basic_map *bmap,
1680 isl_int **c, unsigned n,
1681 const char *op, FILE *out, int indent)
1685 for (i = 0; i < n; ++i)
1686 dump_constraint(bmap, c[i], op, out, indent);
1689 static void dump_affine(struct isl_basic_map *bmap, isl_int *exp, FILE *out)
1693 unsigned total = isl_basic_map_total_dim(bmap);
1695 for (j = 0; j < 1 + total; ++j) {
1696 if (isl_int_is_zero(exp[j]))
1698 if (!first && isl_int_is_pos(exp[j]))
1700 dump_term(bmap, exp[j], j, out);
1705 static void dump(struct isl_basic_map *bmap, FILE *out, int indent)
1709 dump_constraints(bmap, bmap->eq, bmap->n_eq, "=", out, indent);
1710 dump_constraints(bmap, bmap->ineq, bmap->n_ineq, ">=", out, indent);
1712 for (i = 0; i < bmap->n_div; ++i) {
1713 fprintf(out, "%*s", indent, "");
1714 fprintf(out, "e%d = [(", i);
1715 dump_affine(bmap, bmap->div[i]+1, out);
1717 isl_int_print(out, bmap->div[i][0], 0);
1718 fprintf(out, "]\n");
1722 void isl_basic_set_print_internal(struct isl_basic_set *bset,
1723 FILE *out, int indent)
1726 fprintf(out, "null basic set\n");
1730 fprintf(out, "%*s", indent, "");
1731 fprintf(out, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n",
1732 bset->ref, bset->dim->nparam, bset->dim->n_out,
1733 bset->extra, bset->flags);
1734 dump((struct isl_basic_map *)bset, out, indent);
1737 void isl_basic_map_print_internal(struct isl_basic_map *bmap,
1738 FILE *out, int indent)
1741 fprintf(out, "null basic map\n");
1745 fprintf(out, "%*s", indent, "");
1746 fprintf(out, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, "
1747 "flags: %x, n_name: %d\n",
1749 bmap->dim->nparam, bmap->dim->n_in, bmap->dim->n_out,
1750 bmap->extra, bmap->flags, bmap->dim->n_name);
1751 dump(bmap, out, indent);
1754 int isl_inequality_negate(struct isl_basic_map *bmap, unsigned pos)
1759 total = isl_basic_map_total_dim(bmap);
1760 isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
1761 isl_seq_neg(bmap->ineq[pos], bmap->ineq[pos], 1 + total);
1762 isl_int_sub_ui(bmap->ineq[pos][0], bmap->ineq[pos][0], 1);
1763 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1767 struct isl_set *isl_set_alloc_dim(struct isl_dim *dim, int n, unsigned flags)
1769 struct isl_set *set;
1773 isl_assert(dim->ctx, dim->n_in == 0, goto error);
1774 isl_assert(dim->ctx, n >= 0, goto error);
1775 set = isl_alloc(dim->ctx, struct isl_set,
1776 sizeof(struct isl_set) +
1777 (n - 1) * sizeof(struct isl_basic_set *));
1781 set->ctx = dim->ctx;
1782 isl_ctx_ref(set->ctx);
1794 struct isl_set *isl_set_alloc(struct isl_ctx *ctx,
1795 unsigned nparam, unsigned dim, int n, unsigned flags)
1797 struct isl_set *set;
1798 struct isl_dim *dims;
1800 dims = isl_dim_alloc(ctx, nparam, 0, dim);
1804 set = isl_set_alloc_dim(dims, n, flags);
1808 /* Make sure "map" has room for at least "n" more basic maps.
1810 struct isl_map *isl_map_grow(struct isl_map *map, int n)
1813 struct isl_map *grown = NULL;
1817 isl_assert(map->ctx, n >= 0, goto error);
1818 if (map->n + n <= map->size)
1820 grown = isl_map_alloc_dim(isl_map_get_dim(map), map->n + n, map->flags);
1823 for (i = 0; i < map->n; ++i) {
1824 grown->p[i] = isl_basic_map_copy(map->p[i]);
1832 isl_map_free(grown);
1837 /* Make sure "set" has room for at least "n" more basic sets.
1839 struct isl_set *isl_set_grow(struct isl_set *set, int n)
1841 return (struct isl_set *)isl_map_grow((struct isl_map *)set, n);
1844 struct isl_set *isl_set_dup(struct isl_set *set)
1847 struct isl_set *dup;
1852 dup = isl_set_alloc_dim(isl_dim_copy(set->dim), set->n, set->flags);
1855 for (i = 0; i < set->n; ++i)
1856 dup = isl_set_add_basic_set(dup, isl_basic_set_copy(set->p[i]));
1860 struct isl_set *isl_set_from_basic_set(struct isl_basic_set *bset)
1862 return isl_map_from_basic_map(bset);
1865 struct isl_map *isl_map_from_basic_map(struct isl_basic_map *bmap)
1867 struct isl_map *map;
1872 map = isl_map_alloc_dim(isl_dim_copy(bmap->dim), 1, ISL_MAP_DISJOINT);
1873 return isl_map_add_basic_map(map, bmap);
1876 __isl_give isl_set *isl_set_add_basic_set(__isl_take isl_set *set,
1877 __isl_take isl_basic_set *bset)
1879 return (struct isl_set *)isl_map_add_basic_map((struct isl_map *)set,
1880 (struct isl_basic_map *)bset);
1883 void isl_set_free(struct isl_set *set)
1893 isl_ctx_deref(set->ctx);
1894 for (i = 0; i < set->n; ++i)
1895 isl_basic_set_free(set->p[i]);
1896 isl_dim_free(set->dim);
1900 void isl_set_print_internal(struct isl_set *set, FILE *out, int indent)
1905 fprintf(out, "null set\n");
1909 fprintf(out, "%*s", indent, "");
1910 fprintf(out, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
1911 set->ref, set->n, set->dim->nparam, set->dim->n_out,
1913 for (i = 0; i < set->n; ++i) {
1914 fprintf(out, "%*s", indent, "");
1915 fprintf(out, "basic set %d:\n", i);
1916 isl_basic_set_print_internal(set->p[i], out, indent+4);
1920 void isl_map_print_internal(struct isl_map *map, FILE *out, int indent)
1925 fprintf(out, "null map\n");
1929 fprintf(out, "%*s", indent, "");
1930 fprintf(out, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, "
1931 "flags: %x, n_name: %d\n",
1932 map->ref, map->n, map->dim->nparam, map->dim->n_in,
1933 map->dim->n_out, map->flags, map->dim->n_name);
1934 for (i = 0; i < map->n; ++i) {
1935 fprintf(out, "%*s", indent, "");
1936 fprintf(out, "basic map %d:\n", i);
1937 isl_basic_map_print_internal(map->p[i], out, indent+4);
1941 struct isl_basic_map *isl_basic_map_intersect_domain(
1942 struct isl_basic_map *bmap, struct isl_basic_set *bset)
1944 struct isl_basic_map *bmap_domain;
1949 isl_assert(bset->ctx, isl_dim_match(bmap->dim, isl_dim_param,
1950 bset->dim, isl_dim_param), goto error);
1952 if (isl_dim_size(bset->dim, isl_dim_set) != 0)
1953 isl_assert(bset->ctx,
1954 isl_basic_map_compatible_domain(bmap, bset), goto error);
1956 bmap = isl_basic_map_cow(bmap);
1959 bmap = isl_basic_map_extend_dim(bmap, isl_dim_copy(bmap->dim),
1960 bset->n_div, bset->n_eq, bset->n_ineq);
1961 bmap_domain = isl_basic_map_from_domain(bset);
1962 bmap = add_constraints(bmap, bmap_domain, 0, 0);
1964 bmap = isl_basic_map_simplify(bmap);
1965 return isl_basic_map_finalize(bmap);
1967 isl_basic_map_free(bmap);
1968 isl_basic_set_free(bset);
1972 struct isl_basic_map *isl_basic_map_intersect_range(
1973 struct isl_basic_map *bmap, struct isl_basic_set *bset)
1975 struct isl_basic_map *bmap_range;
1980 isl_assert(bset->ctx, isl_dim_match(bmap->dim, isl_dim_param,
1981 bset->dim, isl_dim_param), goto error);
1983 if (isl_dim_size(bset->dim, isl_dim_set) != 0)
1984 isl_assert(bset->ctx,
1985 isl_basic_map_compatible_range(bmap, bset), goto error);
1987 if (isl_basic_set_is_universe(bset)) {
1988 isl_basic_set_free(bset);
1992 bmap = isl_basic_map_cow(bmap);
1995 bmap = isl_basic_map_extend_dim(bmap, isl_dim_copy(bmap->dim),
1996 bset->n_div, bset->n_eq, bset->n_ineq);
1997 bmap_range = isl_basic_map_from_basic_set(bset, isl_dim_copy(bset->dim));
1998 bmap = add_constraints(bmap, bmap_range, 0, 0);
2000 bmap = isl_basic_map_simplify(bmap);
2001 return isl_basic_map_finalize(bmap);
2003 isl_basic_map_free(bmap);
2004 isl_basic_set_free(bset);
2008 int isl_basic_map_contains(struct isl_basic_map *bmap, struct isl_vec *vec)
2014 total = 1 + isl_basic_map_total_dim(bmap);
2015 if (total != vec->size)
2020 for (i = 0; i < bmap->n_eq; ++i) {
2021 isl_seq_inner_product(vec->el, bmap->eq[i], total, &s);
2022 if (!isl_int_is_zero(s)) {
2028 for (i = 0; i < bmap->n_ineq; ++i) {
2029 isl_seq_inner_product(vec->el, bmap->ineq[i], total, &s);
2030 if (isl_int_is_neg(s)) {
2041 int isl_basic_set_contains(struct isl_basic_set *bset, struct isl_vec *vec)
2043 return isl_basic_map_contains((struct isl_basic_map *)bset, vec);
2046 struct isl_basic_map *isl_basic_map_intersect(
2047 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2049 struct isl_vec *sample = NULL;
2051 if (!bmap1 || !bmap2)
2054 isl_assert(bmap1->ctx, isl_dim_match(bmap1->dim, isl_dim_param,
2055 bmap2->dim, isl_dim_param), goto error);
2056 if (isl_dim_total(bmap1->dim) ==
2057 isl_dim_size(bmap1->dim, isl_dim_param) &&
2058 isl_dim_total(bmap2->dim) !=
2059 isl_dim_size(bmap2->dim, isl_dim_param))
2060 return isl_basic_map_intersect(bmap2, bmap1);
2062 if (isl_dim_total(bmap2->dim) !=
2063 isl_dim_size(bmap2->dim, isl_dim_param))
2064 isl_assert(bmap1->ctx,
2065 isl_dim_equal(bmap1->dim, bmap2->dim), goto error);
2067 if (bmap1->sample &&
2068 isl_basic_map_contains(bmap1, bmap1->sample) > 0 &&
2069 isl_basic_map_contains(bmap2, bmap1->sample) > 0)
2070 sample = isl_vec_copy(bmap1->sample);
2071 else if (bmap2->sample &&
2072 isl_basic_map_contains(bmap1, bmap2->sample) > 0 &&
2073 isl_basic_map_contains(bmap2, bmap2->sample) > 0)
2074 sample = isl_vec_copy(bmap2->sample);
2076 bmap1 = isl_basic_map_cow(bmap1);
2079 bmap1 = isl_basic_map_extend_dim(bmap1, isl_dim_copy(bmap1->dim),
2080 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
2081 bmap1 = add_constraints(bmap1, bmap2, 0, 0);
2084 isl_vec_free(sample);
2086 isl_vec_free(bmap1->sample);
2087 bmap1->sample = sample;
2090 bmap1 = isl_basic_map_simplify(bmap1);
2091 return isl_basic_map_finalize(bmap1);
2094 isl_vec_free(sample);
2095 isl_basic_map_free(bmap1);
2096 isl_basic_map_free(bmap2);
2100 struct isl_basic_set *isl_basic_set_intersect(
2101 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
2103 return (struct isl_basic_set *)
2104 isl_basic_map_intersect(
2105 (struct isl_basic_map *)bset1,
2106 (struct isl_basic_map *)bset2);
2109 /* Special case of isl_map_intersect, where both map1 and map2
2110 * are convex, without any divs and such that either map1 or map2
2111 * contains a single constraint. This constraint is then simply
2112 * added to the other map.
2114 static __isl_give isl_map *map_intersect_add_constraint(
2115 __isl_take isl_map *map1, __isl_take isl_map *map2)
2117 struct isl_basic_map *bmap1;
2118 struct isl_basic_map *bmap2;
2120 isl_assert(map1->ctx, map1->n == 1, goto error);
2121 isl_assert(map2->ctx, map1->n == 1, goto error);
2122 isl_assert(map1->ctx, map1->p[0]->n_div == 0, goto error);
2123 isl_assert(map2->ctx, map1->p[0]->n_div == 0, goto error);
2125 if (map2->p[0]->n_eq + map2->p[0]->n_ineq != 1)
2126 return isl_map_intersect(map2, map1);
2128 isl_assert(map2->ctx,
2129 map2->p[0]->n_eq + map2->p[0]->n_ineq == 1, goto error);
2131 map1 = isl_map_cow(map1);
2134 if (isl_map_plain_is_empty(map1)) {
2138 map1->p[0] = isl_basic_map_cow(map1->p[0]);
2139 if (map2->p[0]->n_eq == 1)
2140 map1->p[0] = isl_basic_map_add_eq(map1->p[0], map2->p[0]->eq[0]);
2142 map1->p[0] = isl_basic_map_add_ineq(map1->p[0],
2143 map2->p[0]->ineq[0]);
2145 map1->p[0] = isl_basic_map_simplify(map1->p[0]);
2146 map1->p[0] = isl_basic_map_finalize(map1->p[0]);
2150 if (isl_basic_map_plain_is_empty(map1->p[0])) {
2151 isl_basic_map_free(map1->p[0]);
2164 struct isl_map *isl_map_intersect(struct isl_map *map1, struct isl_map *map2)
2167 struct isl_map *result;
2173 if (isl_map_plain_is_empty(map1)) {
2177 if (isl_map_plain_is_empty(map2)) {
2182 if (map1->n == 1 && map2->n == 1 &&
2183 map1->p[0]->n_div == 0 && map2->p[0]->n_div == 0 &&
2184 isl_dim_equal(map1->dim, map2->dim) &&
2185 (map1->p[0]->n_eq + map1->p[0]->n_ineq == 1 ||
2186 map2->p[0]->n_eq + map2->p[0]->n_ineq == 1))
2187 return map_intersect_add_constraint(map1, map2);
2188 isl_assert(map1->ctx, isl_dim_match(map1->dim, isl_dim_param,
2189 map2->dim, isl_dim_param), goto error);
2190 if (isl_dim_total(map1->dim) ==
2191 isl_dim_size(map1->dim, isl_dim_param) &&
2192 isl_dim_total(map2->dim) != isl_dim_size(map2->dim, isl_dim_param))
2193 return isl_map_intersect(map2, map1);
2195 if (isl_dim_total(map2->dim) != isl_dim_size(map2->dim, isl_dim_param))
2196 isl_assert(map1->ctx,
2197 isl_dim_equal(map1->dim, map2->dim), goto error);
2199 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
2200 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
2201 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
2203 result = isl_map_alloc_dim(isl_dim_copy(map1->dim),
2204 map1->n * map2->n, flags);
2207 for (i = 0; i < map1->n; ++i)
2208 for (j = 0; j < map2->n; ++j) {
2209 struct isl_basic_map *part;
2210 part = isl_basic_map_intersect(
2211 isl_basic_map_copy(map1->p[i]),
2212 isl_basic_map_copy(map2->p[j]));
2213 if (isl_basic_map_is_empty(part))
2214 isl_basic_map_free(part);
2216 result = isl_map_add_basic_map(result, part);
2229 struct isl_set *isl_set_intersect(struct isl_set *set1, struct isl_set *set2)
2231 return (struct isl_set *)
2232 isl_map_intersect((struct isl_map *)set1,
2233 (struct isl_map *)set2);
2236 struct isl_basic_map *isl_basic_map_reverse(struct isl_basic_map *bmap)
2238 struct isl_dim *dim;
2239 struct isl_basic_set *bset;
2244 bmap = isl_basic_map_cow(bmap);
2247 dim = isl_dim_reverse(isl_dim_copy(bmap->dim));
2248 in = isl_basic_map_n_in(bmap);
2249 bset = isl_basic_set_from_basic_map(bmap);
2250 bset = isl_basic_set_swap_vars(bset, in);
2251 return isl_basic_map_from_basic_set(bset, dim);
2254 __isl_give isl_basic_map *isl_basic_map_insert(__isl_take isl_basic_map *bmap,
2255 enum isl_dim_type type, unsigned pos, unsigned n)
2257 struct isl_dim *res_dim;
2258 struct isl_basic_map *res;
2259 struct isl_dim_map *dim_map;
2260 unsigned total, off;
2261 enum isl_dim_type t;
2269 res_dim = isl_dim_insert(isl_basic_map_get_dim(bmap), type, pos, n);
2271 total = isl_basic_map_total_dim(bmap) + n;
2272 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2274 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
2276 isl_dim_map_dim(dim_map, bmap->dim, t, off);
2278 unsigned size = isl_basic_map_dim(bmap, t);
2279 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2281 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2282 pos, size - pos, off + pos + n);
2284 off += isl_dim_size(res_dim, t);
2286 isl_dim_map_div(dim_map, bmap, off);
2288 res = isl_basic_map_alloc_dim(res_dim,
2289 bmap->n_div, bmap->n_eq, bmap->n_ineq);
2290 if (isl_basic_map_is_rational(bmap))
2291 res = isl_basic_map_set_rational(res);
2292 res = isl_basic_map_add_constraints_dim_map(res, bmap, dim_map);
2293 return isl_basic_map_finalize(res);
2296 __isl_give isl_basic_map *isl_basic_map_add(__isl_take isl_basic_map *bmap,
2297 enum isl_dim_type type, unsigned n)
2301 return isl_basic_map_insert(bmap, type,
2302 isl_basic_map_dim(bmap, type), n);
2305 __isl_give isl_basic_set *isl_basic_set_add(__isl_take isl_basic_set *bset,
2306 enum isl_dim_type type, unsigned n)
2310 isl_assert(bset->ctx, type != isl_dim_in, goto error);
2311 return (isl_basic_set *)isl_basic_map_add((isl_basic_map *)bset, type, n);
2313 isl_basic_set_free(bset);
2317 __isl_give isl_map *isl_map_insert(__isl_take isl_map *map,
2318 enum isl_dim_type type, unsigned pos, unsigned n)
2325 map = isl_map_cow(map);
2329 map->dim = isl_dim_insert(map->dim, type, pos, n);
2333 for (i = 0; i < map->n; ++i) {
2334 map->p[i] = isl_basic_map_insert(map->p[i], type, pos, n);
2345 __isl_give isl_set *isl_set_insert(__isl_take isl_set *set,
2346 enum isl_dim_type type, unsigned pos, unsigned n)
2348 return (isl_set *)isl_map_insert((isl_map *)set, type, pos, n);
2351 __isl_give isl_map *isl_map_add_dims(__isl_take isl_map *map,
2352 enum isl_dim_type type, unsigned n)
2356 return isl_map_insert(map, type, isl_map_dim(map, type), n);
2359 __isl_give isl_set *isl_set_add_dims(__isl_take isl_set *set,
2360 enum isl_dim_type type, unsigned n)
2364 isl_assert(set->ctx, type != isl_dim_in, goto error);
2365 return (isl_set *)isl_map_add_dims((isl_map *)set, type, n);
2371 __isl_give isl_basic_map *isl_basic_map_move_dims(
2372 __isl_take isl_basic_map *bmap,
2373 enum isl_dim_type dst_type, unsigned dst_pos,
2374 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2377 struct isl_dim_map *dim_map;
2378 struct isl_basic_map *res;
2379 enum isl_dim_type t;
2380 unsigned total, off;
2387 isl_assert(bmap->ctx, src_pos + n <= isl_basic_map_dim(bmap, src_type),
2390 if (dst_type == src_type && dst_pos == src_pos)
2393 isl_assert(bmap->ctx, dst_type != src_type, goto error);
2395 if (pos(bmap->dim, dst_type) + dst_pos ==
2396 pos(bmap->dim, src_type) + src_pos +
2397 ((src_type < dst_type) ? n : 0)) {
2398 bmap = isl_basic_map_cow(bmap);
2402 bmap->dim = isl_dim_move(bmap->dim, dst_type, dst_pos,
2403 src_type, src_pos, n);
2407 bmap = isl_basic_map_finalize(bmap);
2412 total = isl_basic_map_total_dim(bmap);
2413 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2416 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
2417 unsigned size = isl_dim_size(bmap->dim, t);
2418 if (t == dst_type) {
2419 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2422 isl_dim_map_dim_range(dim_map, bmap->dim, src_type,
2425 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2426 dst_pos, size - dst_pos, off);
2427 off += size - dst_pos;
2428 } else if (t == src_type) {
2429 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2432 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2433 src_pos + n, size - src_pos - n, off);
2434 off += size - src_pos - n;
2436 isl_dim_map_dim(dim_map, bmap->dim, t, off);
2440 isl_dim_map_div(dim_map, bmap, off);
2442 res = isl_basic_map_alloc_dim(isl_basic_map_get_dim(bmap),
2443 bmap->n_div, bmap->n_eq, bmap->n_ineq);
2444 bmap = isl_basic_map_add_constraints_dim_map(res, bmap, dim_map);
2446 bmap->dim = isl_dim_move(bmap->dim, dst_type, dst_pos,
2447 src_type, src_pos, n);
2451 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
2452 bmap = isl_basic_map_gauss(bmap, NULL);
2453 bmap = isl_basic_map_finalize(bmap);
2457 isl_basic_map_free(bmap);
2461 __isl_give isl_basic_set *isl_basic_set_move_dims(__isl_take isl_basic_set *bset,
2462 enum isl_dim_type dst_type, unsigned dst_pos,
2463 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2465 return (isl_basic_set *)isl_basic_map_move_dims(
2466 (isl_basic_map *)bset, dst_type, dst_pos, src_type, src_pos, n);
2469 __isl_give isl_set *isl_set_move_dims(__isl_take isl_set *set,
2470 enum isl_dim_type dst_type, unsigned dst_pos,
2471 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2475 isl_assert(set->ctx, dst_type != isl_dim_in, goto error);
2476 return (isl_set *)isl_map_move_dims((isl_map *)set, dst_type, dst_pos,
2477 src_type, src_pos, n);
2483 __isl_give isl_map *isl_map_move_dims(__isl_take isl_map *map,
2484 enum isl_dim_type dst_type, unsigned dst_pos,
2485 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2494 isl_assert(map->ctx, src_pos + n <= isl_map_dim(map, src_type),
2497 if (dst_type == src_type && dst_pos == src_pos)
2500 isl_assert(map->ctx, dst_type != src_type, goto error);
2502 map = isl_map_cow(map);
2506 map->dim = isl_dim_move(map->dim, dst_type, dst_pos, src_type, src_pos, n);
2510 for (i = 0; i < map->n; ++i) {
2511 map->p[i] = isl_basic_map_move_dims(map->p[i],
2513 src_type, src_pos, n);
2524 /* Move the specified dimensions to the last columns right before
2525 * the divs. Don't change the dimension specification of bmap.
2526 * That's the responsibility of the caller.
2528 static __isl_give isl_basic_map *move_last(__isl_take isl_basic_map *bmap,
2529 enum isl_dim_type type, unsigned first, unsigned n)
2531 struct isl_dim_map *dim_map;
2532 struct isl_basic_map *res;
2533 enum isl_dim_type t;
2534 unsigned total, off;
2538 if (pos(bmap->dim, type) + first + n == 1 + isl_dim_total(bmap->dim))
2541 total = isl_basic_map_total_dim(bmap);
2542 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2545 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
2546 unsigned size = isl_dim_size(bmap->dim, t);
2548 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2551 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2552 first, n, total - bmap->n_div - n);
2553 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2554 first + n, size - (first + n), off);
2555 off += size - (first + n);
2557 isl_dim_map_dim(dim_map, bmap->dim, t, off);
2561 isl_dim_map_div(dim_map, bmap, off + n);
2563 res = isl_basic_map_alloc_dim(isl_basic_map_get_dim(bmap),
2564 bmap->n_div, bmap->n_eq, bmap->n_ineq);
2565 res = isl_basic_map_add_constraints_dim_map(res, bmap, dim_map);
2569 /* Turn the n dimensions of type type, starting at first
2570 * into existentially quantified variables.
2572 __isl_give isl_basic_map *isl_basic_map_project_out(
2573 __isl_take isl_basic_map *bmap,
2574 enum isl_dim_type type, unsigned first, unsigned n)
2587 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL))
2588 return isl_basic_map_remove_dims(bmap, type, first, n);
2590 isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
2593 bmap = move_last(bmap, type, first, n);
2594 bmap = isl_basic_map_cow(bmap);
2598 row_size = 1 + isl_dim_total(bmap->dim) + bmap->extra;
2599 old = bmap->block2.data;
2600 bmap->block2 = isl_blk_extend(bmap->ctx, bmap->block2,
2601 (bmap->extra + n) * (1 + row_size));
2602 if (!bmap->block2.data)
2604 new_div = isl_alloc_array(bmap->ctx, isl_int *, bmap->extra + n);
2607 for (i = 0; i < n; ++i) {
2608 new_div[i] = bmap->block2.data +
2609 (bmap->extra + i) * (1 + row_size);
2610 isl_seq_clr(new_div[i], 1 + row_size);
2612 for (i = 0; i < bmap->extra; ++i)
2613 new_div[n + i] = bmap->block2.data + (bmap->div[i] - old);
2615 bmap->div = new_div;
2619 bmap->dim = isl_dim_drop(bmap->dim, type, first, n);
2622 bmap = isl_basic_map_simplify(bmap);
2623 bmap = isl_basic_map_drop_redundant_divs(bmap);
2624 return isl_basic_map_finalize(bmap);
2626 isl_basic_map_free(bmap);
2630 /* Turn the n dimensions of type type, starting at first
2631 * into existentially quantified variables.
2633 struct isl_basic_set *isl_basic_set_project_out(struct isl_basic_set *bset,
2634 enum isl_dim_type type, unsigned first, unsigned n)
2636 return (isl_basic_set *)isl_basic_map_project_out(
2637 (isl_basic_map *)bset, type, first, n);
2640 /* Turn the n dimensions of type type, starting at first
2641 * into existentially quantified variables.
2643 __isl_give isl_map *isl_map_project_out(__isl_take isl_map *map,
2644 enum isl_dim_type type, unsigned first, unsigned n)
2654 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
2656 map = isl_map_cow(map);
2660 map->dim = isl_dim_drop(map->dim, type, first, n);
2664 for (i = 0; i < map->n; ++i) {
2665 map->p[i] = isl_basic_map_project_out(map->p[i], type, first, n);
2676 /* Turn the n dimensions of type type, starting at first
2677 * into existentially quantified variables.
2679 __isl_give isl_set *isl_set_project_out(__isl_take isl_set *set,
2680 enum isl_dim_type type, unsigned first, unsigned n)
2682 return (isl_set *)isl_map_project_out((isl_map *)set, type, first, n);
2685 static struct isl_basic_map *add_divs(struct isl_basic_map *bmap, unsigned n)
2689 for (i = 0; i < n; ++i) {
2690 j = isl_basic_map_alloc_div(bmap);
2693 isl_seq_clr(bmap->div[j], 1+1+isl_basic_map_total_dim(bmap));
2697 isl_basic_map_free(bmap);
2701 struct isl_basic_map *isl_basic_map_apply_range(
2702 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2704 struct isl_dim *dim_result = NULL;
2705 struct isl_basic_map *bmap;
2706 unsigned n_in, n_out, n, nparam, total, pos;
2707 struct isl_dim_map *dim_map1, *dim_map2;
2709 if (!bmap1 || !bmap2)
2712 dim_result = isl_dim_join(isl_dim_copy(bmap1->dim),
2713 isl_dim_copy(bmap2->dim));
2715 n_in = isl_basic_map_n_in(bmap1);
2716 n_out = isl_basic_map_n_out(bmap2);
2717 n = isl_basic_map_n_out(bmap1);
2718 nparam = isl_basic_map_n_param(bmap1);
2720 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + n;
2721 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
2722 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
2723 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
2724 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
2725 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
2726 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_in);
2727 isl_dim_map_div(dim_map1, bmap1, pos += n_out);
2728 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
2729 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
2730 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
2732 bmap = isl_basic_map_alloc_dim(dim_result,
2733 bmap1->n_div + bmap2->n_div + n,
2734 bmap1->n_eq + bmap2->n_eq,
2735 bmap1->n_ineq + bmap2->n_ineq);
2736 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap1, dim_map1);
2737 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap2, dim_map2);
2738 bmap = add_divs(bmap, n);
2739 bmap = isl_basic_map_simplify(bmap);
2740 bmap = isl_basic_map_drop_redundant_divs(bmap);
2741 return isl_basic_map_finalize(bmap);
2743 isl_basic_map_free(bmap1);
2744 isl_basic_map_free(bmap2);
2748 struct isl_basic_set *isl_basic_set_apply(
2749 struct isl_basic_set *bset, struct isl_basic_map *bmap)
2754 isl_assert(bset->ctx, isl_basic_map_compatible_domain(bmap, bset),
2757 return (struct isl_basic_set *)
2758 isl_basic_map_apply_range((struct isl_basic_map *)bset, bmap);
2760 isl_basic_set_free(bset);
2761 isl_basic_map_free(bmap);
2765 struct isl_basic_map *isl_basic_map_apply_domain(
2766 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2768 if (!bmap1 || !bmap2)
2771 isl_assert(bmap1->ctx,
2772 isl_basic_map_n_in(bmap1) == isl_basic_map_n_in(bmap2), goto error);
2773 isl_assert(bmap1->ctx,
2774 isl_basic_map_n_param(bmap1) == isl_basic_map_n_param(bmap2),
2777 bmap1 = isl_basic_map_reverse(bmap1);
2778 bmap1 = isl_basic_map_apply_range(bmap1, bmap2);
2779 return isl_basic_map_reverse(bmap1);
2781 isl_basic_map_free(bmap1);
2782 isl_basic_map_free(bmap2);
2786 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
2787 * A \cap B -> f(A) + f(B)
2789 struct isl_basic_map *isl_basic_map_sum(
2790 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2792 unsigned n_in, n_out, nparam, total, pos;
2793 struct isl_basic_map *bmap = NULL;
2794 struct isl_dim_map *dim_map1, *dim_map2;
2797 if (!bmap1 || !bmap2)
2800 isl_assert(bmap1->ctx, isl_dim_equal(bmap1->dim, bmap2->dim),
2803 nparam = isl_basic_map_n_param(bmap1);
2804 n_in = isl_basic_map_n_in(bmap1);
2805 n_out = isl_basic_map_n_out(bmap1);
2807 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + 2 * n_out;
2808 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
2809 dim_map2 = isl_dim_map_alloc(bmap2->ctx, total);
2810 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
2811 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos);
2812 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
2813 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
2814 isl_dim_map_div(dim_map1, bmap1, pos += n_in + n_out);
2815 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
2816 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
2817 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_out);
2819 bmap = isl_basic_map_alloc_dim(isl_dim_copy(bmap1->dim),
2820 bmap1->n_div + bmap2->n_div + 2 * n_out,
2821 bmap1->n_eq + bmap2->n_eq + n_out,
2822 bmap1->n_ineq + bmap2->n_ineq);
2823 for (i = 0; i < n_out; ++i) {
2824 int j = isl_basic_map_alloc_equality(bmap);
2827 isl_seq_clr(bmap->eq[j], 1+total);
2828 isl_int_set_si(bmap->eq[j][1+nparam+n_in+i], -1);
2829 isl_int_set_si(bmap->eq[j][1+pos+i], 1);
2830 isl_int_set_si(bmap->eq[j][1+pos-n_out+i], 1);
2832 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap1, dim_map1);
2833 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap2, dim_map2);
2834 bmap = add_divs(bmap, 2 * n_out);
2836 bmap = isl_basic_map_simplify(bmap);
2837 return isl_basic_map_finalize(bmap);
2839 isl_basic_map_free(bmap);
2840 isl_basic_map_free(bmap1);
2841 isl_basic_map_free(bmap2);
2845 /* Given two maps A -> f(A) and B -> g(B), construct a map
2846 * A \cap B -> f(A) + f(B)
2848 struct isl_map *isl_map_sum(struct isl_map *map1, struct isl_map *map2)
2850 struct isl_map *result;
2856 isl_assert(map1->ctx, isl_dim_equal(map1->dim, map2->dim), goto error);
2858 result = isl_map_alloc_dim(isl_dim_copy(map1->dim),
2859 map1->n * map2->n, 0);
2862 for (i = 0; i < map1->n; ++i)
2863 for (j = 0; j < map2->n; ++j) {
2864 struct isl_basic_map *part;
2865 part = isl_basic_map_sum(
2866 isl_basic_map_copy(map1->p[i]),
2867 isl_basic_map_copy(map2->p[j]));
2868 if (isl_basic_map_is_empty(part))
2869 isl_basic_map_free(part);
2871 result = isl_map_add_basic_map(result, part);
2884 __isl_give isl_set *isl_set_sum(__isl_take isl_set *set1,
2885 __isl_take isl_set *set2)
2887 return (isl_set *)isl_map_sum((isl_map *)set1, (isl_map *)set2);
2890 /* Given a basic map A -> f(A), construct A -> -f(A).
2892 struct isl_basic_map *isl_basic_map_neg(struct isl_basic_map *bmap)
2897 bmap = isl_basic_map_cow(bmap);
2901 n = isl_basic_map_dim(bmap, isl_dim_out);
2902 off = isl_basic_map_offset(bmap, isl_dim_out);
2903 for (i = 0; i < bmap->n_eq; ++i)
2904 for (j = 0; j < n; ++j)
2905 isl_int_neg(bmap->eq[i][off+j], bmap->eq[i][off+j]);
2906 for (i = 0; i < bmap->n_ineq; ++i)
2907 for (j = 0; j < n; ++j)
2908 isl_int_neg(bmap->ineq[i][off+j], bmap->ineq[i][off+j]);
2909 for (i = 0; i < bmap->n_div; ++i)
2910 for (j = 0; j < n; ++j)
2911 isl_int_neg(bmap->div[i][1+off+j], bmap->div[i][1+off+j]);
2912 return isl_basic_map_finalize(bmap);
2915 __isl_give isl_basic_set *isl_basic_set_neg(__isl_take isl_basic_set *bset)
2917 return isl_basic_map_neg(bset);
2920 /* Given a map A -> f(A), construct A -> -f(A).
2922 struct isl_map *isl_map_neg(struct isl_map *map)
2926 map = isl_map_cow(map);
2930 for (i = 0; i < map->n; ++i) {
2931 map->p[i] = isl_basic_map_neg(map->p[i]);
2942 __isl_give isl_set *isl_set_neg(__isl_take isl_set *set)
2944 return (isl_set *)isl_map_neg((isl_map *)set);
2947 /* Given a basic map A -> f(A) and an integer d, construct a basic map
2948 * A -> floor(f(A)/d).
2950 struct isl_basic_map *isl_basic_map_floordiv(struct isl_basic_map *bmap,
2953 unsigned n_in, n_out, nparam, total, pos;
2954 struct isl_basic_map *result = NULL;
2955 struct isl_dim_map *dim_map;
2961 nparam = isl_basic_map_n_param(bmap);
2962 n_in = isl_basic_map_n_in(bmap);
2963 n_out = isl_basic_map_n_out(bmap);
2965 total = nparam + n_in + n_out + bmap->n_div + n_out;
2966 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2967 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_param, pos = 0);
2968 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_in, pos += nparam);
2969 isl_dim_map_div(dim_map, bmap, pos += n_in + n_out);
2970 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_out, pos += bmap->n_div);
2972 result = isl_basic_map_alloc_dim(isl_dim_copy(bmap->dim),
2973 bmap->n_div + n_out,
2974 bmap->n_eq, bmap->n_ineq + 2 * n_out);
2975 result = isl_basic_map_add_constraints_dim_map(result, bmap, dim_map);
2976 result = add_divs(result, n_out);
2977 for (i = 0; i < n_out; ++i) {
2979 j = isl_basic_map_alloc_inequality(result);
2982 isl_seq_clr(result->ineq[j], 1+total);
2983 isl_int_neg(result->ineq[j][1+nparam+n_in+i], d);
2984 isl_int_set_si(result->ineq[j][1+pos+i], 1);
2985 j = isl_basic_map_alloc_inequality(result);
2988 isl_seq_clr(result->ineq[j], 1+total);
2989 isl_int_set(result->ineq[j][1+nparam+n_in+i], d);
2990 isl_int_set_si(result->ineq[j][1+pos+i], -1);
2991 isl_int_sub_ui(result->ineq[j][0], d, 1);
2994 result = isl_basic_map_simplify(result);
2995 return isl_basic_map_finalize(result);
2997 isl_basic_map_free(result);
3001 /* Given a map A -> f(A) and an integer d, construct a map
3002 * A -> floor(f(A)/d).
3004 struct isl_map *isl_map_floordiv(struct isl_map *map, isl_int d)
3008 map = isl_map_cow(map);
3012 ISL_F_CLR(map, ISL_MAP_DISJOINT);
3013 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3014 for (i = 0; i < map->n; ++i) {
3015 map->p[i] = isl_basic_map_floordiv(map->p[i], d);
3026 static struct isl_basic_map *var_equal(struct isl_basic_map *bmap, unsigned pos)
3032 i = isl_basic_map_alloc_equality(bmap);
3035 nparam = isl_basic_map_n_param(bmap);
3036 n_in = isl_basic_map_n_in(bmap);
3037 isl_seq_clr(bmap->eq[i], 1 + isl_basic_map_total_dim(bmap));
3038 isl_int_set_si(bmap->eq[i][1+nparam+pos], -1);
3039 isl_int_set_si(bmap->eq[i][1+nparam+n_in+pos], 1);
3040 return isl_basic_map_finalize(bmap);
3042 isl_basic_map_free(bmap);
3046 /* Add a constraints to "bmap" expressing i_pos < o_pos
3048 static struct isl_basic_map *var_less(struct isl_basic_map *bmap, unsigned pos)
3054 i = isl_basic_map_alloc_inequality(bmap);
3057 nparam = isl_basic_map_n_param(bmap);
3058 n_in = isl_basic_map_n_in(bmap);
3059 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
3060 isl_int_set_si(bmap->ineq[i][0], -1);
3061 isl_int_set_si(bmap->ineq[i][1+nparam+pos], -1);
3062 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], 1);
3063 return isl_basic_map_finalize(bmap);
3065 isl_basic_map_free(bmap);
3069 /* Add a constraint to "bmap" expressing i_pos <= o_pos
3071 static __isl_give isl_basic_map *var_less_or_equal(
3072 __isl_take isl_basic_map *bmap, unsigned pos)
3078 i = isl_basic_map_alloc_inequality(bmap);
3081 nparam = isl_basic_map_n_param(bmap);
3082 n_in = isl_basic_map_n_in(bmap);
3083 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
3084 isl_int_set_si(bmap->ineq[i][1+nparam+pos], -1);
3085 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], 1);
3086 return isl_basic_map_finalize(bmap);
3088 isl_basic_map_free(bmap);
3092 /* Add a constraints to "bmap" expressing i_pos > o_pos
3094 static struct isl_basic_map *var_more(struct isl_basic_map *bmap, unsigned pos)
3100 i = isl_basic_map_alloc_inequality(bmap);
3103 nparam = isl_basic_map_n_param(bmap);
3104 n_in = isl_basic_map_n_in(bmap);
3105 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
3106 isl_int_set_si(bmap->ineq[i][0], -1);
3107 isl_int_set_si(bmap->ineq[i][1+nparam+pos], 1);
3108 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], -1);
3109 return isl_basic_map_finalize(bmap);
3111 isl_basic_map_free(bmap);
3115 /* Add a constraint to "bmap" expressing i_pos >= o_pos
3117 static __isl_give isl_basic_map *var_more_or_equal(
3118 __isl_take isl_basic_map *bmap, unsigned pos)
3124 i = isl_basic_map_alloc_inequality(bmap);
3127 nparam = isl_basic_map_n_param(bmap);
3128 n_in = isl_basic_map_n_in(bmap);
3129 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
3130 isl_int_set_si(bmap->ineq[i][1+nparam+pos], 1);
3131 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], -1);
3132 return isl_basic_map_finalize(bmap);
3134 isl_basic_map_free(bmap);
3138 struct isl_basic_map *isl_basic_map_equal(struct isl_dim *dim, unsigned n_equal)
3141 struct isl_basic_map *bmap;
3142 bmap = isl_basic_map_alloc_dim(dim, 0, n_equal, 0);
3145 for (i = 0; i < n_equal && bmap; ++i)
3146 bmap = var_equal(bmap, i);
3147 return isl_basic_map_finalize(bmap);
3150 /* Return a relation on of dimension "dim" expressing i_[0..pos] << o_[0..pos]
3152 struct isl_basic_map *isl_basic_map_less_at(struct isl_dim *dim, unsigned pos)
3155 struct isl_basic_map *bmap;
3156 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
3159 for (i = 0; i < pos && bmap; ++i)
3160 bmap = var_equal(bmap, i);
3162 bmap = var_less(bmap, pos);
3163 return isl_basic_map_finalize(bmap);
3166 /* Return a relation on of dimension "dim" expressing i_[0..pos] <<= o_[0..pos]
3168 __isl_give isl_basic_map *isl_basic_map_less_or_equal_at(
3169 __isl_take isl_dim *dim, unsigned pos)
3172 isl_basic_map *bmap;
3174 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
3175 for (i = 0; i < pos; ++i)
3176 bmap = var_equal(bmap, i);
3177 bmap = var_less_or_equal(bmap, pos);
3178 return isl_basic_map_finalize(bmap);
3181 /* Return a relation on pairs of sets of dimension "dim" expressing i_pos > o_pos
3183 struct isl_basic_map *isl_basic_map_more_at(struct isl_dim *dim, unsigned pos)
3186 struct isl_basic_map *bmap;
3187 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
3190 for (i = 0; i < pos && bmap; ++i)
3191 bmap = var_equal(bmap, i);
3193 bmap = var_more(bmap, pos);
3194 return isl_basic_map_finalize(bmap);
3197 /* Return a relation on of dimension "dim" expressing i_[0..pos] >>= o_[0..pos]
3199 __isl_give isl_basic_map *isl_basic_map_more_or_equal_at(
3200 __isl_take isl_dim *dim, unsigned pos)
3203 isl_basic_map *bmap;
3205 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
3206 for (i = 0; i < pos; ++i)
3207 bmap = var_equal(bmap, i);
3208 bmap = var_more_or_equal(bmap, pos);
3209 return isl_basic_map_finalize(bmap);
3212 static __isl_give isl_map *map_lex_lte_first(__isl_take isl_dim *dims,
3213 unsigned n, int equal)
3215 struct isl_map *map;
3218 if (n == 0 && equal)
3219 return isl_map_universe(dims);
3221 map = isl_map_alloc_dim(isl_dim_copy(dims), n, ISL_MAP_DISJOINT);
3223 for (i = 0; i + 1 < n; ++i)
3224 map = isl_map_add_basic_map(map,
3225 isl_basic_map_less_at(isl_dim_copy(dims), i));
3228 map = isl_map_add_basic_map(map,
3229 isl_basic_map_less_or_equal_at(dims, n - 1));
3231 map = isl_map_add_basic_map(map,
3232 isl_basic_map_less_at(dims, n - 1));
3239 static __isl_give isl_map *map_lex_lte(__isl_take isl_dim *dims, int equal)
3243 return map_lex_lte_first(dims, dims->n_out, equal);
3246 __isl_give isl_map *isl_map_lex_lt_first(__isl_take isl_dim *dim, unsigned n)
3248 return map_lex_lte_first(dim, n, 0);
3251 __isl_give isl_map *isl_map_lex_le_first(__isl_take isl_dim *dim, unsigned n)
3253 return map_lex_lte_first(dim, n, 1);
3256 __isl_give isl_map *isl_map_lex_lt(__isl_take isl_dim *set_dim)
3258 return map_lex_lte(isl_dim_map_from_set(set_dim), 0);
3261 __isl_give isl_map *isl_map_lex_le(__isl_take isl_dim *set_dim)
3263 return map_lex_lte(isl_dim_map_from_set(set_dim), 1);
3266 static __isl_give isl_map *map_lex_gte_first(__isl_take isl_dim *dims,
3267 unsigned n, int equal)
3269 struct isl_map *map;
3272 if (n == 0 && equal)
3273 return isl_map_universe(dims);
3275 map = isl_map_alloc_dim(isl_dim_copy(dims), n, ISL_MAP_DISJOINT);
3277 for (i = 0; i + 1 < n; ++i)
3278 map = isl_map_add_basic_map(map,
3279 isl_basic_map_more_at(isl_dim_copy(dims), i));
3282 map = isl_map_add_basic_map(map,
3283 isl_basic_map_more_or_equal_at(dims, n - 1));
3285 map = isl_map_add_basic_map(map,
3286 isl_basic_map_more_at(dims, n - 1));
3293 static __isl_give isl_map *map_lex_gte(__isl_take isl_dim *dims, int equal)
3297 return map_lex_gte_first(dims, dims->n_out, equal);
3300 __isl_give isl_map *isl_map_lex_gt_first(__isl_take isl_dim *dim, unsigned n)
3302 return map_lex_gte_first(dim, n, 0);
3305 __isl_give isl_map *isl_map_lex_ge_first(__isl_take isl_dim *dim, unsigned n)
3307 return map_lex_gte_first(dim, n, 1);
3310 __isl_give isl_map *isl_map_lex_gt(__isl_take isl_dim *set_dim)
3312 return map_lex_gte(isl_dim_map_from_set(set_dim), 0);
3315 __isl_give isl_map *isl_map_lex_ge(__isl_take isl_dim *set_dim)
3317 return map_lex_gte(isl_dim_map_from_set(set_dim), 1);
3320 __isl_give isl_map *isl_set_lex_le_set(__isl_take isl_set *set1,
3321 __isl_take isl_set *set2)
3324 map = isl_map_lex_le(isl_set_get_dim(set1));
3325 map = isl_map_intersect_domain(map, set1);
3326 map = isl_map_intersect_range(map, set2);
3330 __isl_give isl_map *isl_set_lex_lt_set(__isl_take isl_set *set1,
3331 __isl_take isl_set *set2)
3334 map = isl_map_lex_lt(isl_set_get_dim(set1));
3335 map = isl_map_intersect_domain(map, set1);
3336 map = isl_map_intersect_range(map, set2);
3340 __isl_give isl_map *isl_set_lex_ge_set(__isl_take isl_set *set1,
3341 __isl_take isl_set *set2)
3344 map = isl_map_lex_ge(isl_set_get_dim(set1));
3345 map = isl_map_intersect_domain(map, set1);
3346 map = isl_map_intersect_range(map, set2);
3350 __isl_give isl_map *isl_set_lex_gt_set(__isl_take isl_set *set1,
3351 __isl_take isl_set *set2)
3354 map = isl_map_lex_gt(isl_set_get_dim(set1));
3355 map = isl_map_intersect_domain(map, set1);
3356 map = isl_map_intersect_range(map, set2);
3360 __isl_give isl_map *isl_map_lex_le_map(__isl_take isl_map *map1,
3361 __isl_take isl_map *map2)
3364 map = isl_map_lex_le(isl_dim_range(isl_map_get_dim(map1)));
3365 map = isl_map_apply_domain(map, isl_map_reverse(map1));
3366 map = isl_map_apply_range(map, isl_map_reverse(map2));
3370 __isl_give isl_map *isl_map_lex_lt_map(__isl_take isl_map *map1,
3371 __isl_take isl_map *map2)
3374 map = isl_map_lex_lt(isl_dim_range(isl_map_get_dim(map1)));
3375 map = isl_map_apply_domain(map, isl_map_reverse(map1));
3376 map = isl_map_apply_range(map, isl_map_reverse(map2));
3380 __isl_give isl_map *isl_map_lex_ge_map(__isl_take isl_map *map1,
3381 __isl_take isl_map *map2)
3384 map = isl_map_lex_ge(isl_dim_range(isl_map_get_dim(map1)));
3385 map = isl_map_apply_domain(map, isl_map_reverse(map1));
3386 map = isl_map_apply_range(map, isl_map_reverse(map2));
3390 __isl_give isl_map *isl_map_lex_gt_map(__isl_take isl_map *map1,
3391 __isl_take isl_map *map2)
3394 map = isl_map_lex_gt(isl_dim_range(isl_map_get_dim(map1)));
3395 map = isl_map_apply_domain(map, isl_map_reverse(map1));
3396 map = isl_map_apply_range(map, isl_map_reverse(map2));
3400 struct isl_basic_map *isl_basic_map_from_basic_set(
3401 struct isl_basic_set *bset, struct isl_dim *dim)
3403 struct isl_basic_map *bmap;
3405 bset = isl_basic_set_cow(bset);
3409 isl_assert(bset->ctx, isl_dim_compatible(bset->dim, dim), goto error);
3410 isl_dim_free(bset->dim);
3411 bmap = (struct isl_basic_map *) bset;
3413 return isl_basic_map_finalize(bmap);
3415 isl_basic_set_free(bset);
3420 struct isl_basic_set *isl_basic_set_from_basic_map(struct isl_basic_map *bmap)
3424 if (bmap->dim->n_in == 0)
3425 return (struct isl_basic_set *)bmap;
3426 bmap = isl_basic_map_cow(bmap);
3429 bmap->dim = isl_dim_as_set_dim(bmap->dim);
3432 bmap = isl_basic_map_finalize(bmap);
3433 return (struct isl_basic_set *)bmap;
3435 isl_basic_map_free(bmap);
3439 /* For a div d = floor(f/m), add the constraints
3442 * -(f-(n-1)) + m d >= 0
3444 * Note that the second constraint is the negation of
3448 int isl_basic_map_add_div_constraints_var(__isl_keep isl_basic_map *bmap,
3449 unsigned pos, isl_int *div)
3452 unsigned total = isl_basic_map_total_dim(bmap);
3454 i = isl_basic_map_alloc_inequality(bmap);
3457 isl_seq_cpy(bmap->ineq[i], div + 1, 1 + total);
3458 isl_int_neg(bmap->ineq[i][1 + pos], div[0]);
3460 j = isl_basic_map_alloc_inequality(bmap);
3463 isl_seq_neg(bmap->ineq[j], bmap->ineq[i], 1 + total);
3464 isl_int_add(bmap->ineq[j][0], bmap->ineq[j][0], bmap->ineq[j][1 + pos]);
3465 isl_int_sub_ui(bmap->ineq[j][0], bmap->ineq[j][0], 1);
3469 int isl_basic_set_add_div_constraints_var(__isl_keep isl_basic_set *bset,
3470 unsigned pos, isl_int *div)
3472 return isl_basic_map_add_div_constraints_var((isl_basic_map *)bset,
3476 int isl_basic_map_add_div_constraints(struct isl_basic_map *bmap, unsigned div)
3478 unsigned total = isl_basic_map_total_dim(bmap);
3479 unsigned div_pos = total - bmap->n_div + div;
3481 return isl_basic_map_add_div_constraints_var(bmap, div_pos,
3485 struct isl_basic_set *isl_basic_map_underlying_set(
3486 struct isl_basic_map *bmap)
3490 if (bmap->dim->nparam == 0 && bmap->dim->n_in == 0 &&
3492 !isl_dim_is_named_or_nested(bmap->dim, isl_dim_in) &&
3493 !isl_dim_is_named_or_nested(bmap->dim, isl_dim_out))
3494 return (struct isl_basic_set *)bmap;
3495 bmap = isl_basic_map_cow(bmap);
3498 bmap->dim = isl_dim_underlying(bmap->dim, bmap->n_div);
3501 bmap->extra -= bmap->n_div;
3503 bmap = isl_basic_map_finalize(bmap);
3504 return (struct isl_basic_set *)bmap;
3509 __isl_give isl_basic_set *isl_basic_set_underlying_set(
3510 __isl_take isl_basic_set *bset)
3512 return isl_basic_map_underlying_set((isl_basic_map *)bset);
3515 struct isl_basic_map *isl_basic_map_overlying_set(
3516 struct isl_basic_set *bset, struct isl_basic_map *like)
3518 struct isl_basic_map *bmap;
3519 struct isl_ctx *ctx;
3526 isl_assert(ctx, bset->n_div == 0, goto error);
3527 isl_assert(ctx, isl_basic_set_n_param(bset) == 0, goto error);
3528 isl_assert(ctx, bset->dim->n_out == isl_basic_map_total_dim(like),
3530 if (isl_dim_equal(bset->dim, like->dim) && like->n_div == 0) {
3531 isl_basic_map_free(like);
3532 return (struct isl_basic_map *)bset;
3534 bset = isl_basic_set_cow(bset);
3537 total = bset->dim->n_out + bset->extra;
3538 bmap = (struct isl_basic_map *)bset;
3539 isl_dim_free(bmap->dim);
3540 bmap->dim = isl_dim_copy(like->dim);
3543 bmap->n_div = like->n_div;
3544 bmap->extra += like->n_div;
3548 ltotal = total - bmap->extra + like->extra;
3551 bmap->block2 = isl_blk_extend(ctx, bmap->block2,
3552 bmap->extra * (1 + 1 + total));
3553 if (isl_blk_is_error(bmap->block2))
3555 div = isl_realloc_array(ctx, bmap->div, isl_int *, bmap->extra);
3559 for (i = 0; i < bmap->extra; ++i)
3560 bmap->div[i] = bmap->block2.data + i * (1 + 1 + total);
3561 for (i = 0; i < like->n_div; ++i) {
3562 isl_seq_cpy(bmap->div[i], like->div[i], 1 + 1 + ltotal);
3563 isl_seq_clr(bmap->div[i]+1+1+ltotal, total - ltotal);
3565 bmap = isl_basic_map_extend_constraints(bmap,
3566 0, 2 * like->n_div);
3567 for (i = 0; i < like->n_div; ++i) {
3568 if (isl_int_is_zero(bmap->div[i][0]))
3570 if (isl_basic_map_add_div_constraints(bmap, i) < 0)
3574 isl_basic_map_free(like);
3575 bmap = isl_basic_map_simplify(bmap);
3576 bmap = isl_basic_map_finalize(bmap);
3579 isl_basic_map_free(like);
3580 isl_basic_set_free(bset);
3584 struct isl_basic_set *isl_basic_set_from_underlying_set(
3585 struct isl_basic_set *bset, struct isl_basic_set *like)
3587 return (struct isl_basic_set *)
3588 isl_basic_map_overlying_set(bset, (struct isl_basic_map *)like);
3591 struct isl_set *isl_set_from_underlying_set(
3592 struct isl_set *set, struct isl_basic_set *like)
3598 isl_assert(set->ctx, set->dim->n_out == isl_basic_set_total_dim(like),
3600 if (isl_dim_equal(set->dim, like->dim) && like->n_div == 0) {
3601 isl_basic_set_free(like);
3604 set = isl_set_cow(set);
3607 for (i = 0; i < set->n; ++i) {
3608 set->p[i] = isl_basic_set_from_underlying_set(set->p[i],
3609 isl_basic_set_copy(like));
3613 isl_dim_free(set->dim);
3614 set->dim = isl_dim_copy(like->dim);
3617 isl_basic_set_free(like);
3620 isl_basic_set_free(like);
3625 struct isl_set *isl_map_underlying_set(struct isl_map *map)
3629 map = isl_map_cow(map);
3632 map->dim = isl_dim_cow(map->dim);
3636 for (i = 1; i < map->n; ++i)
3637 isl_assert(map->ctx, map->p[0]->n_div == map->p[i]->n_div,
3639 for (i = 0; i < map->n; ++i) {
3640 map->p[i] = (struct isl_basic_map *)
3641 isl_basic_map_underlying_set(map->p[i]);
3646 map->dim = isl_dim_underlying(map->dim, 0);
3648 isl_dim_free(map->dim);
3649 map->dim = isl_dim_copy(map->p[0]->dim);
3653 return (struct isl_set *)map;
3659 struct isl_set *isl_set_to_underlying_set(struct isl_set *set)
3661 return (struct isl_set *)isl_map_underlying_set((struct isl_map *)set);
3664 __isl_give isl_basic_map *isl_basic_map_reset_dim(
3665 __isl_take isl_basic_map *bmap, __isl_take isl_dim *dim)
3667 bmap = isl_basic_map_cow(bmap);
3671 isl_dim_free(bmap->dim);
3674 bmap = isl_basic_map_finalize(bmap);
3678 isl_basic_map_free(bmap);
3683 __isl_give isl_basic_set *isl_basic_set_reset_dim(
3684 __isl_take isl_basic_set *bset, __isl_take isl_dim *dim)
3686 return (isl_basic_set *)isl_basic_map_reset_dim((isl_basic_map *)bset,
3690 __isl_give isl_map *isl_map_reset_dim(__isl_take isl_map *map,
3691 __isl_take isl_dim *dim)
3695 map = isl_map_cow(map);
3699 for (i = 0; i < map->n; ++i) {
3700 map->p[i] = isl_basic_map_reset_dim(map->p[i],
3705 isl_dim_free(map->dim);
3715 __isl_give isl_set *isl_set_reset_dim(__isl_take isl_set *set,
3716 __isl_take isl_dim *dim)
3718 return (struct isl_set *) isl_map_reset_dim((struct isl_map *)set, dim);
3721 struct isl_basic_set *isl_basic_map_domain(struct isl_basic_map *bmap)
3724 struct isl_basic_set *domain;
3730 dim = isl_dim_domain(isl_basic_map_get_dim(bmap));
3732 n_in = isl_basic_map_n_in(bmap);
3733 n_out = isl_basic_map_n_out(bmap);
3734 domain = isl_basic_set_from_basic_map(bmap);
3735 domain = isl_basic_set_project_out(domain, isl_dim_set, n_in, n_out);
3737 domain = isl_basic_set_reset_dim(domain, dim);
3742 struct isl_basic_set *isl_basic_map_range(struct isl_basic_map *bmap)
3744 return isl_basic_map_domain(isl_basic_map_reverse(bmap));
3747 __isl_give isl_basic_map *isl_basic_map_domain_map(
3748 __isl_take isl_basic_map *bmap)
3752 isl_basic_map *domain;
3753 isl_basic_set *bset;
3754 int nparam, n_in, n_out;
3757 nparam = isl_basic_map_dim(bmap, isl_dim_param);
3758 n_in = isl_basic_map_dim(bmap, isl_dim_in);
3759 n_out = isl_basic_map_dim(bmap, isl_dim_out);
3761 dim = isl_dim_from_range(isl_dim_domain(isl_basic_map_get_dim(bmap)));
3762 domain = isl_basic_map_universe(dim);
3764 bmap = isl_basic_map_from_domain(isl_basic_map_wrap(bmap));
3765 bmap = isl_basic_map_apply_range(bmap, domain);
3766 bmap = isl_basic_map_extend_constraints(bmap, n_in, 0);
3768 total = isl_basic_map_total_dim(bmap);
3770 for (i = 0; i < n_in; ++i) {
3771 k = isl_basic_map_alloc_equality(bmap);
3774 isl_seq_clr(bmap->eq[k], 1 + total);
3775 isl_int_set_si(bmap->eq[k][1 + nparam + i], -1);
3776 isl_int_set_si(bmap->eq[k][1 + nparam + n_in + n_out + i], 1);
3779 bmap = isl_basic_map_gauss(bmap, NULL);
3780 return isl_basic_map_finalize(bmap);
3782 isl_basic_map_free(bmap);
3786 __isl_give isl_basic_map *isl_basic_map_range_map(
3787 __isl_take isl_basic_map *bmap)
3791 isl_basic_map *range;
3792 isl_basic_set *bset;
3793 int nparam, n_in, n_out;
3796 nparam = isl_basic_map_dim(bmap, isl_dim_param);
3797 n_in = isl_basic_map_dim(bmap, isl_dim_in);
3798 n_out = isl_basic_map_dim(bmap, isl_dim_out);
3800 dim = isl_dim_from_range(isl_dim_range(isl_basic_map_get_dim(bmap)));
3801 range = isl_basic_map_universe(dim);
3803 bmap = isl_basic_map_from_domain(isl_basic_map_wrap(bmap));
3804 bmap = isl_basic_map_apply_range(bmap, range);
3805 bmap = isl_basic_map_extend_constraints(bmap, n_out, 0);
3807 total = isl_basic_map_total_dim(bmap);
3809 for (i = 0; i < n_out; ++i) {
3810 k = isl_basic_map_alloc_equality(bmap);
3813 isl_seq_clr(bmap->eq[k], 1 + total);
3814 isl_int_set_si(bmap->eq[k][1 + nparam + n_in + i], -1);
3815 isl_int_set_si(bmap->eq[k][1 + nparam + n_in + n_out + i], 1);
3818 bmap = isl_basic_map_gauss(bmap, NULL);
3819 return isl_basic_map_finalize(bmap);
3821 isl_basic_map_free(bmap);
3825 struct isl_set *isl_map_range(struct isl_map *map)
3828 struct isl_set *set;
3832 if (isl_map_dim(map, isl_dim_in) == 0 &&
3833 !isl_dim_is_named_or_nested(map->dim, isl_dim_in))
3834 return (isl_set *)map;
3836 map = isl_map_cow(map);
3840 set = (struct isl_set *) map;
3841 set->dim = isl_dim_drop_inputs(set->dim, 0, set->dim->n_in);
3844 for (i = 0; i < map->n; ++i) {
3845 set->p[i] = isl_basic_map_range(map->p[i]);
3849 ISL_F_CLR(set, ISL_MAP_DISJOINT);
3850 ISL_F_CLR(set, ISL_SET_NORMALIZED);
3857 __isl_give isl_map *isl_map_domain_map(__isl_take isl_map *map)
3860 isl_dim *domain_dim;
3862 map = isl_map_cow(map);
3866 domain_dim = isl_dim_from_range(isl_dim_domain(isl_map_get_dim(map)));
3867 map->dim = isl_dim_from_domain(isl_dim_wrap(map->dim));
3868 map->dim = isl_dim_join(map->dim, domain_dim);
3871 for (i = 0; i < map->n; ++i) {
3872 map->p[i] = isl_basic_map_domain_map(map->p[i]);
3876 ISL_F_CLR(map, ISL_MAP_DISJOINT);
3877 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3884 __isl_give isl_map *isl_map_range_map(__isl_take isl_map *map)
3889 map = isl_map_cow(map);
3893 range_dim = isl_dim_range(isl_map_get_dim(map));
3894 map->dim = isl_dim_from_domain(isl_dim_wrap(map->dim));
3895 map->dim = isl_dim_join(map->dim, range_dim);
3898 for (i = 0; i < map->n; ++i) {
3899 map->p[i] = isl_basic_map_range_map(map->p[i]);
3903 ISL_F_CLR(map, ISL_MAP_DISJOINT);
3904 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3911 struct isl_map *isl_map_from_set(struct isl_set *set, struct isl_dim *dim)
3914 struct isl_map *map = NULL;
3916 set = isl_set_cow(set);
3919 isl_assert(set->ctx, isl_dim_compatible(set->dim, dim), goto error);
3920 map = (struct isl_map *)set;
3921 for (i = 0; i < set->n; ++i) {
3922 map->p[i] = isl_basic_map_from_basic_set(
3923 set->p[i], isl_dim_copy(dim));
3927 isl_dim_free(map->dim);
3936 __isl_give isl_basic_map *isl_basic_map_from_domain(
3937 __isl_take isl_basic_set *bset)
3939 return isl_basic_map_reverse(isl_basic_map_from_range(bset));
3942 __isl_give isl_basic_map *isl_basic_map_from_range(
3943 __isl_take isl_basic_set *bset)
3945 return (isl_basic_map *)bset;
3948 struct isl_map *isl_map_from_range(struct isl_set *set)
3950 return (struct isl_map *)set;
3953 __isl_give isl_map *isl_map_from_domain(__isl_take isl_set *set)
3955 return isl_map_reverse(isl_map_from_range(set));
3958 __isl_give isl_basic_map *isl_basic_map_from_domain_and_range(
3959 __isl_take isl_basic_set *domain, __isl_take isl_basic_set *range)
3961 return isl_basic_map_apply_range(isl_basic_map_from_domain(domain),
3962 isl_basic_map_from_range(range));
3965 __isl_give isl_map *isl_map_from_domain_and_range(__isl_take isl_set *domain,
3966 __isl_take isl_set *range)
3968 return isl_map_apply_range(isl_map_from_domain(domain),
3969 isl_map_from_range(range));
3972 struct isl_set *isl_set_from_map(struct isl_map *map)
3975 struct isl_set *set = NULL;
3979 map = isl_map_cow(map);
3982 map->dim = isl_dim_as_set_dim(map->dim);
3985 set = (struct isl_set *)map;
3986 for (i = 0; i < map->n; ++i) {
3987 set->p[i] = isl_basic_set_from_basic_map(map->p[i]);
3997 struct isl_map *isl_map_alloc_dim(struct isl_dim *dim, int n, unsigned flags)
3999 struct isl_map *map;
4003 isl_assert(dim->ctx, n >= 0, return NULL);
4004 map = isl_alloc(dim->ctx, struct isl_map,
4005 sizeof(struct isl_map) +
4006 (n - 1) * sizeof(struct isl_basic_map *));
4010 map->ctx = dim->ctx;
4011 isl_ctx_ref(map->ctx);
4023 struct isl_map *isl_map_alloc(struct isl_ctx *ctx,
4024 unsigned nparam, unsigned in, unsigned out, int n,
4027 struct isl_map *map;
4028 struct isl_dim *dims;
4030 dims = isl_dim_alloc(ctx, nparam, in, out);
4034 map = isl_map_alloc_dim(dims, n, flags);
4038 struct isl_basic_map *isl_basic_map_empty(struct isl_dim *dim)
4040 struct isl_basic_map *bmap;
4041 bmap = isl_basic_map_alloc_dim(dim, 0, 1, 0);
4042 bmap = isl_basic_map_set_to_empty(bmap);
4046 struct isl_basic_set *isl_basic_set_empty(struct isl_dim *dim)
4048 struct isl_basic_set *bset;
4049 bset = isl_basic_set_alloc_dim(dim, 0, 1, 0);
4050 bset = isl_basic_set_set_to_empty(bset);
4054 struct isl_basic_map *isl_basic_map_empty_like(struct isl_basic_map *model)
4056 struct isl_basic_map *bmap;
4059 bmap = isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
4060 bmap = isl_basic_map_set_to_empty(bmap);
4064 struct isl_basic_map *isl_basic_map_empty_like_map(struct isl_map *model)
4066 struct isl_basic_map *bmap;
4069 bmap = isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
4070 bmap = isl_basic_map_set_to_empty(bmap);
4074 struct isl_basic_set *isl_basic_set_empty_like(struct isl_basic_set *model)
4076 struct isl_basic_set *bset;
4079 bset = isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
4080 bset = isl_basic_set_set_to_empty(bset);
4084 struct isl_basic_map *isl_basic_map_universe(struct isl_dim *dim)
4086 struct isl_basic_map *bmap;
4087 bmap = isl_basic_map_alloc_dim(dim, 0, 0, 0);
4088 bmap = isl_basic_map_finalize(bmap);
4092 struct isl_basic_set *isl_basic_set_universe(struct isl_dim *dim)
4094 struct isl_basic_set *bset;
4095 bset = isl_basic_set_alloc_dim(dim, 0, 0, 0);
4096 bset = isl_basic_set_finalize(bset);
4100 __isl_give isl_basic_map *isl_basic_map_nat_universe(__isl_take isl_dim *dim)
4103 unsigned total = isl_dim_total(dim);
4104 isl_basic_map *bmap;
4106 bmap= isl_basic_map_alloc_dim(dim, 0, 0, total);
4107 for (i = 0; i < total; ++i) {
4108 int k = isl_basic_map_alloc_inequality(bmap);
4111 isl_seq_clr(bmap->ineq[k], 1 + total);
4112 isl_int_set_si(bmap->ineq[k][1 + i], 1);
4116 isl_basic_map_free(bmap);
4120 __isl_give isl_basic_set *isl_basic_set_nat_universe(__isl_take isl_dim *dim)
4122 return isl_basic_map_nat_universe(dim);
4125 __isl_give isl_map *isl_map_nat_universe(__isl_take isl_dim *dim)
4127 return isl_map_from_basic_map(isl_basic_map_nat_universe(dim));
4130 __isl_give isl_set *isl_set_nat_universe(__isl_take isl_dim *dim)
4132 return isl_map_nat_universe(dim);
4135 __isl_give isl_basic_map *isl_basic_map_universe_like(
4136 __isl_keep isl_basic_map *model)
4140 return isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
4143 struct isl_basic_set *isl_basic_set_universe_like(struct isl_basic_set *model)
4147 return isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
4150 __isl_give isl_basic_set *isl_basic_set_universe_like_set(
4151 __isl_keep isl_set *model)
4155 return isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
4158 struct isl_map *isl_map_empty(struct isl_dim *dim)
4160 return isl_map_alloc_dim(dim, 0, ISL_MAP_DISJOINT);
4163 struct isl_map *isl_map_empty_like(struct isl_map *model)
4167 return isl_map_alloc_dim(isl_dim_copy(model->dim), 0, ISL_MAP_DISJOINT);
4170 struct isl_map *isl_map_empty_like_basic_map(struct isl_basic_map *model)
4174 return isl_map_alloc_dim(isl_dim_copy(model->dim), 0, ISL_MAP_DISJOINT);
4177 struct isl_set *isl_set_empty(struct isl_dim *dim)
4179 return isl_set_alloc_dim(dim, 0, ISL_MAP_DISJOINT);
4182 struct isl_set *isl_set_empty_like(struct isl_set *model)
4186 return isl_set_empty(isl_dim_copy(model->dim));
4189 struct isl_map *isl_map_universe(struct isl_dim *dim)
4191 struct isl_map *map;
4194 map = isl_map_alloc_dim(isl_dim_copy(dim), 1, ISL_MAP_DISJOINT);
4195 map = isl_map_add_basic_map(map, isl_basic_map_universe(dim));
4199 struct isl_set *isl_set_universe(struct isl_dim *dim)
4201 struct isl_set *set;
4204 set = isl_set_alloc_dim(isl_dim_copy(dim), 1, ISL_MAP_DISJOINT);
4205 set = isl_set_add_basic_set(set, isl_basic_set_universe(dim));
4209 __isl_give isl_set *isl_set_universe_like(__isl_keep isl_set *model)
4213 return isl_set_universe(isl_dim_copy(model->dim));
4216 struct isl_map *isl_map_dup(struct isl_map *map)
4219 struct isl_map *dup;
4223 dup = isl_map_alloc_dim(isl_dim_copy(map->dim), map->n, map->flags);
4224 for (i = 0; i < map->n; ++i)
4225 dup = isl_map_add_basic_map(dup, isl_basic_map_copy(map->p[i]));
4229 __isl_give isl_map *isl_map_add_basic_map(__isl_take isl_map *map,
4230 __isl_take isl_basic_map *bmap)
4234 if (isl_basic_map_plain_is_empty(bmap)) {
4235 isl_basic_map_free(bmap);
4238 isl_assert(map->ctx, isl_dim_equal(map->dim, bmap->dim), goto error);
4239 isl_assert(map->ctx, map->n < map->size, goto error);
4240 map->p[map->n] = bmap;
4242 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4248 isl_basic_map_free(bmap);
4252 void isl_map_free(struct isl_map *map)
4262 isl_ctx_deref(map->ctx);
4263 for (i = 0; i < map->n; ++i)
4264 isl_basic_map_free(map->p[i]);
4265 isl_dim_free(map->dim);
4269 struct isl_map *isl_map_extend(struct isl_map *base,
4270 unsigned nparam, unsigned n_in, unsigned n_out)
4274 base = isl_map_cow(base);
4278 base->dim = isl_dim_extend(base->dim, nparam, n_in, n_out);
4281 for (i = 0; i < base->n; ++i) {
4282 base->p[i] = isl_basic_map_extend_dim(base->p[i],
4283 isl_dim_copy(base->dim), 0, 0, 0);
4293 struct isl_set *isl_set_extend(struct isl_set *base,
4294 unsigned nparam, unsigned dim)
4296 return (struct isl_set *)isl_map_extend((struct isl_map *)base,
4300 static struct isl_basic_map *isl_basic_map_fix_pos_si(
4301 struct isl_basic_map *bmap, unsigned pos, int value)
4305 bmap = isl_basic_map_cow(bmap);
4306 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
4307 j = isl_basic_map_alloc_equality(bmap);
4310 isl_seq_clr(bmap->eq[j] + 1, isl_basic_map_total_dim(bmap));
4311 isl_int_set_si(bmap->eq[j][pos], -1);
4312 isl_int_set_si(bmap->eq[j][0], value);
4313 bmap = isl_basic_map_simplify(bmap);
4314 return isl_basic_map_finalize(bmap);
4316 isl_basic_map_free(bmap);
4320 static __isl_give isl_basic_map *isl_basic_map_fix_pos(
4321 __isl_take isl_basic_map *bmap, unsigned pos, isl_int value)
4325 bmap = isl_basic_map_cow(bmap);
4326 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
4327 j = isl_basic_map_alloc_equality(bmap);
4330 isl_seq_clr(bmap->eq[j] + 1, isl_basic_map_total_dim(bmap));
4331 isl_int_set_si(bmap->eq[j][pos], -1);
4332 isl_int_set(bmap->eq[j][0], value);
4333 bmap = isl_basic_map_simplify(bmap);
4334 return isl_basic_map_finalize(bmap);
4336 isl_basic_map_free(bmap);
4340 struct isl_basic_map *isl_basic_map_fix_si(struct isl_basic_map *bmap,
4341 enum isl_dim_type type, unsigned pos, int value)
4345 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
4346 return isl_basic_map_fix_pos_si(bmap,
4347 isl_basic_map_offset(bmap, type) + pos, value);
4349 isl_basic_map_free(bmap);
4353 __isl_give isl_basic_map *isl_basic_map_fix(__isl_take isl_basic_map *bmap,
4354 enum isl_dim_type type, unsigned pos, isl_int value)
4358 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
4359 return isl_basic_map_fix_pos(bmap,
4360 isl_basic_map_offset(bmap, type) + pos, value);
4362 isl_basic_map_free(bmap);
4366 struct isl_basic_set *isl_basic_set_fix_si(struct isl_basic_set *bset,
4367 enum isl_dim_type type, unsigned pos, int value)
4369 return (struct isl_basic_set *)
4370 isl_basic_map_fix_si((struct isl_basic_map *)bset,
4374 __isl_give isl_basic_set *isl_basic_set_fix(__isl_take isl_basic_set *bset,
4375 enum isl_dim_type type, unsigned pos, isl_int value)
4377 return (struct isl_basic_set *)
4378 isl_basic_map_fix((struct isl_basic_map *)bset,
4382 struct isl_basic_map *isl_basic_map_fix_input_si(struct isl_basic_map *bmap,
4383 unsigned input, int value)
4385 return isl_basic_map_fix_si(bmap, isl_dim_in, input, value);
4388 struct isl_basic_set *isl_basic_set_fix_dim_si(struct isl_basic_set *bset,
4389 unsigned dim, int value)
4391 return (struct isl_basic_set *)
4392 isl_basic_map_fix_si((struct isl_basic_map *)bset,
4393 isl_dim_set, dim, value);
4396 struct isl_map *isl_map_fix_si(struct isl_map *map,
4397 enum isl_dim_type type, unsigned pos, int value)
4401 map = isl_map_cow(map);
4405 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
4406 for (i = 0; i < map->n; ++i) {
4407 map->p[i] = isl_basic_map_fix_si(map->p[i], type, pos, value);
4411 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4418 __isl_give isl_set *isl_set_fix_si(__isl_take isl_set *set,
4419 enum isl_dim_type type, unsigned pos, int value)
4421 return (struct isl_set *)
4422 isl_map_fix_si((struct isl_map *)set, type, pos, value);
4425 __isl_give isl_map *isl_map_fix(__isl_take isl_map *map,
4426 enum isl_dim_type type, unsigned pos, isl_int value)
4430 map = isl_map_cow(map);
4434 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
4435 for (i = 0; i < map->n; ++i) {
4436 map->p[i] = isl_basic_map_fix(map->p[i], type, pos, value);
4440 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4447 __isl_give isl_set *isl_set_fix(__isl_take isl_set *set,
4448 enum isl_dim_type type, unsigned pos, isl_int value)
4450 return (struct isl_set *)isl_map_fix((isl_map *)set, type, pos, value);
4453 struct isl_map *isl_map_fix_input_si(struct isl_map *map,
4454 unsigned input, int value)
4456 return isl_map_fix_si(map, isl_dim_in, input, value);
4459 struct isl_set *isl_set_fix_dim_si(struct isl_set *set, unsigned dim, int value)
4461 return (struct isl_set *)
4462 isl_map_fix_si((struct isl_map *)set, isl_dim_set, dim, value);
4465 __isl_give isl_basic_map *isl_basic_map_lower_bound_si(
4466 __isl_take isl_basic_map *bmap,
4467 enum isl_dim_type type, unsigned pos, int value)
4473 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
4474 pos += isl_basic_map_offset(bmap, type);
4475 bmap = isl_basic_map_cow(bmap);
4476 bmap = isl_basic_map_extend_constraints(bmap, 0, 1);
4477 j = isl_basic_map_alloc_inequality(bmap);
4480 isl_seq_clr(bmap->ineq[j], 1 + isl_basic_map_total_dim(bmap));
4481 isl_int_set_si(bmap->ineq[j][pos], 1);
4482 isl_int_set_si(bmap->ineq[j][0], -value);
4483 bmap = isl_basic_map_simplify(bmap);
4484 return isl_basic_map_finalize(bmap);
4486 isl_basic_map_free(bmap);
4490 struct isl_basic_set *isl_basic_set_lower_bound_dim(struct isl_basic_set *bset,
4491 unsigned dim, isl_int value)
4495 bset = isl_basic_set_cow(bset);
4496 bset = isl_basic_set_extend_constraints(bset, 0, 1);
4497 j = isl_basic_set_alloc_inequality(bset);
4500 isl_seq_clr(bset->ineq[j], 1 + isl_basic_set_total_dim(bset));
4501 isl_int_set_si(bset->ineq[j][1 + isl_basic_set_n_param(bset) + dim], 1);
4502 isl_int_neg(bset->ineq[j][0], value);
4503 bset = isl_basic_set_simplify(bset);
4504 return isl_basic_set_finalize(bset);
4506 isl_basic_set_free(bset);
4510 __isl_give isl_map *isl_map_lower_bound_si(__isl_take isl_map *map,
4511 enum isl_dim_type type, unsigned pos, int value)
4515 map = isl_map_cow(map);
4519 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
4520 for (i = 0; i < map->n; ++i) {
4521 map->p[i] = isl_basic_map_lower_bound_si(map->p[i],
4526 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4533 __isl_give isl_set *isl_set_lower_bound_si(__isl_take isl_set *set,
4534 enum isl_dim_type type, unsigned pos, int value)
4536 return (struct isl_set *)
4537 isl_map_lower_bound_si((struct isl_map *)set, type, pos, value);
4540 struct isl_set *isl_set_lower_bound_dim(struct isl_set *set, unsigned dim,
4545 set = isl_set_cow(set);
4549 isl_assert(set->ctx, dim < isl_set_n_dim(set), goto error);
4550 for (i = 0; i < set->n; ++i) {
4551 set->p[i] = isl_basic_set_lower_bound_dim(set->p[i], dim, value);
4561 struct isl_map *isl_map_reverse(struct isl_map *map)
4565 map = isl_map_cow(map);
4569 map->dim = isl_dim_reverse(map->dim);
4572 for (i = 0; i < map->n; ++i) {
4573 map->p[i] = isl_basic_map_reverse(map->p[i]);
4577 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4584 static struct isl_map *isl_basic_map_partial_lexopt(
4585 struct isl_basic_map *bmap, struct isl_basic_set *dom,
4586 struct isl_set **empty, int max)
4590 if (bmap->ctx->opt->pip == ISL_PIP_PIP)
4591 return isl_pip_basic_map_lexopt(bmap, dom, empty, max);
4593 return isl_tab_basic_map_partial_lexopt(bmap, dom, empty, max);
4595 isl_basic_map_free(bmap);
4596 isl_basic_set_free(dom);
4602 struct isl_map *isl_basic_map_partial_lexmax(
4603 struct isl_basic_map *bmap, struct isl_basic_set *dom,
4604 struct isl_set **empty)
4606 return isl_basic_map_partial_lexopt(bmap, dom, empty, 1);
4609 struct isl_map *isl_basic_map_partial_lexmin(
4610 struct isl_basic_map *bmap, struct isl_basic_set *dom,
4611 struct isl_set **empty)
4613 return isl_basic_map_partial_lexopt(bmap, dom, empty, 0);
4616 struct isl_set *isl_basic_set_partial_lexmin(
4617 struct isl_basic_set *bset, struct isl_basic_set *dom,
4618 struct isl_set **empty)
4620 return (struct isl_set *)
4621 isl_basic_map_partial_lexmin((struct isl_basic_map *)bset,
4625 struct isl_set *isl_basic_set_partial_lexmax(
4626 struct isl_basic_set *bset, struct isl_basic_set *dom,
4627 struct isl_set **empty)
4629 return (struct isl_set *)
4630 isl_basic_map_partial_lexmax((struct isl_basic_map *)bset,
4634 /* Given a basic map "bmap", compute the lexicographically minimal
4635 * (or maximal) image element for each domain element in dom.
4636 * Set *empty to those elements in dom that do not have an image element.
4638 * We first make sure the basic sets in dom are disjoint and then
4639 * simply collect the results over each of the basic sets separately.
4640 * We could probably improve the efficiency a bit by moving the union
4641 * domain down into the parametric integer programming.
4643 static __isl_give isl_map *basic_map_partial_lexopt(
4644 __isl_take isl_basic_map *bmap, __isl_take isl_set *dom,
4645 __isl_give isl_set **empty, int max)
4648 struct isl_map *res;
4650 dom = isl_set_make_disjoint(dom);
4654 if (isl_set_plain_is_empty(dom)) {
4655 res = isl_map_empty_like_basic_map(bmap);
4656 *empty = isl_set_empty_like(dom);
4658 isl_basic_map_free(bmap);
4662 res = isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap),
4663 isl_basic_set_copy(dom->p[0]), empty, max);
4665 for (i = 1; i < dom->n; ++i) {
4666 struct isl_map *res_i;
4667 struct isl_set *empty_i;
4669 res_i = isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap),
4670 isl_basic_set_copy(dom->p[i]), &empty_i, max);
4672 res = isl_map_union_disjoint(res, res_i);
4673 *empty = isl_set_union_disjoint(*empty, empty_i);
4677 isl_basic_map_free(bmap);
4682 isl_basic_map_free(bmap);
4686 /* Given a map "map", compute the lexicographically minimal
4687 * (or maximal) image element for each domain element in dom.
4688 * Set *empty to those elements in dom that do not have an image element.
4690 * We first compute the lexicographically minimal or maximal element
4691 * in the first basic map. This results in a partial solution "res"
4692 * and a subset "todo" of dom that still need to be handled.
4693 * We then consider each of the remaining maps in "map" and successively
4694 * improve both "res" and "todo".
4696 * Let res^k and todo^k be the results after k steps and let i = k + 1.
4697 * Assume we are computing the lexicographical maximum.
4698 * We first compute the lexicographically maximal element in basic map i.
4699 * This results in a partial solution res_i and a subset todo_i.
4700 * Then we combine these results with those obtain for the first k basic maps
4701 * to obtain a result that is valid for the first k+1 basic maps.
4702 * In particular, the set where there is no solution is the set where
4703 * there is no solution for the first k basic maps and also no solution
4704 * for the ith basic map, i.e.,
4706 * todo^i = todo^k * todo_i
4708 * On dom(res^k) * dom(res_i), we need to pick the larger of the two
4709 * solutions, arbitrarily breaking ties in favor of res^k.
4710 * That is, when res^k(a) >= res_i(a), we pick res^k and
4711 * when res^k(a) < res_i(a), we pick res_i. (Here, ">=" and "<" denote
4712 * the lexicographic order.)
4713 * In practice, we compute
4715 * res^k * (res_i . "<=")
4719 * res_i * (res^k . "<")
4721 * Finally, we consider the symmetric difference of dom(res^k) and dom(res_i),
4722 * where only one of res^k and res_i provides a solution and we simply pick
4729 * Note that we only compute these intersections when dom(res^k) intersects
4730 * dom(res_i). Otherwise, the only effect of these intersections is to
4731 * potentially break up res^k and res_i into smaller pieces.
4732 * We want to avoid such splintering as much as possible.
4733 * In fact, an earlier implementation of this function would look for
4734 * better results in the domain of res^k and for extra results in todo^k,
4735 * but this would always result in a splintering according to todo^k,
4736 * even when the domain of basic map i is disjoint from the domains of
4737 * the previous basic maps.
4739 static __isl_give isl_map *isl_map_partial_lexopt(
4740 __isl_take isl_map *map, __isl_take isl_set *dom,
4741 __isl_give isl_set **empty, int max)
4744 struct isl_map *res;
4745 struct isl_set *todo;
4750 if (isl_map_plain_is_empty(map)) {
4758 res = basic_map_partial_lexopt(isl_basic_map_copy(map->p[0]),
4759 isl_set_copy(dom), &todo, max);
4761 for (i = 1; i < map->n; ++i) {
4765 isl_dim *dim = isl_dim_range(isl_map_get_dim(res));
4767 res_i = basic_map_partial_lexopt(isl_basic_map_copy(map->p[i]),
4768 isl_set_copy(dom), &todo_i, max);
4771 lt = isl_map_lex_lt(isl_dim_copy(dim));
4772 le = isl_map_lex_le(dim);
4774 lt = isl_map_lex_gt(isl_dim_copy(dim));
4775 le = isl_map_lex_ge(dim);
4777 lt = isl_map_apply_range(isl_map_copy(res), lt);
4778 lt = isl_map_intersect(lt, isl_map_copy(res_i));
4779 le = isl_map_apply_range(isl_map_copy(res_i), le);
4780 le = isl_map_intersect(le, isl_map_copy(res));
4782 if (!isl_map_is_empty(lt) || !isl_map_is_empty(le)) {
4783 res = isl_map_intersect_domain(res,
4784 isl_set_copy(todo_i));
4785 res_i = isl_map_intersect_domain(res_i,
4786 isl_set_copy(todo));
4789 res = isl_map_union_disjoint(res, res_i);
4790 res = isl_map_union_disjoint(res, lt);
4791 res = isl_map_union_disjoint(res, le);
4793 todo = isl_set_intersect(todo, todo_i);
4813 __isl_give isl_map *isl_map_partial_lexmax(
4814 __isl_take isl_map *map, __isl_take isl_set *dom,
4815 __isl_give isl_set **empty)
4817 return isl_map_partial_lexopt(map, dom, empty, 1);
4820 __isl_give isl_map *isl_map_partial_lexmin(
4821 __isl_take isl_map *map, __isl_take isl_set *dom,
4822 __isl_give isl_set **empty)
4824 return isl_map_partial_lexopt(map, dom, empty, 0);
4827 __isl_give isl_set *isl_set_partial_lexmin(
4828 __isl_take isl_set *set, __isl_take isl_set *dom,
4829 __isl_give isl_set **empty)
4831 return (struct isl_set *)
4832 isl_map_partial_lexmin((struct isl_map *)set,
4836 __isl_give isl_set *isl_set_partial_lexmax(
4837 __isl_take isl_set *set, __isl_take isl_set *dom,
4838 __isl_give isl_set **empty)
4840 return (struct isl_set *)
4841 isl_map_partial_lexmax((struct isl_map *)set,
4845 __isl_give isl_map *isl_basic_map_lexopt(__isl_take isl_basic_map *bmap, int max)
4847 struct isl_basic_set *dom = NULL;
4848 struct isl_dim *dom_dim;
4852 dom_dim = isl_dim_domain(isl_dim_copy(bmap->dim));
4853 dom = isl_basic_set_universe(dom_dim);
4854 return isl_basic_map_partial_lexopt(bmap, dom, NULL, max);
4856 isl_basic_map_free(bmap);
4860 __isl_give isl_map *isl_basic_map_lexmin(__isl_take isl_basic_map *bmap)
4862 return isl_basic_map_lexopt(bmap, 0);
4865 __isl_give isl_map *isl_basic_map_lexmax(__isl_take isl_basic_map *bmap)
4867 return isl_basic_map_lexopt(bmap, 1);
4870 __isl_give isl_set *isl_basic_set_lexmin(__isl_take isl_basic_set *bset)
4872 return (isl_set *)isl_basic_map_lexmin((isl_basic_map *)bset);
4875 __isl_give isl_set *isl_basic_set_lexmax(__isl_take isl_basic_set *bset)
4877 return (isl_set *)isl_basic_map_lexmax((isl_basic_map *)bset);
4880 __isl_give isl_map *isl_map_lexopt(__isl_take isl_map *map, int max)
4882 struct isl_set *dom = NULL;
4883 struct isl_dim *dom_dim;
4887 dom_dim = isl_dim_domain(isl_dim_copy(map->dim));
4888 dom = isl_set_universe(dom_dim);
4889 return isl_map_partial_lexopt(map, dom, NULL, max);
4895 __isl_give isl_map *isl_map_lexmin(__isl_take isl_map *map)
4897 return isl_map_lexopt(map, 0);
4900 __isl_give isl_map *isl_map_lexmax(__isl_take isl_map *map)
4902 return isl_map_lexopt(map, 1);
4905 __isl_give isl_set *isl_set_lexmin(__isl_take isl_set *set)
4907 return (isl_set *)isl_map_lexmin((isl_map *)set);
4910 __isl_give isl_set *isl_set_lexmax(__isl_take isl_set *set)
4912 return (isl_set *)isl_map_lexmax((isl_map *)set);
4915 /* Apply a preimage specified by "mat" on the parameters of "bset".
4916 * bset is assumed to have only parameters and divs.
4918 static struct isl_basic_set *basic_set_parameter_preimage(
4919 struct isl_basic_set *bset, struct isl_mat *mat)
4926 bset->dim = isl_dim_cow(bset->dim);
4930 nparam = isl_basic_set_dim(bset, isl_dim_param);
4932 isl_assert(bset->ctx, mat->n_row == 1 + nparam, goto error);
4934 bset->dim->nparam = 0;
4935 bset->dim->n_out = nparam;
4936 bset = isl_basic_set_preimage(bset, mat);
4938 bset->dim->nparam = bset->dim->n_out;
4939 bset->dim->n_out = 0;
4944 isl_basic_set_free(bset);
4948 /* Apply a preimage specified by "mat" on the parameters of "set".
4949 * set is assumed to have only parameters and divs.
4951 static struct isl_set *set_parameter_preimage(
4952 struct isl_set *set, struct isl_mat *mat)
4954 struct isl_dim *dim = NULL;
4960 dim = isl_dim_copy(set->dim);
4961 dim = isl_dim_cow(dim);
4965 nparam = isl_set_dim(set, isl_dim_param);
4967 isl_assert(set->ctx, mat->n_row == 1 + nparam, goto error);
4970 dim->n_out = nparam;
4971 isl_set_reset_dim(set, dim);
4972 set = isl_set_preimage(set, mat);
4975 dim = isl_dim_copy(set->dim);
4976 dim = isl_dim_cow(dim);
4979 dim->nparam = dim->n_out;
4981 isl_set_reset_dim(set, dim);
4991 /* Intersect the basic set "bset" with the affine space specified by the
4992 * equalities in "eq".
4994 static struct isl_basic_set *basic_set_append_equalities(
4995 struct isl_basic_set *bset, struct isl_mat *eq)
5003 bset = isl_basic_set_extend_dim(bset, isl_dim_copy(bset->dim), 0,
5008 len = 1 + isl_dim_total(bset->dim) + bset->extra;
5009 for (i = 0; i < eq->n_row; ++i) {
5010 k = isl_basic_set_alloc_equality(bset);
5013 isl_seq_cpy(bset->eq[k], eq->row[i], eq->n_col);
5014 isl_seq_clr(bset->eq[k] + eq->n_col, len - eq->n_col);
5018 bset = isl_basic_set_gauss(bset, NULL);
5019 bset = isl_basic_set_finalize(bset);
5024 isl_basic_set_free(bset);
5028 /* Intersect the set "set" with the affine space specified by the
5029 * equalities in "eq".
5031 static struct isl_set *set_append_equalities(struct isl_set *set,
5039 for (i = 0; i < set->n; ++i) {
5040 set->p[i] = basic_set_append_equalities(set->p[i],
5053 /* Project the given basic set onto its parameter domain, possibly introducing
5054 * new, explicit, existential variables in the constraints.
5055 * The input has parameters and (possibly implicit) existential variables.
5056 * The output has the same parameters, but only
5057 * explicit existentially quantified variables.
5059 * The actual projection is performed by pip, but pip doesn't seem
5060 * to like equalities very much, so we first remove the equalities
5061 * among the parameters by performing a variable compression on
5062 * the parameters. Afterward, an inverse transformation is performed
5063 * and the equalities among the parameters are inserted back in.
5065 static struct isl_set *parameter_compute_divs(struct isl_basic_set *bset)
5069 struct isl_mat *T, *T2;
5070 struct isl_set *set;
5071 unsigned nparam, n_div;
5073 bset = isl_basic_set_cow(bset);
5077 if (bset->n_eq == 0)
5078 return isl_basic_set_lexmin(bset);
5080 isl_basic_set_gauss(bset, NULL);
5082 nparam = isl_basic_set_dim(bset, isl_dim_param);
5083 n_div = isl_basic_set_dim(bset, isl_dim_div);
5085 for (i = 0, j = n_div - 1; i < bset->n_eq && j >= 0; --j) {
5086 if (!isl_int_is_zero(bset->eq[i][1 + nparam + j]))
5089 if (i == bset->n_eq)
5090 return isl_basic_set_lexmin(bset);
5092 eq = isl_mat_sub_alloc6(bset->ctx, bset->eq, i, bset->n_eq - i,
5094 eq = isl_mat_cow(eq);
5095 T = isl_mat_variable_compression(isl_mat_copy(eq), &T2);
5096 if (T && T->n_col == 0) {
5100 bset = isl_basic_set_set_to_empty(bset);
5101 return isl_set_from_basic_set(bset);
5103 bset = basic_set_parameter_preimage(bset, T);
5105 set = isl_basic_set_lexmin(bset);
5106 set = set_parameter_preimage(set, T2);
5107 set = set_append_equalities(set, eq);
5111 /* Compute an explicit representation for all the existentially
5112 * quantified variables.
5113 * The input and output dimensions are first turned into parameters.
5114 * compute_divs then returns a map with the same parameters and
5115 * no input or output dimensions and the dimension specification
5116 * is reset to that of the input.
5118 static struct isl_map *compute_divs(struct isl_basic_map *bmap)
5120 struct isl_basic_set *bset;
5121 struct isl_set *set;
5122 struct isl_map *map;
5123 struct isl_dim *dim, *orig_dim = NULL;
5128 bmap = isl_basic_map_cow(bmap);
5132 nparam = isl_basic_map_dim(bmap, isl_dim_param);
5133 n_in = isl_basic_map_dim(bmap, isl_dim_in);
5134 n_out = isl_basic_map_dim(bmap, isl_dim_out);
5135 dim = isl_dim_set_alloc(bmap->ctx, nparam + n_in + n_out, 0);
5139 orig_dim = bmap->dim;
5141 bset = (struct isl_basic_set *)bmap;
5143 set = parameter_compute_divs(bset);
5144 map = (struct isl_map *)set;
5145 map = isl_map_reset_dim(map, orig_dim);
5149 isl_basic_map_free(bmap);
5153 static int basic_map_divs_known(__isl_keep isl_basic_map *bmap)
5161 off = isl_dim_total(bmap->dim);
5162 for (i = 0; i < bmap->n_div; ++i) {
5163 if (isl_int_is_zero(bmap->div[i][0]))
5165 isl_assert(bmap->ctx, isl_int_is_zero(bmap->div[i][1+1+off+i]),
5171 static int map_divs_known(__isl_keep isl_map *map)
5178 for (i = 0; i < map->n; ++i) {
5179 int known = basic_map_divs_known(map->p[i]);
5187 /* If bmap contains any unknown divs, then compute explicit
5188 * expressions for them. However, this computation may be
5189 * quite expensive, so first try to remove divs that aren't
5192 struct isl_map *isl_basic_map_compute_divs(struct isl_basic_map *bmap)
5196 struct isl_map *map;
5198 known = basic_map_divs_known(bmap);
5202 return isl_map_from_basic_map(bmap);
5204 bmap = isl_basic_map_drop_redundant_divs(bmap);
5206 known = basic_map_divs_known(bmap);
5210 return isl_map_from_basic_map(bmap);
5212 map = compute_divs(bmap);
5215 isl_basic_map_free(bmap);
5219 struct isl_map *isl_map_compute_divs(struct isl_map *map)
5223 struct isl_map *res;
5230 known = map_divs_known(map);
5238 res = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[0]));
5239 for (i = 1 ; i < map->n; ++i) {
5241 r2 = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[i]));
5242 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT))
5243 res = isl_map_union_disjoint(res, r2);
5245 res = isl_map_union(res, r2);
5252 struct isl_set *isl_basic_set_compute_divs(struct isl_basic_set *bset)
5254 return (struct isl_set *)
5255 isl_basic_map_compute_divs((struct isl_basic_map *)bset);
5258 struct isl_set *isl_set_compute_divs(struct isl_set *set)
5260 return (struct isl_set *)
5261 isl_map_compute_divs((struct isl_map *)set);
5264 struct isl_set *isl_map_domain(struct isl_map *map)
5267 struct isl_set *set;
5272 map = isl_map_cow(map);
5276 set = (struct isl_set *)map;
5277 set->dim = isl_dim_domain(set->dim);
5280 for (i = 0; i < map->n; ++i) {
5281 set->p[i] = isl_basic_map_domain(map->p[i]);
5285 ISL_F_CLR(set, ISL_MAP_DISJOINT);
5286 ISL_F_CLR(set, ISL_SET_NORMALIZED);
5293 struct isl_map *isl_map_union_disjoint(
5294 struct isl_map *map1, struct isl_map *map2)
5298 struct isl_map *map = NULL;
5312 isl_assert(map1->ctx, isl_dim_equal(map1->dim, map2->dim), goto error);
5314 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
5315 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
5316 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
5318 map = isl_map_alloc_dim(isl_dim_copy(map1->dim),
5319 map1->n + map2->n, flags);
5322 for (i = 0; i < map1->n; ++i) {
5323 map = isl_map_add_basic_map(map,
5324 isl_basic_map_copy(map1->p[i]));
5328 for (i = 0; i < map2->n; ++i) {
5329 map = isl_map_add_basic_map(map,
5330 isl_basic_map_copy(map2->p[i]));
5344 struct isl_map *isl_map_union(struct isl_map *map1, struct isl_map *map2)
5346 map1 = isl_map_union_disjoint(map1, map2);
5350 ISL_F_CLR(map1, ISL_MAP_DISJOINT);
5354 struct isl_set *isl_set_union_disjoint(
5355 struct isl_set *set1, struct isl_set *set2)
5357 return (struct isl_set *)
5358 isl_map_union_disjoint(
5359 (struct isl_map *)set1, (struct isl_map *)set2);
5362 struct isl_set *isl_set_union(struct isl_set *set1, struct isl_set *set2)
5364 return (struct isl_set *)
5365 isl_map_union((struct isl_map *)set1, (struct isl_map *)set2);
5368 struct isl_map *isl_map_intersect_range(
5369 struct isl_map *map, struct isl_set *set)
5372 struct isl_map *result;
5378 if (!isl_dim_match(map->dim, isl_dim_param, set->dim, isl_dim_param))
5379 isl_die(set->ctx, isl_error_invalid,
5380 "parameters don't match", goto error);
5382 if (isl_dim_size(set->dim, isl_dim_set) != 0 &&
5383 !isl_map_compatible_range(map, set))
5384 isl_die(set->ctx, isl_error_invalid,
5385 "incompatible spaces", goto error);
5387 if (isl_set_plain_is_universe(set)) {
5392 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT) &&
5393 ISL_F_ISSET(set, ISL_MAP_DISJOINT))
5394 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
5396 result = isl_map_alloc_dim(isl_dim_copy(map->dim),
5397 map->n * set->n, flags);
5400 for (i = 0; i < map->n; ++i)
5401 for (j = 0; j < set->n; ++j) {
5402 result = isl_map_add_basic_map(result,
5403 isl_basic_map_intersect_range(
5404 isl_basic_map_copy(map->p[i]),
5405 isl_basic_set_copy(set->p[j])));
5418 struct isl_map *isl_map_intersect_domain(
5419 struct isl_map *map, struct isl_set *set)
5421 return isl_map_reverse(
5422 isl_map_intersect_range(isl_map_reverse(map), set));
5425 struct isl_map *isl_map_apply_domain(
5426 struct isl_map *map1, struct isl_map *map2)
5430 map1 = isl_map_reverse(map1);
5431 map1 = isl_map_apply_range(map1, map2);
5432 return isl_map_reverse(map1);
5439 struct isl_map *isl_map_apply_range(
5440 struct isl_map *map1, struct isl_map *map2)
5442 struct isl_dim *dim_result;
5443 struct isl_map *result;
5449 dim_result = isl_dim_join(isl_dim_copy(map1->dim),
5450 isl_dim_copy(map2->dim));
5452 result = isl_map_alloc_dim(dim_result, map1->n * map2->n, 0);
5455 for (i = 0; i < map1->n; ++i)
5456 for (j = 0; j < map2->n; ++j) {
5457 result = isl_map_add_basic_map(result,
5458 isl_basic_map_apply_range(
5459 isl_basic_map_copy(map1->p[i]),
5460 isl_basic_map_copy(map2->p[j])));
5466 if (result && result->n <= 1)
5467 ISL_F_SET(result, ISL_MAP_DISJOINT);
5476 * returns range - domain
5478 struct isl_basic_set *isl_basic_map_deltas(struct isl_basic_map *bmap)
5480 isl_dim *dims, *target_dim;
5481 struct isl_basic_set *bset;
5488 isl_assert(bmap->ctx, isl_dim_tuple_match(bmap->dim, isl_dim_in,
5489 bmap->dim, isl_dim_out),
5491 target_dim = isl_dim_domain(isl_basic_map_get_dim(bmap));
5492 dim = isl_basic_map_n_in(bmap);
5493 nparam = isl_basic_map_n_param(bmap);
5494 bset = isl_basic_set_from_basic_map(bmap);
5495 bset = isl_basic_set_cow(bset);
5496 dims = isl_basic_set_get_dim(bset);
5497 dims = isl_dim_add(dims, isl_dim_set, dim);
5498 bset = isl_basic_set_extend_dim(bset, dims, 0, dim, 0);
5499 bset = isl_basic_set_swap_vars(bset, 2*dim);
5500 for (i = 0; i < dim; ++i) {
5501 int j = isl_basic_map_alloc_equality(
5502 (struct isl_basic_map *)bset);
5505 isl_seq_clr(bset->eq[j], 1 + isl_basic_set_total_dim(bset));
5506 isl_int_set_si(bset->eq[j][1+nparam+i], 1);
5507 isl_int_set_si(bset->eq[j][1+nparam+dim+i], 1);
5508 isl_int_set_si(bset->eq[j][1+nparam+2*dim+i], -1);
5510 bset = isl_basic_set_project_out(bset, isl_dim_set, dim, 2*dim);
5511 bset = isl_basic_set_reset_dim(bset, target_dim);
5514 isl_basic_map_free(bmap);
5519 * returns range - domain
5521 struct isl_set *isl_map_deltas(struct isl_map *map)
5525 struct isl_set *result;
5530 isl_assert(map->ctx, isl_dim_tuple_match(map->dim, isl_dim_in,
5531 map->dim, isl_dim_out),
5533 dim = isl_map_get_dim(map);
5534 dim = isl_dim_domain(dim);
5535 result = isl_set_alloc_dim(dim, map->n, 0);
5538 for (i = 0; i < map->n; ++i)
5539 result = isl_set_add_basic_set(result,
5540 isl_basic_map_deltas(isl_basic_map_copy(map->p[i])));
5549 * returns [domain -> range] -> range - domain
5551 __isl_give isl_basic_map *isl_basic_map_deltas_map(
5552 __isl_take isl_basic_map *bmap)
5556 isl_basic_map *domain;
5557 isl_basic_set *bset;
5561 if (!isl_dim_tuple_match(bmap->dim, isl_dim_in, bmap->dim, isl_dim_out))
5562 isl_die(bmap->ctx, isl_error_invalid,
5563 "domain and range don't match", goto error);
5565 nparam = isl_basic_map_dim(bmap, isl_dim_param);
5566 n = isl_basic_map_dim(bmap, isl_dim_in);
5568 dim = isl_dim_from_range(isl_dim_domain(isl_basic_map_get_dim(bmap)));
5569 domain = isl_basic_map_universe(dim);
5571 bmap = isl_basic_map_from_domain(isl_basic_map_wrap(bmap));
5572 bmap = isl_basic_map_apply_range(bmap, domain);
5573 bmap = isl_basic_map_extend_constraints(bmap, n, 0);
5575 total = isl_basic_map_total_dim(bmap);
5577 for (i = 0; i < n; ++i) {
5578 k = isl_basic_map_alloc_equality(bmap);
5581 isl_seq_clr(bmap->eq[k], 1 + total);
5582 isl_int_set_si(bmap->eq[k][1 + nparam + i], 1);
5583 isl_int_set_si(bmap->eq[k][1 + nparam + n + i], -1);
5584 isl_int_set_si(bmap->eq[k][1 + nparam + n + n + i], 1);
5587 bmap = isl_basic_map_gauss(bmap, NULL);
5588 return isl_basic_map_finalize(bmap);
5590 isl_basic_map_free(bmap);
5595 * returns [domain -> range] -> range - domain
5597 __isl_give isl_map *isl_map_deltas_map(__isl_take isl_map *map)
5600 isl_dim *domain_dim;
5605 if (!isl_dim_tuple_match(map->dim, isl_dim_in, map->dim, isl_dim_out))
5606 isl_die(map->ctx, isl_error_invalid,
5607 "domain and range don't match", goto error);
5609 map = isl_map_cow(map);
5613 domain_dim = isl_dim_from_range(isl_dim_domain(isl_map_get_dim(map)));
5614 map->dim = isl_dim_from_domain(isl_dim_wrap(map->dim));
5615 map->dim = isl_dim_join(map->dim, domain_dim);
5618 for (i = 0; i < map->n; ++i) {
5619 map->p[i] = isl_basic_map_deltas_map(map->p[i]);
5623 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
5630 static struct isl_basic_map *basic_map_identity(struct isl_dim *dims)
5632 struct isl_basic_map *bmap;
5640 nparam = dims->nparam;
5642 bmap = isl_basic_map_alloc_dim(dims, 0, dim, 0);
5646 for (i = 0; i < dim; ++i) {
5647 int j = isl_basic_map_alloc_equality(bmap);
5650 isl_seq_clr(bmap->eq[j], 1 + isl_basic_map_total_dim(bmap));
5651 isl_int_set_si(bmap->eq[j][1+nparam+i], 1);
5652 isl_int_set_si(bmap->eq[j][1+nparam+dim+i], -1);
5654 return isl_basic_map_finalize(bmap);
5656 isl_basic_map_free(bmap);
5660 __isl_give isl_basic_map *isl_basic_map_identity(__isl_take isl_dim *dim)
5664 if (dim->n_in != dim->n_out)
5665 isl_die(dim->ctx, isl_error_invalid,
5666 "number of input and output dimensions needs to be "
5667 "the same", goto error);
5668 return basic_map_identity(dim);
5674 struct isl_basic_map *isl_basic_map_identity_like(struct isl_basic_map *model)
5676 if (!model || !model->dim)
5678 return isl_basic_map_identity(isl_dim_copy(model->dim));
5681 __isl_give isl_map *isl_map_identity(__isl_take isl_dim *dim)
5683 return isl_map_from_basic_map(isl_basic_map_identity(dim));
5686 struct isl_map *isl_map_identity_like(struct isl_map *model)
5688 if (!model || !model->dim)
5690 return isl_map_identity(isl_dim_copy(model->dim));
5693 struct isl_map *isl_map_identity_like_basic_map(struct isl_basic_map *model)
5695 if (!model || !model->dim)
5697 return isl_map_identity(isl_dim_copy(model->dim));
5700 __isl_give isl_map *isl_set_identity(__isl_take isl_set *set)
5702 isl_dim *dim = isl_set_get_dim(set);
5704 id = isl_map_identity(isl_dim_map_from_set(dim));
5705 return isl_map_intersect_range(id, set);
5708 /* Construct a basic set with all set dimensions having only non-negative
5711 struct isl_basic_set *isl_basic_set_positive_orthant(struct isl_dim *dims)
5716 struct isl_basic_set *bset;
5720 nparam = dims->nparam;
5722 bset = isl_basic_set_alloc_dim(dims, 0, 0, dim);
5725 for (i = 0; i < dim; ++i) {
5726 int k = isl_basic_set_alloc_inequality(bset);
5729 isl_seq_clr(bset->ineq[k], 1 + isl_basic_set_total_dim(bset));
5730 isl_int_set_si(bset->ineq[k][1 + nparam + i], 1);
5734 isl_basic_set_free(bset);
5738 /* Construct the half-space x_pos >= 0.
5740 static __isl_give isl_basic_set *nonneg_halfspace(__isl_take isl_dim *dim,
5744 isl_basic_set *nonneg;
5746 nonneg = isl_basic_set_alloc_dim(dim, 0, 0, 1);
5747 k = isl_basic_set_alloc_inequality(nonneg);
5750 isl_seq_clr(nonneg->ineq[k], 1 + isl_basic_set_total_dim(nonneg));
5751 isl_int_set_si(nonneg->ineq[k][pos], 1);
5753 return isl_basic_set_finalize(nonneg);
5755 isl_basic_set_free(nonneg);
5759 /* Construct the half-space x_pos <= -1.
5761 static __isl_give isl_basic_set *neg_halfspace(__isl_take isl_dim *dim, int pos)
5766 neg = isl_basic_set_alloc_dim(dim, 0, 0, 1);
5767 k = isl_basic_set_alloc_inequality(neg);
5770 isl_seq_clr(neg->ineq[k], 1 + isl_basic_set_total_dim(neg));
5771 isl_int_set_si(neg->ineq[k][0], -1);
5772 isl_int_set_si(neg->ineq[k][pos], -1);
5774 return isl_basic_set_finalize(neg);
5776 isl_basic_set_free(neg);
5780 __isl_give isl_set *isl_set_split_dims(__isl_take isl_set *set,
5781 enum isl_dim_type type, unsigned first, unsigned n)
5784 isl_basic_set *nonneg;
5792 isl_assert(set->ctx, first + n <= isl_set_dim(set, type), goto error);
5794 for (i = 0; i < n; ++i) {
5795 nonneg = nonneg_halfspace(isl_set_get_dim(set),
5796 pos(set->dim, type) + first + i);
5797 neg = neg_halfspace(isl_set_get_dim(set),
5798 pos(set->dim, type) + first + i);
5800 set = isl_set_intersect(set, isl_basic_set_union(nonneg, neg));
5809 static int foreach_orthant(__isl_take isl_set *set, int *signs, int first,
5810 int len, int (*fn)(__isl_take isl_set *orthant, int *signs, void *user),
5817 if (isl_set_plain_is_empty(set)) {
5822 return fn(set, signs, user);
5825 half = isl_set_from_basic_set(nonneg_halfspace(isl_set_get_dim(set),
5827 half = isl_set_intersect(half, isl_set_copy(set));
5828 if (foreach_orthant(half, signs, first + 1, len, fn, user) < 0)
5832 half = isl_set_from_basic_set(neg_halfspace(isl_set_get_dim(set),
5834 half = isl_set_intersect(half, set);
5835 return foreach_orthant(half, signs, first + 1, len, fn, user);
5841 /* Call "fn" on the intersections of "set" with each of the orthants
5842 * (except for obviously empty intersections). The orthant is identified
5843 * by the signs array, with each entry having value 1 or -1 according
5844 * to the sign of the corresponding variable.
5846 int isl_set_foreach_orthant(__isl_keep isl_set *set,
5847 int (*fn)(__isl_take isl_set *orthant, int *signs, void *user),
5857 if (isl_set_plain_is_empty(set))
5860 nparam = isl_set_dim(set, isl_dim_param);
5861 nvar = isl_set_dim(set, isl_dim_set);
5863 signs = isl_alloc_array(set->ctx, int, nparam + nvar);
5865 r = foreach_orthant(isl_set_copy(set), signs, 0, nparam + nvar,
5873 int isl_set_is_equal(struct isl_set *set1, struct isl_set *set2)
5875 return isl_map_is_equal((struct isl_map *)set1, (struct isl_map *)set2);
5878 int isl_basic_map_is_subset(
5879 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
5882 struct isl_map *map1;
5883 struct isl_map *map2;
5885 if (!bmap1 || !bmap2)
5888 map1 = isl_map_from_basic_map(isl_basic_map_copy(bmap1));
5889 map2 = isl_map_from_basic_map(isl_basic_map_copy(bmap2));
5891 is_subset = isl_map_is_subset(map1, map2);
5899 int isl_basic_map_is_equal(
5900 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
5904 if (!bmap1 || !bmap2)
5906 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
5909 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
5913 int isl_basic_set_is_equal(
5914 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
5916 return isl_basic_map_is_equal(
5917 (struct isl_basic_map *)bset1, (struct isl_basic_map *)bset2);
5920 int isl_map_is_empty(struct isl_map *map)
5927 for (i = 0; i < map->n; ++i) {
5928 is_empty = isl_basic_map_is_empty(map->p[i]);
5937 int isl_map_plain_is_empty(__isl_keep isl_map *map)
5939 return map ? map->n == 0 : -1;
5942 int isl_map_fast_is_empty(__isl_keep isl_map *map)
5944 return isl_map_plain_is_empty(map);
5947 int isl_set_plain_is_empty(struct isl_set *set)
5949 return set ? set->n == 0 : -1;
5952 int isl_set_fast_is_empty(__isl_keep isl_set *set)
5954 return isl_set_plain_is_empty(set);
5957 int isl_set_is_empty(struct isl_set *set)
5959 return isl_map_is_empty((struct isl_map *)set);
5962 int isl_map_has_equal_dim(__isl_keep isl_map *map1, __isl_keep isl_map *map2)
5967 return isl_dim_equal(map1->dim, map2->dim);
5970 int isl_set_has_equal_dim(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
5975 return isl_dim_equal(set1->dim, set2->dim);
5978 int isl_map_is_equal(struct isl_map *map1, struct isl_map *map2)
5984 is_subset = isl_map_is_subset(map1, map2);
5987 is_subset = isl_map_is_subset(map2, map1);
5991 int isl_basic_map_is_strict_subset(
5992 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
5996 if (!bmap1 || !bmap2)
5998 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
6001 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
6002 if (is_subset == -1)
6007 int isl_map_is_strict_subset(struct isl_map *map1, struct isl_map *map2)
6013 is_subset = isl_map_is_subset(map1, map2);
6016 is_subset = isl_map_is_subset(map2, map1);
6017 if (is_subset == -1)
6022 int isl_set_is_strict_subset(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
6024 return isl_map_is_strict_subset((isl_map *)set1, (isl_map *)set2);
6027 int isl_basic_map_is_universe(struct isl_basic_map *bmap)
6031 return bmap->n_eq == 0 && bmap->n_ineq == 0;
6034 int isl_basic_set_is_universe(struct isl_basic_set *bset)
6038 return bset->n_eq == 0 && bset->n_ineq == 0;
6041 int isl_map_plain_is_universe(__isl_keep isl_map *map)
6048 for (i = 0; i < map->n; ++i) {
6049 int r = isl_basic_map_is_universe(map->p[i]);
6057 int isl_set_plain_is_universe(__isl_keep isl_set *set)
6059 return isl_map_plain_is_universe((isl_map *) set);
6062 int isl_set_fast_is_universe(__isl_keep isl_set *set)
6064 return isl_set_plain_is_universe(set);
6067 int isl_basic_map_is_empty(struct isl_basic_map *bmap)
6069 struct isl_basic_set *bset = NULL;
6070 struct isl_vec *sample = NULL;
6077 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY))
6080 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL)) {
6081 struct isl_basic_map *copy = isl_basic_map_copy(bmap);
6082 copy = isl_basic_map_remove_redundancies(copy);
6083 empty = ISL_F_ISSET(copy, ISL_BASIC_MAP_EMPTY);
6084 isl_basic_map_free(copy);
6088 total = 1 + isl_basic_map_total_dim(bmap);
6089 if (bmap->sample && bmap->sample->size == total) {
6090 int contains = isl_basic_map_contains(bmap, bmap->sample);
6096 isl_vec_free(bmap->sample);
6097 bmap->sample = NULL;
6098 bset = isl_basic_map_underlying_set(isl_basic_map_copy(bmap));
6101 sample = isl_basic_set_sample_vec(bset);
6104 empty = sample->size == 0;
6105 isl_vec_free(bmap->sample);
6106 bmap->sample = sample;
6108 ISL_F_SET(bmap, ISL_BASIC_MAP_EMPTY);
6113 int isl_basic_map_plain_is_empty(__isl_keep isl_basic_map *bmap)
6117 return ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY);
6120 int isl_basic_map_fast_is_empty(__isl_keep isl_basic_map *bmap)
6122 return isl_basic_map_plain_is_empty(bmap);
6125 int isl_basic_set_plain_is_empty(__isl_keep isl_basic_set *bset)
6129 return ISL_F_ISSET(bset, ISL_BASIC_SET_EMPTY);
6132 int isl_basic_set_fast_is_empty(__isl_keep isl_basic_set *bset)
6134 return isl_basic_set_plain_is_empty(bset);
6137 int isl_basic_set_is_empty(struct isl_basic_set *bset)
6139 return isl_basic_map_is_empty((struct isl_basic_map *)bset);
6142 struct isl_map *isl_basic_map_union(
6143 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
6145 struct isl_map *map;
6146 if (!bmap1 || !bmap2)
6149 isl_assert(bmap1->ctx, isl_dim_equal(bmap1->dim, bmap2->dim), goto error);
6151 map = isl_map_alloc_dim(isl_dim_copy(bmap1->dim), 2, 0);
6154 map = isl_map_add_basic_map(map, bmap1);
6155 map = isl_map_add_basic_map(map, bmap2);
6158 isl_basic_map_free(bmap1);
6159 isl_basic_map_free(bmap2);
6163 struct isl_set *isl_basic_set_union(
6164 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
6166 return (struct isl_set *)isl_basic_map_union(
6167 (struct isl_basic_map *)bset1,
6168 (struct isl_basic_map *)bset2);
6171 /* Order divs such that any div only depends on previous divs */
6172 struct isl_basic_map *isl_basic_map_order_divs(struct isl_basic_map *bmap)
6180 off = isl_dim_total(bmap->dim);
6182 for (i = 0; i < bmap->n_div; ++i) {
6184 if (isl_int_is_zero(bmap->div[i][0]))
6186 pos = isl_seq_first_non_zero(bmap->div[i]+1+1+off+i,
6190 isl_basic_map_swap_div(bmap, i, i + pos);
6196 struct isl_basic_set *isl_basic_set_order_divs(struct isl_basic_set *bset)
6198 return (struct isl_basic_set *)
6199 isl_basic_map_order_divs((struct isl_basic_map *)bset);
6202 __isl_give isl_map *isl_map_order_divs(__isl_take isl_map *map)
6209 for (i = 0; i < map->n; ++i) {
6210 map->p[i] = isl_basic_map_order_divs(map->p[i]);
6221 /* Look for a div in dst that corresponds to the div "div" in src.
6222 * The divs before "div" in src and dst are assumed to be the same.
6224 * Returns -1 if no corresponding div was found and the position
6225 * of the corresponding div in dst otherwise.
6227 static int find_div(struct isl_basic_map *dst,
6228 struct isl_basic_map *src, unsigned div)
6232 unsigned total = isl_dim_total(src->dim);
6234 isl_assert(dst->ctx, div <= dst->n_div, return -1);
6235 for (i = div; i < dst->n_div; ++i)
6236 if (isl_seq_eq(dst->div[i], src->div[div], 1+1+total+div) &&
6237 isl_seq_first_non_zero(dst->div[i]+1+1+total+div,
6238 dst->n_div - div) == -1)
6243 struct isl_basic_map *isl_basic_map_align_divs(
6244 struct isl_basic_map *dst, struct isl_basic_map *src)
6247 unsigned total = isl_dim_total(src->dim);
6252 if (src->n_div == 0)
6255 for (i = 0; i < src->n_div; ++i)
6256 isl_assert(src->ctx, !isl_int_is_zero(src->div[i][0]), goto error);
6258 src = isl_basic_map_order_divs(src);
6259 dst = isl_basic_map_cow(dst);
6260 dst = isl_basic_map_extend_dim(dst, isl_dim_copy(dst->dim),
6261 src->n_div, 0, 2 * src->n_div);
6264 for (i = 0; i < src->n_div; ++i) {
6265 int j = find_div(dst, src, i);
6267 j = isl_basic_map_alloc_div(dst);
6270 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total+i);
6271 isl_seq_clr(dst->div[j]+1+1+total+i, dst->n_div - i);
6272 if (isl_basic_map_add_div_constraints(dst, j) < 0)
6276 isl_basic_map_swap_div(dst, i, j);
6280 isl_basic_map_free(dst);
6284 struct isl_basic_set *isl_basic_set_align_divs(
6285 struct isl_basic_set *dst, struct isl_basic_set *src)
6287 return (struct isl_basic_set *)isl_basic_map_align_divs(
6288 (struct isl_basic_map *)dst, (struct isl_basic_map *)src);
6291 struct isl_map *isl_map_align_divs(struct isl_map *map)
6299 map = isl_map_compute_divs(map);
6300 map = isl_map_cow(map);
6304 for (i = 1; i < map->n; ++i)
6305 map->p[0] = isl_basic_map_align_divs(map->p[0], map->p[i]);
6306 for (i = 1; i < map->n; ++i)
6307 map->p[i] = isl_basic_map_align_divs(map->p[i], map->p[0]);
6309 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
6313 struct isl_set *isl_set_align_divs(struct isl_set *set)
6315 return (struct isl_set *)isl_map_align_divs((struct isl_map *)set);
6318 struct isl_set *isl_set_apply(struct isl_set *set, struct isl_map *map)
6322 isl_assert(set->ctx, isl_map_compatible_domain(map, set), goto error);
6323 map = isl_map_intersect_domain(map, set);
6324 set = isl_map_range(map);
6332 /* There is no need to cow as removing empty parts doesn't change
6333 * the meaning of the set.
6335 struct isl_map *isl_map_remove_empty_parts(struct isl_map *map)
6342 for (i = map->n-1; i >= 0; --i) {
6343 if (!ISL_F_ISSET(map->p[i], ISL_BASIC_MAP_EMPTY))
6345 isl_basic_map_free(map->p[i]);
6346 if (i != map->n-1) {
6347 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
6348 map->p[i] = map->p[map->n-1];
6356 struct isl_set *isl_set_remove_empty_parts(struct isl_set *set)
6358 return (struct isl_set *)
6359 isl_map_remove_empty_parts((struct isl_map *)set);
6362 struct isl_basic_map *isl_map_copy_basic_map(struct isl_map *map)
6364 struct isl_basic_map *bmap;
6365 if (!map || map->n == 0)
6367 bmap = map->p[map->n-1];
6368 isl_assert(map->ctx, ISL_F_ISSET(bmap, ISL_BASIC_SET_FINAL), return NULL);
6369 return isl_basic_map_copy(bmap);
6372 struct isl_basic_set *isl_set_copy_basic_set(struct isl_set *set)
6374 return (struct isl_basic_set *)
6375 isl_map_copy_basic_map((struct isl_map *)set);
6378 __isl_give isl_map *isl_map_drop_basic_map(__isl_take isl_map *map,
6379 __isl_keep isl_basic_map *bmap)
6385 for (i = map->n-1; i >= 0; --i) {
6386 if (map->p[i] != bmap)
6388 map = isl_map_cow(map);
6391 isl_basic_map_free(map->p[i]);
6392 if (i != map->n-1) {
6393 ISL_F_CLR(map, ISL_SET_NORMALIZED);
6394 map->p[i] = map->p[map->n-1];
6405 struct isl_set *isl_set_drop_basic_set(struct isl_set *set,
6406 struct isl_basic_set *bset)
6408 return (struct isl_set *)isl_map_drop_basic_map((struct isl_map *)set,
6409 (struct isl_basic_map *)bset);
6412 /* Given two basic sets bset1 and bset2, compute the maximal difference
6413 * between the values of dimension pos in bset1 and those in bset2
6414 * for any common value of the parameters and dimensions preceding pos.
6416 static enum isl_lp_result basic_set_maximal_difference_at(
6417 __isl_keep isl_basic_set *bset1, __isl_keep isl_basic_set *bset2,
6418 int pos, isl_int *opt)
6420 struct isl_dim *dims;
6421 struct isl_basic_map *bmap1 = NULL;
6422 struct isl_basic_map *bmap2 = NULL;
6423 struct isl_ctx *ctx;
6424 struct isl_vec *obj;
6427 unsigned dim1, dim2;
6428 enum isl_lp_result res;
6430 if (!bset1 || !bset2)
6431 return isl_lp_error;
6433 nparam = isl_basic_set_n_param(bset1);
6434 dim1 = isl_basic_set_n_dim(bset1);
6435 dim2 = isl_basic_set_n_dim(bset2);
6436 dims = isl_dim_alloc(bset1->ctx, nparam, pos, dim1 - pos);
6437 bmap1 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset1), dims);
6438 dims = isl_dim_alloc(bset2->ctx, nparam, pos, dim2 - pos);
6439 bmap2 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset2), dims);
6440 if (!bmap1 || !bmap2)
6442 bmap1 = isl_basic_map_cow(bmap1);
6443 bmap1 = isl_basic_map_extend(bmap1, nparam,
6444 pos, (dim1 - pos) + (dim2 - pos),
6445 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
6446 bmap1 = add_constraints(bmap1, bmap2, 0, dim1 - pos);
6449 total = isl_basic_map_total_dim(bmap1);
6451 obj = isl_vec_alloc(ctx, 1 + total);
6452 isl_seq_clr(obj->block.data, 1 + total);
6453 isl_int_set_si(obj->block.data[1+nparam+pos], 1);
6454 isl_int_set_si(obj->block.data[1+nparam+pos+(dim1-pos)], -1);
6457 res = isl_basic_map_solve_lp(bmap1, 1, obj->block.data, ctx->one,
6459 isl_basic_map_free(bmap1);
6463 isl_basic_map_free(bmap1);
6464 isl_basic_map_free(bmap2);
6465 return isl_lp_error;
6468 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
6469 * for any common value of the parameters and dimensions preceding pos
6470 * in both basic sets, the values of dimension pos in bset1 are
6471 * smaller or larger than those in bset2.
6474 * 1 if bset1 follows bset2
6475 * -1 if bset1 precedes bset2
6476 * 0 if bset1 and bset2 are incomparable
6477 * -2 if some error occurred.
6479 int isl_basic_set_compare_at(struct isl_basic_set *bset1,
6480 struct isl_basic_set *bset2, int pos)
6483 enum isl_lp_result res;
6488 res = basic_set_maximal_difference_at(bset1, bset2, pos, &opt);
6490 if (res == isl_lp_empty)
6492 else if ((res == isl_lp_ok && isl_int_is_pos(opt)) ||
6493 res == isl_lp_unbounded)
6495 else if (res == isl_lp_ok && isl_int_is_neg(opt))
6504 /* Given two basic sets bset1 and bset2, check whether
6505 * for any common value of the parameters and dimensions preceding pos
6506 * there is a value of dimension pos in bset1 that is larger
6507 * than a value of the same dimension in bset2.
6510 * 1 if there exists such a pair
6511 * 0 if there is no such pair, but there is a pair of equal values
6513 * -2 if some error occurred.
6515 int isl_basic_set_follows_at(__isl_keep isl_basic_set *bset1,
6516 __isl_keep isl_basic_set *bset2, int pos)
6519 enum isl_lp_result res;
6524 res = basic_set_maximal_difference_at(bset1, bset2, pos, &opt);
6526 if (res == isl_lp_empty)
6528 else if ((res == isl_lp_ok && isl_int_is_pos(opt)) ||
6529 res == isl_lp_unbounded)
6531 else if (res == isl_lp_ok && isl_int_is_neg(opt))
6533 else if (res == isl_lp_ok)
6542 /* Given two sets set1 and set2, check whether
6543 * for any common value of the parameters and dimensions preceding pos
6544 * there is a value of dimension pos in set1 that is larger
6545 * than a value of the same dimension in set2.
6548 * 1 if there exists such a pair
6549 * 0 if there is no such pair, but there is a pair of equal values
6551 * -2 if some error occurred.
6553 int isl_set_follows_at(__isl_keep isl_set *set1,
6554 __isl_keep isl_set *set2, int pos)
6562 for (i = 0; i < set1->n; ++i)
6563 for (j = 0; j < set2->n; ++j) {
6565 f = isl_basic_set_follows_at(set1->p[i], set2->p[j], pos);
6566 if (f == 1 || f == -2)
6575 static int isl_basic_map_plain_has_fixed_var(__isl_keep isl_basic_map *bmap,
6576 unsigned pos, isl_int *val)
6584 total = isl_basic_map_total_dim(bmap);
6585 for (i = 0, d = total-1; i < bmap->n_eq && d+1 > pos; ++i) {
6586 for (; d+1 > pos; --d)
6587 if (!isl_int_is_zero(bmap->eq[i][1+d]))
6591 if (isl_seq_first_non_zero(bmap->eq[i]+1, d) != -1)
6593 if (isl_seq_first_non_zero(bmap->eq[i]+1+d+1, total-d-1) != -1)
6595 if (!isl_int_is_one(bmap->eq[i][1+d]))
6598 isl_int_neg(*val, bmap->eq[i][0]);
6604 static int isl_map_plain_has_fixed_var(__isl_keep isl_map *map,
6605 unsigned pos, isl_int *val)
6617 return isl_basic_map_plain_has_fixed_var(map->p[0], pos, val);
6620 fixed = isl_basic_map_plain_has_fixed_var(map->p[0], pos, &v);
6621 for (i = 1; fixed == 1 && i < map->n; ++i) {
6622 fixed = isl_basic_map_plain_has_fixed_var(map->p[i], pos, &tmp);
6623 if (fixed == 1 && isl_int_ne(tmp, v))
6627 isl_int_set(*val, v);
6633 static int isl_basic_set_plain_has_fixed_var(__isl_keep isl_basic_set *bset,
6634 unsigned pos, isl_int *val)
6636 return isl_basic_map_plain_has_fixed_var((struct isl_basic_map *)bset,
6640 static int isl_set_plain_has_fixed_var(__isl_keep isl_set *set, unsigned pos,
6643 return isl_map_plain_has_fixed_var((struct isl_map *)set, pos, val);
6646 int isl_basic_map_plain_is_fixed(__isl_keep isl_basic_map *bmap,
6647 enum isl_dim_type type, unsigned pos, isl_int *val)
6649 if (pos >= isl_basic_map_dim(bmap, type))
6651 return isl_basic_map_plain_has_fixed_var(bmap,
6652 isl_basic_map_offset(bmap, type) - 1 + pos, val);
6655 int isl_map_plain_is_fixed(__isl_keep isl_map *map,
6656 enum isl_dim_type type, unsigned pos, isl_int *val)
6658 if (pos >= isl_map_dim(map, type))
6660 return isl_map_plain_has_fixed_var(map,
6661 map_offset(map, type) - 1 + pos, val);
6664 int isl_map_fast_is_fixed(__isl_keep isl_map *map,
6665 enum isl_dim_type type, unsigned pos, isl_int *val)
6667 return isl_map_plain_is_fixed(map, type, pos, val);
6670 /* Check if dimension dim has fixed value and if so and if val is not NULL,
6671 * then return this fixed value in *val.
6673 int isl_basic_set_plain_dim_is_fixed(__isl_keep isl_basic_set *bset,
6674 unsigned dim, isl_int *val)
6676 return isl_basic_set_plain_has_fixed_var(bset,
6677 isl_basic_set_n_param(bset) + dim, val);
6680 /* Check if dimension dim has fixed value and if so and if val is not NULL,
6681 * then return this fixed value in *val.
6683 int isl_set_plain_dim_is_fixed(__isl_keep isl_set *set,
6684 unsigned dim, isl_int *val)
6686 return isl_set_plain_has_fixed_var(set, isl_set_n_param(set) + dim, val);
6689 int isl_set_fast_dim_is_fixed(__isl_keep isl_set *set,
6690 unsigned dim, isl_int *val)
6692 return isl_set_plain_dim_is_fixed(set, dim, val);
6695 /* Check if input variable in has fixed value and if so and if val is not NULL,
6696 * then return this fixed value in *val.
6698 int isl_map_plain_input_is_fixed(__isl_keep isl_map *map,
6699 unsigned in, isl_int *val)
6701 return isl_map_plain_has_fixed_var(map, isl_map_n_param(map) + in, val);
6704 /* Check if dimension dim has an (obvious) fixed lower bound and if so
6705 * and if val is not NULL, then return this lower bound in *val.
6707 int isl_basic_set_plain_dim_has_fixed_lower_bound(
6708 __isl_keep isl_basic_set *bset, unsigned dim, isl_int *val)
6710 int i, i_eq = -1, i_ineq = -1;
6717 total = isl_basic_set_total_dim(bset);
6718 nparam = isl_basic_set_n_param(bset);
6719 for (i = 0; i < bset->n_eq; ++i) {
6720 if (isl_int_is_zero(bset->eq[i][1+nparam+dim]))
6726 for (i = 0; i < bset->n_ineq; ++i) {
6727 if (!isl_int_is_pos(bset->ineq[i][1+nparam+dim]))
6729 if (i_eq != -1 || i_ineq != -1)
6733 if (i_eq == -1 && i_ineq == -1)
6735 c = i_eq != -1 ? bset->eq[i_eq] : bset->ineq[i_ineq];
6736 /* The coefficient should always be one due to normalization. */
6737 if (!isl_int_is_one(c[1+nparam+dim]))
6739 if (isl_seq_first_non_zero(c+1, nparam+dim) != -1)
6741 if (isl_seq_first_non_zero(c+1+nparam+dim+1,
6742 total - nparam - dim - 1) != -1)
6745 isl_int_neg(*val, c[0]);
6749 int isl_set_plain_dim_has_fixed_lower_bound(__isl_keep isl_set *set,
6750 unsigned dim, isl_int *val)
6762 return isl_basic_set_plain_dim_has_fixed_lower_bound(set->p[0],
6766 fixed = isl_basic_set_plain_dim_has_fixed_lower_bound(set->p[0],
6768 for (i = 1; fixed == 1 && i < set->n; ++i) {
6769 fixed = isl_basic_set_plain_dim_has_fixed_lower_bound(set->p[i],
6771 if (fixed == 1 && isl_int_ne(tmp, v))
6775 isl_int_set(*val, v);
6786 /* uset_gist depends on constraints without existentially quantified
6787 * variables sorting first.
6789 static int qsort_constraint_cmp(const void *p1, const void *p2)
6791 const struct constraint *c1 = (const struct constraint *)p1;
6792 const struct constraint *c2 = (const struct constraint *)p2;
6794 unsigned size = isl_min(c1->size, c2->size);
6796 l1 = isl_seq_last_non_zero(c1->c, size);
6797 l2 = isl_seq_last_non_zero(c2->c, size);
6802 return isl_seq_cmp(c1->c, c2->c, size);
6805 static struct isl_basic_map *isl_basic_map_sort_constraints(
6806 struct isl_basic_map *bmap)
6809 struct constraint *c;
6814 total = isl_basic_map_total_dim(bmap);
6815 c = isl_alloc_array(bmap->ctx, struct constraint, bmap->n_ineq);
6818 for (i = 0; i < bmap->n_ineq; ++i) {
6820 c[i].c = bmap->ineq[i];
6822 qsort(c, bmap->n_ineq, sizeof(struct constraint), qsort_constraint_cmp);
6823 for (i = 0; i < bmap->n_ineq; ++i)
6824 bmap->ineq[i] = c[i].c;
6828 isl_basic_map_free(bmap);
6832 __isl_give isl_basic_set *isl_basic_set_sort_constraints(
6833 __isl_take isl_basic_set *bset)
6835 return (struct isl_basic_set *)isl_basic_map_sort_constraints(
6836 (struct isl_basic_map *)bset);
6839 struct isl_basic_map *isl_basic_map_normalize(struct isl_basic_map *bmap)
6843 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_NORMALIZED))
6845 bmap = isl_basic_map_remove_redundancies(bmap);
6846 bmap = isl_basic_map_sort_constraints(bmap);
6847 ISL_F_SET(bmap, ISL_BASIC_MAP_NORMALIZED);
6851 struct isl_basic_set *isl_basic_set_normalize(struct isl_basic_set *bset)
6853 return (struct isl_basic_set *)isl_basic_map_normalize(
6854 (struct isl_basic_map *)bset);
6857 int isl_basic_map_plain_cmp(const __isl_keep isl_basic_map *bmap1,
6858 const __isl_keep isl_basic_map *bmap2)
6865 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_RATIONAL) !=
6866 ISL_F_ISSET(bmap2, ISL_BASIC_MAP_RATIONAL))
6867 return ISL_F_ISSET(bmap1, ISL_BASIC_MAP_RATIONAL) ? -1 : 1;
6868 if (isl_basic_map_n_param(bmap1) != isl_basic_map_n_param(bmap2))
6869 return isl_basic_map_n_param(bmap1) - isl_basic_map_n_param(bmap2);
6870 if (isl_basic_map_n_in(bmap1) != isl_basic_map_n_in(bmap2))
6871 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
6872 if (isl_basic_map_n_out(bmap1) != isl_basic_map_n_out(bmap2))
6873 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
6874 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY) &&
6875 ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
6877 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY))
6879 if (ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
6881 if (bmap1->n_eq != bmap2->n_eq)
6882 return bmap1->n_eq - bmap2->n_eq;
6883 if (bmap1->n_ineq != bmap2->n_ineq)
6884 return bmap1->n_ineq - bmap2->n_ineq;
6885 if (bmap1->n_div != bmap2->n_div)
6886 return bmap1->n_div - bmap2->n_div;
6887 total = isl_basic_map_total_dim(bmap1);
6888 for (i = 0; i < bmap1->n_eq; ++i) {
6889 cmp = isl_seq_cmp(bmap1->eq[i], bmap2->eq[i], 1+total);
6893 for (i = 0; i < bmap1->n_ineq; ++i) {
6894 cmp = isl_seq_cmp(bmap1->ineq[i], bmap2->ineq[i], 1+total);
6898 for (i = 0; i < bmap1->n_div; ++i) {
6899 cmp = isl_seq_cmp(bmap1->div[i], bmap2->div[i], 1+1+total);
6906 int isl_basic_map_plain_is_equal(__isl_keep isl_basic_map *bmap1,
6907 __isl_keep isl_basic_map *bmap2)
6909 return isl_basic_map_plain_cmp(bmap1, bmap2) == 0;
6912 int isl_basic_set_plain_is_equal(__isl_keep isl_basic_set *bset1,
6913 __isl_keep isl_basic_set *bset2)
6915 return isl_basic_map_plain_is_equal((isl_basic_map *)bset1,
6916 (isl_basic_map *)bset2);
6919 static int qsort_bmap_cmp(const void *p1, const void *p2)
6921 const struct isl_basic_map *bmap1 = *(const struct isl_basic_map **)p1;
6922 const struct isl_basic_map *bmap2 = *(const struct isl_basic_map **)p2;
6924 return isl_basic_map_plain_cmp(bmap1, bmap2);
6927 /* We normalize in place, but if anything goes wrong we need
6928 * to return NULL, so we need to make sure we don't change the
6929 * meaning of any possible other copies of map.
6931 struct isl_map *isl_map_normalize(struct isl_map *map)
6934 struct isl_basic_map *bmap;
6938 if (ISL_F_ISSET(map, ISL_MAP_NORMALIZED))
6940 for (i = 0; i < map->n; ++i) {
6941 bmap = isl_basic_map_normalize(isl_basic_map_copy(map->p[i]));
6944 isl_basic_map_free(map->p[i]);
6947 qsort(map->p, map->n, sizeof(struct isl_basic_map *), qsort_bmap_cmp);
6948 ISL_F_SET(map, ISL_MAP_NORMALIZED);
6949 map = isl_map_remove_empty_parts(map);
6952 for (i = map->n - 1; i >= 1; --i) {
6953 if (!isl_basic_map_plain_is_equal(map->p[i-1], map->p[i]))
6955 isl_basic_map_free(map->p[i-1]);
6956 for (j = i; j < map->n; ++j)
6957 map->p[j-1] = map->p[j];
6967 struct isl_set *isl_set_normalize(struct isl_set *set)
6969 return (struct isl_set *)isl_map_normalize((struct isl_map *)set);
6972 int isl_map_plain_is_equal(__isl_keep isl_map *map1, __isl_keep isl_map *map2)
6982 if (!isl_dim_equal(map1->dim, map2->dim))
6985 map1 = isl_map_copy(map1);
6986 map2 = isl_map_copy(map2);
6987 map1 = isl_map_normalize(map1);
6988 map2 = isl_map_normalize(map2);
6991 equal = map1->n == map2->n;
6992 for (i = 0; equal && i < map1->n; ++i) {
6993 equal = isl_basic_map_plain_is_equal(map1->p[i], map2->p[i]);
7006 int isl_map_fast_is_equal(__isl_keep isl_map *map1, __isl_keep isl_map *map2)
7008 return isl_map_plain_is_equal(map1, map2);
7011 int isl_set_plain_is_equal(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
7013 return isl_map_plain_is_equal((struct isl_map *)set1,
7014 (struct isl_map *)set2);
7017 int isl_set_fast_is_equal(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
7019 return isl_set_plain_is_equal(set1, set2);
7022 /* Return an interval that ranges from min to max (inclusive)
7024 struct isl_basic_set *isl_basic_set_interval(struct isl_ctx *ctx,
7025 isl_int min, isl_int max)
7028 struct isl_basic_set *bset = NULL;
7030 bset = isl_basic_set_alloc(ctx, 0, 1, 0, 0, 2);
7034 k = isl_basic_set_alloc_inequality(bset);
7037 isl_int_set_si(bset->ineq[k][1], 1);
7038 isl_int_neg(bset->ineq[k][0], min);
7040 k = isl_basic_set_alloc_inequality(bset);
7043 isl_int_set_si(bset->ineq[k][1], -1);
7044 isl_int_set(bset->ineq[k][0], max);
7048 isl_basic_set_free(bset);
7052 /* Return the Cartesian product of the basic sets in list (in the given order).
7054 __isl_give isl_basic_set *isl_basic_set_list_product(
7055 __isl_take struct isl_basic_set_list *list)
7063 struct isl_basic_set *product = NULL;
7067 isl_assert(list->ctx, list->n > 0, goto error);
7068 isl_assert(list->ctx, list->p[0], goto error);
7069 nparam = isl_basic_set_n_param(list->p[0]);
7070 dim = isl_basic_set_n_dim(list->p[0]);
7071 extra = list->p[0]->n_div;
7072 n_eq = list->p[0]->n_eq;
7073 n_ineq = list->p[0]->n_ineq;
7074 for (i = 1; i < list->n; ++i) {
7075 isl_assert(list->ctx, list->p[i], goto error);
7076 isl_assert(list->ctx,
7077 nparam == isl_basic_set_n_param(list->p[i]), goto error);
7078 dim += isl_basic_set_n_dim(list->p[i]);
7079 extra += list->p[i]->n_div;
7080 n_eq += list->p[i]->n_eq;
7081 n_ineq += list->p[i]->n_ineq;
7083 product = isl_basic_set_alloc(list->ctx, nparam, dim, extra,
7088 for (i = 0; i < list->n; ++i) {
7089 isl_basic_set_add_constraints(product,
7090 isl_basic_set_copy(list->p[i]), dim);
7091 dim += isl_basic_set_n_dim(list->p[i]);
7093 isl_basic_set_list_free(list);
7096 isl_basic_set_free(product);
7097 isl_basic_set_list_free(list);
7101 struct isl_basic_map *isl_basic_map_product(
7102 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
7104 struct isl_dim *dim_result = NULL;
7105 struct isl_basic_map *bmap;
7106 unsigned in1, in2, out1, out2, nparam, total, pos;
7107 struct isl_dim_map *dim_map1, *dim_map2;
7109 if (!bmap1 || !bmap2)
7112 isl_assert(bmap1->ctx, isl_dim_match(bmap1->dim, isl_dim_param,
7113 bmap2->dim, isl_dim_param), goto error);
7114 dim_result = isl_dim_product(isl_dim_copy(bmap1->dim),
7115 isl_dim_copy(bmap2->dim));
7117 in1 = isl_basic_map_n_in(bmap1);
7118 in2 = isl_basic_map_n_in(bmap2);
7119 out1 = isl_basic_map_n_out(bmap1);
7120 out2 = isl_basic_map_n_out(bmap2);
7121 nparam = isl_basic_map_n_param(bmap1);
7123 total = nparam + in1 + in2 + out1 + out2 + bmap1->n_div + bmap2->n_div;
7124 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
7125 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
7126 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
7127 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
7128 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
7129 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos += in1);
7130 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += in2);
7131 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += out1);
7132 isl_dim_map_div(dim_map1, bmap1, pos += out2);
7133 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
7135 bmap = isl_basic_map_alloc_dim(dim_result,
7136 bmap1->n_div + bmap2->n_div,
7137 bmap1->n_eq + bmap2->n_eq,
7138 bmap1->n_ineq + bmap2->n_ineq);
7139 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap1, dim_map1);
7140 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap2, dim_map2);
7141 bmap = isl_basic_map_simplify(bmap);
7142 return isl_basic_map_finalize(bmap);
7144 isl_basic_map_free(bmap1);
7145 isl_basic_map_free(bmap2);
7149 __isl_give isl_basic_map *isl_basic_map_flat_product(
7150 __isl_take isl_basic_map *bmap1, __isl_take isl_basic_map *bmap2)
7152 isl_basic_map *prod;
7154 prod = isl_basic_map_product(bmap1, bmap2);
7155 prod = isl_basic_map_flatten(prod);
7159 __isl_give isl_basic_set *isl_basic_set_flat_product(
7160 __isl_take isl_basic_set *bset1, __isl_take isl_basic_set *bset2)
7162 return isl_basic_map_flat_product(bset1, bset2);
7165 __isl_give isl_basic_map *isl_basic_map_range_product(
7166 __isl_take isl_basic_map *bmap1, __isl_take isl_basic_map *bmap2)
7168 isl_dim *dim_result = NULL;
7169 isl_basic_map *bmap;
7170 unsigned in, out1, out2, nparam, total, pos;
7171 struct isl_dim_map *dim_map1, *dim_map2;
7173 if (!bmap1 || !bmap2)
7176 dim_result = isl_dim_range_product(isl_dim_copy(bmap1->dim),
7177 isl_dim_copy(bmap2->dim));
7179 in = isl_basic_map_dim(bmap1, isl_dim_in);
7180 out1 = isl_basic_map_n_out(bmap1);
7181 out2 = isl_basic_map_n_out(bmap2);
7182 nparam = isl_basic_map_n_param(bmap1);
7184 total = nparam + in + out1 + out2 + bmap1->n_div + bmap2->n_div;
7185 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
7186 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
7187 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
7188 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
7189 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
7190 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
7191 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += in);
7192 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += out1);
7193 isl_dim_map_div(dim_map1, bmap1, pos += out2);
7194 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
7196 bmap = isl_basic_map_alloc_dim(dim_result,
7197 bmap1->n_div + bmap2->n_div,
7198 bmap1->n_eq + bmap2->n_eq,
7199 bmap1->n_ineq + bmap2->n_ineq);
7200 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap1, dim_map1);
7201 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap2, dim_map2);
7202 bmap = isl_basic_map_simplify(bmap);
7203 return isl_basic_map_finalize(bmap);
7205 isl_basic_map_free(bmap1);
7206 isl_basic_map_free(bmap2);
7210 static __isl_give isl_map *map_product(__isl_take isl_map *map1,
7211 __isl_take isl_map *map2,
7212 __isl_give isl_dim *(*dim_product)(__isl_take isl_dim *left,
7213 __isl_take isl_dim *right),
7214 __isl_give isl_basic_map *(*basic_map_product)(
7215 __isl_take isl_basic_map *left, __isl_take isl_basic_map *right))
7218 struct isl_map *result;
7224 isl_assert(map1->ctx, isl_dim_match(map1->dim, isl_dim_param,
7225 map2->dim, isl_dim_param), goto error);
7227 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
7228 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
7229 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
7231 result = isl_map_alloc_dim(dim_product(isl_dim_copy(map1->dim),
7232 isl_dim_copy(map2->dim)),
7233 map1->n * map2->n, flags);
7236 for (i = 0; i < map1->n; ++i)
7237 for (j = 0; j < map2->n; ++j) {
7238 struct isl_basic_map *part;
7239 part = basic_map_product(isl_basic_map_copy(map1->p[i]),
7240 isl_basic_map_copy(map2->p[j]));
7241 if (isl_basic_map_is_empty(part))
7242 isl_basic_map_free(part);
7244 result = isl_map_add_basic_map(result, part);
7257 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> [B -> D]
7259 struct isl_map *isl_map_product(struct isl_map *map1, struct isl_map *map2)
7261 return map_product(map1, map2, &isl_dim_product, &isl_basic_map_product);
7264 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
7266 __isl_give isl_map *isl_map_flat_product(__isl_take isl_map *map1,
7267 __isl_take isl_map *map2)
7271 prod = isl_map_product(map1, map2);
7272 prod = isl_map_flatten(prod);
7276 /* Given two set A and B, construct its Cartesian product A x B.
7278 struct isl_set *isl_set_product(struct isl_set *set1, struct isl_set *set2)
7280 return (struct isl_set *)isl_map_product((struct isl_map *)set1,
7281 (struct isl_map *)set2);
7284 __isl_give isl_set *isl_set_flat_product(__isl_take isl_set *set1,
7285 __isl_take isl_set *set2)
7287 return (isl_set *)isl_map_flat_product((isl_map *)set1, (isl_map *)set2);
7290 /* Given two maps A -> B and C -> D, construct a map (A * C) -> [B -> D]
7292 __isl_give isl_map *isl_map_range_product(__isl_take isl_map *map1,
7293 __isl_take isl_map *map2)
7295 return map_product(map1, map2, &isl_dim_range_product,
7296 &isl_basic_map_range_product);
7299 uint32_t isl_basic_map_get_hash(__isl_keep isl_basic_map *bmap)
7302 uint32_t hash = isl_hash_init();
7307 bmap = isl_basic_map_copy(bmap);
7308 bmap = isl_basic_map_normalize(bmap);
7311 total = isl_basic_map_total_dim(bmap);
7312 isl_hash_byte(hash, bmap->n_eq & 0xFF);
7313 for (i = 0; i < bmap->n_eq; ++i) {
7315 c_hash = isl_seq_get_hash(bmap->eq[i], 1 + total);
7316 isl_hash_hash(hash, c_hash);
7318 isl_hash_byte(hash, bmap->n_ineq & 0xFF);
7319 for (i = 0; i < bmap->n_ineq; ++i) {
7321 c_hash = isl_seq_get_hash(bmap->ineq[i], 1 + total);
7322 isl_hash_hash(hash, c_hash);
7324 isl_hash_byte(hash, bmap->n_div & 0xFF);
7325 for (i = 0; i < bmap->n_div; ++i) {
7327 if (isl_int_is_zero(bmap->div[i][0]))
7329 isl_hash_byte(hash, i & 0xFF);
7330 c_hash = isl_seq_get_hash(bmap->div[i], 1 + 1 + total);
7331 isl_hash_hash(hash, c_hash);
7333 isl_basic_map_free(bmap);
7337 uint32_t isl_basic_set_get_hash(__isl_keep isl_basic_set *bset)
7339 return isl_basic_map_get_hash((isl_basic_map *)bset);
7342 uint32_t isl_map_get_hash(__isl_keep isl_map *map)
7349 map = isl_map_copy(map);
7350 map = isl_map_normalize(map);
7354 hash = isl_hash_init();
7355 for (i = 0; i < map->n; ++i) {
7357 bmap_hash = isl_basic_map_get_hash(map->p[i]);
7358 isl_hash_hash(hash, bmap_hash);
7366 uint32_t isl_set_get_hash(__isl_keep isl_set *set)
7368 return isl_map_get_hash((isl_map *)set);
7371 /* Check if the value for dimension dim is completely determined
7372 * by the values of the other parameters and variables.
7373 * That is, check if dimension dim is involved in an equality.
7375 int isl_basic_set_dim_is_unique(struct isl_basic_set *bset, unsigned dim)
7382 nparam = isl_basic_set_n_param(bset);
7383 for (i = 0; i < bset->n_eq; ++i)
7384 if (!isl_int_is_zero(bset->eq[i][1 + nparam + dim]))
7389 /* Check if the value for dimension dim is completely determined
7390 * by the values of the other parameters and variables.
7391 * That is, check if dimension dim is involved in an equality
7392 * for each of the subsets.
7394 int isl_set_dim_is_unique(struct isl_set *set, unsigned dim)
7400 for (i = 0; i < set->n; ++i) {
7402 unique = isl_basic_set_dim_is_unique(set->p[i], dim);
7409 int isl_set_n_basic_set(__isl_keep isl_set *set)
7411 return set ? set->n : 0;
7414 int isl_map_foreach_basic_map(__isl_keep isl_map *map,
7415 int (*fn)(__isl_take isl_basic_map *bmap, void *user), void *user)
7422 for (i = 0; i < map->n; ++i)
7423 if (fn(isl_basic_map_copy(map->p[i]), user) < 0)
7429 int isl_set_foreach_basic_set(__isl_keep isl_set *set,
7430 int (*fn)(__isl_take isl_basic_set *bset, void *user), void *user)
7437 for (i = 0; i < set->n; ++i)
7438 if (fn(isl_basic_set_copy(set->p[i]), user) < 0)
7444 __isl_give isl_basic_set *isl_basic_set_lift(__isl_take isl_basic_set *bset)
7446 struct isl_dim *dim;
7451 bset = isl_basic_set_cow(bset);
7455 dim = isl_basic_set_get_dim(bset);
7456 dim = isl_dim_lift(dim, bset->n_div);
7459 isl_dim_free(bset->dim);
7461 bset->extra -= bset->n_div;
7464 bset = isl_basic_set_finalize(bset);
7468 isl_basic_set_free(bset);
7472 __isl_give isl_set *isl_set_lift(__isl_take isl_set *set)
7475 struct isl_dim *dim;
7478 set = isl_set_align_divs(set);
7483 set = isl_set_cow(set);
7487 n_div = set->p[0]->n_div;
7488 dim = isl_set_get_dim(set);
7489 dim = isl_dim_lift(dim, n_div);
7492 isl_dim_free(set->dim);
7495 for (i = 0; i < set->n; ++i) {
7496 set->p[i] = isl_basic_set_lift(set->p[i]);
7507 __isl_give isl_map *isl_set_lifting(__isl_take isl_set *set)
7509 struct isl_dim *dim;
7510 struct isl_basic_map *bmap;
7517 set = isl_set_align_divs(set);
7522 dim = isl_set_get_dim(set);
7523 if (set->n == 0 || set->p[0]->n_div == 0) {
7525 return isl_map_identity(isl_dim_map_from_set(dim));
7528 n_div = set->p[0]->n_div;
7529 dim = isl_dim_map_from_set(dim);
7530 n_param = isl_dim_size(dim, isl_dim_param);
7531 n_set = isl_dim_size(dim, isl_dim_in);
7532 dim = isl_dim_extend(dim, n_param, n_set, n_set + n_div);
7533 bmap = isl_basic_map_alloc_dim(dim, 0, n_set, 2 * n_div);
7534 for (i = 0; i < n_set; ++i)
7535 bmap = var_equal(bmap, i);
7537 total = n_param + n_set + n_set + n_div;
7538 for (i = 0; i < n_div; ++i) {
7539 k = isl_basic_map_alloc_inequality(bmap);
7542 isl_seq_cpy(bmap->ineq[k], set->p[0]->div[i]+1, 1+n_param);
7543 isl_seq_clr(bmap->ineq[k]+1+n_param, n_set);
7544 isl_seq_cpy(bmap->ineq[k]+1+n_param+n_set,
7545 set->p[0]->div[i]+1+1+n_param, n_set + n_div);
7546 isl_int_neg(bmap->ineq[k][1+n_param+n_set+n_set+i],
7547 set->p[0]->div[i][0]);
7549 l = isl_basic_map_alloc_inequality(bmap);
7552 isl_seq_neg(bmap->ineq[l], bmap->ineq[k], 1 + total);
7553 isl_int_add(bmap->ineq[l][0], bmap->ineq[l][0],
7554 set->p[0]->div[i][0]);
7555 isl_int_sub_ui(bmap->ineq[l][0], bmap->ineq[l][0], 1);
7559 bmap = isl_basic_map_simplify(bmap);
7560 bmap = isl_basic_map_finalize(bmap);
7561 return isl_map_from_basic_map(bmap);
7564 isl_basic_map_free(bmap);
7568 int isl_basic_set_size(__isl_keep isl_basic_set *bset)
7576 dim = isl_basic_set_total_dim(bset);
7577 size += bset->n_eq * (1 + dim);
7578 size += bset->n_ineq * (1 + dim);
7579 size += bset->n_div * (2 + dim);
7584 int isl_set_size(__isl_keep isl_set *set)
7592 for (i = 0; i < set->n; ++i)
7593 size += isl_basic_set_size(set->p[i]);
7598 int isl_basic_map_dim_is_bounded(__isl_keep isl_basic_map *bmap,
7599 enum isl_dim_type type, unsigned pos)
7607 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), return -1);
7609 pos += isl_basic_map_offset(bmap, type);
7611 for (i = 0; i < bmap->n_eq; ++i)
7612 if (!isl_int_is_zero(bmap->eq[i][pos]))
7616 for (i = 0; i < bmap->n_ineq; ++i) {
7617 int sgn = isl_int_sgn(bmap->ineq[i][pos]);
7624 return lower && upper;
7627 int isl_map_dim_is_bounded(__isl_keep isl_map *map,
7628 enum isl_dim_type type, unsigned pos)
7635 for (i = 0; i < map->n; ++i) {
7637 bounded = isl_basic_map_dim_is_bounded(map->p[i], type, pos);
7638 if (bounded < 0 || !bounded)
7645 /* Return 1 if the specified dim is involved in both an upper bound
7646 * and a lower bound.
7648 int isl_set_dim_is_bounded(__isl_keep isl_set *set,
7649 enum isl_dim_type type, unsigned pos)
7651 return isl_map_dim_is_bounded((isl_map *)set, type, pos);
7654 /* For each of the "n" variables starting at "first", determine
7655 * the sign of the variable and put the results in the first "n"
7656 * elements of the array "signs".
7658 * 1 means that the variable is non-negative
7659 * -1 means that the variable is non-positive
7660 * 0 means the variable attains both positive and negative values.
7662 int isl_basic_set_vars_get_sign(__isl_keep isl_basic_set *bset,
7663 unsigned first, unsigned n, int *signs)
7665 isl_vec *bound = NULL;
7666 struct isl_tab *tab = NULL;
7667 struct isl_tab_undo *snap;
7670 if (!bset || !signs)
7673 bound = isl_vec_alloc(bset->ctx, 1 + isl_basic_set_total_dim(bset));
7674 tab = isl_tab_from_basic_set(bset);
7678 isl_seq_clr(bound->el, bound->size);
7679 isl_int_set_si(bound->el[0], -1);
7681 snap = isl_tab_snap(tab);
7682 for (i = 0; i < n; ++i) {
7685 isl_int_set_si(bound->el[1 + first + i], -1);
7686 if (isl_tab_add_ineq(tab, bound->el) < 0)
7689 isl_int_set_si(bound->el[1 + first + i], 0);
7690 if (isl_tab_rollback(tab, snap) < 0)
7698 isl_int_set_si(bound->el[1 + first + i], 1);
7699 if (isl_tab_add_ineq(tab, bound->el) < 0)
7702 isl_int_set_si(bound->el[1 + first + i], 0);
7703 if (isl_tab_rollback(tab, snap) < 0)
7706 signs[i] = empty ? -1 : 0;
7710 isl_vec_free(bound);
7714 isl_vec_free(bound);
7718 int isl_basic_set_dims_get_sign(__isl_keep isl_basic_set *bset,
7719 enum isl_dim_type type, unsigned first, unsigned n, int *signs)
7721 if (!bset || !signs)
7723 isl_assert(bset->ctx, first + n <= isl_basic_set_dim(bset, type),
7726 first += pos(bset->dim, type) - 1;
7727 return isl_basic_set_vars_get_sign(bset, first, n, signs);
7730 /* Check if the given basic map is obviously single-valued.
7731 * In particular, for each output dimension, check that there is
7732 * an equality that defines the output dimension in terms of
7733 * earlier dimensions.
7735 int isl_basic_map_plain_is_single_valued(__isl_keep isl_basic_map *bmap)
7745 total = 1 + isl_basic_map_total_dim(bmap);
7746 n_out = isl_basic_map_dim(bmap, isl_dim_out);
7747 o_out = isl_basic_map_offset(bmap, isl_dim_out);
7749 for (i = 0; i < n_out; ++i) {
7750 for (j = 0; j < bmap->n_eq; ++j) {
7751 if (isl_int_is_zero(bmap->eq[j][o_out + i]))
7753 if (isl_seq_first_non_zero(bmap->eq[j] + o_out + i + 1,
7754 total - (o_out + i + 1)) == -1)
7757 if (j >= bmap->n_eq)
7764 /* Check if the given map is obviously single-valued.
7766 int isl_map_plain_is_single_valued(__isl_keep isl_map *map)
7777 return isl_basic_map_plain_is_single_valued(map->p[0]);
7780 /* Check if the given map is single-valued.
7785 * and check if the result is a subset of the identity mapping.
7787 int isl_map_is_single_valued(__isl_keep isl_map *map)
7794 sv = isl_map_plain_is_single_valued(map);
7798 test = isl_map_reverse(isl_map_copy(map));
7799 test = isl_map_apply_range(test, isl_map_copy(map));
7801 dim = isl_dim_map_from_set(isl_dim_range(isl_map_get_dim(map)));
7802 id = isl_map_identity(dim);
7804 sv = isl_map_is_subset(test, id);
7812 int isl_map_is_injective(__isl_keep isl_map *map)
7816 map = isl_map_copy(map);
7817 map = isl_map_reverse(map);
7818 in = isl_map_is_single_valued(map);
7824 int isl_map_is_bijective(__isl_keep isl_map *map)
7828 sv = isl_map_is_single_valued(map);
7832 return isl_map_is_injective(map);
7835 int isl_set_is_singleton(__isl_keep isl_set *set)
7837 return isl_map_is_single_valued((isl_map *)set);
7840 int isl_map_is_translation(__isl_keep isl_map *map)
7845 delta = isl_map_deltas(isl_map_copy(map));
7846 ok = isl_set_is_singleton(delta);
7847 isl_set_free(delta);
7852 static int unique(isl_int *p, unsigned pos, unsigned len)
7854 if (isl_seq_first_non_zero(p, pos) != -1)
7856 if (isl_seq_first_non_zero(p + pos + 1, len - pos - 1) != -1)
7861 int isl_basic_set_is_box(__isl_keep isl_basic_set *bset)
7870 if (isl_basic_set_dim(bset, isl_dim_div) != 0)
7873 nvar = isl_basic_set_dim(bset, isl_dim_set);
7874 ovar = isl_dim_offset(bset->dim, isl_dim_set);
7875 for (j = 0; j < nvar; ++j) {
7876 int lower = 0, upper = 0;
7877 for (i = 0; i < bset->n_eq; ++i) {
7878 if (isl_int_is_zero(bset->eq[i][1 + ovar + j]))
7880 if (!unique(bset->eq[i] + 1 + ovar, j, nvar))
7886 for (i = 0; i < bset->n_ineq; ++i) {
7887 if (isl_int_is_zero(bset->ineq[i][1 + ovar + j]))
7889 if (!unique(bset->ineq[i] + 1 + ovar, j, nvar))
7891 if (isl_int_is_pos(bset->ineq[i][1 + ovar + j]))
7896 if (!lower || !upper)
7903 int isl_set_is_box(__isl_keep isl_set *set)
7910 return isl_basic_set_is_box(set->p[0]);
7913 int isl_basic_set_is_wrapping(__isl_keep isl_basic_set *bset)
7918 return isl_dim_is_wrapping(bset->dim);
7921 int isl_set_is_wrapping(__isl_keep isl_set *set)
7926 return isl_dim_is_wrapping(set->dim);
7929 __isl_give isl_basic_set *isl_basic_map_wrap(__isl_take isl_basic_map *bmap)
7931 bmap = isl_basic_map_cow(bmap);
7935 bmap->dim = isl_dim_wrap(bmap->dim);
7939 bmap = isl_basic_map_finalize(bmap);
7941 return (isl_basic_set *)bmap;
7943 isl_basic_map_free(bmap);
7947 __isl_give isl_set *isl_map_wrap(__isl_take isl_map *map)
7951 map = isl_map_cow(map);
7955 for (i = 0; i < map->n; ++i) {
7956 map->p[i] = (isl_basic_map *)isl_basic_map_wrap(map->p[i]);
7960 map->dim = isl_dim_wrap(map->dim);
7964 return (isl_set *)map;
7970 __isl_give isl_basic_map *isl_basic_set_unwrap(__isl_take isl_basic_set *bset)
7972 bset = isl_basic_set_cow(bset);
7976 bset->dim = isl_dim_unwrap(bset->dim);
7980 bset = isl_basic_set_finalize(bset);
7982 return (isl_basic_map *)bset;
7984 isl_basic_set_free(bset);
7988 __isl_give isl_map *isl_set_unwrap(__isl_take isl_set *set)
7995 if (!isl_set_is_wrapping(set))
7996 isl_die(set->ctx, isl_error_invalid, "not a wrapping set",
7999 set = isl_set_cow(set);
8003 for (i = 0; i < set->n; ++i) {
8004 set->p[i] = (isl_basic_set *)isl_basic_set_unwrap(set->p[i]);
8009 set->dim = isl_dim_unwrap(set->dim);
8013 return (isl_map *)set;
8019 __isl_give isl_basic_map *isl_basic_map_reset(__isl_take isl_basic_map *bmap,
8020 enum isl_dim_type type)
8025 if (!isl_dim_is_named_or_nested(bmap->dim, type))
8028 bmap = isl_basic_map_cow(bmap);
8032 bmap->dim = isl_dim_reset(bmap->dim, type);
8036 bmap = isl_basic_map_finalize(bmap);
8040 isl_basic_map_free(bmap);
8044 __isl_give isl_map *isl_map_reset(__isl_take isl_map *map,
8045 enum isl_dim_type type)
8052 if (!isl_dim_is_named_or_nested(map->dim, type))
8055 map = isl_map_cow(map);
8059 for (i = 0; i < map->n; ++i) {
8060 map->p[i] = isl_basic_map_reset(map->p[i], type);
8064 map->dim = isl_dim_reset(map->dim, type);
8074 __isl_give isl_basic_map *isl_basic_map_flatten(__isl_take isl_basic_map *bmap)
8079 if (!bmap->dim->nested[0] && !bmap->dim->nested[1])
8082 bmap = isl_basic_map_cow(bmap);
8086 bmap->dim = isl_dim_flatten(bmap->dim);
8090 bmap = isl_basic_map_finalize(bmap);
8094 isl_basic_map_free(bmap);
8098 __isl_give isl_basic_set *isl_basic_set_flatten(__isl_take isl_basic_set *bset)
8100 return (isl_basic_set *)isl_basic_map_flatten((isl_basic_map *)bset);
8103 __isl_give isl_map *isl_map_flatten(__isl_take isl_map *map)
8110 if (!map->dim->nested[0] && !map->dim->nested[1])
8113 map = isl_map_cow(map);
8117 for (i = 0; i < map->n; ++i) {
8118 map->p[i] = isl_basic_map_flatten(map->p[i]);
8122 map->dim = isl_dim_flatten(map->dim);
8132 __isl_give isl_set *isl_set_flatten(__isl_take isl_set *set)
8134 return (isl_set *)isl_map_flatten((isl_map *)set);
8137 __isl_give isl_map *isl_set_flatten_map(__isl_take isl_set *set)
8139 isl_dim *dim, *flat_dim;
8142 dim = isl_set_get_dim(set);
8143 flat_dim = isl_dim_flatten(isl_dim_copy(dim));
8144 map = isl_map_identity(isl_dim_join(isl_dim_reverse(dim), flat_dim));
8145 map = isl_map_intersect_domain(map, set);
8150 /* Reorder the dimensions of "bmap" according to the given dim_map
8151 * and set the dimension specification to "dim".
8153 __isl_give isl_basic_map *isl_basic_map_realign(__isl_take isl_basic_map *bmap,
8154 __isl_take isl_dim *dim, __isl_take struct isl_dim_map *dim_map)
8158 bmap = isl_basic_map_cow(bmap);
8159 if (!bmap || !dim || !dim_map)
8162 res = isl_basic_map_alloc_dim(dim,
8163 bmap->n_div, bmap->n_eq, bmap->n_ineq);
8164 res = isl_basic_map_add_constraints_dim_map(res, bmap, dim_map);
8165 res = isl_basic_map_finalize(res);
8169 isl_basic_map_free(bmap);
8174 /* Reorder the dimensions of "map" according to given reordering.
8176 __isl_give isl_map *isl_map_realign(__isl_take isl_map *map,
8177 __isl_take isl_reordering *r)
8180 struct isl_dim_map *dim_map;
8182 map = isl_map_cow(map);
8183 dim_map = isl_dim_map_from_reordering(r);
8184 if (!map || !r || !dim_map)
8187 for (i = 0; i < map->n; ++i) {
8188 struct isl_dim_map *dim_map_i;
8190 dim_map_i = isl_dim_map_extend(dim_map, map->p[i]);
8192 map->p[i] = isl_basic_map_realign(map->p[i],
8193 isl_dim_copy(r->dim), dim_map_i);
8199 map = isl_map_reset_dim(map, isl_dim_copy(r->dim));
8201 isl_reordering_free(r);
8207 isl_reordering_free(r);
8211 __isl_give isl_set *isl_set_realign(__isl_take isl_set *set,
8212 __isl_take isl_reordering *r)
8214 return (isl_set *)isl_map_realign((isl_map *)set, r);
8217 __isl_give isl_mat *isl_basic_map_equalities_matrix(
8218 __isl_keep isl_basic_map *bmap, enum isl_dim_type c1,
8219 enum isl_dim_type c2, enum isl_dim_type c3,
8220 enum isl_dim_type c4, enum isl_dim_type c5)
8222 enum isl_dim_type c[5] = { c1, c2, c3, c4, c5 };
8223 struct isl_mat *mat;
8229 mat = isl_mat_alloc(bmap->ctx, bmap->n_eq,
8230 isl_basic_map_total_dim(bmap) + 1);
8233 for (i = 0; i < bmap->n_eq; ++i)
8234 for (j = 0, pos = 0; j < 5; ++j) {
8235 int off = isl_basic_map_offset(bmap, c[j]);
8236 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
8237 isl_int_set(mat->row[i][pos],
8238 bmap->eq[i][off + k]);
8246 __isl_give isl_mat *isl_basic_map_inequalities_matrix(
8247 __isl_keep isl_basic_map *bmap, enum isl_dim_type c1,
8248 enum isl_dim_type c2, enum isl_dim_type c3,
8249 enum isl_dim_type c4, enum isl_dim_type c5)
8251 enum isl_dim_type c[5] = { c1, c2, c3, c4, c5 };
8252 struct isl_mat *mat;
8258 mat = isl_mat_alloc(bmap->ctx, bmap->n_ineq,
8259 isl_basic_map_total_dim(bmap) + 1);
8262 for (i = 0; i < bmap->n_ineq; ++i)
8263 for (j = 0, pos = 0; j < 5; ++j) {
8264 int off = isl_basic_map_offset(bmap, c[j]);
8265 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
8266 isl_int_set(mat->row[i][pos],
8267 bmap->ineq[i][off + k]);
8275 __isl_give isl_basic_map *isl_basic_map_from_constraint_matrices(
8276 __isl_take isl_dim *dim,
8277 __isl_take isl_mat *eq, __isl_take isl_mat *ineq, enum isl_dim_type c1,
8278 enum isl_dim_type c2, enum isl_dim_type c3,
8279 enum isl_dim_type c4, enum isl_dim_type c5)
8281 enum isl_dim_type c[5] = { c1, c2, c3, c4, c5 };
8282 isl_basic_map *bmap;
8288 if (!dim || !eq || !ineq)
8291 if (eq->n_col != ineq->n_col)
8292 isl_die(dim->ctx, isl_error_invalid,
8293 "equalities and inequalities matrices should have "
8294 "same number of columns", goto error);
8296 total = 1 + isl_dim_total(dim);
8298 if (eq->n_col < total)
8299 isl_die(dim->ctx, isl_error_invalid,
8300 "number of columns too small", goto error);
8302 extra = eq->n_col - total;
8304 bmap = isl_basic_map_alloc_dim(isl_dim_copy(dim), extra,
8305 eq->n_row, ineq->n_row);
8308 for (i = 0; i < extra; ++i) {
8309 k = isl_basic_map_alloc_div(bmap);
8312 isl_int_set_si(bmap->div[k][0], 0);
8314 for (i = 0; i < eq->n_row; ++i) {
8315 l = isl_basic_map_alloc_equality(bmap);
8318 for (j = 0, pos = 0; j < 5; ++j) {
8319 int off = isl_basic_map_offset(bmap, c[j]);
8320 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
8321 isl_int_set(bmap->eq[l][off + k],
8327 for (i = 0; i < ineq->n_row; ++i) {
8328 l = isl_basic_map_alloc_inequality(bmap);
8331 for (j = 0, pos = 0; j < 5; ++j) {
8332 int off = isl_basic_map_offset(bmap, c[j]);
8333 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
8334 isl_int_set(bmap->ineq[l][off + k],
8353 __isl_give isl_mat *isl_basic_set_equalities_matrix(
8354 __isl_keep isl_basic_set *bset, enum isl_dim_type c1,
8355 enum isl_dim_type c2, enum isl_dim_type c3, enum isl_dim_type c4)
8357 return isl_basic_map_equalities_matrix((isl_basic_map *)bset,
8358 c1, c2, c3, c4, isl_dim_in);
8361 __isl_give isl_mat *isl_basic_set_inequalities_matrix(
8362 __isl_keep isl_basic_set *bset, enum isl_dim_type c1,
8363 enum isl_dim_type c2, enum isl_dim_type c3, enum isl_dim_type c4)
8365 return isl_basic_map_inequalities_matrix((isl_basic_map *)bset,
8366 c1, c2, c3, c4, isl_dim_in);
8369 __isl_give isl_basic_set *isl_basic_set_from_constraint_matrices(
8370 __isl_take isl_dim *dim,
8371 __isl_take isl_mat *eq, __isl_take isl_mat *ineq, enum isl_dim_type c1,
8372 enum isl_dim_type c2, enum isl_dim_type c3, enum isl_dim_type c4)
8374 return (isl_basic_set*)
8375 isl_basic_map_from_constraint_matrices(dim, eq, ineq,
8376 c1, c2, c3, c4, isl_dim_in);
8379 int isl_basic_map_can_zip(__isl_keep isl_basic_map *bmap)
8384 return isl_dim_can_zip(bmap->dim);
8387 int isl_map_can_zip(__isl_keep isl_map *map)
8392 return isl_dim_can_zip(map->dim);
8395 /* Given a basic map (A -> B) -> (C -> D), return the corresponding basic map
8396 * (A -> C) -> (B -> D).
8398 __isl_give isl_basic_map *isl_basic_map_zip(__isl_take isl_basic_map *bmap)
8407 if (!isl_basic_map_can_zip(bmap))
8408 isl_die(bmap->ctx, isl_error_invalid,
8409 "basic map cannot be zipped", goto error);
8410 pos = isl_basic_map_offset(bmap, isl_dim_in) +
8411 isl_dim_size(bmap->dim->nested[0], isl_dim_in);
8412 n1 = isl_dim_size(bmap->dim->nested[0], isl_dim_out);
8413 n2 = isl_dim_size(bmap->dim->nested[1], isl_dim_in);
8414 bmap = isl_basic_map_swap_vars(bmap, pos, n1, n2);
8417 bmap->dim = isl_dim_zip(bmap->dim);
8422 isl_basic_map_free(bmap);
8426 /* Given a map (A -> B) -> (C -> D), return the corresponding map
8427 * (A -> C) -> (B -> D).
8429 __isl_give isl_map *isl_map_zip(__isl_take isl_map *map)
8436 if (!isl_map_can_zip(map))
8437 isl_die(map->ctx, isl_error_invalid, "map cannot be zipped",
8440 map = isl_map_cow(map);
8444 for (i = 0; i < map->n; ++i) {
8445 map->p[i] = isl_basic_map_zip(map->p[i]);
8450 map->dim = isl_dim_zip(map->dim);