2 * Copyright 2008-2009 Katholieke Universiteit Leuven
3 * Copyright 2010 INRIA Saclay
5 * Use of this software is governed by the GNU LGPLv2.1 license
7 * Written by Sven Verdoolaege, K.U.Leuven, Departement
8 * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium
9 * and INRIA Saclay - Ile-de-France, Parc Club Orsay Universite,
10 * ZAC des vignes, 4 rue Jacques Monod, 91893 Orsay, France
17 #include "isl_dim_private.h"
18 #include "isl_equalities.h"
24 #include "isl_map_private.h"
25 #include "isl_map_piplib.h"
26 #include <isl_reordering.h>
27 #include "isl_sample.h"
30 #include <isl_mat_private.h>
32 /* Maps dst positions to src positions */
38 static struct isl_dim_map *isl_dim_map_alloc(struct isl_ctx *ctx, unsigned len)
41 struct isl_dim_map *dim_map;
42 dim_map = isl_alloc(ctx, struct isl_dim_map,
43 sizeof(struct isl_dim_map) + len * sizeof(int));
46 dim_map->len = 1 + len;
48 for (i = 0; i < len; ++i)
49 dim_map->pos[1 + i] = -1;
53 static unsigned n(struct isl_dim *dim, enum isl_dim_type type)
56 case isl_dim_param: return dim->nparam;
57 case isl_dim_in: return dim->n_in;
58 case isl_dim_out: return dim->n_out;
59 case isl_dim_all: return dim->nparam + dim->n_in + dim->n_out;
64 static unsigned pos(struct isl_dim *dim, enum isl_dim_type type)
67 case isl_dim_param: return 1;
68 case isl_dim_in: return 1 + dim->nparam;
69 case isl_dim_out: return 1 + dim->nparam + dim->n_in;
74 static void isl_dim_map_dim_range(struct isl_dim_map *dim_map,
75 struct isl_dim *dim, enum isl_dim_type type,
76 unsigned first, unsigned n, unsigned dst_pos)
84 src_pos = pos(dim, type);
85 for (i = 0; i < n; ++i)
86 dim_map->pos[1 + dst_pos + i] = src_pos + first + i;
89 static void isl_dim_map_dim(struct isl_dim_map *dim_map, struct isl_dim *dim,
90 enum isl_dim_type type, unsigned dst_pos)
92 isl_dim_map_dim_range(dim_map, dim, type, 0, n(dim, type), dst_pos);
95 static void isl_dim_map_div(struct isl_dim_map *dim_map,
96 struct isl_basic_map *bmap, unsigned dst_pos)
101 if (!dim_map || !bmap)
104 src_pos = 1 + isl_dim_total(bmap->dim);
105 for (i = 0; i < bmap->n_div; ++i)
106 dim_map->pos[1 + dst_pos + i] = src_pos + i;
109 static void isl_dim_map_dump(struct isl_dim_map *dim_map)
113 for (i = 0; i < dim_map->len; ++i)
114 fprintf(stderr, "%d -> %d; ", i, dim_map->pos[i]);
115 fprintf(stderr, "\n");
118 unsigned isl_basic_map_dim(const struct isl_basic_map *bmap,
119 enum isl_dim_type type)
124 case isl_dim_cst: return 1;
127 case isl_dim_out: return isl_dim_size(bmap->dim, type);
128 case isl_dim_div: return bmap->n_div;
129 case isl_dim_all: return isl_basic_map_total_dim(bmap);
134 unsigned isl_map_dim(const struct isl_map *map, enum isl_dim_type type)
136 return map ? n(map->dim, type) : 0;
139 unsigned isl_set_dim(const struct isl_set *set, enum isl_dim_type type)
141 return set ? n(set->dim, type) : 0;
144 unsigned isl_basic_map_offset(struct isl_basic_map *bmap,
145 enum isl_dim_type type)
147 struct isl_dim *dim = bmap->dim;
149 case isl_dim_cst: return 0;
150 case isl_dim_param: return 1;
151 case isl_dim_in: return 1 + dim->nparam;
152 case isl_dim_out: return 1 + dim->nparam + dim->n_in;
153 case isl_dim_div: return 1 + dim->nparam + dim->n_in + dim->n_out;
158 static unsigned map_offset(struct isl_map *map, enum isl_dim_type type)
160 return pos(map->dim, type);
163 unsigned isl_basic_set_dim(const struct isl_basic_set *bset,
164 enum isl_dim_type type)
166 return isl_basic_map_dim((const struct isl_basic_map*)bset, type);
169 unsigned isl_basic_set_n_dim(const struct isl_basic_set *bset)
171 return isl_basic_set_dim(bset, isl_dim_set);
174 unsigned isl_basic_set_n_param(const struct isl_basic_set *bset)
176 return isl_basic_set_dim(bset, isl_dim_param);
179 unsigned isl_basic_set_total_dim(const struct isl_basic_set *bset)
181 return isl_dim_total(bset->dim) + bset->n_div;
184 unsigned isl_set_n_dim(const struct isl_set *set)
186 return isl_set_dim(set, isl_dim_set);
189 unsigned isl_set_n_param(const struct isl_set *set)
191 return isl_set_dim(set, isl_dim_param);
194 unsigned isl_basic_map_n_in(const struct isl_basic_map *bmap)
196 return bmap ? bmap->dim->n_in : 0;
199 unsigned isl_basic_map_n_out(const struct isl_basic_map *bmap)
201 return bmap ? bmap->dim->n_out : 0;
204 unsigned isl_basic_map_n_param(const struct isl_basic_map *bmap)
206 return bmap ? bmap->dim->nparam : 0;
209 unsigned isl_basic_map_n_div(const struct isl_basic_map *bmap)
211 return bmap ? bmap->n_div : 0;
214 unsigned isl_basic_map_total_dim(const struct isl_basic_map *bmap)
216 return bmap ? isl_dim_total(bmap->dim) + bmap->n_div : 0;
219 unsigned isl_map_n_in(const struct isl_map *map)
221 return map->dim->n_in;
224 unsigned isl_map_n_out(const struct isl_map *map)
226 return map->dim->n_out;
229 unsigned isl_map_n_param(const struct isl_map *map)
231 return map->dim->nparam;
234 int isl_map_compatible_domain(struct isl_map *map, struct isl_set *set)
239 m = isl_dim_match(map->dim, isl_dim_param, set->dim, isl_dim_param);
242 return isl_dim_tuple_match(map->dim, isl_dim_in, set->dim, isl_dim_set);
245 int isl_basic_map_compatible_domain(struct isl_basic_map *bmap,
246 struct isl_basic_set *bset)
251 m = isl_dim_match(bmap->dim, isl_dim_param, bset->dim, isl_dim_param);
254 return isl_dim_tuple_match(bmap->dim, isl_dim_in, bset->dim, isl_dim_set);
257 int isl_basic_map_compatible_range(struct isl_basic_map *bmap,
258 struct isl_basic_set *bset)
263 m = isl_dim_match(bmap->dim, isl_dim_param, bset->dim, isl_dim_param);
266 return isl_dim_tuple_match(bmap->dim, isl_dim_out, bset->dim, isl_dim_set);
269 isl_ctx *isl_basic_map_get_ctx(__isl_keep isl_basic_map *bmap)
271 return bmap ? bmap->ctx : NULL;
274 isl_ctx *isl_basic_set_get_ctx(__isl_keep isl_basic_set *bset)
276 return bset ? bset->ctx : NULL;
279 isl_ctx *isl_map_get_ctx(__isl_keep isl_map *map)
281 return map ? map->ctx : NULL;
284 isl_ctx *isl_set_get_ctx(__isl_keep isl_set *set)
286 return set ? set->ctx : NULL;
289 struct isl_dim *isl_basic_map_get_dim(struct isl_basic_map *bmap)
293 return isl_dim_copy(bmap->dim);
296 struct isl_dim *isl_basic_set_get_dim(struct isl_basic_set *bset)
300 return isl_dim_copy(bset->dim);
303 struct isl_dim *isl_map_get_dim(struct isl_map *map)
307 return isl_dim_copy(map->dim);
310 struct isl_dim *isl_set_get_dim(struct isl_set *set)
314 return isl_dim_copy(set->dim);
317 __isl_give isl_basic_map *isl_basic_map_set_tuple_name(
318 __isl_take isl_basic_map *bmap, enum isl_dim_type type, const char *s)
320 bmap = isl_basic_map_cow(bmap);
323 bmap->dim = isl_dim_set_tuple_name(bmap->dim, type, s);
328 isl_basic_map_free(bmap);
332 const char *isl_basic_map_get_tuple_name(__isl_keep isl_basic_map *bmap,
333 enum isl_dim_type type)
335 return bmap ? isl_dim_get_tuple_name(bmap->dim, type) : NULL;
338 __isl_give isl_map *isl_map_set_tuple_name(__isl_take isl_map *map,
339 enum isl_dim_type type, const char *s)
343 map = isl_map_cow(map);
347 map->dim = isl_dim_set_tuple_name(map->dim, type, s);
351 for (i = 0; i < map->n; ++i) {
352 map->p[i] = isl_basic_map_set_tuple_name(map->p[i], type, s);
363 __isl_give isl_set *isl_set_set_tuple_name(__isl_take isl_set *set,
366 return (isl_set *)isl_map_set_tuple_name((isl_map *)set, isl_dim_set, s);
369 __isl_give isl_basic_map *isl_basic_map_set_dim_name(
370 __isl_take isl_basic_map *bmap,
371 enum isl_dim_type type, unsigned pos, const char *s)
375 bmap->dim = isl_dim_set_name(bmap->dim, type, pos, s);
380 isl_basic_map_free(bmap);
384 __isl_give isl_map *isl_map_set_dim_name(__isl_take isl_map *map,
385 enum isl_dim_type type, unsigned pos, const char *s)
392 map->dim = isl_dim_set_name(map->dim, type, pos, s);
396 for (i = 0; i < map->n; ++i) {
397 map->p[i] = isl_basic_map_set_dim_name(map->p[i], type, pos, s);
408 __isl_give isl_basic_set *isl_basic_set_set_dim_name(
409 __isl_take isl_basic_set *bset,
410 enum isl_dim_type type, unsigned pos, const char *s)
412 return (isl_basic_set *)isl_basic_map_set_dim_name(
413 (isl_basic_map *)bset, type, pos, s);
416 __isl_give isl_set *isl_set_set_dim_name(__isl_take isl_set *set,
417 enum isl_dim_type type, unsigned pos, const char *s)
419 return (isl_set *)isl_map_set_dim_name((isl_map *)set, type, pos, s);
422 int isl_basic_map_is_rational(__isl_keep isl_basic_map *bmap)
426 return ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL);
429 static struct isl_basic_map *basic_map_init(struct isl_ctx *ctx,
430 struct isl_basic_map *bmap, unsigned extra,
431 unsigned n_eq, unsigned n_ineq)
434 size_t row_size = 1 + isl_dim_total(bmap->dim) + extra;
439 bmap->block = isl_blk_alloc(ctx, (n_ineq + n_eq) * row_size);
440 if (isl_blk_is_error(bmap->block))
443 bmap->ineq = isl_alloc_array(ctx, isl_int *, n_ineq + n_eq);
448 bmap->block2 = isl_blk_empty();
451 bmap->block2 = isl_blk_alloc(ctx, extra * (1 + row_size));
452 if (isl_blk_is_error(bmap->block2))
455 bmap->div = isl_alloc_array(ctx, isl_int *, extra);
460 for (i = 0; i < n_ineq + n_eq; ++i)
461 bmap->ineq[i] = bmap->block.data + i * row_size;
463 for (i = 0; i < extra; ++i)
464 bmap->div[i] = bmap->block2.data + i * (1 + row_size);
468 bmap->c_size = n_eq + n_ineq;
469 bmap->eq = bmap->ineq + n_ineq;
478 isl_basic_map_free(bmap);
482 struct isl_basic_set *isl_basic_set_alloc(struct isl_ctx *ctx,
483 unsigned nparam, unsigned dim, unsigned extra,
484 unsigned n_eq, unsigned n_ineq)
486 struct isl_basic_map *bmap;
487 bmap = isl_basic_map_alloc(ctx, nparam, 0, dim, extra, n_eq, n_ineq);
488 return (struct isl_basic_set *)bmap;
491 struct isl_basic_set *isl_basic_set_alloc_dim(struct isl_dim *dim,
492 unsigned extra, unsigned n_eq, unsigned n_ineq)
494 struct isl_basic_map *bmap;
497 isl_assert(dim->ctx, dim->n_in == 0, return NULL);
498 bmap = isl_basic_map_alloc_dim(dim, extra, n_eq, n_ineq);
499 return (struct isl_basic_set *)bmap;
502 struct isl_basic_map *isl_basic_map_alloc_dim(struct isl_dim *dim,
503 unsigned extra, unsigned n_eq, unsigned n_ineq)
505 struct isl_basic_map *bmap;
509 bmap = isl_calloc_type(dim->ctx, struct isl_basic_map);
514 return basic_map_init(dim->ctx, bmap, extra, n_eq, n_ineq);
520 struct isl_basic_map *isl_basic_map_alloc(struct isl_ctx *ctx,
521 unsigned nparam, unsigned in, unsigned out, unsigned extra,
522 unsigned n_eq, unsigned n_ineq)
524 struct isl_basic_map *bmap;
527 dim = isl_dim_alloc(ctx, nparam, in, out);
531 bmap = isl_basic_map_alloc_dim(dim, extra, n_eq, n_ineq);
535 static void dup_constraints(
536 struct isl_basic_map *dst, struct isl_basic_map *src)
539 unsigned total = isl_basic_map_total_dim(src);
541 for (i = 0; i < src->n_eq; ++i) {
542 int j = isl_basic_map_alloc_equality(dst);
543 isl_seq_cpy(dst->eq[j], src->eq[i], 1+total);
546 for (i = 0; i < src->n_ineq; ++i) {
547 int j = isl_basic_map_alloc_inequality(dst);
548 isl_seq_cpy(dst->ineq[j], src->ineq[i], 1+total);
551 for (i = 0; i < src->n_div; ++i) {
552 int j = isl_basic_map_alloc_div(dst);
553 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total);
555 ISL_F_SET(dst, ISL_BASIC_SET_FINAL);
558 struct isl_basic_map *isl_basic_map_dup(struct isl_basic_map *bmap)
560 struct isl_basic_map *dup;
564 dup = isl_basic_map_alloc_dim(isl_dim_copy(bmap->dim),
565 bmap->n_div, bmap->n_eq, bmap->n_ineq);
568 dup_constraints(dup, bmap);
569 dup->flags = bmap->flags;
570 dup->sample = isl_vec_copy(bmap->sample);
574 struct isl_basic_set *isl_basic_set_dup(struct isl_basic_set *bset)
576 struct isl_basic_map *dup;
578 dup = isl_basic_map_dup((struct isl_basic_map *)bset);
579 return (struct isl_basic_set *)dup;
582 struct isl_basic_set *isl_basic_set_copy(struct isl_basic_set *bset)
587 if (ISL_F_ISSET(bset, ISL_BASIC_SET_FINAL)) {
591 return isl_basic_set_dup(bset);
594 struct isl_set *isl_set_copy(struct isl_set *set)
603 struct isl_basic_map *isl_basic_map_copy(struct isl_basic_map *bmap)
608 if (ISL_F_ISSET(bmap, ISL_BASIC_SET_FINAL)) {
612 bmap = isl_basic_map_dup(bmap);
614 ISL_F_SET(bmap, ISL_BASIC_SET_FINAL);
618 struct isl_map *isl_map_copy(struct isl_map *map)
627 void isl_basic_map_free(struct isl_basic_map *bmap)
635 isl_ctx_deref(bmap->ctx);
637 isl_blk_free(bmap->ctx, bmap->block2);
639 isl_blk_free(bmap->ctx, bmap->block);
640 isl_vec_free(bmap->sample);
641 isl_dim_free(bmap->dim);
645 void isl_basic_set_free(struct isl_basic_set *bset)
647 isl_basic_map_free((struct isl_basic_map *)bset);
650 static int room_for_con(struct isl_basic_map *bmap, unsigned n)
652 return bmap->n_eq + bmap->n_ineq + n <= bmap->c_size;
655 int isl_basic_map_alloc_equality(struct isl_basic_map *bmap)
661 isl_assert(ctx, room_for_con(bmap, 1), return -1);
662 isl_assert(ctx, (bmap->eq - bmap->ineq) + bmap->n_eq <= bmap->c_size,
664 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
665 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
666 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_IMPLICIT);
667 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
668 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
669 if ((bmap->eq - bmap->ineq) + bmap->n_eq == bmap->c_size) {
671 int j = isl_basic_map_alloc_inequality(bmap);
675 bmap->ineq[j] = bmap->ineq[bmap->n_ineq - 1];
676 bmap->ineq[bmap->n_ineq - 1] = bmap->eq[-1];
683 isl_seq_clr(bmap->eq[bmap->n_eq] + 1 + isl_basic_map_total_dim(bmap),
684 bmap->extra - bmap->n_div);
688 int isl_basic_set_alloc_equality(struct isl_basic_set *bset)
690 return isl_basic_map_alloc_equality((struct isl_basic_map *)bset);
693 int isl_basic_map_free_equality(struct isl_basic_map *bmap, unsigned n)
697 isl_assert(bmap->ctx, n <= bmap->n_eq, return -1);
702 int isl_basic_set_free_equality(struct isl_basic_set *bset, unsigned n)
704 return isl_basic_map_free_equality((struct isl_basic_map *)bset, n);
707 int isl_basic_map_drop_equality(struct isl_basic_map *bmap, unsigned pos)
712 isl_assert(bmap->ctx, pos < bmap->n_eq, return -1);
714 if (pos != bmap->n_eq - 1) {
716 bmap->eq[pos] = bmap->eq[bmap->n_eq - 1];
717 bmap->eq[bmap->n_eq - 1] = t;
723 int isl_basic_set_drop_equality(struct isl_basic_set *bset, unsigned pos)
725 return isl_basic_map_drop_equality((struct isl_basic_map *)bset, pos);
728 void isl_basic_map_inequality_to_equality(
729 struct isl_basic_map *bmap, unsigned pos)
734 bmap->ineq[pos] = bmap->ineq[bmap->n_ineq - 1];
735 bmap->ineq[bmap->n_ineq - 1] = bmap->eq[-1];
740 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
741 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
742 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
743 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
746 static int room_for_ineq(struct isl_basic_map *bmap, unsigned n)
748 return bmap->n_ineq + n <= bmap->eq - bmap->ineq;
751 int isl_basic_map_alloc_inequality(struct isl_basic_map *bmap)
757 isl_assert(ctx, room_for_ineq(bmap, 1), return -1);
758 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_IMPLICIT);
759 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
760 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
761 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
762 isl_seq_clr(bmap->ineq[bmap->n_ineq] +
763 1 + isl_basic_map_total_dim(bmap),
764 bmap->extra - bmap->n_div);
765 return bmap->n_ineq++;
768 int isl_basic_set_alloc_inequality(struct isl_basic_set *bset)
770 return isl_basic_map_alloc_inequality((struct isl_basic_map *)bset);
773 int isl_basic_map_free_inequality(struct isl_basic_map *bmap, unsigned n)
777 isl_assert(bmap->ctx, n <= bmap->n_ineq, return -1);
782 int isl_basic_set_free_inequality(struct isl_basic_set *bset, unsigned n)
784 return isl_basic_map_free_inequality((struct isl_basic_map *)bset, n);
787 int isl_basic_map_drop_inequality(struct isl_basic_map *bmap, unsigned pos)
792 isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
794 if (pos != bmap->n_ineq - 1) {
796 bmap->ineq[pos] = bmap->ineq[bmap->n_ineq - 1];
797 bmap->ineq[bmap->n_ineq - 1] = t;
798 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
804 int isl_basic_set_drop_inequality(struct isl_basic_set *bset, unsigned pos)
806 return isl_basic_map_drop_inequality((struct isl_basic_map *)bset, pos);
809 __isl_give isl_basic_map *isl_basic_map_add_eq(__isl_take isl_basic_map *bmap,
814 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
817 k = isl_basic_map_alloc_equality(bmap);
820 isl_seq_cpy(bmap->eq[k], eq, 1 + isl_basic_map_total_dim(bmap));
823 isl_basic_map_free(bmap);
827 __isl_give isl_basic_set *isl_basic_set_add_eq(__isl_take isl_basic_set *bset,
830 return (isl_basic_set *)
831 isl_basic_map_add_eq((isl_basic_map *)bset, eq);
834 __isl_give isl_basic_map *isl_basic_map_add_ineq(__isl_take isl_basic_map *bmap,
839 bmap = isl_basic_map_extend_constraints(bmap, 0, 1);
842 k = isl_basic_map_alloc_inequality(bmap);
845 isl_seq_cpy(bmap->ineq[k], ineq, 1 + isl_basic_map_total_dim(bmap));
848 isl_basic_map_free(bmap);
852 __isl_give isl_basic_set *isl_basic_set_add_ineq(__isl_take isl_basic_set *bset,
855 return (isl_basic_set *)
856 isl_basic_map_add_ineq((isl_basic_map *)bset, ineq);
859 int isl_basic_map_alloc_div(struct isl_basic_map *bmap)
863 isl_assert(bmap->ctx, bmap->n_div < bmap->extra, return -1);
864 isl_seq_clr(bmap->div[bmap->n_div] +
865 1 + 1 + isl_basic_map_total_dim(bmap),
866 bmap->extra - bmap->n_div);
867 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
868 return bmap->n_div++;
871 int isl_basic_set_alloc_div(struct isl_basic_set *bset)
873 return isl_basic_map_alloc_div((struct isl_basic_map *)bset);
876 int isl_basic_map_free_div(struct isl_basic_map *bmap, unsigned n)
880 isl_assert(bmap->ctx, n <= bmap->n_div, return -1);
885 int isl_basic_set_free_div(struct isl_basic_set *bset, unsigned n)
887 return isl_basic_map_free_div((struct isl_basic_map *)bset, n);
890 /* Copy constraint from src to dst, putting the vars of src at offset
891 * dim_off in dst and the divs of src at offset div_off in dst.
892 * If both sets are actually map, then dim_off applies to the input
895 static void copy_constraint(struct isl_basic_map *dst_map, isl_int *dst,
896 struct isl_basic_map *src_map, isl_int *src,
897 unsigned in_off, unsigned out_off, unsigned div_off)
899 unsigned src_nparam = isl_basic_map_n_param(src_map);
900 unsigned dst_nparam = isl_basic_map_n_param(dst_map);
901 unsigned src_in = isl_basic_map_n_in(src_map);
902 unsigned dst_in = isl_basic_map_n_in(dst_map);
903 unsigned src_out = isl_basic_map_n_out(src_map);
904 unsigned dst_out = isl_basic_map_n_out(dst_map);
905 isl_int_set(dst[0], src[0]);
906 isl_seq_cpy(dst+1, src+1, isl_min(dst_nparam, src_nparam));
907 if (dst_nparam > src_nparam)
908 isl_seq_clr(dst+1+src_nparam,
909 dst_nparam - src_nparam);
910 isl_seq_clr(dst+1+dst_nparam, in_off);
911 isl_seq_cpy(dst+1+dst_nparam+in_off,
913 isl_min(dst_in-in_off, src_in));
914 if (dst_in-in_off > src_in)
915 isl_seq_clr(dst+1+dst_nparam+in_off+src_in,
916 dst_in - in_off - src_in);
917 isl_seq_clr(dst+1+dst_nparam+dst_in, out_off);
918 isl_seq_cpy(dst+1+dst_nparam+dst_in+out_off,
919 src+1+src_nparam+src_in,
920 isl_min(dst_out-out_off, src_out));
921 if (dst_out-out_off > src_out)
922 isl_seq_clr(dst+1+dst_nparam+dst_in+out_off+src_out,
923 dst_out - out_off - src_out);
924 isl_seq_clr(dst+1+dst_nparam+dst_in+dst_out, div_off);
925 isl_seq_cpy(dst+1+dst_nparam+dst_in+dst_out+div_off,
926 src+1+src_nparam+src_in+src_out,
927 isl_min(dst_map->extra-div_off, src_map->n_div));
928 if (dst_map->n_div-div_off > src_map->n_div)
929 isl_seq_clr(dst+1+dst_nparam+dst_in+dst_out+
930 div_off+src_map->n_div,
931 dst_map->n_div - div_off - src_map->n_div);
934 static void copy_div(struct isl_basic_map *dst_map, isl_int *dst,
935 struct isl_basic_map *src_map, isl_int *src,
936 unsigned in_off, unsigned out_off, unsigned div_off)
938 isl_int_set(dst[0], src[0]);
939 copy_constraint(dst_map, dst+1, src_map, src+1, in_off, out_off, div_off);
942 static struct isl_basic_map *add_constraints(struct isl_basic_map *bmap1,
943 struct isl_basic_map *bmap2, unsigned i_pos, unsigned o_pos)
948 if (!bmap1 || !bmap2)
951 div_off = bmap1->n_div;
953 for (i = 0; i < bmap2->n_eq; ++i) {
954 int i1 = isl_basic_map_alloc_equality(bmap1);
957 copy_constraint(bmap1, bmap1->eq[i1], bmap2, bmap2->eq[i],
958 i_pos, o_pos, div_off);
961 for (i = 0; i < bmap2->n_ineq; ++i) {
962 int i1 = isl_basic_map_alloc_inequality(bmap1);
965 copy_constraint(bmap1, bmap1->ineq[i1], bmap2, bmap2->ineq[i],
966 i_pos, o_pos, div_off);
969 for (i = 0; i < bmap2->n_div; ++i) {
970 int i1 = isl_basic_map_alloc_div(bmap1);
973 copy_div(bmap1, bmap1->div[i1], bmap2, bmap2->div[i],
974 i_pos, o_pos, div_off);
977 isl_basic_map_free(bmap2);
982 isl_basic_map_free(bmap1);
983 isl_basic_map_free(bmap2);
987 static void copy_constraint_dim_map(isl_int *dst, isl_int *src,
988 struct isl_dim_map *dim_map)
992 for (i = 0; i < dim_map->len; ++i) {
993 if (dim_map->pos[i] < 0)
994 isl_int_set_si(dst[i], 0);
996 isl_int_set(dst[i], src[dim_map->pos[i]]);
1000 static void copy_div_dim_map(isl_int *dst, isl_int *src,
1001 struct isl_dim_map *dim_map)
1003 isl_int_set(dst[0], src[0]);
1004 copy_constraint_dim_map(dst+1, src+1, dim_map);
1007 static struct isl_basic_map *add_constraints_dim_map(struct isl_basic_map *dst,
1008 struct isl_basic_map *src, struct isl_dim_map *dim_map)
1012 if (!src || !dst || !dim_map)
1015 for (i = 0; i < src->n_eq; ++i) {
1016 int i1 = isl_basic_map_alloc_equality(dst);
1019 copy_constraint_dim_map(dst->eq[i1], src->eq[i], dim_map);
1022 for (i = 0; i < src->n_ineq; ++i) {
1023 int i1 = isl_basic_map_alloc_inequality(dst);
1026 copy_constraint_dim_map(dst->ineq[i1], src->ineq[i], dim_map);
1029 for (i = 0; i < src->n_div; ++i) {
1030 int i1 = isl_basic_map_alloc_div(dst);
1033 copy_div_dim_map(dst->div[i1], src->div[i], dim_map);
1037 isl_basic_map_free(src);
1042 isl_basic_map_free(src);
1043 isl_basic_map_free(dst);
1047 struct isl_basic_set *isl_basic_set_add_constraints(struct isl_basic_set *bset1,
1048 struct isl_basic_set *bset2, unsigned pos)
1050 return (struct isl_basic_set *)
1051 add_constraints((struct isl_basic_map *)bset1,
1052 (struct isl_basic_map *)bset2, 0, pos);
1055 struct isl_basic_map *isl_basic_map_extend_dim(struct isl_basic_map *base,
1056 struct isl_dim *dim, unsigned extra,
1057 unsigned n_eq, unsigned n_ineq)
1059 struct isl_basic_map *ext;
1069 dims_ok = isl_dim_equal(base->dim, dim) &&
1070 base->extra >= base->n_div + extra;
1072 if (dims_ok && room_for_con(base, n_eq + n_ineq) &&
1073 room_for_ineq(base, n_ineq)) {
1078 isl_assert(base->ctx, base->dim->nparam <= dim->nparam, goto error);
1079 isl_assert(base->ctx, base->dim->n_in <= dim->n_in, goto error);
1080 isl_assert(base->ctx, base->dim->n_out <= dim->n_out, goto error);
1081 extra += base->extra;
1083 n_ineq += base->n_ineq;
1085 ext = isl_basic_map_alloc_dim(dim, extra, n_eq, n_ineq);
1091 ext->sample = isl_vec_copy(base->sample);
1092 flags = base->flags;
1093 ext = add_constraints(ext, base, 0, 0);
1096 ISL_F_CLR(ext, ISL_BASIC_SET_FINAL);
1103 isl_basic_map_free(base);
1107 struct isl_basic_set *isl_basic_set_extend_dim(struct isl_basic_set *base,
1108 struct isl_dim *dim, unsigned extra,
1109 unsigned n_eq, unsigned n_ineq)
1111 return (struct isl_basic_set *)
1112 isl_basic_map_extend_dim((struct isl_basic_map *)base, dim,
1113 extra, n_eq, n_ineq);
1116 struct isl_basic_map *isl_basic_map_extend_constraints(
1117 struct isl_basic_map *base, unsigned n_eq, unsigned n_ineq)
1121 return isl_basic_map_extend_dim(base, isl_dim_copy(base->dim),
1125 struct isl_basic_map *isl_basic_map_extend(struct isl_basic_map *base,
1126 unsigned nparam, unsigned n_in, unsigned n_out, unsigned extra,
1127 unsigned n_eq, unsigned n_ineq)
1129 struct isl_basic_map *bmap;
1130 struct isl_dim *dim;
1134 dim = isl_dim_alloc(base->ctx, nparam, n_in, n_out);
1138 bmap = isl_basic_map_extend_dim(base, dim, extra, n_eq, n_ineq);
1141 isl_basic_map_free(base);
1145 struct isl_basic_set *isl_basic_set_extend(struct isl_basic_set *base,
1146 unsigned nparam, unsigned dim, unsigned extra,
1147 unsigned n_eq, unsigned n_ineq)
1149 return (struct isl_basic_set *)
1150 isl_basic_map_extend((struct isl_basic_map *)base,
1151 nparam, 0, dim, extra, n_eq, n_ineq);
1154 struct isl_basic_set *isl_basic_set_extend_constraints(
1155 struct isl_basic_set *base, unsigned n_eq, unsigned n_ineq)
1157 return (struct isl_basic_set *)
1158 isl_basic_map_extend_constraints((struct isl_basic_map *)base,
1162 struct isl_basic_set *isl_basic_set_cow(struct isl_basic_set *bset)
1164 return (struct isl_basic_set *)
1165 isl_basic_map_cow((struct isl_basic_map *)bset);
1168 struct isl_basic_map *isl_basic_map_cow(struct isl_basic_map *bmap)
1173 if (bmap->ref > 1) {
1175 bmap = isl_basic_map_dup(bmap);
1178 ISL_F_CLR(bmap, ISL_BASIC_SET_FINAL);
1182 struct isl_set *isl_set_cow(struct isl_set *set)
1190 return isl_set_dup(set);
1193 struct isl_map *isl_map_cow(struct isl_map *map)
1201 return isl_map_dup(map);
1204 static void swap_vars(struct isl_blk blk, isl_int *a,
1205 unsigned a_len, unsigned b_len)
1207 isl_seq_cpy(blk.data, a+a_len, b_len);
1208 isl_seq_cpy(blk.data+b_len, a, a_len);
1209 isl_seq_cpy(a, blk.data, b_len+a_len);
1212 struct isl_basic_set *isl_basic_set_swap_vars(
1213 struct isl_basic_set *bset, unsigned n)
1223 nparam = isl_basic_set_n_param(bset);
1224 dim = isl_basic_set_n_dim(bset);
1225 isl_assert(bset->ctx, n <= dim, goto error);
1230 bset = isl_basic_set_cow(bset);
1234 blk = isl_blk_alloc(bset->ctx, dim);
1235 if (isl_blk_is_error(blk))
1238 for (i = 0; i < bset->n_eq; ++i)
1240 bset->eq[i]+1+nparam, n, dim - n);
1242 for (i = 0; i < bset->n_ineq; ++i)
1244 bset->ineq[i]+1+nparam, n, dim - n);
1246 for (i = 0; i < bset->n_div; ++i)
1248 bset->div[i]+1+1+nparam, n, dim - n);
1250 isl_blk_free(bset->ctx, blk);
1252 ISL_F_CLR(bset, ISL_BASIC_SET_NORMALIZED);
1253 bset = isl_basic_set_gauss(bset, NULL);
1254 return isl_basic_set_finalize(bset);
1256 isl_basic_set_free(bset);
1260 struct isl_set *isl_set_swap_vars(struct isl_set *set, unsigned n)
1263 set = isl_set_cow(set);
1267 for (i = 0; i < set->n; ++i) {
1268 set->p[i] = isl_basic_set_swap_vars(set->p[i], n);
1274 ISL_F_CLR(set, ISL_SET_NORMALIZED);
1278 struct isl_basic_map *isl_basic_map_set_to_empty(struct isl_basic_map *bmap)
1284 total = isl_basic_map_total_dim(bmap);
1285 isl_basic_map_free_div(bmap, bmap->n_div);
1286 isl_basic_map_free_inequality(bmap, bmap->n_ineq);
1288 isl_basic_map_free_equality(bmap, bmap->n_eq-1);
1290 i = isl_basic_map_alloc_equality(bmap);
1294 isl_int_set_si(bmap->eq[i][0], 1);
1295 isl_seq_clr(bmap->eq[i]+1, total);
1296 ISL_F_SET(bmap, ISL_BASIC_MAP_EMPTY);
1297 isl_vec_free(bmap->sample);
1298 bmap->sample = NULL;
1299 return isl_basic_map_finalize(bmap);
1301 isl_basic_map_free(bmap);
1305 struct isl_basic_set *isl_basic_set_set_to_empty(struct isl_basic_set *bset)
1307 return (struct isl_basic_set *)
1308 isl_basic_map_set_to_empty((struct isl_basic_map *)bset);
1311 void isl_basic_map_swap_div(struct isl_basic_map *bmap, int a, int b)
1314 unsigned off = isl_dim_total(bmap->dim);
1315 isl_int *t = bmap->div[a];
1316 bmap->div[a] = bmap->div[b];
1319 for (i = 0; i < bmap->n_eq; ++i)
1320 isl_int_swap(bmap->eq[i][1+off+a], bmap->eq[i][1+off+b]);
1322 for (i = 0; i < bmap->n_ineq; ++i)
1323 isl_int_swap(bmap->ineq[i][1+off+a], bmap->ineq[i][1+off+b]);
1325 for (i = 0; i < bmap->n_div; ++i)
1326 isl_int_swap(bmap->div[i][1+1+off+a], bmap->div[i][1+1+off+b]);
1327 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1330 /* Eliminate the specified n dimensions starting at first from the
1331 * constraints using Fourier-Motzkin. The dimensions themselves
1334 __isl_give isl_map *isl_map_eliminate(__isl_take isl_map *map,
1335 enum isl_dim_type type, unsigned first, unsigned n)
1344 map = isl_map_cow(map);
1347 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
1348 first += pos(map->dim, type) - 1;
1350 for (i = 0; i < map->n; ++i) {
1351 map->p[i] = isl_basic_map_eliminate_vars(map->p[i], first, n);
1361 /* Eliminate the specified n dimensions starting at first from the
1362 * constraints using Fourier-Motzkin. The dimensions themselves
1365 __isl_give isl_set *isl_set_eliminate(__isl_take isl_set *set,
1366 enum isl_dim_type type, unsigned first, unsigned n)
1368 return (isl_set *)isl_map_eliminate((isl_map *)set, type, first, n);
1371 /* Eliminate the specified n dimensions starting at first from the
1372 * constraints using Fourier-Motzkin. The dimensions themselves
1375 __isl_give isl_set *isl_set_eliminate_dims(__isl_take isl_set *set,
1376 unsigned first, unsigned n)
1378 return isl_set_eliminate(set, isl_dim_set, first, n);
1381 /* Project out n dimensions starting at first using Fourier-Motzkin */
1382 struct isl_set *isl_set_remove_dims(struct isl_set *set,
1383 unsigned first, unsigned n)
1385 set = isl_set_eliminate_dims(set, first, n);
1386 set = isl_set_drop_dims(set, first, n);
1390 __isl_give isl_basic_map *isl_basic_map_remove_divs(
1391 __isl_take isl_basic_map *bmap)
1393 bmap = isl_basic_map_eliminate_vars(bmap, isl_dim_total(bmap->dim),
1401 __isl_give isl_basic_set *isl_basic_set_remove_divs(
1402 __isl_take isl_basic_set *bset)
1404 return (struct isl_basic_set *)isl_basic_map_remove_divs(
1405 (struct isl_basic_map *)bset);
1408 struct isl_set *isl_set_remove_divs(struct isl_set *set)
1417 set = isl_set_cow(set);
1421 for (i = 0; i < set->n; ++i) {
1422 set->p[i] = isl_basic_set_remove_divs(set->p[i]);
1432 struct isl_basic_map *isl_basic_map_remove(struct isl_basic_map *bmap,
1433 enum isl_dim_type type, unsigned first, unsigned n)
1437 isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
1441 bmap = isl_basic_map_eliminate_vars(bmap,
1442 isl_basic_map_offset(bmap, type) - 1 + first, n);
1445 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY) && type == isl_dim_div)
1447 bmap = isl_basic_map_drop(bmap, type, first, n);
1450 isl_basic_map_free(bmap);
1454 __isl_give isl_basic_set *isl_basic_set_remove(__isl_take isl_basic_set *bset,
1455 enum isl_dim_type type, unsigned first, unsigned n)
1457 return (isl_basic_set *)
1458 isl_basic_map_remove((isl_basic_map *)bset, type, first, n);
1461 struct isl_map *isl_map_remove(struct isl_map *map,
1462 enum isl_dim_type type, unsigned first, unsigned n)
1469 map = isl_map_cow(map);
1472 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
1474 for (i = 0; i < map->n; ++i) {
1475 map->p[i] = isl_basic_map_eliminate_vars(map->p[i],
1476 isl_basic_map_offset(map->p[i], type) - 1 + first, n);
1480 map = isl_map_drop(map, type, first, n);
1487 __isl_give isl_set *isl_set_remove(__isl_take isl_set *bset,
1488 enum isl_dim_type type, unsigned first, unsigned n)
1490 return (isl_set *)isl_map_remove((isl_map *)bset, type, first, n);
1493 /* Project out n inputs starting at first using Fourier-Motzkin */
1494 struct isl_map *isl_map_remove_inputs(struct isl_map *map,
1495 unsigned first, unsigned n)
1497 return isl_map_remove(map, isl_dim_in, first, n);
1500 /* Project out n dimensions starting at first using Fourier-Motzkin */
1501 struct isl_basic_set *isl_basic_set_remove_dims(struct isl_basic_set *bset,
1502 unsigned first, unsigned n)
1504 unsigned nparam = isl_basic_set_n_param(bset);
1505 bset = isl_basic_set_eliminate_vars(bset, nparam + first, n);
1506 bset = isl_basic_set_drop_dims(bset, first, n);
1510 static void dump_term(struct isl_basic_map *bmap,
1511 isl_int c, int pos, FILE *out)
1514 unsigned in = isl_basic_map_n_in(bmap);
1515 unsigned dim = in + isl_basic_map_n_out(bmap);
1516 unsigned nparam = isl_basic_map_n_param(bmap);
1518 isl_int_print(out, c, 0);
1520 if (!isl_int_is_one(c))
1521 isl_int_print(out, c, 0);
1522 if (pos < 1 + nparam) {
1523 name = isl_dim_get_name(bmap->dim,
1524 isl_dim_param, pos - 1);
1526 fprintf(out, "%s", name);
1528 fprintf(out, "p%d", pos - 1);
1529 } else if (pos < 1 + nparam + in)
1530 fprintf(out, "i%d", pos - 1 - nparam);
1531 else if (pos < 1 + nparam + dim)
1532 fprintf(out, "o%d", pos - 1 - nparam - in);
1534 fprintf(out, "e%d", pos - 1 - nparam - dim);
1538 static void dump_constraint_sign(struct isl_basic_map *bmap, isl_int *c,
1539 int sign, FILE *out)
1543 unsigned len = 1 + isl_basic_map_total_dim(bmap);
1547 for (i = 0, first = 1; i < len; ++i) {
1548 if (isl_int_sgn(c[i]) * sign <= 0)
1551 fprintf(out, " + ");
1553 isl_int_abs(v, c[i]);
1554 dump_term(bmap, v, i, out);
1561 static void dump_constraint(struct isl_basic_map *bmap, isl_int *c,
1562 const char *op, FILE *out, int indent)
1566 fprintf(out, "%*s", indent, "");
1568 dump_constraint_sign(bmap, c, 1, out);
1569 fprintf(out, " %s ", op);
1570 dump_constraint_sign(bmap, c, -1, out);
1574 for (i = bmap->n_div; i < bmap->extra; ++i) {
1575 if (isl_int_is_zero(c[1+isl_dim_total(bmap->dim)+i]))
1577 fprintf(out, "%*s", indent, "");
1578 fprintf(out, "ERROR: unused div coefficient not zero\n");
1583 static void dump_constraints(struct isl_basic_map *bmap,
1584 isl_int **c, unsigned n,
1585 const char *op, FILE *out, int indent)
1589 for (i = 0; i < n; ++i)
1590 dump_constraint(bmap, c[i], op, out, indent);
1593 static void dump_affine(struct isl_basic_map *bmap, isl_int *exp, FILE *out)
1597 unsigned total = isl_basic_map_total_dim(bmap);
1599 for (j = 0; j < 1 + total; ++j) {
1600 if (isl_int_is_zero(exp[j]))
1602 if (!first && isl_int_is_pos(exp[j]))
1604 dump_term(bmap, exp[j], j, out);
1609 static void dump(struct isl_basic_map *bmap, FILE *out, int indent)
1613 dump_constraints(bmap, bmap->eq, bmap->n_eq, "=", out, indent);
1614 dump_constraints(bmap, bmap->ineq, bmap->n_ineq, ">=", out, indent);
1616 for (i = 0; i < bmap->n_div; ++i) {
1617 fprintf(out, "%*s", indent, "");
1618 fprintf(out, "e%d = [(", i);
1619 dump_affine(bmap, bmap->div[i]+1, out);
1621 isl_int_print(out, bmap->div[i][0], 0);
1622 fprintf(out, "]\n");
1626 void isl_basic_set_dump(struct isl_basic_set *bset, FILE *out, int indent)
1629 fprintf(out, "null basic set\n");
1633 fprintf(out, "%*s", indent, "");
1634 fprintf(out, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n",
1635 bset->ref, bset->dim->nparam, bset->dim->n_out,
1636 bset->extra, bset->flags);
1637 dump((struct isl_basic_map *)bset, out, indent);
1640 void isl_basic_map_dump(struct isl_basic_map *bmap, FILE *out, int indent)
1643 fprintf(out, "null basic map\n");
1647 fprintf(out, "%*s", indent, "");
1648 fprintf(out, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, "
1649 "flags: %x, n_name: %d\n",
1651 bmap->dim->nparam, bmap->dim->n_in, bmap->dim->n_out,
1652 bmap->extra, bmap->flags, bmap->dim->n_name);
1653 dump(bmap, out, indent);
1656 int isl_inequality_negate(struct isl_basic_map *bmap, unsigned pos)
1661 total = isl_basic_map_total_dim(bmap);
1662 isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
1663 isl_seq_neg(bmap->ineq[pos], bmap->ineq[pos], 1 + total);
1664 isl_int_sub_ui(bmap->ineq[pos][0], bmap->ineq[pos][0], 1);
1665 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1669 struct isl_set *isl_set_alloc_dim(struct isl_dim *dim, int n, unsigned flags)
1671 struct isl_set *set;
1675 isl_assert(dim->ctx, dim->n_in == 0, return NULL);
1676 isl_assert(dim->ctx, n >= 0, return NULL);
1677 set = isl_alloc(dim->ctx, struct isl_set,
1678 sizeof(struct isl_set) +
1679 (n - 1) * sizeof(struct isl_basic_set *));
1683 set->ctx = dim->ctx;
1684 isl_ctx_ref(set->ctx);
1696 struct isl_set *isl_set_alloc(struct isl_ctx *ctx,
1697 unsigned nparam, unsigned dim, int n, unsigned flags)
1699 struct isl_set *set;
1700 struct isl_dim *dims;
1702 dims = isl_dim_alloc(ctx, nparam, 0, dim);
1706 set = isl_set_alloc_dim(dims, n, flags);
1710 /* Make sure "map" has room for at least "n" more basic maps.
1712 struct isl_map *isl_map_grow(struct isl_map *map, int n)
1715 struct isl_map *grown = NULL;
1719 isl_assert(map->ctx, n >= 0, goto error);
1720 if (map->n + n <= map->size)
1722 grown = isl_map_alloc_dim(isl_map_get_dim(map), map->n + n, map->flags);
1725 for (i = 0; i < map->n; ++i) {
1726 grown->p[i] = isl_basic_map_copy(map->p[i]);
1734 isl_map_free(grown);
1739 /* Make sure "set" has room for at least "n" more basic sets.
1741 struct isl_set *isl_set_grow(struct isl_set *set, int n)
1743 return (struct isl_set *)isl_map_grow((struct isl_map *)set, n);
1746 struct isl_set *isl_set_dup(struct isl_set *set)
1749 struct isl_set *dup;
1754 dup = isl_set_alloc_dim(isl_dim_copy(set->dim), set->n, set->flags);
1757 for (i = 0; i < set->n; ++i)
1758 dup = isl_set_add_basic_set(dup, isl_basic_set_copy(set->p[i]));
1762 struct isl_set *isl_set_from_basic_set(struct isl_basic_set *bset)
1764 struct isl_set *set;
1769 set = isl_set_alloc_dim(isl_dim_copy(bset->dim), 1, ISL_MAP_DISJOINT);
1771 isl_basic_set_free(bset);
1774 return isl_set_add_basic_set(set, bset);
1777 struct isl_map *isl_map_from_basic_map(struct isl_basic_map *bmap)
1779 struct isl_map *map;
1784 map = isl_map_alloc_dim(isl_dim_copy(bmap->dim), 1, ISL_MAP_DISJOINT);
1786 isl_basic_map_free(bmap);
1789 return isl_map_add_basic_map(map, bmap);
1792 __isl_give isl_set *isl_set_add_basic_set(__isl_take isl_set *set,
1793 __isl_take isl_basic_set *bset)
1795 return (struct isl_set *)isl_map_add_basic_map((struct isl_map *)set,
1796 (struct isl_basic_map *)bset);
1799 void isl_set_free(struct isl_set *set)
1809 isl_ctx_deref(set->ctx);
1810 for (i = 0; i < set->n; ++i)
1811 isl_basic_set_free(set->p[i]);
1812 isl_dim_free(set->dim);
1816 void isl_set_dump(struct isl_set *set, FILE *out, int indent)
1821 fprintf(out, "null set\n");
1825 fprintf(out, "%*s", indent, "");
1826 fprintf(out, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
1827 set->ref, set->n, set->dim->nparam, set->dim->n_out,
1829 for (i = 0; i < set->n; ++i) {
1830 fprintf(out, "%*s", indent, "");
1831 fprintf(out, "basic set %d:\n", i);
1832 isl_basic_set_dump(set->p[i], out, indent+4);
1836 void isl_map_dump(struct isl_map *map, FILE *out, int indent)
1841 fprintf(out, "null map\n");
1845 fprintf(out, "%*s", indent, "");
1846 fprintf(out, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, "
1847 "flags: %x, n_name: %d\n",
1848 map->ref, map->n, map->dim->nparam, map->dim->n_in,
1849 map->dim->n_out, map->flags, map->dim->n_name);
1850 for (i = 0; i < map->n; ++i) {
1851 fprintf(out, "%*s", indent, "");
1852 fprintf(out, "basic map %d:\n", i);
1853 isl_basic_map_dump(map->p[i], out, indent+4);
1857 struct isl_basic_map *isl_basic_map_intersect_domain(
1858 struct isl_basic_map *bmap, struct isl_basic_set *bset)
1860 struct isl_basic_map *bmap_domain;
1861 struct isl_dim *dim;
1866 isl_assert(bset->ctx, isl_dim_match(bmap->dim, isl_dim_param,
1867 bset->dim, isl_dim_param), goto error);
1869 if (isl_dim_size(bset->dim, isl_dim_set) != 0)
1870 isl_assert(bset->ctx,
1871 isl_basic_map_compatible_domain(bmap, bset), goto error);
1873 bmap = isl_basic_map_cow(bmap);
1876 bmap = isl_basic_map_extend_dim(bmap, isl_dim_copy(bmap->dim),
1877 bset->n_div, bset->n_eq, bset->n_ineq);
1878 dim = isl_dim_reverse(isl_dim_copy(bset->dim));
1879 bmap_domain = isl_basic_map_from_basic_set(bset, dim);
1880 bmap = add_constraints(bmap, bmap_domain, 0, 0);
1882 bmap = isl_basic_map_simplify(bmap);
1883 return isl_basic_map_finalize(bmap);
1885 isl_basic_map_free(bmap);
1886 isl_basic_set_free(bset);
1890 struct isl_basic_map *isl_basic_map_intersect_range(
1891 struct isl_basic_map *bmap, struct isl_basic_set *bset)
1893 struct isl_basic_map *bmap_range;
1898 isl_assert(bset->ctx, isl_dim_match(bmap->dim, isl_dim_param,
1899 bset->dim, isl_dim_param), goto error);
1901 if (isl_dim_size(bset->dim, isl_dim_set) != 0)
1902 isl_assert(bset->ctx,
1903 isl_basic_map_compatible_range(bmap, bset), goto error);
1905 bmap = isl_basic_map_cow(bmap);
1908 bmap = isl_basic_map_extend_dim(bmap, isl_dim_copy(bmap->dim),
1909 bset->n_div, bset->n_eq, bset->n_ineq);
1910 bmap_range = isl_basic_map_from_basic_set(bset, isl_dim_copy(bset->dim));
1911 bmap = add_constraints(bmap, bmap_range, 0, 0);
1913 bmap = isl_basic_map_simplify(bmap);
1914 return isl_basic_map_finalize(bmap);
1916 isl_basic_map_free(bmap);
1917 isl_basic_set_free(bset);
1921 int isl_basic_map_contains(struct isl_basic_map *bmap, struct isl_vec *vec)
1927 total = 1 + isl_basic_map_total_dim(bmap);
1928 if (total != vec->size)
1933 for (i = 0; i < bmap->n_eq; ++i) {
1934 isl_seq_inner_product(vec->el, bmap->eq[i], total, &s);
1935 if (!isl_int_is_zero(s)) {
1941 for (i = 0; i < bmap->n_ineq; ++i) {
1942 isl_seq_inner_product(vec->el, bmap->ineq[i], total, &s);
1943 if (isl_int_is_neg(s)) {
1954 int isl_basic_set_contains(struct isl_basic_set *bset, struct isl_vec *vec)
1956 return isl_basic_map_contains((struct isl_basic_map *)bset, vec);
1959 struct isl_basic_map *isl_basic_map_intersect(
1960 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
1962 struct isl_vec *sample = NULL;
1964 if (!bmap1 || !bmap2)
1967 isl_assert(bmap1->ctx, isl_dim_match(bmap1->dim, isl_dim_param,
1968 bmap2->dim, isl_dim_param), goto error);
1969 if (isl_dim_total(bmap1->dim) ==
1970 isl_dim_size(bmap1->dim, isl_dim_param) &&
1971 isl_dim_total(bmap2->dim) !=
1972 isl_dim_size(bmap2->dim, isl_dim_param))
1973 return isl_basic_map_intersect(bmap2, bmap1);
1975 if (isl_dim_total(bmap2->dim) !=
1976 isl_dim_size(bmap2->dim, isl_dim_param))
1977 isl_assert(bmap1->ctx,
1978 isl_dim_equal(bmap1->dim, bmap2->dim), goto error);
1980 if (bmap1->sample &&
1981 isl_basic_map_contains(bmap1, bmap1->sample) > 0 &&
1982 isl_basic_map_contains(bmap2, bmap1->sample) > 0)
1983 sample = isl_vec_copy(bmap1->sample);
1984 else if (bmap2->sample &&
1985 isl_basic_map_contains(bmap1, bmap2->sample) > 0 &&
1986 isl_basic_map_contains(bmap2, bmap2->sample) > 0)
1987 sample = isl_vec_copy(bmap2->sample);
1989 bmap1 = isl_basic_map_cow(bmap1);
1992 bmap1 = isl_basic_map_extend_dim(bmap1, isl_dim_copy(bmap1->dim),
1993 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
1994 bmap1 = add_constraints(bmap1, bmap2, 0, 0);
1997 isl_vec_free(sample);
1999 isl_vec_free(bmap1->sample);
2000 bmap1->sample = sample;
2003 bmap1 = isl_basic_map_simplify(bmap1);
2004 return isl_basic_map_finalize(bmap1);
2007 isl_vec_free(sample);
2008 isl_basic_map_free(bmap1);
2009 isl_basic_map_free(bmap2);
2013 struct isl_basic_set *isl_basic_set_intersect(
2014 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
2016 return (struct isl_basic_set *)
2017 isl_basic_map_intersect(
2018 (struct isl_basic_map *)bset1,
2019 (struct isl_basic_map *)bset2);
2022 /* Special case of isl_map_intersect, where both map1 and map2
2023 * are convex, without any divs and such that either map1 or map2
2024 * contains a single constraint. This constraint is then simply
2025 * added to the other map.
2027 static __isl_give isl_map *map_intersect_add_constraint(
2028 __isl_take isl_map *map1, __isl_take isl_map *map2)
2030 struct isl_basic_map *bmap1;
2031 struct isl_basic_map *bmap2;
2033 isl_assert(map1->ctx, map1->n == 1, goto error);
2034 isl_assert(map2->ctx, map1->n == 1, goto error);
2035 isl_assert(map1->ctx, map1->p[0]->n_div == 0, goto error);
2036 isl_assert(map2->ctx, map1->p[0]->n_div == 0, goto error);
2038 if (map2->p[0]->n_eq + map2->p[0]->n_ineq != 1)
2039 return isl_map_intersect(map2, map1);
2041 isl_assert(map2->ctx,
2042 map2->p[0]->n_eq + map2->p[0]->n_ineq == 1, goto error);
2044 map1 = isl_map_cow(map1);
2047 if (isl_map_fast_is_empty(map1)) {
2051 map1->p[0] = isl_basic_map_cow(map1->p[0]);
2052 if (map2->p[0]->n_eq == 1)
2053 map1->p[0] = isl_basic_map_add_eq(map1->p[0], map2->p[0]->eq[0]);
2055 map1->p[0] = isl_basic_map_add_ineq(map1->p[0],
2056 map2->p[0]->ineq[0]);
2058 map1->p[0] = isl_basic_map_simplify(map1->p[0]);
2059 map1->p[0] = isl_basic_map_finalize(map1->p[0]);
2063 if (isl_basic_map_fast_is_empty(map1->p[0])) {
2064 isl_basic_map_free(map1->p[0]);
2077 struct isl_map *isl_map_intersect(struct isl_map *map1, struct isl_map *map2)
2080 struct isl_map *result;
2086 if (isl_map_fast_is_empty(map1)) {
2090 if (isl_map_fast_is_empty(map2)) {
2095 if (map1->n == 1 && map2->n == 1 &&
2096 map1->p[0]->n_div == 0 && map2->p[0]->n_div == 0 &&
2097 isl_dim_equal(map1->dim, map2->dim) &&
2098 (map1->p[0]->n_eq + map1->p[0]->n_ineq == 1 ||
2099 map2->p[0]->n_eq + map2->p[0]->n_ineq == 1))
2100 return map_intersect_add_constraint(map1, map2);
2101 isl_assert(map1->ctx, isl_dim_match(map1->dim, isl_dim_param,
2102 map2->dim, isl_dim_param), goto error);
2103 if (isl_dim_total(map1->dim) ==
2104 isl_dim_size(map1->dim, isl_dim_param) &&
2105 isl_dim_total(map2->dim) != isl_dim_size(map2->dim, isl_dim_param))
2106 return isl_map_intersect(map2, map1);
2108 if (isl_dim_total(map2->dim) != isl_dim_size(map2->dim, isl_dim_param))
2109 isl_assert(map1->ctx,
2110 isl_dim_equal(map1->dim, map2->dim), goto error);
2112 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
2113 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
2114 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
2116 result = isl_map_alloc_dim(isl_dim_copy(map1->dim),
2117 map1->n * map2->n, flags);
2120 for (i = 0; i < map1->n; ++i)
2121 for (j = 0; j < map2->n; ++j) {
2122 struct isl_basic_map *part;
2123 part = isl_basic_map_intersect(
2124 isl_basic_map_copy(map1->p[i]),
2125 isl_basic_map_copy(map2->p[j]));
2126 if (isl_basic_map_is_empty(part))
2127 isl_basic_map_free(part);
2129 result = isl_map_add_basic_map(result, part);
2142 struct isl_set *isl_set_intersect(struct isl_set *set1, struct isl_set *set2)
2144 return (struct isl_set *)
2145 isl_map_intersect((struct isl_map *)set1,
2146 (struct isl_map *)set2);
2149 struct isl_basic_map *isl_basic_map_reverse(struct isl_basic_map *bmap)
2151 struct isl_dim *dim;
2152 struct isl_basic_set *bset;
2157 bmap = isl_basic_map_cow(bmap);
2160 dim = isl_dim_reverse(isl_dim_copy(bmap->dim));
2161 in = isl_basic_map_n_in(bmap);
2162 bset = isl_basic_set_from_basic_map(bmap);
2163 bset = isl_basic_set_swap_vars(bset, in);
2164 return isl_basic_map_from_basic_set(bset, dim);
2167 __isl_give isl_basic_map *isl_basic_map_insert(__isl_take isl_basic_map *bmap,
2168 enum isl_dim_type type, unsigned pos, unsigned n)
2170 struct isl_dim *res_dim;
2171 struct isl_basic_map *res;
2172 struct isl_dim_map *dim_map;
2173 unsigned total, off;
2174 enum isl_dim_type t;
2182 res_dim = isl_dim_insert(isl_basic_map_get_dim(bmap), type, pos, n);
2184 total = isl_basic_map_total_dim(bmap) + n;
2185 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2187 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
2189 isl_dim_map_dim(dim_map, bmap->dim, t, off);
2191 unsigned size = isl_basic_map_dim(bmap, t);
2192 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2194 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2195 pos, size - pos, off + pos + n);
2197 off += isl_dim_size(res_dim, t);
2199 isl_dim_map_div(dim_map, bmap, off);
2201 res = isl_basic_map_alloc_dim(res_dim,
2202 bmap->n_div, bmap->n_eq, bmap->n_ineq);
2203 res = add_constraints_dim_map(res, bmap, dim_map);
2204 res = isl_basic_map_simplify(res);
2205 return isl_basic_map_finalize(res);
2208 __isl_give isl_basic_map *isl_basic_map_add(__isl_take isl_basic_map *bmap,
2209 enum isl_dim_type type, unsigned n)
2213 return isl_basic_map_insert(bmap, type,
2214 isl_basic_map_dim(bmap, type), n);
2217 __isl_give isl_basic_set *isl_basic_set_add(__isl_take isl_basic_set *bset,
2218 enum isl_dim_type type, unsigned n)
2222 isl_assert(bset->ctx, type != isl_dim_in, goto error);
2223 return (isl_basic_set *)isl_basic_map_add((isl_basic_map *)bset, type, n);
2225 isl_basic_set_free(bset);
2229 __isl_give isl_map *isl_map_insert(__isl_take isl_map *map,
2230 enum isl_dim_type type, unsigned pos, unsigned n)
2237 map = isl_map_cow(map);
2241 map->dim = isl_dim_insert(map->dim, type, pos, n);
2245 for (i = 0; i < map->n; ++i) {
2246 map->p[i] = isl_basic_map_insert(map->p[i], type, pos, n);
2257 __isl_give isl_set *isl_set_insert(__isl_take isl_set *set,
2258 enum isl_dim_type type, unsigned pos, unsigned n)
2260 return (isl_set *)isl_map_insert((isl_map *)set, type, pos, n);
2263 __isl_give isl_map *isl_map_add(__isl_take isl_map *map,
2264 enum isl_dim_type type, unsigned n)
2268 return isl_map_insert(map, type, isl_map_dim(map, type), n);
2271 __isl_give isl_set *isl_set_add(__isl_take isl_set *set,
2272 enum isl_dim_type type, unsigned n)
2276 isl_assert(set->ctx, type != isl_dim_in, goto error);
2277 return (isl_set *)isl_map_add((isl_map *)set, type, n);
2283 __isl_give isl_basic_map *isl_basic_map_move_dims(
2284 __isl_take isl_basic_map *bmap,
2285 enum isl_dim_type dst_type, unsigned dst_pos,
2286 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2289 struct isl_dim_map *dim_map;
2290 struct isl_basic_map *res;
2291 enum isl_dim_type t;
2292 unsigned total, off;
2299 isl_assert(bmap->ctx, src_pos + n <= isl_basic_map_dim(bmap, src_type),
2302 if (dst_type == src_type && dst_pos == src_pos)
2305 isl_assert(bmap->ctx, dst_type != src_type, goto error);
2307 if (pos(bmap->dim, dst_type) + dst_pos ==
2308 pos(bmap->dim, src_type) + src_pos +
2309 ((src_type < dst_type) ? n : 0)) {
2310 bmap = isl_basic_map_cow(bmap);
2314 bmap->dim = isl_dim_move(bmap->dim, dst_type, dst_pos,
2315 src_type, src_pos, n);
2319 bmap = isl_basic_map_finalize(bmap);
2324 total = isl_basic_map_total_dim(bmap);
2325 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2328 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
2329 unsigned size = isl_dim_size(bmap->dim, t);
2330 if (t == dst_type) {
2331 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2334 isl_dim_map_dim_range(dim_map, bmap->dim, src_type,
2337 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2338 dst_pos, size - dst_pos, off);
2339 off += size - dst_pos;
2340 } else if (t == src_type) {
2341 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2344 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2345 src_pos + n, size - src_pos - n, off);
2346 off += size - src_pos - n;
2348 isl_dim_map_dim(dim_map, bmap->dim, t, off);
2352 isl_dim_map_div(dim_map, bmap, off);
2354 res = isl_basic_map_alloc_dim(isl_basic_map_get_dim(bmap),
2355 bmap->n_div, bmap->n_eq, bmap->n_ineq);
2356 bmap = add_constraints_dim_map(res, bmap, dim_map);
2358 bmap->dim = isl_dim_move(bmap->dim, dst_type, dst_pos,
2359 src_type, src_pos, n);
2363 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
2364 bmap = isl_basic_map_gauss(bmap, NULL);
2365 bmap = isl_basic_map_finalize(bmap);
2369 isl_basic_map_free(bmap);
2373 __isl_give isl_basic_set *isl_basic_set_move_dims(__isl_take isl_basic_set *bset,
2374 enum isl_dim_type dst_type, unsigned dst_pos,
2375 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2377 return (isl_basic_set *)isl_basic_map_move_dims(
2378 (isl_basic_map *)bset, dst_type, dst_pos, src_type, src_pos, n);
2381 __isl_give isl_set *isl_set_move_dims(__isl_take isl_set *set,
2382 enum isl_dim_type dst_type, unsigned dst_pos,
2383 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2387 isl_assert(set->ctx, dst_type != isl_dim_in, goto error);
2388 return (isl_set *)isl_map_move_dims((isl_map *)set, dst_type, dst_pos,
2389 src_type, src_pos, n);
2395 __isl_give isl_map *isl_map_move_dims(__isl_take isl_map *map,
2396 enum isl_dim_type dst_type, unsigned dst_pos,
2397 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2406 isl_assert(map->ctx, src_pos + n <= isl_map_dim(map, src_type),
2409 if (dst_type == src_type && dst_pos == src_pos)
2412 isl_assert(map->ctx, dst_type != src_type, goto error);
2414 map = isl_map_cow(map);
2418 map->dim = isl_dim_move(map->dim, dst_type, dst_pos, src_type, src_pos, n);
2422 for (i = 0; i < map->n; ++i) {
2423 map->p[i] = isl_basic_map_move_dims(map->p[i],
2425 src_type, src_pos, n);
2436 /* Move the specified dimensions to the last columns right before
2437 * the divs. Don't change the dimension specification of bmap.
2438 * That's the responsibility of the caller.
2440 static __isl_give isl_basic_map *move_last(__isl_take isl_basic_map *bmap,
2441 enum isl_dim_type type, unsigned first, unsigned n)
2443 struct isl_dim_map *dim_map;
2444 struct isl_basic_map *res;
2445 enum isl_dim_type t;
2446 unsigned total, off;
2450 if (pos(bmap->dim, type) + first + n == 1 + isl_dim_total(bmap->dim))
2453 total = isl_basic_map_total_dim(bmap);
2454 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2457 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
2458 unsigned size = isl_dim_size(bmap->dim, t);
2460 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2463 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2464 first, n, total - bmap->n_div - n);
2465 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2466 first + n, size - (first + n), off);
2467 off += size - (first + n);
2469 isl_dim_map_dim(dim_map, bmap->dim, t, off);
2473 isl_dim_map_div(dim_map, bmap, off + n);
2475 res = isl_basic_map_alloc_dim(isl_basic_map_get_dim(bmap),
2476 bmap->n_div, bmap->n_eq, bmap->n_ineq);
2477 res = add_constraints_dim_map(res, bmap, dim_map);
2481 /* Turn the n dimensions of type type, starting at first
2482 * into existentially quantified variables.
2484 __isl_give isl_basic_map *isl_basic_map_project_out(
2485 __isl_take isl_basic_map *bmap,
2486 enum isl_dim_type type, unsigned first, unsigned n)
2499 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL))
2500 return isl_basic_map_remove(bmap, type, first, n);
2502 isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
2505 bmap = move_last(bmap, type, first, n);
2506 bmap = isl_basic_map_cow(bmap);
2510 row_size = 1 + isl_dim_total(bmap->dim) + bmap->extra;
2511 old = bmap->block2.data;
2512 bmap->block2 = isl_blk_extend(bmap->ctx, bmap->block2,
2513 (bmap->extra + n) * (1 + row_size));
2514 if (!bmap->block2.data)
2516 new_div = isl_alloc_array(bmap->ctx, isl_int *, bmap->extra + n);
2519 for (i = 0; i < n; ++i) {
2520 new_div[i] = bmap->block2.data +
2521 (bmap->extra + i) * (1 + row_size);
2522 isl_seq_clr(new_div[i], 1 + row_size);
2524 for (i = 0; i < bmap->extra; ++i)
2525 new_div[n + i] = bmap->block2.data + (bmap->div[i] - old);
2527 bmap->div = new_div;
2531 bmap->dim = isl_dim_drop(bmap->dim, type, first, n);
2534 bmap = isl_basic_map_simplify(bmap);
2535 bmap = isl_basic_map_drop_redundant_divs(bmap);
2536 return isl_basic_map_finalize(bmap);
2538 isl_basic_map_free(bmap);
2542 /* Turn the n dimensions of type type, starting at first
2543 * into existentially quantified variables.
2545 struct isl_basic_set *isl_basic_set_project_out(struct isl_basic_set *bset,
2546 enum isl_dim_type type, unsigned first, unsigned n)
2548 return (isl_basic_set *)isl_basic_map_project_out(
2549 (isl_basic_map *)bset, type, first, n);
2552 /* Turn the n dimensions of type type, starting at first
2553 * into existentially quantified variables.
2555 __isl_give isl_map *isl_map_project_out(__isl_take isl_map *map,
2556 enum isl_dim_type type, unsigned first, unsigned n)
2566 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
2568 map = isl_map_cow(map);
2572 map->dim = isl_dim_drop(map->dim, type, first, n);
2576 for (i = 0; i < map->n; ++i) {
2577 map->p[i] = isl_basic_map_project_out(map->p[i], type, first, n);
2588 /* Turn the n dimensions of type type, starting at first
2589 * into existentially quantified variables.
2591 __isl_give isl_set *isl_set_project_out(__isl_take isl_set *set,
2592 enum isl_dim_type type, unsigned first, unsigned n)
2594 return (isl_set *)isl_map_project_out((isl_map *)set, type, first, n);
2597 static struct isl_basic_map *add_divs(struct isl_basic_map *bmap, unsigned n)
2601 for (i = 0; i < n; ++i) {
2602 j = isl_basic_map_alloc_div(bmap);
2605 isl_seq_clr(bmap->div[j], 1+1+isl_basic_map_total_dim(bmap));
2609 isl_basic_map_free(bmap);
2613 struct isl_basic_map *isl_basic_map_apply_range(
2614 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2616 struct isl_dim *dim_result = NULL;
2617 struct isl_basic_map *bmap;
2618 unsigned n_in, n_out, n, nparam, total, pos;
2619 struct isl_dim_map *dim_map1, *dim_map2;
2621 if (!bmap1 || !bmap2)
2624 dim_result = isl_dim_join(isl_dim_copy(bmap1->dim),
2625 isl_dim_copy(bmap2->dim));
2627 n_in = isl_basic_map_n_in(bmap1);
2628 n_out = isl_basic_map_n_out(bmap2);
2629 n = isl_basic_map_n_out(bmap1);
2630 nparam = isl_basic_map_n_param(bmap1);
2632 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + n;
2633 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
2634 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
2635 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
2636 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
2637 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
2638 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_in);
2639 isl_dim_map_div(dim_map1, bmap1, pos += n_out);
2640 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
2641 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
2642 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
2644 bmap = isl_basic_map_alloc_dim(dim_result,
2645 bmap1->n_div + bmap2->n_div + n,
2646 bmap1->n_eq + bmap2->n_eq,
2647 bmap1->n_ineq + bmap2->n_ineq);
2648 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
2649 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
2650 bmap = add_divs(bmap, n);
2651 bmap = isl_basic_map_simplify(bmap);
2652 bmap = isl_basic_map_drop_redundant_divs(bmap);
2653 return isl_basic_map_finalize(bmap);
2655 isl_basic_map_free(bmap1);
2656 isl_basic_map_free(bmap2);
2660 struct isl_basic_set *isl_basic_set_apply(
2661 struct isl_basic_set *bset, struct isl_basic_map *bmap)
2666 isl_assert(bset->ctx, isl_basic_map_compatible_domain(bmap, bset),
2669 return (struct isl_basic_set *)
2670 isl_basic_map_apply_range((struct isl_basic_map *)bset, bmap);
2672 isl_basic_set_free(bset);
2673 isl_basic_map_free(bmap);
2677 struct isl_basic_map *isl_basic_map_apply_domain(
2678 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2680 if (!bmap1 || !bmap2)
2683 isl_assert(bmap1->ctx,
2684 isl_basic_map_n_in(bmap1) == isl_basic_map_n_in(bmap2), goto error);
2685 isl_assert(bmap1->ctx,
2686 isl_basic_map_n_param(bmap1) == isl_basic_map_n_param(bmap2),
2689 bmap1 = isl_basic_map_reverse(bmap1);
2690 bmap1 = isl_basic_map_apply_range(bmap1, bmap2);
2691 return isl_basic_map_reverse(bmap1);
2693 isl_basic_map_free(bmap1);
2694 isl_basic_map_free(bmap2);
2698 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
2699 * A \cap B -> f(A) + f(B)
2701 struct isl_basic_map *isl_basic_map_sum(
2702 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2704 unsigned n_in, n_out, nparam, total, pos;
2705 struct isl_basic_map *bmap = NULL;
2706 struct isl_dim_map *dim_map1, *dim_map2;
2709 if (!bmap1 || !bmap2)
2712 isl_assert(bmap1->ctx, isl_dim_equal(bmap1->dim, bmap2->dim),
2715 nparam = isl_basic_map_n_param(bmap1);
2716 n_in = isl_basic_map_n_in(bmap1);
2717 n_out = isl_basic_map_n_out(bmap1);
2719 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + 2 * n_out;
2720 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
2721 dim_map2 = isl_dim_map_alloc(bmap2->ctx, total);
2722 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
2723 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos);
2724 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
2725 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
2726 isl_dim_map_div(dim_map1, bmap1, pos += n_in + n_out);
2727 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
2728 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
2729 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_out);
2731 bmap = isl_basic_map_alloc_dim(isl_dim_copy(bmap1->dim),
2732 bmap1->n_div + bmap2->n_div + 2 * n_out,
2733 bmap1->n_eq + bmap2->n_eq + n_out,
2734 bmap1->n_ineq + bmap2->n_ineq);
2735 for (i = 0; i < n_out; ++i) {
2736 int j = isl_basic_map_alloc_equality(bmap);
2739 isl_seq_clr(bmap->eq[j], 1+total);
2740 isl_int_set_si(bmap->eq[j][1+nparam+n_in+i], -1);
2741 isl_int_set_si(bmap->eq[j][1+pos+i], 1);
2742 isl_int_set_si(bmap->eq[j][1+pos-n_out+i], 1);
2744 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
2745 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
2746 bmap = add_divs(bmap, 2 * n_out);
2748 bmap = isl_basic_map_simplify(bmap);
2749 return isl_basic_map_finalize(bmap);
2751 isl_basic_map_free(bmap);
2752 isl_basic_map_free(bmap1);
2753 isl_basic_map_free(bmap2);
2757 /* Given two maps A -> f(A) and B -> g(B), construct a map
2758 * A \cap B -> f(A) + f(B)
2760 struct isl_map *isl_map_sum(struct isl_map *map1, struct isl_map *map2)
2762 struct isl_map *result;
2768 isl_assert(map1->ctx, isl_dim_equal(map1->dim, map2->dim), goto error);
2770 result = isl_map_alloc_dim(isl_dim_copy(map1->dim),
2771 map1->n * map2->n, 0);
2774 for (i = 0; i < map1->n; ++i)
2775 for (j = 0; j < map2->n; ++j) {
2776 struct isl_basic_map *part;
2777 part = isl_basic_map_sum(
2778 isl_basic_map_copy(map1->p[i]),
2779 isl_basic_map_copy(map2->p[j]));
2780 if (isl_basic_map_is_empty(part))
2781 isl_basic_map_free(part);
2783 result = isl_map_add_basic_map(result, part);
2796 __isl_give isl_set *isl_set_sum(__isl_take isl_set *set1,
2797 __isl_take isl_set *set2)
2799 return (isl_set *)isl_map_sum((isl_map *)set1, (isl_map *)set2);
2802 /* Given a basic map A -> f(A), construct A -> -f(A).
2804 struct isl_basic_map *isl_basic_map_neg(struct isl_basic_map *bmap)
2809 bmap = isl_basic_map_cow(bmap);
2813 n = isl_basic_map_dim(bmap, isl_dim_out);
2814 off = isl_basic_map_offset(bmap, isl_dim_out);
2815 for (i = 0; i < bmap->n_eq; ++i)
2816 for (j = 0; j < n; ++j)
2817 isl_int_neg(bmap->eq[i][off+j], bmap->eq[i][off+j]);
2818 for (i = 0; i < bmap->n_ineq; ++i)
2819 for (j = 0; j < n; ++j)
2820 isl_int_neg(bmap->ineq[i][off+j], bmap->ineq[i][off+j]);
2821 for (i = 0; i < bmap->n_div; ++i)
2822 for (j = 0; j < n; ++j)
2823 isl_int_neg(bmap->div[i][1+off+j], bmap->div[i][1+off+j]);
2824 return isl_basic_map_finalize(bmap);
2827 /* Given a map A -> f(A), construct A -> -f(A).
2829 struct isl_map *isl_map_neg(struct isl_map *map)
2833 map = isl_map_cow(map);
2837 for (i = 0; i < map->n; ++i) {
2838 map->p[i] = isl_basic_map_neg(map->p[i]);
2849 __isl_give isl_set *isl_set_neg(__isl_take isl_set *set)
2851 return (isl_set *)isl_map_neg((isl_map *)set);
2854 /* Given a basic map A -> f(A) and an integer d, construct a basic map
2855 * A -> floor(f(A)/d).
2857 struct isl_basic_map *isl_basic_map_floordiv(struct isl_basic_map *bmap,
2860 unsigned n_in, n_out, nparam, total, pos;
2861 struct isl_basic_map *result = NULL;
2862 struct isl_dim_map *dim_map;
2868 nparam = isl_basic_map_n_param(bmap);
2869 n_in = isl_basic_map_n_in(bmap);
2870 n_out = isl_basic_map_n_out(bmap);
2872 total = nparam + n_in + n_out + bmap->n_div + n_out;
2873 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2874 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_param, pos = 0);
2875 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_in, pos += nparam);
2876 isl_dim_map_div(dim_map, bmap, pos += n_in + n_out);
2877 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_out, pos += bmap->n_div);
2879 result = isl_basic_map_alloc_dim(isl_dim_copy(bmap->dim),
2880 bmap->n_div + n_out,
2881 bmap->n_eq, bmap->n_ineq + 2 * n_out);
2882 result = add_constraints_dim_map(result, bmap, dim_map);
2883 result = add_divs(result, n_out);
2884 for (i = 0; i < n_out; ++i) {
2886 j = isl_basic_map_alloc_inequality(result);
2889 isl_seq_clr(result->ineq[j], 1+total);
2890 isl_int_neg(result->ineq[j][1+nparam+n_in+i], d);
2891 isl_int_set_si(result->ineq[j][1+pos+i], 1);
2892 j = isl_basic_map_alloc_inequality(result);
2895 isl_seq_clr(result->ineq[j], 1+total);
2896 isl_int_set(result->ineq[j][1+nparam+n_in+i], d);
2897 isl_int_set_si(result->ineq[j][1+pos+i], -1);
2898 isl_int_sub_ui(result->ineq[j][0], d, 1);
2901 result = isl_basic_map_simplify(result);
2902 return isl_basic_map_finalize(result);
2904 isl_basic_map_free(result);
2908 /* Given a map A -> f(A) and an integer d, construct a map
2909 * A -> floor(f(A)/d).
2911 struct isl_map *isl_map_floordiv(struct isl_map *map, isl_int d)
2915 map = isl_map_cow(map);
2919 ISL_F_CLR(map, ISL_MAP_DISJOINT);
2920 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
2921 for (i = 0; i < map->n; ++i) {
2922 map->p[i] = isl_basic_map_floordiv(map->p[i], d);
2933 static struct isl_basic_map *var_equal(struct isl_basic_map *bmap, unsigned pos)
2939 i = isl_basic_map_alloc_equality(bmap);
2942 nparam = isl_basic_map_n_param(bmap);
2943 n_in = isl_basic_map_n_in(bmap);
2944 isl_seq_clr(bmap->eq[i], 1 + isl_basic_map_total_dim(bmap));
2945 isl_int_set_si(bmap->eq[i][1+nparam+pos], -1);
2946 isl_int_set_si(bmap->eq[i][1+nparam+n_in+pos], 1);
2947 return isl_basic_map_finalize(bmap);
2949 isl_basic_map_free(bmap);
2953 /* Add a constraints to "bmap" expressing i_pos < o_pos
2955 static struct isl_basic_map *var_less(struct isl_basic_map *bmap, unsigned pos)
2961 i = isl_basic_map_alloc_inequality(bmap);
2964 nparam = isl_basic_map_n_param(bmap);
2965 n_in = isl_basic_map_n_in(bmap);
2966 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
2967 isl_int_set_si(bmap->ineq[i][0], -1);
2968 isl_int_set_si(bmap->ineq[i][1+nparam+pos], -1);
2969 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], 1);
2970 return isl_basic_map_finalize(bmap);
2972 isl_basic_map_free(bmap);
2976 /* Add a constraint to "bmap" expressing i_pos <= o_pos
2978 static __isl_give isl_basic_map *var_less_or_equal(
2979 __isl_take isl_basic_map *bmap, unsigned pos)
2985 i = isl_basic_map_alloc_inequality(bmap);
2988 nparam = isl_basic_map_n_param(bmap);
2989 n_in = isl_basic_map_n_in(bmap);
2990 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
2991 isl_int_set_si(bmap->ineq[i][1+nparam+pos], -1);
2992 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], 1);
2993 return isl_basic_map_finalize(bmap);
2995 isl_basic_map_free(bmap);
2999 /* Add a constraints to "bmap" expressing i_pos > o_pos
3001 static struct isl_basic_map *var_more(struct isl_basic_map *bmap, unsigned pos)
3007 i = isl_basic_map_alloc_inequality(bmap);
3010 nparam = isl_basic_map_n_param(bmap);
3011 n_in = isl_basic_map_n_in(bmap);
3012 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
3013 isl_int_set_si(bmap->ineq[i][0], -1);
3014 isl_int_set_si(bmap->ineq[i][1+nparam+pos], 1);
3015 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], -1);
3016 return isl_basic_map_finalize(bmap);
3018 isl_basic_map_free(bmap);
3022 /* Add a constraint to "bmap" expressing i_pos >= o_pos
3024 static __isl_give isl_basic_map *var_more_or_equal(
3025 __isl_take isl_basic_map *bmap, unsigned pos)
3031 i = isl_basic_map_alloc_inequality(bmap);
3034 nparam = isl_basic_map_n_param(bmap);
3035 n_in = isl_basic_map_n_in(bmap);
3036 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
3037 isl_int_set_si(bmap->ineq[i][1+nparam+pos], 1);
3038 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], -1);
3039 return isl_basic_map_finalize(bmap);
3041 isl_basic_map_free(bmap);
3045 struct isl_basic_map *isl_basic_map_equal(struct isl_dim *dim, unsigned n_equal)
3048 struct isl_basic_map *bmap;
3049 bmap = isl_basic_map_alloc_dim(dim, 0, n_equal, 0);
3052 for (i = 0; i < n_equal && bmap; ++i)
3053 bmap = var_equal(bmap, i);
3054 return isl_basic_map_finalize(bmap);
3057 /* Return a relation on of dimension "dim" expressing i_[0..pos] << o_[0..pos]
3059 struct isl_basic_map *isl_basic_map_less_at(struct isl_dim *dim, unsigned pos)
3062 struct isl_basic_map *bmap;
3063 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
3066 for (i = 0; i < pos && bmap; ++i)
3067 bmap = var_equal(bmap, i);
3069 bmap = var_less(bmap, pos);
3070 return isl_basic_map_finalize(bmap);
3073 /* Return a relation on of dimension "dim" expressing i_[0..pos] <<= o_[0..pos]
3075 __isl_give isl_basic_map *isl_basic_map_less_or_equal_at(
3076 __isl_take isl_dim *dim, unsigned pos)
3079 isl_basic_map *bmap;
3081 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
3082 for (i = 0; i < pos; ++i)
3083 bmap = var_equal(bmap, i);
3084 bmap = var_less_or_equal(bmap, pos);
3085 return isl_basic_map_finalize(bmap);
3088 /* Return a relation on pairs of sets of dimension "dim" expressing i_pos > o_pos
3090 struct isl_basic_map *isl_basic_map_more_at(struct isl_dim *dim, unsigned pos)
3093 struct isl_basic_map *bmap;
3094 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
3097 for (i = 0; i < pos && bmap; ++i)
3098 bmap = var_equal(bmap, i);
3100 bmap = var_more(bmap, pos);
3101 return isl_basic_map_finalize(bmap);
3104 /* Return a relation on of dimension "dim" expressing i_[0..pos] >>= o_[0..pos]
3106 __isl_give isl_basic_map *isl_basic_map_more_or_equal_at(
3107 __isl_take isl_dim *dim, unsigned pos)
3110 isl_basic_map *bmap;
3112 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
3113 for (i = 0; i < pos; ++i)
3114 bmap = var_equal(bmap, i);
3115 bmap = var_more_or_equal(bmap, pos);
3116 return isl_basic_map_finalize(bmap);
3119 static __isl_give isl_map *map_lex_lte_first(__isl_take isl_dim *dims,
3120 unsigned n, int equal)
3122 struct isl_map *map;
3125 if (n == 0 && equal)
3126 return isl_map_universe(dims);
3128 map = isl_map_alloc_dim(isl_dim_copy(dims), n, ISL_MAP_DISJOINT);
3130 for (i = 0; i + 1 < n; ++i)
3131 map = isl_map_add_basic_map(map,
3132 isl_basic_map_less_at(isl_dim_copy(dims), i));
3135 map = isl_map_add_basic_map(map,
3136 isl_basic_map_less_or_equal_at(dims, n - 1));
3138 map = isl_map_add_basic_map(map,
3139 isl_basic_map_less_at(dims, n - 1));
3146 static __isl_give isl_map *map_lex_lte(__isl_take isl_dim *dims, int equal)
3150 return map_lex_lte_first(dims, dims->n_out, equal);
3153 __isl_give isl_map *isl_map_lex_lt_first(__isl_take isl_dim *dim, unsigned n)
3155 return map_lex_lte_first(dim, n, 0);
3158 __isl_give isl_map *isl_map_lex_le_first(__isl_take isl_dim *dim, unsigned n)
3160 return map_lex_lte_first(dim, n, 1);
3163 __isl_give isl_map *isl_map_lex_lt(__isl_take isl_dim *set_dim)
3165 return map_lex_lte(isl_dim_map(set_dim), 0);
3168 __isl_give isl_map *isl_map_lex_le(__isl_take isl_dim *set_dim)
3170 return map_lex_lte(isl_dim_map(set_dim), 1);
3173 static __isl_give isl_map *map_lex_gte_first(__isl_take isl_dim *dims,
3174 unsigned n, int equal)
3176 struct isl_map *map;
3179 if (n == 0 && equal)
3180 return isl_map_universe(dims);
3182 map = isl_map_alloc_dim(isl_dim_copy(dims), n, ISL_MAP_DISJOINT);
3184 for (i = 0; i + 1 < n; ++i)
3185 map = isl_map_add_basic_map(map,
3186 isl_basic_map_more_at(isl_dim_copy(dims), i));
3189 map = isl_map_add_basic_map(map,
3190 isl_basic_map_more_or_equal_at(dims, n - 1));
3192 map = isl_map_add_basic_map(map,
3193 isl_basic_map_more_at(dims, n - 1));
3200 static __isl_give isl_map *map_lex_gte(__isl_take isl_dim *dims, int equal)
3204 return map_lex_gte_first(dims, dims->n_out, equal);
3207 __isl_give isl_map *isl_map_lex_gt_first(__isl_take isl_dim *dim, unsigned n)
3209 return map_lex_gte_first(dim, n, 0);
3212 __isl_give isl_map *isl_map_lex_ge_first(__isl_take isl_dim *dim, unsigned n)
3214 return map_lex_gte_first(dim, n, 1);
3217 __isl_give isl_map *isl_map_lex_gt(__isl_take isl_dim *set_dim)
3219 return map_lex_gte(isl_dim_map(set_dim), 0);
3222 __isl_give isl_map *isl_map_lex_ge(__isl_take isl_dim *set_dim)
3224 return map_lex_gte(isl_dim_map(set_dim), 1);
3227 __isl_give isl_map *isl_set_lex_le_set(__isl_take isl_set *set1,
3228 __isl_take isl_set *set2)
3231 map = isl_map_lex_le(isl_set_get_dim(set1));
3232 map = isl_map_intersect_domain(map, set1);
3233 map = isl_map_intersect_range(map, set2);
3237 __isl_give isl_map *isl_set_lex_lt_set(__isl_take isl_set *set1,
3238 __isl_take isl_set *set2)
3241 map = isl_map_lex_lt(isl_set_get_dim(set1));
3242 map = isl_map_intersect_domain(map, set1);
3243 map = isl_map_intersect_range(map, set2);
3247 __isl_give isl_map *isl_set_lex_ge_set(__isl_take isl_set *set1,
3248 __isl_take isl_set *set2)
3251 map = isl_map_lex_ge(isl_set_get_dim(set1));
3252 map = isl_map_intersect_domain(map, set1);
3253 map = isl_map_intersect_range(map, set2);
3257 __isl_give isl_map *isl_set_lex_gt_set(__isl_take isl_set *set1,
3258 __isl_take isl_set *set2)
3261 map = isl_map_lex_gt(isl_set_get_dim(set1));
3262 map = isl_map_intersect_domain(map, set1);
3263 map = isl_map_intersect_range(map, set2);
3267 __isl_give isl_map *isl_map_lex_le_map(__isl_take isl_map *map1,
3268 __isl_take isl_map *map2)
3271 map = isl_map_lex_le(isl_dim_range(isl_map_get_dim(map1)));
3272 map = isl_map_apply_domain(map, isl_map_reverse(map1));
3273 map = isl_map_apply_range(map, isl_map_reverse(map2));
3277 __isl_give isl_map *isl_map_lex_lt_map(__isl_take isl_map *map1,
3278 __isl_take isl_map *map2)
3281 map = isl_map_lex_lt(isl_dim_range(isl_map_get_dim(map1)));
3282 map = isl_map_apply_domain(map, isl_map_reverse(map1));
3283 map = isl_map_apply_range(map, isl_map_reverse(map2));
3287 __isl_give isl_map *isl_map_lex_ge_map(__isl_take isl_map *map1,
3288 __isl_take isl_map *map2)
3291 map = isl_map_lex_ge(isl_dim_range(isl_map_get_dim(map1)));
3292 map = isl_map_apply_domain(map, isl_map_reverse(map1));
3293 map = isl_map_apply_range(map, isl_map_reverse(map2));
3297 __isl_give isl_map *isl_map_lex_gt_map(__isl_take isl_map *map1,
3298 __isl_take isl_map *map2)
3301 map = isl_map_lex_gt(isl_dim_range(isl_map_get_dim(map1)));
3302 map = isl_map_apply_domain(map, isl_map_reverse(map1));
3303 map = isl_map_apply_range(map, isl_map_reverse(map2));
3307 struct isl_basic_map *isl_basic_map_from_basic_set(
3308 struct isl_basic_set *bset, struct isl_dim *dim)
3310 struct isl_basic_map *bmap;
3312 bset = isl_basic_set_cow(bset);
3316 isl_assert(bset->ctx, isl_dim_compatible(bset->dim, dim), goto error);
3317 isl_dim_free(bset->dim);
3318 bmap = (struct isl_basic_map *) bset;
3320 return isl_basic_map_finalize(bmap);
3322 isl_basic_set_free(bset);
3327 struct isl_basic_set *isl_basic_set_from_basic_map(struct isl_basic_map *bmap)
3331 if (bmap->dim->n_in == 0)
3332 return (struct isl_basic_set *)bmap;
3333 bmap = isl_basic_map_cow(bmap);
3336 bmap->dim = isl_dim_as_set_dim(bmap->dim);
3339 bmap = isl_basic_map_finalize(bmap);
3340 return (struct isl_basic_set *)bmap;
3342 isl_basic_map_free(bmap);
3346 /* For a div d = floor(f/m), add the constraints
3349 * -(f-(n-1)) + m d >= 0
3351 * Note that the second constraint is the negation of
3355 int isl_basic_map_add_div_constraints_var(__isl_keep isl_basic_map *bmap,
3356 unsigned pos, isl_int *div)
3359 unsigned total = isl_basic_map_total_dim(bmap);
3361 i = isl_basic_map_alloc_inequality(bmap);
3364 isl_seq_cpy(bmap->ineq[i], div + 1, 1 + total);
3365 isl_int_neg(bmap->ineq[i][1 + pos], div[0]);
3367 j = isl_basic_map_alloc_inequality(bmap);
3370 isl_seq_neg(bmap->ineq[j], bmap->ineq[i], 1 + total);
3371 isl_int_add(bmap->ineq[j][0], bmap->ineq[j][0], bmap->ineq[j][1 + pos]);
3372 isl_int_sub_ui(bmap->ineq[j][0], bmap->ineq[j][0], 1);
3376 int isl_basic_set_add_div_constraints_var(__isl_keep isl_basic_set *bset,
3377 unsigned pos, isl_int *div)
3379 return isl_basic_map_add_div_constraints_var((isl_basic_map *)bset,
3383 int isl_basic_map_add_div_constraints(struct isl_basic_map *bmap, unsigned div)
3385 unsigned total = isl_basic_map_total_dim(bmap);
3386 unsigned div_pos = total - bmap->n_div + div;
3388 return isl_basic_map_add_div_constraints_var(bmap, div_pos,
3392 struct isl_basic_set *isl_basic_map_underlying_set(
3393 struct isl_basic_map *bmap)
3397 if (bmap->dim->nparam == 0 && bmap->dim->n_in == 0 &&
3398 bmap->n_div == 0 && !isl_dim_get_tuple_name(bmap->dim, isl_dim_out))
3399 return (struct isl_basic_set *)bmap;
3400 bmap = isl_basic_map_cow(bmap);
3403 bmap->dim = isl_dim_underlying(bmap->dim, bmap->n_div);
3406 bmap->extra -= bmap->n_div;
3408 bmap = isl_basic_map_finalize(bmap);
3409 return (struct isl_basic_set *)bmap;
3414 __isl_give isl_basic_set *isl_basic_set_underlying_set(
3415 __isl_take isl_basic_set *bset)
3417 return isl_basic_map_underlying_set((isl_basic_map *)bset);
3420 struct isl_basic_map *isl_basic_map_overlying_set(
3421 struct isl_basic_set *bset, struct isl_basic_map *like)
3423 struct isl_basic_map *bmap;
3424 struct isl_ctx *ctx;
3431 isl_assert(ctx, bset->n_div == 0, goto error);
3432 isl_assert(ctx, isl_basic_set_n_param(bset) == 0, goto error);
3433 isl_assert(ctx, bset->dim->n_out == isl_basic_map_total_dim(like),
3435 if (isl_dim_equal(bset->dim, like->dim) && like->n_div == 0) {
3436 isl_basic_map_free(like);
3437 return (struct isl_basic_map *)bset;
3439 bset = isl_basic_set_cow(bset);
3442 total = bset->dim->n_out + bset->extra;
3443 bmap = (struct isl_basic_map *)bset;
3444 isl_dim_free(bmap->dim);
3445 bmap->dim = isl_dim_copy(like->dim);
3448 bmap->n_div = like->n_div;
3449 bmap->extra += like->n_div;
3452 ltotal = total - bmap->extra + like->extra;
3455 bmap->block2 = isl_blk_extend(ctx, bmap->block2,
3456 bmap->extra * (1 + 1 + total));
3457 if (isl_blk_is_error(bmap->block2))
3459 bmap->div = isl_realloc_array(ctx, bmap->div, isl_int *,
3463 for (i = 0; i < bmap->extra; ++i)
3464 bmap->div[i] = bmap->block2.data + i * (1 + 1 + total);
3465 for (i = 0; i < like->n_div; ++i) {
3466 isl_seq_cpy(bmap->div[i], like->div[i], 1 + 1 + ltotal);
3467 isl_seq_clr(bmap->div[i]+1+1+ltotal, total - ltotal);
3469 bmap = isl_basic_map_extend_constraints(bmap,
3470 0, 2 * like->n_div);
3471 for (i = 0; i < like->n_div; ++i) {
3472 if (isl_int_is_zero(bmap->div[i][0]))
3474 if (isl_basic_map_add_div_constraints(bmap, i) < 0)
3478 isl_basic_map_free(like);
3479 bmap = isl_basic_map_simplify(bmap);
3480 bmap = isl_basic_map_finalize(bmap);
3483 isl_basic_map_free(like);
3484 isl_basic_set_free(bset);
3488 struct isl_basic_set *isl_basic_set_from_underlying_set(
3489 struct isl_basic_set *bset, struct isl_basic_set *like)
3491 return (struct isl_basic_set *)
3492 isl_basic_map_overlying_set(bset, (struct isl_basic_map *)like);
3495 struct isl_set *isl_set_from_underlying_set(
3496 struct isl_set *set, struct isl_basic_set *like)
3502 isl_assert(set->ctx, set->dim->n_out == isl_basic_set_total_dim(like),
3504 if (isl_dim_equal(set->dim, like->dim) && like->n_div == 0) {
3505 isl_basic_set_free(like);
3508 set = isl_set_cow(set);
3511 for (i = 0; i < set->n; ++i) {
3512 set->p[i] = isl_basic_set_from_underlying_set(set->p[i],
3513 isl_basic_set_copy(like));
3517 isl_dim_free(set->dim);
3518 set->dim = isl_dim_copy(like->dim);
3521 isl_basic_set_free(like);
3524 isl_basic_set_free(like);
3529 struct isl_set *isl_map_underlying_set(struct isl_map *map)
3533 map = isl_map_cow(map);
3536 map->dim = isl_dim_cow(map->dim);
3540 for (i = 1; i < map->n; ++i)
3541 isl_assert(map->ctx, map->p[0]->n_div == map->p[i]->n_div,
3543 for (i = 0; i < map->n; ++i) {
3544 map->p[i] = (struct isl_basic_map *)
3545 isl_basic_map_underlying_set(map->p[i]);
3550 map->dim = isl_dim_underlying(map->dim, 0);
3552 isl_dim_free(map->dim);
3553 map->dim = isl_dim_copy(map->p[0]->dim);
3557 return (struct isl_set *)map;
3563 struct isl_set *isl_set_to_underlying_set(struct isl_set *set)
3565 return (struct isl_set *)isl_map_underlying_set((struct isl_map *)set);
3568 static __isl_give isl_basic_map *isl_basic_map_reset_dim(
3569 __isl_take isl_basic_map *bmap, __isl_take isl_dim *dim)
3571 bmap = isl_basic_map_cow(bmap);
3575 isl_dim_free(bmap->dim);
3578 bmap = isl_basic_map_finalize(bmap);
3582 isl_basic_map_free(bmap);
3587 static __isl_give isl_basic_set *isl_basic_set_reset_dim(
3588 __isl_take isl_basic_set *bset, __isl_take isl_dim *dim)
3590 return (isl_basic_set *)isl_basic_map_reset_dim((isl_basic_map *)bset,
3594 __isl_give isl_map *isl_map_reset_dim(__isl_take isl_map *map,
3595 __isl_take isl_dim *dim)
3599 map = isl_map_cow(map);
3603 for (i = 0; i < map->n; ++i) {
3604 map->p[i] = isl_basic_map_reset_dim(map->p[i],
3609 isl_dim_free(map->dim);
3619 __isl_give isl_set *isl_set_reset_dim(__isl_take isl_set *set,
3620 __isl_take isl_dim *dim)
3622 return (struct isl_set *) isl_map_reset_dim((struct isl_map *)set, dim);
3625 struct isl_basic_set *isl_basic_map_domain(struct isl_basic_map *bmap)
3628 struct isl_basic_set *domain;
3634 dim = isl_dim_domain(isl_basic_map_get_dim(bmap));
3636 n_in = isl_basic_map_n_in(bmap);
3637 n_out = isl_basic_map_n_out(bmap);
3638 domain = isl_basic_set_from_basic_map(bmap);
3639 domain = isl_basic_set_project_out(domain, isl_dim_set, n_in, n_out);
3641 domain = isl_basic_set_reset_dim(domain, dim);
3646 struct isl_basic_set *isl_basic_map_range(struct isl_basic_map *bmap)
3648 return isl_basic_map_domain(isl_basic_map_reverse(bmap));
3651 __isl_give isl_basic_map *isl_basic_map_domain_map(
3652 __isl_take isl_basic_map *bmap)
3656 isl_basic_map *domain;
3657 isl_basic_set *bset;
3658 int nparam, n_in, n_out;
3661 nparam = isl_basic_map_dim(bmap, isl_dim_param);
3662 n_in = isl_basic_map_dim(bmap, isl_dim_in);
3663 n_out = isl_basic_map_dim(bmap, isl_dim_out);
3665 dim = isl_dim_from_range(isl_dim_domain(isl_basic_map_get_dim(bmap)));
3666 domain = isl_basic_map_universe(dim);
3668 bmap = isl_basic_map_from_domain(isl_basic_map_wrap(bmap));
3669 bmap = isl_basic_map_apply_range(bmap, domain);
3670 bmap = isl_basic_map_extend_constraints(bmap, n_in, 0);
3672 total = isl_basic_map_total_dim(bmap);
3674 for (i = 0; i < n_in; ++i) {
3675 k = isl_basic_map_alloc_equality(bmap);
3678 isl_seq_clr(bmap->eq[k], 1 + total);
3679 isl_int_set_si(bmap->eq[k][1 + nparam + i], -1);
3680 isl_int_set_si(bmap->eq[k][1 + nparam + n_in + n_out + i], 1);
3683 bmap = isl_basic_map_gauss(bmap, NULL);
3684 return isl_basic_map_finalize(bmap);
3686 isl_basic_map_free(bmap);
3690 __isl_give isl_basic_map *isl_basic_map_range_map(
3691 __isl_take isl_basic_map *bmap)
3695 isl_basic_map *range;
3696 isl_basic_set *bset;
3697 int nparam, n_in, n_out;
3700 nparam = isl_basic_map_dim(bmap, isl_dim_param);
3701 n_in = isl_basic_map_dim(bmap, isl_dim_in);
3702 n_out = isl_basic_map_dim(bmap, isl_dim_out);
3704 dim = isl_dim_from_range(isl_dim_range(isl_basic_map_get_dim(bmap)));
3705 range = isl_basic_map_universe(dim);
3707 bmap = isl_basic_map_from_domain(isl_basic_map_wrap(bmap));
3708 bmap = isl_basic_map_apply_range(bmap, range);
3709 bmap = isl_basic_map_extend_constraints(bmap, n_out, 0);
3711 total = isl_basic_map_total_dim(bmap);
3713 for (i = 0; i < n_out; ++i) {
3714 k = isl_basic_map_alloc_equality(bmap);
3717 isl_seq_clr(bmap->eq[k], 1 + total);
3718 isl_int_set_si(bmap->eq[k][1 + nparam + n_in + i], -1);
3719 isl_int_set_si(bmap->eq[k][1 + nparam + n_in + n_out + i], 1);
3722 bmap = isl_basic_map_gauss(bmap, NULL);
3723 return isl_basic_map_finalize(bmap);
3725 isl_basic_map_free(bmap);
3729 struct isl_set *isl_map_range(struct isl_map *map)
3732 struct isl_set *set;
3736 if (isl_map_dim(map, isl_dim_in) == 0)
3737 return (isl_set *)map;
3739 map = isl_map_cow(map);
3743 set = (struct isl_set *) map;
3744 set->dim = isl_dim_drop_inputs(set->dim, 0, set->dim->n_in);
3747 for (i = 0; i < map->n; ++i) {
3748 set->p[i] = isl_basic_map_range(map->p[i]);
3752 ISL_F_CLR(set, ISL_MAP_DISJOINT);
3753 ISL_F_CLR(set, ISL_SET_NORMALIZED);
3760 __isl_give isl_map *isl_map_domain_map(__isl_take isl_map *map)
3763 isl_dim *domain_dim;
3765 map = isl_map_cow(map);
3769 domain_dim = isl_dim_from_range(isl_dim_domain(isl_map_get_dim(map)));
3770 map->dim = isl_dim_from_domain(isl_dim_wrap(map->dim));
3771 map->dim = isl_dim_join(map->dim, domain_dim);
3774 for (i = 0; i < map->n; ++i) {
3775 map->p[i] = isl_basic_map_domain_map(map->p[i]);
3779 ISL_F_CLR(map, ISL_MAP_DISJOINT);
3780 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3787 __isl_give isl_map *isl_map_range_map(__isl_take isl_map *map)
3792 map = isl_map_cow(map);
3796 range_dim = isl_dim_range(isl_map_get_dim(map));
3797 map->dim = isl_dim_from_domain(isl_dim_wrap(map->dim));
3798 map->dim = isl_dim_join(map->dim, range_dim);
3801 for (i = 0; i < map->n; ++i) {
3802 map->p[i] = isl_basic_map_range_map(map->p[i]);
3806 ISL_F_CLR(map, ISL_MAP_DISJOINT);
3807 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3814 struct isl_map *isl_map_from_set(struct isl_set *set, struct isl_dim *dim)
3817 struct isl_map *map = NULL;
3819 set = isl_set_cow(set);
3822 isl_assert(set->ctx, isl_dim_compatible(set->dim, dim), goto error);
3823 map = (struct isl_map *)set;
3824 for (i = 0; i < set->n; ++i) {
3825 map->p[i] = isl_basic_map_from_basic_set(
3826 set->p[i], isl_dim_copy(dim));
3830 isl_dim_free(map->dim);
3839 __isl_give isl_basic_map *isl_basic_map_from_domain(
3840 __isl_take isl_basic_set *bset)
3842 return isl_basic_map_reverse(isl_basic_map_from_range(bset));
3845 __isl_give isl_basic_map *isl_basic_map_from_range(
3846 __isl_take isl_basic_set *bset)
3848 return (isl_basic_map *)bset;
3851 struct isl_map *isl_map_from_range(struct isl_set *set)
3853 return (struct isl_map *)set;
3856 __isl_give isl_map *isl_map_from_domain(__isl_take isl_set *set)
3858 return isl_map_reverse(isl_map_from_range(set));
3861 __isl_give isl_map *isl_map_from_domain_and_range(__isl_take isl_set *domain,
3862 __isl_take isl_set *range)
3864 return isl_map_apply_range(isl_map_from_domain(domain),
3865 isl_map_from_range(range));
3868 struct isl_set *isl_set_from_map(struct isl_map *map)
3871 struct isl_set *set = NULL;
3875 map = isl_map_cow(map);
3878 map->dim = isl_dim_as_set_dim(map->dim);
3881 set = (struct isl_set *)map;
3882 for (i = 0; i < map->n; ++i) {
3883 set->p[i] = isl_basic_set_from_basic_map(map->p[i]);
3893 struct isl_map *isl_map_alloc_dim(struct isl_dim *dim, int n, unsigned flags)
3895 struct isl_map *map;
3899 isl_assert(dim->ctx, n >= 0, return NULL);
3900 map = isl_alloc(dim->ctx, struct isl_map,
3901 sizeof(struct isl_map) +
3902 (n - 1) * sizeof(struct isl_basic_map *));
3906 map->ctx = dim->ctx;
3907 isl_ctx_ref(map->ctx);
3919 struct isl_map *isl_map_alloc(struct isl_ctx *ctx,
3920 unsigned nparam, unsigned in, unsigned out, int n,
3923 struct isl_map *map;
3924 struct isl_dim *dims;
3926 dims = isl_dim_alloc(ctx, nparam, in, out);
3930 map = isl_map_alloc_dim(dims, n, flags);
3934 struct isl_basic_map *isl_basic_map_empty(struct isl_dim *dim)
3936 struct isl_basic_map *bmap;
3937 bmap = isl_basic_map_alloc_dim(dim, 0, 1, 0);
3938 bmap = isl_basic_map_set_to_empty(bmap);
3942 struct isl_basic_set *isl_basic_set_empty(struct isl_dim *dim)
3944 struct isl_basic_set *bset;
3945 bset = isl_basic_set_alloc_dim(dim, 0, 1, 0);
3946 bset = isl_basic_set_set_to_empty(bset);
3950 struct isl_basic_map *isl_basic_map_empty_like(struct isl_basic_map *model)
3952 struct isl_basic_map *bmap;
3955 bmap = isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
3956 bmap = isl_basic_map_set_to_empty(bmap);
3960 struct isl_basic_map *isl_basic_map_empty_like_map(struct isl_map *model)
3962 struct isl_basic_map *bmap;
3965 bmap = isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
3966 bmap = isl_basic_map_set_to_empty(bmap);
3970 struct isl_basic_set *isl_basic_set_empty_like(struct isl_basic_set *model)
3972 struct isl_basic_set *bset;
3975 bset = isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
3976 bset = isl_basic_set_set_to_empty(bset);
3980 struct isl_basic_map *isl_basic_map_universe(struct isl_dim *dim)
3982 struct isl_basic_map *bmap;
3983 bmap = isl_basic_map_alloc_dim(dim, 0, 0, 0);
3987 struct isl_basic_set *isl_basic_set_universe(struct isl_dim *dim)
3989 struct isl_basic_set *bset;
3990 bset = isl_basic_set_alloc_dim(dim, 0, 0, 0);
3994 __isl_give isl_basic_map *isl_basic_map_universe_like(
3995 __isl_keep isl_basic_map *model)
3999 return isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
4002 struct isl_basic_set *isl_basic_set_universe_like(struct isl_basic_set *model)
4006 return isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
4009 __isl_give isl_basic_set *isl_basic_set_universe_like_set(
4010 __isl_keep isl_set *model)
4014 return isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
4017 struct isl_map *isl_map_empty(struct isl_dim *dim)
4019 return isl_map_alloc_dim(dim, 0, ISL_MAP_DISJOINT);
4022 struct isl_map *isl_map_empty_like(struct isl_map *model)
4026 return isl_map_alloc_dim(isl_dim_copy(model->dim), 0, ISL_MAP_DISJOINT);
4029 struct isl_map *isl_map_empty_like_basic_map(struct isl_basic_map *model)
4033 return isl_map_alloc_dim(isl_dim_copy(model->dim), 0, ISL_MAP_DISJOINT);
4036 struct isl_set *isl_set_empty(struct isl_dim *dim)
4038 return isl_set_alloc_dim(dim, 0, ISL_MAP_DISJOINT);
4041 struct isl_set *isl_set_empty_like(struct isl_set *model)
4045 return isl_set_empty(isl_dim_copy(model->dim));
4048 struct isl_map *isl_map_universe(struct isl_dim *dim)
4050 struct isl_map *map;
4053 map = isl_map_alloc_dim(isl_dim_copy(dim), 1, ISL_MAP_DISJOINT);
4054 map = isl_map_add_basic_map(map, isl_basic_map_universe(dim));
4058 struct isl_set *isl_set_universe(struct isl_dim *dim)
4060 struct isl_set *set;
4063 set = isl_set_alloc_dim(isl_dim_copy(dim), 1, ISL_MAP_DISJOINT);
4064 set = isl_set_add_basic_set(set, isl_basic_set_universe(dim));
4068 __isl_give isl_set *isl_set_universe_like(__isl_keep isl_set *model)
4072 return isl_set_universe(isl_dim_copy(model->dim));
4075 struct isl_map *isl_map_dup(struct isl_map *map)
4078 struct isl_map *dup;
4082 dup = isl_map_alloc_dim(isl_dim_copy(map->dim), map->n, map->flags);
4083 for (i = 0; i < map->n; ++i)
4084 dup = isl_map_add_basic_map(dup, isl_basic_map_copy(map->p[i]));
4088 __isl_give isl_map *isl_map_add_basic_map(__isl_take isl_map *map,
4089 __isl_take isl_basic_map *bmap)
4093 if (isl_basic_map_fast_is_empty(bmap)) {
4094 isl_basic_map_free(bmap);
4097 isl_assert(map->ctx, isl_dim_equal(map->dim, bmap->dim), goto error);
4098 isl_assert(map->ctx, map->n < map->size, goto error);
4099 map->p[map->n] = bmap;
4101 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4107 isl_basic_map_free(bmap);
4111 void isl_map_free(struct isl_map *map)
4121 isl_ctx_deref(map->ctx);
4122 for (i = 0; i < map->n; ++i)
4123 isl_basic_map_free(map->p[i]);
4124 isl_dim_free(map->dim);
4128 struct isl_map *isl_map_extend(struct isl_map *base,
4129 unsigned nparam, unsigned n_in, unsigned n_out)
4133 base = isl_map_cow(base);
4137 base->dim = isl_dim_extend(base->dim, nparam, n_in, n_out);
4140 for (i = 0; i < base->n; ++i) {
4141 base->p[i] = isl_basic_map_extend_dim(base->p[i],
4142 isl_dim_copy(base->dim), 0, 0, 0);
4152 struct isl_set *isl_set_extend(struct isl_set *base,
4153 unsigned nparam, unsigned dim)
4155 return (struct isl_set *)isl_map_extend((struct isl_map *)base,
4159 static struct isl_basic_map *isl_basic_map_fix_pos_si(
4160 struct isl_basic_map *bmap, unsigned pos, int value)
4164 bmap = isl_basic_map_cow(bmap);
4165 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
4166 j = isl_basic_map_alloc_equality(bmap);
4169 isl_seq_clr(bmap->eq[j] + 1, isl_basic_map_total_dim(bmap));
4170 isl_int_set_si(bmap->eq[j][pos], -1);
4171 isl_int_set_si(bmap->eq[j][0], value);
4172 bmap = isl_basic_map_simplify(bmap);
4173 return isl_basic_map_finalize(bmap);
4175 isl_basic_map_free(bmap);
4179 static __isl_give isl_basic_map *isl_basic_map_fix_pos(
4180 __isl_take isl_basic_map *bmap, unsigned pos, isl_int value)
4184 bmap = isl_basic_map_cow(bmap);
4185 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
4186 j = isl_basic_map_alloc_equality(bmap);
4189 isl_seq_clr(bmap->eq[j] + 1, isl_basic_map_total_dim(bmap));
4190 isl_int_set_si(bmap->eq[j][pos], -1);
4191 isl_int_set(bmap->eq[j][0], value);
4192 bmap = isl_basic_map_simplify(bmap);
4193 return isl_basic_map_finalize(bmap);
4195 isl_basic_map_free(bmap);
4199 struct isl_basic_map *isl_basic_map_fix_si(struct isl_basic_map *bmap,
4200 enum isl_dim_type type, unsigned pos, int value)
4204 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
4205 return isl_basic_map_fix_pos_si(bmap,
4206 isl_basic_map_offset(bmap, type) + pos, value);
4208 isl_basic_map_free(bmap);
4212 __isl_give isl_basic_map *isl_basic_map_fix(__isl_take isl_basic_map *bmap,
4213 enum isl_dim_type type, unsigned pos, isl_int value)
4217 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
4218 return isl_basic_map_fix_pos(bmap,
4219 isl_basic_map_offset(bmap, type) + pos, value);
4221 isl_basic_map_free(bmap);
4225 struct isl_basic_set *isl_basic_set_fix_si(struct isl_basic_set *bset,
4226 enum isl_dim_type type, unsigned pos, int value)
4228 return (struct isl_basic_set *)
4229 isl_basic_map_fix_si((struct isl_basic_map *)bset,
4233 __isl_give isl_basic_set *isl_basic_set_fix(__isl_take isl_basic_set *bset,
4234 enum isl_dim_type type, unsigned pos, isl_int value)
4236 return (struct isl_basic_set *)
4237 isl_basic_map_fix((struct isl_basic_map *)bset,
4241 struct isl_basic_map *isl_basic_map_fix_input_si(struct isl_basic_map *bmap,
4242 unsigned input, int value)
4244 return isl_basic_map_fix_si(bmap, isl_dim_in, input, value);
4247 struct isl_basic_set *isl_basic_set_fix_dim_si(struct isl_basic_set *bset,
4248 unsigned dim, int value)
4250 return (struct isl_basic_set *)
4251 isl_basic_map_fix_si((struct isl_basic_map *)bset,
4252 isl_dim_set, dim, value);
4255 struct isl_map *isl_map_fix_si(struct isl_map *map,
4256 enum isl_dim_type type, unsigned pos, int value)
4260 map = isl_map_cow(map);
4264 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
4265 for (i = 0; i < map->n; ++i) {
4266 map->p[i] = isl_basic_map_fix_si(map->p[i], type, pos, value);
4270 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4277 __isl_give isl_set *isl_set_fix_si(__isl_take isl_set *set,
4278 enum isl_dim_type type, unsigned pos, int value)
4280 return (struct isl_set *)
4281 isl_map_fix_si((struct isl_map *)set, type, pos, value);
4284 __isl_give isl_map *isl_map_fix(__isl_take isl_map *map,
4285 enum isl_dim_type type, unsigned pos, isl_int value)
4289 map = isl_map_cow(map);
4293 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
4294 for (i = 0; i < map->n; ++i) {
4295 map->p[i] = isl_basic_map_fix(map->p[i], type, pos, value);
4299 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4306 __isl_give isl_set *isl_set_fix(__isl_take isl_set *set,
4307 enum isl_dim_type type, unsigned pos, isl_int value)
4309 return (struct isl_set *)isl_map_fix((isl_map *)set, type, pos, value);
4312 struct isl_map *isl_map_fix_input_si(struct isl_map *map,
4313 unsigned input, int value)
4315 return isl_map_fix_si(map, isl_dim_in, input, value);
4318 struct isl_set *isl_set_fix_dim_si(struct isl_set *set, unsigned dim, int value)
4320 return (struct isl_set *)
4321 isl_map_fix_si((struct isl_map *)set, isl_dim_set, dim, value);
4324 __isl_give isl_basic_map *isl_basic_map_lower_bound_si(
4325 __isl_take isl_basic_map *bmap,
4326 enum isl_dim_type type, unsigned pos, int value)
4332 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
4333 pos += isl_basic_map_offset(bmap, type);
4334 bmap = isl_basic_map_cow(bmap);
4335 bmap = isl_basic_map_extend_constraints(bmap, 0, 1);
4336 j = isl_basic_map_alloc_inequality(bmap);
4339 isl_seq_clr(bmap->ineq[j], 1 + isl_basic_map_total_dim(bmap));
4340 isl_int_set_si(bmap->ineq[j][pos], 1);
4341 isl_int_set_si(bmap->ineq[j][0], -value);
4342 bmap = isl_basic_map_simplify(bmap);
4343 return isl_basic_map_finalize(bmap);
4345 isl_basic_map_free(bmap);
4349 struct isl_basic_set *isl_basic_set_lower_bound_dim(struct isl_basic_set *bset,
4350 unsigned dim, isl_int value)
4354 bset = isl_basic_set_cow(bset);
4355 bset = isl_basic_set_extend_constraints(bset, 0, 1);
4356 j = isl_basic_set_alloc_inequality(bset);
4359 isl_seq_clr(bset->ineq[j], 1 + isl_basic_set_total_dim(bset));
4360 isl_int_set_si(bset->ineq[j][1 + isl_basic_set_n_param(bset) + dim], 1);
4361 isl_int_neg(bset->ineq[j][0], value);
4362 bset = isl_basic_set_simplify(bset);
4363 return isl_basic_set_finalize(bset);
4365 isl_basic_set_free(bset);
4369 __isl_give isl_map *isl_map_lower_bound_si(__isl_take isl_map *map,
4370 enum isl_dim_type type, unsigned pos, int value)
4374 map = isl_map_cow(map);
4378 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
4379 for (i = 0; i < map->n; ++i) {
4380 map->p[i] = isl_basic_map_lower_bound_si(map->p[i],
4385 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4392 __isl_give isl_set *isl_set_lower_bound_si(__isl_take isl_set *set,
4393 enum isl_dim_type type, unsigned pos, int value)
4395 return (struct isl_set *)
4396 isl_map_lower_bound_si((struct isl_map *)set, type, pos, value);
4399 struct isl_set *isl_set_lower_bound_dim(struct isl_set *set, unsigned dim,
4404 set = isl_set_cow(set);
4408 isl_assert(set->ctx, dim < isl_set_n_dim(set), goto error);
4409 for (i = 0; i < set->n; ++i) {
4410 set->p[i] = isl_basic_set_lower_bound_dim(set->p[i], dim, value);
4420 struct isl_map *isl_map_reverse(struct isl_map *map)
4424 map = isl_map_cow(map);
4428 map->dim = isl_dim_reverse(map->dim);
4431 for (i = 0; i < map->n; ++i) {
4432 map->p[i] = isl_basic_map_reverse(map->p[i]);
4436 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4443 static struct isl_map *isl_basic_map_partial_lexopt(
4444 struct isl_basic_map *bmap, struct isl_basic_set *dom,
4445 struct isl_set **empty, int max)
4449 if (bmap->ctx->opt->pip == ISL_PIP_PIP)
4450 return isl_pip_basic_map_lexopt(bmap, dom, empty, max);
4452 return isl_tab_basic_map_partial_lexopt(bmap, dom, empty, max);
4454 isl_basic_map_free(bmap);
4455 isl_basic_set_free(dom);
4461 struct isl_map *isl_basic_map_partial_lexmax(
4462 struct isl_basic_map *bmap, struct isl_basic_set *dom,
4463 struct isl_set **empty)
4465 return isl_basic_map_partial_lexopt(bmap, dom, empty, 1);
4468 struct isl_map *isl_basic_map_partial_lexmin(
4469 struct isl_basic_map *bmap, struct isl_basic_set *dom,
4470 struct isl_set **empty)
4472 return isl_basic_map_partial_lexopt(bmap, dom, empty, 0);
4475 struct isl_set *isl_basic_set_partial_lexmin(
4476 struct isl_basic_set *bset, struct isl_basic_set *dom,
4477 struct isl_set **empty)
4479 return (struct isl_set *)
4480 isl_basic_map_partial_lexmin((struct isl_basic_map *)bset,
4484 struct isl_set *isl_basic_set_partial_lexmax(
4485 struct isl_basic_set *bset, struct isl_basic_set *dom,
4486 struct isl_set **empty)
4488 return (struct isl_set *)
4489 isl_basic_map_partial_lexmax((struct isl_basic_map *)bset,
4493 /* Given a basic map "bmap", compute the lexicograhically minimal
4494 * (or maximal) image element for each domain element in dom.
4495 * Set *empty to those elements in dom that do not have an image element.
4497 * We first make sure the basic sets in dom are disjoint and then
4498 * simply collect the results over each of the basic sets separately.
4499 * We could probably improve the efficiency a bit by moving the union
4500 * domain down into the parametric integer programming.
4502 static __isl_give isl_map *basic_map_partial_lexopt(
4503 __isl_take isl_basic_map *bmap, __isl_take isl_set *dom,
4504 __isl_give isl_set **empty, int max)
4507 struct isl_map *res;
4509 dom = isl_set_make_disjoint(dom);
4513 if (isl_set_fast_is_empty(dom)) {
4514 res = isl_map_empty_like_basic_map(bmap);
4515 *empty = isl_set_empty_like(dom);
4517 isl_basic_map_free(bmap);
4521 res = isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap),
4522 isl_basic_set_copy(dom->p[0]), empty, max);
4524 for (i = 1; i < dom->n; ++i) {
4525 struct isl_map *res_i;
4526 struct isl_set *empty_i;
4528 res_i = isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap),
4529 isl_basic_set_copy(dom->p[i]), &empty_i, max);
4531 res = isl_map_union_disjoint(res, res_i);
4532 *empty = isl_set_union_disjoint(*empty, empty_i);
4536 isl_basic_map_free(bmap);
4541 isl_basic_map_free(bmap);
4545 /* Given a map "map", compute the lexicograhically minimal
4546 * (or maximal) image element for each domain element in dom.
4547 * Set *empty to those elements in dom that do not have an image element.
4549 * We first compute the lexicographically minimal or maximal element
4550 * in the first basic map. This results in a partial solution "res"
4551 * and a subset "todo" of dom that still need to be handled.
4552 * We then consider each of the remaining maps in "map" and successively
4553 * improve both "res" and "todo".
4555 * Let res^k and todo^k be the results after k steps and let i = k + 1.
4556 * Assume we are computing the lexicographical maximum.
4557 * We first intersect basic map i with a relation that maps elements
4558 * to elements that are lexicographically larger than the image elements
4559 * in res^k and the compute the maximum image element of this intersection.
4560 * The result ("better") corresponds to those image elements in basic map i
4561 * that are better than what we had before. The remainder ("keep") are the
4562 * domain elements for which the image element in res_k was better.
4563 * We also compute the lexicographical maximum of basic map i in todo^k.
4564 * res^i is the result of the operation + better + those elements in
4565 * res^k that we should keep
4566 * todo^i is the remainder of the maximum operation on todo^k.
4568 static __isl_give isl_map *isl_map_partial_lexopt(
4569 __isl_take isl_map *map, __isl_take isl_set *dom,
4570 __isl_give isl_set **empty, int max)
4573 struct isl_map *res;
4574 struct isl_set *todo;
4579 if (isl_map_fast_is_empty(map)) {
4587 res = basic_map_partial_lexopt(isl_basic_map_copy(map->p[0]),
4588 isl_set_copy(dom), &todo, max);
4590 for (i = 1; i < map->n; ++i) {
4592 struct isl_map *better;
4593 struct isl_set *keep;
4594 struct isl_map *res_i;
4595 struct isl_set *todo_i;
4596 struct isl_dim *dim = isl_map_get_dim(res);
4598 dim = isl_dim_range(dim);
4600 lt = isl_map_lex_lt(dim);
4602 lt = isl_map_lex_gt(dim);
4603 lt = isl_map_apply_range(isl_map_copy(res), lt);
4604 lt = isl_map_intersect(lt,
4605 isl_map_from_basic_map(isl_basic_map_copy(map->p[i])));
4606 better = isl_map_partial_lexopt(lt,
4607 isl_map_domain(isl_map_copy(res)),
4610 res_i = basic_map_partial_lexopt(isl_basic_map_copy(map->p[i]),
4611 todo, &todo_i, max);
4613 res = isl_map_intersect_domain(res, keep);
4614 res = isl_map_union_disjoint(res, res_i);
4615 res = isl_map_union_disjoint(res, better);
4636 __isl_give isl_map *isl_map_partial_lexmax(
4637 __isl_take isl_map *map, __isl_take isl_set *dom,
4638 __isl_give isl_set **empty)
4640 return isl_map_partial_lexopt(map, dom, empty, 1);
4643 __isl_give isl_map *isl_map_partial_lexmin(
4644 __isl_take isl_map *map, __isl_take isl_set *dom,
4645 __isl_give isl_set **empty)
4647 return isl_map_partial_lexopt(map, dom, empty, 0);
4650 __isl_give isl_set *isl_set_partial_lexmin(
4651 __isl_take isl_set *set, __isl_take isl_set *dom,
4652 __isl_give isl_set **empty)
4654 return (struct isl_set *)
4655 isl_map_partial_lexmin((struct isl_map *)set,
4659 __isl_give isl_set *isl_set_partial_lexmax(
4660 __isl_take isl_set *set, __isl_take isl_set *dom,
4661 __isl_give isl_set **empty)
4663 return (struct isl_set *)
4664 isl_map_partial_lexmax((struct isl_map *)set,
4668 __isl_give isl_map *isl_basic_map_lexopt(__isl_take isl_basic_map *bmap, int max)
4670 struct isl_basic_set *dom = NULL;
4671 struct isl_dim *dom_dim;
4675 dom_dim = isl_dim_domain(isl_dim_copy(bmap->dim));
4676 dom = isl_basic_set_universe(dom_dim);
4677 return isl_basic_map_partial_lexopt(bmap, dom, NULL, max);
4679 isl_basic_map_free(bmap);
4683 __isl_give isl_map *isl_basic_map_lexmin(__isl_take isl_basic_map *bmap)
4685 return isl_basic_map_lexopt(bmap, 0);
4688 __isl_give isl_map *isl_basic_map_lexmax(__isl_take isl_basic_map *bmap)
4690 return isl_basic_map_lexopt(bmap, 1);
4693 __isl_give isl_set *isl_basic_set_lexmin(__isl_take isl_basic_set *bset)
4695 return (isl_set *)isl_basic_map_lexmin((isl_basic_map *)bset);
4698 __isl_give isl_set *isl_basic_set_lexmax(__isl_take isl_basic_set *bset)
4700 return (isl_set *)isl_basic_map_lexmax((isl_basic_map *)bset);
4703 __isl_give isl_map *isl_map_lexopt(__isl_take isl_map *map, int max)
4705 struct isl_set *dom = NULL;
4706 struct isl_dim *dom_dim;
4710 dom_dim = isl_dim_domain(isl_dim_copy(map->dim));
4711 dom = isl_set_universe(dom_dim);
4712 return isl_map_partial_lexopt(map, dom, NULL, max);
4718 __isl_give isl_map *isl_map_lexmin(__isl_take isl_map *map)
4720 return isl_map_lexopt(map, 0);
4723 __isl_give isl_map *isl_map_lexmax(__isl_take isl_map *map)
4725 return isl_map_lexopt(map, 1);
4728 __isl_give isl_set *isl_set_lexmin(__isl_take isl_set *set)
4730 return (isl_set *)isl_map_lexmin((isl_map *)set);
4733 __isl_give isl_set *isl_set_lexmax(__isl_take isl_set *set)
4735 return (isl_set *)isl_map_lexmax((isl_map *)set);
4738 /* Apply a preimage specified by "mat" on the parameters of "bset".
4739 * bset is assumed to have only parameters and divs.
4741 static struct isl_basic_set *basic_set_parameter_preimage(
4742 struct isl_basic_set *bset, struct isl_mat *mat)
4749 bset->dim = isl_dim_cow(bset->dim);
4753 nparam = isl_basic_set_dim(bset, isl_dim_param);
4755 isl_assert(bset->ctx, mat->n_row == 1 + nparam, goto error);
4757 bset->dim->nparam = 0;
4758 bset->dim->n_out = nparam;
4759 bset = isl_basic_set_preimage(bset, mat);
4761 bset->dim->nparam = bset->dim->n_out;
4762 bset->dim->n_out = 0;
4767 isl_basic_set_free(bset);
4771 /* Apply a preimage specified by "mat" on the parameters of "set".
4772 * set is assumed to have only parameters and divs.
4774 static struct isl_set *set_parameter_preimage(
4775 struct isl_set *set, struct isl_mat *mat)
4777 struct isl_dim *dim = NULL;
4783 dim = isl_dim_copy(set->dim);
4784 dim = isl_dim_cow(dim);
4788 nparam = isl_set_dim(set, isl_dim_param);
4790 isl_assert(set->ctx, mat->n_row == 1 + nparam, goto error);
4793 dim->n_out = nparam;
4794 isl_set_reset_dim(set, dim);
4795 set = isl_set_preimage(set, mat);
4798 dim = isl_dim_copy(set->dim);
4799 dim = isl_dim_cow(dim);
4802 dim->nparam = dim->n_out;
4804 isl_set_reset_dim(set, dim);
4814 /* Intersect the basic set "bset" with the affine space specified by the
4815 * equalities in "eq".
4817 static struct isl_basic_set *basic_set_append_equalities(
4818 struct isl_basic_set *bset, struct isl_mat *eq)
4826 bset = isl_basic_set_extend_dim(bset, isl_dim_copy(bset->dim), 0,
4831 len = 1 + isl_dim_total(bset->dim) + bset->extra;
4832 for (i = 0; i < eq->n_row; ++i) {
4833 k = isl_basic_set_alloc_equality(bset);
4836 isl_seq_cpy(bset->eq[k], eq->row[i], eq->n_col);
4837 isl_seq_clr(bset->eq[k] + eq->n_col, len - eq->n_col);
4841 bset = isl_basic_set_gauss(bset, NULL);
4842 bset = isl_basic_set_finalize(bset);
4847 isl_basic_set_free(bset);
4851 /* Intersect the set "set" with the affine space specified by the
4852 * equalities in "eq".
4854 static struct isl_set *set_append_equalities(struct isl_set *set,
4862 for (i = 0; i < set->n; ++i) {
4863 set->p[i] = basic_set_append_equalities(set->p[i],
4876 /* Project the given basic set onto its parameter domain, possibly introducing
4877 * new, explicit, existential variables in the constraints.
4878 * The input has parameters and (possibly implicit) existential variables.
4879 * The output has the same parameters, but only
4880 * explicit existentially quantified variables.
4882 * The actual projection is performed by pip, but pip doesn't seem
4883 * to like equalities very much, so we first remove the equalities
4884 * among the parameters by performing a variable compression on
4885 * the parameters. Afterward, an inverse transformation is performed
4886 * and the equalities among the parameters are inserted back in.
4888 static struct isl_set *parameter_compute_divs(struct isl_basic_set *bset)
4892 struct isl_mat *T, *T2;
4893 struct isl_set *set;
4894 unsigned nparam, n_div;
4896 bset = isl_basic_set_cow(bset);
4900 if (bset->n_eq == 0)
4901 return isl_basic_set_lexmin(bset);
4903 isl_basic_set_gauss(bset, NULL);
4905 nparam = isl_basic_set_dim(bset, isl_dim_param);
4906 n_div = isl_basic_set_dim(bset, isl_dim_div);
4908 for (i = 0, j = n_div - 1; i < bset->n_eq && j >= 0; --j) {
4909 if (!isl_int_is_zero(bset->eq[i][1 + nparam + j]))
4912 if (i == bset->n_eq)
4913 return isl_basic_set_lexmin(bset);
4915 eq = isl_mat_sub_alloc(bset->ctx, bset->eq, i, bset->n_eq - i,
4917 eq = isl_mat_cow(eq);
4918 T = isl_mat_variable_compression(isl_mat_copy(eq), &T2);
4919 if (T && T->n_col == 0) {
4923 bset = isl_basic_set_set_to_empty(bset);
4924 return isl_set_from_basic_set(bset);
4926 bset = basic_set_parameter_preimage(bset, T);
4928 set = isl_basic_set_lexmin(bset);
4929 set = set_parameter_preimage(set, T2);
4930 set = set_append_equalities(set, eq);
4934 /* Compute an explicit representation for all the existentially
4935 * quantified variables.
4936 * The input and output dimensions are first turned into parameters.
4937 * compute_divs then returns a map with the same parameters and
4938 * no input or output dimensions and the dimension specification
4939 * is reset to that of the input.
4941 static struct isl_map *compute_divs(struct isl_basic_map *bmap)
4943 struct isl_basic_set *bset;
4944 struct isl_set *set;
4945 struct isl_map *map;
4946 struct isl_dim *dim, *orig_dim = NULL;
4951 bmap = isl_basic_map_cow(bmap);
4955 nparam = isl_basic_map_dim(bmap, isl_dim_param);
4956 n_in = isl_basic_map_dim(bmap, isl_dim_in);
4957 n_out = isl_basic_map_dim(bmap, isl_dim_out);
4958 dim = isl_dim_set_alloc(bmap->ctx, nparam + n_in + n_out, 0);
4962 orig_dim = bmap->dim;
4964 bset = (struct isl_basic_set *)bmap;
4966 set = parameter_compute_divs(bset);
4967 map = (struct isl_map *)set;
4968 map = isl_map_reset_dim(map, orig_dim);
4972 isl_basic_map_free(bmap);
4976 static int basic_map_divs_known(__isl_keep isl_basic_map *bmap)
4984 off = isl_dim_total(bmap->dim);
4985 for (i = 0; i < bmap->n_div; ++i) {
4986 if (isl_int_is_zero(bmap->div[i][0]))
4988 isl_assert(bmap->ctx, isl_int_is_zero(bmap->div[i][1+1+off+i]),
4994 static int map_divs_known(__isl_keep isl_map *map)
5001 for (i = 0; i < map->n; ++i) {
5002 int known = basic_map_divs_known(map->p[i]);
5010 /* If bmap contains any unknown divs, then compute explicit
5011 * expressions for them. However, this computation may be
5012 * quite expensive, so first try to remove divs that aren't
5015 struct isl_map *isl_basic_map_compute_divs(struct isl_basic_map *bmap)
5019 struct isl_map *map;
5021 known = basic_map_divs_known(bmap);
5025 return isl_map_from_basic_map(bmap);
5027 bmap = isl_basic_map_drop_redundant_divs(bmap);
5029 known = basic_map_divs_known(bmap);
5033 return isl_map_from_basic_map(bmap);
5035 map = compute_divs(bmap);
5038 isl_basic_map_free(bmap);
5042 struct isl_map *isl_map_compute_divs(struct isl_map *map)
5046 struct isl_map *res;
5053 known = map_divs_known(map);
5061 res = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[0]));
5062 for (i = 1 ; i < map->n; ++i) {
5064 r2 = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[i]));
5065 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT))
5066 res = isl_map_union_disjoint(res, r2);
5068 res = isl_map_union(res, r2);
5075 struct isl_set *isl_basic_set_compute_divs(struct isl_basic_set *bset)
5077 return (struct isl_set *)
5078 isl_basic_map_compute_divs((struct isl_basic_map *)bset);
5081 struct isl_set *isl_set_compute_divs(struct isl_set *set)
5083 return (struct isl_set *)
5084 isl_map_compute_divs((struct isl_map *)set);
5087 struct isl_set *isl_map_domain(struct isl_map *map)
5090 struct isl_set *set;
5095 map = isl_map_cow(map);
5099 set = (struct isl_set *)map;
5100 set->dim = isl_dim_domain(set->dim);
5103 for (i = 0; i < map->n; ++i) {
5104 set->p[i] = isl_basic_map_domain(map->p[i]);
5108 ISL_F_CLR(set, ISL_MAP_DISJOINT);
5109 ISL_F_CLR(set, ISL_SET_NORMALIZED);
5116 struct isl_map *isl_map_union_disjoint(
5117 struct isl_map *map1, struct isl_map *map2)
5121 struct isl_map *map = NULL;
5135 isl_assert(map1->ctx, isl_dim_equal(map1->dim, map2->dim), goto error);
5137 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
5138 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
5139 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
5141 map = isl_map_alloc_dim(isl_dim_copy(map1->dim),
5142 map1->n + map2->n, flags);
5145 for (i = 0; i < map1->n; ++i) {
5146 map = isl_map_add_basic_map(map,
5147 isl_basic_map_copy(map1->p[i]));
5151 for (i = 0; i < map2->n; ++i) {
5152 map = isl_map_add_basic_map(map,
5153 isl_basic_map_copy(map2->p[i]));
5167 struct isl_map *isl_map_union(struct isl_map *map1, struct isl_map *map2)
5169 map1 = isl_map_union_disjoint(map1, map2);
5173 ISL_F_CLR(map1, ISL_MAP_DISJOINT);
5177 struct isl_set *isl_set_union_disjoint(
5178 struct isl_set *set1, struct isl_set *set2)
5180 return (struct isl_set *)
5181 isl_map_union_disjoint(
5182 (struct isl_map *)set1, (struct isl_map *)set2);
5185 struct isl_set *isl_set_union(struct isl_set *set1, struct isl_set *set2)
5187 return (struct isl_set *)
5188 isl_map_union((struct isl_map *)set1, (struct isl_map *)set2);
5191 struct isl_map *isl_map_intersect_range(
5192 struct isl_map *map, struct isl_set *set)
5195 struct isl_map *result;
5201 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT) &&
5202 ISL_F_ISSET(set, ISL_MAP_DISJOINT))
5203 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
5205 result = isl_map_alloc_dim(isl_dim_copy(map->dim),
5206 map->n * set->n, flags);
5209 for (i = 0; i < map->n; ++i)
5210 for (j = 0; j < set->n; ++j) {
5211 result = isl_map_add_basic_map(result,
5212 isl_basic_map_intersect_range(
5213 isl_basic_map_copy(map->p[i]),
5214 isl_basic_set_copy(set->p[j])));
5227 struct isl_map *isl_map_intersect_domain(
5228 struct isl_map *map, struct isl_set *set)
5230 return isl_map_reverse(
5231 isl_map_intersect_range(isl_map_reverse(map), set));
5234 struct isl_map *isl_map_apply_domain(
5235 struct isl_map *map1, struct isl_map *map2)
5239 map1 = isl_map_reverse(map1);
5240 map1 = isl_map_apply_range(map1, map2);
5241 return isl_map_reverse(map1);
5248 struct isl_map *isl_map_apply_range(
5249 struct isl_map *map1, struct isl_map *map2)
5251 struct isl_dim *dim_result;
5252 struct isl_map *result;
5258 dim_result = isl_dim_join(isl_dim_copy(map1->dim),
5259 isl_dim_copy(map2->dim));
5261 result = isl_map_alloc_dim(dim_result, map1->n * map2->n, 0);
5264 for (i = 0; i < map1->n; ++i)
5265 for (j = 0; j < map2->n; ++j) {
5266 result = isl_map_add_basic_map(result,
5267 isl_basic_map_apply_range(
5268 isl_basic_map_copy(map1->p[i]),
5269 isl_basic_map_copy(map2->p[j])));
5275 if (result && result->n <= 1)
5276 ISL_F_SET(result, ISL_MAP_DISJOINT);
5285 * returns range - domain
5287 struct isl_basic_set *isl_basic_map_deltas(struct isl_basic_map *bmap)
5289 isl_dim *dims, *target_dim;
5290 struct isl_basic_set *bset;
5297 isl_assert(bmap->ctx, isl_dim_tuple_match(bmap->dim, isl_dim_in,
5298 bmap->dim, isl_dim_out),
5300 target_dim = isl_dim_domain(isl_basic_map_get_dim(bmap));
5301 dim = isl_basic_map_n_in(bmap);
5302 nparam = isl_basic_map_n_param(bmap);
5303 bset = isl_basic_set_from_basic_map(bmap);
5304 bset = isl_basic_set_cow(bset);
5305 dims = isl_basic_set_get_dim(bset);
5306 dims = isl_dim_add(dims, isl_dim_set, dim);
5307 bset = isl_basic_set_extend_dim(bset, dims, 0, dim, 0);
5308 bset = isl_basic_set_swap_vars(bset, 2*dim);
5309 for (i = 0; i < dim; ++i) {
5310 int j = isl_basic_map_alloc_equality(
5311 (struct isl_basic_map *)bset);
5314 isl_seq_clr(bset->eq[j], 1 + isl_basic_set_total_dim(bset));
5315 isl_int_set_si(bset->eq[j][1+nparam+i], 1);
5316 isl_int_set_si(bset->eq[j][1+nparam+dim+i], 1);
5317 isl_int_set_si(bset->eq[j][1+nparam+2*dim+i], -1);
5319 bset = isl_basic_set_project_out(bset, isl_dim_set, dim, 2*dim);
5320 bset = isl_basic_set_reset_dim(bset, target_dim);
5323 isl_basic_map_free(bmap);
5328 * returns range - domain
5330 struct isl_set *isl_map_deltas(struct isl_map *map)
5334 struct isl_set *result;
5339 isl_assert(map->ctx, isl_dim_tuple_match(map->dim, isl_dim_in,
5340 map->dim, isl_dim_out),
5342 dim = isl_map_get_dim(map);
5343 dim = isl_dim_domain(dim);
5344 result = isl_set_alloc_dim(dim, map->n, map->flags);
5347 for (i = 0; i < map->n; ++i)
5348 result = isl_set_add_basic_set(result,
5349 isl_basic_map_deltas(isl_basic_map_copy(map->p[i])));
5357 static struct isl_basic_map *basic_map_identity(struct isl_dim *dims)
5359 struct isl_basic_map *bmap;
5367 nparam = dims->nparam;
5369 bmap = isl_basic_map_alloc_dim(dims, 0, dim, 0);
5373 for (i = 0; i < dim; ++i) {
5374 int j = isl_basic_map_alloc_equality(bmap);
5377 isl_seq_clr(bmap->eq[j], 1 + isl_basic_map_total_dim(bmap));
5378 isl_int_set_si(bmap->eq[j][1+nparam+i], 1);
5379 isl_int_set_si(bmap->eq[j][1+nparam+dim+i], -1);
5381 return isl_basic_map_finalize(bmap);
5383 isl_basic_map_free(bmap);
5387 struct isl_basic_map *isl_basic_map_identity(struct isl_dim *set_dim)
5389 struct isl_dim *dim = isl_dim_map(set_dim);
5392 return basic_map_identity(dim);
5395 struct isl_basic_map *isl_basic_map_identity_like(struct isl_basic_map *model)
5397 if (!model || !model->dim)
5399 isl_assert(model->ctx,
5400 model->dim->n_in == model->dim->n_out, return NULL);
5401 return basic_map_identity(isl_dim_copy(model->dim));
5404 static struct isl_map *map_identity(struct isl_dim *dim)
5406 struct isl_map *map = isl_map_alloc_dim(dim, 1, ISL_MAP_DISJOINT);
5407 return isl_map_add_basic_map(map, basic_map_identity(isl_dim_copy(dim)));
5410 struct isl_map *isl_map_identity(struct isl_dim *set_dim)
5412 struct isl_dim *dim = isl_dim_map(set_dim);
5415 return map_identity(dim);
5418 struct isl_map *isl_map_identity_like(struct isl_map *model)
5420 if (!model || !model->dim)
5422 isl_assert(model->ctx,
5423 model->dim->n_in == model->dim->n_out, return NULL);
5424 return map_identity(isl_dim_copy(model->dim));
5427 struct isl_map *isl_map_identity_like_basic_map(struct isl_basic_map *model)
5429 if (!model || !model->dim)
5431 isl_assert(model->ctx,
5432 model->dim->n_in == model->dim->n_out, return NULL);
5433 return map_identity(isl_dim_copy(model->dim));
5436 /* Construct a basic set with all set dimensions having only non-negative
5439 struct isl_basic_set *isl_basic_set_positive_orthant(struct isl_dim *dims)
5444 struct isl_basic_set *bset;
5448 nparam = dims->nparam;
5450 bset = isl_basic_set_alloc_dim(dims, 0, 0, dim);
5453 for (i = 0; i < dim; ++i) {
5454 int k = isl_basic_set_alloc_inequality(bset);
5457 isl_seq_clr(bset->ineq[k], 1 + isl_basic_set_total_dim(bset));
5458 isl_int_set_si(bset->ineq[k][1 + nparam + i], 1);
5462 isl_basic_set_free(bset);
5466 __isl_give isl_set *isl_set_split_dims(__isl_take isl_set *set,
5467 enum isl_dim_type type, unsigned first, unsigned n)
5470 isl_basic_set *nonneg = NULL;
5471 isl_basic_set *neg = NULL;
5478 isl_assert(set->ctx, first + n <= isl_set_dim(set, type), goto error);
5480 for (i = 0; i < n; ++i) {
5484 nonneg = isl_basic_set_alloc_dim(isl_set_get_dim(set), 0, 0, 1);
5485 k = isl_basic_set_alloc_inequality(nonneg);
5488 isl_seq_clr(nonneg->ineq[k], 1 + isl_basic_set_total_dim(nonneg));
5489 isl_int_set_si(nonneg->ineq[k][pos(set->dim, type) + first + i], 1);
5491 neg = isl_basic_set_alloc_dim(isl_set_get_dim(set), 0, 0, 1);
5492 k = isl_basic_set_alloc_inequality(neg);
5495 isl_seq_clr(neg->ineq[k], 1 + isl_basic_set_total_dim(neg));
5496 isl_int_set_si(neg->ineq[k][0], -1);
5497 isl_int_set_si(neg->ineq[k][pos(set->dim, type) + first + i], -1);
5499 set = isl_set_intersect(set, isl_basic_set_union(nonneg, neg));
5504 isl_basic_set_free(nonneg);
5505 isl_basic_set_free(neg);
5510 int isl_set_is_equal(struct isl_set *set1, struct isl_set *set2)
5512 return isl_map_is_equal((struct isl_map *)set1, (struct isl_map *)set2);
5515 int isl_basic_map_is_subset(
5516 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
5519 struct isl_map *map1;
5520 struct isl_map *map2;
5522 if (!bmap1 || !bmap2)
5525 map1 = isl_map_from_basic_map(isl_basic_map_copy(bmap1));
5526 map2 = isl_map_from_basic_map(isl_basic_map_copy(bmap2));
5528 is_subset = isl_map_is_subset(map1, map2);
5536 int isl_basic_map_is_equal(
5537 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
5541 if (!bmap1 || !bmap2)
5543 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
5546 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
5550 int isl_basic_set_is_equal(
5551 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
5553 return isl_basic_map_is_equal(
5554 (struct isl_basic_map *)bset1, (struct isl_basic_map *)bset2);
5557 int isl_map_is_empty(struct isl_map *map)
5564 for (i = 0; i < map->n; ++i) {
5565 is_empty = isl_basic_map_is_empty(map->p[i]);
5574 int isl_map_fast_is_empty(struct isl_map *map)
5576 return map ? map->n == 0 : -1;
5579 int isl_set_fast_is_empty(struct isl_set *set)
5581 return set ? set->n == 0 : -1;
5584 int isl_set_is_empty(struct isl_set *set)
5586 return isl_map_is_empty((struct isl_map *)set);
5589 int isl_map_has_equal_dim(__isl_keep isl_map *map1, __isl_keep isl_map *map2)
5594 return isl_dim_equal(map1->dim, map2->dim);
5597 int isl_set_has_equal_dim(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
5602 return isl_dim_equal(set1->dim, set2->dim);
5605 int isl_map_is_equal(struct isl_map *map1, struct isl_map *map2)
5611 is_subset = isl_map_is_subset(map1, map2);
5614 is_subset = isl_map_is_subset(map2, map1);
5618 int isl_basic_map_is_strict_subset(
5619 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
5623 if (!bmap1 || !bmap2)
5625 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
5628 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
5629 if (is_subset == -1)
5634 int isl_map_is_strict_subset(struct isl_map *map1, struct isl_map *map2)
5640 is_subset = isl_map_is_subset(map1, map2);
5643 is_subset = isl_map_is_subset(map2, map1);
5644 if (is_subset == -1)
5649 int isl_set_is_strict_subset(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
5651 return isl_map_is_strict_subset((isl_map *)set1, (isl_map *)set2);
5654 int isl_basic_map_is_universe(struct isl_basic_map *bmap)
5658 return bmap->n_eq == 0 && bmap->n_ineq == 0;
5661 int isl_basic_set_is_universe(struct isl_basic_set *bset)
5665 return bset->n_eq == 0 && bset->n_ineq == 0;
5668 int isl_map_fast_is_universe(__isl_keep isl_map *map)
5675 for (i = 0; i < map->n; ++i) {
5676 int r = isl_basic_map_is_universe(map->p[i]);
5684 int isl_set_fast_is_universe(__isl_keep isl_set *set)
5686 return isl_map_fast_is_universe((isl_map *) set);
5689 int isl_basic_map_is_empty(struct isl_basic_map *bmap)
5691 struct isl_basic_set *bset = NULL;
5692 struct isl_vec *sample = NULL;
5699 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY))
5702 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL)) {
5703 struct isl_basic_map *copy = isl_basic_map_copy(bmap);
5704 copy = isl_basic_map_remove_redundancies(copy);
5705 empty = ISL_F_ISSET(copy, ISL_BASIC_MAP_EMPTY);
5706 isl_basic_map_free(copy);
5710 total = 1 + isl_basic_map_total_dim(bmap);
5711 if (bmap->sample && bmap->sample->size == total) {
5712 int contains = isl_basic_map_contains(bmap, bmap->sample);
5718 isl_vec_free(bmap->sample);
5719 bmap->sample = NULL;
5720 bset = isl_basic_map_underlying_set(isl_basic_map_copy(bmap));
5723 sample = isl_basic_set_sample_vec(bset);
5726 empty = sample->size == 0;
5727 isl_vec_free(bmap->sample);
5728 bmap->sample = sample;
5730 ISL_F_SET(bmap, ISL_BASIC_MAP_EMPTY);
5735 int isl_basic_map_fast_is_empty(struct isl_basic_map *bmap)
5739 return ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY);
5742 int isl_basic_set_fast_is_empty(struct isl_basic_set *bset)
5746 return ISL_F_ISSET(bset, ISL_BASIC_SET_EMPTY);
5749 int isl_basic_set_is_empty(struct isl_basic_set *bset)
5751 return isl_basic_map_is_empty((struct isl_basic_map *)bset);
5754 struct isl_map *isl_basic_map_union(
5755 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
5757 struct isl_map *map;
5758 if (!bmap1 || !bmap2)
5761 isl_assert(bmap1->ctx, isl_dim_equal(bmap1->dim, bmap2->dim), goto error);
5763 map = isl_map_alloc_dim(isl_dim_copy(bmap1->dim), 2, 0);
5766 map = isl_map_add_basic_map(map, bmap1);
5767 map = isl_map_add_basic_map(map, bmap2);
5770 isl_basic_map_free(bmap1);
5771 isl_basic_map_free(bmap2);
5775 struct isl_set *isl_basic_set_union(
5776 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
5778 return (struct isl_set *)isl_basic_map_union(
5779 (struct isl_basic_map *)bset1,
5780 (struct isl_basic_map *)bset2);
5783 /* Order divs such that any div only depends on previous divs */
5784 struct isl_basic_map *isl_basic_map_order_divs(struct isl_basic_map *bmap)
5792 off = isl_dim_total(bmap->dim);
5794 for (i = 0; i < bmap->n_div; ++i) {
5796 if (isl_int_is_zero(bmap->div[i][0]))
5798 pos = isl_seq_first_non_zero(bmap->div[i]+1+1+off+i,
5802 isl_basic_map_swap_div(bmap, i, i + pos);
5808 struct isl_basic_set *isl_basic_set_order_divs(struct isl_basic_set *bset)
5810 return (struct isl_basic_set *)
5811 isl_basic_map_order_divs((struct isl_basic_map *)bset);
5814 __isl_give isl_map *isl_map_order_divs(__isl_take isl_map *map)
5821 for (i = 0; i < map->n; ++i) {
5822 map->p[i] = isl_basic_map_order_divs(map->p[i]);
5833 /* Look for a div in dst that corresponds to the div "div" in src.
5834 * The divs before "div" in src and dst are assumed to be the same.
5836 * Returns -1 if no corresponding div was found and the position
5837 * of the corresponding div in dst otherwise.
5839 static int find_div(struct isl_basic_map *dst,
5840 struct isl_basic_map *src, unsigned div)
5844 unsigned total = isl_dim_total(src->dim);
5846 isl_assert(dst->ctx, div <= dst->n_div, return -1);
5847 for (i = div; i < dst->n_div; ++i)
5848 if (isl_seq_eq(dst->div[i], src->div[div], 1+1+total+div) &&
5849 isl_seq_first_non_zero(dst->div[i]+1+1+total+div,
5850 dst->n_div - div) == -1)
5855 struct isl_basic_map *isl_basic_map_align_divs(
5856 struct isl_basic_map *dst, struct isl_basic_map *src)
5859 unsigned total = isl_dim_total(src->dim);
5864 if (src->n_div == 0)
5867 for (i = 0; i < src->n_div; ++i)
5868 isl_assert(src->ctx, !isl_int_is_zero(src->div[i][0]), goto error);
5870 src = isl_basic_map_order_divs(src);
5871 dst = isl_basic_map_cow(dst);
5872 dst = isl_basic_map_extend_dim(dst, isl_dim_copy(dst->dim),
5873 src->n_div, 0, 2 * src->n_div);
5876 for (i = 0; i < src->n_div; ++i) {
5877 int j = find_div(dst, src, i);
5879 j = isl_basic_map_alloc_div(dst);
5882 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total+i);
5883 isl_seq_clr(dst->div[j]+1+1+total+i, dst->n_div - i);
5884 if (isl_basic_map_add_div_constraints(dst, j) < 0)
5888 isl_basic_map_swap_div(dst, i, j);
5892 isl_basic_map_free(dst);
5896 struct isl_basic_set *isl_basic_set_align_divs(
5897 struct isl_basic_set *dst, struct isl_basic_set *src)
5899 return (struct isl_basic_set *)isl_basic_map_align_divs(
5900 (struct isl_basic_map *)dst, (struct isl_basic_map *)src);
5903 struct isl_map *isl_map_align_divs(struct isl_map *map)
5911 map = isl_map_compute_divs(map);
5912 map = isl_map_cow(map);
5916 for (i = 1; i < map->n; ++i)
5917 map->p[0] = isl_basic_map_align_divs(map->p[0], map->p[i]);
5918 for (i = 1; i < map->n; ++i)
5919 map->p[i] = isl_basic_map_align_divs(map->p[i], map->p[0]);
5921 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
5925 struct isl_set *isl_set_align_divs(struct isl_set *set)
5927 return (struct isl_set *)isl_map_align_divs((struct isl_map *)set);
5930 struct isl_set *isl_set_apply(struct isl_set *set, struct isl_map *map)
5934 isl_assert(set->ctx, isl_map_compatible_domain(map, set), goto error);
5935 map = isl_map_intersect_domain(map, set);
5936 set = isl_map_range(map);
5944 /* There is no need to cow as removing empty parts doesn't change
5945 * the meaning of the set.
5947 struct isl_map *isl_map_remove_empty_parts(struct isl_map *map)
5954 for (i = map->n-1; i >= 0; --i) {
5955 if (!ISL_F_ISSET(map->p[i], ISL_BASIC_MAP_EMPTY))
5957 isl_basic_map_free(map->p[i]);
5958 if (i != map->n-1) {
5959 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
5960 map->p[i] = map->p[map->n-1];
5968 struct isl_set *isl_set_remove_empty_parts(struct isl_set *set)
5970 return (struct isl_set *)
5971 isl_map_remove_empty_parts((struct isl_map *)set);
5974 struct isl_basic_map *isl_map_copy_basic_map(struct isl_map *map)
5976 struct isl_basic_map *bmap;
5977 if (!map || map->n == 0)
5979 bmap = map->p[map->n-1];
5980 isl_assert(map->ctx, ISL_F_ISSET(bmap, ISL_BASIC_SET_FINAL), return NULL);
5981 return isl_basic_map_copy(bmap);
5984 struct isl_basic_set *isl_set_copy_basic_set(struct isl_set *set)
5986 return (struct isl_basic_set *)
5987 isl_map_copy_basic_map((struct isl_map *)set);
5990 __isl_give isl_map *isl_map_drop_basic_map(__isl_take isl_map *map,
5991 __isl_keep isl_basic_map *bmap)
5997 for (i = map->n-1; i >= 0; --i) {
5998 if (map->p[i] != bmap)
6000 map = isl_map_cow(map);
6003 isl_basic_map_free(map->p[i]);
6004 if (i != map->n-1) {
6005 ISL_F_CLR(map, ISL_SET_NORMALIZED);
6006 map->p[i] = map->p[map->n-1];
6017 struct isl_set *isl_set_drop_basic_set(struct isl_set *set,
6018 struct isl_basic_set *bset)
6020 return (struct isl_set *)isl_map_drop_basic_map((struct isl_map *)set,
6021 (struct isl_basic_map *)bset);
6024 /* Given two basic sets bset1 and bset2, compute the maximal difference
6025 * between the values of dimension pos in bset1 and those in bset2
6026 * for any common value of the parameters and dimensions preceding pos.
6028 static enum isl_lp_result basic_set_maximal_difference_at(
6029 __isl_keep isl_basic_set *bset1, __isl_keep isl_basic_set *bset2,
6030 int pos, isl_int *opt)
6032 struct isl_dim *dims;
6033 struct isl_basic_map *bmap1 = NULL;
6034 struct isl_basic_map *bmap2 = NULL;
6035 struct isl_ctx *ctx;
6036 struct isl_vec *obj;
6039 unsigned dim1, dim2;
6040 enum isl_lp_result res;
6042 if (!bset1 || !bset2)
6043 return isl_lp_error;
6045 nparam = isl_basic_set_n_param(bset1);
6046 dim1 = isl_basic_set_n_dim(bset1);
6047 dim2 = isl_basic_set_n_dim(bset2);
6048 dims = isl_dim_alloc(bset1->ctx, nparam, pos, dim1 - pos);
6049 bmap1 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset1), dims);
6050 dims = isl_dim_alloc(bset2->ctx, nparam, pos, dim2 - pos);
6051 bmap2 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset2), dims);
6052 if (!bmap1 || !bmap2)
6054 bmap1 = isl_basic_map_cow(bmap1);
6055 bmap1 = isl_basic_map_extend(bmap1, nparam,
6056 pos, (dim1 - pos) + (dim2 - pos),
6057 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
6058 bmap1 = add_constraints(bmap1, bmap2, 0, dim1 - pos);
6061 total = isl_basic_map_total_dim(bmap1);
6063 obj = isl_vec_alloc(ctx, 1 + total);
6064 isl_seq_clr(obj->block.data, 1 + total);
6065 isl_int_set_si(obj->block.data[1+nparam+pos], 1);
6066 isl_int_set_si(obj->block.data[1+nparam+pos+(dim1-pos)], -1);
6069 res = isl_basic_map_solve_lp(bmap1, 1, obj->block.data, ctx->one,
6071 isl_basic_map_free(bmap1);
6075 isl_basic_map_free(bmap1);
6076 isl_basic_map_free(bmap2);
6077 return isl_lp_error;
6080 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
6081 * for any common value of the parameters and dimensions preceding pos
6082 * in both basic sets, the values of dimension pos in bset1 are
6083 * smaller or larger than those in bset2.
6086 * 1 if bset1 follows bset2
6087 * -1 if bset1 precedes bset2
6088 * 0 if bset1 and bset2 are incomparable
6089 * -2 if some error occurred.
6091 int isl_basic_set_compare_at(struct isl_basic_set *bset1,
6092 struct isl_basic_set *bset2, int pos)
6095 enum isl_lp_result res;
6100 res = basic_set_maximal_difference_at(bset1, bset2, pos, &opt);
6102 if (res == isl_lp_empty)
6104 else if ((res == isl_lp_ok && isl_int_is_pos(opt)) ||
6105 res == isl_lp_unbounded)
6107 else if (res == isl_lp_ok && isl_int_is_neg(opt))
6116 /* Given two basic sets bset1 and bset2, check whether
6117 * for any common value of the parameters and dimensions preceding pos
6118 * there is a value of dimension pos in bset1 that is larger
6119 * than a value of the same dimension in bset2.
6122 * 1 if there exists such a pair
6123 * 0 if there is no such pair, but there is a pair of equal values
6125 * -2 if some error occurred.
6127 int isl_basic_set_follows_at(__isl_keep isl_basic_set *bset1,
6128 __isl_keep isl_basic_set *bset2, int pos)
6131 enum isl_lp_result res;
6136 res = basic_set_maximal_difference_at(bset1, bset2, pos, &opt);
6138 if (res == isl_lp_empty)
6140 else if ((res == isl_lp_ok && isl_int_is_pos(opt)) ||
6141 res == isl_lp_unbounded)
6143 else if (res == isl_lp_ok && isl_int_is_neg(opt))
6145 else if (res == isl_lp_ok)
6154 /* Given two sets set1 and set2, check whether
6155 * for any common value of the parameters and dimensions preceding pos
6156 * there is a value of dimension pos in set1 that is larger
6157 * than a value of the same dimension in set2.
6160 * 1 if there exists such a pair
6161 * 0 if there is no such pair, but there is a pair of equal values
6163 * -2 if some error occurred.
6165 int isl_set_follows_at(__isl_keep isl_set *set1,
6166 __isl_keep isl_set *set2, int pos)
6174 for (i = 0; i < set1->n; ++i)
6175 for (j = 0; j < set2->n; ++j) {
6177 f = isl_basic_set_follows_at(set1->p[i], set2->p[j], pos);
6178 if (f == 1 || f == -2)
6187 static int isl_basic_map_fast_has_fixed_var(struct isl_basic_map *bmap,
6188 unsigned pos, isl_int *val)
6196 total = isl_basic_map_total_dim(bmap);
6197 for (i = 0, d = total-1; i < bmap->n_eq && d+1 > pos; ++i) {
6198 for (; d+1 > pos; --d)
6199 if (!isl_int_is_zero(bmap->eq[i][1+d]))
6203 if (isl_seq_first_non_zero(bmap->eq[i]+1, d) != -1)
6205 if (isl_seq_first_non_zero(bmap->eq[i]+1+d+1, total-d-1) != -1)
6207 if (!isl_int_is_one(bmap->eq[i][1+d]))
6210 isl_int_neg(*val, bmap->eq[i][0]);
6216 static int isl_map_fast_has_fixed_var(struct isl_map *map,
6217 unsigned pos, isl_int *val)
6229 return isl_basic_map_fast_has_fixed_var(map->p[0], pos, val);
6232 fixed = isl_basic_map_fast_has_fixed_var(map->p[0], pos, &v);
6233 for (i = 1; fixed == 1 && i < map->n; ++i) {
6234 fixed = isl_basic_map_fast_has_fixed_var(map->p[i], pos, &tmp);
6235 if (fixed == 1 && isl_int_ne(tmp, v))
6239 isl_int_set(*val, v);
6245 static int isl_basic_set_fast_has_fixed_var(struct isl_basic_set *bset,
6246 unsigned pos, isl_int *val)
6248 return isl_basic_map_fast_has_fixed_var((struct isl_basic_map *)bset,
6252 static int isl_set_fast_has_fixed_var(struct isl_set *set, unsigned pos,
6255 return isl_map_fast_has_fixed_var((struct isl_map *)set, pos, val);
6258 int isl_basic_map_fast_is_fixed(struct isl_basic_map *bmap,
6259 enum isl_dim_type type, unsigned pos, isl_int *val)
6261 if (pos >= isl_basic_map_dim(bmap, type))
6263 return isl_basic_map_fast_has_fixed_var(bmap,
6264 isl_basic_map_offset(bmap, type) - 1 + pos, val);
6267 int isl_map_fast_is_fixed(struct isl_map *map,
6268 enum isl_dim_type type, unsigned pos, isl_int *val)
6270 if (pos >= isl_map_dim(map, type))
6272 return isl_map_fast_has_fixed_var(map,
6273 map_offset(map, type) - 1 + pos, val);
6276 /* Check if dimension dim has fixed value and if so and if val is not NULL,
6277 * then return this fixed value in *val.
6279 int isl_basic_set_fast_dim_is_fixed(struct isl_basic_set *bset, unsigned dim,
6282 return isl_basic_set_fast_has_fixed_var(bset,
6283 isl_basic_set_n_param(bset) + dim, val);
6286 /* Check if dimension dim has fixed value and if so and if val is not NULL,
6287 * then return this fixed value in *val.
6289 int isl_set_fast_dim_is_fixed(struct isl_set *set, unsigned dim, isl_int *val)
6291 return isl_set_fast_has_fixed_var(set, isl_set_n_param(set) + dim, val);
6294 /* Check if input variable in has fixed value and if so and if val is not NULL,
6295 * then return this fixed value in *val.
6297 int isl_map_fast_input_is_fixed(struct isl_map *map, unsigned in, isl_int *val)
6299 return isl_map_fast_has_fixed_var(map, isl_map_n_param(map) + in, val);
6302 /* Check if dimension dim has an (obvious) fixed lower bound and if so
6303 * and if val is not NULL, then return this lower bound in *val.
6305 int isl_basic_set_fast_dim_has_fixed_lower_bound(struct isl_basic_set *bset,
6306 unsigned dim, isl_int *val)
6308 int i, i_eq = -1, i_ineq = -1;
6315 total = isl_basic_set_total_dim(bset);
6316 nparam = isl_basic_set_n_param(bset);
6317 for (i = 0; i < bset->n_eq; ++i) {
6318 if (isl_int_is_zero(bset->eq[i][1+nparam+dim]))
6324 for (i = 0; i < bset->n_ineq; ++i) {
6325 if (!isl_int_is_pos(bset->ineq[i][1+nparam+dim]))
6327 if (i_eq != -1 || i_ineq != -1)
6331 if (i_eq == -1 && i_ineq == -1)
6333 c = i_eq != -1 ? bset->eq[i_eq] : bset->ineq[i_ineq];
6334 /* The coefficient should always be one due to normalization. */
6335 if (!isl_int_is_one(c[1+nparam+dim]))
6337 if (isl_seq_first_non_zero(c+1, nparam+dim) != -1)
6339 if (isl_seq_first_non_zero(c+1+nparam+dim+1,
6340 total - nparam - dim - 1) != -1)
6343 isl_int_neg(*val, c[0]);
6347 int isl_set_fast_dim_has_fixed_lower_bound(struct isl_set *set,
6348 unsigned dim, isl_int *val)
6360 return isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[0],
6364 fixed = isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[0],
6366 for (i = 1; fixed == 1 && i < set->n; ++i) {
6367 fixed = isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[i],
6369 if (fixed == 1 && isl_int_ne(tmp, v))
6373 isl_int_set(*val, v);
6384 static int qsort_constraint_cmp(const void *p1, const void *p2)
6386 const struct constraint *c1 = (const struct constraint *)p1;
6387 const struct constraint *c2 = (const struct constraint *)p2;
6388 unsigned size = isl_min(c1->size, c2->size);
6389 return isl_seq_cmp(c1->c, c2->c, size);
6392 static struct isl_basic_map *isl_basic_map_sort_constraints(
6393 struct isl_basic_map *bmap)
6396 struct constraint *c;
6401 total = isl_basic_map_total_dim(bmap);
6402 c = isl_alloc_array(bmap->ctx, struct constraint, bmap->n_ineq);
6405 for (i = 0; i < bmap->n_ineq; ++i) {
6407 c[i].c = bmap->ineq[i];
6409 qsort(c, bmap->n_ineq, sizeof(struct constraint), qsort_constraint_cmp);
6410 for (i = 0; i < bmap->n_ineq; ++i)
6411 bmap->ineq[i] = c[i].c;
6415 isl_basic_map_free(bmap);
6419 __isl_give isl_basic_set *isl_basic_set_sort_constraints(
6420 __isl_take isl_basic_set *bset)
6422 return (struct isl_basic_set *)isl_basic_map_sort_constraints(
6423 (struct isl_basic_map *)bset);
6426 struct isl_basic_map *isl_basic_map_normalize(struct isl_basic_map *bmap)
6430 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_NORMALIZED))
6432 bmap = isl_basic_map_remove_redundancies(bmap);
6433 bmap = isl_basic_map_sort_constraints(bmap);
6434 ISL_F_SET(bmap, ISL_BASIC_MAP_NORMALIZED);
6438 struct isl_basic_set *isl_basic_set_normalize(struct isl_basic_set *bset)
6440 return (struct isl_basic_set *)isl_basic_map_normalize(
6441 (struct isl_basic_map *)bset);
6444 int isl_basic_map_fast_cmp(const __isl_keep isl_basic_map *bmap1,
6445 const __isl_keep isl_basic_map *bmap2)
6452 if (isl_basic_map_n_param(bmap1) != isl_basic_map_n_param(bmap2))
6453 return isl_basic_map_n_param(bmap1) - isl_basic_map_n_param(bmap2);
6454 if (isl_basic_map_n_in(bmap1) != isl_basic_map_n_in(bmap2))
6455 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
6456 if (isl_basic_map_n_out(bmap1) != isl_basic_map_n_out(bmap2))
6457 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
6458 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY) &&
6459 ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
6461 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY))
6463 if (ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
6465 if (bmap1->n_eq != bmap2->n_eq)
6466 return bmap1->n_eq - bmap2->n_eq;
6467 if (bmap1->n_ineq != bmap2->n_ineq)
6468 return bmap1->n_ineq - bmap2->n_ineq;
6469 if (bmap1->n_div != bmap2->n_div)
6470 return bmap1->n_div - bmap2->n_div;
6471 total = isl_basic_map_total_dim(bmap1);
6472 for (i = 0; i < bmap1->n_eq; ++i) {
6473 cmp = isl_seq_cmp(bmap1->eq[i], bmap2->eq[i], 1+total);
6477 for (i = 0; i < bmap1->n_ineq; ++i) {
6478 cmp = isl_seq_cmp(bmap1->ineq[i], bmap2->ineq[i], 1+total);
6482 for (i = 0; i < bmap1->n_div; ++i) {
6483 cmp = isl_seq_cmp(bmap1->div[i], bmap2->div[i], 1+1+total);
6490 int isl_basic_map_fast_is_equal(__isl_keep isl_basic_map *bmap1,
6491 __isl_keep isl_basic_map *bmap2)
6493 return isl_basic_map_fast_cmp(bmap1, bmap2) == 0;
6496 int isl_basic_set_fast_is_equal(__isl_keep isl_basic_set *bset1,
6497 __isl_keep isl_basic_set *bset2)
6499 return isl_basic_map_fast_is_equal((isl_basic_map *)bset1,
6500 (isl_basic_map *)bset2);
6503 static int qsort_bmap_cmp(const void *p1, const void *p2)
6505 const struct isl_basic_map *bmap1 = *(const struct isl_basic_map **)p1;
6506 const struct isl_basic_map *bmap2 = *(const struct isl_basic_map **)p2;
6508 return isl_basic_map_fast_cmp(bmap1, bmap2);
6511 /* We normalize in place, but if anything goes wrong we need
6512 * to return NULL, so we need to make sure we don't change the
6513 * meaning of any possible other copies of map.
6515 struct isl_map *isl_map_normalize(struct isl_map *map)
6518 struct isl_basic_map *bmap;
6522 if (ISL_F_ISSET(map, ISL_MAP_NORMALIZED))
6524 for (i = 0; i < map->n; ++i) {
6525 bmap = isl_basic_map_normalize(isl_basic_map_copy(map->p[i]));
6528 isl_basic_map_free(map->p[i]);
6531 qsort(map->p, map->n, sizeof(struct isl_basic_map *), qsort_bmap_cmp);
6532 ISL_F_SET(map, ISL_MAP_NORMALIZED);
6533 map = isl_map_remove_empty_parts(map);
6536 for (i = map->n - 1; i >= 1; --i) {
6537 if (!isl_basic_map_fast_is_equal(map->p[i-1], map->p[i]))
6539 isl_basic_map_free(map->p[i-1]);
6540 for (j = i; j < map->n; ++j)
6541 map->p[j-1] = map->p[j];
6551 struct isl_set *isl_set_normalize(struct isl_set *set)
6553 return (struct isl_set *)isl_map_normalize((struct isl_map *)set);
6556 int isl_map_fast_is_equal(struct isl_map *map1, struct isl_map *map2)
6566 if (!isl_dim_equal(map1->dim, map2->dim))
6569 map1 = isl_map_copy(map1);
6570 map2 = isl_map_copy(map2);
6571 map1 = isl_map_normalize(map1);
6572 map2 = isl_map_normalize(map2);
6575 equal = map1->n == map2->n;
6576 for (i = 0; equal && i < map1->n; ++i) {
6577 equal = isl_basic_map_fast_is_equal(map1->p[i], map2->p[i]);
6590 int isl_set_fast_is_equal(struct isl_set *set1, struct isl_set *set2)
6592 return isl_map_fast_is_equal((struct isl_map *)set1,
6593 (struct isl_map *)set2);
6596 /* Return an interval that ranges from min to max (inclusive)
6598 struct isl_basic_set *isl_basic_set_interval(struct isl_ctx *ctx,
6599 isl_int min, isl_int max)
6602 struct isl_basic_set *bset = NULL;
6604 bset = isl_basic_set_alloc(ctx, 0, 1, 0, 0, 2);
6608 k = isl_basic_set_alloc_inequality(bset);
6611 isl_int_set_si(bset->ineq[k][1], 1);
6612 isl_int_neg(bset->ineq[k][0], min);
6614 k = isl_basic_set_alloc_inequality(bset);
6617 isl_int_set_si(bset->ineq[k][1], -1);
6618 isl_int_set(bset->ineq[k][0], max);
6622 isl_basic_set_free(bset);
6626 /* Return the Cartesian product of the basic sets in list (in the given order).
6628 struct isl_basic_set *isl_basic_set_product(struct isl_basic_set_list *list)
6636 struct isl_basic_set *product = NULL;
6640 isl_assert(list->ctx, list->n > 0, goto error);
6641 isl_assert(list->ctx, list->p[0], goto error);
6642 nparam = isl_basic_set_n_param(list->p[0]);
6643 dim = isl_basic_set_n_dim(list->p[0]);
6644 extra = list->p[0]->n_div;
6645 n_eq = list->p[0]->n_eq;
6646 n_ineq = list->p[0]->n_ineq;
6647 for (i = 1; i < list->n; ++i) {
6648 isl_assert(list->ctx, list->p[i], goto error);
6649 isl_assert(list->ctx,
6650 nparam == isl_basic_set_n_param(list->p[i]), goto error);
6651 dim += isl_basic_set_n_dim(list->p[i]);
6652 extra += list->p[i]->n_div;
6653 n_eq += list->p[i]->n_eq;
6654 n_ineq += list->p[i]->n_ineq;
6656 product = isl_basic_set_alloc(list->ctx, nparam, dim, extra,
6661 for (i = 0; i < list->n; ++i) {
6662 isl_basic_set_add_constraints(product,
6663 isl_basic_set_copy(list->p[i]), dim);
6664 dim += isl_basic_set_n_dim(list->p[i]);
6666 isl_basic_set_list_free(list);
6669 isl_basic_set_free(product);
6670 isl_basic_set_list_free(list);
6674 struct isl_basic_map *isl_basic_map_product(
6675 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
6677 struct isl_dim *dim_result = NULL;
6678 struct isl_basic_map *bmap;
6679 unsigned in1, in2, out1, out2, nparam, total, pos;
6680 struct isl_dim_map *dim_map1, *dim_map2;
6682 if (!bmap1 || !bmap2)
6685 isl_assert(bmap1->ctx, isl_dim_match(bmap1->dim, isl_dim_param,
6686 bmap2->dim, isl_dim_param), goto error);
6687 dim_result = isl_dim_product(isl_dim_copy(bmap1->dim),
6688 isl_dim_copy(bmap2->dim));
6690 in1 = isl_basic_map_n_in(bmap1);
6691 in2 = isl_basic_map_n_in(bmap2);
6692 out1 = isl_basic_map_n_out(bmap1);
6693 out2 = isl_basic_map_n_out(bmap2);
6694 nparam = isl_basic_map_n_param(bmap1);
6696 total = nparam + in1 + in2 + out1 + out2 + bmap1->n_div + bmap2->n_div;
6697 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
6698 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
6699 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
6700 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
6701 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
6702 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos += in1);
6703 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += in2);
6704 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += out1);
6705 isl_dim_map_div(dim_map1, bmap1, pos += out2);
6706 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
6708 bmap = isl_basic_map_alloc_dim(dim_result,
6709 bmap1->n_div + bmap2->n_div,
6710 bmap1->n_eq + bmap2->n_eq,
6711 bmap1->n_ineq + bmap2->n_ineq);
6712 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
6713 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
6714 bmap = isl_basic_map_simplify(bmap);
6715 return isl_basic_map_finalize(bmap);
6717 isl_basic_map_free(bmap1);
6718 isl_basic_map_free(bmap2);
6722 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> [B -> D]
6724 struct isl_map *isl_map_product(struct isl_map *map1, struct isl_map *map2)
6727 struct isl_map *result;
6733 isl_assert(map1->ctx, isl_dim_match(map1->dim, isl_dim_param,
6734 map2->dim, isl_dim_param), goto error);
6736 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
6737 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
6738 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
6740 result = isl_map_alloc_dim(isl_dim_product(isl_dim_copy(map1->dim),
6741 isl_dim_copy(map2->dim)),
6742 map1->n * map2->n, flags);
6745 for (i = 0; i < map1->n; ++i)
6746 for (j = 0; j < map2->n; ++j) {
6747 struct isl_basic_map *part;
6748 part = isl_basic_map_product(
6749 isl_basic_map_copy(map1->p[i]),
6750 isl_basic_map_copy(map2->p[j]));
6751 if (isl_basic_map_is_empty(part))
6752 isl_basic_map_free(part);
6754 result = isl_map_add_basic_map(result, part);
6767 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
6769 __isl_give isl_map *isl_map_flat_product(__isl_take isl_map *map1,
6770 __isl_take isl_map *map2)
6774 prod = isl_map_product(map1, map2);
6775 prod = isl_map_flatten(prod);
6779 /* Given two set A and B, construct its Cartesian product A x B.
6781 struct isl_set *isl_set_product(struct isl_set *set1, struct isl_set *set2)
6783 return (struct isl_set *)isl_map_product((struct isl_map *)set1,
6784 (struct isl_map *)set2);
6787 __isl_give isl_set *isl_set_flat_product(__isl_take isl_set *set1,
6788 __isl_take isl_set *set2)
6790 return (isl_set *)isl_map_flat_product((isl_map *)set1, (isl_map *)set2);
6793 uint32_t isl_basic_set_get_hash(struct isl_basic_set *bset)
6796 uint32_t hash = isl_hash_init();
6801 bset = isl_basic_set_copy(bset);
6802 bset = isl_basic_set_normalize(bset);
6805 total = isl_basic_set_total_dim(bset);
6806 isl_hash_byte(hash, bset->n_eq & 0xFF);
6807 for (i = 0; i < bset->n_eq; ++i) {
6809 c_hash = isl_seq_get_hash(bset->eq[i], 1 + total);
6810 isl_hash_hash(hash, c_hash);
6812 isl_hash_byte(hash, bset->n_ineq & 0xFF);
6813 for (i = 0; i < bset->n_ineq; ++i) {
6815 c_hash = isl_seq_get_hash(bset->ineq[i], 1 + total);
6816 isl_hash_hash(hash, c_hash);
6818 isl_hash_byte(hash, bset->n_div & 0xFF);
6819 for (i = 0; i < bset->n_div; ++i) {
6821 if (isl_int_is_zero(bset->div[i][0]))
6823 isl_hash_byte(hash, i & 0xFF);
6824 c_hash = isl_seq_get_hash(bset->div[i], 1 + 1 + total);
6825 isl_hash_hash(hash, c_hash);
6827 isl_basic_set_free(bset);
6831 uint32_t isl_set_get_hash(struct isl_set *set)
6838 set = isl_set_copy(set);
6839 set = isl_set_normalize(set);
6843 hash = isl_hash_init();
6844 for (i = 0; i < set->n; ++i) {
6846 bset_hash = isl_basic_set_get_hash(set->p[i]);
6847 isl_hash_hash(hash, bset_hash);
6855 /* Check if the value for dimension dim is completely determined
6856 * by the values of the other parameters and variables.
6857 * That is, check if dimension dim is involved in an equality.
6859 int isl_basic_set_dim_is_unique(struct isl_basic_set *bset, unsigned dim)
6866 nparam = isl_basic_set_n_param(bset);
6867 for (i = 0; i < bset->n_eq; ++i)
6868 if (!isl_int_is_zero(bset->eq[i][1 + nparam + dim]))
6873 /* Check if the value for dimension dim is completely determined
6874 * by the values of the other parameters and variables.
6875 * That is, check if dimension dim is involved in an equality
6876 * for each of the subsets.
6878 int isl_set_dim_is_unique(struct isl_set *set, unsigned dim)
6884 for (i = 0; i < set->n; ++i) {
6886 unique = isl_basic_set_dim_is_unique(set->p[i], dim);
6893 int isl_map_foreach_basic_map(__isl_keep isl_map *map,
6894 int (*fn)(__isl_take isl_basic_map *bmap, void *user), void *user)
6901 for (i = 0; i < map->n; ++i)
6902 if (fn(isl_basic_map_copy(map->p[i]), user) < 0)
6908 int isl_set_foreach_basic_set(__isl_keep isl_set *set,
6909 int (*fn)(__isl_take isl_basic_set *bset, void *user), void *user)
6916 for (i = 0; i < set->n; ++i)
6917 if (fn(isl_basic_set_copy(set->p[i]), user) < 0)
6923 __isl_give isl_basic_set *isl_basic_set_lift(__isl_take isl_basic_set *bset)
6925 struct isl_dim *dim;
6930 if (bset->n_div == 0)
6933 bset = isl_basic_set_cow(bset);
6937 dim = isl_basic_set_get_dim(bset);
6938 dim = isl_dim_add(dim, isl_dim_set, bset->n_div);
6941 isl_dim_free(bset->dim);
6945 bset = isl_basic_set_finalize(bset);
6949 isl_basic_set_free(bset);
6953 __isl_give isl_set *isl_set_lift(__isl_take isl_set *set)
6956 struct isl_dim *dim;
6959 set = isl_set_align_divs(set);
6963 if (set->n == 0 || set->p[0]->n_div == 0)
6966 set = isl_set_cow(set);
6970 n_div = set->p[0]->n_div;
6971 dim = isl_set_get_dim(set);
6972 dim = isl_dim_add(dim, isl_dim_set, n_div);
6975 isl_dim_free(set->dim);
6978 for (i = 0; i < set->n; ++i) {
6979 set->p[i] = isl_basic_set_lift(set->p[i]);
6990 __isl_give isl_map *isl_set_lifting(__isl_take isl_set *set)
6992 struct isl_dim *dim;
6993 struct isl_basic_map *bmap;
7000 set = isl_set_align_divs(set);
7005 dim = isl_set_get_dim(set);
7006 if (set->n == 0 || set->p[0]->n_div == 0) {
7008 return isl_map_identity(dim);
7011 n_div = set->p[0]->n_div;
7012 dim = isl_dim_map(dim);
7013 n_param = isl_dim_size(dim, isl_dim_param);
7014 n_set = isl_dim_size(dim, isl_dim_in);
7015 dim = isl_dim_extend(dim, n_param, n_set, n_set + n_div);
7016 bmap = isl_basic_map_alloc_dim(dim, 0, n_set, 2 * n_div);
7017 for (i = 0; i < n_set; ++i)
7018 bmap = var_equal(bmap, i);
7020 total = n_param + n_set + n_set + n_div;
7021 for (i = 0; i < n_div; ++i) {
7022 k = isl_basic_map_alloc_inequality(bmap);
7025 isl_seq_cpy(bmap->ineq[k], set->p[0]->div[i]+1, 1+n_param);
7026 isl_seq_clr(bmap->ineq[k]+1+n_param, n_set);
7027 isl_seq_cpy(bmap->ineq[k]+1+n_param+n_set,
7028 set->p[0]->div[i]+1+1+n_param, n_set + n_div);
7029 isl_int_neg(bmap->ineq[k][1+n_param+n_set+n_set+i],
7030 set->p[0]->div[i][0]);
7032 l = isl_basic_map_alloc_inequality(bmap);
7035 isl_seq_neg(bmap->ineq[l], bmap->ineq[k], 1 + total);
7036 isl_int_add(bmap->ineq[l][0], bmap->ineq[l][0],
7037 set->p[0]->div[i][0]);
7038 isl_int_sub_ui(bmap->ineq[l][0], bmap->ineq[l][0], 1);
7042 return isl_map_from_basic_map(bmap);
7045 isl_basic_map_free(bmap);
7049 int isl_basic_set_size(__isl_keep isl_basic_set *bset)
7057 dim = isl_basic_set_total_dim(bset);
7058 size += bset->n_eq * (1 + dim);
7059 size += bset->n_ineq * (1 + dim);
7060 size += bset->n_div * (2 + dim);
7065 int isl_set_size(__isl_keep isl_set *set)
7073 for (i = 0; i < set->n; ++i)
7074 size += isl_basic_set_size(set->p[i]);
7079 int isl_basic_map_dim_is_bounded(__isl_keep isl_basic_map *bmap,
7080 enum isl_dim_type type, unsigned pos)
7088 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), return -1);
7090 pos += isl_basic_map_offset(bmap, type);
7092 for (i = 0; i < bmap->n_eq; ++i)
7093 if (!isl_int_is_zero(bmap->eq[i][pos]))
7097 for (i = 0; i < bmap->n_ineq; ++i) {
7098 int sgn = isl_int_sgn(bmap->ineq[i][pos]);
7105 return lower && upper;
7108 int isl_map_dim_is_bounded(__isl_keep isl_map *map,
7109 enum isl_dim_type type, unsigned pos)
7116 for (i = 0; i < map->n; ++i) {
7118 bounded = isl_basic_map_dim_is_bounded(map->p[i], type, pos);
7119 if (bounded < 0 || !bounded)
7126 /* Return 1 if the specified dim is involved in both an upper bound
7127 * and a lower bound.
7129 int isl_set_dim_is_bounded(__isl_keep isl_set *set,
7130 enum isl_dim_type type, unsigned pos)
7132 return isl_map_dim_is_bounded((isl_map *)set, type, pos);
7135 /* For each of the "n" variables starting at "first", determine
7136 * the sign of the variable and put the results in the first "n"
7137 * elements of the array "signs".
7139 * 1 means that the variable is non-negative
7140 * -1 means that the variable is non-positive
7141 * 0 means the variable attains both positive and negative values.
7143 int isl_basic_set_vars_get_sign(__isl_keep isl_basic_set *bset,
7144 unsigned first, unsigned n, int *signs)
7146 isl_vec *bound = NULL;
7147 struct isl_tab *tab = NULL;
7148 struct isl_tab_undo *snap;
7151 if (!bset || !signs)
7154 bound = isl_vec_alloc(bset->ctx, 1 + isl_basic_set_total_dim(bset));
7155 tab = isl_tab_from_basic_set(bset);
7159 isl_seq_clr(bound->el, bound->size);
7160 isl_int_set_si(bound->el[0], -1);
7162 snap = isl_tab_snap(tab);
7163 for (i = 0; i < n; ++i) {
7166 isl_int_set_si(bound->el[1 + first + i], -1);
7167 if (isl_tab_add_ineq(tab, bound->el) < 0)
7170 isl_int_set_si(bound->el[1 + first + i], 0);
7171 if (isl_tab_rollback(tab, snap) < 0)
7179 isl_int_set_si(bound->el[1 + first + i], 1);
7180 if (isl_tab_add_ineq(tab, bound->el) < 0)
7183 isl_int_set_si(bound->el[1 + first + i], 0);
7184 if (isl_tab_rollback(tab, snap) < 0)
7187 signs[i] = empty ? -1 : 0;
7191 isl_vec_free(bound);
7195 isl_vec_free(bound);
7199 int isl_basic_set_dims_get_sign(__isl_keep isl_basic_set *bset,
7200 enum isl_dim_type type, unsigned first, unsigned n, int *signs)
7202 if (!bset || !signs)
7204 isl_assert(bset->ctx, first + n <= isl_basic_set_dim(bset, type),
7207 first += pos(bset->dim, type) - 1;
7208 return isl_basic_set_vars_get_sign(bset, first, n, signs);
7211 /* Check if the given map is single-valued.
7216 * and check if the result is a subset of the identity mapping.
7218 int isl_map_is_single_valued(__isl_keep isl_map *map)
7224 test = isl_map_reverse(isl_map_copy(map));
7225 test = isl_map_apply_range(test, isl_map_copy(map));
7227 id = isl_map_identity(isl_dim_range(isl_map_get_dim(map)));
7229 sv = isl_map_is_subset(test, id);
7237 int isl_map_is_bijective(__isl_keep isl_map *map)
7241 sv = isl_map_is_single_valued(map);
7245 map = isl_map_copy(map);
7246 map = isl_map_reverse(map);
7247 sv = isl_map_is_single_valued(map);
7253 int isl_set_is_singleton(__isl_keep isl_set *set)
7255 return isl_map_is_single_valued((isl_map *)set);
7258 int isl_map_is_translation(__isl_keep isl_map *map)
7263 delta = isl_map_deltas(isl_map_copy(map));
7264 ok = isl_set_is_singleton(delta);
7265 isl_set_free(delta);
7270 static int unique(isl_int *p, unsigned pos, unsigned len)
7272 if (isl_seq_first_non_zero(p, pos) != -1)
7274 if (isl_seq_first_non_zero(p + pos + 1, len - pos - 1) != -1)
7279 int isl_basic_set_is_box(__isl_keep isl_basic_set *bset)
7288 if (isl_basic_set_dim(bset, isl_dim_div) != 0)
7291 nvar = isl_basic_set_dim(bset, isl_dim_set);
7292 ovar = isl_dim_offset(bset->dim, isl_dim_set);
7293 for (j = 0; j < nvar; ++j) {
7294 int lower = 0, upper = 0;
7295 for (i = 0; i < bset->n_eq; ++i) {
7296 if (isl_int_is_zero(bset->eq[i][1 + ovar + j]))
7298 if (!unique(bset->eq[i] + 1 + ovar, j, nvar))
7304 for (i = 0; i < bset->n_ineq; ++i) {
7305 if (isl_int_is_zero(bset->ineq[i][1 + ovar + j]))
7307 if (!unique(bset->ineq[i] + 1 + ovar, j, nvar))
7309 if (isl_int_is_pos(bset->ineq[i][1 + ovar + j]))
7314 if (!lower || !upper)
7321 int isl_set_is_box(__isl_keep isl_set *set)
7328 return isl_basic_set_is_box(set->p[0]);
7331 int isl_basic_set_is_wrapping(__isl_keep isl_basic_set *bset)
7336 return isl_dim_is_wrapping(bset->dim);
7339 int isl_set_is_wrapping(__isl_keep isl_set *set)
7344 return isl_dim_is_wrapping(set->dim);
7347 __isl_give isl_basic_set *isl_basic_map_wrap(__isl_take isl_basic_map *bmap)
7349 bmap = isl_basic_map_cow(bmap);
7353 bmap->dim = isl_dim_wrap(bmap->dim);
7357 bmap = isl_basic_map_finalize(bmap);
7359 return (isl_basic_set *)bmap;
7361 isl_basic_map_free(bmap);
7365 __isl_give isl_set *isl_map_wrap(__isl_take isl_map *map)
7369 map = isl_map_cow(map);
7373 for (i = 0; i < map->n; ++i) {
7374 map->p[i] = (isl_basic_map *)isl_basic_map_wrap(map->p[i]);
7378 map->dim = isl_dim_wrap(map->dim);
7382 return (isl_set *)map;
7388 __isl_give isl_basic_map *isl_basic_set_unwrap(__isl_take isl_basic_set *bset)
7390 bset = isl_basic_set_cow(bset);
7394 bset->dim = isl_dim_unwrap(bset->dim);
7398 bset = isl_basic_set_finalize(bset);
7400 return (isl_basic_map *)bset;
7402 isl_basic_set_free(bset);
7406 __isl_give isl_map *isl_set_unwrap(__isl_take isl_set *set)
7413 if (!isl_set_is_wrapping(set))
7414 isl_die(set->ctx, isl_error_invalid, "not a wrapping set",
7417 set = isl_set_cow(set);
7421 for (i = 0; i < set->n; ++i) {
7422 set->p[i] = (isl_basic_set *)isl_basic_set_unwrap(set->p[i]);
7427 set->dim = isl_dim_unwrap(set->dim);
7431 return (isl_map *)set;
7437 __isl_give isl_basic_map *isl_basic_map_reset(__isl_take isl_basic_map *bmap,
7438 enum isl_dim_type type)
7443 if (!isl_dim_is_named_or_nested(bmap->dim, type))
7446 bmap = isl_basic_map_cow(bmap);
7450 bmap->dim = isl_dim_reset(bmap->dim, type);
7454 bmap = isl_basic_map_finalize(bmap);
7458 isl_basic_map_free(bmap);
7462 __isl_give isl_map *isl_map_reset(__isl_take isl_map *map,
7463 enum isl_dim_type type)
7470 if (!isl_dim_is_named_or_nested(map->dim, type))
7473 map = isl_map_cow(map);
7477 for (i = 0; i < map->n; ++i) {
7478 map->p[i] = isl_basic_map_reset(map->p[i], type);
7482 map->dim = isl_dim_reset(map->dim, type);
7492 __isl_give isl_basic_map *isl_basic_map_flatten(__isl_take isl_basic_map *bmap)
7497 if (!bmap->dim->nested[0] && !bmap->dim->nested[1])
7500 bmap = isl_basic_map_cow(bmap);
7504 bmap->dim = isl_dim_flatten(bmap->dim);
7508 bmap = isl_basic_map_finalize(bmap);
7512 isl_basic_map_free(bmap);
7516 __isl_give isl_map *isl_map_flatten(__isl_take isl_map *map)
7523 if (!map->dim->nested[0] && !map->dim->nested[1])
7526 map = isl_map_cow(map);
7530 for (i = 0; i < map->n; ++i) {
7531 map->p[i] = isl_basic_map_flatten(map->p[i]);
7535 map->dim = isl_dim_flatten(map->dim);
7545 /* Extend the given dim_map with mappings for the divs in bmap.
7547 static __isl_give struct isl_dim_map *extend_dim_map(
7548 __isl_keep struct isl_dim_map *dim_map,
7549 __isl_keep isl_basic_map *bmap)
7552 struct isl_dim_map *res;
7555 offset = isl_basic_map_offset(bmap, isl_dim_div);
7557 res = isl_dim_map_alloc(bmap->ctx, dim_map->len - 1 + bmap->n_div);
7561 for (i = 0; i < dim_map->len; ++i)
7562 res->pos[i] = dim_map->pos[i];
7563 for (i = 0; i < bmap->n_div; ++i)
7564 res->pos[dim_map->len + i] = offset + i;
7569 /* Extract a dim_map from a reordering.
7570 * We essentially need to reverse the mapping, and add an offset
7571 * of 1 for the constant term.
7573 __isl_give struct isl_dim_map *isl_dim_map_from_reordering(
7574 __isl_keep isl_reordering *exp)
7577 struct isl_dim_map *dim_map;
7582 dim_map = isl_dim_map_alloc(exp->dim->ctx, isl_dim_total(exp->dim));
7586 for (i = 0; i < exp->len; ++i)
7587 dim_map->pos[1 + exp->pos[i]] = 1 + i;
7592 /* Reorder the dimensions of "bmap" according to the given dim_map
7593 * and set the dimension specification to "dim".
7595 __isl_give isl_basic_map *isl_basic_map_realign(__isl_take isl_basic_map *bmap,
7596 __isl_take isl_dim *dim, __isl_take struct isl_dim_map *dim_map)
7600 bmap = isl_basic_map_cow(bmap);
7601 if (!bmap || !dim || !dim_map)
7604 res = isl_basic_map_alloc_dim(dim,
7605 bmap->n_div, bmap->n_eq, bmap->n_ineq);
7606 res = add_constraints_dim_map(res, bmap, dim_map);
7607 res = isl_basic_map_finalize(res);
7611 isl_basic_map_free(bmap);
7616 /* Reorder the dimensions of "map" according to given reordering.
7618 __isl_give isl_map *isl_map_realign(__isl_take isl_map *map,
7619 __isl_take isl_reordering *r)
7622 struct isl_dim_map *dim_map;
7624 map = isl_map_cow(map);
7625 dim_map = isl_dim_map_from_reordering(r);
7626 if (!map || !r || !dim_map)
7629 for (i = 0; i < map->n; ++i) {
7630 struct isl_dim_map *dim_map_i;
7632 dim_map_i = extend_dim_map(dim_map, map->p[i]);
7634 map->p[i] = isl_basic_map_realign(map->p[i],
7635 isl_dim_copy(r->dim), dim_map_i);
7641 map = isl_map_reset_dim(map, isl_dim_copy(r->dim));
7643 isl_reordering_free(r);
7649 isl_reordering_free(r);
7653 __isl_give isl_set *isl_set_realign(__isl_take isl_set *set,
7654 __isl_take isl_reordering *r)
7656 return (isl_set *)isl_map_realign((isl_map *)set, r);
7659 __isl_give isl_mat *isl_basic_map_equalities_matrix(
7660 __isl_keep isl_basic_map *bmap, enum isl_dim_type c1,
7661 enum isl_dim_type c2, enum isl_dim_type c3,
7662 enum isl_dim_type c4, enum isl_dim_type c5)
7664 enum isl_dim_type c[5] = { c1, c2, c3, c4, c5 };
7665 struct isl_mat *mat;
7671 mat = isl_mat_alloc(bmap->ctx, bmap->n_eq,
7672 isl_basic_map_total_dim(bmap) + 1);
7675 for (i = 0; i < bmap->n_eq; ++i)
7676 for (j = 0, pos = 0; j < 5; ++j) {
7677 int off = isl_basic_map_offset(bmap, c[j]);
7678 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
7679 isl_int_set(mat->row[i][pos],
7680 bmap->eq[i][off + k]);
7688 __isl_give isl_mat *isl_basic_map_inequalities_matrix(
7689 __isl_keep isl_basic_map *bmap, enum isl_dim_type c1,
7690 enum isl_dim_type c2, enum isl_dim_type c3,
7691 enum isl_dim_type c4, enum isl_dim_type c5)
7693 enum isl_dim_type c[5] = { c1, c2, c3, c4, c5 };
7694 struct isl_mat *mat;
7700 mat = isl_mat_alloc(bmap->ctx, bmap->n_ineq,
7701 isl_basic_map_total_dim(bmap) + 1);
7704 for (i = 0; i < bmap->n_ineq; ++i)
7705 for (j = 0, pos = 0; j < 5; ++j) {
7706 int off = isl_basic_map_offset(bmap, c[j]);
7707 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
7708 isl_int_set(mat->row[i][pos],
7709 bmap->ineq[i][off + k]);
7717 __isl_give isl_basic_map *isl_basic_map_from_constraint_matrices(
7718 __isl_take isl_dim *dim,
7719 __isl_take isl_mat *eq, __isl_take isl_mat *ineq, enum isl_dim_type c1,
7720 enum isl_dim_type c2, enum isl_dim_type c3,
7721 enum isl_dim_type c4, enum isl_dim_type c5)
7723 enum isl_dim_type c[5] = { c1, c2, c3, c4, c5 };
7724 isl_basic_map *bmap;
7730 if (!dim || !eq || !ineq)
7733 if (eq->n_col != ineq->n_col)
7734 isl_die(dim->ctx, isl_error_invalid,
7735 "equalities and inequalities matrices should have "
7736 "same number of columns", goto error);
7738 total = 1 + isl_dim_total(dim);
7740 if (eq->n_col < total)
7741 isl_die(dim->ctx, isl_error_invalid,
7742 "number of columns too small", goto error);
7744 extra = eq->n_col - total;
7746 bmap = isl_basic_map_alloc_dim(isl_dim_copy(dim), extra,
7747 eq->n_row, ineq->n_row);
7750 for (i = 0; i < extra; ++i)
7751 if (isl_basic_map_alloc_div(bmap) < 0)
7753 for (i = 0; i < eq->n_row; ++i) {
7754 l = isl_basic_map_alloc_equality(bmap);
7757 for (j = 0, pos = 0; j < 5; ++j) {
7758 int off = isl_basic_map_offset(bmap, c[j]);
7759 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
7760 isl_int_set(bmap->eq[l][off + k],
7766 for (i = 0; i < ineq->n_row; ++i) {
7767 l = isl_basic_map_alloc_inequality(bmap);
7770 for (j = 0, pos = 0; j < 5; ++j) {
7771 int off = isl_basic_map_offset(bmap, c[j]);
7772 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
7773 isl_int_set(bmap->ineq[l][off + k],
7792 __isl_give isl_basic_set *isl_basic_set_from_constraint_matrices(
7793 __isl_take isl_dim *dim,
7794 __isl_take isl_mat *eq, __isl_take isl_mat *ineq, enum isl_dim_type c1,
7795 enum isl_dim_type c2, enum isl_dim_type c3, enum isl_dim_type c4)
7797 return (isl_basic_set*)
7798 isl_basic_map_from_constraint_matrices(dim, eq, ineq,
7799 c1, c2, c3, c4, isl_dim_in);