6 #include "isl_equalities.h"
12 #include "isl_map_private.h"
13 #include "isl_map_piplib.h"
14 #include "isl_sample.h"
17 /* Maps dst positions to src positions */
23 static struct isl_dim_map *isl_dim_map_alloc(struct isl_ctx *ctx, unsigned len)
26 struct isl_dim_map *dim_map;
27 dim_map = isl_alloc(ctx, struct isl_dim_map,
28 sizeof(struct isl_dim_map) + len * sizeof(int));
31 dim_map->len = 1 + len;
33 for (i = 0; i < len; ++i)
34 dim_map->pos[1 + i] = -1;
38 static unsigned n(struct isl_dim *dim, enum isl_dim_type type)
41 case isl_dim_param: return dim->nparam;
42 case isl_dim_in: return dim->n_in;
43 case isl_dim_out: return dim->n_out;
47 static unsigned pos(struct isl_dim *dim, enum isl_dim_type type)
50 case isl_dim_param: return 1;
51 case isl_dim_in: return 1 + dim->nparam;
52 case isl_dim_out: return 1 + dim->nparam + dim->n_in;
56 static void isl_dim_map_dim(struct isl_dim_map *dim_map, struct isl_dim *dim,
57 enum isl_dim_type type, unsigned dst_pos)
65 src_pos = pos(dim, type);
66 for (i = 0; i < n(dim, type); ++i)
67 dim_map->pos[1 + dst_pos + i] = src_pos + i;
70 static void isl_dim_map_div(struct isl_dim_map *dim_map,
71 struct isl_basic_map *bmap, unsigned dst_pos)
76 if (!dim_map || !bmap)
79 src_pos = 1 + isl_dim_total(bmap->dim);
80 for (i = 0; i < bmap->n_div; ++i)
81 dim_map->pos[1 + dst_pos + i] = src_pos + i;
84 static void isl_dim_map_dump(struct isl_dim_map *dim_map)
88 for (i = 0; i < dim_map->len; ++i)
89 fprintf(stderr, "%d -> %d; ", i, dim_map->pos[i]);
90 fprintf(stderr, "\n");
93 unsigned isl_basic_set_n_dim(const struct isl_basic_set *bset)
95 return bset->dim->n_out;
98 unsigned isl_basic_set_n_param(const struct isl_basic_set *bset)
100 return bset->dim->nparam;
103 unsigned isl_basic_set_total_dim(const struct isl_basic_set *bset)
105 return isl_dim_total(bset->dim) + bset->n_div;
108 unsigned isl_set_n_dim(const struct isl_set *set)
110 return set->dim->n_out;
113 unsigned isl_set_n_param(const struct isl_set *set)
115 return set->dim->nparam;
118 unsigned isl_basic_map_n_in(const struct isl_basic_map *bmap)
120 return bmap->dim->n_in;
123 unsigned isl_basic_map_n_out(const struct isl_basic_map *bmap)
125 return bmap->dim->n_out;
128 unsigned isl_basic_map_n_param(const struct isl_basic_map *bmap)
130 return bmap->dim->nparam;
133 unsigned isl_basic_map_n_div(const struct isl_basic_map *bmap)
138 unsigned isl_basic_map_total_dim(const struct isl_basic_map *bmap)
140 return isl_dim_total(bmap->dim) + bmap->n_div;
143 unsigned isl_map_n_in(const struct isl_map *map)
145 return map->dim->n_in;
148 unsigned isl_map_n_out(const struct isl_map *map)
150 return map->dim->n_out;
153 unsigned isl_map_n_param(const struct isl_map *map)
155 return map->dim->nparam;
158 int isl_map_compatible_domain(struct isl_map *map, struct isl_set *set)
160 return map->dim->n_in == set->dim->n_out &&
161 map->dim->nparam == set->dim->nparam;
164 int isl_basic_map_compatible_domain(struct isl_basic_map *bmap,
165 struct isl_basic_set *bset)
167 return bmap->dim->n_in == bset->dim->n_out &&
168 bmap->dim->nparam == bset->dim->nparam;
171 int isl_basic_map_compatible_range(struct isl_basic_map *bmap,
172 struct isl_basic_set *bset)
174 return bmap->dim->n_out == bset->dim->n_out &&
175 bmap->dim->nparam == bset->dim->nparam;
178 static struct isl_basic_map *basic_map_init(struct isl_ctx *ctx,
179 struct isl_basic_map *bmap, unsigned extra,
180 unsigned n_eq, unsigned n_ineq)
183 size_t row_size = 1 + isl_dim_total(bmap->dim) + extra;
185 bmap->block = isl_blk_alloc(ctx, (n_eq + n_ineq) * row_size);
186 if (isl_blk_is_error(bmap->block)) {
191 bmap->eq = isl_alloc_array(ctx, isl_int *, n_eq + n_ineq);
193 isl_blk_free(ctx, bmap->block);
199 bmap->block2 = isl_blk_empty();
202 bmap->block2 = isl_blk_alloc(ctx, extra * (1 + row_size));
203 if (isl_blk_is_error(bmap->block2)) {
205 isl_blk_free(ctx, bmap->block);
210 bmap->div = isl_alloc_array(ctx, isl_int *, extra);
212 isl_blk_free(ctx, bmap->block2);
214 isl_blk_free(ctx, bmap->block);
220 for (i = 0; i < n_eq + n_ineq; ++i)
221 bmap->eq[i] = bmap->block.data + i * row_size;
223 for (i = 0; i < extra; ++i)
224 bmap->div[i] = bmap->block2.data + i * (1 + row_size);
230 bmap->c_size = n_eq + n_ineq;
231 bmap->ineq = bmap->eq + n_eq;
240 isl_basic_map_free(bmap);
244 struct isl_basic_set *isl_basic_set_alloc(struct isl_ctx *ctx,
245 unsigned nparam, unsigned dim, unsigned extra,
246 unsigned n_eq, unsigned n_ineq)
248 struct isl_basic_map *bmap;
249 bmap = isl_basic_map_alloc(ctx, nparam, 0, dim, extra, n_eq, n_ineq);
250 return (struct isl_basic_set *)bmap;
253 struct isl_basic_set *isl_basic_set_alloc_dim(struct isl_dim *dim,
254 unsigned extra, unsigned n_eq, unsigned n_ineq)
256 struct isl_basic_map *bmap;
259 isl_assert(dim->ctx, dim->n_in == 0, return NULL);
260 bmap = isl_basic_map_alloc_dim(dim, extra, n_eq, n_ineq);
261 return (struct isl_basic_set *)bmap;
264 struct isl_basic_map *isl_basic_map_alloc_dim(struct isl_dim *dim,
265 unsigned extra, unsigned n_eq, unsigned n_ineq)
267 struct isl_basic_map *bmap;
271 bmap = isl_alloc_type(dim->ctx, struct isl_basic_map);
276 return basic_map_init(dim->ctx, bmap, extra, n_eq, n_ineq);
282 struct isl_basic_map *isl_basic_map_alloc(struct isl_ctx *ctx,
283 unsigned nparam, unsigned in, unsigned out, unsigned extra,
284 unsigned n_eq, unsigned n_ineq)
286 struct isl_basic_map *bmap;
289 dim = isl_dim_alloc(ctx, nparam, in, out);
293 bmap = isl_basic_map_alloc_dim(dim, extra, n_eq, n_ineq);
297 static void dup_constraints(
298 struct isl_basic_map *dst, struct isl_basic_map *src)
301 unsigned total = isl_basic_map_total_dim(src);
303 for (i = 0; i < src->n_eq; ++i) {
304 int j = isl_basic_map_alloc_equality(dst);
305 isl_seq_cpy(dst->eq[j], src->eq[i], 1+total);
308 for (i = 0; i < src->n_ineq; ++i) {
309 int j = isl_basic_map_alloc_inequality(dst);
310 isl_seq_cpy(dst->ineq[j], src->ineq[i], 1+total);
313 for (i = 0; i < src->n_div; ++i) {
314 int j = isl_basic_map_alloc_div(dst);
315 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total);
317 F_SET(dst, ISL_BASIC_SET_FINAL);
320 struct isl_basic_map *isl_basic_map_dup(struct isl_basic_map *bmap)
322 struct isl_basic_map *dup;
326 dup = isl_basic_map_alloc_dim(isl_dim_copy(bmap->dim),
327 bmap->n_div, bmap->n_eq, bmap->n_ineq);
330 dup->flags = bmap->flags;
331 dup_constraints(dup, bmap);
332 dup->sample = isl_vec_copy(bmap->ctx, bmap->sample);
336 struct isl_basic_set *isl_basic_set_dup(struct isl_basic_set *bset)
338 struct isl_basic_map *dup;
340 dup = isl_basic_map_dup((struct isl_basic_map *)bset);
341 return (struct isl_basic_set *)dup;
344 struct isl_basic_set *isl_basic_set_copy(struct isl_basic_set *bset)
349 if (F_ISSET(bset, ISL_BASIC_SET_FINAL)) {
353 return isl_basic_set_dup(bset);
356 struct isl_set *isl_set_copy(struct isl_set *set)
365 struct isl_basic_map *isl_basic_map_copy(struct isl_basic_map *bmap)
370 if (F_ISSET(bmap, ISL_BASIC_SET_FINAL)) {
374 return isl_basic_map_dup(bmap);
377 struct isl_map *isl_map_copy(struct isl_map *map)
386 void isl_basic_map_free(struct isl_basic_map *bmap)
394 isl_ctx_deref(bmap->ctx);
396 isl_blk_free(bmap->ctx, bmap->block2);
398 isl_blk_free(bmap->ctx, bmap->block);
399 isl_vec_free(bmap->ctx, bmap->sample);
400 isl_dim_free(bmap->dim);
404 void isl_basic_set_free(struct isl_basic_set *bset)
406 isl_basic_map_free((struct isl_basic_map *)bset);
409 int isl_basic_map_alloc_equality(struct isl_basic_map *bmap)
415 isl_assert(ctx, bmap->n_eq + bmap->n_ineq < bmap->c_size, return -1);
416 isl_assert(ctx, bmap->eq + bmap->n_eq <= bmap->ineq, return -1);
417 if (bmap->eq + bmap->n_eq == bmap->ineq) {
419 int j = isl_basic_map_alloc_inequality(bmap);
423 bmap->ineq[0] = bmap->ineq[j];
428 isl_seq_clr(bmap->eq[bmap->n_eq] +
429 1 + isl_basic_map_total_dim(bmap),
430 bmap->extra - bmap->n_div);
434 int isl_basic_set_alloc_equality(struct isl_basic_set *bset)
436 return isl_basic_map_alloc_equality((struct isl_basic_map *)bset);
439 int isl_basic_map_free_equality(struct isl_basic_map *bmap, unsigned n)
443 isl_assert(bmap->ctx, n <= bmap->n_eq, return -1);
448 int isl_basic_map_drop_equality(struct isl_basic_map *bmap, unsigned pos)
453 isl_assert(bmap->ctx, pos < bmap->n_eq, return -1);
455 if (pos != bmap->n_eq - 1) {
457 bmap->eq[pos] = bmap->eq[bmap->n_eq - 1];
458 bmap->eq[bmap->n_eq - 1] = t;
464 int isl_basic_set_drop_equality(struct isl_basic_set *bset, unsigned pos)
466 return isl_basic_map_drop_equality((struct isl_basic_map *)bset, pos);
469 void isl_basic_map_inequality_to_equality(
470 struct isl_basic_map *bmap, unsigned pos)
475 bmap->ineq[pos] = bmap->ineq[0];
476 bmap->ineq[0] = bmap->eq[bmap->n_eq];
477 bmap->eq[bmap->n_eq] = t;
481 F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
484 int isl_basic_map_alloc_inequality(struct isl_basic_map *bmap)
490 isl_assert(ctx, (bmap->ineq - bmap->eq) + bmap->n_ineq < bmap->c_size,
492 F_CLR(bmap, ISL_BASIC_MAP_NO_IMPLICIT);
493 F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
494 F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
495 isl_seq_clr(bmap->ineq[bmap->n_ineq] +
496 1 + isl_basic_map_total_dim(bmap),
497 bmap->extra - bmap->n_div);
498 return bmap->n_ineq++;
501 int isl_basic_set_alloc_inequality(struct isl_basic_set *bset)
503 return isl_basic_map_alloc_inequality((struct isl_basic_map *)bset);
506 int isl_basic_map_free_inequality(struct isl_basic_map *bmap, unsigned n)
510 isl_assert(bmap->ctx, n <= bmap->n_ineq, return -1);
515 int isl_basic_set_free_inequality(struct isl_basic_set *bset, unsigned n)
517 return isl_basic_map_free_inequality((struct isl_basic_map *)bset, n);
520 int isl_basic_map_drop_inequality(struct isl_basic_map *bmap, unsigned pos)
525 isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
527 if (pos != bmap->n_ineq - 1) {
529 bmap->ineq[pos] = bmap->ineq[bmap->n_ineq - 1];
530 bmap->ineq[bmap->n_ineq - 1] = t;
531 F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
537 int isl_basic_set_drop_inequality(struct isl_basic_set *bset, unsigned pos)
539 return isl_basic_map_drop_inequality((struct isl_basic_map *)bset, pos);
542 int isl_basic_map_alloc_div(struct isl_basic_map *bmap)
546 isl_assert(bmap->ctx, bmap->n_div < bmap->extra, return -1);
547 isl_seq_clr(bmap->div[bmap->n_div] +
548 1 + 1 + isl_basic_map_total_dim(bmap),
549 bmap->extra - bmap->n_div);
550 return bmap->n_div++;
553 int isl_basic_map_free_div(struct isl_basic_map *bmap, unsigned n)
557 isl_assert(bmap->ctx, n <= bmap->n_div, return -1);
562 /* Copy constraint from src to dst, putting the vars of src at offset
563 * dim_off in dst and the divs of src at offset div_off in dst.
564 * If both sets are actually map, then dim_off applies to the input
567 static void copy_constraint(struct isl_basic_map *dst_map, isl_int *dst,
568 struct isl_basic_map *src_map, isl_int *src,
569 unsigned in_off, unsigned out_off, unsigned div_off)
571 unsigned src_nparam = isl_basic_map_n_param(src_map);
572 unsigned dst_nparam = isl_basic_map_n_param(dst_map);
573 unsigned src_in = isl_basic_map_n_in(src_map);
574 unsigned dst_in = isl_basic_map_n_in(dst_map);
575 unsigned src_out = isl_basic_map_n_out(src_map);
576 unsigned dst_out = isl_basic_map_n_out(dst_map);
577 isl_int_set(dst[0], src[0]);
578 isl_seq_cpy(dst+1, src+1, isl_min(dst_nparam, src_nparam));
579 if (dst_nparam > src_nparam)
580 isl_seq_clr(dst+1+src_nparam,
581 dst_nparam - src_nparam);
582 isl_seq_clr(dst+1+dst_nparam, in_off);
583 isl_seq_cpy(dst+1+dst_nparam+in_off,
585 isl_min(dst_in-in_off, src_in));
586 if (dst_in-in_off > src_in)
587 isl_seq_clr(dst+1+dst_nparam+in_off+src_in,
588 dst_in - in_off - src_in);
589 isl_seq_clr(dst+1+dst_nparam+dst_in, out_off);
590 isl_seq_cpy(dst+1+dst_nparam+dst_in+out_off,
591 src+1+src_nparam+src_in,
592 isl_min(dst_out-out_off, src_out));
593 if (dst_out-out_off > src_out)
594 isl_seq_clr(dst+1+dst_nparam+dst_in+out_off+src_out,
595 dst_out - out_off - src_out);
596 isl_seq_clr(dst+1+dst_nparam+dst_in+dst_out, div_off);
597 isl_seq_cpy(dst+1+dst_nparam+dst_in+dst_out+div_off,
598 src+1+src_nparam+src_in+src_out,
599 isl_min(dst_map->extra-div_off, src_map->n_div));
600 if (dst_map->n_div-div_off > src_map->n_div)
601 isl_seq_clr(dst+1+dst_nparam+dst_in+dst_out+
602 div_off+src_map->n_div,
603 dst_map->n_div - div_off - src_map->n_div);
606 static void copy_div(struct isl_basic_map *dst_map, isl_int *dst,
607 struct isl_basic_map *src_map, isl_int *src,
608 unsigned in_off, unsigned out_off, unsigned div_off)
610 isl_int_set(dst[0], src[0]);
611 copy_constraint(dst_map, dst+1, src_map, src+1, in_off, out_off, div_off);
614 static struct isl_basic_map *add_constraints(struct isl_basic_map *bmap1,
615 struct isl_basic_map *bmap2, unsigned i_pos, unsigned o_pos)
620 if (!bmap1 || !bmap2)
623 div_off = bmap1->n_div;
625 for (i = 0; i < bmap2->n_eq; ++i) {
626 int i1 = isl_basic_map_alloc_equality(bmap1);
629 copy_constraint(bmap1, bmap1->eq[i1], bmap2, bmap2->eq[i],
630 i_pos, o_pos, div_off);
633 for (i = 0; i < bmap2->n_ineq; ++i) {
634 int i1 = isl_basic_map_alloc_inequality(bmap1);
637 copy_constraint(bmap1, bmap1->ineq[i1], bmap2, bmap2->ineq[i],
638 i_pos, o_pos, div_off);
641 for (i = 0; i < bmap2->n_div; ++i) {
642 int i1 = isl_basic_map_alloc_div(bmap1);
645 copy_div(bmap1, bmap1->div[i1], bmap2, bmap2->div[i],
646 i_pos, o_pos, div_off);
649 isl_basic_map_free(bmap2);
654 isl_basic_map_free(bmap1);
655 isl_basic_map_free(bmap2);
659 static void copy_constraint_dim_map(isl_int *dst, isl_int *src,
660 struct isl_dim_map *dim_map)
664 for (i = 0; i < dim_map->len; ++i) {
665 if (dim_map->pos[i] < 0)
666 isl_int_set_si(dst[i], 0);
668 isl_int_set(dst[i], src[dim_map->pos[i]]);
672 static void copy_div_dim_map(isl_int *dst, isl_int *src,
673 struct isl_dim_map *dim_map)
675 isl_int_set(dst[0], src[0]);
676 copy_constraint_dim_map(dst+1, src+1, dim_map);
679 static struct isl_basic_map *add_constraints_dim_map(struct isl_basic_map *dst,
680 struct isl_basic_map *src, struct isl_dim_map *dim_map)
684 if (!src || !dst || !dim_map)
687 for (i = 0; i < src->n_eq; ++i) {
688 int i1 = isl_basic_map_alloc_equality(dst);
691 copy_constraint_dim_map(dst->eq[i1], src->eq[i], dim_map);
694 for (i = 0; i < src->n_ineq; ++i) {
695 int i1 = isl_basic_map_alloc_inequality(dst);
698 copy_constraint_dim_map(dst->ineq[i1], src->ineq[i], dim_map);
701 for (i = 0; i < src->n_div; ++i) {
702 int i1 = isl_basic_map_alloc_div(dst);
705 copy_div_dim_map(dst->div[i1], src->div[i], dim_map);
709 isl_basic_map_free(src);
714 isl_basic_map_free(src);
715 isl_basic_map_free(dst);
719 static struct isl_basic_set *set_add_constraints(struct isl_basic_set *bset1,
720 struct isl_basic_set *bset2, unsigned pos)
722 return (struct isl_basic_set *)
723 add_constraints((struct isl_basic_map *)bset1,
724 (struct isl_basic_map *)bset2, 0, pos);
727 struct isl_basic_map *isl_basic_map_extend_dim(struct isl_basic_map *base,
728 struct isl_dim *dim, unsigned extra,
729 unsigned n_eq, unsigned n_ineq)
731 struct isl_basic_map *ext;
738 base = isl_basic_map_cow(base);
742 dims_ok = isl_dim_equal(base->dim, dim) &&
743 base->extra >= base->n_div + extra;
745 if (dims_ok && n_eq == 0 && n_ineq == 0) {
750 isl_assert(base->ctx, base->dim->nparam <= dim->nparam, goto error);
751 isl_assert(base->ctx, base->dim->n_in <= dim->n_in, goto error);
752 isl_assert(base->ctx, base->dim->n_out <= dim->n_out, goto error);
753 extra += base->extra;
755 n_ineq += base->n_ineq;
757 ext = isl_basic_map_alloc_dim(dim, extra, n_eq, n_ineq);
763 ext = add_constraints(ext, base, 0, 0);
766 F_CLR(ext, ISL_BASIC_SET_FINAL);
773 isl_basic_map_free(base);
777 struct isl_basic_map *isl_basic_map_extend_constraints(
778 struct isl_basic_map *base, unsigned n_eq, unsigned n_ineq)
782 return isl_basic_map_extend_dim(base, isl_dim_copy(base->dim),
786 struct isl_basic_map *isl_basic_map_extend(struct isl_basic_map *base,
787 unsigned nparam, unsigned n_in, unsigned n_out, unsigned extra,
788 unsigned n_eq, unsigned n_ineq)
790 struct isl_basic_map *bmap;
795 dim = isl_dim_alloc(base->ctx, nparam, n_in, n_out);
799 bmap = isl_basic_map_extend_dim(base, dim, extra, n_eq, n_ineq);
803 struct isl_basic_set *isl_basic_set_extend(struct isl_basic_set *base,
804 unsigned nparam, unsigned dim, unsigned extra,
805 unsigned n_eq, unsigned n_ineq)
807 return (struct isl_basic_set *)
808 isl_basic_map_extend((struct isl_basic_map *)base,
809 nparam, 0, dim, extra, n_eq, n_ineq);
812 struct isl_basic_set *isl_basic_set_extend_constraints(
813 struct isl_basic_set *base, unsigned n_eq, unsigned n_ineq)
815 return (struct isl_basic_set *)
816 isl_basic_map_extend_constraints((struct isl_basic_map *)base,
820 struct isl_basic_set *isl_basic_set_cow(struct isl_basic_set *bset)
822 return (struct isl_basic_set *)
823 isl_basic_map_cow((struct isl_basic_map *)bset);
826 struct isl_basic_map *isl_basic_map_cow(struct isl_basic_map *bmap)
833 bmap = isl_basic_map_dup(bmap);
835 F_CLR(bmap, ISL_BASIC_SET_FINAL);
839 struct isl_set *isl_set_cow(struct isl_set *set)
847 return isl_set_dup(set);
850 struct isl_map *isl_map_cow(struct isl_map *map)
858 return isl_map_dup(map);
861 static void swap_vars(struct isl_blk blk, isl_int *a,
862 unsigned a_len, unsigned b_len)
864 isl_seq_cpy(blk.data, a+a_len, b_len);
865 isl_seq_cpy(blk.data+b_len, a, a_len);
866 isl_seq_cpy(a, blk.data, b_len+a_len);
869 struct isl_basic_set *isl_basic_set_swap_vars(
870 struct isl_basic_set *bset, unsigned n)
880 nparam = isl_basic_set_n_param(bset);
881 dim = isl_basic_set_n_dim(bset);
882 isl_assert(bset->ctx, n <= dim, goto error);
887 bset = isl_basic_set_cow(bset);
891 blk = isl_blk_alloc(bset->ctx, dim);
892 if (isl_blk_is_error(blk))
895 for (i = 0; i < bset->n_eq; ++i)
897 bset->eq[i]+1+nparam, n, dim - n);
899 for (i = 0; i < bset->n_ineq; ++i)
901 bset->ineq[i]+1+nparam, n, dim - n);
903 for (i = 0; i < bset->n_div; ++i)
905 bset->div[i]+1+1+nparam, n, dim - n);
907 isl_blk_free(bset->ctx, blk);
909 F_CLR(bset, ISL_BASIC_SET_NORMALIZED);
913 isl_basic_set_free(bset);
917 struct isl_set *isl_set_swap_vars(struct isl_set *set, unsigned n)
920 set = isl_set_cow(set);
924 for (i = 0; i < set->n; ++i) {
925 set->p[i] = isl_basic_set_swap_vars(set->p[i], n);
931 F_CLR(set, ISL_SET_NORMALIZED);
935 static void constraint_drop_vars(isl_int *c, unsigned n, unsigned rem)
937 isl_seq_cpy(c, c + n, rem);
938 isl_seq_clr(c + rem, n);
941 /* Drop n dimensions starting at first.
943 * In principle, this frees up some extra variables as the number
944 * of columns remains constant, but we would have to extend
945 * the div array too as the number of rows in this array is assumed
946 * to be equal to extra.
948 struct isl_basic_set *isl_basic_set_drop_dims(
949 struct isl_basic_set *bset, unsigned first, unsigned n)
956 isl_assert(bset->ctx, first + n <= bset->dim->n_out, goto error);
961 bset = isl_basic_set_cow(bset);
965 for (i = 0; i < bset->n_eq; ++i)
966 constraint_drop_vars(bset->eq[i]+1+bset->dim->nparam+first, n,
967 (bset->dim->n_out-first-n)+bset->extra);
969 for (i = 0; i < bset->n_ineq; ++i)
970 constraint_drop_vars(bset->ineq[i]+1+bset->dim->nparam+first, n,
971 (bset->dim->n_out-first-n)+bset->extra);
973 for (i = 0; i < bset->n_div; ++i)
974 constraint_drop_vars(bset->div[i]+1+1+bset->dim->nparam+first, n,
975 (bset->dim->n_out-first-n)+bset->extra);
977 bset->dim = isl_dim_drop_outputs(bset->dim, first, n);
981 F_CLR(bset, ISL_BASIC_SET_NORMALIZED);
982 bset = isl_basic_set_simplify(bset);
983 return isl_basic_set_finalize(bset);
985 isl_basic_set_free(bset);
989 static struct isl_set *isl_set_drop_dims(
990 struct isl_set *set, unsigned first, unsigned n)
997 isl_assert(set->ctx, first + n <= set->dim->n_out, goto error);
1001 set = isl_set_cow(set);
1004 set->dim = isl_dim_drop_outputs(set->dim, first, n);
1008 for (i = 0; i < set->n; ++i) {
1009 set->p[i] = isl_basic_set_drop_dims(set->p[i], first, n);
1014 F_CLR(set, ISL_SET_NORMALIZED);
1021 /* Drop n input dimensions starting at first.
1023 * In principle, this frees up some extra variables as the number
1024 * of columns remains constant, but we would have to extend
1025 * the div array too as the number of rows in this array is assumed
1026 * to be equal to extra.
1028 struct isl_basic_map *isl_basic_map_drop_inputs(
1029 struct isl_basic_map *bmap, unsigned first, unsigned n)
1039 nparam = isl_basic_map_n_param(bmap);
1040 n_in = isl_basic_map_n_in(bmap);
1041 n_out = isl_basic_map_n_out(bmap);
1042 isl_assert(bmap->ctx, first + n <= n_in, goto error);
1047 bmap = isl_basic_map_cow(bmap);
1051 for (i = 0; i < bmap->n_eq; ++i)
1052 constraint_drop_vars(bmap->eq[i]+1+nparam+first, n,
1053 (n_in-first-n)+n_out+bmap->extra);
1055 for (i = 0; i < bmap->n_ineq; ++i)
1056 constraint_drop_vars(bmap->ineq[i]+1+nparam+first, n,
1057 (n_in-first-n)+n_out+bmap->extra);
1059 for (i = 0; i < bmap->n_div; ++i)
1060 constraint_drop_vars(bmap->div[i]+1+1+nparam+first, n,
1061 (n_in-first-n)+n_out+bmap->extra);
1063 bmap->dim = isl_dim_drop_inputs(bmap->dim, first, n);
1067 F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1068 bmap = isl_basic_map_simplify(bmap);
1069 return isl_basic_map_finalize(bmap);
1071 isl_basic_map_free(bmap);
1075 static struct isl_map *isl_map_drop_inputs(
1076 struct isl_map *map, unsigned first, unsigned n)
1083 isl_assert(map->ctx, first + n <= map->dim->n_in, goto error);
1087 map = isl_map_cow(map);
1090 map->dim = isl_dim_drop_inputs(map->dim, first, n);
1094 for (i = 0; i < map->n; ++i) {
1095 map->p[i] = isl_basic_map_drop_inputs(map->p[i], first, n);
1099 F_CLR(map, ISL_MAP_NORMALIZED);
1108 * We don't cow, as the div is assumed to be redundant.
1110 static struct isl_basic_map *isl_basic_map_drop_div(
1111 struct isl_basic_map *bmap, unsigned div)
1119 pos = 1 + isl_dim_total(bmap->dim) + div;
1121 isl_assert(bmap->ctx, div < bmap->n_div, goto error);
1123 for (i = 0; i < bmap->n_eq; ++i)
1124 constraint_drop_vars(bmap->eq[i]+pos, 1, bmap->extra-div-1);
1126 for (i = 0; i < bmap->n_ineq; ++i) {
1127 if (!isl_int_is_zero(bmap->ineq[i][pos])) {
1128 isl_basic_map_drop_inequality(bmap, i);
1132 constraint_drop_vars(bmap->ineq[i]+pos, 1, bmap->extra-div-1);
1135 for (i = 0; i < bmap->n_div; ++i)
1136 constraint_drop_vars(bmap->div[i]+1+pos, 1, bmap->extra-div-1);
1138 if (div != bmap->n_div - 1) {
1140 isl_int *t = bmap->div[div];
1142 for (j = div; j < bmap->n_div - 1; ++j)
1143 bmap->div[j] = bmap->div[j+1];
1145 bmap->div[bmap->n_div - 1] = t;
1147 F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1148 isl_basic_map_free_div(bmap, 1);
1152 isl_basic_map_free(bmap);
1156 static void eliminate_div(struct isl_basic_map *bmap, isl_int *eq, unsigned div)
1159 unsigned pos = 1 + isl_dim_total(bmap->dim) + div;
1161 len = 1 + isl_basic_map_total_dim(bmap);
1163 for (i = 0; i < bmap->n_eq; ++i)
1164 if (bmap->eq[i] != eq)
1165 isl_seq_elim(bmap->eq[i], eq, pos, len, NULL);
1167 for (i = 0; i < bmap->n_ineq; ++i)
1168 isl_seq_elim(bmap->ineq[i], eq, pos, len, NULL);
1170 /* We need to be careful about circular definitions,
1171 * so for now we just remove the definitions of other divs that
1172 * depend on this div and (possibly) recompute them later.
1174 for (i = 0; i < bmap->n_div; ++i)
1175 if (!isl_int_is_zero(bmap->div[i][0]) &&
1176 !isl_int_is_zero(bmap->div[i][1 + pos]))
1177 isl_seq_clr(bmap->div[i], 1 + len);
1179 isl_basic_map_drop_div(bmap, div);
1182 struct isl_basic_map *isl_basic_map_set_to_empty(struct isl_basic_map *bmap)
1188 total = isl_basic_map_total_dim(bmap);
1189 isl_basic_map_free_div(bmap, bmap->n_div);
1190 isl_basic_map_free_inequality(bmap, bmap->n_ineq);
1192 isl_basic_map_free_equality(bmap, bmap->n_eq-1);
1194 isl_basic_map_alloc_equality(bmap);
1198 isl_int_set_si(bmap->eq[i][0], 1);
1199 isl_seq_clr(bmap->eq[i]+1, total);
1200 F_SET(bmap, ISL_BASIC_MAP_EMPTY);
1201 return isl_basic_map_finalize(bmap);
1203 isl_basic_map_free(bmap);
1207 struct isl_basic_set *isl_basic_set_set_to_empty(struct isl_basic_set *bset)
1209 return (struct isl_basic_set *)
1210 isl_basic_map_set_to_empty((struct isl_basic_map *)bset);
1213 static void swap_equality(struct isl_basic_map *bmap, int a, int b)
1215 isl_int *t = bmap->eq[a];
1216 bmap->eq[a] = bmap->eq[b];
1220 static void swap_inequality(struct isl_basic_map *bmap, int a, int b)
1223 isl_int *t = bmap->ineq[a];
1224 bmap->ineq[a] = bmap->ineq[b];
1229 static void set_swap_inequality(struct isl_basic_set *bset, int a, int b)
1231 swap_inequality((struct isl_basic_map *)bset, a, b);
1234 static void swap_div(struct isl_basic_map *bmap, int a, int b)
1237 unsigned off = isl_dim_total(bmap->dim);
1238 isl_int *t = bmap->div[a];
1239 bmap->div[a] = bmap->div[b];
1242 for (i = 0; i < bmap->n_eq; ++i)
1243 isl_int_swap(bmap->eq[i][1+off+a], bmap->eq[i][1+off+b]);
1245 for (i = 0; i < bmap->n_ineq; ++i)
1246 isl_int_swap(bmap->ineq[i][1+off+a], bmap->ineq[i][1+off+b]);
1248 for (i = 0; i < bmap->n_div; ++i)
1249 isl_int_swap(bmap->div[i][1+1+off+a], bmap->div[i][1+1+off+b]);
1250 F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1253 static void eliminate_var_using_equality(struct isl_basic_map *bmap,
1254 unsigned pos, isl_int *eq, int *progress)
1259 total = isl_basic_map_total_dim(bmap);
1260 for (k = 0; k < bmap->n_eq; ++k) {
1261 if (bmap->eq[k] == eq)
1263 if (isl_int_is_zero(bmap->eq[k][1+pos]))
1267 isl_seq_elim(bmap->eq[k], eq, 1+pos, 1+total, NULL);
1270 for (k = 0; k < bmap->n_ineq; ++k) {
1271 if (isl_int_is_zero(bmap->ineq[k][1+pos]))
1275 isl_seq_elim(bmap->ineq[k], eq, 1+pos, 1+total, NULL);
1276 F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1279 for (k = 0; k < bmap->n_div; ++k) {
1280 if (isl_int_is_zero(bmap->div[k][0]))
1282 if (isl_int_is_zero(bmap->div[k][1+1+pos]))
1286 isl_seq_elim(bmap->div[k]+1, eq,
1287 1+pos, 1+total, &bmap->div[k][0]);
1288 F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1293 struct isl_basic_map *isl_basic_map_gauss(
1294 struct isl_basic_map *bmap, int *progress)
1305 total = isl_basic_map_total_dim(bmap);
1306 total_var = total - bmap->n_div;
1308 last_var = total - 1;
1309 for (done = 0; done < bmap->n_eq; ++done) {
1310 for (; last_var >= 0; --last_var) {
1311 for (k = done; k < bmap->n_eq; ++k)
1312 if (!isl_int_is_zero(bmap->eq[k][1+last_var]))
1320 swap_equality(bmap, k, done);
1321 if (isl_int_is_neg(bmap->eq[done][1+last_var]))
1322 isl_seq_neg(bmap->eq[done], bmap->eq[done], 1+total);
1324 eliminate_var_using_equality(bmap, last_var, bmap->eq[done],
1327 if (last_var >= total_var &&
1328 isl_int_is_zero(bmap->div[last_var - total_var][0])) {
1329 unsigned div = last_var - total_var;
1330 isl_seq_neg(bmap->div[div]+1, bmap->eq[done], 1+total);
1331 isl_int_set_si(bmap->div[div][1+1+last_var], 0);
1332 isl_int_set(bmap->div[div][0],
1333 bmap->eq[done][1+last_var]);
1334 F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1337 if (done == bmap->n_eq)
1339 for (k = done; k < bmap->n_eq; ++k) {
1340 if (isl_int_is_zero(bmap->eq[k][0]))
1342 return isl_basic_map_set_to_empty(bmap);
1344 isl_basic_map_free_equality(bmap, bmap->n_eq-done);
1348 struct isl_basic_set *isl_basic_set_gauss(
1349 struct isl_basic_set *bset, int *progress)
1351 return (struct isl_basic_set*)isl_basic_map_gauss(
1352 (struct isl_basic_map *)bset, progress);
1355 static unsigned int round_up(unsigned int v)
1366 static int hash_index(isl_int ***index, unsigned int size, int bits,
1367 struct isl_basic_map *bmap, int k)
1370 unsigned total = isl_basic_map_total_dim(bmap);
1371 uint32_t hash = isl_seq_get_hash_bits(bmap->ineq[k]+1, total, bits);
1372 for (h = hash; index[h]; h = (h+1) % size)
1373 if (&bmap->ineq[k] != index[h] &&
1374 isl_seq_eq(bmap->ineq[k]+1, index[h][0]+1, total))
1379 static int set_hash_index(isl_int ***index, unsigned int size, int bits,
1380 struct isl_basic_set *bset, int k)
1382 return hash_index(index, size, bits, (struct isl_basic_map *)bset, k);
1385 static struct isl_basic_map *remove_duplicate_constraints(
1386 struct isl_basic_map *bmap, int *progress)
1392 unsigned total = isl_basic_map_total_dim(bmap);
1395 if (bmap->n_ineq <= 1)
1398 size = round_up(4 * (bmap->n_ineq+1) / 3 - 1);
1399 bits = ffs(size) - 1;
1400 index = isl_calloc_array(ctx, isl_int **, size);
1404 index[isl_seq_get_hash_bits(bmap->ineq[0]+1, total, bits)] = &bmap->ineq[0];
1405 for (k = 1; k < bmap->n_ineq; ++k) {
1406 h = hash_index(index, size, bits, bmap, k);
1408 index[h] = &bmap->ineq[k];
1413 l = index[h] - &bmap->ineq[0];
1414 if (isl_int_lt(bmap->ineq[k][0], bmap->ineq[l][0]))
1415 swap_inequality(bmap, k, l);
1416 isl_basic_map_drop_inequality(bmap, k);
1420 for (k = 0; k < bmap->n_ineq-1; ++k) {
1421 isl_seq_neg(bmap->ineq[k]+1, bmap->ineq[k]+1, total);
1422 h = hash_index(index, size, bits, bmap, k);
1423 isl_seq_neg(bmap->ineq[k]+1, bmap->ineq[k]+1, total);
1426 l = index[h] - &bmap->ineq[0];
1427 isl_int_add(sum, bmap->ineq[k][0], bmap->ineq[l][0]);
1428 if (isl_int_is_pos(sum))
1430 if (isl_int_is_zero(sum)) {
1431 /* We need to break out of the loop after these
1432 * changes since the contents of the hash
1433 * will no longer be valid.
1434 * Plus, we probably we want to regauss first.
1436 isl_basic_map_drop_inequality(bmap, l);
1437 isl_basic_map_inequality_to_equality(bmap, k);
1439 bmap = isl_basic_map_set_to_empty(bmap);
1448 static void compute_elimination_index(struct isl_basic_map *bmap, int *elim)
1453 total = isl_dim_total(bmap->dim);
1454 for (d = 0; d < total; ++d)
1456 for (d = total - 1, i = 0; d >= 0 && i < bmap->n_eq; ++i) {
1457 for (; d >= 0; --d) {
1458 if (isl_int_is_zero(bmap->eq[i][1+d]))
1466 static void set_compute_elimination_index(struct isl_basic_set *bset, int *elim)
1468 return compute_elimination_index((struct isl_basic_map *)bset, elim);
1471 static int reduced_using_equalities(isl_int *dst, isl_int *src,
1472 struct isl_basic_map *bmap, int *elim)
1478 total = isl_dim_total(bmap->dim);
1479 for (d = total - 1; d >= 0; --d) {
1480 if (isl_int_is_zero(src[1+d]))
1485 isl_seq_cpy(dst, src, 1 + total);
1488 isl_seq_elim(dst, bmap->eq[elim[d]], 1 + d, 1 + total, NULL);
1493 static int set_reduced_using_equalities(isl_int *dst, isl_int *src,
1494 struct isl_basic_set *bset, int *elim)
1496 return reduced_using_equalities(dst, src,
1497 (struct isl_basic_map *)bset, elim);
1500 /* Quick check to see if two basic maps are disjoint.
1501 * In particular, we reduce the equalities and inequalities of
1502 * one basic map in the context of the equalities of the other
1503 * basic map and check if we get a contradiction.
1505 int isl_basic_map_fast_is_disjoint(struct isl_basic_map *bmap1,
1506 struct isl_basic_map *bmap2)
1508 struct isl_vec *v = NULL;
1513 if (!bmap1 || !bmap2)
1515 isl_assert(bmap1->ctx, isl_dim_equal(bmap1->dim, bmap2->dim),
1517 if (bmap1->n_div || bmap2->n_div)
1519 if (!bmap1->n_eq && !bmap2->n_eq)
1522 total = isl_dim_total(bmap1->dim);
1525 v = isl_vec_alloc(bmap1->ctx, 1 + total);
1528 elim = isl_alloc_array(bmap1->ctx, int, total);
1531 compute_elimination_index(bmap1, elim);
1532 for (i = 0; i < bmap2->n_eq; ++i) {
1534 reduced = reduced_using_equalities(v->block.data, bmap2->eq[i],
1536 if (reduced && !isl_int_is_zero(v->block.data[0]) &&
1537 isl_seq_first_non_zero(v->block.data + 1, total) == -1)
1540 for (i = 0; i < bmap2->n_ineq; ++i) {
1542 reduced = reduced_using_equalities(v->block.data,
1543 bmap2->ineq[i], bmap1, elim);
1544 if (reduced && isl_int_is_neg(v->block.data[0]) &&
1545 isl_seq_first_non_zero(v->block.data + 1, total) == -1)
1548 compute_elimination_index(bmap2, elim);
1549 for (i = 0; i < bmap1->n_ineq; ++i) {
1551 reduced = reduced_using_equalities(v->block.data,
1552 bmap1->ineq[i], bmap2, elim);
1553 if (reduced && isl_int_is_neg(v->block.data[0]) &&
1554 isl_seq_first_non_zero(v->block.data + 1, total) == -1)
1557 isl_vec_free(bmap1->ctx, v);
1561 isl_vec_free(bmap1->ctx, v);
1565 isl_vec_free(bmap1->ctx, v);
1570 int isl_basic_set_fast_is_disjoint(struct isl_basic_set *bset1,
1571 struct isl_basic_set *bset2)
1573 return isl_basic_map_fast_is_disjoint((struct isl_basic_map *)bset1,
1574 (struct isl_basic_map *)bset2);
1577 int isl_map_fast_is_disjoint(struct isl_map *map1, struct isl_map *map2)
1584 if (isl_map_fast_is_equal(map1, map2))
1587 for (i = 0; i < map1->n; ++i) {
1588 for (j = 0; j < map2->n; ++j) {
1589 int d = isl_basic_map_fast_is_disjoint(map1->p[i],
1598 int isl_set_fast_is_disjoint(struct isl_set *set1, struct isl_set *set2)
1600 return isl_map_fast_is_disjoint((struct isl_map *)set1,
1601 (struct isl_map *)set2);
1604 static struct isl_basic_map *remove_duplicate_divs(
1605 struct isl_basic_map *bmap, int *progress)
1612 unsigned total_var = isl_dim_total(bmap->dim);
1613 unsigned total = total_var + bmap->n_div;
1614 struct isl_ctx *ctx;
1616 if (bmap->n_div <= 1)
1620 for (k = bmap->n_div - 1; k >= 0; --k)
1621 if (!isl_int_is_zero(bmap->div[k][0]))
1626 size = round_up(4 * bmap->n_div / 3 - 1);
1627 bits = ffs(size) - 1;
1628 index = isl_calloc_array(ctx, int, size);
1631 eq = isl_blk_alloc(ctx, 1+total);
1632 if (isl_blk_is_error(eq))
1635 isl_seq_clr(eq.data, 1+total);
1636 index[isl_seq_get_hash_bits(bmap->div[k], 2+total, bits)] = k + 1;
1637 for (--k; k >= 0; --k) {
1640 if (isl_int_is_zero(bmap->div[k][0]))
1643 hash = isl_seq_get_hash_bits(bmap->div[k], 2+total, bits);
1644 for (h = hash; index[h]; h = (h+1) % size)
1645 if (isl_seq_eq(bmap->div[k],
1646 bmap->div[index[h]-1], 2+total))
1651 isl_int_set_si(eq.data[1+total_var+k], -1);
1652 isl_int_set_si(eq.data[1+total_var+l], 1);
1653 eliminate_div(bmap, eq.data, l);
1654 isl_int_set_si(eq.data[1+total_var+k], 0);
1655 isl_int_set_si(eq.data[1+total_var+l], 0);
1660 isl_blk_free(ctx, eq);
1666 /* Elimininate divs based on equalities
1668 static struct isl_basic_map *eliminate_divs_eq(
1669 struct isl_basic_map *bmap, int *progress)
1679 off = 1 + isl_dim_total(bmap->dim);
1681 for (d = bmap->n_div - 1; d >= 0 ; --d) {
1682 for (i = 0; i < bmap->n_eq; ++i) {
1683 if (!isl_int_is_one(bmap->eq[i][off + d]) &&
1684 !isl_int_is_negone(bmap->eq[i][off + d]))
1688 eliminate_div(bmap, bmap->eq[i], d);
1689 isl_basic_map_drop_equality(bmap, i);
1694 return eliminate_divs_eq(bmap, progress);
1698 static struct isl_basic_map *normalize_constraints(struct isl_basic_map *bmap)
1702 unsigned total = isl_basic_map_total_dim(bmap);
1705 for (i = bmap->n_eq - 1; i >= 0; --i) {
1706 isl_seq_gcd(bmap->eq[i]+1, total, &gcd);
1707 if (isl_int_is_zero(gcd)) {
1708 if (!isl_int_is_zero(bmap->eq[i][0])) {
1709 bmap = isl_basic_map_set_to_empty(bmap);
1712 isl_basic_map_drop_equality(bmap, i);
1715 if (F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL))
1716 isl_int_gcd(gcd, gcd, bmap->eq[i][0]);
1717 if (isl_int_is_one(gcd))
1719 if (!isl_int_is_divisible_by(bmap->eq[i][0], gcd)) {
1720 bmap = isl_basic_map_set_to_empty(bmap);
1723 isl_seq_scale_down(bmap->eq[i], bmap->eq[i], gcd, 1+total);
1726 for (i = bmap->n_ineq - 1; i >= 0; --i) {
1727 isl_seq_gcd(bmap->ineq[i]+1, total, &gcd);
1728 if (isl_int_is_zero(gcd)) {
1729 if (isl_int_is_neg(bmap->ineq[i][0])) {
1730 bmap = isl_basic_map_set_to_empty(bmap);
1733 isl_basic_map_drop_inequality(bmap, i);
1736 if (F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL))
1737 isl_int_gcd(gcd, gcd, bmap->ineq[i][0]);
1738 if (isl_int_is_one(gcd))
1740 isl_int_fdiv_q(bmap->ineq[i][0], bmap->ineq[i][0], gcd);
1741 isl_seq_scale_down(bmap->ineq[i]+1, bmap->ineq[i]+1, gcd, total);
1749 /* Remove any div that is defined in terms of the given variable.
1751 static struct isl_basic_map *remove_dependent_vars(struct isl_basic_map *bmap,
1755 unsigned dim = isl_dim_total(bmap->dim);
1757 for (i = 0; i < bmap->n_div; ++i) {
1758 if (isl_int_is_zero(bmap->div[i][0]))
1760 if (isl_int_is_zero(bmap->div[i][1+1+pos]))
1762 bmap = isl_basic_map_eliminate_vars(bmap, dim + i, 1);
1770 /* Eliminate the specified variables from the constraints using
1771 * Fourier-Motzkin. The variables themselves are not removed.
1773 struct isl_basic_map *isl_basic_map_eliminate_vars(
1774 struct isl_basic_map *bmap, unsigned pos, unsigned n)
1784 total = isl_basic_map_total_dim(bmap);
1786 bmap = isl_basic_map_cow(bmap);
1787 for (d = pos + n - 1; d >= 0 && d >= pos; --d) {
1788 int n_lower, n_upper;
1789 bmap = remove_dependent_vars(bmap, d);
1792 if (d >= total - bmap->n_div)
1793 isl_seq_clr(bmap->div[d-(total-bmap->n_div)], 2+total);
1794 for (i = 0; i < bmap->n_eq; ++i) {
1795 if (isl_int_is_zero(bmap->eq[i][1+d]))
1797 eliminate_var_using_equality(bmap, d, bmap->eq[i], NULL);
1798 isl_basic_map_drop_equality(bmap, i);
1805 for (i = 0; i < bmap->n_ineq; ++i) {
1806 if (isl_int_is_pos(bmap->ineq[i][1+d]))
1808 else if (isl_int_is_neg(bmap->ineq[i][1+d]))
1811 bmap = isl_basic_map_extend_constraints(bmap,
1812 0, n_lower * n_upper);
1813 for (i = bmap->n_ineq - 1; i >= 0; --i) {
1815 if (isl_int_is_zero(bmap->ineq[i][1+d]))
1818 for (j = 0; j < i; ++j) {
1819 if (isl_int_is_zero(bmap->ineq[j][1+d]))
1822 if (isl_int_sgn(bmap->ineq[i][1+d]) ==
1823 isl_int_sgn(bmap->ineq[j][1+d]))
1825 k = isl_basic_map_alloc_inequality(bmap);
1828 isl_seq_cpy(bmap->ineq[k], bmap->ineq[i],
1830 isl_seq_elim(bmap->ineq[k], bmap->ineq[j],
1831 1+d, 1+total, NULL);
1833 isl_basic_map_drop_inequality(bmap, i);
1836 if (n_lower > 0 && n_upper > 0) {
1837 bmap = normalize_constraints(bmap);
1838 bmap = remove_duplicate_constraints(bmap, NULL);
1839 bmap = isl_basic_map_gauss(bmap, NULL);
1840 bmap = isl_basic_map_convex_hull(bmap);
1843 if (F_ISSET(bmap, ISL_BASIC_MAP_EMPTY))
1847 F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1850 isl_basic_map_free(bmap);
1854 struct isl_basic_set *isl_basic_set_eliminate_vars(
1855 struct isl_basic_set *bset, unsigned pos, unsigned n)
1857 return (struct isl_basic_set *)isl_basic_map_eliminate_vars(
1858 (struct isl_basic_map *)bset, pos, n);
1861 /* Eliminate the specified n dimensions starting at first from the
1862 * constraints using Fourier-Motzkin, The dimensions themselves
1865 struct isl_set *isl_set_eliminate_dims(struct isl_set *set,
1866 unsigned first, unsigned n)
1876 set = isl_set_cow(set);
1879 isl_assert(set->ctx, first+n <= isl_set_n_dim(set), goto error);
1880 nparam = isl_set_n_param(set);
1882 for (i = 0; i < set->n; ++i) {
1883 set->p[i] = isl_basic_set_eliminate_vars(set->p[i],
1894 /* Project out n dimensions starting at first using Fourier-Motzkin */
1895 struct isl_set *isl_set_remove_dims(struct isl_set *set,
1896 unsigned first, unsigned n)
1898 set = isl_set_eliminate_dims(set, first, n);
1899 set = isl_set_drop_dims(set, first, n);
1903 struct isl_basic_set *isl_basic_set_remove_divs(struct isl_basic_set *bset)
1905 bset = isl_basic_set_eliminate_vars(bset, isl_dim_total(bset->dim),
1913 struct isl_set *isl_set_remove_divs(struct isl_set *set)
1922 set = isl_set_cow(set);
1926 for (i = 0; i < set->n; ++i) {
1927 set->p[i] = isl_basic_set_remove_divs(set->p[i]);
1937 /* Project out n inputs starting at first using Fourier-Motzkin */
1938 struct isl_map *isl_map_remove_inputs(struct isl_map *map,
1939 unsigned first, unsigned n)
1947 map = isl_map_cow(map);
1950 nparam = isl_map_n_param(map);
1951 isl_assert(map->ctx, first+n <= isl_map_n_in(map), goto error);
1953 for (i = 0; i < map->n; ++i) {
1954 map->p[i] = isl_basic_map_eliminate_vars(map->p[i],
1959 map = isl_map_drop_inputs(map, first, n);
1966 /* Project out n dimensions starting at first using Fourier-Motzkin */
1967 struct isl_basic_set *isl_basic_set_remove_dims(struct isl_basic_set *bset,
1968 unsigned first, unsigned n)
1970 unsigned nparam = isl_basic_set_n_param(bset);
1971 bset = isl_basic_set_eliminate_vars(bset, nparam + first, n);
1972 bset = isl_basic_set_drop_dims(bset, first, n);
1976 /* Elimininate divs based on inequalities
1978 static struct isl_basic_map *eliminate_divs_ineq(
1979 struct isl_basic_map *bmap, int *progress)
1984 struct isl_ctx *ctx;
1990 off = 1 + isl_dim_total(bmap->dim);
1992 for (d = bmap->n_div - 1; d >= 0 ; --d) {
1993 for (i = 0; i < bmap->n_eq; ++i)
1994 if (!isl_int_is_zero(bmap->eq[i][off + d]))
1998 for (i = 0; i < bmap->n_ineq; ++i)
1999 if (isl_int_abs_gt(bmap->ineq[i][off + d], ctx->one))
2001 if (i < bmap->n_ineq)
2004 bmap = isl_basic_map_eliminate_vars(bmap, (off-1)+d, 1);
2005 if (F_ISSET(bmap, ISL_BASIC_MAP_EMPTY))
2007 bmap = isl_basic_map_drop_div(bmap, d);
2014 struct isl_basic_map *isl_basic_map_simplify(struct isl_basic_map *bmap)
2021 bmap = normalize_constraints(bmap);
2022 bmap = eliminate_divs_eq(bmap, &progress);
2023 bmap = eliminate_divs_ineq(bmap, &progress);
2024 bmap = isl_basic_map_gauss(bmap, &progress);
2025 bmap = remove_duplicate_divs(bmap, &progress);
2026 bmap = remove_duplicate_constraints(bmap, &progress);
2031 struct isl_basic_set *isl_basic_set_simplify(struct isl_basic_set *bset)
2033 return (struct isl_basic_set *)
2034 isl_basic_map_simplify((struct isl_basic_map *)bset);
2037 static void dump_term(struct isl_basic_map *bmap,
2038 isl_int c, int pos, FILE *out)
2041 unsigned in = isl_basic_map_n_in(bmap);
2042 unsigned dim = in + isl_basic_map_n_out(bmap);
2043 unsigned nparam = isl_basic_map_n_param(bmap);
2045 isl_int_print(out, c, 0);
2047 if (!isl_int_is_one(c))
2048 isl_int_print(out, c, 0);
2049 if (pos < 1 + nparam) {
2050 name = isl_dim_get_name(bmap->dim,
2051 isl_dim_param, pos - 1);
2053 fprintf(out, "%s", name);
2055 fprintf(out, "p%d", pos - 1);
2056 } else if (pos < 1 + nparam + in)
2057 fprintf(out, "i%d", pos - 1 - nparam);
2058 else if (pos < 1 + nparam + dim)
2059 fprintf(out, "o%d", pos - 1 - nparam - in);
2061 fprintf(out, "e%d", pos - 1 - nparam - dim);
2065 static void dump_constraint_sign(struct isl_basic_map *bmap, isl_int *c,
2066 int sign, FILE *out)
2070 unsigned len = 1 + isl_basic_map_total_dim(bmap);
2074 for (i = 0, first = 1; i < len; ++i) {
2075 if (isl_int_sgn(c[i]) * sign <= 0)
2078 fprintf(out, " + ");
2080 isl_int_abs(v, c[i]);
2081 dump_term(bmap, v, i, out);
2088 static void dump_constraint(struct isl_basic_map *bmap, isl_int *c,
2089 const char *op, FILE *out, int indent)
2093 fprintf(out, "%*s", indent, "");
2095 dump_constraint_sign(bmap, c, 1, out);
2096 fprintf(out, " %s ", op);
2097 dump_constraint_sign(bmap, c, -1, out);
2101 for (i = bmap->n_div; i < bmap->extra; ++i) {
2102 if (isl_int_is_zero(c[1+isl_dim_total(bmap->dim)+i]))
2104 fprintf(out, "%*s", indent, "");
2105 fprintf(out, "ERROR: unused div coefficient not zero\n");
2110 static void dump_constraints(struct isl_basic_map *bmap,
2111 isl_int **c, unsigned n,
2112 const char *op, FILE *out, int indent)
2116 for (i = 0; i < n; ++i)
2117 dump_constraint(bmap, c[i], op, out, indent);
2120 static void dump_affine(struct isl_basic_map *bmap, isl_int *exp, FILE *out)
2124 unsigned total = isl_basic_map_total_dim(bmap);
2126 for (j = 0; j < 1 + total; ++j) {
2127 if (isl_int_is_zero(exp[j]))
2129 if (!first && isl_int_is_pos(exp[j]))
2131 dump_term(bmap, exp[j], j, out);
2136 static void dump(struct isl_basic_map *bmap, FILE *out, int indent)
2140 dump_constraints(bmap, bmap->eq, bmap->n_eq, "=", out, indent);
2141 dump_constraints(bmap, bmap->ineq, bmap->n_ineq, ">=", out, indent);
2143 for (i = 0; i < bmap->n_div; ++i) {
2144 fprintf(out, "%*s", indent, "");
2145 fprintf(out, "e%d = [(", i);
2146 dump_affine(bmap, bmap->div[i]+1, out);
2148 isl_int_print(out, bmap->div[i][0], 0);
2149 fprintf(out, "]\n");
2153 void isl_basic_set_dump(struct isl_basic_set *bset, FILE *out, int indent)
2156 fprintf(out, "null basic set\n");
2160 fprintf(out, "%*s", indent, "");
2161 fprintf(out, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n",
2162 bset->ref, bset->dim->nparam, bset->dim->n_out,
2163 bset->extra, bset->flags);
2164 dump((struct isl_basic_map *)bset, out, indent);
2167 void isl_basic_map_dump(struct isl_basic_map *bmap, FILE *out, int indent)
2170 fprintf(out, "null basic map\n");
2174 fprintf(out, "%*s", indent, "");
2175 fprintf(out, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, "
2176 "flags: %x, n_name: %d\n",
2178 bmap->dim->nparam, bmap->dim->n_in, bmap->dim->n_out,
2179 bmap->extra, bmap->flags, bmap->dim->n_name);
2180 dump(bmap, out, indent);
2183 int isl_inequality_negate(struct isl_basic_map *bmap, unsigned pos)
2188 total = isl_basic_map_total_dim(bmap);
2189 isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
2190 isl_seq_neg(bmap->ineq[pos], bmap->ineq[pos], 1 + total);
2191 isl_int_sub_ui(bmap->ineq[pos][0], bmap->ineq[pos][0], 1);
2192 F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
2196 struct isl_set *isl_set_alloc_dim(struct isl_dim *dim, int n, unsigned flags)
2198 struct isl_set *set;
2202 isl_assert(dim->ctx, dim->n_in == 0, return NULL);
2203 isl_assert(dim->ctx, n >= 0, return NULL);
2204 set = isl_alloc(dim->ctx, struct isl_set,
2205 sizeof(struct isl_set) +
2206 n * sizeof(struct isl_basic_set *));
2210 set->ctx = dim->ctx;
2211 isl_ctx_ref(set->ctx);
2223 struct isl_set *isl_set_alloc(struct isl_ctx *ctx,
2224 unsigned nparam, unsigned dim, int n, unsigned flags)
2226 struct isl_set *set;
2227 struct isl_dim *dims;
2229 dims = isl_dim_alloc(ctx, nparam, 0, dim);
2233 set = isl_set_alloc_dim(dims, n, flags);
2237 struct isl_set *isl_set_dup(struct isl_set *set)
2240 struct isl_set *dup;
2245 dup = isl_set_alloc_dim(isl_dim_copy(set->dim), set->n, set->flags);
2248 for (i = 0; i < set->n; ++i)
2249 dup = isl_set_add(dup, isl_basic_set_copy(set->p[i]));
2253 struct isl_set *isl_set_from_basic_set(struct isl_basic_set *bset)
2255 struct isl_set *set;
2260 set = isl_set_alloc_dim(isl_dim_copy(bset->dim), 1, ISL_MAP_DISJOINT);
2262 isl_basic_set_free(bset);
2265 return isl_set_add(set, bset);
2268 struct isl_map *isl_map_from_basic_map(struct isl_basic_map *bmap)
2270 struct isl_map *map;
2275 map = isl_map_alloc_dim(isl_dim_copy(bmap->dim), 1, ISL_MAP_DISJOINT);
2277 isl_basic_map_free(bmap);
2280 return isl_map_add(map, bmap);
2283 struct isl_set *isl_set_add(struct isl_set *set, struct isl_basic_set *bset)
2287 isl_assert(set->ctx, isl_dim_equal(set->dim, bset->dim), goto error);
2288 isl_assert(set->ctx, set->n < set->size, goto error);
2289 set->p[set->n] = bset;
2296 isl_basic_set_free(bset);
2300 void isl_set_free(struct isl_set *set)
2310 isl_ctx_deref(set->ctx);
2311 for (i = 0; i < set->n; ++i)
2312 isl_basic_set_free(set->p[i]);
2313 isl_dim_free(set->dim);
2317 void isl_set_dump(struct isl_set *set, FILE *out, int indent)
2322 fprintf(out, "null set\n");
2326 fprintf(out, "%*s", indent, "");
2327 fprintf(out, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
2328 set->ref, set->n, set->dim->nparam, set->dim->n_out,
2330 for (i = 0; i < set->n; ++i) {
2331 fprintf(out, "%*s", indent, "");
2332 fprintf(out, "basic set %d:\n", i);
2333 isl_basic_set_dump(set->p[i], out, indent+4);
2337 void isl_map_dump(struct isl_map *map, FILE *out, int indent)
2342 fprintf(out, "null map\n");
2346 fprintf(out, "%*s", indent, "");
2347 fprintf(out, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, "
2348 "flags: %x, n_name: %d\n",
2349 map->ref, map->n, map->dim->nparam, map->dim->n_in,
2350 map->dim->n_out, map->flags, map->dim->n_name);
2351 for (i = 0; i < map->n; ++i) {
2352 fprintf(out, "%*s", indent, "");
2353 fprintf(out, "basic map %d:\n", i);
2354 isl_basic_map_dump(map->p[i], out, indent+4);
2358 struct isl_basic_map *isl_basic_map_intersect_domain(
2359 struct isl_basic_map *bmap, struct isl_basic_set *bset)
2361 struct isl_basic_map *bmap_domain;
2362 struct isl_dim *dim;
2367 isl_assert(set->ctx, isl_basic_map_compatible_domain(bmap, bset),
2370 bmap = isl_basic_map_extend_dim(bmap, isl_dim_copy(bmap->dim),
2371 bset->n_div, bset->n_eq, bset->n_ineq);
2374 dim = isl_dim_reverse(isl_dim_copy(bset->dim));
2375 bmap_domain = isl_basic_map_from_basic_set(bset, dim);
2376 bmap = add_constraints(bmap, bmap_domain, 0, 0);
2378 bmap = isl_basic_map_simplify(bmap);
2379 return isl_basic_map_finalize(bmap);
2381 isl_basic_map_free(bmap);
2382 isl_basic_set_free(bset);
2386 struct isl_basic_map *isl_basic_map_intersect_range(
2387 struct isl_basic_map *bmap, struct isl_basic_set *bset)
2389 struct isl_basic_map *bmap_range;
2394 isl_assert(bset->ctx, isl_basic_map_compatible_range(bmap, bset),
2397 bmap = isl_basic_map_extend_dim(bmap, isl_dim_copy(bmap->dim),
2398 bset->n_div, bset->n_eq, bset->n_ineq);
2401 bmap_range = isl_basic_map_from_basic_set(bset, isl_dim_copy(bset->dim));
2402 bmap = add_constraints(bmap, bmap_range, 0, 0);
2404 bmap = isl_basic_map_simplify(bmap);
2405 return isl_basic_map_finalize(bmap);
2407 isl_basic_map_free(bmap);
2408 isl_basic_set_free(bset);
2412 struct isl_basic_map *isl_basic_map_intersect(
2413 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2415 if (!bmap1 || !bmap2)
2418 isl_assert(map1->ctx, isl_dim_equal(bmap1->dim, bmap2->dim), goto error);
2420 bmap1 = isl_basic_map_extend_dim(bmap1, isl_dim_copy(bmap1->dim),
2421 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
2424 bmap1 = add_constraints(bmap1, bmap2, 0, 0);
2426 bmap1 = isl_basic_map_simplify(bmap1);
2427 return isl_basic_map_finalize(bmap1);
2429 isl_basic_map_free(bmap1);
2430 isl_basic_map_free(bmap2);
2434 struct isl_basic_set *isl_basic_set_intersect(
2435 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
2437 return (struct isl_basic_set *)
2438 isl_basic_map_intersect(
2439 (struct isl_basic_map *)bset1,
2440 (struct isl_basic_map *)bset2);
2443 struct isl_map *isl_map_intersect(struct isl_map *map1, struct isl_map *map2)
2446 struct isl_map *result;
2452 if (F_ISSET(map1, ISL_MAP_DISJOINT) &&
2453 F_ISSET(map2, ISL_MAP_DISJOINT))
2454 FL_SET(flags, ISL_MAP_DISJOINT);
2456 result = isl_map_alloc_dim(isl_dim_copy(map1->dim),
2457 map1->n * map2->n, flags);
2460 for (i = 0; i < map1->n; ++i)
2461 for (j = 0; j < map2->n; ++j) {
2462 struct isl_basic_map *part;
2463 part = isl_basic_map_intersect(
2464 isl_basic_map_copy(map1->p[i]),
2465 isl_basic_map_copy(map2->p[j]));
2466 if (isl_basic_map_is_empty(part))
2467 isl_basic_map_free(part);
2469 result = isl_map_add(result, part);
2482 struct isl_set *isl_set_intersect(struct isl_set *set1, struct isl_set *set2)
2484 return (struct isl_set *)
2485 isl_map_intersect((struct isl_map *)set1,
2486 (struct isl_map *)set2);
2489 struct isl_basic_map *isl_basic_map_reverse(struct isl_basic_map *bmap)
2491 struct isl_dim *dim;
2492 struct isl_basic_set *bset;
2497 bmap = isl_basic_map_cow(bmap);
2500 dim = isl_dim_reverse(isl_dim_copy(bmap->dim));
2501 in = isl_basic_map_n_in(bmap);
2502 bset = isl_basic_set_from_basic_map(bmap);
2503 bset = isl_basic_set_swap_vars(bset, in);
2504 return isl_basic_map_from_basic_set(bset, dim);
2507 /* Turn final n dimensions into existentially quantified variables.
2509 struct isl_basic_set *isl_basic_set_project_out(
2510 struct isl_basic_set *bset, unsigned n, unsigned flags)
2520 isl_assert(bset->ctx, n <= isl_basic_set_n_dim(bset), goto error);
2525 bset = isl_basic_set_cow(bset);
2527 row_size = 1 + isl_dim_total(bset->dim) + bset->extra;
2528 old = bset->block2.data;
2529 bset->block2 = isl_blk_extend(bset->ctx, bset->block2,
2530 (bset->extra + n) * (1 + row_size));
2531 if (!bset->block2.data)
2533 new_div = isl_alloc_array(ctx, isl_int *, bset->extra + n);
2536 for (i = 0; i < n; ++i) {
2537 new_div[i] = bset->block2.data +
2538 (bset->extra + i) * (1 + row_size);
2539 isl_seq_clr(new_div[i], 1 + row_size);
2541 for (i = 0; i < bset->extra; ++i)
2542 new_div[n + i] = bset->block2.data + (bset->div[i] - old);
2544 bset->div = new_div;
2547 bset->dim = isl_dim_drop_outputs(bset->dim,
2548 isl_basic_set_n_dim(bset) - n, n);
2551 bset = isl_basic_set_simplify(bset);
2552 return isl_basic_set_finalize(bset);
2554 isl_basic_set_free(bset);
2558 struct isl_basic_map *add_divs(struct isl_basic_map *bmap, unsigned n)
2562 for (i = 0; i < n; ++i) {
2563 j = isl_basic_map_alloc_div(bmap);
2566 isl_seq_clr(bmap->div[j], 1+1+isl_basic_map_total_dim(bmap));
2570 isl_basic_map_free(bmap);
2574 struct isl_basic_map *isl_basic_map_apply_range(
2575 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2577 struct isl_dim *dim_result = NULL;
2578 struct isl_basic_map *bmap;
2579 unsigned n_in, n_out, n, nparam, total, pos;
2580 struct isl_dim_map *dim_map1, *dim_map2;
2582 if (!bmap1 || !bmap2)
2585 dim_result = isl_dim_join(isl_dim_copy(bmap1->dim),
2586 isl_dim_copy(bmap2->dim));
2588 n_in = isl_basic_map_n_in(bmap1);
2589 n_out = isl_basic_map_n_out(bmap2);
2590 n = isl_basic_map_n_out(bmap1);
2591 nparam = isl_basic_map_n_param(bmap1);
2593 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + n;
2594 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
2595 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
2596 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
2597 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
2598 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
2599 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_in);
2600 isl_dim_map_div(dim_map1, bmap1, pos += n_out);
2601 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
2602 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
2603 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
2605 bmap = isl_basic_map_alloc_dim(dim_result,
2606 bmap1->n_div + bmap2->n_div + n,
2607 bmap1->n_eq + bmap2->n_eq,
2608 bmap1->n_ineq + bmap2->n_ineq);
2609 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
2610 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
2611 bmap = add_divs(bmap, n);
2612 bmap = isl_basic_map_simplify(bmap);
2613 return isl_basic_map_finalize(bmap);
2615 isl_basic_map_free(bmap1);
2616 isl_basic_map_free(bmap2);
2620 struct isl_basic_set *isl_basic_set_apply(
2621 struct isl_basic_set *bset, struct isl_basic_map *bmap)
2626 isl_assert(set->ctx, isl_basic_map_compatible_domain(bmap, bset),
2629 return (struct isl_basic_set *)
2630 isl_basic_map_apply_range((struct isl_basic_map *)bset, bmap);
2632 isl_basic_set_free(bset);
2633 isl_basic_map_free(bmap);
2637 struct isl_basic_map *isl_basic_map_apply_domain(
2638 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2640 if (!bmap1 || !bmap2)
2644 isl_basic_map_n_in(bmap1) == isl_basic_map_n_in(bmap2), goto error);
2646 isl_basic_map_n_param(bmap1) == isl_basic_map_n_param(bmap2),
2649 bmap1 = isl_basic_map_reverse(bmap1);
2650 bmap1 = isl_basic_map_apply_range(bmap1, bmap2);
2651 return isl_basic_map_reverse(bmap1);
2653 isl_basic_map_free(bmap1);
2654 isl_basic_map_free(bmap2);
2658 static struct isl_basic_map *var_equal(struct isl_ctx *ctx,
2659 struct isl_basic_map *bmap, unsigned pos)
2665 i = isl_basic_map_alloc_equality(bmap);
2668 nparam = isl_basic_map_n_param(bmap);
2669 n_in = isl_basic_map_n_in(bmap);
2670 isl_seq_clr(bmap->eq[i], 1 + isl_basic_map_total_dim(bmap));
2671 isl_int_set_si(bmap->eq[i][1+nparam+pos], -1);
2672 isl_int_set_si(bmap->eq[i][1+nparam+n_in+pos], 1);
2673 return isl_basic_map_finalize(bmap);
2675 isl_basic_map_free(bmap);
2679 static struct isl_basic_map *var_more(struct isl_ctx *ctx,
2680 struct isl_basic_map *bmap, unsigned pos)
2686 i = isl_basic_map_alloc_inequality(bmap);
2689 nparam = isl_basic_map_n_param(bmap);
2690 n_in = isl_basic_map_n_in(bmap);
2691 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
2692 isl_int_set_si(bmap->ineq[i][0], -1);
2693 isl_int_set_si(bmap->ineq[i][1+nparam+pos], -1);
2694 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], 1);
2695 return isl_basic_map_finalize(bmap);
2697 isl_basic_map_free(bmap);
2701 static struct isl_basic_map *var_less(struct isl_ctx *ctx,
2702 struct isl_basic_map *bmap, unsigned pos)
2708 i = isl_basic_map_alloc_inequality(bmap);
2711 nparam = isl_basic_map_n_param(bmap);
2712 n_in = isl_basic_map_n_in(bmap);
2713 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
2714 isl_int_set_si(bmap->ineq[i][0], -1);
2715 isl_int_set_si(bmap->ineq[i][1+nparam+pos], 1);
2716 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], -1);
2717 return isl_basic_map_finalize(bmap);
2719 isl_basic_map_free(bmap);
2723 struct isl_basic_map *isl_basic_map_equal(struct isl_ctx *ctx,
2724 unsigned nparam, unsigned in, unsigned out, unsigned n_equal)
2727 struct isl_basic_map *bmap;
2728 bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, n_equal, 0);
2731 for (i = 0; i < n_equal && bmap; ++i)
2732 bmap = var_equal(ctx, bmap, i);
2733 return isl_basic_map_finalize(bmap);
2736 struct isl_basic_map *isl_basic_map_less_at(struct isl_ctx *ctx,
2737 unsigned nparam, unsigned in, unsigned out, unsigned pos)
2740 struct isl_basic_map *bmap;
2741 bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, pos, 1);
2744 for (i = 0; i < pos && bmap; ++i)
2745 bmap = var_equal(ctx, bmap, i);
2747 bmap = var_less(ctx, bmap, pos);
2748 return isl_basic_map_finalize(bmap);
2751 struct isl_basic_map *isl_basic_map_more_at(struct isl_ctx *ctx,
2752 unsigned nparam, unsigned in, unsigned out, unsigned pos)
2755 struct isl_basic_map *bmap;
2756 bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, pos, 1);
2759 for (i = 0; i < pos && bmap; ++i)
2760 bmap = var_equal(ctx, bmap, i);
2762 bmap = var_more(ctx, bmap, pos);
2763 return isl_basic_map_finalize(bmap);
2766 struct isl_basic_map *isl_basic_map_from_basic_set(
2767 struct isl_basic_set *bset, struct isl_dim *dim)
2769 struct isl_basic_map *bmap;
2771 bset = isl_basic_set_cow(bset);
2775 isl_assert(bset->ctx, isl_dim_compatible(bset->dim, dim), goto error);
2776 isl_dim_free(bset->dim);
2777 bmap = (struct isl_basic_map *) bset;
2779 return isl_basic_map_finalize(bmap);
2781 isl_basic_set_free(bset);
2786 struct isl_basic_set *isl_basic_set_from_basic_map(struct isl_basic_map *bmap)
2790 if (bmap->dim->n_in == 0)
2791 return (struct isl_basic_set *)bmap;
2792 bmap = isl_basic_map_cow(bmap);
2795 bmap->dim = isl_dim_cow(bmap->dim);
2798 bmap->dim->n_out += bmap->dim->n_in;
2799 bmap->dim->n_in = 0;
2800 bmap = isl_basic_map_finalize(bmap);
2801 return (struct isl_basic_set *)bmap;
2803 isl_basic_map_free(bmap);
2807 /* For a div d = floor(f/m), add the constraints
2810 * -(f-(n-1)) + m d >= 0
2812 * Note that the second constraint is the negation of
2816 static int add_div_constraints(struct isl_basic_map *bmap, unsigned div)
2819 unsigned total = isl_basic_map_total_dim(bmap);
2820 unsigned div_pos = 1 + total - bmap->n_div + div;
2822 i = isl_basic_map_alloc_inequality(bmap);
2825 isl_seq_cpy(bmap->ineq[i], bmap->div[div]+1, 1+total);
2826 isl_int_neg(bmap->ineq[i][div_pos], bmap->div[div][0]);
2828 j = isl_basic_map_alloc_inequality(bmap);
2831 isl_seq_neg(bmap->ineq[j], bmap->ineq[i], 1 + total);
2832 isl_int_add(bmap->ineq[j][0], bmap->ineq[j][0], bmap->ineq[j][div_pos]);
2833 isl_int_sub_ui(bmap->ineq[j][0], bmap->ineq[j][0], 1);
2837 struct isl_basic_set *isl_basic_map_underlying_set(
2838 struct isl_basic_map *bmap)
2842 if (bmap->dim->nparam == 0 && bmap->dim->n_in == 0 && bmap->n_div == 0)
2843 return (struct isl_basic_set *)bmap;
2844 bmap = isl_basic_map_cow(bmap);
2847 bmap->dim = isl_dim_cow(bmap->dim);
2850 bmap->dim->n_out += bmap->dim->nparam + bmap->dim->n_in + bmap->n_div;
2851 bmap->dim->nparam = 0;
2852 bmap->dim->n_in = 0;
2853 bmap->extra -= bmap->n_div;
2855 bmap = isl_basic_map_finalize(bmap);
2856 return (struct isl_basic_set *)bmap;
2861 struct isl_basic_map *isl_basic_map_overlying_set(
2862 struct isl_basic_set *bset, struct isl_basic_map *like)
2864 struct isl_basic_map *bmap;
2865 struct isl_ctx *ctx;
2872 isl_assert(ctx, bset->n_div == 0, goto error);
2873 isl_assert(ctx, isl_basic_set_n_param(bset) == 0, goto error);
2874 isl_assert(ctx, bset->dim->n_out == isl_basic_map_total_dim(like),
2876 if (isl_dim_equal(bset->dim, like->dim) && like->n_div == 0) {
2877 isl_basic_map_free(like);
2878 return (struct isl_basic_map *)bset;
2880 bset = isl_basic_set_cow(bset);
2883 total = bset->dim->n_out + bset->extra;
2884 bmap = (struct isl_basic_map *)bset;
2885 isl_dim_free(bmap->dim);
2886 bmap->dim = isl_dim_copy(like->dim);
2889 bmap->n_div = like->n_div;
2890 bmap->extra += like->n_div;
2893 ltotal = total - bmap->extra + like->extra;
2896 bmap->block2 = isl_blk_extend(ctx, bmap->block2,
2897 bmap->extra * (1 + 1 + total));
2898 if (isl_blk_is_error(bmap->block2))
2900 bmap->div = isl_realloc_array(ctx, bmap->div, isl_int *,
2904 for (i = 0; i < bmap->extra; ++i)
2905 bmap->div[i] = bmap->block2.data + i * (1 + 1 + total);
2906 for (i = 0; i < like->n_div; ++i) {
2907 isl_seq_cpy(bmap->div[i], like->div[i], 1 + 1 + ltotal);
2908 isl_seq_clr(bmap->div[i]+1+1+ltotal, total - ltotal);
2910 bmap = isl_basic_map_extend_constraints(bmap,
2911 0, 2 * like->n_div);
2912 for (i = 0; i < like->n_div; ++i)
2913 if (add_div_constraints(bmap, i) < 0)
2916 isl_basic_map_free(like);
2917 bmap = isl_basic_map_finalize(bmap);
2920 isl_basic_map_free(like);
2921 isl_basic_set_free(bset);
2925 struct isl_basic_set *isl_basic_set_from_underlying_set(
2926 struct isl_basic_set *bset, struct isl_basic_set *like)
2928 return (struct isl_basic_set *)
2929 isl_basic_map_overlying_set(bset, (struct isl_basic_map *)like);
2932 struct isl_set *isl_set_from_underlying_set(
2933 struct isl_set *set, struct isl_basic_set *like)
2939 isl_assert(set->ctx, set->dim->n_out == isl_basic_set_total_dim(like),
2941 if (isl_dim_equal(set->dim, like->dim) && like->n_div == 0) {
2942 isl_basic_set_free(like);
2945 set = isl_set_cow(set);
2948 for (i = 0; i < set->n; ++i) {
2949 set->p[i] = isl_basic_set_from_underlying_set(set->p[i],
2950 isl_basic_set_copy(like));
2954 isl_dim_free(set->dim);
2955 set->dim = isl_dim_copy(like->dim);
2958 isl_basic_set_free(like);
2961 isl_basic_set_free(like);
2966 struct isl_set *isl_map_underlying_set(struct isl_map *map)
2970 map = isl_map_cow(map);
2973 map->dim = isl_dim_cow(map->dim);
2977 for (i = 1; i < map->n; ++i)
2978 isl_assert(map->ctx, map->p[0]->n_div == map->p[i]->n_div,
2980 for (i = 0; i < map->n; ++i) {
2981 map->p[i] = (struct isl_basic_map *)
2982 isl_basic_map_underlying_set(map->p[i]);
2987 map->dim->n_out += map->dim->nparam + map->dim->n_in;
2989 map->dim->n_out = map->p[0]->dim->n_out;
2990 map->dim->nparam = 0;
2992 return (struct isl_set *)map;
2998 struct isl_set *isl_set_to_underlying_set(struct isl_set *set)
3000 return (struct isl_set *)isl_map_underlying_set((struct isl_map *)set);
3003 struct isl_basic_set *isl_basic_map_domain(struct isl_basic_map *bmap)
3005 struct isl_basic_set *domain;
3009 n_out = isl_basic_map_n_out(bmap);
3010 domain = isl_basic_set_from_basic_map(bmap);
3011 return isl_basic_set_project_out(domain, n_out, 0);
3014 struct isl_basic_set *isl_basic_map_range(struct isl_basic_map *bmap)
3016 return isl_basic_map_domain(isl_basic_map_reverse(bmap));
3019 struct isl_set *isl_map_range(struct isl_map *map)
3022 struct isl_set *set;
3026 map = isl_map_cow(map);
3030 set = (struct isl_set *) map;
3031 if (set->dim->n_in != 0) {
3032 set->dim = isl_dim_drop_inputs(set->dim, 0, set->dim->n_in);
3036 for (i = 0; i < map->n; ++i) {
3037 set->p[i] = isl_basic_map_range(map->p[i]);
3041 F_CLR(set, ISL_MAP_DISJOINT);
3042 F_CLR(set, ISL_SET_NORMALIZED);
3049 struct isl_map *isl_map_from_set(struct isl_set *set, struct isl_dim *dim)
3052 struct isl_map *map = NULL;
3054 set = isl_set_cow(set);
3057 isl_assert(set->ctx, isl_dim_compatible(set->dim, dim), goto error);
3058 map = (struct isl_map *)set;
3059 for (i = 0; i < set->n; ++i) {
3060 map->p[i] = isl_basic_map_from_basic_set(
3061 set->p[i], isl_dim_copy(dim));
3065 isl_dim_free(map->dim);
3074 struct isl_set *isl_set_from_map(struct isl_map *map)
3077 struct isl_set *set = NULL;
3081 map = isl_map_cow(map);
3084 map->dim = isl_dim_cow(map->dim);
3087 map->dim->n_out += map->dim->n_in;
3089 set = (struct isl_set *)map;
3090 for (i = 0; i < map->n; ++i) {
3091 set->p[i] = isl_basic_set_from_basic_map(map->p[i]);
3101 struct isl_map *isl_map_alloc_dim(struct isl_dim *dim, int n, unsigned flags)
3103 struct isl_map *map;
3107 isl_assert(dim->ctx, n >= 0, return NULL);
3108 map = isl_alloc(dim->ctx, struct isl_map,
3109 sizeof(struct isl_map) +
3110 n * sizeof(struct isl_basic_map *));
3114 map->ctx = dim->ctx;
3115 isl_ctx_ref(map->ctx);
3127 struct isl_map *isl_map_alloc(struct isl_ctx *ctx,
3128 unsigned nparam, unsigned in, unsigned out, int n,
3131 struct isl_map *map;
3132 struct isl_dim *dims;
3134 dims = isl_dim_alloc(ctx, nparam, in, out);
3138 map = isl_map_alloc_dim(dims, n, flags);
3142 struct isl_basic_map *isl_basic_map_empty(struct isl_ctx *ctx,
3143 unsigned nparam, unsigned in, unsigned out)
3145 struct isl_basic_map *bmap;
3146 bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, 1, 0);
3147 bmap = isl_basic_map_set_to_empty(bmap);
3151 struct isl_basic_set *isl_basic_set_empty(struct isl_dim *dim)
3153 struct isl_basic_set *bset;
3154 bset = isl_basic_set_alloc_dim(dim, 0, 1, 0);
3155 bset = isl_basic_set_set_to_empty(bset);
3159 struct isl_basic_map *isl_basic_map_empty_like(struct isl_basic_map *model)
3161 struct isl_basic_map *bmap;
3164 bmap = isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
3165 bmap = isl_basic_map_set_to_empty(bmap);
3169 struct isl_basic_map *isl_basic_map_empty_like_map(struct isl_map *model)
3171 struct isl_basic_map *bmap;
3174 bmap = isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
3175 bmap = isl_basic_map_set_to_empty(bmap);
3179 struct isl_basic_set *isl_basic_set_empty_like(struct isl_basic_set *model)
3181 struct isl_basic_set *bset;
3184 bset = isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
3185 bset = isl_basic_set_set_to_empty(bset);
3189 struct isl_basic_map *isl_basic_map_universe(struct isl_dim *dim)
3191 struct isl_basic_map *bmap;
3192 bmap = isl_basic_map_alloc_dim(dim, 0, 0, 0);
3196 struct isl_basic_set *isl_basic_set_universe(struct isl_dim *dim)
3198 struct isl_basic_set *bset;
3199 bset = isl_basic_set_alloc_dim(dim, 0, 0, 0);
3203 struct isl_basic_set *isl_basic_set_universe_like(struct isl_basic_set *model)
3207 return isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
3210 struct isl_map *isl_map_empty(struct isl_ctx *ctx,
3211 unsigned nparam, unsigned in, unsigned out)
3213 return isl_map_alloc(ctx, nparam, in, out, 0, ISL_MAP_DISJOINT);
3216 struct isl_map *isl_map_empty_like_basic_map(struct isl_basic_map *model)
3220 return isl_map_alloc_dim(isl_dim_copy(model->dim), 0, ISL_MAP_DISJOINT);
3223 struct isl_set *isl_set_empty(struct isl_dim *dim)
3225 return isl_set_alloc_dim(dim, 0, ISL_MAP_DISJOINT);
3228 struct isl_set *isl_set_empty_like(struct isl_set *model)
3232 return isl_set_empty(isl_dim_copy(model->dim));
3235 struct isl_set *isl_set_universe(struct isl_dim *dim)
3237 struct isl_set *set;
3240 set = isl_set_alloc_dim(isl_dim_copy(dim), 1, ISL_MAP_DISJOINT);
3241 set = isl_set_add(set, isl_basic_set_universe(dim));
3245 struct isl_map *isl_map_dup(struct isl_map *map)
3248 struct isl_map *dup;
3252 dup = isl_map_alloc_dim(isl_dim_copy(map->dim), map->n, map->flags);
3253 for (i = 0; i < map->n; ++i)
3254 dup = isl_map_add(dup, isl_basic_map_copy(map->p[i]));
3258 struct isl_map *isl_map_add(struct isl_map *map, struct isl_basic_map *bmap)
3262 isl_assert(map->ctx, isl_dim_equal(map->dim, bmap->dim), goto error);
3263 isl_assert(map->ctx, map->n < map->size, goto error);
3264 map->p[map->n] = bmap;
3266 F_CLR(map, ISL_MAP_NORMALIZED);
3272 isl_basic_map_free(bmap);
3276 void isl_map_free(struct isl_map *map)
3286 isl_ctx_deref(map->ctx);
3287 for (i = 0; i < map->n; ++i)
3288 isl_basic_map_free(map->p[i]);
3289 isl_dim_free(map->dim);
3293 struct isl_map *isl_map_extend(struct isl_map *base,
3294 unsigned nparam, unsigned n_in, unsigned n_out)
3298 base = isl_map_cow(base);
3302 base->dim = isl_dim_extend(base->dim, nparam, n_in, n_out);
3305 for (i = 0; i < base->n; ++i) {
3306 base->p[i] = isl_basic_map_extend_dim(base->p[i],
3307 isl_dim_copy(base->dim), 0, 0, 0);
3317 struct isl_set *isl_set_extend(struct isl_set *base,
3318 unsigned nparam, unsigned dim)
3320 return (struct isl_set *)isl_map_extend((struct isl_map *)base,
3324 static struct isl_basic_map *isl_basic_map_fix_var(struct isl_basic_map *bmap,
3325 unsigned var, int value)
3329 bmap = isl_basic_map_cow(bmap);
3330 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
3331 j = isl_basic_map_alloc_equality(bmap);
3334 isl_seq_clr(bmap->eq[j], 1 + isl_basic_map_total_dim(bmap));
3335 isl_int_set_si(bmap->eq[j][1 + var], -1);
3336 isl_int_set_si(bmap->eq[j][0], value);
3337 bmap = isl_basic_map_simplify(bmap);
3338 return isl_basic_map_finalize(bmap);
3340 isl_basic_map_free(bmap);
3344 struct isl_basic_map *isl_basic_map_fix_input_si(struct isl_basic_map *bmap,
3345 unsigned input, int value)
3349 isl_assert(bmap->ctx, input < isl_basic_map_n_in(bmap), goto error);
3350 return isl_basic_map_fix_var(bmap, isl_basic_map_n_param(bmap) + input,
3353 isl_basic_map_free(bmap);
3357 struct isl_basic_set *isl_basic_set_fix_dim_si(struct isl_basic_set *bset,
3358 unsigned dim, int value)
3362 isl_assert(bset->ctx, dim < isl_basic_set_n_dim(bset), goto error);
3363 return (struct isl_basic_set *)
3364 isl_basic_map_fix_var((struct isl_basic_map *)bset,
3365 isl_basic_set_n_param(bset) + dim, value);
3367 isl_basic_set_free(bset);
3371 struct isl_map *isl_map_fix_input_si(struct isl_map *map,
3372 unsigned input, int value)
3376 map = isl_map_cow(map);
3380 isl_assert(ctx, input < isl_map_n_in(map), goto error);
3381 for (i = 0; i < map->n; ++i) {
3382 map->p[i] = isl_basic_map_fix_input_si(map->p[i], input, value);
3386 F_CLR(map, ISL_MAP_NORMALIZED);
3393 struct isl_set *isl_set_fix_dim_si(struct isl_set *set, unsigned dim, int value)
3397 set = isl_set_cow(set);
3401 isl_assert(set->ctx, dim < isl_set_n_dim(set), goto error);
3402 for (i = 0; i < set->n; ++i) {
3403 set->p[i] = isl_basic_set_fix_dim_si(set->p[i], dim, value);
3413 struct isl_basic_set *isl_basic_set_lower_bound_dim(struct isl_basic_set *bset,
3414 unsigned dim, isl_int value)
3419 bset = isl_basic_set_cow(bset);
3420 bset = isl_basic_set_extend_constraints(bset, 0, 1);
3421 j = isl_basic_set_alloc_inequality(bset);
3424 isl_seq_clr(bset->ineq[j], 1 + isl_basic_set_total_dim(bset));
3425 isl_int_set_si(bset->ineq[j][1 + isl_basic_set_n_param(bset) + dim], 1);
3426 isl_int_neg(bset->ineq[j][0], value);
3427 bset = isl_basic_set_simplify(bset);
3428 return isl_basic_set_finalize(bset);
3430 isl_basic_set_free(bset);
3434 struct isl_set *isl_set_lower_bound_dim(struct isl_set *set, unsigned dim,
3439 set = isl_set_cow(set);
3443 isl_assert(set->ctx, dim < isl_set_n_dim(set), goto error);
3444 for (i = 0; i < set->n; ++i) {
3445 set->p[i] = isl_basic_set_lower_bound_dim(set->p[i], dim, value);
3455 struct isl_map *isl_map_reverse(struct isl_map *map)
3460 map = isl_map_cow(map);
3464 map->dim = isl_dim_reverse(map->dim);
3467 for (i = 0; i < map->n; ++i) {
3468 map->p[i] = isl_basic_map_reverse(map->p[i]);
3472 F_CLR(map, ISL_MAP_NORMALIZED);
3479 struct isl_map *isl_basic_map_lexmax(
3480 struct isl_basic_map *bmap, struct isl_basic_set *dom,
3481 struct isl_set **empty)
3483 return isl_pip_basic_map_lexmax(bmap, dom, empty);
3486 struct isl_map *isl_basic_map_lexmin(
3487 struct isl_basic_map *bmap, struct isl_basic_set *dom,
3488 struct isl_set **empty)
3490 return isl_pip_basic_map_lexmin(bmap, dom, empty);
3493 struct isl_set *isl_basic_set_lexmin(struct isl_basic_set *bset)
3495 struct isl_basic_map *bmap = NULL;
3496 struct isl_basic_set *dom = NULL;
3497 struct isl_map *min;
3498 struct isl_dim *param_dim;
3502 bmap = isl_basic_map_from_basic_set(bset, isl_dim_copy(bset->dim));
3505 param_dim = isl_dim_domain(isl_dim_copy(bmap->dim));
3506 dom = isl_basic_set_universe(param_dim);
3509 min = isl_basic_map_lexmin(bmap, dom, NULL);
3510 return isl_map_range(min);
3512 isl_basic_map_free(bmap);
3516 struct isl_map *isl_basic_map_compute_divs(struct isl_basic_map *bmap)
3523 off = isl_dim_total(bmap->dim);
3524 for (i = 0; i < bmap->n_div; ++i) {
3525 if (isl_int_is_zero(bmap->div[i][0]))
3526 return isl_pip_basic_map_compute_divs(bmap);
3527 isl_assert(bmap->ctx, isl_int_is_zero(bmap->div[i][1+1+off+i]),
3530 return isl_map_from_basic_map(bmap);
3532 isl_basic_map_free(bmap);
3536 struct isl_map *isl_map_compute_divs(struct isl_map *map)
3539 struct isl_map *res;
3545 res = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[0]));
3546 for (i = 1 ; i < map->n; ++i) {
3548 r2 = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[i]));
3549 if (F_ISSET(map, ISL_MAP_DISJOINT))
3550 res = isl_map_union_disjoint(res, r2);
3552 res = isl_map_union(res, r2);
3559 struct isl_set *isl_basic_set_compute_divs(struct isl_basic_set *bset)
3561 return (struct isl_set *)
3562 isl_basic_map_compute_divs((struct isl_basic_map *)bset);
3565 struct isl_set *isl_set_compute_divs(struct isl_set *set)
3567 return (struct isl_set *)
3568 isl_map_compute_divs((struct isl_map *)set);
3571 struct isl_set *isl_map_domain(struct isl_map *map)
3574 struct isl_set *set;
3579 map = isl_map_cow(map);
3583 set = (struct isl_set *)map;
3584 set->dim = isl_dim_domain(set->dim);
3587 for (i = 0; i < map->n; ++i) {
3588 set->p[i] = isl_basic_map_domain(map->p[i]);
3592 F_CLR(set, ISL_MAP_DISJOINT);
3593 F_CLR(set, ISL_SET_NORMALIZED);
3600 struct isl_map *isl_map_union_disjoint(
3601 struct isl_map *map1, struct isl_map *map2)
3605 struct isl_map *map = NULL;
3619 isl_assert(map1->ctx, isl_dim_equal(map1->dim, map2->dim), goto error);
3621 if (F_ISSET(map1, ISL_MAP_DISJOINT) &&
3622 F_ISSET(map2, ISL_MAP_DISJOINT))
3623 FL_SET(flags, ISL_MAP_DISJOINT);
3625 map = isl_map_alloc_dim(isl_dim_copy(map1->dim),
3626 map1->n + map2->n, flags);
3629 for (i = 0; i < map1->n; ++i) {
3630 map = isl_map_add(map,
3631 isl_basic_map_copy(map1->p[i]));
3635 for (i = 0; i < map2->n; ++i) {
3636 map = isl_map_add(map,
3637 isl_basic_map_copy(map2->p[i]));
3651 struct isl_map *isl_map_union(struct isl_map *map1, struct isl_map *map2)
3653 map1 = isl_map_union_disjoint(map1, map2);
3657 F_CLR(map1, ISL_MAP_DISJOINT);
3661 struct isl_set *isl_set_union_disjoint(
3662 struct isl_set *set1, struct isl_set *set2)
3664 return (struct isl_set *)
3665 isl_map_union_disjoint(
3666 (struct isl_map *)set1, (struct isl_map *)set2);
3669 struct isl_set *isl_set_union(struct isl_set *set1, struct isl_set *set2)
3671 return (struct isl_set *)
3672 isl_map_union((struct isl_map *)set1, (struct isl_map *)set2);
3675 struct isl_map *isl_map_intersect_range(
3676 struct isl_map *map, struct isl_set *set)
3679 struct isl_map *result;
3685 if (F_ISSET(map, ISL_MAP_DISJOINT) &&
3686 F_ISSET(set, ISL_MAP_DISJOINT))
3687 FL_SET(flags, ISL_MAP_DISJOINT);
3689 result = isl_map_alloc_dim(isl_dim_copy(map->dim),
3690 map->n * set->n, flags);
3693 for (i = 0; i < map->n; ++i)
3694 for (j = 0; j < set->n; ++j) {
3695 result = isl_map_add(result,
3696 isl_basic_map_intersect_range(
3697 isl_basic_map_copy(map->p[i]),
3698 isl_basic_set_copy(set->p[j])));
3711 struct isl_map *isl_map_intersect_domain(
3712 struct isl_map *map, struct isl_set *set)
3714 return isl_map_reverse(
3715 isl_map_intersect_range(isl_map_reverse(map), set));
3718 struct isl_map *isl_map_apply_domain(
3719 struct isl_map *map1, struct isl_map *map2)
3723 map1 = isl_map_reverse(map1);
3724 map1 = isl_map_apply_range(map1, map2);
3725 return isl_map_reverse(map1);
3732 struct isl_map *isl_map_apply_range(
3733 struct isl_map *map1, struct isl_map *map2)
3735 struct isl_dim *dim_result;
3736 struct isl_map *result;
3745 dim_result = isl_dim_join(isl_dim_copy(map1->dim),
3746 isl_dim_copy(map2->dim));
3748 result = isl_map_alloc_dim(dim_result, map1->n * map2->n, 0);
3751 for (i = 0; i < map1->n; ++i)
3752 for (j = 0; j < map2->n; ++j) {
3753 result = isl_map_add(result,
3754 isl_basic_map_apply_range(
3755 isl_basic_map_copy(map1->p[i]),
3756 isl_basic_map_copy(map2->p[j])));
3762 if (result && result->n <= 1)
3763 F_SET(result, ISL_MAP_DISJOINT);
3772 * returns range - domain
3774 struct isl_basic_set *isl_basic_map_deltas(struct isl_basic_map *bmap)
3776 struct isl_basic_set *bset;
3783 dim = isl_basic_map_n_in(bmap);
3784 nparam = isl_basic_map_n_param(bmap);
3785 isl_assert(bmap->ctx, dim == isl_basic_map_n_out(bmap), goto error);
3786 bset = isl_basic_set_from_basic_map(bmap);
3787 bset = isl_basic_set_extend(bset, nparam, 3*dim, 0, dim, 0);
3788 bset = isl_basic_set_swap_vars(bset, 2*dim);
3789 for (i = 0; i < dim; ++i) {
3790 int j = isl_basic_map_alloc_equality(
3791 (struct isl_basic_map *)bset);
3794 isl_seq_clr(bset->eq[j], 1 + isl_basic_set_total_dim(bset));
3795 isl_int_set_si(bset->eq[j][1+nparam+i], 1);
3796 isl_int_set_si(bset->eq[j][1+nparam+dim+i], 1);
3797 isl_int_set_si(bset->eq[j][1+nparam+2*dim+i], -1);
3799 return isl_basic_set_project_out(bset, 2*dim, 0);
3801 isl_basic_map_free(bmap);
3806 * returns range - domain
3808 struct isl_set *isl_map_deltas(struct isl_map *map)
3811 struct isl_set *result;
3816 isl_assert(map->ctx, isl_map_n_in(map) == isl_map_n_out(map), goto error);
3817 result = isl_set_alloc(map->ctx, isl_map_n_param(map),
3818 isl_map_n_in(map), map->n, map->flags);
3821 for (i = 0; i < map->n; ++i)
3822 result = isl_set_add(result,
3823 isl_basic_map_deltas(isl_basic_map_copy(map->p[i])));
3831 /* If the only constraints a div d=floor(f/m)
3832 * appears in are its two defining constraints
3835 * -(f - (m - 1)) + m d >= 0
3837 * then it can safely be removed.
3839 static int div_is_redundant(struct isl_basic_map *bmap, int div)
3842 unsigned pos = 1 + isl_dim_total(bmap->dim) + div;
3844 for (i = 0; i < bmap->n_eq; ++i)
3845 if (!isl_int_is_zero(bmap->eq[i][pos]))
3848 for (i = 0; i < bmap->n_ineq; ++i) {
3849 if (isl_int_is_zero(bmap->ineq[i][pos]))
3851 if (isl_int_eq(bmap->ineq[i][pos], bmap->div[div][0])) {
3853 isl_int_sub(bmap->div[div][1],
3854 bmap->div[div][1], bmap->div[div][0]);
3855 isl_int_add_ui(bmap->div[div][1], bmap->div[div][1], 1);
3856 neg = isl_seq_is_neg(bmap->ineq[i], bmap->div[div]+1, pos);
3857 isl_int_sub_ui(bmap->div[div][1], bmap->div[div][1], 1);
3858 isl_int_add(bmap->div[div][1],
3859 bmap->div[div][1], bmap->div[div][0]);
3862 if (isl_seq_first_non_zero(bmap->ineq[i]+pos+1,
3863 bmap->n_div-div-1) != -1)
3865 } else if (isl_int_abs_eq(bmap->ineq[i][pos], bmap->div[div][0])) {
3866 if (!isl_seq_eq(bmap->ineq[i], bmap->div[div]+1, pos))
3868 if (isl_seq_first_non_zero(bmap->ineq[i]+pos+1,
3869 bmap->n_div-div-1) != -1)
3875 for (i = 0; i < bmap->n_div; ++i)
3876 if (!isl_int_is_zero(bmap->div[i][1+pos]))
3883 * Remove divs that don't occur in any of the constraints or other divs.
3884 * These can arise when dropping some of the variables in a quast
3885 * returned by piplib.
3887 static struct isl_basic_map *remove_redundant_divs(struct isl_basic_map *bmap)
3894 for (i = bmap->n_div-1; i >= 0; --i) {
3895 if (!div_is_redundant(bmap, i))
3897 bmap = isl_basic_map_drop_div(bmap, i);
3902 struct isl_basic_map *isl_basic_map_finalize(struct isl_basic_map *bmap)
3904 bmap = remove_redundant_divs(bmap);
3907 F_SET(bmap, ISL_BASIC_SET_FINAL);
3911 struct isl_basic_set *isl_basic_set_finalize(struct isl_basic_set *bset)
3913 return (struct isl_basic_set *)
3914 isl_basic_map_finalize((struct isl_basic_map *)bset);
3917 struct isl_set *isl_set_finalize(struct isl_set *set)
3923 for (i = 0; i < set->n; ++i) {
3924 set->p[i] = isl_basic_set_finalize(set->p[i]);
3934 struct isl_map *isl_map_finalize(struct isl_map *map)
3940 for (i = 0; i < map->n; ++i) {
3941 map->p[i] = isl_basic_map_finalize(map->p[i]);
3945 F_CLR(map, ISL_MAP_NORMALIZED);
3952 static struct isl_basic_map *basic_map_identity(struct isl_dim *dims)
3954 struct isl_basic_map *bmap;
3962 nparam = dims->nparam;
3964 bmap = isl_basic_map_alloc_dim(dims, 0, dim, 0);
3968 for (i = 0; i < dim; ++i) {
3969 int j = isl_basic_map_alloc_equality(bmap);
3972 isl_seq_clr(bmap->eq[j], 1 + isl_basic_map_total_dim(bmap));
3973 isl_int_set_si(bmap->eq[j][1+nparam+i], 1);
3974 isl_int_set_si(bmap->eq[j][1+nparam+dim+i], -1);
3976 return isl_basic_map_finalize(bmap);
3978 isl_basic_map_free(bmap);
3982 struct isl_basic_map *isl_basic_map_identity(struct isl_dim *set_dim)
3984 struct isl_dim *dim = isl_dim_map(set_dim);
3987 return basic_map_identity(dim);
3990 struct isl_basic_map *isl_basic_map_identity_like(struct isl_basic_map *model)
3992 if (!model || !model->dim)
3994 isl_assert(model->ctx,
3995 model->dim->n_in == model->dim->n_out, return NULL);
3996 return basic_map_identity(isl_dim_copy(model->dim));
3999 static struct isl_map *map_identity(struct isl_dim *dim)
4001 struct isl_map *map = isl_map_alloc_dim(dim, 1, ISL_MAP_DISJOINT);
4002 return isl_map_add(map, basic_map_identity(isl_dim_copy(dim)));
4005 struct isl_map *isl_map_identity(struct isl_dim *set_dim)
4007 struct isl_dim *dim = isl_dim_map(set_dim);
4010 return map_identity(dim);
4013 struct isl_map *isl_map_identity_like(struct isl_basic_map *model)
4015 if (!model || !model->dim)
4017 isl_assert(model->ctx,
4018 model->dim->n_in == model->dim->n_out, return NULL);
4019 return map_identity(isl_dim_copy(model->dim));
4022 int isl_set_is_equal(struct isl_set *set1, struct isl_set *set2)
4024 return isl_map_is_equal((struct isl_map *)set1, (struct isl_map *)set2);
4027 int isl_set_is_subset(struct isl_set *set1, struct isl_set *set2)
4029 return isl_map_is_subset(
4030 (struct isl_map *)set1, (struct isl_map *)set2);
4033 int isl_basic_map_is_subset(
4034 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
4037 struct isl_map *map1;
4038 struct isl_map *map2;
4040 if (!bmap1 || !bmap2)
4043 map1 = isl_map_from_basic_map(isl_basic_map_copy(bmap1));
4044 map2 = isl_map_from_basic_map(isl_basic_map_copy(bmap2));
4046 is_subset = isl_map_is_subset(map1, map2);
4054 int isl_basic_map_is_equal(
4055 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
4059 if (!bmap1 || !bmap2)
4061 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
4064 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
4068 int isl_basic_set_is_equal(
4069 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
4071 return isl_basic_map_is_equal(
4072 (struct isl_basic_map *)bset1, (struct isl_basic_map *)bset2);
4075 int isl_map_is_empty(struct isl_map *map)
4082 for (i = 0; i < map->n; ++i) {
4083 is_empty = isl_basic_map_is_empty(map->p[i]);
4092 int isl_set_is_empty(struct isl_set *set)
4094 return isl_map_is_empty((struct isl_map *)set);
4097 int isl_map_is_subset(struct isl_map *map1, struct isl_map *map2)
4101 struct isl_map *diff;
4106 if (isl_map_is_empty(map1))
4109 if (isl_map_is_empty(map2))
4112 diff = isl_map_subtract(isl_map_copy(map1), isl_map_copy(map2));
4116 is_subset = isl_map_is_empty(diff);
4122 int isl_map_is_equal(struct isl_map *map1, struct isl_map *map2)
4128 is_subset = isl_map_is_subset(map1, map2);
4131 is_subset = isl_map_is_subset(map2, map1);
4135 int isl_basic_map_is_strict_subset(
4136 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
4140 if (!bmap1 || !bmap2)
4142 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
4145 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
4146 if (is_subset == -1)
4151 static int basic_map_contains(struct isl_basic_map *bmap, struct isl_vec *vec)
4157 total = 1 + isl_basic_map_total_dim(bmap);
4158 if (total != vec->size)
4163 for (i = 0; i < bmap->n_eq; ++i) {
4164 isl_seq_inner_product(vec->block.data, bmap->eq[i], total, &s);
4165 if (!isl_int_is_zero(s)) {
4171 for (i = 0; i < bmap->n_ineq; ++i) {
4172 isl_seq_inner_product(vec->block.data, bmap->ineq[i], total, &s);
4173 if (isl_int_is_neg(s)) {
4184 int isl_basic_map_is_universe(struct isl_basic_map *bmap)
4188 return bmap->n_eq == 0 && bmap->n_ineq == 0;
4191 int isl_basic_map_is_empty(struct isl_basic_map *bmap)
4193 struct isl_basic_set *bset = NULL;
4194 struct isl_vec *sample = NULL;
4201 if (F_ISSET(bmap, ISL_BASIC_MAP_EMPTY))
4204 if (F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL)) {
4205 struct isl_basic_map *copy = isl_basic_map_copy(bmap);
4206 copy = isl_basic_map_convex_hull(copy);
4207 empty = F_ISSET(copy, ISL_BASIC_MAP_EMPTY);
4208 isl_basic_map_free(copy);
4212 total = 1 + isl_basic_map_total_dim(bmap);
4213 if (bmap->sample && bmap->sample->size == total) {
4214 int contains = basic_map_contains(bmap, bmap->sample);
4220 bset = isl_basic_map_underlying_set(isl_basic_map_copy(bmap));
4223 sample = isl_basic_set_sample(bset);
4226 empty = sample->size == 0;
4228 isl_vec_free(bmap->ctx, bmap->sample);
4229 bmap->sample = sample;
4234 struct isl_map *isl_basic_map_union(
4235 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
4237 struct isl_map *map;
4238 if (!bmap1 || !bmap2)
4241 isl_assert(map1->ctx, isl_dim_equal(bmap1->dim, bmap2->dim), goto error);
4243 map = isl_map_alloc_dim(isl_dim_copy(bmap1->dim), 2, 0);
4246 map = isl_map_add(map, bmap1);
4247 map = isl_map_add(map, bmap2);
4250 isl_basic_map_free(bmap1);
4251 isl_basic_map_free(bmap2);
4255 struct isl_set *isl_basic_set_union(
4256 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
4258 return (struct isl_set *)isl_basic_map_union(
4259 (struct isl_basic_map *)bset1,
4260 (struct isl_basic_map *)bset2);
4263 /* Order divs such that any div only depends on previous divs */
4264 static struct isl_basic_map *order_divs(struct isl_basic_map *bmap)
4267 unsigned off = isl_dim_total(bmap->dim);
4269 for (i = 0; i < bmap->n_div; ++i) {
4271 pos = isl_seq_first_non_zero(bmap->div[i]+1+1+off+i,
4275 swap_div(bmap, i, pos);
4281 /* Look for a div in dst that corresponds to the div "div" in src.
4282 * The divs before "div" in src and dst are assumed to be the same.
4284 * Returns -1 if no corresponding div was found and the position
4285 * of the corresponding div in dst otherwise.
4287 static int find_div(struct isl_basic_map *dst,
4288 struct isl_basic_map *src, unsigned div)
4292 unsigned total = isl_dim_total(src->dim);
4294 isl_assert(dst->ctx, div <= dst->n_div, return -1);
4295 for (i = div; i < dst->n_div; ++i)
4296 if (isl_seq_eq(dst->div[i], src->div[div], 1+1+total+div) &&
4297 isl_seq_first_non_zero(dst->div[i]+1+1+total+div,
4298 dst->n_div - div) == -1)
4303 struct isl_basic_map *isl_basic_map_align_divs(
4304 struct isl_basic_map *dst, struct isl_basic_map *src)
4307 unsigned total = isl_dim_total(src->dim);
4312 if (src->n_div == 0)
4315 for (i = 0; i < src->n_div; ++i)
4316 isl_assert(src->ctx, !isl_int_is_zero(src->div[i][0]), goto error);
4318 src = order_divs(src);
4319 dst = isl_basic_map_extend_dim(dst, isl_dim_copy(dst->dim),
4320 src->n_div, 0, 2 * src->n_div);
4323 for (i = 0; i < src->n_div; ++i) {
4324 int j = find_div(dst, src, i);
4326 j = isl_basic_map_alloc_div(dst);
4329 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total+i);
4330 isl_seq_clr(dst->div[j]+1+1+total+i, dst->n_div - i);
4331 if (add_div_constraints(dst, j) < 0)
4335 swap_div(dst, i, j);
4339 isl_basic_map_free(dst);
4343 struct isl_basic_set *isl_basic_set_align_divs(
4344 struct isl_basic_set *dst, struct isl_basic_set *src)
4346 return (struct isl_basic_set *)isl_basic_map_align_divs(
4347 (struct isl_basic_map *)dst, (struct isl_basic_map *)src);
4350 struct isl_map *isl_map_align_divs(struct isl_map *map)
4354 map = isl_map_compute_divs(map);
4355 map = isl_map_cow(map);
4359 for (i = 1; i < map->n; ++i)
4360 map->p[0] = isl_basic_map_align_divs(map->p[0], map->p[i]);
4361 for (i = 1; i < map->n; ++i)
4362 map->p[i] = isl_basic_map_align_divs(map->p[i], map->p[0]);
4364 F_CLR(map, ISL_MAP_NORMALIZED);
4368 static struct isl_map *add_cut_constraint(struct isl_map *dst,
4369 struct isl_basic_map *src, isl_int *c,
4370 unsigned len, int oppose)
4372 struct isl_basic_map *copy = NULL;
4377 copy = isl_basic_map_copy(src);
4378 copy = isl_basic_map_cow(copy);
4381 copy = isl_basic_map_extend_constraints(copy, 0, 1);
4382 k = isl_basic_map_alloc_inequality(copy);
4386 isl_seq_neg(copy->ineq[k], c, len);
4388 isl_seq_cpy(copy->ineq[k], c, len);
4389 total = 1 + isl_basic_map_total_dim(copy);
4390 isl_seq_clr(copy->ineq[k]+len, total - len);
4391 isl_inequality_negate(copy, k);
4392 copy = isl_basic_map_simplify(copy);
4393 copy = isl_basic_map_finalize(copy);
4394 is_empty = isl_basic_map_is_empty(copy);
4398 dst = isl_map_add(dst, copy);
4400 isl_basic_map_free(copy);
4403 isl_basic_map_free(copy);
4408 static struct isl_map *subtract(struct isl_map *map, struct isl_basic_map *bmap)
4412 struct isl_map *rest = NULL;
4414 unsigned total = isl_basic_map_total_dim(bmap);
4421 if (F_ISSET(map, ISL_MAP_DISJOINT))
4422 FL_SET(flags, ISL_MAP_DISJOINT);
4424 max = map->n * (2 * bmap->n_eq + bmap->n_ineq);
4425 rest = isl_map_alloc_dim(isl_dim_copy(map->dim), max, flags);
4429 for (i = 0; i < map->n; ++i) {
4430 map->p[i] = isl_basic_map_align_divs(map->p[i], bmap);
4435 for (j = 0; j < map->n; ++j)
4436 map->p[j] = isl_basic_map_cow(map->p[j]);
4438 for (i = 0; i < bmap->n_eq; ++i) {
4439 for (j = 0; j < map->n; ++j) {
4440 rest = add_cut_constraint(rest,
4441 map->p[j], bmap->eq[i], 1+total, 0);
4445 rest = add_cut_constraint(rest,
4446 map->p[j], bmap->eq[i], 1+total, 1);
4450 map->p[j] = isl_basic_map_extend_constraints(map->p[j],
4454 k = isl_basic_map_alloc_equality(map->p[j]);
4457 isl_seq_cpy(map->p[j]->eq[k], bmap->eq[i], 1+total);
4458 isl_seq_clr(map->p[j]->eq[k]+1+total,
4459 map->p[j]->n_div - bmap->n_div);
4463 for (i = 0; i < bmap->n_ineq; ++i) {
4464 for (j = 0; j < map->n; ++j) {
4465 rest = add_cut_constraint(rest,
4466 map->p[j], bmap->ineq[i], 1+total, 0);
4470 map->p[j] = isl_basic_map_extend_constraints(map->p[j],
4474 k = isl_basic_map_alloc_inequality(map->p[j]);
4477 isl_seq_cpy(map->p[j]->ineq[k], bmap->ineq[i], 1+total);
4478 isl_seq_clr(map->p[j]->ineq[k]+1+total,
4479 map->p[j]->n_div - bmap->n_div);
4491 struct isl_map *isl_map_subtract(struct isl_map *map1, struct isl_map *map2)
4497 isl_assert(map1->ctx, isl_dim_equal(map1->dim, map2->dim), goto error);
4499 if (isl_map_is_empty(map2)) {
4504 map1 = isl_map_compute_divs(map1);
4505 map2 = isl_map_compute_divs(map2);
4509 for (i = 0; map1 && i < map2->n; ++i)
4510 map1 = subtract(map1, map2->p[i]);
4520 struct isl_set *isl_set_subtract(struct isl_set *set1, struct isl_set *set2)
4522 return (struct isl_set *)
4524 (struct isl_map *)set1, (struct isl_map *)set2);
4527 struct isl_set *isl_set_apply(struct isl_set *set, struct isl_map *map)
4531 isl_assert(set->ctx, isl_map_compatible_domain(map, set), goto error);
4532 map = isl_map_intersect_domain(map, set);
4533 set = isl_map_range(map);
4541 /* There is no need to cow as removing empty parts doesn't change
4542 * the meaning of the set.
4544 struct isl_map *isl_map_remove_empty_parts(struct isl_map *map)
4551 for (i = map->n-1; i >= 0; --i) {
4552 if (!F_ISSET(map->p[i], ISL_BASIC_MAP_EMPTY))
4554 isl_basic_map_free(map->p[i]);
4555 if (i != map->n-1) {
4556 F_CLR(map, ISL_MAP_NORMALIZED);
4557 map->p[i] = map->p[map->n-1];
4565 struct isl_set *isl_set_remove_empty_parts(struct isl_set *set)
4567 return (struct isl_set *)
4568 isl_map_remove_empty_parts((struct isl_map *)set);
4571 struct isl_basic_set *isl_set_copy_basic_set(struct isl_set *set)
4573 struct isl_basic_set *bset;
4574 if (!set || set->n == 0)
4576 bset = set->p[set->n-1];
4577 isl_assert(set->ctx, F_ISSET(bset, ISL_BASIC_SET_FINAL), return NULL);
4578 return isl_basic_set_copy(bset);
4581 struct isl_set *isl_set_drop_basic_set(struct isl_set *set,
4582 struct isl_basic_set *bset)
4588 for (i = set->n-1; i >= 0; --i) {
4589 if (set->p[i] != bset)
4591 set = isl_set_cow(set);
4594 isl_basic_set_free(set->p[i]);
4595 if (i != set->n-1) {
4596 F_CLR(set, ISL_SET_NORMALIZED);
4597 set->p[i] = set->p[set->n-1];
4602 isl_basic_set_free(bset);
4606 isl_basic_set_free(bset);
4610 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
4611 * for any common value of the parameters and dimensions preceding dim
4612 * in both basic sets, the values of dimension pos in bset1 are
4613 * smaller or larger than those in bset2.
4616 * 1 if bset1 follows bset2
4617 * -1 if bset1 precedes bset2
4618 * 0 if bset1 and bset2 are incomparable
4619 * -2 if some error occurred.
4621 int isl_basic_set_compare_at(struct isl_basic_set *bset1,
4622 struct isl_basic_set *bset2, int pos)
4624 struct isl_dim *dims;
4625 struct isl_basic_map *bmap1 = NULL;
4626 struct isl_basic_map *bmap2 = NULL;
4627 struct isl_ctx *ctx;
4628 struct isl_vec *obj;
4631 unsigned dim1, dim2;
4633 enum isl_lp_result res;
4636 if (!bset1 || !bset2)
4639 nparam = isl_basic_set_n_param(bset1);
4640 dim1 = isl_basic_set_n_dim(bset1);
4641 dim2 = isl_basic_set_n_dim(bset2);
4642 dims = isl_dim_alloc(bset1->ctx, nparam, pos, dim1 - pos);
4643 bmap1 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset1), dims);
4644 dims = isl_dim_alloc(bset2->ctx, nparam, pos, dim2 - pos);
4645 bmap2 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset2), dims);
4646 if (!bmap1 || !bmap2)
4648 bmap1 = isl_basic_map_extend(bmap1, nparam,
4649 pos, (dim1 - pos) + (dim2 - pos),
4650 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
4651 bmap1 = add_constraints(bmap1, bmap2, 0, dim1 - pos);
4654 total = isl_basic_map_total_dim(bmap1);
4656 obj = isl_vec_alloc(ctx, total);
4657 isl_seq_clr(obj->block.data, total);
4658 isl_int_set_si(obj->block.data[nparam+pos], 1);
4659 isl_int_set_si(obj->block.data[nparam+pos+(dim1-pos)], -1);
4664 res = isl_solve_lp(bmap1, 0, obj->block.data, ctx->one, &num, &den);
4665 if (res == isl_lp_empty)
4667 else if (res == isl_lp_ok && isl_int_is_pos(num))
4669 else if ((res == isl_lp_ok && isl_int_is_neg(num)) ||
4670 res == isl_lp_unbounded)
4676 isl_basic_map_free(bmap1);
4677 isl_vec_free(ctx, obj);
4680 isl_basic_map_free(bmap1);
4681 isl_basic_map_free(bmap2);
4685 static int isl_basic_map_fast_has_fixed_var(struct isl_basic_map *bmap,
4686 unsigned pos, isl_int *val)
4694 total = isl_basic_map_total_dim(bmap);
4695 for (i = 0, d = total-1; i < bmap->n_eq && d+1 > pos; ++i) {
4696 for (; d+1 > pos; --d)
4697 if (!isl_int_is_zero(bmap->eq[i][1+d]))
4701 if (isl_seq_first_non_zero(bmap->eq[i]+1, d) != -1)
4703 if (isl_seq_first_non_zero(bmap->eq[i]+1+d+1, total-d-1) != -1)
4705 if (!isl_int_is_one(bmap->eq[i][1+d]))
4708 isl_int_neg(*val, bmap->eq[i][0]);
4714 static int isl_map_fast_has_fixed_var(struct isl_map *map,
4715 unsigned pos, isl_int *val)
4727 return isl_basic_map_fast_has_fixed_var(map->p[0], pos, val);
4730 fixed = isl_basic_map_fast_has_fixed_var(map->p[0], pos, &v);
4731 for (i = 1; fixed == 1 && i < map->n; ++i) {
4732 fixed = isl_basic_map_fast_has_fixed_var(map->p[i], pos, &tmp);
4733 if (fixed == 1 && isl_int_ne(tmp, v))
4737 isl_int_set(*val, v);
4743 static int isl_set_fast_has_fixed_var(struct isl_set *set, unsigned pos,
4746 return isl_map_fast_has_fixed_var((struct isl_map *)set, pos, val);
4749 /* Check if dimension dim has fixed value and if so and if val is not NULL,
4750 * then return this fixed value in *val.
4752 int isl_set_fast_dim_is_fixed(struct isl_set *set, unsigned dim, isl_int *val)
4754 return isl_set_fast_has_fixed_var(set, isl_set_n_param(set) + dim, val);
4757 /* Check if input variable in has fixed value and if so and if val is not NULL,
4758 * then return this fixed value in *val.
4760 int isl_map_fast_input_is_fixed(struct isl_map *map, unsigned in, isl_int *val)
4762 return isl_map_fast_has_fixed_var(map, isl_map_n_param(map) + in, val);
4765 /* Check if dimension dim has an (obvious) fixed lower bound and if so
4766 * and if val is not NULL, then return this lower bound in *val.
4768 int isl_basic_set_fast_dim_has_fixed_lower_bound(struct isl_basic_set *bset,
4769 unsigned dim, isl_int *val)
4771 int i, i_eq = -1, i_ineq = -1;
4778 total = isl_basic_set_total_dim(bset);
4779 nparam = isl_basic_set_n_param(bset);
4780 for (i = 0; i < bset->n_eq; ++i) {
4781 if (isl_int_is_zero(bset->eq[i][1+nparam+dim]))
4787 for (i = 0; i < bset->n_ineq; ++i) {
4788 if (!isl_int_is_pos(bset->ineq[i][1+nparam+dim]))
4790 if (i_eq != -1 || i_ineq != -1)
4794 if (i_eq == -1 && i_ineq == -1)
4796 c = i_eq != -1 ? bset->eq[i_eq] : bset->ineq[i_ineq];
4797 /* The coefficient should always be one due to normalization. */
4798 if (!isl_int_is_one(c[1+nparam+dim]))
4800 if (isl_seq_first_non_zero(c+1, nparam+dim) != -1)
4802 if (isl_seq_first_non_zero(c+1+nparam+dim+1,
4803 total - nparam - dim - 1) != -1)
4806 isl_int_neg(*val, c[0]);
4810 int isl_set_fast_dim_has_fixed_lower_bound(struct isl_set *set,
4811 unsigned dim, isl_int *val)
4823 return isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[0],
4827 fixed = isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[0],
4829 for (i = 1; fixed == 1 && i < set->n; ++i) {
4830 fixed = isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[i],
4832 if (fixed == 1 && isl_int_ne(tmp, v))
4836 isl_int_set(*val, v);
4842 static struct isl_basic_set *isl_basic_set_reduce_using_equalities(
4843 struct isl_basic_set *bset, struct isl_basic_set *context)
4848 if (!bset || !context)
4851 bset = isl_basic_set_cow(bset);
4855 elim = isl_alloc_array(ctx, int, isl_basic_set_n_dim(bset));
4858 set_compute_elimination_index(context, elim);
4859 for (i = 0; i < bset->n_eq; ++i)
4860 set_reduced_using_equalities(bset->eq[i], bset->eq[i],
4862 for (i = 0; i < bset->n_ineq; ++i)
4863 set_reduced_using_equalities(bset->ineq[i], bset->ineq[i],
4865 isl_basic_set_free(context);
4867 bset = isl_basic_set_simplify(bset);
4868 bset = isl_basic_set_finalize(bset);
4871 isl_basic_set_free(bset);
4872 isl_basic_set_free(context);
4876 static struct isl_basic_set *remove_shifted_constraints(
4877 struct isl_basic_set *bset, struct isl_basic_set *context)
4887 size = round_up(4 * (context->n_ineq+1) / 3 - 1);
4888 bits = ffs(size) - 1;
4889 index = isl_calloc_array(ctx, isl_int **, size);
4893 for (k = 0; k < context->n_ineq; ++k) {
4894 h = set_hash_index(index, size, bits, context, k);
4895 index[h] = &context->ineq[k];
4897 for (k = 0; k < bset->n_ineq; ++k) {
4898 h = set_hash_index(index, size, bits, bset, k);
4901 l = index[h] - &context->ineq[0];
4902 if (isl_int_lt(bset->ineq[k][0], context->ineq[l][0]))
4904 bset = isl_basic_set_cow(bset);
4907 isl_basic_set_drop_inequality(bset, k);
4917 /* Remove all information from bset that is redundant in the context
4918 * of context. In particular, equalities that are linear combinations
4919 * of those in context are removed. Then the inequalities that are
4920 * redundant in the context of the equalities and inequalities of
4921 * context are removed.
4923 static struct isl_basic_set *uset_gist(struct isl_basic_set *bset,
4924 struct isl_basic_set *context)
4928 struct isl_basic_set *combined;
4929 struct isl_ctx *ctx;
4931 if (!bset || !context)
4934 if (context->n_eq > 0) {
4937 struct isl_ctx *ctx = context->ctx;
4938 struct isl_basic_set *reduced_context;
4939 reduced_context = isl_basic_set_remove_equalities(
4940 isl_basic_set_copy(context), &T, &T2);
4941 if (!reduced_context)
4943 bset = isl_basic_set_preimage(ctx, bset, T);
4944 bset = uset_gist(bset, reduced_context);
4945 bset = isl_basic_set_preimage(ctx, bset, T2);
4946 bset = isl_basic_set_reduce_using_equalities(bset, context);
4949 if (!context->n_ineq)
4951 bset = remove_shifted_constraints(bset, context);
4952 combined = isl_basic_set_extend_constraints(isl_basic_set_copy(bset),
4953 context->n_eq, context->n_ineq);
4954 context = set_add_constraints(combined, context, 0);
4959 for (i = bset->n_ineq-1; i >= 0; --i) {
4961 set_swap_inequality(context, i, context->n_ineq-1);
4963 redundant = isl_basic_set_constraint_is_redundant(&context,
4964 context->ineq[context->n_ineq], &opt, NULL);
4965 if (redundant == -1) {
4969 if (F_ISSET(context, ISL_BASIC_MAP_EMPTY)) {
4970 bset = isl_basic_set_set_to_empty(bset);
4974 set_swap_inequality(context, i, context->n_ineq-1);
4976 isl_basic_set_drop_inequality(context, i);
4977 isl_basic_set_drop_inequality(bset, i);
4982 isl_basic_set_free(context);
4985 isl_basic_set_free(context);
4986 isl_basic_set_free(bset);
4990 struct isl_basic_map *isl_basic_map_gist(struct isl_basic_map *bmap,
4991 struct isl_basic_map *context)
4993 struct isl_basic_set *bset;
4995 if (!bmap || !context)
4998 context = isl_basic_map_align_divs(context, bmap);
4999 bmap = isl_basic_map_align_divs(bmap, context);
5001 bset = uset_gist(isl_basic_map_underlying_set(isl_basic_map_copy(bmap)),
5002 isl_basic_map_underlying_set(context));
5004 return isl_basic_map_overlying_set(bset, bmap);
5006 isl_basic_map_free(bmap);
5007 isl_basic_map_free(context);
5012 * Assumes context has no implicit divs.
5014 struct isl_map *isl_map_gist(struct isl_map *map, struct isl_basic_map *context)
5018 map = isl_map_cow(map);
5019 if (!map || !context)
5021 isl_assert(map->ctx, isl_dim_equal(map->dim, context->dim), goto error);
5022 map = isl_map_compute_divs(map);
5023 for (i = 0; i < map->n; ++i)
5024 context = isl_basic_map_align_divs(context, map->p[i]);
5025 for (i = 0; i < map->n; ++i) {
5026 map->p[i] = isl_basic_map_gist(map->p[i],
5027 isl_basic_map_copy(context));
5031 isl_basic_map_free(context);
5032 F_CLR(map, ISL_MAP_NORMALIZED);
5036 isl_basic_map_free(context);
5040 struct isl_basic_set *isl_basic_set_gist(struct isl_basic_set *bset,
5041 struct isl_basic_set *context)
5043 return (struct isl_basic_set *)isl_basic_map_gist(
5044 (struct isl_basic_map *)bset, (struct isl_basic_map *)context);
5047 struct isl_set *isl_set_gist(struct isl_set *set, struct isl_basic_set *context)
5049 return (struct isl_set *)isl_map_gist((struct isl_map *)set,
5050 (struct isl_basic_map *)context);
5058 static int qsort_constraint_cmp(const void *p1, const void *p2)
5060 const struct constraint *c1 = (const struct constraint *)p1;
5061 const struct constraint *c2 = (const struct constraint *)p2;
5062 unsigned size = isl_min(c1->size, c2->size);
5063 return isl_seq_cmp(c1->c, c2->c, size);
5066 static struct isl_basic_map *isl_basic_map_sort_constraints(
5067 struct isl_basic_map *bmap)
5070 struct constraint *c;
5075 total = isl_basic_map_total_dim(bmap);
5076 c = isl_alloc_array(bmap->ctx, struct constraint, bmap->n_ineq);
5079 for (i = 0; i < bmap->n_ineq; ++i) {
5081 c[i].c = bmap->ineq[i];
5083 qsort(c, bmap->n_ineq, sizeof(struct constraint), qsort_constraint_cmp);
5084 for (i = 0; i < bmap->n_ineq; ++i)
5085 bmap->ineq[i] = c[i].c;
5089 isl_basic_map_free(bmap);
5093 struct isl_basic_map *isl_basic_map_normalize(struct isl_basic_map *bmap)
5097 if (F_ISSET(bmap, ISL_BASIC_MAP_NORMALIZED))
5099 bmap = isl_basic_map_convex_hull(bmap);
5100 bmap = isl_basic_map_sort_constraints(bmap);
5101 F_SET(bmap, ISL_BASIC_MAP_NORMALIZED);
5105 struct isl_basic_set *isl_basic_set_normalize(struct isl_basic_set *bset)
5107 return (struct isl_basic_set *)isl_basic_map_normalize(
5108 (struct isl_basic_map *)bset);
5111 static int isl_basic_map_fast_cmp(const struct isl_basic_map *bmap1,
5112 const struct isl_basic_map *bmap2)
5119 if (isl_basic_map_n_param(bmap1) != isl_basic_map_n_param(bmap2))
5120 return isl_basic_map_n_param(bmap1) - isl_basic_map_n_param(bmap2);
5121 if (isl_basic_map_n_in(bmap1) != isl_basic_map_n_in(bmap2))
5122 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
5123 if (isl_basic_map_n_out(bmap1) != isl_basic_map_n_out(bmap2))
5124 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
5125 if (F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY) &&
5126 F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
5128 if (F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY))
5130 if (F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
5132 if (bmap1->n_eq != bmap2->n_eq)
5133 return bmap1->n_eq - bmap2->n_eq;
5134 if (bmap1->n_ineq != bmap2->n_ineq)
5135 return bmap1->n_ineq - bmap2->n_ineq;
5136 if (bmap1->n_div != bmap2->n_div)
5137 return bmap1->n_div - bmap2->n_div;
5138 total = isl_basic_map_total_dim(bmap1);
5139 for (i = 0; i < bmap1->n_eq; ++i) {
5140 cmp = isl_seq_cmp(bmap1->eq[i], bmap2->eq[i], 1+total);
5144 for (i = 0; i < bmap1->n_ineq; ++i) {
5145 cmp = isl_seq_cmp(bmap1->ineq[i], bmap2->ineq[i], 1+total);
5149 for (i = 0; i < bmap1->n_div; ++i) {
5150 cmp = isl_seq_cmp(bmap1->div[i], bmap2->div[i], 1+1+total);
5157 static int isl_basic_map_fast_is_equal(struct isl_basic_map *bmap1,
5158 struct isl_basic_map *bmap2)
5160 return isl_basic_map_fast_cmp(bmap1, bmap2) == 0;
5163 static int qsort_bmap_cmp(const void *p1, const void *p2)
5165 const struct isl_basic_map *bmap1 = *(const struct isl_basic_map **)p1;
5166 const struct isl_basic_map *bmap2 = *(const struct isl_basic_map **)p2;
5168 return isl_basic_map_fast_cmp(bmap1, bmap2);
5171 /* We normalize in place, but if anything goes wrong we need
5172 * to return NULL, so we need to make sure we don't change the
5173 * meaning of any possible other copies of map.
5175 struct isl_map *isl_map_normalize(struct isl_map *map)
5178 struct isl_basic_map *bmap;
5182 if (F_ISSET(map, ISL_MAP_NORMALIZED))
5184 for (i = 0; i < map->n; ++i) {
5185 bmap = isl_basic_map_normalize(isl_basic_map_copy(map->p[i]));
5188 isl_basic_map_free(map->p[i]);
5191 qsort(map->p, map->n, sizeof(struct isl_basic_map *), qsort_bmap_cmp);
5192 F_SET(map, ISL_MAP_NORMALIZED);
5193 map = isl_map_remove_empty_parts(map);
5196 for (i = map->n - 1; i >= 1; --i) {
5197 if (!isl_basic_map_fast_is_equal(map->p[i-1], map->p[i]))
5199 isl_basic_map_free(map->p[i-1]);
5200 for (j = i; j < map->n; ++j)
5201 map->p[j-1] = map->p[j];
5211 struct isl_set *isl_set_normalize(struct isl_set *set)
5213 return (struct isl_set *)isl_map_normalize((struct isl_map *)set);
5216 int isl_map_fast_is_equal(struct isl_map *map1, struct isl_map *map2)
5226 if (!isl_dim_equal(map1->dim, map2->dim))
5229 map1 = isl_map_copy(map1);
5230 map2 = isl_map_copy(map2);
5231 map1 = isl_map_normalize(map1);
5232 map2 = isl_map_normalize(map2);
5235 equal = map1->n == map2->n;
5236 for (i = 0; equal && i < map1->n; ++i) {
5237 equal = isl_basic_map_fast_is_equal(map1->p[i], map2->p[i]);
5250 int isl_set_fast_is_equal(struct isl_set *set1, struct isl_set *set2)
5252 return isl_map_fast_is_equal((struct isl_map *)set1,
5253 (struct isl_map *)set2);
5256 /* Return an interval that ranges from min to max (inclusive)
5258 struct isl_basic_set *isl_basic_set_interval(struct isl_ctx *ctx,
5259 isl_int min, isl_int max)
5262 struct isl_basic_set *bset = NULL;
5264 bset = isl_basic_set_alloc(ctx, 0, 1, 0, 0, 2);
5268 k = isl_basic_set_alloc_inequality(bset);
5271 isl_int_set_si(bset->ineq[k][1], 1);
5272 isl_int_neg(bset->ineq[k][0], min);
5274 k = isl_basic_set_alloc_inequality(bset);
5277 isl_int_set_si(bset->ineq[k][1], -1);
5278 isl_int_set(bset->ineq[k][0], max);
5282 isl_basic_set_free(bset);
5286 /* Return the Cartesian product of the basic sets in list (in the given order).
5288 struct isl_basic_set *isl_basic_set_product(struct isl_basic_set_list *list)
5296 struct isl_basic_set *product = NULL;
5300 isl_assert(list->ctx, list->n > 0, goto error);
5301 isl_assert(list->ctx, list->p[0], goto error);
5302 nparam = isl_basic_set_n_param(list->p[0]);
5303 dim = isl_basic_set_n_dim(list->p[0]);
5304 extra = list->p[0]->n_div;
5305 n_eq = list->p[0]->n_eq;
5306 n_ineq = list->p[0]->n_ineq;
5307 for (i = 1; i < list->n; ++i) {
5308 isl_assert(list->ctx, list->p[i], goto error);
5309 isl_assert(list->ctx,
5310 nparam == isl_basic_set_n_param(list->p[i]), goto error);
5311 dim += isl_basic_set_n_dim(list->p[i]);
5312 extra += list->p[i]->n_div;
5313 n_eq += list->p[i]->n_eq;
5314 n_ineq += list->p[i]->n_ineq;
5316 product = isl_basic_set_alloc(list->ctx, nparam, dim, extra,
5321 for (i = 0; i < list->n; ++i) {
5322 set_add_constraints(product,
5323 isl_basic_set_copy(list->p[i]), dim);
5324 dim += isl_basic_set_n_dim(list->p[i]);
5326 isl_basic_set_list_free(list);
5329 isl_basic_set_free(product);
5330 isl_basic_set_list_free(list);
5334 uint32_t isl_basic_set_get_hash(struct isl_basic_set *bset)
5342 bset = isl_basic_set_copy(bset);
5343 bset = isl_basic_set_normalize(bset);
5346 total = isl_basic_set_total_dim(bset);
5347 isl_hash_byte(hash, bset->n_eq & 0xFF);
5348 for (i = 0; i < bset->n_eq; ++i) {
5350 c_hash = isl_seq_get_hash(bset->eq[i], 1 + total);
5351 isl_hash_hash(hash, c_hash);
5353 isl_hash_byte(hash, bset->n_ineq & 0xFF);
5354 for (i = 0; i < bset->n_ineq; ++i) {
5356 c_hash = isl_seq_get_hash(bset->ineq[i], 1 + total);
5357 isl_hash_hash(hash, c_hash);
5359 isl_hash_byte(hash, bset->n_div & 0xFF);
5360 for (i = 0; i < bset->n_div; ++i) {
5362 if (isl_int_is_zero(bset->div[i][0]))
5364 isl_hash_byte(hash, i & 0xFF);
5365 c_hash = isl_seq_get_hash(bset->div[i], 1 + 1 + total);
5366 isl_hash_hash(hash, c_hash);
5368 isl_basic_set_free(bset);
5372 uint32_t isl_set_get_hash(struct isl_set *set)
5379 set = isl_set_copy(set);
5380 set = isl_set_normalize(set);
5384 hash = isl_hash_init();
5385 for (i = 0; i < set->n; ++i) {
5387 bset_hash = isl_basic_set_get_hash(set->p[i]);
5388 isl_hash_hash(hash, bset_hash);
5396 /* Check if the value for dimension dim is completely determined
5397 * by the values of the other parameters and variables.
5398 * That is, check if dimension dim is involved in an equality.
5400 int isl_basic_set_dim_is_unique(struct isl_basic_set *bset, unsigned dim)
5407 nparam = isl_basic_set_n_param(bset);
5408 for (i = 0; i < bset->n_eq; ++i)
5409 if (!isl_int_is_zero(bset->eq[i][1 + nparam + dim]))
5414 /* Check if the value for dimension dim is completely determined
5415 * by the values of the other parameters and variables.
5416 * That is, check if dimension dim is involved in an equality
5417 * for each of the subsets.
5419 int isl_set_dim_is_unique(struct isl_set *set, unsigned dim)
5425 for (i = 0; i < set->n; ++i) {
5427 unique = isl_basic_set_dim_is_unique(set->p[i], dim);