2 * Copyright 2008-2009 Katholieke Universiteit Leuven
4 * Use of this software is governed by the GNU LGPLv2.1 license
6 * Written by Sven Verdoolaege, K.U.Leuven, Departement
7 * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium
15 #include "isl_equalities.h"
21 #include "isl_map_private.h"
22 #include "isl_map_piplib.h"
23 #include "isl_sample.h"
27 /* Maps dst positions to src positions */
33 static struct isl_dim_map *isl_dim_map_alloc(struct isl_ctx *ctx, unsigned len)
36 struct isl_dim_map *dim_map;
37 dim_map = isl_alloc(ctx, struct isl_dim_map,
38 sizeof(struct isl_dim_map) + len * sizeof(int));
41 dim_map->len = 1 + len;
43 for (i = 0; i < len; ++i)
44 dim_map->pos[1 + i] = -1;
48 static unsigned n(struct isl_dim *dim, enum isl_dim_type type)
51 case isl_dim_param: return dim->nparam;
52 case isl_dim_in: return dim->n_in;
53 case isl_dim_out: return dim->n_out;
54 case isl_dim_all: return dim->nparam + dim->n_in + dim->n_out;
58 static unsigned pos(struct isl_dim *dim, enum isl_dim_type type)
61 case isl_dim_param: return 1;
62 case isl_dim_in: return 1 + dim->nparam;
63 case isl_dim_out: return 1 + dim->nparam + dim->n_in;
67 static void isl_dim_map_dim(struct isl_dim_map *dim_map, struct isl_dim *dim,
68 enum isl_dim_type type, unsigned dst_pos)
76 src_pos = pos(dim, type);
77 for (i = 0; i < n(dim, type); ++i)
78 dim_map->pos[1 + dst_pos + i] = src_pos + i;
81 static void isl_dim_map_div(struct isl_dim_map *dim_map,
82 struct isl_basic_map *bmap, unsigned dst_pos)
87 if (!dim_map || !bmap)
90 src_pos = 1 + isl_dim_total(bmap->dim);
91 for (i = 0; i < bmap->n_div; ++i)
92 dim_map->pos[1 + dst_pos + i] = src_pos + i;
95 static void isl_dim_map_dump(struct isl_dim_map *dim_map)
99 for (i = 0; i < dim_map->len; ++i)
100 fprintf(stderr, "%d -> %d; ", i, dim_map->pos[i]);
101 fprintf(stderr, "\n");
104 unsigned isl_basic_map_dim(const struct isl_basic_map *bmap,
105 enum isl_dim_type type)
110 case isl_dim_out: return isl_dim_size(bmap->dim, type);
111 case isl_dim_div: return bmap->n_div;
112 case isl_dim_all: return isl_basic_map_total_dim(bmap);
116 unsigned isl_map_dim(const struct isl_map *map, enum isl_dim_type type)
118 return n(map->dim, type);
121 unsigned isl_set_dim(const struct isl_set *set, enum isl_dim_type type)
123 return n(set->dim, type);
126 unsigned isl_basic_map_offset(struct isl_basic_map *bmap,
127 enum isl_dim_type type)
129 struct isl_dim *dim = bmap->dim;
131 case isl_dim_param: return 1;
132 case isl_dim_in: return 1 + dim->nparam;
133 case isl_dim_out: return 1 + dim->nparam + dim->n_in;
134 case isl_dim_div: return 1 + dim->nparam + dim->n_in + dim->n_out;
138 static unsigned map_offset(struct isl_map *map, enum isl_dim_type type)
140 return pos(map->dim, type);
143 unsigned isl_basic_set_dim(const struct isl_basic_set *bset,
144 enum isl_dim_type type)
146 return isl_basic_map_dim((const struct isl_basic_map*)bset, type);
149 unsigned isl_basic_set_n_dim(const struct isl_basic_set *bset)
151 return bset->dim->n_out;
154 unsigned isl_basic_set_n_param(const struct isl_basic_set *bset)
156 return bset->dim->nparam;
159 unsigned isl_basic_set_total_dim(const struct isl_basic_set *bset)
161 return isl_dim_total(bset->dim) + bset->n_div;
164 unsigned isl_set_n_dim(const struct isl_set *set)
166 return set->dim->n_out;
169 unsigned isl_set_n_param(const struct isl_set *set)
171 return set->dim->nparam;
174 unsigned isl_basic_map_n_in(const struct isl_basic_map *bmap)
176 return bmap->dim->n_in;
179 unsigned isl_basic_map_n_out(const struct isl_basic_map *bmap)
181 return bmap->dim->n_out;
184 unsigned isl_basic_map_n_param(const struct isl_basic_map *bmap)
186 return bmap->dim->nparam;
189 unsigned isl_basic_map_n_div(const struct isl_basic_map *bmap)
194 unsigned isl_basic_map_total_dim(const struct isl_basic_map *bmap)
196 return isl_dim_total(bmap->dim) + bmap->n_div;
199 unsigned isl_map_n_in(const struct isl_map *map)
201 return map->dim->n_in;
204 unsigned isl_map_n_out(const struct isl_map *map)
206 return map->dim->n_out;
209 unsigned isl_map_n_param(const struct isl_map *map)
211 return map->dim->nparam;
214 int isl_map_compatible_domain(struct isl_map *map, struct isl_set *set)
216 return map->dim->n_in == set->dim->n_out &&
217 map->dim->nparam == set->dim->nparam;
220 int isl_basic_map_compatible_domain(struct isl_basic_map *bmap,
221 struct isl_basic_set *bset)
223 return bmap->dim->n_in == bset->dim->n_out &&
224 bmap->dim->nparam == bset->dim->nparam;
227 int isl_basic_map_compatible_range(struct isl_basic_map *bmap,
228 struct isl_basic_set *bset)
230 return bmap->dim->n_out == bset->dim->n_out &&
231 bmap->dim->nparam == bset->dim->nparam;
234 struct isl_dim *isl_basic_map_get_dim(struct isl_basic_map *bmap)
238 return isl_dim_copy(bmap->dim);
241 struct isl_dim *isl_basic_set_get_dim(struct isl_basic_set *bset)
245 return isl_dim_copy(bset->dim);
248 struct isl_dim *isl_map_get_dim(struct isl_map *map)
252 return isl_dim_copy(map->dim);
255 struct isl_dim *isl_set_get_dim(struct isl_set *set)
259 return isl_dim_copy(set->dim);
262 static struct isl_basic_map *basic_map_init(struct isl_ctx *ctx,
263 struct isl_basic_map *bmap, unsigned extra,
264 unsigned n_eq, unsigned n_ineq)
267 size_t row_size = 1 + isl_dim_total(bmap->dim) + extra;
269 bmap->block = isl_blk_alloc(ctx, (n_ineq + n_eq) * row_size);
270 if (isl_blk_is_error(bmap->block)) {
275 bmap->ineq = isl_alloc_array(ctx, isl_int *, n_ineq + n_eq);
277 isl_blk_free(ctx, bmap->block);
283 bmap->block2 = isl_blk_empty();
286 bmap->block2 = isl_blk_alloc(ctx, extra * (1 + row_size));
287 if (isl_blk_is_error(bmap->block2)) {
289 isl_blk_free(ctx, bmap->block);
294 bmap->div = isl_alloc_array(ctx, isl_int *, extra);
296 isl_blk_free(ctx, bmap->block2);
298 isl_blk_free(ctx, bmap->block);
304 for (i = 0; i < n_ineq + n_eq; ++i)
305 bmap->ineq[i] = bmap->block.data + i * row_size;
307 for (i = 0; i < extra; ++i)
308 bmap->div[i] = bmap->block2.data + i * (1 + row_size);
314 bmap->c_size = n_eq + n_ineq;
315 bmap->eq = bmap->ineq + n_ineq;
324 isl_basic_map_free(bmap);
328 struct isl_basic_set *isl_basic_set_alloc(struct isl_ctx *ctx,
329 unsigned nparam, unsigned dim, unsigned extra,
330 unsigned n_eq, unsigned n_ineq)
332 struct isl_basic_map *bmap;
333 bmap = isl_basic_map_alloc(ctx, nparam, 0, dim, extra, n_eq, n_ineq);
334 return (struct isl_basic_set *)bmap;
337 struct isl_basic_set *isl_basic_set_alloc_dim(struct isl_dim *dim,
338 unsigned extra, unsigned n_eq, unsigned n_ineq)
340 struct isl_basic_map *bmap;
343 isl_assert(dim->ctx, dim->n_in == 0, return NULL);
344 bmap = isl_basic_map_alloc_dim(dim, extra, n_eq, n_ineq);
345 return (struct isl_basic_set *)bmap;
348 struct isl_basic_map *isl_basic_map_alloc_dim(struct isl_dim *dim,
349 unsigned extra, unsigned n_eq, unsigned n_ineq)
351 struct isl_basic_map *bmap;
355 bmap = isl_alloc_type(dim->ctx, struct isl_basic_map);
360 return basic_map_init(dim->ctx, bmap, extra, n_eq, n_ineq);
366 struct isl_basic_map *isl_basic_map_alloc(struct isl_ctx *ctx,
367 unsigned nparam, unsigned in, unsigned out, unsigned extra,
368 unsigned n_eq, unsigned n_ineq)
370 struct isl_basic_map *bmap;
373 dim = isl_dim_alloc(ctx, nparam, in, out);
377 bmap = isl_basic_map_alloc_dim(dim, extra, n_eq, n_ineq);
381 static void dup_constraints(
382 struct isl_basic_map *dst, struct isl_basic_map *src)
385 unsigned total = isl_basic_map_total_dim(src);
387 for (i = 0; i < src->n_eq; ++i) {
388 int j = isl_basic_map_alloc_equality(dst);
389 isl_seq_cpy(dst->eq[j], src->eq[i], 1+total);
392 for (i = 0; i < src->n_ineq; ++i) {
393 int j = isl_basic_map_alloc_inequality(dst);
394 isl_seq_cpy(dst->ineq[j], src->ineq[i], 1+total);
397 for (i = 0; i < src->n_div; ++i) {
398 int j = isl_basic_map_alloc_div(dst);
399 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total);
401 ISL_F_SET(dst, ISL_BASIC_SET_FINAL);
404 struct isl_basic_map *isl_basic_map_dup(struct isl_basic_map *bmap)
406 struct isl_basic_map *dup;
410 dup = isl_basic_map_alloc_dim(isl_dim_copy(bmap->dim),
411 bmap->n_div, bmap->n_eq, bmap->n_ineq);
414 dup_constraints(dup, bmap);
415 dup->flags = bmap->flags;
416 dup->sample = isl_vec_copy(bmap->sample);
420 struct isl_basic_set *isl_basic_set_dup(struct isl_basic_set *bset)
422 struct isl_basic_map *dup;
424 dup = isl_basic_map_dup((struct isl_basic_map *)bset);
425 return (struct isl_basic_set *)dup;
428 struct isl_basic_set *isl_basic_set_copy(struct isl_basic_set *bset)
433 if (ISL_F_ISSET(bset, ISL_BASIC_SET_FINAL)) {
437 return isl_basic_set_dup(bset);
440 struct isl_set *isl_set_copy(struct isl_set *set)
449 struct isl_basic_map *isl_basic_map_copy(struct isl_basic_map *bmap)
454 if (ISL_F_ISSET(bmap, ISL_BASIC_SET_FINAL)) {
458 return isl_basic_map_dup(bmap);
461 struct isl_map *isl_map_copy(struct isl_map *map)
470 void isl_basic_map_free(struct isl_basic_map *bmap)
478 isl_ctx_deref(bmap->ctx);
480 isl_blk_free(bmap->ctx, bmap->block2);
482 isl_blk_free(bmap->ctx, bmap->block);
483 isl_vec_free(bmap->sample);
484 isl_dim_free(bmap->dim);
488 void isl_basic_set_free(struct isl_basic_set *bset)
490 isl_basic_map_free((struct isl_basic_map *)bset);
493 static int room_for_con(struct isl_basic_map *bmap, unsigned n)
495 return bmap->n_eq + bmap->n_ineq + n <= bmap->c_size;
498 int isl_basic_map_alloc_equality(struct isl_basic_map *bmap)
504 isl_assert(ctx, room_for_con(bmap, 1), return -1);
505 isl_assert(ctx, (bmap->eq - bmap->ineq) + bmap->n_eq <= bmap->c_size,
507 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
508 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
509 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_IMPLICIT);
510 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
511 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
512 if ((bmap->eq - bmap->ineq) + bmap->n_eq == bmap->c_size) {
514 int j = isl_basic_map_alloc_inequality(bmap);
518 bmap->ineq[j] = bmap->ineq[bmap->n_ineq - 1];
519 bmap->ineq[bmap->n_ineq - 1] = bmap->eq[-1];
526 isl_seq_clr(bmap->eq[bmap->n_eq] + 1 + isl_basic_map_total_dim(bmap),
527 bmap->extra - bmap->n_div);
531 int isl_basic_set_alloc_equality(struct isl_basic_set *bset)
533 return isl_basic_map_alloc_equality((struct isl_basic_map *)bset);
536 int isl_basic_map_free_equality(struct isl_basic_map *bmap, unsigned n)
540 isl_assert(bmap->ctx, n <= bmap->n_eq, return -1);
545 int isl_basic_set_free_equality(struct isl_basic_set *bset, unsigned n)
547 return isl_basic_map_free_equality((struct isl_basic_map *)bset, n);
550 int isl_basic_map_drop_equality(struct isl_basic_map *bmap, unsigned pos)
555 isl_assert(bmap->ctx, pos < bmap->n_eq, return -1);
557 if (pos != bmap->n_eq - 1) {
559 bmap->eq[pos] = bmap->eq[bmap->n_eq - 1];
560 bmap->eq[bmap->n_eq - 1] = t;
566 int isl_basic_set_drop_equality(struct isl_basic_set *bset, unsigned pos)
568 return isl_basic_map_drop_equality((struct isl_basic_map *)bset, pos);
571 void isl_basic_map_inequality_to_equality(
572 struct isl_basic_map *bmap, unsigned pos)
577 bmap->ineq[pos] = bmap->ineq[bmap->n_ineq - 1];
578 bmap->ineq[bmap->n_ineq - 1] = bmap->eq[-1];
583 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
584 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
585 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
586 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
589 static int room_for_ineq(struct isl_basic_map *bmap, unsigned n)
591 return bmap->n_ineq + n <= bmap->eq - bmap->ineq;
594 int isl_basic_map_alloc_inequality(struct isl_basic_map *bmap)
600 isl_assert(ctx, room_for_ineq(bmap, 1), return -1);
601 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_IMPLICIT);
602 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
603 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
604 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
605 isl_seq_clr(bmap->ineq[bmap->n_ineq] +
606 1 + isl_basic_map_total_dim(bmap),
607 bmap->extra - bmap->n_div);
608 return bmap->n_ineq++;
611 int isl_basic_set_alloc_inequality(struct isl_basic_set *bset)
613 return isl_basic_map_alloc_inequality((struct isl_basic_map *)bset);
616 int isl_basic_map_free_inequality(struct isl_basic_map *bmap, unsigned n)
620 isl_assert(bmap->ctx, n <= bmap->n_ineq, return -1);
625 int isl_basic_set_free_inequality(struct isl_basic_set *bset, unsigned n)
627 return isl_basic_map_free_inequality((struct isl_basic_map *)bset, n);
630 int isl_basic_map_drop_inequality(struct isl_basic_map *bmap, unsigned pos)
635 isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
637 if (pos != bmap->n_ineq - 1) {
639 bmap->ineq[pos] = bmap->ineq[bmap->n_ineq - 1];
640 bmap->ineq[bmap->n_ineq - 1] = t;
641 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
647 int isl_basic_set_drop_inequality(struct isl_basic_set *bset, unsigned pos)
649 return isl_basic_map_drop_inequality((struct isl_basic_map *)bset, pos);
652 __isl_give isl_basic_map *isl_basic_map_add_eq(__isl_take isl_basic_map *bmap,
657 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
660 k = isl_basic_map_alloc_equality(bmap);
663 isl_seq_cpy(bmap->eq[k], eq, 1 + isl_basic_map_total_dim(bmap));
666 isl_basic_map_free(bmap);
670 __isl_give isl_basic_set *isl_basic_set_add_eq(__isl_take isl_basic_set *bset,
673 return (isl_basic_set *)
674 isl_basic_map_add_eq((isl_basic_map *)bset, eq);
677 __isl_give isl_basic_map *isl_basic_map_add_ineq(__isl_take isl_basic_map *bmap,
682 bmap = isl_basic_map_extend_constraints(bmap, 0, 1);
685 k = isl_basic_map_alloc_inequality(bmap);
688 isl_seq_cpy(bmap->ineq[k], ineq, 1 + isl_basic_map_total_dim(bmap));
691 isl_basic_map_free(bmap);
695 __isl_give isl_basic_set *isl_basic_set_add_ineq(__isl_take isl_basic_set *bset,
698 return (isl_basic_set *)
699 isl_basic_map_add_ineq((isl_basic_map *)bset, ineq);
702 int isl_basic_map_alloc_div(struct isl_basic_map *bmap)
706 isl_assert(bmap->ctx, bmap->n_div < bmap->extra, return -1);
707 isl_seq_clr(bmap->div[bmap->n_div] +
708 1 + 1 + isl_basic_map_total_dim(bmap),
709 bmap->extra - bmap->n_div);
710 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
711 return bmap->n_div++;
714 int isl_basic_set_alloc_div(struct isl_basic_set *bset)
716 return isl_basic_map_alloc_div((struct isl_basic_map *)bset);
719 int isl_basic_map_free_div(struct isl_basic_map *bmap, unsigned n)
723 isl_assert(bmap->ctx, n <= bmap->n_div, return -1);
728 int isl_basic_set_free_div(struct isl_basic_set *bset, unsigned n)
730 return isl_basic_map_free_div((struct isl_basic_map *)bset, n);
733 /* Copy constraint from src to dst, putting the vars of src at offset
734 * dim_off in dst and the divs of src at offset div_off in dst.
735 * If both sets are actually map, then dim_off applies to the input
738 static void copy_constraint(struct isl_basic_map *dst_map, isl_int *dst,
739 struct isl_basic_map *src_map, isl_int *src,
740 unsigned in_off, unsigned out_off, unsigned div_off)
742 unsigned src_nparam = isl_basic_map_n_param(src_map);
743 unsigned dst_nparam = isl_basic_map_n_param(dst_map);
744 unsigned src_in = isl_basic_map_n_in(src_map);
745 unsigned dst_in = isl_basic_map_n_in(dst_map);
746 unsigned src_out = isl_basic_map_n_out(src_map);
747 unsigned dst_out = isl_basic_map_n_out(dst_map);
748 isl_int_set(dst[0], src[0]);
749 isl_seq_cpy(dst+1, src+1, isl_min(dst_nparam, src_nparam));
750 if (dst_nparam > src_nparam)
751 isl_seq_clr(dst+1+src_nparam,
752 dst_nparam - src_nparam);
753 isl_seq_clr(dst+1+dst_nparam, in_off);
754 isl_seq_cpy(dst+1+dst_nparam+in_off,
756 isl_min(dst_in-in_off, src_in));
757 if (dst_in-in_off > src_in)
758 isl_seq_clr(dst+1+dst_nparam+in_off+src_in,
759 dst_in - in_off - src_in);
760 isl_seq_clr(dst+1+dst_nparam+dst_in, out_off);
761 isl_seq_cpy(dst+1+dst_nparam+dst_in+out_off,
762 src+1+src_nparam+src_in,
763 isl_min(dst_out-out_off, src_out));
764 if (dst_out-out_off > src_out)
765 isl_seq_clr(dst+1+dst_nparam+dst_in+out_off+src_out,
766 dst_out - out_off - src_out);
767 isl_seq_clr(dst+1+dst_nparam+dst_in+dst_out, div_off);
768 isl_seq_cpy(dst+1+dst_nparam+dst_in+dst_out+div_off,
769 src+1+src_nparam+src_in+src_out,
770 isl_min(dst_map->extra-div_off, src_map->n_div));
771 if (dst_map->n_div-div_off > src_map->n_div)
772 isl_seq_clr(dst+1+dst_nparam+dst_in+dst_out+
773 div_off+src_map->n_div,
774 dst_map->n_div - div_off - src_map->n_div);
777 static void copy_div(struct isl_basic_map *dst_map, isl_int *dst,
778 struct isl_basic_map *src_map, isl_int *src,
779 unsigned in_off, unsigned out_off, unsigned div_off)
781 isl_int_set(dst[0], src[0]);
782 copy_constraint(dst_map, dst+1, src_map, src+1, in_off, out_off, div_off);
785 static struct isl_basic_map *add_constraints(struct isl_basic_map *bmap1,
786 struct isl_basic_map *bmap2, unsigned i_pos, unsigned o_pos)
791 if (!bmap1 || !bmap2)
794 div_off = bmap1->n_div;
796 for (i = 0; i < bmap2->n_eq; ++i) {
797 int i1 = isl_basic_map_alloc_equality(bmap1);
800 copy_constraint(bmap1, bmap1->eq[i1], bmap2, bmap2->eq[i],
801 i_pos, o_pos, div_off);
804 for (i = 0; i < bmap2->n_ineq; ++i) {
805 int i1 = isl_basic_map_alloc_inequality(bmap1);
808 copy_constraint(bmap1, bmap1->ineq[i1], bmap2, bmap2->ineq[i],
809 i_pos, o_pos, div_off);
812 for (i = 0; i < bmap2->n_div; ++i) {
813 int i1 = isl_basic_map_alloc_div(bmap1);
816 copy_div(bmap1, bmap1->div[i1], bmap2, bmap2->div[i],
817 i_pos, o_pos, div_off);
820 isl_basic_map_free(bmap2);
825 isl_basic_map_free(bmap1);
826 isl_basic_map_free(bmap2);
830 static void copy_constraint_dim_map(isl_int *dst, isl_int *src,
831 struct isl_dim_map *dim_map)
835 for (i = 0; i < dim_map->len; ++i) {
836 if (dim_map->pos[i] < 0)
837 isl_int_set_si(dst[i], 0);
839 isl_int_set(dst[i], src[dim_map->pos[i]]);
843 static void copy_div_dim_map(isl_int *dst, isl_int *src,
844 struct isl_dim_map *dim_map)
846 isl_int_set(dst[0], src[0]);
847 copy_constraint_dim_map(dst+1, src+1, dim_map);
850 static struct isl_basic_map *add_constraints_dim_map(struct isl_basic_map *dst,
851 struct isl_basic_map *src, struct isl_dim_map *dim_map)
855 if (!src || !dst || !dim_map)
858 for (i = 0; i < src->n_eq; ++i) {
859 int i1 = isl_basic_map_alloc_equality(dst);
862 copy_constraint_dim_map(dst->eq[i1], src->eq[i], dim_map);
865 for (i = 0; i < src->n_ineq; ++i) {
866 int i1 = isl_basic_map_alloc_inequality(dst);
869 copy_constraint_dim_map(dst->ineq[i1], src->ineq[i], dim_map);
872 for (i = 0; i < src->n_div; ++i) {
873 int i1 = isl_basic_map_alloc_div(dst);
876 copy_div_dim_map(dst->div[i1], src->div[i], dim_map);
880 isl_basic_map_free(src);
885 isl_basic_map_free(src);
886 isl_basic_map_free(dst);
890 struct isl_basic_set *isl_basic_set_add_constraints(struct isl_basic_set *bset1,
891 struct isl_basic_set *bset2, unsigned pos)
893 return (struct isl_basic_set *)
894 add_constraints((struct isl_basic_map *)bset1,
895 (struct isl_basic_map *)bset2, 0, pos);
898 struct isl_basic_map *isl_basic_map_extend_dim(struct isl_basic_map *base,
899 struct isl_dim *dim, unsigned extra,
900 unsigned n_eq, unsigned n_ineq)
902 struct isl_basic_map *ext;
912 dims_ok = isl_dim_equal(base->dim, dim) &&
913 base->extra >= base->n_div + extra;
915 if (dims_ok && room_for_con(base, n_eq + n_ineq) &&
916 room_for_ineq(base, n_ineq)) {
921 isl_assert(base->ctx, base->dim->nparam <= dim->nparam, goto error);
922 isl_assert(base->ctx, base->dim->n_in <= dim->n_in, goto error);
923 isl_assert(base->ctx, base->dim->n_out <= dim->n_out, goto error);
924 extra += base->extra;
926 n_ineq += base->n_ineq;
928 ext = isl_basic_map_alloc_dim(dim, extra, n_eq, n_ineq);
934 ext->sample = isl_vec_copy(base->sample);
936 ext = add_constraints(ext, base, 0, 0);
939 ISL_F_CLR(ext, ISL_BASIC_SET_FINAL);
946 isl_basic_map_free(base);
950 struct isl_basic_set *isl_basic_set_extend_dim(struct isl_basic_set *base,
951 struct isl_dim *dim, unsigned extra,
952 unsigned n_eq, unsigned n_ineq)
954 return (struct isl_basic_set *)
955 isl_basic_map_extend_dim((struct isl_basic_map *)base, dim,
956 extra, n_eq, n_ineq);
959 struct isl_basic_map *isl_basic_map_extend_constraints(
960 struct isl_basic_map *base, unsigned n_eq, unsigned n_ineq)
964 return isl_basic_map_extend_dim(base, isl_dim_copy(base->dim),
968 struct isl_basic_map *isl_basic_map_extend(struct isl_basic_map *base,
969 unsigned nparam, unsigned n_in, unsigned n_out, unsigned extra,
970 unsigned n_eq, unsigned n_ineq)
972 struct isl_basic_map *bmap;
977 dim = isl_dim_alloc(base->ctx, nparam, n_in, n_out);
981 bmap = isl_basic_map_extend_dim(base, dim, extra, n_eq, n_ineq);
985 struct isl_basic_set *isl_basic_set_extend(struct isl_basic_set *base,
986 unsigned nparam, unsigned dim, unsigned extra,
987 unsigned n_eq, unsigned n_ineq)
989 return (struct isl_basic_set *)
990 isl_basic_map_extend((struct isl_basic_map *)base,
991 nparam, 0, dim, extra, n_eq, n_ineq);
994 struct isl_basic_set *isl_basic_set_extend_constraints(
995 struct isl_basic_set *base, unsigned n_eq, unsigned n_ineq)
997 return (struct isl_basic_set *)
998 isl_basic_map_extend_constraints((struct isl_basic_map *)base,
1002 struct isl_basic_set *isl_basic_set_cow(struct isl_basic_set *bset)
1004 return (struct isl_basic_set *)
1005 isl_basic_map_cow((struct isl_basic_map *)bset);
1008 struct isl_basic_map *isl_basic_map_cow(struct isl_basic_map *bmap)
1013 if (bmap->ref > 1) {
1015 bmap = isl_basic_map_dup(bmap);
1017 ISL_F_CLR(bmap, ISL_BASIC_SET_FINAL);
1021 struct isl_set *isl_set_cow(struct isl_set *set)
1029 return isl_set_dup(set);
1032 struct isl_map *isl_map_cow(struct isl_map *map)
1040 return isl_map_dup(map);
1043 static void swap_vars(struct isl_blk blk, isl_int *a,
1044 unsigned a_len, unsigned b_len)
1046 isl_seq_cpy(blk.data, a+a_len, b_len);
1047 isl_seq_cpy(blk.data+b_len, a, a_len);
1048 isl_seq_cpy(a, blk.data, b_len+a_len);
1051 struct isl_basic_set *isl_basic_set_swap_vars(
1052 struct isl_basic_set *bset, unsigned n)
1062 nparam = isl_basic_set_n_param(bset);
1063 dim = isl_basic_set_n_dim(bset);
1064 isl_assert(bset->ctx, n <= dim, goto error);
1069 bset = isl_basic_set_cow(bset);
1073 blk = isl_blk_alloc(bset->ctx, dim);
1074 if (isl_blk_is_error(blk))
1077 for (i = 0; i < bset->n_eq; ++i)
1079 bset->eq[i]+1+nparam, n, dim - n);
1081 for (i = 0; i < bset->n_ineq; ++i)
1083 bset->ineq[i]+1+nparam, n, dim - n);
1085 for (i = 0; i < bset->n_div; ++i)
1087 bset->div[i]+1+1+nparam, n, dim - n);
1089 isl_blk_free(bset->ctx, blk);
1091 ISL_F_CLR(bset, ISL_BASIC_SET_NORMALIZED);
1092 return isl_basic_set_gauss(bset, NULL);
1094 isl_basic_set_free(bset);
1098 struct isl_set *isl_set_swap_vars(struct isl_set *set, unsigned n)
1101 set = isl_set_cow(set);
1105 for (i = 0; i < set->n; ++i) {
1106 set->p[i] = isl_basic_set_swap_vars(set->p[i], n);
1112 ISL_F_CLR(set, ISL_SET_NORMALIZED);
1116 struct isl_basic_map *isl_basic_map_set_to_empty(struct isl_basic_map *bmap)
1122 total = isl_basic_map_total_dim(bmap);
1123 isl_basic_map_free_div(bmap, bmap->n_div);
1124 isl_basic_map_free_inequality(bmap, bmap->n_ineq);
1126 isl_basic_map_free_equality(bmap, bmap->n_eq-1);
1128 isl_basic_map_alloc_equality(bmap);
1132 isl_int_set_si(bmap->eq[i][0], 1);
1133 isl_seq_clr(bmap->eq[i]+1, total);
1134 ISL_F_SET(bmap, ISL_BASIC_MAP_EMPTY);
1135 isl_vec_free(bmap->sample);
1136 bmap->sample = NULL;
1137 return isl_basic_map_finalize(bmap);
1139 isl_basic_map_free(bmap);
1143 struct isl_basic_set *isl_basic_set_set_to_empty(struct isl_basic_set *bset)
1145 return (struct isl_basic_set *)
1146 isl_basic_map_set_to_empty((struct isl_basic_map *)bset);
1149 void isl_basic_map_swap_div(struct isl_basic_map *bmap, int a, int b)
1152 unsigned off = isl_dim_total(bmap->dim);
1153 isl_int *t = bmap->div[a];
1154 bmap->div[a] = bmap->div[b];
1157 for (i = 0; i < bmap->n_eq; ++i)
1158 isl_int_swap(bmap->eq[i][1+off+a], bmap->eq[i][1+off+b]);
1160 for (i = 0; i < bmap->n_ineq; ++i)
1161 isl_int_swap(bmap->ineq[i][1+off+a], bmap->ineq[i][1+off+b]);
1163 for (i = 0; i < bmap->n_div; ++i)
1164 isl_int_swap(bmap->div[i][1+1+off+a], bmap->div[i][1+1+off+b]);
1165 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1168 /* Eliminate the specified n dimensions starting at first from the
1169 * constraints using Fourier-Motzkin, The dimensions themselves
1172 struct isl_set *isl_set_eliminate_dims(struct isl_set *set,
1173 unsigned first, unsigned n)
1183 set = isl_set_cow(set);
1186 isl_assert(set->ctx, first+n <= isl_set_n_dim(set), goto error);
1187 nparam = isl_set_n_param(set);
1189 for (i = 0; i < set->n; ++i) {
1190 set->p[i] = isl_basic_set_eliminate_vars(set->p[i],
1201 /* Project out n dimensions starting at first using Fourier-Motzkin */
1202 struct isl_set *isl_set_remove_dims(struct isl_set *set,
1203 unsigned first, unsigned n)
1205 set = isl_set_eliminate_dims(set, first, n);
1206 set = isl_set_drop_dims(set, first, n);
1210 struct isl_basic_set *isl_basic_set_remove_divs(struct isl_basic_set *bset)
1212 bset = isl_basic_set_eliminate_vars(bset, isl_dim_total(bset->dim),
1220 struct isl_set *isl_set_remove_divs(struct isl_set *set)
1229 set = isl_set_cow(set);
1233 for (i = 0; i < set->n; ++i) {
1234 set->p[i] = isl_basic_set_remove_divs(set->p[i]);
1244 struct isl_basic_map *isl_basic_map_remove(struct isl_basic_map *bmap,
1245 enum isl_dim_type type, unsigned first, unsigned n)
1249 isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
1253 bmap = isl_basic_map_eliminate_vars(bmap,
1254 isl_basic_map_offset(bmap, type) - 1 + first, n);
1257 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY) && type == isl_dim_div)
1259 bmap = isl_basic_map_drop(bmap, type, first, n);
1262 isl_basic_map_free(bmap);
1266 __isl_give isl_basic_set *isl_basic_set_remove(__isl_take isl_basic_set *bset,
1267 enum isl_dim_type type, unsigned first, unsigned n)
1269 return (isl_basic_set *)
1270 isl_basic_map_remove((isl_basic_map *)bset, type, first, n);
1273 struct isl_map *isl_map_remove(struct isl_map *map,
1274 enum isl_dim_type type, unsigned first, unsigned n)
1281 map = isl_map_cow(map);
1284 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
1286 for (i = 0; i < map->n; ++i) {
1287 map->p[i] = isl_basic_map_eliminate_vars(map->p[i],
1288 isl_basic_map_offset(map->p[i], type) - 1 + first, n);
1292 map = isl_map_drop(map, type, first, n);
1299 __isl_give isl_set *isl_set_remove(__isl_take isl_set *bset,
1300 enum isl_dim_type type, unsigned first, unsigned n)
1302 return (isl_set *)isl_map_remove((isl_map *)bset, type, first, n);
1305 /* Project out n inputs starting at first using Fourier-Motzkin */
1306 struct isl_map *isl_map_remove_inputs(struct isl_map *map,
1307 unsigned first, unsigned n)
1309 return isl_map_remove(map, isl_dim_in, first, n);
1312 /* Project out n dimensions starting at first using Fourier-Motzkin */
1313 struct isl_basic_set *isl_basic_set_remove_dims(struct isl_basic_set *bset,
1314 unsigned first, unsigned n)
1316 unsigned nparam = isl_basic_set_n_param(bset);
1317 bset = isl_basic_set_eliminate_vars(bset, nparam + first, n);
1318 bset = isl_basic_set_drop_dims(bset, first, n);
1322 static void dump_term(struct isl_basic_map *bmap,
1323 isl_int c, int pos, FILE *out)
1326 unsigned in = isl_basic_map_n_in(bmap);
1327 unsigned dim = in + isl_basic_map_n_out(bmap);
1328 unsigned nparam = isl_basic_map_n_param(bmap);
1330 isl_int_print(out, c, 0);
1332 if (!isl_int_is_one(c))
1333 isl_int_print(out, c, 0);
1334 if (pos < 1 + nparam) {
1335 name = isl_dim_get_name(bmap->dim,
1336 isl_dim_param, pos - 1);
1338 fprintf(out, "%s", name);
1340 fprintf(out, "p%d", pos - 1);
1341 } else if (pos < 1 + nparam + in)
1342 fprintf(out, "i%d", pos - 1 - nparam);
1343 else if (pos < 1 + nparam + dim)
1344 fprintf(out, "o%d", pos - 1 - nparam - in);
1346 fprintf(out, "e%d", pos - 1 - nparam - dim);
1350 static void dump_constraint_sign(struct isl_basic_map *bmap, isl_int *c,
1351 int sign, FILE *out)
1355 unsigned len = 1 + isl_basic_map_total_dim(bmap);
1359 for (i = 0, first = 1; i < len; ++i) {
1360 if (isl_int_sgn(c[i]) * sign <= 0)
1363 fprintf(out, " + ");
1365 isl_int_abs(v, c[i]);
1366 dump_term(bmap, v, i, out);
1373 static void dump_constraint(struct isl_basic_map *bmap, isl_int *c,
1374 const char *op, FILE *out, int indent)
1378 fprintf(out, "%*s", indent, "");
1380 dump_constraint_sign(bmap, c, 1, out);
1381 fprintf(out, " %s ", op);
1382 dump_constraint_sign(bmap, c, -1, out);
1386 for (i = bmap->n_div; i < bmap->extra; ++i) {
1387 if (isl_int_is_zero(c[1+isl_dim_total(bmap->dim)+i]))
1389 fprintf(out, "%*s", indent, "");
1390 fprintf(out, "ERROR: unused div coefficient not zero\n");
1395 static void dump_constraints(struct isl_basic_map *bmap,
1396 isl_int **c, unsigned n,
1397 const char *op, FILE *out, int indent)
1401 for (i = 0; i < n; ++i)
1402 dump_constraint(bmap, c[i], op, out, indent);
1405 static void dump_affine(struct isl_basic_map *bmap, isl_int *exp, FILE *out)
1409 unsigned total = isl_basic_map_total_dim(bmap);
1411 for (j = 0; j < 1 + total; ++j) {
1412 if (isl_int_is_zero(exp[j]))
1414 if (!first && isl_int_is_pos(exp[j]))
1416 dump_term(bmap, exp[j], j, out);
1421 static void dump(struct isl_basic_map *bmap, FILE *out, int indent)
1425 dump_constraints(bmap, bmap->eq, bmap->n_eq, "=", out, indent);
1426 dump_constraints(bmap, bmap->ineq, bmap->n_ineq, ">=", out, indent);
1428 for (i = 0; i < bmap->n_div; ++i) {
1429 fprintf(out, "%*s", indent, "");
1430 fprintf(out, "e%d = [(", i);
1431 dump_affine(bmap, bmap->div[i]+1, out);
1433 isl_int_print(out, bmap->div[i][0], 0);
1434 fprintf(out, "]\n");
1438 void isl_basic_set_dump(struct isl_basic_set *bset, FILE *out, int indent)
1441 fprintf(out, "null basic set\n");
1445 fprintf(out, "%*s", indent, "");
1446 fprintf(out, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n",
1447 bset->ref, bset->dim->nparam, bset->dim->n_out,
1448 bset->extra, bset->flags);
1449 dump((struct isl_basic_map *)bset, out, indent);
1452 void isl_basic_map_dump(struct isl_basic_map *bmap, FILE *out, int indent)
1455 fprintf(out, "null basic map\n");
1459 fprintf(out, "%*s", indent, "");
1460 fprintf(out, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, "
1461 "flags: %x, n_name: %d\n",
1463 bmap->dim->nparam, bmap->dim->n_in, bmap->dim->n_out,
1464 bmap->extra, bmap->flags, bmap->dim->n_name);
1465 dump(bmap, out, indent);
1468 int isl_inequality_negate(struct isl_basic_map *bmap, unsigned pos)
1473 total = isl_basic_map_total_dim(bmap);
1474 isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
1475 isl_seq_neg(bmap->ineq[pos], bmap->ineq[pos], 1 + total);
1476 isl_int_sub_ui(bmap->ineq[pos][0], bmap->ineq[pos][0], 1);
1477 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1481 struct isl_set *isl_set_alloc_dim(struct isl_dim *dim, int n, unsigned flags)
1483 struct isl_set *set;
1487 isl_assert(dim->ctx, dim->n_in == 0, return NULL);
1488 isl_assert(dim->ctx, n >= 0, return NULL);
1489 set = isl_alloc(dim->ctx, struct isl_set,
1490 sizeof(struct isl_set) +
1491 (n - 1) * sizeof(struct isl_basic_set *));
1495 set->ctx = dim->ctx;
1496 isl_ctx_ref(set->ctx);
1508 struct isl_set *isl_set_alloc(struct isl_ctx *ctx,
1509 unsigned nparam, unsigned dim, int n, unsigned flags)
1511 struct isl_set *set;
1512 struct isl_dim *dims;
1514 dims = isl_dim_alloc(ctx, nparam, 0, dim);
1518 set = isl_set_alloc_dim(dims, n, flags);
1522 /* Make sure "map" has room for at least "n" more basic maps.
1524 struct isl_map *isl_map_grow(struct isl_map *map, int n)
1527 struct isl_map *grown = NULL;
1531 isl_assert(map->ctx, n >= 0, goto error);
1532 if (map->n + n <= map->size)
1534 grown = isl_map_alloc_dim(isl_map_get_dim(map), map->n + n, map->flags);
1537 for (i = 0; i < map->n; ++i) {
1538 grown->p[i] = isl_basic_map_copy(map->p[i]);
1546 isl_map_free(grown);
1551 /* Make sure "set" has room for at least "n" more basic sets.
1553 struct isl_set *isl_set_grow(struct isl_set *set, int n)
1555 return (struct isl_set *)isl_map_grow((struct isl_map *)set, n);
1558 struct isl_set *isl_set_dup(struct isl_set *set)
1561 struct isl_set *dup;
1566 dup = isl_set_alloc_dim(isl_dim_copy(set->dim), set->n, set->flags);
1569 for (i = 0; i < set->n; ++i)
1570 dup = isl_set_add_basic_set(dup, isl_basic_set_copy(set->p[i]));
1574 struct isl_set *isl_set_from_basic_set(struct isl_basic_set *bset)
1576 struct isl_set *set;
1581 set = isl_set_alloc_dim(isl_dim_copy(bset->dim), 1, ISL_MAP_DISJOINT);
1583 isl_basic_set_free(bset);
1586 return isl_set_add_basic_set(set, bset);
1589 struct isl_map *isl_map_from_basic_map(struct isl_basic_map *bmap)
1591 struct isl_map *map;
1596 map = isl_map_alloc_dim(isl_dim_copy(bmap->dim), 1, ISL_MAP_DISJOINT);
1598 isl_basic_map_free(bmap);
1601 return isl_map_add_basic_map(map, bmap);
1604 __isl_give isl_set *isl_set_add_basic_set(__isl_take isl_set *set,
1605 __isl_take isl_basic_set *bset)
1607 return (struct isl_set *)isl_map_add_basic_map((struct isl_map *)set,
1608 (struct isl_basic_map *)bset);
1611 void isl_set_free(struct isl_set *set)
1621 isl_ctx_deref(set->ctx);
1622 for (i = 0; i < set->n; ++i)
1623 isl_basic_set_free(set->p[i]);
1624 isl_dim_free(set->dim);
1628 void isl_set_dump(struct isl_set *set, FILE *out, int indent)
1633 fprintf(out, "null set\n");
1637 fprintf(out, "%*s", indent, "");
1638 fprintf(out, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
1639 set->ref, set->n, set->dim->nparam, set->dim->n_out,
1641 for (i = 0; i < set->n; ++i) {
1642 fprintf(out, "%*s", indent, "");
1643 fprintf(out, "basic set %d:\n", i);
1644 isl_basic_set_dump(set->p[i], out, indent+4);
1648 void isl_map_dump(struct isl_map *map, FILE *out, int indent)
1653 fprintf(out, "null map\n");
1657 fprintf(out, "%*s", indent, "");
1658 fprintf(out, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, "
1659 "flags: %x, n_name: %d\n",
1660 map->ref, map->n, map->dim->nparam, map->dim->n_in,
1661 map->dim->n_out, map->flags, map->dim->n_name);
1662 for (i = 0; i < map->n; ++i) {
1663 fprintf(out, "%*s", indent, "");
1664 fprintf(out, "basic map %d:\n", i);
1665 isl_basic_map_dump(map->p[i], out, indent+4);
1669 struct isl_basic_map *isl_basic_map_intersect_domain(
1670 struct isl_basic_map *bmap, struct isl_basic_set *bset)
1672 struct isl_basic_map *bmap_domain;
1673 struct isl_dim *dim;
1678 isl_assert(bset->ctx, isl_dim_match(bmap->dim, isl_dim_param,
1679 bset->dim, isl_dim_param), goto error);
1681 if (isl_dim_size(bset->dim, isl_dim_set) != 0)
1682 isl_assert(bset->ctx,
1683 isl_basic_map_compatible_domain(bmap, bset), goto error);
1685 bmap = isl_basic_map_cow(bmap);
1686 bmap = isl_basic_map_extend_dim(bmap, isl_dim_copy(bmap->dim),
1687 bset->n_div, bset->n_eq, bset->n_ineq);
1690 dim = isl_dim_reverse(isl_dim_copy(bset->dim));
1691 bmap_domain = isl_basic_map_from_basic_set(bset, dim);
1692 bmap = add_constraints(bmap, bmap_domain, 0, 0);
1694 bmap = isl_basic_map_simplify(bmap);
1695 return isl_basic_map_finalize(bmap);
1697 isl_basic_map_free(bmap);
1698 isl_basic_set_free(bset);
1702 struct isl_basic_map *isl_basic_map_intersect_range(
1703 struct isl_basic_map *bmap, struct isl_basic_set *bset)
1705 struct isl_basic_map *bmap_range;
1710 isl_assert(bset->ctx, isl_dim_match(bmap->dim, isl_dim_param,
1711 bset->dim, isl_dim_param), goto error);
1713 if (isl_dim_size(bset->dim, isl_dim_set) != 0)
1714 isl_assert(bset->ctx,
1715 isl_basic_map_compatible_range(bmap, bset), goto error);
1717 bmap = isl_basic_map_cow(bmap);
1718 bmap = isl_basic_map_extend_dim(bmap, isl_dim_copy(bmap->dim),
1719 bset->n_div, bset->n_eq, bset->n_ineq);
1722 bmap_range = isl_basic_map_from_basic_set(bset, isl_dim_copy(bset->dim));
1723 bmap = add_constraints(bmap, bmap_range, 0, 0);
1725 bmap = isl_basic_map_simplify(bmap);
1726 return isl_basic_map_finalize(bmap);
1728 isl_basic_map_free(bmap);
1729 isl_basic_set_free(bset);
1733 int isl_basic_map_contains(struct isl_basic_map *bmap, struct isl_vec *vec)
1739 total = 1 + isl_basic_map_total_dim(bmap);
1740 if (total != vec->size)
1745 for (i = 0; i < bmap->n_eq; ++i) {
1746 isl_seq_inner_product(vec->el, bmap->eq[i], total, &s);
1747 if (!isl_int_is_zero(s)) {
1753 for (i = 0; i < bmap->n_ineq; ++i) {
1754 isl_seq_inner_product(vec->el, bmap->ineq[i], total, &s);
1755 if (isl_int_is_neg(s)) {
1766 int isl_basic_set_contains(struct isl_basic_set *bset, struct isl_vec *vec)
1768 return isl_basic_map_contains((struct isl_basic_map *)bset, vec);
1771 struct isl_basic_map *isl_basic_map_intersect(
1772 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
1774 struct isl_vec *sample = NULL;
1776 if (!bmap1 || !bmap2)
1779 isl_assert(bmap1->ctx, isl_dim_match(bmap1->dim, isl_dim_param,
1780 bmap2->dim, isl_dim_param), goto error);
1781 if (isl_dim_total(bmap1->dim) ==
1782 isl_dim_size(bmap1->dim, isl_dim_param) &&
1783 isl_dim_total(bmap2->dim) !=
1784 isl_dim_size(bmap2->dim, isl_dim_param))
1785 return isl_basic_map_intersect(bmap2, bmap1);
1787 if (isl_dim_total(bmap2->dim) !=
1788 isl_dim_size(bmap2->dim, isl_dim_param))
1789 isl_assert(bmap1->ctx,
1790 isl_dim_equal(bmap1->dim, bmap2->dim), goto error);
1792 if (bmap1->sample &&
1793 isl_basic_map_contains(bmap1, bmap1->sample) > 0 &&
1794 isl_basic_map_contains(bmap2, bmap1->sample) > 0)
1795 sample = isl_vec_copy(bmap1->sample);
1796 else if (bmap2->sample &&
1797 isl_basic_map_contains(bmap1, bmap2->sample) > 0 &&
1798 isl_basic_map_contains(bmap2, bmap2->sample) > 0)
1799 sample = isl_vec_copy(bmap2->sample);
1801 bmap1 = isl_basic_map_cow(bmap1);
1802 bmap1 = isl_basic_map_extend_dim(bmap1, isl_dim_copy(bmap1->dim),
1803 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
1806 bmap1 = add_constraints(bmap1, bmap2, 0, 0);
1809 isl_vec_free(bmap1->sample);
1810 bmap1->sample = sample;
1813 bmap1 = isl_basic_map_simplify(bmap1);
1814 return isl_basic_map_finalize(bmap1);
1817 isl_vec_free(sample);
1818 isl_basic_map_free(bmap1);
1819 isl_basic_map_free(bmap2);
1823 struct isl_basic_set *isl_basic_set_intersect(
1824 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
1826 return (struct isl_basic_set *)
1827 isl_basic_map_intersect(
1828 (struct isl_basic_map *)bset1,
1829 (struct isl_basic_map *)bset2);
1832 /* Special case of isl_map_intersect, where both map1 and map2
1833 * are convex, without any divs and such that either map1 or map2
1834 * contains a single constraint. This constraint is then simply
1835 * added to the other map.
1837 static __isl_give isl_map *map_intersect_add_constraint(
1838 __isl_take isl_map *map1, __isl_take isl_map *map2)
1840 struct isl_basic_map *bmap1;
1841 struct isl_basic_map *bmap2;
1843 isl_assert(map1->ctx, map1->n == 1, goto error);
1844 isl_assert(map2->ctx, map1->n == 1, goto error);
1845 isl_assert(map1->ctx, map1->p[0]->n_div == 0, goto error);
1846 isl_assert(map2->ctx, map1->p[0]->n_div == 0, goto error);
1848 if (map2->p[0]->n_eq + map2->p[0]->n_ineq != 1)
1849 return isl_map_intersect(map2, map1);
1851 isl_assert(map2->ctx,
1852 map2->p[0]->n_eq + map2->p[0]->n_ineq == 1, goto error);
1854 map1 = isl_map_cow(map1);
1857 map1->p[0] = isl_basic_map_cow(map1->p[0]);
1858 if (map2->p[0]->n_eq == 1)
1859 map1->p[0] = isl_basic_map_add_eq(map1->p[0], map2->p[0]->eq[0]);
1861 map1->p[0] = isl_basic_map_add_ineq(map1->p[0],
1862 map2->p[0]->ineq[0]);
1864 map1->p[0] = isl_basic_map_simplify(map1->p[0]);
1865 map1->p[0] = isl_basic_map_finalize(map1->p[0]);
1878 struct isl_map *isl_map_intersect(struct isl_map *map1, struct isl_map *map2)
1881 struct isl_map *result;
1887 if (map1->n == 1 && map2->n == 1 &&
1888 map1->p[0]->n_div == 0 && map2->p[0]->n_div == 0 &&
1889 isl_dim_equal(map1->dim, map2->dim) &&
1890 (map1->p[0]->n_eq + map1->p[0]->n_ineq == 1 ||
1891 map2->p[0]->n_eq + map2->p[0]->n_ineq == 1))
1892 return map_intersect_add_constraint(map1, map2);
1893 isl_assert(map1->ctx, isl_dim_match(map1->dim, isl_dim_param,
1894 map2->dim, isl_dim_param), goto error);
1895 if (isl_dim_total(map1->dim) ==
1896 isl_dim_size(map1->dim, isl_dim_param) &&
1897 isl_dim_total(map2->dim) != isl_dim_size(map2->dim, isl_dim_param))
1898 return isl_map_intersect(map2, map1);
1900 if (isl_dim_total(map2->dim) != isl_dim_size(map2->dim, isl_dim_param))
1901 isl_assert(map1->ctx,
1902 isl_dim_equal(map1->dim, map2->dim), goto error);
1904 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
1905 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
1906 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
1908 result = isl_map_alloc_dim(isl_dim_copy(map1->dim),
1909 map1->n * map2->n, flags);
1912 for (i = 0; i < map1->n; ++i)
1913 for (j = 0; j < map2->n; ++j) {
1914 struct isl_basic_map *part;
1915 part = isl_basic_map_intersect(
1916 isl_basic_map_copy(map1->p[i]),
1917 isl_basic_map_copy(map2->p[j]));
1918 if (isl_basic_map_is_empty(part))
1919 isl_basic_map_free(part);
1921 result = isl_map_add_basic_map(result, part);
1934 struct isl_set *isl_set_intersect(struct isl_set *set1, struct isl_set *set2)
1936 return (struct isl_set *)
1937 isl_map_intersect((struct isl_map *)set1,
1938 (struct isl_map *)set2);
1941 struct isl_basic_map *isl_basic_map_reverse(struct isl_basic_map *bmap)
1943 struct isl_dim *dim;
1944 struct isl_basic_set *bset;
1949 bmap = isl_basic_map_cow(bmap);
1952 dim = isl_dim_reverse(isl_dim_copy(bmap->dim));
1953 in = isl_basic_map_n_in(bmap);
1954 bset = isl_basic_set_from_basic_map(bmap);
1955 bset = isl_basic_set_swap_vars(bset, in);
1956 return isl_basic_map_from_basic_set(bset, dim);
1959 /* Turn final n dimensions into existentially quantified variables.
1961 struct isl_basic_set *isl_basic_set_project_out(struct isl_basic_set *bset,
1962 enum isl_dim_type type, unsigned first, unsigned n)
1972 isl_assert(bset->ctx, type == isl_dim_set, goto error);
1973 isl_assert(bset->ctx, first + n == isl_basic_set_n_dim(bset), goto error);
1978 if (ISL_F_ISSET(bset, ISL_BASIC_SET_RATIONAL))
1979 return isl_basic_set_remove(bset, type, first, n);
1981 bset = isl_basic_set_cow(bset);
1983 row_size = 1 + isl_dim_total(bset->dim) + bset->extra;
1984 old = bset->block2.data;
1985 bset->block2 = isl_blk_extend(bset->ctx, bset->block2,
1986 (bset->extra + n) * (1 + row_size));
1987 if (!bset->block2.data)
1989 new_div = isl_alloc_array(ctx, isl_int *, bset->extra + n);
1992 for (i = 0; i < n; ++i) {
1993 new_div[i] = bset->block2.data +
1994 (bset->extra + i) * (1 + row_size);
1995 isl_seq_clr(new_div[i], 1 + row_size);
1997 for (i = 0; i < bset->extra; ++i)
1998 new_div[n + i] = bset->block2.data + (bset->div[i] - old);
2000 bset->div = new_div;
2003 bset->dim = isl_dim_drop_outputs(bset->dim,
2004 isl_basic_set_n_dim(bset) - n, n);
2007 bset = isl_basic_set_simplify(bset);
2008 bset = isl_basic_set_drop_redundant_divs(bset);
2009 return isl_basic_set_finalize(bset);
2011 isl_basic_set_free(bset);
2015 /* Turn final n dimensions into existentially quantified variables.
2017 __isl_give isl_set *isl_set_project_out(__isl_take isl_set *set,
2018 enum isl_dim_type type, unsigned first, unsigned n)
2025 isl_assert(set->ctx, type == isl_dim_set, goto error);
2026 isl_assert(set->ctx, first + n == isl_set_n_dim(set), goto error);
2028 set = isl_set_cow(set);
2031 set->dim = isl_dim_drop_outputs(set->dim, first, n);
2032 for (i = 0; i < set->n; ++i) {
2033 set->p[i] = isl_basic_set_project_out(set->p[i], type, first, n);
2038 ISL_F_CLR(set, ISL_SET_NORMALIZED);
2045 static struct isl_basic_map *add_divs(struct isl_basic_map *bmap, unsigned n)
2049 for (i = 0; i < n; ++i) {
2050 j = isl_basic_map_alloc_div(bmap);
2053 isl_seq_clr(bmap->div[j], 1+1+isl_basic_map_total_dim(bmap));
2057 isl_basic_map_free(bmap);
2061 struct isl_basic_map *isl_basic_map_apply_range(
2062 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2064 struct isl_dim *dim_result = NULL;
2065 struct isl_basic_map *bmap;
2066 unsigned n_in, n_out, n, nparam, total, pos;
2067 struct isl_dim_map *dim_map1, *dim_map2;
2069 if (!bmap1 || !bmap2)
2072 dim_result = isl_dim_join(isl_dim_copy(bmap1->dim),
2073 isl_dim_copy(bmap2->dim));
2075 n_in = isl_basic_map_n_in(bmap1);
2076 n_out = isl_basic_map_n_out(bmap2);
2077 n = isl_basic_map_n_out(bmap1);
2078 nparam = isl_basic_map_n_param(bmap1);
2080 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + n;
2081 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
2082 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
2083 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
2084 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
2085 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
2086 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_in);
2087 isl_dim_map_div(dim_map1, bmap1, pos += n_out);
2088 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
2089 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
2090 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
2092 bmap = isl_basic_map_alloc_dim(dim_result,
2093 bmap1->n_div + bmap2->n_div + n,
2094 bmap1->n_eq + bmap2->n_eq,
2095 bmap1->n_ineq + bmap2->n_ineq);
2096 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
2097 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
2098 bmap = add_divs(bmap, n);
2099 bmap = isl_basic_map_simplify(bmap);
2100 bmap = isl_basic_map_drop_redundant_divs(bmap);
2101 return isl_basic_map_finalize(bmap);
2103 isl_basic_map_free(bmap1);
2104 isl_basic_map_free(bmap2);
2108 struct isl_basic_set *isl_basic_set_apply(
2109 struct isl_basic_set *bset, struct isl_basic_map *bmap)
2114 isl_assert(bset->ctx, isl_basic_map_compatible_domain(bmap, bset),
2117 return (struct isl_basic_set *)
2118 isl_basic_map_apply_range((struct isl_basic_map *)bset, bmap);
2120 isl_basic_set_free(bset);
2121 isl_basic_map_free(bmap);
2125 struct isl_basic_map *isl_basic_map_apply_domain(
2126 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2128 if (!bmap1 || !bmap2)
2131 isl_assert(bmap1->ctx,
2132 isl_basic_map_n_in(bmap1) == isl_basic_map_n_in(bmap2), goto error);
2133 isl_assert(bmap1->ctx,
2134 isl_basic_map_n_param(bmap1) == isl_basic_map_n_param(bmap2),
2137 bmap1 = isl_basic_map_reverse(bmap1);
2138 bmap1 = isl_basic_map_apply_range(bmap1, bmap2);
2139 return isl_basic_map_reverse(bmap1);
2141 isl_basic_map_free(bmap1);
2142 isl_basic_map_free(bmap2);
2146 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
2147 * A \cap B -> f(A) + f(B)
2149 struct isl_basic_map *isl_basic_map_sum(
2150 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2152 unsigned n_in, n_out, nparam, total, pos;
2153 struct isl_basic_map *bmap = NULL;
2154 struct isl_dim_map *dim_map1, *dim_map2;
2157 if (!bmap1 || !bmap2)
2160 isl_assert(bmap1->ctx, isl_dim_equal(bmap1->dim, bmap2->dim),
2163 nparam = isl_basic_map_n_param(bmap1);
2164 n_in = isl_basic_map_n_in(bmap1);
2165 n_out = isl_basic_map_n_out(bmap1);
2167 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + 2 * n_out;
2168 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
2169 dim_map2 = isl_dim_map_alloc(bmap2->ctx, total);
2170 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
2171 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos);
2172 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
2173 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
2174 isl_dim_map_div(dim_map1, bmap1, pos += n_in + n_out);
2175 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
2176 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
2177 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_out);
2179 bmap = isl_basic_map_alloc_dim(isl_dim_copy(bmap1->dim),
2180 bmap1->n_div + bmap2->n_div + 2 * n_out,
2181 bmap1->n_eq + bmap2->n_eq + n_out,
2182 bmap1->n_ineq + bmap2->n_ineq);
2183 for (i = 0; i < n_out; ++i) {
2184 int j = isl_basic_map_alloc_equality(bmap);
2187 isl_seq_clr(bmap->eq[j], 1+total);
2188 isl_int_set_si(bmap->eq[j][1+nparam+n_in+i], -1);
2189 isl_int_set_si(bmap->eq[j][1+pos+i], 1);
2190 isl_int_set_si(bmap->eq[j][1+pos-n_out+i], 1);
2192 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
2193 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
2194 bmap = add_divs(bmap, 2 * n_out);
2196 bmap = isl_basic_map_simplify(bmap);
2197 return isl_basic_map_finalize(bmap);
2199 isl_basic_map_free(bmap);
2200 isl_basic_map_free(bmap1);
2201 isl_basic_map_free(bmap2);
2205 /* Given two maps A -> f(A) and B -> g(B), construct a map
2206 * A \cap B -> f(A) + f(B)
2208 struct isl_map *isl_map_sum(struct isl_map *map1, struct isl_map *map2)
2210 struct isl_map *result;
2216 isl_assert(map1->ctx, isl_dim_equal(map1->dim, map2->dim), goto error);
2218 result = isl_map_alloc_dim(isl_dim_copy(map1->dim),
2219 map1->n * map2->n, 0);
2222 for (i = 0; i < map1->n; ++i)
2223 for (j = 0; j < map2->n; ++j) {
2224 struct isl_basic_map *part;
2225 part = isl_basic_map_sum(
2226 isl_basic_map_copy(map1->p[i]),
2227 isl_basic_map_copy(map2->p[j]));
2228 if (isl_basic_map_is_empty(part))
2229 isl_basic_map_free(part);
2231 result = isl_map_add_basic_map(result, part);
2244 /* Given a basic map A -> f(A), construct A -> -f(A).
2246 struct isl_basic_map *isl_basic_map_neg(struct isl_basic_map *bmap)
2251 bmap = isl_basic_map_cow(bmap);
2255 n = isl_basic_map_dim(bmap, isl_dim_out);
2256 off = isl_basic_map_offset(bmap, isl_dim_out);
2257 for (i = 0; i < bmap->n_eq; ++i)
2258 for (j = 0; j < n; ++j)
2259 isl_int_neg(bmap->eq[i][off+j], bmap->eq[i][off+j]);
2260 for (i = 0; i < bmap->n_ineq; ++i)
2261 for (j = 0; j < n; ++j)
2262 isl_int_neg(bmap->ineq[i][off+j], bmap->ineq[i][off+j]);
2263 for (i = 0; i < bmap->n_div; ++i)
2264 for (j = 0; j < n; ++j)
2265 isl_int_neg(bmap->div[i][1+off+j], bmap->div[i][1+off+j]);
2266 return isl_basic_map_finalize(bmap);
2269 /* Given a map A -> f(A), construct A -> -f(A).
2271 struct isl_map *isl_map_neg(struct isl_map *map)
2275 map = isl_map_cow(map);
2279 for (i = 0; i < map->n; ++i) {
2280 map->p[i] = isl_basic_map_neg(map->p[i]);
2291 /* Given a basic map A -> f(A) and an integer d, construct a basic map
2292 * A -> floor(f(A)/d).
2294 struct isl_basic_map *isl_basic_map_floordiv(struct isl_basic_map *bmap,
2297 unsigned n_in, n_out, nparam, total, pos;
2298 struct isl_basic_map *result = NULL;
2299 struct isl_dim_map *dim_map;
2305 nparam = isl_basic_map_n_param(bmap);
2306 n_in = isl_basic_map_n_in(bmap);
2307 n_out = isl_basic_map_n_out(bmap);
2309 total = nparam + n_in + n_out + bmap->n_div + n_out;
2310 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2311 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_param, pos = 0);
2312 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_in, pos += nparam);
2313 isl_dim_map_div(dim_map, bmap, pos += n_in + n_out);
2314 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_out, pos += bmap->n_div);
2316 result = isl_basic_map_alloc_dim(isl_dim_copy(bmap->dim),
2317 bmap->n_div + n_out,
2318 bmap->n_eq, bmap->n_ineq + 2 * n_out);
2319 result = add_constraints_dim_map(result, bmap, dim_map);
2320 result = add_divs(result, n_out);
2321 for (i = 0; i < n_out; ++i) {
2323 j = isl_basic_map_alloc_inequality(result);
2326 isl_seq_clr(result->ineq[j], 1+total);
2327 isl_int_neg(result->ineq[j][1+nparam+n_in+i], d);
2328 isl_int_set_si(result->ineq[j][1+pos+i], 1);
2329 j = isl_basic_map_alloc_inequality(result);
2332 isl_seq_clr(result->ineq[j], 1+total);
2333 isl_int_set(result->ineq[j][1+nparam+n_in+i], d);
2334 isl_int_set_si(result->ineq[j][1+pos+i], -1);
2335 isl_int_sub_ui(result->ineq[j][0], d, 1);
2338 result = isl_basic_map_simplify(result);
2339 return isl_basic_map_finalize(result);
2341 isl_basic_map_free(result);
2345 /* Given a map A -> f(A) and an integer d, construct a map
2346 * A -> floor(f(A)/d).
2348 struct isl_map *isl_map_floordiv(struct isl_map *map, isl_int d)
2352 map = isl_map_cow(map);
2356 ISL_F_CLR(map, ISL_MAP_DISJOINT);
2357 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
2358 for (i = 0; i < map->n; ++i) {
2359 map->p[i] = isl_basic_map_floordiv(map->p[i], d);
2370 static struct isl_basic_map *var_equal(struct isl_basic_map *bmap, unsigned pos)
2376 i = isl_basic_map_alloc_equality(bmap);
2379 nparam = isl_basic_map_n_param(bmap);
2380 n_in = isl_basic_map_n_in(bmap);
2381 isl_seq_clr(bmap->eq[i], 1 + isl_basic_map_total_dim(bmap));
2382 isl_int_set_si(bmap->eq[i][1+nparam+pos], -1);
2383 isl_int_set_si(bmap->eq[i][1+nparam+n_in+pos], 1);
2384 return isl_basic_map_finalize(bmap);
2386 isl_basic_map_free(bmap);
2390 /* Add a constraints to "bmap" expressing i_pos < o_pos
2392 static struct isl_basic_map *var_less(struct isl_basic_map *bmap, unsigned pos)
2398 i = isl_basic_map_alloc_inequality(bmap);
2401 nparam = isl_basic_map_n_param(bmap);
2402 n_in = isl_basic_map_n_in(bmap);
2403 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
2404 isl_int_set_si(bmap->ineq[i][0], -1);
2405 isl_int_set_si(bmap->ineq[i][1+nparam+pos], -1);
2406 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], 1);
2407 return isl_basic_map_finalize(bmap);
2409 isl_basic_map_free(bmap);
2413 /* Add a constraints to "bmap" expressing i_pos > o_pos
2415 static struct isl_basic_map *var_more(struct isl_basic_map *bmap, unsigned pos)
2421 i = isl_basic_map_alloc_inequality(bmap);
2424 nparam = isl_basic_map_n_param(bmap);
2425 n_in = isl_basic_map_n_in(bmap);
2426 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
2427 isl_int_set_si(bmap->ineq[i][0], -1);
2428 isl_int_set_si(bmap->ineq[i][1+nparam+pos], 1);
2429 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], -1);
2430 return isl_basic_map_finalize(bmap);
2432 isl_basic_map_free(bmap);
2436 struct isl_basic_map *isl_basic_map_equal(struct isl_dim *dim, unsigned n_equal)
2439 struct isl_basic_map *bmap;
2440 bmap = isl_basic_map_alloc_dim(dim, 0, n_equal, 0);
2443 for (i = 0; i < n_equal && bmap; ++i)
2444 bmap = var_equal(bmap, i);
2445 return isl_basic_map_finalize(bmap);
2448 /* Return a relation on pairs of sets of dimension "dim" expressing i_pos < o_pos
2450 struct isl_basic_map *isl_basic_map_less_at(struct isl_dim *dim, unsigned pos)
2453 struct isl_basic_map *bmap;
2454 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
2457 for (i = 0; i < pos && bmap; ++i)
2458 bmap = var_equal(bmap, i);
2460 bmap = var_less(bmap, pos);
2461 return isl_basic_map_finalize(bmap);
2464 /* Return a relation on pairs of sets of dimension "dim" expressing i_pos > o_pos
2466 struct isl_basic_map *isl_basic_map_more_at(struct isl_dim *dim, unsigned pos)
2469 struct isl_basic_map *bmap;
2470 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
2473 for (i = 0; i < pos && bmap; ++i)
2474 bmap = var_equal(bmap, i);
2476 bmap = var_more(bmap, pos);
2477 return isl_basic_map_finalize(bmap);
2480 static __isl_give isl_map *map_lex_lte(__isl_take isl_dim *dims, int equal)
2482 struct isl_map *map;
2489 map = isl_map_alloc_dim(isl_dim_copy(dims), dim + equal, ISL_MAP_DISJOINT);
2491 for (i = 0; i < dim; ++i)
2492 map = isl_map_add_basic_map(map,
2493 isl_basic_map_less_at(isl_dim_copy(dims), i));
2495 map = isl_map_add_basic_map(map,
2496 isl_basic_map_equal(isl_dim_copy(dims), dim));
2502 __isl_give isl_map *isl_map_lex_lt(__isl_take isl_dim *set_dim)
2504 return map_lex_lte(isl_dim_map(set_dim), 0);
2507 __isl_give isl_map *isl_map_lex_le(__isl_take isl_dim *set_dim)
2509 return map_lex_lte(isl_dim_map(set_dim), 1);
2512 static __isl_give isl_map *map_lex_gte(__isl_take isl_dim *dims, int equal)
2514 struct isl_map *map;
2521 map = isl_map_alloc_dim(isl_dim_copy(dims), dim + equal, ISL_MAP_DISJOINT);
2523 for (i = 0; i < dim; ++i)
2524 map = isl_map_add_basic_map(map,
2525 isl_basic_map_more_at(isl_dim_copy(dims), i));
2527 map = isl_map_add_basic_map(map,
2528 isl_basic_map_equal(isl_dim_copy(dims), dim));
2534 __isl_give isl_map *isl_map_lex_gt(__isl_take isl_dim *set_dim)
2536 return map_lex_gte(isl_dim_map(set_dim), 0);
2539 __isl_give isl_map *isl_map_lex_ge(__isl_take isl_dim *set_dim)
2541 return map_lex_gte(isl_dim_map(set_dim), 1);
2544 struct isl_basic_map *isl_basic_map_from_basic_set(
2545 struct isl_basic_set *bset, struct isl_dim *dim)
2547 struct isl_basic_map *bmap;
2549 bset = isl_basic_set_cow(bset);
2553 isl_assert(bset->ctx, isl_dim_compatible(bset->dim, dim), goto error);
2554 isl_dim_free(bset->dim);
2555 bmap = (struct isl_basic_map *) bset;
2557 return isl_basic_map_finalize(bmap);
2559 isl_basic_set_free(bset);
2564 struct isl_basic_set *isl_basic_set_from_basic_map(struct isl_basic_map *bmap)
2568 if (bmap->dim->n_in == 0)
2569 return (struct isl_basic_set *)bmap;
2570 bmap = isl_basic_map_cow(bmap);
2573 bmap->dim = isl_dim_cow(bmap->dim);
2576 bmap->dim->n_out += bmap->dim->n_in;
2577 bmap->dim->n_in = 0;
2578 bmap = isl_basic_map_finalize(bmap);
2579 return (struct isl_basic_set *)bmap;
2581 isl_basic_map_free(bmap);
2585 /* For a div d = floor(f/m), add the constraints
2588 * -(f-(n-1)) + m d >= 0
2590 * Note that the second constraint is the negation of
2594 int isl_basic_map_add_div_constraints(struct isl_basic_map *bmap, unsigned div)
2597 unsigned total = isl_basic_map_total_dim(bmap);
2598 unsigned div_pos = 1 + total - bmap->n_div + div;
2600 i = isl_basic_map_alloc_inequality(bmap);
2603 isl_seq_cpy(bmap->ineq[i], bmap->div[div]+1, 1+total);
2604 isl_int_neg(bmap->ineq[i][div_pos], bmap->div[div][0]);
2606 j = isl_basic_map_alloc_inequality(bmap);
2609 isl_seq_neg(bmap->ineq[j], bmap->ineq[i], 1 + total);
2610 isl_int_add(bmap->ineq[j][0], bmap->ineq[j][0], bmap->ineq[j][div_pos]);
2611 isl_int_sub_ui(bmap->ineq[j][0], bmap->ineq[j][0], 1);
2615 struct isl_basic_set *isl_basic_map_underlying_set(
2616 struct isl_basic_map *bmap)
2620 if (bmap->dim->nparam == 0 && bmap->dim->n_in == 0 && bmap->n_div == 0)
2621 return (struct isl_basic_set *)bmap;
2622 bmap = isl_basic_map_cow(bmap);
2625 bmap->dim = isl_dim_underlying(bmap->dim, bmap->n_div);
2628 bmap->extra -= bmap->n_div;
2630 bmap = isl_basic_map_finalize(bmap);
2631 return (struct isl_basic_set *)bmap;
2636 __isl_give isl_basic_set *isl_basic_set_underlying_set(
2637 __isl_take isl_basic_set *bset)
2639 return isl_basic_map_underlying_set((isl_basic_map *)bset);
2642 struct isl_basic_map *isl_basic_map_overlying_set(
2643 struct isl_basic_set *bset, struct isl_basic_map *like)
2645 struct isl_basic_map *bmap;
2646 struct isl_ctx *ctx;
2653 isl_assert(ctx, bset->n_div == 0, goto error);
2654 isl_assert(ctx, isl_basic_set_n_param(bset) == 0, goto error);
2655 isl_assert(ctx, bset->dim->n_out == isl_basic_map_total_dim(like),
2657 if (isl_dim_equal(bset->dim, like->dim) && like->n_div == 0) {
2658 isl_basic_map_free(like);
2659 return (struct isl_basic_map *)bset;
2661 bset = isl_basic_set_cow(bset);
2664 total = bset->dim->n_out + bset->extra;
2665 bmap = (struct isl_basic_map *)bset;
2666 isl_dim_free(bmap->dim);
2667 bmap->dim = isl_dim_copy(like->dim);
2670 bmap->n_div = like->n_div;
2671 bmap->extra += like->n_div;
2674 ltotal = total - bmap->extra + like->extra;
2677 bmap->block2 = isl_blk_extend(ctx, bmap->block2,
2678 bmap->extra * (1 + 1 + total));
2679 if (isl_blk_is_error(bmap->block2))
2681 bmap->div = isl_realloc_array(ctx, bmap->div, isl_int *,
2685 for (i = 0; i < bmap->extra; ++i)
2686 bmap->div[i] = bmap->block2.data + i * (1 + 1 + total);
2687 for (i = 0; i < like->n_div; ++i) {
2688 isl_seq_cpy(bmap->div[i], like->div[i], 1 + 1 + ltotal);
2689 isl_seq_clr(bmap->div[i]+1+1+ltotal, total - ltotal);
2691 bmap = isl_basic_map_extend_constraints(bmap,
2692 0, 2 * like->n_div);
2693 for (i = 0; i < like->n_div; ++i) {
2694 if (isl_int_is_zero(bmap->div[i][0]))
2696 if (isl_basic_map_add_div_constraints(bmap, i) < 0)
2700 isl_basic_map_free(like);
2701 bmap = isl_basic_map_simplify(bmap);
2702 bmap = isl_basic_map_finalize(bmap);
2705 isl_basic_map_free(like);
2706 isl_basic_set_free(bset);
2710 struct isl_basic_set *isl_basic_set_from_underlying_set(
2711 struct isl_basic_set *bset, struct isl_basic_set *like)
2713 return (struct isl_basic_set *)
2714 isl_basic_map_overlying_set(bset, (struct isl_basic_map *)like);
2717 struct isl_set *isl_set_from_underlying_set(
2718 struct isl_set *set, struct isl_basic_set *like)
2724 isl_assert(set->ctx, set->dim->n_out == isl_basic_set_total_dim(like),
2726 if (isl_dim_equal(set->dim, like->dim) && like->n_div == 0) {
2727 isl_basic_set_free(like);
2730 set = isl_set_cow(set);
2733 for (i = 0; i < set->n; ++i) {
2734 set->p[i] = isl_basic_set_from_underlying_set(set->p[i],
2735 isl_basic_set_copy(like));
2739 isl_dim_free(set->dim);
2740 set->dim = isl_dim_copy(like->dim);
2743 isl_basic_set_free(like);
2746 isl_basic_set_free(like);
2751 struct isl_set *isl_map_underlying_set(struct isl_map *map)
2755 map = isl_map_cow(map);
2758 map->dim = isl_dim_cow(map->dim);
2762 for (i = 1; i < map->n; ++i)
2763 isl_assert(map->ctx, map->p[0]->n_div == map->p[i]->n_div,
2765 for (i = 0; i < map->n; ++i) {
2766 map->p[i] = (struct isl_basic_map *)
2767 isl_basic_map_underlying_set(map->p[i]);
2772 map->dim = isl_dim_underlying(map->dim, 0);
2774 isl_dim_free(map->dim);
2775 map->dim = isl_dim_copy(map->p[0]->dim);
2779 return (struct isl_set *)map;
2785 struct isl_set *isl_set_to_underlying_set(struct isl_set *set)
2787 return (struct isl_set *)isl_map_underlying_set((struct isl_map *)set);
2790 struct isl_basic_set *isl_basic_map_domain(struct isl_basic_map *bmap)
2792 struct isl_basic_set *domain;
2797 n_in = isl_basic_map_n_in(bmap);
2798 n_out = isl_basic_map_n_out(bmap);
2799 domain = isl_basic_set_from_basic_map(bmap);
2800 return isl_basic_set_project_out(domain, isl_dim_set, n_in, n_out);
2803 struct isl_basic_set *isl_basic_map_range(struct isl_basic_map *bmap)
2805 return isl_basic_map_domain(isl_basic_map_reverse(bmap));
2808 struct isl_set *isl_map_range(struct isl_map *map)
2811 struct isl_set *set;
2815 map = isl_map_cow(map);
2819 set = (struct isl_set *) map;
2820 if (set->dim->n_in != 0) {
2821 set->dim = isl_dim_drop_inputs(set->dim, 0, set->dim->n_in);
2825 for (i = 0; i < map->n; ++i) {
2826 set->p[i] = isl_basic_map_range(map->p[i]);
2830 ISL_F_CLR(set, ISL_MAP_DISJOINT);
2831 ISL_F_CLR(set, ISL_SET_NORMALIZED);
2838 struct isl_map *isl_map_from_set(struct isl_set *set, struct isl_dim *dim)
2841 struct isl_map *map = NULL;
2843 set = isl_set_cow(set);
2846 isl_assert(set->ctx, isl_dim_compatible(set->dim, dim), goto error);
2847 map = (struct isl_map *)set;
2848 for (i = 0; i < set->n; ++i) {
2849 map->p[i] = isl_basic_map_from_basic_set(
2850 set->p[i], isl_dim_copy(dim));
2854 isl_dim_free(map->dim);
2863 struct isl_map *isl_map_from_range(struct isl_set *set)
2865 return (struct isl_map *)set;
2868 __isl_give isl_map *isl_map_from_domain(__isl_take isl_set *set)
2870 return isl_map_reverse(isl_map_from_range(set));;
2873 __isl_give isl_map *isl_map_from_domain_and_range(__isl_take isl_set *domain,
2874 __isl_take isl_set *range)
2876 return isl_map_product(isl_map_from_domain(domain),
2877 isl_map_from_range(range));
2880 struct isl_set *isl_set_from_map(struct isl_map *map)
2883 struct isl_set *set = NULL;
2887 map = isl_map_cow(map);
2890 map->dim = isl_dim_cow(map->dim);
2893 map->dim->n_out += map->dim->n_in;
2895 set = (struct isl_set *)map;
2896 for (i = 0; i < map->n; ++i) {
2897 set->p[i] = isl_basic_set_from_basic_map(map->p[i]);
2907 struct isl_map *isl_map_alloc_dim(struct isl_dim *dim, int n, unsigned flags)
2909 struct isl_map *map;
2913 isl_assert(dim->ctx, n >= 0, return NULL);
2914 map = isl_alloc(dim->ctx, struct isl_map,
2915 sizeof(struct isl_map) +
2916 (n - 1) * sizeof(struct isl_basic_map *));
2920 map->ctx = dim->ctx;
2921 isl_ctx_ref(map->ctx);
2933 struct isl_map *isl_map_alloc(struct isl_ctx *ctx,
2934 unsigned nparam, unsigned in, unsigned out, int n,
2937 struct isl_map *map;
2938 struct isl_dim *dims;
2940 dims = isl_dim_alloc(ctx, nparam, in, out);
2944 map = isl_map_alloc_dim(dims, n, flags);
2948 struct isl_basic_map *isl_basic_map_empty(struct isl_dim *dim)
2950 struct isl_basic_map *bmap;
2951 bmap = isl_basic_map_alloc_dim(dim, 0, 1, 0);
2952 bmap = isl_basic_map_set_to_empty(bmap);
2956 struct isl_basic_set *isl_basic_set_empty(struct isl_dim *dim)
2958 struct isl_basic_set *bset;
2959 bset = isl_basic_set_alloc_dim(dim, 0, 1, 0);
2960 bset = isl_basic_set_set_to_empty(bset);
2964 struct isl_basic_map *isl_basic_map_empty_like(struct isl_basic_map *model)
2966 struct isl_basic_map *bmap;
2969 bmap = isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
2970 bmap = isl_basic_map_set_to_empty(bmap);
2974 struct isl_basic_map *isl_basic_map_empty_like_map(struct isl_map *model)
2976 struct isl_basic_map *bmap;
2979 bmap = isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
2980 bmap = isl_basic_map_set_to_empty(bmap);
2984 struct isl_basic_set *isl_basic_set_empty_like(struct isl_basic_set *model)
2986 struct isl_basic_set *bset;
2989 bset = isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
2990 bset = isl_basic_set_set_to_empty(bset);
2994 struct isl_basic_map *isl_basic_map_universe(struct isl_dim *dim)
2996 struct isl_basic_map *bmap;
2997 bmap = isl_basic_map_alloc_dim(dim, 0, 0, 0);
3001 struct isl_basic_set *isl_basic_set_universe(struct isl_dim *dim)
3003 struct isl_basic_set *bset;
3004 bset = isl_basic_set_alloc_dim(dim, 0, 0, 0);
3008 __isl_give isl_basic_map *isl_basic_map_universe_like(
3009 __isl_keep isl_basic_map *model)
3013 return isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
3016 struct isl_basic_set *isl_basic_set_universe_like(struct isl_basic_set *model)
3020 return isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
3023 __isl_give isl_basic_set *isl_basic_set_universe_like_set(
3024 __isl_keep isl_set *model)
3028 return isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
3031 struct isl_map *isl_map_empty(struct isl_dim *dim)
3033 return isl_map_alloc_dim(dim, 0, ISL_MAP_DISJOINT);
3036 struct isl_map *isl_map_empty_like(struct isl_map *model)
3040 return isl_map_alloc_dim(isl_dim_copy(model->dim), 0, ISL_MAP_DISJOINT);
3043 struct isl_map *isl_map_empty_like_basic_map(struct isl_basic_map *model)
3047 return isl_map_alloc_dim(isl_dim_copy(model->dim), 0, ISL_MAP_DISJOINT);
3050 struct isl_set *isl_set_empty(struct isl_dim *dim)
3052 return isl_set_alloc_dim(dim, 0, ISL_MAP_DISJOINT);
3055 struct isl_set *isl_set_empty_like(struct isl_set *model)
3059 return isl_set_empty(isl_dim_copy(model->dim));
3062 struct isl_map *isl_map_universe(struct isl_dim *dim)
3064 struct isl_map *map;
3067 map = isl_map_alloc_dim(isl_dim_copy(dim), 1, ISL_MAP_DISJOINT);
3068 map = isl_map_add_basic_map(map, isl_basic_map_universe(dim));
3072 struct isl_set *isl_set_universe(struct isl_dim *dim)
3074 struct isl_set *set;
3077 set = isl_set_alloc_dim(isl_dim_copy(dim), 1, ISL_MAP_DISJOINT);
3078 set = isl_set_add_basic_set(set, isl_basic_set_universe(dim));
3082 __isl_give isl_set *isl_set_universe_like(__isl_keep isl_set *model)
3086 return isl_set_universe(isl_dim_copy(model->dim));
3089 struct isl_map *isl_map_dup(struct isl_map *map)
3092 struct isl_map *dup;
3096 dup = isl_map_alloc_dim(isl_dim_copy(map->dim), map->n, map->flags);
3097 for (i = 0; i < map->n; ++i)
3098 dup = isl_map_add_basic_map(dup, isl_basic_map_copy(map->p[i]));
3102 __isl_give isl_map *isl_map_add_basic_map(__isl_take isl_map *map,
3103 __isl_take isl_basic_map *bmap)
3107 if (isl_basic_map_fast_is_empty(bmap)) {
3108 isl_basic_map_free(bmap);
3111 isl_assert(map->ctx, isl_dim_equal(map->dim, bmap->dim), goto error);
3112 isl_assert(map->ctx, map->n < map->size, goto error);
3113 map->p[map->n] = bmap;
3115 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3121 isl_basic_map_free(bmap);
3125 void isl_map_free(struct isl_map *map)
3135 isl_ctx_deref(map->ctx);
3136 for (i = 0; i < map->n; ++i)
3137 isl_basic_map_free(map->p[i]);
3138 isl_dim_free(map->dim);
3142 struct isl_map *isl_map_extend(struct isl_map *base,
3143 unsigned nparam, unsigned n_in, unsigned n_out)
3147 base = isl_map_cow(base);
3151 base->dim = isl_dim_extend(base->dim, nparam, n_in, n_out);
3154 for (i = 0; i < base->n; ++i) {
3155 base->p[i] = isl_basic_map_extend_dim(base->p[i],
3156 isl_dim_copy(base->dim), 0, 0, 0);
3166 struct isl_set *isl_set_extend(struct isl_set *base,
3167 unsigned nparam, unsigned dim)
3169 return (struct isl_set *)isl_map_extend((struct isl_map *)base,
3173 static struct isl_basic_map *isl_basic_map_fix_pos_si(
3174 struct isl_basic_map *bmap, unsigned pos, int value)
3178 bmap = isl_basic_map_cow(bmap);
3179 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
3180 j = isl_basic_map_alloc_equality(bmap);
3183 isl_seq_clr(bmap->eq[j] + 1, isl_basic_map_total_dim(bmap));
3184 isl_int_set_si(bmap->eq[j][pos], -1);
3185 isl_int_set_si(bmap->eq[j][0], value);
3186 bmap = isl_basic_map_simplify(bmap);
3187 return isl_basic_map_finalize(bmap);
3189 isl_basic_map_free(bmap);
3193 static __isl_give isl_basic_map *isl_basic_map_fix_pos(
3194 __isl_take isl_basic_map *bmap, unsigned pos, isl_int value)
3198 bmap = isl_basic_map_cow(bmap);
3199 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
3200 j = isl_basic_map_alloc_equality(bmap);
3203 isl_seq_clr(bmap->eq[j] + 1, isl_basic_map_total_dim(bmap));
3204 isl_int_set_si(bmap->eq[j][pos], -1);
3205 isl_int_set(bmap->eq[j][0], value);
3206 bmap = isl_basic_map_simplify(bmap);
3207 return isl_basic_map_finalize(bmap);
3209 isl_basic_map_free(bmap);
3213 struct isl_basic_map *isl_basic_map_fix_si(struct isl_basic_map *bmap,
3214 enum isl_dim_type type, unsigned pos, int value)
3218 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
3219 return isl_basic_map_fix_pos_si(bmap,
3220 isl_basic_map_offset(bmap, type) + pos, value);
3222 isl_basic_map_free(bmap);
3226 __isl_give isl_basic_map *isl_basic_map_fix(__isl_take isl_basic_map *bmap,
3227 enum isl_dim_type type, unsigned pos, isl_int value)
3231 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
3232 return isl_basic_map_fix_pos(bmap,
3233 isl_basic_map_offset(bmap, type) + pos, value);
3235 isl_basic_map_free(bmap);
3239 struct isl_basic_set *isl_basic_set_fix_si(struct isl_basic_set *bset,
3240 enum isl_dim_type type, unsigned pos, int value)
3242 return (struct isl_basic_set *)
3243 isl_basic_map_fix_si((struct isl_basic_map *)bset,
3247 __isl_give isl_basic_set *isl_basic_set_fix(__isl_take isl_basic_set *bset,
3248 enum isl_dim_type type, unsigned pos, isl_int value)
3250 return (struct isl_basic_set *)
3251 isl_basic_map_fix((struct isl_basic_map *)bset,
3255 struct isl_basic_map *isl_basic_map_fix_input_si(struct isl_basic_map *bmap,
3256 unsigned input, int value)
3258 return isl_basic_map_fix_si(bmap, isl_dim_in, input, value);
3261 struct isl_basic_set *isl_basic_set_fix_dim_si(struct isl_basic_set *bset,
3262 unsigned dim, int value)
3264 return (struct isl_basic_set *)
3265 isl_basic_map_fix_si((struct isl_basic_map *)bset,
3266 isl_dim_set, dim, value);
3269 struct isl_map *isl_map_fix_si(struct isl_map *map,
3270 enum isl_dim_type type, unsigned pos, int value)
3274 map = isl_map_cow(map);
3278 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
3279 for (i = 0; i < map->n; ++i) {
3280 map->p[i] = isl_basic_map_fix_si(map->p[i], type, pos, value);
3284 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3291 __isl_give isl_map *isl_map_fix(__isl_take isl_map *map,
3292 enum isl_dim_type type, unsigned pos, isl_int value)
3296 map = isl_map_cow(map);
3300 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
3301 for (i = 0; i < map->n; ++i) {
3302 map->p[i] = isl_basic_map_fix(map->p[i], type, pos, value);
3306 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3313 __isl_give isl_set *isl_set_fix(__isl_take isl_set *set,
3314 enum isl_dim_type type, unsigned pos, isl_int value)
3316 return (struct isl_set *)isl_map_fix((isl_map *)set, type, pos, value);
3319 struct isl_map *isl_map_fix_input_si(struct isl_map *map,
3320 unsigned input, int value)
3322 return isl_map_fix_si(map, isl_dim_in, input, value);
3325 struct isl_set *isl_set_fix_dim_si(struct isl_set *set, unsigned dim, int value)
3327 return (struct isl_set *)
3328 isl_map_fix_si((struct isl_map *)set, isl_dim_set, dim, value);
3331 struct isl_basic_set *isl_basic_set_lower_bound_dim(struct isl_basic_set *bset,
3332 unsigned dim, isl_int value)
3336 bset = isl_basic_set_cow(bset);
3337 bset = isl_basic_set_extend_constraints(bset, 0, 1);
3338 j = isl_basic_set_alloc_inequality(bset);
3341 isl_seq_clr(bset->ineq[j], 1 + isl_basic_set_total_dim(bset));
3342 isl_int_set_si(bset->ineq[j][1 + isl_basic_set_n_param(bset) + dim], 1);
3343 isl_int_neg(bset->ineq[j][0], value);
3344 bset = isl_basic_set_simplify(bset);
3345 return isl_basic_set_finalize(bset);
3347 isl_basic_set_free(bset);
3351 struct isl_set *isl_set_lower_bound_dim(struct isl_set *set, unsigned dim,
3356 set = isl_set_cow(set);
3360 isl_assert(set->ctx, dim < isl_set_n_dim(set), goto error);
3361 for (i = 0; i < set->n; ++i) {
3362 set->p[i] = isl_basic_set_lower_bound_dim(set->p[i], dim, value);
3372 struct isl_map *isl_map_reverse(struct isl_map *map)
3376 map = isl_map_cow(map);
3380 map->dim = isl_dim_reverse(map->dim);
3383 for (i = 0; i < map->n; ++i) {
3384 map->p[i] = isl_basic_map_reverse(map->p[i]);
3388 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3395 static struct isl_map *isl_basic_map_partial_lexopt(
3396 struct isl_basic_map *bmap, struct isl_basic_set *dom,
3397 struct isl_set **empty, int max)
3401 if (bmap->ctx->opt->pip == ISL_PIP_PIP)
3402 return isl_pip_basic_map_lexopt(bmap, dom, empty, max);
3404 return isl_tab_basic_map_partial_lexopt(bmap, dom, empty, max);
3406 isl_basic_map_free(bmap);
3407 isl_basic_set_free(dom);
3413 struct isl_map *isl_basic_map_partial_lexmax(
3414 struct isl_basic_map *bmap, struct isl_basic_set *dom,
3415 struct isl_set **empty)
3417 return isl_basic_map_partial_lexopt(bmap, dom, empty, 1);
3420 struct isl_map *isl_basic_map_partial_lexmin(
3421 struct isl_basic_map *bmap, struct isl_basic_set *dom,
3422 struct isl_set **empty)
3424 return isl_basic_map_partial_lexopt(bmap, dom, empty, 0);
3427 struct isl_set *isl_basic_set_partial_lexmin(
3428 struct isl_basic_set *bset, struct isl_basic_set *dom,
3429 struct isl_set **empty)
3431 return (struct isl_set *)
3432 isl_basic_map_partial_lexmin((struct isl_basic_map *)bset,
3436 struct isl_set *isl_basic_set_partial_lexmax(
3437 struct isl_basic_set *bset, struct isl_basic_set *dom,
3438 struct isl_set **empty)
3440 return (struct isl_set *)
3441 isl_basic_map_partial_lexmax((struct isl_basic_map *)bset,
3445 /* Given a basic map "bmap", compute the lexicograhically minimal
3446 * (or maximal) image element for each domain element in dom.
3447 * Set *empty to those elements in dom that do not have an image element.
3449 * We first make sure the basic sets in dom are disjoint and then
3450 * simply collect the results over each of the basic sets separately.
3451 * We could probably improve the efficiency a bit by moving the union
3452 * domain down into the parametric integer programming.
3454 static __isl_give isl_map *basic_map_partial_lexopt(
3455 __isl_take isl_basic_map *bmap, __isl_take isl_set *dom,
3456 __isl_give isl_set **empty, int max)
3459 struct isl_map *res;
3461 dom = isl_set_make_disjoint(dom);
3465 if (isl_set_fast_is_empty(dom)) {
3466 res = isl_map_empty_like_basic_map(bmap);
3467 *empty = isl_set_empty_like(dom);
3469 isl_basic_map_free(bmap);
3473 res = isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap),
3474 isl_basic_set_copy(dom->p[0]), empty, max);
3476 for (i = 1; i < dom->n; ++i) {
3477 struct isl_map *res_i;
3478 struct isl_set *empty_i;
3480 res_i = isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap),
3481 isl_basic_set_copy(dom->p[i]), &empty_i, max);
3483 res = isl_map_union_disjoint(res, res_i);
3484 *empty = isl_set_union_disjoint(*empty, empty_i);
3488 isl_basic_map_free(bmap);
3493 isl_basic_map_free(bmap);
3497 /* Given a map "map", compute the lexicograhically minimal
3498 * (or maximal) image element for each domain element in dom.
3499 * Set *empty to those elements in dom that do not have an image element.
3501 * We first compute the lexicographically minimal or maximal element
3502 * in the first basic map. This results in a partial solution "res"
3503 * and a subset "todo" of dom that still need to be handled.
3504 * We then consider each of the remaining maps in "map" and successively
3505 * improve both "res" and "todo".
3507 * Let res^k and todo^k be the results after k steps and let i = k + 1.
3508 * Assume we are computing the lexicographical maximum.
3509 * We first intersect basic map i with a relation that maps elements
3510 * to elements that are lexicographically larger than the image elements
3511 * in res^k and the compute the maximum image element of this intersection.
3512 * The result ("better") corresponds to those image elements in basic map i
3513 * that are better than what we had before. The remainder ("keep") are the
3514 * domain elements for which the image element in res_k was better.
3515 * We also compute the lexicographical maximum of basic map i in todo^k.
3516 * res^i is the result of the operation + better + those elements in
3517 * res^k that we should keep
3518 * todo^i is the remainder of the maximum operation on todo^k.
3520 static __isl_give isl_map *isl_map_partial_lexopt(
3521 __isl_take isl_map *map, __isl_take isl_set *dom,
3522 __isl_give isl_set **empty, int max)
3525 struct isl_map *res;
3526 struct isl_set *todo;
3531 if (isl_map_fast_is_empty(map)) {
3539 res = basic_map_partial_lexopt(isl_basic_map_copy(map->p[0]),
3540 isl_set_copy(dom), &todo, max);
3542 for (i = 1; i < map->n; ++i) {
3544 struct isl_map *better;
3545 struct isl_set *keep;
3546 struct isl_map *res_i;
3547 struct isl_set *todo_i;
3548 struct isl_dim *dim = isl_map_get_dim(res);
3550 dim = isl_dim_range(dim);
3552 lt = isl_map_lex_lt(dim);
3554 lt = isl_map_lex_gt(dim);
3555 lt = isl_map_apply_range(isl_map_copy(res), lt);
3556 lt = isl_map_intersect(lt,
3557 isl_map_from_basic_map(isl_basic_map_copy(map->p[i])));
3558 better = isl_map_partial_lexopt(lt,
3559 isl_map_domain(isl_map_copy(res)),
3562 res_i = basic_map_partial_lexopt(isl_basic_map_copy(map->p[i]),
3563 todo, &todo_i, max);
3565 res = isl_map_intersect_domain(res, keep);
3566 res = isl_map_union_disjoint(res, res_i);
3567 res = isl_map_union_disjoint(res, better);
3588 __isl_give isl_map *isl_map_partial_lexmax(
3589 __isl_take isl_map *map, __isl_take isl_set *dom,
3590 __isl_give isl_set **empty)
3592 return isl_map_partial_lexopt(map, dom, empty, 1);
3595 __isl_give isl_map *isl_map_partial_lexmin(
3596 __isl_take isl_map *map, __isl_take isl_set *dom,
3597 __isl_give isl_set **empty)
3599 return isl_map_partial_lexopt(map, dom, empty, 0);
3602 __isl_give isl_set *isl_set_partial_lexmin(
3603 __isl_take isl_set *set, __isl_take isl_set *dom,
3604 __isl_give isl_set **empty)
3606 return (struct isl_set *)
3607 isl_map_partial_lexmin((struct isl_map *)set,
3611 __isl_give isl_set *isl_set_partial_lexmax(
3612 __isl_take isl_set *set, __isl_take isl_set *dom,
3613 __isl_give isl_set **empty)
3615 return (struct isl_set *)
3616 isl_map_partial_lexmax((struct isl_map *)set,
3620 __isl_give isl_map *isl_basic_map_lexopt(__isl_take isl_basic_map *bmap, int max)
3622 struct isl_basic_set *dom = NULL;
3623 struct isl_dim *dom_dim;
3627 dom_dim = isl_dim_domain(isl_dim_copy(bmap->dim));
3628 dom = isl_basic_set_universe(dom_dim);
3629 return isl_basic_map_partial_lexopt(bmap, dom, NULL, max);
3631 isl_basic_map_free(bmap);
3635 __isl_give isl_map *isl_basic_map_lexmin(__isl_take isl_basic_map *bmap)
3637 return isl_basic_map_lexopt(bmap, 0);
3640 __isl_give isl_map *isl_basic_map_lexmax(__isl_take isl_basic_map *bmap)
3642 return isl_basic_map_lexopt(bmap, 1);
3645 __isl_give isl_set *isl_basic_set_lexmin(__isl_take isl_basic_set *bset)
3647 return (isl_set *)isl_basic_map_lexmin((isl_basic_map *)bset);
3650 __isl_give isl_set *isl_basic_set_lexmax(__isl_take isl_basic_set *bset)
3652 return (isl_set *)isl_basic_map_lexmax((isl_basic_map *)bset);
3655 __isl_give isl_map *isl_map_lexopt(__isl_take isl_map *map, int max)
3657 struct isl_set *dom = NULL;
3658 struct isl_dim *dom_dim;
3662 dom_dim = isl_dim_domain(isl_dim_copy(map->dim));
3663 dom = isl_set_universe(dom_dim);
3664 return isl_map_partial_lexopt(map, dom, NULL, max);
3670 __isl_give isl_map *isl_map_lexmin(__isl_take isl_map *map)
3672 return isl_map_lexopt(map, 0);
3675 __isl_give isl_map *isl_map_lexmax(__isl_take isl_map *map)
3677 return isl_map_lexopt(map, 1);
3680 __isl_give isl_set *isl_set_lexmin(__isl_take isl_set *set)
3682 return (isl_set *)isl_map_lexmin((isl_map *)set);
3685 __isl_give isl_set *isl_set_lexmax(__isl_take isl_set *set)
3687 return (isl_set *)isl_map_lexmax((isl_map *)set);
3690 static struct isl_map *isl_map_reset_dim(struct isl_map *map,
3691 struct isl_dim *dim)
3698 for (i = 0; i < map->n; ++i) {
3699 isl_dim_free(map->p[i]->dim);
3700 map->p[i]->dim = isl_dim_copy(dim);
3702 isl_dim_free(map->dim);
3712 static struct isl_set *isl_set_reset_dim(struct isl_set *set,
3713 struct isl_dim *dim)
3715 return (struct isl_set *) isl_map_reset_dim((struct isl_map *)set, dim);
3718 /* Apply a preimage specified by "mat" on the parameters of "bset".
3719 * bset is assumed to have only parameters and divs.
3721 static struct isl_basic_set *basic_set_parameter_preimage(
3722 struct isl_basic_set *bset, struct isl_mat *mat)
3729 bset->dim = isl_dim_cow(bset->dim);
3733 nparam = isl_basic_set_dim(bset, isl_dim_param);
3735 isl_assert(bset->ctx, mat->n_row == 1 + nparam, goto error);
3737 bset->dim->nparam = 0;
3738 bset->dim->n_out = nparam;
3739 bset = isl_basic_set_preimage(bset, mat);
3741 bset->dim->nparam = bset->dim->n_out;
3742 bset->dim->n_out = 0;
3747 isl_basic_set_free(bset);
3751 /* Apply a preimage specified by "mat" on the parameters of "set".
3752 * set is assumed to have only parameters and divs.
3754 static struct isl_set *set_parameter_preimage(
3755 struct isl_set *set, struct isl_mat *mat)
3757 struct isl_dim *dim = NULL;
3763 dim = isl_dim_copy(set->dim);
3764 dim = isl_dim_cow(dim);
3768 nparam = isl_set_dim(set, isl_dim_param);
3770 isl_assert(set->ctx, mat->n_row == 1 + nparam, goto error);
3773 dim->n_out = nparam;
3774 isl_set_reset_dim(set, dim);
3775 set = isl_set_preimage(set, mat);
3778 dim = isl_dim_copy(set->dim);
3779 dim = isl_dim_cow(dim);
3782 dim->nparam = dim->n_out;
3784 isl_set_reset_dim(set, dim);
3794 /* Intersect the basic set "bset" with the affine space specified by the
3795 * equalities in "eq".
3797 static struct isl_basic_set *basic_set_append_equalities(
3798 struct isl_basic_set *bset, struct isl_mat *eq)
3806 bset = isl_basic_set_extend_dim(bset, isl_dim_copy(bset->dim), 0,
3811 len = 1 + isl_dim_total(bset->dim) + bset->extra;
3812 for (i = 0; i < eq->n_row; ++i) {
3813 k = isl_basic_set_alloc_equality(bset);
3816 isl_seq_cpy(bset->eq[k], eq->row[i], eq->n_col);
3817 isl_seq_clr(bset->eq[k] + eq->n_col, len - eq->n_col);
3824 isl_basic_set_free(bset);
3828 /* Intersect the set "set" with the affine space specified by the
3829 * equalities in "eq".
3831 static struct isl_set *set_append_equalities(struct isl_set *set,
3839 for (i = 0; i < set->n; ++i) {
3840 set->p[i] = basic_set_append_equalities(set->p[i],
3853 /* Project the given basic set onto its parameter domain, possibly introducing
3854 * new, explicit, existential variables in the constraints.
3855 * The input has parameters and (possibly implicit) existential variables.
3856 * The output has the same parameters, but only
3857 * explicit existentially quantified variables.
3859 * The actual projection is performed by pip, but pip doesn't seem
3860 * to like equalities very much, so we first remove the equalities
3861 * among the parameters by performing a variable compression on
3862 * the parameters. Afterward, an inverse transformation is performed
3863 * and the equalities among the parameters are inserted back in.
3865 static struct isl_set *parameter_compute_divs(struct isl_basic_set *bset)
3869 struct isl_mat *T, *T2;
3870 struct isl_set *set;
3871 unsigned nparam, n_div;
3873 bset = isl_basic_set_cow(bset);
3877 if (bset->n_eq == 0)
3878 return isl_basic_set_lexmin(bset);
3880 isl_basic_set_gauss(bset, NULL);
3882 nparam = isl_basic_set_dim(bset, isl_dim_param);
3883 n_div = isl_basic_set_dim(bset, isl_dim_div);
3885 for (i = 0, j = n_div - 1; i < bset->n_eq && j >= 0; --j) {
3886 if (!isl_int_is_zero(bset->eq[i][1 + nparam + j]))
3889 if (i == bset->n_eq)
3890 return isl_basic_set_lexmin(bset);
3892 eq = isl_mat_sub_alloc(bset->ctx, bset->eq, i, bset->n_eq - i,
3894 eq = isl_mat_cow(eq);
3895 T = isl_mat_variable_compression(isl_mat_copy(eq), &T2);
3896 bset = basic_set_parameter_preimage(bset, T);
3898 set = isl_basic_set_lexmin(bset);
3899 set = set_parameter_preimage(set, T2);
3900 set = set_append_equalities(set, eq);
3904 /* Compute an explicit representation for all the existentially
3905 * quantified variables.
3906 * The input and output dimensions are first turned into parameters.
3907 * compute_divs then returns a map with the same parameters and
3908 * no input or output dimensions and the dimension specification
3909 * is reset to that of the input.
3911 static struct isl_map *compute_divs(struct isl_basic_map *bmap)
3913 struct isl_basic_set *bset;
3914 struct isl_set *set;
3915 struct isl_map *map;
3916 struct isl_dim *dim, *orig_dim = NULL;
3921 bmap = isl_basic_map_cow(bmap);
3925 nparam = isl_basic_map_dim(bmap, isl_dim_param);
3926 n_in = isl_basic_map_dim(bmap, isl_dim_in);
3927 n_out = isl_basic_map_dim(bmap, isl_dim_out);
3928 dim = isl_dim_set_alloc(bmap->ctx, nparam + n_in + n_out, 0);
3932 orig_dim = bmap->dim;
3934 bset = (struct isl_basic_set *)bmap;
3936 set = parameter_compute_divs(bset);
3937 map = (struct isl_map *)set;
3938 map = isl_map_reset_dim(map, orig_dim);
3942 isl_basic_map_free(bmap);
3946 static int basic_map_divs_known(__isl_keep isl_basic_map *bmap)
3954 off = isl_dim_total(bmap->dim);
3955 for (i = 0; i < bmap->n_div; ++i) {
3956 if (isl_int_is_zero(bmap->div[i][0]))
3958 isl_assert(bmap->ctx, isl_int_is_zero(bmap->div[i][1+1+off+i]),
3964 static int map_divs_known(__isl_keep isl_map *map)
3971 for (i = 0; i < map->n; ++i) {
3972 int known = basic_map_divs_known(map->p[i]);
3980 /* If bmap contains any unknown divs, then compute explicit
3981 * expressions for them. However, this computation may be
3982 * quite expensive, so first try to remove divs that aren't
3985 struct isl_map *isl_basic_map_compute_divs(struct isl_basic_map *bmap)
3989 struct isl_map *map;
3991 known = basic_map_divs_known(bmap);
3995 return isl_map_from_basic_map(bmap);
3997 bmap = isl_basic_map_drop_redundant_divs(bmap);
3999 known = basic_map_divs_known(bmap);
4003 return isl_map_from_basic_map(bmap);
4005 map = compute_divs(bmap);
4008 isl_basic_map_free(bmap);
4012 struct isl_map *isl_map_compute_divs(struct isl_map *map)
4016 struct isl_map *res;
4023 known = map_divs_known(map);
4031 res = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[0]));
4032 for (i = 1 ; i < map->n; ++i) {
4034 r2 = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[i]));
4035 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT))
4036 res = isl_map_union_disjoint(res, r2);
4038 res = isl_map_union(res, r2);
4045 struct isl_set *isl_basic_set_compute_divs(struct isl_basic_set *bset)
4047 return (struct isl_set *)
4048 isl_basic_map_compute_divs((struct isl_basic_map *)bset);
4051 struct isl_set *isl_set_compute_divs(struct isl_set *set)
4053 return (struct isl_set *)
4054 isl_map_compute_divs((struct isl_map *)set);
4057 struct isl_set *isl_map_domain(struct isl_map *map)
4060 struct isl_set *set;
4065 map = isl_map_cow(map);
4069 set = (struct isl_set *)map;
4070 set->dim = isl_dim_domain(set->dim);
4073 for (i = 0; i < map->n; ++i) {
4074 set->p[i] = isl_basic_map_domain(map->p[i]);
4078 ISL_F_CLR(set, ISL_MAP_DISJOINT);
4079 ISL_F_CLR(set, ISL_SET_NORMALIZED);
4086 struct isl_map *isl_map_union_disjoint(
4087 struct isl_map *map1, struct isl_map *map2)
4091 struct isl_map *map = NULL;
4105 isl_assert(map1->ctx, isl_dim_equal(map1->dim, map2->dim), goto error);
4107 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
4108 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
4109 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
4111 map = isl_map_alloc_dim(isl_dim_copy(map1->dim),
4112 map1->n + map2->n, flags);
4115 for (i = 0; i < map1->n; ++i) {
4116 map = isl_map_add_basic_map(map,
4117 isl_basic_map_copy(map1->p[i]));
4121 for (i = 0; i < map2->n; ++i) {
4122 map = isl_map_add_basic_map(map,
4123 isl_basic_map_copy(map2->p[i]));
4137 struct isl_map *isl_map_union(struct isl_map *map1, struct isl_map *map2)
4139 map1 = isl_map_union_disjoint(map1, map2);
4143 ISL_F_CLR(map1, ISL_MAP_DISJOINT);
4147 struct isl_set *isl_set_union_disjoint(
4148 struct isl_set *set1, struct isl_set *set2)
4150 return (struct isl_set *)
4151 isl_map_union_disjoint(
4152 (struct isl_map *)set1, (struct isl_map *)set2);
4155 struct isl_set *isl_set_union(struct isl_set *set1, struct isl_set *set2)
4157 return (struct isl_set *)
4158 isl_map_union((struct isl_map *)set1, (struct isl_map *)set2);
4161 struct isl_map *isl_map_intersect_range(
4162 struct isl_map *map, struct isl_set *set)
4165 struct isl_map *result;
4171 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT) &&
4172 ISL_F_ISSET(set, ISL_MAP_DISJOINT))
4173 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
4175 result = isl_map_alloc_dim(isl_dim_copy(map->dim),
4176 map->n * set->n, flags);
4179 for (i = 0; i < map->n; ++i)
4180 for (j = 0; j < set->n; ++j) {
4181 result = isl_map_add_basic_map(result,
4182 isl_basic_map_intersect_range(
4183 isl_basic_map_copy(map->p[i]),
4184 isl_basic_set_copy(set->p[j])));
4197 struct isl_map *isl_map_intersect_domain(
4198 struct isl_map *map, struct isl_set *set)
4200 return isl_map_reverse(
4201 isl_map_intersect_range(isl_map_reverse(map), set));
4204 struct isl_map *isl_map_apply_domain(
4205 struct isl_map *map1, struct isl_map *map2)
4209 map1 = isl_map_reverse(map1);
4210 map1 = isl_map_apply_range(map1, map2);
4211 return isl_map_reverse(map1);
4218 struct isl_map *isl_map_apply_range(
4219 struct isl_map *map1, struct isl_map *map2)
4221 struct isl_dim *dim_result;
4222 struct isl_map *result;
4228 dim_result = isl_dim_join(isl_dim_copy(map1->dim),
4229 isl_dim_copy(map2->dim));
4231 result = isl_map_alloc_dim(dim_result, map1->n * map2->n, 0);
4234 for (i = 0; i < map1->n; ++i)
4235 for (j = 0; j < map2->n; ++j) {
4236 result = isl_map_add_basic_map(result,
4237 isl_basic_map_apply_range(
4238 isl_basic_map_copy(map1->p[i]),
4239 isl_basic_map_copy(map2->p[j])));
4245 if (result && result->n <= 1)
4246 ISL_F_SET(result, ISL_MAP_DISJOINT);
4255 * returns range - domain
4257 struct isl_basic_set *isl_basic_map_deltas(struct isl_basic_map *bmap)
4259 struct isl_basic_set *bset;
4266 dim = isl_basic_map_n_in(bmap);
4267 nparam = isl_basic_map_n_param(bmap);
4268 isl_assert(bmap->ctx, dim == isl_basic_map_n_out(bmap), goto error);
4269 bset = isl_basic_set_from_basic_map(bmap);
4270 bset = isl_basic_set_cow(bset);
4271 bset = isl_basic_set_extend(bset, nparam, 3*dim, 0, dim, 0);
4272 bset = isl_basic_set_swap_vars(bset, 2*dim);
4273 for (i = 0; i < dim; ++i) {
4274 int j = isl_basic_map_alloc_equality(
4275 (struct isl_basic_map *)bset);
4278 isl_seq_clr(bset->eq[j], 1 + isl_basic_set_total_dim(bset));
4279 isl_int_set_si(bset->eq[j][1+nparam+i], 1);
4280 isl_int_set_si(bset->eq[j][1+nparam+dim+i], 1);
4281 isl_int_set_si(bset->eq[j][1+nparam+2*dim+i], -1);
4283 return isl_basic_set_project_out(bset, isl_dim_set, dim, 2*dim);
4285 isl_basic_map_free(bmap);
4290 * returns range - domain
4292 struct isl_set *isl_map_deltas(struct isl_map *map)
4295 struct isl_set *result;
4300 isl_assert(map->ctx, isl_map_n_in(map) == isl_map_n_out(map), goto error);
4301 result = isl_set_alloc(map->ctx, isl_map_n_param(map),
4302 isl_map_n_in(map), map->n, map->flags);
4305 for (i = 0; i < map->n; ++i)
4306 result = isl_set_add_basic_set(result,
4307 isl_basic_map_deltas(isl_basic_map_copy(map->p[i])));
4315 static struct isl_basic_map *basic_map_identity(struct isl_dim *dims)
4317 struct isl_basic_map *bmap;
4325 nparam = dims->nparam;
4327 bmap = isl_basic_map_alloc_dim(dims, 0, dim, 0);
4331 for (i = 0; i < dim; ++i) {
4332 int j = isl_basic_map_alloc_equality(bmap);
4335 isl_seq_clr(bmap->eq[j], 1 + isl_basic_map_total_dim(bmap));
4336 isl_int_set_si(bmap->eq[j][1+nparam+i], 1);
4337 isl_int_set_si(bmap->eq[j][1+nparam+dim+i], -1);
4339 return isl_basic_map_finalize(bmap);
4341 isl_basic_map_free(bmap);
4345 struct isl_basic_map *isl_basic_map_identity(struct isl_dim *set_dim)
4347 struct isl_dim *dim = isl_dim_map(set_dim);
4350 return basic_map_identity(dim);
4353 struct isl_basic_map *isl_basic_map_identity_like(struct isl_basic_map *model)
4355 if (!model || !model->dim)
4357 isl_assert(model->ctx,
4358 model->dim->n_in == model->dim->n_out, return NULL);
4359 return basic_map_identity(isl_dim_copy(model->dim));
4362 static struct isl_map *map_identity(struct isl_dim *dim)
4364 struct isl_map *map = isl_map_alloc_dim(dim, 1, ISL_MAP_DISJOINT);
4365 return isl_map_add_basic_map(map, basic_map_identity(isl_dim_copy(dim)));
4368 struct isl_map *isl_map_identity(struct isl_dim *set_dim)
4370 struct isl_dim *dim = isl_dim_map(set_dim);
4373 return map_identity(dim);
4376 struct isl_map *isl_map_identity_like(struct isl_map *model)
4378 if (!model || !model->dim)
4380 isl_assert(model->ctx,
4381 model->dim->n_in == model->dim->n_out, return NULL);
4382 return map_identity(isl_dim_copy(model->dim));
4385 struct isl_map *isl_map_identity_like_basic_map(struct isl_basic_map *model)
4387 if (!model || !model->dim)
4389 isl_assert(model->ctx,
4390 model->dim->n_in == model->dim->n_out, return NULL);
4391 return map_identity(isl_dim_copy(model->dim));
4394 /* Construct a basic set with all set dimensions having only non-negative
4397 struct isl_basic_set *isl_basic_set_positive_orthant(struct isl_dim *dims)
4402 struct isl_basic_set *bset;
4406 nparam = dims->nparam;
4408 bset = isl_basic_set_alloc_dim(dims, 0, 0, dim);
4411 for (i = 0; i < dim; ++i) {
4412 int k = isl_basic_set_alloc_inequality(bset);
4415 isl_seq_clr(bset->ineq[k], 1 + isl_basic_set_total_dim(bset));
4416 isl_int_set_si(bset->ineq[k][1 + nparam + i], 1);
4420 isl_basic_set_free(bset);
4424 int isl_set_is_equal(struct isl_set *set1, struct isl_set *set2)
4426 return isl_map_is_equal((struct isl_map *)set1, (struct isl_map *)set2);
4429 int isl_basic_map_is_subset(
4430 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
4433 struct isl_map *map1;
4434 struct isl_map *map2;
4436 if (!bmap1 || !bmap2)
4439 map1 = isl_map_from_basic_map(isl_basic_map_copy(bmap1));
4440 map2 = isl_map_from_basic_map(isl_basic_map_copy(bmap2));
4442 is_subset = isl_map_is_subset(map1, map2);
4450 int isl_basic_map_is_equal(
4451 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
4455 if (!bmap1 || !bmap2)
4457 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
4460 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
4464 int isl_basic_set_is_equal(
4465 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
4467 return isl_basic_map_is_equal(
4468 (struct isl_basic_map *)bset1, (struct isl_basic_map *)bset2);
4471 int isl_map_is_empty(struct isl_map *map)
4478 for (i = 0; i < map->n; ++i) {
4479 is_empty = isl_basic_map_is_empty(map->p[i]);
4488 int isl_map_fast_is_empty(struct isl_map *map)
4493 int isl_set_fast_is_empty(struct isl_set *set)
4498 int isl_set_is_empty(struct isl_set *set)
4500 return isl_map_is_empty((struct isl_map *)set);
4503 int isl_map_is_equal(struct isl_map *map1, struct isl_map *map2)
4509 is_subset = isl_map_is_subset(map1, map2);
4512 is_subset = isl_map_is_subset(map2, map1);
4516 int isl_basic_map_is_strict_subset(
4517 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
4521 if (!bmap1 || !bmap2)
4523 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
4526 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
4527 if (is_subset == -1)
4532 int isl_map_is_strict_subset(struct isl_map *map1, struct isl_map *map2)
4538 is_subset = isl_map_is_subset(map1, map2);
4541 is_subset = isl_map_is_subset(map2, map1);
4542 if (is_subset == -1)
4547 int isl_set_is_strict_subset(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
4549 return isl_map_is_strict_subset((isl_map *)set1, (isl_map *)set2);
4552 int isl_basic_map_is_universe(struct isl_basic_map *bmap)
4556 return bmap->n_eq == 0 && bmap->n_ineq == 0;
4559 int isl_basic_set_is_universe(struct isl_basic_set *bset)
4563 return bset->n_eq == 0 && bset->n_ineq == 0;
4566 int isl_map_fast_is_universe(__isl_keep isl_map *map)
4571 return map->n == 1 && isl_basic_map_is_universe(map->p[0]);
4574 int isl_basic_map_is_empty(struct isl_basic_map *bmap)
4576 struct isl_basic_set *bset = NULL;
4577 struct isl_vec *sample = NULL;
4584 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY))
4587 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL)) {
4588 struct isl_basic_map *copy = isl_basic_map_copy(bmap);
4589 copy = isl_basic_map_convex_hull(copy);
4590 empty = ISL_F_ISSET(copy, ISL_BASIC_MAP_EMPTY);
4591 isl_basic_map_free(copy);
4595 total = 1 + isl_basic_map_total_dim(bmap);
4596 if (bmap->sample && bmap->sample->size == total) {
4597 int contains = isl_basic_map_contains(bmap, bmap->sample);
4603 isl_vec_free(bmap->sample);
4604 bmap->sample = NULL;
4605 bset = isl_basic_map_underlying_set(isl_basic_map_copy(bmap));
4608 sample = isl_basic_set_sample_vec(bset);
4611 empty = sample->size == 0;
4612 isl_vec_free(bmap->sample);
4613 bmap->sample = sample;
4615 ISL_F_SET(bmap, ISL_BASIC_MAP_EMPTY);
4620 int isl_basic_map_fast_is_empty(struct isl_basic_map *bmap)
4624 return ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY);
4627 int isl_basic_set_fast_is_empty(struct isl_basic_set *bset)
4631 return ISL_F_ISSET(bset, ISL_BASIC_SET_EMPTY);
4634 int isl_basic_set_is_empty(struct isl_basic_set *bset)
4636 return isl_basic_map_is_empty((struct isl_basic_map *)bset);
4639 struct isl_map *isl_basic_map_union(
4640 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
4642 struct isl_map *map;
4643 if (!bmap1 || !bmap2)
4646 isl_assert(bmap1->ctx, isl_dim_equal(bmap1->dim, bmap2->dim), goto error);
4648 map = isl_map_alloc_dim(isl_dim_copy(bmap1->dim), 2, 0);
4651 map = isl_map_add_basic_map(map, bmap1);
4652 map = isl_map_add_basic_map(map, bmap2);
4655 isl_basic_map_free(bmap1);
4656 isl_basic_map_free(bmap2);
4660 struct isl_set *isl_basic_set_union(
4661 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
4663 return (struct isl_set *)isl_basic_map_union(
4664 (struct isl_basic_map *)bset1,
4665 (struct isl_basic_map *)bset2);
4668 /* Order divs such that any div only depends on previous divs */
4669 struct isl_basic_map *isl_basic_map_order_divs(struct isl_basic_map *bmap)
4672 unsigned off = isl_dim_total(bmap->dim);
4674 for (i = 0; i < bmap->n_div; ++i) {
4676 if (isl_int_is_zero(bmap->div[i][0]))
4678 pos = isl_seq_first_non_zero(bmap->div[i]+1+1+off+i,
4682 isl_basic_map_swap_div(bmap, i, i + pos);
4688 struct isl_basic_set *isl_basic_set_order_divs(struct isl_basic_set *bset)
4690 return (struct isl_basic_set *)
4691 isl_basic_map_order_divs((struct isl_basic_map *)bset);
4694 /* Look for a div in dst that corresponds to the div "div" in src.
4695 * The divs before "div" in src and dst are assumed to be the same.
4697 * Returns -1 if no corresponding div was found and the position
4698 * of the corresponding div in dst otherwise.
4700 static int find_div(struct isl_basic_map *dst,
4701 struct isl_basic_map *src, unsigned div)
4705 unsigned total = isl_dim_total(src->dim);
4707 isl_assert(dst->ctx, div <= dst->n_div, return -1);
4708 for (i = div; i < dst->n_div; ++i)
4709 if (isl_seq_eq(dst->div[i], src->div[div], 1+1+total+div) &&
4710 isl_seq_first_non_zero(dst->div[i]+1+1+total+div,
4711 dst->n_div - div) == -1)
4716 struct isl_basic_map *isl_basic_map_align_divs(
4717 struct isl_basic_map *dst, struct isl_basic_map *src)
4720 unsigned total = isl_dim_total(src->dim);
4725 if (src->n_div == 0)
4728 for (i = 0; i < src->n_div; ++i)
4729 isl_assert(src->ctx, !isl_int_is_zero(src->div[i][0]), goto error);
4731 src = isl_basic_map_order_divs(src);
4732 dst = isl_basic_map_cow(dst);
4733 dst = isl_basic_map_extend_dim(dst, isl_dim_copy(dst->dim),
4734 src->n_div, 0, 2 * src->n_div);
4737 for (i = 0; i < src->n_div; ++i) {
4738 int j = find_div(dst, src, i);
4740 j = isl_basic_map_alloc_div(dst);
4743 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total+i);
4744 isl_seq_clr(dst->div[j]+1+1+total+i, dst->n_div - i);
4745 if (isl_basic_map_add_div_constraints(dst, j) < 0)
4749 isl_basic_map_swap_div(dst, i, j);
4753 isl_basic_map_free(dst);
4757 struct isl_basic_set *isl_basic_set_align_divs(
4758 struct isl_basic_set *dst, struct isl_basic_set *src)
4760 return (struct isl_basic_set *)isl_basic_map_align_divs(
4761 (struct isl_basic_map *)dst, (struct isl_basic_map *)src);
4764 struct isl_map *isl_map_align_divs(struct isl_map *map)
4772 map = isl_map_compute_divs(map);
4773 map = isl_map_cow(map);
4777 for (i = 1; i < map->n; ++i)
4778 map->p[0] = isl_basic_map_align_divs(map->p[0], map->p[i]);
4779 for (i = 1; i < map->n; ++i)
4780 map->p[i] = isl_basic_map_align_divs(map->p[i], map->p[0]);
4782 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4786 struct isl_set *isl_set_align_divs(struct isl_set *set)
4788 return (struct isl_set *)isl_map_align_divs((struct isl_map *)set);
4791 struct isl_set *isl_set_apply(struct isl_set *set, struct isl_map *map)
4795 isl_assert(set->ctx, isl_map_compatible_domain(map, set), goto error);
4796 map = isl_map_intersect_domain(map, set);
4797 set = isl_map_range(map);
4805 /* There is no need to cow as removing empty parts doesn't change
4806 * the meaning of the set.
4808 struct isl_map *isl_map_remove_empty_parts(struct isl_map *map)
4815 for (i = map->n-1; i >= 0; --i) {
4816 if (!ISL_F_ISSET(map->p[i], ISL_BASIC_MAP_EMPTY))
4818 isl_basic_map_free(map->p[i]);
4819 if (i != map->n-1) {
4820 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4821 map->p[i] = map->p[map->n-1];
4829 struct isl_set *isl_set_remove_empty_parts(struct isl_set *set)
4831 return (struct isl_set *)
4832 isl_map_remove_empty_parts((struct isl_map *)set);
4835 struct isl_basic_map *isl_map_copy_basic_map(struct isl_map *map)
4837 struct isl_basic_map *bmap;
4838 if (!map || map->n == 0)
4840 bmap = map->p[map->n-1];
4841 isl_assert(map->ctx, ISL_F_ISSET(bmap, ISL_BASIC_SET_FINAL), return NULL);
4842 return isl_basic_map_copy(bmap);
4845 struct isl_basic_set *isl_set_copy_basic_set(struct isl_set *set)
4847 return (struct isl_basic_set *)
4848 isl_map_copy_basic_map((struct isl_map *)set);
4851 __isl_give isl_map *isl_map_drop_basic_map(__isl_take isl_map *map,
4852 __isl_keep isl_basic_map *bmap)
4858 for (i = map->n-1; i >= 0; --i) {
4859 if (map->p[i] != bmap)
4861 map = isl_map_cow(map);
4864 isl_basic_map_free(map->p[i]);
4865 if (i != map->n-1) {
4866 ISL_F_CLR(map, ISL_SET_NORMALIZED);
4867 map->p[i] = map->p[map->n-1];
4878 struct isl_set *isl_set_drop_basic_set(struct isl_set *set,
4879 struct isl_basic_set *bset)
4881 return (struct isl_set *)isl_map_drop_basic_map((struct isl_map *)set,
4882 (struct isl_basic_map *)bset);
4885 /* Given two basic sets bset1 and bset2, compute the maximal difference
4886 * between the values of dimension pos in bset1 and those in bset2
4887 * for any common value of the parameters and dimensions preceding pos.
4889 static enum isl_lp_result basic_set_maximal_difference_at(
4890 __isl_keep isl_basic_set *bset1, __isl_keep isl_basic_set *bset2,
4891 int pos, isl_int *opt)
4893 struct isl_dim *dims;
4894 struct isl_basic_map *bmap1 = NULL;
4895 struct isl_basic_map *bmap2 = NULL;
4896 struct isl_ctx *ctx;
4897 struct isl_vec *obj;
4900 unsigned dim1, dim2;
4901 enum isl_lp_result res;
4903 if (!bset1 || !bset2)
4904 return isl_lp_error;
4906 nparam = isl_basic_set_n_param(bset1);
4907 dim1 = isl_basic_set_n_dim(bset1);
4908 dim2 = isl_basic_set_n_dim(bset2);
4909 dims = isl_dim_alloc(bset1->ctx, nparam, pos, dim1 - pos);
4910 bmap1 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset1), dims);
4911 dims = isl_dim_alloc(bset2->ctx, nparam, pos, dim2 - pos);
4912 bmap2 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset2), dims);
4913 if (!bmap1 || !bmap2)
4915 bmap1 = isl_basic_map_cow(bmap1);
4916 bmap1 = isl_basic_map_extend(bmap1, nparam,
4917 pos, (dim1 - pos) + (dim2 - pos),
4918 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
4919 bmap1 = add_constraints(bmap1, bmap2, 0, dim1 - pos);
4922 total = isl_basic_map_total_dim(bmap1);
4924 obj = isl_vec_alloc(ctx, 1 + total);
4925 isl_seq_clr(obj->block.data, 1 + total);
4926 isl_int_set_si(obj->block.data[1+nparam+pos], 1);
4927 isl_int_set_si(obj->block.data[1+nparam+pos+(dim1-pos)], -1);
4930 res = isl_basic_map_solve_lp(bmap1, 1, obj->block.data, ctx->one,
4932 isl_basic_map_free(bmap1);
4936 isl_basic_map_free(bmap1);
4937 isl_basic_map_free(bmap2);
4938 return isl_lp_error;
4941 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
4942 * for any common value of the parameters and dimensions preceding pos
4943 * in both basic sets, the values of dimension pos in bset1 are
4944 * smaller or larger than those in bset2.
4947 * 1 if bset1 follows bset2
4948 * -1 if bset1 precedes bset2
4949 * 0 if bset1 and bset2 are incomparable
4950 * -2 if some error occurred.
4952 int isl_basic_set_compare_at(struct isl_basic_set *bset1,
4953 struct isl_basic_set *bset2, int pos)
4956 enum isl_lp_result res;
4961 res = basic_set_maximal_difference_at(bset1, bset2, pos, &opt);
4963 if (res == isl_lp_empty)
4965 else if ((res == isl_lp_ok && isl_int_is_pos(opt)) ||
4966 res == isl_lp_unbounded)
4968 else if (res == isl_lp_ok && isl_int_is_neg(opt))
4977 /* Given two basic sets bset1 and bset2, check whether
4978 * for any common value of the parameters and dimensions preceding pos
4979 * there is a value of dimension pos in bset1 that is larger
4980 * than a value of the same dimension in bset2.
4983 * 1 if there exists such a pair
4984 * 0 if there is no such pair, but there is a pair of equal values
4986 * -2 if some error occurred.
4988 int isl_basic_set_follows_at(__isl_keep isl_basic_set *bset1,
4989 __isl_keep isl_basic_set *bset2, int pos)
4992 enum isl_lp_result res;
4997 res = basic_set_maximal_difference_at(bset1, bset2, pos, &opt);
4999 if (res == isl_lp_empty)
5001 else if ((res == isl_lp_ok && isl_int_is_pos(opt)) ||
5002 res == isl_lp_unbounded)
5004 else if (res == isl_lp_ok && isl_int_is_neg(opt))
5006 else if (res == isl_lp_ok)
5015 /* Given two sets set1 and set2, check whether
5016 * for any common value of the parameters and dimensions preceding pos
5017 * there is a value of dimension pos in set1 that is larger
5018 * than a value of the same dimension in set2.
5021 * 1 if there exists such a pair
5022 * 0 if there is no such pair, but there is a pair of equal values
5024 * -2 if some error occurred.
5026 int isl_set_follows_at(__isl_keep isl_set *set1,
5027 __isl_keep isl_set *set2, int pos)
5035 for (i = 0; i < set1->n; ++i)
5036 for (j = 0; j < set2->n; ++j) {
5038 f = isl_basic_set_follows_at(set1->p[i], set2->p[j], pos);
5039 if (f == 1 || f == -2)
5048 static int isl_basic_map_fast_has_fixed_var(struct isl_basic_map *bmap,
5049 unsigned pos, isl_int *val)
5057 total = isl_basic_map_total_dim(bmap);
5058 for (i = 0, d = total-1; i < bmap->n_eq && d+1 > pos; ++i) {
5059 for (; d+1 > pos; --d)
5060 if (!isl_int_is_zero(bmap->eq[i][1+d]))
5064 if (isl_seq_first_non_zero(bmap->eq[i]+1, d) != -1)
5066 if (isl_seq_first_non_zero(bmap->eq[i]+1+d+1, total-d-1) != -1)
5068 if (!isl_int_is_one(bmap->eq[i][1+d]))
5071 isl_int_neg(*val, bmap->eq[i][0]);
5077 static int isl_map_fast_has_fixed_var(struct isl_map *map,
5078 unsigned pos, isl_int *val)
5090 return isl_basic_map_fast_has_fixed_var(map->p[0], pos, val);
5093 fixed = isl_basic_map_fast_has_fixed_var(map->p[0], pos, &v);
5094 for (i = 1; fixed == 1 && i < map->n; ++i) {
5095 fixed = isl_basic_map_fast_has_fixed_var(map->p[i], pos, &tmp);
5096 if (fixed == 1 && isl_int_ne(tmp, v))
5100 isl_int_set(*val, v);
5106 static int isl_basic_set_fast_has_fixed_var(struct isl_basic_set *bset,
5107 unsigned pos, isl_int *val)
5109 return isl_basic_map_fast_has_fixed_var((struct isl_basic_map *)bset,
5113 static int isl_set_fast_has_fixed_var(struct isl_set *set, unsigned pos,
5116 return isl_map_fast_has_fixed_var((struct isl_map *)set, pos, val);
5119 int isl_basic_map_fast_is_fixed(struct isl_basic_map *bmap,
5120 enum isl_dim_type type, unsigned pos, isl_int *val)
5122 if (pos >= isl_basic_map_dim(bmap, type))
5124 return isl_basic_map_fast_has_fixed_var(bmap,
5125 isl_basic_map_offset(bmap, type) - 1 + pos, val);
5128 int isl_map_fast_is_fixed(struct isl_map *map,
5129 enum isl_dim_type type, unsigned pos, isl_int *val)
5131 if (pos >= isl_map_dim(map, type))
5133 return isl_map_fast_has_fixed_var(map,
5134 map_offset(map, type) - 1 + pos, val);
5137 /* Check if dimension dim has fixed value and if so and if val is not NULL,
5138 * then return this fixed value in *val.
5140 int isl_basic_set_fast_dim_is_fixed(struct isl_basic_set *bset, unsigned dim,
5143 return isl_basic_set_fast_has_fixed_var(bset,
5144 isl_basic_set_n_param(bset) + dim, val);
5147 /* Check if dimension dim has fixed value and if so and if val is not NULL,
5148 * then return this fixed value in *val.
5150 int isl_set_fast_dim_is_fixed(struct isl_set *set, unsigned dim, isl_int *val)
5152 return isl_set_fast_has_fixed_var(set, isl_set_n_param(set) + dim, val);
5155 /* Check if input variable in has fixed value and if so and if val is not NULL,
5156 * then return this fixed value in *val.
5158 int isl_map_fast_input_is_fixed(struct isl_map *map, unsigned in, isl_int *val)
5160 return isl_map_fast_has_fixed_var(map, isl_map_n_param(map) + in, val);
5163 /* Check if dimension dim has an (obvious) fixed lower bound and if so
5164 * and if val is not NULL, then return this lower bound in *val.
5166 int isl_basic_set_fast_dim_has_fixed_lower_bound(struct isl_basic_set *bset,
5167 unsigned dim, isl_int *val)
5169 int i, i_eq = -1, i_ineq = -1;
5176 total = isl_basic_set_total_dim(bset);
5177 nparam = isl_basic_set_n_param(bset);
5178 for (i = 0; i < bset->n_eq; ++i) {
5179 if (isl_int_is_zero(bset->eq[i][1+nparam+dim]))
5185 for (i = 0; i < bset->n_ineq; ++i) {
5186 if (!isl_int_is_pos(bset->ineq[i][1+nparam+dim]))
5188 if (i_eq != -1 || i_ineq != -1)
5192 if (i_eq == -1 && i_ineq == -1)
5194 c = i_eq != -1 ? bset->eq[i_eq] : bset->ineq[i_ineq];
5195 /* The coefficient should always be one due to normalization. */
5196 if (!isl_int_is_one(c[1+nparam+dim]))
5198 if (isl_seq_first_non_zero(c+1, nparam+dim) != -1)
5200 if (isl_seq_first_non_zero(c+1+nparam+dim+1,
5201 total - nparam - dim - 1) != -1)
5204 isl_int_neg(*val, c[0]);
5208 int isl_set_fast_dim_has_fixed_lower_bound(struct isl_set *set,
5209 unsigned dim, isl_int *val)
5221 return isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[0],
5225 fixed = isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[0],
5227 for (i = 1; fixed == 1 && i < set->n; ++i) {
5228 fixed = isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[i],
5230 if (fixed == 1 && isl_int_ne(tmp, v))
5234 isl_int_set(*val, v);
5245 static int qsort_constraint_cmp(const void *p1, const void *p2)
5247 const struct constraint *c1 = (const struct constraint *)p1;
5248 const struct constraint *c2 = (const struct constraint *)p2;
5249 unsigned size = isl_min(c1->size, c2->size);
5250 return isl_seq_cmp(c1->c, c2->c, size);
5253 static struct isl_basic_map *isl_basic_map_sort_constraints(
5254 struct isl_basic_map *bmap)
5257 struct constraint *c;
5262 total = isl_basic_map_total_dim(bmap);
5263 c = isl_alloc_array(bmap->ctx, struct constraint, bmap->n_ineq);
5266 for (i = 0; i < bmap->n_ineq; ++i) {
5268 c[i].c = bmap->ineq[i];
5270 qsort(c, bmap->n_ineq, sizeof(struct constraint), qsort_constraint_cmp);
5271 for (i = 0; i < bmap->n_ineq; ++i)
5272 bmap->ineq[i] = c[i].c;
5276 isl_basic_map_free(bmap);
5280 struct isl_basic_map *isl_basic_map_normalize(struct isl_basic_map *bmap)
5284 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_NORMALIZED))
5286 bmap = isl_basic_map_convex_hull(bmap);
5287 bmap = isl_basic_map_sort_constraints(bmap);
5288 ISL_F_SET(bmap, ISL_BASIC_MAP_NORMALIZED);
5292 struct isl_basic_set *isl_basic_set_normalize(struct isl_basic_set *bset)
5294 return (struct isl_basic_set *)isl_basic_map_normalize(
5295 (struct isl_basic_map *)bset);
5298 static int isl_basic_map_fast_cmp(const struct isl_basic_map *bmap1,
5299 const struct isl_basic_map *bmap2)
5306 if (isl_basic_map_n_param(bmap1) != isl_basic_map_n_param(bmap2))
5307 return isl_basic_map_n_param(bmap1) - isl_basic_map_n_param(bmap2);
5308 if (isl_basic_map_n_in(bmap1) != isl_basic_map_n_in(bmap2))
5309 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
5310 if (isl_basic_map_n_out(bmap1) != isl_basic_map_n_out(bmap2))
5311 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
5312 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY) &&
5313 ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
5315 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY))
5317 if (ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
5319 if (bmap1->n_eq != bmap2->n_eq)
5320 return bmap1->n_eq - bmap2->n_eq;
5321 if (bmap1->n_ineq != bmap2->n_ineq)
5322 return bmap1->n_ineq - bmap2->n_ineq;
5323 if (bmap1->n_div != bmap2->n_div)
5324 return bmap1->n_div - bmap2->n_div;
5325 total = isl_basic_map_total_dim(bmap1);
5326 for (i = 0; i < bmap1->n_eq; ++i) {
5327 cmp = isl_seq_cmp(bmap1->eq[i], bmap2->eq[i], 1+total);
5331 for (i = 0; i < bmap1->n_ineq; ++i) {
5332 cmp = isl_seq_cmp(bmap1->ineq[i], bmap2->ineq[i], 1+total);
5336 for (i = 0; i < bmap1->n_div; ++i) {
5337 cmp = isl_seq_cmp(bmap1->div[i], bmap2->div[i], 1+1+total);
5344 static int isl_basic_map_fast_is_equal(struct isl_basic_map *bmap1,
5345 struct isl_basic_map *bmap2)
5347 return isl_basic_map_fast_cmp(bmap1, bmap2) == 0;
5350 static int qsort_bmap_cmp(const void *p1, const void *p2)
5352 const struct isl_basic_map *bmap1 = *(const struct isl_basic_map **)p1;
5353 const struct isl_basic_map *bmap2 = *(const struct isl_basic_map **)p2;
5355 return isl_basic_map_fast_cmp(bmap1, bmap2);
5358 /* We normalize in place, but if anything goes wrong we need
5359 * to return NULL, so we need to make sure we don't change the
5360 * meaning of any possible other copies of map.
5362 struct isl_map *isl_map_normalize(struct isl_map *map)
5365 struct isl_basic_map *bmap;
5369 if (ISL_F_ISSET(map, ISL_MAP_NORMALIZED))
5371 for (i = 0; i < map->n; ++i) {
5372 bmap = isl_basic_map_normalize(isl_basic_map_copy(map->p[i]));
5375 isl_basic_map_free(map->p[i]);
5378 qsort(map->p, map->n, sizeof(struct isl_basic_map *), qsort_bmap_cmp);
5379 ISL_F_SET(map, ISL_MAP_NORMALIZED);
5380 map = isl_map_remove_empty_parts(map);
5383 for (i = map->n - 1; i >= 1; --i) {
5384 if (!isl_basic_map_fast_is_equal(map->p[i-1], map->p[i]))
5386 isl_basic_map_free(map->p[i-1]);
5387 for (j = i; j < map->n; ++j)
5388 map->p[j-1] = map->p[j];
5398 struct isl_set *isl_set_normalize(struct isl_set *set)
5400 return (struct isl_set *)isl_map_normalize((struct isl_map *)set);
5403 int isl_map_fast_is_equal(struct isl_map *map1, struct isl_map *map2)
5413 if (!isl_dim_equal(map1->dim, map2->dim))
5416 map1 = isl_map_copy(map1);
5417 map2 = isl_map_copy(map2);
5418 map1 = isl_map_normalize(map1);
5419 map2 = isl_map_normalize(map2);
5422 equal = map1->n == map2->n;
5423 for (i = 0; equal && i < map1->n; ++i) {
5424 equal = isl_basic_map_fast_is_equal(map1->p[i], map2->p[i]);
5437 int isl_set_fast_is_equal(struct isl_set *set1, struct isl_set *set2)
5439 return isl_map_fast_is_equal((struct isl_map *)set1,
5440 (struct isl_map *)set2);
5443 /* Return an interval that ranges from min to max (inclusive)
5445 struct isl_basic_set *isl_basic_set_interval(struct isl_ctx *ctx,
5446 isl_int min, isl_int max)
5449 struct isl_basic_set *bset = NULL;
5451 bset = isl_basic_set_alloc(ctx, 0, 1, 0, 0, 2);
5455 k = isl_basic_set_alloc_inequality(bset);
5458 isl_int_set_si(bset->ineq[k][1], 1);
5459 isl_int_neg(bset->ineq[k][0], min);
5461 k = isl_basic_set_alloc_inequality(bset);
5464 isl_int_set_si(bset->ineq[k][1], -1);
5465 isl_int_set(bset->ineq[k][0], max);
5469 isl_basic_set_free(bset);
5473 /* Return the Cartesian product of the basic sets in list (in the given order).
5475 struct isl_basic_set *isl_basic_set_product(struct isl_basic_set_list *list)
5483 struct isl_basic_set *product = NULL;
5487 isl_assert(list->ctx, list->n > 0, goto error);
5488 isl_assert(list->ctx, list->p[0], goto error);
5489 nparam = isl_basic_set_n_param(list->p[0]);
5490 dim = isl_basic_set_n_dim(list->p[0]);
5491 extra = list->p[0]->n_div;
5492 n_eq = list->p[0]->n_eq;
5493 n_ineq = list->p[0]->n_ineq;
5494 for (i = 1; i < list->n; ++i) {
5495 isl_assert(list->ctx, list->p[i], goto error);
5496 isl_assert(list->ctx,
5497 nparam == isl_basic_set_n_param(list->p[i]), goto error);
5498 dim += isl_basic_set_n_dim(list->p[i]);
5499 extra += list->p[i]->n_div;
5500 n_eq += list->p[i]->n_eq;
5501 n_ineq += list->p[i]->n_ineq;
5503 product = isl_basic_set_alloc(list->ctx, nparam, dim, extra,
5508 for (i = 0; i < list->n; ++i) {
5509 isl_basic_set_add_constraints(product,
5510 isl_basic_set_copy(list->p[i]), dim);
5511 dim += isl_basic_set_n_dim(list->p[i]);
5513 isl_basic_set_list_free(list);
5516 isl_basic_set_free(product);
5517 isl_basic_set_list_free(list);
5521 struct isl_basic_map *isl_basic_map_product(
5522 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
5524 struct isl_dim *dim_result = NULL;
5525 struct isl_basic_map *bmap;
5526 unsigned in1, in2, out1, out2, nparam, total, pos;
5527 struct isl_dim_map *dim_map1, *dim_map2;
5529 if (!bmap1 || !bmap2)
5532 isl_assert(bmap1->ctx, isl_dim_match(bmap1->dim, isl_dim_param,
5533 bmap2->dim, isl_dim_param), goto error);
5534 dim_result = isl_dim_product(isl_dim_copy(bmap1->dim),
5535 isl_dim_copy(bmap2->dim));
5537 in1 = isl_basic_map_n_in(bmap1);
5538 in2 = isl_basic_map_n_in(bmap2);
5539 out1 = isl_basic_map_n_out(bmap1);
5540 out2 = isl_basic_map_n_out(bmap2);
5541 nparam = isl_basic_map_n_param(bmap1);
5543 total = nparam + in1 + in2 + out1 + out2 + bmap1->n_div + bmap2->n_div;
5544 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
5545 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
5546 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
5547 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
5548 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
5549 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos += in1);
5550 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += in2);
5551 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += out1);
5552 isl_dim_map_div(dim_map1, bmap1, pos += out2);
5553 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
5555 bmap = isl_basic_map_alloc_dim(dim_result,
5556 bmap1->n_div + bmap2->n_div,
5557 bmap1->n_eq + bmap2->n_eq,
5558 bmap1->n_ineq + bmap2->n_ineq);
5559 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
5560 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
5561 bmap = isl_basic_map_simplify(bmap);
5562 return isl_basic_map_finalize(bmap);
5564 isl_basic_map_free(bmap1);
5565 isl_basic_map_free(bmap2);
5569 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
5571 struct isl_map *isl_map_product(struct isl_map *map1, struct isl_map *map2)
5574 struct isl_map *result;
5580 isl_assert(map1->ctx, isl_dim_match(map1->dim, isl_dim_param,
5581 map2->dim, isl_dim_param), goto error);
5583 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
5584 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
5585 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
5587 result = isl_map_alloc_dim(isl_dim_product(isl_dim_copy(map1->dim),
5588 isl_dim_copy(map2->dim)),
5589 map1->n * map2->n, flags);
5592 for (i = 0; i < map1->n; ++i)
5593 for (j = 0; j < map2->n; ++j) {
5594 struct isl_basic_map *part;
5595 part = isl_basic_map_product(
5596 isl_basic_map_copy(map1->p[i]),
5597 isl_basic_map_copy(map2->p[j]));
5598 if (isl_basic_map_is_empty(part))
5599 isl_basic_map_free(part);
5601 result = isl_map_add_basic_map(result, part);
5614 /* Given two set A and B, construct its Cartesian product A x B.
5616 struct isl_set *isl_set_product(struct isl_set *set1, struct isl_set *set2)
5618 return (struct isl_set *)isl_map_product((struct isl_map *)set1,
5619 (struct isl_map *)set2);
5622 uint32_t isl_basic_set_get_hash(struct isl_basic_set *bset)
5625 uint32_t hash = isl_hash_init();
5630 bset = isl_basic_set_copy(bset);
5631 bset = isl_basic_set_normalize(bset);
5634 total = isl_basic_set_total_dim(bset);
5635 isl_hash_byte(hash, bset->n_eq & 0xFF);
5636 for (i = 0; i < bset->n_eq; ++i) {
5638 c_hash = isl_seq_get_hash(bset->eq[i], 1 + total);
5639 isl_hash_hash(hash, c_hash);
5641 isl_hash_byte(hash, bset->n_ineq & 0xFF);
5642 for (i = 0; i < bset->n_ineq; ++i) {
5644 c_hash = isl_seq_get_hash(bset->ineq[i], 1 + total);
5645 isl_hash_hash(hash, c_hash);
5647 isl_hash_byte(hash, bset->n_div & 0xFF);
5648 for (i = 0; i < bset->n_div; ++i) {
5650 if (isl_int_is_zero(bset->div[i][0]))
5652 isl_hash_byte(hash, i & 0xFF);
5653 c_hash = isl_seq_get_hash(bset->div[i], 1 + 1 + total);
5654 isl_hash_hash(hash, c_hash);
5656 isl_basic_set_free(bset);
5660 uint32_t isl_set_get_hash(struct isl_set *set)
5667 set = isl_set_copy(set);
5668 set = isl_set_normalize(set);
5672 hash = isl_hash_init();
5673 for (i = 0; i < set->n; ++i) {
5675 bset_hash = isl_basic_set_get_hash(set->p[i]);
5676 isl_hash_hash(hash, bset_hash);
5684 /* Check if the value for dimension dim is completely determined
5685 * by the values of the other parameters and variables.
5686 * That is, check if dimension dim is involved in an equality.
5688 int isl_basic_set_dim_is_unique(struct isl_basic_set *bset, unsigned dim)
5695 nparam = isl_basic_set_n_param(bset);
5696 for (i = 0; i < bset->n_eq; ++i)
5697 if (!isl_int_is_zero(bset->eq[i][1 + nparam + dim]))
5702 /* Check if the value for dimension dim is completely determined
5703 * by the values of the other parameters and variables.
5704 * That is, check if dimension dim is involved in an equality
5705 * for each of the subsets.
5707 int isl_set_dim_is_unique(struct isl_set *set, unsigned dim)
5713 for (i = 0; i < set->n; ++i) {
5715 unique = isl_basic_set_dim_is_unique(set->p[i], dim);
5722 int isl_map_foreach_basic_map(__isl_keep isl_map *map,
5723 int (*fn)(__isl_take isl_basic_map *bmap, void *user), void *user)
5730 for (i = 0; i < map->n; ++i)
5731 if (fn(isl_basic_map_copy(map->p[i]), user) < 0)
5737 int isl_set_foreach_basic_set(__isl_keep isl_set *set,
5738 int (*fn)(__isl_take isl_basic_set *bset, void *user), void *user)
5745 for (i = 0; i < set->n; ++i)
5746 if (fn(isl_basic_set_copy(set->p[i]), user) < 0)
5752 __isl_give isl_map *isl_set_lifting(__isl_take isl_set *set)
5754 struct isl_dim *dim;
5755 struct isl_basic_map *bmap;
5762 set = isl_set_align_divs(set);
5767 dim = isl_set_get_dim(set);
5768 if (set->n == 0 || set->p[0]->n_div == 0) {
5770 return isl_map_identity(dim);
5773 n_div = set->p[0]->n_div;
5774 dim = isl_dim_map(dim);
5775 n_param = isl_dim_size(dim, isl_dim_param);
5776 n_set = isl_dim_size(dim, isl_dim_in);
5777 dim = isl_dim_extend(dim, n_param, n_set, n_set + n_div);
5778 bmap = isl_basic_map_alloc_dim(dim, 0, n_set, 2 * n_div);
5779 for (i = 0; i < n_set; ++i)
5780 bmap = var_equal(bmap, i);
5782 total = n_param + n_set + n_set + n_div;
5783 for (i = 0; i < n_div; ++i) {
5784 k = isl_basic_map_alloc_inequality(bmap);
5787 isl_seq_cpy(bmap->ineq[k], set->p[0]->div[i]+1, 1+n_param);
5788 isl_seq_clr(bmap->ineq[k]+1+n_param, n_set);
5789 isl_seq_cpy(bmap->ineq[k]+1+n_param+n_set,
5790 set->p[0]->div[i]+1+1+n_param, n_set + n_div);
5791 isl_int_neg(bmap->ineq[k][1+n_param+n_set+n_set+i],
5792 set->p[0]->div[i][0]);
5794 l = isl_basic_map_alloc_inequality(bmap);
5797 isl_seq_neg(bmap->ineq[l], bmap->ineq[k], 1 + total);
5798 isl_int_add(bmap->ineq[l][0], bmap->ineq[l][0],
5799 set->p[0]->div[i][0]);
5800 isl_int_sub_ui(bmap->ineq[l][0], bmap->ineq[l][0], 1);
5804 return isl_map_from_basic_map(bmap);
5807 isl_basic_map_free(bmap);
5811 int isl_basic_set_size(__isl_keep isl_basic_set *bset)
5819 dim = isl_basic_set_total_dim(bset);
5820 size += bset->n_eq * (1 + dim);
5821 size += bset->n_ineq * (1 + dim);
5822 size += bset->n_div * (2 + dim);
5827 int isl_set_size(__isl_keep isl_set *set)
5835 for (i = 0; i < set->n; ++i)
5836 size += isl_basic_set_size(set->p[i]);