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_sample.h"
30 /* Maps dst positions to src positions */
36 static struct isl_dim_map *isl_dim_map_alloc(struct isl_ctx *ctx, unsigned len)
39 struct isl_dim_map *dim_map;
40 dim_map = isl_alloc(ctx, struct isl_dim_map,
41 sizeof(struct isl_dim_map) + len * sizeof(int));
44 dim_map->len = 1 + len;
46 for (i = 0; i < len; ++i)
47 dim_map->pos[1 + i] = -1;
51 static unsigned n(struct isl_dim *dim, enum isl_dim_type type)
54 case isl_dim_param: return dim->nparam;
55 case isl_dim_in: return dim->n_in;
56 case isl_dim_out: return dim->n_out;
57 case isl_dim_all: return dim->nparam + dim->n_in + dim->n_out;
62 static unsigned pos(struct isl_dim *dim, enum isl_dim_type type)
65 case isl_dim_param: return 1;
66 case isl_dim_in: return 1 + dim->nparam;
67 case isl_dim_out: return 1 + dim->nparam + dim->n_in;
72 static void isl_dim_map_dim_range(struct isl_dim_map *dim_map,
73 struct isl_dim *dim, enum isl_dim_type type,
74 unsigned first, unsigned n, unsigned dst_pos)
82 src_pos = pos(dim, type);
83 for (i = 0; i < n; ++i)
84 dim_map->pos[1 + dst_pos + i] = src_pos + first + i;
87 static void isl_dim_map_dim(struct isl_dim_map *dim_map, struct isl_dim *dim,
88 enum isl_dim_type type, unsigned dst_pos)
90 isl_dim_map_dim_range(dim_map, dim, type, 0, n(dim, type), dst_pos);
93 static void isl_dim_map_div(struct isl_dim_map *dim_map,
94 struct isl_basic_map *bmap, unsigned dst_pos)
99 if (!dim_map || !bmap)
102 src_pos = 1 + isl_dim_total(bmap->dim);
103 for (i = 0; i < bmap->n_div; ++i)
104 dim_map->pos[1 + dst_pos + i] = src_pos + i;
107 static void isl_dim_map_dump(struct isl_dim_map *dim_map)
111 for (i = 0; i < dim_map->len; ++i)
112 fprintf(stderr, "%d -> %d; ", i, dim_map->pos[i]);
113 fprintf(stderr, "\n");
116 unsigned isl_basic_map_dim(const struct isl_basic_map *bmap,
117 enum isl_dim_type type)
124 case isl_dim_out: return isl_dim_size(bmap->dim, type);
125 case isl_dim_div: return bmap->n_div;
126 case isl_dim_all: return isl_basic_map_total_dim(bmap);
131 unsigned isl_map_dim(const struct isl_map *map, enum isl_dim_type type)
133 return map ? n(map->dim, type) : 0;
136 unsigned isl_set_dim(const struct isl_set *set, enum isl_dim_type type)
138 return set ? n(set->dim, type) : 0;
141 unsigned isl_basic_map_offset(struct isl_basic_map *bmap,
142 enum isl_dim_type type)
144 struct isl_dim *dim = bmap->dim;
146 case isl_dim_param: return 1;
147 case isl_dim_in: return 1 + dim->nparam;
148 case isl_dim_out: return 1 + dim->nparam + dim->n_in;
149 case isl_dim_div: return 1 + dim->nparam + dim->n_in + dim->n_out;
154 static unsigned map_offset(struct isl_map *map, enum isl_dim_type type)
156 return pos(map->dim, type);
159 unsigned isl_basic_set_dim(const struct isl_basic_set *bset,
160 enum isl_dim_type type)
162 return isl_basic_map_dim((const struct isl_basic_map*)bset, type);
165 unsigned isl_basic_set_n_dim(const struct isl_basic_set *bset)
167 return isl_basic_set_dim(bset, isl_dim_set);
170 unsigned isl_basic_set_n_param(const struct isl_basic_set *bset)
172 return isl_basic_set_dim(bset, isl_dim_param);
175 unsigned isl_basic_set_total_dim(const struct isl_basic_set *bset)
177 return isl_dim_total(bset->dim) + bset->n_div;
180 unsigned isl_set_n_dim(const struct isl_set *set)
182 return isl_set_dim(set, isl_dim_set);
185 unsigned isl_set_n_param(const struct isl_set *set)
187 return isl_set_dim(set, isl_dim_param);
190 unsigned isl_basic_map_n_in(const struct isl_basic_map *bmap)
192 return bmap->dim->n_in;
195 unsigned isl_basic_map_n_out(const struct isl_basic_map *bmap)
197 return bmap->dim->n_out;
200 unsigned isl_basic_map_n_param(const struct isl_basic_map *bmap)
202 return bmap->dim->nparam;
205 unsigned isl_basic_map_n_div(const struct isl_basic_map *bmap)
210 unsigned isl_basic_map_total_dim(const struct isl_basic_map *bmap)
212 return bmap ? isl_dim_total(bmap->dim) + bmap->n_div : 0;
215 unsigned isl_map_n_in(const struct isl_map *map)
217 return map->dim->n_in;
220 unsigned isl_map_n_out(const struct isl_map *map)
222 return map->dim->n_out;
225 unsigned isl_map_n_param(const struct isl_map *map)
227 return map->dim->nparam;
230 int isl_map_compatible_domain(struct isl_map *map, struct isl_set *set)
232 return map->dim->n_in == set->dim->n_out &&
233 map->dim->nparam == set->dim->nparam;
236 int isl_basic_map_compatible_domain(struct isl_basic_map *bmap,
237 struct isl_basic_set *bset)
239 return bmap->dim->n_in == bset->dim->n_out &&
240 bmap->dim->nparam == bset->dim->nparam;
243 int isl_basic_map_compatible_range(struct isl_basic_map *bmap,
244 struct isl_basic_set *bset)
246 return bmap->dim->n_out == bset->dim->n_out &&
247 bmap->dim->nparam == bset->dim->nparam;
250 isl_ctx *isl_map_get_ctx(__isl_keep isl_map *map)
252 return map ? map->ctx : NULL;
255 struct isl_dim *isl_basic_map_get_dim(struct isl_basic_map *bmap)
259 return isl_dim_copy(bmap->dim);
262 struct isl_dim *isl_basic_set_get_dim(struct isl_basic_set *bset)
266 return isl_dim_copy(bset->dim);
269 struct isl_dim *isl_map_get_dim(struct isl_map *map)
273 return isl_dim_copy(map->dim);
276 struct isl_dim *isl_set_get_dim(struct isl_set *set)
280 return isl_dim_copy(set->dim);
283 __isl_give isl_basic_map *isl_basic_map_set_dim_name(
284 __isl_take isl_basic_map *bmap,
285 enum isl_dim_type type, unsigned pos, const char *s)
289 bmap->dim = isl_dim_set_name(bmap->dim, type, pos, s);
294 isl_basic_map_free(bmap);
298 __isl_give isl_map *isl_map_set_dim_name(__isl_take isl_map *map,
299 enum isl_dim_type type, unsigned pos, const char *s)
306 map->dim = isl_dim_set_name(map->dim, type, pos, s);
310 for (i = 0; i < map->n; ++i) {
311 map->p[i] = isl_basic_map_set_dim_name(map->p[i], type, pos, s);
322 __isl_give isl_basic_set *isl_basic_set_set_dim_name(
323 __isl_take isl_basic_set *bset,
324 enum isl_dim_type type, unsigned pos, const char *s)
326 return (isl_basic_set *)isl_basic_map_set_dim_name(
327 (isl_basic_map *)bset, type, pos, s);
330 __isl_give isl_set *isl_set_set_dim_name(__isl_take isl_set *set,
331 enum isl_dim_type type, unsigned pos, const char *s)
333 return (isl_set *)isl_map_set_dim_name((isl_map *)set, type, pos, s);
336 int isl_basic_map_is_rational(__isl_keep isl_basic_map *bmap)
340 return ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL);
343 static struct isl_basic_map *basic_map_init(struct isl_ctx *ctx,
344 struct isl_basic_map *bmap, unsigned extra,
345 unsigned n_eq, unsigned n_ineq)
348 size_t row_size = 1 + isl_dim_total(bmap->dim) + extra;
353 bmap->block = isl_blk_alloc(ctx, (n_ineq + n_eq) * row_size);
354 if (isl_blk_is_error(bmap->block))
357 bmap->ineq = isl_alloc_array(ctx, isl_int *, n_ineq + n_eq);
362 bmap->block2 = isl_blk_empty();
365 bmap->block2 = isl_blk_alloc(ctx, extra * (1 + row_size));
366 if (isl_blk_is_error(bmap->block2))
369 bmap->div = isl_alloc_array(ctx, isl_int *, extra);
374 for (i = 0; i < n_ineq + n_eq; ++i)
375 bmap->ineq[i] = bmap->block.data + i * row_size;
377 for (i = 0; i < extra; ++i)
378 bmap->div[i] = bmap->block2.data + i * (1 + row_size);
382 bmap->c_size = n_eq + n_ineq;
383 bmap->eq = bmap->ineq + n_ineq;
392 isl_basic_map_free(bmap);
396 struct isl_basic_set *isl_basic_set_alloc(struct isl_ctx *ctx,
397 unsigned nparam, unsigned dim, unsigned extra,
398 unsigned n_eq, unsigned n_ineq)
400 struct isl_basic_map *bmap;
401 bmap = isl_basic_map_alloc(ctx, nparam, 0, dim, extra, n_eq, n_ineq);
402 return (struct isl_basic_set *)bmap;
405 struct isl_basic_set *isl_basic_set_alloc_dim(struct isl_dim *dim,
406 unsigned extra, unsigned n_eq, unsigned n_ineq)
408 struct isl_basic_map *bmap;
411 isl_assert(dim->ctx, dim->n_in == 0, return NULL);
412 bmap = isl_basic_map_alloc_dim(dim, extra, n_eq, n_ineq);
413 return (struct isl_basic_set *)bmap;
416 struct isl_basic_map *isl_basic_map_alloc_dim(struct isl_dim *dim,
417 unsigned extra, unsigned n_eq, unsigned n_ineq)
419 struct isl_basic_map *bmap;
423 bmap = isl_calloc_type(dim->ctx, struct isl_basic_map);
428 return basic_map_init(dim->ctx, bmap, extra, n_eq, n_ineq);
434 struct isl_basic_map *isl_basic_map_alloc(struct isl_ctx *ctx,
435 unsigned nparam, unsigned in, unsigned out, unsigned extra,
436 unsigned n_eq, unsigned n_ineq)
438 struct isl_basic_map *bmap;
441 dim = isl_dim_alloc(ctx, nparam, in, out);
445 bmap = isl_basic_map_alloc_dim(dim, extra, n_eq, n_ineq);
449 static void dup_constraints(
450 struct isl_basic_map *dst, struct isl_basic_map *src)
453 unsigned total = isl_basic_map_total_dim(src);
455 for (i = 0; i < src->n_eq; ++i) {
456 int j = isl_basic_map_alloc_equality(dst);
457 isl_seq_cpy(dst->eq[j], src->eq[i], 1+total);
460 for (i = 0; i < src->n_ineq; ++i) {
461 int j = isl_basic_map_alloc_inequality(dst);
462 isl_seq_cpy(dst->ineq[j], src->ineq[i], 1+total);
465 for (i = 0; i < src->n_div; ++i) {
466 int j = isl_basic_map_alloc_div(dst);
467 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total);
469 ISL_F_SET(dst, ISL_BASIC_SET_FINAL);
472 struct isl_basic_map *isl_basic_map_dup(struct isl_basic_map *bmap)
474 struct isl_basic_map *dup;
478 dup = isl_basic_map_alloc_dim(isl_dim_copy(bmap->dim),
479 bmap->n_div, bmap->n_eq, bmap->n_ineq);
482 dup_constraints(dup, bmap);
483 dup->flags = bmap->flags;
484 dup->sample = isl_vec_copy(bmap->sample);
488 struct isl_basic_set *isl_basic_set_dup(struct isl_basic_set *bset)
490 struct isl_basic_map *dup;
492 dup = isl_basic_map_dup((struct isl_basic_map *)bset);
493 return (struct isl_basic_set *)dup;
496 struct isl_basic_set *isl_basic_set_copy(struct isl_basic_set *bset)
501 if (ISL_F_ISSET(bset, ISL_BASIC_SET_FINAL)) {
505 return isl_basic_set_dup(bset);
508 struct isl_set *isl_set_copy(struct isl_set *set)
517 struct isl_basic_map *isl_basic_map_copy(struct isl_basic_map *bmap)
522 if (ISL_F_ISSET(bmap, ISL_BASIC_SET_FINAL)) {
526 bmap = isl_basic_map_dup(bmap);
528 ISL_F_SET(bmap, ISL_BASIC_SET_FINAL);
532 struct isl_map *isl_map_copy(struct isl_map *map)
541 void isl_basic_map_free(struct isl_basic_map *bmap)
549 isl_ctx_deref(bmap->ctx);
551 isl_blk_free(bmap->ctx, bmap->block2);
553 isl_blk_free(bmap->ctx, bmap->block);
554 isl_vec_free(bmap->sample);
555 isl_dim_free(bmap->dim);
559 void isl_basic_set_free(struct isl_basic_set *bset)
561 isl_basic_map_free((struct isl_basic_map *)bset);
564 static int room_for_con(struct isl_basic_map *bmap, unsigned n)
566 return bmap->n_eq + bmap->n_ineq + n <= bmap->c_size;
569 int isl_basic_map_alloc_equality(struct isl_basic_map *bmap)
575 isl_assert(ctx, room_for_con(bmap, 1), return -1);
576 isl_assert(ctx, (bmap->eq - bmap->ineq) + bmap->n_eq <= bmap->c_size,
578 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
579 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
580 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_IMPLICIT);
581 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
582 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
583 if ((bmap->eq - bmap->ineq) + bmap->n_eq == bmap->c_size) {
585 int j = isl_basic_map_alloc_inequality(bmap);
589 bmap->ineq[j] = bmap->ineq[bmap->n_ineq - 1];
590 bmap->ineq[bmap->n_ineq - 1] = bmap->eq[-1];
597 isl_seq_clr(bmap->eq[bmap->n_eq] + 1 + isl_basic_map_total_dim(bmap),
598 bmap->extra - bmap->n_div);
602 int isl_basic_set_alloc_equality(struct isl_basic_set *bset)
604 return isl_basic_map_alloc_equality((struct isl_basic_map *)bset);
607 int isl_basic_map_free_equality(struct isl_basic_map *bmap, unsigned n)
611 isl_assert(bmap->ctx, n <= bmap->n_eq, return -1);
616 int isl_basic_set_free_equality(struct isl_basic_set *bset, unsigned n)
618 return isl_basic_map_free_equality((struct isl_basic_map *)bset, n);
621 int isl_basic_map_drop_equality(struct isl_basic_map *bmap, unsigned pos)
626 isl_assert(bmap->ctx, pos < bmap->n_eq, return -1);
628 if (pos != bmap->n_eq - 1) {
630 bmap->eq[pos] = bmap->eq[bmap->n_eq - 1];
631 bmap->eq[bmap->n_eq - 1] = t;
637 int isl_basic_set_drop_equality(struct isl_basic_set *bset, unsigned pos)
639 return isl_basic_map_drop_equality((struct isl_basic_map *)bset, pos);
642 void isl_basic_map_inequality_to_equality(
643 struct isl_basic_map *bmap, unsigned pos)
648 bmap->ineq[pos] = bmap->ineq[bmap->n_ineq - 1];
649 bmap->ineq[bmap->n_ineq - 1] = bmap->eq[-1];
654 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
655 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
656 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
657 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
660 static int room_for_ineq(struct isl_basic_map *bmap, unsigned n)
662 return bmap->n_ineq + n <= bmap->eq - bmap->ineq;
665 int isl_basic_map_alloc_inequality(struct isl_basic_map *bmap)
671 isl_assert(ctx, room_for_ineq(bmap, 1), return -1);
672 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_IMPLICIT);
673 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
674 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
675 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
676 isl_seq_clr(bmap->ineq[bmap->n_ineq] +
677 1 + isl_basic_map_total_dim(bmap),
678 bmap->extra - bmap->n_div);
679 return bmap->n_ineq++;
682 int isl_basic_set_alloc_inequality(struct isl_basic_set *bset)
684 return isl_basic_map_alloc_inequality((struct isl_basic_map *)bset);
687 int isl_basic_map_free_inequality(struct isl_basic_map *bmap, unsigned n)
691 isl_assert(bmap->ctx, n <= bmap->n_ineq, return -1);
696 int isl_basic_set_free_inequality(struct isl_basic_set *bset, unsigned n)
698 return isl_basic_map_free_inequality((struct isl_basic_map *)bset, n);
701 int isl_basic_map_drop_inequality(struct isl_basic_map *bmap, unsigned pos)
706 isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
708 if (pos != bmap->n_ineq - 1) {
710 bmap->ineq[pos] = bmap->ineq[bmap->n_ineq - 1];
711 bmap->ineq[bmap->n_ineq - 1] = t;
712 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
718 int isl_basic_set_drop_inequality(struct isl_basic_set *bset, unsigned pos)
720 return isl_basic_map_drop_inequality((struct isl_basic_map *)bset, pos);
723 __isl_give isl_basic_map *isl_basic_map_add_eq(__isl_take isl_basic_map *bmap,
728 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
731 k = isl_basic_map_alloc_equality(bmap);
734 isl_seq_cpy(bmap->eq[k], eq, 1 + isl_basic_map_total_dim(bmap));
737 isl_basic_map_free(bmap);
741 __isl_give isl_basic_set *isl_basic_set_add_eq(__isl_take isl_basic_set *bset,
744 return (isl_basic_set *)
745 isl_basic_map_add_eq((isl_basic_map *)bset, eq);
748 __isl_give isl_basic_map *isl_basic_map_add_ineq(__isl_take isl_basic_map *bmap,
753 bmap = isl_basic_map_extend_constraints(bmap, 0, 1);
756 k = isl_basic_map_alloc_inequality(bmap);
759 isl_seq_cpy(bmap->ineq[k], ineq, 1 + isl_basic_map_total_dim(bmap));
762 isl_basic_map_free(bmap);
766 __isl_give isl_basic_set *isl_basic_set_add_ineq(__isl_take isl_basic_set *bset,
769 return (isl_basic_set *)
770 isl_basic_map_add_ineq((isl_basic_map *)bset, ineq);
773 int isl_basic_map_alloc_div(struct isl_basic_map *bmap)
777 isl_assert(bmap->ctx, bmap->n_div < bmap->extra, return -1);
778 isl_seq_clr(bmap->div[bmap->n_div] +
779 1 + 1 + isl_basic_map_total_dim(bmap),
780 bmap->extra - bmap->n_div);
781 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
782 return bmap->n_div++;
785 int isl_basic_set_alloc_div(struct isl_basic_set *bset)
787 return isl_basic_map_alloc_div((struct isl_basic_map *)bset);
790 int isl_basic_map_free_div(struct isl_basic_map *bmap, unsigned n)
794 isl_assert(bmap->ctx, n <= bmap->n_div, return -1);
799 int isl_basic_set_free_div(struct isl_basic_set *bset, unsigned n)
801 return isl_basic_map_free_div((struct isl_basic_map *)bset, n);
804 /* Copy constraint from src to dst, putting the vars of src at offset
805 * dim_off in dst and the divs of src at offset div_off in dst.
806 * If both sets are actually map, then dim_off applies to the input
809 static void copy_constraint(struct isl_basic_map *dst_map, isl_int *dst,
810 struct isl_basic_map *src_map, isl_int *src,
811 unsigned in_off, unsigned out_off, unsigned div_off)
813 unsigned src_nparam = isl_basic_map_n_param(src_map);
814 unsigned dst_nparam = isl_basic_map_n_param(dst_map);
815 unsigned src_in = isl_basic_map_n_in(src_map);
816 unsigned dst_in = isl_basic_map_n_in(dst_map);
817 unsigned src_out = isl_basic_map_n_out(src_map);
818 unsigned dst_out = isl_basic_map_n_out(dst_map);
819 isl_int_set(dst[0], src[0]);
820 isl_seq_cpy(dst+1, src+1, isl_min(dst_nparam, src_nparam));
821 if (dst_nparam > src_nparam)
822 isl_seq_clr(dst+1+src_nparam,
823 dst_nparam - src_nparam);
824 isl_seq_clr(dst+1+dst_nparam, in_off);
825 isl_seq_cpy(dst+1+dst_nparam+in_off,
827 isl_min(dst_in-in_off, src_in));
828 if (dst_in-in_off > src_in)
829 isl_seq_clr(dst+1+dst_nparam+in_off+src_in,
830 dst_in - in_off - src_in);
831 isl_seq_clr(dst+1+dst_nparam+dst_in, out_off);
832 isl_seq_cpy(dst+1+dst_nparam+dst_in+out_off,
833 src+1+src_nparam+src_in,
834 isl_min(dst_out-out_off, src_out));
835 if (dst_out-out_off > src_out)
836 isl_seq_clr(dst+1+dst_nparam+dst_in+out_off+src_out,
837 dst_out - out_off - src_out);
838 isl_seq_clr(dst+1+dst_nparam+dst_in+dst_out, div_off);
839 isl_seq_cpy(dst+1+dst_nparam+dst_in+dst_out+div_off,
840 src+1+src_nparam+src_in+src_out,
841 isl_min(dst_map->extra-div_off, src_map->n_div));
842 if (dst_map->n_div-div_off > src_map->n_div)
843 isl_seq_clr(dst+1+dst_nparam+dst_in+dst_out+
844 div_off+src_map->n_div,
845 dst_map->n_div - div_off - src_map->n_div);
848 static void copy_div(struct isl_basic_map *dst_map, isl_int *dst,
849 struct isl_basic_map *src_map, isl_int *src,
850 unsigned in_off, unsigned out_off, unsigned div_off)
852 isl_int_set(dst[0], src[0]);
853 copy_constraint(dst_map, dst+1, src_map, src+1, in_off, out_off, div_off);
856 static struct isl_basic_map *add_constraints(struct isl_basic_map *bmap1,
857 struct isl_basic_map *bmap2, unsigned i_pos, unsigned o_pos)
862 if (!bmap1 || !bmap2)
865 div_off = bmap1->n_div;
867 for (i = 0; i < bmap2->n_eq; ++i) {
868 int i1 = isl_basic_map_alloc_equality(bmap1);
871 copy_constraint(bmap1, bmap1->eq[i1], bmap2, bmap2->eq[i],
872 i_pos, o_pos, div_off);
875 for (i = 0; i < bmap2->n_ineq; ++i) {
876 int i1 = isl_basic_map_alloc_inequality(bmap1);
879 copy_constraint(bmap1, bmap1->ineq[i1], bmap2, bmap2->ineq[i],
880 i_pos, o_pos, div_off);
883 for (i = 0; i < bmap2->n_div; ++i) {
884 int i1 = isl_basic_map_alloc_div(bmap1);
887 copy_div(bmap1, bmap1->div[i1], bmap2, bmap2->div[i],
888 i_pos, o_pos, div_off);
891 isl_basic_map_free(bmap2);
896 isl_basic_map_free(bmap1);
897 isl_basic_map_free(bmap2);
901 static void copy_constraint_dim_map(isl_int *dst, isl_int *src,
902 struct isl_dim_map *dim_map)
906 for (i = 0; i < dim_map->len; ++i) {
907 if (dim_map->pos[i] < 0)
908 isl_int_set_si(dst[i], 0);
910 isl_int_set(dst[i], src[dim_map->pos[i]]);
914 static void copy_div_dim_map(isl_int *dst, isl_int *src,
915 struct isl_dim_map *dim_map)
917 isl_int_set(dst[0], src[0]);
918 copy_constraint_dim_map(dst+1, src+1, dim_map);
921 static struct isl_basic_map *add_constraints_dim_map(struct isl_basic_map *dst,
922 struct isl_basic_map *src, struct isl_dim_map *dim_map)
926 if (!src || !dst || !dim_map)
929 for (i = 0; i < src->n_eq; ++i) {
930 int i1 = isl_basic_map_alloc_equality(dst);
933 copy_constraint_dim_map(dst->eq[i1], src->eq[i], dim_map);
936 for (i = 0; i < src->n_ineq; ++i) {
937 int i1 = isl_basic_map_alloc_inequality(dst);
940 copy_constraint_dim_map(dst->ineq[i1], src->ineq[i], dim_map);
943 for (i = 0; i < src->n_div; ++i) {
944 int i1 = isl_basic_map_alloc_div(dst);
947 copy_div_dim_map(dst->div[i1], src->div[i], dim_map);
951 isl_basic_map_free(src);
956 isl_basic_map_free(src);
957 isl_basic_map_free(dst);
961 struct isl_basic_set *isl_basic_set_add_constraints(struct isl_basic_set *bset1,
962 struct isl_basic_set *bset2, unsigned pos)
964 return (struct isl_basic_set *)
965 add_constraints((struct isl_basic_map *)bset1,
966 (struct isl_basic_map *)bset2, 0, pos);
969 struct isl_basic_map *isl_basic_map_extend_dim(struct isl_basic_map *base,
970 struct isl_dim *dim, unsigned extra,
971 unsigned n_eq, unsigned n_ineq)
973 struct isl_basic_map *ext;
983 dims_ok = isl_dim_equal(base->dim, dim) &&
984 base->extra >= base->n_div + extra;
986 if (dims_ok && room_for_con(base, n_eq + n_ineq) &&
987 room_for_ineq(base, n_ineq)) {
992 isl_assert(base->ctx, base->dim->nparam <= dim->nparam, goto error);
993 isl_assert(base->ctx, base->dim->n_in <= dim->n_in, goto error);
994 isl_assert(base->ctx, base->dim->n_out <= dim->n_out, goto error);
995 extra += base->extra;
997 n_ineq += base->n_ineq;
999 ext = isl_basic_map_alloc_dim(dim, extra, n_eq, n_ineq);
1005 ext->sample = isl_vec_copy(base->sample);
1006 flags = base->flags;
1007 ext = add_constraints(ext, base, 0, 0);
1010 ISL_F_CLR(ext, ISL_BASIC_SET_FINAL);
1017 isl_basic_map_free(base);
1021 struct isl_basic_set *isl_basic_set_extend_dim(struct isl_basic_set *base,
1022 struct isl_dim *dim, unsigned extra,
1023 unsigned n_eq, unsigned n_ineq)
1025 return (struct isl_basic_set *)
1026 isl_basic_map_extend_dim((struct isl_basic_map *)base, dim,
1027 extra, n_eq, n_ineq);
1030 struct isl_basic_map *isl_basic_map_extend_constraints(
1031 struct isl_basic_map *base, unsigned n_eq, unsigned n_ineq)
1035 return isl_basic_map_extend_dim(base, isl_dim_copy(base->dim),
1039 struct isl_basic_map *isl_basic_map_extend(struct isl_basic_map *base,
1040 unsigned nparam, unsigned n_in, unsigned n_out, unsigned extra,
1041 unsigned n_eq, unsigned n_ineq)
1043 struct isl_basic_map *bmap;
1044 struct isl_dim *dim;
1048 dim = isl_dim_alloc(base->ctx, nparam, n_in, n_out);
1052 bmap = isl_basic_map_extend_dim(base, dim, extra, n_eq, n_ineq);
1055 isl_basic_map_free(base);
1059 struct isl_basic_set *isl_basic_set_extend(struct isl_basic_set *base,
1060 unsigned nparam, unsigned dim, unsigned extra,
1061 unsigned n_eq, unsigned n_ineq)
1063 return (struct isl_basic_set *)
1064 isl_basic_map_extend((struct isl_basic_map *)base,
1065 nparam, 0, dim, extra, n_eq, n_ineq);
1068 struct isl_basic_set *isl_basic_set_extend_constraints(
1069 struct isl_basic_set *base, unsigned n_eq, unsigned n_ineq)
1071 return (struct isl_basic_set *)
1072 isl_basic_map_extend_constraints((struct isl_basic_map *)base,
1076 struct isl_basic_set *isl_basic_set_cow(struct isl_basic_set *bset)
1078 return (struct isl_basic_set *)
1079 isl_basic_map_cow((struct isl_basic_map *)bset);
1082 struct isl_basic_map *isl_basic_map_cow(struct isl_basic_map *bmap)
1087 if (bmap->ref > 1) {
1089 bmap = isl_basic_map_dup(bmap);
1092 ISL_F_CLR(bmap, ISL_BASIC_SET_FINAL);
1096 struct isl_set *isl_set_cow(struct isl_set *set)
1104 return isl_set_dup(set);
1107 struct isl_map *isl_map_cow(struct isl_map *map)
1115 return isl_map_dup(map);
1118 static void swap_vars(struct isl_blk blk, isl_int *a,
1119 unsigned a_len, unsigned b_len)
1121 isl_seq_cpy(blk.data, a+a_len, b_len);
1122 isl_seq_cpy(blk.data+b_len, a, a_len);
1123 isl_seq_cpy(a, blk.data, b_len+a_len);
1126 struct isl_basic_set *isl_basic_set_swap_vars(
1127 struct isl_basic_set *bset, unsigned n)
1137 nparam = isl_basic_set_n_param(bset);
1138 dim = isl_basic_set_n_dim(bset);
1139 isl_assert(bset->ctx, n <= dim, goto error);
1144 bset = isl_basic_set_cow(bset);
1148 blk = isl_blk_alloc(bset->ctx, dim);
1149 if (isl_blk_is_error(blk))
1152 for (i = 0; i < bset->n_eq; ++i)
1154 bset->eq[i]+1+nparam, n, dim - n);
1156 for (i = 0; i < bset->n_ineq; ++i)
1158 bset->ineq[i]+1+nparam, n, dim - n);
1160 for (i = 0; i < bset->n_div; ++i)
1162 bset->div[i]+1+1+nparam, n, dim - n);
1164 isl_blk_free(bset->ctx, blk);
1166 ISL_F_CLR(bset, ISL_BASIC_SET_NORMALIZED);
1167 return isl_basic_set_gauss(bset, NULL);
1169 isl_basic_set_free(bset);
1173 struct isl_set *isl_set_swap_vars(struct isl_set *set, unsigned n)
1176 set = isl_set_cow(set);
1180 for (i = 0; i < set->n; ++i) {
1181 set->p[i] = isl_basic_set_swap_vars(set->p[i], n);
1187 ISL_F_CLR(set, ISL_SET_NORMALIZED);
1191 struct isl_basic_map *isl_basic_map_set_to_empty(struct isl_basic_map *bmap)
1197 total = isl_basic_map_total_dim(bmap);
1198 isl_basic_map_free_div(bmap, bmap->n_div);
1199 isl_basic_map_free_inequality(bmap, bmap->n_ineq);
1201 isl_basic_map_free_equality(bmap, bmap->n_eq-1);
1203 i = isl_basic_map_alloc_equality(bmap);
1207 isl_int_set_si(bmap->eq[i][0], 1);
1208 isl_seq_clr(bmap->eq[i]+1, total);
1209 ISL_F_SET(bmap, ISL_BASIC_MAP_EMPTY);
1210 isl_vec_free(bmap->sample);
1211 bmap->sample = NULL;
1212 return isl_basic_map_finalize(bmap);
1214 isl_basic_map_free(bmap);
1218 struct isl_basic_set *isl_basic_set_set_to_empty(struct isl_basic_set *bset)
1220 return (struct isl_basic_set *)
1221 isl_basic_map_set_to_empty((struct isl_basic_map *)bset);
1224 void isl_basic_map_swap_div(struct isl_basic_map *bmap, int a, int b)
1227 unsigned off = isl_dim_total(bmap->dim);
1228 isl_int *t = bmap->div[a];
1229 bmap->div[a] = bmap->div[b];
1232 for (i = 0; i < bmap->n_eq; ++i)
1233 isl_int_swap(bmap->eq[i][1+off+a], bmap->eq[i][1+off+b]);
1235 for (i = 0; i < bmap->n_ineq; ++i)
1236 isl_int_swap(bmap->ineq[i][1+off+a], bmap->ineq[i][1+off+b]);
1238 for (i = 0; i < bmap->n_div; ++i)
1239 isl_int_swap(bmap->div[i][1+1+off+a], bmap->div[i][1+1+off+b]);
1240 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1243 /* Eliminate the specified n dimensions starting at first from the
1244 * constraints using Fourier-Motzkin. The dimensions themselves
1247 __isl_give isl_map *isl_map_eliminate(__isl_take isl_map *map,
1248 enum isl_dim_type type, unsigned first, unsigned n)
1257 map = isl_map_cow(map);
1260 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
1261 first += pos(map->dim, type) - 1;
1263 for (i = 0; i < map->n; ++i) {
1264 map->p[i] = isl_basic_map_eliminate_vars(map->p[i], first, n);
1274 /* Eliminate the specified n dimensions starting at first from the
1275 * constraints using Fourier-Motzkin. The dimensions themselves
1278 __isl_give isl_set *isl_set_eliminate(__isl_take isl_set *set,
1279 enum isl_dim_type type, unsigned first, unsigned n)
1281 return (isl_set *)isl_map_eliminate((isl_map *)set, type, first, n);
1284 /* Eliminate the specified n dimensions starting at first from the
1285 * constraints using Fourier-Motzkin. The dimensions themselves
1288 __isl_give isl_set *isl_set_eliminate_dims(__isl_take isl_set *set,
1289 unsigned first, unsigned n)
1291 return isl_set_eliminate(set, isl_dim_set, first, n);
1294 /* Project out n dimensions starting at first using Fourier-Motzkin */
1295 struct isl_set *isl_set_remove_dims(struct isl_set *set,
1296 unsigned first, unsigned n)
1298 set = isl_set_eliminate_dims(set, first, n);
1299 set = isl_set_drop_dims(set, first, n);
1303 struct isl_basic_set *isl_basic_set_remove_divs(struct isl_basic_set *bset)
1305 bset = isl_basic_set_eliminate_vars(bset, isl_dim_total(bset->dim),
1313 struct isl_set *isl_set_remove_divs(struct isl_set *set)
1322 set = isl_set_cow(set);
1326 for (i = 0; i < set->n; ++i) {
1327 set->p[i] = isl_basic_set_remove_divs(set->p[i]);
1337 struct isl_basic_map *isl_basic_map_remove(struct isl_basic_map *bmap,
1338 enum isl_dim_type type, unsigned first, unsigned n)
1342 isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
1346 bmap = isl_basic_map_eliminate_vars(bmap,
1347 isl_basic_map_offset(bmap, type) - 1 + first, n);
1350 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY) && type == isl_dim_div)
1352 bmap = isl_basic_map_drop(bmap, type, first, n);
1355 isl_basic_map_free(bmap);
1359 __isl_give isl_basic_set *isl_basic_set_remove(__isl_take isl_basic_set *bset,
1360 enum isl_dim_type type, unsigned first, unsigned n)
1362 return (isl_basic_set *)
1363 isl_basic_map_remove((isl_basic_map *)bset, type, first, n);
1366 struct isl_map *isl_map_remove(struct isl_map *map,
1367 enum isl_dim_type type, unsigned first, unsigned n)
1374 map = isl_map_cow(map);
1377 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
1379 for (i = 0; i < map->n; ++i) {
1380 map->p[i] = isl_basic_map_eliminate_vars(map->p[i],
1381 isl_basic_map_offset(map->p[i], type) - 1 + first, n);
1385 map = isl_map_drop(map, type, first, n);
1392 __isl_give isl_set *isl_set_remove(__isl_take isl_set *bset,
1393 enum isl_dim_type type, unsigned first, unsigned n)
1395 return (isl_set *)isl_map_remove((isl_map *)bset, type, first, n);
1398 /* Project out n inputs starting at first using Fourier-Motzkin */
1399 struct isl_map *isl_map_remove_inputs(struct isl_map *map,
1400 unsigned first, unsigned n)
1402 return isl_map_remove(map, isl_dim_in, first, n);
1405 /* Project out n dimensions starting at first using Fourier-Motzkin */
1406 struct isl_basic_set *isl_basic_set_remove_dims(struct isl_basic_set *bset,
1407 unsigned first, unsigned n)
1409 unsigned nparam = isl_basic_set_n_param(bset);
1410 bset = isl_basic_set_eliminate_vars(bset, nparam + first, n);
1411 bset = isl_basic_set_drop_dims(bset, first, n);
1415 static void dump_term(struct isl_basic_map *bmap,
1416 isl_int c, int pos, FILE *out)
1419 unsigned in = isl_basic_map_n_in(bmap);
1420 unsigned dim = in + isl_basic_map_n_out(bmap);
1421 unsigned nparam = isl_basic_map_n_param(bmap);
1423 isl_int_print(out, c, 0);
1425 if (!isl_int_is_one(c))
1426 isl_int_print(out, c, 0);
1427 if (pos < 1 + nparam) {
1428 name = isl_dim_get_name(bmap->dim,
1429 isl_dim_param, pos - 1);
1431 fprintf(out, "%s", name);
1433 fprintf(out, "p%d", pos - 1);
1434 } else if (pos < 1 + nparam + in)
1435 fprintf(out, "i%d", pos - 1 - nparam);
1436 else if (pos < 1 + nparam + dim)
1437 fprintf(out, "o%d", pos - 1 - nparam - in);
1439 fprintf(out, "e%d", pos - 1 - nparam - dim);
1443 static void dump_constraint_sign(struct isl_basic_map *bmap, isl_int *c,
1444 int sign, FILE *out)
1448 unsigned len = 1 + isl_basic_map_total_dim(bmap);
1452 for (i = 0, first = 1; i < len; ++i) {
1453 if (isl_int_sgn(c[i]) * sign <= 0)
1456 fprintf(out, " + ");
1458 isl_int_abs(v, c[i]);
1459 dump_term(bmap, v, i, out);
1466 static void dump_constraint(struct isl_basic_map *bmap, isl_int *c,
1467 const char *op, FILE *out, int indent)
1471 fprintf(out, "%*s", indent, "");
1473 dump_constraint_sign(bmap, c, 1, out);
1474 fprintf(out, " %s ", op);
1475 dump_constraint_sign(bmap, c, -1, out);
1479 for (i = bmap->n_div; i < bmap->extra; ++i) {
1480 if (isl_int_is_zero(c[1+isl_dim_total(bmap->dim)+i]))
1482 fprintf(out, "%*s", indent, "");
1483 fprintf(out, "ERROR: unused div coefficient not zero\n");
1488 static void dump_constraints(struct isl_basic_map *bmap,
1489 isl_int **c, unsigned n,
1490 const char *op, FILE *out, int indent)
1494 for (i = 0; i < n; ++i)
1495 dump_constraint(bmap, c[i], op, out, indent);
1498 static void dump_affine(struct isl_basic_map *bmap, isl_int *exp, FILE *out)
1502 unsigned total = isl_basic_map_total_dim(bmap);
1504 for (j = 0; j < 1 + total; ++j) {
1505 if (isl_int_is_zero(exp[j]))
1507 if (!first && isl_int_is_pos(exp[j]))
1509 dump_term(bmap, exp[j], j, out);
1514 static void dump(struct isl_basic_map *bmap, FILE *out, int indent)
1518 dump_constraints(bmap, bmap->eq, bmap->n_eq, "=", out, indent);
1519 dump_constraints(bmap, bmap->ineq, bmap->n_ineq, ">=", out, indent);
1521 for (i = 0; i < bmap->n_div; ++i) {
1522 fprintf(out, "%*s", indent, "");
1523 fprintf(out, "e%d = [(", i);
1524 dump_affine(bmap, bmap->div[i]+1, out);
1526 isl_int_print(out, bmap->div[i][0], 0);
1527 fprintf(out, "]\n");
1531 void isl_basic_set_dump(struct isl_basic_set *bset, FILE *out, int indent)
1534 fprintf(out, "null basic set\n");
1538 fprintf(out, "%*s", indent, "");
1539 fprintf(out, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n",
1540 bset->ref, bset->dim->nparam, bset->dim->n_out,
1541 bset->extra, bset->flags);
1542 dump((struct isl_basic_map *)bset, out, indent);
1545 void isl_basic_map_dump(struct isl_basic_map *bmap, FILE *out, int indent)
1548 fprintf(out, "null basic map\n");
1552 fprintf(out, "%*s", indent, "");
1553 fprintf(out, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, "
1554 "flags: %x, n_name: %d\n",
1556 bmap->dim->nparam, bmap->dim->n_in, bmap->dim->n_out,
1557 bmap->extra, bmap->flags, bmap->dim->n_name);
1558 dump(bmap, out, indent);
1561 int isl_inequality_negate(struct isl_basic_map *bmap, unsigned pos)
1566 total = isl_basic_map_total_dim(bmap);
1567 isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
1568 isl_seq_neg(bmap->ineq[pos], bmap->ineq[pos], 1 + total);
1569 isl_int_sub_ui(bmap->ineq[pos][0], bmap->ineq[pos][0], 1);
1570 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1574 struct isl_set *isl_set_alloc_dim(struct isl_dim *dim, int n, unsigned flags)
1576 struct isl_set *set;
1580 isl_assert(dim->ctx, dim->n_in == 0, return NULL);
1581 isl_assert(dim->ctx, n >= 0, return NULL);
1582 set = isl_alloc(dim->ctx, struct isl_set,
1583 sizeof(struct isl_set) +
1584 (n - 1) * sizeof(struct isl_basic_set *));
1588 set->ctx = dim->ctx;
1589 isl_ctx_ref(set->ctx);
1601 struct isl_set *isl_set_alloc(struct isl_ctx *ctx,
1602 unsigned nparam, unsigned dim, int n, unsigned flags)
1604 struct isl_set *set;
1605 struct isl_dim *dims;
1607 dims = isl_dim_alloc(ctx, nparam, 0, dim);
1611 set = isl_set_alloc_dim(dims, n, flags);
1615 /* Make sure "map" has room for at least "n" more basic maps.
1617 struct isl_map *isl_map_grow(struct isl_map *map, int n)
1620 struct isl_map *grown = NULL;
1624 isl_assert(map->ctx, n >= 0, goto error);
1625 if (map->n + n <= map->size)
1627 grown = isl_map_alloc_dim(isl_map_get_dim(map), map->n + n, map->flags);
1630 for (i = 0; i < map->n; ++i) {
1631 grown->p[i] = isl_basic_map_copy(map->p[i]);
1639 isl_map_free(grown);
1644 /* Make sure "set" has room for at least "n" more basic sets.
1646 struct isl_set *isl_set_grow(struct isl_set *set, int n)
1648 return (struct isl_set *)isl_map_grow((struct isl_map *)set, n);
1651 struct isl_set *isl_set_dup(struct isl_set *set)
1654 struct isl_set *dup;
1659 dup = isl_set_alloc_dim(isl_dim_copy(set->dim), set->n, set->flags);
1662 for (i = 0; i < set->n; ++i)
1663 dup = isl_set_add_basic_set(dup, isl_basic_set_copy(set->p[i]));
1667 struct isl_set *isl_set_from_basic_set(struct isl_basic_set *bset)
1669 struct isl_set *set;
1674 set = isl_set_alloc_dim(isl_dim_copy(bset->dim), 1, ISL_MAP_DISJOINT);
1676 isl_basic_set_free(bset);
1679 return isl_set_add_basic_set(set, bset);
1682 struct isl_map *isl_map_from_basic_map(struct isl_basic_map *bmap)
1684 struct isl_map *map;
1689 map = isl_map_alloc_dim(isl_dim_copy(bmap->dim), 1, ISL_MAP_DISJOINT);
1691 isl_basic_map_free(bmap);
1694 return isl_map_add_basic_map(map, bmap);
1697 __isl_give isl_set *isl_set_add_basic_set(__isl_take isl_set *set,
1698 __isl_take isl_basic_set *bset)
1700 return (struct isl_set *)isl_map_add_basic_map((struct isl_map *)set,
1701 (struct isl_basic_map *)bset);
1704 void isl_set_free(struct isl_set *set)
1714 isl_ctx_deref(set->ctx);
1715 for (i = 0; i < set->n; ++i)
1716 isl_basic_set_free(set->p[i]);
1717 isl_dim_free(set->dim);
1721 void isl_set_dump(struct isl_set *set, FILE *out, int indent)
1726 fprintf(out, "null set\n");
1730 fprintf(out, "%*s", indent, "");
1731 fprintf(out, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
1732 set->ref, set->n, set->dim->nparam, set->dim->n_out,
1734 for (i = 0; i < set->n; ++i) {
1735 fprintf(out, "%*s", indent, "");
1736 fprintf(out, "basic set %d:\n", i);
1737 isl_basic_set_dump(set->p[i], out, indent+4);
1741 void isl_map_dump(struct isl_map *map, FILE *out, int indent)
1746 fprintf(out, "null map\n");
1750 fprintf(out, "%*s", indent, "");
1751 fprintf(out, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, "
1752 "flags: %x, n_name: %d\n",
1753 map->ref, map->n, map->dim->nparam, map->dim->n_in,
1754 map->dim->n_out, map->flags, map->dim->n_name);
1755 for (i = 0; i < map->n; ++i) {
1756 fprintf(out, "%*s", indent, "");
1757 fprintf(out, "basic map %d:\n", i);
1758 isl_basic_map_dump(map->p[i], out, indent+4);
1762 struct isl_basic_map *isl_basic_map_intersect_domain(
1763 struct isl_basic_map *bmap, struct isl_basic_set *bset)
1765 struct isl_basic_map *bmap_domain;
1766 struct isl_dim *dim;
1771 isl_assert(bset->ctx, isl_dim_match(bmap->dim, isl_dim_param,
1772 bset->dim, isl_dim_param), goto error);
1774 if (isl_dim_size(bset->dim, isl_dim_set) != 0)
1775 isl_assert(bset->ctx,
1776 isl_basic_map_compatible_domain(bmap, bset), goto error);
1778 bmap = isl_basic_map_cow(bmap);
1781 bmap = isl_basic_map_extend_dim(bmap, isl_dim_copy(bmap->dim),
1782 bset->n_div, bset->n_eq, bset->n_ineq);
1783 dim = isl_dim_reverse(isl_dim_copy(bset->dim));
1784 bmap_domain = isl_basic_map_from_basic_set(bset, dim);
1785 bmap = add_constraints(bmap, bmap_domain, 0, 0);
1787 bmap = isl_basic_map_simplify(bmap);
1788 return isl_basic_map_finalize(bmap);
1790 isl_basic_map_free(bmap);
1791 isl_basic_set_free(bset);
1795 struct isl_basic_map *isl_basic_map_intersect_range(
1796 struct isl_basic_map *bmap, struct isl_basic_set *bset)
1798 struct isl_basic_map *bmap_range;
1803 isl_assert(bset->ctx, isl_dim_match(bmap->dim, isl_dim_param,
1804 bset->dim, isl_dim_param), goto error);
1806 if (isl_dim_size(bset->dim, isl_dim_set) != 0)
1807 isl_assert(bset->ctx,
1808 isl_basic_map_compatible_range(bmap, bset), goto error);
1810 bmap = isl_basic_map_cow(bmap);
1813 bmap = isl_basic_map_extend_dim(bmap, isl_dim_copy(bmap->dim),
1814 bset->n_div, bset->n_eq, bset->n_ineq);
1815 bmap_range = isl_basic_map_from_basic_set(bset, isl_dim_copy(bset->dim));
1816 bmap = add_constraints(bmap, bmap_range, 0, 0);
1818 bmap = isl_basic_map_simplify(bmap);
1819 return isl_basic_map_finalize(bmap);
1821 isl_basic_map_free(bmap);
1822 isl_basic_set_free(bset);
1826 int isl_basic_map_contains(struct isl_basic_map *bmap, struct isl_vec *vec)
1832 total = 1 + isl_basic_map_total_dim(bmap);
1833 if (total != vec->size)
1838 for (i = 0; i < bmap->n_eq; ++i) {
1839 isl_seq_inner_product(vec->el, bmap->eq[i], total, &s);
1840 if (!isl_int_is_zero(s)) {
1846 for (i = 0; i < bmap->n_ineq; ++i) {
1847 isl_seq_inner_product(vec->el, bmap->ineq[i], total, &s);
1848 if (isl_int_is_neg(s)) {
1859 int isl_basic_set_contains(struct isl_basic_set *bset, struct isl_vec *vec)
1861 return isl_basic_map_contains((struct isl_basic_map *)bset, vec);
1864 struct isl_basic_map *isl_basic_map_intersect(
1865 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
1867 struct isl_vec *sample = NULL;
1869 if (!bmap1 || !bmap2)
1872 isl_assert(bmap1->ctx, isl_dim_match(bmap1->dim, isl_dim_param,
1873 bmap2->dim, isl_dim_param), goto error);
1874 if (isl_dim_total(bmap1->dim) ==
1875 isl_dim_size(bmap1->dim, isl_dim_param) &&
1876 isl_dim_total(bmap2->dim) !=
1877 isl_dim_size(bmap2->dim, isl_dim_param))
1878 return isl_basic_map_intersect(bmap2, bmap1);
1880 if (isl_dim_total(bmap2->dim) !=
1881 isl_dim_size(bmap2->dim, isl_dim_param))
1882 isl_assert(bmap1->ctx,
1883 isl_dim_equal(bmap1->dim, bmap2->dim), goto error);
1885 if (bmap1->sample &&
1886 isl_basic_map_contains(bmap1, bmap1->sample) > 0 &&
1887 isl_basic_map_contains(bmap2, bmap1->sample) > 0)
1888 sample = isl_vec_copy(bmap1->sample);
1889 else if (bmap2->sample &&
1890 isl_basic_map_contains(bmap1, bmap2->sample) > 0 &&
1891 isl_basic_map_contains(bmap2, bmap2->sample) > 0)
1892 sample = isl_vec_copy(bmap2->sample);
1894 bmap1 = isl_basic_map_cow(bmap1);
1897 bmap1 = isl_basic_map_extend_dim(bmap1, isl_dim_copy(bmap1->dim),
1898 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
1899 bmap1 = add_constraints(bmap1, bmap2, 0, 0);
1902 isl_vec_free(sample);
1904 isl_vec_free(bmap1->sample);
1905 bmap1->sample = sample;
1908 bmap1 = isl_basic_map_simplify(bmap1);
1909 return isl_basic_map_finalize(bmap1);
1912 isl_vec_free(sample);
1913 isl_basic_map_free(bmap1);
1914 isl_basic_map_free(bmap2);
1918 struct isl_basic_set *isl_basic_set_intersect(
1919 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
1921 return (struct isl_basic_set *)
1922 isl_basic_map_intersect(
1923 (struct isl_basic_map *)bset1,
1924 (struct isl_basic_map *)bset2);
1927 /* Special case of isl_map_intersect, where both map1 and map2
1928 * are convex, without any divs and such that either map1 or map2
1929 * contains a single constraint. This constraint is then simply
1930 * added to the other map.
1932 static __isl_give isl_map *map_intersect_add_constraint(
1933 __isl_take isl_map *map1, __isl_take isl_map *map2)
1935 struct isl_basic_map *bmap1;
1936 struct isl_basic_map *bmap2;
1938 isl_assert(map1->ctx, map1->n == 1, goto error);
1939 isl_assert(map2->ctx, map1->n == 1, goto error);
1940 isl_assert(map1->ctx, map1->p[0]->n_div == 0, goto error);
1941 isl_assert(map2->ctx, map1->p[0]->n_div == 0, goto error);
1943 if (map2->p[0]->n_eq + map2->p[0]->n_ineq != 1)
1944 return isl_map_intersect(map2, map1);
1946 isl_assert(map2->ctx,
1947 map2->p[0]->n_eq + map2->p[0]->n_ineq == 1, goto error);
1949 map1 = isl_map_cow(map1);
1952 if (isl_map_fast_is_empty(map1)) {
1956 map1->p[0] = isl_basic_map_cow(map1->p[0]);
1957 if (map2->p[0]->n_eq == 1)
1958 map1->p[0] = isl_basic_map_add_eq(map1->p[0], map2->p[0]->eq[0]);
1960 map1->p[0] = isl_basic_map_add_ineq(map1->p[0],
1961 map2->p[0]->ineq[0]);
1963 map1->p[0] = isl_basic_map_simplify(map1->p[0]);
1964 map1->p[0] = isl_basic_map_finalize(map1->p[0]);
1968 if (isl_basic_map_fast_is_empty(map1->p[0])) {
1969 isl_basic_map_free(map1->p[0]);
1982 struct isl_map *isl_map_intersect(struct isl_map *map1, struct isl_map *map2)
1985 struct isl_map *result;
1991 if (isl_map_fast_is_empty(map1)) {
1995 if (isl_map_fast_is_empty(map2)) {
2000 if (map1->n == 1 && map2->n == 1 &&
2001 map1->p[0]->n_div == 0 && map2->p[0]->n_div == 0 &&
2002 isl_dim_equal(map1->dim, map2->dim) &&
2003 (map1->p[0]->n_eq + map1->p[0]->n_ineq == 1 ||
2004 map2->p[0]->n_eq + map2->p[0]->n_ineq == 1))
2005 return map_intersect_add_constraint(map1, map2);
2006 isl_assert(map1->ctx, isl_dim_match(map1->dim, isl_dim_param,
2007 map2->dim, isl_dim_param), goto error);
2008 if (isl_dim_total(map1->dim) ==
2009 isl_dim_size(map1->dim, isl_dim_param) &&
2010 isl_dim_total(map2->dim) != isl_dim_size(map2->dim, isl_dim_param))
2011 return isl_map_intersect(map2, map1);
2013 if (isl_dim_total(map2->dim) != isl_dim_size(map2->dim, isl_dim_param))
2014 isl_assert(map1->ctx,
2015 isl_dim_equal(map1->dim, map2->dim), goto error);
2017 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
2018 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
2019 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
2021 result = isl_map_alloc_dim(isl_dim_copy(map1->dim),
2022 map1->n * map2->n, flags);
2025 for (i = 0; i < map1->n; ++i)
2026 for (j = 0; j < map2->n; ++j) {
2027 struct isl_basic_map *part;
2028 part = isl_basic_map_intersect(
2029 isl_basic_map_copy(map1->p[i]),
2030 isl_basic_map_copy(map2->p[j]));
2031 if (isl_basic_map_is_empty(part))
2032 isl_basic_map_free(part);
2034 result = isl_map_add_basic_map(result, part);
2047 struct isl_set *isl_set_intersect(struct isl_set *set1, struct isl_set *set2)
2049 return (struct isl_set *)
2050 isl_map_intersect((struct isl_map *)set1,
2051 (struct isl_map *)set2);
2054 struct isl_basic_map *isl_basic_map_reverse(struct isl_basic_map *bmap)
2056 struct isl_dim *dim;
2057 struct isl_basic_set *bset;
2062 bmap = isl_basic_map_cow(bmap);
2065 dim = isl_dim_reverse(isl_dim_copy(bmap->dim));
2066 in = isl_basic_map_n_in(bmap);
2067 bset = isl_basic_set_from_basic_map(bmap);
2068 bset = isl_basic_set_swap_vars(bset, in);
2069 return isl_basic_map_from_basic_set(bset, dim);
2072 __isl_give isl_basic_map *isl_basic_map_insert(__isl_take isl_basic_map *bmap,
2073 enum isl_dim_type type, unsigned pos, unsigned n)
2075 struct isl_dim *res_dim;
2076 struct isl_basic_map *res;
2077 struct isl_dim_map *dim_map;
2078 unsigned total, off;
2079 enum isl_dim_type t;
2087 res_dim = isl_dim_insert(isl_basic_map_get_dim(bmap), type, pos, n);
2089 total = isl_basic_map_total_dim(bmap) + n;
2090 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2092 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
2094 isl_dim_map_dim(dim_map, bmap->dim, t, off);
2096 unsigned size = isl_basic_map_dim(bmap, t);
2097 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2099 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2100 pos, size - pos, off + pos + n);
2102 off += isl_dim_size(res_dim, t);
2104 isl_dim_map_div(dim_map, bmap, off);
2106 res = isl_basic_map_alloc_dim(res_dim,
2107 bmap->n_div, bmap->n_eq, bmap->n_ineq);
2108 res = add_constraints_dim_map(res, bmap, dim_map);
2109 res = isl_basic_map_simplify(res);
2110 return isl_basic_map_finalize(res);
2113 __isl_give isl_basic_map *isl_basic_map_add(__isl_take isl_basic_map *bmap,
2114 enum isl_dim_type type, unsigned n)
2118 return isl_basic_map_insert(bmap, type,
2119 isl_basic_map_dim(bmap, type), n);
2122 __isl_give isl_basic_set *isl_basic_set_add(__isl_take isl_basic_set *bset,
2123 enum isl_dim_type type, unsigned n)
2127 isl_assert(bset->ctx, type != isl_dim_in, goto error);
2128 return (isl_basic_set *)isl_basic_map_add((isl_basic_map *)bset, type, n);
2130 isl_basic_set_free(bset);
2134 __isl_give isl_map *isl_map_insert(__isl_take isl_map *map,
2135 enum isl_dim_type type, unsigned pos, unsigned n)
2142 map = isl_map_cow(map);
2146 map->dim = isl_dim_insert(map->dim, type, pos, n);
2150 for (i = 0; i < map->n; ++i) {
2151 map->p[i] = isl_basic_map_insert(map->p[i], type, pos, n);
2162 __isl_give isl_map *isl_map_add(__isl_take isl_map *map,
2163 enum isl_dim_type type, unsigned n)
2167 return isl_map_insert(map, type, isl_map_dim(map, type), n);
2170 __isl_give isl_set *isl_set_add(__isl_take isl_set *set,
2171 enum isl_dim_type type, unsigned n)
2175 isl_assert(set->ctx, type != isl_dim_in, goto error);
2176 return (isl_set *)isl_map_add((isl_map *)set, type, n);
2182 __isl_give isl_basic_map *isl_basic_map_move_dims(
2183 __isl_take isl_basic_map *bmap,
2184 enum isl_dim_type dst_type, unsigned dst_pos,
2185 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2188 struct isl_dim_map *dim_map;
2189 struct isl_basic_map *res;
2190 enum isl_dim_type t;
2191 unsigned total, off;
2198 isl_assert(bmap->ctx, src_pos + n <= isl_basic_map_dim(bmap, src_type),
2201 if (dst_type == src_type && dst_pos == src_pos)
2204 isl_assert(bmap->ctx, dst_type != src_type, goto error);
2206 if (pos(bmap->dim, dst_type) + dst_pos ==
2207 pos(bmap->dim, src_type) + src_pos +
2208 ((src_type < dst_type) ? n : 0)) {
2209 bmap = isl_basic_map_cow(bmap);
2213 bmap->dim = isl_dim_move(bmap->dim, dst_type, dst_pos,
2214 src_type, src_pos, n);
2218 bmap = isl_basic_map_finalize(bmap);
2223 total = isl_basic_map_total_dim(bmap);
2224 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2227 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
2228 unsigned size = isl_dim_size(bmap->dim, t);
2229 if (t == dst_type) {
2230 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2233 isl_dim_map_dim_range(dim_map, bmap->dim, src_type,
2236 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2237 dst_pos, size - dst_pos, off);
2238 off += size - dst_pos;
2239 } else if (t == src_type) {
2240 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2243 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2244 src_pos + n, size - src_pos - n, off);
2245 off += size - src_pos - n;
2247 isl_dim_map_dim(dim_map, bmap->dim, t, off);
2251 isl_dim_map_div(dim_map, bmap, off);
2253 res = isl_basic_map_alloc_dim(isl_basic_map_get_dim(bmap),
2254 bmap->n_div, bmap->n_eq, bmap->n_ineq);
2255 bmap = add_constraints_dim_map(res, bmap, dim_map);
2257 bmap->dim = isl_dim_move(bmap->dim, dst_type, dst_pos,
2258 src_type, src_pos, n);
2262 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
2263 bmap = isl_basic_map_gauss(bmap, NULL);
2264 bmap = isl_basic_map_finalize(bmap);
2268 isl_basic_map_free(bmap);
2272 __isl_give isl_basic_set *isl_basic_set_move_dims(__isl_take isl_basic_set *bset,
2273 enum isl_dim_type dst_type, unsigned dst_pos,
2274 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2276 return (isl_basic_set *)isl_basic_map_move_dims(
2277 (isl_basic_map *)bset, dst_type, dst_pos, src_type, src_pos, n);
2280 __isl_give isl_set *isl_set_move_dims(__isl_take isl_set *set,
2281 enum isl_dim_type dst_type, unsigned dst_pos,
2282 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2286 isl_assert(set->ctx, dst_type != isl_dim_in, goto error);
2287 return (isl_set *)isl_map_move_dims((isl_map *)set, dst_type, dst_pos,
2288 src_type, src_pos, n);
2294 __isl_give isl_map *isl_map_move_dims(__isl_take isl_map *map,
2295 enum isl_dim_type dst_type, unsigned dst_pos,
2296 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2305 isl_assert(map->ctx, src_pos + n <= isl_map_dim(map, src_type),
2308 if (dst_type == src_type && dst_pos == src_pos)
2311 isl_assert(map->ctx, dst_type != src_type, goto error);
2313 map = isl_map_cow(map);
2317 map->dim = isl_dim_move(map->dim, dst_type, dst_pos, src_type, src_pos, n);
2321 for (i = 0; i < map->n; ++i) {
2322 map->p[i] = isl_basic_map_move_dims(map->p[i],
2324 src_type, src_pos, n);
2335 /* Move the specified dimensions to the last columns right before
2336 * the divs. Don't change the dimension specification of bmap.
2337 * That's the responsibility of the caller.
2339 static __isl_give isl_basic_map *move_last(__isl_take isl_basic_map *bmap,
2340 enum isl_dim_type type, unsigned first, unsigned n)
2342 struct isl_dim_map *dim_map;
2343 struct isl_basic_map *res;
2344 enum isl_dim_type t;
2345 unsigned total, off;
2349 if (pos(bmap->dim, type) + first + n == 1 + isl_dim_total(bmap->dim))
2352 total = isl_basic_map_total_dim(bmap);
2353 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2356 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
2357 unsigned size = isl_dim_size(bmap->dim, t);
2359 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2362 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2363 first, n, total - bmap->n_div - n);
2364 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2365 first + n, size - (first + n), off);
2366 off += size - (first + n);
2368 isl_dim_map_dim(dim_map, bmap->dim, t, off);
2372 isl_dim_map_div(dim_map, bmap, off + n);
2374 res = isl_basic_map_alloc_dim(isl_basic_map_get_dim(bmap),
2375 bmap->n_div, bmap->n_eq, bmap->n_ineq);
2376 res = add_constraints_dim_map(res, bmap, dim_map);
2380 /* Turn the n dimensions of type type, starting at first
2381 * into existentially quantified variables.
2383 __isl_give isl_basic_map *isl_basic_map_project_out(
2384 __isl_take isl_basic_map *bmap,
2385 enum isl_dim_type type, unsigned first, unsigned n)
2398 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL))
2399 return isl_basic_map_remove(bmap, type, first, n);
2401 isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
2404 bmap = move_last(bmap, type, first, n);
2405 bmap = isl_basic_map_cow(bmap);
2409 row_size = 1 + isl_dim_total(bmap->dim) + bmap->extra;
2410 old = bmap->block2.data;
2411 bmap->block2 = isl_blk_extend(bmap->ctx, bmap->block2,
2412 (bmap->extra + n) * (1 + row_size));
2413 if (!bmap->block2.data)
2415 new_div = isl_alloc_array(bmap->ctx, isl_int *, bmap->extra + n);
2418 for (i = 0; i < n; ++i) {
2419 new_div[i] = bmap->block2.data +
2420 (bmap->extra + i) * (1 + row_size);
2421 isl_seq_clr(new_div[i], 1 + row_size);
2423 for (i = 0; i < bmap->extra; ++i)
2424 new_div[n + i] = bmap->block2.data + (bmap->div[i] - old);
2426 bmap->div = new_div;
2430 bmap->dim = isl_dim_drop(bmap->dim, type, first, n);
2433 bmap = isl_basic_map_simplify(bmap);
2434 bmap = isl_basic_map_drop_redundant_divs(bmap);
2435 return isl_basic_map_finalize(bmap);
2437 isl_basic_map_free(bmap);
2441 /* Turn the n dimensions of type type, starting at first
2442 * into existentially quantified variables.
2444 struct isl_basic_set *isl_basic_set_project_out(struct isl_basic_set *bset,
2445 enum isl_dim_type type, unsigned first, unsigned n)
2447 return (isl_basic_set *)isl_basic_map_project_out(
2448 (isl_basic_map *)bset, type, first, n);
2451 /* Turn the n dimensions of type type, starting at first
2452 * into existentially quantified variables.
2454 __isl_give isl_map *isl_map_project_out(__isl_take isl_map *map,
2455 enum isl_dim_type type, unsigned first, unsigned n)
2465 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
2467 map = isl_map_cow(map);
2471 map->dim = isl_dim_drop(map->dim, type, first, n);
2475 for (i = 0; i < map->n; ++i) {
2476 map->p[i] = isl_basic_map_project_out(map->p[i], type, first, n);
2487 /* Turn the n dimensions of type type, starting at first
2488 * into existentially quantified variables.
2490 __isl_give isl_set *isl_set_project_out(__isl_take isl_set *set,
2491 enum isl_dim_type type, unsigned first, unsigned n)
2493 return (isl_set *)isl_map_project_out((isl_map *)set, type, first, n);
2496 static struct isl_basic_map *add_divs(struct isl_basic_map *bmap, unsigned n)
2500 for (i = 0; i < n; ++i) {
2501 j = isl_basic_map_alloc_div(bmap);
2504 isl_seq_clr(bmap->div[j], 1+1+isl_basic_map_total_dim(bmap));
2508 isl_basic_map_free(bmap);
2512 struct isl_basic_map *isl_basic_map_apply_range(
2513 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2515 struct isl_dim *dim_result = NULL;
2516 struct isl_basic_map *bmap;
2517 unsigned n_in, n_out, n, nparam, total, pos;
2518 struct isl_dim_map *dim_map1, *dim_map2;
2520 if (!bmap1 || !bmap2)
2523 dim_result = isl_dim_join(isl_dim_copy(bmap1->dim),
2524 isl_dim_copy(bmap2->dim));
2526 n_in = isl_basic_map_n_in(bmap1);
2527 n_out = isl_basic_map_n_out(bmap2);
2528 n = isl_basic_map_n_out(bmap1);
2529 nparam = isl_basic_map_n_param(bmap1);
2531 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + n;
2532 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
2533 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
2534 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
2535 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
2536 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
2537 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_in);
2538 isl_dim_map_div(dim_map1, bmap1, pos += n_out);
2539 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
2540 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
2541 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
2543 bmap = isl_basic_map_alloc_dim(dim_result,
2544 bmap1->n_div + bmap2->n_div + n,
2545 bmap1->n_eq + bmap2->n_eq,
2546 bmap1->n_ineq + bmap2->n_ineq);
2547 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
2548 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
2549 bmap = add_divs(bmap, n);
2550 bmap = isl_basic_map_simplify(bmap);
2551 bmap = isl_basic_map_drop_redundant_divs(bmap);
2552 return isl_basic_map_finalize(bmap);
2554 isl_basic_map_free(bmap1);
2555 isl_basic_map_free(bmap2);
2559 struct isl_basic_set *isl_basic_set_apply(
2560 struct isl_basic_set *bset, struct isl_basic_map *bmap)
2565 isl_assert(bset->ctx, isl_basic_map_compatible_domain(bmap, bset),
2568 return (struct isl_basic_set *)
2569 isl_basic_map_apply_range((struct isl_basic_map *)bset, bmap);
2571 isl_basic_set_free(bset);
2572 isl_basic_map_free(bmap);
2576 struct isl_basic_map *isl_basic_map_apply_domain(
2577 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2579 if (!bmap1 || !bmap2)
2582 isl_assert(bmap1->ctx,
2583 isl_basic_map_n_in(bmap1) == isl_basic_map_n_in(bmap2), goto error);
2584 isl_assert(bmap1->ctx,
2585 isl_basic_map_n_param(bmap1) == isl_basic_map_n_param(bmap2),
2588 bmap1 = isl_basic_map_reverse(bmap1);
2589 bmap1 = isl_basic_map_apply_range(bmap1, bmap2);
2590 return isl_basic_map_reverse(bmap1);
2592 isl_basic_map_free(bmap1);
2593 isl_basic_map_free(bmap2);
2597 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
2598 * A \cap B -> f(A) + f(B)
2600 struct isl_basic_map *isl_basic_map_sum(
2601 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2603 unsigned n_in, n_out, nparam, total, pos;
2604 struct isl_basic_map *bmap = NULL;
2605 struct isl_dim_map *dim_map1, *dim_map2;
2608 if (!bmap1 || !bmap2)
2611 isl_assert(bmap1->ctx, isl_dim_equal(bmap1->dim, bmap2->dim),
2614 nparam = isl_basic_map_n_param(bmap1);
2615 n_in = isl_basic_map_n_in(bmap1);
2616 n_out = isl_basic_map_n_out(bmap1);
2618 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + 2 * n_out;
2619 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
2620 dim_map2 = isl_dim_map_alloc(bmap2->ctx, total);
2621 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
2622 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos);
2623 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
2624 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
2625 isl_dim_map_div(dim_map1, bmap1, pos += n_in + n_out);
2626 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
2627 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
2628 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_out);
2630 bmap = isl_basic_map_alloc_dim(isl_dim_copy(bmap1->dim),
2631 bmap1->n_div + bmap2->n_div + 2 * n_out,
2632 bmap1->n_eq + bmap2->n_eq + n_out,
2633 bmap1->n_ineq + bmap2->n_ineq);
2634 for (i = 0; i < n_out; ++i) {
2635 int j = isl_basic_map_alloc_equality(bmap);
2638 isl_seq_clr(bmap->eq[j], 1+total);
2639 isl_int_set_si(bmap->eq[j][1+nparam+n_in+i], -1);
2640 isl_int_set_si(bmap->eq[j][1+pos+i], 1);
2641 isl_int_set_si(bmap->eq[j][1+pos-n_out+i], 1);
2643 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
2644 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
2645 bmap = add_divs(bmap, 2 * n_out);
2647 bmap = isl_basic_map_simplify(bmap);
2648 return isl_basic_map_finalize(bmap);
2650 isl_basic_map_free(bmap);
2651 isl_basic_map_free(bmap1);
2652 isl_basic_map_free(bmap2);
2656 /* Given two maps A -> f(A) and B -> g(B), construct a map
2657 * A \cap B -> f(A) + f(B)
2659 struct isl_map *isl_map_sum(struct isl_map *map1, struct isl_map *map2)
2661 struct isl_map *result;
2667 isl_assert(map1->ctx, isl_dim_equal(map1->dim, map2->dim), goto error);
2669 result = isl_map_alloc_dim(isl_dim_copy(map1->dim),
2670 map1->n * map2->n, 0);
2673 for (i = 0; i < map1->n; ++i)
2674 for (j = 0; j < map2->n; ++j) {
2675 struct isl_basic_map *part;
2676 part = isl_basic_map_sum(
2677 isl_basic_map_copy(map1->p[i]),
2678 isl_basic_map_copy(map2->p[j]));
2679 if (isl_basic_map_is_empty(part))
2680 isl_basic_map_free(part);
2682 result = isl_map_add_basic_map(result, part);
2695 __isl_give isl_set *isl_set_sum(__isl_take isl_set *set1,
2696 __isl_take isl_set *set2)
2698 return (isl_set *)isl_map_sum((isl_map *)set1, (isl_map *)set2);
2701 /* Given a basic map A -> f(A), construct A -> -f(A).
2703 struct isl_basic_map *isl_basic_map_neg(struct isl_basic_map *bmap)
2708 bmap = isl_basic_map_cow(bmap);
2712 n = isl_basic_map_dim(bmap, isl_dim_out);
2713 off = isl_basic_map_offset(bmap, isl_dim_out);
2714 for (i = 0; i < bmap->n_eq; ++i)
2715 for (j = 0; j < n; ++j)
2716 isl_int_neg(bmap->eq[i][off+j], bmap->eq[i][off+j]);
2717 for (i = 0; i < bmap->n_ineq; ++i)
2718 for (j = 0; j < n; ++j)
2719 isl_int_neg(bmap->ineq[i][off+j], bmap->ineq[i][off+j]);
2720 for (i = 0; i < bmap->n_div; ++i)
2721 for (j = 0; j < n; ++j)
2722 isl_int_neg(bmap->div[i][1+off+j], bmap->div[i][1+off+j]);
2723 return isl_basic_map_finalize(bmap);
2726 /* Given a map A -> f(A), construct A -> -f(A).
2728 struct isl_map *isl_map_neg(struct isl_map *map)
2732 map = isl_map_cow(map);
2736 for (i = 0; i < map->n; ++i) {
2737 map->p[i] = isl_basic_map_neg(map->p[i]);
2748 __isl_give isl_set *isl_set_neg(__isl_take isl_set *set)
2750 return (isl_set *)isl_map_neg((isl_map *)set);
2753 /* Given a basic map A -> f(A) and an integer d, construct a basic map
2754 * A -> floor(f(A)/d).
2756 struct isl_basic_map *isl_basic_map_floordiv(struct isl_basic_map *bmap,
2759 unsigned n_in, n_out, nparam, total, pos;
2760 struct isl_basic_map *result = NULL;
2761 struct isl_dim_map *dim_map;
2767 nparam = isl_basic_map_n_param(bmap);
2768 n_in = isl_basic_map_n_in(bmap);
2769 n_out = isl_basic_map_n_out(bmap);
2771 total = nparam + n_in + n_out + bmap->n_div + n_out;
2772 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2773 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_param, pos = 0);
2774 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_in, pos += nparam);
2775 isl_dim_map_div(dim_map, bmap, pos += n_in + n_out);
2776 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_out, pos += bmap->n_div);
2778 result = isl_basic_map_alloc_dim(isl_dim_copy(bmap->dim),
2779 bmap->n_div + n_out,
2780 bmap->n_eq, bmap->n_ineq + 2 * n_out);
2781 result = add_constraints_dim_map(result, bmap, dim_map);
2782 result = add_divs(result, n_out);
2783 for (i = 0; i < n_out; ++i) {
2785 j = isl_basic_map_alloc_inequality(result);
2788 isl_seq_clr(result->ineq[j], 1+total);
2789 isl_int_neg(result->ineq[j][1+nparam+n_in+i], d);
2790 isl_int_set_si(result->ineq[j][1+pos+i], 1);
2791 j = isl_basic_map_alloc_inequality(result);
2794 isl_seq_clr(result->ineq[j], 1+total);
2795 isl_int_set(result->ineq[j][1+nparam+n_in+i], d);
2796 isl_int_set_si(result->ineq[j][1+pos+i], -1);
2797 isl_int_sub_ui(result->ineq[j][0], d, 1);
2800 result = isl_basic_map_simplify(result);
2801 return isl_basic_map_finalize(result);
2803 isl_basic_map_free(result);
2807 /* Given a map A -> f(A) and an integer d, construct a map
2808 * A -> floor(f(A)/d).
2810 struct isl_map *isl_map_floordiv(struct isl_map *map, isl_int d)
2814 map = isl_map_cow(map);
2818 ISL_F_CLR(map, ISL_MAP_DISJOINT);
2819 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
2820 for (i = 0; i < map->n; ++i) {
2821 map->p[i] = isl_basic_map_floordiv(map->p[i], d);
2832 static struct isl_basic_map *var_equal(struct isl_basic_map *bmap, unsigned pos)
2838 i = isl_basic_map_alloc_equality(bmap);
2841 nparam = isl_basic_map_n_param(bmap);
2842 n_in = isl_basic_map_n_in(bmap);
2843 isl_seq_clr(bmap->eq[i], 1 + isl_basic_map_total_dim(bmap));
2844 isl_int_set_si(bmap->eq[i][1+nparam+pos], -1);
2845 isl_int_set_si(bmap->eq[i][1+nparam+n_in+pos], 1);
2846 return isl_basic_map_finalize(bmap);
2848 isl_basic_map_free(bmap);
2852 /* Add a constraints to "bmap" expressing i_pos < o_pos
2854 static struct isl_basic_map *var_less(struct isl_basic_map *bmap, unsigned pos)
2860 i = isl_basic_map_alloc_inequality(bmap);
2863 nparam = isl_basic_map_n_param(bmap);
2864 n_in = isl_basic_map_n_in(bmap);
2865 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
2866 isl_int_set_si(bmap->ineq[i][0], -1);
2867 isl_int_set_si(bmap->ineq[i][1+nparam+pos], -1);
2868 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], 1);
2869 return isl_basic_map_finalize(bmap);
2871 isl_basic_map_free(bmap);
2875 /* Add a constraint to "bmap" expressing i_pos <= o_pos
2877 static __isl_give isl_basic_map *var_less_or_equal(
2878 __isl_take isl_basic_map *bmap, unsigned pos)
2884 i = isl_basic_map_alloc_inequality(bmap);
2887 nparam = isl_basic_map_n_param(bmap);
2888 n_in = isl_basic_map_n_in(bmap);
2889 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
2890 isl_int_set_si(bmap->ineq[i][1+nparam+pos], -1);
2891 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], 1);
2892 return isl_basic_map_finalize(bmap);
2894 isl_basic_map_free(bmap);
2898 /* Add a constraints to "bmap" expressing i_pos > o_pos
2900 static struct isl_basic_map *var_more(struct isl_basic_map *bmap, unsigned pos)
2906 i = isl_basic_map_alloc_inequality(bmap);
2909 nparam = isl_basic_map_n_param(bmap);
2910 n_in = isl_basic_map_n_in(bmap);
2911 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
2912 isl_int_set_si(bmap->ineq[i][0], -1);
2913 isl_int_set_si(bmap->ineq[i][1+nparam+pos], 1);
2914 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], -1);
2915 return isl_basic_map_finalize(bmap);
2917 isl_basic_map_free(bmap);
2921 /* Add a constraint to "bmap" expressing i_pos >= o_pos
2923 static __isl_give isl_basic_map *var_more_or_equal(
2924 __isl_take isl_basic_map *bmap, unsigned pos)
2930 i = isl_basic_map_alloc_inequality(bmap);
2933 nparam = isl_basic_map_n_param(bmap);
2934 n_in = isl_basic_map_n_in(bmap);
2935 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
2936 isl_int_set_si(bmap->ineq[i][1+nparam+pos], 1);
2937 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], -1);
2938 return isl_basic_map_finalize(bmap);
2940 isl_basic_map_free(bmap);
2944 struct isl_basic_map *isl_basic_map_equal(struct isl_dim *dim, unsigned n_equal)
2947 struct isl_basic_map *bmap;
2948 bmap = isl_basic_map_alloc_dim(dim, 0, n_equal, 0);
2951 for (i = 0; i < n_equal && bmap; ++i)
2952 bmap = var_equal(bmap, i);
2953 return isl_basic_map_finalize(bmap);
2956 /* Return a relation on of dimension "dim" expressing i_[0..pos] << o_[0..pos]
2958 struct isl_basic_map *isl_basic_map_less_at(struct isl_dim *dim, unsigned pos)
2961 struct isl_basic_map *bmap;
2962 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
2965 for (i = 0; i < pos && bmap; ++i)
2966 bmap = var_equal(bmap, i);
2968 bmap = var_less(bmap, pos);
2969 return isl_basic_map_finalize(bmap);
2972 /* Return a relation on of dimension "dim" expressing i_[0..pos] <<= o_[0..pos]
2974 __isl_give isl_basic_map *isl_basic_map_less_or_equal_at(
2975 __isl_take isl_dim *dim, unsigned pos)
2978 isl_basic_map *bmap;
2980 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
2981 for (i = 0; i < pos; ++i)
2982 bmap = var_equal(bmap, i);
2983 bmap = var_less_or_equal(bmap, pos);
2984 return isl_basic_map_finalize(bmap);
2987 /* Return a relation on pairs of sets of dimension "dim" expressing i_pos > o_pos
2989 struct isl_basic_map *isl_basic_map_more_at(struct isl_dim *dim, unsigned pos)
2992 struct isl_basic_map *bmap;
2993 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
2996 for (i = 0; i < pos && bmap; ++i)
2997 bmap = var_equal(bmap, i);
2999 bmap = var_more(bmap, pos);
3000 return isl_basic_map_finalize(bmap);
3003 /* Return a relation on of dimension "dim" expressing i_[0..pos] >>= o_[0..pos]
3005 __isl_give isl_basic_map *isl_basic_map_more_or_equal_at(
3006 __isl_take isl_dim *dim, unsigned pos)
3009 isl_basic_map *bmap;
3011 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
3012 for (i = 0; i < pos; ++i)
3013 bmap = var_equal(bmap, i);
3014 bmap = var_more_or_equal(bmap, pos);
3015 return isl_basic_map_finalize(bmap);
3018 static __isl_give isl_map *map_lex_lte_first(__isl_take isl_dim *dims,
3019 unsigned n, int equal)
3021 struct isl_map *map;
3024 if (n == 0 && equal)
3025 return isl_map_universe(dims);
3027 map = isl_map_alloc_dim(isl_dim_copy(dims), n, ISL_MAP_DISJOINT);
3029 for (i = 0; i + 1 < n; ++i)
3030 map = isl_map_add_basic_map(map,
3031 isl_basic_map_less_at(isl_dim_copy(dims), i));
3034 map = isl_map_add_basic_map(map,
3035 isl_basic_map_less_or_equal_at(dims, n - 1));
3037 map = isl_map_add_basic_map(map,
3038 isl_basic_map_less_at(dims, n - 1));
3045 static __isl_give isl_map *map_lex_lte(__isl_take isl_dim *dims, int equal)
3049 return map_lex_lte_first(dims, dims->n_out, equal);
3052 __isl_give isl_map *isl_map_lex_lt_first(__isl_take isl_dim *dim, unsigned n)
3054 return map_lex_lte_first(dim, n, 0);
3057 __isl_give isl_map *isl_map_lex_le_first(__isl_take isl_dim *dim, unsigned n)
3059 return map_lex_lte_first(dim, n, 1);
3062 __isl_give isl_map *isl_map_lex_lt(__isl_take isl_dim *set_dim)
3064 return map_lex_lte(isl_dim_map(set_dim), 0);
3067 __isl_give isl_map *isl_map_lex_le(__isl_take isl_dim *set_dim)
3069 return map_lex_lte(isl_dim_map(set_dim), 1);
3072 static __isl_give isl_map *map_lex_gte_first(__isl_take isl_dim *dims,
3073 unsigned n, int equal)
3075 struct isl_map *map;
3078 if (n == 0 && equal)
3079 return isl_map_universe(dims);
3081 map = isl_map_alloc_dim(isl_dim_copy(dims), n, ISL_MAP_DISJOINT);
3083 for (i = 0; i + 1 < n; ++i)
3084 map = isl_map_add_basic_map(map,
3085 isl_basic_map_more_at(isl_dim_copy(dims), i));
3088 map = isl_map_add_basic_map(map,
3089 isl_basic_map_more_or_equal_at(dims, n - 1));
3091 map = isl_map_add_basic_map(map,
3092 isl_basic_map_more_at(dims, n - 1));
3099 static __isl_give isl_map *map_lex_gte(__isl_take isl_dim *dims, int equal)
3103 return map_lex_gte_first(dims, dims->n_out, equal);
3106 __isl_give isl_map *isl_map_lex_gt_first(__isl_take isl_dim *dim, unsigned n)
3108 return map_lex_gte_first(dim, n, 0);
3111 __isl_give isl_map *isl_map_lex_ge_first(__isl_take isl_dim *dim, unsigned n)
3113 return map_lex_gte_first(dim, n, 1);
3116 __isl_give isl_map *isl_map_lex_gt(__isl_take isl_dim *set_dim)
3118 return map_lex_gte(isl_dim_map(set_dim), 0);
3121 __isl_give isl_map *isl_map_lex_ge(__isl_take isl_dim *set_dim)
3123 return map_lex_gte(isl_dim_map(set_dim), 1);
3126 struct isl_basic_map *isl_basic_map_from_basic_set(
3127 struct isl_basic_set *bset, struct isl_dim *dim)
3129 struct isl_basic_map *bmap;
3131 bset = isl_basic_set_cow(bset);
3135 isl_assert(bset->ctx, isl_dim_compatible(bset->dim, dim), goto error);
3136 isl_dim_free(bset->dim);
3137 bmap = (struct isl_basic_map *) bset;
3139 return isl_basic_map_finalize(bmap);
3141 isl_basic_set_free(bset);
3146 struct isl_basic_set *isl_basic_set_from_basic_map(struct isl_basic_map *bmap)
3150 if (bmap->dim->n_in == 0)
3151 return (struct isl_basic_set *)bmap;
3152 bmap = isl_basic_map_cow(bmap);
3155 bmap->dim = isl_dim_cow(bmap->dim);
3158 bmap->dim->n_out += bmap->dim->n_in;
3159 bmap->dim->n_in = 0;
3160 bmap = isl_basic_map_finalize(bmap);
3161 return (struct isl_basic_set *)bmap;
3163 isl_basic_map_free(bmap);
3167 /* For a div d = floor(f/m), add the constraints
3170 * -(f-(n-1)) + m d >= 0
3172 * Note that the second constraint is the negation of
3176 int isl_basic_map_add_div_constraints_var(__isl_keep isl_basic_map *bmap,
3177 unsigned pos, isl_int *div)
3180 unsigned total = isl_basic_map_total_dim(bmap);
3182 i = isl_basic_map_alloc_inequality(bmap);
3185 isl_seq_cpy(bmap->ineq[i], div + 1, 1 + total);
3186 isl_int_neg(bmap->ineq[i][1 + pos], div[0]);
3188 j = isl_basic_map_alloc_inequality(bmap);
3191 isl_seq_neg(bmap->ineq[j], bmap->ineq[i], 1 + total);
3192 isl_int_add(bmap->ineq[j][0], bmap->ineq[j][0], bmap->ineq[j][1 + pos]);
3193 isl_int_sub_ui(bmap->ineq[j][0], bmap->ineq[j][0], 1);
3197 int isl_basic_set_add_div_constraints_var(__isl_keep isl_basic_set *bset,
3198 unsigned pos, isl_int *div)
3200 return isl_basic_map_add_div_constraints_var((isl_basic_map *)bset,
3204 int isl_basic_map_add_div_constraints(struct isl_basic_map *bmap, unsigned div)
3206 unsigned total = isl_basic_map_total_dim(bmap);
3207 unsigned div_pos = total - bmap->n_div + div;
3209 return isl_basic_map_add_div_constraints_var(bmap, div_pos,
3213 struct isl_basic_set *isl_basic_map_underlying_set(
3214 struct isl_basic_map *bmap)
3218 if (bmap->dim->nparam == 0 && bmap->dim->n_in == 0 && bmap->n_div == 0)
3219 return (struct isl_basic_set *)bmap;
3220 bmap = isl_basic_map_cow(bmap);
3223 bmap->dim = isl_dim_underlying(bmap->dim, bmap->n_div);
3226 bmap->extra -= bmap->n_div;
3228 bmap = isl_basic_map_finalize(bmap);
3229 return (struct isl_basic_set *)bmap;
3234 __isl_give isl_basic_set *isl_basic_set_underlying_set(
3235 __isl_take isl_basic_set *bset)
3237 return isl_basic_map_underlying_set((isl_basic_map *)bset);
3240 struct isl_basic_map *isl_basic_map_overlying_set(
3241 struct isl_basic_set *bset, struct isl_basic_map *like)
3243 struct isl_basic_map *bmap;
3244 struct isl_ctx *ctx;
3251 isl_assert(ctx, bset->n_div == 0, goto error);
3252 isl_assert(ctx, isl_basic_set_n_param(bset) == 0, goto error);
3253 isl_assert(ctx, bset->dim->n_out == isl_basic_map_total_dim(like),
3255 if (isl_dim_equal(bset->dim, like->dim) && like->n_div == 0) {
3256 isl_basic_map_free(like);
3257 return (struct isl_basic_map *)bset;
3259 bset = isl_basic_set_cow(bset);
3262 total = bset->dim->n_out + bset->extra;
3263 bmap = (struct isl_basic_map *)bset;
3264 isl_dim_free(bmap->dim);
3265 bmap->dim = isl_dim_copy(like->dim);
3268 bmap->n_div = like->n_div;
3269 bmap->extra += like->n_div;
3272 ltotal = total - bmap->extra + like->extra;
3275 bmap->block2 = isl_blk_extend(ctx, bmap->block2,
3276 bmap->extra * (1 + 1 + total));
3277 if (isl_blk_is_error(bmap->block2))
3279 bmap->div = isl_realloc_array(ctx, bmap->div, isl_int *,
3283 for (i = 0; i < bmap->extra; ++i)
3284 bmap->div[i] = bmap->block2.data + i * (1 + 1 + total);
3285 for (i = 0; i < like->n_div; ++i) {
3286 isl_seq_cpy(bmap->div[i], like->div[i], 1 + 1 + ltotal);
3287 isl_seq_clr(bmap->div[i]+1+1+ltotal, total - ltotal);
3289 bmap = isl_basic_map_extend_constraints(bmap,
3290 0, 2 * like->n_div);
3291 for (i = 0; i < like->n_div; ++i) {
3292 if (isl_int_is_zero(bmap->div[i][0]))
3294 if (isl_basic_map_add_div_constraints(bmap, i) < 0)
3298 isl_basic_map_free(like);
3299 bmap = isl_basic_map_simplify(bmap);
3300 bmap = isl_basic_map_finalize(bmap);
3303 isl_basic_map_free(like);
3304 isl_basic_set_free(bset);
3308 struct isl_basic_set *isl_basic_set_from_underlying_set(
3309 struct isl_basic_set *bset, struct isl_basic_set *like)
3311 return (struct isl_basic_set *)
3312 isl_basic_map_overlying_set(bset, (struct isl_basic_map *)like);
3315 struct isl_set *isl_set_from_underlying_set(
3316 struct isl_set *set, struct isl_basic_set *like)
3322 isl_assert(set->ctx, set->dim->n_out == isl_basic_set_total_dim(like),
3324 if (isl_dim_equal(set->dim, like->dim) && like->n_div == 0) {
3325 isl_basic_set_free(like);
3328 set = isl_set_cow(set);
3331 for (i = 0; i < set->n; ++i) {
3332 set->p[i] = isl_basic_set_from_underlying_set(set->p[i],
3333 isl_basic_set_copy(like));
3337 isl_dim_free(set->dim);
3338 set->dim = isl_dim_copy(like->dim);
3341 isl_basic_set_free(like);
3344 isl_basic_set_free(like);
3349 struct isl_set *isl_map_underlying_set(struct isl_map *map)
3353 map = isl_map_cow(map);
3356 map->dim = isl_dim_cow(map->dim);
3360 for (i = 1; i < map->n; ++i)
3361 isl_assert(map->ctx, map->p[0]->n_div == map->p[i]->n_div,
3363 for (i = 0; i < map->n; ++i) {
3364 map->p[i] = (struct isl_basic_map *)
3365 isl_basic_map_underlying_set(map->p[i]);
3370 map->dim = isl_dim_underlying(map->dim, 0);
3372 isl_dim_free(map->dim);
3373 map->dim = isl_dim_copy(map->p[0]->dim);
3377 return (struct isl_set *)map;
3383 struct isl_set *isl_set_to_underlying_set(struct isl_set *set)
3385 return (struct isl_set *)isl_map_underlying_set((struct isl_map *)set);
3388 static __isl_give isl_basic_map *isl_basic_map_reset_dim(
3389 __isl_take isl_basic_map *bmap, __isl_take isl_dim *dim)
3391 bmap = isl_basic_map_cow(bmap);
3395 isl_dim_free(bmap->dim);
3400 isl_basic_map_free(bmap);
3405 static __isl_give isl_basic_set *isl_basic_set_reset_dim(
3406 __isl_take isl_basic_set *bset, __isl_take isl_dim *dim)
3408 return (isl_basic_set *)isl_basic_map_reset_dim((isl_basic_map *)bset,
3412 __isl_give isl_map *isl_map_reset_dim(__isl_take isl_map *map,
3413 __isl_take isl_dim *dim)
3417 map = isl_map_cow(map);
3421 for (i = 0; i < map->n; ++i) {
3422 map->p[i] = isl_basic_map_reset_dim(map->p[i],
3427 isl_dim_free(map->dim);
3437 __isl_give isl_set *isl_set_reset_dim(__isl_take isl_set *set,
3438 __isl_take isl_dim *dim)
3440 return (struct isl_set *) isl_map_reset_dim((struct isl_map *)set, dim);
3443 struct isl_basic_set *isl_basic_map_domain(struct isl_basic_map *bmap)
3445 struct isl_basic_set *domain;
3450 n_in = isl_basic_map_n_in(bmap);
3451 n_out = isl_basic_map_n_out(bmap);
3452 domain = isl_basic_set_from_basic_map(bmap);
3453 return isl_basic_set_project_out(domain, isl_dim_set, n_in, n_out);
3456 struct isl_basic_set *isl_basic_map_range(struct isl_basic_map *bmap)
3458 return isl_basic_map_domain(isl_basic_map_reverse(bmap));
3461 struct isl_set *isl_map_range(struct isl_map *map)
3464 struct isl_set *set;
3468 if (isl_map_dim(map, isl_dim_in) == 0)
3469 return (isl_set *)map;
3471 map = isl_map_cow(map);
3475 set = (struct isl_set *) map;
3476 set->dim = isl_dim_drop_inputs(set->dim, 0, set->dim->n_in);
3479 for (i = 0; i < map->n; ++i) {
3480 set->p[i] = isl_basic_map_range(map->p[i]);
3484 ISL_F_CLR(set, ISL_MAP_DISJOINT);
3485 ISL_F_CLR(set, ISL_SET_NORMALIZED);
3492 struct isl_map *isl_map_from_set(struct isl_set *set, struct isl_dim *dim)
3495 struct isl_map *map = NULL;
3497 set = isl_set_cow(set);
3500 isl_assert(set->ctx, isl_dim_compatible(set->dim, dim), goto error);
3501 map = (struct isl_map *)set;
3502 for (i = 0; i < set->n; ++i) {
3503 map->p[i] = isl_basic_map_from_basic_set(
3504 set->p[i], isl_dim_copy(dim));
3508 isl_dim_free(map->dim);
3517 struct isl_map *isl_map_from_range(struct isl_set *set)
3519 return (struct isl_map *)set;
3522 __isl_give isl_map *isl_map_from_domain(__isl_take isl_set *set)
3524 return isl_map_reverse(isl_map_from_range(set));
3527 __isl_give isl_map *isl_map_from_domain_and_range(__isl_take isl_set *domain,
3528 __isl_take isl_set *range)
3530 return isl_map_product(isl_map_from_domain(domain),
3531 isl_map_from_range(range));
3534 struct isl_set *isl_set_from_map(struct isl_map *map)
3537 struct isl_set *set = NULL;
3541 map = isl_map_cow(map);
3544 map->dim = isl_dim_cow(map->dim);
3547 map->dim->n_out += map->dim->n_in;
3549 set = (struct isl_set *)map;
3550 for (i = 0; i < map->n; ++i) {
3551 set->p[i] = isl_basic_set_from_basic_map(map->p[i]);
3561 struct isl_map *isl_map_alloc_dim(struct isl_dim *dim, int n, unsigned flags)
3563 struct isl_map *map;
3567 isl_assert(dim->ctx, n >= 0, return NULL);
3568 map = isl_alloc(dim->ctx, struct isl_map,
3569 sizeof(struct isl_map) +
3570 (n - 1) * sizeof(struct isl_basic_map *));
3574 map->ctx = dim->ctx;
3575 isl_ctx_ref(map->ctx);
3587 struct isl_map *isl_map_alloc(struct isl_ctx *ctx,
3588 unsigned nparam, unsigned in, unsigned out, int n,
3591 struct isl_map *map;
3592 struct isl_dim *dims;
3594 dims = isl_dim_alloc(ctx, nparam, in, out);
3598 map = isl_map_alloc_dim(dims, n, flags);
3602 struct isl_basic_map *isl_basic_map_empty(struct isl_dim *dim)
3604 struct isl_basic_map *bmap;
3605 bmap = isl_basic_map_alloc_dim(dim, 0, 1, 0);
3606 bmap = isl_basic_map_set_to_empty(bmap);
3610 struct isl_basic_set *isl_basic_set_empty(struct isl_dim *dim)
3612 struct isl_basic_set *bset;
3613 bset = isl_basic_set_alloc_dim(dim, 0, 1, 0);
3614 bset = isl_basic_set_set_to_empty(bset);
3618 struct isl_basic_map *isl_basic_map_empty_like(struct isl_basic_map *model)
3620 struct isl_basic_map *bmap;
3623 bmap = isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
3624 bmap = isl_basic_map_set_to_empty(bmap);
3628 struct isl_basic_map *isl_basic_map_empty_like_map(struct isl_map *model)
3630 struct isl_basic_map *bmap;
3633 bmap = isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
3634 bmap = isl_basic_map_set_to_empty(bmap);
3638 struct isl_basic_set *isl_basic_set_empty_like(struct isl_basic_set *model)
3640 struct isl_basic_set *bset;
3643 bset = isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
3644 bset = isl_basic_set_set_to_empty(bset);
3648 struct isl_basic_map *isl_basic_map_universe(struct isl_dim *dim)
3650 struct isl_basic_map *bmap;
3651 bmap = isl_basic_map_alloc_dim(dim, 0, 0, 0);
3655 struct isl_basic_set *isl_basic_set_universe(struct isl_dim *dim)
3657 struct isl_basic_set *bset;
3658 bset = isl_basic_set_alloc_dim(dim, 0, 0, 0);
3662 __isl_give isl_basic_map *isl_basic_map_universe_like(
3663 __isl_keep isl_basic_map *model)
3667 return isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
3670 struct isl_basic_set *isl_basic_set_universe_like(struct isl_basic_set *model)
3674 return isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
3677 __isl_give isl_basic_set *isl_basic_set_universe_like_set(
3678 __isl_keep isl_set *model)
3682 return isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
3685 struct isl_map *isl_map_empty(struct isl_dim *dim)
3687 return isl_map_alloc_dim(dim, 0, ISL_MAP_DISJOINT);
3690 struct isl_map *isl_map_empty_like(struct isl_map *model)
3694 return isl_map_alloc_dim(isl_dim_copy(model->dim), 0, ISL_MAP_DISJOINT);
3697 struct isl_map *isl_map_empty_like_basic_map(struct isl_basic_map *model)
3701 return isl_map_alloc_dim(isl_dim_copy(model->dim), 0, ISL_MAP_DISJOINT);
3704 struct isl_set *isl_set_empty(struct isl_dim *dim)
3706 return isl_set_alloc_dim(dim, 0, ISL_MAP_DISJOINT);
3709 struct isl_set *isl_set_empty_like(struct isl_set *model)
3713 return isl_set_empty(isl_dim_copy(model->dim));
3716 struct isl_map *isl_map_universe(struct isl_dim *dim)
3718 struct isl_map *map;
3721 map = isl_map_alloc_dim(isl_dim_copy(dim), 1, ISL_MAP_DISJOINT);
3722 map = isl_map_add_basic_map(map, isl_basic_map_universe(dim));
3726 struct isl_set *isl_set_universe(struct isl_dim *dim)
3728 struct isl_set *set;
3731 set = isl_set_alloc_dim(isl_dim_copy(dim), 1, ISL_MAP_DISJOINT);
3732 set = isl_set_add_basic_set(set, isl_basic_set_universe(dim));
3736 __isl_give isl_set *isl_set_universe_like(__isl_keep isl_set *model)
3740 return isl_set_universe(isl_dim_copy(model->dim));
3743 struct isl_map *isl_map_dup(struct isl_map *map)
3746 struct isl_map *dup;
3750 dup = isl_map_alloc_dim(isl_dim_copy(map->dim), map->n, map->flags);
3751 for (i = 0; i < map->n; ++i)
3752 dup = isl_map_add_basic_map(dup, isl_basic_map_copy(map->p[i]));
3756 __isl_give isl_map *isl_map_add_basic_map(__isl_take isl_map *map,
3757 __isl_take isl_basic_map *bmap)
3761 if (isl_basic_map_fast_is_empty(bmap)) {
3762 isl_basic_map_free(bmap);
3765 isl_assert(map->ctx, isl_dim_equal(map->dim, bmap->dim), goto error);
3766 isl_assert(map->ctx, map->n < map->size, goto error);
3767 map->p[map->n] = bmap;
3769 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3775 isl_basic_map_free(bmap);
3779 void isl_map_free(struct isl_map *map)
3789 isl_ctx_deref(map->ctx);
3790 for (i = 0; i < map->n; ++i)
3791 isl_basic_map_free(map->p[i]);
3792 isl_dim_free(map->dim);
3796 struct isl_map *isl_map_extend(struct isl_map *base,
3797 unsigned nparam, unsigned n_in, unsigned n_out)
3801 base = isl_map_cow(base);
3805 base->dim = isl_dim_extend(base->dim, nparam, n_in, n_out);
3808 for (i = 0; i < base->n; ++i) {
3809 base->p[i] = isl_basic_map_extend_dim(base->p[i],
3810 isl_dim_copy(base->dim), 0, 0, 0);
3820 struct isl_set *isl_set_extend(struct isl_set *base,
3821 unsigned nparam, unsigned dim)
3823 return (struct isl_set *)isl_map_extend((struct isl_map *)base,
3827 static struct isl_basic_map *isl_basic_map_fix_pos_si(
3828 struct isl_basic_map *bmap, unsigned pos, int value)
3832 bmap = isl_basic_map_cow(bmap);
3833 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
3834 j = isl_basic_map_alloc_equality(bmap);
3837 isl_seq_clr(bmap->eq[j] + 1, isl_basic_map_total_dim(bmap));
3838 isl_int_set_si(bmap->eq[j][pos], -1);
3839 isl_int_set_si(bmap->eq[j][0], value);
3840 bmap = isl_basic_map_simplify(bmap);
3841 return isl_basic_map_finalize(bmap);
3843 isl_basic_map_free(bmap);
3847 static __isl_give isl_basic_map *isl_basic_map_fix_pos(
3848 __isl_take isl_basic_map *bmap, unsigned pos, isl_int value)
3852 bmap = isl_basic_map_cow(bmap);
3853 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
3854 j = isl_basic_map_alloc_equality(bmap);
3857 isl_seq_clr(bmap->eq[j] + 1, isl_basic_map_total_dim(bmap));
3858 isl_int_set_si(bmap->eq[j][pos], -1);
3859 isl_int_set(bmap->eq[j][0], value);
3860 bmap = isl_basic_map_simplify(bmap);
3861 return isl_basic_map_finalize(bmap);
3863 isl_basic_map_free(bmap);
3867 struct isl_basic_map *isl_basic_map_fix_si(struct isl_basic_map *bmap,
3868 enum isl_dim_type type, unsigned pos, int value)
3872 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
3873 return isl_basic_map_fix_pos_si(bmap,
3874 isl_basic_map_offset(bmap, type) + pos, value);
3876 isl_basic_map_free(bmap);
3880 __isl_give isl_basic_map *isl_basic_map_fix(__isl_take isl_basic_map *bmap,
3881 enum isl_dim_type type, unsigned pos, isl_int value)
3885 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
3886 return isl_basic_map_fix_pos(bmap,
3887 isl_basic_map_offset(bmap, type) + pos, value);
3889 isl_basic_map_free(bmap);
3893 struct isl_basic_set *isl_basic_set_fix_si(struct isl_basic_set *bset,
3894 enum isl_dim_type type, unsigned pos, int value)
3896 return (struct isl_basic_set *)
3897 isl_basic_map_fix_si((struct isl_basic_map *)bset,
3901 __isl_give isl_basic_set *isl_basic_set_fix(__isl_take isl_basic_set *bset,
3902 enum isl_dim_type type, unsigned pos, isl_int value)
3904 return (struct isl_basic_set *)
3905 isl_basic_map_fix((struct isl_basic_map *)bset,
3909 struct isl_basic_map *isl_basic_map_fix_input_si(struct isl_basic_map *bmap,
3910 unsigned input, int value)
3912 return isl_basic_map_fix_si(bmap, isl_dim_in, input, value);
3915 struct isl_basic_set *isl_basic_set_fix_dim_si(struct isl_basic_set *bset,
3916 unsigned dim, int value)
3918 return (struct isl_basic_set *)
3919 isl_basic_map_fix_si((struct isl_basic_map *)bset,
3920 isl_dim_set, dim, value);
3923 struct isl_map *isl_map_fix_si(struct isl_map *map,
3924 enum isl_dim_type type, unsigned pos, int value)
3928 map = isl_map_cow(map);
3932 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
3933 for (i = 0; i < map->n; ++i) {
3934 map->p[i] = isl_basic_map_fix_si(map->p[i], type, pos, value);
3938 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3945 __isl_give isl_set *isl_set_fix_si(__isl_take isl_set *set,
3946 enum isl_dim_type type, unsigned pos, int value)
3948 return (struct isl_set *)
3949 isl_map_fix_si((struct isl_map *)set, type, pos, value);
3952 __isl_give isl_map *isl_map_fix(__isl_take isl_map *map,
3953 enum isl_dim_type type, unsigned pos, isl_int value)
3957 map = isl_map_cow(map);
3961 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
3962 for (i = 0; i < map->n; ++i) {
3963 map->p[i] = isl_basic_map_fix(map->p[i], type, pos, value);
3967 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3974 __isl_give isl_set *isl_set_fix(__isl_take isl_set *set,
3975 enum isl_dim_type type, unsigned pos, isl_int value)
3977 return (struct isl_set *)isl_map_fix((isl_map *)set, type, pos, value);
3980 struct isl_map *isl_map_fix_input_si(struct isl_map *map,
3981 unsigned input, int value)
3983 return isl_map_fix_si(map, isl_dim_in, input, value);
3986 struct isl_set *isl_set_fix_dim_si(struct isl_set *set, unsigned dim, int value)
3988 return (struct isl_set *)
3989 isl_map_fix_si((struct isl_map *)set, isl_dim_set, dim, value);
3992 __isl_give isl_basic_map *isl_basic_map_lower_bound_si(
3993 __isl_take isl_basic_map *bmap,
3994 enum isl_dim_type type, unsigned pos, int value)
4000 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
4001 pos += isl_basic_map_offset(bmap, type);
4002 bmap = isl_basic_map_cow(bmap);
4003 bmap = isl_basic_map_extend_constraints(bmap, 0, 1);
4004 j = isl_basic_map_alloc_inequality(bmap);
4007 isl_seq_clr(bmap->ineq[j], 1 + isl_basic_map_total_dim(bmap));
4008 isl_int_set_si(bmap->ineq[j][pos], 1);
4009 isl_int_set_si(bmap->ineq[j][0], -value);
4010 bmap = isl_basic_map_simplify(bmap);
4011 return isl_basic_map_finalize(bmap);
4013 isl_basic_map_free(bmap);
4017 struct isl_basic_set *isl_basic_set_lower_bound_dim(struct isl_basic_set *bset,
4018 unsigned dim, isl_int value)
4022 bset = isl_basic_set_cow(bset);
4023 bset = isl_basic_set_extend_constraints(bset, 0, 1);
4024 j = isl_basic_set_alloc_inequality(bset);
4027 isl_seq_clr(bset->ineq[j], 1 + isl_basic_set_total_dim(bset));
4028 isl_int_set_si(bset->ineq[j][1 + isl_basic_set_n_param(bset) + dim], 1);
4029 isl_int_neg(bset->ineq[j][0], value);
4030 bset = isl_basic_set_simplify(bset);
4031 return isl_basic_set_finalize(bset);
4033 isl_basic_set_free(bset);
4037 __isl_give isl_map *isl_map_lower_bound_si(__isl_take isl_map *map,
4038 enum isl_dim_type type, unsigned pos, int value)
4042 map = isl_map_cow(map);
4046 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
4047 for (i = 0; i < map->n; ++i) {
4048 map->p[i] = isl_basic_map_lower_bound_si(map->p[i],
4053 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4060 __isl_give isl_set *isl_set_lower_bound_si(__isl_take isl_set *set,
4061 enum isl_dim_type type, unsigned pos, int value)
4063 return (struct isl_set *)
4064 isl_map_lower_bound_si((struct isl_map *)set, type, pos, value);
4067 struct isl_set *isl_set_lower_bound_dim(struct isl_set *set, unsigned dim,
4072 set = isl_set_cow(set);
4076 isl_assert(set->ctx, dim < isl_set_n_dim(set), goto error);
4077 for (i = 0; i < set->n; ++i) {
4078 set->p[i] = isl_basic_set_lower_bound_dim(set->p[i], dim, value);
4088 struct isl_map *isl_map_reverse(struct isl_map *map)
4092 map = isl_map_cow(map);
4096 map->dim = isl_dim_reverse(map->dim);
4099 for (i = 0; i < map->n; ++i) {
4100 map->p[i] = isl_basic_map_reverse(map->p[i]);
4104 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4111 static struct isl_map *isl_basic_map_partial_lexopt(
4112 struct isl_basic_map *bmap, struct isl_basic_set *dom,
4113 struct isl_set **empty, int max)
4117 if (bmap->ctx->opt->pip == ISL_PIP_PIP)
4118 return isl_pip_basic_map_lexopt(bmap, dom, empty, max);
4120 return isl_tab_basic_map_partial_lexopt(bmap, dom, empty, max);
4122 isl_basic_map_free(bmap);
4123 isl_basic_set_free(dom);
4129 struct isl_map *isl_basic_map_partial_lexmax(
4130 struct isl_basic_map *bmap, struct isl_basic_set *dom,
4131 struct isl_set **empty)
4133 return isl_basic_map_partial_lexopt(bmap, dom, empty, 1);
4136 struct isl_map *isl_basic_map_partial_lexmin(
4137 struct isl_basic_map *bmap, struct isl_basic_set *dom,
4138 struct isl_set **empty)
4140 return isl_basic_map_partial_lexopt(bmap, dom, empty, 0);
4143 struct isl_set *isl_basic_set_partial_lexmin(
4144 struct isl_basic_set *bset, struct isl_basic_set *dom,
4145 struct isl_set **empty)
4147 return (struct isl_set *)
4148 isl_basic_map_partial_lexmin((struct isl_basic_map *)bset,
4152 struct isl_set *isl_basic_set_partial_lexmax(
4153 struct isl_basic_set *bset, struct isl_basic_set *dom,
4154 struct isl_set **empty)
4156 return (struct isl_set *)
4157 isl_basic_map_partial_lexmax((struct isl_basic_map *)bset,
4161 /* Given a basic map "bmap", compute the lexicograhically minimal
4162 * (or maximal) image element for each domain element in dom.
4163 * Set *empty to those elements in dom that do not have an image element.
4165 * We first make sure the basic sets in dom are disjoint and then
4166 * simply collect the results over each of the basic sets separately.
4167 * We could probably improve the efficiency a bit by moving the union
4168 * domain down into the parametric integer programming.
4170 static __isl_give isl_map *basic_map_partial_lexopt(
4171 __isl_take isl_basic_map *bmap, __isl_take isl_set *dom,
4172 __isl_give isl_set **empty, int max)
4175 struct isl_map *res;
4177 dom = isl_set_make_disjoint(dom);
4181 if (isl_set_fast_is_empty(dom)) {
4182 res = isl_map_empty_like_basic_map(bmap);
4183 *empty = isl_set_empty_like(dom);
4185 isl_basic_map_free(bmap);
4189 res = isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap),
4190 isl_basic_set_copy(dom->p[0]), empty, max);
4192 for (i = 1; i < dom->n; ++i) {
4193 struct isl_map *res_i;
4194 struct isl_set *empty_i;
4196 res_i = isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap),
4197 isl_basic_set_copy(dom->p[i]), &empty_i, max);
4199 res = isl_map_union_disjoint(res, res_i);
4200 *empty = isl_set_union_disjoint(*empty, empty_i);
4204 isl_basic_map_free(bmap);
4209 isl_basic_map_free(bmap);
4213 /* Given a map "map", compute the lexicograhically minimal
4214 * (or maximal) image element for each domain element in dom.
4215 * Set *empty to those elements in dom that do not have an image element.
4217 * We first compute the lexicographically minimal or maximal element
4218 * in the first basic map. This results in a partial solution "res"
4219 * and a subset "todo" of dom that still need to be handled.
4220 * We then consider each of the remaining maps in "map" and successively
4221 * improve both "res" and "todo".
4223 * Let res^k and todo^k be the results after k steps and let i = k + 1.
4224 * Assume we are computing the lexicographical maximum.
4225 * We first intersect basic map i with a relation that maps elements
4226 * to elements that are lexicographically larger than the image elements
4227 * in res^k and the compute the maximum image element of this intersection.
4228 * The result ("better") corresponds to those image elements in basic map i
4229 * that are better than what we had before. The remainder ("keep") are the
4230 * domain elements for which the image element in res_k was better.
4231 * We also compute the lexicographical maximum of basic map i in todo^k.
4232 * res^i is the result of the operation + better + those elements in
4233 * res^k that we should keep
4234 * todo^i is the remainder of the maximum operation on todo^k.
4236 static __isl_give isl_map *isl_map_partial_lexopt(
4237 __isl_take isl_map *map, __isl_take isl_set *dom,
4238 __isl_give isl_set **empty, int max)
4241 struct isl_map *res;
4242 struct isl_set *todo;
4247 if (isl_map_fast_is_empty(map)) {
4255 res = basic_map_partial_lexopt(isl_basic_map_copy(map->p[0]),
4256 isl_set_copy(dom), &todo, max);
4258 for (i = 1; i < map->n; ++i) {
4260 struct isl_map *better;
4261 struct isl_set *keep;
4262 struct isl_map *res_i;
4263 struct isl_set *todo_i;
4264 struct isl_dim *dim = isl_map_get_dim(res);
4266 dim = isl_dim_range(dim);
4268 lt = isl_map_lex_lt(dim);
4270 lt = isl_map_lex_gt(dim);
4271 lt = isl_map_apply_range(isl_map_copy(res), lt);
4272 lt = isl_map_intersect(lt,
4273 isl_map_from_basic_map(isl_basic_map_copy(map->p[i])));
4274 better = isl_map_partial_lexopt(lt,
4275 isl_map_domain(isl_map_copy(res)),
4278 res_i = basic_map_partial_lexopt(isl_basic_map_copy(map->p[i]),
4279 todo, &todo_i, max);
4281 res = isl_map_intersect_domain(res, keep);
4282 res = isl_map_union_disjoint(res, res_i);
4283 res = isl_map_union_disjoint(res, better);
4304 __isl_give isl_map *isl_map_partial_lexmax(
4305 __isl_take isl_map *map, __isl_take isl_set *dom,
4306 __isl_give isl_set **empty)
4308 return isl_map_partial_lexopt(map, dom, empty, 1);
4311 __isl_give isl_map *isl_map_partial_lexmin(
4312 __isl_take isl_map *map, __isl_take isl_set *dom,
4313 __isl_give isl_set **empty)
4315 return isl_map_partial_lexopt(map, dom, empty, 0);
4318 __isl_give isl_set *isl_set_partial_lexmin(
4319 __isl_take isl_set *set, __isl_take isl_set *dom,
4320 __isl_give isl_set **empty)
4322 return (struct isl_set *)
4323 isl_map_partial_lexmin((struct isl_map *)set,
4327 __isl_give isl_set *isl_set_partial_lexmax(
4328 __isl_take isl_set *set, __isl_take isl_set *dom,
4329 __isl_give isl_set **empty)
4331 return (struct isl_set *)
4332 isl_map_partial_lexmax((struct isl_map *)set,
4336 __isl_give isl_map *isl_basic_map_lexopt(__isl_take isl_basic_map *bmap, int max)
4338 struct isl_basic_set *dom = NULL;
4339 struct isl_dim *dom_dim;
4343 dom_dim = isl_dim_domain(isl_dim_copy(bmap->dim));
4344 dom = isl_basic_set_universe(dom_dim);
4345 return isl_basic_map_partial_lexopt(bmap, dom, NULL, max);
4347 isl_basic_map_free(bmap);
4351 __isl_give isl_map *isl_basic_map_lexmin(__isl_take isl_basic_map *bmap)
4353 return isl_basic_map_lexopt(bmap, 0);
4356 __isl_give isl_map *isl_basic_map_lexmax(__isl_take isl_basic_map *bmap)
4358 return isl_basic_map_lexopt(bmap, 1);
4361 __isl_give isl_set *isl_basic_set_lexmin(__isl_take isl_basic_set *bset)
4363 return (isl_set *)isl_basic_map_lexmin((isl_basic_map *)bset);
4366 __isl_give isl_set *isl_basic_set_lexmax(__isl_take isl_basic_set *bset)
4368 return (isl_set *)isl_basic_map_lexmax((isl_basic_map *)bset);
4371 __isl_give isl_map *isl_map_lexopt(__isl_take isl_map *map, int max)
4373 struct isl_set *dom = NULL;
4374 struct isl_dim *dom_dim;
4378 dom_dim = isl_dim_domain(isl_dim_copy(map->dim));
4379 dom = isl_set_universe(dom_dim);
4380 return isl_map_partial_lexopt(map, dom, NULL, max);
4386 __isl_give isl_map *isl_map_lexmin(__isl_take isl_map *map)
4388 return isl_map_lexopt(map, 0);
4391 __isl_give isl_map *isl_map_lexmax(__isl_take isl_map *map)
4393 return isl_map_lexopt(map, 1);
4396 __isl_give isl_set *isl_set_lexmin(__isl_take isl_set *set)
4398 return (isl_set *)isl_map_lexmin((isl_map *)set);
4401 __isl_give isl_set *isl_set_lexmax(__isl_take isl_set *set)
4403 return (isl_set *)isl_map_lexmax((isl_map *)set);
4406 /* Apply a preimage specified by "mat" on the parameters of "bset".
4407 * bset is assumed to have only parameters and divs.
4409 static struct isl_basic_set *basic_set_parameter_preimage(
4410 struct isl_basic_set *bset, struct isl_mat *mat)
4417 bset->dim = isl_dim_cow(bset->dim);
4421 nparam = isl_basic_set_dim(bset, isl_dim_param);
4423 isl_assert(bset->ctx, mat->n_row == 1 + nparam, goto error);
4425 bset->dim->nparam = 0;
4426 bset->dim->n_out = nparam;
4427 bset = isl_basic_set_preimage(bset, mat);
4429 bset->dim->nparam = bset->dim->n_out;
4430 bset->dim->n_out = 0;
4435 isl_basic_set_free(bset);
4439 /* Apply a preimage specified by "mat" on the parameters of "set".
4440 * set is assumed to have only parameters and divs.
4442 static struct isl_set *set_parameter_preimage(
4443 struct isl_set *set, struct isl_mat *mat)
4445 struct isl_dim *dim = NULL;
4451 dim = isl_dim_copy(set->dim);
4452 dim = isl_dim_cow(dim);
4456 nparam = isl_set_dim(set, isl_dim_param);
4458 isl_assert(set->ctx, mat->n_row == 1 + nparam, goto error);
4461 dim->n_out = nparam;
4462 isl_set_reset_dim(set, dim);
4463 set = isl_set_preimage(set, mat);
4466 dim = isl_dim_copy(set->dim);
4467 dim = isl_dim_cow(dim);
4470 dim->nparam = dim->n_out;
4472 isl_set_reset_dim(set, dim);
4482 /* Intersect the basic set "bset" with the affine space specified by the
4483 * equalities in "eq".
4485 static struct isl_basic_set *basic_set_append_equalities(
4486 struct isl_basic_set *bset, struct isl_mat *eq)
4494 bset = isl_basic_set_extend_dim(bset, isl_dim_copy(bset->dim), 0,
4499 len = 1 + isl_dim_total(bset->dim) + bset->extra;
4500 for (i = 0; i < eq->n_row; ++i) {
4501 k = isl_basic_set_alloc_equality(bset);
4504 isl_seq_cpy(bset->eq[k], eq->row[i], eq->n_col);
4505 isl_seq_clr(bset->eq[k] + eq->n_col, len - eq->n_col);
4509 bset = isl_basic_set_gauss(bset, NULL);
4510 bset = isl_basic_set_finalize(bset);
4515 isl_basic_set_free(bset);
4519 /* Intersect the set "set" with the affine space specified by the
4520 * equalities in "eq".
4522 static struct isl_set *set_append_equalities(struct isl_set *set,
4530 for (i = 0; i < set->n; ++i) {
4531 set->p[i] = basic_set_append_equalities(set->p[i],
4544 /* Project the given basic set onto its parameter domain, possibly introducing
4545 * new, explicit, existential variables in the constraints.
4546 * The input has parameters and (possibly implicit) existential variables.
4547 * The output has the same parameters, but only
4548 * explicit existentially quantified variables.
4550 * The actual projection is performed by pip, but pip doesn't seem
4551 * to like equalities very much, so we first remove the equalities
4552 * among the parameters by performing a variable compression on
4553 * the parameters. Afterward, an inverse transformation is performed
4554 * and the equalities among the parameters are inserted back in.
4556 static struct isl_set *parameter_compute_divs(struct isl_basic_set *bset)
4560 struct isl_mat *T, *T2;
4561 struct isl_set *set;
4562 unsigned nparam, n_div;
4564 bset = isl_basic_set_cow(bset);
4568 if (bset->n_eq == 0)
4569 return isl_basic_set_lexmin(bset);
4571 isl_basic_set_gauss(bset, NULL);
4573 nparam = isl_basic_set_dim(bset, isl_dim_param);
4574 n_div = isl_basic_set_dim(bset, isl_dim_div);
4576 for (i = 0, j = n_div - 1; i < bset->n_eq && j >= 0; --j) {
4577 if (!isl_int_is_zero(bset->eq[i][1 + nparam + j]))
4580 if (i == bset->n_eq)
4581 return isl_basic_set_lexmin(bset);
4583 eq = isl_mat_sub_alloc(bset->ctx, bset->eq, i, bset->n_eq - i,
4585 eq = isl_mat_cow(eq);
4586 T = isl_mat_variable_compression(isl_mat_copy(eq), &T2);
4587 if (T && T->n_col == 0) {
4591 bset = isl_basic_set_set_to_empty(bset);
4592 return isl_set_from_basic_set(bset);
4594 bset = basic_set_parameter_preimage(bset, T);
4596 set = isl_basic_set_lexmin(bset);
4597 set = set_parameter_preimage(set, T2);
4598 set = set_append_equalities(set, eq);
4602 /* Compute an explicit representation for all the existentially
4603 * quantified variables.
4604 * The input and output dimensions are first turned into parameters.
4605 * compute_divs then returns a map with the same parameters and
4606 * no input or output dimensions and the dimension specification
4607 * is reset to that of the input.
4609 static struct isl_map *compute_divs(struct isl_basic_map *bmap)
4611 struct isl_basic_set *bset;
4612 struct isl_set *set;
4613 struct isl_map *map;
4614 struct isl_dim *dim, *orig_dim = NULL;
4619 bmap = isl_basic_map_cow(bmap);
4623 nparam = isl_basic_map_dim(bmap, isl_dim_param);
4624 n_in = isl_basic_map_dim(bmap, isl_dim_in);
4625 n_out = isl_basic_map_dim(bmap, isl_dim_out);
4626 dim = isl_dim_set_alloc(bmap->ctx, nparam + n_in + n_out, 0);
4630 orig_dim = bmap->dim;
4632 bset = (struct isl_basic_set *)bmap;
4634 set = parameter_compute_divs(bset);
4635 map = (struct isl_map *)set;
4636 map = isl_map_reset_dim(map, orig_dim);
4640 isl_basic_map_free(bmap);
4644 static int basic_map_divs_known(__isl_keep isl_basic_map *bmap)
4652 off = isl_dim_total(bmap->dim);
4653 for (i = 0; i < bmap->n_div; ++i) {
4654 if (isl_int_is_zero(bmap->div[i][0]))
4656 isl_assert(bmap->ctx, isl_int_is_zero(bmap->div[i][1+1+off+i]),
4662 static int map_divs_known(__isl_keep isl_map *map)
4669 for (i = 0; i < map->n; ++i) {
4670 int known = basic_map_divs_known(map->p[i]);
4678 /* If bmap contains any unknown divs, then compute explicit
4679 * expressions for them. However, this computation may be
4680 * quite expensive, so first try to remove divs that aren't
4683 struct isl_map *isl_basic_map_compute_divs(struct isl_basic_map *bmap)
4687 struct isl_map *map;
4689 known = basic_map_divs_known(bmap);
4693 return isl_map_from_basic_map(bmap);
4695 bmap = isl_basic_map_drop_redundant_divs(bmap);
4697 known = basic_map_divs_known(bmap);
4701 return isl_map_from_basic_map(bmap);
4703 map = compute_divs(bmap);
4706 isl_basic_map_free(bmap);
4710 struct isl_map *isl_map_compute_divs(struct isl_map *map)
4714 struct isl_map *res;
4721 known = map_divs_known(map);
4729 res = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[0]));
4730 for (i = 1 ; i < map->n; ++i) {
4732 r2 = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[i]));
4733 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT))
4734 res = isl_map_union_disjoint(res, r2);
4736 res = isl_map_union(res, r2);
4743 struct isl_set *isl_basic_set_compute_divs(struct isl_basic_set *bset)
4745 return (struct isl_set *)
4746 isl_basic_map_compute_divs((struct isl_basic_map *)bset);
4749 struct isl_set *isl_set_compute_divs(struct isl_set *set)
4751 return (struct isl_set *)
4752 isl_map_compute_divs((struct isl_map *)set);
4755 struct isl_set *isl_map_domain(struct isl_map *map)
4758 struct isl_set *set;
4763 map = isl_map_cow(map);
4767 set = (struct isl_set *)map;
4768 set->dim = isl_dim_domain(set->dim);
4771 for (i = 0; i < map->n; ++i) {
4772 set->p[i] = isl_basic_map_domain(map->p[i]);
4776 ISL_F_CLR(set, ISL_MAP_DISJOINT);
4777 ISL_F_CLR(set, ISL_SET_NORMALIZED);
4784 struct isl_map *isl_map_union_disjoint(
4785 struct isl_map *map1, struct isl_map *map2)
4789 struct isl_map *map = NULL;
4803 isl_assert(map1->ctx, isl_dim_equal(map1->dim, map2->dim), goto error);
4805 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
4806 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
4807 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
4809 map = isl_map_alloc_dim(isl_dim_copy(map1->dim),
4810 map1->n + map2->n, flags);
4813 for (i = 0; i < map1->n; ++i) {
4814 map = isl_map_add_basic_map(map,
4815 isl_basic_map_copy(map1->p[i]));
4819 for (i = 0; i < map2->n; ++i) {
4820 map = isl_map_add_basic_map(map,
4821 isl_basic_map_copy(map2->p[i]));
4835 struct isl_map *isl_map_union(struct isl_map *map1, struct isl_map *map2)
4837 map1 = isl_map_union_disjoint(map1, map2);
4841 ISL_F_CLR(map1, ISL_MAP_DISJOINT);
4845 struct isl_set *isl_set_union_disjoint(
4846 struct isl_set *set1, struct isl_set *set2)
4848 return (struct isl_set *)
4849 isl_map_union_disjoint(
4850 (struct isl_map *)set1, (struct isl_map *)set2);
4853 struct isl_set *isl_set_union(struct isl_set *set1, struct isl_set *set2)
4855 return (struct isl_set *)
4856 isl_map_union((struct isl_map *)set1, (struct isl_map *)set2);
4859 struct isl_map *isl_map_intersect_range(
4860 struct isl_map *map, struct isl_set *set)
4863 struct isl_map *result;
4869 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT) &&
4870 ISL_F_ISSET(set, ISL_MAP_DISJOINT))
4871 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
4873 result = isl_map_alloc_dim(isl_dim_copy(map->dim),
4874 map->n * set->n, flags);
4877 for (i = 0; i < map->n; ++i)
4878 for (j = 0; j < set->n; ++j) {
4879 result = isl_map_add_basic_map(result,
4880 isl_basic_map_intersect_range(
4881 isl_basic_map_copy(map->p[i]),
4882 isl_basic_set_copy(set->p[j])));
4895 struct isl_map *isl_map_intersect_domain(
4896 struct isl_map *map, struct isl_set *set)
4898 return isl_map_reverse(
4899 isl_map_intersect_range(isl_map_reverse(map), set));
4902 struct isl_map *isl_map_apply_domain(
4903 struct isl_map *map1, struct isl_map *map2)
4907 map1 = isl_map_reverse(map1);
4908 map1 = isl_map_apply_range(map1, map2);
4909 return isl_map_reverse(map1);
4916 struct isl_map *isl_map_apply_range(
4917 struct isl_map *map1, struct isl_map *map2)
4919 struct isl_dim *dim_result;
4920 struct isl_map *result;
4926 dim_result = isl_dim_join(isl_dim_copy(map1->dim),
4927 isl_dim_copy(map2->dim));
4929 result = isl_map_alloc_dim(dim_result, map1->n * map2->n, 0);
4932 for (i = 0; i < map1->n; ++i)
4933 for (j = 0; j < map2->n; ++j) {
4934 result = isl_map_add_basic_map(result,
4935 isl_basic_map_apply_range(
4936 isl_basic_map_copy(map1->p[i]),
4937 isl_basic_map_copy(map2->p[j])));
4943 if (result && result->n <= 1)
4944 ISL_F_SET(result, ISL_MAP_DISJOINT);
4953 * returns range - domain
4955 struct isl_basic_set *isl_basic_map_deltas(struct isl_basic_map *bmap)
4958 struct isl_basic_set *bset;
4965 dim = isl_basic_map_n_in(bmap);
4966 nparam = isl_basic_map_n_param(bmap);
4967 isl_assert(bmap->ctx, dim == isl_basic_map_n_out(bmap), goto error);
4968 bset = isl_basic_set_from_basic_map(bmap);
4969 bset = isl_basic_set_cow(bset);
4970 dims = isl_basic_set_get_dim(bset);
4971 dims = isl_dim_add(dims, isl_dim_set, dim);
4972 bset = isl_basic_set_extend_dim(bset, dims, 0, dim, 0);
4973 bset = isl_basic_set_swap_vars(bset, 2*dim);
4974 for (i = 0; i < dim; ++i) {
4975 int j = isl_basic_map_alloc_equality(
4976 (struct isl_basic_map *)bset);
4979 isl_seq_clr(bset->eq[j], 1 + isl_basic_set_total_dim(bset));
4980 isl_int_set_si(bset->eq[j][1+nparam+i], 1);
4981 isl_int_set_si(bset->eq[j][1+nparam+dim+i], 1);
4982 isl_int_set_si(bset->eq[j][1+nparam+2*dim+i], -1);
4984 return isl_basic_set_project_out(bset, isl_dim_set, dim, 2*dim);
4986 isl_basic_map_free(bmap);
4991 * returns range - domain
4993 struct isl_set *isl_map_deltas(struct isl_map *map)
4997 struct isl_set *result;
5002 isl_assert(map->ctx, isl_map_n_in(map) == isl_map_n_out(map), goto error);
5003 dim = isl_map_get_dim(map);
5004 dim = isl_dim_domain(dim);
5005 result = isl_set_alloc_dim(dim, map->n, map->flags);
5008 for (i = 0; i < map->n; ++i)
5009 result = isl_set_add_basic_set(result,
5010 isl_basic_map_deltas(isl_basic_map_copy(map->p[i])));
5018 static struct isl_basic_map *basic_map_identity(struct isl_dim *dims)
5020 struct isl_basic_map *bmap;
5028 nparam = dims->nparam;
5030 bmap = isl_basic_map_alloc_dim(dims, 0, dim, 0);
5034 for (i = 0; i < dim; ++i) {
5035 int j = isl_basic_map_alloc_equality(bmap);
5038 isl_seq_clr(bmap->eq[j], 1 + isl_basic_map_total_dim(bmap));
5039 isl_int_set_si(bmap->eq[j][1+nparam+i], 1);
5040 isl_int_set_si(bmap->eq[j][1+nparam+dim+i], -1);
5042 return isl_basic_map_finalize(bmap);
5044 isl_basic_map_free(bmap);
5048 struct isl_basic_map *isl_basic_map_identity(struct isl_dim *set_dim)
5050 struct isl_dim *dim = isl_dim_map(set_dim);
5053 return basic_map_identity(dim);
5056 struct isl_basic_map *isl_basic_map_identity_like(struct isl_basic_map *model)
5058 if (!model || !model->dim)
5060 isl_assert(model->ctx,
5061 model->dim->n_in == model->dim->n_out, return NULL);
5062 return basic_map_identity(isl_dim_copy(model->dim));
5065 static struct isl_map *map_identity(struct isl_dim *dim)
5067 struct isl_map *map = isl_map_alloc_dim(dim, 1, ISL_MAP_DISJOINT);
5068 return isl_map_add_basic_map(map, basic_map_identity(isl_dim_copy(dim)));
5071 struct isl_map *isl_map_identity(struct isl_dim *set_dim)
5073 struct isl_dim *dim = isl_dim_map(set_dim);
5076 return map_identity(dim);
5079 struct isl_map *isl_map_identity_like(struct isl_map *model)
5081 if (!model || !model->dim)
5083 isl_assert(model->ctx,
5084 model->dim->n_in == model->dim->n_out, return NULL);
5085 return map_identity(isl_dim_copy(model->dim));
5088 struct isl_map *isl_map_identity_like_basic_map(struct isl_basic_map *model)
5090 if (!model || !model->dim)
5092 isl_assert(model->ctx,
5093 model->dim->n_in == model->dim->n_out, return NULL);
5094 return map_identity(isl_dim_copy(model->dim));
5097 /* Construct a basic set with all set dimensions having only non-negative
5100 struct isl_basic_set *isl_basic_set_positive_orthant(struct isl_dim *dims)
5105 struct isl_basic_set *bset;
5109 nparam = dims->nparam;
5111 bset = isl_basic_set_alloc_dim(dims, 0, 0, dim);
5114 for (i = 0; i < dim; ++i) {
5115 int k = isl_basic_set_alloc_inequality(bset);
5118 isl_seq_clr(bset->ineq[k], 1 + isl_basic_set_total_dim(bset));
5119 isl_int_set_si(bset->ineq[k][1 + nparam + i], 1);
5123 isl_basic_set_free(bset);
5127 __isl_give isl_set *isl_set_split_dims(__isl_take isl_set *set,
5128 enum isl_dim_type type, unsigned first, unsigned n)
5131 isl_basic_set *nonneg = NULL;
5132 isl_basic_set *neg = NULL;
5139 isl_assert(set->ctx, first + n <= isl_set_dim(set, type), goto error);
5141 for (i = 0; i < n; ++i) {
5145 nonneg = isl_basic_set_alloc_dim(isl_set_get_dim(set), 0, 0, 1);
5146 k = isl_basic_set_alloc_inequality(nonneg);
5149 isl_seq_clr(nonneg->ineq[k], 1 + isl_basic_set_total_dim(nonneg));
5150 isl_int_set_si(nonneg->ineq[k][pos(set->dim, type) + first + i], 1);
5152 neg = isl_basic_set_alloc_dim(isl_set_get_dim(set), 0, 0, 1);
5153 k = isl_basic_set_alloc_inequality(neg);
5156 isl_seq_clr(neg->ineq[k], 1 + isl_basic_set_total_dim(neg));
5157 isl_int_set_si(neg->ineq[k][0], -1);
5158 isl_int_set_si(neg->ineq[k][pos(set->dim, type) + first + i], -1);
5160 set = isl_set_intersect(set, isl_basic_set_union(nonneg, neg));
5165 isl_basic_set_free(nonneg);
5166 isl_basic_set_free(neg);
5171 int isl_set_is_equal(struct isl_set *set1, struct isl_set *set2)
5173 return isl_map_is_equal((struct isl_map *)set1, (struct isl_map *)set2);
5176 int isl_basic_map_is_subset(
5177 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
5180 struct isl_map *map1;
5181 struct isl_map *map2;
5183 if (!bmap1 || !bmap2)
5186 map1 = isl_map_from_basic_map(isl_basic_map_copy(bmap1));
5187 map2 = isl_map_from_basic_map(isl_basic_map_copy(bmap2));
5189 is_subset = isl_map_is_subset(map1, map2);
5197 int isl_basic_map_is_equal(
5198 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
5202 if (!bmap1 || !bmap2)
5204 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
5207 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
5211 int isl_basic_set_is_equal(
5212 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
5214 return isl_basic_map_is_equal(
5215 (struct isl_basic_map *)bset1, (struct isl_basic_map *)bset2);
5218 int isl_map_is_empty(struct isl_map *map)
5225 for (i = 0; i < map->n; ++i) {
5226 is_empty = isl_basic_map_is_empty(map->p[i]);
5235 int isl_map_fast_is_empty(struct isl_map *map)
5237 return map ? map->n == 0 : -1;
5240 int isl_set_fast_is_empty(struct isl_set *set)
5242 return set ? set->n == 0 : -1;
5245 int isl_set_is_empty(struct isl_set *set)
5247 return isl_map_is_empty((struct isl_map *)set);
5250 int isl_map_is_equal(struct isl_map *map1, struct isl_map *map2)
5256 is_subset = isl_map_is_subset(map1, map2);
5259 is_subset = isl_map_is_subset(map2, map1);
5263 int isl_basic_map_is_strict_subset(
5264 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
5268 if (!bmap1 || !bmap2)
5270 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
5273 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
5274 if (is_subset == -1)
5279 int isl_map_is_strict_subset(struct isl_map *map1, struct isl_map *map2)
5285 is_subset = isl_map_is_subset(map1, map2);
5288 is_subset = isl_map_is_subset(map2, map1);
5289 if (is_subset == -1)
5294 int isl_set_is_strict_subset(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
5296 return isl_map_is_strict_subset((isl_map *)set1, (isl_map *)set2);
5299 int isl_basic_map_is_universe(struct isl_basic_map *bmap)
5303 return bmap->n_eq == 0 && bmap->n_ineq == 0;
5306 int isl_basic_set_is_universe(struct isl_basic_set *bset)
5310 return bset->n_eq == 0 && bset->n_ineq == 0;
5313 int isl_map_fast_is_universe(__isl_keep isl_map *map)
5320 for (i = 0; i < map->n; ++i) {
5321 int r = isl_basic_map_is_universe(map->p[i]);
5329 int isl_set_fast_is_universe(__isl_keep isl_set *set)
5331 return isl_map_fast_is_universe((isl_map *) set);
5334 int isl_basic_map_is_empty(struct isl_basic_map *bmap)
5336 struct isl_basic_set *bset = NULL;
5337 struct isl_vec *sample = NULL;
5344 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY))
5347 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL)) {
5348 struct isl_basic_map *copy = isl_basic_map_copy(bmap);
5349 copy = isl_basic_map_remove_redundancies(copy);
5350 empty = ISL_F_ISSET(copy, ISL_BASIC_MAP_EMPTY);
5351 isl_basic_map_free(copy);
5355 total = 1 + isl_basic_map_total_dim(bmap);
5356 if (bmap->sample && bmap->sample->size == total) {
5357 int contains = isl_basic_map_contains(bmap, bmap->sample);
5363 isl_vec_free(bmap->sample);
5364 bmap->sample = NULL;
5365 bset = isl_basic_map_underlying_set(isl_basic_map_copy(bmap));
5368 sample = isl_basic_set_sample_vec(bset);
5371 empty = sample->size == 0;
5372 isl_vec_free(bmap->sample);
5373 bmap->sample = sample;
5375 ISL_F_SET(bmap, ISL_BASIC_MAP_EMPTY);
5380 int isl_basic_map_fast_is_empty(struct isl_basic_map *bmap)
5384 return ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY);
5387 int isl_basic_set_fast_is_empty(struct isl_basic_set *bset)
5391 return ISL_F_ISSET(bset, ISL_BASIC_SET_EMPTY);
5394 int isl_basic_set_is_empty(struct isl_basic_set *bset)
5396 return isl_basic_map_is_empty((struct isl_basic_map *)bset);
5399 struct isl_map *isl_basic_map_union(
5400 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
5402 struct isl_map *map;
5403 if (!bmap1 || !bmap2)
5406 isl_assert(bmap1->ctx, isl_dim_equal(bmap1->dim, bmap2->dim), goto error);
5408 map = isl_map_alloc_dim(isl_dim_copy(bmap1->dim), 2, 0);
5411 map = isl_map_add_basic_map(map, bmap1);
5412 map = isl_map_add_basic_map(map, bmap2);
5415 isl_basic_map_free(bmap1);
5416 isl_basic_map_free(bmap2);
5420 struct isl_set *isl_basic_set_union(
5421 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
5423 return (struct isl_set *)isl_basic_map_union(
5424 (struct isl_basic_map *)bset1,
5425 (struct isl_basic_map *)bset2);
5428 /* Order divs such that any div only depends on previous divs */
5429 struct isl_basic_map *isl_basic_map_order_divs(struct isl_basic_map *bmap)
5437 off = isl_dim_total(bmap->dim);
5439 for (i = 0; i < bmap->n_div; ++i) {
5441 if (isl_int_is_zero(bmap->div[i][0]))
5443 pos = isl_seq_first_non_zero(bmap->div[i]+1+1+off+i,
5447 isl_basic_map_swap_div(bmap, i, i + pos);
5453 struct isl_basic_set *isl_basic_set_order_divs(struct isl_basic_set *bset)
5455 return (struct isl_basic_set *)
5456 isl_basic_map_order_divs((struct isl_basic_map *)bset);
5459 __isl_give isl_map *isl_map_order_divs(__isl_take isl_map *map)
5466 for (i = 0; i < map->n; ++i) {
5467 map->p[i] = isl_basic_map_order_divs(map->p[i]);
5478 /* Look for a div in dst that corresponds to the div "div" in src.
5479 * The divs before "div" in src and dst are assumed to be the same.
5481 * Returns -1 if no corresponding div was found and the position
5482 * of the corresponding div in dst otherwise.
5484 static int find_div(struct isl_basic_map *dst,
5485 struct isl_basic_map *src, unsigned div)
5489 unsigned total = isl_dim_total(src->dim);
5491 isl_assert(dst->ctx, div <= dst->n_div, return -1);
5492 for (i = div; i < dst->n_div; ++i)
5493 if (isl_seq_eq(dst->div[i], src->div[div], 1+1+total+div) &&
5494 isl_seq_first_non_zero(dst->div[i]+1+1+total+div,
5495 dst->n_div - div) == -1)
5500 struct isl_basic_map *isl_basic_map_align_divs(
5501 struct isl_basic_map *dst, struct isl_basic_map *src)
5504 unsigned total = isl_dim_total(src->dim);
5509 if (src->n_div == 0)
5512 for (i = 0; i < src->n_div; ++i)
5513 isl_assert(src->ctx, !isl_int_is_zero(src->div[i][0]), goto error);
5515 src = isl_basic_map_order_divs(src);
5516 dst = isl_basic_map_cow(dst);
5517 dst = isl_basic_map_extend_dim(dst, isl_dim_copy(dst->dim),
5518 src->n_div, 0, 2 * src->n_div);
5521 for (i = 0; i < src->n_div; ++i) {
5522 int j = find_div(dst, src, i);
5524 j = isl_basic_map_alloc_div(dst);
5527 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total+i);
5528 isl_seq_clr(dst->div[j]+1+1+total+i, dst->n_div - i);
5529 if (isl_basic_map_add_div_constraints(dst, j) < 0)
5533 isl_basic_map_swap_div(dst, i, j);
5537 isl_basic_map_free(dst);
5541 struct isl_basic_set *isl_basic_set_align_divs(
5542 struct isl_basic_set *dst, struct isl_basic_set *src)
5544 return (struct isl_basic_set *)isl_basic_map_align_divs(
5545 (struct isl_basic_map *)dst, (struct isl_basic_map *)src);
5548 struct isl_map *isl_map_align_divs(struct isl_map *map)
5556 map = isl_map_compute_divs(map);
5557 map = isl_map_cow(map);
5561 for (i = 1; i < map->n; ++i)
5562 map->p[0] = isl_basic_map_align_divs(map->p[0], map->p[i]);
5563 for (i = 1; i < map->n; ++i)
5564 map->p[i] = isl_basic_map_align_divs(map->p[i], map->p[0]);
5566 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
5570 struct isl_set *isl_set_align_divs(struct isl_set *set)
5572 return (struct isl_set *)isl_map_align_divs((struct isl_map *)set);
5575 struct isl_set *isl_set_apply(struct isl_set *set, struct isl_map *map)
5579 isl_assert(set->ctx, isl_map_compatible_domain(map, set), goto error);
5580 map = isl_map_intersect_domain(map, set);
5581 set = isl_map_range(map);
5589 /* There is no need to cow as removing empty parts doesn't change
5590 * the meaning of the set.
5592 struct isl_map *isl_map_remove_empty_parts(struct isl_map *map)
5599 for (i = map->n-1; i >= 0; --i) {
5600 if (!ISL_F_ISSET(map->p[i], ISL_BASIC_MAP_EMPTY))
5602 isl_basic_map_free(map->p[i]);
5603 if (i != map->n-1) {
5604 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
5605 map->p[i] = map->p[map->n-1];
5613 struct isl_set *isl_set_remove_empty_parts(struct isl_set *set)
5615 return (struct isl_set *)
5616 isl_map_remove_empty_parts((struct isl_map *)set);
5619 struct isl_basic_map *isl_map_copy_basic_map(struct isl_map *map)
5621 struct isl_basic_map *bmap;
5622 if (!map || map->n == 0)
5624 bmap = map->p[map->n-1];
5625 isl_assert(map->ctx, ISL_F_ISSET(bmap, ISL_BASIC_SET_FINAL), return NULL);
5626 return isl_basic_map_copy(bmap);
5629 struct isl_basic_set *isl_set_copy_basic_set(struct isl_set *set)
5631 return (struct isl_basic_set *)
5632 isl_map_copy_basic_map((struct isl_map *)set);
5635 __isl_give isl_map *isl_map_drop_basic_map(__isl_take isl_map *map,
5636 __isl_keep isl_basic_map *bmap)
5642 for (i = map->n-1; i >= 0; --i) {
5643 if (map->p[i] != bmap)
5645 map = isl_map_cow(map);
5648 isl_basic_map_free(map->p[i]);
5649 if (i != map->n-1) {
5650 ISL_F_CLR(map, ISL_SET_NORMALIZED);
5651 map->p[i] = map->p[map->n-1];
5662 struct isl_set *isl_set_drop_basic_set(struct isl_set *set,
5663 struct isl_basic_set *bset)
5665 return (struct isl_set *)isl_map_drop_basic_map((struct isl_map *)set,
5666 (struct isl_basic_map *)bset);
5669 /* Given two basic sets bset1 and bset2, compute the maximal difference
5670 * between the values of dimension pos in bset1 and those in bset2
5671 * for any common value of the parameters and dimensions preceding pos.
5673 static enum isl_lp_result basic_set_maximal_difference_at(
5674 __isl_keep isl_basic_set *bset1, __isl_keep isl_basic_set *bset2,
5675 int pos, isl_int *opt)
5677 struct isl_dim *dims;
5678 struct isl_basic_map *bmap1 = NULL;
5679 struct isl_basic_map *bmap2 = NULL;
5680 struct isl_ctx *ctx;
5681 struct isl_vec *obj;
5684 unsigned dim1, dim2;
5685 enum isl_lp_result res;
5687 if (!bset1 || !bset2)
5688 return isl_lp_error;
5690 nparam = isl_basic_set_n_param(bset1);
5691 dim1 = isl_basic_set_n_dim(bset1);
5692 dim2 = isl_basic_set_n_dim(bset2);
5693 dims = isl_dim_alloc(bset1->ctx, nparam, pos, dim1 - pos);
5694 bmap1 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset1), dims);
5695 dims = isl_dim_alloc(bset2->ctx, nparam, pos, dim2 - pos);
5696 bmap2 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset2), dims);
5697 if (!bmap1 || !bmap2)
5699 bmap1 = isl_basic_map_cow(bmap1);
5700 bmap1 = isl_basic_map_extend(bmap1, nparam,
5701 pos, (dim1 - pos) + (dim2 - pos),
5702 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
5703 bmap1 = add_constraints(bmap1, bmap2, 0, dim1 - pos);
5706 total = isl_basic_map_total_dim(bmap1);
5708 obj = isl_vec_alloc(ctx, 1 + total);
5709 isl_seq_clr(obj->block.data, 1 + total);
5710 isl_int_set_si(obj->block.data[1+nparam+pos], 1);
5711 isl_int_set_si(obj->block.data[1+nparam+pos+(dim1-pos)], -1);
5714 res = isl_basic_map_solve_lp(bmap1, 1, obj->block.data, ctx->one,
5716 isl_basic_map_free(bmap1);
5720 isl_basic_map_free(bmap1);
5721 isl_basic_map_free(bmap2);
5722 return isl_lp_error;
5725 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
5726 * for any common value of the parameters and dimensions preceding pos
5727 * in both basic sets, the values of dimension pos in bset1 are
5728 * smaller or larger than those in bset2.
5731 * 1 if bset1 follows bset2
5732 * -1 if bset1 precedes bset2
5733 * 0 if bset1 and bset2 are incomparable
5734 * -2 if some error occurred.
5736 int isl_basic_set_compare_at(struct isl_basic_set *bset1,
5737 struct isl_basic_set *bset2, int pos)
5740 enum isl_lp_result res;
5745 res = basic_set_maximal_difference_at(bset1, bset2, pos, &opt);
5747 if (res == isl_lp_empty)
5749 else if ((res == isl_lp_ok && isl_int_is_pos(opt)) ||
5750 res == isl_lp_unbounded)
5752 else if (res == isl_lp_ok && isl_int_is_neg(opt))
5761 /* Given two basic sets bset1 and bset2, check whether
5762 * for any common value of the parameters and dimensions preceding pos
5763 * there is a value of dimension pos in bset1 that is larger
5764 * than a value of the same dimension in bset2.
5767 * 1 if there exists such a pair
5768 * 0 if there is no such pair, but there is a pair of equal values
5770 * -2 if some error occurred.
5772 int isl_basic_set_follows_at(__isl_keep isl_basic_set *bset1,
5773 __isl_keep isl_basic_set *bset2, int pos)
5776 enum isl_lp_result res;
5781 res = basic_set_maximal_difference_at(bset1, bset2, pos, &opt);
5783 if (res == isl_lp_empty)
5785 else if ((res == isl_lp_ok && isl_int_is_pos(opt)) ||
5786 res == isl_lp_unbounded)
5788 else if (res == isl_lp_ok && isl_int_is_neg(opt))
5790 else if (res == isl_lp_ok)
5799 /* Given two sets set1 and set2, check whether
5800 * for any common value of the parameters and dimensions preceding pos
5801 * there is a value of dimension pos in set1 that is larger
5802 * than a value of the same dimension in set2.
5805 * 1 if there exists such a pair
5806 * 0 if there is no such pair, but there is a pair of equal values
5808 * -2 if some error occurred.
5810 int isl_set_follows_at(__isl_keep isl_set *set1,
5811 __isl_keep isl_set *set2, int pos)
5819 for (i = 0; i < set1->n; ++i)
5820 for (j = 0; j < set2->n; ++j) {
5822 f = isl_basic_set_follows_at(set1->p[i], set2->p[j], pos);
5823 if (f == 1 || f == -2)
5832 static int isl_basic_map_fast_has_fixed_var(struct isl_basic_map *bmap,
5833 unsigned pos, isl_int *val)
5841 total = isl_basic_map_total_dim(bmap);
5842 for (i = 0, d = total-1; i < bmap->n_eq && d+1 > pos; ++i) {
5843 for (; d+1 > pos; --d)
5844 if (!isl_int_is_zero(bmap->eq[i][1+d]))
5848 if (isl_seq_first_non_zero(bmap->eq[i]+1, d) != -1)
5850 if (isl_seq_first_non_zero(bmap->eq[i]+1+d+1, total-d-1) != -1)
5852 if (!isl_int_is_one(bmap->eq[i][1+d]))
5855 isl_int_neg(*val, bmap->eq[i][0]);
5861 static int isl_map_fast_has_fixed_var(struct isl_map *map,
5862 unsigned pos, isl_int *val)
5874 return isl_basic_map_fast_has_fixed_var(map->p[0], pos, val);
5877 fixed = isl_basic_map_fast_has_fixed_var(map->p[0], pos, &v);
5878 for (i = 1; fixed == 1 && i < map->n; ++i) {
5879 fixed = isl_basic_map_fast_has_fixed_var(map->p[i], pos, &tmp);
5880 if (fixed == 1 && isl_int_ne(tmp, v))
5884 isl_int_set(*val, v);
5890 static int isl_basic_set_fast_has_fixed_var(struct isl_basic_set *bset,
5891 unsigned pos, isl_int *val)
5893 return isl_basic_map_fast_has_fixed_var((struct isl_basic_map *)bset,
5897 static int isl_set_fast_has_fixed_var(struct isl_set *set, unsigned pos,
5900 return isl_map_fast_has_fixed_var((struct isl_map *)set, pos, val);
5903 int isl_basic_map_fast_is_fixed(struct isl_basic_map *bmap,
5904 enum isl_dim_type type, unsigned pos, isl_int *val)
5906 if (pos >= isl_basic_map_dim(bmap, type))
5908 return isl_basic_map_fast_has_fixed_var(bmap,
5909 isl_basic_map_offset(bmap, type) - 1 + pos, val);
5912 int isl_map_fast_is_fixed(struct isl_map *map,
5913 enum isl_dim_type type, unsigned pos, isl_int *val)
5915 if (pos >= isl_map_dim(map, type))
5917 return isl_map_fast_has_fixed_var(map,
5918 map_offset(map, type) - 1 + pos, val);
5921 /* Check if dimension dim has fixed value and if so and if val is not NULL,
5922 * then return this fixed value in *val.
5924 int isl_basic_set_fast_dim_is_fixed(struct isl_basic_set *bset, unsigned dim,
5927 return isl_basic_set_fast_has_fixed_var(bset,
5928 isl_basic_set_n_param(bset) + dim, val);
5931 /* Check if dimension dim has fixed value and if so and if val is not NULL,
5932 * then return this fixed value in *val.
5934 int isl_set_fast_dim_is_fixed(struct isl_set *set, unsigned dim, isl_int *val)
5936 return isl_set_fast_has_fixed_var(set, isl_set_n_param(set) + dim, val);
5939 /* Check if input variable in has fixed value and if so and if val is not NULL,
5940 * then return this fixed value in *val.
5942 int isl_map_fast_input_is_fixed(struct isl_map *map, unsigned in, isl_int *val)
5944 return isl_map_fast_has_fixed_var(map, isl_map_n_param(map) + in, val);
5947 /* Check if dimension dim has an (obvious) fixed lower bound and if so
5948 * and if val is not NULL, then return this lower bound in *val.
5950 int isl_basic_set_fast_dim_has_fixed_lower_bound(struct isl_basic_set *bset,
5951 unsigned dim, isl_int *val)
5953 int i, i_eq = -1, i_ineq = -1;
5960 total = isl_basic_set_total_dim(bset);
5961 nparam = isl_basic_set_n_param(bset);
5962 for (i = 0; i < bset->n_eq; ++i) {
5963 if (isl_int_is_zero(bset->eq[i][1+nparam+dim]))
5969 for (i = 0; i < bset->n_ineq; ++i) {
5970 if (!isl_int_is_pos(bset->ineq[i][1+nparam+dim]))
5972 if (i_eq != -1 || i_ineq != -1)
5976 if (i_eq == -1 && i_ineq == -1)
5978 c = i_eq != -1 ? bset->eq[i_eq] : bset->ineq[i_ineq];
5979 /* The coefficient should always be one due to normalization. */
5980 if (!isl_int_is_one(c[1+nparam+dim]))
5982 if (isl_seq_first_non_zero(c+1, nparam+dim) != -1)
5984 if (isl_seq_first_non_zero(c+1+nparam+dim+1,
5985 total - nparam - dim - 1) != -1)
5988 isl_int_neg(*val, c[0]);
5992 int isl_set_fast_dim_has_fixed_lower_bound(struct isl_set *set,
5993 unsigned dim, isl_int *val)
6005 return isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[0],
6009 fixed = isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[0],
6011 for (i = 1; fixed == 1 && i < set->n; ++i) {
6012 fixed = isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[i],
6014 if (fixed == 1 && isl_int_ne(tmp, v))
6018 isl_int_set(*val, v);
6029 static int qsort_constraint_cmp(const void *p1, const void *p2)
6031 const struct constraint *c1 = (const struct constraint *)p1;
6032 const struct constraint *c2 = (const struct constraint *)p2;
6033 unsigned size = isl_min(c1->size, c2->size);
6034 return isl_seq_cmp(c1->c, c2->c, size);
6037 static struct isl_basic_map *isl_basic_map_sort_constraints(
6038 struct isl_basic_map *bmap)
6041 struct constraint *c;
6046 total = isl_basic_map_total_dim(bmap);
6047 c = isl_alloc_array(bmap->ctx, struct constraint, bmap->n_ineq);
6050 for (i = 0; i < bmap->n_ineq; ++i) {
6052 c[i].c = bmap->ineq[i];
6054 qsort(c, bmap->n_ineq, sizeof(struct constraint), qsort_constraint_cmp);
6055 for (i = 0; i < bmap->n_ineq; ++i)
6056 bmap->ineq[i] = c[i].c;
6060 isl_basic_map_free(bmap);
6064 __isl_give isl_basic_set *isl_basic_set_sort_constraints(
6065 __isl_take isl_basic_set *bset)
6067 return (struct isl_basic_set *)isl_basic_map_sort_constraints(
6068 (struct isl_basic_map *)bset);
6071 struct isl_basic_map *isl_basic_map_normalize(struct isl_basic_map *bmap)
6075 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_NORMALIZED))
6077 bmap = isl_basic_map_remove_redundancies(bmap);
6078 bmap = isl_basic_map_sort_constraints(bmap);
6079 ISL_F_SET(bmap, ISL_BASIC_MAP_NORMALIZED);
6083 struct isl_basic_set *isl_basic_set_normalize(struct isl_basic_set *bset)
6085 return (struct isl_basic_set *)isl_basic_map_normalize(
6086 (struct isl_basic_map *)bset);
6089 int isl_basic_map_fast_cmp(const __isl_keep isl_basic_map *bmap1,
6090 const __isl_keep isl_basic_map *bmap2)
6097 if (isl_basic_map_n_param(bmap1) != isl_basic_map_n_param(bmap2))
6098 return isl_basic_map_n_param(bmap1) - isl_basic_map_n_param(bmap2);
6099 if (isl_basic_map_n_in(bmap1) != isl_basic_map_n_in(bmap2))
6100 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
6101 if (isl_basic_map_n_out(bmap1) != isl_basic_map_n_out(bmap2))
6102 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
6103 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY) &&
6104 ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
6106 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY))
6108 if (ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
6110 if (bmap1->n_eq != bmap2->n_eq)
6111 return bmap1->n_eq - bmap2->n_eq;
6112 if (bmap1->n_ineq != bmap2->n_ineq)
6113 return bmap1->n_ineq - bmap2->n_ineq;
6114 if (bmap1->n_div != bmap2->n_div)
6115 return bmap1->n_div - bmap2->n_div;
6116 total = isl_basic_map_total_dim(bmap1);
6117 for (i = 0; i < bmap1->n_eq; ++i) {
6118 cmp = isl_seq_cmp(bmap1->eq[i], bmap2->eq[i], 1+total);
6122 for (i = 0; i < bmap1->n_ineq; ++i) {
6123 cmp = isl_seq_cmp(bmap1->ineq[i], bmap2->ineq[i], 1+total);
6127 for (i = 0; i < bmap1->n_div; ++i) {
6128 cmp = isl_seq_cmp(bmap1->div[i], bmap2->div[i], 1+1+total);
6135 int isl_basic_map_fast_is_equal(__isl_keep isl_basic_map *bmap1,
6136 __isl_keep isl_basic_map *bmap2)
6138 return isl_basic_map_fast_cmp(bmap1, bmap2) == 0;
6141 int isl_basic_set_fast_is_equal(__isl_keep isl_basic_set *bset1,
6142 __isl_keep isl_basic_set *bset2)
6144 return isl_basic_map_fast_is_equal((isl_basic_map *)bset1,
6145 (isl_basic_map *)bset2);
6148 static int qsort_bmap_cmp(const void *p1, const void *p2)
6150 const struct isl_basic_map *bmap1 = *(const struct isl_basic_map **)p1;
6151 const struct isl_basic_map *bmap2 = *(const struct isl_basic_map **)p2;
6153 return isl_basic_map_fast_cmp(bmap1, bmap2);
6156 /* We normalize in place, but if anything goes wrong we need
6157 * to return NULL, so we need to make sure we don't change the
6158 * meaning of any possible other copies of map.
6160 struct isl_map *isl_map_normalize(struct isl_map *map)
6163 struct isl_basic_map *bmap;
6167 if (ISL_F_ISSET(map, ISL_MAP_NORMALIZED))
6169 for (i = 0; i < map->n; ++i) {
6170 bmap = isl_basic_map_normalize(isl_basic_map_copy(map->p[i]));
6173 isl_basic_map_free(map->p[i]);
6176 qsort(map->p, map->n, sizeof(struct isl_basic_map *), qsort_bmap_cmp);
6177 ISL_F_SET(map, ISL_MAP_NORMALIZED);
6178 map = isl_map_remove_empty_parts(map);
6181 for (i = map->n - 1; i >= 1; --i) {
6182 if (!isl_basic_map_fast_is_equal(map->p[i-1], map->p[i]))
6184 isl_basic_map_free(map->p[i-1]);
6185 for (j = i; j < map->n; ++j)
6186 map->p[j-1] = map->p[j];
6196 struct isl_set *isl_set_normalize(struct isl_set *set)
6198 return (struct isl_set *)isl_map_normalize((struct isl_map *)set);
6201 int isl_map_fast_is_equal(struct isl_map *map1, struct isl_map *map2)
6211 if (!isl_dim_equal(map1->dim, map2->dim))
6214 map1 = isl_map_copy(map1);
6215 map2 = isl_map_copy(map2);
6216 map1 = isl_map_normalize(map1);
6217 map2 = isl_map_normalize(map2);
6220 equal = map1->n == map2->n;
6221 for (i = 0; equal && i < map1->n; ++i) {
6222 equal = isl_basic_map_fast_is_equal(map1->p[i], map2->p[i]);
6235 int isl_set_fast_is_equal(struct isl_set *set1, struct isl_set *set2)
6237 return isl_map_fast_is_equal((struct isl_map *)set1,
6238 (struct isl_map *)set2);
6241 /* Return an interval that ranges from min to max (inclusive)
6243 struct isl_basic_set *isl_basic_set_interval(struct isl_ctx *ctx,
6244 isl_int min, isl_int max)
6247 struct isl_basic_set *bset = NULL;
6249 bset = isl_basic_set_alloc(ctx, 0, 1, 0, 0, 2);
6253 k = isl_basic_set_alloc_inequality(bset);
6256 isl_int_set_si(bset->ineq[k][1], 1);
6257 isl_int_neg(bset->ineq[k][0], min);
6259 k = isl_basic_set_alloc_inequality(bset);
6262 isl_int_set_si(bset->ineq[k][1], -1);
6263 isl_int_set(bset->ineq[k][0], max);
6267 isl_basic_set_free(bset);
6271 /* Return the Cartesian product of the basic sets in list (in the given order).
6273 struct isl_basic_set *isl_basic_set_product(struct isl_basic_set_list *list)
6281 struct isl_basic_set *product = NULL;
6285 isl_assert(list->ctx, list->n > 0, goto error);
6286 isl_assert(list->ctx, list->p[0], goto error);
6287 nparam = isl_basic_set_n_param(list->p[0]);
6288 dim = isl_basic_set_n_dim(list->p[0]);
6289 extra = list->p[0]->n_div;
6290 n_eq = list->p[0]->n_eq;
6291 n_ineq = list->p[0]->n_ineq;
6292 for (i = 1; i < list->n; ++i) {
6293 isl_assert(list->ctx, list->p[i], goto error);
6294 isl_assert(list->ctx,
6295 nparam == isl_basic_set_n_param(list->p[i]), goto error);
6296 dim += isl_basic_set_n_dim(list->p[i]);
6297 extra += list->p[i]->n_div;
6298 n_eq += list->p[i]->n_eq;
6299 n_ineq += list->p[i]->n_ineq;
6301 product = isl_basic_set_alloc(list->ctx, nparam, dim, extra,
6306 for (i = 0; i < list->n; ++i) {
6307 isl_basic_set_add_constraints(product,
6308 isl_basic_set_copy(list->p[i]), dim);
6309 dim += isl_basic_set_n_dim(list->p[i]);
6311 isl_basic_set_list_free(list);
6314 isl_basic_set_free(product);
6315 isl_basic_set_list_free(list);
6319 struct isl_basic_map *isl_basic_map_product(
6320 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
6322 struct isl_dim *dim_result = NULL;
6323 struct isl_basic_map *bmap;
6324 unsigned in1, in2, out1, out2, nparam, total, pos;
6325 struct isl_dim_map *dim_map1, *dim_map2;
6327 if (!bmap1 || !bmap2)
6330 isl_assert(bmap1->ctx, isl_dim_match(bmap1->dim, isl_dim_param,
6331 bmap2->dim, isl_dim_param), goto error);
6332 dim_result = isl_dim_product(isl_dim_copy(bmap1->dim),
6333 isl_dim_copy(bmap2->dim));
6335 in1 = isl_basic_map_n_in(bmap1);
6336 in2 = isl_basic_map_n_in(bmap2);
6337 out1 = isl_basic_map_n_out(bmap1);
6338 out2 = isl_basic_map_n_out(bmap2);
6339 nparam = isl_basic_map_n_param(bmap1);
6341 total = nparam + in1 + in2 + out1 + out2 + bmap1->n_div + bmap2->n_div;
6342 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
6343 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
6344 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
6345 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
6346 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
6347 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos += in1);
6348 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += in2);
6349 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += out1);
6350 isl_dim_map_div(dim_map1, bmap1, pos += out2);
6351 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
6353 bmap = isl_basic_map_alloc_dim(dim_result,
6354 bmap1->n_div + bmap2->n_div,
6355 bmap1->n_eq + bmap2->n_eq,
6356 bmap1->n_ineq + bmap2->n_ineq);
6357 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
6358 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
6359 bmap = isl_basic_map_simplify(bmap);
6360 return isl_basic_map_finalize(bmap);
6362 isl_basic_map_free(bmap1);
6363 isl_basic_map_free(bmap2);
6367 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
6369 struct isl_map *isl_map_product(struct isl_map *map1, struct isl_map *map2)
6372 struct isl_map *result;
6378 isl_assert(map1->ctx, isl_dim_match(map1->dim, isl_dim_param,
6379 map2->dim, isl_dim_param), goto error);
6381 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
6382 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
6383 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
6385 result = isl_map_alloc_dim(isl_dim_product(isl_dim_copy(map1->dim),
6386 isl_dim_copy(map2->dim)),
6387 map1->n * map2->n, flags);
6390 for (i = 0; i < map1->n; ++i)
6391 for (j = 0; j < map2->n; ++j) {
6392 struct isl_basic_map *part;
6393 part = isl_basic_map_product(
6394 isl_basic_map_copy(map1->p[i]),
6395 isl_basic_map_copy(map2->p[j]));
6396 if (isl_basic_map_is_empty(part))
6397 isl_basic_map_free(part);
6399 result = isl_map_add_basic_map(result, part);
6412 /* Given two set A and B, construct its Cartesian product A x B.
6414 struct isl_set *isl_set_product(struct isl_set *set1, struct isl_set *set2)
6416 return (struct isl_set *)isl_map_product((struct isl_map *)set1,
6417 (struct isl_map *)set2);
6420 uint32_t isl_basic_set_get_hash(struct isl_basic_set *bset)
6423 uint32_t hash = isl_hash_init();
6428 bset = isl_basic_set_copy(bset);
6429 bset = isl_basic_set_normalize(bset);
6432 total = isl_basic_set_total_dim(bset);
6433 isl_hash_byte(hash, bset->n_eq & 0xFF);
6434 for (i = 0; i < bset->n_eq; ++i) {
6436 c_hash = isl_seq_get_hash(bset->eq[i], 1 + total);
6437 isl_hash_hash(hash, c_hash);
6439 isl_hash_byte(hash, bset->n_ineq & 0xFF);
6440 for (i = 0; i < bset->n_ineq; ++i) {
6442 c_hash = isl_seq_get_hash(bset->ineq[i], 1 + total);
6443 isl_hash_hash(hash, c_hash);
6445 isl_hash_byte(hash, bset->n_div & 0xFF);
6446 for (i = 0; i < bset->n_div; ++i) {
6448 if (isl_int_is_zero(bset->div[i][0]))
6450 isl_hash_byte(hash, i & 0xFF);
6451 c_hash = isl_seq_get_hash(bset->div[i], 1 + 1 + total);
6452 isl_hash_hash(hash, c_hash);
6454 isl_basic_set_free(bset);
6458 uint32_t isl_set_get_hash(struct isl_set *set)
6465 set = isl_set_copy(set);
6466 set = isl_set_normalize(set);
6470 hash = isl_hash_init();
6471 for (i = 0; i < set->n; ++i) {
6473 bset_hash = isl_basic_set_get_hash(set->p[i]);
6474 isl_hash_hash(hash, bset_hash);
6482 /* Check if the value for dimension dim is completely determined
6483 * by the values of the other parameters and variables.
6484 * That is, check if dimension dim is involved in an equality.
6486 int isl_basic_set_dim_is_unique(struct isl_basic_set *bset, unsigned dim)
6493 nparam = isl_basic_set_n_param(bset);
6494 for (i = 0; i < bset->n_eq; ++i)
6495 if (!isl_int_is_zero(bset->eq[i][1 + nparam + dim]))
6500 /* Check if the value for dimension dim is completely determined
6501 * by the values of the other parameters and variables.
6502 * That is, check if dimension dim is involved in an equality
6503 * for each of the subsets.
6505 int isl_set_dim_is_unique(struct isl_set *set, unsigned dim)
6511 for (i = 0; i < set->n; ++i) {
6513 unique = isl_basic_set_dim_is_unique(set->p[i], dim);
6520 int isl_map_foreach_basic_map(__isl_keep isl_map *map,
6521 int (*fn)(__isl_take isl_basic_map *bmap, void *user), void *user)
6528 for (i = 0; i < map->n; ++i)
6529 if (fn(isl_basic_map_copy(map->p[i]), user) < 0)
6535 int isl_set_foreach_basic_set(__isl_keep isl_set *set,
6536 int (*fn)(__isl_take isl_basic_set *bset, void *user), void *user)
6543 for (i = 0; i < set->n; ++i)
6544 if (fn(isl_basic_set_copy(set->p[i]), user) < 0)
6550 __isl_give isl_basic_set *isl_basic_set_lift(__isl_take isl_basic_set *bset)
6552 struct isl_dim *dim;
6557 if (bset->n_div == 0)
6560 bset = isl_basic_set_cow(bset);
6564 dim = isl_basic_set_get_dim(bset);
6565 dim = isl_dim_add(dim, isl_dim_set, bset->n_div);
6568 isl_dim_free(bset->dim);
6572 bset = isl_basic_set_finalize(bset);
6576 isl_basic_set_free(bset);
6580 __isl_give isl_set *isl_set_lift(__isl_take isl_set *set)
6583 struct isl_dim *dim;
6586 set = isl_set_align_divs(set);
6590 if (set->n == 0 || set->p[0]->n_div == 0)
6593 set = isl_set_cow(set);
6597 n_div = set->p[0]->n_div;
6598 dim = isl_set_get_dim(set);
6599 dim = isl_dim_add(dim, isl_dim_set, n_div);
6602 isl_dim_free(set->dim);
6605 for (i = 0; i < set->n; ++i) {
6606 set->p[i] = isl_basic_set_lift(set->p[i]);
6617 __isl_give isl_map *isl_set_lifting(__isl_take isl_set *set)
6619 struct isl_dim *dim;
6620 struct isl_basic_map *bmap;
6627 set = isl_set_align_divs(set);
6632 dim = isl_set_get_dim(set);
6633 if (set->n == 0 || set->p[0]->n_div == 0) {
6635 return isl_map_identity(dim);
6638 n_div = set->p[0]->n_div;
6639 dim = isl_dim_map(dim);
6640 n_param = isl_dim_size(dim, isl_dim_param);
6641 n_set = isl_dim_size(dim, isl_dim_in);
6642 dim = isl_dim_extend(dim, n_param, n_set, n_set + n_div);
6643 bmap = isl_basic_map_alloc_dim(dim, 0, n_set, 2 * n_div);
6644 for (i = 0; i < n_set; ++i)
6645 bmap = var_equal(bmap, i);
6647 total = n_param + n_set + n_set + n_div;
6648 for (i = 0; i < n_div; ++i) {
6649 k = isl_basic_map_alloc_inequality(bmap);
6652 isl_seq_cpy(bmap->ineq[k], set->p[0]->div[i]+1, 1+n_param);
6653 isl_seq_clr(bmap->ineq[k]+1+n_param, n_set);
6654 isl_seq_cpy(bmap->ineq[k]+1+n_param+n_set,
6655 set->p[0]->div[i]+1+1+n_param, n_set + n_div);
6656 isl_int_neg(bmap->ineq[k][1+n_param+n_set+n_set+i],
6657 set->p[0]->div[i][0]);
6659 l = isl_basic_map_alloc_inequality(bmap);
6662 isl_seq_neg(bmap->ineq[l], bmap->ineq[k], 1 + total);
6663 isl_int_add(bmap->ineq[l][0], bmap->ineq[l][0],
6664 set->p[0]->div[i][0]);
6665 isl_int_sub_ui(bmap->ineq[l][0], bmap->ineq[l][0], 1);
6669 return isl_map_from_basic_map(bmap);
6672 isl_basic_map_free(bmap);
6676 int isl_basic_set_size(__isl_keep isl_basic_set *bset)
6684 dim = isl_basic_set_total_dim(bset);
6685 size += bset->n_eq * (1 + dim);
6686 size += bset->n_ineq * (1 + dim);
6687 size += bset->n_div * (2 + dim);
6692 int isl_set_size(__isl_keep isl_set *set)
6700 for (i = 0; i < set->n; ++i)
6701 size += isl_basic_set_size(set->p[i]);
6706 int isl_basic_map_dim_is_bounded(__isl_keep isl_basic_map *bmap,
6707 enum isl_dim_type type, unsigned pos)
6715 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), return -1);
6717 pos += isl_basic_map_offset(bmap, type);
6719 for (i = 0; i < bmap->n_eq; ++i)
6720 if (!isl_int_is_zero(bmap->eq[i][pos]))
6724 for (i = 0; i < bmap->n_ineq; ++i) {
6725 int sgn = isl_int_sgn(bmap->ineq[i][pos]);
6732 return lower && upper;
6735 int isl_map_dim_is_bounded(__isl_keep isl_map *map,
6736 enum isl_dim_type type, unsigned pos)
6743 for (i = 0; i < map->n; ++i) {
6745 bounded = isl_basic_map_dim_is_bounded(map->p[i], type, pos);
6746 if (bounded < 0 || !bounded)
6753 /* Return 1 if the specified dim is involved in both an upper bound
6754 * and a lower bound.
6756 int isl_set_dim_is_bounded(__isl_keep isl_set *set,
6757 enum isl_dim_type type, unsigned pos)
6759 return isl_map_dim_is_bounded((isl_map *)set, type, pos);
6762 /* For each of the "n" variables starting at "first", determine
6763 * the sign of the variable and put the results in the first "n"
6764 * elements of the array "signs".
6766 * 1 means that the variable is non-negative
6767 * -1 means that the variable is non-positive
6768 * 0 means the variable attains both positive and negative values.
6770 int isl_basic_set_vars_get_sign(__isl_keep isl_basic_set *bset,
6771 unsigned first, unsigned n, int *signs)
6773 isl_vec *bound = NULL;
6774 struct isl_tab *tab = NULL;
6775 struct isl_tab_undo *snap;
6778 if (!bset || !signs)
6781 bound = isl_vec_alloc(bset->ctx, 1 + isl_basic_set_total_dim(bset));
6782 tab = isl_tab_from_basic_set(bset);
6786 isl_seq_clr(bound->el, bound->size);
6787 isl_int_set_si(bound->el[0], -1);
6789 snap = isl_tab_snap(tab);
6790 for (i = 0; i < n; ++i) {
6793 isl_int_set_si(bound->el[1 + first + i], -1);
6794 if (isl_tab_add_ineq(tab, bound->el) < 0)
6797 isl_int_set_si(bound->el[1 + first + i], 0);
6798 if (isl_tab_rollback(tab, snap) < 0)
6806 isl_int_set_si(bound->el[1 + first + i], 1);
6807 if (isl_tab_add_ineq(tab, bound->el) < 0)
6810 isl_int_set_si(bound->el[1 + first + i], 0);
6811 if (isl_tab_rollback(tab, snap) < 0)
6814 signs[i] = empty ? -1 : 0;
6818 isl_vec_free(bound);
6822 isl_vec_free(bound);
6826 int isl_basic_set_dims_get_sign(__isl_keep isl_basic_set *bset,
6827 enum isl_dim_type type, unsigned first, unsigned n, int *signs)
6829 if (!bset || !signs)
6831 isl_assert(bset->ctx, first + n <= isl_basic_set_dim(bset, type),
6834 first += pos(bset->dim, type) - 1;
6835 return isl_basic_set_vars_get_sign(bset, first, n, signs);
6838 /* Check if the given map is single-valued.
6843 * and check if the result is a subset of the identity mapping.
6845 int isl_map_is_single_valued(__isl_keep isl_map *map)
6851 test = isl_map_reverse(isl_map_copy(map));
6852 test = isl_map_apply_range(test, isl_map_copy(map));
6854 id = isl_map_identity(isl_dim_range(isl_map_get_dim(map)));
6856 sv = isl_map_is_subset(test, id);
6864 int isl_map_is_bijective(__isl_keep isl_map *map)
6868 sv = isl_map_is_single_valued(map);
6872 map = isl_map_copy(map);
6873 map = isl_map_reverse(map);
6874 sv = isl_map_is_single_valued(map);
6880 int isl_set_is_singleton(__isl_keep isl_set *set)
6882 return isl_map_is_single_valued((isl_map *)set);
6885 int isl_map_is_translation(__isl_keep isl_map *map)
6890 delta = isl_map_deltas(isl_map_copy(map));
6891 ok = isl_set_is_singleton(delta);
6892 isl_set_free(delta);
6897 static int unique(isl_int *p, unsigned pos, unsigned len)
6899 if (isl_seq_first_non_zero(p, pos) != -1)
6901 if (isl_seq_first_non_zero(p + pos + 1, len - pos - 1) != -1)
6906 int isl_basic_set_is_box(__isl_keep isl_basic_set *bset)
6915 if (isl_basic_set_dim(bset, isl_dim_div) != 0)
6918 nvar = isl_basic_set_dim(bset, isl_dim_set);
6919 ovar = isl_dim_offset(bset->dim, isl_dim_set);
6920 for (j = 0; j < nvar; ++j) {
6921 int lower = 0, upper = 0;
6922 for (i = 0; i < bset->n_eq; ++i) {
6923 if (isl_int_is_zero(bset->eq[i][1 + ovar + j]))
6925 if (!unique(bset->eq[i] + 1 + ovar, j, nvar))
6931 for (i = 0; i < bset->n_ineq; ++i) {
6932 if (isl_int_is_zero(bset->ineq[i][1 + ovar + j]))
6934 if (!unique(bset->ineq[i] + 1 + ovar, j, nvar))
6936 if (isl_int_is_pos(bset->ineq[i][1 + ovar + j]))
6941 if (!lower || !upper)
6948 int isl_set_is_box(__isl_keep isl_set *set)
6955 return isl_basic_set_is_box(set->p[0]);