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 const char *isl_basic_map_get_tuple_name(__isl_keep isl_basic_map *bmap,
333 enum isl_dim_type type)
335 return bmap ? isl_dim_get_tuple_name(bmap->dim, type) : NULL;
338 __isl_give isl_map *isl_map_set_tuple_name(__isl_take isl_map *map,
339 enum isl_dim_type type, const char *s)
343 map = isl_map_cow(map);
347 map->dim = isl_dim_set_tuple_name(map->dim, type, s);
351 for (i = 0; i < map->n; ++i) {
352 map->p[i] = isl_basic_map_set_tuple_name(map->p[i], type, s);
363 const char *isl_map_get_tuple_name(__isl_keep isl_map *map,
364 enum isl_dim_type type)
366 return map ? isl_dim_get_tuple_name(map->dim, type) : NULL;
369 __isl_give isl_set *isl_set_set_tuple_name(__isl_take isl_set *set,
372 return (isl_set *)isl_map_set_tuple_name((isl_map *)set, isl_dim_set, s);
375 const char *isl_set_get_tuple_name(__isl_keep isl_set *set)
377 return set ? isl_dim_get_tuple_name(set->dim, isl_dim_set) : NULL;
380 const char *isl_basic_map_get_dim_name(__isl_keep isl_basic_map *bmap,
381 enum isl_dim_type type, unsigned pos)
383 return bmap ? isl_dim_get_name(bmap->dim, type, pos) : NULL;
386 const char *isl_map_get_dim_name(__isl_keep isl_map *map,
387 enum isl_dim_type type, unsigned pos)
389 return map ? isl_dim_get_name(map->dim, type, pos) : NULL;
392 const char *isl_set_get_dim_name(__isl_keep isl_set *set,
393 enum isl_dim_type type, unsigned pos)
395 return set ? isl_dim_get_name(set->dim, type, pos) : NULL;
398 __isl_give isl_basic_map *isl_basic_map_set_dim_name(
399 __isl_take isl_basic_map *bmap,
400 enum isl_dim_type type, unsigned pos, const char *s)
404 bmap->dim = isl_dim_set_name(bmap->dim, type, pos, s);
409 isl_basic_map_free(bmap);
413 __isl_give isl_map *isl_map_set_dim_name(__isl_take isl_map *map,
414 enum isl_dim_type type, unsigned pos, const char *s)
421 map->dim = isl_dim_set_name(map->dim, type, pos, s);
425 for (i = 0; i < map->n; ++i) {
426 map->p[i] = isl_basic_map_set_dim_name(map->p[i], type, pos, s);
437 __isl_give isl_basic_set *isl_basic_set_set_dim_name(
438 __isl_take isl_basic_set *bset,
439 enum isl_dim_type type, unsigned pos, const char *s)
441 return (isl_basic_set *)isl_basic_map_set_dim_name(
442 (isl_basic_map *)bset, type, pos, s);
445 __isl_give isl_set *isl_set_set_dim_name(__isl_take isl_set *set,
446 enum isl_dim_type type, unsigned pos, const char *s)
448 return (isl_set *)isl_map_set_dim_name((isl_map *)set, type, pos, s);
451 int isl_basic_map_is_rational(__isl_keep isl_basic_map *bmap)
455 return ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL);
458 static struct isl_basic_map *basic_map_init(struct isl_ctx *ctx,
459 struct isl_basic_map *bmap, unsigned extra,
460 unsigned n_eq, unsigned n_ineq)
463 size_t row_size = 1 + isl_dim_total(bmap->dim) + extra;
468 bmap->block = isl_blk_alloc(ctx, (n_ineq + n_eq) * row_size);
469 if (isl_blk_is_error(bmap->block))
472 bmap->ineq = isl_alloc_array(ctx, isl_int *, n_ineq + n_eq);
477 bmap->block2 = isl_blk_empty();
480 bmap->block2 = isl_blk_alloc(ctx, extra * (1 + row_size));
481 if (isl_blk_is_error(bmap->block2))
484 bmap->div = isl_alloc_array(ctx, isl_int *, extra);
489 for (i = 0; i < n_ineq + n_eq; ++i)
490 bmap->ineq[i] = bmap->block.data + i * row_size;
492 for (i = 0; i < extra; ++i)
493 bmap->div[i] = bmap->block2.data + i * (1 + row_size);
497 bmap->c_size = n_eq + n_ineq;
498 bmap->eq = bmap->ineq + n_ineq;
507 isl_basic_map_free(bmap);
511 struct isl_basic_set *isl_basic_set_alloc(struct isl_ctx *ctx,
512 unsigned nparam, unsigned dim, unsigned extra,
513 unsigned n_eq, unsigned n_ineq)
515 struct isl_basic_map *bmap;
516 bmap = isl_basic_map_alloc(ctx, nparam, 0, dim, extra, n_eq, n_ineq);
517 return (struct isl_basic_set *)bmap;
520 struct isl_basic_set *isl_basic_set_alloc_dim(struct isl_dim *dim,
521 unsigned extra, unsigned n_eq, unsigned n_ineq)
523 struct isl_basic_map *bmap;
526 isl_assert(dim->ctx, dim->n_in == 0, goto error);
527 bmap = isl_basic_map_alloc_dim(dim, extra, n_eq, n_ineq);
528 return (struct isl_basic_set *)bmap;
534 struct isl_basic_map *isl_basic_map_alloc_dim(struct isl_dim *dim,
535 unsigned extra, unsigned n_eq, unsigned n_ineq)
537 struct isl_basic_map *bmap;
541 bmap = isl_calloc_type(dim->ctx, struct isl_basic_map);
546 return basic_map_init(dim->ctx, bmap, extra, n_eq, n_ineq);
552 struct isl_basic_map *isl_basic_map_alloc(struct isl_ctx *ctx,
553 unsigned nparam, unsigned in, unsigned out, unsigned extra,
554 unsigned n_eq, unsigned n_ineq)
556 struct isl_basic_map *bmap;
559 dim = isl_dim_alloc(ctx, nparam, in, out);
563 bmap = isl_basic_map_alloc_dim(dim, extra, n_eq, n_ineq);
567 static void dup_constraints(
568 struct isl_basic_map *dst, struct isl_basic_map *src)
571 unsigned total = isl_basic_map_total_dim(src);
573 for (i = 0; i < src->n_eq; ++i) {
574 int j = isl_basic_map_alloc_equality(dst);
575 isl_seq_cpy(dst->eq[j], src->eq[i], 1+total);
578 for (i = 0; i < src->n_ineq; ++i) {
579 int j = isl_basic_map_alloc_inequality(dst);
580 isl_seq_cpy(dst->ineq[j], src->ineq[i], 1+total);
583 for (i = 0; i < src->n_div; ++i) {
584 int j = isl_basic_map_alloc_div(dst);
585 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total);
587 ISL_F_SET(dst, ISL_BASIC_SET_FINAL);
590 struct isl_basic_map *isl_basic_map_dup(struct isl_basic_map *bmap)
592 struct isl_basic_map *dup;
596 dup = isl_basic_map_alloc_dim(isl_dim_copy(bmap->dim),
597 bmap->n_div, bmap->n_eq, bmap->n_ineq);
600 dup_constraints(dup, bmap);
601 dup->flags = bmap->flags;
602 dup->sample = isl_vec_copy(bmap->sample);
606 struct isl_basic_set *isl_basic_set_dup(struct isl_basic_set *bset)
608 struct isl_basic_map *dup;
610 dup = isl_basic_map_dup((struct isl_basic_map *)bset);
611 return (struct isl_basic_set *)dup;
614 struct isl_basic_set *isl_basic_set_copy(struct isl_basic_set *bset)
619 if (ISL_F_ISSET(bset, ISL_BASIC_SET_FINAL)) {
623 return isl_basic_set_dup(bset);
626 struct isl_set *isl_set_copy(struct isl_set *set)
635 struct isl_basic_map *isl_basic_map_copy(struct isl_basic_map *bmap)
640 if (ISL_F_ISSET(bmap, ISL_BASIC_SET_FINAL)) {
644 bmap = isl_basic_map_dup(bmap);
646 ISL_F_SET(bmap, ISL_BASIC_SET_FINAL);
650 struct isl_map *isl_map_copy(struct isl_map *map)
659 void isl_basic_map_free(struct isl_basic_map *bmap)
667 isl_ctx_deref(bmap->ctx);
669 isl_blk_free(bmap->ctx, bmap->block2);
671 isl_blk_free(bmap->ctx, bmap->block);
672 isl_vec_free(bmap->sample);
673 isl_dim_free(bmap->dim);
677 void isl_basic_set_free(struct isl_basic_set *bset)
679 isl_basic_map_free((struct isl_basic_map *)bset);
682 static int room_for_con(struct isl_basic_map *bmap, unsigned n)
684 return bmap->n_eq + bmap->n_ineq + n <= bmap->c_size;
687 int isl_basic_map_alloc_equality(struct isl_basic_map *bmap)
693 isl_assert(ctx, room_for_con(bmap, 1), return -1);
694 isl_assert(ctx, (bmap->eq - bmap->ineq) + bmap->n_eq <= bmap->c_size,
696 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
697 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
698 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_IMPLICIT);
699 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
700 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
701 if ((bmap->eq - bmap->ineq) + bmap->n_eq == bmap->c_size) {
703 int j = isl_basic_map_alloc_inequality(bmap);
707 bmap->ineq[j] = bmap->ineq[bmap->n_ineq - 1];
708 bmap->ineq[bmap->n_ineq - 1] = bmap->eq[-1];
715 isl_seq_clr(bmap->eq[bmap->n_eq] + 1 + isl_basic_map_total_dim(bmap),
716 bmap->extra - bmap->n_div);
720 int isl_basic_set_alloc_equality(struct isl_basic_set *bset)
722 return isl_basic_map_alloc_equality((struct isl_basic_map *)bset);
725 int isl_basic_map_free_equality(struct isl_basic_map *bmap, unsigned n)
729 isl_assert(bmap->ctx, n <= bmap->n_eq, return -1);
734 int isl_basic_set_free_equality(struct isl_basic_set *bset, unsigned n)
736 return isl_basic_map_free_equality((struct isl_basic_map *)bset, n);
739 int isl_basic_map_drop_equality(struct isl_basic_map *bmap, unsigned pos)
744 isl_assert(bmap->ctx, pos < bmap->n_eq, return -1);
746 if (pos != bmap->n_eq - 1) {
748 bmap->eq[pos] = bmap->eq[bmap->n_eq - 1];
749 bmap->eq[bmap->n_eq - 1] = t;
755 int isl_basic_set_drop_equality(struct isl_basic_set *bset, unsigned pos)
757 return isl_basic_map_drop_equality((struct isl_basic_map *)bset, pos);
760 void isl_basic_map_inequality_to_equality(
761 struct isl_basic_map *bmap, unsigned pos)
766 bmap->ineq[pos] = bmap->ineq[bmap->n_ineq - 1];
767 bmap->ineq[bmap->n_ineq - 1] = bmap->eq[-1];
772 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
773 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
774 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
775 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
778 static int room_for_ineq(struct isl_basic_map *bmap, unsigned n)
780 return bmap->n_ineq + n <= bmap->eq - bmap->ineq;
783 int isl_basic_map_alloc_inequality(struct isl_basic_map *bmap)
789 isl_assert(ctx, room_for_ineq(bmap, 1), return -1);
790 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_IMPLICIT);
791 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
792 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
793 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
794 isl_seq_clr(bmap->ineq[bmap->n_ineq] +
795 1 + isl_basic_map_total_dim(bmap),
796 bmap->extra - bmap->n_div);
797 return bmap->n_ineq++;
800 int isl_basic_set_alloc_inequality(struct isl_basic_set *bset)
802 return isl_basic_map_alloc_inequality((struct isl_basic_map *)bset);
805 int isl_basic_map_free_inequality(struct isl_basic_map *bmap, unsigned n)
809 isl_assert(bmap->ctx, n <= bmap->n_ineq, return -1);
814 int isl_basic_set_free_inequality(struct isl_basic_set *bset, unsigned n)
816 return isl_basic_map_free_inequality((struct isl_basic_map *)bset, n);
819 int isl_basic_map_drop_inequality(struct isl_basic_map *bmap, unsigned pos)
824 isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
826 if (pos != bmap->n_ineq - 1) {
828 bmap->ineq[pos] = bmap->ineq[bmap->n_ineq - 1];
829 bmap->ineq[bmap->n_ineq - 1] = t;
830 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
836 int isl_basic_set_drop_inequality(struct isl_basic_set *bset, unsigned pos)
838 return isl_basic_map_drop_inequality((struct isl_basic_map *)bset, pos);
841 __isl_give isl_basic_map *isl_basic_map_add_eq(__isl_take isl_basic_map *bmap,
846 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
849 k = isl_basic_map_alloc_equality(bmap);
852 isl_seq_cpy(bmap->eq[k], eq, 1 + isl_basic_map_total_dim(bmap));
855 isl_basic_map_free(bmap);
859 __isl_give isl_basic_set *isl_basic_set_add_eq(__isl_take isl_basic_set *bset,
862 return (isl_basic_set *)
863 isl_basic_map_add_eq((isl_basic_map *)bset, eq);
866 __isl_give isl_basic_map *isl_basic_map_add_ineq(__isl_take isl_basic_map *bmap,
871 bmap = isl_basic_map_extend_constraints(bmap, 0, 1);
874 k = isl_basic_map_alloc_inequality(bmap);
877 isl_seq_cpy(bmap->ineq[k], ineq, 1 + isl_basic_map_total_dim(bmap));
880 isl_basic_map_free(bmap);
884 __isl_give isl_basic_set *isl_basic_set_add_ineq(__isl_take isl_basic_set *bset,
887 return (isl_basic_set *)
888 isl_basic_map_add_ineq((isl_basic_map *)bset, ineq);
891 int isl_basic_map_alloc_div(struct isl_basic_map *bmap)
895 isl_assert(bmap->ctx, bmap->n_div < bmap->extra, return -1);
896 isl_seq_clr(bmap->div[bmap->n_div] +
897 1 + 1 + isl_basic_map_total_dim(bmap),
898 bmap->extra - bmap->n_div);
899 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
900 return bmap->n_div++;
903 int isl_basic_set_alloc_div(struct isl_basic_set *bset)
905 return isl_basic_map_alloc_div((struct isl_basic_map *)bset);
908 int isl_basic_map_free_div(struct isl_basic_map *bmap, unsigned n)
912 isl_assert(bmap->ctx, n <= bmap->n_div, return -1);
917 int isl_basic_set_free_div(struct isl_basic_set *bset, unsigned n)
919 return isl_basic_map_free_div((struct isl_basic_map *)bset, n);
922 /* Copy constraint from src to dst, putting the vars of src at offset
923 * dim_off in dst and the divs of src at offset div_off in dst.
924 * If both sets are actually map, then dim_off applies to the input
927 static void copy_constraint(struct isl_basic_map *dst_map, isl_int *dst,
928 struct isl_basic_map *src_map, isl_int *src,
929 unsigned in_off, unsigned out_off, unsigned div_off)
931 unsigned src_nparam = isl_basic_map_n_param(src_map);
932 unsigned dst_nparam = isl_basic_map_n_param(dst_map);
933 unsigned src_in = isl_basic_map_n_in(src_map);
934 unsigned dst_in = isl_basic_map_n_in(dst_map);
935 unsigned src_out = isl_basic_map_n_out(src_map);
936 unsigned dst_out = isl_basic_map_n_out(dst_map);
937 isl_int_set(dst[0], src[0]);
938 isl_seq_cpy(dst+1, src+1, isl_min(dst_nparam, src_nparam));
939 if (dst_nparam > src_nparam)
940 isl_seq_clr(dst+1+src_nparam,
941 dst_nparam - src_nparam);
942 isl_seq_clr(dst+1+dst_nparam, in_off);
943 isl_seq_cpy(dst+1+dst_nparam+in_off,
945 isl_min(dst_in-in_off, src_in));
946 if (dst_in-in_off > src_in)
947 isl_seq_clr(dst+1+dst_nparam+in_off+src_in,
948 dst_in - in_off - src_in);
949 isl_seq_clr(dst+1+dst_nparam+dst_in, out_off);
950 isl_seq_cpy(dst+1+dst_nparam+dst_in+out_off,
951 src+1+src_nparam+src_in,
952 isl_min(dst_out-out_off, src_out));
953 if (dst_out-out_off > src_out)
954 isl_seq_clr(dst+1+dst_nparam+dst_in+out_off+src_out,
955 dst_out - out_off - src_out);
956 isl_seq_clr(dst+1+dst_nparam+dst_in+dst_out, div_off);
957 isl_seq_cpy(dst+1+dst_nparam+dst_in+dst_out+div_off,
958 src+1+src_nparam+src_in+src_out,
959 isl_min(dst_map->extra-div_off, src_map->n_div));
960 if (dst_map->n_div-div_off > src_map->n_div)
961 isl_seq_clr(dst+1+dst_nparam+dst_in+dst_out+
962 div_off+src_map->n_div,
963 dst_map->n_div - div_off - src_map->n_div);
966 static void copy_div(struct isl_basic_map *dst_map, isl_int *dst,
967 struct isl_basic_map *src_map, isl_int *src,
968 unsigned in_off, unsigned out_off, unsigned div_off)
970 isl_int_set(dst[0], src[0]);
971 copy_constraint(dst_map, dst+1, src_map, src+1, in_off, out_off, div_off);
974 static struct isl_basic_map *add_constraints(struct isl_basic_map *bmap1,
975 struct isl_basic_map *bmap2, unsigned i_pos, unsigned o_pos)
980 if (!bmap1 || !bmap2)
983 div_off = bmap1->n_div;
985 for (i = 0; i < bmap2->n_eq; ++i) {
986 int i1 = isl_basic_map_alloc_equality(bmap1);
989 copy_constraint(bmap1, bmap1->eq[i1], bmap2, bmap2->eq[i],
990 i_pos, o_pos, div_off);
993 for (i = 0; i < bmap2->n_ineq; ++i) {
994 int i1 = isl_basic_map_alloc_inequality(bmap1);
997 copy_constraint(bmap1, bmap1->ineq[i1], bmap2, bmap2->ineq[i],
998 i_pos, o_pos, div_off);
1001 for (i = 0; i < bmap2->n_div; ++i) {
1002 int i1 = isl_basic_map_alloc_div(bmap1);
1005 copy_div(bmap1, bmap1->div[i1], bmap2, bmap2->div[i],
1006 i_pos, o_pos, div_off);
1009 isl_basic_map_free(bmap2);
1014 isl_basic_map_free(bmap1);
1015 isl_basic_map_free(bmap2);
1019 static void copy_constraint_dim_map(isl_int *dst, isl_int *src,
1020 struct isl_dim_map *dim_map)
1024 for (i = 0; i < dim_map->len; ++i) {
1025 if (dim_map->pos[i] < 0)
1026 isl_int_set_si(dst[i], 0);
1028 isl_int_set(dst[i], src[dim_map->pos[i]]);
1032 static void copy_div_dim_map(isl_int *dst, isl_int *src,
1033 struct isl_dim_map *dim_map)
1035 isl_int_set(dst[0], src[0]);
1036 copy_constraint_dim_map(dst+1, src+1, dim_map);
1039 static struct isl_basic_map *add_constraints_dim_map(struct isl_basic_map *dst,
1040 struct isl_basic_map *src, struct isl_dim_map *dim_map)
1044 if (!src || !dst || !dim_map)
1047 for (i = 0; i < src->n_eq; ++i) {
1048 int i1 = isl_basic_map_alloc_equality(dst);
1051 copy_constraint_dim_map(dst->eq[i1], src->eq[i], dim_map);
1054 for (i = 0; i < src->n_ineq; ++i) {
1055 int i1 = isl_basic_map_alloc_inequality(dst);
1058 copy_constraint_dim_map(dst->ineq[i1], src->ineq[i], dim_map);
1061 for (i = 0; i < src->n_div; ++i) {
1062 int i1 = isl_basic_map_alloc_div(dst);
1065 copy_div_dim_map(dst->div[i1], src->div[i], dim_map);
1069 isl_basic_map_free(src);
1074 isl_basic_map_free(src);
1075 isl_basic_map_free(dst);
1079 struct isl_basic_set *isl_basic_set_add_constraints(struct isl_basic_set *bset1,
1080 struct isl_basic_set *bset2, unsigned pos)
1082 return (struct isl_basic_set *)
1083 add_constraints((struct isl_basic_map *)bset1,
1084 (struct isl_basic_map *)bset2, 0, pos);
1087 struct isl_basic_map *isl_basic_map_extend_dim(struct isl_basic_map *base,
1088 struct isl_dim *dim, unsigned extra,
1089 unsigned n_eq, unsigned n_ineq)
1091 struct isl_basic_map *ext;
1101 dims_ok = isl_dim_equal(base->dim, dim) &&
1102 base->extra >= base->n_div + extra;
1104 if (dims_ok && room_for_con(base, n_eq + n_ineq) &&
1105 room_for_ineq(base, n_ineq)) {
1110 isl_assert(base->ctx, base->dim->nparam <= dim->nparam, goto error);
1111 isl_assert(base->ctx, base->dim->n_in <= dim->n_in, goto error);
1112 isl_assert(base->ctx, base->dim->n_out <= dim->n_out, goto error);
1113 extra += base->extra;
1115 n_ineq += base->n_ineq;
1117 ext = isl_basic_map_alloc_dim(dim, extra, n_eq, n_ineq);
1123 ext->sample = isl_vec_copy(base->sample);
1124 flags = base->flags;
1125 ext = add_constraints(ext, base, 0, 0);
1128 ISL_F_CLR(ext, ISL_BASIC_SET_FINAL);
1135 isl_basic_map_free(base);
1139 struct isl_basic_set *isl_basic_set_extend_dim(struct isl_basic_set *base,
1140 struct isl_dim *dim, unsigned extra,
1141 unsigned n_eq, unsigned n_ineq)
1143 return (struct isl_basic_set *)
1144 isl_basic_map_extend_dim((struct isl_basic_map *)base, dim,
1145 extra, n_eq, n_ineq);
1148 struct isl_basic_map *isl_basic_map_extend_constraints(
1149 struct isl_basic_map *base, unsigned n_eq, unsigned n_ineq)
1153 return isl_basic_map_extend_dim(base, isl_dim_copy(base->dim),
1157 struct isl_basic_map *isl_basic_map_extend(struct isl_basic_map *base,
1158 unsigned nparam, unsigned n_in, unsigned n_out, unsigned extra,
1159 unsigned n_eq, unsigned n_ineq)
1161 struct isl_basic_map *bmap;
1162 struct isl_dim *dim;
1166 dim = isl_dim_alloc(base->ctx, nparam, n_in, n_out);
1170 bmap = isl_basic_map_extend_dim(base, dim, extra, n_eq, n_ineq);
1173 isl_basic_map_free(base);
1177 struct isl_basic_set *isl_basic_set_extend(struct isl_basic_set *base,
1178 unsigned nparam, unsigned dim, unsigned extra,
1179 unsigned n_eq, unsigned n_ineq)
1181 return (struct isl_basic_set *)
1182 isl_basic_map_extend((struct isl_basic_map *)base,
1183 nparam, 0, dim, extra, n_eq, n_ineq);
1186 struct isl_basic_set *isl_basic_set_extend_constraints(
1187 struct isl_basic_set *base, unsigned n_eq, unsigned n_ineq)
1189 return (struct isl_basic_set *)
1190 isl_basic_map_extend_constraints((struct isl_basic_map *)base,
1194 struct isl_basic_set *isl_basic_set_cow(struct isl_basic_set *bset)
1196 return (struct isl_basic_set *)
1197 isl_basic_map_cow((struct isl_basic_map *)bset);
1200 struct isl_basic_map *isl_basic_map_cow(struct isl_basic_map *bmap)
1205 if (bmap->ref > 1) {
1207 bmap = isl_basic_map_dup(bmap);
1210 ISL_F_CLR(bmap, ISL_BASIC_SET_FINAL);
1214 struct isl_set *isl_set_cow(struct isl_set *set)
1222 return isl_set_dup(set);
1225 struct isl_map *isl_map_cow(struct isl_map *map)
1233 return isl_map_dup(map);
1236 static void swap_vars(struct isl_blk blk, isl_int *a,
1237 unsigned a_len, unsigned b_len)
1239 isl_seq_cpy(blk.data, a+a_len, b_len);
1240 isl_seq_cpy(blk.data+b_len, a, a_len);
1241 isl_seq_cpy(a, blk.data, b_len+a_len);
1244 struct isl_basic_set *isl_basic_set_swap_vars(
1245 struct isl_basic_set *bset, unsigned n)
1255 nparam = isl_basic_set_n_param(bset);
1256 dim = isl_basic_set_n_dim(bset);
1257 isl_assert(bset->ctx, n <= dim, goto error);
1262 bset = isl_basic_set_cow(bset);
1266 blk = isl_blk_alloc(bset->ctx, dim);
1267 if (isl_blk_is_error(blk))
1270 for (i = 0; i < bset->n_eq; ++i)
1272 bset->eq[i]+1+nparam, n, dim - n);
1274 for (i = 0; i < bset->n_ineq; ++i)
1276 bset->ineq[i]+1+nparam, n, dim - n);
1278 for (i = 0; i < bset->n_div; ++i)
1280 bset->div[i]+1+1+nparam, n, dim - n);
1282 isl_blk_free(bset->ctx, blk);
1284 ISL_F_CLR(bset, ISL_BASIC_SET_NORMALIZED);
1285 bset = isl_basic_set_gauss(bset, NULL);
1286 return isl_basic_set_finalize(bset);
1288 isl_basic_set_free(bset);
1292 struct isl_set *isl_set_swap_vars(struct isl_set *set, unsigned n)
1295 set = isl_set_cow(set);
1299 for (i = 0; i < set->n; ++i) {
1300 set->p[i] = isl_basic_set_swap_vars(set->p[i], n);
1306 ISL_F_CLR(set, ISL_SET_NORMALIZED);
1310 struct isl_basic_map *isl_basic_map_set_to_empty(struct isl_basic_map *bmap)
1316 total = isl_basic_map_total_dim(bmap);
1317 isl_basic_map_free_div(bmap, bmap->n_div);
1318 isl_basic_map_free_inequality(bmap, bmap->n_ineq);
1320 isl_basic_map_free_equality(bmap, bmap->n_eq-1);
1322 i = isl_basic_map_alloc_equality(bmap);
1326 isl_int_set_si(bmap->eq[i][0], 1);
1327 isl_seq_clr(bmap->eq[i]+1, total);
1328 ISL_F_SET(bmap, ISL_BASIC_MAP_EMPTY);
1329 isl_vec_free(bmap->sample);
1330 bmap->sample = NULL;
1331 return isl_basic_map_finalize(bmap);
1333 isl_basic_map_free(bmap);
1337 struct isl_basic_set *isl_basic_set_set_to_empty(struct isl_basic_set *bset)
1339 return (struct isl_basic_set *)
1340 isl_basic_map_set_to_empty((struct isl_basic_map *)bset);
1343 void isl_basic_map_swap_div(struct isl_basic_map *bmap, int a, int b)
1346 unsigned off = isl_dim_total(bmap->dim);
1347 isl_int *t = bmap->div[a];
1348 bmap->div[a] = bmap->div[b];
1351 for (i = 0; i < bmap->n_eq; ++i)
1352 isl_int_swap(bmap->eq[i][1+off+a], bmap->eq[i][1+off+b]);
1354 for (i = 0; i < bmap->n_ineq; ++i)
1355 isl_int_swap(bmap->ineq[i][1+off+a], bmap->ineq[i][1+off+b]);
1357 for (i = 0; i < bmap->n_div; ++i)
1358 isl_int_swap(bmap->div[i][1+1+off+a], bmap->div[i][1+1+off+b]);
1359 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1362 /* Eliminate the specified n dimensions starting at first from the
1363 * constraints using Fourier-Motzkin. The dimensions themselves
1366 __isl_give isl_map *isl_map_eliminate(__isl_take isl_map *map,
1367 enum isl_dim_type type, unsigned first, unsigned n)
1376 map = isl_map_cow(map);
1379 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
1380 first += pos(map->dim, type) - 1;
1382 for (i = 0; i < map->n; ++i) {
1383 map->p[i] = isl_basic_map_eliminate_vars(map->p[i], first, n);
1393 /* Eliminate the specified n dimensions starting at first from the
1394 * constraints using Fourier-Motzkin. The dimensions themselves
1397 __isl_give isl_set *isl_set_eliminate(__isl_take isl_set *set,
1398 enum isl_dim_type type, unsigned first, unsigned n)
1400 return (isl_set *)isl_map_eliminate((isl_map *)set, type, first, n);
1403 /* Eliminate the specified n dimensions starting at first from the
1404 * constraints using Fourier-Motzkin. The dimensions themselves
1407 __isl_give isl_set *isl_set_eliminate_dims(__isl_take isl_set *set,
1408 unsigned first, unsigned n)
1410 return isl_set_eliminate(set, isl_dim_set, first, n);
1413 __isl_give isl_basic_map *isl_basic_map_remove_divs(
1414 __isl_take isl_basic_map *bmap)
1416 bmap = isl_basic_map_eliminate_vars(bmap, isl_dim_total(bmap->dim),
1424 __isl_give isl_basic_set *isl_basic_set_remove_divs(
1425 __isl_take isl_basic_set *bset)
1427 return (struct isl_basic_set *)isl_basic_map_remove_divs(
1428 (struct isl_basic_map *)bset);
1431 struct isl_set *isl_set_remove_divs(struct isl_set *set)
1440 set = isl_set_cow(set);
1444 for (i = 0; i < set->n; ++i) {
1445 set->p[i] = isl_basic_set_remove_divs(set->p[i]);
1455 struct isl_basic_map *isl_basic_map_remove_dims(struct isl_basic_map *bmap,
1456 enum isl_dim_type type, unsigned first, unsigned n)
1460 isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
1464 bmap = isl_basic_map_eliminate_vars(bmap,
1465 isl_basic_map_offset(bmap, type) - 1 + first, n);
1468 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY) && type == isl_dim_div)
1470 bmap = isl_basic_map_drop(bmap, type, first, n);
1473 isl_basic_map_free(bmap);
1477 /* Return true if the definition of the given div (recursively) involves
1478 * any of the given variables.
1480 static int div_involves_vars(__isl_keep isl_basic_map *bmap, int div,
1481 unsigned first, unsigned n)
1484 unsigned div_offset = isl_basic_map_offset(bmap, isl_dim_div);
1486 if (isl_int_is_zero(bmap->div[div][0]))
1488 if (isl_seq_first_non_zero(bmap->div[div] + 1 + first, n) >= 0)
1491 for (i = bmap->n_div - 1; i >= 0; --i) {
1492 if (isl_int_is_zero(bmap->div[div][1 + div_offset + i]))
1494 if (div_involves_vars(bmap, i, first, n))
1501 /* Remove all divs (recursively) involving any of the given dimensions
1502 * in their definitions.
1504 __isl_give isl_basic_map *isl_basic_map_remove_divs_involving_dims(
1505 __isl_take isl_basic_map *bmap,
1506 enum isl_dim_type type, unsigned first, unsigned n)
1512 isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
1514 first += isl_basic_map_offset(bmap, type);
1516 for (i = bmap->n_div - 1; i >= 0; --i) {
1517 if (!div_involves_vars(bmap, i, first, n))
1519 bmap = isl_basic_map_remove_dims(bmap, isl_dim_div, i, 1);
1524 isl_basic_map_free(bmap);
1528 __isl_give isl_map *isl_map_remove_divs_involving_dims(__isl_take isl_map *map,
1529 enum isl_dim_type type, unsigned first, unsigned n)
1538 map = isl_map_cow(map);
1542 for (i = 0; i < map->n; ++i) {
1543 map->p[i] = isl_basic_map_remove_divs_involving_dims(map->p[i],
1554 __isl_give isl_set *isl_set_remove_divs_involving_dims(__isl_take isl_set *set,
1555 enum isl_dim_type type, unsigned first, unsigned n)
1557 return (isl_set *)isl_map_remove_divs_involving_dims((isl_map *)set,
1561 __isl_give isl_basic_set *isl_basic_set_remove_dims(
1562 __isl_take isl_basic_set *bset,
1563 enum isl_dim_type type, unsigned first, unsigned n)
1565 return (isl_basic_set *)
1566 isl_basic_map_remove_dims((isl_basic_map *)bset, type, first, n);
1569 struct isl_map *isl_map_remove_dims(struct isl_map *map,
1570 enum isl_dim_type type, unsigned first, unsigned n)
1577 map = isl_map_cow(map);
1580 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
1582 for (i = 0; i < map->n; ++i) {
1583 map->p[i] = isl_basic_map_eliminate_vars(map->p[i],
1584 isl_basic_map_offset(map->p[i], type) - 1 + first, n);
1588 map = isl_map_drop(map, type, first, n);
1595 __isl_give isl_set *isl_set_remove_dims(__isl_take isl_set *bset,
1596 enum isl_dim_type type, unsigned first, unsigned n)
1598 return (isl_set *)isl_map_remove_dims((isl_map *)bset, type, first, n);
1601 /* Project out n inputs starting at first using Fourier-Motzkin */
1602 struct isl_map *isl_map_remove_inputs(struct isl_map *map,
1603 unsigned first, unsigned n)
1605 return isl_map_remove_dims(map, isl_dim_in, first, n);
1608 static void dump_term(struct isl_basic_map *bmap,
1609 isl_int c, int pos, FILE *out)
1612 unsigned in = isl_basic_map_n_in(bmap);
1613 unsigned dim = in + isl_basic_map_n_out(bmap);
1614 unsigned nparam = isl_basic_map_n_param(bmap);
1616 isl_int_print(out, c, 0);
1618 if (!isl_int_is_one(c))
1619 isl_int_print(out, c, 0);
1620 if (pos < 1 + nparam) {
1621 name = isl_dim_get_name(bmap->dim,
1622 isl_dim_param, pos - 1);
1624 fprintf(out, "%s", name);
1626 fprintf(out, "p%d", pos - 1);
1627 } else if (pos < 1 + nparam + in)
1628 fprintf(out, "i%d", pos - 1 - nparam);
1629 else if (pos < 1 + nparam + dim)
1630 fprintf(out, "o%d", pos - 1 - nparam - in);
1632 fprintf(out, "e%d", pos - 1 - nparam - dim);
1636 static void dump_constraint_sign(struct isl_basic_map *bmap, isl_int *c,
1637 int sign, FILE *out)
1641 unsigned len = 1 + isl_basic_map_total_dim(bmap);
1645 for (i = 0, first = 1; i < len; ++i) {
1646 if (isl_int_sgn(c[i]) * sign <= 0)
1649 fprintf(out, " + ");
1651 isl_int_abs(v, c[i]);
1652 dump_term(bmap, v, i, out);
1659 static void dump_constraint(struct isl_basic_map *bmap, isl_int *c,
1660 const char *op, FILE *out, int indent)
1664 fprintf(out, "%*s", indent, "");
1666 dump_constraint_sign(bmap, c, 1, out);
1667 fprintf(out, " %s ", op);
1668 dump_constraint_sign(bmap, c, -1, out);
1672 for (i = bmap->n_div; i < bmap->extra; ++i) {
1673 if (isl_int_is_zero(c[1+isl_dim_total(bmap->dim)+i]))
1675 fprintf(out, "%*s", indent, "");
1676 fprintf(out, "ERROR: unused div coefficient not zero\n");
1681 static void dump_constraints(struct isl_basic_map *bmap,
1682 isl_int **c, unsigned n,
1683 const char *op, FILE *out, int indent)
1687 for (i = 0; i < n; ++i)
1688 dump_constraint(bmap, c[i], op, out, indent);
1691 static void dump_affine(struct isl_basic_map *bmap, isl_int *exp, FILE *out)
1695 unsigned total = isl_basic_map_total_dim(bmap);
1697 for (j = 0; j < 1 + total; ++j) {
1698 if (isl_int_is_zero(exp[j]))
1700 if (!first && isl_int_is_pos(exp[j]))
1702 dump_term(bmap, exp[j], j, out);
1707 static void dump(struct isl_basic_map *bmap, FILE *out, int indent)
1711 dump_constraints(bmap, bmap->eq, bmap->n_eq, "=", out, indent);
1712 dump_constraints(bmap, bmap->ineq, bmap->n_ineq, ">=", out, indent);
1714 for (i = 0; i < bmap->n_div; ++i) {
1715 fprintf(out, "%*s", indent, "");
1716 fprintf(out, "e%d = [(", i);
1717 dump_affine(bmap, bmap->div[i]+1, out);
1719 isl_int_print(out, bmap->div[i][0], 0);
1720 fprintf(out, "]\n");
1724 void isl_basic_set_print_internal(struct isl_basic_set *bset,
1725 FILE *out, int indent)
1728 fprintf(out, "null basic set\n");
1732 fprintf(out, "%*s", indent, "");
1733 fprintf(out, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n",
1734 bset->ref, bset->dim->nparam, bset->dim->n_out,
1735 bset->extra, bset->flags);
1736 dump((struct isl_basic_map *)bset, out, indent);
1739 void isl_basic_map_print_internal(struct isl_basic_map *bmap,
1740 FILE *out, int indent)
1743 fprintf(out, "null basic map\n");
1747 fprintf(out, "%*s", indent, "");
1748 fprintf(out, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, "
1749 "flags: %x, n_name: %d\n",
1751 bmap->dim->nparam, bmap->dim->n_in, bmap->dim->n_out,
1752 bmap->extra, bmap->flags, bmap->dim->n_name);
1753 dump(bmap, out, indent);
1756 int isl_inequality_negate(struct isl_basic_map *bmap, unsigned pos)
1761 total = isl_basic_map_total_dim(bmap);
1762 isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
1763 isl_seq_neg(bmap->ineq[pos], bmap->ineq[pos], 1 + total);
1764 isl_int_sub_ui(bmap->ineq[pos][0], bmap->ineq[pos][0], 1);
1765 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1769 struct isl_set *isl_set_alloc_dim(struct isl_dim *dim, int n, unsigned flags)
1771 struct isl_set *set;
1775 isl_assert(dim->ctx, dim->n_in == 0, goto error);
1776 isl_assert(dim->ctx, n >= 0, goto error);
1777 set = isl_alloc(dim->ctx, struct isl_set,
1778 sizeof(struct isl_set) +
1779 (n - 1) * sizeof(struct isl_basic_set *));
1783 set->ctx = dim->ctx;
1784 isl_ctx_ref(set->ctx);
1796 struct isl_set *isl_set_alloc(struct isl_ctx *ctx,
1797 unsigned nparam, unsigned dim, int n, unsigned flags)
1799 struct isl_set *set;
1800 struct isl_dim *dims;
1802 dims = isl_dim_alloc(ctx, nparam, 0, dim);
1806 set = isl_set_alloc_dim(dims, n, flags);
1810 /* Make sure "map" has room for at least "n" more basic maps.
1812 struct isl_map *isl_map_grow(struct isl_map *map, int n)
1815 struct isl_map *grown = NULL;
1819 isl_assert(map->ctx, n >= 0, goto error);
1820 if (map->n + n <= map->size)
1822 grown = isl_map_alloc_dim(isl_map_get_dim(map), map->n + n, map->flags);
1825 for (i = 0; i < map->n; ++i) {
1826 grown->p[i] = isl_basic_map_copy(map->p[i]);
1834 isl_map_free(grown);
1839 /* Make sure "set" has room for at least "n" more basic sets.
1841 struct isl_set *isl_set_grow(struct isl_set *set, int n)
1843 return (struct isl_set *)isl_map_grow((struct isl_map *)set, n);
1846 struct isl_set *isl_set_dup(struct isl_set *set)
1849 struct isl_set *dup;
1854 dup = isl_set_alloc_dim(isl_dim_copy(set->dim), set->n, set->flags);
1857 for (i = 0; i < set->n; ++i)
1858 dup = isl_set_add_basic_set(dup, isl_basic_set_copy(set->p[i]));
1862 struct isl_set *isl_set_from_basic_set(struct isl_basic_set *bset)
1864 struct isl_set *set;
1869 set = isl_set_alloc_dim(isl_dim_copy(bset->dim), 1, ISL_MAP_DISJOINT);
1871 isl_basic_set_free(bset);
1874 return isl_set_add_basic_set(set, bset);
1877 struct isl_map *isl_map_from_basic_map(struct isl_basic_map *bmap)
1879 struct isl_map *map;
1884 map = isl_map_alloc_dim(isl_dim_copy(bmap->dim), 1, ISL_MAP_DISJOINT);
1886 isl_basic_map_free(bmap);
1889 return isl_map_add_basic_map(map, bmap);
1892 __isl_give isl_set *isl_set_add_basic_set(__isl_take isl_set *set,
1893 __isl_take isl_basic_set *bset)
1895 return (struct isl_set *)isl_map_add_basic_map((struct isl_map *)set,
1896 (struct isl_basic_map *)bset);
1899 void isl_set_free(struct isl_set *set)
1909 isl_ctx_deref(set->ctx);
1910 for (i = 0; i < set->n; ++i)
1911 isl_basic_set_free(set->p[i]);
1912 isl_dim_free(set->dim);
1916 void isl_set_print_internal(struct isl_set *set, FILE *out, int indent)
1921 fprintf(out, "null set\n");
1925 fprintf(out, "%*s", indent, "");
1926 fprintf(out, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
1927 set->ref, set->n, set->dim->nparam, set->dim->n_out,
1929 for (i = 0; i < set->n; ++i) {
1930 fprintf(out, "%*s", indent, "");
1931 fprintf(out, "basic set %d:\n", i);
1932 isl_basic_set_print_internal(set->p[i], out, indent+4);
1936 void isl_map_print_internal(struct isl_map *map, FILE *out, int indent)
1941 fprintf(out, "null map\n");
1945 fprintf(out, "%*s", indent, "");
1946 fprintf(out, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, "
1947 "flags: %x, n_name: %d\n",
1948 map->ref, map->n, map->dim->nparam, map->dim->n_in,
1949 map->dim->n_out, map->flags, map->dim->n_name);
1950 for (i = 0; i < map->n; ++i) {
1951 fprintf(out, "%*s", indent, "");
1952 fprintf(out, "basic map %d:\n", i);
1953 isl_basic_map_print_internal(map->p[i], out, indent+4);
1957 struct isl_basic_map *isl_basic_map_intersect_domain(
1958 struct isl_basic_map *bmap, struct isl_basic_set *bset)
1960 struct isl_basic_map *bmap_domain;
1961 struct isl_dim *dim;
1966 isl_assert(bset->ctx, isl_dim_match(bmap->dim, isl_dim_param,
1967 bset->dim, isl_dim_param), goto error);
1969 if (isl_dim_size(bset->dim, isl_dim_set) != 0)
1970 isl_assert(bset->ctx,
1971 isl_basic_map_compatible_domain(bmap, bset), goto error);
1973 bmap = isl_basic_map_cow(bmap);
1976 bmap = isl_basic_map_extend_dim(bmap, isl_dim_copy(bmap->dim),
1977 bset->n_div, bset->n_eq, bset->n_ineq);
1978 dim = isl_dim_reverse(isl_dim_copy(bset->dim));
1979 bmap_domain = isl_basic_map_from_basic_set(bset, dim);
1980 bmap = add_constraints(bmap, bmap_domain, 0, 0);
1982 bmap = isl_basic_map_simplify(bmap);
1983 return isl_basic_map_finalize(bmap);
1985 isl_basic_map_free(bmap);
1986 isl_basic_set_free(bset);
1990 struct isl_basic_map *isl_basic_map_intersect_range(
1991 struct isl_basic_map *bmap, struct isl_basic_set *bset)
1993 struct isl_basic_map *bmap_range;
1998 isl_assert(bset->ctx, isl_dim_match(bmap->dim, isl_dim_param,
1999 bset->dim, isl_dim_param), goto error);
2001 if (isl_dim_size(bset->dim, isl_dim_set) != 0)
2002 isl_assert(bset->ctx,
2003 isl_basic_map_compatible_range(bmap, bset), goto error);
2005 bmap = isl_basic_map_cow(bmap);
2008 bmap = isl_basic_map_extend_dim(bmap, isl_dim_copy(bmap->dim),
2009 bset->n_div, bset->n_eq, bset->n_ineq);
2010 bmap_range = isl_basic_map_from_basic_set(bset, isl_dim_copy(bset->dim));
2011 bmap = add_constraints(bmap, bmap_range, 0, 0);
2013 bmap = isl_basic_map_simplify(bmap);
2014 return isl_basic_map_finalize(bmap);
2016 isl_basic_map_free(bmap);
2017 isl_basic_set_free(bset);
2021 int isl_basic_map_contains(struct isl_basic_map *bmap, struct isl_vec *vec)
2027 total = 1 + isl_basic_map_total_dim(bmap);
2028 if (total != vec->size)
2033 for (i = 0; i < bmap->n_eq; ++i) {
2034 isl_seq_inner_product(vec->el, bmap->eq[i], total, &s);
2035 if (!isl_int_is_zero(s)) {
2041 for (i = 0; i < bmap->n_ineq; ++i) {
2042 isl_seq_inner_product(vec->el, bmap->ineq[i], total, &s);
2043 if (isl_int_is_neg(s)) {
2054 int isl_basic_set_contains(struct isl_basic_set *bset, struct isl_vec *vec)
2056 return isl_basic_map_contains((struct isl_basic_map *)bset, vec);
2059 struct isl_basic_map *isl_basic_map_intersect(
2060 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2062 struct isl_vec *sample = NULL;
2064 if (!bmap1 || !bmap2)
2067 isl_assert(bmap1->ctx, isl_dim_match(bmap1->dim, isl_dim_param,
2068 bmap2->dim, isl_dim_param), goto error);
2069 if (isl_dim_total(bmap1->dim) ==
2070 isl_dim_size(bmap1->dim, isl_dim_param) &&
2071 isl_dim_total(bmap2->dim) !=
2072 isl_dim_size(bmap2->dim, isl_dim_param))
2073 return isl_basic_map_intersect(bmap2, bmap1);
2075 if (isl_dim_total(bmap2->dim) !=
2076 isl_dim_size(bmap2->dim, isl_dim_param))
2077 isl_assert(bmap1->ctx,
2078 isl_dim_equal(bmap1->dim, bmap2->dim), goto error);
2080 if (bmap1->sample &&
2081 isl_basic_map_contains(bmap1, bmap1->sample) > 0 &&
2082 isl_basic_map_contains(bmap2, bmap1->sample) > 0)
2083 sample = isl_vec_copy(bmap1->sample);
2084 else if (bmap2->sample &&
2085 isl_basic_map_contains(bmap1, bmap2->sample) > 0 &&
2086 isl_basic_map_contains(bmap2, bmap2->sample) > 0)
2087 sample = isl_vec_copy(bmap2->sample);
2089 bmap1 = isl_basic_map_cow(bmap1);
2092 bmap1 = isl_basic_map_extend_dim(bmap1, isl_dim_copy(bmap1->dim),
2093 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
2094 bmap1 = add_constraints(bmap1, bmap2, 0, 0);
2097 isl_vec_free(sample);
2099 isl_vec_free(bmap1->sample);
2100 bmap1->sample = sample;
2103 bmap1 = isl_basic_map_simplify(bmap1);
2104 return isl_basic_map_finalize(bmap1);
2107 isl_vec_free(sample);
2108 isl_basic_map_free(bmap1);
2109 isl_basic_map_free(bmap2);
2113 struct isl_basic_set *isl_basic_set_intersect(
2114 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
2116 return (struct isl_basic_set *)
2117 isl_basic_map_intersect(
2118 (struct isl_basic_map *)bset1,
2119 (struct isl_basic_map *)bset2);
2122 /* Special case of isl_map_intersect, where both map1 and map2
2123 * are convex, without any divs and such that either map1 or map2
2124 * contains a single constraint. This constraint is then simply
2125 * added to the other map.
2127 static __isl_give isl_map *map_intersect_add_constraint(
2128 __isl_take isl_map *map1, __isl_take isl_map *map2)
2130 struct isl_basic_map *bmap1;
2131 struct isl_basic_map *bmap2;
2133 isl_assert(map1->ctx, map1->n == 1, goto error);
2134 isl_assert(map2->ctx, map1->n == 1, goto error);
2135 isl_assert(map1->ctx, map1->p[0]->n_div == 0, goto error);
2136 isl_assert(map2->ctx, map1->p[0]->n_div == 0, goto error);
2138 if (map2->p[0]->n_eq + map2->p[0]->n_ineq != 1)
2139 return isl_map_intersect(map2, map1);
2141 isl_assert(map2->ctx,
2142 map2->p[0]->n_eq + map2->p[0]->n_ineq == 1, goto error);
2144 map1 = isl_map_cow(map1);
2147 if (isl_map_fast_is_empty(map1)) {
2151 map1->p[0] = isl_basic_map_cow(map1->p[0]);
2152 if (map2->p[0]->n_eq == 1)
2153 map1->p[0] = isl_basic_map_add_eq(map1->p[0], map2->p[0]->eq[0]);
2155 map1->p[0] = isl_basic_map_add_ineq(map1->p[0],
2156 map2->p[0]->ineq[0]);
2158 map1->p[0] = isl_basic_map_simplify(map1->p[0]);
2159 map1->p[0] = isl_basic_map_finalize(map1->p[0]);
2163 if (isl_basic_map_fast_is_empty(map1->p[0])) {
2164 isl_basic_map_free(map1->p[0]);
2177 struct isl_map *isl_map_intersect(struct isl_map *map1, struct isl_map *map2)
2180 struct isl_map *result;
2186 if (isl_map_fast_is_empty(map1)) {
2190 if (isl_map_fast_is_empty(map2)) {
2195 if (map1->n == 1 && map2->n == 1 &&
2196 map1->p[0]->n_div == 0 && map2->p[0]->n_div == 0 &&
2197 isl_dim_equal(map1->dim, map2->dim) &&
2198 (map1->p[0]->n_eq + map1->p[0]->n_ineq == 1 ||
2199 map2->p[0]->n_eq + map2->p[0]->n_ineq == 1))
2200 return map_intersect_add_constraint(map1, map2);
2201 isl_assert(map1->ctx, isl_dim_match(map1->dim, isl_dim_param,
2202 map2->dim, isl_dim_param), goto error);
2203 if (isl_dim_total(map1->dim) ==
2204 isl_dim_size(map1->dim, isl_dim_param) &&
2205 isl_dim_total(map2->dim) != isl_dim_size(map2->dim, isl_dim_param))
2206 return isl_map_intersect(map2, map1);
2208 if (isl_dim_total(map2->dim) != isl_dim_size(map2->dim, isl_dim_param))
2209 isl_assert(map1->ctx,
2210 isl_dim_equal(map1->dim, map2->dim), goto error);
2212 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
2213 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
2214 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
2216 result = isl_map_alloc_dim(isl_dim_copy(map1->dim),
2217 map1->n * map2->n, flags);
2220 for (i = 0; i < map1->n; ++i)
2221 for (j = 0; j < map2->n; ++j) {
2222 struct isl_basic_map *part;
2223 part = isl_basic_map_intersect(
2224 isl_basic_map_copy(map1->p[i]),
2225 isl_basic_map_copy(map2->p[j]));
2226 if (isl_basic_map_is_empty(part))
2227 isl_basic_map_free(part);
2229 result = isl_map_add_basic_map(result, part);
2242 struct isl_set *isl_set_intersect(struct isl_set *set1, struct isl_set *set2)
2244 return (struct isl_set *)
2245 isl_map_intersect((struct isl_map *)set1,
2246 (struct isl_map *)set2);
2249 struct isl_basic_map *isl_basic_map_reverse(struct isl_basic_map *bmap)
2251 struct isl_dim *dim;
2252 struct isl_basic_set *bset;
2257 bmap = isl_basic_map_cow(bmap);
2260 dim = isl_dim_reverse(isl_dim_copy(bmap->dim));
2261 in = isl_basic_map_n_in(bmap);
2262 bset = isl_basic_set_from_basic_map(bmap);
2263 bset = isl_basic_set_swap_vars(bset, in);
2264 return isl_basic_map_from_basic_set(bset, dim);
2267 __isl_give isl_basic_map *isl_basic_map_insert(__isl_take isl_basic_map *bmap,
2268 enum isl_dim_type type, unsigned pos, unsigned n)
2270 struct isl_dim *res_dim;
2271 struct isl_basic_map *res;
2272 struct isl_dim_map *dim_map;
2273 unsigned total, off;
2274 enum isl_dim_type t;
2282 res_dim = isl_dim_insert(isl_basic_map_get_dim(bmap), type, pos, n);
2284 total = isl_basic_map_total_dim(bmap) + n;
2285 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2287 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
2289 isl_dim_map_dim(dim_map, bmap->dim, t, off);
2291 unsigned size = isl_basic_map_dim(bmap, t);
2292 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2294 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2295 pos, size - pos, off + pos + n);
2297 off += isl_dim_size(res_dim, t);
2299 isl_dim_map_div(dim_map, bmap, off);
2301 res = isl_basic_map_alloc_dim(res_dim,
2302 bmap->n_div, bmap->n_eq, bmap->n_ineq);
2303 res = add_constraints_dim_map(res, bmap, dim_map);
2304 res = isl_basic_map_simplify(res);
2305 return isl_basic_map_finalize(res);
2308 __isl_give isl_basic_map *isl_basic_map_add(__isl_take isl_basic_map *bmap,
2309 enum isl_dim_type type, unsigned n)
2313 return isl_basic_map_insert(bmap, type,
2314 isl_basic_map_dim(bmap, type), n);
2317 __isl_give isl_basic_set *isl_basic_set_add(__isl_take isl_basic_set *bset,
2318 enum isl_dim_type type, unsigned n)
2322 isl_assert(bset->ctx, type != isl_dim_in, goto error);
2323 return (isl_basic_set *)isl_basic_map_add((isl_basic_map *)bset, type, n);
2325 isl_basic_set_free(bset);
2329 __isl_give isl_map *isl_map_insert(__isl_take isl_map *map,
2330 enum isl_dim_type type, unsigned pos, unsigned n)
2337 map = isl_map_cow(map);
2341 map->dim = isl_dim_insert(map->dim, type, pos, n);
2345 for (i = 0; i < map->n; ++i) {
2346 map->p[i] = isl_basic_map_insert(map->p[i], type, pos, n);
2357 __isl_give isl_set *isl_set_insert(__isl_take isl_set *set,
2358 enum isl_dim_type type, unsigned pos, unsigned n)
2360 return (isl_set *)isl_map_insert((isl_map *)set, type, pos, n);
2363 __isl_give isl_map *isl_map_add_dims(__isl_take isl_map *map,
2364 enum isl_dim_type type, unsigned n)
2368 return isl_map_insert(map, type, isl_map_dim(map, type), n);
2371 __isl_give isl_set *isl_set_add_dims(__isl_take isl_set *set,
2372 enum isl_dim_type type, unsigned n)
2376 isl_assert(set->ctx, type != isl_dim_in, goto error);
2377 return (isl_set *)isl_map_add_dims((isl_map *)set, type, n);
2383 __isl_give isl_basic_map *isl_basic_map_move_dims(
2384 __isl_take isl_basic_map *bmap,
2385 enum isl_dim_type dst_type, unsigned dst_pos,
2386 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2389 struct isl_dim_map *dim_map;
2390 struct isl_basic_map *res;
2391 enum isl_dim_type t;
2392 unsigned total, off;
2399 isl_assert(bmap->ctx, src_pos + n <= isl_basic_map_dim(bmap, src_type),
2402 if (dst_type == src_type && dst_pos == src_pos)
2405 isl_assert(bmap->ctx, dst_type != src_type, goto error);
2407 if (pos(bmap->dim, dst_type) + dst_pos ==
2408 pos(bmap->dim, src_type) + src_pos +
2409 ((src_type < dst_type) ? n : 0)) {
2410 bmap = isl_basic_map_cow(bmap);
2414 bmap->dim = isl_dim_move(bmap->dim, dst_type, dst_pos,
2415 src_type, src_pos, n);
2419 bmap = isl_basic_map_finalize(bmap);
2424 total = isl_basic_map_total_dim(bmap);
2425 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2428 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
2429 unsigned size = isl_dim_size(bmap->dim, t);
2430 if (t == dst_type) {
2431 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2434 isl_dim_map_dim_range(dim_map, bmap->dim, src_type,
2437 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2438 dst_pos, size - dst_pos, off);
2439 off += size - dst_pos;
2440 } else if (t == src_type) {
2441 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2444 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2445 src_pos + n, size - src_pos - n, off);
2446 off += size - src_pos - n;
2448 isl_dim_map_dim(dim_map, bmap->dim, t, off);
2452 isl_dim_map_div(dim_map, bmap, off);
2454 res = isl_basic_map_alloc_dim(isl_basic_map_get_dim(bmap),
2455 bmap->n_div, bmap->n_eq, bmap->n_ineq);
2456 bmap = add_constraints_dim_map(res, bmap, dim_map);
2458 bmap->dim = isl_dim_move(bmap->dim, dst_type, dst_pos,
2459 src_type, src_pos, n);
2463 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
2464 bmap = isl_basic_map_gauss(bmap, NULL);
2465 bmap = isl_basic_map_finalize(bmap);
2469 isl_basic_map_free(bmap);
2473 __isl_give isl_basic_set *isl_basic_set_move_dims(__isl_take isl_basic_set *bset,
2474 enum isl_dim_type dst_type, unsigned dst_pos,
2475 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2477 return (isl_basic_set *)isl_basic_map_move_dims(
2478 (isl_basic_map *)bset, dst_type, dst_pos, src_type, src_pos, n);
2481 __isl_give isl_set *isl_set_move_dims(__isl_take isl_set *set,
2482 enum isl_dim_type dst_type, unsigned dst_pos,
2483 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2487 isl_assert(set->ctx, dst_type != isl_dim_in, goto error);
2488 return (isl_set *)isl_map_move_dims((isl_map *)set, dst_type, dst_pos,
2489 src_type, src_pos, n);
2495 __isl_give isl_map *isl_map_move_dims(__isl_take isl_map *map,
2496 enum isl_dim_type dst_type, unsigned dst_pos,
2497 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2506 isl_assert(map->ctx, src_pos + n <= isl_map_dim(map, src_type),
2509 if (dst_type == src_type && dst_pos == src_pos)
2512 isl_assert(map->ctx, dst_type != src_type, goto error);
2514 map = isl_map_cow(map);
2518 map->dim = isl_dim_move(map->dim, dst_type, dst_pos, src_type, src_pos, n);
2522 for (i = 0; i < map->n; ++i) {
2523 map->p[i] = isl_basic_map_move_dims(map->p[i],
2525 src_type, src_pos, n);
2536 /* Move the specified dimensions to the last columns right before
2537 * the divs. Don't change the dimension specification of bmap.
2538 * That's the responsibility of the caller.
2540 static __isl_give isl_basic_map *move_last(__isl_take isl_basic_map *bmap,
2541 enum isl_dim_type type, unsigned first, unsigned n)
2543 struct isl_dim_map *dim_map;
2544 struct isl_basic_map *res;
2545 enum isl_dim_type t;
2546 unsigned total, off;
2550 if (pos(bmap->dim, type) + first + n == 1 + isl_dim_total(bmap->dim))
2553 total = isl_basic_map_total_dim(bmap);
2554 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2557 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
2558 unsigned size = isl_dim_size(bmap->dim, t);
2560 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2563 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2564 first, n, total - bmap->n_div - n);
2565 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2566 first + n, size - (first + n), off);
2567 off += size - (first + n);
2569 isl_dim_map_dim(dim_map, bmap->dim, t, off);
2573 isl_dim_map_div(dim_map, bmap, off + n);
2575 res = isl_basic_map_alloc_dim(isl_basic_map_get_dim(bmap),
2576 bmap->n_div, bmap->n_eq, bmap->n_ineq);
2577 res = add_constraints_dim_map(res, bmap, dim_map);
2581 /* Turn the n dimensions of type type, starting at first
2582 * into existentially quantified variables.
2584 __isl_give isl_basic_map *isl_basic_map_project_out(
2585 __isl_take isl_basic_map *bmap,
2586 enum isl_dim_type type, unsigned first, unsigned n)
2599 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL))
2600 return isl_basic_map_remove_dims(bmap, type, first, n);
2602 isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
2605 bmap = move_last(bmap, type, first, n);
2606 bmap = isl_basic_map_cow(bmap);
2610 row_size = 1 + isl_dim_total(bmap->dim) + bmap->extra;
2611 old = bmap->block2.data;
2612 bmap->block2 = isl_blk_extend(bmap->ctx, bmap->block2,
2613 (bmap->extra + n) * (1 + row_size));
2614 if (!bmap->block2.data)
2616 new_div = isl_alloc_array(bmap->ctx, isl_int *, bmap->extra + n);
2619 for (i = 0; i < n; ++i) {
2620 new_div[i] = bmap->block2.data +
2621 (bmap->extra + i) * (1 + row_size);
2622 isl_seq_clr(new_div[i], 1 + row_size);
2624 for (i = 0; i < bmap->extra; ++i)
2625 new_div[n + i] = bmap->block2.data + (bmap->div[i] - old);
2627 bmap->div = new_div;
2631 bmap->dim = isl_dim_drop(bmap->dim, type, first, n);
2634 bmap = isl_basic_map_simplify(bmap);
2635 bmap = isl_basic_map_drop_redundant_divs(bmap);
2636 return isl_basic_map_finalize(bmap);
2638 isl_basic_map_free(bmap);
2642 /* Turn the n dimensions of type type, starting at first
2643 * into existentially quantified variables.
2645 struct isl_basic_set *isl_basic_set_project_out(struct isl_basic_set *bset,
2646 enum isl_dim_type type, unsigned first, unsigned n)
2648 return (isl_basic_set *)isl_basic_map_project_out(
2649 (isl_basic_map *)bset, type, first, n);
2652 /* Turn the n dimensions of type type, starting at first
2653 * into existentially quantified variables.
2655 __isl_give isl_map *isl_map_project_out(__isl_take isl_map *map,
2656 enum isl_dim_type type, unsigned first, unsigned n)
2666 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
2668 map = isl_map_cow(map);
2672 map->dim = isl_dim_drop(map->dim, type, first, n);
2676 for (i = 0; i < map->n; ++i) {
2677 map->p[i] = isl_basic_map_project_out(map->p[i], type, first, n);
2688 /* Turn the n dimensions of type type, starting at first
2689 * into existentially quantified variables.
2691 __isl_give isl_set *isl_set_project_out(__isl_take isl_set *set,
2692 enum isl_dim_type type, unsigned first, unsigned n)
2694 return (isl_set *)isl_map_project_out((isl_map *)set, type, first, n);
2697 static struct isl_basic_map *add_divs(struct isl_basic_map *bmap, unsigned n)
2701 for (i = 0; i < n; ++i) {
2702 j = isl_basic_map_alloc_div(bmap);
2705 isl_seq_clr(bmap->div[j], 1+1+isl_basic_map_total_dim(bmap));
2709 isl_basic_map_free(bmap);
2713 struct isl_basic_map *isl_basic_map_apply_range(
2714 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2716 struct isl_dim *dim_result = NULL;
2717 struct isl_basic_map *bmap;
2718 unsigned n_in, n_out, n, nparam, total, pos;
2719 struct isl_dim_map *dim_map1, *dim_map2;
2721 if (!bmap1 || !bmap2)
2724 dim_result = isl_dim_join(isl_dim_copy(bmap1->dim),
2725 isl_dim_copy(bmap2->dim));
2727 n_in = isl_basic_map_n_in(bmap1);
2728 n_out = isl_basic_map_n_out(bmap2);
2729 n = isl_basic_map_n_out(bmap1);
2730 nparam = isl_basic_map_n_param(bmap1);
2732 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + n;
2733 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
2734 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
2735 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
2736 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
2737 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
2738 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_in);
2739 isl_dim_map_div(dim_map1, bmap1, pos += n_out);
2740 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
2741 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
2742 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
2744 bmap = isl_basic_map_alloc_dim(dim_result,
2745 bmap1->n_div + bmap2->n_div + n,
2746 bmap1->n_eq + bmap2->n_eq,
2747 bmap1->n_ineq + bmap2->n_ineq);
2748 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
2749 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
2750 bmap = add_divs(bmap, n);
2751 bmap = isl_basic_map_simplify(bmap);
2752 bmap = isl_basic_map_drop_redundant_divs(bmap);
2753 return isl_basic_map_finalize(bmap);
2755 isl_basic_map_free(bmap1);
2756 isl_basic_map_free(bmap2);
2760 struct isl_basic_set *isl_basic_set_apply(
2761 struct isl_basic_set *bset, struct isl_basic_map *bmap)
2766 isl_assert(bset->ctx, isl_basic_map_compatible_domain(bmap, bset),
2769 return (struct isl_basic_set *)
2770 isl_basic_map_apply_range((struct isl_basic_map *)bset, bmap);
2772 isl_basic_set_free(bset);
2773 isl_basic_map_free(bmap);
2777 struct isl_basic_map *isl_basic_map_apply_domain(
2778 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2780 if (!bmap1 || !bmap2)
2783 isl_assert(bmap1->ctx,
2784 isl_basic_map_n_in(bmap1) == isl_basic_map_n_in(bmap2), goto error);
2785 isl_assert(bmap1->ctx,
2786 isl_basic_map_n_param(bmap1) == isl_basic_map_n_param(bmap2),
2789 bmap1 = isl_basic_map_reverse(bmap1);
2790 bmap1 = isl_basic_map_apply_range(bmap1, bmap2);
2791 return isl_basic_map_reverse(bmap1);
2793 isl_basic_map_free(bmap1);
2794 isl_basic_map_free(bmap2);
2798 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
2799 * A \cap B -> f(A) + f(B)
2801 struct isl_basic_map *isl_basic_map_sum(
2802 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2804 unsigned n_in, n_out, nparam, total, pos;
2805 struct isl_basic_map *bmap = NULL;
2806 struct isl_dim_map *dim_map1, *dim_map2;
2809 if (!bmap1 || !bmap2)
2812 isl_assert(bmap1->ctx, isl_dim_equal(bmap1->dim, bmap2->dim),
2815 nparam = isl_basic_map_n_param(bmap1);
2816 n_in = isl_basic_map_n_in(bmap1);
2817 n_out = isl_basic_map_n_out(bmap1);
2819 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + 2 * n_out;
2820 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
2821 dim_map2 = isl_dim_map_alloc(bmap2->ctx, total);
2822 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
2823 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos);
2824 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
2825 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
2826 isl_dim_map_div(dim_map1, bmap1, pos += n_in + n_out);
2827 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
2828 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
2829 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_out);
2831 bmap = isl_basic_map_alloc_dim(isl_dim_copy(bmap1->dim),
2832 bmap1->n_div + bmap2->n_div + 2 * n_out,
2833 bmap1->n_eq + bmap2->n_eq + n_out,
2834 bmap1->n_ineq + bmap2->n_ineq);
2835 for (i = 0; i < n_out; ++i) {
2836 int j = isl_basic_map_alloc_equality(bmap);
2839 isl_seq_clr(bmap->eq[j], 1+total);
2840 isl_int_set_si(bmap->eq[j][1+nparam+n_in+i], -1);
2841 isl_int_set_si(bmap->eq[j][1+pos+i], 1);
2842 isl_int_set_si(bmap->eq[j][1+pos-n_out+i], 1);
2844 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
2845 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
2846 bmap = add_divs(bmap, 2 * n_out);
2848 bmap = isl_basic_map_simplify(bmap);
2849 return isl_basic_map_finalize(bmap);
2851 isl_basic_map_free(bmap);
2852 isl_basic_map_free(bmap1);
2853 isl_basic_map_free(bmap2);
2857 /* Given two maps A -> f(A) and B -> g(B), construct a map
2858 * A \cap B -> f(A) + f(B)
2860 struct isl_map *isl_map_sum(struct isl_map *map1, struct isl_map *map2)
2862 struct isl_map *result;
2868 isl_assert(map1->ctx, isl_dim_equal(map1->dim, map2->dim), goto error);
2870 result = isl_map_alloc_dim(isl_dim_copy(map1->dim),
2871 map1->n * map2->n, 0);
2874 for (i = 0; i < map1->n; ++i)
2875 for (j = 0; j < map2->n; ++j) {
2876 struct isl_basic_map *part;
2877 part = isl_basic_map_sum(
2878 isl_basic_map_copy(map1->p[i]),
2879 isl_basic_map_copy(map2->p[j]));
2880 if (isl_basic_map_is_empty(part))
2881 isl_basic_map_free(part);
2883 result = isl_map_add_basic_map(result, part);
2896 __isl_give isl_set *isl_set_sum(__isl_take isl_set *set1,
2897 __isl_take isl_set *set2)
2899 return (isl_set *)isl_map_sum((isl_map *)set1, (isl_map *)set2);
2902 /* Given a basic map A -> f(A), construct A -> -f(A).
2904 struct isl_basic_map *isl_basic_map_neg(struct isl_basic_map *bmap)
2909 bmap = isl_basic_map_cow(bmap);
2913 n = isl_basic_map_dim(bmap, isl_dim_out);
2914 off = isl_basic_map_offset(bmap, isl_dim_out);
2915 for (i = 0; i < bmap->n_eq; ++i)
2916 for (j = 0; j < n; ++j)
2917 isl_int_neg(bmap->eq[i][off+j], bmap->eq[i][off+j]);
2918 for (i = 0; i < bmap->n_ineq; ++i)
2919 for (j = 0; j < n; ++j)
2920 isl_int_neg(bmap->ineq[i][off+j], bmap->ineq[i][off+j]);
2921 for (i = 0; i < bmap->n_div; ++i)
2922 for (j = 0; j < n; ++j)
2923 isl_int_neg(bmap->div[i][1+off+j], bmap->div[i][1+off+j]);
2924 return isl_basic_map_finalize(bmap);
2927 /* Given a map A -> f(A), construct A -> -f(A).
2929 struct isl_map *isl_map_neg(struct isl_map *map)
2933 map = isl_map_cow(map);
2937 for (i = 0; i < map->n; ++i) {
2938 map->p[i] = isl_basic_map_neg(map->p[i]);
2949 __isl_give isl_set *isl_set_neg(__isl_take isl_set *set)
2951 return (isl_set *)isl_map_neg((isl_map *)set);
2954 /* Given a basic map A -> f(A) and an integer d, construct a basic map
2955 * A -> floor(f(A)/d).
2957 struct isl_basic_map *isl_basic_map_floordiv(struct isl_basic_map *bmap,
2960 unsigned n_in, n_out, nparam, total, pos;
2961 struct isl_basic_map *result = NULL;
2962 struct isl_dim_map *dim_map;
2968 nparam = isl_basic_map_n_param(bmap);
2969 n_in = isl_basic_map_n_in(bmap);
2970 n_out = isl_basic_map_n_out(bmap);
2972 total = nparam + n_in + n_out + bmap->n_div + n_out;
2973 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2974 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_param, pos = 0);
2975 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_in, pos += nparam);
2976 isl_dim_map_div(dim_map, bmap, pos += n_in + n_out);
2977 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_out, pos += bmap->n_div);
2979 result = isl_basic_map_alloc_dim(isl_dim_copy(bmap->dim),
2980 bmap->n_div + n_out,
2981 bmap->n_eq, bmap->n_ineq + 2 * n_out);
2982 result = add_constraints_dim_map(result, bmap, dim_map);
2983 result = add_divs(result, n_out);
2984 for (i = 0; i < n_out; ++i) {
2986 j = isl_basic_map_alloc_inequality(result);
2989 isl_seq_clr(result->ineq[j], 1+total);
2990 isl_int_neg(result->ineq[j][1+nparam+n_in+i], d);
2991 isl_int_set_si(result->ineq[j][1+pos+i], 1);
2992 j = isl_basic_map_alloc_inequality(result);
2995 isl_seq_clr(result->ineq[j], 1+total);
2996 isl_int_set(result->ineq[j][1+nparam+n_in+i], d);
2997 isl_int_set_si(result->ineq[j][1+pos+i], -1);
2998 isl_int_sub_ui(result->ineq[j][0], d, 1);
3001 result = isl_basic_map_simplify(result);
3002 return isl_basic_map_finalize(result);
3004 isl_basic_map_free(result);
3008 /* Given a map A -> f(A) and an integer d, construct a map
3009 * A -> floor(f(A)/d).
3011 struct isl_map *isl_map_floordiv(struct isl_map *map, isl_int d)
3015 map = isl_map_cow(map);
3019 ISL_F_CLR(map, ISL_MAP_DISJOINT);
3020 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3021 for (i = 0; i < map->n; ++i) {
3022 map->p[i] = isl_basic_map_floordiv(map->p[i], d);
3033 static struct isl_basic_map *var_equal(struct isl_basic_map *bmap, unsigned pos)
3039 i = isl_basic_map_alloc_equality(bmap);
3042 nparam = isl_basic_map_n_param(bmap);
3043 n_in = isl_basic_map_n_in(bmap);
3044 isl_seq_clr(bmap->eq[i], 1 + isl_basic_map_total_dim(bmap));
3045 isl_int_set_si(bmap->eq[i][1+nparam+pos], -1);
3046 isl_int_set_si(bmap->eq[i][1+nparam+n_in+pos], 1);
3047 return isl_basic_map_finalize(bmap);
3049 isl_basic_map_free(bmap);
3053 /* Add a constraints to "bmap" expressing i_pos < o_pos
3055 static struct isl_basic_map *var_less(struct isl_basic_map *bmap, unsigned pos)
3061 i = isl_basic_map_alloc_inequality(bmap);
3064 nparam = isl_basic_map_n_param(bmap);
3065 n_in = isl_basic_map_n_in(bmap);
3066 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
3067 isl_int_set_si(bmap->ineq[i][0], -1);
3068 isl_int_set_si(bmap->ineq[i][1+nparam+pos], -1);
3069 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], 1);
3070 return isl_basic_map_finalize(bmap);
3072 isl_basic_map_free(bmap);
3076 /* Add a constraint to "bmap" expressing i_pos <= o_pos
3078 static __isl_give isl_basic_map *var_less_or_equal(
3079 __isl_take isl_basic_map *bmap, unsigned pos)
3085 i = isl_basic_map_alloc_inequality(bmap);
3088 nparam = isl_basic_map_n_param(bmap);
3089 n_in = isl_basic_map_n_in(bmap);
3090 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
3091 isl_int_set_si(bmap->ineq[i][1+nparam+pos], -1);
3092 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], 1);
3093 return isl_basic_map_finalize(bmap);
3095 isl_basic_map_free(bmap);
3099 /* Add a constraints to "bmap" expressing i_pos > o_pos
3101 static struct isl_basic_map *var_more(struct isl_basic_map *bmap, unsigned pos)
3107 i = isl_basic_map_alloc_inequality(bmap);
3110 nparam = isl_basic_map_n_param(bmap);
3111 n_in = isl_basic_map_n_in(bmap);
3112 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
3113 isl_int_set_si(bmap->ineq[i][0], -1);
3114 isl_int_set_si(bmap->ineq[i][1+nparam+pos], 1);
3115 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], -1);
3116 return isl_basic_map_finalize(bmap);
3118 isl_basic_map_free(bmap);
3122 /* Add a constraint to "bmap" expressing i_pos >= o_pos
3124 static __isl_give isl_basic_map *var_more_or_equal(
3125 __isl_take isl_basic_map *bmap, unsigned pos)
3131 i = isl_basic_map_alloc_inequality(bmap);
3134 nparam = isl_basic_map_n_param(bmap);
3135 n_in = isl_basic_map_n_in(bmap);
3136 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
3137 isl_int_set_si(bmap->ineq[i][1+nparam+pos], 1);
3138 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], -1);
3139 return isl_basic_map_finalize(bmap);
3141 isl_basic_map_free(bmap);
3145 struct isl_basic_map *isl_basic_map_equal(struct isl_dim *dim, unsigned n_equal)
3148 struct isl_basic_map *bmap;
3149 bmap = isl_basic_map_alloc_dim(dim, 0, n_equal, 0);
3152 for (i = 0; i < n_equal && bmap; ++i)
3153 bmap = var_equal(bmap, i);
3154 return isl_basic_map_finalize(bmap);
3157 /* Return a relation on of dimension "dim" expressing i_[0..pos] << o_[0..pos]
3159 struct isl_basic_map *isl_basic_map_less_at(struct isl_dim *dim, unsigned pos)
3162 struct isl_basic_map *bmap;
3163 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
3166 for (i = 0; i < pos && bmap; ++i)
3167 bmap = var_equal(bmap, i);
3169 bmap = var_less(bmap, pos);
3170 return isl_basic_map_finalize(bmap);
3173 /* Return a relation on of dimension "dim" expressing i_[0..pos] <<= o_[0..pos]
3175 __isl_give isl_basic_map *isl_basic_map_less_or_equal_at(
3176 __isl_take isl_dim *dim, unsigned pos)
3179 isl_basic_map *bmap;
3181 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
3182 for (i = 0; i < pos; ++i)
3183 bmap = var_equal(bmap, i);
3184 bmap = var_less_or_equal(bmap, pos);
3185 return isl_basic_map_finalize(bmap);
3188 /* Return a relation on pairs of sets of dimension "dim" expressing i_pos > o_pos
3190 struct isl_basic_map *isl_basic_map_more_at(struct isl_dim *dim, unsigned pos)
3193 struct isl_basic_map *bmap;
3194 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
3197 for (i = 0; i < pos && bmap; ++i)
3198 bmap = var_equal(bmap, i);
3200 bmap = var_more(bmap, pos);
3201 return isl_basic_map_finalize(bmap);
3204 /* Return a relation on of dimension "dim" expressing i_[0..pos] >>= o_[0..pos]
3206 __isl_give isl_basic_map *isl_basic_map_more_or_equal_at(
3207 __isl_take isl_dim *dim, unsigned pos)
3210 isl_basic_map *bmap;
3212 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
3213 for (i = 0; i < pos; ++i)
3214 bmap = var_equal(bmap, i);
3215 bmap = var_more_or_equal(bmap, pos);
3216 return isl_basic_map_finalize(bmap);
3219 static __isl_give isl_map *map_lex_lte_first(__isl_take isl_dim *dims,
3220 unsigned n, int equal)
3222 struct isl_map *map;
3225 if (n == 0 && equal)
3226 return isl_map_universe(dims);
3228 map = isl_map_alloc_dim(isl_dim_copy(dims), n, ISL_MAP_DISJOINT);
3230 for (i = 0; i + 1 < n; ++i)
3231 map = isl_map_add_basic_map(map,
3232 isl_basic_map_less_at(isl_dim_copy(dims), i));
3235 map = isl_map_add_basic_map(map,
3236 isl_basic_map_less_or_equal_at(dims, n - 1));
3238 map = isl_map_add_basic_map(map,
3239 isl_basic_map_less_at(dims, n - 1));
3246 static __isl_give isl_map *map_lex_lte(__isl_take isl_dim *dims, int equal)
3250 return map_lex_lte_first(dims, dims->n_out, equal);
3253 __isl_give isl_map *isl_map_lex_lt_first(__isl_take isl_dim *dim, unsigned n)
3255 return map_lex_lte_first(dim, n, 0);
3258 __isl_give isl_map *isl_map_lex_le_first(__isl_take isl_dim *dim, unsigned n)
3260 return map_lex_lte_first(dim, n, 1);
3263 __isl_give isl_map *isl_map_lex_lt(__isl_take isl_dim *set_dim)
3265 return map_lex_lte(isl_dim_map(set_dim), 0);
3268 __isl_give isl_map *isl_map_lex_le(__isl_take isl_dim *set_dim)
3270 return map_lex_lte(isl_dim_map(set_dim), 1);
3273 static __isl_give isl_map *map_lex_gte_first(__isl_take isl_dim *dims,
3274 unsigned n, int equal)
3276 struct isl_map *map;
3279 if (n == 0 && equal)
3280 return isl_map_universe(dims);
3282 map = isl_map_alloc_dim(isl_dim_copy(dims), n, ISL_MAP_DISJOINT);
3284 for (i = 0; i + 1 < n; ++i)
3285 map = isl_map_add_basic_map(map,
3286 isl_basic_map_more_at(isl_dim_copy(dims), i));
3289 map = isl_map_add_basic_map(map,
3290 isl_basic_map_more_or_equal_at(dims, n - 1));
3292 map = isl_map_add_basic_map(map,
3293 isl_basic_map_more_at(dims, n - 1));
3300 static __isl_give isl_map *map_lex_gte(__isl_take isl_dim *dims, int equal)
3304 return map_lex_gte_first(dims, dims->n_out, equal);
3307 __isl_give isl_map *isl_map_lex_gt_first(__isl_take isl_dim *dim, unsigned n)
3309 return map_lex_gte_first(dim, n, 0);
3312 __isl_give isl_map *isl_map_lex_ge_first(__isl_take isl_dim *dim, unsigned n)
3314 return map_lex_gte_first(dim, n, 1);
3317 __isl_give isl_map *isl_map_lex_gt(__isl_take isl_dim *set_dim)
3319 return map_lex_gte(isl_dim_map(set_dim), 0);
3322 __isl_give isl_map *isl_map_lex_ge(__isl_take isl_dim *set_dim)
3324 return map_lex_gte(isl_dim_map(set_dim), 1);
3327 __isl_give isl_map *isl_set_lex_le_set(__isl_take isl_set *set1,
3328 __isl_take isl_set *set2)
3331 map = isl_map_lex_le(isl_set_get_dim(set1));
3332 map = isl_map_intersect_domain(map, set1);
3333 map = isl_map_intersect_range(map, set2);
3337 __isl_give isl_map *isl_set_lex_lt_set(__isl_take isl_set *set1,
3338 __isl_take isl_set *set2)
3341 map = isl_map_lex_lt(isl_set_get_dim(set1));
3342 map = isl_map_intersect_domain(map, set1);
3343 map = isl_map_intersect_range(map, set2);
3347 __isl_give isl_map *isl_set_lex_ge_set(__isl_take isl_set *set1,
3348 __isl_take isl_set *set2)
3351 map = isl_map_lex_ge(isl_set_get_dim(set1));
3352 map = isl_map_intersect_domain(map, set1);
3353 map = isl_map_intersect_range(map, set2);
3357 __isl_give isl_map *isl_set_lex_gt_set(__isl_take isl_set *set1,
3358 __isl_take isl_set *set2)
3361 map = isl_map_lex_gt(isl_set_get_dim(set1));
3362 map = isl_map_intersect_domain(map, set1);
3363 map = isl_map_intersect_range(map, set2);
3367 __isl_give isl_map *isl_map_lex_le_map(__isl_take isl_map *map1,
3368 __isl_take isl_map *map2)
3371 map = isl_map_lex_le(isl_dim_range(isl_map_get_dim(map1)));
3372 map = isl_map_apply_domain(map, isl_map_reverse(map1));
3373 map = isl_map_apply_range(map, isl_map_reverse(map2));
3377 __isl_give isl_map *isl_map_lex_lt_map(__isl_take isl_map *map1,
3378 __isl_take isl_map *map2)
3381 map = isl_map_lex_lt(isl_dim_range(isl_map_get_dim(map1)));
3382 map = isl_map_apply_domain(map, isl_map_reverse(map1));
3383 map = isl_map_apply_range(map, isl_map_reverse(map2));
3387 __isl_give isl_map *isl_map_lex_ge_map(__isl_take isl_map *map1,
3388 __isl_take isl_map *map2)
3391 map = isl_map_lex_ge(isl_dim_range(isl_map_get_dim(map1)));
3392 map = isl_map_apply_domain(map, isl_map_reverse(map1));
3393 map = isl_map_apply_range(map, isl_map_reverse(map2));
3397 __isl_give isl_map *isl_map_lex_gt_map(__isl_take isl_map *map1,
3398 __isl_take isl_map *map2)
3401 map = isl_map_lex_gt(isl_dim_range(isl_map_get_dim(map1)));
3402 map = isl_map_apply_domain(map, isl_map_reverse(map1));
3403 map = isl_map_apply_range(map, isl_map_reverse(map2));
3407 struct isl_basic_map *isl_basic_map_from_basic_set(
3408 struct isl_basic_set *bset, struct isl_dim *dim)
3410 struct isl_basic_map *bmap;
3412 bset = isl_basic_set_cow(bset);
3416 isl_assert(bset->ctx, isl_dim_compatible(bset->dim, dim), goto error);
3417 isl_dim_free(bset->dim);
3418 bmap = (struct isl_basic_map *) bset;
3420 return isl_basic_map_finalize(bmap);
3422 isl_basic_set_free(bset);
3427 struct isl_basic_set *isl_basic_set_from_basic_map(struct isl_basic_map *bmap)
3431 if (bmap->dim->n_in == 0)
3432 return (struct isl_basic_set *)bmap;
3433 bmap = isl_basic_map_cow(bmap);
3436 bmap->dim = isl_dim_as_set_dim(bmap->dim);
3439 bmap = isl_basic_map_finalize(bmap);
3440 return (struct isl_basic_set *)bmap;
3442 isl_basic_map_free(bmap);
3446 /* For a div d = floor(f/m), add the constraints
3449 * -(f-(n-1)) + m d >= 0
3451 * Note that the second constraint is the negation of
3455 int isl_basic_map_add_div_constraints_var(__isl_keep isl_basic_map *bmap,
3456 unsigned pos, isl_int *div)
3459 unsigned total = isl_basic_map_total_dim(bmap);
3461 i = isl_basic_map_alloc_inequality(bmap);
3464 isl_seq_cpy(bmap->ineq[i], div + 1, 1 + total);
3465 isl_int_neg(bmap->ineq[i][1 + pos], div[0]);
3467 j = isl_basic_map_alloc_inequality(bmap);
3470 isl_seq_neg(bmap->ineq[j], bmap->ineq[i], 1 + total);
3471 isl_int_add(bmap->ineq[j][0], bmap->ineq[j][0], bmap->ineq[j][1 + pos]);
3472 isl_int_sub_ui(bmap->ineq[j][0], bmap->ineq[j][0], 1);
3476 int isl_basic_set_add_div_constraints_var(__isl_keep isl_basic_set *bset,
3477 unsigned pos, isl_int *div)
3479 return isl_basic_map_add_div_constraints_var((isl_basic_map *)bset,
3483 int isl_basic_map_add_div_constraints(struct isl_basic_map *bmap, unsigned div)
3485 unsigned total = isl_basic_map_total_dim(bmap);
3486 unsigned div_pos = total - bmap->n_div + div;
3488 return isl_basic_map_add_div_constraints_var(bmap, div_pos,
3492 struct isl_basic_set *isl_basic_map_underlying_set(
3493 struct isl_basic_map *bmap)
3497 if (bmap->dim->nparam == 0 && bmap->dim->n_in == 0 &&
3499 !isl_dim_is_named_or_nested(bmap->dim, isl_dim_in) &&
3500 !isl_dim_is_named_or_nested(bmap->dim, isl_dim_out))
3501 return (struct isl_basic_set *)bmap;
3502 bmap = isl_basic_map_cow(bmap);
3505 bmap->dim = isl_dim_underlying(bmap->dim, bmap->n_div);
3508 bmap->extra -= bmap->n_div;
3510 bmap = isl_basic_map_finalize(bmap);
3511 return (struct isl_basic_set *)bmap;
3516 __isl_give isl_basic_set *isl_basic_set_underlying_set(
3517 __isl_take isl_basic_set *bset)
3519 return isl_basic_map_underlying_set((isl_basic_map *)bset);
3522 struct isl_basic_map *isl_basic_map_overlying_set(
3523 struct isl_basic_set *bset, struct isl_basic_map *like)
3525 struct isl_basic_map *bmap;
3526 struct isl_ctx *ctx;
3533 isl_assert(ctx, bset->n_div == 0, goto error);
3534 isl_assert(ctx, isl_basic_set_n_param(bset) == 0, goto error);
3535 isl_assert(ctx, bset->dim->n_out == isl_basic_map_total_dim(like),
3537 if (isl_dim_equal(bset->dim, like->dim) && like->n_div == 0) {
3538 isl_basic_map_free(like);
3539 return (struct isl_basic_map *)bset;
3541 bset = isl_basic_set_cow(bset);
3544 total = bset->dim->n_out + bset->extra;
3545 bmap = (struct isl_basic_map *)bset;
3546 isl_dim_free(bmap->dim);
3547 bmap->dim = isl_dim_copy(like->dim);
3550 bmap->n_div = like->n_div;
3551 bmap->extra += like->n_div;
3554 ltotal = total - bmap->extra + like->extra;
3557 bmap->block2 = isl_blk_extend(ctx, bmap->block2,
3558 bmap->extra * (1 + 1 + total));
3559 if (isl_blk_is_error(bmap->block2))
3561 bmap->div = isl_realloc_array(ctx, bmap->div, isl_int *,
3565 for (i = 0; i < bmap->extra; ++i)
3566 bmap->div[i] = bmap->block2.data + i * (1 + 1 + total);
3567 for (i = 0; i < like->n_div; ++i) {
3568 isl_seq_cpy(bmap->div[i], like->div[i], 1 + 1 + ltotal);
3569 isl_seq_clr(bmap->div[i]+1+1+ltotal, total - ltotal);
3571 bmap = isl_basic_map_extend_constraints(bmap,
3572 0, 2 * like->n_div);
3573 for (i = 0; i < like->n_div; ++i) {
3574 if (isl_int_is_zero(bmap->div[i][0]))
3576 if (isl_basic_map_add_div_constraints(bmap, i) < 0)
3580 isl_basic_map_free(like);
3581 bmap = isl_basic_map_simplify(bmap);
3582 bmap = isl_basic_map_finalize(bmap);
3585 isl_basic_map_free(like);
3586 isl_basic_set_free(bset);
3590 struct isl_basic_set *isl_basic_set_from_underlying_set(
3591 struct isl_basic_set *bset, struct isl_basic_set *like)
3593 return (struct isl_basic_set *)
3594 isl_basic_map_overlying_set(bset, (struct isl_basic_map *)like);
3597 struct isl_set *isl_set_from_underlying_set(
3598 struct isl_set *set, struct isl_basic_set *like)
3604 isl_assert(set->ctx, set->dim->n_out == isl_basic_set_total_dim(like),
3606 if (isl_dim_equal(set->dim, like->dim) && like->n_div == 0) {
3607 isl_basic_set_free(like);
3610 set = isl_set_cow(set);
3613 for (i = 0; i < set->n; ++i) {
3614 set->p[i] = isl_basic_set_from_underlying_set(set->p[i],
3615 isl_basic_set_copy(like));
3619 isl_dim_free(set->dim);
3620 set->dim = isl_dim_copy(like->dim);
3623 isl_basic_set_free(like);
3626 isl_basic_set_free(like);
3631 struct isl_set *isl_map_underlying_set(struct isl_map *map)
3635 map = isl_map_cow(map);
3638 map->dim = isl_dim_cow(map->dim);
3642 for (i = 1; i < map->n; ++i)
3643 isl_assert(map->ctx, map->p[0]->n_div == map->p[i]->n_div,
3645 for (i = 0; i < map->n; ++i) {
3646 map->p[i] = (struct isl_basic_map *)
3647 isl_basic_map_underlying_set(map->p[i]);
3652 map->dim = isl_dim_underlying(map->dim, 0);
3654 isl_dim_free(map->dim);
3655 map->dim = isl_dim_copy(map->p[0]->dim);
3659 return (struct isl_set *)map;
3665 struct isl_set *isl_set_to_underlying_set(struct isl_set *set)
3667 return (struct isl_set *)isl_map_underlying_set((struct isl_map *)set);
3670 __isl_give isl_basic_map *isl_basic_map_reset_dim(
3671 __isl_take isl_basic_map *bmap, __isl_take isl_dim *dim)
3673 bmap = isl_basic_map_cow(bmap);
3677 isl_dim_free(bmap->dim);
3680 bmap = isl_basic_map_finalize(bmap);
3684 isl_basic_map_free(bmap);
3689 static __isl_give isl_basic_set *isl_basic_set_reset_dim(
3690 __isl_take isl_basic_set *bset, __isl_take isl_dim *dim)
3692 return (isl_basic_set *)isl_basic_map_reset_dim((isl_basic_map *)bset,
3696 __isl_give isl_map *isl_map_reset_dim(__isl_take isl_map *map,
3697 __isl_take isl_dim *dim)
3701 map = isl_map_cow(map);
3705 for (i = 0; i < map->n; ++i) {
3706 map->p[i] = isl_basic_map_reset_dim(map->p[i],
3711 isl_dim_free(map->dim);
3721 __isl_give isl_set *isl_set_reset_dim(__isl_take isl_set *set,
3722 __isl_take isl_dim *dim)
3724 return (struct isl_set *) isl_map_reset_dim((struct isl_map *)set, dim);
3727 struct isl_basic_set *isl_basic_map_domain(struct isl_basic_map *bmap)
3730 struct isl_basic_set *domain;
3736 dim = isl_dim_domain(isl_basic_map_get_dim(bmap));
3738 n_in = isl_basic_map_n_in(bmap);
3739 n_out = isl_basic_map_n_out(bmap);
3740 domain = isl_basic_set_from_basic_map(bmap);
3741 domain = isl_basic_set_project_out(domain, isl_dim_set, n_in, n_out);
3743 domain = isl_basic_set_reset_dim(domain, dim);
3748 struct isl_basic_set *isl_basic_map_range(struct isl_basic_map *bmap)
3750 return isl_basic_map_domain(isl_basic_map_reverse(bmap));
3753 __isl_give isl_basic_map *isl_basic_map_domain_map(
3754 __isl_take isl_basic_map *bmap)
3758 isl_basic_map *domain;
3759 isl_basic_set *bset;
3760 int nparam, n_in, n_out;
3763 nparam = isl_basic_map_dim(bmap, isl_dim_param);
3764 n_in = isl_basic_map_dim(bmap, isl_dim_in);
3765 n_out = isl_basic_map_dim(bmap, isl_dim_out);
3767 dim = isl_dim_from_range(isl_dim_domain(isl_basic_map_get_dim(bmap)));
3768 domain = isl_basic_map_universe(dim);
3770 bmap = isl_basic_map_from_domain(isl_basic_map_wrap(bmap));
3771 bmap = isl_basic_map_apply_range(bmap, domain);
3772 bmap = isl_basic_map_extend_constraints(bmap, n_in, 0);
3774 total = isl_basic_map_total_dim(bmap);
3776 for (i = 0; i < n_in; ++i) {
3777 k = isl_basic_map_alloc_equality(bmap);
3780 isl_seq_clr(bmap->eq[k], 1 + total);
3781 isl_int_set_si(bmap->eq[k][1 + nparam + i], -1);
3782 isl_int_set_si(bmap->eq[k][1 + nparam + n_in + n_out + i], 1);
3785 bmap = isl_basic_map_gauss(bmap, NULL);
3786 return isl_basic_map_finalize(bmap);
3788 isl_basic_map_free(bmap);
3792 __isl_give isl_basic_map *isl_basic_map_range_map(
3793 __isl_take isl_basic_map *bmap)
3797 isl_basic_map *range;
3798 isl_basic_set *bset;
3799 int nparam, n_in, n_out;
3802 nparam = isl_basic_map_dim(bmap, isl_dim_param);
3803 n_in = isl_basic_map_dim(bmap, isl_dim_in);
3804 n_out = isl_basic_map_dim(bmap, isl_dim_out);
3806 dim = isl_dim_from_range(isl_dim_range(isl_basic_map_get_dim(bmap)));
3807 range = isl_basic_map_universe(dim);
3809 bmap = isl_basic_map_from_domain(isl_basic_map_wrap(bmap));
3810 bmap = isl_basic_map_apply_range(bmap, range);
3811 bmap = isl_basic_map_extend_constraints(bmap, n_out, 0);
3813 total = isl_basic_map_total_dim(bmap);
3815 for (i = 0; i < n_out; ++i) {
3816 k = isl_basic_map_alloc_equality(bmap);
3819 isl_seq_clr(bmap->eq[k], 1 + total);
3820 isl_int_set_si(bmap->eq[k][1 + nparam + n_in + i], -1);
3821 isl_int_set_si(bmap->eq[k][1 + nparam + n_in + n_out + i], 1);
3824 bmap = isl_basic_map_gauss(bmap, NULL);
3825 return isl_basic_map_finalize(bmap);
3827 isl_basic_map_free(bmap);
3831 struct isl_set *isl_map_range(struct isl_map *map)
3834 struct isl_set *set;
3838 if (isl_map_dim(map, isl_dim_in) == 0)
3839 return (isl_set *)map;
3841 map = isl_map_cow(map);
3845 set = (struct isl_set *) map;
3846 set->dim = isl_dim_drop_inputs(set->dim, 0, set->dim->n_in);
3849 for (i = 0; i < map->n; ++i) {
3850 set->p[i] = isl_basic_map_range(map->p[i]);
3854 ISL_F_CLR(set, ISL_MAP_DISJOINT);
3855 ISL_F_CLR(set, ISL_SET_NORMALIZED);
3862 __isl_give isl_map *isl_map_domain_map(__isl_take isl_map *map)
3865 isl_dim *domain_dim;
3867 map = isl_map_cow(map);
3871 domain_dim = isl_dim_from_range(isl_dim_domain(isl_map_get_dim(map)));
3872 map->dim = isl_dim_from_domain(isl_dim_wrap(map->dim));
3873 map->dim = isl_dim_join(map->dim, domain_dim);
3876 for (i = 0; i < map->n; ++i) {
3877 map->p[i] = isl_basic_map_domain_map(map->p[i]);
3881 ISL_F_CLR(map, ISL_MAP_DISJOINT);
3882 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3889 __isl_give isl_map *isl_map_range_map(__isl_take isl_map *map)
3894 map = isl_map_cow(map);
3898 range_dim = isl_dim_range(isl_map_get_dim(map));
3899 map->dim = isl_dim_from_domain(isl_dim_wrap(map->dim));
3900 map->dim = isl_dim_join(map->dim, range_dim);
3903 for (i = 0; i < map->n; ++i) {
3904 map->p[i] = isl_basic_map_range_map(map->p[i]);
3908 ISL_F_CLR(map, ISL_MAP_DISJOINT);
3909 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3916 struct isl_map *isl_map_from_set(struct isl_set *set, struct isl_dim *dim)
3919 struct isl_map *map = NULL;
3921 set = isl_set_cow(set);
3924 isl_assert(set->ctx, isl_dim_compatible(set->dim, dim), goto error);
3925 map = (struct isl_map *)set;
3926 for (i = 0; i < set->n; ++i) {
3927 map->p[i] = isl_basic_map_from_basic_set(
3928 set->p[i], isl_dim_copy(dim));
3932 isl_dim_free(map->dim);
3941 __isl_give isl_basic_map *isl_basic_map_from_domain(
3942 __isl_take isl_basic_set *bset)
3944 return isl_basic_map_reverse(isl_basic_map_from_range(bset));
3947 __isl_give isl_basic_map *isl_basic_map_from_range(
3948 __isl_take isl_basic_set *bset)
3950 return (isl_basic_map *)bset;
3953 struct isl_map *isl_map_from_range(struct isl_set *set)
3955 return (struct isl_map *)set;
3958 __isl_give isl_map *isl_map_from_domain(__isl_take isl_set *set)
3960 return isl_map_reverse(isl_map_from_range(set));
3963 __isl_give isl_map *isl_map_from_domain_and_range(__isl_take isl_set *domain,
3964 __isl_take isl_set *range)
3966 return isl_map_apply_range(isl_map_from_domain(domain),
3967 isl_map_from_range(range));
3970 struct isl_set *isl_set_from_map(struct isl_map *map)
3973 struct isl_set *set = NULL;
3977 map = isl_map_cow(map);
3980 map->dim = isl_dim_as_set_dim(map->dim);
3983 set = (struct isl_set *)map;
3984 for (i = 0; i < map->n; ++i) {
3985 set->p[i] = isl_basic_set_from_basic_map(map->p[i]);
3995 struct isl_map *isl_map_alloc_dim(struct isl_dim *dim, int n, unsigned flags)
3997 struct isl_map *map;
4001 isl_assert(dim->ctx, n >= 0, return NULL);
4002 map = isl_alloc(dim->ctx, struct isl_map,
4003 sizeof(struct isl_map) +
4004 (n - 1) * sizeof(struct isl_basic_map *));
4008 map->ctx = dim->ctx;
4009 isl_ctx_ref(map->ctx);
4021 struct isl_map *isl_map_alloc(struct isl_ctx *ctx,
4022 unsigned nparam, unsigned in, unsigned out, int n,
4025 struct isl_map *map;
4026 struct isl_dim *dims;
4028 dims = isl_dim_alloc(ctx, nparam, in, out);
4032 map = isl_map_alloc_dim(dims, n, flags);
4036 struct isl_basic_map *isl_basic_map_empty(struct isl_dim *dim)
4038 struct isl_basic_map *bmap;
4039 bmap = isl_basic_map_alloc_dim(dim, 0, 1, 0);
4040 bmap = isl_basic_map_set_to_empty(bmap);
4044 struct isl_basic_set *isl_basic_set_empty(struct isl_dim *dim)
4046 struct isl_basic_set *bset;
4047 bset = isl_basic_set_alloc_dim(dim, 0, 1, 0);
4048 bset = isl_basic_set_set_to_empty(bset);
4052 struct isl_basic_map *isl_basic_map_empty_like(struct isl_basic_map *model)
4054 struct isl_basic_map *bmap;
4057 bmap = isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
4058 bmap = isl_basic_map_set_to_empty(bmap);
4062 struct isl_basic_map *isl_basic_map_empty_like_map(struct isl_map *model)
4064 struct isl_basic_map *bmap;
4067 bmap = isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
4068 bmap = isl_basic_map_set_to_empty(bmap);
4072 struct isl_basic_set *isl_basic_set_empty_like(struct isl_basic_set *model)
4074 struct isl_basic_set *bset;
4077 bset = isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
4078 bset = isl_basic_set_set_to_empty(bset);
4082 struct isl_basic_map *isl_basic_map_universe(struct isl_dim *dim)
4084 struct isl_basic_map *bmap;
4085 bmap = isl_basic_map_alloc_dim(dim, 0, 0, 0);
4089 struct isl_basic_set *isl_basic_set_universe(struct isl_dim *dim)
4091 struct isl_basic_set *bset;
4092 bset = isl_basic_set_alloc_dim(dim, 0, 0, 0);
4096 __isl_give isl_basic_map *isl_basic_map_universe_like(
4097 __isl_keep isl_basic_map *model)
4101 return isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
4104 struct isl_basic_set *isl_basic_set_universe_like(struct isl_basic_set *model)
4108 return isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
4111 __isl_give isl_basic_set *isl_basic_set_universe_like_set(
4112 __isl_keep isl_set *model)
4116 return isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
4119 struct isl_map *isl_map_empty(struct isl_dim *dim)
4121 return isl_map_alloc_dim(dim, 0, ISL_MAP_DISJOINT);
4124 struct isl_map *isl_map_empty_like(struct isl_map *model)
4128 return isl_map_alloc_dim(isl_dim_copy(model->dim), 0, ISL_MAP_DISJOINT);
4131 struct isl_map *isl_map_empty_like_basic_map(struct isl_basic_map *model)
4135 return isl_map_alloc_dim(isl_dim_copy(model->dim), 0, ISL_MAP_DISJOINT);
4138 struct isl_set *isl_set_empty(struct isl_dim *dim)
4140 return isl_set_alloc_dim(dim, 0, ISL_MAP_DISJOINT);
4143 struct isl_set *isl_set_empty_like(struct isl_set *model)
4147 return isl_set_empty(isl_dim_copy(model->dim));
4150 struct isl_map *isl_map_universe(struct isl_dim *dim)
4152 struct isl_map *map;
4155 map = isl_map_alloc_dim(isl_dim_copy(dim), 1, ISL_MAP_DISJOINT);
4156 map = isl_map_add_basic_map(map, isl_basic_map_universe(dim));
4160 struct isl_set *isl_set_universe(struct isl_dim *dim)
4162 struct isl_set *set;
4165 set = isl_set_alloc_dim(isl_dim_copy(dim), 1, ISL_MAP_DISJOINT);
4166 set = isl_set_add_basic_set(set, isl_basic_set_universe(dim));
4170 __isl_give isl_set *isl_set_universe_like(__isl_keep isl_set *model)
4174 return isl_set_universe(isl_dim_copy(model->dim));
4177 struct isl_map *isl_map_dup(struct isl_map *map)
4180 struct isl_map *dup;
4184 dup = isl_map_alloc_dim(isl_dim_copy(map->dim), map->n, map->flags);
4185 for (i = 0; i < map->n; ++i)
4186 dup = isl_map_add_basic_map(dup, isl_basic_map_copy(map->p[i]));
4190 __isl_give isl_map *isl_map_add_basic_map(__isl_take isl_map *map,
4191 __isl_take isl_basic_map *bmap)
4195 if (isl_basic_map_fast_is_empty(bmap)) {
4196 isl_basic_map_free(bmap);
4199 isl_assert(map->ctx, isl_dim_equal(map->dim, bmap->dim), goto error);
4200 isl_assert(map->ctx, map->n < map->size, goto error);
4201 map->p[map->n] = bmap;
4203 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4209 isl_basic_map_free(bmap);
4213 void isl_map_free(struct isl_map *map)
4223 isl_ctx_deref(map->ctx);
4224 for (i = 0; i < map->n; ++i)
4225 isl_basic_map_free(map->p[i]);
4226 isl_dim_free(map->dim);
4230 struct isl_map *isl_map_extend(struct isl_map *base,
4231 unsigned nparam, unsigned n_in, unsigned n_out)
4235 base = isl_map_cow(base);
4239 base->dim = isl_dim_extend(base->dim, nparam, n_in, n_out);
4242 for (i = 0; i < base->n; ++i) {
4243 base->p[i] = isl_basic_map_extend_dim(base->p[i],
4244 isl_dim_copy(base->dim), 0, 0, 0);
4254 struct isl_set *isl_set_extend(struct isl_set *base,
4255 unsigned nparam, unsigned dim)
4257 return (struct isl_set *)isl_map_extend((struct isl_map *)base,
4261 static struct isl_basic_map *isl_basic_map_fix_pos_si(
4262 struct isl_basic_map *bmap, unsigned pos, int value)
4266 bmap = isl_basic_map_cow(bmap);
4267 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
4268 j = isl_basic_map_alloc_equality(bmap);
4271 isl_seq_clr(bmap->eq[j] + 1, isl_basic_map_total_dim(bmap));
4272 isl_int_set_si(bmap->eq[j][pos], -1);
4273 isl_int_set_si(bmap->eq[j][0], value);
4274 bmap = isl_basic_map_simplify(bmap);
4275 return isl_basic_map_finalize(bmap);
4277 isl_basic_map_free(bmap);
4281 static __isl_give isl_basic_map *isl_basic_map_fix_pos(
4282 __isl_take isl_basic_map *bmap, unsigned pos, isl_int value)
4286 bmap = isl_basic_map_cow(bmap);
4287 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
4288 j = isl_basic_map_alloc_equality(bmap);
4291 isl_seq_clr(bmap->eq[j] + 1, isl_basic_map_total_dim(bmap));
4292 isl_int_set_si(bmap->eq[j][pos], -1);
4293 isl_int_set(bmap->eq[j][0], value);
4294 bmap = isl_basic_map_simplify(bmap);
4295 return isl_basic_map_finalize(bmap);
4297 isl_basic_map_free(bmap);
4301 struct isl_basic_map *isl_basic_map_fix_si(struct isl_basic_map *bmap,
4302 enum isl_dim_type type, unsigned pos, int value)
4306 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
4307 return isl_basic_map_fix_pos_si(bmap,
4308 isl_basic_map_offset(bmap, type) + pos, value);
4310 isl_basic_map_free(bmap);
4314 __isl_give isl_basic_map *isl_basic_map_fix(__isl_take isl_basic_map *bmap,
4315 enum isl_dim_type type, unsigned pos, isl_int value)
4319 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
4320 return isl_basic_map_fix_pos(bmap,
4321 isl_basic_map_offset(bmap, type) + pos, value);
4323 isl_basic_map_free(bmap);
4327 struct isl_basic_set *isl_basic_set_fix_si(struct isl_basic_set *bset,
4328 enum isl_dim_type type, unsigned pos, int value)
4330 return (struct isl_basic_set *)
4331 isl_basic_map_fix_si((struct isl_basic_map *)bset,
4335 __isl_give isl_basic_set *isl_basic_set_fix(__isl_take isl_basic_set *bset,
4336 enum isl_dim_type type, unsigned pos, isl_int value)
4338 return (struct isl_basic_set *)
4339 isl_basic_map_fix((struct isl_basic_map *)bset,
4343 struct isl_basic_map *isl_basic_map_fix_input_si(struct isl_basic_map *bmap,
4344 unsigned input, int value)
4346 return isl_basic_map_fix_si(bmap, isl_dim_in, input, value);
4349 struct isl_basic_set *isl_basic_set_fix_dim_si(struct isl_basic_set *bset,
4350 unsigned dim, int value)
4352 return (struct isl_basic_set *)
4353 isl_basic_map_fix_si((struct isl_basic_map *)bset,
4354 isl_dim_set, dim, value);
4357 struct isl_map *isl_map_fix_si(struct isl_map *map,
4358 enum isl_dim_type type, unsigned pos, int value)
4362 map = isl_map_cow(map);
4366 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
4367 for (i = 0; i < map->n; ++i) {
4368 map->p[i] = isl_basic_map_fix_si(map->p[i], type, pos, value);
4372 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4379 __isl_give isl_set *isl_set_fix_si(__isl_take isl_set *set,
4380 enum isl_dim_type type, unsigned pos, int value)
4382 return (struct isl_set *)
4383 isl_map_fix_si((struct isl_map *)set, type, pos, value);
4386 __isl_give isl_map *isl_map_fix(__isl_take isl_map *map,
4387 enum isl_dim_type type, unsigned pos, isl_int value)
4391 map = isl_map_cow(map);
4395 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
4396 for (i = 0; i < map->n; ++i) {
4397 map->p[i] = isl_basic_map_fix(map->p[i], type, pos, value);
4401 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4408 __isl_give isl_set *isl_set_fix(__isl_take isl_set *set,
4409 enum isl_dim_type type, unsigned pos, isl_int value)
4411 return (struct isl_set *)isl_map_fix((isl_map *)set, type, pos, value);
4414 struct isl_map *isl_map_fix_input_si(struct isl_map *map,
4415 unsigned input, int value)
4417 return isl_map_fix_si(map, isl_dim_in, input, value);
4420 struct isl_set *isl_set_fix_dim_si(struct isl_set *set, unsigned dim, int value)
4422 return (struct isl_set *)
4423 isl_map_fix_si((struct isl_map *)set, isl_dim_set, dim, value);
4426 __isl_give isl_basic_map *isl_basic_map_lower_bound_si(
4427 __isl_take isl_basic_map *bmap,
4428 enum isl_dim_type type, unsigned pos, int value)
4434 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
4435 pos += isl_basic_map_offset(bmap, type);
4436 bmap = isl_basic_map_cow(bmap);
4437 bmap = isl_basic_map_extend_constraints(bmap, 0, 1);
4438 j = isl_basic_map_alloc_inequality(bmap);
4441 isl_seq_clr(bmap->ineq[j], 1 + isl_basic_map_total_dim(bmap));
4442 isl_int_set_si(bmap->ineq[j][pos], 1);
4443 isl_int_set_si(bmap->ineq[j][0], -value);
4444 bmap = isl_basic_map_simplify(bmap);
4445 return isl_basic_map_finalize(bmap);
4447 isl_basic_map_free(bmap);
4451 struct isl_basic_set *isl_basic_set_lower_bound_dim(struct isl_basic_set *bset,
4452 unsigned dim, isl_int value)
4456 bset = isl_basic_set_cow(bset);
4457 bset = isl_basic_set_extend_constraints(bset, 0, 1);
4458 j = isl_basic_set_alloc_inequality(bset);
4461 isl_seq_clr(bset->ineq[j], 1 + isl_basic_set_total_dim(bset));
4462 isl_int_set_si(bset->ineq[j][1 + isl_basic_set_n_param(bset) + dim], 1);
4463 isl_int_neg(bset->ineq[j][0], value);
4464 bset = isl_basic_set_simplify(bset);
4465 return isl_basic_set_finalize(bset);
4467 isl_basic_set_free(bset);
4471 __isl_give isl_map *isl_map_lower_bound_si(__isl_take isl_map *map,
4472 enum isl_dim_type type, unsigned pos, int value)
4476 map = isl_map_cow(map);
4480 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
4481 for (i = 0; i < map->n; ++i) {
4482 map->p[i] = isl_basic_map_lower_bound_si(map->p[i],
4487 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4494 __isl_give isl_set *isl_set_lower_bound_si(__isl_take isl_set *set,
4495 enum isl_dim_type type, unsigned pos, int value)
4497 return (struct isl_set *)
4498 isl_map_lower_bound_si((struct isl_map *)set, type, pos, value);
4501 struct isl_set *isl_set_lower_bound_dim(struct isl_set *set, unsigned dim,
4506 set = isl_set_cow(set);
4510 isl_assert(set->ctx, dim < isl_set_n_dim(set), goto error);
4511 for (i = 0; i < set->n; ++i) {
4512 set->p[i] = isl_basic_set_lower_bound_dim(set->p[i], dim, value);
4522 struct isl_map *isl_map_reverse(struct isl_map *map)
4526 map = isl_map_cow(map);
4530 map->dim = isl_dim_reverse(map->dim);
4533 for (i = 0; i < map->n; ++i) {
4534 map->p[i] = isl_basic_map_reverse(map->p[i]);
4538 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4545 static struct isl_map *isl_basic_map_partial_lexopt(
4546 struct isl_basic_map *bmap, struct isl_basic_set *dom,
4547 struct isl_set **empty, int max)
4551 if (bmap->ctx->opt->pip == ISL_PIP_PIP)
4552 return isl_pip_basic_map_lexopt(bmap, dom, empty, max);
4554 return isl_tab_basic_map_partial_lexopt(bmap, dom, empty, max);
4556 isl_basic_map_free(bmap);
4557 isl_basic_set_free(dom);
4563 struct isl_map *isl_basic_map_partial_lexmax(
4564 struct isl_basic_map *bmap, struct isl_basic_set *dom,
4565 struct isl_set **empty)
4567 return isl_basic_map_partial_lexopt(bmap, dom, empty, 1);
4570 struct isl_map *isl_basic_map_partial_lexmin(
4571 struct isl_basic_map *bmap, struct isl_basic_set *dom,
4572 struct isl_set **empty)
4574 return isl_basic_map_partial_lexopt(bmap, dom, empty, 0);
4577 struct isl_set *isl_basic_set_partial_lexmin(
4578 struct isl_basic_set *bset, struct isl_basic_set *dom,
4579 struct isl_set **empty)
4581 return (struct isl_set *)
4582 isl_basic_map_partial_lexmin((struct isl_basic_map *)bset,
4586 struct isl_set *isl_basic_set_partial_lexmax(
4587 struct isl_basic_set *bset, struct isl_basic_set *dom,
4588 struct isl_set **empty)
4590 return (struct isl_set *)
4591 isl_basic_map_partial_lexmax((struct isl_basic_map *)bset,
4595 /* Given a basic map "bmap", compute the lexicographically minimal
4596 * (or maximal) image element for each domain element in dom.
4597 * Set *empty to those elements in dom that do not have an image element.
4599 * We first make sure the basic sets in dom are disjoint and then
4600 * simply collect the results over each of the basic sets separately.
4601 * We could probably improve the efficiency a bit by moving the union
4602 * domain down into the parametric integer programming.
4604 static __isl_give isl_map *basic_map_partial_lexopt(
4605 __isl_take isl_basic_map *bmap, __isl_take isl_set *dom,
4606 __isl_give isl_set **empty, int max)
4609 struct isl_map *res;
4611 dom = isl_set_make_disjoint(dom);
4615 if (isl_set_fast_is_empty(dom)) {
4616 res = isl_map_empty_like_basic_map(bmap);
4617 *empty = isl_set_empty_like(dom);
4619 isl_basic_map_free(bmap);
4623 res = isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap),
4624 isl_basic_set_copy(dom->p[0]), empty, max);
4626 for (i = 1; i < dom->n; ++i) {
4627 struct isl_map *res_i;
4628 struct isl_set *empty_i;
4630 res_i = isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap),
4631 isl_basic_set_copy(dom->p[i]), &empty_i, max);
4633 res = isl_map_union_disjoint(res, res_i);
4634 *empty = isl_set_union_disjoint(*empty, empty_i);
4638 isl_basic_map_free(bmap);
4643 isl_basic_map_free(bmap);
4647 /* Given a map "map", compute the lexicographically minimal
4648 * (or maximal) image element for each domain element in dom.
4649 * Set *empty to those elements in dom that do not have an image element.
4651 * We first compute the lexicographically minimal or maximal element
4652 * in the first basic map. This results in a partial solution "res"
4653 * and a subset "todo" of dom that still need to be handled.
4654 * We then consider each of the remaining maps in "map" and successively
4655 * improve both "res" and "todo".
4657 * Let res^k and todo^k be the results after k steps and let i = k + 1.
4658 * Assume we are computing the lexicographical maximum.
4659 * We first compute the lexicographically maximal element in basic map i.
4660 * This results in a partial solution res_i and a subset todo_i.
4661 * Then we combine these results with those obtain for the first k basic maps
4662 * to obtain a result that is valid for the first k+1 basic maps.
4663 * In particular, the set where there is no solution is the set where
4664 * there is no solution for the first k basic maps and also no solution
4665 * for the ith basic map, i.e.,
4667 * todo^i = todo^k * todo_i
4669 * On dom(res^k) * dom(res_i), we need to pick the larger of the two
4670 * solutions, arbitrarily breaking ties in favor of res^k.
4671 * That is, when res^k(a) >= res_i(a), we pick res^k and
4672 * when res^k(a) < res_i(a), we pick res_i. (Here, ">=" and "<" denote
4673 * the lexicographic order.)
4674 * In practice, we compute
4676 * res^k * (res_i . "<=")
4680 * res_i * (res^k . "<")
4682 * Finally, we consider the symmetric difference of dom(res^k) and dom(res_i),
4683 * where only one of res^k and res_i provides a solution and we simply pick
4690 * Note that we only compute these intersections when dom(res^k) intersects
4691 * dom(res_i). Otherwise, the only effect of these intersections is to
4692 * potentially break up res^k and res_i into smaller pieces.
4693 * We want to avoid such splintering as much as possible.
4694 * In fact, an earlier implementation of this function would look for
4695 * better results in the domain of res^k and for extra results in todo^k,
4696 * but this would always result in a splintering according to todo^k,
4697 * even when the domain of basic map i is disjoint from the domains of
4698 * the previous basic maps.
4700 static __isl_give isl_map *isl_map_partial_lexopt(
4701 __isl_take isl_map *map, __isl_take isl_set *dom,
4702 __isl_give isl_set **empty, int max)
4705 struct isl_map *res;
4706 struct isl_set *todo;
4711 if (isl_map_fast_is_empty(map)) {
4719 res = basic_map_partial_lexopt(isl_basic_map_copy(map->p[0]),
4720 isl_set_copy(dom), &todo, max);
4722 for (i = 1; i < map->n; ++i) {
4726 isl_dim *dim = isl_dim_range(isl_map_get_dim(res));
4728 res_i = basic_map_partial_lexopt(isl_basic_map_copy(map->p[i]),
4729 isl_set_copy(dom), &todo_i, max);
4732 lt = isl_map_lex_lt(isl_dim_copy(dim));
4733 le = isl_map_lex_le(dim);
4735 lt = isl_map_lex_gt(isl_dim_copy(dim));
4736 le = isl_map_lex_ge(dim);
4738 lt = isl_map_apply_range(isl_map_copy(res), lt);
4739 lt = isl_map_intersect(lt, isl_map_copy(res_i));
4740 le = isl_map_apply_range(isl_map_copy(res_i), le);
4741 le = isl_map_intersect(le, isl_map_copy(res));
4743 if (!isl_map_is_empty(lt) || !isl_map_is_empty(le)) {
4744 res = isl_map_intersect_domain(res,
4745 isl_set_copy(todo_i));
4746 res_i = isl_map_intersect_domain(res_i,
4747 isl_set_copy(todo));
4750 res = isl_map_union_disjoint(res, res_i);
4751 res = isl_map_union_disjoint(res, lt);
4752 res = isl_map_union_disjoint(res, le);
4754 todo = isl_set_intersect(todo, todo_i);
4774 __isl_give isl_map *isl_map_partial_lexmax(
4775 __isl_take isl_map *map, __isl_take isl_set *dom,
4776 __isl_give isl_set **empty)
4778 return isl_map_partial_lexopt(map, dom, empty, 1);
4781 __isl_give isl_map *isl_map_partial_lexmin(
4782 __isl_take isl_map *map, __isl_take isl_set *dom,
4783 __isl_give isl_set **empty)
4785 return isl_map_partial_lexopt(map, dom, empty, 0);
4788 __isl_give isl_set *isl_set_partial_lexmin(
4789 __isl_take isl_set *set, __isl_take isl_set *dom,
4790 __isl_give isl_set **empty)
4792 return (struct isl_set *)
4793 isl_map_partial_lexmin((struct isl_map *)set,
4797 __isl_give isl_set *isl_set_partial_lexmax(
4798 __isl_take isl_set *set, __isl_take isl_set *dom,
4799 __isl_give isl_set **empty)
4801 return (struct isl_set *)
4802 isl_map_partial_lexmax((struct isl_map *)set,
4806 __isl_give isl_map *isl_basic_map_lexopt(__isl_take isl_basic_map *bmap, int max)
4808 struct isl_basic_set *dom = NULL;
4809 struct isl_dim *dom_dim;
4813 dom_dim = isl_dim_domain(isl_dim_copy(bmap->dim));
4814 dom = isl_basic_set_universe(dom_dim);
4815 return isl_basic_map_partial_lexopt(bmap, dom, NULL, max);
4817 isl_basic_map_free(bmap);
4821 __isl_give isl_map *isl_basic_map_lexmin(__isl_take isl_basic_map *bmap)
4823 return isl_basic_map_lexopt(bmap, 0);
4826 __isl_give isl_map *isl_basic_map_lexmax(__isl_take isl_basic_map *bmap)
4828 return isl_basic_map_lexopt(bmap, 1);
4831 __isl_give isl_set *isl_basic_set_lexmin(__isl_take isl_basic_set *bset)
4833 return (isl_set *)isl_basic_map_lexmin((isl_basic_map *)bset);
4836 __isl_give isl_set *isl_basic_set_lexmax(__isl_take isl_basic_set *bset)
4838 return (isl_set *)isl_basic_map_lexmax((isl_basic_map *)bset);
4841 __isl_give isl_map *isl_map_lexopt(__isl_take isl_map *map, int max)
4843 struct isl_set *dom = NULL;
4844 struct isl_dim *dom_dim;
4848 dom_dim = isl_dim_domain(isl_dim_copy(map->dim));
4849 dom = isl_set_universe(dom_dim);
4850 return isl_map_partial_lexopt(map, dom, NULL, max);
4856 __isl_give isl_map *isl_map_lexmin(__isl_take isl_map *map)
4858 return isl_map_lexopt(map, 0);
4861 __isl_give isl_map *isl_map_lexmax(__isl_take isl_map *map)
4863 return isl_map_lexopt(map, 1);
4866 __isl_give isl_set *isl_set_lexmin(__isl_take isl_set *set)
4868 return (isl_set *)isl_map_lexmin((isl_map *)set);
4871 __isl_give isl_set *isl_set_lexmax(__isl_take isl_set *set)
4873 return (isl_set *)isl_map_lexmax((isl_map *)set);
4876 /* Apply a preimage specified by "mat" on the parameters of "bset".
4877 * bset is assumed to have only parameters and divs.
4879 static struct isl_basic_set *basic_set_parameter_preimage(
4880 struct isl_basic_set *bset, struct isl_mat *mat)
4887 bset->dim = isl_dim_cow(bset->dim);
4891 nparam = isl_basic_set_dim(bset, isl_dim_param);
4893 isl_assert(bset->ctx, mat->n_row == 1 + nparam, goto error);
4895 bset->dim->nparam = 0;
4896 bset->dim->n_out = nparam;
4897 bset = isl_basic_set_preimage(bset, mat);
4899 bset->dim->nparam = bset->dim->n_out;
4900 bset->dim->n_out = 0;
4905 isl_basic_set_free(bset);
4909 /* Apply a preimage specified by "mat" on the parameters of "set".
4910 * set is assumed to have only parameters and divs.
4912 static struct isl_set *set_parameter_preimage(
4913 struct isl_set *set, struct isl_mat *mat)
4915 struct isl_dim *dim = NULL;
4921 dim = isl_dim_copy(set->dim);
4922 dim = isl_dim_cow(dim);
4926 nparam = isl_set_dim(set, isl_dim_param);
4928 isl_assert(set->ctx, mat->n_row == 1 + nparam, goto error);
4931 dim->n_out = nparam;
4932 isl_set_reset_dim(set, dim);
4933 set = isl_set_preimage(set, mat);
4936 dim = isl_dim_copy(set->dim);
4937 dim = isl_dim_cow(dim);
4940 dim->nparam = dim->n_out;
4942 isl_set_reset_dim(set, dim);
4952 /* Intersect the basic set "bset" with the affine space specified by the
4953 * equalities in "eq".
4955 static struct isl_basic_set *basic_set_append_equalities(
4956 struct isl_basic_set *bset, struct isl_mat *eq)
4964 bset = isl_basic_set_extend_dim(bset, isl_dim_copy(bset->dim), 0,
4969 len = 1 + isl_dim_total(bset->dim) + bset->extra;
4970 for (i = 0; i < eq->n_row; ++i) {
4971 k = isl_basic_set_alloc_equality(bset);
4974 isl_seq_cpy(bset->eq[k], eq->row[i], eq->n_col);
4975 isl_seq_clr(bset->eq[k] + eq->n_col, len - eq->n_col);
4979 bset = isl_basic_set_gauss(bset, NULL);
4980 bset = isl_basic_set_finalize(bset);
4985 isl_basic_set_free(bset);
4989 /* Intersect the set "set" with the affine space specified by the
4990 * equalities in "eq".
4992 static struct isl_set *set_append_equalities(struct isl_set *set,
5000 for (i = 0; i < set->n; ++i) {
5001 set->p[i] = basic_set_append_equalities(set->p[i],
5014 /* Project the given basic set onto its parameter domain, possibly introducing
5015 * new, explicit, existential variables in the constraints.
5016 * The input has parameters and (possibly implicit) existential variables.
5017 * The output has the same parameters, but only
5018 * explicit existentially quantified variables.
5020 * The actual projection is performed by pip, but pip doesn't seem
5021 * to like equalities very much, so we first remove the equalities
5022 * among the parameters by performing a variable compression on
5023 * the parameters. Afterward, an inverse transformation is performed
5024 * and the equalities among the parameters are inserted back in.
5026 static struct isl_set *parameter_compute_divs(struct isl_basic_set *bset)
5030 struct isl_mat *T, *T2;
5031 struct isl_set *set;
5032 unsigned nparam, n_div;
5034 bset = isl_basic_set_cow(bset);
5038 if (bset->n_eq == 0)
5039 return isl_basic_set_lexmin(bset);
5041 isl_basic_set_gauss(bset, NULL);
5043 nparam = isl_basic_set_dim(bset, isl_dim_param);
5044 n_div = isl_basic_set_dim(bset, isl_dim_div);
5046 for (i = 0, j = n_div - 1; i < bset->n_eq && j >= 0; --j) {
5047 if (!isl_int_is_zero(bset->eq[i][1 + nparam + j]))
5050 if (i == bset->n_eq)
5051 return isl_basic_set_lexmin(bset);
5053 eq = isl_mat_sub_alloc(bset->ctx, bset->eq, i, bset->n_eq - i,
5055 eq = isl_mat_cow(eq);
5056 T = isl_mat_variable_compression(isl_mat_copy(eq), &T2);
5057 if (T && T->n_col == 0) {
5061 bset = isl_basic_set_set_to_empty(bset);
5062 return isl_set_from_basic_set(bset);
5064 bset = basic_set_parameter_preimage(bset, T);
5066 set = isl_basic_set_lexmin(bset);
5067 set = set_parameter_preimage(set, T2);
5068 set = set_append_equalities(set, eq);
5072 /* Compute an explicit representation for all the existentially
5073 * quantified variables.
5074 * The input and output dimensions are first turned into parameters.
5075 * compute_divs then returns a map with the same parameters and
5076 * no input or output dimensions and the dimension specification
5077 * is reset to that of the input.
5079 static struct isl_map *compute_divs(struct isl_basic_map *bmap)
5081 struct isl_basic_set *bset;
5082 struct isl_set *set;
5083 struct isl_map *map;
5084 struct isl_dim *dim, *orig_dim = NULL;
5089 bmap = isl_basic_map_cow(bmap);
5093 nparam = isl_basic_map_dim(bmap, isl_dim_param);
5094 n_in = isl_basic_map_dim(bmap, isl_dim_in);
5095 n_out = isl_basic_map_dim(bmap, isl_dim_out);
5096 dim = isl_dim_set_alloc(bmap->ctx, nparam + n_in + n_out, 0);
5100 orig_dim = bmap->dim;
5102 bset = (struct isl_basic_set *)bmap;
5104 set = parameter_compute_divs(bset);
5105 map = (struct isl_map *)set;
5106 map = isl_map_reset_dim(map, orig_dim);
5110 isl_basic_map_free(bmap);
5114 static int basic_map_divs_known(__isl_keep isl_basic_map *bmap)
5122 off = isl_dim_total(bmap->dim);
5123 for (i = 0; i < bmap->n_div; ++i) {
5124 if (isl_int_is_zero(bmap->div[i][0]))
5126 isl_assert(bmap->ctx, isl_int_is_zero(bmap->div[i][1+1+off+i]),
5132 static int map_divs_known(__isl_keep isl_map *map)
5139 for (i = 0; i < map->n; ++i) {
5140 int known = basic_map_divs_known(map->p[i]);
5148 /* If bmap contains any unknown divs, then compute explicit
5149 * expressions for them. However, this computation may be
5150 * quite expensive, so first try to remove divs that aren't
5153 struct isl_map *isl_basic_map_compute_divs(struct isl_basic_map *bmap)
5157 struct isl_map *map;
5159 known = basic_map_divs_known(bmap);
5163 return isl_map_from_basic_map(bmap);
5165 bmap = isl_basic_map_drop_redundant_divs(bmap);
5167 known = basic_map_divs_known(bmap);
5171 return isl_map_from_basic_map(bmap);
5173 map = compute_divs(bmap);
5176 isl_basic_map_free(bmap);
5180 struct isl_map *isl_map_compute_divs(struct isl_map *map)
5184 struct isl_map *res;
5191 known = map_divs_known(map);
5199 res = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[0]));
5200 for (i = 1 ; i < map->n; ++i) {
5202 r2 = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[i]));
5203 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT))
5204 res = isl_map_union_disjoint(res, r2);
5206 res = isl_map_union(res, r2);
5213 struct isl_set *isl_basic_set_compute_divs(struct isl_basic_set *bset)
5215 return (struct isl_set *)
5216 isl_basic_map_compute_divs((struct isl_basic_map *)bset);
5219 struct isl_set *isl_set_compute_divs(struct isl_set *set)
5221 return (struct isl_set *)
5222 isl_map_compute_divs((struct isl_map *)set);
5225 struct isl_set *isl_map_domain(struct isl_map *map)
5228 struct isl_set *set;
5233 map = isl_map_cow(map);
5237 set = (struct isl_set *)map;
5238 set->dim = isl_dim_domain(set->dim);
5241 for (i = 0; i < map->n; ++i) {
5242 set->p[i] = isl_basic_map_domain(map->p[i]);
5246 ISL_F_CLR(set, ISL_MAP_DISJOINT);
5247 ISL_F_CLR(set, ISL_SET_NORMALIZED);
5254 struct isl_map *isl_map_union_disjoint(
5255 struct isl_map *map1, struct isl_map *map2)
5259 struct isl_map *map = NULL;
5273 isl_assert(map1->ctx, isl_dim_equal(map1->dim, map2->dim), goto error);
5275 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
5276 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
5277 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
5279 map = isl_map_alloc_dim(isl_dim_copy(map1->dim),
5280 map1->n + map2->n, flags);
5283 for (i = 0; i < map1->n; ++i) {
5284 map = isl_map_add_basic_map(map,
5285 isl_basic_map_copy(map1->p[i]));
5289 for (i = 0; i < map2->n; ++i) {
5290 map = isl_map_add_basic_map(map,
5291 isl_basic_map_copy(map2->p[i]));
5305 struct isl_map *isl_map_union(struct isl_map *map1, struct isl_map *map2)
5307 map1 = isl_map_union_disjoint(map1, map2);
5311 ISL_F_CLR(map1, ISL_MAP_DISJOINT);
5315 struct isl_set *isl_set_union_disjoint(
5316 struct isl_set *set1, struct isl_set *set2)
5318 return (struct isl_set *)
5319 isl_map_union_disjoint(
5320 (struct isl_map *)set1, (struct isl_map *)set2);
5323 struct isl_set *isl_set_union(struct isl_set *set1, struct isl_set *set2)
5325 return (struct isl_set *)
5326 isl_map_union((struct isl_map *)set1, (struct isl_map *)set2);
5329 struct isl_map *isl_map_intersect_range(
5330 struct isl_map *map, struct isl_set *set)
5333 struct isl_map *result;
5339 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT) &&
5340 ISL_F_ISSET(set, ISL_MAP_DISJOINT))
5341 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
5343 result = isl_map_alloc_dim(isl_dim_copy(map->dim),
5344 map->n * set->n, flags);
5347 for (i = 0; i < map->n; ++i)
5348 for (j = 0; j < set->n; ++j) {
5349 result = isl_map_add_basic_map(result,
5350 isl_basic_map_intersect_range(
5351 isl_basic_map_copy(map->p[i]),
5352 isl_basic_set_copy(set->p[j])));
5365 struct isl_map *isl_map_intersect_domain(
5366 struct isl_map *map, struct isl_set *set)
5368 return isl_map_reverse(
5369 isl_map_intersect_range(isl_map_reverse(map), set));
5372 struct isl_map *isl_map_apply_domain(
5373 struct isl_map *map1, struct isl_map *map2)
5377 map1 = isl_map_reverse(map1);
5378 map1 = isl_map_apply_range(map1, map2);
5379 return isl_map_reverse(map1);
5386 struct isl_map *isl_map_apply_range(
5387 struct isl_map *map1, struct isl_map *map2)
5389 struct isl_dim *dim_result;
5390 struct isl_map *result;
5396 dim_result = isl_dim_join(isl_dim_copy(map1->dim),
5397 isl_dim_copy(map2->dim));
5399 result = isl_map_alloc_dim(dim_result, map1->n * map2->n, 0);
5402 for (i = 0; i < map1->n; ++i)
5403 for (j = 0; j < map2->n; ++j) {
5404 result = isl_map_add_basic_map(result,
5405 isl_basic_map_apply_range(
5406 isl_basic_map_copy(map1->p[i]),
5407 isl_basic_map_copy(map2->p[j])));
5413 if (result && result->n <= 1)
5414 ISL_F_SET(result, ISL_MAP_DISJOINT);
5423 * returns range - domain
5425 struct isl_basic_set *isl_basic_map_deltas(struct isl_basic_map *bmap)
5427 isl_dim *dims, *target_dim;
5428 struct isl_basic_set *bset;
5435 isl_assert(bmap->ctx, isl_dim_tuple_match(bmap->dim, isl_dim_in,
5436 bmap->dim, isl_dim_out),
5438 target_dim = isl_dim_domain(isl_basic_map_get_dim(bmap));
5439 dim = isl_basic_map_n_in(bmap);
5440 nparam = isl_basic_map_n_param(bmap);
5441 bset = isl_basic_set_from_basic_map(bmap);
5442 bset = isl_basic_set_cow(bset);
5443 dims = isl_basic_set_get_dim(bset);
5444 dims = isl_dim_add(dims, isl_dim_set, dim);
5445 bset = isl_basic_set_extend_dim(bset, dims, 0, dim, 0);
5446 bset = isl_basic_set_swap_vars(bset, 2*dim);
5447 for (i = 0; i < dim; ++i) {
5448 int j = isl_basic_map_alloc_equality(
5449 (struct isl_basic_map *)bset);
5452 isl_seq_clr(bset->eq[j], 1 + isl_basic_set_total_dim(bset));
5453 isl_int_set_si(bset->eq[j][1+nparam+i], 1);
5454 isl_int_set_si(bset->eq[j][1+nparam+dim+i], 1);
5455 isl_int_set_si(bset->eq[j][1+nparam+2*dim+i], -1);
5457 bset = isl_basic_set_project_out(bset, isl_dim_set, dim, 2*dim);
5458 bset = isl_basic_set_reset_dim(bset, target_dim);
5461 isl_basic_map_free(bmap);
5466 * returns range - domain
5468 struct isl_set *isl_map_deltas(struct isl_map *map)
5472 struct isl_set *result;
5477 isl_assert(map->ctx, isl_dim_tuple_match(map->dim, isl_dim_in,
5478 map->dim, isl_dim_out),
5480 dim = isl_map_get_dim(map);
5481 dim = isl_dim_domain(dim);
5482 result = isl_set_alloc_dim(dim, map->n, map->flags);
5485 for (i = 0; i < map->n; ++i)
5486 result = isl_set_add_basic_set(result,
5487 isl_basic_map_deltas(isl_basic_map_copy(map->p[i])));
5495 static struct isl_basic_map *basic_map_identity(struct isl_dim *dims)
5497 struct isl_basic_map *bmap;
5505 nparam = dims->nparam;
5507 bmap = isl_basic_map_alloc_dim(dims, 0, dim, 0);
5511 for (i = 0; i < dim; ++i) {
5512 int j = isl_basic_map_alloc_equality(bmap);
5515 isl_seq_clr(bmap->eq[j], 1 + isl_basic_map_total_dim(bmap));
5516 isl_int_set_si(bmap->eq[j][1+nparam+i], 1);
5517 isl_int_set_si(bmap->eq[j][1+nparam+dim+i], -1);
5519 return isl_basic_map_finalize(bmap);
5521 isl_basic_map_free(bmap);
5525 struct isl_basic_map *isl_basic_map_identity(struct isl_dim *set_dim)
5527 struct isl_dim *dim = isl_dim_map(set_dim);
5530 return basic_map_identity(dim);
5533 struct isl_basic_map *isl_basic_map_identity_like(struct isl_basic_map *model)
5535 if (!model || !model->dim)
5537 isl_assert(model->ctx,
5538 model->dim->n_in == model->dim->n_out, return NULL);
5539 return basic_map_identity(isl_dim_copy(model->dim));
5542 static struct isl_map *map_identity(struct isl_dim *dim)
5544 struct isl_map *map = isl_map_alloc_dim(dim, 1, ISL_MAP_DISJOINT);
5545 return isl_map_add_basic_map(map, basic_map_identity(isl_dim_copy(dim)));
5548 struct isl_map *isl_map_identity(struct isl_dim *set_dim)
5550 struct isl_dim *dim = isl_dim_map(set_dim);
5553 return map_identity(dim);
5556 struct isl_map *isl_map_identity_like(struct isl_map *model)
5558 if (!model || !model->dim)
5560 isl_assert(model->ctx,
5561 model->dim->n_in == model->dim->n_out, return NULL);
5562 return map_identity(isl_dim_copy(model->dim));
5565 struct isl_map *isl_map_identity_like_basic_map(struct isl_basic_map *model)
5567 if (!model || !model->dim)
5569 isl_assert(model->ctx,
5570 model->dim->n_in == model->dim->n_out, return NULL);
5571 return map_identity(isl_dim_copy(model->dim));
5574 __isl_give isl_map *isl_set_identity(__isl_take isl_set *set)
5576 isl_dim *dim = isl_set_get_dim(set);
5578 id = isl_map_identity(dim);
5579 return isl_map_intersect_range(id, set);
5582 /* Construct a basic set with all set dimensions having only non-negative
5585 struct isl_basic_set *isl_basic_set_positive_orthant(struct isl_dim *dims)
5590 struct isl_basic_set *bset;
5594 nparam = dims->nparam;
5596 bset = isl_basic_set_alloc_dim(dims, 0, 0, dim);
5599 for (i = 0; i < dim; ++i) {
5600 int k = isl_basic_set_alloc_inequality(bset);
5603 isl_seq_clr(bset->ineq[k], 1 + isl_basic_set_total_dim(bset));
5604 isl_int_set_si(bset->ineq[k][1 + nparam + i], 1);
5608 isl_basic_set_free(bset);
5612 /* Construct the half-space x_pos >= 0.
5614 static __isl_give isl_basic_set *nonneg_halfspace(__isl_take isl_dim *dim,
5618 isl_basic_set *nonneg;
5620 nonneg = isl_basic_set_alloc_dim(dim, 0, 0, 1);
5621 k = isl_basic_set_alloc_inequality(nonneg);
5624 isl_seq_clr(nonneg->ineq[k], 1 + isl_basic_set_total_dim(nonneg));
5625 isl_int_set_si(nonneg->ineq[k][pos], 1);
5627 return isl_basic_set_finalize(nonneg);
5629 isl_basic_set_free(nonneg);
5633 /* Construct the half-space x_pos <= -1.
5635 static __isl_give isl_basic_set *neg_halfspace(__isl_take isl_dim *dim, int pos)
5640 neg = isl_basic_set_alloc_dim(dim, 0, 0, 1);
5641 k = isl_basic_set_alloc_inequality(neg);
5644 isl_seq_clr(neg->ineq[k], 1 + isl_basic_set_total_dim(neg));
5645 isl_int_set_si(neg->ineq[k][0], -1);
5646 isl_int_set_si(neg->ineq[k][pos], -1);
5648 return isl_basic_set_finalize(neg);
5650 isl_basic_set_free(neg);
5654 __isl_give isl_set *isl_set_split_dims(__isl_take isl_set *set,
5655 enum isl_dim_type type, unsigned first, unsigned n)
5658 isl_basic_set *nonneg;
5666 isl_assert(set->ctx, first + n <= isl_set_dim(set, type), goto error);
5668 for (i = 0; i < n; ++i) {
5669 nonneg = nonneg_halfspace(isl_set_get_dim(set),
5670 pos(set->dim, type) + first + i);
5671 neg = neg_halfspace(isl_set_get_dim(set),
5672 pos(set->dim, type) + first + i);
5674 set = isl_set_intersect(set, isl_basic_set_union(nonneg, neg));
5683 static int foreach_orthant(__isl_take isl_set *set, int *signs, int first,
5684 int len, int (*fn)(__isl_take isl_set *orthant, int *signs, void *user),
5691 if (isl_set_fast_is_empty(set)) {
5696 return fn(set, signs, user);
5699 half = isl_set_from_basic_set(nonneg_halfspace(isl_set_get_dim(set),
5701 half = isl_set_intersect(half, isl_set_copy(set));
5702 if (foreach_orthant(half, signs, first + 1, len, fn, user) < 0)
5706 half = isl_set_from_basic_set(neg_halfspace(isl_set_get_dim(set),
5708 half = isl_set_intersect(half, set);
5709 return foreach_orthant(half, signs, first + 1, len, fn, user);
5715 /* Call "fn" on the intersections of "set" with each of the orthants
5716 * (except for obviously empty intersections). The orthant is identified
5717 * by the signs array, with each entry having value 1 or -1 according
5718 * to the sign of the corresponding variable.
5720 int isl_set_foreach_orthant(__isl_keep isl_set *set,
5721 int (*fn)(__isl_take isl_set *orthant, int *signs, void *user),
5731 if (isl_set_fast_is_empty(set))
5734 nparam = isl_set_dim(set, isl_dim_param);
5735 nvar = isl_set_dim(set, isl_dim_set);
5737 signs = isl_alloc_array(set->ctx, int, nparam + nvar);
5739 r = foreach_orthant(isl_set_copy(set), signs, 0, nparam + nvar,
5747 int isl_set_is_equal(struct isl_set *set1, struct isl_set *set2)
5749 return isl_map_is_equal((struct isl_map *)set1, (struct isl_map *)set2);
5752 int isl_basic_map_is_subset(
5753 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
5756 struct isl_map *map1;
5757 struct isl_map *map2;
5759 if (!bmap1 || !bmap2)
5762 map1 = isl_map_from_basic_map(isl_basic_map_copy(bmap1));
5763 map2 = isl_map_from_basic_map(isl_basic_map_copy(bmap2));
5765 is_subset = isl_map_is_subset(map1, map2);
5773 int isl_basic_map_is_equal(
5774 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
5778 if (!bmap1 || !bmap2)
5780 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
5783 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
5787 int isl_basic_set_is_equal(
5788 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
5790 return isl_basic_map_is_equal(
5791 (struct isl_basic_map *)bset1, (struct isl_basic_map *)bset2);
5794 int isl_map_is_empty(struct isl_map *map)
5801 for (i = 0; i < map->n; ++i) {
5802 is_empty = isl_basic_map_is_empty(map->p[i]);
5811 int isl_map_fast_is_empty(struct isl_map *map)
5813 return map ? map->n == 0 : -1;
5816 int isl_set_fast_is_empty(struct isl_set *set)
5818 return set ? set->n == 0 : -1;
5821 int isl_set_is_empty(struct isl_set *set)
5823 return isl_map_is_empty((struct isl_map *)set);
5826 int isl_map_has_equal_dim(__isl_keep isl_map *map1, __isl_keep isl_map *map2)
5831 return isl_dim_equal(map1->dim, map2->dim);
5834 int isl_set_has_equal_dim(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
5839 return isl_dim_equal(set1->dim, set2->dim);
5842 int isl_map_is_equal(struct isl_map *map1, struct isl_map *map2)
5848 is_subset = isl_map_is_subset(map1, map2);
5851 is_subset = isl_map_is_subset(map2, map1);
5855 int isl_basic_map_is_strict_subset(
5856 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
5860 if (!bmap1 || !bmap2)
5862 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
5865 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
5866 if (is_subset == -1)
5871 int isl_map_is_strict_subset(struct isl_map *map1, struct isl_map *map2)
5877 is_subset = isl_map_is_subset(map1, map2);
5880 is_subset = isl_map_is_subset(map2, map1);
5881 if (is_subset == -1)
5886 int isl_set_is_strict_subset(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
5888 return isl_map_is_strict_subset((isl_map *)set1, (isl_map *)set2);
5891 int isl_basic_map_is_universe(struct isl_basic_map *bmap)
5895 return bmap->n_eq == 0 && bmap->n_ineq == 0;
5898 int isl_basic_set_is_universe(struct isl_basic_set *bset)
5902 return bset->n_eq == 0 && bset->n_ineq == 0;
5905 int isl_map_fast_is_universe(__isl_keep isl_map *map)
5912 for (i = 0; i < map->n; ++i) {
5913 int r = isl_basic_map_is_universe(map->p[i]);
5921 int isl_set_fast_is_universe(__isl_keep isl_set *set)
5923 return isl_map_fast_is_universe((isl_map *) set);
5926 int isl_basic_map_is_empty(struct isl_basic_map *bmap)
5928 struct isl_basic_set *bset = NULL;
5929 struct isl_vec *sample = NULL;
5936 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY))
5939 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL)) {
5940 struct isl_basic_map *copy = isl_basic_map_copy(bmap);
5941 copy = isl_basic_map_remove_redundancies(copy);
5942 empty = ISL_F_ISSET(copy, ISL_BASIC_MAP_EMPTY);
5943 isl_basic_map_free(copy);
5947 total = 1 + isl_basic_map_total_dim(bmap);
5948 if (bmap->sample && bmap->sample->size == total) {
5949 int contains = isl_basic_map_contains(bmap, bmap->sample);
5955 isl_vec_free(bmap->sample);
5956 bmap->sample = NULL;
5957 bset = isl_basic_map_underlying_set(isl_basic_map_copy(bmap));
5960 sample = isl_basic_set_sample_vec(bset);
5963 empty = sample->size == 0;
5964 isl_vec_free(bmap->sample);
5965 bmap->sample = sample;
5967 ISL_F_SET(bmap, ISL_BASIC_MAP_EMPTY);
5972 int isl_basic_map_fast_is_empty(struct isl_basic_map *bmap)
5976 return ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY);
5979 int isl_basic_set_fast_is_empty(struct isl_basic_set *bset)
5983 return ISL_F_ISSET(bset, ISL_BASIC_SET_EMPTY);
5986 int isl_basic_set_is_empty(struct isl_basic_set *bset)
5988 return isl_basic_map_is_empty((struct isl_basic_map *)bset);
5991 struct isl_map *isl_basic_map_union(
5992 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
5994 struct isl_map *map;
5995 if (!bmap1 || !bmap2)
5998 isl_assert(bmap1->ctx, isl_dim_equal(bmap1->dim, bmap2->dim), goto error);
6000 map = isl_map_alloc_dim(isl_dim_copy(bmap1->dim), 2, 0);
6003 map = isl_map_add_basic_map(map, bmap1);
6004 map = isl_map_add_basic_map(map, bmap2);
6007 isl_basic_map_free(bmap1);
6008 isl_basic_map_free(bmap2);
6012 struct isl_set *isl_basic_set_union(
6013 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
6015 return (struct isl_set *)isl_basic_map_union(
6016 (struct isl_basic_map *)bset1,
6017 (struct isl_basic_map *)bset2);
6020 /* Order divs such that any div only depends on previous divs */
6021 struct isl_basic_map *isl_basic_map_order_divs(struct isl_basic_map *bmap)
6029 off = isl_dim_total(bmap->dim);
6031 for (i = 0; i < bmap->n_div; ++i) {
6033 if (isl_int_is_zero(bmap->div[i][0]))
6035 pos = isl_seq_first_non_zero(bmap->div[i]+1+1+off+i,
6039 isl_basic_map_swap_div(bmap, i, i + pos);
6045 struct isl_basic_set *isl_basic_set_order_divs(struct isl_basic_set *bset)
6047 return (struct isl_basic_set *)
6048 isl_basic_map_order_divs((struct isl_basic_map *)bset);
6051 __isl_give isl_map *isl_map_order_divs(__isl_take isl_map *map)
6058 for (i = 0; i < map->n; ++i) {
6059 map->p[i] = isl_basic_map_order_divs(map->p[i]);
6070 /* Look for a div in dst that corresponds to the div "div" in src.
6071 * The divs before "div" in src and dst are assumed to be the same.
6073 * Returns -1 if no corresponding div was found and the position
6074 * of the corresponding div in dst otherwise.
6076 static int find_div(struct isl_basic_map *dst,
6077 struct isl_basic_map *src, unsigned div)
6081 unsigned total = isl_dim_total(src->dim);
6083 isl_assert(dst->ctx, div <= dst->n_div, return -1);
6084 for (i = div; i < dst->n_div; ++i)
6085 if (isl_seq_eq(dst->div[i], src->div[div], 1+1+total+div) &&
6086 isl_seq_first_non_zero(dst->div[i]+1+1+total+div,
6087 dst->n_div - div) == -1)
6092 struct isl_basic_map *isl_basic_map_align_divs(
6093 struct isl_basic_map *dst, struct isl_basic_map *src)
6096 unsigned total = isl_dim_total(src->dim);
6101 if (src->n_div == 0)
6104 for (i = 0; i < src->n_div; ++i)
6105 isl_assert(src->ctx, !isl_int_is_zero(src->div[i][0]), goto error);
6107 src = isl_basic_map_order_divs(src);
6108 dst = isl_basic_map_cow(dst);
6109 dst = isl_basic_map_extend_dim(dst, isl_dim_copy(dst->dim),
6110 src->n_div, 0, 2 * src->n_div);
6113 for (i = 0; i < src->n_div; ++i) {
6114 int j = find_div(dst, src, i);
6116 j = isl_basic_map_alloc_div(dst);
6119 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total+i);
6120 isl_seq_clr(dst->div[j]+1+1+total+i, dst->n_div - i);
6121 if (isl_basic_map_add_div_constraints(dst, j) < 0)
6125 isl_basic_map_swap_div(dst, i, j);
6129 isl_basic_map_free(dst);
6133 struct isl_basic_set *isl_basic_set_align_divs(
6134 struct isl_basic_set *dst, struct isl_basic_set *src)
6136 return (struct isl_basic_set *)isl_basic_map_align_divs(
6137 (struct isl_basic_map *)dst, (struct isl_basic_map *)src);
6140 struct isl_map *isl_map_align_divs(struct isl_map *map)
6148 map = isl_map_compute_divs(map);
6149 map = isl_map_cow(map);
6153 for (i = 1; i < map->n; ++i)
6154 map->p[0] = isl_basic_map_align_divs(map->p[0], map->p[i]);
6155 for (i = 1; i < map->n; ++i)
6156 map->p[i] = isl_basic_map_align_divs(map->p[i], map->p[0]);
6158 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
6162 struct isl_set *isl_set_align_divs(struct isl_set *set)
6164 return (struct isl_set *)isl_map_align_divs((struct isl_map *)set);
6167 struct isl_set *isl_set_apply(struct isl_set *set, struct isl_map *map)
6171 isl_assert(set->ctx, isl_map_compatible_domain(map, set), goto error);
6172 map = isl_map_intersect_domain(map, set);
6173 set = isl_map_range(map);
6181 /* There is no need to cow as removing empty parts doesn't change
6182 * the meaning of the set.
6184 struct isl_map *isl_map_remove_empty_parts(struct isl_map *map)
6191 for (i = map->n-1; i >= 0; --i) {
6192 if (!ISL_F_ISSET(map->p[i], ISL_BASIC_MAP_EMPTY))
6194 isl_basic_map_free(map->p[i]);
6195 if (i != map->n-1) {
6196 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
6197 map->p[i] = map->p[map->n-1];
6205 struct isl_set *isl_set_remove_empty_parts(struct isl_set *set)
6207 return (struct isl_set *)
6208 isl_map_remove_empty_parts((struct isl_map *)set);
6211 struct isl_basic_map *isl_map_copy_basic_map(struct isl_map *map)
6213 struct isl_basic_map *bmap;
6214 if (!map || map->n == 0)
6216 bmap = map->p[map->n-1];
6217 isl_assert(map->ctx, ISL_F_ISSET(bmap, ISL_BASIC_SET_FINAL), return NULL);
6218 return isl_basic_map_copy(bmap);
6221 struct isl_basic_set *isl_set_copy_basic_set(struct isl_set *set)
6223 return (struct isl_basic_set *)
6224 isl_map_copy_basic_map((struct isl_map *)set);
6227 __isl_give isl_map *isl_map_drop_basic_map(__isl_take isl_map *map,
6228 __isl_keep isl_basic_map *bmap)
6234 for (i = map->n-1; i >= 0; --i) {
6235 if (map->p[i] != bmap)
6237 map = isl_map_cow(map);
6240 isl_basic_map_free(map->p[i]);
6241 if (i != map->n-1) {
6242 ISL_F_CLR(map, ISL_SET_NORMALIZED);
6243 map->p[i] = map->p[map->n-1];
6254 struct isl_set *isl_set_drop_basic_set(struct isl_set *set,
6255 struct isl_basic_set *bset)
6257 return (struct isl_set *)isl_map_drop_basic_map((struct isl_map *)set,
6258 (struct isl_basic_map *)bset);
6261 /* Given two basic sets bset1 and bset2, compute the maximal difference
6262 * between the values of dimension pos in bset1 and those in bset2
6263 * for any common value of the parameters and dimensions preceding pos.
6265 static enum isl_lp_result basic_set_maximal_difference_at(
6266 __isl_keep isl_basic_set *bset1, __isl_keep isl_basic_set *bset2,
6267 int pos, isl_int *opt)
6269 struct isl_dim *dims;
6270 struct isl_basic_map *bmap1 = NULL;
6271 struct isl_basic_map *bmap2 = NULL;
6272 struct isl_ctx *ctx;
6273 struct isl_vec *obj;
6276 unsigned dim1, dim2;
6277 enum isl_lp_result res;
6279 if (!bset1 || !bset2)
6280 return isl_lp_error;
6282 nparam = isl_basic_set_n_param(bset1);
6283 dim1 = isl_basic_set_n_dim(bset1);
6284 dim2 = isl_basic_set_n_dim(bset2);
6285 dims = isl_dim_alloc(bset1->ctx, nparam, pos, dim1 - pos);
6286 bmap1 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset1), dims);
6287 dims = isl_dim_alloc(bset2->ctx, nparam, pos, dim2 - pos);
6288 bmap2 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset2), dims);
6289 if (!bmap1 || !bmap2)
6291 bmap1 = isl_basic_map_cow(bmap1);
6292 bmap1 = isl_basic_map_extend(bmap1, nparam,
6293 pos, (dim1 - pos) + (dim2 - pos),
6294 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
6295 bmap1 = add_constraints(bmap1, bmap2, 0, dim1 - pos);
6298 total = isl_basic_map_total_dim(bmap1);
6300 obj = isl_vec_alloc(ctx, 1 + total);
6301 isl_seq_clr(obj->block.data, 1 + total);
6302 isl_int_set_si(obj->block.data[1+nparam+pos], 1);
6303 isl_int_set_si(obj->block.data[1+nparam+pos+(dim1-pos)], -1);
6306 res = isl_basic_map_solve_lp(bmap1, 1, obj->block.data, ctx->one,
6308 isl_basic_map_free(bmap1);
6312 isl_basic_map_free(bmap1);
6313 isl_basic_map_free(bmap2);
6314 return isl_lp_error;
6317 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
6318 * for any common value of the parameters and dimensions preceding pos
6319 * in both basic sets, the values of dimension pos in bset1 are
6320 * smaller or larger than those in bset2.
6323 * 1 if bset1 follows bset2
6324 * -1 if bset1 precedes bset2
6325 * 0 if bset1 and bset2 are incomparable
6326 * -2 if some error occurred.
6328 int isl_basic_set_compare_at(struct isl_basic_set *bset1,
6329 struct isl_basic_set *bset2, int pos)
6332 enum isl_lp_result res;
6337 res = basic_set_maximal_difference_at(bset1, bset2, pos, &opt);
6339 if (res == isl_lp_empty)
6341 else if ((res == isl_lp_ok && isl_int_is_pos(opt)) ||
6342 res == isl_lp_unbounded)
6344 else if (res == isl_lp_ok && isl_int_is_neg(opt))
6353 /* Given two basic sets bset1 and bset2, check whether
6354 * for any common value of the parameters and dimensions preceding pos
6355 * there is a value of dimension pos in bset1 that is larger
6356 * than a value of the same dimension in bset2.
6359 * 1 if there exists such a pair
6360 * 0 if there is no such pair, but there is a pair of equal values
6362 * -2 if some error occurred.
6364 int isl_basic_set_follows_at(__isl_keep isl_basic_set *bset1,
6365 __isl_keep isl_basic_set *bset2, int pos)
6368 enum isl_lp_result res;
6373 res = basic_set_maximal_difference_at(bset1, bset2, pos, &opt);
6375 if (res == isl_lp_empty)
6377 else if ((res == isl_lp_ok && isl_int_is_pos(opt)) ||
6378 res == isl_lp_unbounded)
6380 else if (res == isl_lp_ok && isl_int_is_neg(opt))
6382 else if (res == isl_lp_ok)
6391 /* Given two sets set1 and set2, check whether
6392 * for any common value of the parameters and dimensions preceding pos
6393 * there is a value of dimension pos in set1 that is larger
6394 * than a value of the same dimension in set2.
6397 * 1 if there exists such a pair
6398 * 0 if there is no such pair, but there is a pair of equal values
6400 * -2 if some error occurred.
6402 int isl_set_follows_at(__isl_keep isl_set *set1,
6403 __isl_keep isl_set *set2, int pos)
6411 for (i = 0; i < set1->n; ++i)
6412 for (j = 0; j < set2->n; ++j) {
6414 f = isl_basic_set_follows_at(set1->p[i], set2->p[j], pos);
6415 if (f == 1 || f == -2)
6424 static int isl_basic_map_fast_has_fixed_var(struct isl_basic_map *bmap,
6425 unsigned pos, isl_int *val)
6433 total = isl_basic_map_total_dim(bmap);
6434 for (i = 0, d = total-1; i < bmap->n_eq && d+1 > pos; ++i) {
6435 for (; d+1 > pos; --d)
6436 if (!isl_int_is_zero(bmap->eq[i][1+d]))
6440 if (isl_seq_first_non_zero(bmap->eq[i]+1, d) != -1)
6442 if (isl_seq_first_non_zero(bmap->eq[i]+1+d+1, total-d-1) != -1)
6444 if (!isl_int_is_one(bmap->eq[i][1+d]))
6447 isl_int_neg(*val, bmap->eq[i][0]);
6453 static int isl_map_fast_has_fixed_var(struct isl_map *map,
6454 unsigned pos, isl_int *val)
6466 return isl_basic_map_fast_has_fixed_var(map->p[0], pos, val);
6469 fixed = isl_basic_map_fast_has_fixed_var(map->p[0], pos, &v);
6470 for (i = 1; fixed == 1 && i < map->n; ++i) {
6471 fixed = isl_basic_map_fast_has_fixed_var(map->p[i], pos, &tmp);
6472 if (fixed == 1 && isl_int_ne(tmp, v))
6476 isl_int_set(*val, v);
6482 static int isl_basic_set_fast_has_fixed_var(struct isl_basic_set *bset,
6483 unsigned pos, isl_int *val)
6485 return isl_basic_map_fast_has_fixed_var((struct isl_basic_map *)bset,
6489 static int isl_set_fast_has_fixed_var(struct isl_set *set, unsigned pos,
6492 return isl_map_fast_has_fixed_var((struct isl_map *)set, pos, val);
6495 int isl_basic_map_fast_is_fixed(struct isl_basic_map *bmap,
6496 enum isl_dim_type type, unsigned pos, isl_int *val)
6498 if (pos >= isl_basic_map_dim(bmap, type))
6500 return isl_basic_map_fast_has_fixed_var(bmap,
6501 isl_basic_map_offset(bmap, type) - 1 + pos, val);
6504 int isl_map_fast_is_fixed(struct isl_map *map,
6505 enum isl_dim_type type, unsigned pos, isl_int *val)
6507 if (pos >= isl_map_dim(map, type))
6509 return isl_map_fast_has_fixed_var(map,
6510 map_offset(map, type) - 1 + pos, val);
6513 /* Check if dimension dim has fixed value and if so and if val is not NULL,
6514 * then return this fixed value in *val.
6516 int isl_basic_set_fast_dim_is_fixed(struct isl_basic_set *bset, unsigned dim,
6519 return isl_basic_set_fast_has_fixed_var(bset,
6520 isl_basic_set_n_param(bset) + dim, val);
6523 /* Check if dimension dim has fixed value and if so and if val is not NULL,
6524 * then return this fixed value in *val.
6526 int isl_set_fast_dim_is_fixed(struct isl_set *set, unsigned dim, isl_int *val)
6528 return isl_set_fast_has_fixed_var(set, isl_set_n_param(set) + dim, val);
6531 /* Check if input variable in has fixed value and if so and if val is not NULL,
6532 * then return this fixed value in *val.
6534 int isl_map_fast_input_is_fixed(struct isl_map *map, unsigned in, isl_int *val)
6536 return isl_map_fast_has_fixed_var(map, isl_map_n_param(map) + in, val);
6539 /* Check if dimension dim has an (obvious) fixed lower bound and if so
6540 * and if val is not NULL, then return this lower bound in *val.
6542 int isl_basic_set_fast_dim_has_fixed_lower_bound(struct isl_basic_set *bset,
6543 unsigned dim, isl_int *val)
6545 int i, i_eq = -1, i_ineq = -1;
6552 total = isl_basic_set_total_dim(bset);
6553 nparam = isl_basic_set_n_param(bset);
6554 for (i = 0; i < bset->n_eq; ++i) {
6555 if (isl_int_is_zero(bset->eq[i][1+nparam+dim]))
6561 for (i = 0; i < bset->n_ineq; ++i) {
6562 if (!isl_int_is_pos(bset->ineq[i][1+nparam+dim]))
6564 if (i_eq != -1 || i_ineq != -1)
6568 if (i_eq == -1 && i_ineq == -1)
6570 c = i_eq != -1 ? bset->eq[i_eq] : bset->ineq[i_ineq];
6571 /* The coefficient should always be one due to normalization. */
6572 if (!isl_int_is_one(c[1+nparam+dim]))
6574 if (isl_seq_first_non_zero(c+1, nparam+dim) != -1)
6576 if (isl_seq_first_non_zero(c+1+nparam+dim+1,
6577 total - nparam - dim - 1) != -1)
6580 isl_int_neg(*val, c[0]);
6584 int isl_set_fast_dim_has_fixed_lower_bound(struct isl_set *set,
6585 unsigned dim, isl_int *val)
6597 return isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[0],
6601 fixed = isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[0],
6603 for (i = 1; fixed == 1 && i < set->n; ++i) {
6604 fixed = isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[i],
6606 if (fixed == 1 && isl_int_ne(tmp, v))
6610 isl_int_set(*val, v);
6621 static int qsort_constraint_cmp(const void *p1, const void *p2)
6623 const struct constraint *c1 = (const struct constraint *)p1;
6624 const struct constraint *c2 = (const struct constraint *)p2;
6625 unsigned size = isl_min(c1->size, c2->size);
6626 return isl_seq_cmp(c1->c, c2->c, size);
6629 static struct isl_basic_map *isl_basic_map_sort_constraints(
6630 struct isl_basic_map *bmap)
6633 struct constraint *c;
6638 total = isl_basic_map_total_dim(bmap);
6639 c = isl_alloc_array(bmap->ctx, struct constraint, bmap->n_ineq);
6642 for (i = 0; i < bmap->n_ineq; ++i) {
6644 c[i].c = bmap->ineq[i];
6646 qsort(c, bmap->n_ineq, sizeof(struct constraint), qsort_constraint_cmp);
6647 for (i = 0; i < bmap->n_ineq; ++i)
6648 bmap->ineq[i] = c[i].c;
6652 isl_basic_map_free(bmap);
6656 __isl_give isl_basic_set *isl_basic_set_sort_constraints(
6657 __isl_take isl_basic_set *bset)
6659 return (struct isl_basic_set *)isl_basic_map_sort_constraints(
6660 (struct isl_basic_map *)bset);
6663 struct isl_basic_map *isl_basic_map_normalize(struct isl_basic_map *bmap)
6667 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_NORMALIZED))
6669 bmap = isl_basic_map_remove_redundancies(bmap);
6670 bmap = isl_basic_map_sort_constraints(bmap);
6671 ISL_F_SET(bmap, ISL_BASIC_MAP_NORMALIZED);
6675 struct isl_basic_set *isl_basic_set_normalize(struct isl_basic_set *bset)
6677 return (struct isl_basic_set *)isl_basic_map_normalize(
6678 (struct isl_basic_map *)bset);
6681 int isl_basic_map_fast_cmp(const __isl_keep isl_basic_map *bmap1,
6682 const __isl_keep isl_basic_map *bmap2)
6689 if (isl_basic_map_n_param(bmap1) != isl_basic_map_n_param(bmap2))
6690 return isl_basic_map_n_param(bmap1) - isl_basic_map_n_param(bmap2);
6691 if (isl_basic_map_n_in(bmap1) != isl_basic_map_n_in(bmap2))
6692 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
6693 if (isl_basic_map_n_out(bmap1) != isl_basic_map_n_out(bmap2))
6694 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
6695 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY) &&
6696 ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
6698 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY))
6700 if (ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
6702 if (bmap1->n_eq != bmap2->n_eq)
6703 return bmap1->n_eq - bmap2->n_eq;
6704 if (bmap1->n_ineq != bmap2->n_ineq)
6705 return bmap1->n_ineq - bmap2->n_ineq;
6706 if (bmap1->n_div != bmap2->n_div)
6707 return bmap1->n_div - bmap2->n_div;
6708 total = isl_basic_map_total_dim(bmap1);
6709 for (i = 0; i < bmap1->n_eq; ++i) {
6710 cmp = isl_seq_cmp(bmap1->eq[i], bmap2->eq[i], 1+total);
6714 for (i = 0; i < bmap1->n_ineq; ++i) {
6715 cmp = isl_seq_cmp(bmap1->ineq[i], bmap2->ineq[i], 1+total);
6719 for (i = 0; i < bmap1->n_div; ++i) {
6720 cmp = isl_seq_cmp(bmap1->div[i], bmap2->div[i], 1+1+total);
6727 int isl_basic_map_fast_is_equal(__isl_keep isl_basic_map *bmap1,
6728 __isl_keep isl_basic_map *bmap2)
6730 return isl_basic_map_fast_cmp(bmap1, bmap2) == 0;
6733 int isl_basic_set_fast_is_equal(__isl_keep isl_basic_set *bset1,
6734 __isl_keep isl_basic_set *bset2)
6736 return isl_basic_map_fast_is_equal((isl_basic_map *)bset1,
6737 (isl_basic_map *)bset2);
6740 static int qsort_bmap_cmp(const void *p1, const void *p2)
6742 const struct isl_basic_map *bmap1 = *(const struct isl_basic_map **)p1;
6743 const struct isl_basic_map *bmap2 = *(const struct isl_basic_map **)p2;
6745 return isl_basic_map_fast_cmp(bmap1, bmap2);
6748 /* We normalize in place, but if anything goes wrong we need
6749 * to return NULL, so we need to make sure we don't change the
6750 * meaning of any possible other copies of map.
6752 struct isl_map *isl_map_normalize(struct isl_map *map)
6755 struct isl_basic_map *bmap;
6759 if (ISL_F_ISSET(map, ISL_MAP_NORMALIZED))
6761 for (i = 0; i < map->n; ++i) {
6762 bmap = isl_basic_map_normalize(isl_basic_map_copy(map->p[i]));
6765 isl_basic_map_free(map->p[i]);
6768 qsort(map->p, map->n, sizeof(struct isl_basic_map *), qsort_bmap_cmp);
6769 ISL_F_SET(map, ISL_MAP_NORMALIZED);
6770 map = isl_map_remove_empty_parts(map);
6773 for (i = map->n - 1; i >= 1; --i) {
6774 if (!isl_basic_map_fast_is_equal(map->p[i-1], map->p[i]))
6776 isl_basic_map_free(map->p[i-1]);
6777 for (j = i; j < map->n; ++j)
6778 map->p[j-1] = map->p[j];
6788 struct isl_set *isl_set_normalize(struct isl_set *set)
6790 return (struct isl_set *)isl_map_normalize((struct isl_map *)set);
6793 int isl_map_fast_is_equal(struct isl_map *map1, struct isl_map *map2)
6803 if (!isl_dim_equal(map1->dim, map2->dim))
6806 map1 = isl_map_copy(map1);
6807 map2 = isl_map_copy(map2);
6808 map1 = isl_map_normalize(map1);
6809 map2 = isl_map_normalize(map2);
6812 equal = map1->n == map2->n;
6813 for (i = 0; equal && i < map1->n; ++i) {
6814 equal = isl_basic_map_fast_is_equal(map1->p[i], map2->p[i]);
6827 int isl_set_fast_is_equal(struct isl_set *set1, struct isl_set *set2)
6829 return isl_map_fast_is_equal((struct isl_map *)set1,
6830 (struct isl_map *)set2);
6833 /* Return an interval that ranges from min to max (inclusive)
6835 struct isl_basic_set *isl_basic_set_interval(struct isl_ctx *ctx,
6836 isl_int min, isl_int max)
6839 struct isl_basic_set *bset = NULL;
6841 bset = isl_basic_set_alloc(ctx, 0, 1, 0, 0, 2);
6845 k = isl_basic_set_alloc_inequality(bset);
6848 isl_int_set_si(bset->ineq[k][1], 1);
6849 isl_int_neg(bset->ineq[k][0], min);
6851 k = isl_basic_set_alloc_inequality(bset);
6854 isl_int_set_si(bset->ineq[k][1], -1);
6855 isl_int_set(bset->ineq[k][0], max);
6859 isl_basic_set_free(bset);
6863 /* Return the Cartesian product of the basic sets in list (in the given order).
6865 struct isl_basic_set *isl_basic_set_product(struct isl_basic_set_list *list)
6873 struct isl_basic_set *product = NULL;
6877 isl_assert(list->ctx, list->n > 0, goto error);
6878 isl_assert(list->ctx, list->p[0], goto error);
6879 nparam = isl_basic_set_n_param(list->p[0]);
6880 dim = isl_basic_set_n_dim(list->p[0]);
6881 extra = list->p[0]->n_div;
6882 n_eq = list->p[0]->n_eq;
6883 n_ineq = list->p[0]->n_ineq;
6884 for (i = 1; i < list->n; ++i) {
6885 isl_assert(list->ctx, list->p[i], goto error);
6886 isl_assert(list->ctx,
6887 nparam == isl_basic_set_n_param(list->p[i]), goto error);
6888 dim += isl_basic_set_n_dim(list->p[i]);
6889 extra += list->p[i]->n_div;
6890 n_eq += list->p[i]->n_eq;
6891 n_ineq += list->p[i]->n_ineq;
6893 product = isl_basic_set_alloc(list->ctx, nparam, dim, extra,
6898 for (i = 0; i < list->n; ++i) {
6899 isl_basic_set_add_constraints(product,
6900 isl_basic_set_copy(list->p[i]), dim);
6901 dim += isl_basic_set_n_dim(list->p[i]);
6903 isl_basic_set_list_free(list);
6906 isl_basic_set_free(product);
6907 isl_basic_set_list_free(list);
6911 struct isl_basic_map *isl_basic_map_product(
6912 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
6914 struct isl_dim *dim_result = NULL;
6915 struct isl_basic_map *bmap;
6916 unsigned in1, in2, out1, out2, nparam, total, pos;
6917 struct isl_dim_map *dim_map1, *dim_map2;
6919 if (!bmap1 || !bmap2)
6922 isl_assert(bmap1->ctx, isl_dim_match(bmap1->dim, isl_dim_param,
6923 bmap2->dim, isl_dim_param), goto error);
6924 dim_result = isl_dim_product(isl_dim_copy(bmap1->dim),
6925 isl_dim_copy(bmap2->dim));
6927 in1 = isl_basic_map_n_in(bmap1);
6928 in2 = isl_basic_map_n_in(bmap2);
6929 out1 = isl_basic_map_n_out(bmap1);
6930 out2 = isl_basic_map_n_out(bmap2);
6931 nparam = isl_basic_map_n_param(bmap1);
6933 total = nparam + in1 + in2 + out1 + out2 + bmap1->n_div + bmap2->n_div;
6934 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
6935 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
6936 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
6937 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
6938 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
6939 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos += in1);
6940 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += in2);
6941 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += out1);
6942 isl_dim_map_div(dim_map1, bmap1, pos += out2);
6943 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
6945 bmap = isl_basic_map_alloc_dim(dim_result,
6946 bmap1->n_div + bmap2->n_div,
6947 bmap1->n_eq + bmap2->n_eq,
6948 bmap1->n_ineq + bmap2->n_ineq);
6949 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
6950 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
6951 bmap = isl_basic_map_simplify(bmap);
6952 return isl_basic_map_finalize(bmap);
6954 isl_basic_map_free(bmap1);
6955 isl_basic_map_free(bmap2);
6959 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> [B -> D]
6961 struct isl_map *isl_map_product(struct isl_map *map1, struct isl_map *map2)
6964 struct isl_map *result;
6970 isl_assert(map1->ctx, isl_dim_match(map1->dim, isl_dim_param,
6971 map2->dim, isl_dim_param), goto error);
6973 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
6974 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
6975 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
6977 result = isl_map_alloc_dim(isl_dim_product(isl_dim_copy(map1->dim),
6978 isl_dim_copy(map2->dim)),
6979 map1->n * map2->n, flags);
6982 for (i = 0; i < map1->n; ++i)
6983 for (j = 0; j < map2->n; ++j) {
6984 struct isl_basic_map *part;
6985 part = isl_basic_map_product(
6986 isl_basic_map_copy(map1->p[i]),
6987 isl_basic_map_copy(map2->p[j]));
6988 if (isl_basic_map_is_empty(part))
6989 isl_basic_map_free(part);
6991 result = isl_map_add_basic_map(result, part);
7004 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
7006 __isl_give isl_map *isl_map_flat_product(__isl_take isl_map *map1,
7007 __isl_take isl_map *map2)
7011 prod = isl_map_product(map1, map2);
7012 prod = isl_map_flatten(prod);
7016 /* Given two set A and B, construct its Cartesian product A x B.
7018 struct isl_set *isl_set_product(struct isl_set *set1, struct isl_set *set2)
7020 return (struct isl_set *)isl_map_product((struct isl_map *)set1,
7021 (struct isl_map *)set2);
7024 __isl_give isl_set *isl_set_flat_product(__isl_take isl_set *set1,
7025 __isl_take isl_set *set2)
7027 return (isl_set *)isl_map_flat_product((isl_map *)set1, (isl_map *)set2);
7030 uint32_t isl_basic_map_get_hash(__isl_keep isl_basic_map *bmap)
7033 uint32_t hash = isl_hash_init();
7038 bmap = isl_basic_map_copy(bmap);
7039 bmap = isl_basic_map_normalize(bmap);
7042 total = isl_basic_map_total_dim(bmap);
7043 isl_hash_byte(hash, bmap->n_eq & 0xFF);
7044 for (i = 0; i < bmap->n_eq; ++i) {
7046 c_hash = isl_seq_get_hash(bmap->eq[i], 1 + total);
7047 isl_hash_hash(hash, c_hash);
7049 isl_hash_byte(hash, bmap->n_ineq & 0xFF);
7050 for (i = 0; i < bmap->n_ineq; ++i) {
7052 c_hash = isl_seq_get_hash(bmap->ineq[i], 1 + total);
7053 isl_hash_hash(hash, c_hash);
7055 isl_hash_byte(hash, bmap->n_div & 0xFF);
7056 for (i = 0; i < bmap->n_div; ++i) {
7058 if (isl_int_is_zero(bmap->div[i][0]))
7060 isl_hash_byte(hash, i & 0xFF);
7061 c_hash = isl_seq_get_hash(bmap->div[i], 1 + 1 + total);
7062 isl_hash_hash(hash, c_hash);
7064 isl_basic_map_free(bmap);
7068 uint32_t isl_basic_set_get_hash(__isl_keep isl_basic_set *bset)
7070 return isl_basic_map_get_hash((isl_basic_map *)bset);
7073 uint32_t isl_map_get_hash(__isl_keep isl_map *map)
7080 map = isl_map_copy(map);
7081 map = isl_map_normalize(map);
7085 hash = isl_hash_init();
7086 for (i = 0; i < map->n; ++i) {
7088 bmap_hash = isl_basic_map_get_hash(map->p[i]);
7089 isl_hash_hash(hash, bmap_hash);
7097 uint32_t isl_set_get_hash(__isl_keep isl_set *set)
7099 return isl_map_get_hash((isl_map *)set);
7102 /* Check if the value for dimension dim is completely determined
7103 * by the values of the other parameters and variables.
7104 * That is, check if dimension dim is involved in an equality.
7106 int isl_basic_set_dim_is_unique(struct isl_basic_set *bset, unsigned dim)
7113 nparam = isl_basic_set_n_param(bset);
7114 for (i = 0; i < bset->n_eq; ++i)
7115 if (!isl_int_is_zero(bset->eq[i][1 + nparam + dim]))
7120 /* Check if the value for dimension dim is completely determined
7121 * by the values of the other parameters and variables.
7122 * That is, check if dimension dim is involved in an equality
7123 * for each of the subsets.
7125 int isl_set_dim_is_unique(struct isl_set *set, unsigned dim)
7131 for (i = 0; i < set->n; ++i) {
7133 unique = isl_basic_set_dim_is_unique(set->p[i], dim);
7140 int isl_set_n_basic_set(__isl_keep isl_set *set)
7142 return set ? set->n : 0;
7145 int isl_map_foreach_basic_map(__isl_keep isl_map *map,
7146 int (*fn)(__isl_take isl_basic_map *bmap, void *user), void *user)
7153 for (i = 0; i < map->n; ++i)
7154 if (fn(isl_basic_map_copy(map->p[i]), user) < 0)
7160 int isl_set_foreach_basic_set(__isl_keep isl_set *set,
7161 int (*fn)(__isl_take isl_basic_set *bset, void *user), void *user)
7168 for (i = 0; i < set->n; ++i)
7169 if (fn(isl_basic_set_copy(set->p[i]), user) < 0)
7175 __isl_give isl_basic_set *isl_basic_set_lift(__isl_take isl_basic_set *bset)
7177 struct isl_dim *dim;
7182 if (bset->n_div == 0)
7185 bset = isl_basic_set_cow(bset);
7189 dim = isl_basic_set_get_dim(bset);
7190 dim = isl_dim_add(dim, isl_dim_set, bset->n_div);
7193 isl_dim_free(bset->dim);
7195 bset->extra -= bset->n_div;
7198 bset = isl_basic_set_finalize(bset);
7202 isl_basic_set_free(bset);
7206 __isl_give isl_set *isl_set_lift(__isl_take isl_set *set)
7209 struct isl_dim *dim;
7212 set = isl_set_align_divs(set);
7216 if (set->n == 0 || set->p[0]->n_div == 0)
7219 set = isl_set_cow(set);
7223 n_div = set->p[0]->n_div;
7224 dim = isl_set_get_dim(set);
7225 dim = isl_dim_add(dim, isl_dim_set, n_div);
7228 isl_dim_free(set->dim);
7231 for (i = 0; i < set->n; ++i) {
7232 set->p[i] = isl_basic_set_lift(set->p[i]);
7243 __isl_give isl_map *isl_set_lifting(__isl_take isl_set *set)
7245 struct isl_dim *dim;
7246 struct isl_basic_map *bmap;
7253 set = isl_set_align_divs(set);
7258 dim = isl_set_get_dim(set);
7259 if (set->n == 0 || set->p[0]->n_div == 0) {
7261 return isl_map_identity(dim);
7264 n_div = set->p[0]->n_div;
7265 dim = isl_dim_map(dim);
7266 n_param = isl_dim_size(dim, isl_dim_param);
7267 n_set = isl_dim_size(dim, isl_dim_in);
7268 dim = isl_dim_extend(dim, n_param, n_set, n_set + n_div);
7269 bmap = isl_basic_map_alloc_dim(dim, 0, n_set, 2 * n_div);
7270 for (i = 0; i < n_set; ++i)
7271 bmap = var_equal(bmap, i);
7273 total = n_param + n_set + n_set + n_div;
7274 for (i = 0; i < n_div; ++i) {
7275 k = isl_basic_map_alloc_inequality(bmap);
7278 isl_seq_cpy(bmap->ineq[k], set->p[0]->div[i]+1, 1+n_param);
7279 isl_seq_clr(bmap->ineq[k]+1+n_param, n_set);
7280 isl_seq_cpy(bmap->ineq[k]+1+n_param+n_set,
7281 set->p[0]->div[i]+1+1+n_param, n_set + n_div);
7282 isl_int_neg(bmap->ineq[k][1+n_param+n_set+n_set+i],
7283 set->p[0]->div[i][0]);
7285 l = isl_basic_map_alloc_inequality(bmap);
7288 isl_seq_neg(bmap->ineq[l], bmap->ineq[k], 1 + total);
7289 isl_int_add(bmap->ineq[l][0], bmap->ineq[l][0],
7290 set->p[0]->div[i][0]);
7291 isl_int_sub_ui(bmap->ineq[l][0], bmap->ineq[l][0], 1);
7295 return isl_map_from_basic_map(bmap);
7298 isl_basic_map_free(bmap);
7302 int isl_basic_set_size(__isl_keep isl_basic_set *bset)
7310 dim = isl_basic_set_total_dim(bset);
7311 size += bset->n_eq * (1 + dim);
7312 size += bset->n_ineq * (1 + dim);
7313 size += bset->n_div * (2 + dim);
7318 int isl_set_size(__isl_keep isl_set *set)
7326 for (i = 0; i < set->n; ++i)
7327 size += isl_basic_set_size(set->p[i]);
7332 int isl_basic_map_dim_is_bounded(__isl_keep isl_basic_map *bmap,
7333 enum isl_dim_type type, unsigned pos)
7341 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), return -1);
7343 pos += isl_basic_map_offset(bmap, type);
7345 for (i = 0; i < bmap->n_eq; ++i)
7346 if (!isl_int_is_zero(bmap->eq[i][pos]))
7350 for (i = 0; i < bmap->n_ineq; ++i) {
7351 int sgn = isl_int_sgn(bmap->ineq[i][pos]);
7358 return lower && upper;
7361 int isl_map_dim_is_bounded(__isl_keep isl_map *map,
7362 enum isl_dim_type type, unsigned pos)
7369 for (i = 0; i < map->n; ++i) {
7371 bounded = isl_basic_map_dim_is_bounded(map->p[i], type, pos);
7372 if (bounded < 0 || !bounded)
7379 /* Return 1 if the specified dim is involved in both an upper bound
7380 * and a lower bound.
7382 int isl_set_dim_is_bounded(__isl_keep isl_set *set,
7383 enum isl_dim_type type, unsigned pos)
7385 return isl_map_dim_is_bounded((isl_map *)set, type, pos);
7388 /* For each of the "n" variables starting at "first", determine
7389 * the sign of the variable and put the results in the first "n"
7390 * elements of the array "signs".
7392 * 1 means that the variable is non-negative
7393 * -1 means that the variable is non-positive
7394 * 0 means the variable attains both positive and negative values.
7396 int isl_basic_set_vars_get_sign(__isl_keep isl_basic_set *bset,
7397 unsigned first, unsigned n, int *signs)
7399 isl_vec *bound = NULL;
7400 struct isl_tab *tab = NULL;
7401 struct isl_tab_undo *snap;
7404 if (!bset || !signs)
7407 bound = isl_vec_alloc(bset->ctx, 1 + isl_basic_set_total_dim(bset));
7408 tab = isl_tab_from_basic_set(bset);
7412 isl_seq_clr(bound->el, bound->size);
7413 isl_int_set_si(bound->el[0], -1);
7415 snap = isl_tab_snap(tab);
7416 for (i = 0; i < n; ++i) {
7419 isl_int_set_si(bound->el[1 + first + i], -1);
7420 if (isl_tab_add_ineq(tab, bound->el) < 0)
7423 isl_int_set_si(bound->el[1 + first + i], 0);
7424 if (isl_tab_rollback(tab, snap) < 0)
7432 isl_int_set_si(bound->el[1 + first + i], 1);
7433 if (isl_tab_add_ineq(tab, bound->el) < 0)
7436 isl_int_set_si(bound->el[1 + first + i], 0);
7437 if (isl_tab_rollback(tab, snap) < 0)
7440 signs[i] = empty ? -1 : 0;
7444 isl_vec_free(bound);
7448 isl_vec_free(bound);
7452 int isl_basic_set_dims_get_sign(__isl_keep isl_basic_set *bset,
7453 enum isl_dim_type type, unsigned first, unsigned n, int *signs)
7455 if (!bset || !signs)
7457 isl_assert(bset->ctx, first + n <= isl_basic_set_dim(bset, type),
7460 first += pos(bset->dim, type) - 1;
7461 return isl_basic_set_vars_get_sign(bset, first, n, signs);
7464 /* Check if the given map is single-valued.
7469 * and check if the result is a subset of the identity mapping.
7471 int isl_map_is_single_valued(__isl_keep isl_map *map)
7477 test = isl_map_reverse(isl_map_copy(map));
7478 test = isl_map_apply_range(test, isl_map_copy(map));
7480 id = isl_map_identity(isl_dim_range(isl_map_get_dim(map)));
7482 sv = isl_map_is_subset(test, id);
7490 int isl_map_is_bijective(__isl_keep isl_map *map)
7494 sv = isl_map_is_single_valued(map);
7498 map = isl_map_copy(map);
7499 map = isl_map_reverse(map);
7500 sv = isl_map_is_single_valued(map);
7506 int isl_set_is_singleton(__isl_keep isl_set *set)
7508 return isl_map_is_single_valued((isl_map *)set);
7511 int isl_map_is_translation(__isl_keep isl_map *map)
7516 delta = isl_map_deltas(isl_map_copy(map));
7517 ok = isl_set_is_singleton(delta);
7518 isl_set_free(delta);
7523 static int unique(isl_int *p, unsigned pos, unsigned len)
7525 if (isl_seq_first_non_zero(p, pos) != -1)
7527 if (isl_seq_first_non_zero(p + pos + 1, len - pos - 1) != -1)
7532 int isl_basic_set_is_box(__isl_keep isl_basic_set *bset)
7541 if (isl_basic_set_dim(bset, isl_dim_div) != 0)
7544 nvar = isl_basic_set_dim(bset, isl_dim_set);
7545 ovar = isl_dim_offset(bset->dim, isl_dim_set);
7546 for (j = 0; j < nvar; ++j) {
7547 int lower = 0, upper = 0;
7548 for (i = 0; i < bset->n_eq; ++i) {
7549 if (isl_int_is_zero(bset->eq[i][1 + ovar + j]))
7551 if (!unique(bset->eq[i] + 1 + ovar, j, nvar))
7557 for (i = 0; i < bset->n_ineq; ++i) {
7558 if (isl_int_is_zero(bset->ineq[i][1 + ovar + j]))
7560 if (!unique(bset->ineq[i] + 1 + ovar, j, nvar))
7562 if (isl_int_is_pos(bset->ineq[i][1 + ovar + j]))
7567 if (!lower || !upper)
7574 int isl_set_is_box(__isl_keep isl_set *set)
7581 return isl_basic_set_is_box(set->p[0]);
7584 int isl_basic_set_is_wrapping(__isl_keep isl_basic_set *bset)
7589 return isl_dim_is_wrapping(bset->dim);
7592 int isl_set_is_wrapping(__isl_keep isl_set *set)
7597 return isl_dim_is_wrapping(set->dim);
7600 __isl_give isl_basic_set *isl_basic_map_wrap(__isl_take isl_basic_map *bmap)
7602 bmap = isl_basic_map_cow(bmap);
7606 bmap->dim = isl_dim_wrap(bmap->dim);
7610 bmap = isl_basic_map_finalize(bmap);
7612 return (isl_basic_set *)bmap;
7614 isl_basic_map_free(bmap);
7618 __isl_give isl_set *isl_map_wrap(__isl_take isl_map *map)
7622 map = isl_map_cow(map);
7626 for (i = 0; i < map->n; ++i) {
7627 map->p[i] = (isl_basic_map *)isl_basic_map_wrap(map->p[i]);
7631 map->dim = isl_dim_wrap(map->dim);
7635 return (isl_set *)map;
7641 __isl_give isl_basic_map *isl_basic_set_unwrap(__isl_take isl_basic_set *bset)
7643 bset = isl_basic_set_cow(bset);
7647 bset->dim = isl_dim_unwrap(bset->dim);
7651 bset = isl_basic_set_finalize(bset);
7653 return (isl_basic_map *)bset;
7655 isl_basic_set_free(bset);
7659 __isl_give isl_map *isl_set_unwrap(__isl_take isl_set *set)
7666 if (!isl_set_is_wrapping(set))
7667 isl_die(set->ctx, isl_error_invalid, "not a wrapping set",
7670 set = isl_set_cow(set);
7674 for (i = 0; i < set->n; ++i) {
7675 set->p[i] = (isl_basic_set *)isl_basic_set_unwrap(set->p[i]);
7680 set->dim = isl_dim_unwrap(set->dim);
7684 return (isl_map *)set;
7690 __isl_give isl_basic_map *isl_basic_map_reset(__isl_take isl_basic_map *bmap,
7691 enum isl_dim_type type)
7696 if (!isl_dim_is_named_or_nested(bmap->dim, type))
7699 bmap = isl_basic_map_cow(bmap);
7703 bmap->dim = isl_dim_reset(bmap->dim, type);
7707 bmap = isl_basic_map_finalize(bmap);
7711 isl_basic_map_free(bmap);
7715 __isl_give isl_map *isl_map_reset(__isl_take isl_map *map,
7716 enum isl_dim_type type)
7723 if (!isl_dim_is_named_or_nested(map->dim, type))
7726 map = isl_map_cow(map);
7730 for (i = 0; i < map->n; ++i) {
7731 map->p[i] = isl_basic_map_reset(map->p[i], type);
7735 map->dim = isl_dim_reset(map->dim, type);
7745 __isl_give isl_basic_map *isl_basic_map_flatten(__isl_take isl_basic_map *bmap)
7750 if (!bmap->dim->nested[0] && !bmap->dim->nested[1])
7753 bmap = isl_basic_map_cow(bmap);
7757 bmap->dim = isl_dim_flatten(bmap->dim);
7761 bmap = isl_basic_map_finalize(bmap);
7765 isl_basic_map_free(bmap);
7769 __isl_give isl_map *isl_map_flatten(__isl_take isl_map *map)
7776 if (!map->dim->nested[0] && !map->dim->nested[1])
7779 map = isl_map_cow(map);
7783 for (i = 0; i < map->n; ++i) {
7784 map->p[i] = isl_basic_map_flatten(map->p[i]);
7788 map->dim = isl_dim_flatten(map->dim);
7798 __isl_give isl_set *isl_set_flatten(__isl_take isl_set *set)
7800 return (isl_set *)isl_map_flatten((isl_map *)set);
7803 __isl_give isl_map *isl_set_flatten_map(__isl_take isl_set *set)
7805 isl_dim *dim, *flat_dim;
7808 dim = isl_set_get_dim(set);
7809 flat_dim = isl_dim_flatten(isl_dim_copy(dim));
7810 map = map_identity(isl_dim_join(isl_dim_reverse(dim), flat_dim));
7811 map = isl_map_intersect_domain(map, set);
7816 /* Extend the given dim_map with mappings for the divs in bmap.
7818 static __isl_give struct isl_dim_map *extend_dim_map(
7819 __isl_keep struct isl_dim_map *dim_map,
7820 __isl_keep isl_basic_map *bmap)
7823 struct isl_dim_map *res;
7826 offset = isl_basic_map_offset(bmap, isl_dim_div);
7828 res = isl_dim_map_alloc(bmap->ctx, dim_map->len - 1 + bmap->n_div);
7832 for (i = 0; i < dim_map->len; ++i)
7833 res->pos[i] = dim_map->pos[i];
7834 for (i = 0; i < bmap->n_div; ++i)
7835 res->pos[dim_map->len + i] = offset + i;
7840 /* Extract a dim_map from a reordering.
7841 * We essentially need to reverse the mapping, and add an offset
7842 * of 1 for the constant term.
7844 __isl_give struct isl_dim_map *isl_dim_map_from_reordering(
7845 __isl_keep isl_reordering *exp)
7848 struct isl_dim_map *dim_map;
7853 dim_map = isl_dim_map_alloc(exp->dim->ctx, isl_dim_total(exp->dim));
7857 for (i = 0; i < exp->len; ++i)
7858 dim_map->pos[1 + exp->pos[i]] = 1 + i;
7863 /* Reorder the dimensions of "bmap" according to the given dim_map
7864 * and set the dimension specification to "dim".
7866 __isl_give isl_basic_map *isl_basic_map_realign(__isl_take isl_basic_map *bmap,
7867 __isl_take isl_dim *dim, __isl_take struct isl_dim_map *dim_map)
7871 bmap = isl_basic_map_cow(bmap);
7872 if (!bmap || !dim || !dim_map)
7875 res = isl_basic_map_alloc_dim(dim,
7876 bmap->n_div, bmap->n_eq, bmap->n_ineq);
7877 res = add_constraints_dim_map(res, bmap, dim_map);
7878 res = isl_basic_map_finalize(res);
7882 isl_basic_map_free(bmap);
7887 /* Reorder the dimensions of "map" according to given reordering.
7889 __isl_give isl_map *isl_map_realign(__isl_take isl_map *map,
7890 __isl_take isl_reordering *r)
7893 struct isl_dim_map *dim_map;
7895 map = isl_map_cow(map);
7896 dim_map = isl_dim_map_from_reordering(r);
7897 if (!map || !r || !dim_map)
7900 for (i = 0; i < map->n; ++i) {
7901 struct isl_dim_map *dim_map_i;
7903 dim_map_i = extend_dim_map(dim_map, map->p[i]);
7905 map->p[i] = isl_basic_map_realign(map->p[i],
7906 isl_dim_copy(r->dim), dim_map_i);
7912 map = isl_map_reset_dim(map, isl_dim_copy(r->dim));
7914 isl_reordering_free(r);
7920 isl_reordering_free(r);
7924 __isl_give isl_set *isl_set_realign(__isl_take isl_set *set,
7925 __isl_take isl_reordering *r)
7927 return (isl_set *)isl_map_realign((isl_map *)set, r);
7930 __isl_give isl_mat *isl_basic_map_equalities_matrix(
7931 __isl_keep isl_basic_map *bmap, enum isl_dim_type c1,
7932 enum isl_dim_type c2, enum isl_dim_type c3,
7933 enum isl_dim_type c4, enum isl_dim_type c5)
7935 enum isl_dim_type c[5] = { c1, c2, c3, c4, c5 };
7936 struct isl_mat *mat;
7942 mat = isl_mat_alloc(bmap->ctx, bmap->n_eq,
7943 isl_basic_map_total_dim(bmap) + 1);
7946 for (i = 0; i < bmap->n_eq; ++i)
7947 for (j = 0, pos = 0; j < 5; ++j) {
7948 int off = isl_basic_map_offset(bmap, c[j]);
7949 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
7950 isl_int_set(mat->row[i][pos],
7951 bmap->eq[i][off + k]);
7959 __isl_give isl_mat *isl_basic_map_inequalities_matrix(
7960 __isl_keep isl_basic_map *bmap, enum isl_dim_type c1,
7961 enum isl_dim_type c2, enum isl_dim_type c3,
7962 enum isl_dim_type c4, enum isl_dim_type c5)
7964 enum isl_dim_type c[5] = { c1, c2, c3, c4, c5 };
7965 struct isl_mat *mat;
7971 mat = isl_mat_alloc(bmap->ctx, bmap->n_ineq,
7972 isl_basic_map_total_dim(bmap) + 1);
7975 for (i = 0; i < bmap->n_ineq; ++i)
7976 for (j = 0, pos = 0; j < 5; ++j) {
7977 int off = isl_basic_map_offset(bmap, c[j]);
7978 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
7979 isl_int_set(mat->row[i][pos],
7980 bmap->ineq[i][off + k]);
7988 __isl_give isl_basic_map *isl_basic_map_from_constraint_matrices(
7989 __isl_take isl_dim *dim,
7990 __isl_take isl_mat *eq, __isl_take isl_mat *ineq, enum isl_dim_type c1,
7991 enum isl_dim_type c2, enum isl_dim_type c3,
7992 enum isl_dim_type c4, enum isl_dim_type c5)
7994 enum isl_dim_type c[5] = { c1, c2, c3, c4, c5 };
7995 isl_basic_map *bmap;
8001 if (!dim || !eq || !ineq)
8004 if (eq->n_col != ineq->n_col)
8005 isl_die(dim->ctx, isl_error_invalid,
8006 "equalities and inequalities matrices should have "
8007 "same number of columns", goto error);
8009 total = 1 + isl_dim_total(dim);
8011 if (eq->n_col < total)
8012 isl_die(dim->ctx, isl_error_invalid,
8013 "number of columns too small", goto error);
8015 extra = eq->n_col - total;
8017 bmap = isl_basic_map_alloc_dim(isl_dim_copy(dim), extra,
8018 eq->n_row, ineq->n_row);
8021 for (i = 0; i < extra; ++i)
8022 if (isl_basic_map_alloc_div(bmap) < 0)
8024 for (i = 0; i < eq->n_row; ++i) {
8025 l = isl_basic_map_alloc_equality(bmap);
8028 for (j = 0, pos = 0; j < 5; ++j) {
8029 int off = isl_basic_map_offset(bmap, c[j]);
8030 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
8031 isl_int_set(bmap->eq[l][off + k],
8037 for (i = 0; i < ineq->n_row; ++i) {
8038 l = isl_basic_map_alloc_inequality(bmap);
8041 for (j = 0, pos = 0; j < 5; ++j) {
8042 int off = isl_basic_map_offset(bmap, c[j]);
8043 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
8044 isl_int_set(bmap->ineq[l][off + k],
8063 __isl_give isl_mat *isl_basic_set_equalities_matrix(
8064 __isl_keep isl_basic_set *bset, enum isl_dim_type c1,
8065 enum isl_dim_type c2, enum isl_dim_type c3, enum isl_dim_type c4)
8067 return isl_basic_map_equalities_matrix((isl_basic_map *)bset,
8068 c1, c2, c3, c4, isl_dim_in);
8071 __isl_give isl_mat *isl_basic_set_inequalities_matrix(
8072 __isl_keep isl_basic_set *bset, enum isl_dim_type c1,
8073 enum isl_dim_type c2, enum isl_dim_type c3, enum isl_dim_type c4)
8075 return isl_basic_map_inequalities_matrix((isl_basic_map *)bset,
8076 c1, c2, c3, c4, isl_dim_in);
8079 __isl_give isl_basic_set *isl_basic_set_from_constraint_matrices(
8080 __isl_take isl_dim *dim,
8081 __isl_take isl_mat *eq, __isl_take isl_mat *ineq, enum isl_dim_type c1,
8082 enum isl_dim_type c2, enum isl_dim_type c3, enum isl_dim_type c4)
8084 return (isl_basic_set*)
8085 isl_basic_map_from_constraint_matrices(dim, eq, ineq,
8086 c1, c2, c3, c4, isl_dim_in);