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
17 #include "isl_dim_private.h"
18 #include "isl_equalities.h"
24 #include "isl_map_private.h"
25 #include "isl_map_piplib.h"
26 #include <isl_reordering.h>
27 #include "isl_sample.h"
30 #include <isl_mat_private.h>
32 /* Maps dst positions to src positions */
38 static struct isl_dim_map *isl_dim_map_alloc(struct isl_ctx *ctx, unsigned len)
41 struct isl_dim_map *dim_map;
42 dim_map = isl_alloc(ctx, struct isl_dim_map,
43 sizeof(struct isl_dim_map) + len * sizeof(int));
46 dim_map->len = 1 + len;
48 for (i = 0; i < len; ++i)
49 dim_map->pos[1 + i] = -1;
53 static unsigned n(struct isl_dim *dim, enum isl_dim_type type)
56 case isl_dim_param: return dim->nparam;
57 case isl_dim_in: return dim->n_in;
58 case isl_dim_out: return dim->n_out;
59 case isl_dim_all: return dim->nparam + dim->n_in + dim->n_out;
64 static unsigned pos(struct isl_dim *dim, enum isl_dim_type type)
67 case isl_dim_param: return 1;
68 case isl_dim_in: return 1 + dim->nparam;
69 case isl_dim_out: return 1 + dim->nparam + dim->n_in;
74 static void isl_dim_map_dim_range(struct isl_dim_map *dim_map,
75 struct isl_dim *dim, enum isl_dim_type type,
76 unsigned first, unsigned n, unsigned dst_pos)
84 src_pos = pos(dim, type);
85 for (i = 0; i < n; ++i)
86 dim_map->pos[1 + dst_pos + i] = src_pos + first + i;
89 static void isl_dim_map_dim(struct isl_dim_map *dim_map, struct isl_dim *dim,
90 enum isl_dim_type type, unsigned dst_pos)
92 isl_dim_map_dim_range(dim_map, dim, type, 0, n(dim, type), dst_pos);
95 static void isl_dim_map_div(struct isl_dim_map *dim_map,
96 struct isl_basic_map *bmap, unsigned dst_pos)
101 if (!dim_map || !bmap)
104 src_pos = 1 + isl_dim_total(bmap->dim);
105 for (i = 0; i < bmap->n_div; ++i)
106 dim_map->pos[1 + dst_pos + i] = src_pos + i;
109 static void isl_dim_map_dump(struct isl_dim_map *dim_map)
113 for (i = 0; i < dim_map->len; ++i)
114 fprintf(stderr, "%d -> %d; ", i, dim_map->pos[i]);
115 fprintf(stderr, "\n");
118 unsigned isl_basic_map_dim(const struct isl_basic_map *bmap,
119 enum isl_dim_type type)
124 case isl_dim_cst: return 1;
127 case isl_dim_out: return isl_dim_size(bmap->dim, type);
128 case isl_dim_div: return bmap->n_div;
129 case isl_dim_all: return isl_basic_map_total_dim(bmap);
134 unsigned isl_map_dim(const struct isl_map *map, enum isl_dim_type type)
136 return map ? n(map->dim, type) : 0;
139 unsigned isl_set_dim(const struct isl_set *set, enum isl_dim_type type)
141 return set ? n(set->dim, type) : 0;
144 unsigned isl_basic_map_offset(struct isl_basic_map *bmap,
145 enum isl_dim_type type)
147 struct isl_dim *dim = bmap->dim;
149 case isl_dim_cst: return 0;
150 case isl_dim_param: return 1;
151 case isl_dim_in: return 1 + dim->nparam;
152 case isl_dim_out: return 1 + dim->nparam + dim->n_in;
153 case isl_dim_div: return 1 + dim->nparam + dim->n_in + dim->n_out;
158 static unsigned map_offset(struct isl_map *map, enum isl_dim_type type)
160 return pos(map->dim, type);
163 unsigned isl_basic_set_dim(const struct isl_basic_set *bset,
164 enum isl_dim_type type)
166 return isl_basic_map_dim((const struct isl_basic_map*)bset, type);
169 unsigned isl_basic_set_n_dim(const struct isl_basic_set *bset)
171 return isl_basic_set_dim(bset, isl_dim_set);
174 unsigned isl_basic_set_n_param(const struct isl_basic_set *bset)
176 return isl_basic_set_dim(bset, isl_dim_param);
179 unsigned isl_basic_set_total_dim(const struct isl_basic_set *bset)
181 return isl_dim_total(bset->dim) + bset->n_div;
184 unsigned isl_set_n_dim(const struct isl_set *set)
186 return isl_set_dim(set, isl_dim_set);
189 unsigned isl_set_n_param(const struct isl_set *set)
191 return isl_set_dim(set, isl_dim_param);
194 unsigned isl_basic_map_n_in(const struct isl_basic_map *bmap)
196 return bmap ? bmap->dim->n_in : 0;
199 unsigned isl_basic_map_n_out(const struct isl_basic_map *bmap)
201 return bmap ? bmap->dim->n_out : 0;
204 unsigned isl_basic_map_n_param(const struct isl_basic_map *bmap)
206 return bmap ? bmap->dim->nparam : 0;
209 unsigned isl_basic_map_n_div(const struct isl_basic_map *bmap)
211 return bmap ? bmap->n_div : 0;
214 unsigned isl_basic_map_total_dim(const struct isl_basic_map *bmap)
216 return bmap ? isl_dim_total(bmap->dim) + bmap->n_div : 0;
219 unsigned isl_map_n_in(const struct isl_map *map)
221 return map->dim->n_in;
224 unsigned isl_map_n_out(const struct isl_map *map)
226 return map->dim->n_out;
229 unsigned isl_map_n_param(const struct isl_map *map)
231 return map->dim->nparam;
234 int isl_map_compatible_domain(struct isl_map *map, struct isl_set *set)
239 m = isl_dim_match(map->dim, isl_dim_param, set->dim, isl_dim_param);
242 return isl_dim_tuple_match(map->dim, isl_dim_in, set->dim, isl_dim_set);
245 int isl_basic_map_compatible_domain(struct isl_basic_map *bmap,
246 struct isl_basic_set *bset)
251 m = isl_dim_match(bmap->dim, isl_dim_param, bset->dim, isl_dim_param);
254 return isl_dim_tuple_match(bmap->dim, isl_dim_in, bset->dim, isl_dim_set);
257 int isl_basic_map_compatible_range(struct isl_basic_map *bmap,
258 struct isl_basic_set *bset)
263 m = isl_dim_match(bmap->dim, isl_dim_param, bset->dim, isl_dim_param);
266 return isl_dim_tuple_match(bmap->dim, isl_dim_out, bset->dim, isl_dim_set);
269 isl_ctx *isl_basic_map_get_ctx(__isl_keep isl_basic_map *bmap)
271 return bmap ? bmap->ctx : NULL;
274 isl_ctx *isl_basic_set_get_ctx(__isl_keep isl_basic_set *bset)
276 return bset ? bset->ctx : NULL;
279 isl_ctx *isl_map_get_ctx(__isl_keep isl_map *map)
281 return map ? map->ctx : NULL;
284 isl_ctx *isl_set_get_ctx(__isl_keep isl_set *set)
286 return set ? set->ctx : NULL;
289 struct isl_dim *isl_basic_map_get_dim(struct isl_basic_map *bmap)
293 return isl_dim_copy(bmap->dim);
296 struct isl_dim *isl_basic_set_get_dim(struct isl_basic_set *bset)
300 return isl_dim_copy(bset->dim);
303 struct isl_dim *isl_map_get_dim(struct isl_map *map)
307 return isl_dim_copy(map->dim);
310 struct isl_dim *isl_set_get_dim(struct isl_set *set)
314 return isl_dim_copy(set->dim);
317 __isl_give isl_basic_map *isl_basic_map_set_tuple_name(
318 __isl_take isl_basic_map *bmap, enum isl_dim_type type, const char *s)
320 bmap = isl_basic_map_cow(bmap);
323 bmap->dim = isl_dim_set_tuple_name(bmap->dim, type, s);
328 isl_basic_map_free(bmap);
332 __isl_give isl_map *isl_map_set_tuple_name(__isl_take isl_map *map,
333 enum isl_dim_type type, const char *s)
337 map = isl_map_cow(map);
341 map->dim = isl_dim_set_tuple_name(map->dim, type, s);
345 for (i = 0; i < map->n; ++i) {
346 map->p[i] = isl_basic_map_set_tuple_name(map->p[i], type, s);
357 __isl_give isl_basic_map *isl_basic_map_set_dim_name(
358 __isl_take isl_basic_map *bmap,
359 enum isl_dim_type type, unsigned pos, const char *s)
363 bmap->dim = isl_dim_set_name(bmap->dim, type, pos, s);
368 isl_basic_map_free(bmap);
372 __isl_give isl_map *isl_map_set_dim_name(__isl_take isl_map *map,
373 enum isl_dim_type type, unsigned pos, const char *s)
380 map->dim = isl_dim_set_name(map->dim, type, pos, s);
384 for (i = 0; i < map->n; ++i) {
385 map->p[i] = isl_basic_map_set_dim_name(map->p[i], type, pos, s);
396 __isl_give isl_basic_set *isl_basic_set_set_dim_name(
397 __isl_take isl_basic_set *bset,
398 enum isl_dim_type type, unsigned pos, const char *s)
400 return (isl_basic_set *)isl_basic_map_set_dim_name(
401 (isl_basic_map *)bset, type, pos, s);
404 __isl_give isl_set *isl_set_set_dim_name(__isl_take isl_set *set,
405 enum isl_dim_type type, unsigned pos, const char *s)
407 return (isl_set *)isl_map_set_dim_name((isl_map *)set, type, pos, s);
410 int isl_basic_map_is_rational(__isl_keep isl_basic_map *bmap)
414 return ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL);
417 static struct isl_basic_map *basic_map_init(struct isl_ctx *ctx,
418 struct isl_basic_map *bmap, unsigned extra,
419 unsigned n_eq, unsigned n_ineq)
422 size_t row_size = 1 + isl_dim_total(bmap->dim) + extra;
427 bmap->block = isl_blk_alloc(ctx, (n_ineq + n_eq) * row_size);
428 if (isl_blk_is_error(bmap->block))
431 bmap->ineq = isl_alloc_array(ctx, isl_int *, n_ineq + n_eq);
436 bmap->block2 = isl_blk_empty();
439 bmap->block2 = isl_blk_alloc(ctx, extra * (1 + row_size));
440 if (isl_blk_is_error(bmap->block2))
443 bmap->div = isl_alloc_array(ctx, isl_int *, extra);
448 for (i = 0; i < n_ineq + n_eq; ++i)
449 bmap->ineq[i] = bmap->block.data + i * row_size;
451 for (i = 0; i < extra; ++i)
452 bmap->div[i] = bmap->block2.data + i * (1 + row_size);
456 bmap->c_size = n_eq + n_ineq;
457 bmap->eq = bmap->ineq + n_ineq;
466 isl_basic_map_free(bmap);
470 struct isl_basic_set *isl_basic_set_alloc(struct isl_ctx *ctx,
471 unsigned nparam, unsigned dim, unsigned extra,
472 unsigned n_eq, unsigned n_ineq)
474 struct isl_basic_map *bmap;
475 bmap = isl_basic_map_alloc(ctx, nparam, 0, dim, extra, n_eq, n_ineq);
476 return (struct isl_basic_set *)bmap;
479 struct isl_basic_set *isl_basic_set_alloc_dim(struct isl_dim *dim,
480 unsigned extra, unsigned n_eq, unsigned n_ineq)
482 struct isl_basic_map *bmap;
485 isl_assert(dim->ctx, dim->n_in == 0, return NULL);
486 bmap = isl_basic_map_alloc_dim(dim, extra, n_eq, n_ineq);
487 return (struct isl_basic_set *)bmap;
490 struct isl_basic_map *isl_basic_map_alloc_dim(struct isl_dim *dim,
491 unsigned extra, unsigned n_eq, unsigned n_ineq)
493 struct isl_basic_map *bmap;
497 bmap = isl_calloc_type(dim->ctx, struct isl_basic_map);
502 return basic_map_init(dim->ctx, bmap, extra, n_eq, n_ineq);
508 struct isl_basic_map *isl_basic_map_alloc(struct isl_ctx *ctx,
509 unsigned nparam, unsigned in, unsigned out, unsigned extra,
510 unsigned n_eq, unsigned n_ineq)
512 struct isl_basic_map *bmap;
515 dim = isl_dim_alloc(ctx, nparam, in, out);
519 bmap = isl_basic_map_alloc_dim(dim, extra, n_eq, n_ineq);
523 static void dup_constraints(
524 struct isl_basic_map *dst, struct isl_basic_map *src)
527 unsigned total = isl_basic_map_total_dim(src);
529 for (i = 0; i < src->n_eq; ++i) {
530 int j = isl_basic_map_alloc_equality(dst);
531 isl_seq_cpy(dst->eq[j], src->eq[i], 1+total);
534 for (i = 0; i < src->n_ineq; ++i) {
535 int j = isl_basic_map_alloc_inequality(dst);
536 isl_seq_cpy(dst->ineq[j], src->ineq[i], 1+total);
539 for (i = 0; i < src->n_div; ++i) {
540 int j = isl_basic_map_alloc_div(dst);
541 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total);
543 ISL_F_SET(dst, ISL_BASIC_SET_FINAL);
546 struct isl_basic_map *isl_basic_map_dup(struct isl_basic_map *bmap)
548 struct isl_basic_map *dup;
552 dup = isl_basic_map_alloc_dim(isl_dim_copy(bmap->dim),
553 bmap->n_div, bmap->n_eq, bmap->n_ineq);
556 dup_constraints(dup, bmap);
557 dup->flags = bmap->flags;
558 dup->sample = isl_vec_copy(bmap->sample);
562 struct isl_basic_set *isl_basic_set_dup(struct isl_basic_set *bset)
564 struct isl_basic_map *dup;
566 dup = isl_basic_map_dup((struct isl_basic_map *)bset);
567 return (struct isl_basic_set *)dup;
570 struct isl_basic_set *isl_basic_set_copy(struct isl_basic_set *bset)
575 if (ISL_F_ISSET(bset, ISL_BASIC_SET_FINAL)) {
579 return isl_basic_set_dup(bset);
582 struct isl_set *isl_set_copy(struct isl_set *set)
591 struct isl_basic_map *isl_basic_map_copy(struct isl_basic_map *bmap)
596 if (ISL_F_ISSET(bmap, ISL_BASIC_SET_FINAL)) {
600 bmap = isl_basic_map_dup(bmap);
602 ISL_F_SET(bmap, ISL_BASIC_SET_FINAL);
606 struct isl_map *isl_map_copy(struct isl_map *map)
615 void isl_basic_map_free(struct isl_basic_map *bmap)
623 isl_ctx_deref(bmap->ctx);
625 isl_blk_free(bmap->ctx, bmap->block2);
627 isl_blk_free(bmap->ctx, bmap->block);
628 isl_vec_free(bmap->sample);
629 isl_dim_free(bmap->dim);
633 void isl_basic_set_free(struct isl_basic_set *bset)
635 isl_basic_map_free((struct isl_basic_map *)bset);
638 static int room_for_con(struct isl_basic_map *bmap, unsigned n)
640 return bmap->n_eq + bmap->n_ineq + n <= bmap->c_size;
643 int isl_basic_map_alloc_equality(struct isl_basic_map *bmap)
649 isl_assert(ctx, room_for_con(bmap, 1), return -1);
650 isl_assert(ctx, (bmap->eq - bmap->ineq) + bmap->n_eq <= bmap->c_size,
652 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
653 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
654 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_IMPLICIT);
655 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
656 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
657 if ((bmap->eq - bmap->ineq) + bmap->n_eq == bmap->c_size) {
659 int j = isl_basic_map_alloc_inequality(bmap);
663 bmap->ineq[j] = bmap->ineq[bmap->n_ineq - 1];
664 bmap->ineq[bmap->n_ineq - 1] = bmap->eq[-1];
671 isl_seq_clr(bmap->eq[bmap->n_eq] + 1 + isl_basic_map_total_dim(bmap),
672 bmap->extra - bmap->n_div);
676 int isl_basic_set_alloc_equality(struct isl_basic_set *bset)
678 return isl_basic_map_alloc_equality((struct isl_basic_map *)bset);
681 int isl_basic_map_free_equality(struct isl_basic_map *bmap, unsigned n)
685 isl_assert(bmap->ctx, n <= bmap->n_eq, return -1);
690 int isl_basic_set_free_equality(struct isl_basic_set *bset, unsigned n)
692 return isl_basic_map_free_equality((struct isl_basic_map *)bset, n);
695 int isl_basic_map_drop_equality(struct isl_basic_map *bmap, unsigned pos)
700 isl_assert(bmap->ctx, pos < bmap->n_eq, return -1);
702 if (pos != bmap->n_eq - 1) {
704 bmap->eq[pos] = bmap->eq[bmap->n_eq - 1];
705 bmap->eq[bmap->n_eq - 1] = t;
711 int isl_basic_set_drop_equality(struct isl_basic_set *bset, unsigned pos)
713 return isl_basic_map_drop_equality((struct isl_basic_map *)bset, pos);
716 void isl_basic_map_inequality_to_equality(
717 struct isl_basic_map *bmap, unsigned pos)
722 bmap->ineq[pos] = bmap->ineq[bmap->n_ineq - 1];
723 bmap->ineq[bmap->n_ineq - 1] = bmap->eq[-1];
728 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
729 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
730 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
731 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
734 static int room_for_ineq(struct isl_basic_map *bmap, unsigned n)
736 return bmap->n_ineq + n <= bmap->eq - bmap->ineq;
739 int isl_basic_map_alloc_inequality(struct isl_basic_map *bmap)
745 isl_assert(ctx, room_for_ineq(bmap, 1), return -1);
746 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_IMPLICIT);
747 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
748 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
749 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
750 isl_seq_clr(bmap->ineq[bmap->n_ineq] +
751 1 + isl_basic_map_total_dim(bmap),
752 bmap->extra - bmap->n_div);
753 return bmap->n_ineq++;
756 int isl_basic_set_alloc_inequality(struct isl_basic_set *bset)
758 return isl_basic_map_alloc_inequality((struct isl_basic_map *)bset);
761 int isl_basic_map_free_inequality(struct isl_basic_map *bmap, unsigned n)
765 isl_assert(bmap->ctx, n <= bmap->n_ineq, return -1);
770 int isl_basic_set_free_inequality(struct isl_basic_set *bset, unsigned n)
772 return isl_basic_map_free_inequality((struct isl_basic_map *)bset, n);
775 int isl_basic_map_drop_inequality(struct isl_basic_map *bmap, unsigned pos)
780 isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
782 if (pos != bmap->n_ineq - 1) {
784 bmap->ineq[pos] = bmap->ineq[bmap->n_ineq - 1];
785 bmap->ineq[bmap->n_ineq - 1] = t;
786 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
792 int isl_basic_set_drop_inequality(struct isl_basic_set *bset, unsigned pos)
794 return isl_basic_map_drop_inequality((struct isl_basic_map *)bset, pos);
797 __isl_give isl_basic_map *isl_basic_map_add_eq(__isl_take isl_basic_map *bmap,
802 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
805 k = isl_basic_map_alloc_equality(bmap);
808 isl_seq_cpy(bmap->eq[k], eq, 1 + isl_basic_map_total_dim(bmap));
811 isl_basic_map_free(bmap);
815 __isl_give isl_basic_set *isl_basic_set_add_eq(__isl_take isl_basic_set *bset,
818 return (isl_basic_set *)
819 isl_basic_map_add_eq((isl_basic_map *)bset, eq);
822 __isl_give isl_basic_map *isl_basic_map_add_ineq(__isl_take isl_basic_map *bmap,
827 bmap = isl_basic_map_extend_constraints(bmap, 0, 1);
830 k = isl_basic_map_alloc_inequality(bmap);
833 isl_seq_cpy(bmap->ineq[k], ineq, 1 + isl_basic_map_total_dim(bmap));
836 isl_basic_map_free(bmap);
840 __isl_give isl_basic_set *isl_basic_set_add_ineq(__isl_take isl_basic_set *bset,
843 return (isl_basic_set *)
844 isl_basic_map_add_ineq((isl_basic_map *)bset, ineq);
847 int isl_basic_map_alloc_div(struct isl_basic_map *bmap)
851 isl_assert(bmap->ctx, bmap->n_div < bmap->extra, return -1);
852 isl_seq_clr(bmap->div[bmap->n_div] +
853 1 + 1 + isl_basic_map_total_dim(bmap),
854 bmap->extra - bmap->n_div);
855 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
856 return bmap->n_div++;
859 int isl_basic_set_alloc_div(struct isl_basic_set *bset)
861 return isl_basic_map_alloc_div((struct isl_basic_map *)bset);
864 int isl_basic_map_free_div(struct isl_basic_map *bmap, unsigned n)
868 isl_assert(bmap->ctx, n <= bmap->n_div, return -1);
873 int isl_basic_set_free_div(struct isl_basic_set *bset, unsigned n)
875 return isl_basic_map_free_div((struct isl_basic_map *)bset, n);
878 /* Copy constraint from src to dst, putting the vars of src at offset
879 * dim_off in dst and the divs of src at offset div_off in dst.
880 * If both sets are actually map, then dim_off applies to the input
883 static void copy_constraint(struct isl_basic_map *dst_map, isl_int *dst,
884 struct isl_basic_map *src_map, isl_int *src,
885 unsigned in_off, unsigned out_off, unsigned div_off)
887 unsigned src_nparam = isl_basic_map_n_param(src_map);
888 unsigned dst_nparam = isl_basic_map_n_param(dst_map);
889 unsigned src_in = isl_basic_map_n_in(src_map);
890 unsigned dst_in = isl_basic_map_n_in(dst_map);
891 unsigned src_out = isl_basic_map_n_out(src_map);
892 unsigned dst_out = isl_basic_map_n_out(dst_map);
893 isl_int_set(dst[0], src[0]);
894 isl_seq_cpy(dst+1, src+1, isl_min(dst_nparam, src_nparam));
895 if (dst_nparam > src_nparam)
896 isl_seq_clr(dst+1+src_nparam,
897 dst_nparam - src_nparam);
898 isl_seq_clr(dst+1+dst_nparam, in_off);
899 isl_seq_cpy(dst+1+dst_nparam+in_off,
901 isl_min(dst_in-in_off, src_in));
902 if (dst_in-in_off > src_in)
903 isl_seq_clr(dst+1+dst_nparam+in_off+src_in,
904 dst_in - in_off - src_in);
905 isl_seq_clr(dst+1+dst_nparam+dst_in, out_off);
906 isl_seq_cpy(dst+1+dst_nparam+dst_in+out_off,
907 src+1+src_nparam+src_in,
908 isl_min(dst_out-out_off, src_out));
909 if (dst_out-out_off > src_out)
910 isl_seq_clr(dst+1+dst_nparam+dst_in+out_off+src_out,
911 dst_out - out_off - src_out);
912 isl_seq_clr(dst+1+dst_nparam+dst_in+dst_out, div_off);
913 isl_seq_cpy(dst+1+dst_nparam+dst_in+dst_out+div_off,
914 src+1+src_nparam+src_in+src_out,
915 isl_min(dst_map->extra-div_off, src_map->n_div));
916 if (dst_map->n_div-div_off > src_map->n_div)
917 isl_seq_clr(dst+1+dst_nparam+dst_in+dst_out+
918 div_off+src_map->n_div,
919 dst_map->n_div - div_off - src_map->n_div);
922 static void copy_div(struct isl_basic_map *dst_map, isl_int *dst,
923 struct isl_basic_map *src_map, isl_int *src,
924 unsigned in_off, unsigned out_off, unsigned div_off)
926 isl_int_set(dst[0], src[0]);
927 copy_constraint(dst_map, dst+1, src_map, src+1, in_off, out_off, div_off);
930 static struct isl_basic_map *add_constraints(struct isl_basic_map *bmap1,
931 struct isl_basic_map *bmap2, unsigned i_pos, unsigned o_pos)
936 if (!bmap1 || !bmap2)
939 div_off = bmap1->n_div;
941 for (i = 0; i < bmap2->n_eq; ++i) {
942 int i1 = isl_basic_map_alloc_equality(bmap1);
945 copy_constraint(bmap1, bmap1->eq[i1], bmap2, bmap2->eq[i],
946 i_pos, o_pos, div_off);
949 for (i = 0; i < bmap2->n_ineq; ++i) {
950 int i1 = isl_basic_map_alloc_inequality(bmap1);
953 copy_constraint(bmap1, bmap1->ineq[i1], bmap2, bmap2->ineq[i],
954 i_pos, o_pos, div_off);
957 for (i = 0; i < bmap2->n_div; ++i) {
958 int i1 = isl_basic_map_alloc_div(bmap1);
961 copy_div(bmap1, bmap1->div[i1], bmap2, bmap2->div[i],
962 i_pos, o_pos, div_off);
965 isl_basic_map_free(bmap2);
970 isl_basic_map_free(bmap1);
971 isl_basic_map_free(bmap2);
975 static void copy_constraint_dim_map(isl_int *dst, isl_int *src,
976 struct isl_dim_map *dim_map)
980 for (i = 0; i < dim_map->len; ++i) {
981 if (dim_map->pos[i] < 0)
982 isl_int_set_si(dst[i], 0);
984 isl_int_set(dst[i], src[dim_map->pos[i]]);
988 static void copy_div_dim_map(isl_int *dst, isl_int *src,
989 struct isl_dim_map *dim_map)
991 isl_int_set(dst[0], src[0]);
992 copy_constraint_dim_map(dst+1, src+1, dim_map);
995 static struct isl_basic_map *add_constraints_dim_map(struct isl_basic_map *dst,
996 struct isl_basic_map *src, struct isl_dim_map *dim_map)
1000 if (!src || !dst || !dim_map)
1003 for (i = 0; i < src->n_eq; ++i) {
1004 int i1 = isl_basic_map_alloc_equality(dst);
1007 copy_constraint_dim_map(dst->eq[i1], src->eq[i], dim_map);
1010 for (i = 0; i < src->n_ineq; ++i) {
1011 int i1 = isl_basic_map_alloc_inequality(dst);
1014 copy_constraint_dim_map(dst->ineq[i1], src->ineq[i], dim_map);
1017 for (i = 0; i < src->n_div; ++i) {
1018 int i1 = isl_basic_map_alloc_div(dst);
1021 copy_div_dim_map(dst->div[i1], src->div[i], dim_map);
1025 isl_basic_map_free(src);
1030 isl_basic_map_free(src);
1031 isl_basic_map_free(dst);
1035 struct isl_basic_set *isl_basic_set_add_constraints(struct isl_basic_set *bset1,
1036 struct isl_basic_set *bset2, unsigned pos)
1038 return (struct isl_basic_set *)
1039 add_constraints((struct isl_basic_map *)bset1,
1040 (struct isl_basic_map *)bset2, 0, pos);
1043 struct isl_basic_map *isl_basic_map_extend_dim(struct isl_basic_map *base,
1044 struct isl_dim *dim, unsigned extra,
1045 unsigned n_eq, unsigned n_ineq)
1047 struct isl_basic_map *ext;
1057 dims_ok = isl_dim_equal(base->dim, dim) &&
1058 base->extra >= base->n_div + extra;
1060 if (dims_ok && room_for_con(base, n_eq + n_ineq) &&
1061 room_for_ineq(base, n_ineq)) {
1066 isl_assert(base->ctx, base->dim->nparam <= dim->nparam, goto error);
1067 isl_assert(base->ctx, base->dim->n_in <= dim->n_in, goto error);
1068 isl_assert(base->ctx, base->dim->n_out <= dim->n_out, goto error);
1069 extra += base->extra;
1071 n_ineq += base->n_ineq;
1073 ext = isl_basic_map_alloc_dim(dim, extra, n_eq, n_ineq);
1079 ext->sample = isl_vec_copy(base->sample);
1080 flags = base->flags;
1081 ext = add_constraints(ext, base, 0, 0);
1084 ISL_F_CLR(ext, ISL_BASIC_SET_FINAL);
1091 isl_basic_map_free(base);
1095 struct isl_basic_set *isl_basic_set_extend_dim(struct isl_basic_set *base,
1096 struct isl_dim *dim, unsigned extra,
1097 unsigned n_eq, unsigned n_ineq)
1099 return (struct isl_basic_set *)
1100 isl_basic_map_extend_dim((struct isl_basic_map *)base, dim,
1101 extra, n_eq, n_ineq);
1104 struct isl_basic_map *isl_basic_map_extend_constraints(
1105 struct isl_basic_map *base, unsigned n_eq, unsigned n_ineq)
1109 return isl_basic_map_extend_dim(base, isl_dim_copy(base->dim),
1113 struct isl_basic_map *isl_basic_map_extend(struct isl_basic_map *base,
1114 unsigned nparam, unsigned n_in, unsigned n_out, unsigned extra,
1115 unsigned n_eq, unsigned n_ineq)
1117 struct isl_basic_map *bmap;
1118 struct isl_dim *dim;
1122 dim = isl_dim_alloc(base->ctx, nparam, n_in, n_out);
1126 bmap = isl_basic_map_extend_dim(base, dim, extra, n_eq, n_ineq);
1129 isl_basic_map_free(base);
1133 struct isl_basic_set *isl_basic_set_extend(struct isl_basic_set *base,
1134 unsigned nparam, unsigned dim, unsigned extra,
1135 unsigned n_eq, unsigned n_ineq)
1137 return (struct isl_basic_set *)
1138 isl_basic_map_extend((struct isl_basic_map *)base,
1139 nparam, 0, dim, extra, n_eq, n_ineq);
1142 struct isl_basic_set *isl_basic_set_extend_constraints(
1143 struct isl_basic_set *base, unsigned n_eq, unsigned n_ineq)
1145 return (struct isl_basic_set *)
1146 isl_basic_map_extend_constraints((struct isl_basic_map *)base,
1150 struct isl_basic_set *isl_basic_set_cow(struct isl_basic_set *bset)
1152 return (struct isl_basic_set *)
1153 isl_basic_map_cow((struct isl_basic_map *)bset);
1156 struct isl_basic_map *isl_basic_map_cow(struct isl_basic_map *bmap)
1161 if (bmap->ref > 1) {
1163 bmap = isl_basic_map_dup(bmap);
1166 ISL_F_CLR(bmap, ISL_BASIC_SET_FINAL);
1170 struct isl_set *isl_set_cow(struct isl_set *set)
1178 return isl_set_dup(set);
1181 struct isl_map *isl_map_cow(struct isl_map *map)
1189 return isl_map_dup(map);
1192 static void swap_vars(struct isl_blk blk, isl_int *a,
1193 unsigned a_len, unsigned b_len)
1195 isl_seq_cpy(blk.data, a+a_len, b_len);
1196 isl_seq_cpy(blk.data+b_len, a, a_len);
1197 isl_seq_cpy(a, blk.data, b_len+a_len);
1200 struct isl_basic_set *isl_basic_set_swap_vars(
1201 struct isl_basic_set *bset, unsigned n)
1211 nparam = isl_basic_set_n_param(bset);
1212 dim = isl_basic_set_n_dim(bset);
1213 isl_assert(bset->ctx, n <= dim, goto error);
1218 bset = isl_basic_set_cow(bset);
1222 blk = isl_blk_alloc(bset->ctx, dim);
1223 if (isl_blk_is_error(blk))
1226 for (i = 0; i < bset->n_eq; ++i)
1228 bset->eq[i]+1+nparam, n, dim - n);
1230 for (i = 0; i < bset->n_ineq; ++i)
1232 bset->ineq[i]+1+nparam, n, dim - n);
1234 for (i = 0; i < bset->n_div; ++i)
1236 bset->div[i]+1+1+nparam, n, dim - n);
1238 isl_blk_free(bset->ctx, blk);
1240 ISL_F_CLR(bset, ISL_BASIC_SET_NORMALIZED);
1241 bset = isl_basic_set_gauss(bset, NULL);
1242 return isl_basic_set_finalize(bset);
1244 isl_basic_set_free(bset);
1248 struct isl_set *isl_set_swap_vars(struct isl_set *set, unsigned n)
1251 set = isl_set_cow(set);
1255 for (i = 0; i < set->n; ++i) {
1256 set->p[i] = isl_basic_set_swap_vars(set->p[i], n);
1262 ISL_F_CLR(set, ISL_SET_NORMALIZED);
1266 struct isl_basic_map *isl_basic_map_set_to_empty(struct isl_basic_map *bmap)
1272 total = isl_basic_map_total_dim(bmap);
1273 isl_basic_map_free_div(bmap, bmap->n_div);
1274 isl_basic_map_free_inequality(bmap, bmap->n_ineq);
1276 isl_basic_map_free_equality(bmap, bmap->n_eq-1);
1278 i = isl_basic_map_alloc_equality(bmap);
1282 isl_int_set_si(bmap->eq[i][0], 1);
1283 isl_seq_clr(bmap->eq[i]+1, total);
1284 ISL_F_SET(bmap, ISL_BASIC_MAP_EMPTY);
1285 isl_vec_free(bmap->sample);
1286 bmap->sample = NULL;
1287 return isl_basic_map_finalize(bmap);
1289 isl_basic_map_free(bmap);
1293 struct isl_basic_set *isl_basic_set_set_to_empty(struct isl_basic_set *bset)
1295 return (struct isl_basic_set *)
1296 isl_basic_map_set_to_empty((struct isl_basic_map *)bset);
1299 void isl_basic_map_swap_div(struct isl_basic_map *bmap, int a, int b)
1302 unsigned off = isl_dim_total(bmap->dim);
1303 isl_int *t = bmap->div[a];
1304 bmap->div[a] = bmap->div[b];
1307 for (i = 0; i < bmap->n_eq; ++i)
1308 isl_int_swap(bmap->eq[i][1+off+a], bmap->eq[i][1+off+b]);
1310 for (i = 0; i < bmap->n_ineq; ++i)
1311 isl_int_swap(bmap->ineq[i][1+off+a], bmap->ineq[i][1+off+b]);
1313 for (i = 0; i < bmap->n_div; ++i)
1314 isl_int_swap(bmap->div[i][1+1+off+a], bmap->div[i][1+1+off+b]);
1315 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1318 /* Eliminate the specified n dimensions starting at first from the
1319 * constraints using Fourier-Motzkin. The dimensions themselves
1322 __isl_give isl_map *isl_map_eliminate(__isl_take isl_map *map,
1323 enum isl_dim_type type, unsigned first, unsigned n)
1332 map = isl_map_cow(map);
1335 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
1336 first += pos(map->dim, type) - 1;
1338 for (i = 0; i < map->n; ++i) {
1339 map->p[i] = isl_basic_map_eliminate_vars(map->p[i], first, n);
1349 /* Eliminate the specified n dimensions starting at first from the
1350 * constraints using Fourier-Motzkin. The dimensions themselves
1353 __isl_give isl_set *isl_set_eliminate(__isl_take isl_set *set,
1354 enum isl_dim_type type, unsigned first, unsigned n)
1356 return (isl_set *)isl_map_eliminate((isl_map *)set, type, first, n);
1359 /* Eliminate the specified n dimensions starting at first from the
1360 * constraints using Fourier-Motzkin. The dimensions themselves
1363 __isl_give isl_set *isl_set_eliminate_dims(__isl_take isl_set *set,
1364 unsigned first, unsigned n)
1366 return isl_set_eliminate(set, isl_dim_set, first, n);
1369 /* Project out n dimensions starting at first using Fourier-Motzkin */
1370 struct isl_set *isl_set_remove_dims(struct isl_set *set,
1371 unsigned first, unsigned n)
1373 set = isl_set_eliminate_dims(set, first, n);
1374 set = isl_set_drop_dims(set, first, n);
1378 struct isl_basic_set *isl_basic_set_remove_divs(struct isl_basic_set *bset)
1380 bset = isl_basic_set_eliminate_vars(bset, isl_dim_total(bset->dim),
1388 struct isl_set *isl_set_remove_divs(struct isl_set *set)
1397 set = isl_set_cow(set);
1401 for (i = 0; i < set->n; ++i) {
1402 set->p[i] = isl_basic_set_remove_divs(set->p[i]);
1412 struct isl_basic_map *isl_basic_map_remove(struct isl_basic_map *bmap,
1413 enum isl_dim_type type, unsigned first, unsigned n)
1417 isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
1421 bmap = isl_basic_map_eliminate_vars(bmap,
1422 isl_basic_map_offset(bmap, type) - 1 + first, n);
1425 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY) && type == isl_dim_div)
1427 bmap = isl_basic_map_drop(bmap, type, first, n);
1430 isl_basic_map_free(bmap);
1434 __isl_give isl_basic_set *isl_basic_set_remove(__isl_take isl_basic_set *bset,
1435 enum isl_dim_type type, unsigned first, unsigned n)
1437 return (isl_basic_set *)
1438 isl_basic_map_remove((isl_basic_map *)bset, type, first, n);
1441 struct isl_map *isl_map_remove(struct isl_map *map,
1442 enum isl_dim_type type, unsigned first, unsigned n)
1449 map = isl_map_cow(map);
1452 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
1454 for (i = 0; i < map->n; ++i) {
1455 map->p[i] = isl_basic_map_eliminate_vars(map->p[i],
1456 isl_basic_map_offset(map->p[i], type) - 1 + first, n);
1460 map = isl_map_drop(map, type, first, n);
1467 __isl_give isl_set *isl_set_remove(__isl_take isl_set *bset,
1468 enum isl_dim_type type, unsigned first, unsigned n)
1470 return (isl_set *)isl_map_remove((isl_map *)bset, type, first, n);
1473 /* Project out n inputs starting at first using Fourier-Motzkin */
1474 struct isl_map *isl_map_remove_inputs(struct isl_map *map,
1475 unsigned first, unsigned n)
1477 return isl_map_remove(map, isl_dim_in, first, n);
1480 /* Project out n dimensions starting at first using Fourier-Motzkin */
1481 struct isl_basic_set *isl_basic_set_remove_dims(struct isl_basic_set *bset,
1482 unsigned first, unsigned n)
1484 unsigned nparam = isl_basic_set_n_param(bset);
1485 bset = isl_basic_set_eliminate_vars(bset, nparam + first, n);
1486 bset = isl_basic_set_drop_dims(bset, first, n);
1490 static void dump_term(struct isl_basic_map *bmap,
1491 isl_int c, int pos, FILE *out)
1494 unsigned in = isl_basic_map_n_in(bmap);
1495 unsigned dim = in + isl_basic_map_n_out(bmap);
1496 unsigned nparam = isl_basic_map_n_param(bmap);
1498 isl_int_print(out, c, 0);
1500 if (!isl_int_is_one(c))
1501 isl_int_print(out, c, 0);
1502 if (pos < 1 + nparam) {
1503 name = isl_dim_get_name(bmap->dim,
1504 isl_dim_param, pos - 1);
1506 fprintf(out, "%s", name);
1508 fprintf(out, "p%d", pos - 1);
1509 } else if (pos < 1 + nparam + in)
1510 fprintf(out, "i%d", pos - 1 - nparam);
1511 else if (pos < 1 + nparam + dim)
1512 fprintf(out, "o%d", pos - 1 - nparam - in);
1514 fprintf(out, "e%d", pos - 1 - nparam - dim);
1518 static void dump_constraint_sign(struct isl_basic_map *bmap, isl_int *c,
1519 int sign, FILE *out)
1523 unsigned len = 1 + isl_basic_map_total_dim(bmap);
1527 for (i = 0, first = 1; i < len; ++i) {
1528 if (isl_int_sgn(c[i]) * sign <= 0)
1531 fprintf(out, " + ");
1533 isl_int_abs(v, c[i]);
1534 dump_term(bmap, v, i, out);
1541 static void dump_constraint(struct isl_basic_map *bmap, isl_int *c,
1542 const char *op, FILE *out, int indent)
1546 fprintf(out, "%*s", indent, "");
1548 dump_constraint_sign(bmap, c, 1, out);
1549 fprintf(out, " %s ", op);
1550 dump_constraint_sign(bmap, c, -1, out);
1554 for (i = bmap->n_div; i < bmap->extra; ++i) {
1555 if (isl_int_is_zero(c[1+isl_dim_total(bmap->dim)+i]))
1557 fprintf(out, "%*s", indent, "");
1558 fprintf(out, "ERROR: unused div coefficient not zero\n");
1563 static void dump_constraints(struct isl_basic_map *bmap,
1564 isl_int **c, unsigned n,
1565 const char *op, FILE *out, int indent)
1569 for (i = 0; i < n; ++i)
1570 dump_constraint(bmap, c[i], op, out, indent);
1573 static void dump_affine(struct isl_basic_map *bmap, isl_int *exp, FILE *out)
1577 unsigned total = isl_basic_map_total_dim(bmap);
1579 for (j = 0; j < 1 + total; ++j) {
1580 if (isl_int_is_zero(exp[j]))
1582 if (!first && isl_int_is_pos(exp[j]))
1584 dump_term(bmap, exp[j], j, out);
1589 static void dump(struct isl_basic_map *bmap, FILE *out, int indent)
1593 dump_constraints(bmap, bmap->eq, bmap->n_eq, "=", out, indent);
1594 dump_constraints(bmap, bmap->ineq, bmap->n_ineq, ">=", out, indent);
1596 for (i = 0; i < bmap->n_div; ++i) {
1597 fprintf(out, "%*s", indent, "");
1598 fprintf(out, "e%d = [(", i);
1599 dump_affine(bmap, bmap->div[i]+1, out);
1601 isl_int_print(out, bmap->div[i][0], 0);
1602 fprintf(out, "]\n");
1606 void isl_basic_set_dump(struct isl_basic_set *bset, FILE *out, int indent)
1609 fprintf(out, "null basic set\n");
1613 fprintf(out, "%*s", indent, "");
1614 fprintf(out, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n",
1615 bset->ref, bset->dim->nparam, bset->dim->n_out,
1616 bset->extra, bset->flags);
1617 dump((struct isl_basic_map *)bset, out, indent);
1620 void isl_basic_map_dump(struct isl_basic_map *bmap, FILE *out, int indent)
1623 fprintf(out, "null basic map\n");
1627 fprintf(out, "%*s", indent, "");
1628 fprintf(out, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, "
1629 "flags: %x, n_name: %d\n",
1631 bmap->dim->nparam, bmap->dim->n_in, bmap->dim->n_out,
1632 bmap->extra, bmap->flags, bmap->dim->n_name);
1633 dump(bmap, out, indent);
1636 int isl_inequality_negate(struct isl_basic_map *bmap, unsigned pos)
1641 total = isl_basic_map_total_dim(bmap);
1642 isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
1643 isl_seq_neg(bmap->ineq[pos], bmap->ineq[pos], 1 + total);
1644 isl_int_sub_ui(bmap->ineq[pos][0], bmap->ineq[pos][0], 1);
1645 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1649 struct isl_set *isl_set_alloc_dim(struct isl_dim *dim, int n, unsigned flags)
1651 struct isl_set *set;
1655 isl_assert(dim->ctx, dim->n_in == 0, return NULL);
1656 isl_assert(dim->ctx, n >= 0, return NULL);
1657 set = isl_alloc(dim->ctx, struct isl_set,
1658 sizeof(struct isl_set) +
1659 (n - 1) * sizeof(struct isl_basic_set *));
1663 set->ctx = dim->ctx;
1664 isl_ctx_ref(set->ctx);
1676 struct isl_set *isl_set_alloc(struct isl_ctx *ctx,
1677 unsigned nparam, unsigned dim, int n, unsigned flags)
1679 struct isl_set *set;
1680 struct isl_dim *dims;
1682 dims = isl_dim_alloc(ctx, nparam, 0, dim);
1686 set = isl_set_alloc_dim(dims, n, flags);
1690 /* Make sure "map" has room for at least "n" more basic maps.
1692 struct isl_map *isl_map_grow(struct isl_map *map, int n)
1695 struct isl_map *grown = NULL;
1699 isl_assert(map->ctx, n >= 0, goto error);
1700 if (map->n + n <= map->size)
1702 grown = isl_map_alloc_dim(isl_map_get_dim(map), map->n + n, map->flags);
1705 for (i = 0; i < map->n; ++i) {
1706 grown->p[i] = isl_basic_map_copy(map->p[i]);
1714 isl_map_free(grown);
1719 /* Make sure "set" has room for at least "n" more basic sets.
1721 struct isl_set *isl_set_grow(struct isl_set *set, int n)
1723 return (struct isl_set *)isl_map_grow((struct isl_map *)set, n);
1726 struct isl_set *isl_set_dup(struct isl_set *set)
1729 struct isl_set *dup;
1734 dup = isl_set_alloc_dim(isl_dim_copy(set->dim), set->n, set->flags);
1737 for (i = 0; i < set->n; ++i)
1738 dup = isl_set_add_basic_set(dup, isl_basic_set_copy(set->p[i]));
1742 struct isl_set *isl_set_from_basic_set(struct isl_basic_set *bset)
1744 struct isl_set *set;
1749 set = isl_set_alloc_dim(isl_dim_copy(bset->dim), 1, ISL_MAP_DISJOINT);
1751 isl_basic_set_free(bset);
1754 return isl_set_add_basic_set(set, bset);
1757 struct isl_map *isl_map_from_basic_map(struct isl_basic_map *bmap)
1759 struct isl_map *map;
1764 map = isl_map_alloc_dim(isl_dim_copy(bmap->dim), 1, ISL_MAP_DISJOINT);
1766 isl_basic_map_free(bmap);
1769 return isl_map_add_basic_map(map, bmap);
1772 __isl_give isl_set *isl_set_add_basic_set(__isl_take isl_set *set,
1773 __isl_take isl_basic_set *bset)
1775 return (struct isl_set *)isl_map_add_basic_map((struct isl_map *)set,
1776 (struct isl_basic_map *)bset);
1779 void isl_set_free(struct isl_set *set)
1789 isl_ctx_deref(set->ctx);
1790 for (i = 0; i < set->n; ++i)
1791 isl_basic_set_free(set->p[i]);
1792 isl_dim_free(set->dim);
1796 void isl_set_dump(struct isl_set *set, FILE *out, int indent)
1801 fprintf(out, "null set\n");
1805 fprintf(out, "%*s", indent, "");
1806 fprintf(out, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
1807 set->ref, set->n, set->dim->nparam, set->dim->n_out,
1809 for (i = 0; i < set->n; ++i) {
1810 fprintf(out, "%*s", indent, "");
1811 fprintf(out, "basic set %d:\n", i);
1812 isl_basic_set_dump(set->p[i], out, indent+4);
1816 void isl_map_dump(struct isl_map *map, FILE *out, int indent)
1821 fprintf(out, "null map\n");
1825 fprintf(out, "%*s", indent, "");
1826 fprintf(out, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, "
1827 "flags: %x, n_name: %d\n",
1828 map->ref, map->n, map->dim->nparam, map->dim->n_in,
1829 map->dim->n_out, map->flags, map->dim->n_name);
1830 for (i = 0; i < map->n; ++i) {
1831 fprintf(out, "%*s", indent, "");
1832 fprintf(out, "basic map %d:\n", i);
1833 isl_basic_map_dump(map->p[i], out, indent+4);
1837 struct isl_basic_map *isl_basic_map_intersect_domain(
1838 struct isl_basic_map *bmap, struct isl_basic_set *bset)
1840 struct isl_basic_map *bmap_domain;
1841 struct isl_dim *dim;
1846 isl_assert(bset->ctx, isl_dim_match(bmap->dim, isl_dim_param,
1847 bset->dim, isl_dim_param), goto error);
1849 if (isl_dim_size(bset->dim, isl_dim_set) != 0)
1850 isl_assert(bset->ctx,
1851 isl_basic_map_compatible_domain(bmap, bset), goto error);
1853 bmap = isl_basic_map_cow(bmap);
1856 bmap = isl_basic_map_extend_dim(bmap, isl_dim_copy(bmap->dim),
1857 bset->n_div, bset->n_eq, bset->n_ineq);
1858 dim = isl_dim_reverse(isl_dim_copy(bset->dim));
1859 bmap_domain = isl_basic_map_from_basic_set(bset, dim);
1860 bmap = add_constraints(bmap, bmap_domain, 0, 0);
1862 bmap = isl_basic_map_simplify(bmap);
1863 return isl_basic_map_finalize(bmap);
1865 isl_basic_map_free(bmap);
1866 isl_basic_set_free(bset);
1870 struct isl_basic_map *isl_basic_map_intersect_range(
1871 struct isl_basic_map *bmap, struct isl_basic_set *bset)
1873 struct isl_basic_map *bmap_range;
1878 isl_assert(bset->ctx, isl_dim_match(bmap->dim, isl_dim_param,
1879 bset->dim, isl_dim_param), goto error);
1881 if (isl_dim_size(bset->dim, isl_dim_set) != 0)
1882 isl_assert(bset->ctx,
1883 isl_basic_map_compatible_range(bmap, bset), goto error);
1885 bmap = isl_basic_map_cow(bmap);
1888 bmap = isl_basic_map_extend_dim(bmap, isl_dim_copy(bmap->dim),
1889 bset->n_div, bset->n_eq, bset->n_ineq);
1890 bmap_range = isl_basic_map_from_basic_set(bset, isl_dim_copy(bset->dim));
1891 bmap = add_constraints(bmap, bmap_range, 0, 0);
1893 bmap = isl_basic_map_simplify(bmap);
1894 return isl_basic_map_finalize(bmap);
1896 isl_basic_map_free(bmap);
1897 isl_basic_set_free(bset);
1901 int isl_basic_map_contains(struct isl_basic_map *bmap, struct isl_vec *vec)
1907 total = 1 + isl_basic_map_total_dim(bmap);
1908 if (total != vec->size)
1913 for (i = 0; i < bmap->n_eq; ++i) {
1914 isl_seq_inner_product(vec->el, bmap->eq[i], total, &s);
1915 if (!isl_int_is_zero(s)) {
1921 for (i = 0; i < bmap->n_ineq; ++i) {
1922 isl_seq_inner_product(vec->el, bmap->ineq[i], total, &s);
1923 if (isl_int_is_neg(s)) {
1934 int isl_basic_set_contains(struct isl_basic_set *bset, struct isl_vec *vec)
1936 return isl_basic_map_contains((struct isl_basic_map *)bset, vec);
1939 struct isl_basic_map *isl_basic_map_intersect(
1940 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
1942 struct isl_vec *sample = NULL;
1944 if (!bmap1 || !bmap2)
1947 isl_assert(bmap1->ctx, isl_dim_match(bmap1->dim, isl_dim_param,
1948 bmap2->dim, isl_dim_param), goto error);
1949 if (isl_dim_total(bmap1->dim) ==
1950 isl_dim_size(bmap1->dim, isl_dim_param) &&
1951 isl_dim_total(bmap2->dim) !=
1952 isl_dim_size(bmap2->dim, isl_dim_param))
1953 return isl_basic_map_intersect(bmap2, bmap1);
1955 if (isl_dim_total(bmap2->dim) !=
1956 isl_dim_size(bmap2->dim, isl_dim_param))
1957 isl_assert(bmap1->ctx,
1958 isl_dim_equal(bmap1->dim, bmap2->dim), goto error);
1960 if (bmap1->sample &&
1961 isl_basic_map_contains(bmap1, bmap1->sample) > 0 &&
1962 isl_basic_map_contains(bmap2, bmap1->sample) > 0)
1963 sample = isl_vec_copy(bmap1->sample);
1964 else if (bmap2->sample &&
1965 isl_basic_map_contains(bmap1, bmap2->sample) > 0 &&
1966 isl_basic_map_contains(bmap2, bmap2->sample) > 0)
1967 sample = isl_vec_copy(bmap2->sample);
1969 bmap1 = isl_basic_map_cow(bmap1);
1972 bmap1 = isl_basic_map_extend_dim(bmap1, isl_dim_copy(bmap1->dim),
1973 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
1974 bmap1 = add_constraints(bmap1, bmap2, 0, 0);
1977 isl_vec_free(sample);
1979 isl_vec_free(bmap1->sample);
1980 bmap1->sample = sample;
1983 bmap1 = isl_basic_map_simplify(bmap1);
1984 return isl_basic_map_finalize(bmap1);
1987 isl_vec_free(sample);
1988 isl_basic_map_free(bmap1);
1989 isl_basic_map_free(bmap2);
1993 struct isl_basic_set *isl_basic_set_intersect(
1994 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
1996 return (struct isl_basic_set *)
1997 isl_basic_map_intersect(
1998 (struct isl_basic_map *)bset1,
1999 (struct isl_basic_map *)bset2);
2002 /* Special case of isl_map_intersect, where both map1 and map2
2003 * are convex, without any divs and such that either map1 or map2
2004 * contains a single constraint. This constraint is then simply
2005 * added to the other map.
2007 static __isl_give isl_map *map_intersect_add_constraint(
2008 __isl_take isl_map *map1, __isl_take isl_map *map2)
2010 struct isl_basic_map *bmap1;
2011 struct isl_basic_map *bmap2;
2013 isl_assert(map1->ctx, map1->n == 1, goto error);
2014 isl_assert(map2->ctx, map1->n == 1, goto error);
2015 isl_assert(map1->ctx, map1->p[0]->n_div == 0, goto error);
2016 isl_assert(map2->ctx, map1->p[0]->n_div == 0, goto error);
2018 if (map2->p[0]->n_eq + map2->p[0]->n_ineq != 1)
2019 return isl_map_intersect(map2, map1);
2021 isl_assert(map2->ctx,
2022 map2->p[0]->n_eq + map2->p[0]->n_ineq == 1, goto error);
2024 map1 = isl_map_cow(map1);
2027 if (isl_map_fast_is_empty(map1)) {
2031 map1->p[0] = isl_basic_map_cow(map1->p[0]);
2032 if (map2->p[0]->n_eq == 1)
2033 map1->p[0] = isl_basic_map_add_eq(map1->p[0], map2->p[0]->eq[0]);
2035 map1->p[0] = isl_basic_map_add_ineq(map1->p[0],
2036 map2->p[0]->ineq[0]);
2038 map1->p[0] = isl_basic_map_simplify(map1->p[0]);
2039 map1->p[0] = isl_basic_map_finalize(map1->p[0]);
2043 if (isl_basic_map_fast_is_empty(map1->p[0])) {
2044 isl_basic_map_free(map1->p[0]);
2057 struct isl_map *isl_map_intersect(struct isl_map *map1, struct isl_map *map2)
2060 struct isl_map *result;
2066 if (isl_map_fast_is_empty(map1)) {
2070 if (isl_map_fast_is_empty(map2)) {
2075 if (map1->n == 1 && map2->n == 1 &&
2076 map1->p[0]->n_div == 0 && map2->p[0]->n_div == 0 &&
2077 isl_dim_equal(map1->dim, map2->dim) &&
2078 (map1->p[0]->n_eq + map1->p[0]->n_ineq == 1 ||
2079 map2->p[0]->n_eq + map2->p[0]->n_ineq == 1))
2080 return map_intersect_add_constraint(map1, map2);
2081 isl_assert(map1->ctx, isl_dim_match(map1->dim, isl_dim_param,
2082 map2->dim, isl_dim_param), goto error);
2083 if (isl_dim_total(map1->dim) ==
2084 isl_dim_size(map1->dim, isl_dim_param) &&
2085 isl_dim_total(map2->dim) != isl_dim_size(map2->dim, isl_dim_param))
2086 return isl_map_intersect(map2, map1);
2088 if (isl_dim_total(map2->dim) != isl_dim_size(map2->dim, isl_dim_param))
2089 isl_assert(map1->ctx,
2090 isl_dim_equal(map1->dim, map2->dim), goto error);
2092 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
2093 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
2094 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
2096 result = isl_map_alloc_dim(isl_dim_copy(map1->dim),
2097 map1->n * map2->n, flags);
2100 for (i = 0; i < map1->n; ++i)
2101 for (j = 0; j < map2->n; ++j) {
2102 struct isl_basic_map *part;
2103 part = isl_basic_map_intersect(
2104 isl_basic_map_copy(map1->p[i]),
2105 isl_basic_map_copy(map2->p[j]));
2106 if (isl_basic_map_is_empty(part))
2107 isl_basic_map_free(part);
2109 result = isl_map_add_basic_map(result, part);
2122 struct isl_set *isl_set_intersect(struct isl_set *set1, struct isl_set *set2)
2124 return (struct isl_set *)
2125 isl_map_intersect((struct isl_map *)set1,
2126 (struct isl_map *)set2);
2129 struct isl_basic_map *isl_basic_map_reverse(struct isl_basic_map *bmap)
2131 struct isl_dim *dim;
2132 struct isl_basic_set *bset;
2137 bmap = isl_basic_map_cow(bmap);
2140 dim = isl_dim_reverse(isl_dim_copy(bmap->dim));
2141 in = isl_basic_map_n_in(bmap);
2142 bset = isl_basic_set_from_basic_map(bmap);
2143 bset = isl_basic_set_swap_vars(bset, in);
2144 return isl_basic_map_from_basic_set(bset, dim);
2147 __isl_give isl_basic_map *isl_basic_map_insert(__isl_take isl_basic_map *bmap,
2148 enum isl_dim_type type, unsigned pos, unsigned n)
2150 struct isl_dim *res_dim;
2151 struct isl_basic_map *res;
2152 struct isl_dim_map *dim_map;
2153 unsigned total, off;
2154 enum isl_dim_type t;
2162 res_dim = isl_dim_insert(isl_basic_map_get_dim(bmap), type, pos, n);
2164 total = isl_basic_map_total_dim(bmap) + n;
2165 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2167 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
2169 isl_dim_map_dim(dim_map, bmap->dim, t, off);
2171 unsigned size = isl_basic_map_dim(bmap, t);
2172 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2174 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2175 pos, size - pos, off + pos + n);
2177 off += isl_dim_size(res_dim, t);
2179 isl_dim_map_div(dim_map, bmap, off);
2181 res = isl_basic_map_alloc_dim(res_dim,
2182 bmap->n_div, bmap->n_eq, bmap->n_ineq);
2183 res = add_constraints_dim_map(res, bmap, dim_map);
2184 res = isl_basic_map_simplify(res);
2185 return isl_basic_map_finalize(res);
2188 __isl_give isl_basic_map *isl_basic_map_add(__isl_take isl_basic_map *bmap,
2189 enum isl_dim_type type, unsigned n)
2193 return isl_basic_map_insert(bmap, type,
2194 isl_basic_map_dim(bmap, type), n);
2197 __isl_give isl_basic_set *isl_basic_set_add(__isl_take isl_basic_set *bset,
2198 enum isl_dim_type type, unsigned n)
2202 isl_assert(bset->ctx, type != isl_dim_in, goto error);
2203 return (isl_basic_set *)isl_basic_map_add((isl_basic_map *)bset, type, n);
2205 isl_basic_set_free(bset);
2209 __isl_give isl_map *isl_map_insert(__isl_take isl_map *map,
2210 enum isl_dim_type type, unsigned pos, unsigned n)
2217 map = isl_map_cow(map);
2221 map->dim = isl_dim_insert(map->dim, type, pos, n);
2225 for (i = 0; i < map->n; ++i) {
2226 map->p[i] = isl_basic_map_insert(map->p[i], type, pos, n);
2237 __isl_give isl_set *isl_set_insert(__isl_take isl_set *set,
2238 enum isl_dim_type type, unsigned pos, unsigned n)
2240 return (isl_set *)isl_map_insert((isl_map *)set, type, pos, n);
2243 __isl_give isl_map *isl_map_add(__isl_take isl_map *map,
2244 enum isl_dim_type type, unsigned n)
2248 return isl_map_insert(map, type, isl_map_dim(map, type), n);
2251 __isl_give isl_set *isl_set_add(__isl_take isl_set *set,
2252 enum isl_dim_type type, unsigned n)
2256 isl_assert(set->ctx, type != isl_dim_in, goto error);
2257 return (isl_set *)isl_map_add((isl_map *)set, type, n);
2263 __isl_give isl_basic_map *isl_basic_map_move_dims(
2264 __isl_take isl_basic_map *bmap,
2265 enum isl_dim_type dst_type, unsigned dst_pos,
2266 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2269 struct isl_dim_map *dim_map;
2270 struct isl_basic_map *res;
2271 enum isl_dim_type t;
2272 unsigned total, off;
2279 isl_assert(bmap->ctx, src_pos + n <= isl_basic_map_dim(bmap, src_type),
2282 if (dst_type == src_type && dst_pos == src_pos)
2285 isl_assert(bmap->ctx, dst_type != src_type, goto error);
2287 if (pos(bmap->dim, dst_type) + dst_pos ==
2288 pos(bmap->dim, src_type) + src_pos +
2289 ((src_type < dst_type) ? n : 0)) {
2290 bmap = isl_basic_map_cow(bmap);
2294 bmap->dim = isl_dim_move(bmap->dim, dst_type, dst_pos,
2295 src_type, src_pos, n);
2299 bmap = isl_basic_map_finalize(bmap);
2304 total = isl_basic_map_total_dim(bmap);
2305 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2308 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
2309 unsigned size = isl_dim_size(bmap->dim, t);
2310 if (t == dst_type) {
2311 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2314 isl_dim_map_dim_range(dim_map, bmap->dim, src_type,
2317 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2318 dst_pos, size - dst_pos, off);
2319 off += size - dst_pos;
2320 } else if (t == src_type) {
2321 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2324 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2325 src_pos + n, size - src_pos - n, off);
2326 off += size - src_pos - n;
2328 isl_dim_map_dim(dim_map, bmap->dim, t, off);
2332 isl_dim_map_div(dim_map, bmap, off);
2334 res = isl_basic_map_alloc_dim(isl_basic_map_get_dim(bmap),
2335 bmap->n_div, bmap->n_eq, bmap->n_ineq);
2336 bmap = add_constraints_dim_map(res, bmap, dim_map);
2338 bmap->dim = isl_dim_move(bmap->dim, dst_type, dst_pos,
2339 src_type, src_pos, n);
2343 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
2344 bmap = isl_basic_map_gauss(bmap, NULL);
2345 bmap = isl_basic_map_finalize(bmap);
2349 isl_basic_map_free(bmap);
2353 __isl_give isl_basic_set *isl_basic_set_move_dims(__isl_take isl_basic_set *bset,
2354 enum isl_dim_type dst_type, unsigned dst_pos,
2355 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2357 return (isl_basic_set *)isl_basic_map_move_dims(
2358 (isl_basic_map *)bset, dst_type, dst_pos, src_type, src_pos, n);
2361 __isl_give isl_set *isl_set_move_dims(__isl_take isl_set *set,
2362 enum isl_dim_type dst_type, unsigned dst_pos,
2363 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2367 isl_assert(set->ctx, dst_type != isl_dim_in, goto error);
2368 return (isl_set *)isl_map_move_dims((isl_map *)set, dst_type, dst_pos,
2369 src_type, src_pos, n);
2375 __isl_give isl_map *isl_map_move_dims(__isl_take isl_map *map,
2376 enum isl_dim_type dst_type, unsigned dst_pos,
2377 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2386 isl_assert(map->ctx, src_pos + n <= isl_map_dim(map, src_type),
2389 if (dst_type == src_type && dst_pos == src_pos)
2392 isl_assert(map->ctx, dst_type != src_type, goto error);
2394 map = isl_map_cow(map);
2398 map->dim = isl_dim_move(map->dim, dst_type, dst_pos, src_type, src_pos, n);
2402 for (i = 0; i < map->n; ++i) {
2403 map->p[i] = isl_basic_map_move_dims(map->p[i],
2405 src_type, src_pos, n);
2416 /* Move the specified dimensions to the last columns right before
2417 * the divs. Don't change the dimension specification of bmap.
2418 * That's the responsibility of the caller.
2420 static __isl_give isl_basic_map *move_last(__isl_take isl_basic_map *bmap,
2421 enum isl_dim_type type, unsigned first, unsigned n)
2423 struct isl_dim_map *dim_map;
2424 struct isl_basic_map *res;
2425 enum isl_dim_type t;
2426 unsigned total, off;
2430 if (pos(bmap->dim, type) + first + n == 1 + isl_dim_total(bmap->dim))
2433 total = isl_basic_map_total_dim(bmap);
2434 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2437 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
2438 unsigned size = isl_dim_size(bmap->dim, t);
2440 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2443 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2444 first, n, total - bmap->n_div - n);
2445 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2446 first + n, size - (first + n), off);
2447 off += size - (first + n);
2449 isl_dim_map_dim(dim_map, bmap->dim, t, off);
2453 isl_dim_map_div(dim_map, bmap, off + n);
2455 res = isl_basic_map_alloc_dim(isl_basic_map_get_dim(bmap),
2456 bmap->n_div, bmap->n_eq, bmap->n_ineq);
2457 res = add_constraints_dim_map(res, bmap, dim_map);
2461 /* Turn the n dimensions of type type, starting at first
2462 * into existentially quantified variables.
2464 __isl_give isl_basic_map *isl_basic_map_project_out(
2465 __isl_take isl_basic_map *bmap,
2466 enum isl_dim_type type, unsigned first, unsigned n)
2479 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL))
2480 return isl_basic_map_remove(bmap, type, first, n);
2482 isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
2485 bmap = move_last(bmap, type, first, n);
2486 bmap = isl_basic_map_cow(bmap);
2490 row_size = 1 + isl_dim_total(bmap->dim) + bmap->extra;
2491 old = bmap->block2.data;
2492 bmap->block2 = isl_blk_extend(bmap->ctx, bmap->block2,
2493 (bmap->extra + n) * (1 + row_size));
2494 if (!bmap->block2.data)
2496 new_div = isl_alloc_array(bmap->ctx, isl_int *, bmap->extra + n);
2499 for (i = 0; i < n; ++i) {
2500 new_div[i] = bmap->block2.data +
2501 (bmap->extra + i) * (1 + row_size);
2502 isl_seq_clr(new_div[i], 1 + row_size);
2504 for (i = 0; i < bmap->extra; ++i)
2505 new_div[n + i] = bmap->block2.data + (bmap->div[i] - old);
2507 bmap->div = new_div;
2511 bmap->dim = isl_dim_drop(bmap->dim, type, first, n);
2514 bmap = isl_basic_map_simplify(bmap);
2515 bmap = isl_basic_map_drop_redundant_divs(bmap);
2516 return isl_basic_map_finalize(bmap);
2518 isl_basic_map_free(bmap);
2522 /* Turn the n dimensions of type type, starting at first
2523 * into existentially quantified variables.
2525 struct isl_basic_set *isl_basic_set_project_out(struct isl_basic_set *bset,
2526 enum isl_dim_type type, unsigned first, unsigned n)
2528 return (isl_basic_set *)isl_basic_map_project_out(
2529 (isl_basic_map *)bset, type, first, n);
2532 /* Turn the n dimensions of type type, starting at first
2533 * into existentially quantified variables.
2535 __isl_give isl_map *isl_map_project_out(__isl_take isl_map *map,
2536 enum isl_dim_type type, unsigned first, unsigned n)
2546 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
2548 map = isl_map_cow(map);
2552 map->dim = isl_dim_drop(map->dim, type, first, n);
2556 for (i = 0; i < map->n; ++i) {
2557 map->p[i] = isl_basic_map_project_out(map->p[i], type, first, n);
2568 /* Turn the n dimensions of type type, starting at first
2569 * into existentially quantified variables.
2571 __isl_give isl_set *isl_set_project_out(__isl_take isl_set *set,
2572 enum isl_dim_type type, unsigned first, unsigned n)
2574 return (isl_set *)isl_map_project_out((isl_map *)set, type, first, n);
2577 static struct isl_basic_map *add_divs(struct isl_basic_map *bmap, unsigned n)
2581 for (i = 0; i < n; ++i) {
2582 j = isl_basic_map_alloc_div(bmap);
2585 isl_seq_clr(bmap->div[j], 1+1+isl_basic_map_total_dim(bmap));
2589 isl_basic_map_free(bmap);
2593 struct isl_basic_map *isl_basic_map_apply_range(
2594 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2596 struct isl_dim *dim_result = NULL;
2597 struct isl_basic_map *bmap;
2598 unsigned n_in, n_out, n, nparam, total, pos;
2599 struct isl_dim_map *dim_map1, *dim_map2;
2601 if (!bmap1 || !bmap2)
2604 dim_result = isl_dim_join(isl_dim_copy(bmap1->dim),
2605 isl_dim_copy(bmap2->dim));
2607 n_in = isl_basic_map_n_in(bmap1);
2608 n_out = isl_basic_map_n_out(bmap2);
2609 n = isl_basic_map_n_out(bmap1);
2610 nparam = isl_basic_map_n_param(bmap1);
2612 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + n;
2613 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
2614 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
2615 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
2616 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
2617 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
2618 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_in);
2619 isl_dim_map_div(dim_map1, bmap1, pos += n_out);
2620 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
2621 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
2622 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
2624 bmap = isl_basic_map_alloc_dim(dim_result,
2625 bmap1->n_div + bmap2->n_div + n,
2626 bmap1->n_eq + bmap2->n_eq,
2627 bmap1->n_ineq + bmap2->n_ineq);
2628 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
2629 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
2630 bmap = add_divs(bmap, n);
2631 bmap = isl_basic_map_simplify(bmap);
2632 bmap = isl_basic_map_drop_redundant_divs(bmap);
2633 return isl_basic_map_finalize(bmap);
2635 isl_basic_map_free(bmap1);
2636 isl_basic_map_free(bmap2);
2640 struct isl_basic_set *isl_basic_set_apply(
2641 struct isl_basic_set *bset, struct isl_basic_map *bmap)
2646 isl_assert(bset->ctx, isl_basic_map_compatible_domain(bmap, bset),
2649 return (struct isl_basic_set *)
2650 isl_basic_map_apply_range((struct isl_basic_map *)bset, bmap);
2652 isl_basic_set_free(bset);
2653 isl_basic_map_free(bmap);
2657 struct isl_basic_map *isl_basic_map_apply_domain(
2658 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2660 if (!bmap1 || !bmap2)
2663 isl_assert(bmap1->ctx,
2664 isl_basic_map_n_in(bmap1) == isl_basic_map_n_in(bmap2), goto error);
2665 isl_assert(bmap1->ctx,
2666 isl_basic_map_n_param(bmap1) == isl_basic_map_n_param(bmap2),
2669 bmap1 = isl_basic_map_reverse(bmap1);
2670 bmap1 = isl_basic_map_apply_range(bmap1, bmap2);
2671 return isl_basic_map_reverse(bmap1);
2673 isl_basic_map_free(bmap1);
2674 isl_basic_map_free(bmap2);
2678 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
2679 * A \cap B -> f(A) + f(B)
2681 struct isl_basic_map *isl_basic_map_sum(
2682 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2684 unsigned n_in, n_out, nparam, total, pos;
2685 struct isl_basic_map *bmap = NULL;
2686 struct isl_dim_map *dim_map1, *dim_map2;
2689 if (!bmap1 || !bmap2)
2692 isl_assert(bmap1->ctx, isl_dim_equal(bmap1->dim, bmap2->dim),
2695 nparam = isl_basic_map_n_param(bmap1);
2696 n_in = isl_basic_map_n_in(bmap1);
2697 n_out = isl_basic_map_n_out(bmap1);
2699 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + 2 * n_out;
2700 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
2701 dim_map2 = isl_dim_map_alloc(bmap2->ctx, total);
2702 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
2703 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos);
2704 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
2705 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
2706 isl_dim_map_div(dim_map1, bmap1, pos += n_in + n_out);
2707 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
2708 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
2709 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_out);
2711 bmap = isl_basic_map_alloc_dim(isl_dim_copy(bmap1->dim),
2712 bmap1->n_div + bmap2->n_div + 2 * n_out,
2713 bmap1->n_eq + bmap2->n_eq + n_out,
2714 bmap1->n_ineq + bmap2->n_ineq);
2715 for (i = 0; i < n_out; ++i) {
2716 int j = isl_basic_map_alloc_equality(bmap);
2719 isl_seq_clr(bmap->eq[j], 1+total);
2720 isl_int_set_si(bmap->eq[j][1+nparam+n_in+i], -1);
2721 isl_int_set_si(bmap->eq[j][1+pos+i], 1);
2722 isl_int_set_si(bmap->eq[j][1+pos-n_out+i], 1);
2724 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
2725 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
2726 bmap = add_divs(bmap, 2 * n_out);
2728 bmap = isl_basic_map_simplify(bmap);
2729 return isl_basic_map_finalize(bmap);
2731 isl_basic_map_free(bmap);
2732 isl_basic_map_free(bmap1);
2733 isl_basic_map_free(bmap2);
2737 /* Given two maps A -> f(A) and B -> g(B), construct a map
2738 * A \cap B -> f(A) + f(B)
2740 struct isl_map *isl_map_sum(struct isl_map *map1, struct isl_map *map2)
2742 struct isl_map *result;
2748 isl_assert(map1->ctx, isl_dim_equal(map1->dim, map2->dim), goto error);
2750 result = isl_map_alloc_dim(isl_dim_copy(map1->dim),
2751 map1->n * map2->n, 0);
2754 for (i = 0; i < map1->n; ++i)
2755 for (j = 0; j < map2->n; ++j) {
2756 struct isl_basic_map *part;
2757 part = isl_basic_map_sum(
2758 isl_basic_map_copy(map1->p[i]),
2759 isl_basic_map_copy(map2->p[j]));
2760 if (isl_basic_map_is_empty(part))
2761 isl_basic_map_free(part);
2763 result = isl_map_add_basic_map(result, part);
2776 __isl_give isl_set *isl_set_sum(__isl_take isl_set *set1,
2777 __isl_take isl_set *set2)
2779 return (isl_set *)isl_map_sum((isl_map *)set1, (isl_map *)set2);
2782 /* Given a basic map A -> f(A), construct A -> -f(A).
2784 struct isl_basic_map *isl_basic_map_neg(struct isl_basic_map *bmap)
2789 bmap = isl_basic_map_cow(bmap);
2793 n = isl_basic_map_dim(bmap, isl_dim_out);
2794 off = isl_basic_map_offset(bmap, isl_dim_out);
2795 for (i = 0; i < bmap->n_eq; ++i)
2796 for (j = 0; j < n; ++j)
2797 isl_int_neg(bmap->eq[i][off+j], bmap->eq[i][off+j]);
2798 for (i = 0; i < bmap->n_ineq; ++i)
2799 for (j = 0; j < n; ++j)
2800 isl_int_neg(bmap->ineq[i][off+j], bmap->ineq[i][off+j]);
2801 for (i = 0; i < bmap->n_div; ++i)
2802 for (j = 0; j < n; ++j)
2803 isl_int_neg(bmap->div[i][1+off+j], bmap->div[i][1+off+j]);
2804 return isl_basic_map_finalize(bmap);
2807 /* Given a map A -> f(A), construct A -> -f(A).
2809 struct isl_map *isl_map_neg(struct isl_map *map)
2813 map = isl_map_cow(map);
2817 for (i = 0; i < map->n; ++i) {
2818 map->p[i] = isl_basic_map_neg(map->p[i]);
2829 __isl_give isl_set *isl_set_neg(__isl_take isl_set *set)
2831 return (isl_set *)isl_map_neg((isl_map *)set);
2834 /* Given a basic map A -> f(A) and an integer d, construct a basic map
2835 * A -> floor(f(A)/d).
2837 struct isl_basic_map *isl_basic_map_floordiv(struct isl_basic_map *bmap,
2840 unsigned n_in, n_out, nparam, total, pos;
2841 struct isl_basic_map *result = NULL;
2842 struct isl_dim_map *dim_map;
2848 nparam = isl_basic_map_n_param(bmap);
2849 n_in = isl_basic_map_n_in(bmap);
2850 n_out = isl_basic_map_n_out(bmap);
2852 total = nparam + n_in + n_out + bmap->n_div + n_out;
2853 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2854 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_param, pos = 0);
2855 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_in, pos += nparam);
2856 isl_dim_map_div(dim_map, bmap, pos += n_in + n_out);
2857 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_out, pos += bmap->n_div);
2859 result = isl_basic_map_alloc_dim(isl_dim_copy(bmap->dim),
2860 bmap->n_div + n_out,
2861 bmap->n_eq, bmap->n_ineq + 2 * n_out);
2862 result = add_constraints_dim_map(result, bmap, dim_map);
2863 result = add_divs(result, n_out);
2864 for (i = 0; i < n_out; ++i) {
2866 j = isl_basic_map_alloc_inequality(result);
2869 isl_seq_clr(result->ineq[j], 1+total);
2870 isl_int_neg(result->ineq[j][1+nparam+n_in+i], d);
2871 isl_int_set_si(result->ineq[j][1+pos+i], 1);
2872 j = isl_basic_map_alloc_inequality(result);
2875 isl_seq_clr(result->ineq[j], 1+total);
2876 isl_int_set(result->ineq[j][1+nparam+n_in+i], d);
2877 isl_int_set_si(result->ineq[j][1+pos+i], -1);
2878 isl_int_sub_ui(result->ineq[j][0], d, 1);
2881 result = isl_basic_map_simplify(result);
2882 return isl_basic_map_finalize(result);
2884 isl_basic_map_free(result);
2888 /* Given a map A -> f(A) and an integer d, construct a map
2889 * A -> floor(f(A)/d).
2891 struct isl_map *isl_map_floordiv(struct isl_map *map, isl_int d)
2895 map = isl_map_cow(map);
2899 ISL_F_CLR(map, ISL_MAP_DISJOINT);
2900 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
2901 for (i = 0; i < map->n; ++i) {
2902 map->p[i] = isl_basic_map_floordiv(map->p[i], d);
2913 static struct isl_basic_map *var_equal(struct isl_basic_map *bmap, unsigned pos)
2919 i = isl_basic_map_alloc_equality(bmap);
2922 nparam = isl_basic_map_n_param(bmap);
2923 n_in = isl_basic_map_n_in(bmap);
2924 isl_seq_clr(bmap->eq[i], 1 + isl_basic_map_total_dim(bmap));
2925 isl_int_set_si(bmap->eq[i][1+nparam+pos], -1);
2926 isl_int_set_si(bmap->eq[i][1+nparam+n_in+pos], 1);
2927 return isl_basic_map_finalize(bmap);
2929 isl_basic_map_free(bmap);
2933 /* Add a constraints to "bmap" expressing i_pos < o_pos
2935 static struct isl_basic_map *var_less(struct isl_basic_map *bmap, unsigned pos)
2941 i = isl_basic_map_alloc_inequality(bmap);
2944 nparam = isl_basic_map_n_param(bmap);
2945 n_in = isl_basic_map_n_in(bmap);
2946 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
2947 isl_int_set_si(bmap->ineq[i][0], -1);
2948 isl_int_set_si(bmap->ineq[i][1+nparam+pos], -1);
2949 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], 1);
2950 return isl_basic_map_finalize(bmap);
2952 isl_basic_map_free(bmap);
2956 /* Add a constraint to "bmap" expressing i_pos <= o_pos
2958 static __isl_give isl_basic_map *var_less_or_equal(
2959 __isl_take isl_basic_map *bmap, unsigned pos)
2965 i = isl_basic_map_alloc_inequality(bmap);
2968 nparam = isl_basic_map_n_param(bmap);
2969 n_in = isl_basic_map_n_in(bmap);
2970 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
2971 isl_int_set_si(bmap->ineq[i][1+nparam+pos], -1);
2972 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], 1);
2973 return isl_basic_map_finalize(bmap);
2975 isl_basic_map_free(bmap);
2979 /* Add a constraints to "bmap" expressing i_pos > o_pos
2981 static struct isl_basic_map *var_more(struct isl_basic_map *bmap, unsigned pos)
2987 i = isl_basic_map_alloc_inequality(bmap);
2990 nparam = isl_basic_map_n_param(bmap);
2991 n_in = isl_basic_map_n_in(bmap);
2992 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
2993 isl_int_set_si(bmap->ineq[i][0], -1);
2994 isl_int_set_si(bmap->ineq[i][1+nparam+pos], 1);
2995 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], -1);
2996 return isl_basic_map_finalize(bmap);
2998 isl_basic_map_free(bmap);
3002 /* Add a constraint to "bmap" expressing i_pos >= o_pos
3004 static __isl_give isl_basic_map *var_more_or_equal(
3005 __isl_take isl_basic_map *bmap, unsigned pos)
3011 i = isl_basic_map_alloc_inequality(bmap);
3014 nparam = isl_basic_map_n_param(bmap);
3015 n_in = isl_basic_map_n_in(bmap);
3016 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
3017 isl_int_set_si(bmap->ineq[i][1+nparam+pos], 1);
3018 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], -1);
3019 return isl_basic_map_finalize(bmap);
3021 isl_basic_map_free(bmap);
3025 struct isl_basic_map *isl_basic_map_equal(struct isl_dim *dim, unsigned n_equal)
3028 struct isl_basic_map *bmap;
3029 bmap = isl_basic_map_alloc_dim(dim, 0, n_equal, 0);
3032 for (i = 0; i < n_equal && bmap; ++i)
3033 bmap = var_equal(bmap, i);
3034 return isl_basic_map_finalize(bmap);
3037 /* Return a relation on of dimension "dim" expressing i_[0..pos] << o_[0..pos]
3039 struct isl_basic_map *isl_basic_map_less_at(struct isl_dim *dim, unsigned pos)
3042 struct isl_basic_map *bmap;
3043 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
3046 for (i = 0; i < pos && bmap; ++i)
3047 bmap = var_equal(bmap, i);
3049 bmap = var_less(bmap, pos);
3050 return isl_basic_map_finalize(bmap);
3053 /* Return a relation on of dimension "dim" expressing i_[0..pos] <<= o_[0..pos]
3055 __isl_give isl_basic_map *isl_basic_map_less_or_equal_at(
3056 __isl_take isl_dim *dim, unsigned pos)
3059 isl_basic_map *bmap;
3061 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
3062 for (i = 0; i < pos; ++i)
3063 bmap = var_equal(bmap, i);
3064 bmap = var_less_or_equal(bmap, pos);
3065 return isl_basic_map_finalize(bmap);
3068 /* Return a relation on pairs of sets of dimension "dim" expressing i_pos > o_pos
3070 struct isl_basic_map *isl_basic_map_more_at(struct isl_dim *dim, unsigned pos)
3073 struct isl_basic_map *bmap;
3074 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
3077 for (i = 0; i < pos && bmap; ++i)
3078 bmap = var_equal(bmap, i);
3080 bmap = var_more(bmap, pos);
3081 return isl_basic_map_finalize(bmap);
3084 /* Return a relation on of dimension "dim" expressing i_[0..pos] >>= o_[0..pos]
3086 __isl_give isl_basic_map *isl_basic_map_more_or_equal_at(
3087 __isl_take isl_dim *dim, unsigned pos)
3090 isl_basic_map *bmap;
3092 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
3093 for (i = 0; i < pos; ++i)
3094 bmap = var_equal(bmap, i);
3095 bmap = var_more_or_equal(bmap, pos);
3096 return isl_basic_map_finalize(bmap);
3099 static __isl_give isl_map *map_lex_lte_first(__isl_take isl_dim *dims,
3100 unsigned n, int equal)
3102 struct isl_map *map;
3105 if (n == 0 && equal)
3106 return isl_map_universe(dims);
3108 map = isl_map_alloc_dim(isl_dim_copy(dims), n, ISL_MAP_DISJOINT);
3110 for (i = 0; i + 1 < n; ++i)
3111 map = isl_map_add_basic_map(map,
3112 isl_basic_map_less_at(isl_dim_copy(dims), i));
3115 map = isl_map_add_basic_map(map,
3116 isl_basic_map_less_or_equal_at(dims, n - 1));
3118 map = isl_map_add_basic_map(map,
3119 isl_basic_map_less_at(dims, n - 1));
3126 static __isl_give isl_map *map_lex_lte(__isl_take isl_dim *dims, int equal)
3130 return map_lex_lte_first(dims, dims->n_out, equal);
3133 __isl_give isl_map *isl_map_lex_lt_first(__isl_take isl_dim *dim, unsigned n)
3135 return map_lex_lte_first(dim, n, 0);
3138 __isl_give isl_map *isl_map_lex_le_first(__isl_take isl_dim *dim, unsigned n)
3140 return map_lex_lte_first(dim, n, 1);
3143 __isl_give isl_map *isl_map_lex_lt(__isl_take isl_dim *set_dim)
3145 return map_lex_lte(isl_dim_map(set_dim), 0);
3148 __isl_give isl_map *isl_map_lex_le(__isl_take isl_dim *set_dim)
3150 return map_lex_lte(isl_dim_map(set_dim), 1);
3153 static __isl_give isl_map *map_lex_gte_first(__isl_take isl_dim *dims,
3154 unsigned n, int equal)
3156 struct isl_map *map;
3159 if (n == 0 && equal)
3160 return isl_map_universe(dims);
3162 map = isl_map_alloc_dim(isl_dim_copy(dims), n, ISL_MAP_DISJOINT);
3164 for (i = 0; i + 1 < n; ++i)
3165 map = isl_map_add_basic_map(map,
3166 isl_basic_map_more_at(isl_dim_copy(dims), i));
3169 map = isl_map_add_basic_map(map,
3170 isl_basic_map_more_or_equal_at(dims, n - 1));
3172 map = isl_map_add_basic_map(map,
3173 isl_basic_map_more_at(dims, n - 1));
3180 static __isl_give isl_map *map_lex_gte(__isl_take isl_dim *dims, int equal)
3184 return map_lex_gte_first(dims, dims->n_out, equal);
3187 __isl_give isl_map *isl_map_lex_gt_first(__isl_take isl_dim *dim, unsigned n)
3189 return map_lex_gte_first(dim, n, 0);
3192 __isl_give isl_map *isl_map_lex_ge_first(__isl_take isl_dim *dim, unsigned n)
3194 return map_lex_gte_first(dim, n, 1);
3197 __isl_give isl_map *isl_map_lex_gt(__isl_take isl_dim *set_dim)
3199 return map_lex_gte(isl_dim_map(set_dim), 0);
3202 __isl_give isl_map *isl_map_lex_ge(__isl_take isl_dim *set_dim)
3204 return map_lex_gte(isl_dim_map(set_dim), 1);
3207 __isl_give isl_map *isl_set_lex_le_set(__isl_take isl_set *set1,
3208 __isl_take isl_set *set2)
3211 map = isl_map_lex_le(isl_set_get_dim(set1));
3212 map = isl_map_intersect_domain(map, set1);
3213 map = isl_map_intersect_range(map, set2);
3217 __isl_give isl_map *isl_set_lex_lt_set(__isl_take isl_set *set1,
3218 __isl_take isl_set *set2)
3221 map = isl_map_lex_lt(isl_set_get_dim(set1));
3222 map = isl_map_intersect_domain(map, set1);
3223 map = isl_map_intersect_range(map, set2);
3227 __isl_give isl_map *isl_set_lex_ge_set(__isl_take isl_set *set1,
3228 __isl_take isl_set *set2)
3231 map = isl_map_lex_ge(isl_set_get_dim(set1));
3232 map = isl_map_intersect_domain(map, set1);
3233 map = isl_map_intersect_range(map, set2);
3237 __isl_give isl_map *isl_set_lex_gt_set(__isl_take isl_set *set1,
3238 __isl_take isl_set *set2)
3241 map = isl_map_lex_gt(isl_set_get_dim(set1));
3242 map = isl_map_intersect_domain(map, set1);
3243 map = isl_map_intersect_range(map, set2);
3247 __isl_give isl_map *isl_map_lex_le_map(__isl_take isl_map *map1,
3248 __isl_take isl_map *map2)
3251 map = isl_map_lex_le(isl_dim_range(isl_map_get_dim(map1)));
3252 map = isl_map_apply_domain(map, isl_map_reverse(map1));
3253 map = isl_map_apply_range(map, isl_map_reverse(map2));
3257 __isl_give isl_map *isl_map_lex_lt_map(__isl_take isl_map *map1,
3258 __isl_take isl_map *map2)
3261 map = isl_map_lex_lt(isl_dim_range(isl_map_get_dim(map1)));
3262 map = isl_map_apply_domain(map, isl_map_reverse(map1));
3263 map = isl_map_apply_range(map, isl_map_reverse(map2));
3267 __isl_give isl_map *isl_map_lex_ge_map(__isl_take isl_map *map1,
3268 __isl_take isl_map *map2)
3271 map = isl_map_lex_ge(isl_dim_range(isl_map_get_dim(map1)));
3272 map = isl_map_apply_domain(map, isl_map_reverse(map1));
3273 map = isl_map_apply_range(map, isl_map_reverse(map2));
3277 __isl_give isl_map *isl_map_lex_gt_map(__isl_take isl_map *map1,
3278 __isl_take isl_map *map2)
3281 map = isl_map_lex_gt(isl_dim_range(isl_map_get_dim(map1)));
3282 map = isl_map_apply_domain(map, isl_map_reverse(map1));
3283 map = isl_map_apply_range(map, isl_map_reverse(map2));
3287 struct isl_basic_map *isl_basic_map_from_basic_set(
3288 struct isl_basic_set *bset, struct isl_dim *dim)
3290 struct isl_basic_map *bmap;
3292 bset = isl_basic_set_cow(bset);
3296 isl_assert(bset->ctx, isl_dim_compatible(bset->dim, dim), goto error);
3297 isl_dim_free(bset->dim);
3298 bmap = (struct isl_basic_map *) bset;
3300 return isl_basic_map_finalize(bmap);
3302 isl_basic_set_free(bset);
3307 struct isl_basic_set *isl_basic_set_from_basic_map(struct isl_basic_map *bmap)
3311 if (bmap->dim->n_in == 0)
3312 return (struct isl_basic_set *)bmap;
3313 bmap = isl_basic_map_cow(bmap);
3316 bmap->dim = isl_dim_as_set_dim(bmap->dim);
3319 bmap = isl_basic_map_finalize(bmap);
3320 return (struct isl_basic_set *)bmap;
3322 isl_basic_map_free(bmap);
3326 /* For a div d = floor(f/m), add the constraints
3329 * -(f-(n-1)) + m d >= 0
3331 * Note that the second constraint is the negation of
3335 int isl_basic_map_add_div_constraints_var(__isl_keep isl_basic_map *bmap,
3336 unsigned pos, isl_int *div)
3339 unsigned total = isl_basic_map_total_dim(bmap);
3341 i = isl_basic_map_alloc_inequality(bmap);
3344 isl_seq_cpy(bmap->ineq[i], div + 1, 1 + total);
3345 isl_int_neg(bmap->ineq[i][1 + pos], div[0]);
3347 j = isl_basic_map_alloc_inequality(bmap);
3350 isl_seq_neg(bmap->ineq[j], bmap->ineq[i], 1 + total);
3351 isl_int_add(bmap->ineq[j][0], bmap->ineq[j][0], bmap->ineq[j][1 + pos]);
3352 isl_int_sub_ui(bmap->ineq[j][0], bmap->ineq[j][0], 1);
3356 int isl_basic_set_add_div_constraints_var(__isl_keep isl_basic_set *bset,
3357 unsigned pos, isl_int *div)
3359 return isl_basic_map_add_div_constraints_var((isl_basic_map *)bset,
3363 int isl_basic_map_add_div_constraints(struct isl_basic_map *bmap, unsigned div)
3365 unsigned total = isl_basic_map_total_dim(bmap);
3366 unsigned div_pos = total - bmap->n_div + div;
3368 return isl_basic_map_add_div_constraints_var(bmap, div_pos,
3372 struct isl_basic_set *isl_basic_map_underlying_set(
3373 struct isl_basic_map *bmap)
3377 if (bmap->dim->nparam == 0 && bmap->dim->n_in == 0 &&
3378 bmap->n_div == 0 && !isl_dim_get_tuple_name(bmap->dim, isl_dim_out))
3379 return (struct isl_basic_set *)bmap;
3380 bmap = isl_basic_map_cow(bmap);
3383 bmap->dim = isl_dim_underlying(bmap->dim, bmap->n_div);
3386 bmap->extra -= bmap->n_div;
3388 bmap = isl_basic_map_finalize(bmap);
3389 return (struct isl_basic_set *)bmap;
3394 __isl_give isl_basic_set *isl_basic_set_underlying_set(
3395 __isl_take isl_basic_set *bset)
3397 return isl_basic_map_underlying_set((isl_basic_map *)bset);
3400 struct isl_basic_map *isl_basic_map_overlying_set(
3401 struct isl_basic_set *bset, struct isl_basic_map *like)
3403 struct isl_basic_map *bmap;
3404 struct isl_ctx *ctx;
3411 isl_assert(ctx, bset->n_div == 0, goto error);
3412 isl_assert(ctx, isl_basic_set_n_param(bset) == 0, goto error);
3413 isl_assert(ctx, bset->dim->n_out == isl_basic_map_total_dim(like),
3415 if (isl_dim_equal(bset->dim, like->dim) && like->n_div == 0) {
3416 isl_basic_map_free(like);
3417 return (struct isl_basic_map *)bset;
3419 bset = isl_basic_set_cow(bset);
3422 total = bset->dim->n_out + bset->extra;
3423 bmap = (struct isl_basic_map *)bset;
3424 isl_dim_free(bmap->dim);
3425 bmap->dim = isl_dim_copy(like->dim);
3428 bmap->n_div = like->n_div;
3429 bmap->extra += like->n_div;
3432 ltotal = total - bmap->extra + like->extra;
3435 bmap->block2 = isl_blk_extend(ctx, bmap->block2,
3436 bmap->extra * (1 + 1 + total));
3437 if (isl_blk_is_error(bmap->block2))
3439 bmap->div = isl_realloc_array(ctx, bmap->div, isl_int *,
3443 for (i = 0; i < bmap->extra; ++i)
3444 bmap->div[i] = bmap->block2.data + i * (1 + 1 + total);
3445 for (i = 0; i < like->n_div; ++i) {
3446 isl_seq_cpy(bmap->div[i], like->div[i], 1 + 1 + ltotal);
3447 isl_seq_clr(bmap->div[i]+1+1+ltotal, total - ltotal);
3449 bmap = isl_basic_map_extend_constraints(bmap,
3450 0, 2 * like->n_div);
3451 for (i = 0; i < like->n_div; ++i) {
3452 if (isl_int_is_zero(bmap->div[i][0]))
3454 if (isl_basic_map_add_div_constraints(bmap, i) < 0)
3458 isl_basic_map_free(like);
3459 bmap = isl_basic_map_simplify(bmap);
3460 bmap = isl_basic_map_finalize(bmap);
3463 isl_basic_map_free(like);
3464 isl_basic_set_free(bset);
3468 struct isl_basic_set *isl_basic_set_from_underlying_set(
3469 struct isl_basic_set *bset, struct isl_basic_set *like)
3471 return (struct isl_basic_set *)
3472 isl_basic_map_overlying_set(bset, (struct isl_basic_map *)like);
3475 struct isl_set *isl_set_from_underlying_set(
3476 struct isl_set *set, struct isl_basic_set *like)
3482 isl_assert(set->ctx, set->dim->n_out == isl_basic_set_total_dim(like),
3484 if (isl_dim_equal(set->dim, like->dim) && like->n_div == 0) {
3485 isl_basic_set_free(like);
3488 set = isl_set_cow(set);
3491 for (i = 0; i < set->n; ++i) {
3492 set->p[i] = isl_basic_set_from_underlying_set(set->p[i],
3493 isl_basic_set_copy(like));
3497 isl_dim_free(set->dim);
3498 set->dim = isl_dim_copy(like->dim);
3501 isl_basic_set_free(like);
3504 isl_basic_set_free(like);
3509 struct isl_set *isl_map_underlying_set(struct isl_map *map)
3513 map = isl_map_cow(map);
3516 map->dim = isl_dim_cow(map->dim);
3520 for (i = 1; i < map->n; ++i)
3521 isl_assert(map->ctx, map->p[0]->n_div == map->p[i]->n_div,
3523 for (i = 0; i < map->n; ++i) {
3524 map->p[i] = (struct isl_basic_map *)
3525 isl_basic_map_underlying_set(map->p[i]);
3530 map->dim = isl_dim_underlying(map->dim, 0);
3532 isl_dim_free(map->dim);
3533 map->dim = isl_dim_copy(map->p[0]->dim);
3537 return (struct isl_set *)map;
3543 struct isl_set *isl_set_to_underlying_set(struct isl_set *set)
3545 return (struct isl_set *)isl_map_underlying_set((struct isl_map *)set);
3548 static __isl_give isl_basic_map *isl_basic_map_reset_dim(
3549 __isl_take isl_basic_map *bmap, __isl_take isl_dim *dim)
3551 bmap = isl_basic_map_cow(bmap);
3555 isl_dim_free(bmap->dim);
3558 bmap = isl_basic_map_finalize(bmap);
3562 isl_basic_map_free(bmap);
3567 static __isl_give isl_basic_set *isl_basic_set_reset_dim(
3568 __isl_take isl_basic_set *bset, __isl_take isl_dim *dim)
3570 return (isl_basic_set *)isl_basic_map_reset_dim((isl_basic_map *)bset,
3574 __isl_give isl_map *isl_map_reset_dim(__isl_take isl_map *map,
3575 __isl_take isl_dim *dim)
3579 map = isl_map_cow(map);
3583 for (i = 0; i < map->n; ++i) {
3584 map->p[i] = isl_basic_map_reset_dim(map->p[i],
3589 isl_dim_free(map->dim);
3599 __isl_give isl_set *isl_set_reset_dim(__isl_take isl_set *set,
3600 __isl_take isl_dim *dim)
3602 return (struct isl_set *) isl_map_reset_dim((struct isl_map *)set, dim);
3605 struct isl_basic_set *isl_basic_map_domain(struct isl_basic_map *bmap)
3608 struct isl_basic_set *domain;
3614 dim = isl_dim_domain(isl_basic_map_get_dim(bmap));
3616 n_in = isl_basic_map_n_in(bmap);
3617 n_out = isl_basic_map_n_out(bmap);
3618 domain = isl_basic_set_from_basic_map(bmap);
3619 domain = isl_basic_set_project_out(domain, isl_dim_set, n_in, n_out);
3621 domain = isl_basic_set_reset_dim(domain, dim);
3626 struct isl_basic_set *isl_basic_map_range(struct isl_basic_map *bmap)
3628 return isl_basic_map_domain(isl_basic_map_reverse(bmap));
3631 struct isl_set *isl_map_range(struct isl_map *map)
3634 struct isl_set *set;
3638 if (isl_map_dim(map, isl_dim_in) == 0)
3639 return (isl_set *)map;
3641 map = isl_map_cow(map);
3645 set = (struct isl_set *) map;
3646 set->dim = isl_dim_drop_inputs(set->dim, 0, set->dim->n_in);
3649 for (i = 0; i < map->n; ++i) {
3650 set->p[i] = isl_basic_map_range(map->p[i]);
3654 ISL_F_CLR(set, ISL_MAP_DISJOINT);
3655 ISL_F_CLR(set, ISL_SET_NORMALIZED);
3662 struct isl_map *isl_map_from_set(struct isl_set *set, struct isl_dim *dim)
3665 struct isl_map *map = NULL;
3667 set = isl_set_cow(set);
3670 isl_assert(set->ctx, isl_dim_compatible(set->dim, dim), goto error);
3671 map = (struct isl_map *)set;
3672 for (i = 0; i < set->n; ++i) {
3673 map->p[i] = isl_basic_map_from_basic_set(
3674 set->p[i], isl_dim_copy(dim));
3678 isl_dim_free(map->dim);
3687 __isl_give isl_basic_map *isl_basic_map_from_range(
3688 __isl_take isl_basic_set *bset)
3690 return (isl_basic_map *)bset;
3693 struct isl_map *isl_map_from_range(struct isl_set *set)
3695 return (struct isl_map *)set;
3698 __isl_give isl_map *isl_map_from_domain(__isl_take isl_set *set)
3700 return isl_map_reverse(isl_map_from_range(set));
3703 __isl_give isl_map *isl_map_from_domain_and_range(__isl_take isl_set *domain,
3704 __isl_take isl_set *range)
3706 return isl_map_apply_range(isl_map_from_domain(domain),
3707 isl_map_from_range(range));
3710 struct isl_set *isl_set_from_map(struct isl_map *map)
3713 struct isl_set *set = NULL;
3717 map = isl_map_cow(map);
3720 map->dim = isl_dim_as_set_dim(map->dim);
3723 set = (struct isl_set *)map;
3724 for (i = 0; i < map->n; ++i) {
3725 set->p[i] = isl_basic_set_from_basic_map(map->p[i]);
3735 struct isl_map *isl_map_alloc_dim(struct isl_dim *dim, int n, unsigned flags)
3737 struct isl_map *map;
3741 isl_assert(dim->ctx, n >= 0, return NULL);
3742 map = isl_alloc(dim->ctx, struct isl_map,
3743 sizeof(struct isl_map) +
3744 (n - 1) * sizeof(struct isl_basic_map *));
3748 map->ctx = dim->ctx;
3749 isl_ctx_ref(map->ctx);
3761 struct isl_map *isl_map_alloc(struct isl_ctx *ctx,
3762 unsigned nparam, unsigned in, unsigned out, int n,
3765 struct isl_map *map;
3766 struct isl_dim *dims;
3768 dims = isl_dim_alloc(ctx, nparam, in, out);
3772 map = isl_map_alloc_dim(dims, n, flags);
3776 struct isl_basic_map *isl_basic_map_empty(struct isl_dim *dim)
3778 struct isl_basic_map *bmap;
3779 bmap = isl_basic_map_alloc_dim(dim, 0, 1, 0);
3780 bmap = isl_basic_map_set_to_empty(bmap);
3784 struct isl_basic_set *isl_basic_set_empty(struct isl_dim *dim)
3786 struct isl_basic_set *bset;
3787 bset = isl_basic_set_alloc_dim(dim, 0, 1, 0);
3788 bset = isl_basic_set_set_to_empty(bset);
3792 struct isl_basic_map *isl_basic_map_empty_like(struct isl_basic_map *model)
3794 struct isl_basic_map *bmap;
3797 bmap = isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
3798 bmap = isl_basic_map_set_to_empty(bmap);
3802 struct isl_basic_map *isl_basic_map_empty_like_map(struct isl_map *model)
3804 struct isl_basic_map *bmap;
3807 bmap = isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
3808 bmap = isl_basic_map_set_to_empty(bmap);
3812 struct isl_basic_set *isl_basic_set_empty_like(struct isl_basic_set *model)
3814 struct isl_basic_set *bset;
3817 bset = isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
3818 bset = isl_basic_set_set_to_empty(bset);
3822 struct isl_basic_map *isl_basic_map_universe(struct isl_dim *dim)
3824 struct isl_basic_map *bmap;
3825 bmap = isl_basic_map_alloc_dim(dim, 0, 0, 0);
3829 struct isl_basic_set *isl_basic_set_universe(struct isl_dim *dim)
3831 struct isl_basic_set *bset;
3832 bset = isl_basic_set_alloc_dim(dim, 0, 0, 0);
3836 __isl_give isl_basic_map *isl_basic_map_universe_like(
3837 __isl_keep isl_basic_map *model)
3841 return isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
3844 struct isl_basic_set *isl_basic_set_universe_like(struct isl_basic_set *model)
3848 return isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
3851 __isl_give isl_basic_set *isl_basic_set_universe_like_set(
3852 __isl_keep isl_set *model)
3856 return isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
3859 struct isl_map *isl_map_empty(struct isl_dim *dim)
3861 return isl_map_alloc_dim(dim, 0, ISL_MAP_DISJOINT);
3864 struct isl_map *isl_map_empty_like(struct isl_map *model)
3868 return isl_map_alloc_dim(isl_dim_copy(model->dim), 0, ISL_MAP_DISJOINT);
3871 struct isl_map *isl_map_empty_like_basic_map(struct isl_basic_map *model)
3875 return isl_map_alloc_dim(isl_dim_copy(model->dim), 0, ISL_MAP_DISJOINT);
3878 struct isl_set *isl_set_empty(struct isl_dim *dim)
3880 return isl_set_alloc_dim(dim, 0, ISL_MAP_DISJOINT);
3883 struct isl_set *isl_set_empty_like(struct isl_set *model)
3887 return isl_set_empty(isl_dim_copy(model->dim));
3890 struct isl_map *isl_map_universe(struct isl_dim *dim)
3892 struct isl_map *map;
3895 map = isl_map_alloc_dim(isl_dim_copy(dim), 1, ISL_MAP_DISJOINT);
3896 map = isl_map_add_basic_map(map, isl_basic_map_universe(dim));
3900 struct isl_set *isl_set_universe(struct isl_dim *dim)
3902 struct isl_set *set;
3905 set = isl_set_alloc_dim(isl_dim_copy(dim), 1, ISL_MAP_DISJOINT);
3906 set = isl_set_add_basic_set(set, isl_basic_set_universe(dim));
3910 __isl_give isl_set *isl_set_universe_like(__isl_keep isl_set *model)
3914 return isl_set_universe(isl_dim_copy(model->dim));
3917 struct isl_map *isl_map_dup(struct isl_map *map)
3920 struct isl_map *dup;
3924 dup = isl_map_alloc_dim(isl_dim_copy(map->dim), map->n, map->flags);
3925 for (i = 0; i < map->n; ++i)
3926 dup = isl_map_add_basic_map(dup, isl_basic_map_copy(map->p[i]));
3930 __isl_give isl_map *isl_map_add_basic_map(__isl_take isl_map *map,
3931 __isl_take isl_basic_map *bmap)
3935 if (isl_basic_map_fast_is_empty(bmap)) {
3936 isl_basic_map_free(bmap);
3939 isl_assert(map->ctx, isl_dim_equal(map->dim, bmap->dim), goto error);
3940 isl_assert(map->ctx, map->n < map->size, goto error);
3941 map->p[map->n] = bmap;
3943 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3949 isl_basic_map_free(bmap);
3953 void isl_map_free(struct isl_map *map)
3963 isl_ctx_deref(map->ctx);
3964 for (i = 0; i < map->n; ++i)
3965 isl_basic_map_free(map->p[i]);
3966 isl_dim_free(map->dim);
3970 struct isl_map *isl_map_extend(struct isl_map *base,
3971 unsigned nparam, unsigned n_in, unsigned n_out)
3975 base = isl_map_cow(base);
3979 base->dim = isl_dim_extend(base->dim, nparam, n_in, n_out);
3982 for (i = 0; i < base->n; ++i) {
3983 base->p[i] = isl_basic_map_extend_dim(base->p[i],
3984 isl_dim_copy(base->dim), 0, 0, 0);
3994 struct isl_set *isl_set_extend(struct isl_set *base,
3995 unsigned nparam, unsigned dim)
3997 return (struct isl_set *)isl_map_extend((struct isl_map *)base,
4001 static struct isl_basic_map *isl_basic_map_fix_pos_si(
4002 struct isl_basic_map *bmap, unsigned pos, int value)
4006 bmap = isl_basic_map_cow(bmap);
4007 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
4008 j = isl_basic_map_alloc_equality(bmap);
4011 isl_seq_clr(bmap->eq[j] + 1, isl_basic_map_total_dim(bmap));
4012 isl_int_set_si(bmap->eq[j][pos], -1);
4013 isl_int_set_si(bmap->eq[j][0], value);
4014 bmap = isl_basic_map_simplify(bmap);
4015 return isl_basic_map_finalize(bmap);
4017 isl_basic_map_free(bmap);
4021 static __isl_give isl_basic_map *isl_basic_map_fix_pos(
4022 __isl_take isl_basic_map *bmap, unsigned pos, isl_int value)
4026 bmap = isl_basic_map_cow(bmap);
4027 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
4028 j = isl_basic_map_alloc_equality(bmap);
4031 isl_seq_clr(bmap->eq[j] + 1, isl_basic_map_total_dim(bmap));
4032 isl_int_set_si(bmap->eq[j][pos], -1);
4033 isl_int_set(bmap->eq[j][0], value);
4034 bmap = isl_basic_map_simplify(bmap);
4035 return isl_basic_map_finalize(bmap);
4037 isl_basic_map_free(bmap);
4041 struct isl_basic_map *isl_basic_map_fix_si(struct isl_basic_map *bmap,
4042 enum isl_dim_type type, unsigned pos, int value)
4046 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
4047 return isl_basic_map_fix_pos_si(bmap,
4048 isl_basic_map_offset(bmap, type) + pos, value);
4050 isl_basic_map_free(bmap);
4054 __isl_give isl_basic_map *isl_basic_map_fix(__isl_take isl_basic_map *bmap,
4055 enum isl_dim_type type, unsigned pos, isl_int value)
4059 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
4060 return isl_basic_map_fix_pos(bmap,
4061 isl_basic_map_offset(bmap, type) + pos, value);
4063 isl_basic_map_free(bmap);
4067 struct isl_basic_set *isl_basic_set_fix_si(struct isl_basic_set *bset,
4068 enum isl_dim_type type, unsigned pos, int value)
4070 return (struct isl_basic_set *)
4071 isl_basic_map_fix_si((struct isl_basic_map *)bset,
4075 __isl_give isl_basic_set *isl_basic_set_fix(__isl_take isl_basic_set *bset,
4076 enum isl_dim_type type, unsigned pos, isl_int value)
4078 return (struct isl_basic_set *)
4079 isl_basic_map_fix((struct isl_basic_map *)bset,
4083 struct isl_basic_map *isl_basic_map_fix_input_si(struct isl_basic_map *bmap,
4084 unsigned input, int value)
4086 return isl_basic_map_fix_si(bmap, isl_dim_in, input, value);
4089 struct isl_basic_set *isl_basic_set_fix_dim_si(struct isl_basic_set *bset,
4090 unsigned dim, int value)
4092 return (struct isl_basic_set *)
4093 isl_basic_map_fix_si((struct isl_basic_map *)bset,
4094 isl_dim_set, dim, value);
4097 struct isl_map *isl_map_fix_si(struct isl_map *map,
4098 enum isl_dim_type type, unsigned pos, int value)
4102 map = isl_map_cow(map);
4106 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
4107 for (i = 0; i < map->n; ++i) {
4108 map->p[i] = isl_basic_map_fix_si(map->p[i], type, pos, value);
4112 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4119 __isl_give isl_set *isl_set_fix_si(__isl_take isl_set *set,
4120 enum isl_dim_type type, unsigned pos, int value)
4122 return (struct isl_set *)
4123 isl_map_fix_si((struct isl_map *)set, type, pos, value);
4126 __isl_give isl_map *isl_map_fix(__isl_take isl_map *map,
4127 enum isl_dim_type type, unsigned pos, isl_int value)
4131 map = isl_map_cow(map);
4135 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
4136 for (i = 0; i < map->n; ++i) {
4137 map->p[i] = isl_basic_map_fix(map->p[i], type, pos, value);
4141 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4148 __isl_give isl_set *isl_set_fix(__isl_take isl_set *set,
4149 enum isl_dim_type type, unsigned pos, isl_int value)
4151 return (struct isl_set *)isl_map_fix((isl_map *)set, type, pos, value);
4154 struct isl_map *isl_map_fix_input_si(struct isl_map *map,
4155 unsigned input, int value)
4157 return isl_map_fix_si(map, isl_dim_in, input, value);
4160 struct isl_set *isl_set_fix_dim_si(struct isl_set *set, unsigned dim, int value)
4162 return (struct isl_set *)
4163 isl_map_fix_si((struct isl_map *)set, isl_dim_set, dim, value);
4166 __isl_give isl_basic_map *isl_basic_map_lower_bound_si(
4167 __isl_take isl_basic_map *bmap,
4168 enum isl_dim_type type, unsigned pos, int value)
4174 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
4175 pos += isl_basic_map_offset(bmap, type);
4176 bmap = isl_basic_map_cow(bmap);
4177 bmap = isl_basic_map_extend_constraints(bmap, 0, 1);
4178 j = isl_basic_map_alloc_inequality(bmap);
4181 isl_seq_clr(bmap->ineq[j], 1 + isl_basic_map_total_dim(bmap));
4182 isl_int_set_si(bmap->ineq[j][pos], 1);
4183 isl_int_set_si(bmap->ineq[j][0], -value);
4184 bmap = isl_basic_map_simplify(bmap);
4185 return isl_basic_map_finalize(bmap);
4187 isl_basic_map_free(bmap);
4191 struct isl_basic_set *isl_basic_set_lower_bound_dim(struct isl_basic_set *bset,
4192 unsigned dim, isl_int value)
4196 bset = isl_basic_set_cow(bset);
4197 bset = isl_basic_set_extend_constraints(bset, 0, 1);
4198 j = isl_basic_set_alloc_inequality(bset);
4201 isl_seq_clr(bset->ineq[j], 1 + isl_basic_set_total_dim(bset));
4202 isl_int_set_si(bset->ineq[j][1 + isl_basic_set_n_param(bset) + dim], 1);
4203 isl_int_neg(bset->ineq[j][0], value);
4204 bset = isl_basic_set_simplify(bset);
4205 return isl_basic_set_finalize(bset);
4207 isl_basic_set_free(bset);
4211 __isl_give isl_map *isl_map_lower_bound_si(__isl_take isl_map *map,
4212 enum isl_dim_type type, unsigned pos, int value)
4216 map = isl_map_cow(map);
4220 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
4221 for (i = 0; i < map->n; ++i) {
4222 map->p[i] = isl_basic_map_lower_bound_si(map->p[i],
4227 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4234 __isl_give isl_set *isl_set_lower_bound_si(__isl_take isl_set *set,
4235 enum isl_dim_type type, unsigned pos, int value)
4237 return (struct isl_set *)
4238 isl_map_lower_bound_si((struct isl_map *)set, type, pos, value);
4241 struct isl_set *isl_set_lower_bound_dim(struct isl_set *set, unsigned dim,
4246 set = isl_set_cow(set);
4250 isl_assert(set->ctx, dim < isl_set_n_dim(set), goto error);
4251 for (i = 0; i < set->n; ++i) {
4252 set->p[i] = isl_basic_set_lower_bound_dim(set->p[i], dim, value);
4262 struct isl_map *isl_map_reverse(struct isl_map *map)
4266 map = isl_map_cow(map);
4270 map->dim = isl_dim_reverse(map->dim);
4273 for (i = 0; i < map->n; ++i) {
4274 map->p[i] = isl_basic_map_reverse(map->p[i]);
4278 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4285 static struct isl_map *isl_basic_map_partial_lexopt(
4286 struct isl_basic_map *bmap, struct isl_basic_set *dom,
4287 struct isl_set **empty, int max)
4291 if (bmap->ctx->opt->pip == ISL_PIP_PIP)
4292 return isl_pip_basic_map_lexopt(bmap, dom, empty, max);
4294 return isl_tab_basic_map_partial_lexopt(bmap, dom, empty, max);
4296 isl_basic_map_free(bmap);
4297 isl_basic_set_free(dom);
4303 struct isl_map *isl_basic_map_partial_lexmax(
4304 struct isl_basic_map *bmap, struct isl_basic_set *dom,
4305 struct isl_set **empty)
4307 return isl_basic_map_partial_lexopt(bmap, dom, empty, 1);
4310 struct isl_map *isl_basic_map_partial_lexmin(
4311 struct isl_basic_map *bmap, struct isl_basic_set *dom,
4312 struct isl_set **empty)
4314 return isl_basic_map_partial_lexopt(bmap, dom, empty, 0);
4317 struct isl_set *isl_basic_set_partial_lexmin(
4318 struct isl_basic_set *bset, struct isl_basic_set *dom,
4319 struct isl_set **empty)
4321 return (struct isl_set *)
4322 isl_basic_map_partial_lexmin((struct isl_basic_map *)bset,
4326 struct isl_set *isl_basic_set_partial_lexmax(
4327 struct isl_basic_set *bset, struct isl_basic_set *dom,
4328 struct isl_set **empty)
4330 return (struct isl_set *)
4331 isl_basic_map_partial_lexmax((struct isl_basic_map *)bset,
4335 /* Given a basic map "bmap", compute the lexicograhically minimal
4336 * (or maximal) image element for each domain element in dom.
4337 * Set *empty to those elements in dom that do not have an image element.
4339 * We first make sure the basic sets in dom are disjoint and then
4340 * simply collect the results over each of the basic sets separately.
4341 * We could probably improve the efficiency a bit by moving the union
4342 * domain down into the parametric integer programming.
4344 static __isl_give isl_map *basic_map_partial_lexopt(
4345 __isl_take isl_basic_map *bmap, __isl_take isl_set *dom,
4346 __isl_give isl_set **empty, int max)
4349 struct isl_map *res;
4351 dom = isl_set_make_disjoint(dom);
4355 if (isl_set_fast_is_empty(dom)) {
4356 res = isl_map_empty_like_basic_map(bmap);
4357 *empty = isl_set_empty_like(dom);
4359 isl_basic_map_free(bmap);
4363 res = isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap),
4364 isl_basic_set_copy(dom->p[0]), empty, max);
4366 for (i = 1; i < dom->n; ++i) {
4367 struct isl_map *res_i;
4368 struct isl_set *empty_i;
4370 res_i = isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap),
4371 isl_basic_set_copy(dom->p[i]), &empty_i, max);
4373 res = isl_map_union_disjoint(res, res_i);
4374 *empty = isl_set_union_disjoint(*empty, empty_i);
4378 isl_basic_map_free(bmap);
4383 isl_basic_map_free(bmap);
4387 /* Given a map "map", compute the lexicograhically minimal
4388 * (or maximal) image element for each domain element in dom.
4389 * Set *empty to those elements in dom that do not have an image element.
4391 * We first compute the lexicographically minimal or maximal element
4392 * in the first basic map. This results in a partial solution "res"
4393 * and a subset "todo" of dom that still need to be handled.
4394 * We then consider each of the remaining maps in "map" and successively
4395 * improve both "res" and "todo".
4397 * Let res^k and todo^k be the results after k steps and let i = k + 1.
4398 * Assume we are computing the lexicographical maximum.
4399 * We first intersect basic map i with a relation that maps elements
4400 * to elements that are lexicographically larger than the image elements
4401 * in res^k and the compute the maximum image element of this intersection.
4402 * The result ("better") corresponds to those image elements in basic map i
4403 * that are better than what we had before. The remainder ("keep") are the
4404 * domain elements for which the image element in res_k was better.
4405 * We also compute the lexicographical maximum of basic map i in todo^k.
4406 * res^i is the result of the operation + better + those elements in
4407 * res^k that we should keep
4408 * todo^i is the remainder of the maximum operation on todo^k.
4410 static __isl_give isl_map *isl_map_partial_lexopt(
4411 __isl_take isl_map *map, __isl_take isl_set *dom,
4412 __isl_give isl_set **empty, int max)
4415 struct isl_map *res;
4416 struct isl_set *todo;
4421 if (isl_map_fast_is_empty(map)) {
4429 res = basic_map_partial_lexopt(isl_basic_map_copy(map->p[0]),
4430 isl_set_copy(dom), &todo, max);
4432 for (i = 1; i < map->n; ++i) {
4434 struct isl_map *better;
4435 struct isl_set *keep;
4436 struct isl_map *res_i;
4437 struct isl_set *todo_i;
4438 struct isl_dim *dim = isl_map_get_dim(res);
4440 dim = isl_dim_range(dim);
4442 lt = isl_map_lex_lt(dim);
4444 lt = isl_map_lex_gt(dim);
4445 lt = isl_map_apply_range(isl_map_copy(res), lt);
4446 lt = isl_map_intersect(lt,
4447 isl_map_from_basic_map(isl_basic_map_copy(map->p[i])));
4448 better = isl_map_partial_lexopt(lt,
4449 isl_map_domain(isl_map_copy(res)),
4452 res_i = basic_map_partial_lexopt(isl_basic_map_copy(map->p[i]),
4453 todo, &todo_i, max);
4455 res = isl_map_intersect_domain(res, keep);
4456 res = isl_map_union_disjoint(res, res_i);
4457 res = isl_map_union_disjoint(res, better);
4478 __isl_give isl_map *isl_map_partial_lexmax(
4479 __isl_take isl_map *map, __isl_take isl_set *dom,
4480 __isl_give isl_set **empty)
4482 return isl_map_partial_lexopt(map, dom, empty, 1);
4485 __isl_give isl_map *isl_map_partial_lexmin(
4486 __isl_take isl_map *map, __isl_take isl_set *dom,
4487 __isl_give isl_set **empty)
4489 return isl_map_partial_lexopt(map, dom, empty, 0);
4492 __isl_give isl_set *isl_set_partial_lexmin(
4493 __isl_take isl_set *set, __isl_take isl_set *dom,
4494 __isl_give isl_set **empty)
4496 return (struct isl_set *)
4497 isl_map_partial_lexmin((struct isl_map *)set,
4501 __isl_give isl_set *isl_set_partial_lexmax(
4502 __isl_take isl_set *set, __isl_take isl_set *dom,
4503 __isl_give isl_set **empty)
4505 return (struct isl_set *)
4506 isl_map_partial_lexmax((struct isl_map *)set,
4510 __isl_give isl_map *isl_basic_map_lexopt(__isl_take isl_basic_map *bmap, int max)
4512 struct isl_basic_set *dom = NULL;
4513 struct isl_dim *dom_dim;
4517 dom_dim = isl_dim_domain(isl_dim_copy(bmap->dim));
4518 dom = isl_basic_set_universe(dom_dim);
4519 return isl_basic_map_partial_lexopt(bmap, dom, NULL, max);
4521 isl_basic_map_free(bmap);
4525 __isl_give isl_map *isl_basic_map_lexmin(__isl_take isl_basic_map *bmap)
4527 return isl_basic_map_lexopt(bmap, 0);
4530 __isl_give isl_map *isl_basic_map_lexmax(__isl_take isl_basic_map *bmap)
4532 return isl_basic_map_lexopt(bmap, 1);
4535 __isl_give isl_set *isl_basic_set_lexmin(__isl_take isl_basic_set *bset)
4537 return (isl_set *)isl_basic_map_lexmin((isl_basic_map *)bset);
4540 __isl_give isl_set *isl_basic_set_lexmax(__isl_take isl_basic_set *bset)
4542 return (isl_set *)isl_basic_map_lexmax((isl_basic_map *)bset);
4545 __isl_give isl_map *isl_map_lexopt(__isl_take isl_map *map, int max)
4547 struct isl_set *dom = NULL;
4548 struct isl_dim *dom_dim;
4552 dom_dim = isl_dim_domain(isl_dim_copy(map->dim));
4553 dom = isl_set_universe(dom_dim);
4554 return isl_map_partial_lexopt(map, dom, NULL, max);
4560 __isl_give isl_map *isl_map_lexmin(__isl_take isl_map *map)
4562 return isl_map_lexopt(map, 0);
4565 __isl_give isl_map *isl_map_lexmax(__isl_take isl_map *map)
4567 return isl_map_lexopt(map, 1);
4570 __isl_give isl_set *isl_set_lexmin(__isl_take isl_set *set)
4572 return (isl_set *)isl_map_lexmin((isl_map *)set);
4575 __isl_give isl_set *isl_set_lexmax(__isl_take isl_set *set)
4577 return (isl_set *)isl_map_lexmax((isl_map *)set);
4580 /* Apply a preimage specified by "mat" on the parameters of "bset".
4581 * bset is assumed to have only parameters and divs.
4583 static struct isl_basic_set *basic_set_parameter_preimage(
4584 struct isl_basic_set *bset, struct isl_mat *mat)
4591 bset->dim = isl_dim_cow(bset->dim);
4595 nparam = isl_basic_set_dim(bset, isl_dim_param);
4597 isl_assert(bset->ctx, mat->n_row == 1 + nparam, goto error);
4599 bset->dim->nparam = 0;
4600 bset->dim->n_out = nparam;
4601 bset = isl_basic_set_preimage(bset, mat);
4603 bset->dim->nparam = bset->dim->n_out;
4604 bset->dim->n_out = 0;
4609 isl_basic_set_free(bset);
4613 /* Apply a preimage specified by "mat" on the parameters of "set".
4614 * set is assumed to have only parameters and divs.
4616 static struct isl_set *set_parameter_preimage(
4617 struct isl_set *set, struct isl_mat *mat)
4619 struct isl_dim *dim = NULL;
4625 dim = isl_dim_copy(set->dim);
4626 dim = isl_dim_cow(dim);
4630 nparam = isl_set_dim(set, isl_dim_param);
4632 isl_assert(set->ctx, mat->n_row == 1 + nparam, goto error);
4635 dim->n_out = nparam;
4636 isl_set_reset_dim(set, dim);
4637 set = isl_set_preimage(set, mat);
4640 dim = isl_dim_copy(set->dim);
4641 dim = isl_dim_cow(dim);
4644 dim->nparam = dim->n_out;
4646 isl_set_reset_dim(set, dim);
4656 /* Intersect the basic set "bset" with the affine space specified by the
4657 * equalities in "eq".
4659 static struct isl_basic_set *basic_set_append_equalities(
4660 struct isl_basic_set *bset, struct isl_mat *eq)
4668 bset = isl_basic_set_extend_dim(bset, isl_dim_copy(bset->dim), 0,
4673 len = 1 + isl_dim_total(bset->dim) + bset->extra;
4674 for (i = 0; i < eq->n_row; ++i) {
4675 k = isl_basic_set_alloc_equality(bset);
4678 isl_seq_cpy(bset->eq[k], eq->row[i], eq->n_col);
4679 isl_seq_clr(bset->eq[k] + eq->n_col, len - eq->n_col);
4683 bset = isl_basic_set_gauss(bset, NULL);
4684 bset = isl_basic_set_finalize(bset);
4689 isl_basic_set_free(bset);
4693 /* Intersect the set "set" with the affine space specified by the
4694 * equalities in "eq".
4696 static struct isl_set *set_append_equalities(struct isl_set *set,
4704 for (i = 0; i < set->n; ++i) {
4705 set->p[i] = basic_set_append_equalities(set->p[i],
4718 /* Project the given basic set onto its parameter domain, possibly introducing
4719 * new, explicit, existential variables in the constraints.
4720 * The input has parameters and (possibly implicit) existential variables.
4721 * The output has the same parameters, but only
4722 * explicit existentially quantified variables.
4724 * The actual projection is performed by pip, but pip doesn't seem
4725 * to like equalities very much, so we first remove the equalities
4726 * among the parameters by performing a variable compression on
4727 * the parameters. Afterward, an inverse transformation is performed
4728 * and the equalities among the parameters are inserted back in.
4730 static struct isl_set *parameter_compute_divs(struct isl_basic_set *bset)
4734 struct isl_mat *T, *T2;
4735 struct isl_set *set;
4736 unsigned nparam, n_div;
4738 bset = isl_basic_set_cow(bset);
4742 if (bset->n_eq == 0)
4743 return isl_basic_set_lexmin(bset);
4745 isl_basic_set_gauss(bset, NULL);
4747 nparam = isl_basic_set_dim(bset, isl_dim_param);
4748 n_div = isl_basic_set_dim(bset, isl_dim_div);
4750 for (i = 0, j = n_div - 1; i < bset->n_eq && j >= 0; --j) {
4751 if (!isl_int_is_zero(bset->eq[i][1 + nparam + j]))
4754 if (i == bset->n_eq)
4755 return isl_basic_set_lexmin(bset);
4757 eq = isl_mat_sub_alloc(bset->ctx, bset->eq, i, bset->n_eq - i,
4759 eq = isl_mat_cow(eq);
4760 T = isl_mat_variable_compression(isl_mat_copy(eq), &T2);
4761 if (T && T->n_col == 0) {
4765 bset = isl_basic_set_set_to_empty(bset);
4766 return isl_set_from_basic_set(bset);
4768 bset = basic_set_parameter_preimage(bset, T);
4770 set = isl_basic_set_lexmin(bset);
4771 set = set_parameter_preimage(set, T2);
4772 set = set_append_equalities(set, eq);
4776 /* Compute an explicit representation for all the existentially
4777 * quantified variables.
4778 * The input and output dimensions are first turned into parameters.
4779 * compute_divs then returns a map with the same parameters and
4780 * no input or output dimensions and the dimension specification
4781 * is reset to that of the input.
4783 static struct isl_map *compute_divs(struct isl_basic_map *bmap)
4785 struct isl_basic_set *bset;
4786 struct isl_set *set;
4787 struct isl_map *map;
4788 struct isl_dim *dim, *orig_dim = NULL;
4793 bmap = isl_basic_map_cow(bmap);
4797 nparam = isl_basic_map_dim(bmap, isl_dim_param);
4798 n_in = isl_basic_map_dim(bmap, isl_dim_in);
4799 n_out = isl_basic_map_dim(bmap, isl_dim_out);
4800 dim = isl_dim_set_alloc(bmap->ctx, nparam + n_in + n_out, 0);
4804 orig_dim = bmap->dim;
4806 bset = (struct isl_basic_set *)bmap;
4808 set = parameter_compute_divs(bset);
4809 map = (struct isl_map *)set;
4810 map = isl_map_reset_dim(map, orig_dim);
4814 isl_basic_map_free(bmap);
4818 static int basic_map_divs_known(__isl_keep isl_basic_map *bmap)
4826 off = isl_dim_total(bmap->dim);
4827 for (i = 0; i < bmap->n_div; ++i) {
4828 if (isl_int_is_zero(bmap->div[i][0]))
4830 isl_assert(bmap->ctx, isl_int_is_zero(bmap->div[i][1+1+off+i]),
4836 static int map_divs_known(__isl_keep isl_map *map)
4843 for (i = 0; i < map->n; ++i) {
4844 int known = basic_map_divs_known(map->p[i]);
4852 /* If bmap contains any unknown divs, then compute explicit
4853 * expressions for them. However, this computation may be
4854 * quite expensive, so first try to remove divs that aren't
4857 struct isl_map *isl_basic_map_compute_divs(struct isl_basic_map *bmap)
4861 struct isl_map *map;
4863 known = basic_map_divs_known(bmap);
4867 return isl_map_from_basic_map(bmap);
4869 bmap = isl_basic_map_drop_redundant_divs(bmap);
4871 known = basic_map_divs_known(bmap);
4875 return isl_map_from_basic_map(bmap);
4877 map = compute_divs(bmap);
4880 isl_basic_map_free(bmap);
4884 struct isl_map *isl_map_compute_divs(struct isl_map *map)
4888 struct isl_map *res;
4895 known = map_divs_known(map);
4903 res = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[0]));
4904 for (i = 1 ; i < map->n; ++i) {
4906 r2 = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[i]));
4907 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT))
4908 res = isl_map_union_disjoint(res, r2);
4910 res = isl_map_union(res, r2);
4917 struct isl_set *isl_basic_set_compute_divs(struct isl_basic_set *bset)
4919 return (struct isl_set *)
4920 isl_basic_map_compute_divs((struct isl_basic_map *)bset);
4923 struct isl_set *isl_set_compute_divs(struct isl_set *set)
4925 return (struct isl_set *)
4926 isl_map_compute_divs((struct isl_map *)set);
4929 struct isl_set *isl_map_domain(struct isl_map *map)
4932 struct isl_set *set;
4937 map = isl_map_cow(map);
4941 set = (struct isl_set *)map;
4942 set->dim = isl_dim_domain(set->dim);
4945 for (i = 0; i < map->n; ++i) {
4946 set->p[i] = isl_basic_map_domain(map->p[i]);
4950 ISL_F_CLR(set, ISL_MAP_DISJOINT);
4951 ISL_F_CLR(set, ISL_SET_NORMALIZED);
4958 struct isl_map *isl_map_union_disjoint(
4959 struct isl_map *map1, struct isl_map *map2)
4963 struct isl_map *map = NULL;
4977 isl_assert(map1->ctx, isl_dim_equal(map1->dim, map2->dim), goto error);
4979 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
4980 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
4981 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
4983 map = isl_map_alloc_dim(isl_dim_copy(map1->dim),
4984 map1->n + map2->n, flags);
4987 for (i = 0; i < map1->n; ++i) {
4988 map = isl_map_add_basic_map(map,
4989 isl_basic_map_copy(map1->p[i]));
4993 for (i = 0; i < map2->n; ++i) {
4994 map = isl_map_add_basic_map(map,
4995 isl_basic_map_copy(map2->p[i]));
5009 struct isl_map *isl_map_union(struct isl_map *map1, struct isl_map *map2)
5011 map1 = isl_map_union_disjoint(map1, map2);
5015 ISL_F_CLR(map1, ISL_MAP_DISJOINT);
5019 struct isl_set *isl_set_union_disjoint(
5020 struct isl_set *set1, struct isl_set *set2)
5022 return (struct isl_set *)
5023 isl_map_union_disjoint(
5024 (struct isl_map *)set1, (struct isl_map *)set2);
5027 struct isl_set *isl_set_union(struct isl_set *set1, struct isl_set *set2)
5029 return (struct isl_set *)
5030 isl_map_union((struct isl_map *)set1, (struct isl_map *)set2);
5033 struct isl_map *isl_map_intersect_range(
5034 struct isl_map *map, struct isl_set *set)
5037 struct isl_map *result;
5043 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT) &&
5044 ISL_F_ISSET(set, ISL_MAP_DISJOINT))
5045 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
5047 result = isl_map_alloc_dim(isl_dim_copy(map->dim),
5048 map->n * set->n, flags);
5051 for (i = 0; i < map->n; ++i)
5052 for (j = 0; j < set->n; ++j) {
5053 result = isl_map_add_basic_map(result,
5054 isl_basic_map_intersect_range(
5055 isl_basic_map_copy(map->p[i]),
5056 isl_basic_set_copy(set->p[j])));
5069 struct isl_map *isl_map_intersect_domain(
5070 struct isl_map *map, struct isl_set *set)
5072 return isl_map_reverse(
5073 isl_map_intersect_range(isl_map_reverse(map), set));
5076 struct isl_map *isl_map_apply_domain(
5077 struct isl_map *map1, struct isl_map *map2)
5081 map1 = isl_map_reverse(map1);
5082 map1 = isl_map_apply_range(map1, map2);
5083 return isl_map_reverse(map1);
5090 struct isl_map *isl_map_apply_range(
5091 struct isl_map *map1, struct isl_map *map2)
5093 struct isl_dim *dim_result;
5094 struct isl_map *result;
5100 dim_result = isl_dim_join(isl_dim_copy(map1->dim),
5101 isl_dim_copy(map2->dim));
5103 result = isl_map_alloc_dim(dim_result, map1->n * map2->n, 0);
5106 for (i = 0; i < map1->n; ++i)
5107 for (j = 0; j < map2->n; ++j) {
5108 result = isl_map_add_basic_map(result,
5109 isl_basic_map_apply_range(
5110 isl_basic_map_copy(map1->p[i]),
5111 isl_basic_map_copy(map2->p[j])));
5117 if (result && result->n <= 1)
5118 ISL_F_SET(result, ISL_MAP_DISJOINT);
5127 * returns range - domain
5129 struct isl_basic_set *isl_basic_map_deltas(struct isl_basic_map *bmap)
5131 isl_dim *dims, *target_dim;
5132 struct isl_basic_set *bset;
5139 isl_assert(bmap->ctx, isl_dim_tuple_match(bmap->dim, isl_dim_in,
5140 bmap->dim, isl_dim_out),
5142 target_dim = isl_dim_domain(isl_basic_map_get_dim(bmap));
5143 dim = isl_basic_map_n_in(bmap);
5144 nparam = isl_basic_map_n_param(bmap);
5145 bset = isl_basic_set_from_basic_map(bmap);
5146 bset = isl_basic_set_cow(bset);
5147 dims = isl_basic_set_get_dim(bset);
5148 dims = isl_dim_add(dims, isl_dim_set, dim);
5149 bset = isl_basic_set_extend_dim(bset, dims, 0, dim, 0);
5150 bset = isl_basic_set_swap_vars(bset, 2*dim);
5151 for (i = 0; i < dim; ++i) {
5152 int j = isl_basic_map_alloc_equality(
5153 (struct isl_basic_map *)bset);
5156 isl_seq_clr(bset->eq[j], 1 + isl_basic_set_total_dim(bset));
5157 isl_int_set_si(bset->eq[j][1+nparam+i], 1);
5158 isl_int_set_si(bset->eq[j][1+nparam+dim+i], 1);
5159 isl_int_set_si(bset->eq[j][1+nparam+2*dim+i], -1);
5161 bset = isl_basic_set_project_out(bset, isl_dim_set, dim, 2*dim);
5162 bset = isl_basic_set_reset_dim(bset, target_dim);
5165 isl_basic_map_free(bmap);
5170 * returns range - domain
5172 struct isl_set *isl_map_deltas(struct isl_map *map)
5176 struct isl_set *result;
5181 isl_assert(map->ctx, isl_dim_tuple_match(map->dim, isl_dim_in,
5182 map->dim, isl_dim_out),
5184 dim = isl_map_get_dim(map);
5185 dim = isl_dim_domain(dim);
5186 result = isl_set_alloc_dim(dim, map->n, map->flags);
5189 for (i = 0; i < map->n; ++i)
5190 result = isl_set_add_basic_set(result,
5191 isl_basic_map_deltas(isl_basic_map_copy(map->p[i])));
5199 static struct isl_basic_map *basic_map_identity(struct isl_dim *dims)
5201 struct isl_basic_map *bmap;
5209 nparam = dims->nparam;
5211 bmap = isl_basic_map_alloc_dim(dims, 0, dim, 0);
5215 for (i = 0; i < dim; ++i) {
5216 int j = isl_basic_map_alloc_equality(bmap);
5219 isl_seq_clr(bmap->eq[j], 1 + isl_basic_map_total_dim(bmap));
5220 isl_int_set_si(bmap->eq[j][1+nparam+i], 1);
5221 isl_int_set_si(bmap->eq[j][1+nparam+dim+i], -1);
5223 return isl_basic_map_finalize(bmap);
5225 isl_basic_map_free(bmap);
5229 struct isl_basic_map *isl_basic_map_identity(struct isl_dim *set_dim)
5231 struct isl_dim *dim = isl_dim_map(set_dim);
5234 return basic_map_identity(dim);
5237 struct isl_basic_map *isl_basic_map_identity_like(struct isl_basic_map *model)
5239 if (!model || !model->dim)
5241 isl_assert(model->ctx,
5242 model->dim->n_in == model->dim->n_out, return NULL);
5243 return basic_map_identity(isl_dim_copy(model->dim));
5246 static struct isl_map *map_identity(struct isl_dim *dim)
5248 struct isl_map *map = isl_map_alloc_dim(dim, 1, ISL_MAP_DISJOINT);
5249 return isl_map_add_basic_map(map, basic_map_identity(isl_dim_copy(dim)));
5252 struct isl_map *isl_map_identity(struct isl_dim *set_dim)
5254 struct isl_dim *dim = isl_dim_map(set_dim);
5257 return map_identity(dim);
5260 struct isl_map *isl_map_identity_like(struct isl_map *model)
5262 if (!model || !model->dim)
5264 isl_assert(model->ctx,
5265 model->dim->n_in == model->dim->n_out, return NULL);
5266 return map_identity(isl_dim_copy(model->dim));
5269 struct isl_map *isl_map_identity_like_basic_map(struct isl_basic_map *model)
5271 if (!model || !model->dim)
5273 isl_assert(model->ctx,
5274 model->dim->n_in == model->dim->n_out, return NULL);
5275 return map_identity(isl_dim_copy(model->dim));
5278 /* Construct a basic set with all set dimensions having only non-negative
5281 struct isl_basic_set *isl_basic_set_positive_orthant(struct isl_dim *dims)
5286 struct isl_basic_set *bset;
5290 nparam = dims->nparam;
5292 bset = isl_basic_set_alloc_dim(dims, 0, 0, dim);
5295 for (i = 0; i < dim; ++i) {
5296 int k = isl_basic_set_alloc_inequality(bset);
5299 isl_seq_clr(bset->ineq[k], 1 + isl_basic_set_total_dim(bset));
5300 isl_int_set_si(bset->ineq[k][1 + nparam + i], 1);
5304 isl_basic_set_free(bset);
5308 __isl_give isl_set *isl_set_split_dims(__isl_take isl_set *set,
5309 enum isl_dim_type type, unsigned first, unsigned n)
5312 isl_basic_set *nonneg = NULL;
5313 isl_basic_set *neg = NULL;
5320 isl_assert(set->ctx, first + n <= isl_set_dim(set, type), goto error);
5322 for (i = 0; i < n; ++i) {
5326 nonneg = isl_basic_set_alloc_dim(isl_set_get_dim(set), 0, 0, 1);
5327 k = isl_basic_set_alloc_inequality(nonneg);
5330 isl_seq_clr(nonneg->ineq[k], 1 + isl_basic_set_total_dim(nonneg));
5331 isl_int_set_si(nonneg->ineq[k][pos(set->dim, type) + first + i], 1);
5333 neg = isl_basic_set_alloc_dim(isl_set_get_dim(set), 0, 0, 1);
5334 k = isl_basic_set_alloc_inequality(neg);
5337 isl_seq_clr(neg->ineq[k], 1 + isl_basic_set_total_dim(neg));
5338 isl_int_set_si(neg->ineq[k][0], -1);
5339 isl_int_set_si(neg->ineq[k][pos(set->dim, type) + first + i], -1);
5341 set = isl_set_intersect(set, isl_basic_set_union(nonneg, neg));
5346 isl_basic_set_free(nonneg);
5347 isl_basic_set_free(neg);
5352 int isl_set_is_equal(struct isl_set *set1, struct isl_set *set2)
5354 return isl_map_is_equal((struct isl_map *)set1, (struct isl_map *)set2);
5357 int isl_basic_map_is_subset(
5358 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
5361 struct isl_map *map1;
5362 struct isl_map *map2;
5364 if (!bmap1 || !bmap2)
5367 map1 = isl_map_from_basic_map(isl_basic_map_copy(bmap1));
5368 map2 = isl_map_from_basic_map(isl_basic_map_copy(bmap2));
5370 is_subset = isl_map_is_subset(map1, map2);
5378 int isl_basic_map_is_equal(
5379 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
5383 if (!bmap1 || !bmap2)
5385 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
5388 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
5392 int isl_basic_set_is_equal(
5393 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
5395 return isl_basic_map_is_equal(
5396 (struct isl_basic_map *)bset1, (struct isl_basic_map *)bset2);
5399 int isl_map_is_empty(struct isl_map *map)
5406 for (i = 0; i < map->n; ++i) {
5407 is_empty = isl_basic_map_is_empty(map->p[i]);
5416 int isl_map_fast_is_empty(struct isl_map *map)
5418 return map ? map->n == 0 : -1;
5421 int isl_set_fast_is_empty(struct isl_set *set)
5423 return set ? set->n == 0 : -1;
5426 int isl_set_is_empty(struct isl_set *set)
5428 return isl_map_is_empty((struct isl_map *)set);
5431 int isl_map_has_equal_dim(__isl_keep isl_map *map1, __isl_keep isl_map *map2)
5436 return isl_dim_equal(map1->dim, map2->dim);
5439 int isl_set_has_equal_dim(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
5444 return isl_dim_equal(set1->dim, set2->dim);
5447 int isl_map_is_equal(struct isl_map *map1, struct isl_map *map2)
5453 is_subset = isl_map_is_subset(map1, map2);
5456 is_subset = isl_map_is_subset(map2, map1);
5460 int isl_basic_map_is_strict_subset(
5461 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
5465 if (!bmap1 || !bmap2)
5467 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
5470 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
5471 if (is_subset == -1)
5476 int isl_map_is_strict_subset(struct isl_map *map1, struct isl_map *map2)
5482 is_subset = isl_map_is_subset(map1, map2);
5485 is_subset = isl_map_is_subset(map2, map1);
5486 if (is_subset == -1)
5491 int isl_set_is_strict_subset(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
5493 return isl_map_is_strict_subset((isl_map *)set1, (isl_map *)set2);
5496 int isl_basic_map_is_universe(struct isl_basic_map *bmap)
5500 return bmap->n_eq == 0 && bmap->n_ineq == 0;
5503 int isl_basic_set_is_universe(struct isl_basic_set *bset)
5507 return bset->n_eq == 0 && bset->n_ineq == 0;
5510 int isl_map_fast_is_universe(__isl_keep isl_map *map)
5517 for (i = 0; i < map->n; ++i) {
5518 int r = isl_basic_map_is_universe(map->p[i]);
5526 int isl_set_fast_is_universe(__isl_keep isl_set *set)
5528 return isl_map_fast_is_universe((isl_map *) set);
5531 int isl_basic_map_is_empty(struct isl_basic_map *bmap)
5533 struct isl_basic_set *bset = NULL;
5534 struct isl_vec *sample = NULL;
5541 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY))
5544 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL)) {
5545 struct isl_basic_map *copy = isl_basic_map_copy(bmap);
5546 copy = isl_basic_map_remove_redundancies(copy);
5547 empty = ISL_F_ISSET(copy, ISL_BASIC_MAP_EMPTY);
5548 isl_basic_map_free(copy);
5552 total = 1 + isl_basic_map_total_dim(bmap);
5553 if (bmap->sample && bmap->sample->size == total) {
5554 int contains = isl_basic_map_contains(bmap, bmap->sample);
5560 isl_vec_free(bmap->sample);
5561 bmap->sample = NULL;
5562 bset = isl_basic_map_underlying_set(isl_basic_map_copy(bmap));
5565 sample = isl_basic_set_sample_vec(bset);
5568 empty = sample->size == 0;
5569 isl_vec_free(bmap->sample);
5570 bmap->sample = sample;
5572 ISL_F_SET(bmap, ISL_BASIC_MAP_EMPTY);
5577 int isl_basic_map_fast_is_empty(struct isl_basic_map *bmap)
5581 return ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY);
5584 int isl_basic_set_fast_is_empty(struct isl_basic_set *bset)
5588 return ISL_F_ISSET(bset, ISL_BASIC_SET_EMPTY);
5591 int isl_basic_set_is_empty(struct isl_basic_set *bset)
5593 return isl_basic_map_is_empty((struct isl_basic_map *)bset);
5596 struct isl_map *isl_basic_map_union(
5597 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
5599 struct isl_map *map;
5600 if (!bmap1 || !bmap2)
5603 isl_assert(bmap1->ctx, isl_dim_equal(bmap1->dim, bmap2->dim), goto error);
5605 map = isl_map_alloc_dim(isl_dim_copy(bmap1->dim), 2, 0);
5608 map = isl_map_add_basic_map(map, bmap1);
5609 map = isl_map_add_basic_map(map, bmap2);
5612 isl_basic_map_free(bmap1);
5613 isl_basic_map_free(bmap2);
5617 struct isl_set *isl_basic_set_union(
5618 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
5620 return (struct isl_set *)isl_basic_map_union(
5621 (struct isl_basic_map *)bset1,
5622 (struct isl_basic_map *)bset2);
5625 /* Order divs such that any div only depends on previous divs */
5626 struct isl_basic_map *isl_basic_map_order_divs(struct isl_basic_map *bmap)
5634 off = isl_dim_total(bmap->dim);
5636 for (i = 0; i < bmap->n_div; ++i) {
5638 if (isl_int_is_zero(bmap->div[i][0]))
5640 pos = isl_seq_first_non_zero(bmap->div[i]+1+1+off+i,
5644 isl_basic_map_swap_div(bmap, i, i + pos);
5650 struct isl_basic_set *isl_basic_set_order_divs(struct isl_basic_set *bset)
5652 return (struct isl_basic_set *)
5653 isl_basic_map_order_divs((struct isl_basic_map *)bset);
5656 __isl_give isl_map *isl_map_order_divs(__isl_take isl_map *map)
5663 for (i = 0; i < map->n; ++i) {
5664 map->p[i] = isl_basic_map_order_divs(map->p[i]);
5675 /* Look for a div in dst that corresponds to the div "div" in src.
5676 * The divs before "div" in src and dst are assumed to be the same.
5678 * Returns -1 if no corresponding div was found and the position
5679 * of the corresponding div in dst otherwise.
5681 static int find_div(struct isl_basic_map *dst,
5682 struct isl_basic_map *src, unsigned div)
5686 unsigned total = isl_dim_total(src->dim);
5688 isl_assert(dst->ctx, div <= dst->n_div, return -1);
5689 for (i = div; i < dst->n_div; ++i)
5690 if (isl_seq_eq(dst->div[i], src->div[div], 1+1+total+div) &&
5691 isl_seq_first_non_zero(dst->div[i]+1+1+total+div,
5692 dst->n_div - div) == -1)
5697 struct isl_basic_map *isl_basic_map_align_divs(
5698 struct isl_basic_map *dst, struct isl_basic_map *src)
5701 unsigned total = isl_dim_total(src->dim);
5706 if (src->n_div == 0)
5709 for (i = 0; i < src->n_div; ++i)
5710 isl_assert(src->ctx, !isl_int_is_zero(src->div[i][0]), goto error);
5712 src = isl_basic_map_order_divs(src);
5713 dst = isl_basic_map_cow(dst);
5714 dst = isl_basic_map_extend_dim(dst, isl_dim_copy(dst->dim),
5715 src->n_div, 0, 2 * src->n_div);
5718 for (i = 0; i < src->n_div; ++i) {
5719 int j = find_div(dst, src, i);
5721 j = isl_basic_map_alloc_div(dst);
5724 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total+i);
5725 isl_seq_clr(dst->div[j]+1+1+total+i, dst->n_div - i);
5726 if (isl_basic_map_add_div_constraints(dst, j) < 0)
5730 isl_basic_map_swap_div(dst, i, j);
5734 isl_basic_map_free(dst);
5738 struct isl_basic_set *isl_basic_set_align_divs(
5739 struct isl_basic_set *dst, struct isl_basic_set *src)
5741 return (struct isl_basic_set *)isl_basic_map_align_divs(
5742 (struct isl_basic_map *)dst, (struct isl_basic_map *)src);
5745 struct isl_map *isl_map_align_divs(struct isl_map *map)
5753 map = isl_map_compute_divs(map);
5754 map = isl_map_cow(map);
5758 for (i = 1; i < map->n; ++i)
5759 map->p[0] = isl_basic_map_align_divs(map->p[0], map->p[i]);
5760 for (i = 1; i < map->n; ++i)
5761 map->p[i] = isl_basic_map_align_divs(map->p[i], map->p[0]);
5763 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
5767 struct isl_set *isl_set_align_divs(struct isl_set *set)
5769 return (struct isl_set *)isl_map_align_divs((struct isl_map *)set);
5772 struct isl_set *isl_set_apply(struct isl_set *set, struct isl_map *map)
5776 isl_assert(set->ctx, isl_map_compatible_domain(map, set), goto error);
5777 map = isl_map_intersect_domain(map, set);
5778 set = isl_map_range(map);
5786 /* There is no need to cow as removing empty parts doesn't change
5787 * the meaning of the set.
5789 struct isl_map *isl_map_remove_empty_parts(struct isl_map *map)
5796 for (i = map->n-1; i >= 0; --i) {
5797 if (!ISL_F_ISSET(map->p[i], ISL_BASIC_MAP_EMPTY))
5799 isl_basic_map_free(map->p[i]);
5800 if (i != map->n-1) {
5801 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
5802 map->p[i] = map->p[map->n-1];
5810 struct isl_set *isl_set_remove_empty_parts(struct isl_set *set)
5812 return (struct isl_set *)
5813 isl_map_remove_empty_parts((struct isl_map *)set);
5816 struct isl_basic_map *isl_map_copy_basic_map(struct isl_map *map)
5818 struct isl_basic_map *bmap;
5819 if (!map || map->n == 0)
5821 bmap = map->p[map->n-1];
5822 isl_assert(map->ctx, ISL_F_ISSET(bmap, ISL_BASIC_SET_FINAL), return NULL);
5823 return isl_basic_map_copy(bmap);
5826 struct isl_basic_set *isl_set_copy_basic_set(struct isl_set *set)
5828 return (struct isl_basic_set *)
5829 isl_map_copy_basic_map((struct isl_map *)set);
5832 __isl_give isl_map *isl_map_drop_basic_map(__isl_take isl_map *map,
5833 __isl_keep isl_basic_map *bmap)
5839 for (i = map->n-1; i >= 0; --i) {
5840 if (map->p[i] != bmap)
5842 map = isl_map_cow(map);
5845 isl_basic_map_free(map->p[i]);
5846 if (i != map->n-1) {
5847 ISL_F_CLR(map, ISL_SET_NORMALIZED);
5848 map->p[i] = map->p[map->n-1];
5859 struct isl_set *isl_set_drop_basic_set(struct isl_set *set,
5860 struct isl_basic_set *bset)
5862 return (struct isl_set *)isl_map_drop_basic_map((struct isl_map *)set,
5863 (struct isl_basic_map *)bset);
5866 /* Given two basic sets bset1 and bset2, compute the maximal difference
5867 * between the values of dimension pos in bset1 and those in bset2
5868 * for any common value of the parameters and dimensions preceding pos.
5870 static enum isl_lp_result basic_set_maximal_difference_at(
5871 __isl_keep isl_basic_set *bset1, __isl_keep isl_basic_set *bset2,
5872 int pos, isl_int *opt)
5874 struct isl_dim *dims;
5875 struct isl_basic_map *bmap1 = NULL;
5876 struct isl_basic_map *bmap2 = NULL;
5877 struct isl_ctx *ctx;
5878 struct isl_vec *obj;
5881 unsigned dim1, dim2;
5882 enum isl_lp_result res;
5884 if (!bset1 || !bset2)
5885 return isl_lp_error;
5887 nparam = isl_basic_set_n_param(bset1);
5888 dim1 = isl_basic_set_n_dim(bset1);
5889 dim2 = isl_basic_set_n_dim(bset2);
5890 dims = isl_dim_alloc(bset1->ctx, nparam, pos, dim1 - pos);
5891 bmap1 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset1), dims);
5892 dims = isl_dim_alloc(bset2->ctx, nparam, pos, dim2 - pos);
5893 bmap2 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset2), dims);
5894 if (!bmap1 || !bmap2)
5896 bmap1 = isl_basic_map_cow(bmap1);
5897 bmap1 = isl_basic_map_extend(bmap1, nparam,
5898 pos, (dim1 - pos) + (dim2 - pos),
5899 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
5900 bmap1 = add_constraints(bmap1, bmap2, 0, dim1 - pos);
5903 total = isl_basic_map_total_dim(bmap1);
5905 obj = isl_vec_alloc(ctx, 1 + total);
5906 isl_seq_clr(obj->block.data, 1 + total);
5907 isl_int_set_si(obj->block.data[1+nparam+pos], 1);
5908 isl_int_set_si(obj->block.data[1+nparam+pos+(dim1-pos)], -1);
5911 res = isl_basic_map_solve_lp(bmap1, 1, obj->block.data, ctx->one,
5913 isl_basic_map_free(bmap1);
5917 isl_basic_map_free(bmap1);
5918 isl_basic_map_free(bmap2);
5919 return isl_lp_error;
5922 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
5923 * for any common value of the parameters and dimensions preceding pos
5924 * in both basic sets, the values of dimension pos in bset1 are
5925 * smaller or larger than those in bset2.
5928 * 1 if bset1 follows bset2
5929 * -1 if bset1 precedes bset2
5930 * 0 if bset1 and bset2 are incomparable
5931 * -2 if some error occurred.
5933 int isl_basic_set_compare_at(struct isl_basic_set *bset1,
5934 struct isl_basic_set *bset2, int pos)
5937 enum isl_lp_result res;
5942 res = basic_set_maximal_difference_at(bset1, bset2, pos, &opt);
5944 if (res == isl_lp_empty)
5946 else if ((res == isl_lp_ok && isl_int_is_pos(opt)) ||
5947 res == isl_lp_unbounded)
5949 else if (res == isl_lp_ok && isl_int_is_neg(opt))
5958 /* Given two basic sets bset1 and bset2, check whether
5959 * for any common value of the parameters and dimensions preceding pos
5960 * there is a value of dimension pos in bset1 that is larger
5961 * than a value of the same dimension in bset2.
5964 * 1 if there exists such a pair
5965 * 0 if there is no such pair, but there is a pair of equal values
5967 * -2 if some error occurred.
5969 int isl_basic_set_follows_at(__isl_keep isl_basic_set *bset1,
5970 __isl_keep isl_basic_set *bset2, int pos)
5973 enum isl_lp_result res;
5978 res = basic_set_maximal_difference_at(bset1, bset2, pos, &opt);
5980 if (res == isl_lp_empty)
5982 else if ((res == isl_lp_ok && isl_int_is_pos(opt)) ||
5983 res == isl_lp_unbounded)
5985 else if (res == isl_lp_ok && isl_int_is_neg(opt))
5987 else if (res == isl_lp_ok)
5996 /* Given two sets set1 and set2, check whether
5997 * for any common value of the parameters and dimensions preceding pos
5998 * there is a value of dimension pos in set1 that is larger
5999 * than a value of the same dimension in set2.
6002 * 1 if there exists such a pair
6003 * 0 if there is no such pair, but there is a pair of equal values
6005 * -2 if some error occurred.
6007 int isl_set_follows_at(__isl_keep isl_set *set1,
6008 __isl_keep isl_set *set2, int pos)
6016 for (i = 0; i < set1->n; ++i)
6017 for (j = 0; j < set2->n; ++j) {
6019 f = isl_basic_set_follows_at(set1->p[i], set2->p[j], pos);
6020 if (f == 1 || f == -2)
6029 static int isl_basic_map_fast_has_fixed_var(struct isl_basic_map *bmap,
6030 unsigned pos, isl_int *val)
6038 total = isl_basic_map_total_dim(bmap);
6039 for (i = 0, d = total-1; i < bmap->n_eq && d+1 > pos; ++i) {
6040 for (; d+1 > pos; --d)
6041 if (!isl_int_is_zero(bmap->eq[i][1+d]))
6045 if (isl_seq_first_non_zero(bmap->eq[i]+1, d) != -1)
6047 if (isl_seq_first_non_zero(bmap->eq[i]+1+d+1, total-d-1) != -1)
6049 if (!isl_int_is_one(bmap->eq[i][1+d]))
6052 isl_int_neg(*val, bmap->eq[i][0]);
6058 static int isl_map_fast_has_fixed_var(struct isl_map *map,
6059 unsigned pos, isl_int *val)
6071 return isl_basic_map_fast_has_fixed_var(map->p[0], pos, val);
6074 fixed = isl_basic_map_fast_has_fixed_var(map->p[0], pos, &v);
6075 for (i = 1; fixed == 1 && i < map->n; ++i) {
6076 fixed = isl_basic_map_fast_has_fixed_var(map->p[i], pos, &tmp);
6077 if (fixed == 1 && isl_int_ne(tmp, v))
6081 isl_int_set(*val, v);
6087 static int isl_basic_set_fast_has_fixed_var(struct isl_basic_set *bset,
6088 unsigned pos, isl_int *val)
6090 return isl_basic_map_fast_has_fixed_var((struct isl_basic_map *)bset,
6094 static int isl_set_fast_has_fixed_var(struct isl_set *set, unsigned pos,
6097 return isl_map_fast_has_fixed_var((struct isl_map *)set, pos, val);
6100 int isl_basic_map_fast_is_fixed(struct isl_basic_map *bmap,
6101 enum isl_dim_type type, unsigned pos, isl_int *val)
6103 if (pos >= isl_basic_map_dim(bmap, type))
6105 return isl_basic_map_fast_has_fixed_var(bmap,
6106 isl_basic_map_offset(bmap, type) - 1 + pos, val);
6109 int isl_map_fast_is_fixed(struct isl_map *map,
6110 enum isl_dim_type type, unsigned pos, isl_int *val)
6112 if (pos >= isl_map_dim(map, type))
6114 return isl_map_fast_has_fixed_var(map,
6115 map_offset(map, type) - 1 + pos, val);
6118 /* Check if dimension dim has fixed value and if so and if val is not NULL,
6119 * then return this fixed value in *val.
6121 int isl_basic_set_fast_dim_is_fixed(struct isl_basic_set *bset, unsigned dim,
6124 return isl_basic_set_fast_has_fixed_var(bset,
6125 isl_basic_set_n_param(bset) + dim, val);
6128 /* Check if dimension dim has fixed value and if so and if val is not NULL,
6129 * then return this fixed value in *val.
6131 int isl_set_fast_dim_is_fixed(struct isl_set *set, unsigned dim, isl_int *val)
6133 return isl_set_fast_has_fixed_var(set, isl_set_n_param(set) + dim, val);
6136 /* Check if input variable in has fixed value and if so and if val is not NULL,
6137 * then return this fixed value in *val.
6139 int isl_map_fast_input_is_fixed(struct isl_map *map, unsigned in, isl_int *val)
6141 return isl_map_fast_has_fixed_var(map, isl_map_n_param(map) + in, val);
6144 /* Check if dimension dim has an (obvious) fixed lower bound and if so
6145 * and if val is not NULL, then return this lower bound in *val.
6147 int isl_basic_set_fast_dim_has_fixed_lower_bound(struct isl_basic_set *bset,
6148 unsigned dim, isl_int *val)
6150 int i, i_eq = -1, i_ineq = -1;
6157 total = isl_basic_set_total_dim(bset);
6158 nparam = isl_basic_set_n_param(bset);
6159 for (i = 0; i < bset->n_eq; ++i) {
6160 if (isl_int_is_zero(bset->eq[i][1+nparam+dim]))
6166 for (i = 0; i < bset->n_ineq; ++i) {
6167 if (!isl_int_is_pos(bset->ineq[i][1+nparam+dim]))
6169 if (i_eq != -1 || i_ineq != -1)
6173 if (i_eq == -1 && i_ineq == -1)
6175 c = i_eq != -1 ? bset->eq[i_eq] : bset->ineq[i_ineq];
6176 /* The coefficient should always be one due to normalization. */
6177 if (!isl_int_is_one(c[1+nparam+dim]))
6179 if (isl_seq_first_non_zero(c+1, nparam+dim) != -1)
6181 if (isl_seq_first_non_zero(c+1+nparam+dim+1,
6182 total - nparam - dim - 1) != -1)
6185 isl_int_neg(*val, c[0]);
6189 int isl_set_fast_dim_has_fixed_lower_bound(struct isl_set *set,
6190 unsigned dim, isl_int *val)
6202 return isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[0],
6206 fixed = isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[0],
6208 for (i = 1; fixed == 1 && i < set->n; ++i) {
6209 fixed = isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[i],
6211 if (fixed == 1 && isl_int_ne(tmp, v))
6215 isl_int_set(*val, v);
6226 static int qsort_constraint_cmp(const void *p1, const void *p2)
6228 const struct constraint *c1 = (const struct constraint *)p1;
6229 const struct constraint *c2 = (const struct constraint *)p2;
6230 unsigned size = isl_min(c1->size, c2->size);
6231 return isl_seq_cmp(c1->c, c2->c, size);
6234 static struct isl_basic_map *isl_basic_map_sort_constraints(
6235 struct isl_basic_map *bmap)
6238 struct constraint *c;
6243 total = isl_basic_map_total_dim(bmap);
6244 c = isl_alloc_array(bmap->ctx, struct constraint, bmap->n_ineq);
6247 for (i = 0; i < bmap->n_ineq; ++i) {
6249 c[i].c = bmap->ineq[i];
6251 qsort(c, bmap->n_ineq, sizeof(struct constraint), qsort_constraint_cmp);
6252 for (i = 0; i < bmap->n_ineq; ++i)
6253 bmap->ineq[i] = c[i].c;
6257 isl_basic_map_free(bmap);
6261 __isl_give isl_basic_set *isl_basic_set_sort_constraints(
6262 __isl_take isl_basic_set *bset)
6264 return (struct isl_basic_set *)isl_basic_map_sort_constraints(
6265 (struct isl_basic_map *)bset);
6268 struct isl_basic_map *isl_basic_map_normalize(struct isl_basic_map *bmap)
6272 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_NORMALIZED))
6274 bmap = isl_basic_map_remove_redundancies(bmap);
6275 bmap = isl_basic_map_sort_constraints(bmap);
6276 ISL_F_SET(bmap, ISL_BASIC_MAP_NORMALIZED);
6280 struct isl_basic_set *isl_basic_set_normalize(struct isl_basic_set *bset)
6282 return (struct isl_basic_set *)isl_basic_map_normalize(
6283 (struct isl_basic_map *)bset);
6286 int isl_basic_map_fast_cmp(const __isl_keep isl_basic_map *bmap1,
6287 const __isl_keep isl_basic_map *bmap2)
6294 if (isl_basic_map_n_param(bmap1) != isl_basic_map_n_param(bmap2))
6295 return isl_basic_map_n_param(bmap1) - isl_basic_map_n_param(bmap2);
6296 if (isl_basic_map_n_in(bmap1) != isl_basic_map_n_in(bmap2))
6297 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
6298 if (isl_basic_map_n_out(bmap1) != isl_basic_map_n_out(bmap2))
6299 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
6300 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY) &&
6301 ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
6303 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY))
6305 if (ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
6307 if (bmap1->n_eq != bmap2->n_eq)
6308 return bmap1->n_eq - bmap2->n_eq;
6309 if (bmap1->n_ineq != bmap2->n_ineq)
6310 return bmap1->n_ineq - bmap2->n_ineq;
6311 if (bmap1->n_div != bmap2->n_div)
6312 return bmap1->n_div - bmap2->n_div;
6313 total = isl_basic_map_total_dim(bmap1);
6314 for (i = 0; i < bmap1->n_eq; ++i) {
6315 cmp = isl_seq_cmp(bmap1->eq[i], bmap2->eq[i], 1+total);
6319 for (i = 0; i < bmap1->n_ineq; ++i) {
6320 cmp = isl_seq_cmp(bmap1->ineq[i], bmap2->ineq[i], 1+total);
6324 for (i = 0; i < bmap1->n_div; ++i) {
6325 cmp = isl_seq_cmp(bmap1->div[i], bmap2->div[i], 1+1+total);
6332 int isl_basic_map_fast_is_equal(__isl_keep isl_basic_map *bmap1,
6333 __isl_keep isl_basic_map *bmap2)
6335 return isl_basic_map_fast_cmp(bmap1, bmap2) == 0;
6338 int isl_basic_set_fast_is_equal(__isl_keep isl_basic_set *bset1,
6339 __isl_keep isl_basic_set *bset2)
6341 return isl_basic_map_fast_is_equal((isl_basic_map *)bset1,
6342 (isl_basic_map *)bset2);
6345 static int qsort_bmap_cmp(const void *p1, const void *p2)
6347 const struct isl_basic_map *bmap1 = *(const struct isl_basic_map **)p1;
6348 const struct isl_basic_map *bmap2 = *(const struct isl_basic_map **)p2;
6350 return isl_basic_map_fast_cmp(bmap1, bmap2);
6353 /* We normalize in place, but if anything goes wrong we need
6354 * to return NULL, so we need to make sure we don't change the
6355 * meaning of any possible other copies of map.
6357 struct isl_map *isl_map_normalize(struct isl_map *map)
6360 struct isl_basic_map *bmap;
6364 if (ISL_F_ISSET(map, ISL_MAP_NORMALIZED))
6366 for (i = 0; i < map->n; ++i) {
6367 bmap = isl_basic_map_normalize(isl_basic_map_copy(map->p[i]));
6370 isl_basic_map_free(map->p[i]);
6373 qsort(map->p, map->n, sizeof(struct isl_basic_map *), qsort_bmap_cmp);
6374 ISL_F_SET(map, ISL_MAP_NORMALIZED);
6375 map = isl_map_remove_empty_parts(map);
6378 for (i = map->n - 1; i >= 1; --i) {
6379 if (!isl_basic_map_fast_is_equal(map->p[i-1], map->p[i]))
6381 isl_basic_map_free(map->p[i-1]);
6382 for (j = i; j < map->n; ++j)
6383 map->p[j-1] = map->p[j];
6393 struct isl_set *isl_set_normalize(struct isl_set *set)
6395 return (struct isl_set *)isl_map_normalize((struct isl_map *)set);
6398 int isl_map_fast_is_equal(struct isl_map *map1, struct isl_map *map2)
6408 if (!isl_dim_equal(map1->dim, map2->dim))
6411 map1 = isl_map_copy(map1);
6412 map2 = isl_map_copy(map2);
6413 map1 = isl_map_normalize(map1);
6414 map2 = isl_map_normalize(map2);
6417 equal = map1->n == map2->n;
6418 for (i = 0; equal && i < map1->n; ++i) {
6419 equal = isl_basic_map_fast_is_equal(map1->p[i], map2->p[i]);
6432 int isl_set_fast_is_equal(struct isl_set *set1, struct isl_set *set2)
6434 return isl_map_fast_is_equal((struct isl_map *)set1,
6435 (struct isl_map *)set2);
6438 /* Return an interval that ranges from min to max (inclusive)
6440 struct isl_basic_set *isl_basic_set_interval(struct isl_ctx *ctx,
6441 isl_int min, isl_int max)
6444 struct isl_basic_set *bset = NULL;
6446 bset = isl_basic_set_alloc(ctx, 0, 1, 0, 0, 2);
6450 k = isl_basic_set_alloc_inequality(bset);
6453 isl_int_set_si(bset->ineq[k][1], 1);
6454 isl_int_neg(bset->ineq[k][0], min);
6456 k = isl_basic_set_alloc_inequality(bset);
6459 isl_int_set_si(bset->ineq[k][1], -1);
6460 isl_int_set(bset->ineq[k][0], max);
6464 isl_basic_set_free(bset);
6468 /* Return the Cartesian product of the basic sets in list (in the given order).
6470 struct isl_basic_set *isl_basic_set_product(struct isl_basic_set_list *list)
6478 struct isl_basic_set *product = NULL;
6482 isl_assert(list->ctx, list->n > 0, goto error);
6483 isl_assert(list->ctx, list->p[0], goto error);
6484 nparam = isl_basic_set_n_param(list->p[0]);
6485 dim = isl_basic_set_n_dim(list->p[0]);
6486 extra = list->p[0]->n_div;
6487 n_eq = list->p[0]->n_eq;
6488 n_ineq = list->p[0]->n_ineq;
6489 for (i = 1; i < list->n; ++i) {
6490 isl_assert(list->ctx, list->p[i], goto error);
6491 isl_assert(list->ctx,
6492 nparam == isl_basic_set_n_param(list->p[i]), goto error);
6493 dim += isl_basic_set_n_dim(list->p[i]);
6494 extra += list->p[i]->n_div;
6495 n_eq += list->p[i]->n_eq;
6496 n_ineq += list->p[i]->n_ineq;
6498 product = isl_basic_set_alloc(list->ctx, nparam, dim, extra,
6503 for (i = 0; i < list->n; ++i) {
6504 isl_basic_set_add_constraints(product,
6505 isl_basic_set_copy(list->p[i]), dim);
6506 dim += isl_basic_set_n_dim(list->p[i]);
6508 isl_basic_set_list_free(list);
6511 isl_basic_set_free(product);
6512 isl_basic_set_list_free(list);
6516 struct isl_basic_map *isl_basic_map_product(
6517 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
6519 struct isl_dim *dim_result = NULL;
6520 struct isl_basic_map *bmap;
6521 unsigned in1, in2, out1, out2, nparam, total, pos;
6522 struct isl_dim_map *dim_map1, *dim_map2;
6524 if (!bmap1 || !bmap2)
6527 isl_assert(bmap1->ctx, isl_dim_match(bmap1->dim, isl_dim_param,
6528 bmap2->dim, isl_dim_param), goto error);
6529 dim_result = isl_dim_product(isl_dim_copy(bmap1->dim),
6530 isl_dim_copy(bmap2->dim));
6532 in1 = isl_basic_map_n_in(bmap1);
6533 in2 = isl_basic_map_n_in(bmap2);
6534 out1 = isl_basic_map_n_out(bmap1);
6535 out2 = isl_basic_map_n_out(bmap2);
6536 nparam = isl_basic_map_n_param(bmap1);
6538 total = nparam + in1 + in2 + out1 + out2 + bmap1->n_div + bmap2->n_div;
6539 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
6540 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
6541 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
6542 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
6543 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
6544 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos += in1);
6545 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += in2);
6546 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += out1);
6547 isl_dim_map_div(dim_map1, bmap1, pos += out2);
6548 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
6550 bmap = isl_basic_map_alloc_dim(dim_result,
6551 bmap1->n_div + bmap2->n_div,
6552 bmap1->n_eq + bmap2->n_eq,
6553 bmap1->n_ineq + bmap2->n_ineq);
6554 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
6555 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
6556 bmap = isl_basic_map_simplify(bmap);
6557 return isl_basic_map_finalize(bmap);
6559 isl_basic_map_free(bmap1);
6560 isl_basic_map_free(bmap2);
6564 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> [B -> D]
6566 struct isl_map *isl_map_product(struct isl_map *map1, struct isl_map *map2)
6569 struct isl_map *result;
6575 isl_assert(map1->ctx, isl_dim_match(map1->dim, isl_dim_param,
6576 map2->dim, isl_dim_param), goto error);
6578 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
6579 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
6580 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
6582 result = isl_map_alloc_dim(isl_dim_product(isl_dim_copy(map1->dim),
6583 isl_dim_copy(map2->dim)),
6584 map1->n * map2->n, flags);
6587 for (i = 0; i < map1->n; ++i)
6588 for (j = 0; j < map2->n; ++j) {
6589 struct isl_basic_map *part;
6590 part = isl_basic_map_product(
6591 isl_basic_map_copy(map1->p[i]),
6592 isl_basic_map_copy(map2->p[j]));
6593 if (isl_basic_map_is_empty(part))
6594 isl_basic_map_free(part);
6596 result = isl_map_add_basic_map(result, part);
6609 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
6611 __isl_give isl_map *isl_map_flat_product(__isl_take isl_map *map1,
6612 __isl_take isl_map *map2)
6616 prod = isl_map_product(map1, map2);
6617 prod = isl_map_flatten(prod);
6621 /* Given two set A and B, construct its Cartesian product A x B.
6623 struct isl_set *isl_set_product(struct isl_set *set1, struct isl_set *set2)
6625 return (struct isl_set *)isl_map_product((struct isl_map *)set1,
6626 (struct isl_map *)set2);
6629 __isl_give isl_set *isl_set_flat_product(__isl_take isl_set *set1,
6630 __isl_take isl_set *set2)
6632 return (isl_set *)isl_map_flat_product((isl_map *)set1, (isl_map *)set2);
6635 uint32_t isl_basic_set_get_hash(struct isl_basic_set *bset)
6638 uint32_t hash = isl_hash_init();
6643 bset = isl_basic_set_copy(bset);
6644 bset = isl_basic_set_normalize(bset);
6647 total = isl_basic_set_total_dim(bset);
6648 isl_hash_byte(hash, bset->n_eq & 0xFF);
6649 for (i = 0; i < bset->n_eq; ++i) {
6651 c_hash = isl_seq_get_hash(bset->eq[i], 1 + total);
6652 isl_hash_hash(hash, c_hash);
6654 isl_hash_byte(hash, bset->n_ineq & 0xFF);
6655 for (i = 0; i < bset->n_ineq; ++i) {
6657 c_hash = isl_seq_get_hash(bset->ineq[i], 1 + total);
6658 isl_hash_hash(hash, c_hash);
6660 isl_hash_byte(hash, bset->n_div & 0xFF);
6661 for (i = 0; i < bset->n_div; ++i) {
6663 if (isl_int_is_zero(bset->div[i][0]))
6665 isl_hash_byte(hash, i & 0xFF);
6666 c_hash = isl_seq_get_hash(bset->div[i], 1 + 1 + total);
6667 isl_hash_hash(hash, c_hash);
6669 isl_basic_set_free(bset);
6673 uint32_t isl_set_get_hash(struct isl_set *set)
6680 set = isl_set_copy(set);
6681 set = isl_set_normalize(set);
6685 hash = isl_hash_init();
6686 for (i = 0; i < set->n; ++i) {
6688 bset_hash = isl_basic_set_get_hash(set->p[i]);
6689 isl_hash_hash(hash, bset_hash);
6697 /* Check if the value for dimension dim is completely determined
6698 * by the values of the other parameters and variables.
6699 * That is, check if dimension dim is involved in an equality.
6701 int isl_basic_set_dim_is_unique(struct isl_basic_set *bset, unsigned dim)
6708 nparam = isl_basic_set_n_param(bset);
6709 for (i = 0; i < bset->n_eq; ++i)
6710 if (!isl_int_is_zero(bset->eq[i][1 + nparam + dim]))
6715 /* Check if the value for dimension dim is completely determined
6716 * by the values of the other parameters and variables.
6717 * That is, check if dimension dim is involved in an equality
6718 * for each of the subsets.
6720 int isl_set_dim_is_unique(struct isl_set *set, unsigned dim)
6726 for (i = 0; i < set->n; ++i) {
6728 unique = isl_basic_set_dim_is_unique(set->p[i], dim);
6735 int isl_map_foreach_basic_map(__isl_keep isl_map *map,
6736 int (*fn)(__isl_take isl_basic_map *bmap, void *user), void *user)
6743 for (i = 0; i < map->n; ++i)
6744 if (fn(isl_basic_map_copy(map->p[i]), user) < 0)
6750 int isl_set_foreach_basic_set(__isl_keep isl_set *set,
6751 int (*fn)(__isl_take isl_basic_set *bset, void *user), void *user)
6758 for (i = 0; i < set->n; ++i)
6759 if (fn(isl_basic_set_copy(set->p[i]), user) < 0)
6765 __isl_give isl_basic_set *isl_basic_set_lift(__isl_take isl_basic_set *bset)
6767 struct isl_dim *dim;
6772 if (bset->n_div == 0)
6775 bset = isl_basic_set_cow(bset);
6779 dim = isl_basic_set_get_dim(bset);
6780 dim = isl_dim_add(dim, isl_dim_set, bset->n_div);
6783 isl_dim_free(bset->dim);
6787 bset = isl_basic_set_finalize(bset);
6791 isl_basic_set_free(bset);
6795 __isl_give isl_set *isl_set_lift(__isl_take isl_set *set)
6798 struct isl_dim *dim;
6801 set = isl_set_align_divs(set);
6805 if (set->n == 0 || set->p[0]->n_div == 0)
6808 set = isl_set_cow(set);
6812 n_div = set->p[0]->n_div;
6813 dim = isl_set_get_dim(set);
6814 dim = isl_dim_add(dim, isl_dim_set, n_div);
6817 isl_dim_free(set->dim);
6820 for (i = 0; i < set->n; ++i) {
6821 set->p[i] = isl_basic_set_lift(set->p[i]);
6832 __isl_give isl_map *isl_set_lifting(__isl_take isl_set *set)
6834 struct isl_dim *dim;
6835 struct isl_basic_map *bmap;
6842 set = isl_set_align_divs(set);
6847 dim = isl_set_get_dim(set);
6848 if (set->n == 0 || set->p[0]->n_div == 0) {
6850 return isl_map_identity(dim);
6853 n_div = set->p[0]->n_div;
6854 dim = isl_dim_map(dim);
6855 n_param = isl_dim_size(dim, isl_dim_param);
6856 n_set = isl_dim_size(dim, isl_dim_in);
6857 dim = isl_dim_extend(dim, n_param, n_set, n_set + n_div);
6858 bmap = isl_basic_map_alloc_dim(dim, 0, n_set, 2 * n_div);
6859 for (i = 0; i < n_set; ++i)
6860 bmap = var_equal(bmap, i);
6862 total = n_param + n_set + n_set + n_div;
6863 for (i = 0; i < n_div; ++i) {
6864 k = isl_basic_map_alloc_inequality(bmap);
6867 isl_seq_cpy(bmap->ineq[k], set->p[0]->div[i]+1, 1+n_param);
6868 isl_seq_clr(bmap->ineq[k]+1+n_param, n_set);
6869 isl_seq_cpy(bmap->ineq[k]+1+n_param+n_set,
6870 set->p[0]->div[i]+1+1+n_param, n_set + n_div);
6871 isl_int_neg(bmap->ineq[k][1+n_param+n_set+n_set+i],
6872 set->p[0]->div[i][0]);
6874 l = isl_basic_map_alloc_inequality(bmap);
6877 isl_seq_neg(bmap->ineq[l], bmap->ineq[k], 1 + total);
6878 isl_int_add(bmap->ineq[l][0], bmap->ineq[l][0],
6879 set->p[0]->div[i][0]);
6880 isl_int_sub_ui(bmap->ineq[l][0], bmap->ineq[l][0], 1);
6884 return isl_map_from_basic_map(bmap);
6887 isl_basic_map_free(bmap);
6891 int isl_basic_set_size(__isl_keep isl_basic_set *bset)
6899 dim = isl_basic_set_total_dim(bset);
6900 size += bset->n_eq * (1 + dim);
6901 size += bset->n_ineq * (1 + dim);
6902 size += bset->n_div * (2 + dim);
6907 int isl_set_size(__isl_keep isl_set *set)
6915 for (i = 0; i < set->n; ++i)
6916 size += isl_basic_set_size(set->p[i]);
6921 int isl_basic_map_dim_is_bounded(__isl_keep isl_basic_map *bmap,
6922 enum isl_dim_type type, unsigned pos)
6930 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), return -1);
6932 pos += isl_basic_map_offset(bmap, type);
6934 for (i = 0; i < bmap->n_eq; ++i)
6935 if (!isl_int_is_zero(bmap->eq[i][pos]))
6939 for (i = 0; i < bmap->n_ineq; ++i) {
6940 int sgn = isl_int_sgn(bmap->ineq[i][pos]);
6947 return lower && upper;
6950 int isl_map_dim_is_bounded(__isl_keep isl_map *map,
6951 enum isl_dim_type type, unsigned pos)
6958 for (i = 0; i < map->n; ++i) {
6960 bounded = isl_basic_map_dim_is_bounded(map->p[i], type, pos);
6961 if (bounded < 0 || !bounded)
6968 /* Return 1 if the specified dim is involved in both an upper bound
6969 * and a lower bound.
6971 int isl_set_dim_is_bounded(__isl_keep isl_set *set,
6972 enum isl_dim_type type, unsigned pos)
6974 return isl_map_dim_is_bounded((isl_map *)set, type, pos);
6977 /* For each of the "n" variables starting at "first", determine
6978 * the sign of the variable and put the results in the first "n"
6979 * elements of the array "signs".
6981 * 1 means that the variable is non-negative
6982 * -1 means that the variable is non-positive
6983 * 0 means the variable attains both positive and negative values.
6985 int isl_basic_set_vars_get_sign(__isl_keep isl_basic_set *bset,
6986 unsigned first, unsigned n, int *signs)
6988 isl_vec *bound = NULL;
6989 struct isl_tab *tab = NULL;
6990 struct isl_tab_undo *snap;
6993 if (!bset || !signs)
6996 bound = isl_vec_alloc(bset->ctx, 1 + isl_basic_set_total_dim(bset));
6997 tab = isl_tab_from_basic_set(bset);
7001 isl_seq_clr(bound->el, bound->size);
7002 isl_int_set_si(bound->el[0], -1);
7004 snap = isl_tab_snap(tab);
7005 for (i = 0; i < n; ++i) {
7008 isl_int_set_si(bound->el[1 + first + i], -1);
7009 if (isl_tab_add_ineq(tab, bound->el) < 0)
7012 isl_int_set_si(bound->el[1 + first + i], 0);
7013 if (isl_tab_rollback(tab, snap) < 0)
7021 isl_int_set_si(bound->el[1 + first + i], 1);
7022 if (isl_tab_add_ineq(tab, bound->el) < 0)
7025 isl_int_set_si(bound->el[1 + first + i], 0);
7026 if (isl_tab_rollback(tab, snap) < 0)
7029 signs[i] = empty ? -1 : 0;
7033 isl_vec_free(bound);
7037 isl_vec_free(bound);
7041 int isl_basic_set_dims_get_sign(__isl_keep isl_basic_set *bset,
7042 enum isl_dim_type type, unsigned first, unsigned n, int *signs)
7044 if (!bset || !signs)
7046 isl_assert(bset->ctx, first + n <= isl_basic_set_dim(bset, type),
7049 first += pos(bset->dim, type) - 1;
7050 return isl_basic_set_vars_get_sign(bset, first, n, signs);
7053 /* Check if the given map is single-valued.
7058 * and check if the result is a subset of the identity mapping.
7060 int isl_map_is_single_valued(__isl_keep isl_map *map)
7066 test = isl_map_reverse(isl_map_copy(map));
7067 test = isl_map_apply_range(test, isl_map_copy(map));
7069 id = isl_map_identity(isl_dim_range(isl_map_get_dim(map)));
7071 sv = isl_map_is_subset(test, id);
7079 int isl_map_is_bijective(__isl_keep isl_map *map)
7083 sv = isl_map_is_single_valued(map);
7087 map = isl_map_copy(map);
7088 map = isl_map_reverse(map);
7089 sv = isl_map_is_single_valued(map);
7095 int isl_set_is_singleton(__isl_keep isl_set *set)
7097 return isl_map_is_single_valued((isl_map *)set);
7100 int isl_map_is_translation(__isl_keep isl_map *map)
7105 delta = isl_map_deltas(isl_map_copy(map));
7106 ok = isl_set_is_singleton(delta);
7107 isl_set_free(delta);
7112 static int unique(isl_int *p, unsigned pos, unsigned len)
7114 if (isl_seq_first_non_zero(p, pos) != -1)
7116 if (isl_seq_first_non_zero(p + pos + 1, len - pos - 1) != -1)
7121 int isl_basic_set_is_box(__isl_keep isl_basic_set *bset)
7130 if (isl_basic_set_dim(bset, isl_dim_div) != 0)
7133 nvar = isl_basic_set_dim(bset, isl_dim_set);
7134 ovar = isl_dim_offset(bset->dim, isl_dim_set);
7135 for (j = 0; j < nvar; ++j) {
7136 int lower = 0, upper = 0;
7137 for (i = 0; i < bset->n_eq; ++i) {
7138 if (isl_int_is_zero(bset->eq[i][1 + ovar + j]))
7140 if (!unique(bset->eq[i] + 1 + ovar, j, nvar))
7146 for (i = 0; i < bset->n_ineq; ++i) {
7147 if (isl_int_is_zero(bset->ineq[i][1 + ovar + j]))
7149 if (!unique(bset->ineq[i] + 1 + ovar, j, nvar))
7151 if (isl_int_is_pos(bset->ineq[i][1 + ovar + j]))
7156 if (!lower || !upper)
7163 int isl_set_is_box(__isl_keep isl_set *set)
7170 return isl_basic_set_is_box(set->p[0]);
7173 int isl_basic_set_is_wrapping(__isl_keep isl_basic_set *bset)
7178 return isl_dim_is_wrapping(bset->dim);
7181 int isl_set_is_wrapping(__isl_keep isl_set *set)
7186 return isl_dim_is_wrapping(set->dim);
7189 __isl_give isl_basic_set *isl_basic_map_wrap(__isl_take isl_basic_map *bmap)
7191 bmap = isl_basic_map_cow(bmap);
7195 bmap->dim = isl_dim_wrap(bmap->dim);
7199 bmap = isl_basic_map_finalize(bmap);
7201 return (isl_basic_set *)bmap;
7203 isl_basic_map_free(bmap);
7207 __isl_give isl_set *isl_map_wrap(__isl_take isl_map *map)
7211 map = isl_map_cow(map);
7215 for (i = 0; i < map->n; ++i) {
7216 map->p[i] = (isl_basic_map *)isl_basic_map_wrap(map->p[i]);
7220 map->dim = isl_dim_wrap(map->dim);
7224 return (isl_set *)map;
7230 __isl_give isl_basic_map *isl_basic_set_unwrap(__isl_take isl_basic_set *bset)
7232 bset = isl_basic_set_cow(bset);
7236 bset->dim = isl_dim_unwrap(bset->dim);
7240 bset = isl_basic_set_finalize(bset);
7242 return (isl_basic_map *)bset;
7244 isl_basic_set_free(bset);
7248 __isl_give isl_map *isl_set_unwrap(__isl_take isl_set *set)
7255 if (!isl_set_is_wrapping(set))
7256 isl_die(set->ctx, isl_error_invalid, "not a wrapping set",
7259 set = isl_set_cow(set);
7263 for (i = 0; i < set->n; ++i) {
7264 set->p[i] = (isl_basic_set *)isl_basic_set_unwrap(set->p[i]);
7269 set->dim = isl_dim_unwrap(set->dim);
7273 return (isl_map *)set;
7279 __isl_give isl_basic_map *isl_basic_map_reset(__isl_take isl_basic_map *bmap,
7280 enum isl_dim_type type)
7285 if (!isl_dim_is_named_or_nested(bmap->dim, type))
7288 bmap = isl_basic_map_cow(bmap);
7292 bmap->dim = isl_dim_reset(bmap->dim, type);
7296 bmap = isl_basic_map_finalize(bmap);
7300 isl_basic_map_free(bmap);
7304 __isl_give isl_map *isl_map_reset(__isl_take isl_map *map,
7305 enum isl_dim_type type)
7312 if (!isl_dim_is_named_or_nested(map->dim, type))
7315 map = isl_map_cow(map);
7319 for (i = 0; i < map->n; ++i) {
7320 map->p[i] = isl_basic_map_reset(map->p[i], type);
7324 map->dim = isl_dim_reset(map->dim, type);
7334 __isl_give isl_basic_map *isl_basic_map_flatten(__isl_take isl_basic_map *bmap)
7339 if (!bmap->dim->nested[0] && !bmap->dim->nested[1])
7342 bmap = isl_basic_map_cow(bmap);
7346 bmap->dim = isl_dim_flatten(bmap->dim);
7350 bmap = isl_basic_map_finalize(bmap);
7354 isl_basic_map_free(bmap);
7358 __isl_give isl_map *isl_map_flatten(__isl_take isl_map *map)
7365 if (!map->dim->nested[0] && !map->dim->nested[1])
7368 map = isl_map_cow(map);
7372 for (i = 0; i < map->n; ++i) {
7373 map->p[i] = isl_basic_map_flatten(map->p[i]);
7377 map->dim = isl_dim_flatten(map->dim);
7387 /* Extend the given dim_map with mappings for the divs in bmap.
7389 static __isl_give struct isl_dim_map *extend_dim_map(
7390 __isl_keep struct isl_dim_map *dim_map,
7391 __isl_keep isl_basic_map *bmap)
7394 struct isl_dim_map *res;
7397 offset = isl_basic_map_offset(bmap, isl_dim_div);
7399 res = isl_dim_map_alloc(bmap->ctx, dim_map->len - 1 + bmap->n_div);
7403 for (i = 0; i < dim_map->len; ++i)
7404 res->pos[i] = dim_map->pos[i];
7405 for (i = 0; i < bmap->n_div; ++i)
7406 res->pos[dim_map->len + i] = offset + i;
7411 /* Extract a dim_map from a reordering.
7412 * We essentially need to reverse the mapping, and add an offset
7413 * of 1 for the constant term.
7415 __isl_give struct isl_dim_map *isl_dim_map_from_reordering(
7416 __isl_keep isl_reordering *exp)
7419 struct isl_dim_map *dim_map;
7424 dim_map = isl_dim_map_alloc(exp->dim->ctx, isl_dim_total(exp->dim));
7428 for (i = 0; i < exp->len; ++i)
7429 dim_map->pos[1 + exp->pos[i]] = 1 + i;
7434 /* Reorder the dimensions of "bmap" according to the given dim_map
7435 * and set the dimension specification to "dim".
7437 __isl_give isl_basic_map *isl_basic_map_realign(__isl_take isl_basic_map *bmap,
7438 __isl_take isl_dim *dim, __isl_take struct isl_dim_map *dim_map)
7442 bmap = isl_basic_map_cow(bmap);
7443 if (!bmap || !dim || !dim_map)
7446 res = isl_basic_map_alloc_dim(dim,
7447 bmap->n_div, bmap->n_eq, bmap->n_ineq);
7448 res = add_constraints_dim_map(res, bmap, dim_map);
7449 res = isl_basic_map_finalize(res);
7453 isl_basic_map_free(bmap);
7458 /* Reorder the dimensions of "map" according to given reordering.
7460 __isl_give isl_map *isl_map_realign(__isl_take isl_map *map,
7461 __isl_take isl_reordering *r)
7464 struct isl_dim_map *dim_map;
7466 map = isl_map_cow(map);
7467 dim_map = isl_dim_map_from_reordering(r);
7468 if (!map || !r || !dim_map)
7471 for (i = 0; i < map->n; ++i) {
7472 struct isl_dim_map *dim_map_i;
7474 dim_map_i = extend_dim_map(dim_map, map->p[i]);
7476 map->p[i] = isl_basic_map_realign(map->p[i],
7477 isl_dim_copy(r->dim), dim_map_i);
7483 map = isl_map_reset_dim(map, isl_dim_copy(r->dim));
7485 isl_reordering_free(r);
7491 isl_reordering_free(r);
7495 __isl_give isl_set *isl_set_realign(__isl_take isl_set *set,
7496 __isl_take isl_reordering *r)
7498 return (isl_set *)isl_map_realign((isl_map *)set, r);
7501 __isl_give isl_mat *isl_basic_map_equalities_matrix(
7502 __isl_keep isl_basic_map *bmap, enum isl_dim_type c1,
7503 enum isl_dim_type c2, enum isl_dim_type c3,
7504 enum isl_dim_type c4, enum isl_dim_type c5)
7506 enum isl_dim_type c[5] = { c1, c2, c3, c4, c5 };
7507 struct isl_mat *mat;
7513 mat = isl_mat_alloc(bmap->ctx, bmap->n_eq,
7514 isl_basic_map_total_dim(bmap) + 1);
7517 for (i = 0; i < bmap->n_eq; ++i)
7518 for (j = 0, pos = 0; j < 5; ++j) {
7519 int off = isl_basic_map_offset(bmap, c[j]);
7520 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
7521 isl_int_set(mat->row[i][pos],
7522 bmap->eq[i][off + k]);
7530 __isl_give isl_mat *isl_basic_map_inequalities_matrix(
7531 __isl_keep isl_basic_map *bmap, enum isl_dim_type c1,
7532 enum isl_dim_type c2, enum isl_dim_type c3,
7533 enum isl_dim_type c4, enum isl_dim_type c5)
7535 enum isl_dim_type c[5] = { c1, c2, c3, c4, c5 };
7536 struct isl_mat *mat;
7542 mat = isl_mat_alloc(bmap->ctx, bmap->n_ineq,
7543 isl_basic_map_total_dim(bmap) + 1);
7546 for (i = 0; i < bmap->n_ineq; ++i)
7547 for (j = 0, pos = 0; j < 5; ++j) {
7548 int off = isl_basic_map_offset(bmap, c[j]);
7549 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
7550 isl_int_set(mat->row[i][pos],
7551 bmap->ineq[i][off + k]);