6 #include "isl_equalities.h"
12 #include "isl_map_private.h"
13 #include "isl_map_piplib.h"
14 #include "isl_sample.h"
18 /* Maps dst positions to src positions */
24 static struct isl_dim_map *isl_dim_map_alloc(struct isl_ctx *ctx, unsigned len)
27 struct isl_dim_map *dim_map;
28 dim_map = isl_alloc(ctx, struct isl_dim_map,
29 sizeof(struct isl_dim_map) + len * sizeof(int));
32 dim_map->len = 1 + len;
34 for (i = 0; i < len; ++i)
35 dim_map->pos[1 + i] = -1;
39 static unsigned n(struct isl_dim *dim, enum isl_dim_type type)
42 case isl_dim_param: return dim->nparam;
43 case isl_dim_in: return dim->n_in;
44 case isl_dim_out: return dim->n_out;
45 case isl_dim_all: return dim->nparam + dim->n_in + dim->n_out;
49 static unsigned pos(struct isl_dim *dim, enum isl_dim_type type)
52 case isl_dim_param: return 1;
53 case isl_dim_in: return 1 + dim->nparam;
54 case isl_dim_out: return 1 + dim->nparam + dim->n_in;
58 static void isl_dim_map_dim(struct isl_dim_map *dim_map, struct isl_dim *dim,
59 enum isl_dim_type type, unsigned dst_pos)
67 src_pos = pos(dim, type);
68 for (i = 0; i < n(dim, type); ++i)
69 dim_map->pos[1 + dst_pos + i] = src_pos + i;
72 static void isl_dim_map_div(struct isl_dim_map *dim_map,
73 struct isl_basic_map *bmap, unsigned dst_pos)
78 if (!dim_map || !bmap)
81 src_pos = 1 + isl_dim_total(bmap->dim);
82 for (i = 0; i < bmap->n_div; ++i)
83 dim_map->pos[1 + dst_pos + i] = src_pos + i;
86 static void isl_dim_map_dump(struct isl_dim_map *dim_map)
90 for (i = 0; i < dim_map->len; ++i)
91 fprintf(stderr, "%d -> %d; ", i, dim_map->pos[i]);
92 fprintf(stderr, "\n");
95 unsigned isl_basic_map_dim(const struct isl_basic_map *bmap,
96 enum isl_dim_type type)
101 case isl_dim_out: return isl_dim_size(bmap->dim, type);
102 case isl_dim_div: return bmap->n_div;
103 case isl_dim_all: return isl_basic_map_total_dim(bmap);
107 unsigned isl_map_dim(const struct isl_map *map, enum isl_dim_type type)
109 return n(map->dim, type);
112 unsigned isl_set_dim(const struct isl_set *set, enum isl_dim_type type)
114 return n(set->dim, type);
117 unsigned isl_basic_map_offset(struct isl_basic_map *bmap,
118 enum isl_dim_type type)
120 struct isl_dim *dim = bmap->dim;
122 case isl_dim_param: return 1;
123 case isl_dim_in: return 1 + dim->nparam;
124 case isl_dim_out: return 1 + dim->nparam + dim->n_in;
125 case isl_dim_div: return 1 + dim->nparam + dim->n_in + dim->n_out;
129 static unsigned map_offset(struct isl_map *map, enum isl_dim_type type)
131 return pos(map->dim, type);
134 unsigned isl_basic_set_dim(const struct isl_basic_set *bset,
135 enum isl_dim_type type)
137 return isl_basic_map_dim((const struct isl_basic_map*)bset, type);
140 unsigned isl_basic_set_n_dim(const struct isl_basic_set *bset)
142 return bset->dim->n_out;
145 unsigned isl_basic_set_n_param(const struct isl_basic_set *bset)
147 return bset->dim->nparam;
150 unsigned isl_basic_set_total_dim(const struct isl_basic_set *bset)
152 return isl_dim_total(bset->dim) + bset->n_div;
155 unsigned isl_set_n_dim(const struct isl_set *set)
157 return set->dim->n_out;
160 unsigned isl_set_n_param(const struct isl_set *set)
162 return set->dim->nparam;
165 unsigned isl_basic_map_n_in(const struct isl_basic_map *bmap)
167 return bmap->dim->n_in;
170 unsigned isl_basic_map_n_out(const struct isl_basic_map *bmap)
172 return bmap->dim->n_out;
175 unsigned isl_basic_map_n_param(const struct isl_basic_map *bmap)
177 return bmap->dim->nparam;
180 unsigned isl_basic_map_n_div(const struct isl_basic_map *bmap)
185 unsigned isl_basic_map_total_dim(const struct isl_basic_map *bmap)
187 return isl_dim_total(bmap->dim) + bmap->n_div;
190 unsigned isl_map_n_in(const struct isl_map *map)
192 return map->dim->n_in;
195 unsigned isl_map_n_out(const struct isl_map *map)
197 return map->dim->n_out;
200 unsigned isl_map_n_param(const struct isl_map *map)
202 return map->dim->nparam;
205 int isl_map_compatible_domain(struct isl_map *map, struct isl_set *set)
207 return map->dim->n_in == set->dim->n_out &&
208 map->dim->nparam == set->dim->nparam;
211 int isl_basic_map_compatible_domain(struct isl_basic_map *bmap,
212 struct isl_basic_set *bset)
214 return bmap->dim->n_in == bset->dim->n_out &&
215 bmap->dim->nparam == bset->dim->nparam;
218 int isl_basic_map_compatible_range(struct isl_basic_map *bmap,
219 struct isl_basic_set *bset)
221 return bmap->dim->n_out == bset->dim->n_out &&
222 bmap->dim->nparam == bset->dim->nparam;
225 struct isl_dim *isl_basic_map_get_dim(struct isl_basic_map *bmap)
229 return isl_dim_copy(bmap->dim);
232 struct isl_dim *isl_basic_set_get_dim(struct isl_basic_set *bset)
236 return isl_dim_copy(bset->dim);
239 struct isl_dim *isl_map_get_dim(struct isl_map *map)
243 return isl_dim_copy(map->dim);
246 struct isl_dim *isl_set_get_dim(struct isl_set *set)
250 return isl_dim_copy(set->dim);
253 static struct isl_basic_map *basic_map_init(struct isl_ctx *ctx,
254 struct isl_basic_map *bmap, unsigned extra,
255 unsigned n_eq, unsigned n_ineq)
258 size_t row_size = 1 + isl_dim_total(bmap->dim) + extra;
260 bmap->block = isl_blk_alloc(ctx, (n_ineq + n_eq) * row_size);
261 if (isl_blk_is_error(bmap->block)) {
266 bmap->ineq = isl_alloc_array(ctx, isl_int *, n_ineq + n_eq);
268 isl_blk_free(ctx, bmap->block);
274 bmap->block2 = isl_blk_empty();
277 bmap->block2 = isl_blk_alloc(ctx, extra * (1 + row_size));
278 if (isl_blk_is_error(bmap->block2)) {
280 isl_blk_free(ctx, bmap->block);
285 bmap->div = isl_alloc_array(ctx, isl_int *, extra);
287 isl_blk_free(ctx, bmap->block2);
289 isl_blk_free(ctx, bmap->block);
295 for (i = 0; i < n_ineq + n_eq; ++i)
296 bmap->ineq[i] = bmap->block.data + i * row_size;
298 for (i = 0; i < extra; ++i)
299 bmap->div[i] = bmap->block2.data + i * (1 + row_size);
305 bmap->c_size = n_eq + n_ineq;
306 bmap->eq = bmap->ineq + n_ineq;
315 isl_basic_map_free(bmap);
319 struct isl_basic_set *isl_basic_set_alloc(struct isl_ctx *ctx,
320 unsigned nparam, unsigned dim, unsigned extra,
321 unsigned n_eq, unsigned n_ineq)
323 struct isl_basic_map *bmap;
324 bmap = isl_basic_map_alloc(ctx, nparam, 0, dim, extra, n_eq, n_ineq);
325 return (struct isl_basic_set *)bmap;
328 struct isl_basic_set *isl_basic_set_alloc_dim(struct isl_dim *dim,
329 unsigned extra, unsigned n_eq, unsigned n_ineq)
331 struct isl_basic_map *bmap;
334 isl_assert(dim->ctx, dim->n_in == 0, return NULL);
335 bmap = isl_basic_map_alloc_dim(dim, extra, n_eq, n_ineq);
336 return (struct isl_basic_set *)bmap;
339 struct isl_basic_map *isl_basic_map_alloc_dim(struct isl_dim *dim,
340 unsigned extra, unsigned n_eq, unsigned n_ineq)
342 struct isl_basic_map *bmap;
346 bmap = isl_alloc_type(dim->ctx, struct isl_basic_map);
351 return basic_map_init(dim->ctx, bmap, extra, n_eq, n_ineq);
357 struct isl_basic_map *isl_basic_map_alloc(struct isl_ctx *ctx,
358 unsigned nparam, unsigned in, unsigned out, unsigned extra,
359 unsigned n_eq, unsigned n_ineq)
361 struct isl_basic_map *bmap;
364 dim = isl_dim_alloc(ctx, nparam, in, out);
368 bmap = isl_basic_map_alloc_dim(dim, extra, n_eq, n_ineq);
372 static void dup_constraints(
373 struct isl_basic_map *dst, struct isl_basic_map *src)
376 unsigned total = isl_basic_map_total_dim(src);
378 for (i = 0; i < src->n_eq; ++i) {
379 int j = isl_basic_map_alloc_equality(dst);
380 isl_seq_cpy(dst->eq[j], src->eq[i], 1+total);
383 for (i = 0; i < src->n_ineq; ++i) {
384 int j = isl_basic_map_alloc_inequality(dst);
385 isl_seq_cpy(dst->ineq[j], src->ineq[i], 1+total);
388 for (i = 0; i < src->n_div; ++i) {
389 int j = isl_basic_map_alloc_div(dst);
390 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total);
392 ISL_F_SET(dst, ISL_BASIC_SET_FINAL);
395 struct isl_basic_map *isl_basic_map_dup(struct isl_basic_map *bmap)
397 struct isl_basic_map *dup;
401 dup = isl_basic_map_alloc_dim(isl_dim_copy(bmap->dim),
402 bmap->n_div, bmap->n_eq, bmap->n_ineq);
405 dup_constraints(dup, bmap);
406 dup->flags = bmap->flags;
407 dup->sample = isl_vec_copy(bmap->sample);
411 struct isl_basic_set *isl_basic_set_dup(struct isl_basic_set *bset)
413 struct isl_basic_map *dup;
415 dup = isl_basic_map_dup((struct isl_basic_map *)bset);
416 return (struct isl_basic_set *)dup;
419 struct isl_basic_set *isl_basic_set_copy(struct isl_basic_set *bset)
424 if (ISL_F_ISSET(bset, ISL_BASIC_SET_FINAL)) {
428 return isl_basic_set_dup(bset);
431 struct isl_set *isl_set_copy(struct isl_set *set)
440 struct isl_basic_map *isl_basic_map_copy(struct isl_basic_map *bmap)
445 if (ISL_F_ISSET(bmap, ISL_BASIC_SET_FINAL)) {
449 return isl_basic_map_dup(bmap);
452 struct isl_map *isl_map_copy(struct isl_map *map)
461 void isl_basic_map_free(struct isl_basic_map *bmap)
469 isl_ctx_deref(bmap->ctx);
471 isl_blk_free(bmap->ctx, bmap->block2);
473 isl_blk_free(bmap->ctx, bmap->block);
474 isl_vec_free(bmap->sample);
475 isl_dim_free(bmap->dim);
479 void isl_basic_set_free(struct isl_basic_set *bset)
481 isl_basic_map_free((struct isl_basic_map *)bset);
484 static int room_for_con(struct isl_basic_map *bmap, unsigned n)
486 return bmap->n_eq + bmap->n_ineq + n <= bmap->c_size;
489 int isl_basic_map_alloc_equality(struct isl_basic_map *bmap)
495 isl_assert(ctx, room_for_con(bmap, 1), return -1);
496 isl_assert(ctx, (bmap->eq - bmap->ineq) + bmap->n_eq <= bmap->c_size,
498 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
499 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
500 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_IMPLICIT);
501 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
502 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
503 if ((bmap->eq - bmap->ineq) + bmap->n_eq == bmap->c_size) {
505 int j = isl_basic_map_alloc_inequality(bmap);
509 bmap->ineq[j] = bmap->ineq[bmap->n_ineq - 1];
510 bmap->ineq[bmap->n_ineq - 1] = bmap->eq[-1];
517 isl_seq_clr(bmap->eq[bmap->n_eq] + 1 + isl_basic_map_total_dim(bmap),
518 bmap->extra - bmap->n_div);
522 int isl_basic_set_alloc_equality(struct isl_basic_set *bset)
524 return isl_basic_map_alloc_equality((struct isl_basic_map *)bset);
527 int isl_basic_map_free_equality(struct isl_basic_map *bmap, unsigned n)
531 isl_assert(bmap->ctx, n <= bmap->n_eq, return -1);
536 int isl_basic_set_free_equality(struct isl_basic_set *bset, unsigned n)
538 return isl_basic_map_free_equality((struct isl_basic_map *)bset, n);
541 int isl_basic_map_drop_equality(struct isl_basic_map *bmap, unsigned pos)
546 isl_assert(bmap->ctx, pos < bmap->n_eq, return -1);
548 if (pos != bmap->n_eq - 1) {
550 bmap->eq[pos] = bmap->eq[bmap->n_eq - 1];
551 bmap->eq[bmap->n_eq - 1] = t;
557 int isl_basic_set_drop_equality(struct isl_basic_set *bset, unsigned pos)
559 return isl_basic_map_drop_equality((struct isl_basic_map *)bset, pos);
562 void isl_basic_map_inequality_to_equality(
563 struct isl_basic_map *bmap, unsigned pos)
568 bmap->ineq[pos] = bmap->ineq[bmap->n_ineq - 1];
569 bmap->ineq[bmap->n_ineq - 1] = bmap->eq[-1];
574 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
575 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
576 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
577 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
580 static int room_for_ineq(struct isl_basic_map *bmap, unsigned n)
582 return bmap->n_ineq + n <= bmap->eq - bmap->ineq;
585 int isl_basic_map_alloc_inequality(struct isl_basic_map *bmap)
591 isl_assert(ctx, room_for_ineq(bmap, 1), return -1);
592 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_IMPLICIT);
593 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
594 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
595 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
596 isl_seq_clr(bmap->ineq[bmap->n_ineq] +
597 1 + isl_basic_map_total_dim(bmap),
598 bmap->extra - bmap->n_div);
599 return bmap->n_ineq++;
602 int isl_basic_set_alloc_inequality(struct isl_basic_set *bset)
604 return isl_basic_map_alloc_inequality((struct isl_basic_map *)bset);
607 int isl_basic_map_free_inequality(struct isl_basic_map *bmap, unsigned n)
611 isl_assert(bmap->ctx, n <= bmap->n_ineq, return -1);
616 int isl_basic_set_free_inequality(struct isl_basic_set *bset, unsigned n)
618 return isl_basic_map_free_inequality((struct isl_basic_map *)bset, n);
621 int isl_basic_map_drop_inequality(struct isl_basic_map *bmap, unsigned pos)
626 isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
628 if (pos != bmap->n_ineq - 1) {
630 bmap->ineq[pos] = bmap->ineq[bmap->n_ineq - 1];
631 bmap->ineq[bmap->n_ineq - 1] = t;
632 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
638 int isl_basic_set_drop_inequality(struct isl_basic_set *bset, unsigned pos)
640 return isl_basic_map_drop_inequality((struct isl_basic_map *)bset, pos);
643 __isl_give isl_basic_set *isl_basic_set_add_eq(__isl_take isl_basic_set *bset,
648 bset = isl_basic_set_extend_constraints(bset, 1, 0);
651 k = isl_basic_set_alloc_equality(bset);
654 isl_seq_cpy(bset->eq[k], eq, 1 + isl_basic_set_total_dim(bset));
657 isl_basic_set_free(bset);
661 __isl_give isl_basic_set *isl_basic_set_add_ineq(__isl_take isl_basic_set *bset,
666 bset = isl_basic_set_extend_constraints(bset, 0, 1);
669 k = isl_basic_set_alloc_inequality(bset);
672 isl_seq_cpy(bset->ineq[k], ineq, 1 + isl_basic_set_total_dim(bset));
675 isl_basic_set_free(bset);
679 int isl_basic_map_alloc_div(struct isl_basic_map *bmap)
683 isl_assert(bmap->ctx, bmap->n_div < bmap->extra, return -1);
684 isl_seq_clr(bmap->div[bmap->n_div] +
685 1 + 1 + isl_basic_map_total_dim(bmap),
686 bmap->extra - bmap->n_div);
687 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
688 return bmap->n_div++;
691 int isl_basic_set_alloc_div(struct isl_basic_set *bset)
693 return isl_basic_map_alloc_div((struct isl_basic_map *)bset);
696 int isl_basic_map_free_div(struct isl_basic_map *bmap, unsigned n)
700 isl_assert(bmap->ctx, n <= bmap->n_div, return -1);
705 int isl_basic_set_free_div(struct isl_basic_set *bset, unsigned n)
707 return isl_basic_map_free_div((struct isl_basic_map *)bset, n);
710 /* Copy constraint from src to dst, putting the vars of src at offset
711 * dim_off in dst and the divs of src at offset div_off in dst.
712 * If both sets are actually map, then dim_off applies to the input
715 static void copy_constraint(struct isl_basic_map *dst_map, isl_int *dst,
716 struct isl_basic_map *src_map, isl_int *src,
717 unsigned in_off, unsigned out_off, unsigned div_off)
719 unsigned src_nparam = isl_basic_map_n_param(src_map);
720 unsigned dst_nparam = isl_basic_map_n_param(dst_map);
721 unsigned src_in = isl_basic_map_n_in(src_map);
722 unsigned dst_in = isl_basic_map_n_in(dst_map);
723 unsigned src_out = isl_basic_map_n_out(src_map);
724 unsigned dst_out = isl_basic_map_n_out(dst_map);
725 isl_int_set(dst[0], src[0]);
726 isl_seq_cpy(dst+1, src+1, isl_min(dst_nparam, src_nparam));
727 if (dst_nparam > src_nparam)
728 isl_seq_clr(dst+1+src_nparam,
729 dst_nparam - src_nparam);
730 isl_seq_clr(dst+1+dst_nparam, in_off);
731 isl_seq_cpy(dst+1+dst_nparam+in_off,
733 isl_min(dst_in-in_off, src_in));
734 if (dst_in-in_off > src_in)
735 isl_seq_clr(dst+1+dst_nparam+in_off+src_in,
736 dst_in - in_off - src_in);
737 isl_seq_clr(dst+1+dst_nparam+dst_in, out_off);
738 isl_seq_cpy(dst+1+dst_nparam+dst_in+out_off,
739 src+1+src_nparam+src_in,
740 isl_min(dst_out-out_off, src_out));
741 if (dst_out-out_off > src_out)
742 isl_seq_clr(dst+1+dst_nparam+dst_in+out_off+src_out,
743 dst_out - out_off - src_out);
744 isl_seq_clr(dst+1+dst_nparam+dst_in+dst_out, div_off);
745 isl_seq_cpy(dst+1+dst_nparam+dst_in+dst_out+div_off,
746 src+1+src_nparam+src_in+src_out,
747 isl_min(dst_map->extra-div_off, src_map->n_div));
748 if (dst_map->n_div-div_off > src_map->n_div)
749 isl_seq_clr(dst+1+dst_nparam+dst_in+dst_out+
750 div_off+src_map->n_div,
751 dst_map->n_div - div_off - src_map->n_div);
754 static void copy_div(struct isl_basic_map *dst_map, isl_int *dst,
755 struct isl_basic_map *src_map, isl_int *src,
756 unsigned in_off, unsigned out_off, unsigned div_off)
758 isl_int_set(dst[0], src[0]);
759 copy_constraint(dst_map, dst+1, src_map, src+1, in_off, out_off, div_off);
762 static struct isl_basic_map *add_constraints(struct isl_basic_map *bmap1,
763 struct isl_basic_map *bmap2, unsigned i_pos, unsigned o_pos)
768 if (!bmap1 || !bmap2)
771 div_off = bmap1->n_div;
773 for (i = 0; i < bmap2->n_eq; ++i) {
774 int i1 = isl_basic_map_alloc_equality(bmap1);
777 copy_constraint(bmap1, bmap1->eq[i1], bmap2, bmap2->eq[i],
778 i_pos, o_pos, div_off);
781 for (i = 0; i < bmap2->n_ineq; ++i) {
782 int i1 = isl_basic_map_alloc_inequality(bmap1);
785 copy_constraint(bmap1, bmap1->ineq[i1], bmap2, bmap2->ineq[i],
786 i_pos, o_pos, div_off);
789 for (i = 0; i < bmap2->n_div; ++i) {
790 int i1 = isl_basic_map_alloc_div(bmap1);
793 copy_div(bmap1, bmap1->div[i1], bmap2, bmap2->div[i],
794 i_pos, o_pos, div_off);
797 isl_basic_map_free(bmap2);
802 isl_basic_map_free(bmap1);
803 isl_basic_map_free(bmap2);
807 static void copy_constraint_dim_map(isl_int *dst, isl_int *src,
808 struct isl_dim_map *dim_map)
812 for (i = 0; i < dim_map->len; ++i) {
813 if (dim_map->pos[i] < 0)
814 isl_int_set_si(dst[i], 0);
816 isl_int_set(dst[i], src[dim_map->pos[i]]);
820 static void copy_div_dim_map(isl_int *dst, isl_int *src,
821 struct isl_dim_map *dim_map)
823 isl_int_set(dst[0], src[0]);
824 copy_constraint_dim_map(dst+1, src+1, dim_map);
827 static struct isl_basic_map *add_constraints_dim_map(struct isl_basic_map *dst,
828 struct isl_basic_map *src, struct isl_dim_map *dim_map)
832 if (!src || !dst || !dim_map)
835 for (i = 0; i < src->n_eq; ++i) {
836 int i1 = isl_basic_map_alloc_equality(dst);
839 copy_constraint_dim_map(dst->eq[i1], src->eq[i], dim_map);
842 for (i = 0; i < src->n_ineq; ++i) {
843 int i1 = isl_basic_map_alloc_inequality(dst);
846 copy_constraint_dim_map(dst->ineq[i1], src->ineq[i], dim_map);
849 for (i = 0; i < src->n_div; ++i) {
850 int i1 = isl_basic_map_alloc_div(dst);
853 copy_div_dim_map(dst->div[i1], src->div[i], dim_map);
857 isl_basic_map_free(src);
862 isl_basic_map_free(src);
863 isl_basic_map_free(dst);
867 struct isl_basic_set *isl_basic_set_add_constraints(struct isl_basic_set *bset1,
868 struct isl_basic_set *bset2, unsigned pos)
870 return (struct isl_basic_set *)
871 add_constraints((struct isl_basic_map *)bset1,
872 (struct isl_basic_map *)bset2, 0, pos);
875 struct isl_basic_map *isl_basic_map_extend_dim(struct isl_basic_map *base,
876 struct isl_dim *dim, unsigned extra,
877 unsigned n_eq, unsigned n_ineq)
879 struct isl_basic_map *ext;
889 dims_ok = isl_dim_equal(base->dim, dim) &&
890 base->extra >= base->n_div + extra;
892 if (dims_ok && room_for_con(base, n_eq + n_ineq) &&
893 room_for_ineq(base, n_ineq)) {
898 isl_assert(base->ctx, base->dim->nparam <= dim->nparam, goto error);
899 isl_assert(base->ctx, base->dim->n_in <= dim->n_in, goto error);
900 isl_assert(base->ctx, base->dim->n_out <= dim->n_out, goto error);
901 extra += base->extra;
903 n_ineq += base->n_ineq;
905 ext = isl_basic_map_alloc_dim(dim, extra, n_eq, n_ineq);
911 ext->sample = isl_vec_copy(base->sample);
913 ext = add_constraints(ext, base, 0, 0);
916 ISL_F_CLR(ext, ISL_BASIC_SET_FINAL);
923 isl_basic_map_free(base);
927 struct isl_basic_set *isl_basic_set_extend_dim(struct isl_basic_set *base,
928 struct isl_dim *dim, unsigned extra,
929 unsigned n_eq, unsigned n_ineq)
931 return (struct isl_basic_set *)
932 isl_basic_map_extend_dim((struct isl_basic_map *)base, dim,
933 extra, n_eq, n_ineq);
936 struct isl_basic_map *isl_basic_map_extend_constraints(
937 struct isl_basic_map *base, unsigned n_eq, unsigned n_ineq)
941 return isl_basic_map_extend_dim(base, isl_dim_copy(base->dim),
945 struct isl_basic_map *isl_basic_map_extend(struct isl_basic_map *base,
946 unsigned nparam, unsigned n_in, unsigned n_out, unsigned extra,
947 unsigned n_eq, unsigned n_ineq)
949 struct isl_basic_map *bmap;
954 dim = isl_dim_alloc(base->ctx, nparam, n_in, n_out);
958 bmap = isl_basic_map_extend_dim(base, dim, extra, n_eq, n_ineq);
962 struct isl_basic_set *isl_basic_set_extend(struct isl_basic_set *base,
963 unsigned nparam, unsigned dim, unsigned extra,
964 unsigned n_eq, unsigned n_ineq)
966 return (struct isl_basic_set *)
967 isl_basic_map_extend((struct isl_basic_map *)base,
968 nparam, 0, dim, extra, n_eq, n_ineq);
971 struct isl_basic_set *isl_basic_set_extend_constraints(
972 struct isl_basic_set *base, unsigned n_eq, unsigned n_ineq)
974 return (struct isl_basic_set *)
975 isl_basic_map_extend_constraints((struct isl_basic_map *)base,
979 struct isl_basic_set *isl_basic_set_cow(struct isl_basic_set *bset)
981 return (struct isl_basic_set *)
982 isl_basic_map_cow((struct isl_basic_map *)bset);
985 struct isl_basic_map *isl_basic_map_cow(struct isl_basic_map *bmap)
992 bmap = isl_basic_map_dup(bmap);
994 ISL_F_CLR(bmap, ISL_BASIC_SET_FINAL);
998 struct isl_set *isl_set_cow(struct isl_set *set)
1006 return isl_set_dup(set);
1009 struct isl_map *isl_map_cow(struct isl_map *map)
1017 return isl_map_dup(map);
1020 static void swap_vars(struct isl_blk blk, isl_int *a,
1021 unsigned a_len, unsigned b_len)
1023 isl_seq_cpy(blk.data, a+a_len, b_len);
1024 isl_seq_cpy(blk.data+b_len, a, a_len);
1025 isl_seq_cpy(a, blk.data, b_len+a_len);
1028 struct isl_basic_set *isl_basic_set_swap_vars(
1029 struct isl_basic_set *bset, unsigned n)
1039 nparam = isl_basic_set_n_param(bset);
1040 dim = isl_basic_set_n_dim(bset);
1041 isl_assert(bset->ctx, n <= dim, goto error);
1046 bset = isl_basic_set_cow(bset);
1050 blk = isl_blk_alloc(bset->ctx, dim);
1051 if (isl_blk_is_error(blk))
1054 for (i = 0; i < bset->n_eq; ++i)
1056 bset->eq[i]+1+nparam, n, dim - n);
1058 for (i = 0; i < bset->n_ineq; ++i)
1060 bset->ineq[i]+1+nparam, n, dim - n);
1062 for (i = 0; i < bset->n_div; ++i)
1064 bset->div[i]+1+1+nparam, n, dim - n);
1066 isl_blk_free(bset->ctx, blk);
1068 ISL_F_CLR(bset, ISL_BASIC_SET_NORMALIZED);
1072 isl_basic_set_free(bset);
1076 struct isl_set *isl_set_swap_vars(struct isl_set *set, unsigned n)
1079 set = isl_set_cow(set);
1083 for (i = 0; i < set->n; ++i) {
1084 set->p[i] = isl_basic_set_swap_vars(set->p[i], n);
1090 ISL_F_CLR(set, ISL_SET_NORMALIZED);
1094 struct isl_basic_map *isl_basic_map_set_to_empty(struct isl_basic_map *bmap)
1100 total = isl_basic_map_total_dim(bmap);
1101 isl_basic_map_free_div(bmap, bmap->n_div);
1102 isl_basic_map_free_inequality(bmap, bmap->n_ineq);
1104 isl_basic_map_free_equality(bmap, bmap->n_eq-1);
1106 isl_basic_map_alloc_equality(bmap);
1110 isl_int_set_si(bmap->eq[i][0], 1);
1111 isl_seq_clr(bmap->eq[i]+1, total);
1112 ISL_F_SET(bmap, ISL_BASIC_MAP_EMPTY);
1113 return isl_basic_map_finalize(bmap);
1115 isl_basic_map_free(bmap);
1119 struct isl_basic_set *isl_basic_set_set_to_empty(struct isl_basic_set *bset)
1121 return (struct isl_basic_set *)
1122 isl_basic_map_set_to_empty((struct isl_basic_map *)bset);
1125 void isl_basic_map_swap_div(struct isl_basic_map *bmap, int a, int b)
1128 unsigned off = isl_dim_total(bmap->dim);
1129 isl_int *t = bmap->div[a];
1130 bmap->div[a] = bmap->div[b];
1133 for (i = 0; i < bmap->n_eq; ++i)
1134 isl_int_swap(bmap->eq[i][1+off+a], bmap->eq[i][1+off+b]);
1136 for (i = 0; i < bmap->n_ineq; ++i)
1137 isl_int_swap(bmap->ineq[i][1+off+a], bmap->ineq[i][1+off+b]);
1139 for (i = 0; i < bmap->n_div; ++i)
1140 isl_int_swap(bmap->div[i][1+1+off+a], bmap->div[i][1+1+off+b]);
1141 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1144 /* Eliminate the specified n dimensions starting at first from the
1145 * constraints using Fourier-Motzkin, The dimensions themselves
1148 struct isl_set *isl_set_eliminate_dims(struct isl_set *set,
1149 unsigned first, unsigned n)
1159 set = isl_set_cow(set);
1162 isl_assert(set->ctx, first+n <= isl_set_n_dim(set), goto error);
1163 nparam = isl_set_n_param(set);
1165 for (i = 0; i < set->n; ++i) {
1166 set->p[i] = isl_basic_set_eliminate_vars(set->p[i],
1177 /* Project out n dimensions starting at first using Fourier-Motzkin */
1178 struct isl_set *isl_set_remove_dims(struct isl_set *set,
1179 unsigned first, unsigned n)
1181 set = isl_set_eliminate_dims(set, first, n);
1182 set = isl_set_drop_dims(set, first, n);
1186 struct isl_basic_set *isl_basic_set_remove_divs(struct isl_basic_set *bset)
1188 bset = isl_basic_set_eliminate_vars(bset, isl_dim_total(bset->dim),
1196 struct isl_set *isl_set_remove_divs(struct isl_set *set)
1205 set = isl_set_cow(set);
1209 for (i = 0; i < set->n; ++i) {
1210 set->p[i] = isl_basic_set_remove_divs(set->p[i]);
1220 struct isl_basic_map *isl_basic_map_remove(struct isl_basic_map *bmap,
1221 enum isl_dim_type type, unsigned first, unsigned n)
1225 isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
1229 bmap = isl_basic_map_eliminate_vars(bmap,
1230 isl_basic_map_offset(bmap, type) - 1 + first, n);
1233 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY) && type == isl_dim_div)
1235 bmap = isl_basic_map_drop(bmap, type, first, n);
1238 isl_basic_map_free(bmap);
1242 struct isl_map *isl_map_remove(struct isl_map *map,
1243 enum isl_dim_type type, unsigned first, unsigned n)
1250 map = isl_map_cow(map);
1253 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
1255 for (i = 0; i < map->n; ++i) {
1256 map->p[i] = isl_basic_map_eliminate_vars(map->p[i],
1257 isl_basic_map_offset(map->p[i], type) - 1 + first, n);
1261 map = isl_map_drop(map, type, first, n);
1268 /* Project out n inputs starting at first using Fourier-Motzkin */
1269 struct isl_map *isl_map_remove_inputs(struct isl_map *map,
1270 unsigned first, unsigned n)
1272 return isl_map_remove(map, isl_dim_in, first, n);
1275 /* Project out n dimensions starting at first using Fourier-Motzkin */
1276 struct isl_basic_set *isl_basic_set_remove_dims(struct isl_basic_set *bset,
1277 unsigned first, unsigned n)
1279 unsigned nparam = isl_basic_set_n_param(bset);
1280 bset = isl_basic_set_eliminate_vars(bset, nparam + first, n);
1281 bset = isl_basic_set_drop_dims(bset, first, n);
1285 static void dump_term(struct isl_basic_map *bmap,
1286 isl_int c, int pos, FILE *out)
1289 unsigned in = isl_basic_map_n_in(bmap);
1290 unsigned dim = in + isl_basic_map_n_out(bmap);
1291 unsigned nparam = isl_basic_map_n_param(bmap);
1293 isl_int_print(out, c, 0);
1295 if (!isl_int_is_one(c))
1296 isl_int_print(out, c, 0);
1297 if (pos < 1 + nparam) {
1298 name = isl_dim_get_name(bmap->dim,
1299 isl_dim_param, pos - 1);
1301 fprintf(out, "%s", name);
1303 fprintf(out, "p%d", pos - 1);
1304 } else if (pos < 1 + nparam + in)
1305 fprintf(out, "i%d", pos - 1 - nparam);
1306 else if (pos < 1 + nparam + dim)
1307 fprintf(out, "o%d", pos - 1 - nparam - in);
1309 fprintf(out, "e%d", pos - 1 - nparam - dim);
1313 static void dump_constraint_sign(struct isl_basic_map *bmap, isl_int *c,
1314 int sign, FILE *out)
1318 unsigned len = 1 + isl_basic_map_total_dim(bmap);
1322 for (i = 0, first = 1; i < len; ++i) {
1323 if (isl_int_sgn(c[i]) * sign <= 0)
1326 fprintf(out, " + ");
1328 isl_int_abs(v, c[i]);
1329 dump_term(bmap, v, i, out);
1336 static void dump_constraint(struct isl_basic_map *bmap, isl_int *c,
1337 const char *op, FILE *out, int indent)
1341 fprintf(out, "%*s", indent, "");
1343 dump_constraint_sign(bmap, c, 1, out);
1344 fprintf(out, " %s ", op);
1345 dump_constraint_sign(bmap, c, -1, out);
1349 for (i = bmap->n_div; i < bmap->extra; ++i) {
1350 if (isl_int_is_zero(c[1+isl_dim_total(bmap->dim)+i]))
1352 fprintf(out, "%*s", indent, "");
1353 fprintf(out, "ERROR: unused div coefficient not zero\n");
1358 static void dump_constraints(struct isl_basic_map *bmap,
1359 isl_int **c, unsigned n,
1360 const char *op, FILE *out, int indent)
1364 for (i = 0; i < n; ++i)
1365 dump_constraint(bmap, c[i], op, out, indent);
1368 static void dump_affine(struct isl_basic_map *bmap, isl_int *exp, FILE *out)
1372 unsigned total = isl_basic_map_total_dim(bmap);
1374 for (j = 0; j < 1 + total; ++j) {
1375 if (isl_int_is_zero(exp[j]))
1377 if (!first && isl_int_is_pos(exp[j]))
1379 dump_term(bmap, exp[j], j, out);
1384 static void dump(struct isl_basic_map *bmap, FILE *out, int indent)
1388 dump_constraints(bmap, bmap->eq, bmap->n_eq, "=", out, indent);
1389 dump_constraints(bmap, bmap->ineq, bmap->n_ineq, ">=", out, indent);
1391 for (i = 0; i < bmap->n_div; ++i) {
1392 fprintf(out, "%*s", indent, "");
1393 fprintf(out, "e%d = [(", i);
1394 dump_affine(bmap, bmap->div[i]+1, out);
1396 isl_int_print(out, bmap->div[i][0], 0);
1397 fprintf(out, "]\n");
1401 void isl_basic_set_dump(struct isl_basic_set *bset, FILE *out, int indent)
1404 fprintf(out, "null basic set\n");
1408 fprintf(out, "%*s", indent, "");
1409 fprintf(out, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n",
1410 bset->ref, bset->dim->nparam, bset->dim->n_out,
1411 bset->extra, bset->flags);
1412 dump((struct isl_basic_map *)bset, out, indent);
1415 void isl_basic_map_dump(struct isl_basic_map *bmap, FILE *out, int indent)
1418 fprintf(out, "null basic map\n");
1422 fprintf(out, "%*s", indent, "");
1423 fprintf(out, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, "
1424 "flags: %x, n_name: %d\n",
1426 bmap->dim->nparam, bmap->dim->n_in, bmap->dim->n_out,
1427 bmap->extra, bmap->flags, bmap->dim->n_name);
1428 dump(bmap, out, indent);
1431 int isl_inequality_negate(struct isl_basic_map *bmap, unsigned pos)
1436 total = isl_basic_map_total_dim(bmap);
1437 isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
1438 isl_seq_neg(bmap->ineq[pos], bmap->ineq[pos], 1 + total);
1439 isl_int_sub_ui(bmap->ineq[pos][0], bmap->ineq[pos][0], 1);
1440 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1444 struct isl_set *isl_set_alloc_dim(struct isl_dim *dim, int n, unsigned flags)
1446 struct isl_set *set;
1450 isl_assert(dim->ctx, dim->n_in == 0, return NULL);
1451 isl_assert(dim->ctx, n >= 0, return NULL);
1452 set = isl_alloc(dim->ctx, struct isl_set,
1453 sizeof(struct isl_set) +
1454 (n - 1) * sizeof(struct isl_basic_set *));
1458 set->ctx = dim->ctx;
1459 isl_ctx_ref(set->ctx);
1471 struct isl_set *isl_set_alloc(struct isl_ctx *ctx,
1472 unsigned nparam, unsigned dim, int n, unsigned flags)
1474 struct isl_set *set;
1475 struct isl_dim *dims;
1477 dims = isl_dim_alloc(ctx, nparam, 0, dim);
1481 set = isl_set_alloc_dim(dims, n, flags);
1485 /* Make sure "map" has room for at least "n" more basic maps.
1487 struct isl_map *isl_map_grow(struct isl_map *map, int n)
1490 struct isl_map *grown = NULL;
1494 isl_assert(map->ctx, n >= 0, goto error);
1495 if (map->n + n <= map->size)
1497 grown = isl_map_alloc_dim(isl_map_get_dim(map), map->n + n, map->flags);
1500 for (i = 0; i < map->n; ++i) {
1501 grown->p[i] = isl_basic_map_copy(map->p[i]);
1509 isl_map_free(grown);
1514 /* Make sure "set" has room for at least "n" more basic sets.
1516 struct isl_set *isl_set_grow(struct isl_set *set, int n)
1518 return (struct isl_set *)isl_map_grow((struct isl_map *)set, n);
1521 struct isl_set *isl_set_dup(struct isl_set *set)
1524 struct isl_set *dup;
1529 dup = isl_set_alloc_dim(isl_dim_copy(set->dim), set->n, set->flags);
1532 for (i = 0; i < set->n; ++i)
1533 dup = isl_set_add(dup, isl_basic_set_copy(set->p[i]));
1537 struct isl_set *isl_set_from_basic_set(struct isl_basic_set *bset)
1539 struct isl_set *set;
1544 set = isl_set_alloc_dim(isl_dim_copy(bset->dim), 1, ISL_MAP_DISJOINT);
1546 isl_basic_set_free(bset);
1549 return isl_set_add(set, bset);
1552 struct isl_map *isl_map_from_basic_map(struct isl_basic_map *bmap)
1554 struct isl_map *map;
1559 map = isl_map_alloc_dim(isl_dim_copy(bmap->dim), 1, ISL_MAP_DISJOINT);
1561 isl_basic_map_free(bmap);
1564 return isl_map_add(map, bmap);
1567 struct isl_set *isl_set_add(struct isl_set *set, struct isl_basic_set *bset)
1569 return (struct isl_set *)isl_map_add((struct isl_map *)set,
1570 (struct isl_basic_map *)bset);
1573 void isl_set_free(struct isl_set *set)
1583 isl_ctx_deref(set->ctx);
1584 for (i = 0; i < set->n; ++i)
1585 isl_basic_set_free(set->p[i]);
1586 isl_dim_free(set->dim);
1590 void isl_set_dump(struct isl_set *set, FILE *out, int indent)
1595 fprintf(out, "null set\n");
1599 fprintf(out, "%*s", indent, "");
1600 fprintf(out, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
1601 set->ref, set->n, set->dim->nparam, set->dim->n_out,
1603 for (i = 0; i < set->n; ++i) {
1604 fprintf(out, "%*s", indent, "");
1605 fprintf(out, "basic set %d:\n", i);
1606 isl_basic_set_dump(set->p[i], out, indent+4);
1610 void isl_map_dump(struct isl_map *map, FILE *out, int indent)
1615 fprintf(out, "null map\n");
1619 fprintf(out, "%*s", indent, "");
1620 fprintf(out, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, "
1621 "flags: %x, n_name: %d\n",
1622 map->ref, map->n, map->dim->nparam, map->dim->n_in,
1623 map->dim->n_out, map->flags, map->dim->n_name);
1624 for (i = 0; i < map->n; ++i) {
1625 fprintf(out, "%*s", indent, "");
1626 fprintf(out, "basic map %d:\n", i);
1627 isl_basic_map_dump(map->p[i], out, indent+4);
1631 struct isl_basic_map *isl_basic_map_intersect_domain(
1632 struct isl_basic_map *bmap, struct isl_basic_set *bset)
1634 struct isl_basic_map *bmap_domain;
1635 struct isl_dim *dim;
1640 isl_assert(bset->ctx, isl_dim_match(bmap->dim, isl_dim_param,
1641 bset->dim, isl_dim_param), goto error);
1643 if (isl_dim_size(bset->dim, isl_dim_set) != 0)
1644 isl_assert(bset->ctx,
1645 isl_basic_map_compatible_domain(bmap, bset), goto error);
1647 bmap = isl_basic_map_cow(bmap);
1648 bmap = isl_basic_map_extend_dim(bmap, isl_dim_copy(bmap->dim),
1649 bset->n_div, bset->n_eq, bset->n_ineq);
1652 dim = isl_dim_reverse(isl_dim_copy(bset->dim));
1653 bmap_domain = isl_basic_map_from_basic_set(bset, dim);
1654 bmap = add_constraints(bmap, bmap_domain, 0, 0);
1656 bmap = isl_basic_map_simplify(bmap);
1657 return isl_basic_map_finalize(bmap);
1659 isl_basic_map_free(bmap);
1660 isl_basic_set_free(bset);
1664 struct isl_basic_map *isl_basic_map_intersect_range(
1665 struct isl_basic_map *bmap, struct isl_basic_set *bset)
1667 struct isl_basic_map *bmap_range;
1672 isl_assert(bset->ctx, isl_dim_match(bmap->dim, isl_dim_param,
1673 bset->dim, isl_dim_param), goto error);
1675 if (isl_dim_size(bset->dim, isl_dim_set) != 0)
1676 isl_assert(bset->ctx,
1677 isl_basic_map_compatible_range(bmap, bset), goto error);
1679 bmap = isl_basic_map_cow(bmap);
1680 bmap = isl_basic_map_extend_dim(bmap, isl_dim_copy(bmap->dim),
1681 bset->n_div, bset->n_eq, bset->n_ineq);
1684 bmap_range = isl_basic_map_from_basic_set(bset, isl_dim_copy(bset->dim));
1685 bmap = add_constraints(bmap, bmap_range, 0, 0);
1687 bmap = isl_basic_map_simplify(bmap);
1688 return isl_basic_map_finalize(bmap);
1690 isl_basic_map_free(bmap);
1691 isl_basic_set_free(bset);
1695 static int basic_map_contains(struct isl_basic_map *bmap, struct isl_vec *vec)
1701 total = 1 + isl_basic_map_total_dim(bmap);
1702 if (total != vec->size)
1707 for (i = 0; i < bmap->n_eq; ++i) {
1708 isl_seq_inner_product(vec->el, bmap->eq[i], total, &s);
1709 if (!isl_int_is_zero(s)) {
1715 for (i = 0; i < bmap->n_ineq; ++i) {
1716 isl_seq_inner_product(vec->el, bmap->ineq[i], total, &s);
1717 if (isl_int_is_neg(s)) {
1728 int isl_basic_set_contains(struct isl_basic_set *bset, struct isl_vec *vec)
1730 return basic_map_contains((struct isl_basic_map *)bset, vec);
1733 struct isl_basic_map *isl_basic_map_intersect(
1734 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
1736 struct isl_vec *sample = NULL;
1738 if (!bmap1 || !bmap2)
1741 isl_assert(bmap1->ctx, isl_dim_match(bmap1->dim, isl_dim_param,
1742 bmap2->dim, isl_dim_param), goto error);
1743 if (isl_dim_total(bmap1->dim) ==
1744 isl_dim_size(bmap1->dim, isl_dim_param) &&
1745 isl_dim_total(bmap2->dim) !=
1746 isl_dim_size(bmap2->dim, isl_dim_param))
1747 return isl_basic_map_intersect(bmap2, bmap1);
1749 if (isl_dim_total(bmap2->dim) !=
1750 isl_dim_size(bmap2->dim, isl_dim_param))
1751 isl_assert(bmap1->ctx,
1752 isl_dim_equal(bmap1->dim, bmap2->dim), goto error);
1754 if (bmap1->sample &&
1755 basic_map_contains(bmap1, bmap1->sample) > 0 &&
1756 basic_map_contains(bmap2, bmap1->sample) > 0)
1757 sample = isl_vec_copy(bmap1->sample);
1758 else if (bmap2->sample &&
1759 basic_map_contains(bmap1, bmap2->sample) > 0 &&
1760 basic_map_contains(bmap2, bmap2->sample) > 0)
1761 sample = isl_vec_copy(bmap2->sample);
1763 bmap1 = isl_basic_map_cow(bmap1);
1764 bmap1 = isl_basic_map_extend_dim(bmap1, isl_dim_copy(bmap1->dim),
1765 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
1768 bmap1 = add_constraints(bmap1, bmap2, 0, 0);
1771 isl_vec_free(bmap1->sample);
1772 bmap1->sample = sample;
1775 bmap1 = isl_basic_map_simplify(bmap1);
1776 return isl_basic_map_finalize(bmap1);
1779 isl_vec_free(sample);
1780 isl_basic_map_free(bmap1);
1781 isl_basic_map_free(bmap2);
1785 struct isl_basic_set *isl_basic_set_intersect(
1786 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
1788 return (struct isl_basic_set *)
1789 isl_basic_map_intersect(
1790 (struct isl_basic_map *)bset1,
1791 (struct isl_basic_map *)bset2);
1794 struct isl_map *isl_map_intersect(struct isl_map *map1, struct isl_map *map2)
1797 struct isl_map *result;
1803 isl_assert(map1->ctx, isl_dim_match(map1->dim, isl_dim_param,
1804 map2->dim, isl_dim_param), goto error);
1805 if (isl_dim_total(map1->dim) ==
1806 isl_dim_size(map1->dim, isl_dim_param) &&
1807 isl_dim_total(map2->dim) != isl_dim_size(map2->dim, isl_dim_param))
1808 return isl_map_intersect(map2, map1);
1810 if (isl_dim_total(map2->dim) != isl_dim_size(map2->dim, isl_dim_param))
1811 isl_assert(map1->ctx,
1812 isl_dim_equal(map1->dim, map2->dim), goto error);
1814 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
1815 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
1816 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
1818 result = isl_map_alloc_dim(isl_dim_copy(map1->dim),
1819 map1->n * map2->n, flags);
1822 for (i = 0; i < map1->n; ++i)
1823 for (j = 0; j < map2->n; ++j) {
1824 struct isl_basic_map *part;
1825 part = isl_basic_map_intersect(
1826 isl_basic_map_copy(map1->p[i]),
1827 isl_basic_map_copy(map2->p[j]));
1828 if (isl_basic_map_is_empty(part))
1829 isl_basic_map_free(part);
1831 result = isl_map_add(result, part);
1844 struct isl_set *isl_set_intersect(struct isl_set *set1, struct isl_set *set2)
1846 return (struct isl_set *)
1847 isl_map_intersect((struct isl_map *)set1,
1848 (struct isl_map *)set2);
1851 struct isl_basic_map *isl_basic_map_reverse(struct isl_basic_map *bmap)
1853 struct isl_dim *dim;
1854 struct isl_basic_set *bset;
1859 bmap = isl_basic_map_cow(bmap);
1862 dim = isl_dim_reverse(isl_dim_copy(bmap->dim));
1863 in = isl_basic_map_n_in(bmap);
1864 bset = isl_basic_set_from_basic_map(bmap);
1865 bset = isl_basic_set_swap_vars(bset, in);
1866 return isl_basic_map_from_basic_set(bset, dim);
1869 /* Turn final n dimensions into existentially quantified variables.
1871 struct isl_basic_set *isl_basic_set_project_out(struct isl_basic_set *bset,
1872 enum isl_dim_type type, unsigned first, unsigned n)
1882 isl_assert(bset->ctx, type == isl_dim_set, goto error);
1883 isl_assert(bset->ctx, first + n == isl_basic_set_n_dim(bset), goto error);
1888 bset = isl_basic_set_cow(bset);
1890 row_size = 1 + isl_dim_total(bset->dim) + bset->extra;
1891 old = bset->block2.data;
1892 bset->block2 = isl_blk_extend(bset->ctx, bset->block2,
1893 (bset->extra + n) * (1 + row_size));
1894 if (!bset->block2.data)
1896 new_div = isl_alloc_array(ctx, isl_int *, bset->extra + n);
1899 for (i = 0; i < n; ++i) {
1900 new_div[i] = bset->block2.data +
1901 (bset->extra + i) * (1 + row_size);
1902 isl_seq_clr(new_div[i], 1 + row_size);
1904 for (i = 0; i < bset->extra; ++i)
1905 new_div[n + i] = bset->block2.data + (bset->div[i] - old);
1907 bset->div = new_div;
1910 bset->dim = isl_dim_drop_outputs(bset->dim,
1911 isl_basic_set_n_dim(bset) - n, n);
1914 bset = isl_basic_set_simplify(bset);
1915 bset = isl_basic_set_drop_redundant_divs(bset);
1916 return isl_basic_set_finalize(bset);
1918 isl_basic_set_free(bset);
1922 /* Turn final n dimensions into existentially quantified variables.
1924 __isl_give isl_set *isl_set_project_out(__isl_take isl_set *set,
1925 enum isl_dim_type type, unsigned first, unsigned n)
1932 isl_assert(set->ctx, type == isl_dim_set, goto error);
1933 isl_assert(set->ctx, first + n == isl_set_n_dim(set), goto error);
1938 set = isl_set_cow(set);
1941 set->dim = isl_dim_drop_outputs(set->dim, first, n);
1942 for (i = 0; i < set->n; ++i) {
1943 set->p[i] = isl_basic_set_project_out(set->p[i], type, first, n);
1948 ISL_F_CLR(set, ISL_SET_NORMALIZED);
1955 static struct isl_basic_map *add_divs(struct isl_basic_map *bmap, unsigned n)
1959 for (i = 0; i < n; ++i) {
1960 j = isl_basic_map_alloc_div(bmap);
1963 isl_seq_clr(bmap->div[j], 1+1+isl_basic_map_total_dim(bmap));
1967 isl_basic_map_free(bmap);
1971 struct isl_basic_map *isl_basic_map_apply_range(
1972 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
1974 struct isl_dim *dim_result = NULL;
1975 struct isl_basic_map *bmap;
1976 unsigned n_in, n_out, n, nparam, total, pos;
1977 struct isl_dim_map *dim_map1, *dim_map2;
1979 if (!bmap1 || !bmap2)
1982 dim_result = isl_dim_join(isl_dim_copy(bmap1->dim),
1983 isl_dim_copy(bmap2->dim));
1985 n_in = isl_basic_map_n_in(bmap1);
1986 n_out = isl_basic_map_n_out(bmap2);
1987 n = isl_basic_map_n_out(bmap1);
1988 nparam = isl_basic_map_n_param(bmap1);
1990 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + n;
1991 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
1992 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
1993 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
1994 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
1995 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
1996 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_in);
1997 isl_dim_map_div(dim_map1, bmap1, pos += n_out);
1998 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
1999 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
2000 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
2002 bmap = isl_basic_map_alloc_dim(dim_result,
2003 bmap1->n_div + bmap2->n_div + n,
2004 bmap1->n_eq + bmap2->n_eq,
2005 bmap1->n_ineq + bmap2->n_ineq);
2006 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
2007 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
2008 bmap = add_divs(bmap, n);
2009 bmap = isl_basic_map_simplify(bmap);
2010 bmap = isl_basic_map_drop_redundant_divs(bmap);
2011 return isl_basic_map_finalize(bmap);
2013 isl_basic_map_free(bmap1);
2014 isl_basic_map_free(bmap2);
2018 struct isl_basic_set *isl_basic_set_apply(
2019 struct isl_basic_set *bset, struct isl_basic_map *bmap)
2024 isl_assert(bset->ctx, isl_basic_map_compatible_domain(bmap, bset),
2027 return (struct isl_basic_set *)
2028 isl_basic_map_apply_range((struct isl_basic_map *)bset, bmap);
2030 isl_basic_set_free(bset);
2031 isl_basic_map_free(bmap);
2035 struct isl_basic_map *isl_basic_map_apply_domain(
2036 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2038 if (!bmap1 || !bmap2)
2041 isl_assert(bmap1->ctx,
2042 isl_basic_map_n_in(bmap1) == isl_basic_map_n_in(bmap2), goto error);
2043 isl_assert(bmap1->ctx,
2044 isl_basic_map_n_param(bmap1) == isl_basic_map_n_param(bmap2),
2047 bmap1 = isl_basic_map_reverse(bmap1);
2048 bmap1 = isl_basic_map_apply_range(bmap1, bmap2);
2049 return isl_basic_map_reverse(bmap1);
2051 isl_basic_map_free(bmap1);
2052 isl_basic_map_free(bmap2);
2056 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
2057 * A \cap B -> f(A) + f(B)
2059 struct isl_basic_map *isl_basic_map_sum(
2060 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2062 unsigned n_in, n_out, nparam, total, pos;
2063 struct isl_basic_map *bmap = NULL;
2064 struct isl_dim_map *dim_map1, *dim_map2;
2067 if (!bmap1 || !bmap2)
2070 isl_assert(bmap1->ctx, isl_dim_equal(bmap1->dim, bmap2->dim),
2073 nparam = isl_basic_map_n_param(bmap1);
2074 n_in = isl_basic_map_n_in(bmap1);
2075 n_out = isl_basic_map_n_out(bmap1);
2077 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + 2 * n_out;
2078 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
2079 dim_map2 = isl_dim_map_alloc(bmap2->ctx, total);
2080 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
2081 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos);
2082 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
2083 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
2084 isl_dim_map_div(dim_map1, bmap1, pos += n_in + n_out);
2085 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
2086 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
2087 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_out);
2089 bmap = isl_basic_map_alloc_dim(isl_dim_copy(bmap1->dim),
2090 bmap1->n_div + bmap2->n_div + 2 * n_out,
2091 bmap1->n_eq + bmap2->n_eq + n_out,
2092 bmap1->n_ineq + bmap2->n_ineq);
2093 for (i = 0; i < n_out; ++i) {
2094 int j = isl_basic_map_alloc_equality(bmap);
2097 isl_seq_clr(bmap->eq[j], 1+total);
2098 isl_int_set_si(bmap->eq[j][1+nparam+n_in+i], -1);
2099 isl_int_set_si(bmap->eq[j][1+pos+i], 1);
2100 isl_int_set_si(bmap->eq[j][1+pos-n_out+i], 1);
2102 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
2103 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
2104 bmap = add_divs(bmap, 2 * n_out);
2106 bmap = isl_basic_map_simplify(bmap);
2107 return isl_basic_map_finalize(bmap);
2109 isl_basic_map_free(bmap);
2110 isl_basic_map_free(bmap1);
2111 isl_basic_map_free(bmap2);
2115 /* Given two maps A -> f(A) and B -> g(B), construct a map
2116 * A \cap B -> f(A) + f(B)
2118 struct isl_map *isl_map_sum(struct isl_map *map1, struct isl_map *map2)
2120 struct isl_map *result;
2126 isl_assert(map1->ctx, isl_dim_equal(map1->dim, map2->dim), goto error);
2128 result = isl_map_alloc_dim(isl_dim_copy(map1->dim),
2129 map1->n * map2->n, 0);
2132 for (i = 0; i < map1->n; ++i)
2133 for (j = 0; j < map2->n; ++j) {
2134 struct isl_basic_map *part;
2135 part = isl_basic_map_sum(
2136 isl_basic_map_copy(map1->p[i]),
2137 isl_basic_map_copy(map2->p[j]));
2138 if (isl_basic_map_is_empty(part))
2139 isl_basic_map_free(part);
2141 result = isl_map_add(result, part);
2154 /* Given a basic map A -> f(A), construct A -> -f(A).
2156 struct isl_basic_map *isl_basic_map_neg(struct isl_basic_map *bmap)
2161 bmap = isl_basic_map_cow(bmap);
2165 n = isl_basic_map_dim(bmap, isl_dim_out);
2166 off = isl_basic_map_offset(bmap, isl_dim_out);
2167 for (i = 0; i < bmap->n_eq; ++i)
2168 for (j = 0; j < n; ++j)
2169 isl_int_neg(bmap->eq[i][off+j], bmap->eq[i][off+j]);
2170 for (i = 0; i < bmap->n_ineq; ++i)
2171 for (j = 0; j < n; ++j)
2172 isl_int_neg(bmap->ineq[i][off+j], bmap->ineq[i][off+j]);
2173 for (i = 0; i < bmap->n_div; ++i)
2174 for (j = 0; j < n; ++j)
2175 isl_int_neg(bmap->div[i][1+off+j], bmap->div[i][1+off+j]);
2176 return isl_basic_map_finalize(bmap);
2179 /* Given a map A -> f(A), construct A -> -f(A).
2181 struct isl_map *isl_map_neg(struct isl_map *map)
2185 map = isl_map_cow(map);
2189 for (i = 0; i < map->n; ++i) {
2190 map->p[i] = isl_basic_map_neg(map->p[i]);
2201 /* Given a basic map A -> f(A) and an integer d, construct a basic map
2202 * A -> floor(f(A)/d).
2204 struct isl_basic_map *isl_basic_map_floordiv(struct isl_basic_map *bmap,
2207 unsigned n_in, n_out, nparam, total, pos;
2208 struct isl_basic_map *result = NULL;
2209 struct isl_dim_map *dim_map;
2215 nparam = isl_basic_map_n_param(bmap);
2216 n_in = isl_basic_map_n_in(bmap);
2217 n_out = isl_basic_map_n_out(bmap);
2219 total = nparam + n_in + n_out + bmap->n_div + n_out;
2220 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2221 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_param, pos = 0);
2222 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_in, pos += nparam);
2223 isl_dim_map_div(dim_map, bmap, pos += n_in + n_out);
2224 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_out, pos += bmap->n_div);
2226 result = isl_basic_map_alloc_dim(isl_dim_copy(bmap->dim),
2227 bmap->n_div + n_out,
2228 bmap->n_eq, bmap->n_ineq + 2 * n_out);
2229 result = add_constraints_dim_map(result, bmap, dim_map);
2230 result = add_divs(result, n_out);
2231 for (i = 0; i < n_out; ++i) {
2233 j = isl_basic_map_alloc_inequality(result);
2236 isl_seq_clr(result->ineq[j], 1+total);
2237 isl_int_neg(result->ineq[j][1+nparam+n_in+i], d);
2238 isl_int_set_si(result->ineq[j][1+pos+i], 1);
2239 j = isl_basic_map_alloc_inequality(result);
2242 isl_seq_clr(result->ineq[j], 1+total);
2243 isl_int_set(result->ineq[j][1+nparam+n_in+i], d);
2244 isl_int_set_si(result->ineq[j][1+pos+i], -1);
2245 isl_int_sub_ui(result->ineq[j][0], d, 1);
2248 result = isl_basic_map_simplify(result);
2249 return isl_basic_map_finalize(result);
2251 isl_basic_map_free(result);
2255 /* Given a map A -> f(A) and an integer d, construct a map
2256 * A -> floor(f(A)/d).
2258 struct isl_map *isl_map_floordiv(struct isl_map *map, isl_int d)
2262 map = isl_map_cow(map);
2266 ISL_F_CLR(map, ISL_MAP_DISJOINT);
2267 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
2268 for (i = 0; i < map->n; ++i) {
2269 map->p[i] = isl_basic_map_floordiv(map->p[i], d);
2280 static struct isl_basic_map *var_equal(struct isl_basic_map *bmap, unsigned pos)
2286 i = isl_basic_map_alloc_equality(bmap);
2289 nparam = isl_basic_map_n_param(bmap);
2290 n_in = isl_basic_map_n_in(bmap);
2291 isl_seq_clr(bmap->eq[i], 1 + isl_basic_map_total_dim(bmap));
2292 isl_int_set_si(bmap->eq[i][1+nparam+pos], -1);
2293 isl_int_set_si(bmap->eq[i][1+nparam+n_in+pos], 1);
2294 return isl_basic_map_finalize(bmap);
2296 isl_basic_map_free(bmap);
2300 /* Add a constraints to "bmap" expressing i_pos < o_pos
2302 static struct isl_basic_map *var_less(struct isl_basic_map *bmap, unsigned pos)
2308 i = isl_basic_map_alloc_inequality(bmap);
2311 nparam = isl_basic_map_n_param(bmap);
2312 n_in = isl_basic_map_n_in(bmap);
2313 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
2314 isl_int_set_si(bmap->ineq[i][0], -1);
2315 isl_int_set_si(bmap->ineq[i][1+nparam+pos], -1);
2316 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], 1);
2317 return isl_basic_map_finalize(bmap);
2319 isl_basic_map_free(bmap);
2323 /* Add a constraints to "bmap" expressing i_pos > o_pos
2325 static struct isl_basic_map *var_more(struct isl_basic_map *bmap, unsigned pos)
2331 i = isl_basic_map_alloc_inequality(bmap);
2334 nparam = isl_basic_map_n_param(bmap);
2335 n_in = isl_basic_map_n_in(bmap);
2336 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
2337 isl_int_set_si(bmap->ineq[i][0], -1);
2338 isl_int_set_si(bmap->ineq[i][1+nparam+pos], 1);
2339 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], -1);
2340 return isl_basic_map_finalize(bmap);
2342 isl_basic_map_free(bmap);
2346 struct isl_basic_map *isl_basic_map_equal(struct isl_dim *dim, unsigned n_equal)
2349 struct isl_basic_map *bmap;
2350 bmap = isl_basic_map_alloc_dim(dim, 0, n_equal, 0);
2353 for (i = 0; i < n_equal && bmap; ++i)
2354 bmap = var_equal(bmap, i);
2355 return isl_basic_map_finalize(bmap);
2358 /* Return a relation on pairs of sets of dimension "dim" expressing i_pos < o_pos
2360 struct isl_basic_map *isl_basic_map_less_at(struct isl_dim *dim, unsigned pos)
2363 struct isl_basic_map *bmap;
2364 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
2367 for (i = 0; i < pos && bmap; ++i)
2368 bmap = var_equal(bmap, i);
2370 bmap = var_less(bmap, pos);
2371 return isl_basic_map_finalize(bmap);
2374 /* Return a relation on pairs of sets of dimension "dim" expressing i_pos > o_pos
2376 struct isl_basic_map *isl_basic_map_more_at(struct isl_dim *dim, unsigned pos)
2379 struct isl_basic_map *bmap;
2380 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
2383 for (i = 0; i < pos && bmap; ++i)
2384 bmap = var_equal(bmap, i);
2386 bmap = var_more(bmap, pos);
2387 return isl_basic_map_finalize(bmap);
2390 static __isl_give isl_map *map_lex_lte(__isl_take isl_dim *dims, int equal)
2392 struct isl_map *map;
2399 map = isl_map_alloc_dim(isl_dim_copy(dims), dim + equal, ISL_MAP_DISJOINT);
2401 for (i = 0; i < dim; ++i)
2402 map = isl_map_add(map,
2403 isl_basic_map_less_at(isl_dim_copy(dims), i));
2405 map = isl_map_add(map,
2406 isl_basic_map_equal(isl_dim_copy(dims), dim));
2412 __isl_give isl_map *isl_map_lex_lt(__isl_take isl_dim *set_dim)
2414 return map_lex_lte(isl_dim_map(set_dim), 0);
2417 __isl_give isl_map *isl_map_lex_le(__isl_take isl_dim *set_dim)
2419 return map_lex_lte(isl_dim_map(set_dim), 1);
2422 static __isl_give isl_map *map_lex_gte(__isl_take isl_dim *dims, int equal)
2424 struct isl_map *map;
2431 map = isl_map_alloc_dim(isl_dim_copy(dims), dim + equal, ISL_MAP_DISJOINT);
2433 for (i = 0; i < dim; ++i)
2434 map = isl_map_add(map,
2435 isl_basic_map_more_at(isl_dim_copy(dims), i));
2437 map = isl_map_add(map,
2438 isl_basic_map_equal(isl_dim_copy(dims), dim));
2444 __isl_give isl_map *isl_map_lex_gt(__isl_take isl_dim *set_dim)
2446 return map_lex_gte(isl_dim_map(set_dim), 0);
2449 __isl_give isl_map *isl_map_lex_ge(__isl_take isl_dim *set_dim)
2451 return map_lex_gte(isl_dim_map(set_dim), 1);
2454 struct isl_basic_map *isl_basic_map_from_basic_set(
2455 struct isl_basic_set *bset, struct isl_dim *dim)
2457 struct isl_basic_map *bmap;
2459 bset = isl_basic_set_cow(bset);
2463 isl_assert(bset->ctx, isl_dim_compatible(bset->dim, dim), goto error);
2464 isl_dim_free(bset->dim);
2465 bmap = (struct isl_basic_map *) bset;
2467 return isl_basic_map_finalize(bmap);
2469 isl_basic_set_free(bset);
2474 struct isl_basic_set *isl_basic_set_from_basic_map(struct isl_basic_map *bmap)
2478 if (bmap->dim->n_in == 0)
2479 return (struct isl_basic_set *)bmap;
2480 bmap = isl_basic_map_cow(bmap);
2483 bmap->dim = isl_dim_cow(bmap->dim);
2486 bmap->dim->n_out += bmap->dim->n_in;
2487 bmap->dim->n_in = 0;
2488 bmap = isl_basic_map_finalize(bmap);
2489 return (struct isl_basic_set *)bmap;
2491 isl_basic_map_free(bmap);
2495 /* For a div d = floor(f/m), add the constraints
2498 * -(f-(n-1)) + m d >= 0
2500 * Note that the second constraint is the negation of
2504 static int add_div_constraints(struct isl_basic_map *bmap, unsigned div)
2507 unsigned total = isl_basic_map_total_dim(bmap);
2508 unsigned div_pos = 1 + total - bmap->n_div + div;
2510 i = isl_basic_map_alloc_inequality(bmap);
2513 isl_seq_cpy(bmap->ineq[i], bmap->div[div]+1, 1+total);
2514 isl_int_neg(bmap->ineq[i][div_pos], bmap->div[div][0]);
2516 j = isl_basic_map_alloc_inequality(bmap);
2519 isl_seq_neg(bmap->ineq[j], bmap->ineq[i], 1 + total);
2520 isl_int_add(bmap->ineq[j][0], bmap->ineq[j][0], bmap->ineq[j][div_pos]);
2521 isl_int_sub_ui(bmap->ineq[j][0], bmap->ineq[j][0], 1);
2525 struct isl_basic_set *isl_basic_map_underlying_set(
2526 struct isl_basic_map *bmap)
2530 if (bmap->dim->nparam == 0 && bmap->dim->n_in == 0 && bmap->n_div == 0)
2531 return (struct isl_basic_set *)bmap;
2532 bmap = isl_basic_map_cow(bmap);
2535 bmap->dim = isl_dim_underlying(bmap->dim, bmap->n_div);
2538 bmap->extra -= bmap->n_div;
2540 bmap = isl_basic_map_finalize(bmap);
2541 return (struct isl_basic_set *)bmap;
2546 __isl_give isl_basic_set *isl_basic_set_underlying_set(
2547 __isl_take isl_basic_set *bset)
2549 return isl_basic_map_underlying_set((isl_basic_map *)bset);
2552 struct isl_basic_map *isl_basic_map_overlying_set(
2553 struct isl_basic_set *bset, struct isl_basic_map *like)
2555 struct isl_basic_map *bmap;
2556 struct isl_ctx *ctx;
2563 isl_assert(ctx, bset->n_div == 0, goto error);
2564 isl_assert(ctx, isl_basic_set_n_param(bset) == 0, goto error);
2565 isl_assert(ctx, bset->dim->n_out == isl_basic_map_total_dim(like),
2567 if (isl_dim_equal(bset->dim, like->dim) && like->n_div == 0) {
2568 isl_basic_map_free(like);
2569 return (struct isl_basic_map *)bset;
2571 bset = isl_basic_set_cow(bset);
2574 total = bset->dim->n_out + bset->extra;
2575 bmap = (struct isl_basic_map *)bset;
2576 isl_dim_free(bmap->dim);
2577 bmap->dim = isl_dim_copy(like->dim);
2580 bmap->n_div = like->n_div;
2581 bmap->extra += like->n_div;
2584 ltotal = total - bmap->extra + like->extra;
2587 bmap->block2 = isl_blk_extend(ctx, bmap->block2,
2588 bmap->extra * (1 + 1 + total));
2589 if (isl_blk_is_error(bmap->block2))
2591 bmap->div = isl_realloc_array(ctx, bmap->div, isl_int *,
2595 for (i = 0; i < bmap->extra; ++i)
2596 bmap->div[i] = bmap->block2.data + i * (1 + 1 + total);
2597 for (i = 0; i < like->n_div; ++i) {
2598 isl_seq_cpy(bmap->div[i], like->div[i], 1 + 1 + ltotal);
2599 isl_seq_clr(bmap->div[i]+1+1+ltotal, total - ltotal);
2601 bmap = isl_basic_map_extend_constraints(bmap,
2602 0, 2 * like->n_div);
2603 for (i = 0; i < like->n_div; ++i) {
2604 if (isl_int_is_zero(bmap->div[i][0]))
2606 if (add_div_constraints(bmap, i) < 0)
2610 isl_basic_map_free(like);
2611 bmap = isl_basic_map_simplify(bmap);
2612 bmap = isl_basic_map_finalize(bmap);
2615 isl_basic_map_free(like);
2616 isl_basic_set_free(bset);
2620 struct isl_basic_set *isl_basic_set_from_underlying_set(
2621 struct isl_basic_set *bset, struct isl_basic_set *like)
2623 return (struct isl_basic_set *)
2624 isl_basic_map_overlying_set(bset, (struct isl_basic_map *)like);
2627 struct isl_set *isl_set_from_underlying_set(
2628 struct isl_set *set, struct isl_basic_set *like)
2634 isl_assert(set->ctx, set->dim->n_out == isl_basic_set_total_dim(like),
2636 if (isl_dim_equal(set->dim, like->dim) && like->n_div == 0) {
2637 isl_basic_set_free(like);
2640 set = isl_set_cow(set);
2643 for (i = 0; i < set->n; ++i) {
2644 set->p[i] = isl_basic_set_from_underlying_set(set->p[i],
2645 isl_basic_set_copy(like));
2649 isl_dim_free(set->dim);
2650 set->dim = isl_dim_copy(like->dim);
2653 isl_basic_set_free(like);
2656 isl_basic_set_free(like);
2661 struct isl_set *isl_map_underlying_set(struct isl_map *map)
2665 map = isl_map_cow(map);
2668 map->dim = isl_dim_cow(map->dim);
2672 for (i = 1; i < map->n; ++i)
2673 isl_assert(map->ctx, map->p[0]->n_div == map->p[i]->n_div,
2675 for (i = 0; i < map->n; ++i) {
2676 map->p[i] = (struct isl_basic_map *)
2677 isl_basic_map_underlying_set(map->p[i]);
2682 map->dim = isl_dim_underlying(map->dim, 0);
2684 isl_dim_free(map->dim);
2685 map->dim = isl_dim_copy(map->p[0]->dim);
2689 return (struct isl_set *)map;
2695 struct isl_set *isl_set_to_underlying_set(struct isl_set *set)
2697 return (struct isl_set *)isl_map_underlying_set((struct isl_map *)set);
2700 struct isl_basic_set *isl_basic_map_domain(struct isl_basic_map *bmap)
2702 struct isl_basic_set *domain;
2707 n_in = isl_basic_map_n_in(bmap);
2708 n_out = isl_basic_map_n_out(bmap);
2709 domain = isl_basic_set_from_basic_map(bmap);
2710 return isl_basic_set_project_out(domain, isl_dim_set, n_in, n_out);
2713 struct isl_basic_set *isl_basic_map_range(struct isl_basic_map *bmap)
2715 return isl_basic_map_domain(isl_basic_map_reverse(bmap));
2718 struct isl_set *isl_map_range(struct isl_map *map)
2721 struct isl_set *set;
2725 map = isl_map_cow(map);
2729 set = (struct isl_set *) map;
2730 if (set->dim->n_in != 0) {
2731 set->dim = isl_dim_drop_inputs(set->dim, 0, set->dim->n_in);
2735 for (i = 0; i < map->n; ++i) {
2736 set->p[i] = isl_basic_map_range(map->p[i]);
2740 ISL_F_CLR(set, ISL_MAP_DISJOINT);
2741 ISL_F_CLR(set, ISL_SET_NORMALIZED);
2748 struct isl_map *isl_map_from_set(struct isl_set *set, struct isl_dim *dim)
2751 struct isl_map *map = NULL;
2753 set = isl_set_cow(set);
2756 isl_assert(set->ctx, isl_dim_compatible(set->dim, dim), goto error);
2757 map = (struct isl_map *)set;
2758 for (i = 0; i < set->n; ++i) {
2759 map->p[i] = isl_basic_map_from_basic_set(
2760 set->p[i], isl_dim_copy(dim));
2764 isl_dim_free(map->dim);
2773 struct isl_map *isl_map_from_range(struct isl_set *set)
2775 return (struct isl_map *)set;
2778 struct isl_set *isl_set_from_map(struct isl_map *map)
2781 struct isl_set *set = NULL;
2785 map = isl_map_cow(map);
2788 map->dim = isl_dim_cow(map->dim);
2791 map->dim->n_out += map->dim->n_in;
2793 set = (struct isl_set *)map;
2794 for (i = 0; i < map->n; ++i) {
2795 set->p[i] = isl_basic_set_from_basic_map(map->p[i]);
2805 struct isl_map *isl_map_alloc_dim(struct isl_dim *dim, int n, unsigned flags)
2807 struct isl_map *map;
2811 isl_assert(dim->ctx, n >= 0, return NULL);
2812 map = isl_alloc(dim->ctx, struct isl_map,
2813 sizeof(struct isl_map) +
2814 (n - 1) * sizeof(struct isl_basic_map *));
2818 map->ctx = dim->ctx;
2819 isl_ctx_ref(map->ctx);
2831 struct isl_map *isl_map_alloc(struct isl_ctx *ctx,
2832 unsigned nparam, unsigned in, unsigned out, int n,
2835 struct isl_map *map;
2836 struct isl_dim *dims;
2838 dims = isl_dim_alloc(ctx, nparam, in, out);
2842 map = isl_map_alloc_dim(dims, n, flags);
2846 struct isl_basic_map *isl_basic_map_empty(struct isl_dim *dim)
2848 struct isl_basic_map *bmap;
2849 bmap = isl_basic_map_alloc_dim(dim, 0, 1, 0);
2850 bmap = isl_basic_map_set_to_empty(bmap);
2854 struct isl_basic_set *isl_basic_set_empty(struct isl_dim *dim)
2856 struct isl_basic_set *bset;
2857 bset = isl_basic_set_alloc_dim(dim, 0, 1, 0);
2858 bset = isl_basic_set_set_to_empty(bset);
2862 struct isl_basic_map *isl_basic_map_empty_like(struct isl_basic_map *model)
2864 struct isl_basic_map *bmap;
2867 bmap = isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
2868 bmap = isl_basic_map_set_to_empty(bmap);
2872 struct isl_basic_map *isl_basic_map_empty_like_map(struct isl_map *model)
2874 struct isl_basic_map *bmap;
2877 bmap = isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
2878 bmap = isl_basic_map_set_to_empty(bmap);
2882 struct isl_basic_set *isl_basic_set_empty_like(struct isl_basic_set *model)
2884 struct isl_basic_set *bset;
2887 bset = isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
2888 bset = isl_basic_set_set_to_empty(bset);
2892 struct isl_basic_map *isl_basic_map_universe(struct isl_dim *dim)
2894 struct isl_basic_map *bmap;
2895 bmap = isl_basic_map_alloc_dim(dim, 0, 0, 0);
2899 struct isl_basic_set *isl_basic_set_universe(struct isl_dim *dim)
2901 struct isl_basic_set *bset;
2902 bset = isl_basic_set_alloc_dim(dim, 0, 0, 0);
2906 __isl_give isl_basic_map *isl_basic_map_universe_like(
2907 __isl_keep isl_basic_map *model)
2911 return isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
2914 struct isl_basic_set *isl_basic_set_universe_like(struct isl_basic_set *model)
2918 return isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
2921 __isl_give isl_basic_set *isl_basic_set_universe_like_set(
2922 __isl_keep isl_set *model)
2926 return isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
2929 struct isl_map *isl_map_empty(struct isl_dim *dim)
2931 return isl_map_alloc_dim(dim, 0, ISL_MAP_DISJOINT);
2934 struct isl_map *isl_map_empty_like(struct isl_map *model)
2938 return isl_map_alloc_dim(isl_dim_copy(model->dim), 0, ISL_MAP_DISJOINT);
2941 struct isl_map *isl_map_empty_like_basic_map(struct isl_basic_map *model)
2945 return isl_map_alloc_dim(isl_dim_copy(model->dim), 0, ISL_MAP_DISJOINT);
2948 struct isl_set *isl_set_empty(struct isl_dim *dim)
2950 return isl_set_alloc_dim(dim, 0, ISL_MAP_DISJOINT);
2953 struct isl_set *isl_set_empty_like(struct isl_set *model)
2957 return isl_set_empty(isl_dim_copy(model->dim));
2960 struct isl_map *isl_map_universe(struct isl_dim *dim)
2962 struct isl_map *map;
2965 map = isl_map_alloc_dim(isl_dim_copy(dim), 1, ISL_MAP_DISJOINT);
2966 map = isl_map_add(map, isl_basic_map_universe(dim));
2970 struct isl_set *isl_set_universe(struct isl_dim *dim)
2972 struct isl_set *set;
2975 set = isl_set_alloc_dim(isl_dim_copy(dim), 1, ISL_MAP_DISJOINT);
2976 set = isl_set_add(set, isl_basic_set_universe(dim));
2980 __isl_give isl_set *isl_set_universe_like(__isl_keep isl_set *model)
2984 return isl_set_universe(isl_dim_copy(model->dim));
2987 struct isl_map *isl_map_dup(struct isl_map *map)
2990 struct isl_map *dup;
2994 dup = isl_map_alloc_dim(isl_dim_copy(map->dim), map->n, map->flags);
2995 for (i = 0; i < map->n; ++i)
2996 dup = isl_map_add(dup, isl_basic_map_copy(map->p[i]));
3000 struct isl_map *isl_map_add(struct isl_map *map, struct isl_basic_map *bmap)
3004 if (isl_basic_map_fast_is_empty(bmap)) {
3005 isl_basic_map_free(bmap);
3008 isl_assert(map->ctx, isl_dim_equal(map->dim, bmap->dim), goto error);
3009 isl_assert(map->ctx, map->n < map->size, goto error);
3010 map->p[map->n] = bmap;
3012 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3018 isl_basic_map_free(bmap);
3022 void isl_map_free(struct isl_map *map)
3032 isl_ctx_deref(map->ctx);
3033 for (i = 0; i < map->n; ++i)
3034 isl_basic_map_free(map->p[i]);
3035 isl_dim_free(map->dim);
3039 struct isl_map *isl_map_extend(struct isl_map *base,
3040 unsigned nparam, unsigned n_in, unsigned n_out)
3044 base = isl_map_cow(base);
3048 base->dim = isl_dim_extend(base->dim, nparam, n_in, n_out);
3051 for (i = 0; i < base->n; ++i) {
3052 base->p[i] = isl_basic_map_extend_dim(base->p[i],
3053 isl_dim_copy(base->dim), 0, 0, 0);
3063 struct isl_set *isl_set_extend(struct isl_set *base,
3064 unsigned nparam, unsigned dim)
3066 return (struct isl_set *)isl_map_extend((struct isl_map *)base,
3070 static struct isl_basic_map *isl_basic_map_fix_pos(struct isl_basic_map *bmap,
3071 unsigned pos, int value)
3075 bmap = isl_basic_map_cow(bmap);
3076 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
3077 j = isl_basic_map_alloc_equality(bmap);
3080 isl_seq_clr(bmap->eq[j] + 1, isl_basic_map_total_dim(bmap));
3081 isl_int_set_si(bmap->eq[j][pos], -1);
3082 isl_int_set_si(bmap->eq[j][0], value);
3083 bmap = isl_basic_map_simplify(bmap);
3084 return isl_basic_map_finalize(bmap);
3086 isl_basic_map_free(bmap);
3090 struct isl_basic_map *isl_basic_map_fix_si(struct isl_basic_map *bmap,
3091 enum isl_dim_type type, unsigned pos, int value)
3095 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
3096 return isl_basic_map_fix_pos(bmap, isl_basic_map_offset(bmap, type) + pos,
3099 isl_basic_map_free(bmap);
3103 struct isl_basic_set *isl_basic_set_fix_si(struct isl_basic_set *bset,
3104 enum isl_dim_type type, unsigned pos, int value)
3106 return (struct isl_basic_set *)
3107 isl_basic_map_fix_si((struct isl_basic_map *)bset,
3111 struct isl_basic_map *isl_basic_map_fix_input_si(struct isl_basic_map *bmap,
3112 unsigned input, int value)
3114 return isl_basic_map_fix_si(bmap, isl_dim_in, input, value);
3117 struct isl_basic_set *isl_basic_set_fix_dim_si(struct isl_basic_set *bset,
3118 unsigned dim, int value)
3120 return (struct isl_basic_set *)
3121 isl_basic_map_fix_si((struct isl_basic_map *)bset,
3122 isl_dim_set, dim, value);
3125 struct isl_map *isl_map_fix_si(struct isl_map *map,
3126 enum isl_dim_type type, unsigned pos, int value)
3130 map = isl_map_cow(map);
3134 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
3135 for (i = 0; i < map->n; ++i) {
3136 map->p[i] = isl_basic_map_fix_si(map->p[i], type, pos, value);
3140 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3147 struct isl_map *isl_map_fix_input_si(struct isl_map *map,
3148 unsigned input, int value)
3150 return isl_map_fix_si(map, isl_dim_in, input, value);
3153 struct isl_set *isl_set_fix_dim_si(struct isl_set *set, unsigned dim, int value)
3155 return (struct isl_set *)
3156 isl_map_fix_si((struct isl_map *)set, isl_dim_set, dim, value);
3159 struct isl_basic_set *isl_basic_set_lower_bound_dim(struct isl_basic_set *bset,
3160 unsigned dim, isl_int value)
3164 bset = isl_basic_set_cow(bset);
3165 bset = isl_basic_set_extend_constraints(bset, 0, 1);
3166 j = isl_basic_set_alloc_inequality(bset);
3169 isl_seq_clr(bset->ineq[j], 1 + isl_basic_set_total_dim(bset));
3170 isl_int_set_si(bset->ineq[j][1 + isl_basic_set_n_param(bset) + dim], 1);
3171 isl_int_neg(bset->ineq[j][0], value);
3172 bset = isl_basic_set_simplify(bset);
3173 return isl_basic_set_finalize(bset);
3175 isl_basic_set_free(bset);
3179 struct isl_set *isl_set_lower_bound_dim(struct isl_set *set, unsigned dim,
3184 set = isl_set_cow(set);
3188 isl_assert(set->ctx, dim < isl_set_n_dim(set), goto error);
3189 for (i = 0; i < set->n; ++i) {
3190 set->p[i] = isl_basic_set_lower_bound_dim(set->p[i], dim, value);
3200 struct isl_map *isl_map_reverse(struct isl_map *map)
3204 map = isl_map_cow(map);
3208 map->dim = isl_dim_reverse(map->dim);
3211 for (i = 0; i < map->n; ++i) {
3212 map->p[i] = isl_basic_map_reverse(map->p[i]);
3216 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3223 static struct isl_map *isl_basic_map_partial_lexopt(
3224 struct isl_basic_map *bmap, struct isl_basic_set *dom,
3225 struct isl_set **empty, int max)
3229 if (bmap->ctx->pip == ISL_PIP_PIP)
3230 return isl_pip_basic_map_lexopt(bmap, dom, empty, max);
3232 return isl_tab_basic_map_partial_lexopt(bmap, dom, empty, max);
3234 isl_basic_map_free(bmap);
3235 isl_basic_set_free(dom);
3241 struct isl_map *isl_basic_map_partial_lexmax(
3242 struct isl_basic_map *bmap, struct isl_basic_set *dom,
3243 struct isl_set **empty)
3245 return isl_basic_map_partial_lexopt(bmap, dom, empty, 1);
3248 struct isl_map *isl_basic_map_partial_lexmin(
3249 struct isl_basic_map *bmap, struct isl_basic_set *dom,
3250 struct isl_set **empty)
3252 return isl_basic_map_partial_lexopt(bmap, dom, empty, 0);
3255 struct isl_set *isl_basic_set_partial_lexmin(
3256 struct isl_basic_set *bset, struct isl_basic_set *dom,
3257 struct isl_set **empty)
3259 return (struct isl_set *)
3260 isl_basic_map_partial_lexmin((struct isl_basic_map *)bset,
3264 struct isl_set *isl_basic_set_partial_lexmax(
3265 struct isl_basic_set *bset, struct isl_basic_set *dom,
3266 struct isl_set **empty)
3268 return (struct isl_set *)
3269 isl_basic_map_partial_lexmax((struct isl_basic_map *)bset,
3273 __isl_give isl_map *isl_basic_map_lexmin(__isl_take isl_basic_map *bmap)
3275 struct isl_basic_set *dom = NULL;
3276 struct isl_map *min;
3277 struct isl_dim *dom_dim;
3281 dom_dim = isl_dim_domain(isl_dim_copy(bmap->dim));
3282 dom = isl_basic_set_universe(dom_dim);
3283 return isl_basic_map_partial_lexmin(bmap, dom, NULL);
3285 isl_basic_map_free(bmap);
3289 __isl_give isl_set *isl_basic_set_lexmin(__isl_take isl_basic_set *bset)
3291 return (isl_set *)isl_basic_map_lexmin((isl_basic_map *)bset);
3294 static struct isl_map *isl_map_reset_dim(struct isl_map *map,
3295 struct isl_dim *dim)
3302 for (i = 0; i < map->n; ++i) {
3303 isl_dim_free(map->p[i]->dim);
3304 map->p[i]->dim = isl_dim_copy(dim);
3306 isl_dim_free(map->dim);
3316 static struct isl_set *isl_set_reset_dim(struct isl_set *set,
3317 struct isl_dim *dim)
3319 return (struct isl_set *) isl_map_reset_dim((struct isl_map *)set, dim);
3322 /* Apply a preimage specified by "mat" on the parameters of "bset".
3323 * bset is assumed to have only parameters and divs.
3325 static struct isl_basic_set *basic_set_parameter_preimage(
3326 struct isl_basic_set *bset, struct isl_mat *mat)
3333 bset->dim = isl_dim_cow(bset->dim);
3337 nparam = isl_basic_set_dim(bset, isl_dim_param);
3339 isl_assert(bset->ctx, mat->n_row == 1 + nparam, goto error);
3341 bset->dim->nparam = 0;
3342 bset->dim->n_out = nparam;
3343 bset = isl_basic_set_preimage(bset, mat);
3345 bset->dim->nparam = bset->dim->n_out;
3346 bset->dim->n_out = 0;
3351 isl_basic_set_free(bset);
3355 /* Apply a preimage specified by "mat" on the parameters of "set".
3356 * set is assumed to have only parameters and divs.
3358 static struct isl_set *set_parameter_preimage(
3359 struct isl_set *set, struct isl_mat *mat)
3361 struct isl_dim *dim = NULL;
3367 dim = isl_dim_copy(set->dim);
3368 dim = isl_dim_cow(dim);
3372 nparam = isl_set_dim(set, isl_dim_param);
3374 isl_assert(set->ctx, mat->n_row == 1 + nparam, goto error);
3377 dim->n_out = nparam;
3378 isl_set_reset_dim(set, dim);
3379 set = isl_set_preimage(set, mat);
3382 dim = isl_dim_copy(set->dim);
3383 dim = isl_dim_cow(dim);
3386 dim->nparam = dim->n_out;
3388 isl_set_reset_dim(set, dim);
3398 /* Intersect the basic set "bset" with the affine space specified by the
3399 * equalities in "eq".
3401 static struct isl_basic_set *basic_set_append_equalities(
3402 struct isl_basic_set *bset, struct isl_mat *eq)
3410 bset = isl_basic_set_extend_dim(bset, isl_dim_copy(bset->dim), 0,
3415 len = 1 + isl_dim_total(bset->dim) + bset->extra;
3416 for (i = 0; i < eq->n_row; ++i) {
3417 k = isl_basic_set_alloc_equality(bset);
3420 isl_seq_cpy(bset->eq[k], eq->row[i], eq->n_col);
3421 isl_seq_clr(bset->eq[k] + eq->n_col, len - eq->n_col);
3428 isl_basic_set_free(bset);
3432 /* Intersect the set "set" with the affine space specified by the
3433 * equalities in "eq".
3435 static struct isl_set *set_append_equalities(struct isl_set *set,
3443 for (i = 0; i < set->n; ++i) {
3444 set->p[i] = basic_set_append_equalities(set->p[i],
3457 /* Project the given basic set onto its parameter domain, possibly introducing
3458 * new, explicit, existential variables in the constraints.
3459 * The input has parameters and (possibly implicit) existential variables.
3460 * The output has the same parameters, but only
3461 * explicit existentially quantified variables.
3463 * The actual projection is performed by pip, but pip doesn't seem
3464 * to like equalities very much, so we first remove the equalities
3465 * among the parameters by performing a variable compression on
3466 * the parameters. Afterward, an inverse transformation is performed
3467 * and the equalities among the parameters are inserted back in.
3469 static struct isl_set *parameter_compute_divs(struct isl_basic_set *bset)
3473 struct isl_mat *T, *T2;
3474 struct isl_set *set;
3475 unsigned nparam, n_div;
3477 bset = isl_basic_set_cow(bset);
3481 if (bset->n_eq == 0)
3482 return isl_basic_set_lexmin(bset);
3484 isl_basic_set_gauss(bset, NULL);
3486 nparam = isl_basic_set_dim(bset, isl_dim_param);
3487 n_div = isl_basic_set_dim(bset, isl_dim_div);
3489 for (i = 0, j = n_div - 1; i < bset->n_eq && j >= 0; --j) {
3490 if (!isl_int_is_zero(bset->eq[i][1 + nparam + j]))
3493 if (i == bset->n_eq)
3494 return isl_basic_set_lexmin(bset);
3496 eq = isl_mat_sub_alloc(bset->ctx, bset->eq, i, bset->n_eq - i,
3498 eq = isl_mat_cow(eq);
3499 T = isl_mat_variable_compression(isl_mat_copy(eq), &T2);
3500 bset = basic_set_parameter_preimage(bset, T);
3502 set = isl_basic_set_lexmin(bset);
3503 set = set_parameter_preimage(set, T2);
3504 set = set_append_equalities(set, eq);
3508 /* Compute an explicit representation for all the existentially
3509 * quantified variables.
3510 * The input and output dimensions are first turned into parameters.
3511 * compute_divs then returns a map with the same parameters and
3512 * no input or output dimensions and the dimension specification
3513 * is reset to that of the input.
3515 static struct isl_map *compute_divs(struct isl_basic_map *bmap)
3517 struct isl_basic_set *bset;
3518 struct isl_set *set;
3519 struct isl_map *map;
3520 struct isl_dim *dim, *orig_dim = NULL;
3525 bmap = isl_basic_map_cow(bmap);
3529 nparam = isl_basic_map_dim(bmap, isl_dim_param);
3530 n_in = isl_basic_map_dim(bmap, isl_dim_in);
3531 n_out = isl_basic_map_dim(bmap, isl_dim_out);
3532 dim = isl_dim_set_alloc(bmap->ctx, nparam + n_in + n_out, 0);
3536 orig_dim = bmap->dim;
3538 bset = (struct isl_basic_set *)bmap;
3540 set = parameter_compute_divs(bset);
3541 map = (struct isl_map *)set;
3542 map = isl_map_reset_dim(map, orig_dim);
3546 isl_basic_map_free(bmap);
3550 /* If bmap contains any unknown divs, then compute explicit
3551 * expressions for them. However, this computation may be
3552 * quite expensive, so first try to remove divs that aren't
3555 struct isl_map *isl_basic_map_compute_divs(struct isl_basic_map *bmap)
3562 off = isl_dim_total(bmap->dim);
3563 for (i = 0; i < bmap->n_div; ++i) {
3564 if (isl_int_is_zero(bmap->div[i][0]))
3566 isl_assert(bmap->ctx, isl_int_is_zero(bmap->div[i][1+1+off+i]),
3569 if (i == bmap->n_div)
3570 return isl_map_from_basic_map(bmap);
3571 bmap = isl_basic_map_drop_redundant_divs(bmap);
3574 for (i = 0; i < bmap->n_div; ++i)
3575 if (isl_int_is_zero(bmap->div[i][0]))
3577 if (i == bmap->n_div)
3578 return isl_map_from_basic_map(bmap);
3579 struct isl_map *map = compute_divs(bmap);
3582 isl_basic_map_free(bmap);
3586 struct isl_map *isl_map_compute_divs(struct isl_map *map)
3589 struct isl_map *res;
3595 res = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[0]));
3596 for (i = 1 ; i < map->n; ++i) {
3598 r2 = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[i]));
3599 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT))
3600 res = isl_map_union_disjoint(res, r2);
3602 res = isl_map_union(res, r2);
3609 struct isl_set *isl_basic_set_compute_divs(struct isl_basic_set *bset)
3611 return (struct isl_set *)
3612 isl_basic_map_compute_divs((struct isl_basic_map *)bset);
3615 struct isl_set *isl_set_compute_divs(struct isl_set *set)
3617 return (struct isl_set *)
3618 isl_map_compute_divs((struct isl_map *)set);
3621 struct isl_set *isl_map_domain(struct isl_map *map)
3624 struct isl_set *set;
3629 map = isl_map_cow(map);
3633 set = (struct isl_set *)map;
3634 set->dim = isl_dim_domain(set->dim);
3637 for (i = 0; i < map->n; ++i) {
3638 set->p[i] = isl_basic_map_domain(map->p[i]);
3642 ISL_F_CLR(set, ISL_MAP_DISJOINT);
3643 ISL_F_CLR(set, ISL_SET_NORMALIZED);
3650 struct isl_map *isl_map_union_disjoint(
3651 struct isl_map *map1, struct isl_map *map2)
3655 struct isl_map *map = NULL;
3669 isl_assert(map1->ctx, isl_dim_equal(map1->dim, map2->dim), goto error);
3671 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
3672 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
3673 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
3675 map = isl_map_alloc_dim(isl_dim_copy(map1->dim),
3676 map1->n + map2->n, flags);
3679 for (i = 0; i < map1->n; ++i) {
3680 map = isl_map_add(map,
3681 isl_basic_map_copy(map1->p[i]));
3685 for (i = 0; i < map2->n; ++i) {
3686 map = isl_map_add(map,
3687 isl_basic_map_copy(map2->p[i]));
3701 struct isl_map *isl_map_union(struct isl_map *map1, struct isl_map *map2)
3703 map1 = isl_map_union_disjoint(map1, map2);
3707 ISL_F_CLR(map1, ISL_MAP_DISJOINT);
3711 struct isl_set *isl_set_union_disjoint(
3712 struct isl_set *set1, struct isl_set *set2)
3714 return (struct isl_set *)
3715 isl_map_union_disjoint(
3716 (struct isl_map *)set1, (struct isl_map *)set2);
3719 struct isl_set *isl_set_union(struct isl_set *set1, struct isl_set *set2)
3721 return (struct isl_set *)
3722 isl_map_union((struct isl_map *)set1, (struct isl_map *)set2);
3725 struct isl_map *isl_map_intersect_range(
3726 struct isl_map *map, struct isl_set *set)
3729 struct isl_map *result;
3735 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT) &&
3736 ISL_F_ISSET(set, ISL_MAP_DISJOINT))
3737 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
3739 result = isl_map_alloc_dim(isl_dim_copy(map->dim),
3740 map->n * set->n, flags);
3743 for (i = 0; i < map->n; ++i)
3744 for (j = 0; j < set->n; ++j) {
3745 result = isl_map_add(result,
3746 isl_basic_map_intersect_range(
3747 isl_basic_map_copy(map->p[i]),
3748 isl_basic_set_copy(set->p[j])));
3761 struct isl_map *isl_map_intersect_domain(
3762 struct isl_map *map, struct isl_set *set)
3764 return isl_map_reverse(
3765 isl_map_intersect_range(isl_map_reverse(map), set));
3768 struct isl_map *isl_map_apply_domain(
3769 struct isl_map *map1, struct isl_map *map2)
3773 map1 = isl_map_reverse(map1);
3774 map1 = isl_map_apply_range(map1, map2);
3775 return isl_map_reverse(map1);
3782 struct isl_map *isl_map_apply_range(
3783 struct isl_map *map1, struct isl_map *map2)
3785 struct isl_dim *dim_result;
3786 struct isl_map *result;
3792 dim_result = isl_dim_join(isl_dim_copy(map1->dim),
3793 isl_dim_copy(map2->dim));
3795 result = isl_map_alloc_dim(dim_result, map1->n * map2->n, 0);
3798 for (i = 0; i < map1->n; ++i)
3799 for (j = 0; j < map2->n; ++j) {
3800 result = isl_map_add(result,
3801 isl_basic_map_apply_range(
3802 isl_basic_map_copy(map1->p[i]),
3803 isl_basic_map_copy(map2->p[j])));
3809 if (result && result->n <= 1)
3810 ISL_F_SET(result, ISL_MAP_DISJOINT);
3819 * returns range - domain
3821 struct isl_basic_set *isl_basic_map_deltas(struct isl_basic_map *bmap)
3823 struct isl_basic_set *bset;
3830 dim = isl_basic_map_n_in(bmap);
3831 nparam = isl_basic_map_n_param(bmap);
3832 isl_assert(bmap->ctx, dim == isl_basic_map_n_out(bmap), goto error);
3833 bset = isl_basic_set_from_basic_map(bmap);
3834 bset = isl_basic_set_cow(bset);
3835 bset = isl_basic_set_extend(bset, nparam, 3*dim, 0, dim, 0);
3836 bset = isl_basic_set_swap_vars(bset, 2*dim);
3837 for (i = 0; i < dim; ++i) {
3838 int j = isl_basic_map_alloc_equality(
3839 (struct isl_basic_map *)bset);
3842 isl_seq_clr(bset->eq[j], 1 + isl_basic_set_total_dim(bset));
3843 isl_int_set_si(bset->eq[j][1+nparam+i], 1);
3844 isl_int_set_si(bset->eq[j][1+nparam+dim+i], 1);
3845 isl_int_set_si(bset->eq[j][1+nparam+2*dim+i], -1);
3847 return isl_basic_set_project_out(bset, isl_dim_set, dim, 2*dim);
3849 isl_basic_map_free(bmap);
3854 * returns range - domain
3856 struct isl_set *isl_map_deltas(struct isl_map *map)
3859 struct isl_set *result;
3864 isl_assert(map->ctx, isl_map_n_in(map) == isl_map_n_out(map), goto error);
3865 result = isl_set_alloc(map->ctx, isl_map_n_param(map),
3866 isl_map_n_in(map), map->n, map->flags);
3869 for (i = 0; i < map->n; ++i)
3870 result = isl_set_add(result,
3871 isl_basic_map_deltas(isl_basic_map_copy(map->p[i])));
3879 static struct isl_basic_map *basic_map_identity(struct isl_dim *dims)
3881 struct isl_basic_map *bmap;
3889 nparam = dims->nparam;
3891 bmap = isl_basic_map_alloc_dim(dims, 0, dim, 0);
3895 for (i = 0; i < dim; ++i) {
3896 int j = isl_basic_map_alloc_equality(bmap);
3899 isl_seq_clr(bmap->eq[j], 1 + isl_basic_map_total_dim(bmap));
3900 isl_int_set_si(bmap->eq[j][1+nparam+i], 1);
3901 isl_int_set_si(bmap->eq[j][1+nparam+dim+i], -1);
3903 return isl_basic_map_finalize(bmap);
3905 isl_basic_map_free(bmap);
3909 struct isl_basic_map *isl_basic_map_identity(struct isl_dim *set_dim)
3911 struct isl_dim *dim = isl_dim_map(set_dim);
3914 return basic_map_identity(dim);
3917 struct isl_basic_map *isl_basic_map_identity_like(struct isl_basic_map *model)
3919 if (!model || !model->dim)
3921 isl_assert(model->ctx,
3922 model->dim->n_in == model->dim->n_out, return NULL);
3923 return basic_map_identity(isl_dim_copy(model->dim));
3926 static struct isl_map *map_identity(struct isl_dim *dim)
3928 struct isl_map *map = isl_map_alloc_dim(dim, 1, ISL_MAP_DISJOINT);
3929 return isl_map_add(map, basic_map_identity(isl_dim_copy(dim)));
3932 struct isl_map *isl_map_identity(struct isl_dim *set_dim)
3934 struct isl_dim *dim = isl_dim_map(set_dim);
3937 return map_identity(dim);
3940 struct isl_map *isl_map_identity_like(struct isl_map *model)
3942 if (!model || !model->dim)
3944 isl_assert(model->ctx,
3945 model->dim->n_in == model->dim->n_out, return NULL);
3946 return map_identity(isl_dim_copy(model->dim));
3949 struct isl_map *isl_map_identity_like_basic_map(struct isl_basic_map *model)
3951 if (!model || !model->dim)
3953 isl_assert(model->ctx,
3954 model->dim->n_in == model->dim->n_out, return NULL);
3955 return map_identity(isl_dim_copy(model->dim));
3958 /* Construct a basic set with all set dimensions having only non-negative
3961 struct isl_basic_set *isl_basic_set_positive_orthant(struct isl_dim *dims)
3966 struct isl_basic_set *bset;
3970 nparam = dims->nparam;
3972 bset = isl_basic_set_alloc_dim(dims, 0, 0, dim);
3975 for (i = 0; i < dim; ++i) {
3976 int k = isl_basic_set_alloc_inequality(bset);
3979 isl_seq_clr(bset->ineq[k], 1 + isl_basic_set_total_dim(bset));
3980 isl_int_set_si(bset->ineq[k][1 + nparam + i], 1);
3984 isl_basic_set_free(bset);
3988 int isl_set_is_equal(struct isl_set *set1, struct isl_set *set2)
3990 return isl_map_is_equal((struct isl_map *)set1, (struct isl_map *)set2);
3993 int isl_set_is_subset(struct isl_set *set1, struct isl_set *set2)
3995 return isl_map_is_subset(
3996 (struct isl_map *)set1, (struct isl_map *)set2);
3999 int isl_basic_map_is_subset(
4000 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
4003 struct isl_map *map1;
4004 struct isl_map *map2;
4006 if (!bmap1 || !bmap2)
4009 map1 = isl_map_from_basic_map(isl_basic_map_copy(bmap1));
4010 map2 = isl_map_from_basic_map(isl_basic_map_copy(bmap2));
4012 is_subset = isl_map_is_subset(map1, map2);
4020 int isl_basic_map_is_equal(
4021 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
4025 if (!bmap1 || !bmap2)
4027 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
4030 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
4034 int isl_basic_set_is_equal(
4035 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
4037 return isl_basic_map_is_equal(
4038 (struct isl_basic_map *)bset1, (struct isl_basic_map *)bset2);
4041 int isl_map_is_empty(struct isl_map *map)
4048 for (i = 0; i < map->n; ++i) {
4049 is_empty = isl_basic_map_is_empty(map->p[i]);
4058 int isl_map_fast_is_empty(struct isl_map *map)
4063 int isl_set_is_empty(struct isl_set *set)
4065 return isl_map_is_empty((struct isl_map *)set);
4068 int isl_map_is_subset(struct isl_map *map1, struct isl_map *map2)
4071 struct isl_map *diff;
4076 if (isl_map_is_empty(map1))
4079 if (isl_map_is_empty(map2))
4082 diff = isl_map_subtract(isl_map_copy(map1), isl_map_copy(map2));
4086 is_subset = isl_map_is_empty(diff);
4092 int isl_map_is_equal(struct isl_map *map1, struct isl_map *map2)
4098 is_subset = isl_map_is_subset(map1, map2);
4101 is_subset = isl_map_is_subset(map2, map1);
4105 int isl_basic_map_is_strict_subset(
4106 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
4110 if (!bmap1 || !bmap2)
4112 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
4115 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
4116 if (is_subset == -1)
4121 int isl_map_is_strict_subset(struct isl_map *map1, struct isl_map *map2)
4127 is_subset = isl_map_is_subset(map1, map2);
4130 is_subset = isl_map_is_subset(map2, map1);
4131 if (is_subset == -1)
4136 int isl_set_is_strict_subset(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
4138 return isl_map_is_strict_subset((isl_map *)set1, (isl_map *)set2);
4141 int isl_basic_map_is_universe(struct isl_basic_map *bmap)
4145 return bmap->n_eq == 0 && bmap->n_ineq == 0;
4148 int isl_basic_set_is_universe(struct isl_basic_set *bset)
4152 return bset->n_eq == 0 && bset->n_ineq == 0;
4155 int isl_basic_map_is_empty(struct isl_basic_map *bmap)
4157 struct isl_basic_set *bset = NULL;
4158 struct isl_vec *sample = NULL;
4165 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY))
4168 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL)) {
4169 struct isl_basic_map *copy = isl_basic_map_copy(bmap);
4170 copy = isl_basic_map_convex_hull(copy);
4171 empty = ISL_F_ISSET(copy, ISL_BASIC_MAP_EMPTY);
4172 isl_basic_map_free(copy);
4176 total = 1 + isl_basic_map_total_dim(bmap);
4177 if (bmap->sample && bmap->sample->size == total) {
4178 int contains = basic_map_contains(bmap, bmap->sample);
4184 isl_vec_free(bmap->sample);
4185 bmap->sample = NULL;
4186 bset = isl_basic_map_underlying_set(isl_basic_map_copy(bmap));
4189 sample = isl_basic_set_sample_vec(bset);
4192 empty = sample->size == 0;
4193 isl_vec_free(bmap->sample);
4194 bmap->sample = sample;
4196 ISL_F_SET(bmap, ISL_BASIC_MAP_EMPTY);
4201 int isl_basic_map_fast_is_empty(struct isl_basic_map *bmap)
4205 return ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY);
4208 int isl_basic_set_fast_is_empty(struct isl_basic_set *bset)
4212 return ISL_F_ISSET(bset, ISL_BASIC_SET_EMPTY);
4215 int isl_basic_set_is_empty(struct isl_basic_set *bset)
4217 return isl_basic_map_is_empty((struct isl_basic_map *)bset);
4220 struct isl_map *isl_basic_map_union(
4221 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
4223 struct isl_map *map;
4224 if (!bmap1 || !bmap2)
4227 isl_assert(bmap1->ctx, isl_dim_equal(bmap1->dim, bmap2->dim), goto error);
4229 map = isl_map_alloc_dim(isl_dim_copy(bmap1->dim), 2, 0);
4232 map = isl_map_add(map, bmap1);
4233 map = isl_map_add(map, bmap2);
4236 isl_basic_map_free(bmap1);
4237 isl_basic_map_free(bmap2);
4241 struct isl_set *isl_basic_set_union(
4242 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
4244 return (struct isl_set *)isl_basic_map_union(
4245 (struct isl_basic_map *)bset1,
4246 (struct isl_basic_map *)bset2);
4249 /* Order divs such that any div only depends on previous divs */
4250 struct isl_basic_map *isl_basic_map_order_divs(struct isl_basic_map *bmap)
4253 unsigned off = isl_dim_total(bmap->dim);
4255 for (i = 0; i < bmap->n_div; ++i) {
4257 if (isl_int_is_zero(bmap->div[i][0]))
4259 pos = isl_seq_first_non_zero(bmap->div[i]+1+1+off+i,
4263 isl_basic_map_swap_div(bmap, i, i + pos);
4269 struct isl_basic_set *isl_basic_set_order_divs(struct isl_basic_set *bset)
4271 return (struct isl_basic_set *)
4272 isl_basic_map_order_divs((struct isl_basic_map *)bset);
4275 /* Look for a div in dst that corresponds to the div "div" in src.
4276 * The divs before "div" in src and dst are assumed to be the same.
4278 * Returns -1 if no corresponding div was found and the position
4279 * of the corresponding div in dst otherwise.
4281 static int find_div(struct isl_basic_map *dst,
4282 struct isl_basic_map *src, unsigned div)
4286 unsigned total = isl_dim_total(src->dim);
4288 isl_assert(dst->ctx, div <= dst->n_div, return -1);
4289 for (i = div; i < dst->n_div; ++i)
4290 if (isl_seq_eq(dst->div[i], src->div[div], 1+1+total+div) &&
4291 isl_seq_first_non_zero(dst->div[i]+1+1+total+div,
4292 dst->n_div - div) == -1)
4297 struct isl_basic_map *isl_basic_map_align_divs(
4298 struct isl_basic_map *dst, struct isl_basic_map *src)
4301 unsigned total = isl_dim_total(src->dim);
4306 if (src->n_div == 0)
4309 for (i = 0; i < src->n_div; ++i)
4310 isl_assert(src->ctx, !isl_int_is_zero(src->div[i][0]), goto error);
4312 src = isl_basic_map_order_divs(src);
4313 dst = isl_basic_map_cow(dst);
4314 dst = isl_basic_map_extend_dim(dst, isl_dim_copy(dst->dim),
4315 src->n_div, 0, 2 * src->n_div);
4318 for (i = 0; i < src->n_div; ++i) {
4319 int j = find_div(dst, src, i);
4321 j = isl_basic_map_alloc_div(dst);
4324 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total+i);
4325 isl_seq_clr(dst->div[j]+1+1+total+i, dst->n_div - i);
4326 if (add_div_constraints(dst, j) < 0)
4330 isl_basic_map_swap_div(dst, i, j);
4334 isl_basic_map_free(dst);
4338 struct isl_basic_set *isl_basic_set_align_divs(
4339 struct isl_basic_set *dst, struct isl_basic_set *src)
4341 return (struct isl_basic_set *)isl_basic_map_align_divs(
4342 (struct isl_basic_map *)dst, (struct isl_basic_map *)src);
4345 struct isl_map *isl_map_align_divs(struct isl_map *map)
4353 map = isl_map_compute_divs(map);
4354 map = isl_map_cow(map);
4358 for (i = 1; i < map->n; ++i)
4359 map->p[0] = isl_basic_map_align_divs(map->p[0], map->p[i]);
4360 for (i = 1; i < map->n; ++i)
4361 map->p[i] = isl_basic_map_align_divs(map->p[i], map->p[0]);
4363 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4367 struct isl_set *isl_set_align_divs(struct isl_set *set)
4369 return (struct isl_set *)isl_map_align_divs((struct isl_map *)set);
4372 static struct isl_map *add_cut_constraint(struct isl_map *dst,
4373 struct isl_basic_map *src, isl_int *c,
4374 unsigned len, int oppose)
4376 struct isl_basic_map *copy = NULL;
4381 copy = isl_basic_map_copy(src);
4382 copy = isl_basic_map_cow(copy);
4385 copy = isl_basic_map_extend_constraints(copy, 0, 1);
4386 k = isl_basic_map_alloc_inequality(copy);
4390 isl_seq_neg(copy->ineq[k], c, len);
4392 isl_seq_cpy(copy->ineq[k], c, len);
4393 total = 1 + isl_basic_map_total_dim(copy);
4394 isl_seq_clr(copy->ineq[k]+len, total - len);
4395 isl_inequality_negate(copy, k);
4396 copy = isl_basic_map_simplify(copy);
4397 copy = isl_basic_map_finalize(copy);
4398 is_empty = isl_basic_map_is_empty(copy);
4402 dst = isl_map_add(dst, copy);
4404 isl_basic_map_free(copy);
4407 isl_basic_map_free(copy);
4412 static struct isl_map *subtract(struct isl_map *map, struct isl_basic_map *bmap)
4416 struct isl_map *rest = NULL;
4418 unsigned total = isl_basic_map_total_dim(bmap);
4425 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT))
4426 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
4428 max = map->n * (2 * bmap->n_eq + bmap->n_ineq);
4429 rest = isl_map_alloc_dim(isl_dim_copy(map->dim), max, flags);
4433 for (i = 0; i < map->n; ++i) {
4434 map->p[i] = isl_basic_map_align_divs(map->p[i], bmap);
4439 for (j = 0; j < map->n; ++j)
4440 map->p[j] = isl_basic_map_cow(map->p[j]);
4442 for (i = 0; i < bmap->n_eq; ++i) {
4443 for (j = 0; j < map->n; ++j) {
4444 rest = add_cut_constraint(rest,
4445 map->p[j], bmap->eq[i], 1+total, 0);
4449 rest = add_cut_constraint(rest,
4450 map->p[j], bmap->eq[i], 1+total, 1);
4454 map->p[j] = isl_basic_map_extend_constraints(map->p[j],
4458 k = isl_basic_map_alloc_equality(map->p[j]);
4461 isl_seq_cpy(map->p[j]->eq[k], bmap->eq[i], 1+total);
4462 isl_seq_clr(map->p[j]->eq[k]+1+total,
4463 map->p[j]->n_div - bmap->n_div);
4467 for (i = 0; i < bmap->n_ineq; ++i) {
4468 for (j = 0; j < map->n; ++j) {
4469 rest = add_cut_constraint(rest,
4470 map->p[j], bmap->ineq[i], 1+total, 0);
4474 map->p[j] = isl_basic_map_extend_constraints(map->p[j],
4478 k = isl_basic_map_alloc_inequality(map->p[j]);
4481 isl_seq_cpy(map->p[j]->ineq[k], bmap->ineq[i], 1+total);
4482 isl_seq_clr(map->p[j]->ineq[k]+1+total,
4483 map->p[j]->n_div - bmap->n_div);
4495 struct isl_map *isl_map_subtract(struct isl_map *map1, struct isl_map *map2)
4501 isl_assert(map1->ctx, isl_dim_equal(map1->dim, map2->dim), goto error);
4503 if (isl_map_is_empty(map2)) {
4508 map1 = isl_map_compute_divs(map1);
4509 map2 = isl_map_compute_divs(map2);
4513 for (i = 0; map1 && i < map2->n; ++i)
4514 map1 = subtract(map1, map2->p[i]);
4524 struct isl_set *isl_set_subtract(struct isl_set *set1, struct isl_set *set2)
4526 return (struct isl_set *)
4528 (struct isl_map *)set1, (struct isl_map *)set2);
4531 struct isl_set *isl_set_apply(struct isl_set *set, struct isl_map *map)
4535 isl_assert(set->ctx, isl_map_compatible_domain(map, set), goto error);
4536 map = isl_map_intersect_domain(map, set);
4537 set = isl_map_range(map);
4545 /* There is no need to cow as removing empty parts doesn't change
4546 * the meaning of the set.
4548 struct isl_map *isl_map_remove_empty_parts(struct isl_map *map)
4555 for (i = map->n-1; i >= 0; --i) {
4556 if (!ISL_F_ISSET(map->p[i], ISL_BASIC_MAP_EMPTY))
4558 isl_basic_map_free(map->p[i]);
4559 if (i != map->n-1) {
4560 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4561 map->p[i] = map->p[map->n-1];
4569 struct isl_set *isl_set_remove_empty_parts(struct isl_set *set)
4571 return (struct isl_set *)
4572 isl_map_remove_empty_parts((struct isl_map *)set);
4575 struct isl_basic_map *isl_map_copy_basic_map(struct isl_map *map)
4577 struct isl_basic_map *bmap;
4578 if (!map || map->n == 0)
4580 bmap = map->p[map->n-1];
4581 isl_assert(map->ctx, ISL_F_ISSET(bmap, ISL_BASIC_SET_FINAL), return NULL);
4582 return isl_basic_map_copy(bmap);
4585 struct isl_basic_set *isl_set_copy_basic_set(struct isl_set *set)
4587 return (struct isl_basic_set *)
4588 isl_map_copy_basic_map((struct isl_map *)set);
4591 struct isl_map *isl_map_drop_basic_map(struct isl_map *map,
4592 struct isl_basic_map *bmap)
4598 for (i = map->n-1; i >= 0; --i) {
4599 if (map->p[i] != bmap)
4601 map = isl_map_cow(map);
4604 isl_basic_map_free(map->p[i]);
4605 if (i != map->n-1) {
4606 ISL_F_CLR(map, ISL_SET_NORMALIZED);
4607 map->p[i] = map->p[map->n-1];
4612 isl_basic_map_free(bmap);
4616 isl_basic_map_free(bmap);
4620 struct isl_set *isl_set_drop_basic_set(struct isl_set *set,
4621 struct isl_basic_set *bset)
4623 return (struct isl_set *)isl_map_drop_basic_map((struct isl_map *)set,
4624 (struct isl_basic_map *)bset);
4627 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
4628 * for any common value of the parameters and dimensions preceding dim
4629 * in both basic sets, the values of dimension pos in bset1 are
4630 * smaller or larger than those in bset2.
4633 * 1 if bset1 follows bset2
4634 * -1 if bset1 precedes bset2
4635 * 0 if bset1 and bset2 are incomparable
4636 * -2 if some error occurred.
4638 int isl_basic_set_compare_at(struct isl_basic_set *bset1,
4639 struct isl_basic_set *bset2, int pos)
4641 struct isl_dim *dims;
4642 struct isl_basic_map *bmap1 = NULL;
4643 struct isl_basic_map *bmap2 = NULL;
4644 struct isl_ctx *ctx;
4645 struct isl_vec *obj;
4648 unsigned dim1, dim2;
4650 enum isl_lp_result res;
4653 if (!bset1 || !bset2)
4656 nparam = isl_basic_set_n_param(bset1);
4657 dim1 = isl_basic_set_n_dim(bset1);
4658 dim2 = isl_basic_set_n_dim(bset2);
4659 dims = isl_dim_alloc(bset1->ctx, nparam, pos, dim1 - pos);
4660 bmap1 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset1), dims);
4661 dims = isl_dim_alloc(bset2->ctx, nparam, pos, dim2 - pos);
4662 bmap2 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset2), dims);
4663 if (!bmap1 || !bmap2)
4665 bmap1 = isl_basic_map_cow(bmap1);
4666 bmap1 = isl_basic_map_extend(bmap1, nparam,
4667 pos, (dim1 - pos) + (dim2 - pos),
4668 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
4669 bmap1 = add_constraints(bmap1, bmap2, 0, dim1 - pos);
4672 total = isl_basic_map_total_dim(bmap1);
4674 obj = isl_vec_alloc(ctx, 1 + total);
4675 isl_seq_clr(obj->block.data, 1 + total);
4676 isl_int_set_si(obj->block.data[1+nparam+pos], 1);
4677 isl_int_set_si(obj->block.data[1+nparam+pos+(dim1-pos)], -1);
4682 res = isl_basic_map_solve_lp(bmap1, 0, obj->block.data, ctx->one,
4684 if (res == isl_lp_empty)
4686 else if (res == isl_lp_ok && isl_int_is_pos(num))
4688 else if ((res == isl_lp_ok && isl_int_is_neg(num)) ||
4689 res == isl_lp_unbounded)
4695 isl_basic_map_free(bmap1);
4699 isl_basic_map_free(bmap1);
4700 isl_basic_map_free(bmap2);
4704 static int isl_basic_map_fast_has_fixed_var(struct isl_basic_map *bmap,
4705 unsigned pos, isl_int *val)
4713 total = isl_basic_map_total_dim(bmap);
4714 for (i = 0, d = total-1; i < bmap->n_eq && d+1 > pos; ++i) {
4715 for (; d+1 > pos; --d)
4716 if (!isl_int_is_zero(bmap->eq[i][1+d]))
4720 if (isl_seq_first_non_zero(bmap->eq[i]+1, d) != -1)
4722 if (isl_seq_first_non_zero(bmap->eq[i]+1+d+1, total-d-1) != -1)
4724 if (!isl_int_is_one(bmap->eq[i][1+d]))
4727 isl_int_neg(*val, bmap->eq[i][0]);
4733 static int isl_map_fast_has_fixed_var(struct isl_map *map,
4734 unsigned pos, isl_int *val)
4746 return isl_basic_map_fast_has_fixed_var(map->p[0], pos, val);
4749 fixed = isl_basic_map_fast_has_fixed_var(map->p[0], pos, &v);
4750 for (i = 1; fixed == 1 && i < map->n; ++i) {
4751 fixed = isl_basic_map_fast_has_fixed_var(map->p[i], pos, &tmp);
4752 if (fixed == 1 && isl_int_ne(tmp, v))
4756 isl_int_set(*val, v);
4762 static int isl_basic_set_fast_has_fixed_var(struct isl_basic_set *bset,
4763 unsigned pos, isl_int *val)
4765 return isl_basic_map_fast_has_fixed_var((struct isl_basic_map *)bset,
4769 static int isl_set_fast_has_fixed_var(struct isl_set *set, unsigned pos,
4772 return isl_map_fast_has_fixed_var((struct isl_map *)set, pos, val);
4775 int isl_basic_map_fast_is_fixed(struct isl_basic_map *bmap,
4776 enum isl_dim_type type, unsigned pos, isl_int *val)
4778 if (pos >= isl_basic_map_dim(bmap, type))
4780 return isl_basic_map_fast_has_fixed_var(bmap,
4781 isl_basic_map_offset(bmap, type) - 1 + pos, val);
4784 int isl_map_fast_is_fixed(struct isl_map *map,
4785 enum isl_dim_type type, unsigned pos, isl_int *val)
4787 if (pos >= isl_map_dim(map, type))
4789 return isl_map_fast_has_fixed_var(map,
4790 map_offset(map, type) - 1 + pos, val);
4793 /* Check if dimension dim has fixed value and if so and if val is not NULL,
4794 * then return this fixed value in *val.
4796 int isl_basic_set_fast_dim_is_fixed(struct isl_basic_set *bset, unsigned dim,
4799 return isl_basic_set_fast_has_fixed_var(bset,
4800 isl_basic_set_n_param(bset) + dim, val);
4803 /* Check if dimension dim has fixed value and if so and if val is not NULL,
4804 * then return this fixed value in *val.
4806 int isl_set_fast_dim_is_fixed(struct isl_set *set, unsigned dim, isl_int *val)
4808 return isl_set_fast_has_fixed_var(set, isl_set_n_param(set) + dim, val);
4811 /* Check if input variable in has fixed value and if so and if val is not NULL,
4812 * then return this fixed value in *val.
4814 int isl_map_fast_input_is_fixed(struct isl_map *map, unsigned in, isl_int *val)
4816 return isl_map_fast_has_fixed_var(map, isl_map_n_param(map) + in, val);
4819 /* Check if dimension dim has an (obvious) fixed lower bound and if so
4820 * and if val is not NULL, then return this lower bound in *val.
4822 int isl_basic_set_fast_dim_has_fixed_lower_bound(struct isl_basic_set *bset,
4823 unsigned dim, isl_int *val)
4825 int i, i_eq = -1, i_ineq = -1;
4832 total = isl_basic_set_total_dim(bset);
4833 nparam = isl_basic_set_n_param(bset);
4834 for (i = 0; i < bset->n_eq; ++i) {
4835 if (isl_int_is_zero(bset->eq[i][1+nparam+dim]))
4841 for (i = 0; i < bset->n_ineq; ++i) {
4842 if (!isl_int_is_pos(bset->ineq[i][1+nparam+dim]))
4844 if (i_eq != -1 || i_ineq != -1)
4848 if (i_eq == -1 && i_ineq == -1)
4850 c = i_eq != -1 ? bset->eq[i_eq] : bset->ineq[i_ineq];
4851 /* The coefficient should always be one due to normalization. */
4852 if (!isl_int_is_one(c[1+nparam+dim]))
4854 if (isl_seq_first_non_zero(c+1, nparam+dim) != -1)
4856 if (isl_seq_first_non_zero(c+1+nparam+dim+1,
4857 total - nparam - dim - 1) != -1)
4860 isl_int_neg(*val, c[0]);
4864 int isl_set_fast_dim_has_fixed_lower_bound(struct isl_set *set,
4865 unsigned dim, isl_int *val)
4877 return isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[0],
4881 fixed = isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[0],
4883 for (i = 1; fixed == 1 && i < set->n; ++i) {
4884 fixed = isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[i],
4886 if (fixed == 1 && isl_int_ne(tmp, v))
4890 isl_int_set(*val, v);
4901 static int qsort_constraint_cmp(const void *p1, const void *p2)
4903 const struct constraint *c1 = (const struct constraint *)p1;
4904 const struct constraint *c2 = (const struct constraint *)p2;
4905 unsigned size = isl_min(c1->size, c2->size);
4906 return isl_seq_cmp(c1->c, c2->c, size);
4909 static struct isl_basic_map *isl_basic_map_sort_constraints(
4910 struct isl_basic_map *bmap)
4913 struct constraint *c;
4918 total = isl_basic_map_total_dim(bmap);
4919 c = isl_alloc_array(bmap->ctx, struct constraint, bmap->n_ineq);
4922 for (i = 0; i < bmap->n_ineq; ++i) {
4924 c[i].c = bmap->ineq[i];
4926 qsort(c, bmap->n_ineq, sizeof(struct constraint), qsort_constraint_cmp);
4927 for (i = 0; i < bmap->n_ineq; ++i)
4928 bmap->ineq[i] = c[i].c;
4932 isl_basic_map_free(bmap);
4936 struct isl_basic_map *isl_basic_map_normalize(struct isl_basic_map *bmap)
4940 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_NORMALIZED))
4942 bmap = isl_basic_map_convex_hull(bmap);
4943 bmap = isl_basic_map_sort_constraints(bmap);
4944 ISL_F_SET(bmap, ISL_BASIC_MAP_NORMALIZED);
4948 struct isl_basic_set *isl_basic_set_normalize(struct isl_basic_set *bset)
4950 return (struct isl_basic_set *)isl_basic_map_normalize(
4951 (struct isl_basic_map *)bset);
4954 static int isl_basic_map_fast_cmp(const struct isl_basic_map *bmap1,
4955 const struct isl_basic_map *bmap2)
4962 if (isl_basic_map_n_param(bmap1) != isl_basic_map_n_param(bmap2))
4963 return isl_basic_map_n_param(bmap1) - isl_basic_map_n_param(bmap2);
4964 if (isl_basic_map_n_in(bmap1) != isl_basic_map_n_in(bmap2))
4965 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
4966 if (isl_basic_map_n_out(bmap1) != isl_basic_map_n_out(bmap2))
4967 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
4968 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY) &&
4969 ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
4971 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY))
4973 if (ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
4975 if (bmap1->n_eq != bmap2->n_eq)
4976 return bmap1->n_eq - bmap2->n_eq;
4977 if (bmap1->n_ineq != bmap2->n_ineq)
4978 return bmap1->n_ineq - bmap2->n_ineq;
4979 if (bmap1->n_div != bmap2->n_div)
4980 return bmap1->n_div - bmap2->n_div;
4981 total = isl_basic_map_total_dim(bmap1);
4982 for (i = 0; i < bmap1->n_eq; ++i) {
4983 cmp = isl_seq_cmp(bmap1->eq[i], bmap2->eq[i], 1+total);
4987 for (i = 0; i < bmap1->n_ineq; ++i) {
4988 cmp = isl_seq_cmp(bmap1->ineq[i], bmap2->ineq[i], 1+total);
4992 for (i = 0; i < bmap1->n_div; ++i) {
4993 cmp = isl_seq_cmp(bmap1->div[i], bmap2->div[i], 1+1+total);
5000 static int isl_basic_map_fast_is_equal(struct isl_basic_map *bmap1,
5001 struct isl_basic_map *bmap2)
5003 return isl_basic_map_fast_cmp(bmap1, bmap2) == 0;
5006 static int qsort_bmap_cmp(const void *p1, const void *p2)
5008 const struct isl_basic_map *bmap1 = *(const struct isl_basic_map **)p1;
5009 const struct isl_basic_map *bmap2 = *(const struct isl_basic_map **)p2;
5011 return isl_basic_map_fast_cmp(bmap1, bmap2);
5014 /* We normalize in place, but if anything goes wrong we need
5015 * to return NULL, so we need to make sure we don't change the
5016 * meaning of any possible other copies of map.
5018 struct isl_map *isl_map_normalize(struct isl_map *map)
5021 struct isl_basic_map *bmap;
5025 if (ISL_F_ISSET(map, ISL_MAP_NORMALIZED))
5027 for (i = 0; i < map->n; ++i) {
5028 bmap = isl_basic_map_normalize(isl_basic_map_copy(map->p[i]));
5031 isl_basic_map_free(map->p[i]);
5034 qsort(map->p, map->n, sizeof(struct isl_basic_map *), qsort_bmap_cmp);
5035 ISL_F_SET(map, ISL_MAP_NORMALIZED);
5036 map = isl_map_remove_empty_parts(map);
5039 for (i = map->n - 1; i >= 1; --i) {
5040 if (!isl_basic_map_fast_is_equal(map->p[i-1], map->p[i]))
5042 isl_basic_map_free(map->p[i-1]);
5043 for (j = i; j < map->n; ++j)
5044 map->p[j-1] = map->p[j];
5054 struct isl_set *isl_set_normalize(struct isl_set *set)
5056 return (struct isl_set *)isl_map_normalize((struct isl_map *)set);
5059 int isl_map_fast_is_equal(struct isl_map *map1, struct isl_map *map2)
5069 if (!isl_dim_equal(map1->dim, map2->dim))
5072 map1 = isl_map_copy(map1);
5073 map2 = isl_map_copy(map2);
5074 map1 = isl_map_normalize(map1);
5075 map2 = isl_map_normalize(map2);
5078 equal = map1->n == map2->n;
5079 for (i = 0; equal && i < map1->n; ++i) {
5080 equal = isl_basic_map_fast_is_equal(map1->p[i], map2->p[i]);
5093 int isl_set_fast_is_equal(struct isl_set *set1, struct isl_set *set2)
5095 return isl_map_fast_is_equal((struct isl_map *)set1,
5096 (struct isl_map *)set2);
5099 /* Return an interval that ranges from min to max (inclusive)
5101 struct isl_basic_set *isl_basic_set_interval(struct isl_ctx *ctx,
5102 isl_int min, isl_int max)
5105 struct isl_basic_set *bset = NULL;
5107 bset = isl_basic_set_alloc(ctx, 0, 1, 0, 0, 2);
5111 k = isl_basic_set_alloc_inequality(bset);
5114 isl_int_set_si(bset->ineq[k][1], 1);
5115 isl_int_neg(bset->ineq[k][0], min);
5117 k = isl_basic_set_alloc_inequality(bset);
5120 isl_int_set_si(bset->ineq[k][1], -1);
5121 isl_int_set(bset->ineq[k][0], max);
5125 isl_basic_set_free(bset);
5129 /* Return the Cartesian product of the basic sets in list (in the given order).
5131 struct isl_basic_set *isl_basic_set_product(struct isl_basic_set_list *list)
5139 struct isl_basic_set *product = NULL;
5143 isl_assert(list->ctx, list->n > 0, goto error);
5144 isl_assert(list->ctx, list->p[0], goto error);
5145 nparam = isl_basic_set_n_param(list->p[0]);
5146 dim = isl_basic_set_n_dim(list->p[0]);
5147 extra = list->p[0]->n_div;
5148 n_eq = list->p[0]->n_eq;
5149 n_ineq = list->p[0]->n_ineq;
5150 for (i = 1; i < list->n; ++i) {
5151 isl_assert(list->ctx, list->p[i], goto error);
5152 isl_assert(list->ctx,
5153 nparam == isl_basic_set_n_param(list->p[i]), goto error);
5154 dim += isl_basic_set_n_dim(list->p[i]);
5155 extra += list->p[i]->n_div;
5156 n_eq += list->p[i]->n_eq;
5157 n_ineq += list->p[i]->n_ineq;
5159 product = isl_basic_set_alloc(list->ctx, nparam, dim, extra,
5164 for (i = 0; i < list->n; ++i) {
5165 isl_basic_set_add_constraints(product,
5166 isl_basic_set_copy(list->p[i]), dim);
5167 dim += isl_basic_set_n_dim(list->p[i]);
5169 isl_basic_set_list_free(list);
5172 isl_basic_set_free(product);
5173 isl_basic_set_list_free(list);
5177 struct isl_basic_map *isl_basic_map_product(
5178 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
5180 struct isl_dim *dim_result = NULL;
5181 struct isl_basic_map *bmap;
5182 unsigned in1, in2, out1, out2, nparam, total, pos;
5183 struct isl_dim_map *dim_map1, *dim_map2;
5185 if (!bmap1 || !bmap2)
5188 isl_assert(bmap1->ctx, isl_dim_match(bmap1->dim, isl_dim_param,
5189 bmap2->dim, isl_dim_param), goto error);
5190 dim_result = isl_dim_product(isl_dim_copy(bmap1->dim),
5191 isl_dim_copy(bmap2->dim));
5193 in1 = isl_basic_map_n_in(bmap1);
5194 in2 = isl_basic_map_n_in(bmap2);
5195 out1 = isl_basic_map_n_out(bmap1);
5196 out2 = isl_basic_map_n_out(bmap2);
5197 nparam = isl_basic_map_n_param(bmap1);
5199 total = nparam + in1 + in2 + out1 + out2 + bmap1->n_div + bmap2->n_div;
5200 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
5201 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
5202 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
5203 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
5204 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
5205 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos += in1);
5206 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += in2);
5207 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += out1);
5208 isl_dim_map_div(dim_map1, bmap1, pos += out2);
5209 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
5211 bmap = isl_basic_map_alloc_dim(dim_result,
5212 bmap1->n_div + bmap2->n_div,
5213 bmap1->n_eq + bmap2->n_eq,
5214 bmap1->n_ineq + bmap2->n_ineq);
5215 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
5216 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
5217 bmap = isl_basic_map_simplify(bmap);
5218 return isl_basic_map_finalize(bmap);
5220 isl_basic_map_free(bmap1);
5221 isl_basic_map_free(bmap2);
5225 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
5227 struct isl_map *isl_map_product(struct isl_map *map1, struct isl_map *map2)
5230 struct isl_map *result;
5236 isl_assert(map1->ctx, isl_dim_match(map1->dim, isl_dim_param,
5237 map2->dim, isl_dim_param), goto error);
5239 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
5240 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
5241 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
5243 result = isl_map_alloc_dim(isl_dim_product(isl_dim_copy(map1->dim),
5244 isl_dim_copy(map2->dim)),
5245 map1->n * map2->n, flags);
5248 for (i = 0; i < map1->n; ++i)
5249 for (j = 0; j < map2->n; ++j) {
5250 struct isl_basic_map *part;
5251 part = isl_basic_map_product(
5252 isl_basic_map_copy(map1->p[i]),
5253 isl_basic_map_copy(map2->p[j]));
5254 if (isl_basic_map_is_empty(part))
5255 isl_basic_map_free(part);
5257 result = isl_map_add(result, part);
5270 /* Given two set A and B, construct its Cartesian product A x B.
5272 struct isl_set *isl_set_product(struct isl_set *set1, struct isl_set *set2)
5274 return (struct isl_set *)isl_map_product((struct isl_map *)set1,
5275 (struct isl_map *)set2);
5278 uint32_t isl_basic_set_get_hash(struct isl_basic_set *bset)
5281 uint32_t hash = isl_hash_init();
5286 bset = isl_basic_set_copy(bset);
5287 bset = isl_basic_set_normalize(bset);
5290 total = isl_basic_set_total_dim(bset);
5291 isl_hash_byte(hash, bset->n_eq & 0xFF);
5292 for (i = 0; i < bset->n_eq; ++i) {
5294 c_hash = isl_seq_get_hash(bset->eq[i], 1 + total);
5295 isl_hash_hash(hash, c_hash);
5297 isl_hash_byte(hash, bset->n_ineq & 0xFF);
5298 for (i = 0; i < bset->n_ineq; ++i) {
5300 c_hash = isl_seq_get_hash(bset->ineq[i], 1 + total);
5301 isl_hash_hash(hash, c_hash);
5303 isl_hash_byte(hash, bset->n_div & 0xFF);
5304 for (i = 0; i < bset->n_div; ++i) {
5306 if (isl_int_is_zero(bset->div[i][0]))
5308 isl_hash_byte(hash, i & 0xFF);
5309 c_hash = isl_seq_get_hash(bset->div[i], 1 + 1 + total);
5310 isl_hash_hash(hash, c_hash);
5312 isl_basic_set_free(bset);
5316 uint32_t isl_set_get_hash(struct isl_set *set)
5323 set = isl_set_copy(set);
5324 set = isl_set_normalize(set);
5328 hash = isl_hash_init();
5329 for (i = 0; i < set->n; ++i) {
5331 bset_hash = isl_basic_set_get_hash(set->p[i]);
5332 isl_hash_hash(hash, bset_hash);
5340 /* Check if the value for dimension dim is completely determined
5341 * by the values of the other parameters and variables.
5342 * That is, check if dimension dim is involved in an equality.
5344 int isl_basic_set_dim_is_unique(struct isl_basic_set *bset, unsigned dim)
5351 nparam = isl_basic_set_n_param(bset);
5352 for (i = 0; i < bset->n_eq; ++i)
5353 if (!isl_int_is_zero(bset->eq[i][1 + nparam + dim]))
5358 /* Check if the value for dimension dim is completely determined
5359 * by the values of the other parameters and variables.
5360 * That is, check if dimension dim is involved in an equality
5361 * for each of the subsets.
5363 int isl_set_dim_is_unique(struct isl_set *set, unsigned dim)
5369 for (i = 0; i < set->n; ++i) {
5371 unique = isl_basic_set_dim_is_unique(set->p[i], dim);
5378 int isl_map_foreach_basic_map(__isl_keep isl_map *map,
5379 int (*fn)(__isl_take isl_basic_map *bmap, void *user), void *user)
5386 for (i = 0; i < map->n; ++i)
5387 if (fn(isl_basic_map_copy(map->p[i]), user) < 0)
5393 int isl_set_foreach_basic_set(__isl_keep isl_set *set,
5394 int (*fn)(__isl_take isl_basic_set *bset, void *user), void *user)
5401 for (i = 0; i < set->n; ++i)
5402 if (fn(isl_basic_set_copy(set->p[i]), user) < 0)
5408 __isl_give isl_map *isl_set_lifting(__isl_take isl_set *set)
5410 struct isl_dim *dim;
5411 struct isl_basic_map *bmap;
5418 set = isl_set_align_divs(set);
5423 dim = isl_set_get_dim(set);
5424 if (set->n == 0 || set->p[0]->n_div == 0) {
5426 return isl_map_identity(dim);
5429 n_div = set->p[0]->n_div;
5430 dim = isl_dim_map(dim);
5431 n_param = isl_dim_size(dim, isl_dim_param);
5432 n_set = isl_dim_size(dim, isl_dim_in);
5433 dim = isl_dim_extend(dim, n_param, n_set, n_set + n_div);
5434 bmap = isl_basic_map_alloc_dim(dim, 0, n_set, 2 * n_div);
5435 for (i = 0; i < n_set; ++i)
5436 bmap = var_equal(bmap, i);
5438 total = n_param + n_set + n_set + n_div;
5439 for (i = 0; i < n_div; ++i) {
5440 k = isl_basic_map_alloc_inequality(bmap);
5443 isl_seq_cpy(bmap->ineq[k], set->p[0]->div[i]+1, 1+n_param);
5444 isl_seq_clr(bmap->ineq[k]+1+n_param, n_set);
5445 isl_seq_cpy(bmap->ineq[k]+1+n_param+n_set,
5446 set->p[0]->div[i]+1+1+n_param, n_set + n_div);
5447 isl_int_neg(bmap->ineq[k][1+n_param+n_set+n_set+i],
5448 set->p[0]->div[i][0]);
5450 l = isl_basic_map_alloc_inequality(bmap);
5453 isl_seq_neg(bmap->ineq[l], bmap->ineq[k], 1 + total);
5454 isl_int_add(bmap->ineq[l][0], bmap->ineq[l][0],
5455 set->p[0]->div[i][0]);
5456 isl_int_sub_ui(bmap->ineq[l][0], bmap->ineq[l][0], 1);
5460 return isl_map_from_basic_map(bmap);
5463 isl_basic_map_free(bmap);