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(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(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(map, bmap);
1604 struct isl_set *isl_set_add(struct isl_set *set, struct isl_basic_set *bset)
1606 return (struct isl_set *)isl_map_add((struct isl_map *)set,
1607 (struct isl_basic_map *)bset);
1610 void isl_set_free(struct isl_set *set)
1620 isl_ctx_deref(set->ctx);
1621 for (i = 0; i < set->n; ++i)
1622 isl_basic_set_free(set->p[i]);
1623 isl_dim_free(set->dim);
1627 void isl_set_dump(struct isl_set *set, FILE *out, int indent)
1632 fprintf(out, "null set\n");
1636 fprintf(out, "%*s", indent, "");
1637 fprintf(out, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
1638 set->ref, set->n, set->dim->nparam, set->dim->n_out,
1640 for (i = 0; i < set->n; ++i) {
1641 fprintf(out, "%*s", indent, "");
1642 fprintf(out, "basic set %d:\n", i);
1643 isl_basic_set_dump(set->p[i], out, indent+4);
1647 void isl_map_dump(struct isl_map *map, FILE *out, int indent)
1652 fprintf(out, "null map\n");
1656 fprintf(out, "%*s", indent, "");
1657 fprintf(out, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, "
1658 "flags: %x, n_name: %d\n",
1659 map->ref, map->n, map->dim->nparam, map->dim->n_in,
1660 map->dim->n_out, map->flags, map->dim->n_name);
1661 for (i = 0; i < map->n; ++i) {
1662 fprintf(out, "%*s", indent, "");
1663 fprintf(out, "basic map %d:\n", i);
1664 isl_basic_map_dump(map->p[i], out, indent+4);
1668 struct isl_basic_map *isl_basic_map_intersect_domain(
1669 struct isl_basic_map *bmap, struct isl_basic_set *bset)
1671 struct isl_basic_map *bmap_domain;
1672 struct isl_dim *dim;
1677 isl_assert(bset->ctx, isl_dim_match(bmap->dim, isl_dim_param,
1678 bset->dim, isl_dim_param), goto error);
1680 if (isl_dim_size(bset->dim, isl_dim_set) != 0)
1681 isl_assert(bset->ctx,
1682 isl_basic_map_compatible_domain(bmap, bset), goto error);
1684 bmap = isl_basic_map_cow(bmap);
1685 bmap = isl_basic_map_extend_dim(bmap, isl_dim_copy(bmap->dim),
1686 bset->n_div, bset->n_eq, bset->n_ineq);
1689 dim = isl_dim_reverse(isl_dim_copy(bset->dim));
1690 bmap_domain = isl_basic_map_from_basic_set(bset, dim);
1691 bmap = add_constraints(bmap, bmap_domain, 0, 0);
1693 bmap = isl_basic_map_simplify(bmap);
1694 return isl_basic_map_finalize(bmap);
1696 isl_basic_map_free(bmap);
1697 isl_basic_set_free(bset);
1701 struct isl_basic_map *isl_basic_map_intersect_range(
1702 struct isl_basic_map *bmap, struct isl_basic_set *bset)
1704 struct isl_basic_map *bmap_range;
1709 isl_assert(bset->ctx, isl_dim_match(bmap->dim, isl_dim_param,
1710 bset->dim, isl_dim_param), goto error);
1712 if (isl_dim_size(bset->dim, isl_dim_set) != 0)
1713 isl_assert(bset->ctx,
1714 isl_basic_map_compatible_range(bmap, bset), goto error);
1716 bmap = isl_basic_map_cow(bmap);
1717 bmap = isl_basic_map_extend_dim(bmap, isl_dim_copy(bmap->dim),
1718 bset->n_div, bset->n_eq, bset->n_ineq);
1721 bmap_range = isl_basic_map_from_basic_set(bset, isl_dim_copy(bset->dim));
1722 bmap = add_constraints(bmap, bmap_range, 0, 0);
1724 bmap = isl_basic_map_simplify(bmap);
1725 return isl_basic_map_finalize(bmap);
1727 isl_basic_map_free(bmap);
1728 isl_basic_set_free(bset);
1732 int isl_basic_map_contains(struct isl_basic_map *bmap, struct isl_vec *vec)
1738 total = 1 + isl_basic_map_total_dim(bmap);
1739 if (total != vec->size)
1744 for (i = 0; i < bmap->n_eq; ++i) {
1745 isl_seq_inner_product(vec->el, bmap->eq[i], total, &s);
1746 if (!isl_int_is_zero(s)) {
1752 for (i = 0; i < bmap->n_ineq; ++i) {
1753 isl_seq_inner_product(vec->el, bmap->ineq[i], total, &s);
1754 if (isl_int_is_neg(s)) {
1765 int isl_basic_set_contains(struct isl_basic_set *bset, struct isl_vec *vec)
1767 return isl_basic_map_contains((struct isl_basic_map *)bset, vec);
1770 struct isl_basic_map *isl_basic_map_intersect(
1771 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
1773 struct isl_vec *sample = NULL;
1775 if (!bmap1 || !bmap2)
1778 isl_assert(bmap1->ctx, isl_dim_match(bmap1->dim, isl_dim_param,
1779 bmap2->dim, isl_dim_param), goto error);
1780 if (isl_dim_total(bmap1->dim) ==
1781 isl_dim_size(bmap1->dim, isl_dim_param) &&
1782 isl_dim_total(bmap2->dim) !=
1783 isl_dim_size(bmap2->dim, isl_dim_param))
1784 return isl_basic_map_intersect(bmap2, bmap1);
1786 if (isl_dim_total(bmap2->dim) !=
1787 isl_dim_size(bmap2->dim, isl_dim_param))
1788 isl_assert(bmap1->ctx,
1789 isl_dim_equal(bmap1->dim, bmap2->dim), goto error);
1791 if (bmap1->sample &&
1792 isl_basic_map_contains(bmap1, bmap1->sample) > 0 &&
1793 isl_basic_map_contains(bmap2, bmap1->sample) > 0)
1794 sample = isl_vec_copy(bmap1->sample);
1795 else if (bmap2->sample &&
1796 isl_basic_map_contains(bmap1, bmap2->sample) > 0 &&
1797 isl_basic_map_contains(bmap2, bmap2->sample) > 0)
1798 sample = isl_vec_copy(bmap2->sample);
1800 bmap1 = isl_basic_map_cow(bmap1);
1801 bmap1 = isl_basic_map_extend_dim(bmap1, isl_dim_copy(bmap1->dim),
1802 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
1805 bmap1 = add_constraints(bmap1, bmap2, 0, 0);
1808 isl_vec_free(bmap1->sample);
1809 bmap1->sample = sample;
1812 bmap1 = isl_basic_map_simplify(bmap1);
1813 return isl_basic_map_finalize(bmap1);
1816 isl_vec_free(sample);
1817 isl_basic_map_free(bmap1);
1818 isl_basic_map_free(bmap2);
1822 struct isl_basic_set *isl_basic_set_intersect(
1823 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
1825 return (struct isl_basic_set *)
1826 isl_basic_map_intersect(
1827 (struct isl_basic_map *)bset1,
1828 (struct isl_basic_map *)bset2);
1831 /* Special case of isl_map_intersect, where both map1 and map2
1832 * are convex, without any divs and such that either map1 or map2
1833 * contains a single constraint. This constraint is then simply
1834 * added to the other map.
1836 static __isl_give isl_map *map_intersect_add_constraint(
1837 __isl_take isl_map *map1, __isl_take isl_map *map2)
1839 struct isl_basic_map *bmap1;
1840 struct isl_basic_map *bmap2;
1842 isl_assert(map1->ctx, map1->n == 1, goto error);
1843 isl_assert(map2->ctx, map1->n == 1, goto error);
1844 isl_assert(map1->ctx, map1->p[0]->n_div == 0, goto error);
1845 isl_assert(map2->ctx, map1->p[0]->n_div == 0, goto error);
1847 if (map2->p[0]->n_eq + map2->p[0]->n_ineq != 1)
1848 return isl_map_intersect(map2, map1);
1850 isl_assert(map2->ctx,
1851 map2->p[0]->n_eq + map2->p[0]->n_ineq == 1, goto error);
1853 map1 = isl_map_cow(map1);
1856 map1->p[0] = isl_basic_map_cow(map1->p[0]);
1857 if (map2->p[0]->n_eq == 1)
1858 map1->p[0] = isl_basic_map_add_eq(map1->p[0], map2->p[0]->eq[0]);
1860 map1->p[0] = isl_basic_map_add_ineq(map1->p[0],
1861 map2->p[0]->ineq[0]);
1863 map1->p[0] = isl_basic_map_simplify(map1->p[0]);
1864 map1->p[0] = isl_basic_map_finalize(map1->p[0]);
1877 struct isl_map *isl_map_intersect(struct isl_map *map1, struct isl_map *map2)
1880 struct isl_map *result;
1886 if (map1->n == 1 && map2->n == 1 &&
1887 map1->p[0]->n_div == 0 && map2->p[0]->n_div == 0 &&
1888 isl_dim_equal(map1->dim, map2->dim) &&
1889 (map1->p[0]->n_eq + map1->p[0]->n_ineq == 1 ||
1890 map2->p[0]->n_eq + map2->p[0]->n_ineq == 1))
1891 return map_intersect_add_constraint(map1, map2);
1892 isl_assert(map1->ctx, isl_dim_match(map1->dim, isl_dim_param,
1893 map2->dim, isl_dim_param), goto error);
1894 if (isl_dim_total(map1->dim) ==
1895 isl_dim_size(map1->dim, isl_dim_param) &&
1896 isl_dim_total(map2->dim) != isl_dim_size(map2->dim, isl_dim_param))
1897 return isl_map_intersect(map2, map1);
1899 if (isl_dim_total(map2->dim) != isl_dim_size(map2->dim, isl_dim_param))
1900 isl_assert(map1->ctx,
1901 isl_dim_equal(map1->dim, map2->dim), goto error);
1903 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
1904 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
1905 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
1907 result = isl_map_alloc_dim(isl_dim_copy(map1->dim),
1908 map1->n * map2->n, flags);
1911 for (i = 0; i < map1->n; ++i)
1912 for (j = 0; j < map2->n; ++j) {
1913 struct isl_basic_map *part;
1914 part = isl_basic_map_intersect(
1915 isl_basic_map_copy(map1->p[i]),
1916 isl_basic_map_copy(map2->p[j]));
1917 if (isl_basic_map_is_empty(part))
1918 isl_basic_map_free(part);
1920 result = isl_map_add(result, part);
1933 struct isl_set *isl_set_intersect(struct isl_set *set1, struct isl_set *set2)
1935 return (struct isl_set *)
1936 isl_map_intersect((struct isl_map *)set1,
1937 (struct isl_map *)set2);
1940 struct isl_basic_map *isl_basic_map_reverse(struct isl_basic_map *bmap)
1942 struct isl_dim *dim;
1943 struct isl_basic_set *bset;
1948 bmap = isl_basic_map_cow(bmap);
1951 dim = isl_dim_reverse(isl_dim_copy(bmap->dim));
1952 in = isl_basic_map_n_in(bmap);
1953 bset = isl_basic_set_from_basic_map(bmap);
1954 bset = isl_basic_set_swap_vars(bset, in);
1955 return isl_basic_map_from_basic_set(bset, dim);
1958 /* Turn final n dimensions into existentially quantified variables.
1960 struct isl_basic_set *isl_basic_set_project_out(struct isl_basic_set *bset,
1961 enum isl_dim_type type, unsigned first, unsigned n)
1971 isl_assert(bset->ctx, type == isl_dim_set, goto error);
1972 isl_assert(bset->ctx, first + n == isl_basic_set_n_dim(bset), goto error);
1977 if (ISL_F_ISSET(bset, ISL_BASIC_SET_RATIONAL))
1978 return isl_basic_set_remove(bset, type, first, n);
1980 bset = isl_basic_set_cow(bset);
1982 row_size = 1 + isl_dim_total(bset->dim) + bset->extra;
1983 old = bset->block2.data;
1984 bset->block2 = isl_blk_extend(bset->ctx, bset->block2,
1985 (bset->extra + n) * (1 + row_size));
1986 if (!bset->block2.data)
1988 new_div = isl_alloc_array(ctx, isl_int *, bset->extra + n);
1991 for (i = 0; i < n; ++i) {
1992 new_div[i] = bset->block2.data +
1993 (bset->extra + i) * (1 + row_size);
1994 isl_seq_clr(new_div[i], 1 + row_size);
1996 for (i = 0; i < bset->extra; ++i)
1997 new_div[n + i] = bset->block2.data + (bset->div[i] - old);
1999 bset->div = new_div;
2002 bset->dim = isl_dim_drop_outputs(bset->dim,
2003 isl_basic_set_n_dim(bset) - n, n);
2006 bset = isl_basic_set_simplify(bset);
2007 bset = isl_basic_set_drop_redundant_divs(bset);
2008 return isl_basic_set_finalize(bset);
2010 isl_basic_set_free(bset);
2014 /* Turn final n dimensions into existentially quantified variables.
2016 __isl_give isl_set *isl_set_project_out(__isl_take isl_set *set,
2017 enum isl_dim_type type, unsigned first, unsigned n)
2024 isl_assert(set->ctx, type == isl_dim_set, goto error);
2025 isl_assert(set->ctx, first + n == isl_set_n_dim(set), goto error);
2027 set = isl_set_cow(set);
2030 set->dim = isl_dim_drop_outputs(set->dim, first, n);
2031 for (i = 0; i < set->n; ++i) {
2032 set->p[i] = isl_basic_set_project_out(set->p[i], type, first, n);
2037 ISL_F_CLR(set, ISL_SET_NORMALIZED);
2044 static struct isl_basic_map *add_divs(struct isl_basic_map *bmap, unsigned n)
2048 for (i = 0; i < n; ++i) {
2049 j = isl_basic_map_alloc_div(bmap);
2052 isl_seq_clr(bmap->div[j], 1+1+isl_basic_map_total_dim(bmap));
2056 isl_basic_map_free(bmap);
2060 struct isl_basic_map *isl_basic_map_apply_range(
2061 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2063 struct isl_dim *dim_result = NULL;
2064 struct isl_basic_map *bmap;
2065 unsigned n_in, n_out, n, nparam, total, pos;
2066 struct isl_dim_map *dim_map1, *dim_map2;
2068 if (!bmap1 || !bmap2)
2071 dim_result = isl_dim_join(isl_dim_copy(bmap1->dim),
2072 isl_dim_copy(bmap2->dim));
2074 n_in = isl_basic_map_n_in(bmap1);
2075 n_out = isl_basic_map_n_out(bmap2);
2076 n = isl_basic_map_n_out(bmap1);
2077 nparam = isl_basic_map_n_param(bmap1);
2079 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + n;
2080 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
2081 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
2082 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
2083 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
2084 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
2085 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_in);
2086 isl_dim_map_div(dim_map1, bmap1, pos += n_out);
2087 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
2088 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
2089 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
2091 bmap = isl_basic_map_alloc_dim(dim_result,
2092 bmap1->n_div + bmap2->n_div + n,
2093 bmap1->n_eq + bmap2->n_eq,
2094 bmap1->n_ineq + bmap2->n_ineq);
2095 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
2096 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
2097 bmap = add_divs(bmap, n);
2098 bmap = isl_basic_map_simplify(bmap);
2099 bmap = isl_basic_map_drop_redundant_divs(bmap);
2100 return isl_basic_map_finalize(bmap);
2102 isl_basic_map_free(bmap1);
2103 isl_basic_map_free(bmap2);
2107 struct isl_basic_set *isl_basic_set_apply(
2108 struct isl_basic_set *bset, struct isl_basic_map *bmap)
2113 isl_assert(bset->ctx, isl_basic_map_compatible_domain(bmap, bset),
2116 return (struct isl_basic_set *)
2117 isl_basic_map_apply_range((struct isl_basic_map *)bset, bmap);
2119 isl_basic_set_free(bset);
2120 isl_basic_map_free(bmap);
2124 struct isl_basic_map *isl_basic_map_apply_domain(
2125 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2127 if (!bmap1 || !bmap2)
2130 isl_assert(bmap1->ctx,
2131 isl_basic_map_n_in(bmap1) == isl_basic_map_n_in(bmap2), goto error);
2132 isl_assert(bmap1->ctx,
2133 isl_basic_map_n_param(bmap1) == isl_basic_map_n_param(bmap2),
2136 bmap1 = isl_basic_map_reverse(bmap1);
2137 bmap1 = isl_basic_map_apply_range(bmap1, bmap2);
2138 return isl_basic_map_reverse(bmap1);
2140 isl_basic_map_free(bmap1);
2141 isl_basic_map_free(bmap2);
2145 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
2146 * A \cap B -> f(A) + f(B)
2148 struct isl_basic_map *isl_basic_map_sum(
2149 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2151 unsigned n_in, n_out, nparam, total, pos;
2152 struct isl_basic_map *bmap = NULL;
2153 struct isl_dim_map *dim_map1, *dim_map2;
2156 if (!bmap1 || !bmap2)
2159 isl_assert(bmap1->ctx, isl_dim_equal(bmap1->dim, bmap2->dim),
2162 nparam = isl_basic_map_n_param(bmap1);
2163 n_in = isl_basic_map_n_in(bmap1);
2164 n_out = isl_basic_map_n_out(bmap1);
2166 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + 2 * n_out;
2167 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
2168 dim_map2 = isl_dim_map_alloc(bmap2->ctx, total);
2169 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
2170 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos);
2171 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
2172 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
2173 isl_dim_map_div(dim_map1, bmap1, pos += n_in + n_out);
2174 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
2175 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
2176 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_out);
2178 bmap = isl_basic_map_alloc_dim(isl_dim_copy(bmap1->dim),
2179 bmap1->n_div + bmap2->n_div + 2 * n_out,
2180 bmap1->n_eq + bmap2->n_eq + n_out,
2181 bmap1->n_ineq + bmap2->n_ineq);
2182 for (i = 0; i < n_out; ++i) {
2183 int j = isl_basic_map_alloc_equality(bmap);
2186 isl_seq_clr(bmap->eq[j], 1+total);
2187 isl_int_set_si(bmap->eq[j][1+nparam+n_in+i], -1);
2188 isl_int_set_si(bmap->eq[j][1+pos+i], 1);
2189 isl_int_set_si(bmap->eq[j][1+pos-n_out+i], 1);
2191 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
2192 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
2193 bmap = add_divs(bmap, 2 * n_out);
2195 bmap = isl_basic_map_simplify(bmap);
2196 return isl_basic_map_finalize(bmap);
2198 isl_basic_map_free(bmap);
2199 isl_basic_map_free(bmap1);
2200 isl_basic_map_free(bmap2);
2204 /* Given two maps A -> f(A) and B -> g(B), construct a map
2205 * A \cap B -> f(A) + f(B)
2207 struct isl_map *isl_map_sum(struct isl_map *map1, struct isl_map *map2)
2209 struct isl_map *result;
2215 isl_assert(map1->ctx, isl_dim_equal(map1->dim, map2->dim), goto error);
2217 result = isl_map_alloc_dim(isl_dim_copy(map1->dim),
2218 map1->n * map2->n, 0);
2221 for (i = 0; i < map1->n; ++i)
2222 for (j = 0; j < map2->n; ++j) {
2223 struct isl_basic_map *part;
2224 part = isl_basic_map_sum(
2225 isl_basic_map_copy(map1->p[i]),
2226 isl_basic_map_copy(map2->p[j]));
2227 if (isl_basic_map_is_empty(part))
2228 isl_basic_map_free(part);
2230 result = isl_map_add(result, part);
2243 /* Given a basic map A -> f(A), construct A -> -f(A).
2245 struct isl_basic_map *isl_basic_map_neg(struct isl_basic_map *bmap)
2250 bmap = isl_basic_map_cow(bmap);
2254 n = isl_basic_map_dim(bmap, isl_dim_out);
2255 off = isl_basic_map_offset(bmap, isl_dim_out);
2256 for (i = 0; i < bmap->n_eq; ++i)
2257 for (j = 0; j < n; ++j)
2258 isl_int_neg(bmap->eq[i][off+j], bmap->eq[i][off+j]);
2259 for (i = 0; i < bmap->n_ineq; ++i)
2260 for (j = 0; j < n; ++j)
2261 isl_int_neg(bmap->ineq[i][off+j], bmap->ineq[i][off+j]);
2262 for (i = 0; i < bmap->n_div; ++i)
2263 for (j = 0; j < n; ++j)
2264 isl_int_neg(bmap->div[i][1+off+j], bmap->div[i][1+off+j]);
2265 return isl_basic_map_finalize(bmap);
2268 /* Given a map A -> f(A), construct A -> -f(A).
2270 struct isl_map *isl_map_neg(struct isl_map *map)
2274 map = isl_map_cow(map);
2278 for (i = 0; i < map->n; ++i) {
2279 map->p[i] = isl_basic_map_neg(map->p[i]);
2290 /* Given a basic map A -> f(A) and an integer d, construct a basic map
2291 * A -> floor(f(A)/d).
2293 struct isl_basic_map *isl_basic_map_floordiv(struct isl_basic_map *bmap,
2296 unsigned n_in, n_out, nparam, total, pos;
2297 struct isl_basic_map *result = NULL;
2298 struct isl_dim_map *dim_map;
2304 nparam = isl_basic_map_n_param(bmap);
2305 n_in = isl_basic_map_n_in(bmap);
2306 n_out = isl_basic_map_n_out(bmap);
2308 total = nparam + n_in + n_out + bmap->n_div + n_out;
2309 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2310 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_param, pos = 0);
2311 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_in, pos += nparam);
2312 isl_dim_map_div(dim_map, bmap, pos += n_in + n_out);
2313 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_out, pos += bmap->n_div);
2315 result = isl_basic_map_alloc_dim(isl_dim_copy(bmap->dim),
2316 bmap->n_div + n_out,
2317 bmap->n_eq, bmap->n_ineq + 2 * n_out);
2318 result = add_constraints_dim_map(result, bmap, dim_map);
2319 result = add_divs(result, n_out);
2320 for (i = 0; i < n_out; ++i) {
2322 j = isl_basic_map_alloc_inequality(result);
2325 isl_seq_clr(result->ineq[j], 1+total);
2326 isl_int_neg(result->ineq[j][1+nparam+n_in+i], d);
2327 isl_int_set_si(result->ineq[j][1+pos+i], 1);
2328 j = isl_basic_map_alloc_inequality(result);
2331 isl_seq_clr(result->ineq[j], 1+total);
2332 isl_int_set(result->ineq[j][1+nparam+n_in+i], d);
2333 isl_int_set_si(result->ineq[j][1+pos+i], -1);
2334 isl_int_sub_ui(result->ineq[j][0], d, 1);
2337 result = isl_basic_map_simplify(result);
2338 return isl_basic_map_finalize(result);
2340 isl_basic_map_free(result);
2344 /* Given a map A -> f(A) and an integer d, construct a map
2345 * A -> floor(f(A)/d).
2347 struct isl_map *isl_map_floordiv(struct isl_map *map, isl_int d)
2351 map = isl_map_cow(map);
2355 ISL_F_CLR(map, ISL_MAP_DISJOINT);
2356 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
2357 for (i = 0; i < map->n; ++i) {
2358 map->p[i] = isl_basic_map_floordiv(map->p[i], d);
2369 static struct isl_basic_map *var_equal(struct isl_basic_map *bmap, unsigned pos)
2375 i = isl_basic_map_alloc_equality(bmap);
2378 nparam = isl_basic_map_n_param(bmap);
2379 n_in = isl_basic_map_n_in(bmap);
2380 isl_seq_clr(bmap->eq[i], 1 + isl_basic_map_total_dim(bmap));
2381 isl_int_set_si(bmap->eq[i][1+nparam+pos], -1);
2382 isl_int_set_si(bmap->eq[i][1+nparam+n_in+pos], 1);
2383 return isl_basic_map_finalize(bmap);
2385 isl_basic_map_free(bmap);
2389 /* Add a constraints to "bmap" expressing i_pos < o_pos
2391 static struct isl_basic_map *var_less(struct isl_basic_map *bmap, unsigned pos)
2397 i = isl_basic_map_alloc_inequality(bmap);
2400 nparam = isl_basic_map_n_param(bmap);
2401 n_in = isl_basic_map_n_in(bmap);
2402 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
2403 isl_int_set_si(bmap->ineq[i][0], -1);
2404 isl_int_set_si(bmap->ineq[i][1+nparam+pos], -1);
2405 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], 1);
2406 return isl_basic_map_finalize(bmap);
2408 isl_basic_map_free(bmap);
2412 /* Add a constraints to "bmap" expressing i_pos > o_pos
2414 static struct isl_basic_map *var_more(struct isl_basic_map *bmap, unsigned pos)
2420 i = isl_basic_map_alloc_inequality(bmap);
2423 nparam = isl_basic_map_n_param(bmap);
2424 n_in = isl_basic_map_n_in(bmap);
2425 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
2426 isl_int_set_si(bmap->ineq[i][0], -1);
2427 isl_int_set_si(bmap->ineq[i][1+nparam+pos], 1);
2428 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], -1);
2429 return isl_basic_map_finalize(bmap);
2431 isl_basic_map_free(bmap);
2435 struct isl_basic_map *isl_basic_map_equal(struct isl_dim *dim, unsigned n_equal)
2438 struct isl_basic_map *bmap;
2439 bmap = isl_basic_map_alloc_dim(dim, 0, n_equal, 0);
2442 for (i = 0; i < n_equal && bmap; ++i)
2443 bmap = var_equal(bmap, i);
2444 return isl_basic_map_finalize(bmap);
2447 /* Return a relation on pairs of sets of dimension "dim" expressing i_pos < o_pos
2449 struct isl_basic_map *isl_basic_map_less_at(struct isl_dim *dim, unsigned pos)
2452 struct isl_basic_map *bmap;
2453 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
2456 for (i = 0; i < pos && bmap; ++i)
2457 bmap = var_equal(bmap, i);
2459 bmap = var_less(bmap, pos);
2460 return isl_basic_map_finalize(bmap);
2463 /* Return a relation on pairs of sets of dimension "dim" expressing i_pos > o_pos
2465 struct isl_basic_map *isl_basic_map_more_at(struct isl_dim *dim, unsigned pos)
2468 struct isl_basic_map *bmap;
2469 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
2472 for (i = 0; i < pos && bmap; ++i)
2473 bmap = var_equal(bmap, i);
2475 bmap = var_more(bmap, pos);
2476 return isl_basic_map_finalize(bmap);
2479 static __isl_give isl_map *map_lex_lte(__isl_take isl_dim *dims, int equal)
2481 struct isl_map *map;
2488 map = isl_map_alloc_dim(isl_dim_copy(dims), dim + equal, ISL_MAP_DISJOINT);
2490 for (i = 0; i < dim; ++i)
2491 map = isl_map_add(map,
2492 isl_basic_map_less_at(isl_dim_copy(dims), i));
2494 map = isl_map_add(map,
2495 isl_basic_map_equal(isl_dim_copy(dims), dim));
2501 __isl_give isl_map *isl_map_lex_lt(__isl_take isl_dim *set_dim)
2503 return map_lex_lte(isl_dim_map(set_dim), 0);
2506 __isl_give isl_map *isl_map_lex_le(__isl_take isl_dim *set_dim)
2508 return map_lex_lte(isl_dim_map(set_dim), 1);
2511 static __isl_give isl_map *map_lex_gte(__isl_take isl_dim *dims, int equal)
2513 struct isl_map *map;
2520 map = isl_map_alloc_dim(isl_dim_copy(dims), dim + equal, ISL_MAP_DISJOINT);
2522 for (i = 0; i < dim; ++i)
2523 map = isl_map_add(map,
2524 isl_basic_map_more_at(isl_dim_copy(dims), i));
2526 map = isl_map_add(map,
2527 isl_basic_map_equal(isl_dim_copy(dims), dim));
2533 __isl_give isl_map *isl_map_lex_gt(__isl_take isl_dim *set_dim)
2535 return map_lex_gte(isl_dim_map(set_dim), 0);
2538 __isl_give isl_map *isl_map_lex_ge(__isl_take isl_dim *set_dim)
2540 return map_lex_gte(isl_dim_map(set_dim), 1);
2543 struct isl_basic_map *isl_basic_map_from_basic_set(
2544 struct isl_basic_set *bset, struct isl_dim *dim)
2546 struct isl_basic_map *bmap;
2548 bset = isl_basic_set_cow(bset);
2552 isl_assert(bset->ctx, isl_dim_compatible(bset->dim, dim), goto error);
2553 isl_dim_free(bset->dim);
2554 bmap = (struct isl_basic_map *) bset;
2556 return isl_basic_map_finalize(bmap);
2558 isl_basic_set_free(bset);
2563 struct isl_basic_set *isl_basic_set_from_basic_map(struct isl_basic_map *bmap)
2567 if (bmap->dim->n_in == 0)
2568 return (struct isl_basic_set *)bmap;
2569 bmap = isl_basic_map_cow(bmap);
2572 bmap->dim = isl_dim_cow(bmap->dim);
2575 bmap->dim->n_out += bmap->dim->n_in;
2576 bmap->dim->n_in = 0;
2577 bmap = isl_basic_map_finalize(bmap);
2578 return (struct isl_basic_set *)bmap;
2580 isl_basic_map_free(bmap);
2584 /* For a div d = floor(f/m), add the constraints
2587 * -(f-(n-1)) + m d >= 0
2589 * Note that the second constraint is the negation of
2593 int isl_basic_map_add_div_constraints(struct isl_basic_map *bmap, unsigned div)
2596 unsigned total = isl_basic_map_total_dim(bmap);
2597 unsigned div_pos = 1 + total - bmap->n_div + div;
2599 i = isl_basic_map_alloc_inequality(bmap);
2602 isl_seq_cpy(bmap->ineq[i], bmap->div[div]+1, 1+total);
2603 isl_int_neg(bmap->ineq[i][div_pos], bmap->div[div][0]);
2605 j = isl_basic_map_alloc_inequality(bmap);
2608 isl_seq_neg(bmap->ineq[j], bmap->ineq[i], 1 + total);
2609 isl_int_add(bmap->ineq[j][0], bmap->ineq[j][0], bmap->ineq[j][div_pos]);
2610 isl_int_sub_ui(bmap->ineq[j][0], bmap->ineq[j][0], 1);
2614 struct isl_basic_set *isl_basic_map_underlying_set(
2615 struct isl_basic_map *bmap)
2619 if (bmap->dim->nparam == 0 && bmap->dim->n_in == 0 && bmap->n_div == 0)
2620 return (struct isl_basic_set *)bmap;
2621 bmap = isl_basic_map_cow(bmap);
2624 bmap->dim = isl_dim_underlying(bmap->dim, bmap->n_div);
2627 bmap->extra -= bmap->n_div;
2629 bmap = isl_basic_map_finalize(bmap);
2630 return (struct isl_basic_set *)bmap;
2635 __isl_give isl_basic_set *isl_basic_set_underlying_set(
2636 __isl_take isl_basic_set *bset)
2638 return isl_basic_map_underlying_set((isl_basic_map *)bset);
2641 struct isl_basic_map *isl_basic_map_overlying_set(
2642 struct isl_basic_set *bset, struct isl_basic_map *like)
2644 struct isl_basic_map *bmap;
2645 struct isl_ctx *ctx;
2652 isl_assert(ctx, bset->n_div == 0, goto error);
2653 isl_assert(ctx, isl_basic_set_n_param(bset) == 0, goto error);
2654 isl_assert(ctx, bset->dim->n_out == isl_basic_map_total_dim(like),
2656 if (isl_dim_equal(bset->dim, like->dim) && like->n_div == 0) {
2657 isl_basic_map_free(like);
2658 return (struct isl_basic_map *)bset;
2660 bset = isl_basic_set_cow(bset);
2663 total = bset->dim->n_out + bset->extra;
2664 bmap = (struct isl_basic_map *)bset;
2665 isl_dim_free(bmap->dim);
2666 bmap->dim = isl_dim_copy(like->dim);
2669 bmap->n_div = like->n_div;
2670 bmap->extra += like->n_div;
2673 ltotal = total - bmap->extra + like->extra;
2676 bmap->block2 = isl_blk_extend(ctx, bmap->block2,
2677 bmap->extra * (1 + 1 + total));
2678 if (isl_blk_is_error(bmap->block2))
2680 bmap->div = isl_realloc_array(ctx, bmap->div, isl_int *,
2684 for (i = 0; i < bmap->extra; ++i)
2685 bmap->div[i] = bmap->block2.data + i * (1 + 1 + total);
2686 for (i = 0; i < like->n_div; ++i) {
2687 isl_seq_cpy(bmap->div[i], like->div[i], 1 + 1 + ltotal);
2688 isl_seq_clr(bmap->div[i]+1+1+ltotal, total - ltotal);
2690 bmap = isl_basic_map_extend_constraints(bmap,
2691 0, 2 * like->n_div);
2692 for (i = 0; i < like->n_div; ++i) {
2693 if (isl_int_is_zero(bmap->div[i][0]))
2695 if (isl_basic_map_add_div_constraints(bmap, i) < 0)
2699 isl_basic_map_free(like);
2700 bmap = isl_basic_map_simplify(bmap);
2701 bmap = isl_basic_map_finalize(bmap);
2704 isl_basic_map_free(like);
2705 isl_basic_set_free(bset);
2709 struct isl_basic_set *isl_basic_set_from_underlying_set(
2710 struct isl_basic_set *bset, struct isl_basic_set *like)
2712 return (struct isl_basic_set *)
2713 isl_basic_map_overlying_set(bset, (struct isl_basic_map *)like);
2716 struct isl_set *isl_set_from_underlying_set(
2717 struct isl_set *set, struct isl_basic_set *like)
2723 isl_assert(set->ctx, set->dim->n_out == isl_basic_set_total_dim(like),
2725 if (isl_dim_equal(set->dim, like->dim) && like->n_div == 0) {
2726 isl_basic_set_free(like);
2729 set = isl_set_cow(set);
2732 for (i = 0; i < set->n; ++i) {
2733 set->p[i] = isl_basic_set_from_underlying_set(set->p[i],
2734 isl_basic_set_copy(like));
2738 isl_dim_free(set->dim);
2739 set->dim = isl_dim_copy(like->dim);
2742 isl_basic_set_free(like);
2745 isl_basic_set_free(like);
2750 struct isl_set *isl_map_underlying_set(struct isl_map *map)
2754 map = isl_map_cow(map);
2757 map->dim = isl_dim_cow(map->dim);
2761 for (i = 1; i < map->n; ++i)
2762 isl_assert(map->ctx, map->p[0]->n_div == map->p[i]->n_div,
2764 for (i = 0; i < map->n; ++i) {
2765 map->p[i] = (struct isl_basic_map *)
2766 isl_basic_map_underlying_set(map->p[i]);
2771 map->dim = isl_dim_underlying(map->dim, 0);
2773 isl_dim_free(map->dim);
2774 map->dim = isl_dim_copy(map->p[0]->dim);
2778 return (struct isl_set *)map;
2784 struct isl_set *isl_set_to_underlying_set(struct isl_set *set)
2786 return (struct isl_set *)isl_map_underlying_set((struct isl_map *)set);
2789 struct isl_basic_set *isl_basic_map_domain(struct isl_basic_map *bmap)
2791 struct isl_basic_set *domain;
2796 n_in = isl_basic_map_n_in(bmap);
2797 n_out = isl_basic_map_n_out(bmap);
2798 domain = isl_basic_set_from_basic_map(bmap);
2799 return isl_basic_set_project_out(domain, isl_dim_set, n_in, n_out);
2802 struct isl_basic_set *isl_basic_map_range(struct isl_basic_map *bmap)
2804 return isl_basic_map_domain(isl_basic_map_reverse(bmap));
2807 struct isl_set *isl_map_range(struct isl_map *map)
2810 struct isl_set *set;
2814 map = isl_map_cow(map);
2818 set = (struct isl_set *) map;
2819 if (set->dim->n_in != 0) {
2820 set->dim = isl_dim_drop_inputs(set->dim, 0, set->dim->n_in);
2824 for (i = 0; i < map->n; ++i) {
2825 set->p[i] = isl_basic_map_range(map->p[i]);
2829 ISL_F_CLR(set, ISL_MAP_DISJOINT);
2830 ISL_F_CLR(set, ISL_SET_NORMALIZED);
2837 struct isl_map *isl_map_from_set(struct isl_set *set, struct isl_dim *dim)
2840 struct isl_map *map = NULL;
2842 set = isl_set_cow(set);
2845 isl_assert(set->ctx, isl_dim_compatible(set->dim, dim), goto error);
2846 map = (struct isl_map *)set;
2847 for (i = 0; i < set->n; ++i) {
2848 map->p[i] = isl_basic_map_from_basic_set(
2849 set->p[i], isl_dim_copy(dim));
2853 isl_dim_free(map->dim);
2862 struct isl_map *isl_map_from_range(struct isl_set *set)
2864 return (struct isl_map *)set;
2867 __isl_give isl_map *isl_map_from_domain(__isl_take isl_set *set)
2869 return isl_map_reverse(isl_map_from_range(set));;
2872 __isl_give isl_map *isl_map_from_domain_and_range(__isl_take isl_set *domain,
2873 __isl_take isl_set *range)
2875 return isl_map_product(isl_map_from_domain(domain),
2876 isl_map_from_range(range));
2879 struct isl_set *isl_set_from_map(struct isl_map *map)
2882 struct isl_set *set = NULL;
2886 map = isl_map_cow(map);
2889 map->dim = isl_dim_cow(map->dim);
2892 map->dim->n_out += map->dim->n_in;
2894 set = (struct isl_set *)map;
2895 for (i = 0; i < map->n; ++i) {
2896 set->p[i] = isl_basic_set_from_basic_map(map->p[i]);
2906 struct isl_map *isl_map_alloc_dim(struct isl_dim *dim, int n, unsigned flags)
2908 struct isl_map *map;
2912 isl_assert(dim->ctx, n >= 0, return NULL);
2913 map = isl_alloc(dim->ctx, struct isl_map,
2914 sizeof(struct isl_map) +
2915 (n - 1) * sizeof(struct isl_basic_map *));
2919 map->ctx = dim->ctx;
2920 isl_ctx_ref(map->ctx);
2932 struct isl_map *isl_map_alloc(struct isl_ctx *ctx,
2933 unsigned nparam, unsigned in, unsigned out, int n,
2936 struct isl_map *map;
2937 struct isl_dim *dims;
2939 dims = isl_dim_alloc(ctx, nparam, in, out);
2943 map = isl_map_alloc_dim(dims, n, flags);
2947 struct isl_basic_map *isl_basic_map_empty(struct isl_dim *dim)
2949 struct isl_basic_map *bmap;
2950 bmap = isl_basic_map_alloc_dim(dim, 0, 1, 0);
2951 bmap = isl_basic_map_set_to_empty(bmap);
2955 struct isl_basic_set *isl_basic_set_empty(struct isl_dim *dim)
2957 struct isl_basic_set *bset;
2958 bset = isl_basic_set_alloc_dim(dim, 0, 1, 0);
2959 bset = isl_basic_set_set_to_empty(bset);
2963 struct isl_basic_map *isl_basic_map_empty_like(struct isl_basic_map *model)
2965 struct isl_basic_map *bmap;
2968 bmap = isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
2969 bmap = isl_basic_map_set_to_empty(bmap);
2973 struct isl_basic_map *isl_basic_map_empty_like_map(struct isl_map *model)
2975 struct isl_basic_map *bmap;
2978 bmap = isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
2979 bmap = isl_basic_map_set_to_empty(bmap);
2983 struct isl_basic_set *isl_basic_set_empty_like(struct isl_basic_set *model)
2985 struct isl_basic_set *bset;
2988 bset = isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
2989 bset = isl_basic_set_set_to_empty(bset);
2993 struct isl_basic_map *isl_basic_map_universe(struct isl_dim *dim)
2995 struct isl_basic_map *bmap;
2996 bmap = isl_basic_map_alloc_dim(dim, 0, 0, 0);
3000 struct isl_basic_set *isl_basic_set_universe(struct isl_dim *dim)
3002 struct isl_basic_set *bset;
3003 bset = isl_basic_set_alloc_dim(dim, 0, 0, 0);
3007 __isl_give isl_basic_map *isl_basic_map_universe_like(
3008 __isl_keep isl_basic_map *model)
3012 return isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
3015 struct isl_basic_set *isl_basic_set_universe_like(struct isl_basic_set *model)
3019 return isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
3022 __isl_give isl_basic_set *isl_basic_set_universe_like_set(
3023 __isl_keep isl_set *model)
3027 return isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
3030 struct isl_map *isl_map_empty(struct isl_dim *dim)
3032 return isl_map_alloc_dim(dim, 0, ISL_MAP_DISJOINT);
3035 struct isl_map *isl_map_empty_like(struct isl_map *model)
3039 return isl_map_alloc_dim(isl_dim_copy(model->dim), 0, ISL_MAP_DISJOINT);
3042 struct isl_map *isl_map_empty_like_basic_map(struct isl_basic_map *model)
3046 return isl_map_alloc_dim(isl_dim_copy(model->dim), 0, ISL_MAP_DISJOINT);
3049 struct isl_set *isl_set_empty(struct isl_dim *dim)
3051 return isl_set_alloc_dim(dim, 0, ISL_MAP_DISJOINT);
3054 struct isl_set *isl_set_empty_like(struct isl_set *model)
3058 return isl_set_empty(isl_dim_copy(model->dim));
3061 struct isl_map *isl_map_universe(struct isl_dim *dim)
3063 struct isl_map *map;
3066 map = isl_map_alloc_dim(isl_dim_copy(dim), 1, ISL_MAP_DISJOINT);
3067 map = isl_map_add(map, isl_basic_map_universe(dim));
3071 struct isl_set *isl_set_universe(struct isl_dim *dim)
3073 struct isl_set *set;
3076 set = isl_set_alloc_dim(isl_dim_copy(dim), 1, ISL_MAP_DISJOINT);
3077 set = isl_set_add(set, isl_basic_set_universe(dim));
3081 __isl_give isl_set *isl_set_universe_like(__isl_keep isl_set *model)
3085 return isl_set_universe(isl_dim_copy(model->dim));
3088 struct isl_map *isl_map_dup(struct isl_map *map)
3091 struct isl_map *dup;
3095 dup = isl_map_alloc_dim(isl_dim_copy(map->dim), map->n, map->flags);
3096 for (i = 0; i < map->n; ++i)
3097 dup = isl_map_add(dup, isl_basic_map_copy(map->p[i]));
3101 struct isl_map *isl_map_add(struct isl_map *map, struct isl_basic_map *bmap)
3105 if (isl_basic_map_fast_is_empty(bmap)) {
3106 isl_basic_map_free(bmap);
3109 isl_assert(map->ctx, isl_dim_equal(map->dim, bmap->dim), goto error);
3110 isl_assert(map->ctx, map->n < map->size, goto error);
3111 map->p[map->n] = bmap;
3113 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3119 isl_basic_map_free(bmap);
3123 void isl_map_free(struct isl_map *map)
3133 isl_ctx_deref(map->ctx);
3134 for (i = 0; i < map->n; ++i)
3135 isl_basic_map_free(map->p[i]);
3136 isl_dim_free(map->dim);
3140 struct isl_map *isl_map_extend(struct isl_map *base,
3141 unsigned nparam, unsigned n_in, unsigned n_out)
3145 base = isl_map_cow(base);
3149 base->dim = isl_dim_extend(base->dim, nparam, n_in, n_out);
3152 for (i = 0; i < base->n; ++i) {
3153 base->p[i] = isl_basic_map_extend_dim(base->p[i],
3154 isl_dim_copy(base->dim), 0, 0, 0);
3164 struct isl_set *isl_set_extend(struct isl_set *base,
3165 unsigned nparam, unsigned dim)
3167 return (struct isl_set *)isl_map_extend((struct isl_map *)base,
3171 static struct isl_basic_map *isl_basic_map_fix_pos_si(
3172 struct isl_basic_map *bmap, unsigned pos, int value)
3176 bmap = isl_basic_map_cow(bmap);
3177 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
3178 j = isl_basic_map_alloc_equality(bmap);
3181 isl_seq_clr(bmap->eq[j] + 1, isl_basic_map_total_dim(bmap));
3182 isl_int_set_si(bmap->eq[j][pos], -1);
3183 isl_int_set_si(bmap->eq[j][0], value);
3184 bmap = isl_basic_map_simplify(bmap);
3185 return isl_basic_map_finalize(bmap);
3187 isl_basic_map_free(bmap);
3191 static __isl_give isl_basic_map *isl_basic_map_fix_pos(
3192 __isl_take isl_basic_map *bmap, unsigned pos, isl_int value)
3196 bmap = isl_basic_map_cow(bmap);
3197 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
3198 j = isl_basic_map_alloc_equality(bmap);
3201 isl_seq_clr(bmap->eq[j] + 1, isl_basic_map_total_dim(bmap));
3202 isl_int_set_si(bmap->eq[j][pos], -1);
3203 isl_int_set(bmap->eq[j][0], value);
3204 bmap = isl_basic_map_simplify(bmap);
3205 return isl_basic_map_finalize(bmap);
3207 isl_basic_map_free(bmap);
3211 struct isl_basic_map *isl_basic_map_fix_si(struct isl_basic_map *bmap,
3212 enum isl_dim_type type, unsigned pos, int value)
3216 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
3217 return isl_basic_map_fix_pos_si(bmap,
3218 isl_basic_map_offset(bmap, type) + pos, value);
3220 isl_basic_map_free(bmap);
3224 __isl_give isl_basic_map *isl_basic_map_fix(__isl_take isl_basic_map *bmap,
3225 enum isl_dim_type type, unsigned pos, isl_int value)
3229 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
3230 return isl_basic_map_fix_pos(bmap,
3231 isl_basic_map_offset(bmap, type) + pos, value);
3233 isl_basic_map_free(bmap);
3237 struct isl_basic_set *isl_basic_set_fix_si(struct isl_basic_set *bset,
3238 enum isl_dim_type type, unsigned pos, int value)
3240 return (struct isl_basic_set *)
3241 isl_basic_map_fix_si((struct isl_basic_map *)bset,
3245 __isl_give isl_basic_set *isl_basic_set_fix(__isl_take isl_basic_set *bset,
3246 enum isl_dim_type type, unsigned pos, isl_int value)
3248 return (struct isl_basic_set *)
3249 isl_basic_map_fix((struct isl_basic_map *)bset,
3253 struct isl_basic_map *isl_basic_map_fix_input_si(struct isl_basic_map *bmap,
3254 unsigned input, int value)
3256 return isl_basic_map_fix_si(bmap, isl_dim_in, input, value);
3259 struct isl_basic_set *isl_basic_set_fix_dim_si(struct isl_basic_set *bset,
3260 unsigned dim, int value)
3262 return (struct isl_basic_set *)
3263 isl_basic_map_fix_si((struct isl_basic_map *)bset,
3264 isl_dim_set, dim, value);
3267 struct isl_map *isl_map_fix_si(struct isl_map *map,
3268 enum isl_dim_type type, unsigned pos, int value)
3272 map = isl_map_cow(map);
3276 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
3277 for (i = 0; i < map->n; ++i) {
3278 map->p[i] = isl_basic_map_fix_si(map->p[i], type, pos, value);
3282 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3289 __isl_give isl_map *isl_map_fix(__isl_take isl_map *map,
3290 enum isl_dim_type type, unsigned pos, isl_int value)
3294 map = isl_map_cow(map);
3298 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
3299 for (i = 0; i < map->n; ++i) {
3300 map->p[i] = isl_basic_map_fix(map->p[i], type, pos, value);
3304 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3311 __isl_give isl_set *isl_set_fix(__isl_take isl_set *set,
3312 enum isl_dim_type type, unsigned pos, isl_int value)
3314 return (struct isl_set *)isl_map_fix((isl_map *)set, type, pos, value);
3317 struct isl_map *isl_map_fix_input_si(struct isl_map *map,
3318 unsigned input, int value)
3320 return isl_map_fix_si(map, isl_dim_in, input, value);
3323 struct isl_set *isl_set_fix_dim_si(struct isl_set *set, unsigned dim, int value)
3325 return (struct isl_set *)
3326 isl_map_fix_si((struct isl_map *)set, isl_dim_set, dim, value);
3329 struct isl_basic_set *isl_basic_set_lower_bound_dim(struct isl_basic_set *bset,
3330 unsigned dim, isl_int value)
3334 bset = isl_basic_set_cow(bset);
3335 bset = isl_basic_set_extend_constraints(bset, 0, 1);
3336 j = isl_basic_set_alloc_inequality(bset);
3339 isl_seq_clr(bset->ineq[j], 1 + isl_basic_set_total_dim(bset));
3340 isl_int_set_si(bset->ineq[j][1 + isl_basic_set_n_param(bset) + dim], 1);
3341 isl_int_neg(bset->ineq[j][0], value);
3342 bset = isl_basic_set_simplify(bset);
3343 return isl_basic_set_finalize(bset);
3345 isl_basic_set_free(bset);
3349 struct isl_set *isl_set_lower_bound_dim(struct isl_set *set, unsigned dim,
3354 set = isl_set_cow(set);
3358 isl_assert(set->ctx, dim < isl_set_n_dim(set), goto error);
3359 for (i = 0; i < set->n; ++i) {
3360 set->p[i] = isl_basic_set_lower_bound_dim(set->p[i], dim, value);
3370 struct isl_map *isl_map_reverse(struct isl_map *map)
3374 map = isl_map_cow(map);
3378 map->dim = isl_dim_reverse(map->dim);
3381 for (i = 0; i < map->n; ++i) {
3382 map->p[i] = isl_basic_map_reverse(map->p[i]);
3386 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3393 static struct isl_map *isl_basic_map_partial_lexopt(
3394 struct isl_basic_map *bmap, struct isl_basic_set *dom,
3395 struct isl_set **empty, int max)
3399 if (bmap->ctx->opt->pip == ISL_PIP_PIP)
3400 return isl_pip_basic_map_lexopt(bmap, dom, empty, max);
3402 return isl_tab_basic_map_partial_lexopt(bmap, dom, empty, max);
3404 isl_basic_map_free(bmap);
3405 isl_basic_set_free(dom);
3411 struct isl_map *isl_basic_map_partial_lexmax(
3412 struct isl_basic_map *bmap, struct isl_basic_set *dom,
3413 struct isl_set **empty)
3415 return isl_basic_map_partial_lexopt(bmap, dom, empty, 1);
3418 struct isl_map *isl_basic_map_partial_lexmin(
3419 struct isl_basic_map *bmap, struct isl_basic_set *dom,
3420 struct isl_set **empty)
3422 return isl_basic_map_partial_lexopt(bmap, dom, empty, 0);
3425 struct isl_set *isl_basic_set_partial_lexmin(
3426 struct isl_basic_set *bset, struct isl_basic_set *dom,
3427 struct isl_set **empty)
3429 return (struct isl_set *)
3430 isl_basic_map_partial_lexmin((struct isl_basic_map *)bset,
3434 struct isl_set *isl_basic_set_partial_lexmax(
3435 struct isl_basic_set *bset, struct isl_basic_set *dom,
3436 struct isl_set **empty)
3438 return (struct isl_set *)
3439 isl_basic_map_partial_lexmax((struct isl_basic_map *)bset,
3443 /* Given a basic map "bmap", compute the lexicograhically minimal
3444 * (or maximal) image element for each domain element in dom.
3445 * Set *empty to those elements in dom that do not have an image element.
3447 * We first make sure the basic sets in dom are disjoint and then
3448 * simply collect the results over each of the basic sets separately.
3449 * We could probably improve the efficiency a bit by moving the union
3450 * domain down into the parametric integer programming.
3452 static __isl_give isl_map *basic_map_partial_lexopt(
3453 __isl_take isl_basic_map *bmap, __isl_take isl_set *dom,
3454 __isl_give isl_set **empty, int max)
3457 struct isl_map *res;
3459 dom = isl_set_make_disjoint(dom);
3463 if (isl_set_fast_is_empty(dom)) {
3464 res = isl_map_empty_like_basic_map(bmap);
3465 *empty = isl_set_empty_like(dom);
3467 isl_basic_map_free(bmap);
3471 res = isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap),
3472 isl_basic_set_copy(dom->p[0]), empty, max);
3474 for (i = 1; i < dom->n; ++i) {
3475 struct isl_map *res_i;
3476 struct isl_set *empty_i;
3478 res_i = isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap),
3479 isl_basic_set_copy(dom->p[i]), &empty_i, max);
3481 res = isl_map_union_disjoint(res, res_i);
3482 *empty = isl_set_union_disjoint(*empty, empty_i);
3486 isl_basic_map_free(bmap);
3491 isl_basic_map_free(bmap);
3495 /* Given a map "map", compute the lexicograhically minimal
3496 * (or maximal) image element for each domain element in dom.
3497 * Set *empty to those elements in dom that do not have an image element.
3499 * We first compute the lexicographically minimal or maximal element
3500 * in the first basic map. This results in a partial solution "res"
3501 * and a subset "todo" of dom that still need to be handled.
3502 * We then consider each of the remaining maps in "map" and successively
3503 * improve both "res" and "todo".
3505 * Let res^k and todo^k be the results after k steps and let i = k + 1.
3506 * Assume we are computing the lexicographical maximum.
3507 * We first intersect basic map i with a relation that maps elements
3508 * to elements that are lexicographically larger than the image elements
3509 * in res^k and the compute the maximum image element of this intersection.
3510 * The result ("better") corresponds to those image elements in basic map i
3511 * that are better than what we had before. The remainder ("keep") are the
3512 * domain elements for which the image element in res_k was better.
3513 * We also compute the lexicographical maximum of basic map i in todo^k.
3514 * res^i is the result of the operation + better + those elements in
3515 * res^k that we should keep
3516 * todo^i is the remainder of the maximum operation on todo^k.
3518 static __isl_give isl_map *isl_map_partial_lexopt(
3519 __isl_take isl_map *map, __isl_take isl_set *dom,
3520 __isl_give isl_set **empty, int max)
3523 struct isl_map *res;
3524 struct isl_set *todo;
3529 if (isl_map_fast_is_empty(map)) {
3537 res = basic_map_partial_lexopt(isl_basic_map_copy(map->p[0]),
3538 isl_set_copy(dom), &todo, max);
3540 for (i = 1; i < map->n; ++i) {
3542 struct isl_map *better;
3543 struct isl_set *keep;
3544 struct isl_map *res_i;
3545 struct isl_set *todo_i;
3546 struct isl_dim *dim = isl_map_get_dim(res);
3548 dim = isl_dim_range(dim);
3550 lt = isl_map_lex_lt(dim);
3552 lt = isl_map_lex_gt(dim);
3553 lt = isl_map_apply_range(isl_map_copy(res), lt);
3554 lt = isl_map_intersect(lt,
3555 isl_map_from_basic_map(isl_basic_map_copy(map->p[i])));
3556 better = isl_map_partial_lexopt(lt,
3557 isl_map_domain(isl_map_copy(res)),
3560 res_i = basic_map_partial_lexopt(isl_basic_map_copy(map->p[i]),
3561 todo, &todo_i, max);
3563 res = isl_map_intersect_domain(res, keep);
3564 res = isl_map_union_disjoint(res, res_i);
3565 res = isl_map_union_disjoint(res, better);
3586 __isl_give isl_map *isl_map_partial_lexmax(
3587 __isl_take isl_map *map, __isl_take isl_set *dom,
3588 __isl_give isl_set **empty)
3590 return isl_map_partial_lexopt(map, dom, empty, 1);
3593 __isl_give isl_map *isl_map_partial_lexmin(
3594 __isl_take isl_map *map, __isl_take isl_set *dom,
3595 __isl_give isl_set **empty)
3597 return isl_map_partial_lexopt(map, dom, empty, 0);
3600 __isl_give isl_set *isl_set_partial_lexmin(
3601 __isl_take isl_set *set, __isl_take isl_set *dom,
3602 __isl_give isl_set **empty)
3604 return (struct isl_set *)
3605 isl_map_partial_lexmin((struct isl_map *)set,
3609 __isl_give isl_set *isl_set_partial_lexmax(
3610 __isl_take isl_set *set, __isl_take isl_set *dom,
3611 __isl_give isl_set **empty)
3613 return (struct isl_set *)
3614 isl_map_partial_lexmax((struct isl_map *)set,
3618 __isl_give isl_map *isl_basic_map_lexopt(__isl_take isl_basic_map *bmap, int max)
3620 struct isl_basic_set *dom = NULL;
3621 struct isl_dim *dom_dim;
3625 dom_dim = isl_dim_domain(isl_dim_copy(bmap->dim));
3626 dom = isl_basic_set_universe(dom_dim);
3627 return isl_basic_map_partial_lexopt(bmap, dom, NULL, max);
3629 isl_basic_map_free(bmap);
3633 __isl_give isl_map *isl_basic_map_lexmin(__isl_take isl_basic_map *bmap)
3635 return isl_basic_map_lexopt(bmap, 0);
3638 __isl_give isl_map *isl_basic_map_lexmax(__isl_take isl_basic_map *bmap)
3640 return isl_basic_map_lexopt(bmap, 1);
3643 __isl_give isl_set *isl_basic_set_lexmin(__isl_take isl_basic_set *bset)
3645 return (isl_set *)isl_basic_map_lexmin((isl_basic_map *)bset);
3648 __isl_give isl_set *isl_basic_set_lexmax(__isl_take isl_basic_set *bset)
3650 return (isl_set *)isl_basic_map_lexmax((isl_basic_map *)bset);
3653 __isl_give isl_map *isl_map_lexopt(__isl_take isl_map *map, int max)
3655 struct isl_set *dom = NULL;
3656 struct isl_dim *dom_dim;
3660 dom_dim = isl_dim_domain(isl_dim_copy(map->dim));
3661 dom = isl_set_universe(dom_dim);
3662 return isl_map_partial_lexopt(map, dom, NULL, max);
3668 __isl_give isl_map *isl_map_lexmin(__isl_take isl_map *map)
3670 return isl_map_lexopt(map, 0);
3673 __isl_give isl_map *isl_map_lexmax(__isl_take isl_map *map)
3675 return isl_map_lexopt(map, 1);
3678 __isl_give isl_set *isl_set_lexmin(__isl_take isl_set *set)
3680 return (isl_set *)isl_map_lexmin((isl_map *)set);
3683 __isl_give isl_set *isl_set_lexmax(__isl_take isl_set *set)
3685 return (isl_set *)isl_map_lexmax((isl_map *)set);
3688 static struct isl_map *isl_map_reset_dim(struct isl_map *map,
3689 struct isl_dim *dim)
3696 for (i = 0; i < map->n; ++i) {
3697 isl_dim_free(map->p[i]->dim);
3698 map->p[i]->dim = isl_dim_copy(dim);
3700 isl_dim_free(map->dim);
3710 static struct isl_set *isl_set_reset_dim(struct isl_set *set,
3711 struct isl_dim *dim)
3713 return (struct isl_set *) isl_map_reset_dim((struct isl_map *)set, dim);
3716 /* Apply a preimage specified by "mat" on the parameters of "bset".
3717 * bset is assumed to have only parameters and divs.
3719 static struct isl_basic_set *basic_set_parameter_preimage(
3720 struct isl_basic_set *bset, struct isl_mat *mat)
3727 bset->dim = isl_dim_cow(bset->dim);
3731 nparam = isl_basic_set_dim(bset, isl_dim_param);
3733 isl_assert(bset->ctx, mat->n_row == 1 + nparam, goto error);
3735 bset->dim->nparam = 0;
3736 bset->dim->n_out = nparam;
3737 bset = isl_basic_set_preimage(bset, mat);
3739 bset->dim->nparam = bset->dim->n_out;
3740 bset->dim->n_out = 0;
3745 isl_basic_set_free(bset);
3749 /* Apply a preimage specified by "mat" on the parameters of "set".
3750 * set is assumed to have only parameters and divs.
3752 static struct isl_set *set_parameter_preimage(
3753 struct isl_set *set, struct isl_mat *mat)
3755 struct isl_dim *dim = NULL;
3761 dim = isl_dim_copy(set->dim);
3762 dim = isl_dim_cow(dim);
3766 nparam = isl_set_dim(set, isl_dim_param);
3768 isl_assert(set->ctx, mat->n_row == 1 + nparam, goto error);
3771 dim->n_out = nparam;
3772 isl_set_reset_dim(set, dim);
3773 set = isl_set_preimage(set, mat);
3776 dim = isl_dim_copy(set->dim);
3777 dim = isl_dim_cow(dim);
3780 dim->nparam = dim->n_out;
3782 isl_set_reset_dim(set, dim);
3792 /* Intersect the basic set "bset" with the affine space specified by the
3793 * equalities in "eq".
3795 static struct isl_basic_set *basic_set_append_equalities(
3796 struct isl_basic_set *bset, struct isl_mat *eq)
3804 bset = isl_basic_set_extend_dim(bset, isl_dim_copy(bset->dim), 0,
3809 len = 1 + isl_dim_total(bset->dim) + bset->extra;
3810 for (i = 0; i < eq->n_row; ++i) {
3811 k = isl_basic_set_alloc_equality(bset);
3814 isl_seq_cpy(bset->eq[k], eq->row[i], eq->n_col);
3815 isl_seq_clr(bset->eq[k] + eq->n_col, len - eq->n_col);
3822 isl_basic_set_free(bset);
3826 /* Intersect the set "set" with the affine space specified by the
3827 * equalities in "eq".
3829 static struct isl_set *set_append_equalities(struct isl_set *set,
3837 for (i = 0; i < set->n; ++i) {
3838 set->p[i] = basic_set_append_equalities(set->p[i],
3851 /* Project the given basic set onto its parameter domain, possibly introducing
3852 * new, explicit, existential variables in the constraints.
3853 * The input has parameters and (possibly implicit) existential variables.
3854 * The output has the same parameters, but only
3855 * explicit existentially quantified variables.
3857 * The actual projection is performed by pip, but pip doesn't seem
3858 * to like equalities very much, so we first remove the equalities
3859 * among the parameters by performing a variable compression on
3860 * the parameters. Afterward, an inverse transformation is performed
3861 * and the equalities among the parameters are inserted back in.
3863 static struct isl_set *parameter_compute_divs(struct isl_basic_set *bset)
3867 struct isl_mat *T, *T2;
3868 struct isl_set *set;
3869 unsigned nparam, n_div;
3871 bset = isl_basic_set_cow(bset);
3875 if (bset->n_eq == 0)
3876 return isl_basic_set_lexmin(bset);
3878 isl_basic_set_gauss(bset, NULL);
3880 nparam = isl_basic_set_dim(bset, isl_dim_param);
3881 n_div = isl_basic_set_dim(bset, isl_dim_div);
3883 for (i = 0, j = n_div - 1; i < bset->n_eq && j >= 0; --j) {
3884 if (!isl_int_is_zero(bset->eq[i][1 + nparam + j]))
3887 if (i == bset->n_eq)
3888 return isl_basic_set_lexmin(bset);
3890 eq = isl_mat_sub_alloc(bset->ctx, bset->eq, i, bset->n_eq - i,
3892 eq = isl_mat_cow(eq);
3893 T = isl_mat_variable_compression(isl_mat_copy(eq), &T2);
3894 bset = basic_set_parameter_preimage(bset, T);
3896 set = isl_basic_set_lexmin(bset);
3897 set = set_parameter_preimage(set, T2);
3898 set = set_append_equalities(set, eq);
3902 /* Compute an explicit representation for all the existentially
3903 * quantified variables.
3904 * The input and output dimensions are first turned into parameters.
3905 * compute_divs then returns a map with the same parameters and
3906 * no input or output dimensions and the dimension specification
3907 * is reset to that of the input.
3909 static struct isl_map *compute_divs(struct isl_basic_map *bmap)
3911 struct isl_basic_set *bset;
3912 struct isl_set *set;
3913 struct isl_map *map;
3914 struct isl_dim *dim, *orig_dim = NULL;
3919 bmap = isl_basic_map_cow(bmap);
3923 nparam = isl_basic_map_dim(bmap, isl_dim_param);
3924 n_in = isl_basic_map_dim(bmap, isl_dim_in);
3925 n_out = isl_basic_map_dim(bmap, isl_dim_out);
3926 dim = isl_dim_set_alloc(bmap->ctx, nparam + n_in + n_out, 0);
3930 orig_dim = bmap->dim;
3932 bset = (struct isl_basic_set *)bmap;
3934 set = parameter_compute_divs(bset);
3935 map = (struct isl_map *)set;
3936 map = isl_map_reset_dim(map, orig_dim);
3940 isl_basic_map_free(bmap);
3944 static int basic_map_divs_known(__isl_keep isl_basic_map *bmap)
3952 off = isl_dim_total(bmap->dim);
3953 for (i = 0; i < bmap->n_div; ++i) {
3954 if (isl_int_is_zero(bmap->div[i][0]))
3956 isl_assert(bmap->ctx, isl_int_is_zero(bmap->div[i][1+1+off+i]),
3962 static int map_divs_known(__isl_keep isl_map *map)
3969 for (i = 0; i < map->n; ++i) {
3970 int known = basic_map_divs_known(map->p[i]);
3978 /* If bmap contains any unknown divs, then compute explicit
3979 * expressions for them. However, this computation may be
3980 * quite expensive, so first try to remove divs that aren't
3983 struct isl_map *isl_basic_map_compute_divs(struct isl_basic_map *bmap)
3987 struct isl_map *map;
3989 known = basic_map_divs_known(bmap);
3993 return isl_map_from_basic_map(bmap);
3995 bmap = isl_basic_map_drop_redundant_divs(bmap);
3997 known = basic_map_divs_known(bmap);
4001 return isl_map_from_basic_map(bmap);
4003 map = compute_divs(bmap);
4006 isl_basic_map_free(bmap);
4010 struct isl_map *isl_map_compute_divs(struct isl_map *map)
4014 struct isl_map *res;
4021 known = map_divs_known(map);
4029 res = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[0]));
4030 for (i = 1 ; i < map->n; ++i) {
4032 r2 = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[i]));
4033 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT))
4034 res = isl_map_union_disjoint(res, r2);
4036 res = isl_map_union(res, r2);
4043 struct isl_set *isl_basic_set_compute_divs(struct isl_basic_set *bset)
4045 return (struct isl_set *)
4046 isl_basic_map_compute_divs((struct isl_basic_map *)bset);
4049 struct isl_set *isl_set_compute_divs(struct isl_set *set)
4051 return (struct isl_set *)
4052 isl_map_compute_divs((struct isl_map *)set);
4055 struct isl_set *isl_map_domain(struct isl_map *map)
4058 struct isl_set *set;
4063 map = isl_map_cow(map);
4067 set = (struct isl_set *)map;
4068 set->dim = isl_dim_domain(set->dim);
4071 for (i = 0; i < map->n; ++i) {
4072 set->p[i] = isl_basic_map_domain(map->p[i]);
4076 ISL_F_CLR(set, ISL_MAP_DISJOINT);
4077 ISL_F_CLR(set, ISL_SET_NORMALIZED);
4084 struct isl_map *isl_map_union_disjoint(
4085 struct isl_map *map1, struct isl_map *map2)
4089 struct isl_map *map = NULL;
4103 isl_assert(map1->ctx, isl_dim_equal(map1->dim, map2->dim), goto error);
4105 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
4106 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
4107 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
4109 map = isl_map_alloc_dim(isl_dim_copy(map1->dim),
4110 map1->n + map2->n, flags);
4113 for (i = 0; i < map1->n; ++i) {
4114 map = isl_map_add(map,
4115 isl_basic_map_copy(map1->p[i]));
4119 for (i = 0; i < map2->n; ++i) {
4120 map = isl_map_add(map,
4121 isl_basic_map_copy(map2->p[i]));
4135 struct isl_map *isl_map_union(struct isl_map *map1, struct isl_map *map2)
4137 map1 = isl_map_union_disjoint(map1, map2);
4141 ISL_F_CLR(map1, ISL_MAP_DISJOINT);
4145 struct isl_set *isl_set_union_disjoint(
4146 struct isl_set *set1, struct isl_set *set2)
4148 return (struct isl_set *)
4149 isl_map_union_disjoint(
4150 (struct isl_map *)set1, (struct isl_map *)set2);
4153 struct isl_set *isl_set_union(struct isl_set *set1, struct isl_set *set2)
4155 return (struct isl_set *)
4156 isl_map_union((struct isl_map *)set1, (struct isl_map *)set2);
4159 struct isl_map *isl_map_intersect_range(
4160 struct isl_map *map, struct isl_set *set)
4163 struct isl_map *result;
4169 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT) &&
4170 ISL_F_ISSET(set, ISL_MAP_DISJOINT))
4171 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
4173 result = isl_map_alloc_dim(isl_dim_copy(map->dim),
4174 map->n * set->n, flags);
4177 for (i = 0; i < map->n; ++i)
4178 for (j = 0; j < set->n; ++j) {
4179 result = isl_map_add(result,
4180 isl_basic_map_intersect_range(
4181 isl_basic_map_copy(map->p[i]),
4182 isl_basic_set_copy(set->p[j])));
4195 struct isl_map *isl_map_intersect_domain(
4196 struct isl_map *map, struct isl_set *set)
4198 return isl_map_reverse(
4199 isl_map_intersect_range(isl_map_reverse(map), set));
4202 struct isl_map *isl_map_apply_domain(
4203 struct isl_map *map1, struct isl_map *map2)
4207 map1 = isl_map_reverse(map1);
4208 map1 = isl_map_apply_range(map1, map2);
4209 return isl_map_reverse(map1);
4216 struct isl_map *isl_map_apply_range(
4217 struct isl_map *map1, struct isl_map *map2)
4219 struct isl_dim *dim_result;
4220 struct isl_map *result;
4226 dim_result = isl_dim_join(isl_dim_copy(map1->dim),
4227 isl_dim_copy(map2->dim));
4229 result = isl_map_alloc_dim(dim_result, map1->n * map2->n, 0);
4232 for (i = 0; i < map1->n; ++i)
4233 for (j = 0; j < map2->n; ++j) {
4234 result = isl_map_add(result,
4235 isl_basic_map_apply_range(
4236 isl_basic_map_copy(map1->p[i]),
4237 isl_basic_map_copy(map2->p[j])));
4243 if (result && result->n <= 1)
4244 ISL_F_SET(result, ISL_MAP_DISJOINT);
4253 * returns range - domain
4255 struct isl_basic_set *isl_basic_map_deltas(struct isl_basic_map *bmap)
4257 struct isl_basic_set *bset;
4264 dim = isl_basic_map_n_in(bmap);
4265 nparam = isl_basic_map_n_param(bmap);
4266 isl_assert(bmap->ctx, dim == isl_basic_map_n_out(bmap), goto error);
4267 bset = isl_basic_set_from_basic_map(bmap);
4268 bset = isl_basic_set_cow(bset);
4269 bset = isl_basic_set_extend(bset, nparam, 3*dim, 0, dim, 0);
4270 bset = isl_basic_set_swap_vars(bset, 2*dim);
4271 for (i = 0; i < dim; ++i) {
4272 int j = isl_basic_map_alloc_equality(
4273 (struct isl_basic_map *)bset);
4276 isl_seq_clr(bset->eq[j], 1 + isl_basic_set_total_dim(bset));
4277 isl_int_set_si(bset->eq[j][1+nparam+i], 1);
4278 isl_int_set_si(bset->eq[j][1+nparam+dim+i], 1);
4279 isl_int_set_si(bset->eq[j][1+nparam+2*dim+i], -1);
4281 return isl_basic_set_project_out(bset, isl_dim_set, dim, 2*dim);
4283 isl_basic_map_free(bmap);
4288 * returns range - domain
4290 struct isl_set *isl_map_deltas(struct isl_map *map)
4293 struct isl_set *result;
4298 isl_assert(map->ctx, isl_map_n_in(map) == isl_map_n_out(map), goto error);
4299 result = isl_set_alloc(map->ctx, isl_map_n_param(map),
4300 isl_map_n_in(map), map->n, map->flags);
4303 for (i = 0; i < map->n; ++i)
4304 result = isl_set_add(result,
4305 isl_basic_map_deltas(isl_basic_map_copy(map->p[i])));
4313 static struct isl_basic_map *basic_map_identity(struct isl_dim *dims)
4315 struct isl_basic_map *bmap;
4323 nparam = dims->nparam;
4325 bmap = isl_basic_map_alloc_dim(dims, 0, dim, 0);
4329 for (i = 0; i < dim; ++i) {
4330 int j = isl_basic_map_alloc_equality(bmap);
4333 isl_seq_clr(bmap->eq[j], 1 + isl_basic_map_total_dim(bmap));
4334 isl_int_set_si(bmap->eq[j][1+nparam+i], 1);
4335 isl_int_set_si(bmap->eq[j][1+nparam+dim+i], -1);
4337 return isl_basic_map_finalize(bmap);
4339 isl_basic_map_free(bmap);
4343 struct isl_basic_map *isl_basic_map_identity(struct isl_dim *set_dim)
4345 struct isl_dim *dim = isl_dim_map(set_dim);
4348 return basic_map_identity(dim);
4351 struct isl_basic_map *isl_basic_map_identity_like(struct isl_basic_map *model)
4353 if (!model || !model->dim)
4355 isl_assert(model->ctx,
4356 model->dim->n_in == model->dim->n_out, return NULL);
4357 return basic_map_identity(isl_dim_copy(model->dim));
4360 static struct isl_map *map_identity(struct isl_dim *dim)
4362 struct isl_map *map = isl_map_alloc_dim(dim, 1, ISL_MAP_DISJOINT);
4363 return isl_map_add(map, basic_map_identity(isl_dim_copy(dim)));
4366 struct isl_map *isl_map_identity(struct isl_dim *set_dim)
4368 struct isl_dim *dim = isl_dim_map(set_dim);
4371 return map_identity(dim);
4374 struct isl_map *isl_map_identity_like(struct isl_map *model)
4376 if (!model || !model->dim)
4378 isl_assert(model->ctx,
4379 model->dim->n_in == model->dim->n_out, return NULL);
4380 return map_identity(isl_dim_copy(model->dim));
4383 struct isl_map *isl_map_identity_like_basic_map(struct isl_basic_map *model)
4385 if (!model || !model->dim)
4387 isl_assert(model->ctx,
4388 model->dim->n_in == model->dim->n_out, return NULL);
4389 return map_identity(isl_dim_copy(model->dim));
4392 /* Construct a basic set with all set dimensions having only non-negative
4395 struct isl_basic_set *isl_basic_set_positive_orthant(struct isl_dim *dims)
4400 struct isl_basic_set *bset;
4404 nparam = dims->nparam;
4406 bset = isl_basic_set_alloc_dim(dims, 0, 0, dim);
4409 for (i = 0; i < dim; ++i) {
4410 int k = isl_basic_set_alloc_inequality(bset);
4413 isl_seq_clr(bset->ineq[k], 1 + isl_basic_set_total_dim(bset));
4414 isl_int_set_si(bset->ineq[k][1 + nparam + i], 1);
4418 isl_basic_set_free(bset);
4422 int isl_set_is_equal(struct isl_set *set1, struct isl_set *set2)
4424 return isl_map_is_equal((struct isl_map *)set1, (struct isl_map *)set2);
4427 int isl_basic_map_is_subset(
4428 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
4431 struct isl_map *map1;
4432 struct isl_map *map2;
4434 if (!bmap1 || !bmap2)
4437 map1 = isl_map_from_basic_map(isl_basic_map_copy(bmap1));
4438 map2 = isl_map_from_basic_map(isl_basic_map_copy(bmap2));
4440 is_subset = isl_map_is_subset(map1, map2);
4448 int isl_basic_map_is_equal(
4449 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
4453 if (!bmap1 || !bmap2)
4455 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
4458 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
4462 int isl_basic_set_is_equal(
4463 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
4465 return isl_basic_map_is_equal(
4466 (struct isl_basic_map *)bset1, (struct isl_basic_map *)bset2);
4469 int isl_map_is_empty(struct isl_map *map)
4476 for (i = 0; i < map->n; ++i) {
4477 is_empty = isl_basic_map_is_empty(map->p[i]);
4486 int isl_map_fast_is_empty(struct isl_map *map)
4491 int isl_set_fast_is_empty(struct isl_set *set)
4496 int isl_set_is_empty(struct isl_set *set)
4498 return isl_map_is_empty((struct isl_map *)set);
4501 int isl_map_is_equal(struct isl_map *map1, struct isl_map *map2)
4507 is_subset = isl_map_is_subset(map1, map2);
4510 is_subset = isl_map_is_subset(map2, map1);
4514 int isl_basic_map_is_strict_subset(
4515 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
4519 if (!bmap1 || !bmap2)
4521 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
4524 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
4525 if (is_subset == -1)
4530 int isl_map_is_strict_subset(struct isl_map *map1, struct isl_map *map2)
4536 is_subset = isl_map_is_subset(map1, map2);
4539 is_subset = isl_map_is_subset(map2, map1);
4540 if (is_subset == -1)
4545 int isl_set_is_strict_subset(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
4547 return isl_map_is_strict_subset((isl_map *)set1, (isl_map *)set2);
4550 int isl_basic_map_is_universe(struct isl_basic_map *bmap)
4554 return bmap->n_eq == 0 && bmap->n_ineq == 0;
4557 int isl_basic_set_is_universe(struct isl_basic_set *bset)
4561 return bset->n_eq == 0 && bset->n_ineq == 0;
4564 int isl_map_fast_is_universe(__isl_keep isl_map *map)
4569 return map->n == 1 && isl_basic_map_is_universe(map->p[0]);
4572 int isl_basic_map_is_empty(struct isl_basic_map *bmap)
4574 struct isl_basic_set *bset = NULL;
4575 struct isl_vec *sample = NULL;
4582 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY))
4585 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL)) {
4586 struct isl_basic_map *copy = isl_basic_map_copy(bmap);
4587 copy = isl_basic_map_convex_hull(copy);
4588 empty = ISL_F_ISSET(copy, ISL_BASIC_MAP_EMPTY);
4589 isl_basic_map_free(copy);
4593 total = 1 + isl_basic_map_total_dim(bmap);
4594 if (bmap->sample && bmap->sample->size == total) {
4595 int contains = isl_basic_map_contains(bmap, bmap->sample);
4601 isl_vec_free(bmap->sample);
4602 bmap->sample = NULL;
4603 bset = isl_basic_map_underlying_set(isl_basic_map_copy(bmap));
4606 sample = isl_basic_set_sample_vec(bset);
4609 empty = sample->size == 0;
4610 isl_vec_free(bmap->sample);
4611 bmap->sample = sample;
4613 ISL_F_SET(bmap, ISL_BASIC_MAP_EMPTY);
4618 int isl_basic_map_fast_is_empty(struct isl_basic_map *bmap)
4622 return ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY);
4625 int isl_basic_set_fast_is_empty(struct isl_basic_set *bset)
4629 return ISL_F_ISSET(bset, ISL_BASIC_SET_EMPTY);
4632 int isl_basic_set_is_empty(struct isl_basic_set *bset)
4634 return isl_basic_map_is_empty((struct isl_basic_map *)bset);
4637 struct isl_map *isl_basic_map_union(
4638 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
4640 struct isl_map *map;
4641 if (!bmap1 || !bmap2)
4644 isl_assert(bmap1->ctx, isl_dim_equal(bmap1->dim, bmap2->dim), goto error);
4646 map = isl_map_alloc_dim(isl_dim_copy(bmap1->dim), 2, 0);
4649 map = isl_map_add(map, bmap1);
4650 map = isl_map_add(map, bmap2);
4653 isl_basic_map_free(bmap1);
4654 isl_basic_map_free(bmap2);
4658 struct isl_set *isl_basic_set_union(
4659 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
4661 return (struct isl_set *)isl_basic_map_union(
4662 (struct isl_basic_map *)bset1,
4663 (struct isl_basic_map *)bset2);
4666 /* Order divs such that any div only depends on previous divs */
4667 struct isl_basic_map *isl_basic_map_order_divs(struct isl_basic_map *bmap)
4670 unsigned off = isl_dim_total(bmap->dim);
4672 for (i = 0; i < bmap->n_div; ++i) {
4674 if (isl_int_is_zero(bmap->div[i][0]))
4676 pos = isl_seq_first_non_zero(bmap->div[i]+1+1+off+i,
4680 isl_basic_map_swap_div(bmap, i, i + pos);
4686 struct isl_basic_set *isl_basic_set_order_divs(struct isl_basic_set *bset)
4688 return (struct isl_basic_set *)
4689 isl_basic_map_order_divs((struct isl_basic_map *)bset);
4692 /* Look for a div in dst that corresponds to the div "div" in src.
4693 * The divs before "div" in src and dst are assumed to be the same.
4695 * Returns -1 if no corresponding div was found and the position
4696 * of the corresponding div in dst otherwise.
4698 static int find_div(struct isl_basic_map *dst,
4699 struct isl_basic_map *src, unsigned div)
4703 unsigned total = isl_dim_total(src->dim);
4705 isl_assert(dst->ctx, div <= dst->n_div, return -1);
4706 for (i = div; i < dst->n_div; ++i)
4707 if (isl_seq_eq(dst->div[i], src->div[div], 1+1+total+div) &&
4708 isl_seq_first_non_zero(dst->div[i]+1+1+total+div,
4709 dst->n_div - div) == -1)
4714 struct isl_basic_map *isl_basic_map_align_divs(
4715 struct isl_basic_map *dst, struct isl_basic_map *src)
4718 unsigned total = isl_dim_total(src->dim);
4723 if (src->n_div == 0)
4726 for (i = 0; i < src->n_div; ++i)
4727 isl_assert(src->ctx, !isl_int_is_zero(src->div[i][0]), goto error);
4729 src = isl_basic_map_order_divs(src);
4730 dst = isl_basic_map_cow(dst);
4731 dst = isl_basic_map_extend_dim(dst, isl_dim_copy(dst->dim),
4732 src->n_div, 0, 2 * src->n_div);
4735 for (i = 0; i < src->n_div; ++i) {
4736 int j = find_div(dst, src, i);
4738 j = isl_basic_map_alloc_div(dst);
4741 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total+i);
4742 isl_seq_clr(dst->div[j]+1+1+total+i, dst->n_div - i);
4743 if (isl_basic_map_add_div_constraints(dst, j) < 0)
4747 isl_basic_map_swap_div(dst, i, j);
4751 isl_basic_map_free(dst);
4755 struct isl_basic_set *isl_basic_set_align_divs(
4756 struct isl_basic_set *dst, struct isl_basic_set *src)
4758 return (struct isl_basic_set *)isl_basic_map_align_divs(
4759 (struct isl_basic_map *)dst, (struct isl_basic_map *)src);
4762 struct isl_map *isl_map_align_divs(struct isl_map *map)
4770 map = isl_map_compute_divs(map);
4771 map = isl_map_cow(map);
4775 for (i = 1; i < map->n; ++i)
4776 map->p[0] = isl_basic_map_align_divs(map->p[0], map->p[i]);
4777 for (i = 1; i < map->n; ++i)
4778 map->p[i] = isl_basic_map_align_divs(map->p[i], map->p[0]);
4780 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4784 struct isl_set *isl_set_align_divs(struct isl_set *set)
4786 return (struct isl_set *)isl_map_align_divs((struct isl_map *)set);
4789 struct isl_set *isl_set_apply(struct isl_set *set, struct isl_map *map)
4793 isl_assert(set->ctx, isl_map_compatible_domain(map, set), goto error);
4794 map = isl_map_intersect_domain(map, set);
4795 set = isl_map_range(map);
4803 /* There is no need to cow as removing empty parts doesn't change
4804 * the meaning of the set.
4806 struct isl_map *isl_map_remove_empty_parts(struct isl_map *map)
4813 for (i = map->n-1; i >= 0; --i) {
4814 if (!ISL_F_ISSET(map->p[i], ISL_BASIC_MAP_EMPTY))
4816 isl_basic_map_free(map->p[i]);
4817 if (i != map->n-1) {
4818 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4819 map->p[i] = map->p[map->n-1];
4827 struct isl_set *isl_set_remove_empty_parts(struct isl_set *set)
4829 return (struct isl_set *)
4830 isl_map_remove_empty_parts((struct isl_map *)set);
4833 struct isl_basic_map *isl_map_copy_basic_map(struct isl_map *map)
4835 struct isl_basic_map *bmap;
4836 if (!map || map->n == 0)
4838 bmap = map->p[map->n-1];
4839 isl_assert(map->ctx, ISL_F_ISSET(bmap, ISL_BASIC_SET_FINAL), return NULL);
4840 return isl_basic_map_copy(bmap);
4843 struct isl_basic_set *isl_set_copy_basic_set(struct isl_set *set)
4845 return (struct isl_basic_set *)
4846 isl_map_copy_basic_map((struct isl_map *)set);
4849 __isl_give isl_map *isl_map_drop_basic_map(__isl_take isl_map *map,
4850 __isl_keep isl_basic_map *bmap)
4856 for (i = map->n-1; i >= 0; --i) {
4857 if (map->p[i] != bmap)
4859 map = isl_map_cow(map);
4862 isl_basic_map_free(map->p[i]);
4863 if (i != map->n-1) {
4864 ISL_F_CLR(map, ISL_SET_NORMALIZED);
4865 map->p[i] = map->p[map->n-1];
4876 struct isl_set *isl_set_drop_basic_set(struct isl_set *set,
4877 struct isl_basic_set *bset)
4879 return (struct isl_set *)isl_map_drop_basic_map((struct isl_map *)set,
4880 (struct isl_basic_map *)bset);
4883 /* Given two basic sets bset1 and bset2, compute the maximal difference
4884 * between the values of dimension pos in bset1 and those in bset2
4885 * for any common value of the parameters and dimensions preceding pos.
4887 static enum isl_lp_result basic_set_maximal_difference_at(
4888 __isl_keep isl_basic_set *bset1, __isl_keep isl_basic_set *bset2,
4889 int pos, isl_int *opt)
4891 struct isl_dim *dims;
4892 struct isl_basic_map *bmap1 = NULL;
4893 struct isl_basic_map *bmap2 = NULL;
4894 struct isl_ctx *ctx;
4895 struct isl_vec *obj;
4898 unsigned dim1, dim2;
4899 enum isl_lp_result res;
4901 if (!bset1 || !bset2)
4902 return isl_lp_error;
4904 nparam = isl_basic_set_n_param(bset1);
4905 dim1 = isl_basic_set_n_dim(bset1);
4906 dim2 = isl_basic_set_n_dim(bset2);
4907 dims = isl_dim_alloc(bset1->ctx, nparam, pos, dim1 - pos);
4908 bmap1 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset1), dims);
4909 dims = isl_dim_alloc(bset2->ctx, nparam, pos, dim2 - pos);
4910 bmap2 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset2), dims);
4911 if (!bmap1 || !bmap2)
4913 bmap1 = isl_basic_map_cow(bmap1);
4914 bmap1 = isl_basic_map_extend(bmap1, nparam,
4915 pos, (dim1 - pos) + (dim2 - pos),
4916 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
4917 bmap1 = add_constraints(bmap1, bmap2, 0, dim1 - pos);
4920 total = isl_basic_map_total_dim(bmap1);
4922 obj = isl_vec_alloc(ctx, 1 + total);
4923 isl_seq_clr(obj->block.data, 1 + total);
4924 isl_int_set_si(obj->block.data[1+nparam+pos], 1);
4925 isl_int_set_si(obj->block.data[1+nparam+pos+(dim1-pos)], -1);
4928 res = isl_basic_map_solve_lp(bmap1, 1, obj->block.data, ctx->one,
4930 isl_basic_map_free(bmap1);
4934 isl_basic_map_free(bmap1);
4935 isl_basic_map_free(bmap2);
4936 return isl_lp_error;
4939 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
4940 * for any common value of the parameters and dimensions preceding pos
4941 * in both basic sets, the values of dimension pos in bset1 are
4942 * smaller or larger than those in bset2.
4945 * 1 if bset1 follows bset2
4946 * -1 if bset1 precedes bset2
4947 * 0 if bset1 and bset2 are incomparable
4948 * -2 if some error occurred.
4950 int isl_basic_set_compare_at(struct isl_basic_set *bset1,
4951 struct isl_basic_set *bset2, int pos)
4954 enum isl_lp_result res;
4959 res = basic_set_maximal_difference_at(bset1, bset2, pos, &opt);
4961 if (res == isl_lp_empty)
4963 else if ((res == isl_lp_ok && isl_int_is_pos(opt)) ||
4964 res == isl_lp_unbounded)
4966 else if (res == isl_lp_ok && isl_int_is_neg(opt))
4975 /* Given two basic sets bset1 and bset2, check whether
4976 * for any common value of the parameters and dimensions preceding pos
4977 * there is a value of dimension pos in bset1 that is larger
4978 * than a value of the same dimension in bset2.
4981 * 1 if there exists such a pair
4982 * 0 if there is no such pair, but there is a pair of equal values
4984 * -2 if some error occurred.
4986 int isl_basic_set_follows_at(__isl_keep isl_basic_set *bset1,
4987 __isl_keep isl_basic_set *bset2, int pos)
4990 enum isl_lp_result res;
4995 res = basic_set_maximal_difference_at(bset1, bset2, pos, &opt);
4997 if (res == isl_lp_empty)
4999 else if ((res == isl_lp_ok && isl_int_is_pos(opt)) ||
5000 res == isl_lp_unbounded)
5002 else if (res == isl_lp_ok && isl_int_is_neg(opt))
5004 else if (res == isl_lp_ok)
5013 /* Given two sets set1 and set2, check whether
5014 * for any common value of the parameters and dimensions preceding pos
5015 * there is a value of dimension pos in set1 that is larger
5016 * than a value of the same dimension in set2.
5019 * 1 if there exists such a pair
5020 * 0 if there is no such pair, but there is a pair of equal values
5022 * -2 if some error occurred.
5024 int isl_set_follows_at(__isl_keep isl_set *set1,
5025 __isl_keep isl_set *set2, int pos)
5033 for (i = 0; i < set1->n; ++i)
5034 for (j = 0; j < set2->n; ++j) {
5036 f = isl_basic_set_follows_at(set1->p[i], set2->p[j], pos);
5037 if (f == 1 || f == -2)
5046 static int isl_basic_map_fast_has_fixed_var(struct isl_basic_map *bmap,
5047 unsigned pos, isl_int *val)
5055 total = isl_basic_map_total_dim(bmap);
5056 for (i = 0, d = total-1; i < bmap->n_eq && d+1 > pos; ++i) {
5057 for (; d+1 > pos; --d)
5058 if (!isl_int_is_zero(bmap->eq[i][1+d]))
5062 if (isl_seq_first_non_zero(bmap->eq[i]+1, d) != -1)
5064 if (isl_seq_first_non_zero(bmap->eq[i]+1+d+1, total-d-1) != -1)
5066 if (!isl_int_is_one(bmap->eq[i][1+d]))
5069 isl_int_neg(*val, bmap->eq[i][0]);
5075 static int isl_map_fast_has_fixed_var(struct isl_map *map,
5076 unsigned pos, isl_int *val)
5088 return isl_basic_map_fast_has_fixed_var(map->p[0], pos, val);
5091 fixed = isl_basic_map_fast_has_fixed_var(map->p[0], pos, &v);
5092 for (i = 1; fixed == 1 && i < map->n; ++i) {
5093 fixed = isl_basic_map_fast_has_fixed_var(map->p[i], pos, &tmp);
5094 if (fixed == 1 && isl_int_ne(tmp, v))
5098 isl_int_set(*val, v);
5104 static int isl_basic_set_fast_has_fixed_var(struct isl_basic_set *bset,
5105 unsigned pos, isl_int *val)
5107 return isl_basic_map_fast_has_fixed_var((struct isl_basic_map *)bset,
5111 static int isl_set_fast_has_fixed_var(struct isl_set *set, unsigned pos,
5114 return isl_map_fast_has_fixed_var((struct isl_map *)set, pos, val);
5117 int isl_basic_map_fast_is_fixed(struct isl_basic_map *bmap,
5118 enum isl_dim_type type, unsigned pos, isl_int *val)
5120 if (pos >= isl_basic_map_dim(bmap, type))
5122 return isl_basic_map_fast_has_fixed_var(bmap,
5123 isl_basic_map_offset(bmap, type) - 1 + pos, val);
5126 int isl_map_fast_is_fixed(struct isl_map *map,
5127 enum isl_dim_type type, unsigned pos, isl_int *val)
5129 if (pos >= isl_map_dim(map, type))
5131 return isl_map_fast_has_fixed_var(map,
5132 map_offset(map, type) - 1 + pos, val);
5135 /* Check if dimension dim has fixed value and if so and if val is not NULL,
5136 * then return this fixed value in *val.
5138 int isl_basic_set_fast_dim_is_fixed(struct isl_basic_set *bset, unsigned dim,
5141 return isl_basic_set_fast_has_fixed_var(bset,
5142 isl_basic_set_n_param(bset) + dim, val);
5145 /* Check if dimension dim has fixed value and if so and if val is not NULL,
5146 * then return this fixed value in *val.
5148 int isl_set_fast_dim_is_fixed(struct isl_set *set, unsigned dim, isl_int *val)
5150 return isl_set_fast_has_fixed_var(set, isl_set_n_param(set) + dim, val);
5153 /* Check if input variable in has fixed value and if so and if val is not NULL,
5154 * then return this fixed value in *val.
5156 int isl_map_fast_input_is_fixed(struct isl_map *map, unsigned in, isl_int *val)
5158 return isl_map_fast_has_fixed_var(map, isl_map_n_param(map) + in, val);
5161 /* Check if dimension dim has an (obvious) fixed lower bound and if so
5162 * and if val is not NULL, then return this lower bound in *val.
5164 int isl_basic_set_fast_dim_has_fixed_lower_bound(struct isl_basic_set *bset,
5165 unsigned dim, isl_int *val)
5167 int i, i_eq = -1, i_ineq = -1;
5174 total = isl_basic_set_total_dim(bset);
5175 nparam = isl_basic_set_n_param(bset);
5176 for (i = 0; i < bset->n_eq; ++i) {
5177 if (isl_int_is_zero(bset->eq[i][1+nparam+dim]))
5183 for (i = 0; i < bset->n_ineq; ++i) {
5184 if (!isl_int_is_pos(bset->ineq[i][1+nparam+dim]))
5186 if (i_eq != -1 || i_ineq != -1)
5190 if (i_eq == -1 && i_ineq == -1)
5192 c = i_eq != -1 ? bset->eq[i_eq] : bset->ineq[i_ineq];
5193 /* The coefficient should always be one due to normalization. */
5194 if (!isl_int_is_one(c[1+nparam+dim]))
5196 if (isl_seq_first_non_zero(c+1, nparam+dim) != -1)
5198 if (isl_seq_first_non_zero(c+1+nparam+dim+1,
5199 total - nparam - dim - 1) != -1)
5202 isl_int_neg(*val, c[0]);
5206 int isl_set_fast_dim_has_fixed_lower_bound(struct isl_set *set,
5207 unsigned dim, isl_int *val)
5219 return isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[0],
5223 fixed = isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[0],
5225 for (i = 1; fixed == 1 && i < set->n; ++i) {
5226 fixed = isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[i],
5228 if (fixed == 1 && isl_int_ne(tmp, v))
5232 isl_int_set(*val, v);
5243 static int qsort_constraint_cmp(const void *p1, const void *p2)
5245 const struct constraint *c1 = (const struct constraint *)p1;
5246 const struct constraint *c2 = (const struct constraint *)p2;
5247 unsigned size = isl_min(c1->size, c2->size);
5248 return isl_seq_cmp(c1->c, c2->c, size);
5251 static struct isl_basic_map *isl_basic_map_sort_constraints(
5252 struct isl_basic_map *bmap)
5255 struct constraint *c;
5260 total = isl_basic_map_total_dim(bmap);
5261 c = isl_alloc_array(bmap->ctx, struct constraint, bmap->n_ineq);
5264 for (i = 0; i < bmap->n_ineq; ++i) {
5266 c[i].c = bmap->ineq[i];
5268 qsort(c, bmap->n_ineq, sizeof(struct constraint), qsort_constraint_cmp);
5269 for (i = 0; i < bmap->n_ineq; ++i)
5270 bmap->ineq[i] = c[i].c;
5274 isl_basic_map_free(bmap);
5278 struct isl_basic_map *isl_basic_map_normalize(struct isl_basic_map *bmap)
5282 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_NORMALIZED))
5284 bmap = isl_basic_map_convex_hull(bmap);
5285 bmap = isl_basic_map_sort_constraints(bmap);
5286 ISL_F_SET(bmap, ISL_BASIC_MAP_NORMALIZED);
5290 struct isl_basic_set *isl_basic_set_normalize(struct isl_basic_set *bset)
5292 return (struct isl_basic_set *)isl_basic_map_normalize(
5293 (struct isl_basic_map *)bset);
5296 static int isl_basic_map_fast_cmp(const struct isl_basic_map *bmap1,
5297 const struct isl_basic_map *bmap2)
5304 if (isl_basic_map_n_param(bmap1) != isl_basic_map_n_param(bmap2))
5305 return isl_basic_map_n_param(bmap1) - isl_basic_map_n_param(bmap2);
5306 if (isl_basic_map_n_in(bmap1) != isl_basic_map_n_in(bmap2))
5307 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
5308 if (isl_basic_map_n_out(bmap1) != isl_basic_map_n_out(bmap2))
5309 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
5310 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY) &&
5311 ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
5313 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY))
5315 if (ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
5317 if (bmap1->n_eq != bmap2->n_eq)
5318 return bmap1->n_eq - bmap2->n_eq;
5319 if (bmap1->n_ineq != bmap2->n_ineq)
5320 return bmap1->n_ineq - bmap2->n_ineq;
5321 if (bmap1->n_div != bmap2->n_div)
5322 return bmap1->n_div - bmap2->n_div;
5323 total = isl_basic_map_total_dim(bmap1);
5324 for (i = 0; i < bmap1->n_eq; ++i) {
5325 cmp = isl_seq_cmp(bmap1->eq[i], bmap2->eq[i], 1+total);
5329 for (i = 0; i < bmap1->n_ineq; ++i) {
5330 cmp = isl_seq_cmp(bmap1->ineq[i], bmap2->ineq[i], 1+total);
5334 for (i = 0; i < bmap1->n_div; ++i) {
5335 cmp = isl_seq_cmp(bmap1->div[i], bmap2->div[i], 1+1+total);
5342 static int isl_basic_map_fast_is_equal(struct isl_basic_map *bmap1,
5343 struct isl_basic_map *bmap2)
5345 return isl_basic_map_fast_cmp(bmap1, bmap2) == 0;
5348 static int qsort_bmap_cmp(const void *p1, const void *p2)
5350 const struct isl_basic_map *bmap1 = *(const struct isl_basic_map **)p1;
5351 const struct isl_basic_map *bmap2 = *(const struct isl_basic_map **)p2;
5353 return isl_basic_map_fast_cmp(bmap1, bmap2);
5356 /* We normalize in place, but if anything goes wrong we need
5357 * to return NULL, so we need to make sure we don't change the
5358 * meaning of any possible other copies of map.
5360 struct isl_map *isl_map_normalize(struct isl_map *map)
5363 struct isl_basic_map *bmap;
5367 if (ISL_F_ISSET(map, ISL_MAP_NORMALIZED))
5369 for (i = 0; i < map->n; ++i) {
5370 bmap = isl_basic_map_normalize(isl_basic_map_copy(map->p[i]));
5373 isl_basic_map_free(map->p[i]);
5376 qsort(map->p, map->n, sizeof(struct isl_basic_map *), qsort_bmap_cmp);
5377 ISL_F_SET(map, ISL_MAP_NORMALIZED);
5378 map = isl_map_remove_empty_parts(map);
5381 for (i = map->n - 1; i >= 1; --i) {
5382 if (!isl_basic_map_fast_is_equal(map->p[i-1], map->p[i]))
5384 isl_basic_map_free(map->p[i-1]);
5385 for (j = i; j < map->n; ++j)
5386 map->p[j-1] = map->p[j];
5396 struct isl_set *isl_set_normalize(struct isl_set *set)
5398 return (struct isl_set *)isl_map_normalize((struct isl_map *)set);
5401 int isl_map_fast_is_equal(struct isl_map *map1, struct isl_map *map2)
5411 if (!isl_dim_equal(map1->dim, map2->dim))
5414 map1 = isl_map_copy(map1);
5415 map2 = isl_map_copy(map2);
5416 map1 = isl_map_normalize(map1);
5417 map2 = isl_map_normalize(map2);
5420 equal = map1->n == map2->n;
5421 for (i = 0; equal && i < map1->n; ++i) {
5422 equal = isl_basic_map_fast_is_equal(map1->p[i], map2->p[i]);
5435 int isl_set_fast_is_equal(struct isl_set *set1, struct isl_set *set2)
5437 return isl_map_fast_is_equal((struct isl_map *)set1,
5438 (struct isl_map *)set2);
5441 /* Return an interval that ranges from min to max (inclusive)
5443 struct isl_basic_set *isl_basic_set_interval(struct isl_ctx *ctx,
5444 isl_int min, isl_int max)
5447 struct isl_basic_set *bset = NULL;
5449 bset = isl_basic_set_alloc(ctx, 0, 1, 0, 0, 2);
5453 k = isl_basic_set_alloc_inequality(bset);
5456 isl_int_set_si(bset->ineq[k][1], 1);
5457 isl_int_neg(bset->ineq[k][0], min);
5459 k = isl_basic_set_alloc_inequality(bset);
5462 isl_int_set_si(bset->ineq[k][1], -1);
5463 isl_int_set(bset->ineq[k][0], max);
5467 isl_basic_set_free(bset);
5471 /* Return the Cartesian product of the basic sets in list (in the given order).
5473 struct isl_basic_set *isl_basic_set_product(struct isl_basic_set_list *list)
5481 struct isl_basic_set *product = NULL;
5485 isl_assert(list->ctx, list->n > 0, goto error);
5486 isl_assert(list->ctx, list->p[0], goto error);
5487 nparam = isl_basic_set_n_param(list->p[0]);
5488 dim = isl_basic_set_n_dim(list->p[0]);
5489 extra = list->p[0]->n_div;
5490 n_eq = list->p[0]->n_eq;
5491 n_ineq = list->p[0]->n_ineq;
5492 for (i = 1; i < list->n; ++i) {
5493 isl_assert(list->ctx, list->p[i], goto error);
5494 isl_assert(list->ctx,
5495 nparam == isl_basic_set_n_param(list->p[i]), goto error);
5496 dim += isl_basic_set_n_dim(list->p[i]);
5497 extra += list->p[i]->n_div;
5498 n_eq += list->p[i]->n_eq;
5499 n_ineq += list->p[i]->n_ineq;
5501 product = isl_basic_set_alloc(list->ctx, nparam, dim, extra,
5506 for (i = 0; i < list->n; ++i) {
5507 isl_basic_set_add_constraints(product,
5508 isl_basic_set_copy(list->p[i]), dim);
5509 dim += isl_basic_set_n_dim(list->p[i]);
5511 isl_basic_set_list_free(list);
5514 isl_basic_set_free(product);
5515 isl_basic_set_list_free(list);
5519 struct isl_basic_map *isl_basic_map_product(
5520 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
5522 struct isl_dim *dim_result = NULL;
5523 struct isl_basic_map *bmap;
5524 unsigned in1, in2, out1, out2, nparam, total, pos;
5525 struct isl_dim_map *dim_map1, *dim_map2;
5527 if (!bmap1 || !bmap2)
5530 isl_assert(bmap1->ctx, isl_dim_match(bmap1->dim, isl_dim_param,
5531 bmap2->dim, isl_dim_param), goto error);
5532 dim_result = isl_dim_product(isl_dim_copy(bmap1->dim),
5533 isl_dim_copy(bmap2->dim));
5535 in1 = isl_basic_map_n_in(bmap1);
5536 in2 = isl_basic_map_n_in(bmap2);
5537 out1 = isl_basic_map_n_out(bmap1);
5538 out2 = isl_basic_map_n_out(bmap2);
5539 nparam = isl_basic_map_n_param(bmap1);
5541 total = nparam + in1 + in2 + out1 + out2 + bmap1->n_div + bmap2->n_div;
5542 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
5543 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
5544 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
5545 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
5546 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
5547 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos += in1);
5548 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += in2);
5549 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += out1);
5550 isl_dim_map_div(dim_map1, bmap1, pos += out2);
5551 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
5553 bmap = isl_basic_map_alloc_dim(dim_result,
5554 bmap1->n_div + bmap2->n_div,
5555 bmap1->n_eq + bmap2->n_eq,
5556 bmap1->n_ineq + bmap2->n_ineq);
5557 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
5558 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
5559 bmap = isl_basic_map_simplify(bmap);
5560 return isl_basic_map_finalize(bmap);
5562 isl_basic_map_free(bmap1);
5563 isl_basic_map_free(bmap2);
5567 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
5569 struct isl_map *isl_map_product(struct isl_map *map1, struct isl_map *map2)
5572 struct isl_map *result;
5578 isl_assert(map1->ctx, isl_dim_match(map1->dim, isl_dim_param,
5579 map2->dim, isl_dim_param), goto error);
5581 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
5582 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
5583 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
5585 result = isl_map_alloc_dim(isl_dim_product(isl_dim_copy(map1->dim),
5586 isl_dim_copy(map2->dim)),
5587 map1->n * map2->n, flags);
5590 for (i = 0; i < map1->n; ++i)
5591 for (j = 0; j < map2->n; ++j) {
5592 struct isl_basic_map *part;
5593 part = isl_basic_map_product(
5594 isl_basic_map_copy(map1->p[i]),
5595 isl_basic_map_copy(map2->p[j]));
5596 if (isl_basic_map_is_empty(part))
5597 isl_basic_map_free(part);
5599 result = isl_map_add(result, part);
5612 /* Given two set A and B, construct its Cartesian product A x B.
5614 struct isl_set *isl_set_product(struct isl_set *set1, struct isl_set *set2)
5616 return (struct isl_set *)isl_map_product((struct isl_map *)set1,
5617 (struct isl_map *)set2);
5620 uint32_t isl_basic_set_get_hash(struct isl_basic_set *bset)
5623 uint32_t hash = isl_hash_init();
5628 bset = isl_basic_set_copy(bset);
5629 bset = isl_basic_set_normalize(bset);
5632 total = isl_basic_set_total_dim(bset);
5633 isl_hash_byte(hash, bset->n_eq & 0xFF);
5634 for (i = 0; i < bset->n_eq; ++i) {
5636 c_hash = isl_seq_get_hash(bset->eq[i], 1 + total);
5637 isl_hash_hash(hash, c_hash);
5639 isl_hash_byte(hash, bset->n_ineq & 0xFF);
5640 for (i = 0; i < bset->n_ineq; ++i) {
5642 c_hash = isl_seq_get_hash(bset->ineq[i], 1 + total);
5643 isl_hash_hash(hash, c_hash);
5645 isl_hash_byte(hash, bset->n_div & 0xFF);
5646 for (i = 0; i < bset->n_div; ++i) {
5648 if (isl_int_is_zero(bset->div[i][0]))
5650 isl_hash_byte(hash, i & 0xFF);
5651 c_hash = isl_seq_get_hash(bset->div[i], 1 + 1 + total);
5652 isl_hash_hash(hash, c_hash);
5654 isl_basic_set_free(bset);
5658 uint32_t isl_set_get_hash(struct isl_set *set)
5665 set = isl_set_copy(set);
5666 set = isl_set_normalize(set);
5670 hash = isl_hash_init();
5671 for (i = 0; i < set->n; ++i) {
5673 bset_hash = isl_basic_set_get_hash(set->p[i]);
5674 isl_hash_hash(hash, bset_hash);
5682 /* Check if the value for dimension dim is completely determined
5683 * by the values of the other parameters and variables.
5684 * That is, check if dimension dim is involved in an equality.
5686 int isl_basic_set_dim_is_unique(struct isl_basic_set *bset, unsigned dim)
5693 nparam = isl_basic_set_n_param(bset);
5694 for (i = 0; i < bset->n_eq; ++i)
5695 if (!isl_int_is_zero(bset->eq[i][1 + nparam + dim]))
5700 /* Check if the value for dimension dim is completely determined
5701 * by the values of the other parameters and variables.
5702 * That is, check if dimension dim is involved in an equality
5703 * for each of the subsets.
5705 int isl_set_dim_is_unique(struct isl_set *set, unsigned dim)
5711 for (i = 0; i < set->n; ++i) {
5713 unique = isl_basic_set_dim_is_unique(set->p[i], dim);
5720 int isl_map_foreach_basic_map(__isl_keep isl_map *map,
5721 int (*fn)(__isl_take isl_basic_map *bmap, void *user), void *user)
5728 for (i = 0; i < map->n; ++i)
5729 if (fn(isl_basic_map_copy(map->p[i]), user) < 0)
5735 int isl_set_foreach_basic_set(__isl_keep isl_set *set,
5736 int (*fn)(__isl_take isl_basic_set *bset, void *user), void *user)
5743 for (i = 0; i < set->n; ++i)
5744 if (fn(isl_basic_set_copy(set->p[i]), user) < 0)
5750 __isl_give isl_map *isl_set_lifting(__isl_take isl_set *set)
5752 struct isl_dim *dim;
5753 struct isl_basic_map *bmap;
5760 set = isl_set_align_divs(set);
5765 dim = isl_set_get_dim(set);
5766 if (set->n == 0 || set->p[0]->n_div == 0) {
5768 return isl_map_identity(dim);
5771 n_div = set->p[0]->n_div;
5772 dim = isl_dim_map(dim);
5773 n_param = isl_dim_size(dim, isl_dim_param);
5774 n_set = isl_dim_size(dim, isl_dim_in);
5775 dim = isl_dim_extend(dim, n_param, n_set, n_set + n_div);
5776 bmap = isl_basic_map_alloc_dim(dim, 0, n_set, 2 * n_div);
5777 for (i = 0; i < n_set; ++i)
5778 bmap = var_equal(bmap, i);
5780 total = n_param + n_set + n_set + n_div;
5781 for (i = 0; i < n_div; ++i) {
5782 k = isl_basic_map_alloc_inequality(bmap);
5785 isl_seq_cpy(bmap->ineq[k], set->p[0]->div[i]+1, 1+n_param);
5786 isl_seq_clr(bmap->ineq[k]+1+n_param, n_set);
5787 isl_seq_cpy(bmap->ineq[k]+1+n_param+n_set,
5788 set->p[0]->div[i]+1+1+n_param, n_set + n_div);
5789 isl_int_neg(bmap->ineq[k][1+n_param+n_set+n_set+i],
5790 set->p[0]->div[i][0]);
5792 l = isl_basic_map_alloc_inequality(bmap);
5795 isl_seq_neg(bmap->ineq[l], bmap->ineq[k], 1 + total);
5796 isl_int_add(bmap->ineq[l][0], bmap->ineq[l][0],
5797 set->p[0]->div[i][0]);
5798 isl_int_sub_ui(bmap->ineq[l][0], bmap->ineq[l][0], 1);
5802 return isl_map_from_basic_map(bmap);
5805 isl_basic_map_free(bmap);
5809 int isl_basic_set_size(__isl_keep isl_basic_set *bset)
5817 dim = isl_basic_set_total_dim(bset);
5818 size += bset->n_eq * (1 + dim);
5819 size += bset->n_ineq * (1 + dim);
5820 size += bset->n_div * (2 + dim);
5825 int isl_set_size(__isl_keep isl_set *set)
5833 for (i = 0; i < set->n; ++i)
5834 size += isl_basic_set_size(set->p[i]);