2 * Copyright 2008-2009 Katholieke Universiteit Leuven
3 * Copyright 2010 INRIA Saclay
5 * Use of this software is governed by the GNU LGPLv2.1 license
7 * Written by Sven Verdoolaege, K.U.Leuven, Departement
8 * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium
9 * and INRIA Saclay - Ile-de-France, Parc Club Orsay Universite,
10 * ZAC des vignes, 4 rue Jacques Monod, 91893 Orsay, France
17 #include "isl_dim_private.h"
18 #include "isl_equalities.h"
24 #include "isl_map_private.h"
25 #include "isl_map_piplib.h"
26 #include <isl_reordering.h>
27 #include "isl_sample.h"
30 #include <isl_mat_private.h>
32 /* Maps dst positions to src positions */
38 static struct isl_dim_map *isl_dim_map_alloc(struct isl_ctx *ctx, unsigned len)
41 struct isl_dim_map *dim_map;
42 dim_map = isl_alloc(ctx, struct isl_dim_map,
43 sizeof(struct isl_dim_map) + len * sizeof(int));
46 dim_map->len = 1 + len;
48 for (i = 0; i < len; ++i)
49 dim_map->pos[1 + i] = -1;
53 static unsigned n(struct isl_dim *dim, enum isl_dim_type type)
56 case isl_dim_param: return dim->nparam;
57 case isl_dim_in: return dim->n_in;
58 case isl_dim_out: return dim->n_out;
59 case isl_dim_all: return dim->nparam + dim->n_in + dim->n_out;
64 static unsigned pos(struct isl_dim *dim, enum isl_dim_type type)
67 case isl_dim_param: return 1;
68 case isl_dim_in: return 1 + dim->nparam;
69 case isl_dim_out: return 1 + dim->nparam + dim->n_in;
74 static void isl_dim_map_dim_range(struct isl_dim_map *dim_map,
75 struct isl_dim *dim, enum isl_dim_type type,
76 unsigned first, unsigned n, unsigned dst_pos)
84 src_pos = pos(dim, type);
85 for (i = 0; i < n; ++i)
86 dim_map->pos[1 + dst_pos + i] = src_pos + first + i;
89 static void isl_dim_map_dim(struct isl_dim_map *dim_map, struct isl_dim *dim,
90 enum isl_dim_type type, unsigned dst_pos)
92 isl_dim_map_dim_range(dim_map, dim, type, 0, n(dim, type), dst_pos);
95 static void isl_dim_map_div(struct isl_dim_map *dim_map,
96 struct isl_basic_map *bmap, unsigned dst_pos)
101 if (!dim_map || !bmap)
104 src_pos = 1 + isl_dim_total(bmap->dim);
105 for (i = 0; i < bmap->n_div; ++i)
106 dim_map->pos[1 + dst_pos + i] = src_pos + i;
109 static void isl_dim_map_dump(struct isl_dim_map *dim_map)
113 for (i = 0; i < dim_map->len; ++i)
114 fprintf(stderr, "%d -> %d; ", i, dim_map->pos[i]);
115 fprintf(stderr, "\n");
118 unsigned isl_basic_map_dim(const struct isl_basic_map *bmap,
119 enum isl_dim_type type)
124 case isl_dim_cst: return 1;
127 case isl_dim_out: return isl_dim_size(bmap->dim, type);
128 case isl_dim_div: return bmap->n_div;
129 case isl_dim_all: return isl_basic_map_total_dim(bmap);
134 unsigned isl_map_dim(const struct isl_map *map, enum isl_dim_type type)
136 return map ? n(map->dim, type) : 0;
139 unsigned isl_set_dim(const struct isl_set *set, enum isl_dim_type type)
141 return set ? n(set->dim, type) : 0;
144 unsigned isl_basic_map_offset(struct isl_basic_map *bmap,
145 enum isl_dim_type type)
147 struct isl_dim *dim = bmap->dim;
149 case isl_dim_cst: return 0;
150 case isl_dim_param: return 1;
151 case isl_dim_in: return 1 + dim->nparam;
152 case isl_dim_out: return 1 + dim->nparam + dim->n_in;
153 case isl_dim_div: return 1 + dim->nparam + dim->n_in + dim->n_out;
158 static unsigned map_offset(struct isl_map *map, enum isl_dim_type type)
160 return pos(map->dim, type);
163 unsigned isl_basic_set_dim(const struct isl_basic_set *bset,
164 enum isl_dim_type type)
166 return isl_basic_map_dim((const struct isl_basic_map*)bset, type);
169 unsigned isl_basic_set_n_dim(const struct isl_basic_set *bset)
171 return isl_basic_set_dim(bset, isl_dim_set);
174 unsigned isl_basic_set_n_param(const struct isl_basic_set *bset)
176 return isl_basic_set_dim(bset, isl_dim_param);
179 unsigned isl_basic_set_total_dim(const struct isl_basic_set *bset)
181 return isl_dim_total(bset->dim) + bset->n_div;
184 unsigned isl_set_n_dim(const struct isl_set *set)
186 return isl_set_dim(set, isl_dim_set);
189 unsigned isl_set_n_param(const struct isl_set *set)
191 return isl_set_dim(set, isl_dim_param);
194 unsigned isl_basic_map_n_in(const struct isl_basic_map *bmap)
196 return bmap ? bmap->dim->n_in : 0;
199 unsigned isl_basic_map_n_out(const struct isl_basic_map *bmap)
201 return bmap ? bmap->dim->n_out : 0;
204 unsigned isl_basic_map_n_param(const struct isl_basic_map *bmap)
206 return bmap ? bmap->dim->nparam : 0;
209 unsigned isl_basic_map_n_div(const struct isl_basic_map *bmap)
211 return bmap ? bmap->n_div : 0;
214 unsigned isl_basic_map_total_dim(const struct isl_basic_map *bmap)
216 return bmap ? isl_dim_total(bmap->dim) + bmap->n_div : 0;
219 unsigned isl_map_n_in(const struct isl_map *map)
221 return map->dim->n_in;
224 unsigned isl_map_n_out(const struct isl_map *map)
226 return map->dim->n_out;
229 unsigned isl_map_n_param(const struct isl_map *map)
231 return map->dim->nparam;
234 int isl_map_compatible_domain(struct isl_map *map, struct isl_set *set)
239 m = isl_dim_match(map->dim, isl_dim_param, set->dim, isl_dim_param);
242 return isl_dim_tuple_match(map->dim, isl_dim_in, set->dim, isl_dim_set);
245 int isl_basic_map_compatible_domain(struct isl_basic_map *bmap,
246 struct isl_basic_set *bset)
251 m = isl_dim_match(bmap->dim, isl_dim_param, bset->dim, isl_dim_param);
254 return isl_dim_tuple_match(bmap->dim, isl_dim_in, bset->dim, isl_dim_set);
257 int isl_basic_map_compatible_range(struct isl_basic_map *bmap,
258 struct isl_basic_set *bset)
263 m = isl_dim_match(bmap->dim, isl_dim_param, bset->dim, isl_dim_param);
266 return isl_dim_tuple_match(bmap->dim, isl_dim_out, bset->dim, isl_dim_set);
269 isl_ctx *isl_basic_map_get_ctx(__isl_keep isl_basic_map *bmap)
271 return bmap ? bmap->ctx : NULL;
274 isl_ctx *isl_basic_set_get_ctx(__isl_keep isl_basic_set *bset)
276 return bset ? bset->ctx : NULL;
279 isl_ctx *isl_map_get_ctx(__isl_keep isl_map *map)
281 return map ? map->ctx : NULL;
284 isl_ctx *isl_set_get_ctx(__isl_keep isl_set *set)
286 return set ? set->ctx : NULL;
289 struct isl_dim *isl_basic_map_get_dim(struct isl_basic_map *bmap)
293 return isl_dim_copy(bmap->dim);
296 struct isl_dim *isl_basic_set_get_dim(struct isl_basic_set *bset)
300 return isl_dim_copy(bset->dim);
303 struct isl_dim *isl_map_get_dim(struct isl_map *map)
307 return isl_dim_copy(map->dim);
310 struct isl_dim *isl_set_get_dim(struct isl_set *set)
314 return isl_dim_copy(set->dim);
317 __isl_give isl_basic_map *isl_basic_map_set_tuple_name(
318 __isl_take isl_basic_map *bmap, enum isl_dim_type type, const char *s)
320 bmap = isl_basic_map_cow(bmap);
323 bmap->dim = isl_dim_set_tuple_name(bmap->dim, type, s);
328 isl_basic_map_free(bmap);
332 __isl_give isl_map *isl_map_set_tuple_name(__isl_take isl_map *map,
333 enum isl_dim_type type, const char *s)
337 map = isl_map_cow(map);
341 map->dim = isl_dim_set_tuple_name(map->dim, type, s);
345 for (i = 0; i < map->n; ++i) {
346 map->p[i] = isl_basic_map_set_tuple_name(map->p[i], type, s);
357 __isl_give isl_set *isl_set_set_tuple_name(__isl_take isl_set *set,
360 return (isl_set *)isl_map_set_tuple_name((isl_map *)set, isl_dim_set, s);
363 __isl_give isl_basic_map *isl_basic_map_set_dim_name(
364 __isl_take isl_basic_map *bmap,
365 enum isl_dim_type type, unsigned pos, const char *s)
369 bmap->dim = isl_dim_set_name(bmap->dim, type, pos, s);
374 isl_basic_map_free(bmap);
378 __isl_give isl_map *isl_map_set_dim_name(__isl_take isl_map *map,
379 enum isl_dim_type type, unsigned pos, const char *s)
386 map->dim = isl_dim_set_name(map->dim, type, pos, s);
390 for (i = 0; i < map->n; ++i) {
391 map->p[i] = isl_basic_map_set_dim_name(map->p[i], type, pos, s);
402 __isl_give isl_basic_set *isl_basic_set_set_dim_name(
403 __isl_take isl_basic_set *bset,
404 enum isl_dim_type type, unsigned pos, const char *s)
406 return (isl_basic_set *)isl_basic_map_set_dim_name(
407 (isl_basic_map *)bset, type, pos, s);
410 __isl_give isl_set *isl_set_set_dim_name(__isl_take isl_set *set,
411 enum isl_dim_type type, unsigned pos, const char *s)
413 return (isl_set *)isl_map_set_dim_name((isl_map *)set, type, pos, s);
416 int isl_basic_map_is_rational(__isl_keep isl_basic_map *bmap)
420 return ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL);
423 static struct isl_basic_map *basic_map_init(struct isl_ctx *ctx,
424 struct isl_basic_map *bmap, unsigned extra,
425 unsigned n_eq, unsigned n_ineq)
428 size_t row_size = 1 + isl_dim_total(bmap->dim) + extra;
433 bmap->block = isl_blk_alloc(ctx, (n_ineq + n_eq) * row_size);
434 if (isl_blk_is_error(bmap->block))
437 bmap->ineq = isl_alloc_array(ctx, isl_int *, n_ineq + n_eq);
442 bmap->block2 = isl_blk_empty();
445 bmap->block2 = isl_blk_alloc(ctx, extra * (1 + row_size));
446 if (isl_blk_is_error(bmap->block2))
449 bmap->div = isl_alloc_array(ctx, isl_int *, extra);
454 for (i = 0; i < n_ineq + n_eq; ++i)
455 bmap->ineq[i] = bmap->block.data + i * row_size;
457 for (i = 0; i < extra; ++i)
458 bmap->div[i] = bmap->block2.data + i * (1 + row_size);
462 bmap->c_size = n_eq + n_ineq;
463 bmap->eq = bmap->ineq + n_ineq;
472 isl_basic_map_free(bmap);
476 struct isl_basic_set *isl_basic_set_alloc(struct isl_ctx *ctx,
477 unsigned nparam, unsigned dim, unsigned extra,
478 unsigned n_eq, unsigned n_ineq)
480 struct isl_basic_map *bmap;
481 bmap = isl_basic_map_alloc(ctx, nparam, 0, dim, extra, n_eq, n_ineq);
482 return (struct isl_basic_set *)bmap;
485 struct isl_basic_set *isl_basic_set_alloc_dim(struct isl_dim *dim,
486 unsigned extra, unsigned n_eq, unsigned n_ineq)
488 struct isl_basic_map *bmap;
491 isl_assert(dim->ctx, dim->n_in == 0, return NULL);
492 bmap = isl_basic_map_alloc_dim(dim, extra, n_eq, n_ineq);
493 return (struct isl_basic_set *)bmap;
496 struct isl_basic_map *isl_basic_map_alloc_dim(struct isl_dim *dim,
497 unsigned extra, unsigned n_eq, unsigned n_ineq)
499 struct isl_basic_map *bmap;
503 bmap = isl_calloc_type(dim->ctx, struct isl_basic_map);
508 return basic_map_init(dim->ctx, bmap, extra, n_eq, n_ineq);
514 struct isl_basic_map *isl_basic_map_alloc(struct isl_ctx *ctx,
515 unsigned nparam, unsigned in, unsigned out, unsigned extra,
516 unsigned n_eq, unsigned n_ineq)
518 struct isl_basic_map *bmap;
521 dim = isl_dim_alloc(ctx, nparam, in, out);
525 bmap = isl_basic_map_alloc_dim(dim, extra, n_eq, n_ineq);
529 static void dup_constraints(
530 struct isl_basic_map *dst, struct isl_basic_map *src)
533 unsigned total = isl_basic_map_total_dim(src);
535 for (i = 0; i < src->n_eq; ++i) {
536 int j = isl_basic_map_alloc_equality(dst);
537 isl_seq_cpy(dst->eq[j], src->eq[i], 1+total);
540 for (i = 0; i < src->n_ineq; ++i) {
541 int j = isl_basic_map_alloc_inequality(dst);
542 isl_seq_cpy(dst->ineq[j], src->ineq[i], 1+total);
545 for (i = 0; i < src->n_div; ++i) {
546 int j = isl_basic_map_alloc_div(dst);
547 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total);
549 ISL_F_SET(dst, ISL_BASIC_SET_FINAL);
552 struct isl_basic_map *isl_basic_map_dup(struct isl_basic_map *bmap)
554 struct isl_basic_map *dup;
558 dup = isl_basic_map_alloc_dim(isl_dim_copy(bmap->dim),
559 bmap->n_div, bmap->n_eq, bmap->n_ineq);
562 dup_constraints(dup, bmap);
563 dup->flags = bmap->flags;
564 dup->sample = isl_vec_copy(bmap->sample);
568 struct isl_basic_set *isl_basic_set_dup(struct isl_basic_set *bset)
570 struct isl_basic_map *dup;
572 dup = isl_basic_map_dup((struct isl_basic_map *)bset);
573 return (struct isl_basic_set *)dup;
576 struct isl_basic_set *isl_basic_set_copy(struct isl_basic_set *bset)
581 if (ISL_F_ISSET(bset, ISL_BASIC_SET_FINAL)) {
585 return isl_basic_set_dup(bset);
588 struct isl_set *isl_set_copy(struct isl_set *set)
597 struct isl_basic_map *isl_basic_map_copy(struct isl_basic_map *bmap)
602 if (ISL_F_ISSET(bmap, ISL_BASIC_SET_FINAL)) {
606 bmap = isl_basic_map_dup(bmap);
608 ISL_F_SET(bmap, ISL_BASIC_SET_FINAL);
612 struct isl_map *isl_map_copy(struct isl_map *map)
621 void isl_basic_map_free(struct isl_basic_map *bmap)
629 isl_ctx_deref(bmap->ctx);
631 isl_blk_free(bmap->ctx, bmap->block2);
633 isl_blk_free(bmap->ctx, bmap->block);
634 isl_vec_free(bmap->sample);
635 isl_dim_free(bmap->dim);
639 void isl_basic_set_free(struct isl_basic_set *bset)
641 isl_basic_map_free((struct isl_basic_map *)bset);
644 static int room_for_con(struct isl_basic_map *bmap, unsigned n)
646 return bmap->n_eq + bmap->n_ineq + n <= bmap->c_size;
649 int isl_basic_map_alloc_equality(struct isl_basic_map *bmap)
655 isl_assert(ctx, room_for_con(bmap, 1), return -1);
656 isl_assert(ctx, (bmap->eq - bmap->ineq) + bmap->n_eq <= bmap->c_size,
658 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
659 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
660 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_IMPLICIT);
661 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
662 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
663 if ((bmap->eq - bmap->ineq) + bmap->n_eq == bmap->c_size) {
665 int j = isl_basic_map_alloc_inequality(bmap);
669 bmap->ineq[j] = bmap->ineq[bmap->n_ineq - 1];
670 bmap->ineq[bmap->n_ineq - 1] = bmap->eq[-1];
677 isl_seq_clr(bmap->eq[bmap->n_eq] + 1 + isl_basic_map_total_dim(bmap),
678 bmap->extra - bmap->n_div);
682 int isl_basic_set_alloc_equality(struct isl_basic_set *bset)
684 return isl_basic_map_alloc_equality((struct isl_basic_map *)bset);
687 int isl_basic_map_free_equality(struct isl_basic_map *bmap, unsigned n)
691 isl_assert(bmap->ctx, n <= bmap->n_eq, return -1);
696 int isl_basic_set_free_equality(struct isl_basic_set *bset, unsigned n)
698 return isl_basic_map_free_equality((struct isl_basic_map *)bset, n);
701 int isl_basic_map_drop_equality(struct isl_basic_map *bmap, unsigned pos)
706 isl_assert(bmap->ctx, pos < bmap->n_eq, return -1);
708 if (pos != bmap->n_eq - 1) {
710 bmap->eq[pos] = bmap->eq[bmap->n_eq - 1];
711 bmap->eq[bmap->n_eq - 1] = t;
717 int isl_basic_set_drop_equality(struct isl_basic_set *bset, unsigned pos)
719 return isl_basic_map_drop_equality((struct isl_basic_map *)bset, pos);
722 void isl_basic_map_inequality_to_equality(
723 struct isl_basic_map *bmap, unsigned pos)
728 bmap->ineq[pos] = bmap->ineq[bmap->n_ineq - 1];
729 bmap->ineq[bmap->n_ineq - 1] = bmap->eq[-1];
734 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
735 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
736 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
737 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
740 static int room_for_ineq(struct isl_basic_map *bmap, unsigned n)
742 return bmap->n_ineq + n <= bmap->eq - bmap->ineq;
745 int isl_basic_map_alloc_inequality(struct isl_basic_map *bmap)
751 isl_assert(ctx, room_for_ineq(bmap, 1), return -1);
752 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_IMPLICIT);
753 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
754 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
755 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
756 isl_seq_clr(bmap->ineq[bmap->n_ineq] +
757 1 + isl_basic_map_total_dim(bmap),
758 bmap->extra - bmap->n_div);
759 return bmap->n_ineq++;
762 int isl_basic_set_alloc_inequality(struct isl_basic_set *bset)
764 return isl_basic_map_alloc_inequality((struct isl_basic_map *)bset);
767 int isl_basic_map_free_inequality(struct isl_basic_map *bmap, unsigned n)
771 isl_assert(bmap->ctx, n <= bmap->n_ineq, return -1);
776 int isl_basic_set_free_inequality(struct isl_basic_set *bset, unsigned n)
778 return isl_basic_map_free_inequality((struct isl_basic_map *)bset, n);
781 int isl_basic_map_drop_inequality(struct isl_basic_map *bmap, unsigned pos)
786 isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
788 if (pos != bmap->n_ineq - 1) {
790 bmap->ineq[pos] = bmap->ineq[bmap->n_ineq - 1];
791 bmap->ineq[bmap->n_ineq - 1] = t;
792 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
798 int isl_basic_set_drop_inequality(struct isl_basic_set *bset, unsigned pos)
800 return isl_basic_map_drop_inequality((struct isl_basic_map *)bset, pos);
803 __isl_give isl_basic_map *isl_basic_map_add_eq(__isl_take isl_basic_map *bmap,
808 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
811 k = isl_basic_map_alloc_equality(bmap);
814 isl_seq_cpy(bmap->eq[k], eq, 1 + isl_basic_map_total_dim(bmap));
817 isl_basic_map_free(bmap);
821 __isl_give isl_basic_set *isl_basic_set_add_eq(__isl_take isl_basic_set *bset,
824 return (isl_basic_set *)
825 isl_basic_map_add_eq((isl_basic_map *)bset, eq);
828 __isl_give isl_basic_map *isl_basic_map_add_ineq(__isl_take isl_basic_map *bmap,
833 bmap = isl_basic_map_extend_constraints(bmap, 0, 1);
836 k = isl_basic_map_alloc_inequality(bmap);
839 isl_seq_cpy(bmap->ineq[k], ineq, 1 + isl_basic_map_total_dim(bmap));
842 isl_basic_map_free(bmap);
846 __isl_give isl_basic_set *isl_basic_set_add_ineq(__isl_take isl_basic_set *bset,
849 return (isl_basic_set *)
850 isl_basic_map_add_ineq((isl_basic_map *)bset, ineq);
853 int isl_basic_map_alloc_div(struct isl_basic_map *bmap)
857 isl_assert(bmap->ctx, bmap->n_div < bmap->extra, return -1);
858 isl_seq_clr(bmap->div[bmap->n_div] +
859 1 + 1 + isl_basic_map_total_dim(bmap),
860 bmap->extra - bmap->n_div);
861 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
862 return bmap->n_div++;
865 int isl_basic_set_alloc_div(struct isl_basic_set *bset)
867 return isl_basic_map_alloc_div((struct isl_basic_map *)bset);
870 int isl_basic_map_free_div(struct isl_basic_map *bmap, unsigned n)
874 isl_assert(bmap->ctx, n <= bmap->n_div, return -1);
879 int isl_basic_set_free_div(struct isl_basic_set *bset, unsigned n)
881 return isl_basic_map_free_div((struct isl_basic_map *)bset, n);
884 /* Copy constraint from src to dst, putting the vars of src at offset
885 * dim_off in dst and the divs of src at offset div_off in dst.
886 * If both sets are actually map, then dim_off applies to the input
889 static void copy_constraint(struct isl_basic_map *dst_map, isl_int *dst,
890 struct isl_basic_map *src_map, isl_int *src,
891 unsigned in_off, unsigned out_off, unsigned div_off)
893 unsigned src_nparam = isl_basic_map_n_param(src_map);
894 unsigned dst_nparam = isl_basic_map_n_param(dst_map);
895 unsigned src_in = isl_basic_map_n_in(src_map);
896 unsigned dst_in = isl_basic_map_n_in(dst_map);
897 unsigned src_out = isl_basic_map_n_out(src_map);
898 unsigned dst_out = isl_basic_map_n_out(dst_map);
899 isl_int_set(dst[0], src[0]);
900 isl_seq_cpy(dst+1, src+1, isl_min(dst_nparam, src_nparam));
901 if (dst_nparam > src_nparam)
902 isl_seq_clr(dst+1+src_nparam,
903 dst_nparam - src_nparam);
904 isl_seq_clr(dst+1+dst_nparam, in_off);
905 isl_seq_cpy(dst+1+dst_nparam+in_off,
907 isl_min(dst_in-in_off, src_in));
908 if (dst_in-in_off > src_in)
909 isl_seq_clr(dst+1+dst_nparam+in_off+src_in,
910 dst_in - in_off - src_in);
911 isl_seq_clr(dst+1+dst_nparam+dst_in, out_off);
912 isl_seq_cpy(dst+1+dst_nparam+dst_in+out_off,
913 src+1+src_nparam+src_in,
914 isl_min(dst_out-out_off, src_out));
915 if (dst_out-out_off > src_out)
916 isl_seq_clr(dst+1+dst_nparam+dst_in+out_off+src_out,
917 dst_out - out_off - src_out);
918 isl_seq_clr(dst+1+dst_nparam+dst_in+dst_out, div_off);
919 isl_seq_cpy(dst+1+dst_nparam+dst_in+dst_out+div_off,
920 src+1+src_nparam+src_in+src_out,
921 isl_min(dst_map->extra-div_off, src_map->n_div));
922 if (dst_map->n_div-div_off > src_map->n_div)
923 isl_seq_clr(dst+1+dst_nparam+dst_in+dst_out+
924 div_off+src_map->n_div,
925 dst_map->n_div - div_off - src_map->n_div);
928 static void copy_div(struct isl_basic_map *dst_map, isl_int *dst,
929 struct isl_basic_map *src_map, isl_int *src,
930 unsigned in_off, unsigned out_off, unsigned div_off)
932 isl_int_set(dst[0], src[0]);
933 copy_constraint(dst_map, dst+1, src_map, src+1, in_off, out_off, div_off);
936 static struct isl_basic_map *add_constraints(struct isl_basic_map *bmap1,
937 struct isl_basic_map *bmap2, unsigned i_pos, unsigned o_pos)
942 if (!bmap1 || !bmap2)
945 div_off = bmap1->n_div;
947 for (i = 0; i < bmap2->n_eq; ++i) {
948 int i1 = isl_basic_map_alloc_equality(bmap1);
951 copy_constraint(bmap1, bmap1->eq[i1], bmap2, bmap2->eq[i],
952 i_pos, o_pos, div_off);
955 for (i = 0; i < bmap2->n_ineq; ++i) {
956 int i1 = isl_basic_map_alloc_inequality(bmap1);
959 copy_constraint(bmap1, bmap1->ineq[i1], bmap2, bmap2->ineq[i],
960 i_pos, o_pos, div_off);
963 for (i = 0; i < bmap2->n_div; ++i) {
964 int i1 = isl_basic_map_alloc_div(bmap1);
967 copy_div(bmap1, bmap1->div[i1], bmap2, bmap2->div[i],
968 i_pos, o_pos, div_off);
971 isl_basic_map_free(bmap2);
976 isl_basic_map_free(bmap1);
977 isl_basic_map_free(bmap2);
981 static void copy_constraint_dim_map(isl_int *dst, isl_int *src,
982 struct isl_dim_map *dim_map)
986 for (i = 0; i < dim_map->len; ++i) {
987 if (dim_map->pos[i] < 0)
988 isl_int_set_si(dst[i], 0);
990 isl_int_set(dst[i], src[dim_map->pos[i]]);
994 static void copy_div_dim_map(isl_int *dst, isl_int *src,
995 struct isl_dim_map *dim_map)
997 isl_int_set(dst[0], src[0]);
998 copy_constraint_dim_map(dst+1, src+1, dim_map);
1001 static struct isl_basic_map *add_constraints_dim_map(struct isl_basic_map *dst,
1002 struct isl_basic_map *src, struct isl_dim_map *dim_map)
1006 if (!src || !dst || !dim_map)
1009 for (i = 0; i < src->n_eq; ++i) {
1010 int i1 = isl_basic_map_alloc_equality(dst);
1013 copy_constraint_dim_map(dst->eq[i1], src->eq[i], dim_map);
1016 for (i = 0; i < src->n_ineq; ++i) {
1017 int i1 = isl_basic_map_alloc_inequality(dst);
1020 copy_constraint_dim_map(dst->ineq[i1], src->ineq[i], dim_map);
1023 for (i = 0; i < src->n_div; ++i) {
1024 int i1 = isl_basic_map_alloc_div(dst);
1027 copy_div_dim_map(dst->div[i1], src->div[i], dim_map);
1031 isl_basic_map_free(src);
1036 isl_basic_map_free(src);
1037 isl_basic_map_free(dst);
1041 struct isl_basic_set *isl_basic_set_add_constraints(struct isl_basic_set *bset1,
1042 struct isl_basic_set *bset2, unsigned pos)
1044 return (struct isl_basic_set *)
1045 add_constraints((struct isl_basic_map *)bset1,
1046 (struct isl_basic_map *)bset2, 0, pos);
1049 struct isl_basic_map *isl_basic_map_extend_dim(struct isl_basic_map *base,
1050 struct isl_dim *dim, unsigned extra,
1051 unsigned n_eq, unsigned n_ineq)
1053 struct isl_basic_map *ext;
1063 dims_ok = isl_dim_equal(base->dim, dim) &&
1064 base->extra >= base->n_div + extra;
1066 if (dims_ok && room_for_con(base, n_eq + n_ineq) &&
1067 room_for_ineq(base, n_ineq)) {
1072 isl_assert(base->ctx, base->dim->nparam <= dim->nparam, goto error);
1073 isl_assert(base->ctx, base->dim->n_in <= dim->n_in, goto error);
1074 isl_assert(base->ctx, base->dim->n_out <= dim->n_out, goto error);
1075 extra += base->extra;
1077 n_ineq += base->n_ineq;
1079 ext = isl_basic_map_alloc_dim(dim, extra, n_eq, n_ineq);
1085 ext->sample = isl_vec_copy(base->sample);
1086 flags = base->flags;
1087 ext = add_constraints(ext, base, 0, 0);
1090 ISL_F_CLR(ext, ISL_BASIC_SET_FINAL);
1097 isl_basic_map_free(base);
1101 struct isl_basic_set *isl_basic_set_extend_dim(struct isl_basic_set *base,
1102 struct isl_dim *dim, unsigned extra,
1103 unsigned n_eq, unsigned n_ineq)
1105 return (struct isl_basic_set *)
1106 isl_basic_map_extend_dim((struct isl_basic_map *)base, dim,
1107 extra, n_eq, n_ineq);
1110 struct isl_basic_map *isl_basic_map_extend_constraints(
1111 struct isl_basic_map *base, unsigned n_eq, unsigned n_ineq)
1115 return isl_basic_map_extend_dim(base, isl_dim_copy(base->dim),
1119 struct isl_basic_map *isl_basic_map_extend(struct isl_basic_map *base,
1120 unsigned nparam, unsigned n_in, unsigned n_out, unsigned extra,
1121 unsigned n_eq, unsigned n_ineq)
1123 struct isl_basic_map *bmap;
1124 struct isl_dim *dim;
1128 dim = isl_dim_alloc(base->ctx, nparam, n_in, n_out);
1132 bmap = isl_basic_map_extend_dim(base, dim, extra, n_eq, n_ineq);
1135 isl_basic_map_free(base);
1139 struct isl_basic_set *isl_basic_set_extend(struct isl_basic_set *base,
1140 unsigned nparam, unsigned dim, unsigned extra,
1141 unsigned n_eq, unsigned n_ineq)
1143 return (struct isl_basic_set *)
1144 isl_basic_map_extend((struct isl_basic_map *)base,
1145 nparam, 0, dim, extra, n_eq, n_ineq);
1148 struct isl_basic_set *isl_basic_set_extend_constraints(
1149 struct isl_basic_set *base, unsigned n_eq, unsigned n_ineq)
1151 return (struct isl_basic_set *)
1152 isl_basic_map_extend_constraints((struct isl_basic_map *)base,
1156 struct isl_basic_set *isl_basic_set_cow(struct isl_basic_set *bset)
1158 return (struct isl_basic_set *)
1159 isl_basic_map_cow((struct isl_basic_map *)bset);
1162 struct isl_basic_map *isl_basic_map_cow(struct isl_basic_map *bmap)
1167 if (bmap->ref > 1) {
1169 bmap = isl_basic_map_dup(bmap);
1172 ISL_F_CLR(bmap, ISL_BASIC_SET_FINAL);
1176 struct isl_set *isl_set_cow(struct isl_set *set)
1184 return isl_set_dup(set);
1187 struct isl_map *isl_map_cow(struct isl_map *map)
1195 return isl_map_dup(map);
1198 static void swap_vars(struct isl_blk blk, isl_int *a,
1199 unsigned a_len, unsigned b_len)
1201 isl_seq_cpy(blk.data, a+a_len, b_len);
1202 isl_seq_cpy(blk.data+b_len, a, a_len);
1203 isl_seq_cpy(a, blk.data, b_len+a_len);
1206 struct isl_basic_set *isl_basic_set_swap_vars(
1207 struct isl_basic_set *bset, unsigned n)
1217 nparam = isl_basic_set_n_param(bset);
1218 dim = isl_basic_set_n_dim(bset);
1219 isl_assert(bset->ctx, n <= dim, goto error);
1224 bset = isl_basic_set_cow(bset);
1228 blk = isl_blk_alloc(bset->ctx, dim);
1229 if (isl_blk_is_error(blk))
1232 for (i = 0; i < bset->n_eq; ++i)
1234 bset->eq[i]+1+nparam, n, dim - n);
1236 for (i = 0; i < bset->n_ineq; ++i)
1238 bset->ineq[i]+1+nparam, n, dim - n);
1240 for (i = 0; i < bset->n_div; ++i)
1242 bset->div[i]+1+1+nparam, n, dim - n);
1244 isl_blk_free(bset->ctx, blk);
1246 ISL_F_CLR(bset, ISL_BASIC_SET_NORMALIZED);
1247 bset = isl_basic_set_gauss(bset, NULL);
1248 return isl_basic_set_finalize(bset);
1250 isl_basic_set_free(bset);
1254 struct isl_set *isl_set_swap_vars(struct isl_set *set, unsigned n)
1257 set = isl_set_cow(set);
1261 for (i = 0; i < set->n; ++i) {
1262 set->p[i] = isl_basic_set_swap_vars(set->p[i], n);
1268 ISL_F_CLR(set, ISL_SET_NORMALIZED);
1272 struct isl_basic_map *isl_basic_map_set_to_empty(struct isl_basic_map *bmap)
1278 total = isl_basic_map_total_dim(bmap);
1279 isl_basic_map_free_div(bmap, bmap->n_div);
1280 isl_basic_map_free_inequality(bmap, bmap->n_ineq);
1282 isl_basic_map_free_equality(bmap, bmap->n_eq-1);
1284 i = isl_basic_map_alloc_equality(bmap);
1288 isl_int_set_si(bmap->eq[i][0], 1);
1289 isl_seq_clr(bmap->eq[i]+1, total);
1290 ISL_F_SET(bmap, ISL_BASIC_MAP_EMPTY);
1291 isl_vec_free(bmap->sample);
1292 bmap->sample = NULL;
1293 return isl_basic_map_finalize(bmap);
1295 isl_basic_map_free(bmap);
1299 struct isl_basic_set *isl_basic_set_set_to_empty(struct isl_basic_set *bset)
1301 return (struct isl_basic_set *)
1302 isl_basic_map_set_to_empty((struct isl_basic_map *)bset);
1305 void isl_basic_map_swap_div(struct isl_basic_map *bmap, int a, int b)
1308 unsigned off = isl_dim_total(bmap->dim);
1309 isl_int *t = bmap->div[a];
1310 bmap->div[a] = bmap->div[b];
1313 for (i = 0; i < bmap->n_eq; ++i)
1314 isl_int_swap(bmap->eq[i][1+off+a], bmap->eq[i][1+off+b]);
1316 for (i = 0; i < bmap->n_ineq; ++i)
1317 isl_int_swap(bmap->ineq[i][1+off+a], bmap->ineq[i][1+off+b]);
1319 for (i = 0; i < bmap->n_div; ++i)
1320 isl_int_swap(bmap->div[i][1+1+off+a], bmap->div[i][1+1+off+b]);
1321 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1324 /* Eliminate the specified n dimensions starting at first from the
1325 * constraints using Fourier-Motzkin. The dimensions themselves
1328 __isl_give isl_map *isl_map_eliminate(__isl_take isl_map *map,
1329 enum isl_dim_type type, unsigned first, unsigned n)
1338 map = isl_map_cow(map);
1341 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
1342 first += pos(map->dim, type) - 1;
1344 for (i = 0; i < map->n; ++i) {
1345 map->p[i] = isl_basic_map_eliminate_vars(map->p[i], first, n);
1355 /* Eliminate the specified n dimensions starting at first from the
1356 * constraints using Fourier-Motzkin. The dimensions themselves
1359 __isl_give isl_set *isl_set_eliminate(__isl_take isl_set *set,
1360 enum isl_dim_type type, unsigned first, unsigned n)
1362 return (isl_set *)isl_map_eliminate((isl_map *)set, type, first, n);
1365 /* Eliminate the specified n dimensions starting at first from the
1366 * constraints using Fourier-Motzkin. The dimensions themselves
1369 __isl_give isl_set *isl_set_eliminate_dims(__isl_take isl_set *set,
1370 unsigned first, unsigned n)
1372 return isl_set_eliminate(set, isl_dim_set, first, n);
1375 /* Project out n dimensions starting at first using Fourier-Motzkin */
1376 struct isl_set *isl_set_remove_dims(struct isl_set *set,
1377 unsigned first, unsigned n)
1379 set = isl_set_eliminate_dims(set, first, n);
1380 set = isl_set_drop_dims(set, first, n);
1384 struct isl_basic_set *isl_basic_set_remove_divs(struct isl_basic_set *bset)
1386 bset = isl_basic_set_eliminate_vars(bset, isl_dim_total(bset->dim),
1394 struct isl_set *isl_set_remove_divs(struct isl_set *set)
1403 set = isl_set_cow(set);
1407 for (i = 0; i < set->n; ++i) {
1408 set->p[i] = isl_basic_set_remove_divs(set->p[i]);
1418 struct isl_basic_map *isl_basic_map_remove(struct isl_basic_map *bmap,
1419 enum isl_dim_type type, unsigned first, unsigned n)
1423 isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
1427 bmap = isl_basic_map_eliminate_vars(bmap,
1428 isl_basic_map_offset(bmap, type) - 1 + first, n);
1431 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY) && type == isl_dim_div)
1433 bmap = isl_basic_map_drop(bmap, type, first, n);
1436 isl_basic_map_free(bmap);
1440 __isl_give isl_basic_set *isl_basic_set_remove(__isl_take isl_basic_set *bset,
1441 enum isl_dim_type type, unsigned first, unsigned n)
1443 return (isl_basic_set *)
1444 isl_basic_map_remove((isl_basic_map *)bset, type, first, n);
1447 struct isl_map *isl_map_remove(struct isl_map *map,
1448 enum isl_dim_type type, unsigned first, unsigned n)
1455 map = isl_map_cow(map);
1458 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
1460 for (i = 0; i < map->n; ++i) {
1461 map->p[i] = isl_basic_map_eliminate_vars(map->p[i],
1462 isl_basic_map_offset(map->p[i], type) - 1 + first, n);
1466 map = isl_map_drop(map, type, first, n);
1473 __isl_give isl_set *isl_set_remove(__isl_take isl_set *bset,
1474 enum isl_dim_type type, unsigned first, unsigned n)
1476 return (isl_set *)isl_map_remove((isl_map *)bset, type, first, n);
1479 /* Project out n inputs starting at first using Fourier-Motzkin */
1480 struct isl_map *isl_map_remove_inputs(struct isl_map *map,
1481 unsigned first, unsigned n)
1483 return isl_map_remove(map, isl_dim_in, first, n);
1486 /* Project out n dimensions starting at first using Fourier-Motzkin */
1487 struct isl_basic_set *isl_basic_set_remove_dims(struct isl_basic_set *bset,
1488 unsigned first, unsigned n)
1490 unsigned nparam = isl_basic_set_n_param(bset);
1491 bset = isl_basic_set_eliminate_vars(bset, nparam + first, n);
1492 bset = isl_basic_set_drop_dims(bset, first, n);
1496 static void dump_term(struct isl_basic_map *bmap,
1497 isl_int c, int pos, FILE *out)
1500 unsigned in = isl_basic_map_n_in(bmap);
1501 unsigned dim = in + isl_basic_map_n_out(bmap);
1502 unsigned nparam = isl_basic_map_n_param(bmap);
1504 isl_int_print(out, c, 0);
1506 if (!isl_int_is_one(c))
1507 isl_int_print(out, c, 0);
1508 if (pos < 1 + nparam) {
1509 name = isl_dim_get_name(bmap->dim,
1510 isl_dim_param, pos - 1);
1512 fprintf(out, "%s", name);
1514 fprintf(out, "p%d", pos - 1);
1515 } else if (pos < 1 + nparam + in)
1516 fprintf(out, "i%d", pos - 1 - nparam);
1517 else if (pos < 1 + nparam + dim)
1518 fprintf(out, "o%d", pos - 1 - nparam - in);
1520 fprintf(out, "e%d", pos - 1 - nparam - dim);
1524 static void dump_constraint_sign(struct isl_basic_map *bmap, isl_int *c,
1525 int sign, FILE *out)
1529 unsigned len = 1 + isl_basic_map_total_dim(bmap);
1533 for (i = 0, first = 1; i < len; ++i) {
1534 if (isl_int_sgn(c[i]) * sign <= 0)
1537 fprintf(out, " + ");
1539 isl_int_abs(v, c[i]);
1540 dump_term(bmap, v, i, out);
1547 static void dump_constraint(struct isl_basic_map *bmap, isl_int *c,
1548 const char *op, FILE *out, int indent)
1552 fprintf(out, "%*s", indent, "");
1554 dump_constraint_sign(bmap, c, 1, out);
1555 fprintf(out, " %s ", op);
1556 dump_constraint_sign(bmap, c, -1, out);
1560 for (i = bmap->n_div; i < bmap->extra; ++i) {
1561 if (isl_int_is_zero(c[1+isl_dim_total(bmap->dim)+i]))
1563 fprintf(out, "%*s", indent, "");
1564 fprintf(out, "ERROR: unused div coefficient not zero\n");
1569 static void dump_constraints(struct isl_basic_map *bmap,
1570 isl_int **c, unsigned n,
1571 const char *op, FILE *out, int indent)
1575 for (i = 0; i < n; ++i)
1576 dump_constraint(bmap, c[i], op, out, indent);
1579 static void dump_affine(struct isl_basic_map *bmap, isl_int *exp, FILE *out)
1583 unsigned total = isl_basic_map_total_dim(bmap);
1585 for (j = 0; j < 1 + total; ++j) {
1586 if (isl_int_is_zero(exp[j]))
1588 if (!first && isl_int_is_pos(exp[j]))
1590 dump_term(bmap, exp[j], j, out);
1595 static void dump(struct isl_basic_map *bmap, FILE *out, int indent)
1599 dump_constraints(bmap, bmap->eq, bmap->n_eq, "=", out, indent);
1600 dump_constraints(bmap, bmap->ineq, bmap->n_ineq, ">=", out, indent);
1602 for (i = 0; i < bmap->n_div; ++i) {
1603 fprintf(out, "%*s", indent, "");
1604 fprintf(out, "e%d = [(", i);
1605 dump_affine(bmap, bmap->div[i]+1, out);
1607 isl_int_print(out, bmap->div[i][0], 0);
1608 fprintf(out, "]\n");
1612 void isl_basic_set_dump(struct isl_basic_set *bset, FILE *out, int indent)
1615 fprintf(out, "null basic set\n");
1619 fprintf(out, "%*s", indent, "");
1620 fprintf(out, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n",
1621 bset->ref, bset->dim->nparam, bset->dim->n_out,
1622 bset->extra, bset->flags);
1623 dump((struct isl_basic_map *)bset, out, indent);
1626 void isl_basic_map_dump(struct isl_basic_map *bmap, FILE *out, int indent)
1629 fprintf(out, "null basic map\n");
1633 fprintf(out, "%*s", indent, "");
1634 fprintf(out, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, "
1635 "flags: %x, n_name: %d\n",
1637 bmap->dim->nparam, bmap->dim->n_in, bmap->dim->n_out,
1638 bmap->extra, bmap->flags, bmap->dim->n_name);
1639 dump(bmap, out, indent);
1642 int isl_inequality_negate(struct isl_basic_map *bmap, unsigned pos)
1647 total = isl_basic_map_total_dim(bmap);
1648 isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
1649 isl_seq_neg(bmap->ineq[pos], bmap->ineq[pos], 1 + total);
1650 isl_int_sub_ui(bmap->ineq[pos][0], bmap->ineq[pos][0], 1);
1651 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1655 struct isl_set *isl_set_alloc_dim(struct isl_dim *dim, int n, unsigned flags)
1657 struct isl_set *set;
1661 isl_assert(dim->ctx, dim->n_in == 0, return NULL);
1662 isl_assert(dim->ctx, n >= 0, return NULL);
1663 set = isl_alloc(dim->ctx, struct isl_set,
1664 sizeof(struct isl_set) +
1665 (n - 1) * sizeof(struct isl_basic_set *));
1669 set->ctx = dim->ctx;
1670 isl_ctx_ref(set->ctx);
1682 struct isl_set *isl_set_alloc(struct isl_ctx *ctx,
1683 unsigned nparam, unsigned dim, int n, unsigned flags)
1685 struct isl_set *set;
1686 struct isl_dim *dims;
1688 dims = isl_dim_alloc(ctx, nparam, 0, dim);
1692 set = isl_set_alloc_dim(dims, n, flags);
1696 /* Make sure "map" has room for at least "n" more basic maps.
1698 struct isl_map *isl_map_grow(struct isl_map *map, int n)
1701 struct isl_map *grown = NULL;
1705 isl_assert(map->ctx, n >= 0, goto error);
1706 if (map->n + n <= map->size)
1708 grown = isl_map_alloc_dim(isl_map_get_dim(map), map->n + n, map->flags);
1711 for (i = 0; i < map->n; ++i) {
1712 grown->p[i] = isl_basic_map_copy(map->p[i]);
1720 isl_map_free(grown);
1725 /* Make sure "set" has room for at least "n" more basic sets.
1727 struct isl_set *isl_set_grow(struct isl_set *set, int n)
1729 return (struct isl_set *)isl_map_grow((struct isl_map *)set, n);
1732 struct isl_set *isl_set_dup(struct isl_set *set)
1735 struct isl_set *dup;
1740 dup = isl_set_alloc_dim(isl_dim_copy(set->dim), set->n, set->flags);
1743 for (i = 0; i < set->n; ++i)
1744 dup = isl_set_add_basic_set(dup, isl_basic_set_copy(set->p[i]));
1748 struct isl_set *isl_set_from_basic_set(struct isl_basic_set *bset)
1750 struct isl_set *set;
1755 set = isl_set_alloc_dim(isl_dim_copy(bset->dim), 1, ISL_MAP_DISJOINT);
1757 isl_basic_set_free(bset);
1760 return isl_set_add_basic_set(set, bset);
1763 struct isl_map *isl_map_from_basic_map(struct isl_basic_map *bmap)
1765 struct isl_map *map;
1770 map = isl_map_alloc_dim(isl_dim_copy(bmap->dim), 1, ISL_MAP_DISJOINT);
1772 isl_basic_map_free(bmap);
1775 return isl_map_add_basic_map(map, bmap);
1778 __isl_give isl_set *isl_set_add_basic_set(__isl_take isl_set *set,
1779 __isl_take isl_basic_set *bset)
1781 return (struct isl_set *)isl_map_add_basic_map((struct isl_map *)set,
1782 (struct isl_basic_map *)bset);
1785 void isl_set_free(struct isl_set *set)
1795 isl_ctx_deref(set->ctx);
1796 for (i = 0; i < set->n; ++i)
1797 isl_basic_set_free(set->p[i]);
1798 isl_dim_free(set->dim);
1802 void isl_set_dump(struct isl_set *set, FILE *out, int indent)
1807 fprintf(out, "null set\n");
1811 fprintf(out, "%*s", indent, "");
1812 fprintf(out, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
1813 set->ref, set->n, set->dim->nparam, set->dim->n_out,
1815 for (i = 0; i < set->n; ++i) {
1816 fprintf(out, "%*s", indent, "");
1817 fprintf(out, "basic set %d:\n", i);
1818 isl_basic_set_dump(set->p[i], out, indent+4);
1822 void isl_map_dump(struct isl_map *map, FILE *out, int indent)
1827 fprintf(out, "null map\n");
1831 fprintf(out, "%*s", indent, "");
1832 fprintf(out, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, "
1833 "flags: %x, n_name: %d\n",
1834 map->ref, map->n, map->dim->nparam, map->dim->n_in,
1835 map->dim->n_out, map->flags, map->dim->n_name);
1836 for (i = 0; i < map->n; ++i) {
1837 fprintf(out, "%*s", indent, "");
1838 fprintf(out, "basic map %d:\n", i);
1839 isl_basic_map_dump(map->p[i], out, indent+4);
1843 struct isl_basic_map *isl_basic_map_intersect_domain(
1844 struct isl_basic_map *bmap, struct isl_basic_set *bset)
1846 struct isl_basic_map *bmap_domain;
1847 struct isl_dim *dim;
1852 isl_assert(bset->ctx, isl_dim_match(bmap->dim, isl_dim_param,
1853 bset->dim, isl_dim_param), goto error);
1855 if (isl_dim_size(bset->dim, isl_dim_set) != 0)
1856 isl_assert(bset->ctx,
1857 isl_basic_map_compatible_domain(bmap, bset), goto error);
1859 bmap = isl_basic_map_cow(bmap);
1862 bmap = isl_basic_map_extend_dim(bmap, isl_dim_copy(bmap->dim),
1863 bset->n_div, bset->n_eq, bset->n_ineq);
1864 dim = isl_dim_reverse(isl_dim_copy(bset->dim));
1865 bmap_domain = isl_basic_map_from_basic_set(bset, dim);
1866 bmap = add_constraints(bmap, bmap_domain, 0, 0);
1868 bmap = isl_basic_map_simplify(bmap);
1869 return isl_basic_map_finalize(bmap);
1871 isl_basic_map_free(bmap);
1872 isl_basic_set_free(bset);
1876 struct isl_basic_map *isl_basic_map_intersect_range(
1877 struct isl_basic_map *bmap, struct isl_basic_set *bset)
1879 struct isl_basic_map *bmap_range;
1884 isl_assert(bset->ctx, isl_dim_match(bmap->dim, isl_dim_param,
1885 bset->dim, isl_dim_param), goto error);
1887 if (isl_dim_size(bset->dim, isl_dim_set) != 0)
1888 isl_assert(bset->ctx,
1889 isl_basic_map_compatible_range(bmap, bset), goto error);
1891 bmap = isl_basic_map_cow(bmap);
1894 bmap = isl_basic_map_extend_dim(bmap, isl_dim_copy(bmap->dim),
1895 bset->n_div, bset->n_eq, bset->n_ineq);
1896 bmap_range = isl_basic_map_from_basic_set(bset, isl_dim_copy(bset->dim));
1897 bmap = add_constraints(bmap, bmap_range, 0, 0);
1899 bmap = isl_basic_map_simplify(bmap);
1900 return isl_basic_map_finalize(bmap);
1902 isl_basic_map_free(bmap);
1903 isl_basic_set_free(bset);
1907 int isl_basic_map_contains(struct isl_basic_map *bmap, struct isl_vec *vec)
1913 total = 1 + isl_basic_map_total_dim(bmap);
1914 if (total != vec->size)
1919 for (i = 0; i < bmap->n_eq; ++i) {
1920 isl_seq_inner_product(vec->el, bmap->eq[i], total, &s);
1921 if (!isl_int_is_zero(s)) {
1927 for (i = 0; i < bmap->n_ineq; ++i) {
1928 isl_seq_inner_product(vec->el, bmap->ineq[i], total, &s);
1929 if (isl_int_is_neg(s)) {
1940 int isl_basic_set_contains(struct isl_basic_set *bset, struct isl_vec *vec)
1942 return isl_basic_map_contains((struct isl_basic_map *)bset, vec);
1945 struct isl_basic_map *isl_basic_map_intersect(
1946 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
1948 struct isl_vec *sample = NULL;
1950 if (!bmap1 || !bmap2)
1953 isl_assert(bmap1->ctx, isl_dim_match(bmap1->dim, isl_dim_param,
1954 bmap2->dim, isl_dim_param), goto error);
1955 if (isl_dim_total(bmap1->dim) ==
1956 isl_dim_size(bmap1->dim, isl_dim_param) &&
1957 isl_dim_total(bmap2->dim) !=
1958 isl_dim_size(bmap2->dim, isl_dim_param))
1959 return isl_basic_map_intersect(bmap2, bmap1);
1961 if (isl_dim_total(bmap2->dim) !=
1962 isl_dim_size(bmap2->dim, isl_dim_param))
1963 isl_assert(bmap1->ctx,
1964 isl_dim_equal(bmap1->dim, bmap2->dim), goto error);
1966 if (bmap1->sample &&
1967 isl_basic_map_contains(bmap1, bmap1->sample) > 0 &&
1968 isl_basic_map_contains(bmap2, bmap1->sample) > 0)
1969 sample = isl_vec_copy(bmap1->sample);
1970 else if (bmap2->sample &&
1971 isl_basic_map_contains(bmap1, bmap2->sample) > 0 &&
1972 isl_basic_map_contains(bmap2, bmap2->sample) > 0)
1973 sample = isl_vec_copy(bmap2->sample);
1975 bmap1 = isl_basic_map_cow(bmap1);
1978 bmap1 = isl_basic_map_extend_dim(bmap1, isl_dim_copy(bmap1->dim),
1979 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
1980 bmap1 = add_constraints(bmap1, bmap2, 0, 0);
1983 isl_vec_free(sample);
1985 isl_vec_free(bmap1->sample);
1986 bmap1->sample = sample;
1989 bmap1 = isl_basic_map_simplify(bmap1);
1990 return isl_basic_map_finalize(bmap1);
1993 isl_vec_free(sample);
1994 isl_basic_map_free(bmap1);
1995 isl_basic_map_free(bmap2);
1999 struct isl_basic_set *isl_basic_set_intersect(
2000 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
2002 return (struct isl_basic_set *)
2003 isl_basic_map_intersect(
2004 (struct isl_basic_map *)bset1,
2005 (struct isl_basic_map *)bset2);
2008 /* Special case of isl_map_intersect, where both map1 and map2
2009 * are convex, without any divs and such that either map1 or map2
2010 * contains a single constraint. This constraint is then simply
2011 * added to the other map.
2013 static __isl_give isl_map *map_intersect_add_constraint(
2014 __isl_take isl_map *map1, __isl_take isl_map *map2)
2016 struct isl_basic_map *bmap1;
2017 struct isl_basic_map *bmap2;
2019 isl_assert(map1->ctx, map1->n == 1, goto error);
2020 isl_assert(map2->ctx, map1->n == 1, goto error);
2021 isl_assert(map1->ctx, map1->p[0]->n_div == 0, goto error);
2022 isl_assert(map2->ctx, map1->p[0]->n_div == 0, goto error);
2024 if (map2->p[0]->n_eq + map2->p[0]->n_ineq != 1)
2025 return isl_map_intersect(map2, map1);
2027 isl_assert(map2->ctx,
2028 map2->p[0]->n_eq + map2->p[0]->n_ineq == 1, goto error);
2030 map1 = isl_map_cow(map1);
2033 if (isl_map_fast_is_empty(map1)) {
2037 map1->p[0] = isl_basic_map_cow(map1->p[0]);
2038 if (map2->p[0]->n_eq == 1)
2039 map1->p[0] = isl_basic_map_add_eq(map1->p[0], map2->p[0]->eq[0]);
2041 map1->p[0] = isl_basic_map_add_ineq(map1->p[0],
2042 map2->p[0]->ineq[0]);
2044 map1->p[0] = isl_basic_map_simplify(map1->p[0]);
2045 map1->p[0] = isl_basic_map_finalize(map1->p[0]);
2049 if (isl_basic_map_fast_is_empty(map1->p[0])) {
2050 isl_basic_map_free(map1->p[0]);
2063 struct isl_map *isl_map_intersect(struct isl_map *map1, struct isl_map *map2)
2066 struct isl_map *result;
2072 if (isl_map_fast_is_empty(map1)) {
2076 if (isl_map_fast_is_empty(map2)) {
2081 if (map1->n == 1 && map2->n == 1 &&
2082 map1->p[0]->n_div == 0 && map2->p[0]->n_div == 0 &&
2083 isl_dim_equal(map1->dim, map2->dim) &&
2084 (map1->p[0]->n_eq + map1->p[0]->n_ineq == 1 ||
2085 map2->p[0]->n_eq + map2->p[0]->n_ineq == 1))
2086 return map_intersect_add_constraint(map1, map2);
2087 isl_assert(map1->ctx, isl_dim_match(map1->dim, isl_dim_param,
2088 map2->dim, isl_dim_param), goto error);
2089 if (isl_dim_total(map1->dim) ==
2090 isl_dim_size(map1->dim, isl_dim_param) &&
2091 isl_dim_total(map2->dim) != isl_dim_size(map2->dim, isl_dim_param))
2092 return isl_map_intersect(map2, map1);
2094 if (isl_dim_total(map2->dim) != isl_dim_size(map2->dim, isl_dim_param))
2095 isl_assert(map1->ctx,
2096 isl_dim_equal(map1->dim, map2->dim), goto error);
2098 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
2099 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
2100 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
2102 result = isl_map_alloc_dim(isl_dim_copy(map1->dim),
2103 map1->n * map2->n, flags);
2106 for (i = 0; i < map1->n; ++i)
2107 for (j = 0; j < map2->n; ++j) {
2108 struct isl_basic_map *part;
2109 part = isl_basic_map_intersect(
2110 isl_basic_map_copy(map1->p[i]),
2111 isl_basic_map_copy(map2->p[j]));
2112 if (isl_basic_map_is_empty(part))
2113 isl_basic_map_free(part);
2115 result = isl_map_add_basic_map(result, part);
2128 struct isl_set *isl_set_intersect(struct isl_set *set1, struct isl_set *set2)
2130 return (struct isl_set *)
2131 isl_map_intersect((struct isl_map *)set1,
2132 (struct isl_map *)set2);
2135 struct isl_basic_map *isl_basic_map_reverse(struct isl_basic_map *bmap)
2137 struct isl_dim *dim;
2138 struct isl_basic_set *bset;
2143 bmap = isl_basic_map_cow(bmap);
2146 dim = isl_dim_reverse(isl_dim_copy(bmap->dim));
2147 in = isl_basic_map_n_in(bmap);
2148 bset = isl_basic_set_from_basic_map(bmap);
2149 bset = isl_basic_set_swap_vars(bset, in);
2150 return isl_basic_map_from_basic_set(bset, dim);
2153 __isl_give isl_basic_map *isl_basic_map_insert(__isl_take isl_basic_map *bmap,
2154 enum isl_dim_type type, unsigned pos, unsigned n)
2156 struct isl_dim *res_dim;
2157 struct isl_basic_map *res;
2158 struct isl_dim_map *dim_map;
2159 unsigned total, off;
2160 enum isl_dim_type t;
2168 res_dim = isl_dim_insert(isl_basic_map_get_dim(bmap), type, pos, n);
2170 total = isl_basic_map_total_dim(bmap) + n;
2171 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2173 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
2175 isl_dim_map_dim(dim_map, bmap->dim, t, off);
2177 unsigned size = isl_basic_map_dim(bmap, t);
2178 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2180 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2181 pos, size - pos, off + pos + n);
2183 off += isl_dim_size(res_dim, t);
2185 isl_dim_map_div(dim_map, bmap, off);
2187 res = isl_basic_map_alloc_dim(res_dim,
2188 bmap->n_div, bmap->n_eq, bmap->n_ineq);
2189 res = add_constraints_dim_map(res, bmap, dim_map);
2190 res = isl_basic_map_simplify(res);
2191 return isl_basic_map_finalize(res);
2194 __isl_give isl_basic_map *isl_basic_map_add(__isl_take isl_basic_map *bmap,
2195 enum isl_dim_type type, unsigned n)
2199 return isl_basic_map_insert(bmap, type,
2200 isl_basic_map_dim(bmap, type), n);
2203 __isl_give isl_basic_set *isl_basic_set_add(__isl_take isl_basic_set *bset,
2204 enum isl_dim_type type, unsigned n)
2208 isl_assert(bset->ctx, type != isl_dim_in, goto error);
2209 return (isl_basic_set *)isl_basic_map_add((isl_basic_map *)bset, type, n);
2211 isl_basic_set_free(bset);
2215 __isl_give isl_map *isl_map_insert(__isl_take isl_map *map,
2216 enum isl_dim_type type, unsigned pos, unsigned n)
2223 map = isl_map_cow(map);
2227 map->dim = isl_dim_insert(map->dim, type, pos, n);
2231 for (i = 0; i < map->n; ++i) {
2232 map->p[i] = isl_basic_map_insert(map->p[i], type, pos, n);
2243 __isl_give isl_set *isl_set_insert(__isl_take isl_set *set,
2244 enum isl_dim_type type, unsigned pos, unsigned n)
2246 return (isl_set *)isl_map_insert((isl_map *)set, type, pos, n);
2249 __isl_give isl_map *isl_map_add(__isl_take isl_map *map,
2250 enum isl_dim_type type, unsigned n)
2254 return isl_map_insert(map, type, isl_map_dim(map, type), n);
2257 __isl_give isl_set *isl_set_add(__isl_take isl_set *set,
2258 enum isl_dim_type type, unsigned n)
2262 isl_assert(set->ctx, type != isl_dim_in, goto error);
2263 return (isl_set *)isl_map_add((isl_map *)set, type, n);
2269 __isl_give isl_basic_map *isl_basic_map_move_dims(
2270 __isl_take isl_basic_map *bmap,
2271 enum isl_dim_type dst_type, unsigned dst_pos,
2272 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2275 struct isl_dim_map *dim_map;
2276 struct isl_basic_map *res;
2277 enum isl_dim_type t;
2278 unsigned total, off;
2285 isl_assert(bmap->ctx, src_pos + n <= isl_basic_map_dim(bmap, src_type),
2288 if (dst_type == src_type && dst_pos == src_pos)
2291 isl_assert(bmap->ctx, dst_type != src_type, goto error);
2293 if (pos(bmap->dim, dst_type) + dst_pos ==
2294 pos(bmap->dim, src_type) + src_pos +
2295 ((src_type < dst_type) ? n : 0)) {
2296 bmap = isl_basic_map_cow(bmap);
2300 bmap->dim = isl_dim_move(bmap->dim, dst_type, dst_pos,
2301 src_type, src_pos, n);
2305 bmap = isl_basic_map_finalize(bmap);
2310 total = isl_basic_map_total_dim(bmap);
2311 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2314 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
2315 unsigned size = isl_dim_size(bmap->dim, t);
2316 if (t == dst_type) {
2317 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2320 isl_dim_map_dim_range(dim_map, bmap->dim, src_type,
2323 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2324 dst_pos, size - dst_pos, off);
2325 off += size - dst_pos;
2326 } else if (t == src_type) {
2327 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2330 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2331 src_pos + n, size - src_pos - n, off);
2332 off += size - src_pos - n;
2334 isl_dim_map_dim(dim_map, bmap->dim, t, off);
2338 isl_dim_map_div(dim_map, bmap, off);
2340 res = isl_basic_map_alloc_dim(isl_basic_map_get_dim(bmap),
2341 bmap->n_div, bmap->n_eq, bmap->n_ineq);
2342 bmap = add_constraints_dim_map(res, bmap, dim_map);
2344 bmap->dim = isl_dim_move(bmap->dim, dst_type, dst_pos,
2345 src_type, src_pos, n);
2349 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
2350 bmap = isl_basic_map_gauss(bmap, NULL);
2351 bmap = isl_basic_map_finalize(bmap);
2355 isl_basic_map_free(bmap);
2359 __isl_give isl_basic_set *isl_basic_set_move_dims(__isl_take isl_basic_set *bset,
2360 enum isl_dim_type dst_type, unsigned dst_pos,
2361 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2363 return (isl_basic_set *)isl_basic_map_move_dims(
2364 (isl_basic_map *)bset, dst_type, dst_pos, src_type, src_pos, n);
2367 __isl_give isl_set *isl_set_move_dims(__isl_take isl_set *set,
2368 enum isl_dim_type dst_type, unsigned dst_pos,
2369 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2373 isl_assert(set->ctx, dst_type != isl_dim_in, goto error);
2374 return (isl_set *)isl_map_move_dims((isl_map *)set, dst_type, dst_pos,
2375 src_type, src_pos, n);
2381 __isl_give isl_map *isl_map_move_dims(__isl_take isl_map *map,
2382 enum isl_dim_type dst_type, unsigned dst_pos,
2383 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2392 isl_assert(map->ctx, src_pos + n <= isl_map_dim(map, src_type),
2395 if (dst_type == src_type && dst_pos == src_pos)
2398 isl_assert(map->ctx, dst_type != src_type, goto error);
2400 map = isl_map_cow(map);
2404 map->dim = isl_dim_move(map->dim, dst_type, dst_pos, src_type, src_pos, n);
2408 for (i = 0; i < map->n; ++i) {
2409 map->p[i] = isl_basic_map_move_dims(map->p[i],
2411 src_type, src_pos, n);
2422 /* Move the specified dimensions to the last columns right before
2423 * the divs. Don't change the dimension specification of bmap.
2424 * That's the responsibility of the caller.
2426 static __isl_give isl_basic_map *move_last(__isl_take isl_basic_map *bmap,
2427 enum isl_dim_type type, unsigned first, unsigned n)
2429 struct isl_dim_map *dim_map;
2430 struct isl_basic_map *res;
2431 enum isl_dim_type t;
2432 unsigned total, off;
2436 if (pos(bmap->dim, type) + first + n == 1 + isl_dim_total(bmap->dim))
2439 total = isl_basic_map_total_dim(bmap);
2440 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2443 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
2444 unsigned size = isl_dim_size(bmap->dim, t);
2446 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2449 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2450 first, n, total - bmap->n_div - n);
2451 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2452 first + n, size - (first + n), off);
2453 off += size - (first + n);
2455 isl_dim_map_dim(dim_map, bmap->dim, t, off);
2459 isl_dim_map_div(dim_map, bmap, off + n);
2461 res = isl_basic_map_alloc_dim(isl_basic_map_get_dim(bmap),
2462 bmap->n_div, bmap->n_eq, bmap->n_ineq);
2463 res = add_constraints_dim_map(res, bmap, dim_map);
2467 /* Turn the n dimensions of type type, starting at first
2468 * into existentially quantified variables.
2470 __isl_give isl_basic_map *isl_basic_map_project_out(
2471 __isl_take isl_basic_map *bmap,
2472 enum isl_dim_type type, unsigned first, unsigned n)
2485 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL))
2486 return isl_basic_map_remove(bmap, type, first, n);
2488 isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
2491 bmap = move_last(bmap, type, first, n);
2492 bmap = isl_basic_map_cow(bmap);
2496 row_size = 1 + isl_dim_total(bmap->dim) + bmap->extra;
2497 old = bmap->block2.data;
2498 bmap->block2 = isl_blk_extend(bmap->ctx, bmap->block2,
2499 (bmap->extra + n) * (1 + row_size));
2500 if (!bmap->block2.data)
2502 new_div = isl_alloc_array(bmap->ctx, isl_int *, bmap->extra + n);
2505 for (i = 0; i < n; ++i) {
2506 new_div[i] = bmap->block2.data +
2507 (bmap->extra + i) * (1 + row_size);
2508 isl_seq_clr(new_div[i], 1 + row_size);
2510 for (i = 0; i < bmap->extra; ++i)
2511 new_div[n + i] = bmap->block2.data + (bmap->div[i] - old);
2513 bmap->div = new_div;
2517 bmap->dim = isl_dim_drop(bmap->dim, type, first, n);
2520 bmap = isl_basic_map_simplify(bmap);
2521 bmap = isl_basic_map_drop_redundant_divs(bmap);
2522 return isl_basic_map_finalize(bmap);
2524 isl_basic_map_free(bmap);
2528 /* Turn the n dimensions of type type, starting at first
2529 * into existentially quantified variables.
2531 struct isl_basic_set *isl_basic_set_project_out(struct isl_basic_set *bset,
2532 enum isl_dim_type type, unsigned first, unsigned n)
2534 return (isl_basic_set *)isl_basic_map_project_out(
2535 (isl_basic_map *)bset, type, first, n);
2538 /* Turn the n dimensions of type type, starting at first
2539 * into existentially quantified variables.
2541 __isl_give isl_map *isl_map_project_out(__isl_take isl_map *map,
2542 enum isl_dim_type type, unsigned first, unsigned n)
2552 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
2554 map = isl_map_cow(map);
2558 map->dim = isl_dim_drop(map->dim, type, first, n);
2562 for (i = 0; i < map->n; ++i) {
2563 map->p[i] = isl_basic_map_project_out(map->p[i], type, first, n);
2574 /* Turn the n dimensions of type type, starting at first
2575 * into existentially quantified variables.
2577 __isl_give isl_set *isl_set_project_out(__isl_take isl_set *set,
2578 enum isl_dim_type type, unsigned first, unsigned n)
2580 return (isl_set *)isl_map_project_out((isl_map *)set, type, first, n);
2583 static struct isl_basic_map *add_divs(struct isl_basic_map *bmap, unsigned n)
2587 for (i = 0; i < n; ++i) {
2588 j = isl_basic_map_alloc_div(bmap);
2591 isl_seq_clr(bmap->div[j], 1+1+isl_basic_map_total_dim(bmap));
2595 isl_basic_map_free(bmap);
2599 struct isl_basic_map *isl_basic_map_apply_range(
2600 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2602 struct isl_dim *dim_result = NULL;
2603 struct isl_basic_map *bmap;
2604 unsigned n_in, n_out, n, nparam, total, pos;
2605 struct isl_dim_map *dim_map1, *dim_map2;
2607 if (!bmap1 || !bmap2)
2610 dim_result = isl_dim_join(isl_dim_copy(bmap1->dim),
2611 isl_dim_copy(bmap2->dim));
2613 n_in = isl_basic_map_n_in(bmap1);
2614 n_out = isl_basic_map_n_out(bmap2);
2615 n = isl_basic_map_n_out(bmap1);
2616 nparam = isl_basic_map_n_param(bmap1);
2618 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + n;
2619 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
2620 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
2621 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
2622 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
2623 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
2624 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_in);
2625 isl_dim_map_div(dim_map1, bmap1, pos += n_out);
2626 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
2627 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
2628 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
2630 bmap = isl_basic_map_alloc_dim(dim_result,
2631 bmap1->n_div + bmap2->n_div + n,
2632 bmap1->n_eq + bmap2->n_eq,
2633 bmap1->n_ineq + bmap2->n_ineq);
2634 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
2635 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
2636 bmap = add_divs(bmap, n);
2637 bmap = isl_basic_map_simplify(bmap);
2638 bmap = isl_basic_map_drop_redundant_divs(bmap);
2639 return isl_basic_map_finalize(bmap);
2641 isl_basic_map_free(bmap1);
2642 isl_basic_map_free(bmap2);
2646 struct isl_basic_set *isl_basic_set_apply(
2647 struct isl_basic_set *bset, struct isl_basic_map *bmap)
2652 isl_assert(bset->ctx, isl_basic_map_compatible_domain(bmap, bset),
2655 return (struct isl_basic_set *)
2656 isl_basic_map_apply_range((struct isl_basic_map *)bset, bmap);
2658 isl_basic_set_free(bset);
2659 isl_basic_map_free(bmap);
2663 struct isl_basic_map *isl_basic_map_apply_domain(
2664 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2666 if (!bmap1 || !bmap2)
2669 isl_assert(bmap1->ctx,
2670 isl_basic_map_n_in(bmap1) == isl_basic_map_n_in(bmap2), goto error);
2671 isl_assert(bmap1->ctx,
2672 isl_basic_map_n_param(bmap1) == isl_basic_map_n_param(bmap2),
2675 bmap1 = isl_basic_map_reverse(bmap1);
2676 bmap1 = isl_basic_map_apply_range(bmap1, bmap2);
2677 return isl_basic_map_reverse(bmap1);
2679 isl_basic_map_free(bmap1);
2680 isl_basic_map_free(bmap2);
2684 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
2685 * A \cap B -> f(A) + f(B)
2687 struct isl_basic_map *isl_basic_map_sum(
2688 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2690 unsigned n_in, n_out, nparam, total, pos;
2691 struct isl_basic_map *bmap = NULL;
2692 struct isl_dim_map *dim_map1, *dim_map2;
2695 if (!bmap1 || !bmap2)
2698 isl_assert(bmap1->ctx, isl_dim_equal(bmap1->dim, bmap2->dim),
2701 nparam = isl_basic_map_n_param(bmap1);
2702 n_in = isl_basic_map_n_in(bmap1);
2703 n_out = isl_basic_map_n_out(bmap1);
2705 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + 2 * n_out;
2706 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
2707 dim_map2 = isl_dim_map_alloc(bmap2->ctx, total);
2708 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
2709 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos);
2710 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
2711 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
2712 isl_dim_map_div(dim_map1, bmap1, pos += n_in + n_out);
2713 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
2714 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
2715 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_out);
2717 bmap = isl_basic_map_alloc_dim(isl_dim_copy(bmap1->dim),
2718 bmap1->n_div + bmap2->n_div + 2 * n_out,
2719 bmap1->n_eq + bmap2->n_eq + n_out,
2720 bmap1->n_ineq + bmap2->n_ineq);
2721 for (i = 0; i < n_out; ++i) {
2722 int j = isl_basic_map_alloc_equality(bmap);
2725 isl_seq_clr(bmap->eq[j], 1+total);
2726 isl_int_set_si(bmap->eq[j][1+nparam+n_in+i], -1);
2727 isl_int_set_si(bmap->eq[j][1+pos+i], 1);
2728 isl_int_set_si(bmap->eq[j][1+pos-n_out+i], 1);
2730 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
2731 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
2732 bmap = add_divs(bmap, 2 * n_out);
2734 bmap = isl_basic_map_simplify(bmap);
2735 return isl_basic_map_finalize(bmap);
2737 isl_basic_map_free(bmap);
2738 isl_basic_map_free(bmap1);
2739 isl_basic_map_free(bmap2);
2743 /* Given two maps A -> f(A) and B -> g(B), construct a map
2744 * A \cap B -> f(A) + f(B)
2746 struct isl_map *isl_map_sum(struct isl_map *map1, struct isl_map *map2)
2748 struct isl_map *result;
2754 isl_assert(map1->ctx, isl_dim_equal(map1->dim, map2->dim), goto error);
2756 result = isl_map_alloc_dim(isl_dim_copy(map1->dim),
2757 map1->n * map2->n, 0);
2760 for (i = 0; i < map1->n; ++i)
2761 for (j = 0; j < map2->n; ++j) {
2762 struct isl_basic_map *part;
2763 part = isl_basic_map_sum(
2764 isl_basic_map_copy(map1->p[i]),
2765 isl_basic_map_copy(map2->p[j]));
2766 if (isl_basic_map_is_empty(part))
2767 isl_basic_map_free(part);
2769 result = isl_map_add_basic_map(result, part);
2782 __isl_give isl_set *isl_set_sum(__isl_take isl_set *set1,
2783 __isl_take isl_set *set2)
2785 return (isl_set *)isl_map_sum((isl_map *)set1, (isl_map *)set2);
2788 /* Given a basic map A -> f(A), construct A -> -f(A).
2790 struct isl_basic_map *isl_basic_map_neg(struct isl_basic_map *bmap)
2795 bmap = isl_basic_map_cow(bmap);
2799 n = isl_basic_map_dim(bmap, isl_dim_out);
2800 off = isl_basic_map_offset(bmap, isl_dim_out);
2801 for (i = 0; i < bmap->n_eq; ++i)
2802 for (j = 0; j < n; ++j)
2803 isl_int_neg(bmap->eq[i][off+j], bmap->eq[i][off+j]);
2804 for (i = 0; i < bmap->n_ineq; ++i)
2805 for (j = 0; j < n; ++j)
2806 isl_int_neg(bmap->ineq[i][off+j], bmap->ineq[i][off+j]);
2807 for (i = 0; i < bmap->n_div; ++i)
2808 for (j = 0; j < n; ++j)
2809 isl_int_neg(bmap->div[i][1+off+j], bmap->div[i][1+off+j]);
2810 return isl_basic_map_finalize(bmap);
2813 /* Given a map A -> f(A), construct A -> -f(A).
2815 struct isl_map *isl_map_neg(struct isl_map *map)
2819 map = isl_map_cow(map);
2823 for (i = 0; i < map->n; ++i) {
2824 map->p[i] = isl_basic_map_neg(map->p[i]);
2835 __isl_give isl_set *isl_set_neg(__isl_take isl_set *set)
2837 return (isl_set *)isl_map_neg((isl_map *)set);
2840 /* Given a basic map A -> f(A) and an integer d, construct a basic map
2841 * A -> floor(f(A)/d).
2843 struct isl_basic_map *isl_basic_map_floordiv(struct isl_basic_map *bmap,
2846 unsigned n_in, n_out, nparam, total, pos;
2847 struct isl_basic_map *result = NULL;
2848 struct isl_dim_map *dim_map;
2854 nparam = isl_basic_map_n_param(bmap);
2855 n_in = isl_basic_map_n_in(bmap);
2856 n_out = isl_basic_map_n_out(bmap);
2858 total = nparam + n_in + n_out + bmap->n_div + n_out;
2859 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2860 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_param, pos = 0);
2861 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_in, pos += nparam);
2862 isl_dim_map_div(dim_map, bmap, pos += n_in + n_out);
2863 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_out, pos += bmap->n_div);
2865 result = isl_basic_map_alloc_dim(isl_dim_copy(bmap->dim),
2866 bmap->n_div + n_out,
2867 bmap->n_eq, bmap->n_ineq + 2 * n_out);
2868 result = add_constraints_dim_map(result, bmap, dim_map);
2869 result = add_divs(result, n_out);
2870 for (i = 0; i < n_out; ++i) {
2872 j = isl_basic_map_alloc_inequality(result);
2875 isl_seq_clr(result->ineq[j], 1+total);
2876 isl_int_neg(result->ineq[j][1+nparam+n_in+i], d);
2877 isl_int_set_si(result->ineq[j][1+pos+i], 1);
2878 j = isl_basic_map_alloc_inequality(result);
2881 isl_seq_clr(result->ineq[j], 1+total);
2882 isl_int_set(result->ineq[j][1+nparam+n_in+i], d);
2883 isl_int_set_si(result->ineq[j][1+pos+i], -1);
2884 isl_int_sub_ui(result->ineq[j][0], d, 1);
2887 result = isl_basic_map_simplify(result);
2888 return isl_basic_map_finalize(result);
2890 isl_basic_map_free(result);
2894 /* Given a map A -> f(A) and an integer d, construct a map
2895 * A -> floor(f(A)/d).
2897 struct isl_map *isl_map_floordiv(struct isl_map *map, isl_int d)
2901 map = isl_map_cow(map);
2905 ISL_F_CLR(map, ISL_MAP_DISJOINT);
2906 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
2907 for (i = 0; i < map->n; ++i) {
2908 map->p[i] = isl_basic_map_floordiv(map->p[i], d);
2919 static struct isl_basic_map *var_equal(struct isl_basic_map *bmap, unsigned pos)
2925 i = isl_basic_map_alloc_equality(bmap);
2928 nparam = isl_basic_map_n_param(bmap);
2929 n_in = isl_basic_map_n_in(bmap);
2930 isl_seq_clr(bmap->eq[i], 1 + isl_basic_map_total_dim(bmap));
2931 isl_int_set_si(bmap->eq[i][1+nparam+pos], -1);
2932 isl_int_set_si(bmap->eq[i][1+nparam+n_in+pos], 1);
2933 return isl_basic_map_finalize(bmap);
2935 isl_basic_map_free(bmap);
2939 /* Add a constraints to "bmap" expressing i_pos < o_pos
2941 static struct isl_basic_map *var_less(struct isl_basic_map *bmap, unsigned pos)
2947 i = isl_basic_map_alloc_inequality(bmap);
2950 nparam = isl_basic_map_n_param(bmap);
2951 n_in = isl_basic_map_n_in(bmap);
2952 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
2953 isl_int_set_si(bmap->ineq[i][0], -1);
2954 isl_int_set_si(bmap->ineq[i][1+nparam+pos], -1);
2955 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], 1);
2956 return isl_basic_map_finalize(bmap);
2958 isl_basic_map_free(bmap);
2962 /* Add a constraint to "bmap" expressing i_pos <= o_pos
2964 static __isl_give isl_basic_map *var_less_or_equal(
2965 __isl_take isl_basic_map *bmap, unsigned pos)
2971 i = isl_basic_map_alloc_inequality(bmap);
2974 nparam = isl_basic_map_n_param(bmap);
2975 n_in = isl_basic_map_n_in(bmap);
2976 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
2977 isl_int_set_si(bmap->ineq[i][1+nparam+pos], -1);
2978 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], 1);
2979 return isl_basic_map_finalize(bmap);
2981 isl_basic_map_free(bmap);
2985 /* Add a constraints to "bmap" expressing i_pos > o_pos
2987 static struct isl_basic_map *var_more(struct isl_basic_map *bmap, unsigned pos)
2993 i = isl_basic_map_alloc_inequality(bmap);
2996 nparam = isl_basic_map_n_param(bmap);
2997 n_in = isl_basic_map_n_in(bmap);
2998 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
2999 isl_int_set_si(bmap->ineq[i][0], -1);
3000 isl_int_set_si(bmap->ineq[i][1+nparam+pos], 1);
3001 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], -1);
3002 return isl_basic_map_finalize(bmap);
3004 isl_basic_map_free(bmap);
3008 /* Add a constraint to "bmap" expressing i_pos >= o_pos
3010 static __isl_give isl_basic_map *var_more_or_equal(
3011 __isl_take isl_basic_map *bmap, unsigned pos)
3017 i = isl_basic_map_alloc_inequality(bmap);
3020 nparam = isl_basic_map_n_param(bmap);
3021 n_in = isl_basic_map_n_in(bmap);
3022 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
3023 isl_int_set_si(bmap->ineq[i][1+nparam+pos], 1);
3024 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], -1);
3025 return isl_basic_map_finalize(bmap);
3027 isl_basic_map_free(bmap);
3031 struct isl_basic_map *isl_basic_map_equal(struct isl_dim *dim, unsigned n_equal)
3034 struct isl_basic_map *bmap;
3035 bmap = isl_basic_map_alloc_dim(dim, 0, n_equal, 0);
3038 for (i = 0; i < n_equal && bmap; ++i)
3039 bmap = var_equal(bmap, i);
3040 return isl_basic_map_finalize(bmap);
3043 /* Return a relation on of dimension "dim" expressing i_[0..pos] << o_[0..pos]
3045 struct isl_basic_map *isl_basic_map_less_at(struct isl_dim *dim, unsigned pos)
3048 struct isl_basic_map *bmap;
3049 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
3052 for (i = 0; i < pos && bmap; ++i)
3053 bmap = var_equal(bmap, i);
3055 bmap = var_less(bmap, pos);
3056 return isl_basic_map_finalize(bmap);
3059 /* Return a relation on of dimension "dim" expressing i_[0..pos] <<= o_[0..pos]
3061 __isl_give isl_basic_map *isl_basic_map_less_or_equal_at(
3062 __isl_take isl_dim *dim, unsigned pos)
3065 isl_basic_map *bmap;
3067 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
3068 for (i = 0; i < pos; ++i)
3069 bmap = var_equal(bmap, i);
3070 bmap = var_less_or_equal(bmap, pos);
3071 return isl_basic_map_finalize(bmap);
3074 /* Return a relation on pairs of sets of dimension "dim" expressing i_pos > o_pos
3076 struct isl_basic_map *isl_basic_map_more_at(struct isl_dim *dim, unsigned pos)
3079 struct isl_basic_map *bmap;
3080 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
3083 for (i = 0; i < pos && bmap; ++i)
3084 bmap = var_equal(bmap, i);
3086 bmap = var_more(bmap, pos);
3087 return isl_basic_map_finalize(bmap);
3090 /* Return a relation on of dimension "dim" expressing i_[0..pos] >>= o_[0..pos]
3092 __isl_give isl_basic_map *isl_basic_map_more_or_equal_at(
3093 __isl_take isl_dim *dim, unsigned pos)
3096 isl_basic_map *bmap;
3098 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
3099 for (i = 0; i < pos; ++i)
3100 bmap = var_equal(bmap, i);
3101 bmap = var_more_or_equal(bmap, pos);
3102 return isl_basic_map_finalize(bmap);
3105 static __isl_give isl_map *map_lex_lte_first(__isl_take isl_dim *dims,
3106 unsigned n, int equal)
3108 struct isl_map *map;
3111 if (n == 0 && equal)
3112 return isl_map_universe(dims);
3114 map = isl_map_alloc_dim(isl_dim_copy(dims), n, ISL_MAP_DISJOINT);
3116 for (i = 0; i + 1 < n; ++i)
3117 map = isl_map_add_basic_map(map,
3118 isl_basic_map_less_at(isl_dim_copy(dims), i));
3121 map = isl_map_add_basic_map(map,
3122 isl_basic_map_less_or_equal_at(dims, n - 1));
3124 map = isl_map_add_basic_map(map,
3125 isl_basic_map_less_at(dims, n - 1));
3132 static __isl_give isl_map *map_lex_lte(__isl_take isl_dim *dims, int equal)
3136 return map_lex_lte_first(dims, dims->n_out, equal);
3139 __isl_give isl_map *isl_map_lex_lt_first(__isl_take isl_dim *dim, unsigned n)
3141 return map_lex_lte_first(dim, n, 0);
3144 __isl_give isl_map *isl_map_lex_le_first(__isl_take isl_dim *dim, unsigned n)
3146 return map_lex_lte_first(dim, n, 1);
3149 __isl_give isl_map *isl_map_lex_lt(__isl_take isl_dim *set_dim)
3151 return map_lex_lte(isl_dim_map(set_dim), 0);
3154 __isl_give isl_map *isl_map_lex_le(__isl_take isl_dim *set_dim)
3156 return map_lex_lte(isl_dim_map(set_dim), 1);
3159 static __isl_give isl_map *map_lex_gte_first(__isl_take isl_dim *dims,
3160 unsigned n, int equal)
3162 struct isl_map *map;
3165 if (n == 0 && equal)
3166 return isl_map_universe(dims);
3168 map = isl_map_alloc_dim(isl_dim_copy(dims), n, ISL_MAP_DISJOINT);
3170 for (i = 0; i + 1 < n; ++i)
3171 map = isl_map_add_basic_map(map,
3172 isl_basic_map_more_at(isl_dim_copy(dims), i));
3175 map = isl_map_add_basic_map(map,
3176 isl_basic_map_more_or_equal_at(dims, n - 1));
3178 map = isl_map_add_basic_map(map,
3179 isl_basic_map_more_at(dims, n - 1));
3186 static __isl_give isl_map *map_lex_gte(__isl_take isl_dim *dims, int equal)
3190 return map_lex_gte_first(dims, dims->n_out, equal);
3193 __isl_give isl_map *isl_map_lex_gt_first(__isl_take isl_dim *dim, unsigned n)
3195 return map_lex_gte_first(dim, n, 0);
3198 __isl_give isl_map *isl_map_lex_ge_first(__isl_take isl_dim *dim, unsigned n)
3200 return map_lex_gte_first(dim, n, 1);
3203 __isl_give isl_map *isl_map_lex_gt(__isl_take isl_dim *set_dim)
3205 return map_lex_gte(isl_dim_map(set_dim), 0);
3208 __isl_give isl_map *isl_map_lex_ge(__isl_take isl_dim *set_dim)
3210 return map_lex_gte(isl_dim_map(set_dim), 1);
3213 __isl_give isl_map *isl_set_lex_le_set(__isl_take isl_set *set1,
3214 __isl_take isl_set *set2)
3217 map = isl_map_lex_le(isl_set_get_dim(set1));
3218 map = isl_map_intersect_domain(map, set1);
3219 map = isl_map_intersect_range(map, set2);
3223 __isl_give isl_map *isl_set_lex_lt_set(__isl_take isl_set *set1,
3224 __isl_take isl_set *set2)
3227 map = isl_map_lex_lt(isl_set_get_dim(set1));
3228 map = isl_map_intersect_domain(map, set1);
3229 map = isl_map_intersect_range(map, set2);
3233 __isl_give isl_map *isl_set_lex_ge_set(__isl_take isl_set *set1,
3234 __isl_take isl_set *set2)
3237 map = isl_map_lex_ge(isl_set_get_dim(set1));
3238 map = isl_map_intersect_domain(map, set1);
3239 map = isl_map_intersect_range(map, set2);
3243 __isl_give isl_map *isl_set_lex_gt_set(__isl_take isl_set *set1,
3244 __isl_take isl_set *set2)
3247 map = isl_map_lex_gt(isl_set_get_dim(set1));
3248 map = isl_map_intersect_domain(map, set1);
3249 map = isl_map_intersect_range(map, set2);
3253 __isl_give isl_map *isl_map_lex_le_map(__isl_take isl_map *map1,
3254 __isl_take isl_map *map2)
3257 map = isl_map_lex_le(isl_dim_range(isl_map_get_dim(map1)));
3258 map = isl_map_apply_domain(map, isl_map_reverse(map1));
3259 map = isl_map_apply_range(map, isl_map_reverse(map2));
3263 __isl_give isl_map *isl_map_lex_lt_map(__isl_take isl_map *map1,
3264 __isl_take isl_map *map2)
3267 map = isl_map_lex_lt(isl_dim_range(isl_map_get_dim(map1)));
3268 map = isl_map_apply_domain(map, isl_map_reverse(map1));
3269 map = isl_map_apply_range(map, isl_map_reverse(map2));
3273 __isl_give isl_map *isl_map_lex_ge_map(__isl_take isl_map *map1,
3274 __isl_take isl_map *map2)
3277 map = isl_map_lex_ge(isl_dim_range(isl_map_get_dim(map1)));
3278 map = isl_map_apply_domain(map, isl_map_reverse(map1));
3279 map = isl_map_apply_range(map, isl_map_reverse(map2));
3283 __isl_give isl_map *isl_map_lex_gt_map(__isl_take isl_map *map1,
3284 __isl_take isl_map *map2)
3287 map = isl_map_lex_gt(isl_dim_range(isl_map_get_dim(map1)));
3288 map = isl_map_apply_domain(map, isl_map_reverse(map1));
3289 map = isl_map_apply_range(map, isl_map_reverse(map2));
3293 struct isl_basic_map *isl_basic_map_from_basic_set(
3294 struct isl_basic_set *bset, struct isl_dim *dim)
3296 struct isl_basic_map *bmap;
3298 bset = isl_basic_set_cow(bset);
3302 isl_assert(bset->ctx, isl_dim_compatible(bset->dim, dim), goto error);
3303 isl_dim_free(bset->dim);
3304 bmap = (struct isl_basic_map *) bset;
3306 return isl_basic_map_finalize(bmap);
3308 isl_basic_set_free(bset);
3313 struct isl_basic_set *isl_basic_set_from_basic_map(struct isl_basic_map *bmap)
3317 if (bmap->dim->n_in == 0)
3318 return (struct isl_basic_set *)bmap;
3319 bmap = isl_basic_map_cow(bmap);
3322 bmap->dim = isl_dim_as_set_dim(bmap->dim);
3325 bmap = isl_basic_map_finalize(bmap);
3326 return (struct isl_basic_set *)bmap;
3328 isl_basic_map_free(bmap);
3332 /* For a div d = floor(f/m), add the constraints
3335 * -(f-(n-1)) + m d >= 0
3337 * Note that the second constraint is the negation of
3341 int isl_basic_map_add_div_constraints_var(__isl_keep isl_basic_map *bmap,
3342 unsigned pos, isl_int *div)
3345 unsigned total = isl_basic_map_total_dim(bmap);
3347 i = isl_basic_map_alloc_inequality(bmap);
3350 isl_seq_cpy(bmap->ineq[i], div + 1, 1 + total);
3351 isl_int_neg(bmap->ineq[i][1 + pos], div[0]);
3353 j = isl_basic_map_alloc_inequality(bmap);
3356 isl_seq_neg(bmap->ineq[j], bmap->ineq[i], 1 + total);
3357 isl_int_add(bmap->ineq[j][0], bmap->ineq[j][0], bmap->ineq[j][1 + pos]);
3358 isl_int_sub_ui(bmap->ineq[j][0], bmap->ineq[j][0], 1);
3362 int isl_basic_set_add_div_constraints_var(__isl_keep isl_basic_set *bset,
3363 unsigned pos, isl_int *div)
3365 return isl_basic_map_add_div_constraints_var((isl_basic_map *)bset,
3369 int isl_basic_map_add_div_constraints(struct isl_basic_map *bmap, unsigned div)
3371 unsigned total = isl_basic_map_total_dim(bmap);
3372 unsigned div_pos = total - bmap->n_div + div;
3374 return isl_basic_map_add_div_constraints_var(bmap, div_pos,
3378 struct isl_basic_set *isl_basic_map_underlying_set(
3379 struct isl_basic_map *bmap)
3383 if (bmap->dim->nparam == 0 && bmap->dim->n_in == 0 &&
3384 bmap->n_div == 0 && !isl_dim_get_tuple_name(bmap->dim, isl_dim_out))
3385 return (struct isl_basic_set *)bmap;
3386 bmap = isl_basic_map_cow(bmap);
3389 bmap->dim = isl_dim_underlying(bmap->dim, bmap->n_div);
3392 bmap->extra -= bmap->n_div;
3394 bmap = isl_basic_map_finalize(bmap);
3395 return (struct isl_basic_set *)bmap;
3400 __isl_give isl_basic_set *isl_basic_set_underlying_set(
3401 __isl_take isl_basic_set *bset)
3403 return isl_basic_map_underlying_set((isl_basic_map *)bset);
3406 struct isl_basic_map *isl_basic_map_overlying_set(
3407 struct isl_basic_set *bset, struct isl_basic_map *like)
3409 struct isl_basic_map *bmap;
3410 struct isl_ctx *ctx;
3417 isl_assert(ctx, bset->n_div == 0, goto error);
3418 isl_assert(ctx, isl_basic_set_n_param(bset) == 0, goto error);
3419 isl_assert(ctx, bset->dim->n_out == isl_basic_map_total_dim(like),
3421 if (isl_dim_equal(bset->dim, like->dim) && like->n_div == 0) {
3422 isl_basic_map_free(like);
3423 return (struct isl_basic_map *)bset;
3425 bset = isl_basic_set_cow(bset);
3428 total = bset->dim->n_out + bset->extra;
3429 bmap = (struct isl_basic_map *)bset;
3430 isl_dim_free(bmap->dim);
3431 bmap->dim = isl_dim_copy(like->dim);
3434 bmap->n_div = like->n_div;
3435 bmap->extra += like->n_div;
3438 ltotal = total - bmap->extra + like->extra;
3441 bmap->block2 = isl_blk_extend(ctx, bmap->block2,
3442 bmap->extra * (1 + 1 + total));
3443 if (isl_blk_is_error(bmap->block2))
3445 bmap->div = isl_realloc_array(ctx, bmap->div, isl_int *,
3449 for (i = 0; i < bmap->extra; ++i)
3450 bmap->div[i] = bmap->block2.data + i * (1 + 1 + total);
3451 for (i = 0; i < like->n_div; ++i) {
3452 isl_seq_cpy(bmap->div[i], like->div[i], 1 + 1 + ltotal);
3453 isl_seq_clr(bmap->div[i]+1+1+ltotal, total - ltotal);
3455 bmap = isl_basic_map_extend_constraints(bmap,
3456 0, 2 * like->n_div);
3457 for (i = 0; i < like->n_div; ++i) {
3458 if (isl_int_is_zero(bmap->div[i][0]))
3460 if (isl_basic_map_add_div_constraints(bmap, i) < 0)
3464 isl_basic_map_free(like);
3465 bmap = isl_basic_map_simplify(bmap);
3466 bmap = isl_basic_map_finalize(bmap);
3469 isl_basic_map_free(like);
3470 isl_basic_set_free(bset);
3474 struct isl_basic_set *isl_basic_set_from_underlying_set(
3475 struct isl_basic_set *bset, struct isl_basic_set *like)
3477 return (struct isl_basic_set *)
3478 isl_basic_map_overlying_set(bset, (struct isl_basic_map *)like);
3481 struct isl_set *isl_set_from_underlying_set(
3482 struct isl_set *set, struct isl_basic_set *like)
3488 isl_assert(set->ctx, set->dim->n_out == isl_basic_set_total_dim(like),
3490 if (isl_dim_equal(set->dim, like->dim) && like->n_div == 0) {
3491 isl_basic_set_free(like);
3494 set = isl_set_cow(set);
3497 for (i = 0; i < set->n; ++i) {
3498 set->p[i] = isl_basic_set_from_underlying_set(set->p[i],
3499 isl_basic_set_copy(like));
3503 isl_dim_free(set->dim);
3504 set->dim = isl_dim_copy(like->dim);
3507 isl_basic_set_free(like);
3510 isl_basic_set_free(like);
3515 struct isl_set *isl_map_underlying_set(struct isl_map *map)
3519 map = isl_map_cow(map);
3522 map->dim = isl_dim_cow(map->dim);
3526 for (i = 1; i < map->n; ++i)
3527 isl_assert(map->ctx, map->p[0]->n_div == map->p[i]->n_div,
3529 for (i = 0; i < map->n; ++i) {
3530 map->p[i] = (struct isl_basic_map *)
3531 isl_basic_map_underlying_set(map->p[i]);
3536 map->dim = isl_dim_underlying(map->dim, 0);
3538 isl_dim_free(map->dim);
3539 map->dim = isl_dim_copy(map->p[0]->dim);
3543 return (struct isl_set *)map;
3549 struct isl_set *isl_set_to_underlying_set(struct isl_set *set)
3551 return (struct isl_set *)isl_map_underlying_set((struct isl_map *)set);
3554 static __isl_give isl_basic_map *isl_basic_map_reset_dim(
3555 __isl_take isl_basic_map *bmap, __isl_take isl_dim *dim)
3557 bmap = isl_basic_map_cow(bmap);
3561 isl_dim_free(bmap->dim);
3564 bmap = isl_basic_map_finalize(bmap);
3568 isl_basic_map_free(bmap);
3573 static __isl_give isl_basic_set *isl_basic_set_reset_dim(
3574 __isl_take isl_basic_set *bset, __isl_take isl_dim *dim)
3576 return (isl_basic_set *)isl_basic_map_reset_dim((isl_basic_map *)bset,
3580 __isl_give isl_map *isl_map_reset_dim(__isl_take isl_map *map,
3581 __isl_take isl_dim *dim)
3585 map = isl_map_cow(map);
3589 for (i = 0; i < map->n; ++i) {
3590 map->p[i] = isl_basic_map_reset_dim(map->p[i],
3595 isl_dim_free(map->dim);
3605 __isl_give isl_set *isl_set_reset_dim(__isl_take isl_set *set,
3606 __isl_take isl_dim *dim)
3608 return (struct isl_set *) isl_map_reset_dim((struct isl_map *)set, dim);
3611 struct isl_basic_set *isl_basic_map_domain(struct isl_basic_map *bmap)
3614 struct isl_basic_set *domain;
3620 dim = isl_dim_domain(isl_basic_map_get_dim(bmap));
3622 n_in = isl_basic_map_n_in(bmap);
3623 n_out = isl_basic_map_n_out(bmap);
3624 domain = isl_basic_set_from_basic_map(bmap);
3625 domain = isl_basic_set_project_out(domain, isl_dim_set, n_in, n_out);
3627 domain = isl_basic_set_reset_dim(domain, dim);
3632 struct isl_basic_set *isl_basic_map_range(struct isl_basic_map *bmap)
3634 return isl_basic_map_domain(isl_basic_map_reverse(bmap));
3637 struct isl_set *isl_map_range(struct isl_map *map)
3640 struct isl_set *set;
3644 if (isl_map_dim(map, isl_dim_in) == 0)
3645 return (isl_set *)map;
3647 map = isl_map_cow(map);
3651 set = (struct isl_set *) map;
3652 set->dim = isl_dim_drop_inputs(set->dim, 0, set->dim->n_in);
3655 for (i = 0; i < map->n; ++i) {
3656 set->p[i] = isl_basic_map_range(map->p[i]);
3660 ISL_F_CLR(set, ISL_MAP_DISJOINT);
3661 ISL_F_CLR(set, ISL_SET_NORMALIZED);
3668 struct isl_map *isl_map_from_set(struct isl_set *set, struct isl_dim *dim)
3671 struct isl_map *map = NULL;
3673 set = isl_set_cow(set);
3676 isl_assert(set->ctx, isl_dim_compatible(set->dim, dim), goto error);
3677 map = (struct isl_map *)set;
3678 for (i = 0; i < set->n; ++i) {
3679 map->p[i] = isl_basic_map_from_basic_set(
3680 set->p[i], isl_dim_copy(dim));
3684 isl_dim_free(map->dim);
3693 __isl_give isl_basic_map *isl_basic_map_from_domain(
3694 __isl_take isl_basic_set *bset)
3696 return isl_basic_map_reverse(isl_basic_map_from_range(bset));
3699 __isl_give isl_basic_map *isl_basic_map_from_range(
3700 __isl_take isl_basic_set *bset)
3702 return (isl_basic_map *)bset;
3705 struct isl_map *isl_map_from_range(struct isl_set *set)
3707 return (struct isl_map *)set;
3710 __isl_give isl_map *isl_map_from_domain(__isl_take isl_set *set)
3712 return isl_map_reverse(isl_map_from_range(set));
3715 __isl_give isl_map *isl_map_from_domain_and_range(__isl_take isl_set *domain,
3716 __isl_take isl_set *range)
3718 return isl_map_apply_range(isl_map_from_domain(domain),
3719 isl_map_from_range(range));
3722 struct isl_set *isl_set_from_map(struct isl_map *map)
3725 struct isl_set *set = NULL;
3729 map = isl_map_cow(map);
3732 map->dim = isl_dim_as_set_dim(map->dim);
3735 set = (struct isl_set *)map;
3736 for (i = 0; i < map->n; ++i) {
3737 set->p[i] = isl_basic_set_from_basic_map(map->p[i]);
3747 struct isl_map *isl_map_alloc_dim(struct isl_dim *dim, int n, unsigned flags)
3749 struct isl_map *map;
3753 isl_assert(dim->ctx, n >= 0, return NULL);
3754 map = isl_alloc(dim->ctx, struct isl_map,
3755 sizeof(struct isl_map) +
3756 (n - 1) * sizeof(struct isl_basic_map *));
3760 map->ctx = dim->ctx;
3761 isl_ctx_ref(map->ctx);
3773 struct isl_map *isl_map_alloc(struct isl_ctx *ctx,
3774 unsigned nparam, unsigned in, unsigned out, int n,
3777 struct isl_map *map;
3778 struct isl_dim *dims;
3780 dims = isl_dim_alloc(ctx, nparam, in, out);
3784 map = isl_map_alloc_dim(dims, n, flags);
3788 struct isl_basic_map *isl_basic_map_empty(struct isl_dim *dim)
3790 struct isl_basic_map *bmap;
3791 bmap = isl_basic_map_alloc_dim(dim, 0, 1, 0);
3792 bmap = isl_basic_map_set_to_empty(bmap);
3796 struct isl_basic_set *isl_basic_set_empty(struct isl_dim *dim)
3798 struct isl_basic_set *bset;
3799 bset = isl_basic_set_alloc_dim(dim, 0, 1, 0);
3800 bset = isl_basic_set_set_to_empty(bset);
3804 struct isl_basic_map *isl_basic_map_empty_like(struct isl_basic_map *model)
3806 struct isl_basic_map *bmap;
3809 bmap = isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
3810 bmap = isl_basic_map_set_to_empty(bmap);
3814 struct isl_basic_map *isl_basic_map_empty_like_map(struct isl_map *model)
3816 struct isl_basic_map *bmap;
3819 bmap = isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
3820 bmap = isl_basic_map_set_to_empty(bmap);
3824 struct isl_basic_set *isl_basic_set_empty_like(struct isl_basic_set *model)
3826 struct isl_basic_set *bset;
3829 bset = isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
3830 bset = isl_basic_set_set_to_empty(bset);
3834 struct isl_basic_map *isl_basic_map_universe(struct isl_dim *dim)
3836 struct isl_basic_map *bmap;
3837 bmap = isl_basic_map_alloc_dim(dim, 0, 0, 0);
3841 struct isl_basic_set *isl_basic_set_universe(struct isl_dim *dim)
3843 struct isl_basic_set *bset;
3844 bset = isl_basic_set_alloc_dim(dim, 0, 0, 0);
3848 __isl_give isl_basic_map *isl_basic_map_universe_like(
3849 __isl_keep isl_basic_map *model)
3853 return isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
3856 struct isl_basic_set *isl_basic_set_universe_like(struct isl_basic_set *model)
3860 return isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
3863 __isl_give isl_basic_set *isl_basic_set_universe_like_set(
3864 __isl_keep isl_set *model)
3868 return isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
3871 struct isl_map *isl_map_empty(struct isl_dim *dim)
3873 return isl_map_alloc_dim(dim, 0, ISL_MAP_DISJOINT);
3876 struct isl_map *isl_map_empty_like(struct isl_map *model)
3880 return isl_map_alloc_dim(isl_dim_copy(model->dim), 0, ISL_MAP_DISJOINT);
3883 struct isl_map *isl_map_empty_like_basic_map(struct isl_basic_map *model)
3887 return isl_map_alloc_dim(isl_dim_copy(model->dim), 0, ISL_MAP_DISJOINT);
3890 struct isl_set *isl_set_empty(struct isl_dim *dim)
3892 return isl_set_alloc_dim(dim, 0, ISL_MAP_DISJOINT);
3895 struct isl_set *isl_set_empty_like(struct isl_set *model)
3899 return isl_set_empty(isl_dim_copy(model->dim));
3902 struct isl_map *isl_map_universe(struct isl_dim *dim)
3904 struct isl_map *map;
3907 map = isl_map_alloc_dim(isl_dim_copy(dim), 1, ISL_MAP_DISJOINT);
3908 map = isl_map_add_basic_map(map, isl_basic_map_universe(dim));
3912 struct isl_set *isl_set_universe(struct isl_dim *dim)
3914 struct isl_set *set;
3917 set = isl_set_alloc_dim(isl_dim_copy(dim), 1, ISL_MAP_DISJOINT);
3918 set = isl_set_add_basic_set(set, isl_basic_set_universe(dim));
3922 __isl_give isl_set *isl_set_universe_like(__isl_keep isl_set *model)
3926 return isl_set_universe(isl_dim_copy(model->dim));
3929 struct isl_map *isl_map_dup(struct isl_map *map)
3932 struct isl_map *dup;
3936 dup = isl_map_alloc_dim(isl_dim_copy(map->dim), map->n, map->flags);
3937 for (i = 0; i < map->n; ++i)
3938 dup = isl_map_add_basic_map(dup, isl_basic_map_copy(map->p[i]));
3942 __isl_give isl_map *isl_map_add_basic_map(__isl_take isl_map *map,
3943 __isl_take isl_basic_map *bmap)
3947 if (isl_basic_map_fast_is_empty(bmap)) {
3948 isl_basic_map_free(bmap);
3951 isl_assert(map->ctx, isl_dim_equal(map->dim, bmap->dim), goto error);
3952 isl_assert(map->ctx, map->n < map->size, goto error);
3953 map->p[map->n] = bmap;
3955 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3961 isl_basic_map_free(bmap);
3965 void isl_map_free(struct isl_map *map)
3975 isl_ctx_deref(map->ctx);
3976 for (i = 0; i < map->n; ++i)
3977 isl_basic_map_free(map->p[i]);
3978 isl_dim_free(map->dim);
3982 struct isl_map *isl_map_extend(struct isl_map *base,
3983 unsigned nparam, unsigned n_in, unsigned n_out)
3987 base = isl_map_cow(base);
3991 base->dim = isl_dim_extend(base->dim, nparam, n_in, n_out);
3994 for (i = 0; i < base->n; ++i) {
3995 base->p[i] = isl_basic_map_extend_dim(base->p[i],
3996 isl_dim_copy(base->dim), 0, 0, 0);
4006 struct isl_set *isl_set_extend(struct isl_set *base,
4007 unsigned nparam, unsigned dim)
4009 return (struct isl_set *)isl_map_extend((struct isl_map *)base,
4013 static struct isl_basic_map *isl_basic_map_fix_pos_si(
4014 struct isl_basic_map *bmap, unsigned pos, int value)
4018 bmap = isl_basic_map_cow(bmap);
4019 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
4020 j = isl_basic_map_alloc_equality(bmap);
4023 isl_seq_clr(bmap->eq[j] + 1, isl_basic_map_total_dim(bmap));
4024 isl_int_set_si(bmap->eq[j][pos], -1);
4025 isl_int_set_si(bmap->eq[j][0], value);
4026 bmap = isl_basic_map_simplify(bmap);
4027 return isl_basic_map_finalize(bmap);
4029 isl_basic_map_free(bmap);
4033 static __isl_give isl_basic_map *isl_basic_map_fix_pos(
4034 __isl_take isl_basic_map *bmap, unsigned pos, isl_int value)
4038 bmap = isl_basic_map_cow(bmap);
4039 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
4040 j = isl_basic_map_alloc_equality(bmap);
4043 isl_seq_clr(bmap->eq[j] + 1, isl_basic_map_total_dim(bmap));
4044 isl_int_set_si(bmap->eq[j][pos], -1);
4045 isl_int_set(bmap->eq[j][0], value);
4046 bmap = isl_basic_map_simplify(bmap);
4047 return isl_basic_map_finalize(bmap);
4049 isl_basic_map_free(bmap);
4053 struct isl_basic_map *isl_basic_map_fix_si(struct isl_basic_map *bmap,
4054 enum isl_dim_type type, unsigned pos, int value)
4058 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
4059 return isl_basic_map_fix_pos_si(bmap,
4060 isl_basic_map_offset(bmap, type) + pos, value);
4062 isl_basic_map_free(bmap);
4066 __isl_give isl_basic_map *isl_basic_map_fix(__isl_take isl_basic_map *bmap,
4067 enum isl_dim_type type, unsigned pos, isl_int value)
4071 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
4072 return isl_basic_map_fix_pos(bmap,
4073 isl_basic_map_offset(bmap, type) + pos, value);
4075 isl_basic_map_free(bmap);
4079 struct isl_basic_set *isl_basic_set_fix_si(struct isl_basic_set *bset,
4080 enum isl_dim_type type, unsigned pos, int value)
4082 return (struct isl_basic_set *)
4083 isl_basic_map_fix_si((struct isl_basic_map *)bset,
4087 __isl_give isl_basic_set *isl_basic_set_fix(__isl_take isl_basic_set *bset,
4088 enum isl_dim_type type, unsigned pos, isl_int value)
4090 return (struct isl_basic_set *)
4091 isl_basic_map_fix((struct isl_basic_map *)bset,
4095 struct isl_basic_map *isl_basic_map_fix_input_si(struct isl_basic_map *bmap,
4096 unsigned input, int value)
4098 return isl_basic_map_fix_si(bmap, isl_dim_in, input, value);
4101 struct isl_basic_set *isl_basic_set_fix_dim_si(struct isl_basic_set *bset,
4102 unsigned dim, int value)
4104 return (struct isl_basic_set *)
4105 isl_basic_map_fix_si((struct isl_basic_map *)bset,
4106 isl_dim_set, dim, value);
4109 struct isl_map *isl_map_fix_si(struct isl_map *map,
4110 enum isl_dim_type type, unsigned pos, int value)
4114 map = isl_map_cow(map);
4118 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
4119 for (i = 0; i < map->n; ++i) {
4120 map->p[i] = isl_basic_map_fix_si(map->p[i], type, pos, value);
4124 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4131 __isl_give isl_set *isl_set_fix_si(__isl_take isl_set *set,
4132 enum isl_dim_type type, unsigned pos, int value)
4134 return (struct isl_set *)
4135 isl_map_fix_si((struct isl_map *)set, type, pos, value);
4138 __isl_give isl_map *isl_map_fix(__isl_take isl_map *map,
4139 enum isl_dim_type type, unsigned pos, isl_int value)
4143 map = isl_map_cow(map);
4147 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
4148 for (i = 0; i < map->n; ++i) {
4149 map->p[i] = isl_basic_map_fix(map->p[i], type, pos, value);
4153 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4160 __isl_give isl_set *isl_set_fix(__isl_take isl_set *set,
4161 enum isl_dim_type type, unsigned pos, isl_int value)
4163 return (struct isl_set *)isl_map_fix((isl_map *)set, type, pos, value);
4166 struct isl_map *isl_map_fix_input_si(struct isl_map *map,
4167 unsigned input, int value)
4169 return isl_map_fix_si(map, isl_dim_in, input, value);
4172 struct isl_set *isl_set_fix_dim_si(struct isl_set *set, unsigned dim, int value)
4174 return (struct isl_set *)
4175 isl_map_fix_si((struct isl_map *)set, isl_dim_set, dim, value);
4178 __isl_give isl_basic_map *isl_basic_map_lower_bound_si(
4179 __isl_take isl_basic_map *bmap,
4180 enum isl_dim_type type, unsigned pos, int value)
4186 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
4187 pos += isl_basic_map_offset(bmap, type);
4188 bmap = isl_basic_map_cow(bmap);
4189 bmap = isl_basic_map_extend_constraints(bmap, 0, 1);
4190 j = isl_basic_map_alloc_inequality(bmap);
4193 isl_seq_clr(bmap->ineq[j], 1 + isl_basic_map_total_dim(bmap));
4194 isl_int_set_si(bmap->ineq[j][pos], 1);
4195 isl_int_set_si(bmap->ineq[j][0], -value);
4196 bmap = isl_basic_map_simplify(bmap);
4197 return isl_basic_map_finalize(bmap);
4199 isl_basic_map_free(bmap);
4203 struct isl_basic_set *isl_basic_set_lower_bound_dim(struct isl_basic_set *bset,
4204 unsigned dim, isl_int value)
4208 bset = isl_basic_set_cow(bset);
4209 bset = isl_basic_set_extend_constraints(bset, 0, 1);
4210 j = isl_basic_set_alloc_inequality(bset);
4213 isl_seq_clr(bset->ineq[j], 1 + isl_basic_set_total_dim(bset));
4214 isl_int_set_si(bset->ineq[j][1 + isl_basic_set_n_param(bset) + dim], 1);
4215 isl_int_neg(bset->ineq[j][0], value);
4216 bset = isl_basic_set_simplify(bset);
4217 return isl_basic_set_finalize(bset);
4219 isl_basic_set_free(bset);
4223 __isl_give isl_map *isl_map_lower_bound_si(__isl_take isl_map *map,
4224 enum isl_dim_type type, unsigned pos, int value)
4228 map = isl_map_cow(map);
4232 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
4233 for (i = 0; i < map->n; ++i) {
4234 map->p[i] = isl_basic_map_lower_bound_si(map->p[i],
4239 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4246 __isl_give isl_set *isl_set_lower_bound_si(__isl_take isl_set *set,
4247 enum isl_dim_type type, unsigned pos, int value)
4249 return (struct isl_set *)
4250 isl_map_lower_bound_si((struct isl_map *)set, type, pos, value);
4253 struct isl_set *isl_set_lower_bound_dim(struct isl_set *set, unsigned dim,
4258 set = isl_set_cow(set);
4262 isl_assert(set->ctx, dim < isl_set_n_dim(set), goto error);
4263 for (i = 0; i < set->n; ++i) {
4264 set->p[i] = isl_basic_set_lower_bound_dim(set->p[i], dim, value);
4274 struct isl_map *isl_map_reverse(struct isl_map *map)
4278 map = isl_map_cow(map);
4282 map->dim = isl_dim_reverse(map->dim);
4285 for (i = 0; i < map->n; ++i) {
4286 map->p[i] = isl_basic_map_reverse(map->p[i]);
4290 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4297 static struct isl_map *isl_basic_map_partial_lexopt(
4298 struct isl_basic_map *bmap, struct isl_basic_set *dom,
4299 struct isl_set **empty, int max)
4303 if (bmap->ctx->opt->pip == ISL_PIP_PIP)
4304 return isl_pip_basic_map_lexopt(bmap, dom, empty, max);
4306 return isl_tab_basic_map_partial_lexopt(bmap, dom, empty, max);
4308 isl_basic_map_free(bmap);
4309 isl_basic_set_free(dom);
4315 struct isl_map *isl_basic_map_partial_lexmax(
4316 struct isl_basic_map *bmap, struct isl_basic_set *dom,
4317 struct isl_set **empty)
4319 return isl_basic_map_partial_lexopt(bmap, dom, empty, 1);
4322 struct isl_map *isl_basic_map_partial_lexmin(
4323 struct isl_basic_map *bmap, struct isl_basic_set *dom,
4324 struct isl_set **empty)
4326 return isl_basic_map_partial_lexopt(bmap, dom, empty, 0);
4329 struct isl_set *isl_basic_set_partial_lexmin(
4330 struct isl_basic_set *bset, struct isl_basic_set *dom,
4331 struct isl_set **empty)
4333 return (struct isl_set *)
4334 isl_basic_map_partial_lexmin((struct isl_basic_map *)bset,
4338 struct isl_set *isl_basic_set_partial_lexmax(
4339 struct isl_basic_set *bset, struct isl_basic_set *dom,
4340 struct isl_set **empty)
4342 return (struct isl_set *)
4343 isl_basic_map_partial_lexmax((struct isl_basic_map *)bset,
4347 /* Given a basic map "bmap", compute the lexicograhically minimal
4348 * (or maximal) image element for each domain element in dom.
4349 * Set *empty to those elements in dom that do not have an image element.
4351 * We first make sure the basic sets in dom are disjoint and then
4352 * simply collect the results over each of the basic sets separately.
4353 * We could probably improve the efficiency a bit by moving the union
4354 * domain down into the parametric integer programming.
4356 static __isl_give isl_map *basic_map_partial_lexopt(
4357 __isl_take isl_basic_map *bmap, __isl_take isl_set *dom,
4358 __isl_give isl_set **empty, int max)
4361 struct isl_map *res;
4363 dom = isl_set_make_disjoint(dom);
4367 if (isl_set_fast_is_empty(dom)) {
4368 res = isl_map_empty_like_basic_map(bmap);
4369 *empty = isl_set_empty_like(dom);
4371 isl_basic_map_free(bmap);
4375 res = isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap),
4376 isl_basic_set_copy(dom->p[0]), empty, max);
4378 for (i = 1; i < dom->n; ++i) {
4379 struct isl_map *res_i;
4380 struct isl_set *empty_i;
4382 res_i = isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap),
4383 isl_basic_set_copy(dom->p[i]), &empty_i, max);
4385 res = isl_map_union_disjoint(res, res_i);
4386 *empty = isl_set_union_disjoint(*empty, empty_i);
4390 isl_basic_map_free(bmap);
4395 isl_basic_map_free(bmap);
4399 /* Given a map "map", compute the lexicograhically minimal
4400 * (or maximal) image element for each domain element in dom.
4401 * Set *empty to those elements in dom that do not have an image element.
4403 * We first compute the lexicographically minimal or maximal element
4404 * in the first basic map. This results in a partial solution "res"
4405 * and a subset "todo" of dom that still need to be handled.
4406 * We then consider each of the remaining maps in "map" and successively
4407 * improve both "res" and "todo".
4409 * Let res^k and todo^k be the results after k steps and let i = k + 1.
4410 * Assume we are computing the lexicographical maximum.
4411 * We first intersect basic map i with a relation that maps elements
4412 * to elements that are lexicographically larger than the image elements
4413 * in res^k and the compute the maximum image element of this intersection.
4414 * The result ("better") corresponds to those image elements in basic map i
4415 * that are better than what we had before. The remainder ("keep") are the
4416 * domain elements for which the image element in res_k was better.
4417 * We also compute the lexicographical maximum of basic map i in todo^k.
4418 * res^i is the result of the operation + better + those elements in
4419 * res^k that we should keep
4420 * todo^i is the remainder of the maximum operation on todo^k.
4422 static __isl_give isl_map *isl_map_partial_lexopt(
4423 __isl_take isl_map *map, __isl_take isl_set *dom,
4424 __isl_give isl_set **empty, int max)
4427 struct isl_map *res;
4428 struct isl_set *todo;
4433 if (isl_map_fast_is_empty(map)) {
4441 res = basic_map_partial_lexopt(isl_basic_map_copy(map->p[0]),
4442 isl_set_copy(dom), &todo, max);
4444 for (i = 1; i < map->n; ++i) {
4446 struct isl_map *better;
4447 struct isl_set *keep;
4448 struct isl_map *res_i;
4449 struct isl_set *todo_i;
4450 struct isl_dim *dim = isl_map_get_dim(res);
4452 dim = isl_dim_range(dim);
4454 lt = isl_map_lex_lt(dim);
4456 lt = isl_map_lex_gt(dim);
4457 lt = isl_map_apply_range(isl_map_copy(res), lt);
4458 lt = isl_map_intersect(lt,
4459 isl_map_from_basic_map(isl_basic_map_copy(map->p[i])));
4460 better = isl_map_partial_lexopt(lt,
4461 isl_map_domain(isl_map_copy(res)),
4464 res_i = basic_map_partial_lexopt(isl_basic_map_copy(map->p[i]),
4465 todo, &todo_i, max);
4467 res = isl_map_intersect_domain(res, keep);
4468 res = isl_map_union_disjoint(res, res_i);
4469 res = isl_map_union_disjoint(res, better);
4490 __isl_give isl_map *isl_map_partial_lexmax(
4491 __isl_take isl_map *map, __isl_take isl_set *dom,
4492 __isl_give isl_set **empty)
4494 return isl_map_partial_lexopt(map, dom, empty, 1);
4497 __isl_give isl_map *isl_map_partial_lexmin(
4498 __isl_take isl_map *map, __isl_take isl_set *dom,
4499 __isl_give isl_set **empty)
4501 return isl_map_partial_lexopt(map, dom, empty, 0);
4504 __isl_give isl_set *isl_set_partial_lexmin(
4505 __isl_take isl_set *set, __isl_take isl_set *dom,
4506 __isl_give isl_set **empty)
4508 return (struct isl_set *)
4509 isl_map_partial_lexmin((struct isl_map *)set,
4513 __isl_give isl_set *isl_set_partial_lexmax(
4514 __isl_take isl_set *set, __isl_take isl_set *dom,
4515 __isl_give isl_set **empty)
4517 return (struct isl_set *)
4518 isl_map_partial_lexmax((struct isl_map *)set,
4522 __isl_give isl_map *isl_basic_map_lexopt(__isl_take isl_basic_map *bmap, int max)
4524 struct isl_basic_set *dom = NULL;
4525 struct isl_dim *dom_dim;
4529 dom_dim = isl_dim_domain(isl_dim_copy(bmap->dim));
4530 dom = isl_basic_set_universe(dom_dim);
4531 return isl_basic_map_partial_lexopt(bmap, dom, NULL, max);
4533 isl_basic_map_free(bmap);
4537 __isl_give isl_map *isl_basic_map_lexmin(__isl_take isl_basic_map *bmap)
4539 return isl_basic_map_lexopt(bmap, 0);
4542 __isl_give isl_map *isl_basic_map_lexmax(__isl_take isl_basic_map *bmap)
4544 return isl_basic_map_lexopt(bmap, 1);
4547 __isl_give isl_set *isl_basic_set_lexmin(__isl_take isl_basic_set *bset)
4549 return (isl_set *)isl_basic_map_lexmin((isl_basic_map *)bset);
4552 __isl_give isl_set *isl_basic_set_lexmax(__isl_take isl_basic_set *bset)
4554 return (isl_set *)isl_basic_map_lexmax((isl_basic_map *)bset);
4557 __isl_give isl_map *isl_map_lexopt(__isl_take isl_map *map, int max)
4559 struct isl_set *dom = NULL;
4560 struct isl_dim *dom_dim;
4564 dom_dim = isl_dim_domain(isl_dim_copy(map->dim));
4565 dom = isl_set_universe(dom_dim);
4566 return isl_map_partial_lexopt(map, dom, NULL, max);
4572 __isl_give isl_map *isl_map_lexmin(__isl_take isl_map *map)
4574 return isl_map_lexopt(map, 0);
4577 __isl_give isl_map *isl_map_lexmax(__isl_take isl_map *map)
4579 return isl_map_lexopt(map, 1);
4582 __isl_give isl_set *isl_set_lexmin(__isl_take isl_set *set)
4584 return (isl_set *)isl_map_lexmin((isl_map *)set);
4587 __isl_give isl_set *isl_set_lexmax(__isl_take isl_set *set)
4589 return (isl_set *)isl_map_lexmax((isl_map *)set);
4592 /* Apply a preimage specified by "mat" on the parameters of "bset".
4593 * bset is assumed to have only parameters and divs.
4595 static struct isl_basic_set *basic_set_parameter_preimage(
4596 struct isl_basic_set *bset, struct isl_mat *mat)
4603 bset->dim = isl_dim_cow(bset->dim);
4607 nparam = isl_basic_set_dim(bset, isl_dim_param);
4609 isl_assert(bset->ctx, mat->n_row == 1 + nparam, goto error);
4611 bset->dim->nparam = 0;
4612 bset->dim->n_out = nparam;
4613 bset = isl_basic_set_preimage(bset, mat);
4615 bset->dim->nparam = bset->dim->n_out;
4616 bset->dim->n_out = 0;
4621 isl_basic_set_free(bset);
4625 /* Apply a preimage specified by "mat" on the parameters of "set".
4626 * set is assumed to have only parameters and divs.
4628 static struct isl_set *set_parameter_preimage(
4629 struct isl_set *set, struct isl_mat *mat)
4631 struct isl_dim *dim = NULL;
4637 dim = isl_dim_copy(set->dim);
4638 dim = isl_dim_cow(dim);
4642 nparam = isl_set_dim(set, isl_dim_param);
4644 isl_assert(set->ctx, mat->n_row == 1 + nparam, goto error);
4647 dim->n_out = nparam;
4648 isl_set_reset_dim(set, dim);
4649 set = isl_set_preimage(set, mat);
4652 dim = isl_dim_copy(set->dim);
4653 dim = isl_dim_cow(dim);
4656 dim->nparam = dim->n_out;
4658 isl_set_reset_dim(set, dim);
4668 /* Intersect the basic set "bset" with the affine space specified by the
4669 * equalities in "eq".
4671 static struct isl_basic_set *basic_set_append_equalities(
4672 struct isl_basic_set *bset, struct isl_mat *eq)
4680 bset = isl_basic_set_extend_dim(bset, isl_dim_copy(bset->dim), 0,
4685 len = 1 + isl_dim_total(bset->dim) + bset->extra;
4686 for (i = 0; i < eq->n_row; ++i) {
4687 k = isl_basic_set_alloc_equality(bset);
4690 isl_seq_cpy(bset->eq[k], eq->row[i], eq->n_col);
4691 isl_seq_clr(bset->eq[k] + eq->n_col, len - eq->n_col);
4695 bset = isl_basic_set_gauss(bset, NULL);
4696 bset = isl_basic_set_finalize(bset);
4701 isl_basic_set_free(bset);
4705 /* Intersect the set "set" with the affine space specified by the
4706 * equalities in "eq".
4708 static struct isl_set *set_append_equalities(struct isl_set *set,
4716 for (i = 0; i < set->n; ++i) {
4717 set->p[i] = basic_set_append_equalities(set->p[i],
4730 /* Project the given basic set onto its parameter domain, possibly introducing
4731 * new, explicit, existential variables in the constraints.
4732 * The input has parameters and (possibly implicit) existential variables.
4733 * The output has the same parameters, but only
4734 * explicit existentially quantified variables.
4736 * The actual projection is performed by pip, but pip doesn't seem
4737 * to like equalities very much, so we first remove the equalities
4738 * among the parameters by performing a variable compression on
4739 * the parameters. Afterward, an inverse transformation is performed
4740 * and the equalities among the parameters are inserted back in.
4742 static struct isl_set *parameter_compute_divs(struct isl_basic_set *bset)
4746 struct isl_mat *T, *T2;
4747 struct isl_set *set;
4748 unsigned nparam, n_div;
4750 bset = isl_basic_set_cow(bset);
4754 if (bset->n_eq == 0)
4755 return isl_basic_set_lexmin(bset);
4757 isl_basic_set_gauss(bset, NULL);
4759 nparam = isl_basic_set_dim(bset, isl_dim_param);
4760 n_div = isl_basic_set_dim(bset, isl_dim_div);
4762 for (i = 0, j = n_div - 1; i < bset->n_eq && j >= 0; --j) {
4763 if (!isl_int_is_zero(bset->eq[i][1 + nparam + j]))
4766 if (i == bset->n_eq)
4767 return isl_basic_set_lexmin(bset);
4769 eq = isl_mat_sub_alloc(bset->ctx, bset->eq, i, bset->n_eq - i,
4771 eq = isl_mat_cow(eq);
4772 T = isl_mat_variable_compression(isl_mat_copy(eq), &T2);
4773 if (T && T->n_col == 0) {
4777 bset = isl_basic_set_set_to_empty(bset);
4778 return isl_set_from_basic_set(bset);
4780 bset = basic_set_parameter_preimage(bset, T);
4782 set = isl_basic_set_lexmin(bset);
4783 set = set_parameter_preimage(set, T2);
4784 set = set_append_equalities(set, eq);
4788 /* Compute an explicit representation for all the existentially
4789 * quantified variables.
4790 * The input and output dimensions are first turned into parameters.
4791 * compute_divs then returns a map with the same parameters and
4792 * no input or output dimensions and the dimension specification
4793 * is reset to that of the input.
4795 static struct isl_map *compute_divs(struct isl_basic_map *bmap)
4797 struct isl_basic_set *bset;
4798 struct isl_set *set;
4799 struct isl_map *map;
4800 struct isl_dim *dim, *orig_dim = NULL;
4805 bmap = isl_basic_map_cow(bmap);
4809 nparam = isl_basic_map_dim(bmap, isl_dim_param);
4810 n_in = isl_basic_map_dim(bmap, isl_dim_in);
4811 n_out = isl_basic_map_dim(bmap, isl_dim_out);
4812 dim = isl_dim_set_alloc(bmap->ctx, nparam + n_in + n_out, 0);
4816 orig_dim = bmap->dim;
4818 bset = (struct isl_basic_set *)bmap;
4820 set = parameter_compute_divs(bset);
4821 map = (struct isl_map *)set;
4822 map = isl_map_reset_dim(map, orig_dim);
4826 isl_basic_map_free(bmap);
4830 static int basic_map_divs_known(__isl_keep isl_basic_map *bmap)
4838 off = isl_dim_total(bmap->dim);
4839 for (i = 0; i < bmap->n_div; ++i) {
4840 if (isl_int_is_zero(bmap->div[i][0]))
4842 isl_assert(bmap->ctx, isl_int_is_zero(bmap->div[i][1+1+off+i]),
4848 static int map_divs_known(__isl_keep isl_map *map)
4855 for (i = 0; i < map->n; ++i) {
4856 int known = basic_map_divs_known(map->p[i]);
4864 /* If bmap contains any unknown divs, then compute explicit
4865 * expressions for them. However, this computation may be
4866 * quite expensive, so first try to remove divs that aren't
4869 struct isl_map *isl_basic_map_compute_divs(struct isl_basic_map *bmap)
4873 struct isl_map *map;
4875 known = basic_map_divs_known(bmap);
4879 return isl_map_from_basic_map(bmap);
4881 bmap = isl_basic_map_drop_redundant_divs(bmap);
4883 known = basic_map_divs_known(bmap);
4887 return isl_map_from_basic_map(bmap);
4889 map = compute_divs(bmap);
4892 isl_basic_map_free(bmap);
4896 struct isl_map *isl_map_compute_divs(struct isl_map *map)
4900 struct isl_map *res;
4907 known = map_divs_known(map);
4915 res = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[0]));
4916 for (i = 1 ; i < map->n; ++i) {
4918 r2 = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[i]));
4919 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT))
4920 res = isl_map_union_disjoint(res, r2);
4922 res = isl_map_union(res, r2);
4929 struct isl_set *isl_basic_set_compute_divs(struct isl_basic_set *bset)
4931 return (struct isl_set *)
4932 isl_basic_map_compute_divs((struct isl_basic_map *)bset);
4935 struct isl_set *isl_set_compute_divs(struct isl_set *set)
4937 return (struct isl_set *)
4938 isl_map_compute_divs((struct isl_map *)set);
4941 struct isl_set *isl_map_domain(struct isl_map *map)
4944 struct isl_set *set;
4949 map = isl_map_cow(map);
4953 set = (struct isl_set *)map;
4954 set->dim = isl_dim_domain(set->dim);
4957 for (i = 0; i < map->n; ++i) {
4958 set->p[i] = isl_basic_map_domain(map->p[i]);
4962 ISL_F_CLR(set, ISL_MAP_DISJOINT);
4963 ISL_F_CLR(set, ISL_SET_NORMALIZED);
4970 struct isl_map *isl_map_union_disjoint(
4971 struct isl_map *map1, struct isl_map *map2)
4975 struct isl_map *map = NULL;
4989 isl_assert(map1->ctx, isl_dim_equal(map1->dim, map2->dim), goto error);
4991 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
4992 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
4993 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
4995 map = isl_map_alloc_dim(isl_dim_copy(map1->dim),
4996 map1->n + map2->n, flags);
4999 for (i = 0; i < map1->n; ++i) {
5000 map = isl_map_add_basic_map(map,
5001 isl_basic_map_copy(map1->p[i]));
5005 for (i = 0; i < map2->n; ++i) {
5006 map = isl_map_add_basic_map(map,
5007 isl_basic_map_copy(map2->p[i]));
5021 struct isl_map *isl_map_union(struct isl_map *map1, struct isl_map *map2)
5023 map1 = isl_map_union_disjoint(map1, map2);
5027 ISL_F_CLR(map1, ISL_MAP_DISJOINT);
5031 struct isl_set *isl_set_union_disjoint(
5032 struct isl_set *set1, struct isl_set *set2)
5034 return (struct isl_set *)
5035 isl_map_union_disjoint(
5036 (struct isl_map *)set1, (struct isl_map *)set2);
5039 struct isl_set *isl_set_union(struct isl_set *set1, struct isl_set *set2)
5041 return (struct isl_set *)
5042 isl_map_union((struct isl_map *)set1, (struct isl_map *)set2);
5045 struct isl_map *isl_map_intersect_range(
5046 struct isl_map *map, struct isl_set *set)
5049 struct isl_map *result;
5055 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT) &&
5056 ISL_F_ISSET(set, ISL_MAP_DISJOINT))
5057 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
5059 result = isl_map_alloc_dim(isl_dim_copy(map->dim),
5060 map->n * set->n, flags);
5063 for (i = 0; i < map->n; ++i)
5064 for (j = 0; j < set->n; ++j) {
5065 result = isl_map_add_basic_map(result,
5066 isl_basic_map_intersect_range(
5067 isl_basic_map_copy(map->p[i]),
5068 isl_basic_set_copy(set->p[j])));
5081 struct isl_map *isl_map_intersect_domain(
5082 struct isl_map *map, struct isl_set *set)
5084 return isl_map_reverse(
5085 isl_map_intersect_range(isl_map_reverse(map), set));
5088 struct isl_map *isl_map_apply_domain(
5089 struct isl_map *map1, struct isl_map *map2)
5093 map1 = isl_map_reverse(map1);
5094 map1 = isl_map_apply_range(map1, map2);
5095 return isl_map_reverse(map1);
5102 struct isl_map *isl_map_apply_range(
5103 struct isl_map *map1, struct isl_map *map2)
5105 struct isl_dim *dim_result;
5106 struct isl_map *result;
5112 dim_result = isl_dim_join(isl_dim_copy(map1->dim),
5113 isl_dim_copy(map2->dim));
5115 result = isl_map_alloc_dim(dim_result, map1->n * map2->n, 0);
5118 for (i = 0; i < map1->n; ++i)
5119 for (j = 0; j < map2->n; ++j) {
5120 result = isl_map_add_basic_map(result,
5121 isl_basic_map_apply_range(
5122 isl_basic_map_copy(map1->p[i]),
5123 isl_basic_map_copy(map2->p[j])));
5129 if (result && result->n <= 1)
5130 ISL_F_SET(result, ISL_MAP_DISJOINT);
5139 * returns range - domain
5141 struct isl_basic_set *isl_basic_map_deltas(struct isl_basic_map *bmap)
5143 isl_dim *dims, *target_dim;
5144 struct isl_basic_set *bset;
5151 isl_assert(bmap->ctx, isl_dim_tuple_match(bmap->dim, isl_dim_in,
5152 bmap->dim, isl_dim_out),
5154 target_dim = isl_dim_domain(isl_basic_map_get_dim(bmap));
5155 dim = isl_basic_map_n_in(bmap);
5156 nparam = isl_basic_map_n_param(bmap);
5157 bset = isl_basic_set_from_basic_map(bmap);
5158 bset = isl_basic_set_cow(bset);
5159 dims = isl_basic_set_get_dim(bset);
5160 dims = isl_dim_add(dims, isl_dim_set, dim);
5161 bset = isl_basic_set_extend_dim(bset, dims, 0, dim, 0);
5162 bset = isl_basic_set_swap_vars(bset, 2*dim);
5163 for (i = 0; i < dim; ++i) {
5164 int j = isl_basic_map_alloc_equality(
5165 (struct isl_basic_map *)bset);
5168 isl_seq_clr(bset->eq[j], 1 + isl_basic_set_total_dim(bset));
5169 isl_int_set_si(bset->eq[j][1+nparam+i], 1);
5170 isl_int_set_si(bset->eq[j][1+nparam+dim+i], 1);
5171 isl_int_set_si(bset->eq[j][1+nparam+2*dim+i], -1);
5173 bset = isl_basic_set_project_out(bset, isl_dim_set, dim, 2*dim);
5174 bset = isl_basic_set_reset_dim(bset, target_dim);
5177 isl_basic_map_free(bmap);
5182 * returns range - domain
5184 struct isl_set *isl_map_deltas(struct isl_map *map)
5188 struct isl_set *result;
5193 isl_assert(map->ctx, isl_dim_tuple_match(map->dim, isl_dim_in,
5194 map->dim, isl_dim_out),
5196 dim = isl_map_get_dim(map);
5197 dim = isl_dim_domain(dim);
5198 result = isl_set_alloc_dim(dim, map->n, map->flags);
5201 for (i = 0; i < map->n; ++i)
5202 result = isl_set_add_basic_set(result,
5203 isl_basic_map_deltas(isl_basic_map_copy(map->p[i])));
5211 static struct isl_basic_map *basic_map_identity(struct isl_dim *dims)
5213 struct isl_basic_map *bmap;
5221 nparam = dims->nparam;
5223 bmap = isl_basic_map_alloc_dim(dims, 0, dim, 0);
5227 for (i = 0; i < dim; ++i) {
5228 int j = isl_basic_map_alloc_equality(bmap);
5231 isl_seq_clr(bmap->eq[j], 1 + isl_basic_map_total_dim(bmap));
5232 isl_int_set_si(bmap->eq[j][1+nparam+i], 1);
5233 isl_int_set_si(bmap->eq[j][1+nparam+dim+i], -1);
5235 return isl_basic_map_finalize(bmap);
5237 isl_basic_map_free(bmap);
5241 struct isl_basic_map *isl_basic_map_identity(struct isl_dim *set_dim)
5243 struct isl_dim *dim = isl_dim_map(set_dim);
5246 return basic_map_identity(dim);
5249 struct isl_basic_map *isl_basic_map_identity_like(struct isl_basic_map *model)
5251 if (!model || !model->dim)
5253 isl_assert(model->ctx,
5254 model->dim->n_in == model->dim->n_out, return NULL);
5255 return basic_map_identity(isl_dim_copy(model->dim));
5258 static struct isl_map *map_identity(struct isl_dim *dim)
5260 struct isl_map *map = isl_map_alloc_dim(dim, 1, ISL_MAP_DISJOINT);
5261 return isl_map_add_basic_map(map, basic_map_identity(isl_dim_copy(dim)));
5264 struct isl_map *isl_map_identity(struct isl_dim *set_dim)
5266 struct isl_dim *dim = isl_dim_map(set_dim);
5269 return map_identity(dim);
5272 struct isl_map *isl_map_identity_like(struct isl_map *model)
5274 if (!model || !model->dim)
5276 isl_assert(model->ctx,
5277 model->dim->n_in == model->dim->n_out, return NULL);
5278 return map_identity(isl_dim_copy(model->dim));
5281 struct isl_map *isl_map_identity_like_basic_map(struct isl_basic_map *model)
5283 if (!model || !model->dim)
5285 isl_assert(model->ctx,
5286 model->dim->n_in == model->dim->n_out, return NULL);
5287 return map_identity(isl_dim_copy(model->dim));
5290 /* Construct a basic set with all set dimensions having only non-negative
5293 struct isl_basic_set *isl_basic_set_positive_orthant(struct isl_dim *dims)
5298 struct isl_basic_set *bset;
5302 nparam = dims->nparam;
5304 bset = isl_basic_set_alloc_dim(dims, 0, 0, dim);
5307 for (i = 0; i < dim; ++i) {
5308 int k = isl_basic_set_alloc_inequality(bset);
5311 isl_seq_clr(bset->ineq[k], 1 + isl_basic_set_total_dim(bset));
5312 isl_int_set_si(bset->ineq[k][1 + nparam + i], 1);
5316 isl_basic_set_free(bset);
5320 __isl_give isl_set *isl_set_split_dims(__isl_take isl_set *set,
5321 enum isl_dim_type type, unsigned first, unsigned n)
5324 isl_basic_set *nonneg = NULL;
5325 isl_basic_set *neg = NULL;
5332 isl_assert(set->ctx, first + n <= isl_set_dim(set, type), goto error);
5334 for (i = 0; i < n; ++i) {
5338 nonneg = isl_basic_set_alloc_dim(isl_set_get_dim(set), 0, 0, 1);
5339 k = isl_basic_set_alloc_inequality(nonneg);
5342 isl_seq_clr(nonneg->ineq[k], 1 + isl_basic_set_total_dim(nonneg));
5343 isl_int_set_si(nonneg->ineq[k][pos(set->dim, type) + first + i], 1);
5345 neg = isl_basic_set_alloc_dim(isl_set_get_dim(set), 0, 0, 1);
5346 k = isl_basic_set_alloc_inequality(neg);
5349 isl_seq_clr(neg->ineq[k], 1 + isl_basic_set_total_dim(neg));
5350 isl_int_set_si(neg->ineq[k][0], -1);
5351 isl_int_set_si(neg->ineq[k][pos(set->dim, type) + first + i], -1);
5353 set = isl_set_intersect(set, isl_basic_set_union(nonneg, neg));
5358 isl_basic_set_free(nonneg);
5359 isl_basic_set_free(neg);
5364 int isl_set_is_equal(struct isl_set *set1, struct isl_set *set2)
5366 return isl_map_is_equal((struct isl_map *)set1, (struct isl_map *)set2);
5369 int isl_basic_map_is_subset(
5370 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
5373 struct isl_map *map1;
5374 struct isl_map *map2;
5376 if (!bmap1 || !bmap2)
5379 map1 = isl_map_from_basic_map(isl_basic_map_copy(bmap1));
5380 map2 = isl_map_from_basic_map(isl_basic_map_copy(bmap2));
5382 is_subset = isl_map_is_subset(map1, map2);
5390 int isl_basic_map_is_equal(
5391 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
5395 if (!bmap1 || !bmap2)
5397 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
5400 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
5404 int isl_basic_set_is_equal(
5405 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
5407 return isl_basic_map_is_equal(
5408 (struct isl_basic_map *)bset1, (struct isl_basic_map *)bset2);
5411 int isl_map_is_empty(struct isl_map *map)
5418 for (i = 0; i < map->n; ++i) {
5419 is_empty = isl_basic_map_is_empty(map->p[i]);
5428 int isl_map_fast_is_empty(struct isl_map *map)
5430 return map ? map->n == 0 : -1;
5433 int isl_set_fast_is_empty(struct isl_set *set)
5435 return set ? set->n == 0 : -1;
5438 int isl_set_is_empty(struct isl_set *set)
5440 return isl_map_is_empty((struct isl_map *)set);
5443 int isl_map_has_equal_dim(__isl_keep isl_map *map1, __isl_keep isl_map *map2)
5448 return isl_dim_equal(map1->dim, map2->dim);
5451 int isl_set_has_equal_dim(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
5456 return isl_dim_equal(set1->dim, set2->dim);
5459 int isl_map_is_equal(struct isl_map *map1, struct isl_map *map2)
5465 is_subset = isl_map_is_subset(map1, map2);
5468 is_subset = isl_map_is_subset(map2, map1);
5472 int isl_basic_map_is_strict_subset(
5473 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
5477 if (!bmap1 || !bmap2)
5479 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
5482 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
5483 if (is_subset == -1)
5488 int isl_map_is_strict_subset(struct isl_map *map1, struct isl_map *map2)
5494 is_subset = isl_map_is_subset(map1, map2);
5497 is_subset = isl_map_is_subset(map2, map1);
5498 if (is_subset == -1)
5503 int isl_set_is_strict_subset(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
5505 return isl_map_is_strict_subset((isl_map *)set1, (isl_map *)set2);
5508 int isl_basic_map_is_universe(struct isl_basic_map *bmap)
5512 return bmap->n_eq == 0 && bmap->n_ineq == 0;
5515 int isl_basic_set_is_universe(struct isl_basic_set *bset)
5519 return bset->n_eq == 0 && bset->n_ineq == 0;
5522 int isl_map_fast_is_universe(__isl_keep isl_map *map)
5529 for (i = 0; i < map->n; ++i) {
5530 int r = isl_basic_map_is_universe(map->p[i]);
5538 int isl_set_fast_is_universe(__isl_keep isl_set *set)
5540 return isl_map_fast_is_universe((isl_map *) set);
5543 int isl_basic_map_is_empty(struct isl_basic_map *bmap)
5545 struct isl_basic_set *bset = NULL;
5546 struct isl_vec *sample = NULL;
5553 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY))
5556 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL)) {
5557 struct isl_basic_map *copy = isl_basic_map_copy(bmap);
5558 copy = isl_basic_map_remove_redundancies(copy);
5559 empty = ISL_F_ISSET(copy, ISL_BASIC_MAP_EMPTY);
5560 isl_basic_map_free(copy);
5564 total = 1 + isl_basic_map_total_dim(bmap);
5565 if (bmap->sample && bmap->sample->size == total) {
5566 int contains = isl_basic_map_contains(bmap, bmap->sample);
5572 isl_vec_free(bmap->sample);
5573 bmap->sample = NULL;
5574 bset = isl_basic_map_underlying_set(isl_basic_map_copy(bmap));
5577 sample = isl_basic_set_sample_vec(bset);
5580 empty = sample->size == 0;
5581 isl_vec_free(bmap->sample);
5582 bmap->sample = sample;
5584 ISL_F_SET(bmap, ISL_BASIC_MAP_EMPTY);
5589 int isl_basic_map_fast_is_empty(struct isl_basic_map *bmap)
5593 return ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY);
5596 int isl_basic_set_fast_is_empty(struct isl_basic_set *bset)
5600 return ISL_F_ISSET(bset, ISL_BASIC_SET_EMPTY);
5603 int isl_basic_set_is_empty(struct isl_basic_set *bset)
5605 return isl_basic_map_is_empty((struct isl_basic_map *)bset);
5608 struct isl_map *isl_basic_map_union(
5609 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
5611 struct isl_map *map;
5612 if (!bmap1 || !bmap2)
5615 isl_assert(bmap1->ctx, isl_dim_equal(bmap1->dim, bmap2->dim), goto error);
5617 map = isl_map_alloc_dim(isl_dim_copy(bmap1->dim), 2, 0);
5620 map = isl_map_add_basic_map(map, bmap1);
5621 map = isl_map_add_basic_map(map, bmap2);
5624 isl_basic_map_free(bmap1);
5625 isl_basic_map_free(bmap2);
5629 struct isl_set *isl_basic_set_union(
5630 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
5632 return (struct isl_set *)isl_basic_map_union(
5633 (struct isl_basic_map *)bset1,
5634 (struct isl_basic_map *)bset2);
5637 /* Order divs such that any div only depends on previous divs */
5638 struct isl_basic_map *isl_basic_map_order_divs(struct isl_basic_map *bmap)
5646 off = isl_dim_total(bmap->dim);
5648 for (i = 0; i < bmap->n_div; ++i) {
5650 if (isl_int_is_zero(bmap->div[i][0]))
5652 pos = isl_seq_first_non_zero(bmap->div[i]+1+1+off+i,
5656 isl_basic_map_swap_div(bmap, i, i + pos);
5662 struct isl_basic_set *isl_basic_set_order_divs(struct isl_basic_set *bset)
5664 return (struct isl_basic_set *)
5665 isl_basic_map_order_divs((struct isl_basic_map *)bset);
5668 __isl_give isl_map *isl_map_order_divs(__isl_take isl_map *map)
5675 for (i = 0; i < map->n; ++i) {
5676 map->p[i] = isl_basic_map_order_divs(map->p[i]);
5687 /* Look for a div in dst that corresponds to the div "div" in src.
5688 * The divs before "div" in src and dst are assumed to be the same.
5690 * Returns -1 if no corresponding div was found and the position
5691 * of the corresponding div in dst otherwise.
5693 static int find_div(struct isl_basic_map *dst,
5694 struct isl_basic_map *src, unsigned div)
5698 unsigned total = isl_dim_total(src->dim);
5700 isl_assert(dst->ctx, div <= dst->n_div, return -1);
5701 for (i = div; i < dst->n_div; ++i)
5702 if (isl_seq_eq(dst->div[i], src->div[div], 1+1+total+div) &&
5703 isl_seq_first_non_zero(dst->div[i]+1+1+total+div,
5704 dst->n_div - div) == -1)
5709 struct isl_basic_map *isl_basic_map_align_divs(
5710 struct isl_basic_map *dst, struct isl_basic_map *src)
5713 unsigned total = isl_dim_total(src->dim);
5718 if (src->n_div == 0)
5721 for (i = 0; i < src->n_div; ++i)
5722 isl_assert(src->ctx, !isl_int_is_zero(src->div[i][0]), goto error);
5724 src = isl_basic_map_order_divs(src);
5725 dst = isl_basic_map_cow(dst);
5726 dst = isl_basic_map_extend_dim(dst, isl_dim_copy(dst->dim),
5727 src->n_div, 0, 2 * src->n_div);
5730 for (i = 0; i < src->n_div; ++i) {
5731 int j = find_div(dst, src, i);
5733 j = isl_basic_map_alloc_div(dst);
5736 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total+i);
5737 isl_seq_clr(dst->div[j]+1+1+total+i, dst->n_div - i);
5738 if (isl_basic_map_add_div_constraints(dst, j) < 0)
5742 isl_basic_map_swap_div(dst, i, j);
5746 isl_basic_map_free(dst);
5750 struct isl_basic_set *isl_basic_set_align_divs(
5751 struct isl_basic_set *dst, struct isl_basic_set *src)
5753 return (struct isl_basic_set *)isl_basic_map_align_divs(
5754 (struct isl_basic_map *)dst, (struct isl_basic_map *)src);
5757 struct isl_map *isl_map_align_divs(struct isl_map *map)
5765 map = isl_map_compute_divs(map);
5766 map = isl_map_cow(map);
5770 for (i = 1; i < map->n; ++i)
5771 map->p[0] = isl_basic_map_align_divs(map->p[0], map->p[i]);
5772 for (i = 1; i < map->n; ++i)
5773 map->p[i] = isl_basic_map_align_divs(map->p[i], map->p[0]);
5775 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
5779 struct isl_set *isl_set_align_divs(struct isl_set *set)
5781 return (struct isl_set *)isl_map_align_divs((struct isl_map *)set);
5784 struct isl_set *isl_set_apply(struct isl_set *set, struct isl_map *map)
5788 isl_assert(set->ctx, isl_map_compatible_domain(map, set), goto error);
5789 map = isl_map_intersect_domain(map, set);
5790 set = isl_map_range(map);
5798 /* There is no need to cow as removing empty parts doesn't change
5799 * the meaning of the set.
5801 struct isl_map *isl_map_remove_empty_parts(struct isl_map *map)
5808 for (i = map->n-1; i >= 0; --i) {
5809 if (!ISL_F_ISSET(map->p[i], ISL_BASIC_MAP_EMPTY))
5811 isl_basic_map_free(map->p[i]);
5812 if (i != map->n-1) {
5813 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
5814 map->p[i] = map->p[map->n-1];
5822 struct isl_set *isl_set_remove_empty_parts(struct isl_set *set)
5824 return (struct isl_set *)
5825 isl_map_remove_empty_parts((struct isl_map *)set);
5828 struct isl_basic_map *isl_map_copy_basic_map(struct isl_map *map)
5830 struct isl_basic_map *bmap;
5831 if (!map || map->n == 0)
5833 bmap = map->p[map->n-1];
5834 isl_assert(map->ctx, ISL_F_ISSET(bmap, ISL_BASIC_SET_FINAL), return NULL);
5835 return isl_basic_map_copy(bmap);
5838 struct isl_basic_set *isl_set_copy_basic_set(struct isl_set *set)
5840 return (struct isl_basic_set *)
5841 isl_map_copy_basic_map((struct isl_map *)set);
5844 __isl_give isl_map *isl_map_drop_basic_map(__isl_take isl_map *map,
5845 __isl_keep isl_basic_map *bmap)
5851 for (i = map->n-1; i >= 0; --i) {
5852 if (map->p[i] != bmap)
5854 map = isl_map_cow(map);
5857 isl_basic_map_free(map->p[i]);
5858 if (i != map->n-1) {
5859 ISL_F_CLR(map, ISL_SET_NORMALIZED);
5860 map->p[i] = map->p[map->n-1];
5871 struct isl_set *isl_set_drop_basic_set(struct isl_set *set,
5872 struct isl_basic_set *bset)
5874 return (struct isl_set *)isl_map_drop_basic_map((struct isl_map *)set,
5875 (struct isl_basic_map *)bset);
5878 /* Given two basic sets bset1 and bset2, compute the maximal difference
5879 * between the values of dimension pos in bset1 and those in bset2
5880 * for any common value of the parameters and dimensions preceding pos.
5882 static enum isl_lp_result basic_set_maximal_difference_at(
5883 __isl_keep isl_basic_set *bset1, __isl_keep isl_basic_set *bset2,
5884 int pos, isl_int *opt)
5886 struct isl_dim *dims;
5887 struct isl_basic_map *bmap1 = NULL;
5888 struct isl_basic_map *bmap2 = NULL;
5889 struct isl_ctx *ctx;
5890 struct isl_vec *obj;
5893 unsigned dim1, dim2;
5894 enum isl_lp_result res;
5896 if (!bset1 || !bset2)
5897 return isl_lp_error;
5899 nparam = isl_basic_set_n_param(bset1);
5900 dim1 = isl_basic_set_n_dim(bset1);
5901 dim2 = isl_basic_set_n_dim(bset2);
5902 dims = isl_dim_alloc(bset1->ctx, nparam, pos, dim1 - pos);
5903 bmap1 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset1), dims);
5904 dims = isl_dim_alloc(bset2->ctx, nparam, pos, dim2 - pos);
5905 bmap2 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset2), dims);
5906 if (!bmap1 || !bmap2)
5908 bmap1 = isl_basic_map_cow(bmap1);
5909 bmap1 = isl_basic_map_extend(bmap1, nparam,
5910 pos, (dim1 - pos) + (dim2 - pos),
5911 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
5912 bmap1 = add_constraints(bmap1, bmap2, 0, dim1 - pos);
5915 total = isl_basic_map_total_dim(bmap1);
5917 obj = isl_vec_alloc(ctx, 1 + total);
5918 isl_seq_clr(obj->block.data, 1 + total);
5919 isl_int_set_si(obj->block.data[1+nparam+pos], 1);
5920 isl_int_set_si(obj->block.data[1+nparam+pos+(dim1-pos)], -1);
5923 res = isl_basic_map_solve_lp(bmap1, 1, obj->block.data, ctx->one,
5925 isl_basic_map_free(bmap1);
5929 isl_basic_map_free(bmap1);
5930 isl_basic_map_free(bmap2);
5931 return isl_lp_error;
5934 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
5935 * for any common value of the parameters and dimensions preceding pos
5936 * in both basic sets, the values of dimension pos in bset1 are
5937 * smaller or larger than those in bset2.
5940 * 1 if bset1 follows bset2
5941 * -1 if bset1 precedes bset2
5942 * 0 if bset1 and bset2 are incomparable
5943 * -2 if some error occurred.
5945 int isl_basic_set_compare_at(struct isl_basic_set *bset1,
5946 struct isl_basic_set *bset2, int pos)
5949 enum isl_lp_result res;
5954 res = basic_set_maximal_difference_at(bset1, bset2, pos, &opt);
5956 if (res == isl_lp_empty)
5958 else if ((res == isl_lp_ok && isl_int_is_pos(opt)) ||
5959 res == isl_lp_unbounded)
5961 else if (res == isl_lp_ok && isl_int_is_neg(opt))
5970 /* Given two basic sets bset1 and bset2, check whether
5971 * for any common value of the parameters and dimensions preceding pos
5972 * there is a value of dimension pos in bset1 that is larger
5973 * than a value of the same dimension in bset2.
5976 * 1 if there exists such a pair
5977 * 0 if there is no such pair, but there is a pair of equal values
5979 * -2 if some error occurred.
5981 int isl_basic_set_follows_at(__isl_keep isl_basic_set *bset1,
5982 __isl_keep isl_basic_set *bset2, int pos)
5985 enum isl_lp_result res;
5990 res = basic_set_maximal_difference_at(bset1, bset2, pos, &opt);
5992 if (res == isl_lp_empty)
5994 else if ((res == isl_lp_ok && isl_int_is_pos(opt)) ||
5995 res == isl_lp_unbounded)
5997 else if (res == isl_lp_ok && isl_int_is_neg(opt))
5999 else if (res == isl_lp_ok)
6008 /* Given two sets set1 and set2, check whether
6009 * for any common value of the parameters and dimensions preceding pos
6010 * there is a value of dimension pos in set1 that is larger
6011 * than a value of the same dimension in set2.
6014 * 1 if there exists such a pair
6015 * 0 if there is no such pair, but there is a pair of equal values
6017 * -2 if some error occurred.
6019 int isl_set_follows_at(__isl_keep isl_set *set1,
6020 __isl_keep isl_set *set2, int pos)
6028 for (i = 0; i < set1->n; ++i)
6029 for (j = 0; j < set2->n; ++j) {
6031 f = isl_basic_set_follows_at(set1->p[i], set2->p[j], pos);
6032 if (f == 1 || f == -2)
6041 static int isl_basic_map_fast_has_fixed_var(struct isl_basic_map *bmap,
6042 unsigned pos, isl_int *val)
6050 total = isl_basic_map_total_dim(bmap);
6051 for (i = 0, d = total-1; i < bmap->n_eq && d+1 > pos; ++i) {
6052 for (; d+1 > pos; --d)
6053 if (!isl_int_is_zero(bmap->eq[i][1+d]))
6057 if (isl_seq_first_non_zero(bmap->eq[i]+1, d) != -1)
6059 if (isl_seq_first_non_zero(bmap->eq[i]+1+d+1, total-d-1) != -1)
6061 if (!isl_int_is_one(bmap->eq[i][1+d]))
6064 isl_int_neg(*val, bmap->eq[i][0]);
6070 static int isl_map_fast_has_fixed_var(struct isl_map *map,
6071 unsigned pos, isl_int *val)
6083 return isl_basic_map_fast_has_fixed_var(map->p[0], pos, val);
6086 fixed = isl_basic_map_fast_has_fixed_var(map->p[0], pos, &v);
6087 for (i = 1; fixed == 1 && i < map->n; ++i) {
6088 fixed = isl_basic_map_fast_has_fixed_var(map->p[i], pos, &tmp);
6089 if (fixed == 1 && isl_int_ne(tmp, v))
6093 isl_int_set(*val, v);
6099 static int isl_basic_set_fast_has_fixed_var(struct isl_basic_set *bset,
6100 unsigned pos, isl_int *val)
6102 return isl_basic_map_fast_has_fixed_var((struct isl_basic_map *)bset,
6106 static int isl_set_fast_has_fixed_var(struct isl_set *set, unsigned pos,
6109 return isl_map_fast_has_fixed_var((struct isl_map *)set, pos, val);
6112 int isl_basic_map_fast_is_fixed(struct isl_basic_map *bmap,
6113 enum isl_dim_type type, unsigned pos, isl_int *val)
6115 if (pos >= isl_basic_map_dim(bmap, type))
6117 return isl_basic_map_fast_has_fixed_var(bmap,
6118 isl_basic_map_offset(bmap, type) - 1 + pos, val);
6121 int isl_map_fast_is_fixed(struct isl_map *map,
6122 enum isl_dim_type type, unsigned pos, isl_int *val)
6124 if (pos >= isl_map_dim(map, type))
6126 return isl_map_fast_has_fixed_var(map,
6127 map_offset(map, type) - 1 + pos, val);
6130 /* Check if dimension dim has fixed value and if so and if val is not NULL,
6131 * then return this fixed value in *val.
6133 int isl_basic_set_fast_dim_is_fixed(struct isl_basic_set *bset, unsigned dim,
6136 return isl_basic_set_fast_has_fixed_var(bset,
6137 isl_basic_set_n_param(bset) + dim, val);
6140 /* Check if dimension dim has fixed value and if so and if val is not NULL,
6141 * then return this fixed value in *val.
6143 int isl_set_fast_dim_is_fixed(struct isl_set *set, unsigned dim, isl_int *val)
6145 return isl_set_fast_has_fixed_var(set, isl_set_n_param(set) + dim, val);
6148 /* Check if input variable in has fixed value and if so and if val is not NULL,
6149 * then return this fixed value in *val.
6151 int isl_map_fast_input_is_fixed(struct isl_map *map, unsigned in, isl_int *val)
6153 return isl_map_fast_has_fixed_var(map, isl_map_n_param(map) + in, val);
6156 /* Check if dimension dim has an (obvious) fixed lower bound and if so
6157 * and if val is not NULL, then return this lower bound in *val.
6159 int isl_basic_set_fast_dim_has_fixed_lower_bound(struct isl_basic_set *bset,
6160 unsigned dim, isl_int *val)
6162 int i, i_eq = -1, i_ineq = -1;
6169 total = isl_basic_set_total_dim(bset);
6170 nparam = isl_basic_set_n_param(bset);
6171 for (i = 0; i < bset->n_eq; ++i) {
6172 if (isl_int_is_zero(bset->eq[i][1+nparam+dim]))
6178 for (i = 0; i < bset->n_ineq; ++i) {
6179 if (!isl_int_is_pos(bset->ineq[i][1+nparam+dim]))
6181 if (i_eq != -1 || i_ineq != -1)
6185 if (i_eq == -1 && i_ineq == -1)
6187 c = i_eq != -1 ? bset->eq[i_eq] : bset->ineq[i_ineq];
6188 /* The coefficient should always be one due to normalization. */
6189 if (!isl_int_is_one(c[1+nparam+dim]))
6191 if (isl_seq_first_non_zero(c+1, nparam+dim) != -1)
6193 if (isl_seq_first_non_zero(c+1+nparam+dim+1,
6194 total - nparam - dim - 1) != -1)
6197 isl_int_neg(*val, c[0]);
6201 int isl_set_fast_dim_has_fixed_lower_bound(struct isl_set *set,
6202 unsigned dim, isl_int *val)
6214 return isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[0],
6218 fixed = isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[0],
6220 for (i = 1; fixed == 1 && i < set->n; ++i) {
6221 fixed = isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[i],
6223 if (fixed == 1 && isl_int_ne(tmp, v))
6227 isl_int_set(*val, v);
6238 static int qsort_constraint_cmp(const void *p1, const void *p2)
6240 const struct constraint *c1 = (const struct constraint *)p1;
6241 const struct constraint *c2 = (const struct constraint *)p2;
6242 unsigned size = isl_min(c1->size, c2->size);
6243 return isl_seq_cmp(c1->c, c2->c, size);
6246 static struct isl_basic_map *isl_basic_map_sort_constraints(
6247 struct isl_basic_map *bmap)
6250 struct constraint *c;
6255 total = isl_basic_map_total_dim(bmap);
6256 c = isl_alloc_array(bmap->ctx, struct constraint, bmap->n_ineq);
6259 for (i = 0; i < bmap->n_ineq; ++i) {
6261 c[i].c = bmap->ineq[i];
6263 qsort(c, bmap->n_ineq, sizeof(struct constraint), qsort_constraint_cmp);
6264 for (i = 0; i < bmap->n_ineq; ++i)
6265 bmap->ineq[i] = c[i].c;
6269 isl_basic_map_free(bmap);
6273 __isl_give isl_basic_set *isl_basic_set_sort_constraints(
6274 __isl_take isl_basic_set *bset)
6276 return (struct isl_basic_set *)isl_basic_map_sort_constraints(
6277 (struct isl_basic_map *)bset);
6280 struct isl_basic_map *isl_basic_map_normalize(struct isl_basic_map *bmap)
6284 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_NORMALIZED))
6286 bmap = isl_basic_map_remove_redundancies(bmap);
6287 bmap = isl_basic_map_sort_constraints(bmap);
6288 ISL_F_SET(bmap, ISL_BASIC_MAP_NORMALIZED);
6292 struct isl_basic_set *isl_basic_set_normalize(struct isl_basic_set *bset)
6294 return (struct isl_basic_set *)isl_basic_map_normalize(
6295 (struct isl_basic_map *)bset);
6298 int isl_basic_map_fast_cmp(const __isl_keep isl_basic_map *bmap1,
6299 const __isl_keep isl_basic_map *bmap2)
6306 if (isl_basic_map_n_param(bmap1) != isl_basic_map_n_param(bmap2))
6307 return isl_basic_map_n_param(bmap1) - isl_basic_map_n_param(bmap2);
6308 if (isl_basic_map_n_in(bmap1) != isl_basic_map_n_in(bmap2))
6309 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
6310 if (isl_basic_map_n_out(bmap1) != isl_basic_map_n_out(bmap2))
6311 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
6312 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY) &&
6313 ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
6315 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY))
6317 if (ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
6319 if (bmap1->n_eq != bmap2->n_eq)
6320 return bmap1->n_eq - bmap2->n_eq;
6321 if (bmap1->n_ineq != bmap2->n_ineq)
6322 return bmap1->n_ineq - bmap2->n_ineq;
6323 if (bmap1->n_div != bmap2->n_div)
6324 return bmap1->n_div - bmap2->n_div;
6325 total = isl_basic_map_total_dim(bmap1);
6326 for (i = 0; i < bmap1->n_eq; ++i) {
6327 cmp = isl_seq_cmp(bmap1->eq[i], bmap2->eq[i], 1+total);
6331 for (i = 0; i < bmap1->n_ineq; ++i) {
6332 cmp = isl_seq_cmp(bmap1->ineq[i], bmap2->ineq[i], 1+total);
6336 for (i = 0; i < bmap1->n_div; ++i) {
6337 cmp = isl_seq_cmp(bmap1->div[i], bmap2->div[i], 1+1+total);
6344 int isl_basic_map_fast_is_equal(__isl_keep isl_basic_map *bmap1,
6345 __isl_keep isl_basic_map *bmap2)
6347 return isl_basic_map_fast_cmp(bmap1, bmap2) == 0;
6350 int isl_basic_set_fast_is_equal(__isl_keep isl_basic_set *bset1,
6351 __isl_keep isl_basic_set *bset2)
6353 return isl_basic_map_fast_is_equal((isl_basic_map *)bset1,
6354 (isl_basic_map *)bset2);
6357 static int qsort_bmap_cmp(const void *p1, const void *p2)
6359 const struct isl_basic_map *bmap1 = *(const struct isl_basic_map **)p1;
6360 const struct isl_basic_map *bmap2 = *(const struct isl_basic_map **)p2;
6362 return isl_basic_map_fast_cmp(bmap1, bmap2);
6365 /* We normalize in place, but if anything goes wrong we need
6366 * to return NULL, so we need to make sure we don't change the
6367 * meaning of any possible other copies of map.
6369 struct isl_map *isl_map_normalize(struct isl_map *map)
6372 struct isl_basic_map *bmap;
6376 if (ISL_F_ISSET(map, ISL_MAP_NORMALIZED))
6378 for (i = 0; i < map->n; ++i) {
6379 bmap = isl_basic_map_normalize(isl_basic_map_copy(map->p[i]));
6382 isl_basic_map_free(map->p[i]);
6385 qsort(map->p, map->n, sizeof(struct isl_basic_map *), qsort_bmap_cmp);
6386 ISL_F_SET(map, ISL_MAP_NORMALIZED);
6387 map = isl_map_remove_empty_parts(map);
6390 for (i = map->n - 1; i >= 1; --i) {
6391 if (!isl_basic_map_fast_is_equal(map->p[i-1], map->p[i]))
6393 isl_basic_map_free(map->p[i-1]);
6394 for (j = i; j < map->n; ++j)
6395 map->p[j-1] = map->p[j];
6405 struct isl_set *isl_set_normalize(struct isl_set *set)
6407 return (struct isl_set *)isl_map_normalize((struct isl_map *)set);
6410 int isl_map_fast_is_equal(struct isl_map *map1, struct isl_map *map2)
6420 if (!isl_dim_equal(map1->dim, map2->dim))
6423 map1 = isl_map_copy(map1);
6424 map2 = isl_map_copy(map2);
6425 map1 = isl_map_normalize(map1);
6426 map2 = isl_map_normalize(map2);
6429 equal = map1->n == map2->n;
6430 for (i = 0; equal && i < map1->n; ++i) {
6431 equal = isl_basic_map_fast_is_equal(map1->p[i], map2->p[i]);
6444 int isl_set_fast_is_equal(struct isl_set *set1, struct isl_set *set2)
6446 return isl_map_fast_is_equal((struct isl_map *)set1,
6447 (struct isl_map *)set2);
6450 /* Return an interval that ranges from min to max (inclusive)
6452 struct isl_basic_set *isl_basic_set_interval(struct isl_ctx *ctx,
6453 isl_int min, isl_int max)
6456 struct isl_basic_set *bset = NULL;
6458 bset = isl_basic_set_alloc(ctx, 0, 1, 0, 0, 2);
6462 k = isl_basic_set_alloc_inequality(bset);
6465 isl_int_set_si(bset->ineq[k][1], 1);
6466 isl_int_neg(bset->ineq[k][0], min);
6468 k = isl_basic_set_alloc_inequality(bset);
6471 isl_int_set_si(bset->ineq[k][1], -1);
6472 isl_int_set(bset->ineq[k][0], max);
6476 isl_basic_set_free(bset);
6480 /* Return the Cartesian product of the basic sets in list (in the given order).
6482 struct isl_basic_set *isl_basic_set_product(struct isl_basic_set_list *list)
6490 struct isl_basic_set *product = NULL;
6494 isl_assert(list->ctx, list->n > 0, goto error);
6495 isl_assert(list->ctx, list->p[0], goto error);
6496 nparam = isl_basic_set_n_param(list->p[0]);
6497 dim = isl_basic_set_n_dim(list->p[0]);
6498 extra = list->p[0]->n_div;
6499 n_eq = list->p[0]->n_eq;
6500 n_ineq = list->p[0]->n_ineq;
6501 for (i = 1; i < list->n; ++i) {
6502 isl_assert(list->ctx, list->p[i], goto error);
6503 isl_assert(list->ctx,
6504 nparam == isl_basic_set_n_param(list->p[i]), goto error);
6505 dim += isl_basic_set_n_dim(list->p[i]);
6506 extra += list->p[i]->n_div;
6507 n_eq += list->p[i]->n_eq;
6508 n_ineq += list->p[i]->n_ineq;
6510 product = isl_basic_set_alloc(list->ctx, nparam, dim, extra,
6515 for (i = 0; i < list->n; ++i) {
6516 isl_basic_set_add_constraints(product,
6517 isl_basic_set_copy(list->p[i]), dim);
6518 dim += isl_basic_set_n_dim(list->p[i]);
6520 isl_basic_set_list_free(list);
6523 isl_basic_set_free(product);
6524 isl_basic_set_list_free(list);
6528 struct isl_basic_map *isl_basic_map_product(
6529 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
6531 struct isl_dim *dim_result = NULL;
6532 struct isl_basic_map *bmap;
6533 unsigned in1, in2, out1, out2, nparam, total, pos;
6534 struct isl_dim_map *dim_map1, *dim_map2;
6536 if (!bmap1 || !bmap2)
6539 isl_assert(bmap1->ctx, isl_dim_match(bmap1->dim, isl_dim_param,
6540 bmap2->dim, isl_dim_param), goto error);
6541 dim_result = isl_dim_product(isl_dim_copy(bmap1->dim),
6542 isl_dim_copy(bmap2->dim));
6544 in1 = isl_basic_map_n_in(bmap1);
6545 in2 = isl_basic_map_n_in(bmap2);
6546 out1 = isl_basic_map_n_out(bmap1);
6547 out2 = isl_basic_map_n_out(bmap2);
6548 nparam = isl_basic_map_n_param(bmap1);
6550 total = nparam + in1 + in2 + out1 + out2 + bmap1->n_div + bmap2->n_div;
6551 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
6552 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
6553 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
6554 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
6555 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
6556 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos += in1);
6557 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += in2);
6558 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += out1);
6559 isl_dim_map_div(dim_map1, bmap1, pos += out2);
6560 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
6562 bmap = isl_basic_map_alloc_dim(dim_result,
6563 bmap1->n_div + bmap2->n_div,
6564 bmap1->n_eq + bmap2->n_eq,
6565 bmap1->n_ineq + bmap2->n_ineq);
6566 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
6567 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
6568 bmap = isl_basic_map_simplify(bmap);
6569 return isl_basic_map_finalize(bmap);
6571 isl_basic_map_free(bmap1);
6572 isl_basic_map_free(bmap2);
6576 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> [B -> D]
6578 struct isl_map *isl_map_product(struct isl_map *map1, struct isl_map *map2)
6581 struct isl_map *result;
6587 isl_assert(map1->ctx, isl_dim_match(map1->dim, isl_dim_param,
6588 map2->dim, isl_dim_param), goto error);
6590 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
6591 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
6592 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
6594 result = isl_map_alloc_dim(isl_dim_product(isl_dim_copy(map1->dim),
6595 isl_dim_copy(map2->dim)),
6596 map1->n * map2->n, flags);
6599 for (i = 0; i < map1->n; ++i)
6600 for (j = 0; j < map2->n; ++j) {
6601 struct isl_basic_map *part;
6602 part = isl_basic_map_product(
6603 isl_basic_map_copy(map1->p[i]),
6604 isl_basic_map_copy(map2->p[j]));
6605 if (isl_basic_map_is_empty(part))
6606 isl_basic_map_free(part);
6608 result = isl_map_add_basic_map(result, part);
6621 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
6623 __isl_give isl_map *isl_map_flat_product(__isl_take isl_map *map1,
6624 __isl_take isl_map *map2)
6628 prod = isl_map_product(map1, map2);
6629 prod = isl_map_flatten(prod);
6633 /* Given two set A and B, construct its Cartesian product A x B.
6635 struct isl_set *isl_set_product(struct isl_set *set1, struct isl_set *set2)
6637 return (struct isl_set *)isl_map_product((struct isl_map *)set1,
6638 (struct isl_map *)set2);
6641 __isl_give isl_set *isl_set_flat_product(__isl_take isl_set *set1,
6642 __isl_take isl_set *set2)
6644 return (isl_set *)isl_map_flat_product((isl_map *)set1, (isl_map *)set2);
6647 uint32_t isl_basic_set_get_hash(struct isl_basic_set *bset)
6650 uint32_t hash = isl_hash_init();
6655 bset = isl_basic_set_copy(bset);
6656 bset = isl_basic_set_normalize(bset);
6659 total = isl_basic_set_total_dim(bset);
6660 isl_hash_byte(hash, bset->n_eq & 0xFF);
6661 for (i = 0; i < bset->n_eq; ++i) {
6663 c_hash = isl_seq_get_hash(bset->eq[i], 1 + total);
6664 isl_hash_hash(hash, c_hash);
6666 isl_hash_byte(hash, bset->n_ineq & 0xFF);
6667 for (i = 0; i < bset->n_ineq; ++i) {
6669 c_hash = isl_seq_get_hash(bset->ineq[i], 1 + total);
6670 isl_hash_hash(hash, c_hash);
6672 isl_hash_byte(hash, bset->n_div & 0xFF);
6673 for (i = 0; i < bset->n_div; ++i) {
6675 if (isl_int_is_zero(bset->div[i][0]))
6677 isl_hash_byte(hash, i & 0xFF);
6678 c_hash = isl_seq_get_hash(bset->div[i], 1 + 1 + total);
6679 isl_hash_hash(hash, c_hash);
6681 isl_basic_set_free(bset);
6685 uint32_t isl_set_get_hash(struct isl_set *set)
6692 set = isl_set_copy(set);
6693 set = isl_set_normalize(set);
6697 hash = isl_hash_init();
6698 for (i = 0; i < set->n; ++i) {
6700 bset_hash = isl_basic_set_get_hash(set->p[i]);
6701 isl_hash_hash(hash, bset_hash);
6709 /* Check if the value for dimension dim is completely determined
6710 * by the values of the other parameters and variables.
6711 * That is, check if dimension dim is involved in an equality.
6713 int isl_basic_set_dim_is_unique(struct isl_basic_set *bset, unsigned dim)
6720 nparam = isl_basic_set_n_param(bset);
6721 for (i = 0; i < bset->n_eq; ++i)
6722 if (!isl_int_is_zero(bset->eq[i][1 + nparam + dim]))
6727 /* Check if the value for dimension dim is completely determined
6728 * by the values of the other parameters and variables.
6729 * That is, check if dimension dim is involved in an equality
6730 * for each of the subsets.
6732 int isl_set_dim_is_unique(struct isl_set *set, unsigned dim)
6738 for (i = 0; i < set->n; ++i) {
6740 unique = isl_basic_set_dim_is_unique(set->p[i], dim);
6747 int isl_map_foreach_basic_map(__isl_keep isl_map *map,
6748 int (*fn)(__isl_take isl_basic_map *bmap, void *user), void *user)
6755 for (i = 0; i < map->n; ++i)
6756 if (fn(isl_basic_map_copy(map->p[i]), user) < 0)
6762 int isl_set_foreach_basic_set(__isl_keep isl_set *set,
6763 int (*fn)(__isl_take isl_basic_set *bset, void *user), void *user)
6770 for (i = 0; i < set->n; ++i)
6771 if (fn(isl_basic_set_copy(set->p[i]), user) < 0)
6777 __isl_give isl_basic_set *isl_basic_set_lift(__isl_take isl_basic_set *bset)
6779 struct isl_dim *dim;
6784 if (bset->n_div == 0)
6787 bset = isl_basic_set_cow(bset);
6791 dim = isl_basic_set_get_dim(bset);
6792 dim = isl_dim_add(dim, isl_dim_set, bset->n_div);
6795 isl_dim_free(bset->dim);
6799 bset = isl_basic_set_finalize(bset);
6803 isl_basic_set_free(bset);
6807 __isl_give isl_set *isl_set_lift(__isl_take isl_set *set)
6810 struct isl_dim *dim;
6813 set = isl_set_align_divs(set);
6817 if (set->n == 0 || set->p[0]->n_div == 0)
6820 set = isl_set_cow(set);
6824 n_div = set->p[0]->n_div;
6825 dim = isl_set_get_dim(set);
6826 dim = isl_dim_add(dim, isl_dim_set, n_div);
6829 isl_dim_free(set->dim);
6832 for (i = 0; i < set->n; ++i) {
6833 set->p[i] = isl_basic_set_lift(set->p[i]);
6844 __isl_give isl_map *isl_set_lifting(__isl_take isl_set *set)
6846 struct isl_dim *dim;
6847 struct isl_basic_map *bmap;
6854 set = isl_set_align_divs(set);
6859 dim = isl_set_get_dim(set);
6860 if (set->n == 0 || set->p[0]->n_div == 0) {
6862 return isl_map_identity(dim);
6865 n_div = set->p[0]->n_div;
6866 dim = isl_dim_map(dim);
6867 n_param = isl_dim_size(dim, isl_dim_param);
6868 n_set = isl_dim_size(dim, isl_dim_in);
6869 dim = isl_dim_extend(dim, n_param, n_set, n_set + n_div);
6870 bmap = isl_basic_map_alloc_dim(dim, 0, n_set, 2 * n_div);
6871 for (i = 0; i < n_set; ++i)
6872 bmap = var_equal(bmap, i);
6874 total = n_param + n_set + n_set + n_div;
6875 for (i = 0; i < n_div; ++i) {
6876 k = isl_basic_map_alloc_inequality(bmap);
6879 isl_seq_cpy(bmap->ineq[k], set->p[0]->div[i]+1, 1+n_param);
6880 isl_seq_clr(bmap->ineq[k]+1+n_param, n_set);
6881 isl_seq_cpy(bmap->ineq[k]+1+n_param+n_set,
6882 set->p[0]->div[i]+1+1+n_param, n_set + n_div);
6883 isl_int_neg(bmap->ineq[k][1+n_param+n_set+n_set+i],
6884 set->p[0]->div[i][0]);
6886 l = isl_basic_map_alloc_inequality(bmap);
6889 isl_seq_neg(bmap->ineq[l], bmap->ineq[k], 1 + total);
6890 isl_int_add(bmap->ineq[l][0], bmap->ineq[l][0],
6891 set->p[0]->div[i][0]);
6892 isl_int_sub_ui(bmap->ineq[l][0], bmap->ineq[l][0], 1);
6896 return isl_map_from_basic_map(bmap);
6899 isl_basic_map_free(bmap);
6903 int isl_basic_set_size(__isl_keep isl_basic_set *bset)
6911 dim = isl_basic_set_total_dim(bset);
6912 size += bset->n_eq * (1 + dim);
6913 size += bset->n_ineq * (1 + dim);
6914 size += bset->n_div * (2 + dim);
6919 int isl_set_size(__isl_keep isl_set *set)
6927 for (i = 0; i < set->n; ++i)
6928 size += isl_basic_set_size(set->p[i]);
6933 int isl_basic_map_dim_is_bounded(__isl_keep isl_basic_map *bmap,
6934 enum isl_dim_type type, unsigned pos)
6942 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), return -1);
6944 pos += isl_basic_map_offset(bmap, type);
6946 for (i = 0; i < bmap->n_eq; ++i)
6947 if (!isl_int_is_zero(bmap->eq[i][pos]))
6951 for (i = 0; i < bmap->n_ineq; ++i) {
6952 int sgn = isl_int_sgn(bmap->ineq[i][pos]);
6959 return lower && upper;
6962 int isl_map_dim_is_bounded(__isl_keep isl_map *map,
6963 enum isl_dim_type type, unsigned pos)
6970 for (i = 0; i < map->n; ++i) {
6972 bounded = isl_basic_map_dim_is_bounded(map->p[i], type, pos);
6973 if (bounded < 0 || !bounded)
6980 /* Return 1 if the specified dim is involved in both an upper bound
6981 * and a lower bound.
6983 int isl_set_dim_is_bounded(__isl_keep isl_set *set,
6984 enum isl_dim_type type, unsigned pos)
6986 return isl_map_dim_is_bounded((isl_map *)set, type, pos);
6989 /* For each of the "n" variables starting at "first", determine
6990 * the sign of the variable and put the results in the first "n"
6991 * elements of the array "signs".
6993 * 1 means that the variable is non-negative
6994 * -1 means that the variable is non-positive
6995 * 0 means the variable attains both positive and negative values.
6997 int isl_basic_set_vars_get_sign(__isl_keep isl_basic_set *bset,
6998 unsigned first, unsigned n, int *signs)
7000 isl_vec *bound = NULL;
7001 struct isl_tab *tab = NULL;
7002 struct isl_tab_undo *snap;
7005 if (!bset || !signs)
7008 bound = isl_vec_alloc(bset->ctx, 1 + isl_basic_set_total_dim(bset));
7009 tab = isl_tab_from_basic_set(bset);
7013 isl_seq_clr(bound->el, bound->size);
7014 isl_int_set_si(bound->el[0], -1);
7016 snap = isl_tab_snap(tab);
7017 for (i = 0; i < n; ++i) {
7020 isl_int_set_si(bound->el[1 + first + i], -1);
7021 if (isl_tab_add_ineq(tab, bound->el) < 0)
7024 isl_int_set_si(bound->el[1 + first + i], 0);
7025 if (isl_tab_rollback(tab, snap) < 0)
7033 isl_int_set_si(bound->el[1 + first + i], 1);
7034 if (isl_tab_add_ineq(tab, bound->el) < 0)
7037 isl_int_set_si(bound->el[1 + first + i], 0);
7038 if (isl_tab_rollback(tab, snap) < 0)
7041 signs[i] = empty ? -1 : 0;
7045 isl_vec_free(bound);
7049 isl_vec_free(bound);
7053 int isl_basic_set_dims_get_sign(__isl_keep isl_basic_set *bset,
7054 enum isl_dim_type type, unsigned first, unsigned n, int *signs)
7056 if (!bset || !signs)
7058 isl_assert(bset->ctx, first + n <= isl_basic_set_dim(bset, type),
7061 first += pos(bset->dim, type) - 1;
7062 return isl_basic_set_vars_get_sign(bset, first, n, signs);
7065 /* Check if the given map is single-valued.
7070 * and check if the result is a subset of the identity mapping.
7072 int isl_map_is_single_valued(__isl_keep isl_map *map)
7078 test = isl_map_reverse(isl_map_copy(map));
7079 test = isl_map_apply_range(test, isl_map_copy(map));
7081 id = isl_map_identity(isl_dim_range(isl_map_get_dim(map)));
7083 sv = isl_map_is_subset(test, id);
7091 int isl_map_is_bijective(__isl_keep isl_map *map)
7095 sv = isl_map_is_single_valued(map);
7099 map = isl_map_copy(map);
7100 map = isl_map_reverse(map);
7101 sv = isl_map_is_single_valued(map);
7107 int isl_set_is_singleton(__isl_keep isl_set *set)
7109 return isl_map_is_single_valued((isl_map *)set);
7112 int isl_map_is_translation(__isl_keep isl_map *map)
7117 delta = isl_map_deltas(isl_map_copy(map));
7118 ok = isl_set_is_singleton(delta);
7119 isl_set_free(delta);
7124 static int unique(isl_int *p, unsigned pos, unsigned len)
7126 if (isl_seq_first_non_zero(p, pos) != -1)
7128 if (isl_seq_first_non_zero(p + pos + 1, len - pos - 1) != -1)
7133 int isl_basic_set_is_box(__isl_keep isl_basic_set *bset)
7142 if (isl_basic_set_dim(bset, isl_dim_div) != 0)
7145 nvar = isl_basic_set_dim(bset, isl_dim_set);
7146 ovar = isl_dim_offset(bset->dim, isl_dim_set);
7147 for (j = 0; j < nvar; ++j) {
7148 int lower = 0, upper = 0;
7149 for (i = 0; i < bset->n_eq; ++i) {
7150 if (isl_int_is_zero(bset->eq[i][1 + ovar + j]))
7152 if (!unique(bset->eq[i] + 1 + ovar, j, nvar))
7158 for (i = 0; i < bset->n_ineq; ++i) {
7159 if (isl_int_is_zero(bset->ineq[i][1 + ovar + j]))
7161 if (!unique(bset->ineq[i] + 1 + ovar, j, nvar))
7163 if (isl_int_is_pos(bset->ineq[i][1 + ovar + j]))
7168 if (!lower || !upper)
7175 int isl_set_is_box(__isl_keep isl_set *set)
7182 return isl_basic_set_is_box(set->p[0]);
7185 int isl_basic_set_is_wrapping(__isl_keep isl_basic_set *bset)
7190 return isl_dim_is_wrapping(bset->dim);
7193 int isl_set_is_wrapping(__isl_keep isl_set *set)
7198 return isl_dim_is_wrapping(set->dim);
7201 __isl_give isl_basic_set *isl_basic_map_wrap(__isl_take isl_basic_map *bmap)
7203 bmap = isl_basic_map_cow(bmap);
7207 bmap->dim = isl_dim_wrap(bmap->dim);
7211 bmap = isl_basic_map_finalize(bmap);
7213 return (isl_basic_set *)bmap;
7215 isl_basic_map_free(bmap);
7219 __isl_give isl_set *isl_map_wrap(__isl_take isl_map *map)
7223 map = isl_map_cow(map);
7227 for (i = 0; i < map->n; ++i) {
7228 map->p[i] = (isl_basic_map *)isl_basic_map_wrap(map->p[i]);
7232 map->dim = isl_dim_wrap(map->dim);
7236 return (isl_set *)map;
7242 __isl_give isl_basic_map *isl_basic_set_unwrap(__isl_take isl_basic_set *bset)
7244 bset = isl_basic_set_cow(bset);
7248 bset->dim = isl_dim_unwrap(bset->dim);
7252 bset = isl_basic_set_finalize(bset);
7254 return (isl_basic_map *)bset;
7256 isl_basic_set_free(bset);
7260 __isl_give isl_map *isl_set_unwrap(__isl_take isl_set *set)
7267 if (!isl_set_is_wrapping(set))
7268 isl_die(set->ctx, isl_error_invalid, "not a wrapping set",
7271 set = isl_set_cow(set);
7275 for (i = 0; i < set->n; ++i) {
7276 set->p[i] = (isl_basic_set *)isl_basic_set_unwrap(set->p[i]);
7281 set->dim = isl_dim_unwrap(set->dim);
7285 return (isl_map *)set;
7291 __isl_give isl_basic_map *isl_basic_map_reset(__isl_take isl_basic_map *bmap,
7292 enum isl_dim_type type)
7297 if (!isl_dim_is_named_or_nested(bmap->dim, type))
7300 bmap = isl_basic_map_cow(bmap);
7304 bmap->dim = isl_dim_reset(bmap->dim, type);
7308 bmap = isl_basic_map_finalize(bmap);
7312 isl_basic_map_free(bmap);
7316 __isl_give isl_map *isl_map_reset(__isl_take isl_map *map,
7317 enum isl_dim_type type)
7324 if (!isl_dim_is_named_or_nested(map->dim, type))
7327 map = isl_map_cow(map);
7331 for (i = 0; i < map->n; ++i) {
7332 map->p[i] = isl_basic_map_reset(map->p[i], type);
7336 map->dim = isl_dim_reset(map->dim, type);
7346 __isl_give isl_basic_map *isl_basic_map_flatten(__isl_take isl_basic_map *bmap)
7351 if (!bmap->dim->nested[0] && !bmap->dim->nested[1])
7354 bmap = isl_basic_map_cow(bmap);
7358 bmap->dim = isl_dim_flatten(bmap->dim);
7362 bmap = isl_basic_map_finalize(bmap);
7366 isl_basic_map_free(bmap);
7370 __isl_give isl_map *isl_map_flatten(__isl_take isl_map *map)
7377 if (!map->dim->nested[0] && !map->dim->nested[1])
7380 map = isl_map_cow(map);
7384 for (i = 0; i < map->n; ++i) {
7385 map->p[i] = isl_basic_map_flatten(map->p[i]);
7389 map->dim = isl_dim_flatten(map->dim);
7399 /* Extend the given dim_map with mappings for the divs in bmap.
7401 static __isl_give struct isl_dim_map *extend_dim_map(
7402 __isl_keep struct isl_dim_map *dim_map,
7403 __isl_keep isl_basic_map *bmap)
7406 struct isl_dim_map *res;
7409 offset = isl_basic_map_offset(bmap, isl_dim_div);
7411 res = isl_dim_map_alloc(bmap->ctx, dim_map->len - 1 + bmap->n_div);
7415 for (i = 0; i < dim_map->len; ++i)
7416 res->pos[i] = dim_map->pos[i];
7417 for (i = 0; i < bmap->n_div; ++i)
7418 res->pos[dim_map->len + i] = offset + i;
7423 /* Extract a dim_map from a reordering.
7424 * We essentially need to reverse the mapping, and add an offset
7425 * of 1 for the constant term.
7427 __isl_give struct isl_dim_map *isl_dim_map_from_reordering(
7428 __isl_keep isl_reordering *exp)
7431 struct isl_dim_map *dim_map;
7436 dim_map = isl_dim_map_alloc(exp->dim->ctx, isl_dim_total(exp->dim));
7440 for (i = 0; i < exp->len; ++i)
7441 dim_map->pos[1 + exp->pos[i]] = 1 + i;
7446 /* Reorder the dimensions of "bmap" according to the given dim_map
7447 * and set the dimension specification to "dim".
7449 __isl_give isl_basic_map *isl_basic_map_realign(__isl_take isl_basic_map *bmap,
7450 __isl_take isl_dim *dim, __isl_take struct isl_dim_map *dim_map)
7454 bmap = isl_basic_map_cow(bmap);
7455 if (!bmap || !dim || !dim_map)
7458 res = isl_basic_map_alloc_dim(dim,
7459 bmap->n_div, bmap->n_eq, bmap->n_ineq);
7460 res = add_constraints_dim_map(res, bmap, dim_map);
7461 res = isl_basic_map_finalize(res);
7465 isl_basic_map_free(bmap);
7470 /* Reorder the dimensions of "map" according to given reordering.
7472 __isl_give isl_map *isl_map_realign(__isl_take isl_map *map,
7473 __isl_take isl_reordering *r)
7476 struct isl_dim_map *dim_map;
7478 map = isl_map_cow(map);
7479 dim_map = isl_dim_map_from_reordering(r);
7480 if (!map || !r || !dim_map)
7483 for (i = 0; i < map->n; ++i) {
7484 struct isl_dim_map *dim_map_i;
7486 dim_map_i = extend_dim_map(dim_map, map->p[i]);
7488 map->p[i] = isl_basic_map_realign(map->p[i],
7489 isl_dim_copy(r->dim), dim_map_i);
7495 map = isl_map_reset_dim(map, isl_dim_copy(r->dim));
7497 isl_reordering_free(r);
7503 isl_reordering_free(r);
7507 __isl_give isl_set *isl_set_realign(__isl_take isl_set *set,
7508 __isl_take isl_reordering *r)
7510 return (isl_set *)isl_map_realign((isl_map *)set, r);
7513 __isl_give isl_mat *isl_basic_map_equalities_matrix(
7514 __isl_keep isl_basic_map *bmap, enum isl_dim_type c1,
7515 enum isl_dim_type c2, enum isl_dim_type c3,
7516 enum isl_dim_type c4, enum isl_dim_type c5)
7518 enum isl_dim_type c[5] = { c1, c2, c3, c4, c5 };
7519 struct isl_mat *mat;
7525 mat = isl_mat_alloc(bmap->ctx, bmap->n_eq,
7526 isl_basic_map_total_dim(bmap) + 1);
7529 for (i = 0; i < bmap->n_eq; ++i)
7530 for (j = 0, pos = 0; j < 5; ++j) {
7531 int off = isl_basic_map_offset(bmap, c[j]);
7532 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
7533 isl_int_set(mat->row[i][pos],
7534 bmap->eq[i][off + k]);
7542 __isl_give isl_mat *isl_basic_map_inequalities_matrix(
7543 __isl_keep isl_basic_map *bmap, enum isl_dim_type c1,
7544 enum isl_dim_type c2, enum isl_dim_type c3,
7545 enum isl_dim_type c4, enum isl_dim_type c5)
7547 enum isl_dim_type c[5] = { c1, c2, c3, c4, c5 };
7548 struct isl_mat *mat;
7554 mat = isl_mat_alloc(bmap->ctx, bmap->n_ineq,
7555 isl_basic_map_total_dim(bmap) + 1);
7558 for (i = 0; i < bmap->n_ineq; ++i)
7559 for (j = 0, pos = 0; j < 5; ++j) {
7560 int off = isl_basic_map_offset(bmap, c[j]);
7561 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
7562 isl_int_set(mat->row[i][pos],
7563 bmap->ineq[i][off + k]);
7571 __isl_give isl_basic_map *isl_basic_map_from_constraint_matrices(
7572 __isl_take isl_dim *dim,
7573 __isl_take isl_mat *eq, __isl_take isl_mat *ineq, enum isl_dim_type c1,
7574 enum isl_dim_type c2, enum isl_dim_type c3,
7575 enum isl_dim_type c4, enum isl_dim_type c5)
7577 enum isl_dim_type c[5] = { c1, c2, c3, c4, c5 };
7578 isl_basic_map *bmap;
7584 if (!dim || !eq || !ineq)
7587 if (eq->n_col != ineq->n_col)
7588 isl_die(dim->ctx, isl_error_invalid,
7589 "equalities and inequalities matrices should have "
7590 "same number of columns", goto error);
7592 total = 1 + isl_dim_total(dim);
7594 if (eq->n_col < total)
7595 isl_die(dim->ctx, isl_error_invalid,
7596 "number of columns too small", goto error);
7598 extra = eq->n_col - total;
7600 bmap = isl_basic_map_alloc_dim(isl_dim_copy(dim), extra,
7601 eq->n_row, ineq->n_row);
7604 for (i = 0; i < extra; ++i)
7605 if (isl_basic_map_alloc_div(bmap) < 0)
7607 for (i = 0; i < eq->n_row; ++i) {
7608 l = isl_basic_map_alloc_equality(bmap);
7611 for (j = 0, pos = 0; j < 5; ++j) {
7612 int off = isl_basic_map_offset(bmap, c[j]);
7613 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
7614 isl_int_set(bmap->eq[l][off + k],
7620 for (i = 0; i < ineq->n_row; ++i) {
7621 l = isl_basic_map_alloc_inequality(bmap);
7624 for (j = 0, pos = 0; j < 5; ++j) {
7625 int off = isl_basic_map_offset(bmap, c[j]);
7626 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
7627 isl_int_set(bmap->ineq[l][off + k],
7646 __isl_give isl_basic_set *isl_basic_set_from_constraint_matrices(
7647 __isl_take isl_dim *dim,
7648 __isl_take isl_mat *eq, __isl_take isl_mat *ineq, enum isl_dim_type c1,
7649 enum isl_dim_type c2, enum isl_dim_type c3, enum isl_dim_type c4)
7651 return (isl_basic_set*)
7652 isl_basic_map_from_constraint_matrices(dim, eq, ineq,
7653 c1, c2, c3, c4, isl_dim_in);