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 struct isl_basic_set *isl_basic_set_drop_dims(
942 struct isl_basic_set *bset, unsigned first, unsigned n)
949 isl_assert(bset->ctx, first + n <= bset->dim->n_out, goto error);
954 bset = isl_basic_set_cow(bset);
958 for (i = 0; i < bset->n_eq; ++i)
959 constraint_drop_vars(bset->eq[i]+1+bset->dim->nparam+first, n,
960 (bset->dim->n_out-first-n)+bset->extra);
962 for (i = 0; i < bset->n_ineq; ++i)
963 constraint_drop_vars(bset->ineq[i]+1+bset->dim->nparam+first, n,
964 (bset->dim->n_out-first-n)+bset->extra);
966 for (i = 0; i < bset->n_div; ++i)
967 constraint_drop_vars(bset->div[i]+1+1+bset->dim->nparam+first, n,
968 (bset->dim->n_out-first-n)+bset->extra);
970 bset->dim = isl_dim_drop_outputs(bset->dim, first, n);
975 F_CLR(bset, ISL_BASIC_SET_NORMALIZED);
976 bset = isl_basic_set_simplify(bset);
977 return isl_basic_set_finalize(bset);
979 isl_basic_set_free(bset);
983 static struct isl_set *isl_set_drop_dims(
984 struct isl_set *set, unsigned first, unsigned n)
991 isl_assert(set->ctx, first + n <= set->dim->n_out, goto error);
995 set = isl_set_cow(set);
998 set->dim = isl_dim_drop_outputs(set->dim, first, n);
1002 for (i = 0; i < set->n; ++i) {
1003 set->p[i] = isl_basic_set_drop_dims(set->p[i], first, n);
1008 F_CLR(set, ISL_SET_NORMALIZED);
1015 struct isl_basic_map *isl_basic_map_drop_inputs(
1016 struct isl_basic_map *bmap, unsigned first, unsigned n)
1026 nparam = isl_basic_map_n_param(bmap);
1027 n_in = isl_basic_map_n_in(bmap);
1028 n_out = isl_basic_map_n_out(bmap);
1029 isl_assert(bmap->ctx, first + n <= n_in, goto error);
1034 bmap = isl_basic_map_cow(bmap);
1038 for (i = 0; i < bmap->n_eq; ++i)
1039 constraint_drop_vars(bmap->eq[i]+1+nparam+first, n,
1040 (n_in-first-n)+n_out+bmap->extra);
1042 for (i = 0; i < bmap->n_ineq; ++i)
1043 constraint_drop_vars(bmap->ineq[i]+1+nparam+first, n,
1044 (n_in-first-n)+n_out+bmap->extra);
1046 for (i = 0; i < bmap->n_div; ++i)
1047 constraint_drop_vars(bmap->div[i]+1+1+nparam+first, n,
1048 (n_in-first-n)+n_out+bmap->extra);
1050 bmap->dim = isl_dim_drop_inputs(bmap->dim, first, n);
1055 F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1056 bmap = isl_basic_map_simplify(bmap);
1057 return isl_basic_map_finalize(bmap);
1059 isl_basic_map_free(bmap);
1063 static struct isl_map *isl_map_drop_inputs(
1064 struct isl_map *map, unsigned first, unsigned n)
1071 isl_assert(map->ctx, first + n <= map->dim->n_in, goto error);
1075 map = isl_map_cow(map);
1078 map->dim = isl_dim_drop_inputs(map->dim, first, n);
1082 for (i = 0; i < map->n; ++i) {
1083 map->p[i] = isl_basic_map_drop_inputs(map->p[i], first, n);
1087 F_CLR(map, ISL_MAP_NORMALIZED);
1096 * We don't cow, as the div is assumed to be redundant.
1098 static struct isl_basic_map *isl_basic_map_drop_div(
1099 struct isl_basic_map *bmap, unsigned div)
1107 pos = 1 + isl_dim_total(bmap->dim) + div;
1109 isl_assert(bmap->ctx, div < bmap->n_div, goto error);
1111 for (i = 0; i < bmap->n_eq; ++i)
1112 constraint_drop_vars(bmap->eq[i]+pos, 1, bmap->extra-div-1);
1114 for (i = 0; i < bmap->n_ineq; ++i) {
1115 if (!isl_int_is_zero(bmap->ineq[i][pos])) {
1116 isl_basic_map_drop_inequality(bmap, i);
1120 constraint_drop_vars(bmap->ineq[i]+pos, 1, bmap->extra-div-1);
1123 for (i = 0; i < bmap->n_div; ++i)
1124 constraint_drop_vars(bmap->div[i]+1+pos, 1, bmap->extra-div-1);
1126 if (div != bmap->n_div - 1) {
1128 isl_int *t = bmap->div[div];
1130 for (j = div; j < bmap->n_div - 1; ++j)
1131 bmap->div[j] = bmap->div[j+1];
1133 bmap->div[bmap->n_div - 1] = t;
1135 F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1136 isl_basic_map_free_div(bmap, 1);
1140 isl_basic_map_free(bmap);
1144 static void eliminate_div(struct isl_basic_map *bmap, isl_int *eq, unsigned div)
1147 unsigned pos = 1 + isl_dim_total(bmap->dim) + div;
1149 len = 1 + isl_basic_map_total_dim(bmap);
1151 for (i = 0; i < bmap->n_eq; ++i)
1152 if (bmap->eq[i] != eq)
1153 isl_seq_elim(bmap->eq[i], eq, pos, len, NULL);
1155 for (i = 0; i < bmap->n_ineq; ++i)
1156 isl_seq_elim(bmap->ineq[i], eq, pos, len, NULL);
1158 /* We need to be careful about circular definitions,
1159 * so for now we just remove the definitions of other divs that
1160 * depend on this div and (possibly) recompute them later.
1162 for (i = 0; i < bmap->n_div; ++i)
1163 if (!isl_int_is_zero(bmap->div[i][0]) &&
1164 !isl_int_is_zero(bmap->div[i][1 + pos]))
1165 isl_seq_clr(bmap->div[i], 1 + len);
1167 isl_basic_map_drop_div(bmap, div);
1170 struct isl_basic_map *isl_basic_map_set_to_empty(struct isl_basic_map *bmap)
1176 total = isl_basic_map_total_dim(bmap);
1177 isl_basic_map_free_div(bmap, bmap->n_div);
1178 isl_basic_map_free_inequality(bmap, bmap->n_ineq);
1180 isl_basic_map_free_equality(bmap, bmap->n_eq-1);
1182 isl_basic_map_alloc_equality(bmap);
1186 isl_int_set_si(bmap->eq[i][0], 1);
1187 isl_seq_clr(bmap->eq[i]+1, total);
1188 F_SET(bmap, ISL_BASIC_MAP_EMPTY);
1189 return isl_basic_map_finalize(bmap);
1191 isl_basic_map_free(bmap);
1195 struct isl_basic_set *isl_basic_set_set_to_empty(struct isl_basic_set *bset)
1197 return (struct isl_basic_set *)
1198 isl_basic_map_set_to_empty((struct isl_basic_map *)bset);
1201 static void swap_equality(struct isl_basic_map *bmap, int a, int b)
1203 isl_int *t = bmap->eq[a];
1204 bmap->eq[a] = bmap->eq[b];
1208 static void swap_inequality(struct isl_basic_map *bmap, int a, int b)
1211 isl_int *t = bmap->ineq[a];
1212 bmap->ineq[a] = bmap->ineq[b];
1217 static void set_swap_inequality(struct isl_basic_set *bset, int a, int b)
1219 swap_inequality((struct isl_basic_map *)bset, a, b);
1222 static void swap_div(struct isl_basic_map *bmap, int a, int b)
1225 unsigned off = isl_dim_total(bmap->dim);
1226 isl_int *t = bmap->div[a];
1227 bmap->div[a] = bmap->div[b];
1230 for (i = 0; i < bmap->n_eq; ++i)
1231 isl_int_swap(bmap->eq[i][1+off+a], bmap->eq[i][1+off+b]);
1233 for (i = 0; i < bmap->n_ineq; ++i)
1234 isl_int_swap(bmap->ineq[i][1+off+a], bmap->ineq[i][1+off+b]);
1236 for (i = 0; i < bmap->n_div; ++i)
1237 isl_int_swap(bmap->div[i][1+1+off+a], bmap->div[i][1+1+off+b]);
1238 F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1241 static void eliminate_var_using_equality(struct isl_basic_map *bmap,
1242 unsigned pos, isl_int *eq, int *progress)
1247 total = isl_basic_map_total_dim(bmap);
1248 for (k = 0; k < bmap->n_eq; ++k) {
1249 if (bmap->eq[k] == eq)
1251 if (isl_int_is_zero(bmap->eq[k][1+pos]))
1255 isl_seq_elim(bmap->eq[k], eq, 1+pos, 1+total, NULL);
1258 for (k = 0; k < bmap->n_ineq; ++k) {
1259 if (isl_int_is_zero(bmap->ineq[k][1+pos]))
1263 isl_seq_elim(bmap->ineq[k], eq, 1+pos, 1+total, NULL);
1264 F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1267 for (k = 0; k < bmap->n_div; ++k) {
1268 if (isl_int_is_zero(bmap->div[k][0]))
1270 if (isl_int_is_zero(bmap->div[k][1+1+pos]))
1274 isl_seq_elim(bmap->div[k]+1, eq,
1275 1+pos, 1+total, &bmap->div[k][0]);
1276 F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1281 struct isl_basic_map *isl_basic_map_gauss(
1282 struct isl_basic_map *bmap, int *progress)
1293 total = isl_basic_map_total_dim(bmap);
1294 total_var = total - bmap->n_div;
1296 last_var = total - 1;
1297 for (done = 0; done < bmap->n_eq; ++done) {
1298 for (; last_var >= 0; --last_var) {
1299 for (k = done; k < bmap->n_eq; ++k)
1300 if (!isl_int_is_zero(bmap->eq[k][1+last_var]))
1308 swap_equality(bmap, k, done);
1309 if (isl_int_is_neg(bmap->eq[done][1+last_var]))
1310 isl_seq_neg(bmap->eq[done], bmap->eq[done], 1+total);
1312 eliminate_var_using_equality(bmap, last_var, bmap->eq[done],
1315 if (last_var >= total_var &&
1316 isl_int_is_zero(bmap->div[last_var - total_var][0])) {
1317 unsigned div = last_var - total_var;
1318 isl_seq_neg(bmap->div[div]+1, bmap->eq[done], 1+total);
1319 isl_int_set_si(bmap->div[div][1+1+last_var], 0);
1320 isl_int_set(bmap->div[div][0],
1321 bmap->eq[done][1+last_var]);
1322 F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1325 if (done == bmap->n_eq)
1327 for (k = done; k < bmap->n_eq; ++k) {
1328 if (isl_int_is_zero(bmap->eq[k][0]))
1330 return isl_basic_map_set_to_empty(bmap);
1332 isl_basic_map_free_equality(bmap, bmap->n_eq-done);
1336 struct isl_basic_set *isl_basic_set_gauss(
1337 struct isl_basic_set *bset, int *progress)
1339 return (struct isl_basic_set*)isl_basic_map_gauss(
1340 (struct isl_basic_map *)bset, progress);
1343 static unsigned int round_up(unsigned int v)
1354 static int hash_index(isl_int ***index, unsigned int size, int bits,
1355 struct isl_basic_map *bmap, int k)
1358 unsigned total = isl_basic_map_total_dim(bmap);
1359 uint32_t hash = isl_seq_get_hash_bits(bmap->ineq[k]+1, total, bits);
1360 for (h = hash; index[h]; h = (h+1) % size)
1361 if (&bmap->ineq[k] != index[h] &&
1362 isl_seq_eq(bmap->ineq[k]+1, index[h][0]+1, total))
1367 static int set_hash_index(isl_int ***index, unsigned int size, int bits,
1368 struct isl_basic_set *bset, int k)
1370 return hash_index(index, size, bits, (struct isl_basic_map *)bset, k);
1373 static struct isl_basic_map *remove_duplicate_constraints(
1374 struct isl_basic_map *bmap, int *progress)
1380 unsigned total = isl_basic_map_total_dim(bmap);
1383 if (bmap->n_ineq <= 1)
1386 size = round_up(4 * (bmap->n_ineq+1) / 3 - 1);
1387 bits = ffs(size) - 1;
1388 index = isl_calloc_array(ctx, isl_int **, size);
1392 index[isl_seq_get_hash_bits(bmap->ineq[0]+1, total, bits)] = &bmap->ineq[0];
1393 for (k = 1; k < bmap->n_ineq; ++k) {
1394 h = hash_index(index, size, bits, bmap, k);
1396 index[h] = &bmap->ineq[k];
1401 l = index[h] - &bmap->ineq[0];
1402 if (isl_int_lt(bmap->ineq[k][0], bmap->ineq[l][0]))
1403 swap_inequality(bmap, k, l);
1404 isl_basic_map_drop_inequality(bmap, k);
1408 for (k = 0; k < bmap->n_ineq-1; ++k) {
1409 isl_seq_neg(bmap->ineq[k]+1, bmap->ineq[k]+1, total);
1410 h = hash_index(index, size, bits, bmap, k);
1411 isl_seq_neg(bmap->ineq[k]+1, bmap->ineq[k]+1, total);
1414 l = index[h] - &bmap->ineq[0];
1415 isl_int_add(sum, bmap->ineq[k][0], bmap->ineq[l][0]);
1416 if (isl_int_is_pos(sum))
1418 if (isl_int_is_zero(sum)) {
1419 /* We need to break out of the loop after these
1420 * changes since the contents of the hash
1421 * will no longer be valid.
1422 * Plus, we probably we want to regauss first.
1424 isl_basic_map_drop_inequality(bmap, l);
1425 isl_basic_map_inequality_to_equality(bmap, k);
1427 bmap = isl_basic_map_set_to_empty(bmap);
1436 static void compute_elimination_index(struct isl_basic_map *bmap, int *elim)
1441 total = isl_dim_total(bmap->dim);
1442 for (d = 0; d < total; ++d)
1444 for (d = total - 1, i = 0; d >= 0 && i < bmap->n_eq; ++i) {
1445 for (; d >= 0; --d) {
1446 if (isl_int_is_zero(bmap->eq[i][1+d]))
1454 static void set_compute_elimination_index(struct isl_basic_set *bset, int *elim)
1456 return compute_elimination_index((struct isl_basic_map *)bset, elim);
1459 static int reduced_using_equalities(isl_int *dst, isl_int *src,
1460 struct isl_basic_map *bmap, int *elim)
1466 total = isl_dim_total(bmap->dim);
1467 for (d = total - 1; d >= 0; --d) {
1468 if (isl_int_is_zero(src[1+d]))
1473 isl_seq_cpy(dst, src, 1 + total);
1476 isl_seq_elim(dst, bmap->eq[elim[d]], 1 + d, 1 + total, NULL);
1481 static int set_reduced_using_equalities(isl_int *dst, isl_int *src,
1482 struct isl_basic_set *bset, int *elim)
1484 return reduced_using_equalities(dst, src,
1485 (struct isl_basic_map *)bset, elim);
1488 /* Quick check to see if two basic maps are disjoint.
1489 * In particular, we reduce the equalities and inequalities of
1490 * one basic map in the context of the equalities of the other
1491 * basic map and check if we get a contradiction.
1493 int isl_basic_map_fast_is_disjoint(struct isl_basic_map *bmap1,
1494 struct isl_basic_map *bmap2)
1496 struct isl_vec *v = NULL;
1501 if (!bmap1 || !bmap2)
1503 isl_assert(bmap1->ctx, isl_dim_equal(bmap1->dim, bmap2->dim),
1505 if (bmap1->n_div || bmap2->n_div)
1507 if (!bmap1->n_eq && !bmap2->n_eq)
1510 total = isl_dim_total(bmap1->dim);
1513 v = isl_vec_alloc(bmap1->ctx, 1 + total);
1516 elim = isl_alloc_array(bmap1->ctx, int, total);
1519 compute_elimination_index(bmap1, elim);
1520 for (i = 0; i < bmap2->n_eq; ++i) {
1522 reduced = reduced_using_equalities(v->block.data, bmap2->eq[i],
1524 if (reduced && !isl_int_is_zero(v->block.data[0]) &&
1525 isl_seq_first_non_zero(v->block.data + 1, total) == -1)
1528 for (i = 0; i < bmap2->n_ineq; ++i) {
1530 reduced = reduced_using_equalities(v->block.data,
1531 bmap2->ineq[i], bmap1, elim);
1532 if (reduced && isl_int_is_neg(v->block.data[0]) &&
1533 isl_seq_first_non_zero(v->block.data + 1, total) == -1)
1536 compute_elimination_index(bmap2, elim);
1537 for (i = 0; i < bmap1->n_ineq; ++i) {
1539 reduced = reduced_using_equalities(v->block.data,
1540 bmap1->ineq[i], bmap2, elim);
1541 if (reduced && isl_int_is_neg(v->block.data[0]) &&
1542 isl_seq_first_non_zero(v->block.data + 1, total) == -1)
1545 isl_vec_free(bmap1->ctx, v);
1549 isl_vec_free(bmap1->ctx, v);
1553 isl_vec_free(bmap1->ctx, v);
1558 int isl_basic_set_fast_is_disjoint(struct isl_basic_set *bset1,
1559 struct isl_basic_set *bset2)
1561 return isl_basic_map_fast_is_disjoint((struct isl_basic_map *)bset1,
1562 (struct isl_basic_map *)bset2);
1565 int isl_map_fast_is_disjoint(struct isl_map *map1, struct isl_map *map2)
1572 if (isl_map_fast_is_equal(map1, map2))
1575 for (i = 0; i < map1->n; ++i) {
1576 for (j = 0; j < map2->n; ++j) {
1577 int d = isl_basic_map_fast_is_disjoint(map1->p[i],
1586 int isl_set_fast_is_disjoint(struct isl_set *set1, struct isl_set *set2)
1588 return isl_map_fast_is_disjoint((struct isl_map *)set1,
1589 (struct isl_map *)set2);
1592 static struct isl_basic_map *remove_duplicate_divs(
1593 struct isl_basic_map *bmap, int *progress)
1600 unsigned total_var = isl_dim_total(bmap->dim);
1601 unsigned total = total_var + bmap->n_div;
1602 struct isl_ctx *ctx;
1604 if (bmap->n_div <= 1)
1608 for (k = bmap->n_div - 1; k >= 0; --k)
1609 if (!isl_int_is_zero(bmap->div[k][0]))
1614 size = round_up(4 * bmap->n_div / 3 - 1);
1615 bits = ffs(size) - 1;
1616 index = isl_calloc_array(ctx, int, size);
1619 eq = isl_blk_alloc(ctx, 1+total);
1620 if (isl_blk_is_error(eq))
1623 isl_seq_clr(eq.data, 1+total);
1624 index[isl_seq_get_hash_bits(bmap->div[k], 2+total, bits)] = k + 1;
1625 for (--k; k >= 0; --k) {
1628 if (isl_int_is_zero(bmap->div[k][0]))
1631 hash = isl_seq_get_hash_bits(bmap->div[k], 2+total, bits);
1632 for (h = hash; index[h]; h = (h+1) % size)
1633 if (isl_seq_eq(bmap->div[k],
1634 bmap->div[index[h]-1], 2+total))
1639 isl_int_set_si(eq.data[1+total_var+k], -1);
1640 isl_int_set_si(eq.data[1+total_var+l], 1);
1641 eliminate_div(bmap, eq.data, l);
1642 isl_int_set_si(eq.data[1+total_var+k], 0);
1643 isl_int_set_si(eq.data[1+total_var+l], 0);
1648 isl_blk_free(ctx, eq);
1654 /* Elimininate divs based on equalities
1656 static struct isl_basic_map *eliminate_divs_eq(
1657 struct isl_basic_map *bmap, int *progress)
1667 off = 1 + isl_dim_total(bmap->dim);
1669 for (d = bmap->n_div - 1; d >= 0 ; --d) {
1670 for (i = 0; i < bmap->n_eq; ++i) {
1671 if (!isl_int_is_one(bmap->eq[i][off + d]) &&
1672 !isl_int_is_negone(bmap->eq[i][off + d]))
1676 eliminate_div(bmap, bmap->eq[i], d);
1677 isl_basic_map_drop_equality(bmap, i);
1682 return eliminate_divs_eq(bmap, progress);
1686 static struct isl_basic_map *normalize_constraints(struct isl_basic_map *bmap)
1690 unsigned total = isl_basic_map_total_dim(bmap);
1693 for (i = bmap->n_eq - 1; i >= 0; --i) {
1694 isl_seq_gcd(bmap->eq[i]+1, total, &gcd);
1695 if (isl_int_is_zero(gcd)) {
1696 if (!isl_int_is_zero(bmap->eq[i][0])) {
1697 bmap = isl_basic_map_set_to_empty(bmap);
1700 isl_basic_map_drop_equality(bmap, i);
1703 if (F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL))
1704 isl_int_gcd(gcd, gcd, bmap->eq[i][0]);
1705 if (isl_int_is_one(gcd))
1707 if (!isl_int_is_divisible_by(bmap->eq[i][0], gcd)) {
1708 bmap = isl_basic_map_set_to_empty(bmap);
1711 isl_seq_scale_down(bmap->eq[i], bmap->eq[i], gcd, 1+total);
1714 for (i = bmap->n_ineq - 1; i >= 0; --i) {
1715 isl_seq_gcd(bmap->ineq[i]+1, total, &gcd);
1716 if (isl_int_is_zero(gcd)) {
1717 if (isl_int_is_neg(bmap->ineq[i][0])) {
1718 bmap = isl_basic_map_set_to_empty(bmap);
1721 isl_basic_map_drop_inequality(bmap, i);
1724 if (F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL))
1725 isl_int_gcd(gcd, gcd, bmap->ineq[i][0]);
1726 if (isl_int_is_one(gcd))
1728 isl_int_fdiv_q(bmap->ineq[i][0], bmap->ineq[i][0], gcd);
1729 isl_seq_scale_down(bmap->ineq[i]+1, bmap->ineq[i]+1, gcd, total);
1737 /* Eliminate the specified variables from the constraints using
1738 * Fourier-Motzkin. The variables themselves are not removed.
1740 struct isl_basic_map *isl_basic_map_eliminate_vars(
1741 struct isl_basic_map *bmap, int pos, unsigned n)
1751 total = isl_basic_map_total_dim(bmap);
1753 bmap = isl_basic_map_cow(bmap);
1754 for (d = pos + n - 1; d >= pos; --d) {
1755 int n_lower, n_upper;
1758 for (i = 0; i < bmap->n_eq; ++i) {
1759 if (isl_int_is_zero(bmap->eq[i][1+d]))
1761 eliminate_var_using_equality(bmap, d, bmap->eq[i], NULL);
1762 isl_basic_map_drop_equality(bmap, i);
1769 for (i = 0; i < bmap->n_ineq; ++i) {
1770 if (isl_int_is_pos(bmap->ineq[i][1+d]))
1772 else if (isl_int_is_neg(bmap->ineq[i][1+d]))
1775 bmap = isl_basic_map_extend_constraints(bmap,
1776 0, n_lower * n_upper);
1777 for (i = bmap->n_ineq - 1; i >= 0; --i) {
1779 if (isl_int_is_zero(bmap->ineq[i][1+d]))
1782 for (j = 0; j < i; ++j) {
1783 if (isl_int_is_zero(bmap->ineq[j][1+d]))
1786 if (isl_int_sgn(bmap->ineq[i][1+d]) ==
1787 isl_int_sgn(bmap->ineq[j][1+d]))
1789 k = isl_basic_map_alloc_inequality(bmap);
1792 isl_seq_cpy(bmap->ineq[k], bmap->ineq[i],
1794 isl_seq_elim(bmap->ineq[k], bmap->ineq[j],
1795 1+d, 1+total, NULL);
1797 isl_basic_map_drop_inequality(bmap, i);
1800 if (n_lower > 0 && n_upper > 0) {
1801 bmap = normalize_constraints(bmap);
1802 bmap = remove_duplicate_constraints(bmap, NULL);
1803 bmap = isl_basic_map_gauss(bmap, NULL);
1804 bmap = isl_basic_map_convex_hull(bmap);
1807 if (F_ISSET(bmap, ISL_BASIC_MAP_EMPTY))
1811 F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1814 isl_basic_map_free(bmap);
1818 struct isl_basic_set *isl_basic_set_eliminate_vars(
1819 struct isl_basic_set *bset, unsigned pos, unsigned n)
1821 return (struct isl_basic_set *)isl_basic_map_eliminate_vars(
1822 (struct isl_basic_map *)bset, pos, n);
1825 /* Eliminate the specified n dimensions starting at first from the
1826 * constraints using Fourier-Motzkin, The dimensions themselves
1829 struct isl_set *isl_set_eliminate_dims(struct isl_set *set,
1830 unsigned first, unsigned n)
1840 set = isl_set_cow(set);
1843 isl_assert(set->ctx, first+n <= isl_set_n_dim(set), goto error);
1844 nparam = isl_set_n_param(set);
1846 for (i = 0; i < set->n; ++i) {
1847 set->p[i] = isl_basic_set_eliminate_vars(set->p[i],
1858 /* Project out n dimensions starting at first using Fourier-Motzkin */
1859 struct isl_set *isl_set_remove_dims(struct isl_set *set,
1860 unsigned first, unsigned n)
1862 set = isl_set_eliminate_dims(set, first, n);
1863 set = isl_set_drop_dims(set, first, n);
1867 struct isl_basic_set *isl_basic_set_remove_divs(struct isl_basic_set *bset)
1869 bset = isl_basic_set_eliminate_vars(bset, isl_dim_total(bset->dim),
1877 struct isl_set *isl_set_remove_divs(struct isl_set *set)
1886 set = isl_set_cow(set);
1890 for (i = 0; i < set->n; ++i) {
1891 set->p[i] = isl_basic_set_remove_divs(set->p[i]);
1901 /* Project out n inputs starting at first using Fourier-Motzkin */
1902 struct isl_map *isl_map_remove_inputs(struct isl_map *map,
1903 unsigned first, unsigned n)
1911 map = isl_map_cow(map);
1914 nparam = isl_map_n_param(map);
1915 isl_assert(map->ctx, first+n <= isl_map_n_in(map), goto error);
1917 for (i = 0; i < map->n; ++i) {
1918 map->p[i] = isl_basic_map_eliminate_vars(map->p[i],
1923 map = isl_map_drop_inputs(map, first, n);
1930 /* Project out n dimensions starting at first using Fourier-Motzkin */
1931 struct isl_basic_set *isl_basic_set_remove_dims(struct isl_basic_set *bset,
1932 unsigned first, unsigned n)
1934 unsigned nparam = isl_basic_set_n_param(bset);
1935 bset = isl_basic_set_eliminate_vars(bset, nparam + first, n);
1936 bset = isl_basic_set_drop_dims(bset, first, n);
1940 /* Elimininate divs based on inequalities
1942 static struct isl_basic_map *eliminate_divs_ineq(
1943 struct isl_basic_map *bmap, int *progress)
1948 struct isl_ctx *ctx;
1954 off = 1 + isl_dim_total(bmap->dim);
1956 for (d = bmap->n_div - 1; d >= 0 ; --d) {
1957 for (i = 0; i < bmap->n_eq; ++i)
1958 if (!isl_int_is_zero(bmap->eq[i][off + d]))
1962 for (i = 0; i < bmap->n_ineq; ++i)
1963 if (isl_int_abs_gt(bmap->ineq[i][off + d], ctx->one))
1965 if (i < bmap->n_ineq)
1968 bmap = isl_basic_map_eliminate_vars(bmap, (off-1)+d, 1);
1969 if (F_ISSET(bmap, ISL_BASIC_MAP_EMPTY))
1971 bmap = isl_basic_map_drop_div(bmap, d);
1978 struct isl_basic_map *isl_basic_map_simplify(struct isl_basic_map *bmap)
1985 bmap = normalize_constraints(bmap);
1986 bmap = eliminate_divs_eq(bmap, &progress);
1987 bmap = eliminate_divs_ineq(bmap, &progress);
1988 bmap = isl_basic_map_gauss(bmap, &progress);
1989 bmap = remove_duplicate_divs(bmap, &progress);
1990 bmap = remove_duplicate_constraints(bmap, &progress);
1995 struct isl_basic_set *isl_basic_set_simplify(struct isl_basic_set *bset)
1997 return (struct isl_basic_set *)
1998 isl_basic_map_simplify((struct isl_basic_map *)bset);
2001 static void dump_term(struct isl_basic_map *bmap,
2002 isl_int c, int pos, FILE *out)
2005 unsigned in = isl_basic_map_n_in(bmap);
2006 unsigned dim = in + isl_basic_map_n_out(bmap);
2007 unsigned nparam = isl_basic_map_n_param(bmap);
2009 isl_int_print(out, c, 0);
2011 if (!isl_int_is_one(c))
2012 isl_int_print(out, c, 0);
2013 if (pos < 1 + nparam) {
2014 name = isl_dim_get_name(bmap->dim,
2015 isl_dim_param, pos - 1);
2017 fprintf(out, "%s", name);
2019 fprintf(out, "p%d", pos - 1);
2020 } else if (pos < 1 + nparam + in)
2021 fprintf(out, "i%d", pos - 1 - nparam);
2022 else if (pos < 1 + nparam + dim)
2023 fprintf(out, "o%d", pos - 1 - nparam - in);
2025 fprintf(out, "e%d", pos - 1 - nparam - dim);
2029 static void dump_constraint_sign(struct isl_basic_map *bmap, isl_int *c,
2030 int sign, FILE *out)
2034 unsigned len = 1 + isl_basic_map_total_dim(bmap);
2038 for (i = 0, first = 1; i < len; ++i) {
2039 if (isl_int_sgn(c[i]) * sign <= 0)
2042 fprintf(out, " + ");
2044 isl_int_abs(v, c[i]);
2045 dump_term(bmap, v, i, out);
2052 static void dump_constraint(struct isl_basic_map *bmap, isl_int *c,
2053 const char *op, FILE *out, int indent)
2057 fprintf(out, "%*s", indent, "");
2059 dump_constraint_sign(bmap, c, 1, out);
2060 fprintf(out, " %s ", op);
2061 dump_constraint_sign(bmap, c, -1, out);
2065 for (i = bmap->n_div; i < bmap->extra; ++i) {
2066 if (isl_int_is_zero(c[1+isl_dim_total(bmap->dim)+i]))
2068 fprintf(out, "%*s", indent, "");
2069 fprintf(out, "ERROR: unused div coefficient not zero\n");
2074 static void dump_constraints(struct isl_basic_map *bmap,
2075 isl_int **c, unsigned n,
2076 const char *op, FILE *out, int indent)
2080 for (i = 0; i < n; ++i)
2081 dump_constraint(bmap, c[i], op, out, indent);
2084 static void dump_affine(struct isl_basic_map *bmap, isl_int *exp, FILE *out)
2088 unsigned total = isl_basic_map_total_dim(bmap);
2090 for (j = 0; j < 1 + total; ++j) {
2091 if (isl_int_is_zero(exp[j]))
2093 if (!first && isl_int_is_pos(exp[j]))
2095 dump_term(bmap, exp[j], j, out);
2100 static void dump(struct isl_basic_map *bmap, FILE *out, int indent)
2104 dump_constraints(bmap, bmap->eq, bmap->n_eq, "=", out, indent);
2105 dump_constraints(bmap, bmap->ineq, bmap->n_ineq, ">=", out, indent);
2107 for (i = 0; i < bmap->n_div; ++i) {
2108 fprintf(out, "%*s", indent, "");
2109 fprintf(out, "e%d = [(", i);
2110 dump_affine(bmap, bmap->div[i]+1, out);
2112 isl_int_print(out, bmap->div[i][0], 0);
2113 fprintf(out, "]\n");
2117 void isl_basic_set_dump(struct isl_basic_set *bset, FILE *out, int indent)
2120 fprintf(out, "null basic set\n");
2124 fprintf(out, "%*s", indent, "");
2125 fprintf(out, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n",
2126 bset->ref, bset->dim->nparam, bset->dim->n_out,
2127 bset->extra, bset->flags);
2128 dump((struct isl_basic_map *)bset, out, indent);
2131 void isl_basic_map_dump(struct isl_basic_map *bmap, FILE *out, int indent)
2134 fprintf(out, "null basic map\n");
2138 fprintf(out, "%*s", indent, "");
2139 fprintf(out, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, "
2140 "flags: %x, n_name: %d\n",
2142 bmap->dim->nparam, bmap->dim->n_in, bmap->dim->n_out,
2143 bmap->extra, bmap->flags, bmap->dim->n_name);
2144 dump(bmap, out, indent);
2147 int isl_inequality_negate(struct isl_basic_map *bmap, unsigned pos)
2152 total = isl_basic_map_total_dim(bmap);
2153 isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
2154 isl_seq_neg(bmap->ineq[pos], bmap->ineq[pos], 1 + total);
2155 isl_int_sub_ui(bmap->ineq[pos][0], bmap->ineq[pos][0], 1);
2156 F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
2160 struct isl_set *isl_set_alloc_dim(struct isl_dim *dim, int n, unsigned flags)
2162 struct isl_set *set;
2166 isl_assert(dim->ctx, dim->n_in == 0, return NULL);
2167 isl_assert(dim->ctx, n >= 0, return NULL);
2168 set = isl_alloc(dim->ctx, struct isl_set,
2169 sizeof(struct isl_set) +
2170 n * sizeof(struct isl_basic_set *));
2174 set->ctx = dim->ctx;
2175 isl_ctx_ref(set->ctx);
2187 struct isl_set *isl_set_alloc(struct isl_ctx *ctx,
2188 unsigned nparam, unsigned dim, int n, unsigned flags)
2190 struct isl_set *set;
2191 struct isl_dim *dims;
2193 dims = isl_dim_alloc(ctx, nparam, 0, dim);
2197 set = isl_set_alloc_dim(dims, n, flags);
2201 struct isl_set *isl_set_dup(struct isl_set *set)
2204 struct isl_set *dup;
2209 dup = isl_set_alloc_dim(isl_dim_copy(set->dim), set->n, set->flags);
2212 for (i = 0; i < set->n; ++i)
2213 dup = isl_set_add(dup, isl_basic_set_copy(set->p[i]));
2217 struct isl_set *isl_set_from_basic_set(struct isl_basic_set *bset)
2219 struct isl_set *set;
2224 set = isl_set_alloc_dim(isl_dim_copy(bset->dim), 1, ISL_MAP_DISJOINT);
2226 isl_basic_set_free(bset);
2229 return isl_set_add(set, bset);
2232 struct isl_map *isl_map_from_basic_map(struct isl_basic_map *bmap)
2234 struct isl_map *map;
2239 map = isl_map_alloc_dim(isl_dim_copy(bmap->dim), 1, ISL_MAP_DISJOINT);
2241 isl_basic_map_free(bmap);
2244 return isl_map_add(map, bmap);
2247 struct isl_set *isl_set_add(struct isl_set *set, struct isl_basic_set *bset)
2251 isl_assert(set->ctx, isl_dim_equal(set->dim, bset->dim), goto error);
2252 isl_assert(set->ctx, set->n < set->size, goto error);
2253 set->p[set->n] = bset;
2260 isl_basic_set_free(bset);
2264 void isl_set_free(struct isl_set *set)
2274 isl_ctx_deref(set->ctx);
2275 for (i = 0; i < set->n; ++i)
2276 isl_basic_set_free(set->p[i]);
2277 isl_dim_free(set->dim);
2281 void isl_set_dump(struct isl_set *set, FILE *out, int indent)
2286 fprintf(out, "null set\n");
2290 fprintf(out, "%*s", indent, "");
2291 fprintf(out, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
2292 set->ref, set->n, set->dim->nparam, set->dim->n_out,
2294 for (i = 0; i < set->n; ++i) {
2295 fprintf(out, "%*s", indent, "");
2296 fprintf(out, "basic set %d:\n", i);
2297 isl_basic_set_dump(set->p[i], out, indent+4);
2301 void isl_map_dump(struct isl_map *map, FILE *out, int indent)
2306 fprintf(out, "null map\n");
2310 fprintf(out, "%*s", indent, "");
2311 fprintf(out, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, "
2312 "flags: %x, n_name: %d\n",
2313 map->ref, map->n, map->dim->nparam, map->dim->n_in,
2314 map->dim->n_out, map->flags, map->dim->n_name);
2315 for (i = 0; i < map->n; ++i) {
2316 fprintf(out, "%*s", indent, "");
2317 fprintf(out, "basic map %d:\n", i);
2318 isl_basic_map_dump(map->p[i], out, indent+4);
2322 struct isl_basic_map *isl_basic_map_intersect_domain(
2323 struct isl_basic_map *bmap, struct isl_basic_set *bset)
2325 struct isl_basic_map *bmap_domain;
2326 struct isl_dim *dim;
2331 isl_assert(set->ctx, isl_basic_map_compatible_domain(bmap, bset),
2334 bmap = isl_basic_map_extend_dim(bmap, isl_dim_copy(bmap->dim),
2335 bset->n_div, bset->n_eq, bset->n_ineq);
2338 dim = isl_dim_reverse(isl_dim_copy(bset->dim));
2339 bmap_domain = isl_basic_map_from_basic_set(bset, dim);
2340 bmap = add_constraints(bmap, bmap_domain, 0, 0);
2342 bmap = isl_basic_map_simplify(bmap);
2343 return isl_basic_map_finalize(bmap);
2345 isl_basic_map_free(bmap);
2346 isl_basic_set_free(bset);
2350 struct isl_basic_map *isl_basic_map_intersect_range(
2351 struct isl_basic_map *bmap, struct isl_basic_set *bset)
2353 struct isl_basic_map *bmap_range;
2358 isl_assert(bset->ctx, isl_basic_map_compatible_range(bmap, bset),
2361 bmap = isl_basic_map_extend_dim(bmap, isl_dim_copy(bmap->dim),
2362 bset->n_div, bset->n_eq, bset->n_ineq);
2365 bmap_range = isl_basic_map_from_basic_set(bset, isl_dim_copy(bset->dim));
2366 bmap = add_constraints(bmap, bmap_range, 0, 0);
2368 bmap = isl_basic_map_simplify(bmap);
2369 return isl_basic_map_finalize(bmap);
2371 isl_basic_map_free(bmap);
2372 isl_basic_set_free(bset);
2376 struct isl_basic_map *isl_basic_map_intersect(
2377 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2379 if (!bmap1 || !bmap2)
2382 isl_assert(map1->ctx, isl_dim_equal(bmap1->dim, bmap2->dim), goto error);
2384 bmap1 = isl_basic_map_extend_dim(bmap1, isl_dim_copy(bmap1->dim),
2385 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
2388 bmap1 = add_constraints(bmap1, bmap2, 0, 0);
2390 bmap1 = isl_basic_map_simplify(bmap1);
2391 return isl_basic_map_finalize(bmap1);
2393 isl_basic_map_free(bmap1);
2394 isl_basic_map_free(bmap2);
2398 struct isl_basic_set *isl_basic_set_intersect(
2399 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
2401 return (struct isl_basic_set *)
2402 isl_basic_map_intersect(
2403 (struct isl_basic_map *)bset1,
2404 (struct isl_basic_map *)bset2);
2407 struct isl_map *isl_map_intersect(struct isl_map *map1, struct isl_map *map2)
2410 struct isl_map *result;
2416 if (F_ISSET(map1, ISL_MAP_DISJOINT) &&
2417 F_ISSET(map2, ISL_MAP_DISJOINT))
2418 FL_SET(flags, ISL_MAP_DISJOINT);
2420 result = isl_map_alloc_dim(isl_dim_copy(map1->dim),
2421 map1->n * map2->n, flags);
2424 for (i = 0; i < map1->n; ++i)
2425 for (j = 0; j < map2->n; ++j) {
2426 struct isl_basic_map *part;
2427 part = isl_basic_map_intersect(
2428 isl_basic_map_copy(map1->p[i]),
2429 isl_basic_map_copy(map2->p[j]));
2430 if (isl_basic_map_is_empty(part))
2431 isl_basic_map_free(part);
2433 result = isl_map_add(result, part);
2446 struct isl_set *isl_set_intersect(struct isl_set *set1, struct isl_set *set2)
2448 return (struct isl_set *)
2449 isl_map_intersect((struct isl_map *)set1,
2450 (struct isl_map *)set2);
2453 struct isl_basic_map *isl_basic_map_reverse(struct isl_basic_map *bmap)
2455 struct isl_dim *dim;
2456 struct isl_basic_set *bset;
2461 bmap = isl_basic_map_cow(bmap);
2464 dim = isl_dim_reverse(isl_dim_copy(bmap->dim));
2465 in = isl_basic_map_n_in(bmap);
2466 bset = isl_basic_set_from_basic_map(bmap);
2467 bset = isl_basic_set_swap_vars(bset, in);
2468 return isl_basic_map_from_basic_set(bset, dim);
2471 /* Turn final n dimensions into existentially quantified variables.
2473 struct isl_basic_set *isl_basic_set_project_out(
2474 struct isl_basic_set *bset, unsigned n, unsigned flags)
2484 isl_assert(bset->ctx, n <= isl_basic_set_n_dim(bset), goto error);
2489 bset = isl_basic_set_cow(bset);
2491 row_size = 1 + isl_dim_total(bset->dim) + bset->extra;
2492 old = bset->block2.data;
2493 bset->block2 = isl_blk_extend(bset->ctx, bset->block2,
2494 (bset->extra + n) * (1 + row_size));
2495 if (!bset->block2.data)
2497 new_div = isl_alloc_array(ctx, isl_int *, bset->extra + n);
2500 for (i = 0; i < n; ++i) {
2501 new_div[i] = bset->block2.data +
2502 (bset->extra + i) * (1 + row_size);
2503 isl_seq_clr(new_div[i], 1 + row_size);
2505 for (i = 0; i < bset->extra; ++i)
2506 new_div[n + i] = bset->block2.data + (bset->div[i] - old);
2508 bset->div = new_div;
2511 bset->dim = isl_dim_drop_outputs(bset->dim,
2512 isl_basic_set_n_dim(bset) - n, n);
2515 bset = isl_basic_set_simplify(bset);
2516 return isl_basic_set_finalize(bset);
2518 isl_basic_set_free(bset);
2522 struct isl_basic_map *add_divs(struct isl_basic_map *bmap, unsigned n)
2526 for (i = 0; i < n; ++i) {
2527 j = isl_basic_map_alloc_div(bmap);
2530 isl_seq_clr(bmap->div[j], 1+1+isl_basic_map_total_dim(bmap));
2534 isl_basic_map_free(bmap);
2538 struct isl_basic_map *isl_basic_map_apply_range(
2539 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2541 struct isl_dim *dim_result = NULL;
2542 struct isl_basic_map *bmap;
2543 unsigned n_in, n_out, n, nparam, total, pos;
2544 struct isl_dim_map *dim_map1, *dim_map2;
2546 if (!bmap1 || !bmap2)
2549 dim_result = isl_dim_join(isl_dim_copy(bmap1->dim),
2550 isl_dim_copy(bmap2->dim));
2552 n_in = isl_basic_map_n_in(bmap1);
2553 n_out = isl_basic_map_n_out(bmap2);
2554 n = isl_basic_map_n_out(bmap1);
2555 nparam = isl_basic_map_n_param(bmap1);
2557 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + n;
2558 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
2559 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
2560 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
2561 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
2562 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
2563 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_in);
2564 isl_dim_map_div(dim_map1, bmap1, pos += n_out);
2565 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
2566 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
2567 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
2569 bmap = isl_basic_map_alloc_dim(dim_result,
2570 bmap1->n_div + bmap2->n_div + n,
2571 bmap1->n_eq + bmap2->n_eq,
2572 bmap1->n_ineq + bmap2->n_ineq);
2573 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
2574 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
2575 bmap = add_divs(bmap, n);
2576 bmap = isl_basic_map_simplify(bmap);
2577 return isl_basic_map_finalize(bmap);
2579 isl_basic_map_free(bmap1);
2580 isl_basic_map_free(bmap2);
2584 struct isl_basic_set *isl_basic_set_apply(
2585 struct isl_basic_set *bset, struct isl_basic_map *bmap)
2590 isl_assert(set->ctx, isl_basic_map_compatible_domain(bmap, bset),
2593 return (struct isl_basic_set *)
2594 isl_basic_map_apply_range((struct isl_basic_map *)bset, bmap);
2596 isl_basic_set_free(bset);
2597 isl_basic_map_free(bmap);
2601 struct isl_basic_map *isl_basic_map_apply_domain(
2602 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2604 if (!bmap1 || !bmap2)
2608 isl_basic_map_n_in(bmap1) == isl_basic_map_n_in(bmap2), goto error);
2610 isl_basic_map_n_param(bmap1) == isl_basic_map_n_param(bmap2),
2613 bmap1 = isl_basic_map_reverse(bmap1);
2614 bmap1 = isl_basic_map_apply_range(bmap1, bmap2);
2615 return isl_basic_map_reverse(bmap1);
2617 isl_basic_map_free(bmap1);
2618 isl_basic_map_free(bmap2);
2622 static struct isl_basic_map *var_equal(struct isl_ctx *ctx,
2623 struct isl_basic_map *bmap, unsigned pos)
2629 i = isl_basic_map_alloc_equality(bmap);
2632 nparam = isl_basic_map_n_param(bmap);
2633 n_in = isl_basic_map_n_in(bmap);
2634 isl_seq_clr(bmap->eq[i], 1 + isl_basic_map_total_dim(bmap));
2635 isl_int_set_si(bmap->eq[i][1+nparam+pos], -1);
2636 isl_int_set_si(bmap->eq[i][1+nparam+n_in+pos], 1);
2637 return isl_basic_map_finalize(bmap);
2639 isl_basic_map_free(bmap);
2643 static struct isl_basic_map *var_more(struct isl_ctx *ctx,
2644 struct isl_basic_map *bmap, unsigned pos)
2650 i = isl_basic_map_alloc_inequality(bmap);
2653 nparam = isl_basic_map_n_param(bmap);
2654 n_in = isl_basic_map_n_in(bmap);
2655 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
2656 isl_int_set_si(bmap->ineq[i][0], -1);
2657 isl_int_set_si(bmap->ineq[i][1+nparam+pos], -1);
2658 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], 1);
2659 return isl_basic_map_finalize(bmap);
2661 isl_basic_map_free(bmap);
2665 static struct isl_basic_map *var_less(struct isl_ctx *ctx,
2666 struct isl_basic_map *bmap, unsigned pos)
2672 i = isl_basic_map_alloc_inequality(bmap);
2675 nparam = isl_basic_map_n_param(bmap);
2676 n_in = isl_basic_map_n_in(bmap);
2677 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
2678 isl_int_set_si(bmap->ineq[i][0], -1);
2679 isl_int_set_si(bmap->ineq[i][1+nparam+pos], 1);
2680 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], -1);
2681 return isl_basic_map_finalize(bmap);
2683 isl_basic_map_free(bmap);
2687 struct isl_basic_map *isl_basic_map_equal(struct isl_ctx *ctx,
2688 unsigned nparam, unsigned in, unsigned out, unsigned n_equal)
2691 struct isl_basic_map *bmap;
2692 bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, n_equal, 0);
2695 for (i = 0; i < n_equal && bmap; ++i)
2696 bmap = var_equal(ctx, bmap, i);
2697 return isl_basic_map_finalize(bmap);
2700 struct isl_basic_map *isl_basic_map_less_at(struct isl_ctx *ctx,
2701 unsigned nparam, unsigned in, unsigned out, unsigned pos)
2704 struct isl_basic_map *bmap;
2705 bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, pos, 1);
2708 for (i = 0; i < pos && bmap; ++i)
2709 bmap = var_equal(ctx, bmap, i);
2711 bmap = var_less(ctx, bmap, pos);
2712 return isl_basic_map_finalize(bmap);
2715 struct isl_basic_map *isl_basic_map_more_at(struct isl_ctx *ctx,
2716 unsigned nparam, unsigned in, unsigned out, unsigned pos)
2719 struct isl_basic_map *bmap;
2720 bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, pos, 1);
2723 for (i = 0; i < pos && bmap; ++i)
2724 bmap = var_equal(ctx, bmap, i);
2726 bmap = var_more(ctx, bmap, pos);
2727 return isl_basic_map_finalize(bmap);
2730 struct isl_basic_map *isl_basic_map_from_basic_set(
2731 struct isl_basic_set *bset, struct isl_dim *dim)
2733 struct isl_basic_map *bmap;
2735 bset = isl_basic_set_cow(bset);
2739 isl_assert(bset->ctx, isl_dim_compatible(bset->dim, dim), goto error);
2740 isl_dim_free(bset->dim);
2741 bmap = (struct isl_basic_map *) bset;
2743 return isl_basic_map_finalize(bmap);
2745 isl_basic_set_free(bset);
2750 struct isl_basic_set *isl_basic_set_from_basic_map(struct isl_basic_map *bmap)
2754 if (bmap->dim->n_in == 0)
2755 return (struct isl_basic_set *)bmap;
2756 bmap = isl_basic_map_cow(bmap);
2759 bmap->dim = isl_dim_cow(bmap->dim);
2762 bmap->dim->n_out += bmap->dim->n_in;
2763 bmap->dim->n_in = 0;
2764 bmap = isl_basic_map_finalize(bmap);
2765 return (struct isl_basic_set *)bmap;
2767 isl_basic_map_free(bmap);
2771 /* For a div d = floor(f/m), add the constraints
2774 * -(f-(n-1)) + m d >= 0
2776 * Note that the second constraint is the negation of
2780 static int add_div_constraints(struct isl_basic_map *bmap, unsigned div)
2783 unsigned total = isl_basic_map_total_dim(bmap);
2784 unsigned div_pos = 1 + total - bmap->n_div + div;
2786 i = isl_basic_map_alloc_inequality(bmap);
2789 isl_seq_cpy(bmap->ineq[i], bmap->div[div]+1, 1+total);
2790 isl_int_neg(bmap->ineq[i][div_pos], bmap->div[div][0]);
2792 j = isl_basic_map_alloc_inequality(bmap);
2795 isl_seq_neg(bmap->ineq[j], bmap->ineq[i], 1 + total);
2796 isl_int_add(bmap->ineq[j][0], bmap->ineq[j][0], bmap->ineq[j][div_pos]);
2797 isl_int_sub_ui(bmap->ineq[j][0], bmap->ineq[j][0], 1);
2801 struct isl_basic_set *isl_basic_map_underlying_set(
2802 struct isl_basic_map *bmap)
2806 if (bmap->dim->nparam == 0 && bmap->dim->n_in == 0 && bmap->n_div == 0)
2807 return (struct isl_basic_set *)bmap;
2808 bmap = isl_basic_map_cow(bmap);
2811 bmap->dim = isl_dim_cow(bmap->dim);
2814 bmap->dim->n_out += bmap->dim->nparam + bmap->dim->n_in + bmap->n_div;
2815 bmap->dim->nparam = 0;
2816 bmap->dim->n_in = 0;
2817 bmap->extra -= bmap->n_div;
2819 bmap = isl_basic_map_finalize(bmap);
2820 return (struct isl_basic_set *)bmap;
2825 struct isl_basic_map *isl_basic_map_overlying_set(
2826 struct isl_basic_set *bset, struct isl_basic_map *like)
2828 struct isl_basic_map *bmap;
2829 struct isl_ctx *ctx;
2836 isl_assert(ctx, bset->dim->n_out == isl_basic_map_total_dim(like),
2838 if (isl_dim_equal(bset->dim, like->dim) && like->n_div == 0) {
2839 isl_basic_map_free(like);
2840 return (struct isl_basic_map *)bset;
2842 bset = isl_basic_set_cow(bset);
2845 total = bset->dim->n_out + bset->extra;
2846 bmap = (struct isl_basic_map *)bset;
2847 isl_dim_free(bmap->dim);
2848 bmap->dim = isl_dim_copy(like->dim);
2851 bmap->extra += like->n_div;
2854 ltotal = total - bmap->extra + like->extra;
2857 bmap->block2 = isl_blk_extend(ctx, bmap->block2,
2858 bmap->extra * (1 + 1 + total));
2859 if (isl_blk_is_error(bmap->block2))
2861 bmap->div = isl_realloc_array(ctx, bmap->div, isl_int *,
2865 bmap = isl_basic_map_extend_constraints(bmap,
2866 0, 2 * like->n_div);
2867 for (i = 0; i < like->n_div; ++i) {
2868 k = isl_basic_map_alloc_div(bmap);
2871 isl_seq_cpy(bmap->div[k], like->div[i], 1 + 1 + ltotal);
2872 isl_seq_clr(bmap->div[k]+1+1+ltotal, total - ltotal);
2873 if (add_div_constraints(bmap, k) < 0)
2877 isl_basic_map_free(like);
2878 bmap = isl_basic_map_finalize(bmap);
2881 isl_basic_map_free(like);
2882 isl_basic_set_free(bset);
2886 struct isl_basic_set *isl_basic_set_from_underlying_set(
2887 struct isl_basic_set *bset, struct isl_basic_set *like)
2889 return (struct isl_basic_set *)
2890 isl_basic_map_overlying_set(bset, (struct isl_basic_map *)like);
2893 struct isl_set *isl_set_from_underlying_set(
2894 struct isl_set *set, struct isl_basic_set *like)
2900 isl_assert(set->ctx, set->dim->n_out == isl_basic_set_total_dim(like),
2902 if (isl_dim_equal(set->dim, like->dim) && like->n_div == 0) {
2903 isl_basic_set_free(like);
2906 set = isl_set_cow(set);
2909 for (i = 0; i < set->n; ++i) {
2910 set->p[i] = isl_basic_set_from_underlying_set(set->p[i],
2911 isl_basic_set_copy(like));
2915 isl_dim_free(set->dim);
2916 set->dim = isl_dim_copy(like->dim);
2919 isl_basic_set_free(like);
2922 isl_basic_set_free(like);
2927 struct isl_set *isl_map_underlying_set(struct isl_map *map)
2931 map = isl_map_align_divs(map);
2932 map = isl_map_cow(map);
2935 map->dim = isl_dim_cow(map->dim);
2939 for (i = 0; i < map->n; ++i) {
2940 map->p[i] = (struct isl_basic_map *)
2941 isl_basic_map_underlying_set(map->p[i]);
2946 map->dim->n_out += map->dim->nparam + map->dim->n_in;
2948 map->dim->n_out = map->p[0]->dim->n_out;
2949 map->dim->nparam = 0;
2951 return (struct isl_set *)map;
2957 struct isl_set *isl_set_to_underlying_set(struct isl_set *set)
2959 return (struct isl_set *)isl_map_underlying_set((struct isl_map *)set);
2962 struct isl_basic_set *isl_basic_map_domain(struct isl_basic_map *bmap)
2964 struct isl_basic_set *domain;
2968 n_out = isl_basic_map_n_out(bmap);
2969 domain = isl_basic_set_from_basic_map(bmap);
2970 return isl_basic_set_project_out(domain, n_out, 0);
2973 struct isl_basic_set *isl_basic_map_range(struct isl_basic_map *bmap)
2975 return isl_basic_map_domain(isl_basic_map_reverse(bmap));
2978 struct isl_set *isl_map_range(struct isl_map *map)
2981 struct isl_set *set;
2985 map = isl_map_cow(map);
2989 set = (struct isl_set *) map;
2990 if (set->dim->n_in != 0) {
2991 set->dim = isl_dim_drop_inputs(set->dim, 0, set->dim->n_in);
2995 for (i = 0; i < map->n; ++i) {
2996 set->p[i] = isl_basic_map_range(map->p[i]);
3000 F_CLR(set, ISL_MAP_DISJOINT);
3001 F_CLR(set, ISL_SET_NORMALIZED);
3008 struct isl_map *isl_map_from_set(struct isl_set *set, struct isl_dim *dim)
3011 struct isl_map *map = NULL;
3013 set = isl_set_cow(set);
3016 isl_assert(set->ctx, isl_dim_compatible(set->dim, dim), goto error);
3017 map = (struct isl_map *)set;
3018 for (i = 0; i < set->n; ++i) {
3019 map->p[i] = isl_basic_map_from_basic_set(
3020 set->p[i], isl_dim_copy(dim));
3024 isl_dim_free(map->dim);
3033 struct isl_set *isl_set_from_map(struct isl_map *map)
3036 struct isl_set *set = NULL;
3040 map = isl_map_cow(map);
3043 map->dim = isl_dim_cow(map->dim);
3046 map->dim->n_out += map->dim->n_in;
3048 set = (struct isl_set *)map;
3049 for (i = 0; i < map->n; ++i) {
3050 set->p[i] = isl_basic_set_from_basic_map(map->p[i]);
3060 struct isl_map *isl_map_alloc_dim(struct isl_dim *dim, int n, unsigned flags)
3062 struct isl_map *map;
3066 isl_assert(dim->ctx, n >= 0, return NULL);
3067 map = isl_alloc(dim->ctx, struct isl_map,
3068 sizeof(struct isl_map) +
3069 n * sizeof(struct isl_basic_map *));
3073 map->ctx = dim->ctx;
3074 isl_ctx_ref(map->ctx);
3086 struct isl_map *isl_map_alloc(struct isl_ctx *ctx,
3087 unsigned nparam, unsigned in, unsigned out, int n,
3090 struct isl_map *map;
3091 struct isl_dim *dims;
3093 dims = isl_dim_alloc(ctx, nparam, in, out);
3097 map = isl_map_alloc_dim(dims, n, flags);
3101 struct isl_basic_map *isl_basic_map_empty(struct isl_ctx *ctx,
3102 unsigned nparam, unsigned in, unsigned out)
3104 struct isl_basic_map *bmap;
3105 bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, 1, 0);
3106 bmap = isl_basic_map_set_to_empty(bmap);
3110 struct isl_basic_set *isl_basic_set_empty(struct isl_dim *dim)
3112 struct isl_basic_set *bset;
3113 bset = isl_basic_set_alloc_dim(dim, 0, 1, 0);
3114 bset = isl_basic_set_set_to_empty(bset);
3118 struct isl_basic_map *isl_basic_map_empty_like(struct isl_basic_map *model)
3120 struct isl_basic_map *bmap;
3123 bmap = isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
3124 bmap = isl_basic_map_set_to_empty(bmap);
3128 struct isl_basic_map *isl_basic_map_empty_like_map(struct isl_map *model)
3130 struct isl_basic_map *bmap;
3133 bmap = isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
3134 bmap = isl_basic_map_set_to_empty(bmap);
3138 struct isl_basic_set *isl_basic_set_empty_like(struct isl_basic_set *model)
3140 struct isl_basic_set *bset;
3143 bset = isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
3144 bset = isl_basic_set_set_to_empty(bset);
3148 struct isl_basic_map *isl_basic_map_universe(struct isl_dim *dim)
3150 struct isl_basic_map *bmap;
3151 bmap = isl_basic_map_alloc_dim(dim, 0, 0, 0);
3155 struct isl_basic_set *isl_basic_set_universe(struct isl_dim *dim)
3157 struct isl_basic_set *bset;
3158 bset = isl_basic_set_alloc_dim(dim, 0, 0, 0);
3162 struct isl_basic_set *isl_basic_set_universe_like(struct isl_basic_set *model)
3166 return isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
3169 struct isl_map *isl_map_empty(struct isl_ctx *ctx,
3170 unsigned nparam, unsigned in, unsigned out)
3172 return isl_map_alloc(ctx, nparam, in, out, 0, ISL_MAP_DISJOINT);
3175 struct isl_map *isl_map_empty_like_basic_map(struct isl_basic_map *model)
3179 return isl_map_alloc_dim(isl_dim_copy(model->dim), 0, ISL_MAP_DISJOINT);
3182 struct isl_set *isl_set_empty(struct isl_dim *dim)
3184 return isl_set_alloc_dim(dim, 0, ISL_MAP_DISJOINT);
3187 struct isl_set *isl_set_empty_like(struct isl_set *model)
3191 return isl_set_empty(isl_dim_copy(model->dim));
3194 struct isl_map *isl_map_dup(struct isl_map *map)
3197 struct isl_map *dup;
3201 dup = isl_map_alloc_dim(isl_dim_copy(map->dim), map->n, map->flags);
3202 for (i = 0; i < map->n; ++i)
3203 dup = isl_map_add(dup, isl_basic_map_copy(map->p[i]));
3207 struct isl_map *isl_map_add(struct isl_map *map, struct isl_basic_map *bmap)
3211 isl_assert(map->ctx, isl_dim_equal(map->dim, bmap->dim), goto error);
3212 isl_assert(map->ctx, map->n < map->size, goto error);
3213 map->p[map->n] = bmap;
3215 F_CLR(map, ISL_MAP_NORMALIZED);
3221 isl_basic_map_free(bmap);
3225 void isl_map_free(struct isl_map *map)
3235 isl_ctx_deref(map->ctx);
3236 for (i = 0; i < map->n; ++i)
3237 isl_basic_map_free(map->p[i]);
3238 isl_dim_free(map->dim);
3242 struct isl_map *isl_map_extend(struct isl_map *base,
3243 unsigned nparam, unsigned n_in, unsigned n_out)
3247 base = isl_map_cow(base);
3251 base->dim = isl_dim_extend(base->dim, nparam, n_in, n_out);
3254 for (i = 0; i < base->n; ++i) {
3255 base->p[i] = isl_basic_map_extend_dim(base->p[i],
3256 isl_dim_copy(base->dim), 0, 0, 0);
3266 struct isl_set *isl_set_extend(struct isl_set *base,
3267 unsigned nparam, unsigned dim)
3269 return (struct isl_set *)isl_map_extend((struct isl_map *)base,
3273 static struct isl_basic_map *isl_basic_map_fix_var(struct isl_basic_map *bmap,
3274 unsigned var, int value)
3278 bmap = isl_basic_map_cow(bmap);
3279 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
3280 j = isl_basic_map_alloc_equality(bmap);
3283 isl_seq_clr(bmap->eq[j], 1 + isl_basic_map_total_dim(bmap));
3284 isl_int_set_si(bmap->eq[j][1 + var], -1);
3285 isl_int_set_si(bmap->eq[j][0], value);
3286 bmap = isl_basic_map_simplify(bmap);
3287 return isl_basic_map_finalize(bmap);
3289 isl_basic_map_free(bmap);
3293 struct isl_basic_map *isl_basic_map_fix_input_si(struct isl_basic_map *bmap,
3294 unsigned input, int value)
3298 isl_assert(bmap->ctx, input < isl_basic_map_n_in(bmap), goto error);
3299 return isl_basic_map_fix_var(bmap, isl_basic_map_n_param(bmap) + input,
3302 isl_basic_map_free(bmap);
3306 struct isl_basic_set *isl_basic_set_fix_dim_si(struct isl_basic_set *bset,
3307 unsigned dim, int value)
3311 isl_assert(bset->ctx, dim < isl_basic_set_n_dim(bset), goto error);
3312 return (struct isl_basic_set *)
3313 isl_basic_map_fix_var((struct isl_basic_map *)bset,
3314 isl_basic_set_n_param(bset) + dim, value);
3316 isl_basic_set_free(bset);
3320 struct isl_map *isl_map_fix_input_si(struct isl_map *map,
3321 unsigned input, int value)
3325 map = isl_map_cow(map);
3329 isl_assert(ctx, input < isl_map_n_in(map), goto error);
3330 for (i = 0; i < map->n; ++i) {
3331 map->p[i] = isl_basic_map_fix_input_si(map->p[i], input, value);
3335 F_CLR(map, ISL_MAP_NORMALIZED);
3342 struct isl_set *isl_set_fix_dim_si(struct isl_set *set, unsigned dim, int value)
3346 set = isl_set_cow(set);
3350 isl_assert(set->ctx, dim < isl_set_n_dim(set), goto error);
3351 for (i = 0; i < set->n; ++i) {
3352 set->p[i] = isl_basic_set_fix_dim_si(set->p[i], dim, value);
3362 struct isl_basic_set *isl_basic_set_lower_bound_dim(struct isl_basic_set *bset,
3363 unsigned dim, isl_int value)
3368 bset = isl_basic_set_cow(bset);
3369 bset = isl_basic_set_extend_constraints(bset, 0, 1);
3370 j = isl_basic_set_alloc_inequality(bset);
3373 isl_seq_clr(bset->ineq[j], 1 + isl_basic_set_total_dim(bset));
3374 isl_int_set_si(bset->ineq[j][1 + isl_basic_set_n_param(bset) + dim], 1);
3375 isl_int_neg(bset->ineq[j][0], value);
3376 bset = isl_basic_set_simplify(bset);
3377 return isl_basic_set_finalize(bset);
3379 isl_basic_set_free(bset);
3383 struct isl_set *isl_set_lower_bound_dim(struct isl_set *set, unsigned dim,
3388 set = isl_set_cow(set);
3392 isl_assert(set->ctx, dim < isl_set_n_dim(set), goto error);
3393 for (i = 0; i < set->n; ++i) {
3394 set->p[i] = isl_basic_set_lower_bound_dim(set->p[i], dim, value);
3404 struct isl_map *isl_map_reverse(struct isl_map *map)
3409 map = isl_map_cow(map);
3413 map->dim = isl_dim_reverse(map->dim);
3416 for (i = 0; i < map->n; ++i) {
3417 map->p[i] = isl_basic_map_reverse(map->p[i]);
3421 F_CLR(map, ISL_MAP_NORMALIZED);
3428 struct isl_map *isl_basic_map_lexmax(
3429 struct isl_basic_map *bmap, struct isl_basic_set *dom,
3430 struct isl_set **empty)
3432 return isl_pip_basic_map_lexmax(bmap, dom, empty);
3435 struct isl_map *isl_basic_map_lexmin(
3436 struct isl_basic_map *bmap, struct isl_basic_set *dom,
3437 struct isl_set **empty)
3439 return isl_pip_basic_map_lexmin(bmap, dom, empty);
3442 struct isl_set *isl_basic_set_lexmin(struct isl_basic_set *bset)
3444 struct isl_basic_map *bmap = NULL;
3445 struct isl_basic_set *dom = NULL;
3446 struct isl_map *min;
3447 struct isl_dim *param_dim;
3451 bmap = isl_basic_map_from_basic_set(bset, isl_dim_copy(bset->dim));
3454 param_dim = isl_dim_domain(isl_dim_copy(bmap->dim));
3455 dom = isl_basic_set_universe(param_dim);
3458 min = isl_basic_map_lexmin(bmap, dom, NULL);
3459 return isl_map_range(min);
3461 isl_basic_map_free(bmap);
3465 struct isl_map *isl_basic_map_compute_divs(struct isl_basic_map *bmap)
3469 if (bmap->n_div == 0)
3470 return isl_map_from_basic_map(bmap);
3471 return isl_pip_basic_map_compute_divs(bmap);
3474 struct isl_map *isl_map_compute_divs(struct isl_map *map)
3477 struct isl_map *res;
3483 res = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[0]));
3484 for (i = 1 ; i < map->n; ++i) {
3486 r2 = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[i]));
3487 if (F_ISSET(map, ISL_MAP_DISJOINT))
3488 res = isl_map_union_disjoint(res, r2);
3490 res = isl_map_union(res, r2);
3497 struct isl_set *isl_basic_set_compute_divs(struct isl_basic_set *bset)
3499 return (struct isl_set *)
3500 isl_basic_map_compute_divs((struct isl_basic_map *)bset);
3503 struct isl_set *isl_set_compute_divs(struct isl_set *set)
3505 return (struct isl_set *)
3506 isl_map_compute_divs((struct isl_map *)set);
3509 struct isl_set *isl_map_domain(struct isl_map *map)
3512 struct isl_set *set;
3517 map = isl_map_cow(map);
3521 set = (struct isl_set *)map;
3522 set->dim = isl_dim_domain(set->dim);
3525 for (i = 0; i < map->n; ++i) {
3526 set->p[i] = isl_basic_map_domain(map->p[i]);
3530 F_CLR(set, ISL_MAP_DISJOINT);
3531 F_CLR(set, ISL_SET_NORMALIZED);
3538 struct isl_map *isl_map_union_disjoint(
3539 struct isl_map *map1, struct isl_map *map2)
3543 struct isl_map *map = NULL;
3557 isl_assert(map1->ctx, isl_dim_equal(map1->dim, map2->dim), goto error);
3559 if (F_ISSET(map1, ISL_MAP_DISJOINT) &&
3560 F_ISSET(map2, ISL_MAP_DISJOINT))
3561 FL_SET(flags, ISL_MAP_DISJOINT);
3563 map = isl_map_alloc_dim(isl_dim_copy(map1->dim),
3564 map1->n + map2->n, flags);
3567 for (i = 0; i < map1->n; ++i) {
3568 map = isl_map_add(map,
3569 isl_basic_map_copy(map1->p[i]));
3573 for (i = 0; i < map2->n; ++i) {
3574 map = isl_map_add(map,
3575 isl_basic_map_copy(map2->p[i]));
3589 struct isl_map *isl_map_union(struct isl_map *map1, struct isl_map *map2)
3591 map1 = isl_map_union_disjoint(map1, map2);
3595 F_CLR(map1, ISL_MAP_DISJOINT);
3599 struct isl_set *isl_set_union_disjoint(
3600 struct isl_set *set1, struct isl_set *set2)
3602 return (struct isl_set *)
3603 isl_map_union_disjoint(
3604 (struct isl_map *)set1, (struct isl_map *)set2);
3607 struct isl_set *isl_set_union(struct isl_set *set1, struct isl_set *set2)
3609 return (struct isl_set *)
3610 isl_map_union((struct isl_map *)set1, (struct isl_map *)set2);
3613 struct isl_map *isl_map_intersect_range(
3614 struct isl_map *map, struct isl_set *set)
3617 struct isl_map *result;
3623 if (F_ISSET(map, ISL_MAP_DISJOINT) &&
3624 F_ISSET(set, ISL_MAP_DISJOINT))
3625 FL_SET(flags, ISL_MAP_DISJOINT);
3627 result = isl_map_alloc_dim(isl_dim_copy(map->dim),
3628 map->n * set->n, flags);
3631 for (i = 0; i < map->n; ++i)
3632 for (j = 0; j < set->n; ++j) {
3633 result = isl_map_add(result,
3634 isl_basic_map_intersect_range(
3635 isl_basic_map_copy(map->p[i]),
3636 isl_basic_set_copy(set->p[j])));
3649 struct isl_map *isl_map_intersect_domain(
3650 struct isl_map *map, struct isl_set *set)
3652 return isl_map_reverse(
3653 isl_map_intersect_range(isl_map_reverse(map), set));
3656 struct isl_map *isl_map_apply_domain(
3657 struct isl_map *map1, struct isl_map *map2)
3661 map1 = isl_map_reverse(map1);
3662 map1 = isl_map_apply_range(map1, map2);
3663 return isl_map_reverse(map1);
3670 struct isl_map *isl_map_apply_range(
3671 struct isl_map *map1, struct isl_map *map2)
3673 struct isl_dim *dim_result;
3674 struct isl_map *result;
3683 dim_result = isl_dim_join(isl_dim_copy(map1->dim),
3684 isl_dim_copy(map2->dim));
3686 result = isl_map_alloc_dim(dim_result, map1->n * map2->n, 0);
3689 for (i = 0; i < map1->n; ++i)
3690 for (j = 0; j < map2->n; ++j) {
3691 result = isl_map_add(result,
3692 isl_basic_map_apply_range(
3693 isl_basic_map_copy(map1->p[i]),
3694 isl_basic_map_copy(map2->p[j])));
3700 if (result && result->n <= 1)
3701 F_SET(result, ISL_MAP_DISJOINT);
3710 * returns range - domain
3712 struct isl_basic_set *isl_basic_map_deltas(struct isl_basic_map *bmap)
3714 struct isl_basic_set *bset;
3721 dim = isl_basic_map_n_in(bmap);
3722 nparam = isl_basic_map_n_param(bmap);
3723 isl_assert(bmap->ctx, dim == isl_basic_map_n_out(bmap), goto error);
3724 bset = isl_basic_set_from_basic_map(bmap);
3725 bset = isl_basic_set_extend(bset, nparam, 3*dim, 0, dim, 0);
3726 bset = isl_basic_set_swap_vars(bset, 2*dim);
3727 for (i = 0; i < dim; ++i) {
3728 int j = isl_basic_map_alloc_equality(
3729 (struct isl_basic_map *)bset);
3732 isl_seq_clr(bset->eq[j], 1 + isl_basic_set_total_dim(bset));
3733 isl_int_set_si(bset->eq[j][1+nparam+i], 1);
3734 isl_int_set_si(bset->eq[j][1+nparam+dim+i], 1);
3735 isl_int_set_si(bset->eq[j][1+nparam+2*dim+i], -1);
3737 return isl_basic_set_project_out(bset, 2*dim, 0);
3739 isl_basic_map_free(bmap);
3744 * returns range - domain
3746 struct isl_set *isl_map_deltas(struct isl_map *map)
3749 struct isl_set *result;
3754 isl_assert(map->ctx, isl_map_n_in(map) == isl_map_n_out(map), goto error);
3755 result = isl_set_alloc(map->ctx, isl_map_n_param(map),
3756 isl_map_n_in(map), map->n, map->flags);
3759 for (i = 0; i < map->n; ++i)
3760 result = isl_set_add(result,
3761 isl_basic_map_deltas(isl_basic_map_copy(map->p[i])));
3769 /* If the only constraints a div d=floor(f/m)
3770 * appears in are its two defining constraints
3773 * -(f - (m - 1)) + m d >= 0
3775 * then it can safely be removed.
3777 static int div_is_redundant(struct isl_basic_map *bmap, int div)
3780 unsigned pos = 1 + isl_dim_total(bmap->dim) + div;
3782 for (i = 0; i < bmap->n_eq; ++i)
3783 if (!isl_int_is_zero(bmap->eq[i][pos]))
3786 for (i = 0; i < bmap->n_ineq; ++i) {
3787 if (isl_int_is_zero(bmap->ineq[i][pos]))
3789 if (isl_int_eq(bmap->ineq[i][pos], bmap->div[div][0])) {
3791 isl_int_sub(bmap->div[div][1],
3792 bmap->div[div][1], bmap->div[div][0]);
3793 isl_int_add_ui(bmap->div[div][1], bmap->div[div][1], 1);
3794 neg = isl_seq_is_neg(bmap->ineq[i], bmap->div[div]+1, pos);
3795 isl_int_sub_ui(bmap->div[div][1], bmap->div[div][1], 1);
3796 isl_int_add(bmap->div[div][1],
3797 bmap->div[div][1], bmap->div[div][0]);
3800 if (isl_seq_first_non_zero(bmap->ineq[i]+pos+1,
3801 bmap->n_div-div-1) != -1)
3803 } else if (isl_int_abs_eq(bmap->ineq[i][pos], bmap->div[div][0])) {
3804 if (!isl_seq_eq(bmap->ineq[i], bmap->div[div]+1, pos))
3806 if (isl_seq_first_non_zero(bmap->ineq[i]+pos+1,
3807 bmap->n_div-div-1) != -1)
3813 for (i = 0; i < bmap->n_div; ++i)
3814 if (!isl_int_is_zero(bmap->div[i][1+pos]))
3821 * Remove divs that don't occur in any of the constraints or other divs.
3822 * These can arise when dropping some of the variables in a quast
3823 * returned by piplib.
3825 static struct isl_basic_map *remove_redundant_divs(struct isl_basic_map *bmap)
3832 for (i = bmap->n_div-1; i >= 0; --i) {
3833 if (!div_is_redundant(bmap, i))
3835 bmap = isl_basic_map_drop_div(bmap, i);
3840 struct isl_basic_map *isl_basic_map_finalize(struct isl_basic_map *bmap)
3842 bmap = remove_redundant_divs(bmap);
3845 F_SET(bmap, ISL_BASIC_SET_FINAL);
3849 struct isl_basic_set *isl_basic_set_finalize(struct isl_basic_set *bset)
3851 return (struct isl_basic_set *)
3852 isl_basic_map_finalize((struct isl_basic_map *)bset);
3855 struct isl_set *isl_set_finalize(struct isl_set *set)
3861 for (i = 0; i < set->n; ++i) {
3862 set->p[i] = isl_basic_set_finalize(set->p[i]);
3872 struct isl_map *isl_map_finalize(struct isl_map *map)
3878 for (i = 0; i < map->n; ++i) {
3879 map->p[i] = isl_basic_map_finalize(map->p[i]);
3883 F_CLR(map, ISL_MAP_NORMALIZED);
3890 static struct isl_basic_map *basic_map_identity(struct isl_dim *dims)
3892 struct isl_basic_map *bmap;
3900 nparam = dims->nparam;
3902 bmap = isl_basic_map_alloc_dim(dims, 0, dim, 0);
3906 for (i = 0; i < dim; ++i) {
3907 int j = isl_basic_map_alloc_equality(bmap);
3910 isl_seq_clr(bmap->eq[j], 1 + isl_basic_map_total_dim(bmap));
3911 isl_int_set_si(bmap->eq[j][1+nparam+i], 1);
3912 isl_int_set_si(bmap->eq[j][1+nparam+dim+i], -1);
3914 return isl_basic_map_finalize(bmap);
3916 isl_basic_map_free(bmap);
3920 struct isl_basic_map *isl_basic_map_identity(struct isl_dim *set_dim)
3922 struct isl_dim *dim = isl_dim_map(set_dim);
3925 return basic_map_identity(dim);
3928 struct isl_basic_map *isl_basic_map_identity_like(struct isl_basic_map *model)
3930 if (!model || !model->dim)
3932 isl_assert(model->ctx,
3933 model->dim->n_in == model->dim->n_out, return NULL);
3934 return basic_map_identity(isl_dim_copy(model->dim));
3937 static struct isl_map *map_identity(struct isl_dim *dim)
3939 struct isl_map *map = isl_map_alloc_dim(dim, 1, ISL_MAP_DISJOINT);
3940 return isl_map_add(map, basic_map_identity(isl_dim_copy(dim)));
3943 struct isl_map *isl_map_identity(struct isl_dim *set_dim)
3945 struct isl_dim *dim = isl_dim_map(set_dim);
3948 return map_identity(dim);
3951 struct isl_map *isl_map_identity_like(struct isl_basic_map *model)
3953 if (!model || !model->dim)
3955 isl_assert(model->ctx,
3956 model->dim->n_in == model->dim->n_out, return NULL);
3957 return map_identity(isl_dim_copy(model->dim));
3960 int isl_set_is_equal(struct isl_set *set1, struct isl_set *set2)
3962 return isl_map_is_equal((struct isl_map *)set1, (struct isl_map *)set2);
3965 int isl_set_is_subset(struct isl_set *set1, struct isl_set *set2)
3967 return isl_map_is_subset(
3968 (struct isl_map *)set1, (struct isl_map *)set2);
3971 int isl_basic_map_is_subset(
3972 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3975 struct isl_map *map1;
3976 struct isl_map *map2;
3978 if (!bmap1 || !bmap2)
3981 map1 = isl_map_from_basic_map(isl_basic_map_copy(bmap1));
3982 map2 = isl_map_from_basic_map(isl_basic_map_copy(bmap2));
3984 is_subset = isl_map_is_subset(map1, map2);
3992 int isl_basic_map_is_equal(
3993 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3997 if (!bmap1 || !bmap2)
3999 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
4002 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
4006 int isl_basic_set_is_equal(
4007 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
4009 return isl_basic_map_is_equal(
4010 (struct isl_basic_map *)bset1, (struct isl_basic_map *)bset2);
4013 int isl_map_is_empty(struct isl_map *map)
4020 for (i = 0; i < map->n; ++i) {
4021 is_empty = isl_basic_map_is_empty(map->p[i]);
4030 int isl_set_is_empty(struct isl_set *set)
4032 return isl_map_is_empty((struct isl_map *)set);
4035 int isl_map_is_subset(struct isl_map *map1, struct isl_map *map2)
4039 struct isl_map *diff;
4044 if (isl_map_is_empty(map1))
4047 if (isl_map_is_empty(map2))
4050 diff = isl_map_subtract(isl_map_copy(map1), isl_map_copy(map2));
4054 is_subset = isl_map_is_empty(diff);
4060 int isl_map_is_equal(struct isl_map *map1, struct isl_map *map2)
4066 is_subset = isl_map_is_subset(map1, map2);
4069 is_subset = isl_map_is_subset(map2, map1);
4073 int isl_basic_map_is_strict_subset(
4074 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
4078 if (!bmap1 || !bmap2)
4080 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
4083 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
4084 if (is_subset == -1)
4089 static int basic_map_contains(struct isl_basic_map *bmap, struct isl_vec *vec)
4095 total = 1 + isl_basic_map_total_dim(bmap);
4096 if (total != vec->size)
4101 for (i = 0; i < bmap->n_eq; ++i) {
4102 isl_seq_inner_product(vec->block.data, bmap->eq[i], total, &s);
4103 if (!isl_int_is_zero(s)) {
4109 for (i = 0; i < bmap->n_ineq; ++i) {
4110 isl_seq_inner_product(vec->block.data, bmap->ineq[i], total, &s);
4111 if (isl_int_is_neg(s)) {
4122 int isl_basic_map_is_universe(struct isl_basic_map *bmap)
4126 return bmap->n_eq == 0 && bmap->n_ineq == 0;
4129 int isl_basic_map_is_empty(struct isl_basic_map *bmap)
4131 struct isl_basic_set *bset = NULL;
4132 struct isl_vec *sample = NULL;
4139 if (F_ISSET(bmap, ISL_BASIC_MAP_EMPTY))
4142 if (F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL)) {
4143 struct isl_basic_map *copy = isl_basic_map_copy(bmap);
4144 copy = isl_basic_map_convex_hull(copy);
4145 empty = F_ISSET(copy, ISL_BASIC_MAP_EMPTY);
4146 isl_basic_map_free(copy);
4150 total = 1 + isl_basic_map_total_dim(bmap);
4151 if (bmap->sample && bmap->sample->size == total) {
4152 int contains = basic_map_contains(bmap, bmap->sample);
4158 bset = isl_basic_map_underlying_set(isl_basic_map_copy(bmap));
4161 sample = isl_basic_set_sample(bset);
4164 empty = sample->size == 0;
4166 isl_vec_free(bmap->ctx, bmap->sample);
4167 bmap->sample = sample;
4172 struct isl_map *isl_basic_map_union(
4173 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
4175 struct isl_map *map;
4176 if (!bmap1 || !bmap2)
4179 isl_assert(map1->ctx, isl_dim_equal(bmap1->dim, bmap2->dim), goto error);
4181 map = isl_map_alloc_dim(isl_dim_copy(bmap1->dim), 2, 0);
4184 map = isl_map_add(map, bmap1);
4185 map = isl_map_add(map, bmap2);
4188 isl_basic_map_free(bmap1);
4189 isl_basic_map_free(bmap2);
4193 struct isl_set *isl_basic_set_union(
4194 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
4196 return (struct isl_set *)isl_basic_map_union(
4197 (struct isl_basic_map *)bset1,
4198 (struct isl_basic_map *)bset2);
4201 /* Order divs such that any div only depends on previous divs */
4202 static struct isl_basic_map *order_divs(struct isl_basic_map *bmap)
4205 unsigned off = isl_dim_total(bmap->dim);
4207 for (i = 0; i < bmap->n_div; ++i) {
4209 pos = isl_seq_first_non_zero(bmap->div[i]+1+1+off+i,
4213 swap_div(bmap, i, pos);
4219 static int find_div(struct isl_basic_map *dst,
4220 struct isl_basic_map *src, unsigned div)
4224 unsigned total = isl_basic_map_total_dim(src);
4226 for (i = 0; i < dst->n_div; ++i)
4227 if (isl_seq_eq(dst->div[i], src->div[div], 1+1+total) &&
4228 isl_seq_first_non_zero(dst->div[i]+1+1+total,
4229 dst->n_div - src->n_div) == -1)
4234 struct isl_basic_map *isl_basic_map_align_divs(
4235 struct isl_basic_map *dst, struct isl_basic_map *src)
4238 unsigned total = isl_basic_map_total_dim(src);
4243 if (src->n_div == 0)
4246 src = order_divs(src);
4247 dst = isl_basic_map_extend_dim(dst, isl_dim_copy(dst->dim),
4248 src->n_div, 0, 2 * src->n_div);
4251 for (i = 0; i < src->n_div; ++i) {
4252 int j = find_div(dst, src, i);
4254 j = isl_basic_map_alloc_div(dst);
4257 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total);
4258 isl_seq_clr(dst->div[j]+1+1+total,
4259 dst->n_div - src->n_div);
4260 if (add_div_constraints(dst, j) < 0)
4264 swap_div(dst, i, j);
4268 isl_basic_map_free(dst);
4272 struct isl_basic_set *isl_basic_set_align_divs(
4273 struct isl_basic_set *dst, struct isl_basic_set *src)
4275 return (struct isl_basic_set *)isl_basic_map_align_divs(
4276 (struct isl_basic_map *)dst, (struct isl_basic_map *)src);
4279 struct isl_map *isl_map_align_divs(struct isl_map *map)
4283 map = isl_map_compute_divs(map);
4284 map = isl_map_cow(map);
4288 for (i = 1; i < map->n; ++i)
4289 map->p[0] = isl_basic_map_align_divs(map->p[0], map->p[i]);
4290 for (i = 1; i < map->n; ++i)
4291 map->p[i] = isl_basic_map_align_divs(map->p[i], map->p[0]);
4293 F_CLR(map, ISL_MAP_NORMALIZED);
4297 static struct isl_map *add_cut_constraint(struct isl_map *dst,
4298 struct isl_basic_map *src, isl_int *c,
4299 unsigned len, int oppose)
4301 struct isl_basic_map *copy = NULL;
4306 copy = isl_basic_map_copy(src);
4307 copy = isl_basic_map_cow(copy);
4310 copy = isl_basic_map_extend_constraints(copy, 0, 1);
4311 k = isl_basic_map_alloc_inequality(copy);
4315 isl_seq_neg(copy->ineq[k], c, len);
4317 isl_seq_cpy(copy->ineq[k], c, len);
4318 total = 1 + isl_basic_map_total_dim(copy);
4319 isl_seq_clr(copy->ineq[k]+len, total - len);
4320 isl_inequality_negate(copy, k);
4321 copy = isl_basic_map_simplify(copy);
4322 copy = isl_basic_map_finalize(copy);
4323 is_empty = isl_basic_map_is_empty(copy);
4327 dst = isl_map_add(dst, copy);
4329 isl_basic_map_free(copy);
4332 isl_basic_map_free(copy);
4337 static struct isl_map *subtract(struct isl_map *map, struct isl_basic_map *bmap)
4341 struct isl_map *rest = NULL;
4343 unsigned total = isl_basic_map_total_dim(bmap);
4350 if (F_ISSET(map, ISL_MAP_DISJOINT))
4351 FL_SET(flags, ISL_MAP_DISJOINT);
4353 max = map->n * (2 * bmap->n_eq + bmap->n_ineq);
4354 rest = isl_map_alloc_dim(isl_dim_copy(map->dim), max, flags);
4358 for (i = 0; i < map->n; ++i) {
4359 map->p[i] = isl_basic_map_align_divs(map->p[i], bmap);
4364 for (j = 0; j < map->n; ++j)
4365 map->p[j] = isl_basic_map_cow(map->p[j]);
4367 for (i = 0; i < bmap->n_eq; ++i) {
4368 for (j = 0; j < map->n; ++j) {
4369 rest = add_cut_constraint(rest,
4370 map->p[j], bmap->eq[i], 1+total, 0);
4374 rest = add_cut_constraint(rest,
4375 map->p[j], bmap->eq[i], 1+total, 1);
4379 map->p[j] = isl_basic_map_extend_constraints(map->p[j],
4383 k = isl_basic_map_alloc_equality(map->p[j]);
4386 isl_seq_cpy(map->p[j]->eq[k], bmap->eq[i], 1+total);
4387 isl_seq_clr(map->p[j]->eq[k]+1+total,
4388 map->p[j]->n_div - bmap->n_div);
4392 for (i = 0; i < bmap->n_ineq; ++i) {
4393 for (j = 0; j < map->n; ++j) {
4394 rest = add_cut_constraint(rest,
4395 map->p[j], bmap->ineq[i], 1+total, 0);
4399 map->p[j] = isl_basic_map_extend_constraints(map->p[j],
4403 k = isl_basic_map_alloc_inequality(map->p[j]);
4406 isl_seq_cpy(map->p[j]->ineq[k], bmap->ineq[i], 1+total);
4407 isl_seq_clr(map->p[j]->ineq[k]+1+total,
4408 map->p[j]->n_div - bmap->n_div);
4420 struct isl_map *isl_map_subtract(struct isl_map *map1, struct isl_map *map2)
4426 isl_assert(map1->ctx, isl_dim_equal(map1->dim, map2->dim), goto error);
4428 if (isl_map_is_empty(map2)) {
4433 map1 = isl_map_compute_divs(map1);
4434 map2 = isl_map_compute_divs(map2);
4438 for (i = 0; map1 && i < map2->n; ++i)
4439 map1 = subtract(map1, map2->p[i]);
4449 struct isl_set *isl_set_subtract(struct isl_set *set1, struct isl_set *set2)
4451 return (struct isl_set *)
4453 (struct isl_map *)set1, (struct isl_map *)set2);
4456 struct isl_set *isl_set_apply(struct isl_set *set, struct isl_map *map)
4460 isl_assert(set->ctx, isl_map_compatible_domain(map, set), goto error);
4461 map = isl_map_intersect_domain(map, set);
4462 set = isl_map_range(map);
4470 /* There is no need to cow as removing empty parts doesn't change
4471 * the meaning of the set.
4473 struct isl_map *isl_map_remove_empty_parts(struct isl_map *map)
4480 for (i = map->n-1; i >= 0; --i) {
4481 if (!F_ISSET(map->p[i], ISL_BASIC_MAP_EMPTY))
4483 isl_basic_map_free(map->p[i]);
4484 if (i != map->n-1) {
4485 F_CLR(map, ISL_MAP_NORMALIZED);
4486 map->p[i] = map->p[map->n-1];
4494 struct isl_set *isl_set_remove_empty_parts(struct isl_set *set)
4496 return (struct isl_set *)
4497 isl_map_remove_empty_parts((struct isl_map *)set);
4500 struct isl_basic_set *isl_set_copy_basic_set(struct isl_set *set)
4502 struct isl_basic_set *bset;
4503 if (!set || set->n == 0)
4505 bset = set->p[set->n-1];
4506 isl_assert(set->ctx, F_ISSET(bset, ISL_BASIC_SET_FINAL), return NULL);
4507 return isl_basic_set_copy(bset);
4510 struct isl_set *isl_set_drop_basic_set(struct isl_set *set,
4511 struct isl_basic_set *bset)
4517 for (i = set->n-1; i >= 0; --i) {
4518 if (set->p[i] != bset)
4520 set = isl_set_cow(set);
4523 isl_basic_set_free(set->p[i]);
4524 if (i != set->n-1) {
4525 F_CLR(set, ISL_SET_NORMALIZED);
4526 set->p[i] = set->p[set->n-1];
4531 isl_basic_set_free(bset);
4535 isl_basic_set_free(bset);
4539 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
4540 * for any common value of the parameters and dimensions preceding dim
4541 * in both basic sets, the values of dimension pos in bset1 are
4542 * smaller or larger than those in bset2.
4545 * 1 if bset1 follows bset2
4546 * -1 if bset1 precedes bset2
4547 * 0 if bset1 and bset2 are incomparable
4548 * -2 if some error occurred.
4550 int isl_basic_set_compare_at(struct isl_basic_set *bset1,
4551 struct isl_basic_set *bset2, int pos)
4553 struct isl_dim *dims;
4554 struct isl_basic_map *bmap1 = NULL;
4555 struct isl_basic_map *bmap2 = NULL;
4556 struct isl_ctx *ctx;
4557 struct isl_vec *obj;
4560 unsigned dim1, dim2;
4562 enum isl_lp_result res;
4565 if (!bset1 || !bset2)
4568 nparam = isl_basic_set_n_param(bset1);
4569 dim1 = isl_basic_set_n_dim(bset1);
4570 dim2 = isl_basic_set_n_dim(bset2);
4571 dims = isl_dim_alloc(bset1->ctx, nparam, pos, dim1 - pos);
4572 bmap1 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset1), dims);
4573 dims = isl_dim_alloc(bset2->ctx, nparam, pos, dim2 - pos);
4574 bmap2 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset2), dims);
4575 if (!bmap1 || !bmap2)
4577 bmap1 = isl_basic_map_extend(bmap1, nparam,
4578 pos, (dim1 - pos) + (dim2 - pos),
4579 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
4582 total = isl_basic_map_total_dim(bmap1);
4584 obj = isl_vec_alloc(ctx, total);
4585 isl_seq_clr(obj->block.data, total);
4586 isl_int_set_si(obj->block.data[nparam+pos], 1);
4587 isl_int_set_si(obj->block.data[nparam+pos+(dim1-pos)], -1);
4590 bmap1 = add_constraints(bmap1, bmap2, 0, dim1 - pos);
4593 res = isl_solve_lp(bmap1, 0, obj->block.data, ctx->one, &num, &den);
4594 if (res == isl_lp_empty)
4596 else if (res == isl_lp_ok && isl_int_is_pos(num))
4598 else if ((res == isl_lp_ok && isl_int_is_neg(num)) ||
4599 res == isl_lp_unbounded)
4605 isl_basic_map_free(bmap1);
4606 isl_vec_free(ctx, obj);
4609 isl_basic_map_free(bmap1);
4610 isl_basic_map_free(bmap2);
4614 static int isl_basic_map_fast_has_fixed_var(struct isl_basic_map *bmap,
4615 unsigned pos, isl_int *val)
4623 total = isl_basic_map_total_dim(bmap);
4624 for (i = 0, d = total-1; i < bmap->n_eq && d+1 > pos; ++i) {
4625 for (; d+1 > pos; --d)
4626 if (!isl_int_is_zero(bmap->eq[i][1+d]))
4630 if (isl_seq_first_non_zero(bmap->eq[i]+1, d) != -1)
4632 if (isl_seq_first_non_zero(bmap->eq[i]+1+d+1, total-d-1) != -1)
4634 if (!isl_int_is_one(bmap->eq[i][1+d]))
4637 isl_int_neg(*val, bmap->eq[i][0]);
4643 static int isl_map_fast_has_fixed_var(struct isl_map *map,
4644 unsigned pos, isl_int *val)
4656 return isl_basic_map_fast_has_fixed_var(map->p[0], pos, val);
4659 fixed = isl_basic_map_fast_has_fixed_var(map->p[0], pos, &v);
4660 for (i = 1; fixed == 1 && i < map->n; ++i) {
4661 fixed = isl_basic_map_fast_has_fixed_var(map->p[i], pos, &tmp);
4662 if (fixed == 1 && isl_int_ne(tmp, v))
4666 isl_int_set(*val, v);
4672 static int isl_set_fast_has_fixed_var(struct isl_set *set, unsigned pos,
4675 return isl_map_fast_has_fixed_var((struct isl_map *)set, pos, val);
4678 /* Check if dimension dim has fixed value and if so and if val is not NULL,
4679 * then return this fixed value in *val.
4681 int isl_set_fast_dim_is_fixed(struct isl_set *set, unsigned dim, isl_int *val)
4683 return isl_set_fast_has_fixed_var(set, isl_set_n_param(set) + dim, val);
4686 /* Check if input variable in has fixed value and if so and if val is not NULL,
4687 * then return this fixed value in *val.
4689 int isl_map_fast_input_is_fixed(struct isl_map *map, unsigned in, isl_int *val)
4691 return isl_map_fast_has_fixed_var(map, isl_map_n_param(map) + in, val);
4694 /* Check if dimension dim has an (obvious) fixed lower bound and if so
4695 * and if val is not NULL, then return this lower bound in *val.
4697 int isl_basic_set_fast_dim_has_fixed_lower_bound(struct isl_basic_set *bset,
4698 unsigned dim, isl_int *val)
4700 int i, i_eq = -1, i_ineq = -1;
4707 total = isl_basic_set_total_dim(bset);
4708 nparam = isl_basic_set_n_param(bset);
4709 for (i = 0; i < bset->n_eq; ++i) {
4710 if (isl_int_is_zero(bset->eq[i][1+nparam+dim]))
4716 for (i = 0; i < bset->n_ineq; ++i) {
4717 if (!isl_int_is_pos(bset->ineq[i][1+nparam+dim]))
4719 if (i_eq != -1 || i_ineq != -1)
4723 if (i_eq == -1 && i_ineq == -1)
4725 c = i_eq != -1 ? bset->eq[i_eq] : bset->ineq[i_ineq];
4726 /* The coefficient should always be one due to normalization. */
4727 if (!isl_int_is_one(c[1+nparam+dim]))
4729 if (isl_seq_first_non_zero(c+1, nparam+dim) != -1)
4731 if (isl_seq_first_non_zero(c+1+nparam+dim+1,
4732 total - nparam - dim - 1) != -1)
4735 isl_int_neg(*val, c[0]);
4739 int isl_set_fast_dim_has_fixed_lower_bound(struct isl_set *set,
4740 unsigned dim, isl_int *val)
4752 return isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[0],
4756 fixed = isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[0],
4758 for (i = 1; fixed == 1 && i < set->n; ++i) {
4759 fixed = isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[i],
4761 if (fixed == 1 && isl_int_ne(tmp, v))
4765 isl_int_set(*val, v);
4771 static struct isl_basic_set *isl_basic_set_reduce_using_equalities(
4772 struct isl_basic_set *bset, struct isl_basic_set *context)
4777 if (!bset || !context)
4780 bset = isl_basic_set_cow(bset);
4784 elim = isl_alloc_array(ctx, int, isl_basic_set_n_dim(bset));
4787 set_compute_elimination_index(context, elim);
4788 for (i = 0; i < bset->n_eq; ++i)
4789 set_reduced_using_equalities(bset->eq[i], bset->eq[i],
4791 for (i = 0; i < bset->n_ineq; ++i)
4792 set_reduced_using_equalities(bset->ineq[i], bset->ineq[i],
4794 isl_basic_set_free(context);
4796 bset = isl_basic_set_simplify(bset);
4797 bset = isl_basic_set_finalize(bset);
4800 isl_basic_set_free(bset);
4801 isl_basic_set_free(context);
4805 static struct isl_basic_set *remove_shifted_constraints(
4806 struct isl_basic_set *bset, struct isl_basic_set *context)
4816 size = round_up(4 * (context->n_ineq+1) / 3 - 1);
4817 bits = ffs(size) - 1;
4818 index = isl_calloc_array(ctx, isl_int **, size);
4822 for (k = 0; k < context->n_ineq; ++k) {
4823 h = set_hash_index(index, size, bits, context, k);
4824 index[h] = &context->ineq[k];
4826 for (k = 0; k < bset->n_ineq; ++k) {
4827 h = set_hash_index(index, size, bits, bset, k);
4830 l = index[h] - &context->ineq[0];
4831 if (isl_int_lt(bset->ineq[k][0], context->ineq[l][0]))
4833 bset = isl_basic_set_cow(bset);
4836 isl_basic_set_drop_inequality(bset, k);
4846 /* Remove all information from bset that is redundant in the context
4847 * of context. In particular, equalities that are linear combinations
4848 * of those in context are removed. Then the inequalities that are
4849 * redundant in the context of the equalities and inequalities of
4850 * context are removed.
4852 static struct isl_basic_set *uset_gist(struct isl_basic_set *bset,
4853 struct isl_basic_set *context)
4857 struct isl_basic_set *combined;
4858 struct isl_ctx *ctx;
4860 if (!bset || !context)
4863 if (context->n_eq > 0) {
4866 struct isl_ctx *ctx = context->ctx;
4867 struct isl_basic_set *reduced_context;
4868 reduced_context = isl_basic_set_remove_equalities(
4869 isl_basic_set_copy(context), &T, &T2);
4870 if (!reduced_context)
4872 bset = isl_basic_set_preimage(ctx, bset, T);
4873 bset = uset_gist(bset, reduced_context);
4874 bset = isl_basic_set_preimage(ctx, bset, T2);
4875 bset = isl_basic_set_reduce_using_equalities(bset, context);
4878 if (!context->n_ineq)
4880 bset = remove_shifted_constraints(bset, context);
4881 combined = isl_basic_set_extend_constraints(isl_basic_set_copy(bset),
4882 context->n_eq, context->n_ineq);
4883 context = set_add_constraints(combined, context, 0);
4888 for (i = bset->n_ineq-1; i >= 0; --i) {
4890 set_swap_inequality(context, i, context->n_ineq-1);
4892 redundant = isl_basic_set_constraint_is_redundant(&context,
4893 context->ineq[context->n_ineq], &opt, NULL);
4894 if (redundant == -1) {
4898 if (F_ISSET(context, ISL_BASIC_MAP_EMPTY)) {
4899 bset = isl_basic_set_set_to_empty(bset);
4903 set_swap_inequality(context, i, context->n_ineq-1);
4905 isl_basic_set_drop_inequality(context, i);
4906 isl_basic_set_drop_inequality(bset, i);
4911 isl_basic_set_free(context);
4914 isl_basic_set_free(context);
4915 isl_basic_set_free(bset);
4919 struct isl_basic_map *isl_basic_map_gist(struct isl_basic_map *bmap,
4920 struct isl_basic_map *context)
4922 struct isl_basic_set *bset;
4924 if (!bmap || !context)
4927 context = isl_basic_map_align_divs(context, bmap);
4928 bmap = isl_basic_map_align_divs(bmap, context);
4930 bset = uset_gist(isl_basic_map_underlying_set(isl_basic_map_copy(bmap)),
4931 isl_basic_map_underlying_set(context));
4933 return isl_basic_map_overlying_set(bset, bmap);
4935 isl_basic_map_free(bmap);
4936 isl_basic_map_free(context);
4940 struct isl_map *isl_map_gist(struct isl_map *map, struct isl_basic_map *context)
4944 map = isl_map_cow(map);
4945 if (!map || !context)
4947 isl_assert(map->ctx, isl_dim_equal(map->dim, context->dim), goto error);
4948 for (i = 0; i < map->n; ++i)
4949 context = isl_basic_map_align_divs(context, map->p[i]);
4950 for (i = 0; i < map->n; ++i) {
4951 map->p[i] = isl_basic_map_gist(map->p[i],
4952 isl_basic_map_copy(context));
4956 isl_basic_map_free(context);
4957 F_CLR(map, ISL_MAP_NORMALIZED);
4961 isl_basic_map_free(context);
4965 struct isl_basic_set *isl_basic_set_gist(struct isl_basic_set *bset,
4966 struct isl_basic_set *context)
4968 return (struct isl_basic_set *)isl_basic_map_gist(
4969 (struct isl_basic_map *)bset, (struct isl_basic_map *)context);
4972 struct isl_set *isl_set_gist(struct isl_set *set, struct isl_basic_set *context)
4974 return (struct isl_set *)isl_map_gist((struct isl_map *)set,
4975 (struct isl_basic_map *)context);
4983 static int qsort_constraint_cmp(const void *p1, const void *p2)
4985 const struct constraint *c1 = (const struct constraint *)p1;
4986 const struct constraint *c2 = (const struct constraint *)p2;
4987 unsigned size = isl_min(c1->size, c2->size);
4988 return isl_seq_cmp(c1->c, c2->c, size);
4991 static struct isl_basic_map *isl_basic_map_sort_constraints(
4992 struct isl_basic_map *bmap)
4995 struct constraint *c;
5000 total = isl_basic_map_total_dim(bmap);
5001 c = isl_alloc_array(bmap->ctx, struct constraint, bmap->n_ineq);
5004 for (i = 0; i < bmap->n_ineq; ++i) {
5006 c[i].c = bmap->ineq[i];
5008 qsort(c, bmap->n_ineq, sizeof(struct constraint), qsort_constraint_cmp);
5009 for (i = 0; i < bmap->n_ineq; ++i)
5010 bmap->ineq[i] = c[i].c;
5014 isl_basic_map_free(bmap);
5018 struct isl_basic_map *isl_basic_map_normalize(struct isl_basic_map *bmap)
5022 if (F_ISSET(bmap, ISL_BASIC_MAP_NORMALIZED))
5024 bmap = isl_basic_map_convex_hull(bmap);
5025 bmap = isl_basic_map_sort_constraints(bmap);
5026 F_SET(bmap, ISL_BASIC_MAP_NORMALIZED);
5030 struct isl_basic_set *isl_basic_set_normalize(struct isl_basic_set *bset)
5032 return (struct isl_basic_set *)isl_basic_map_normalize(
5033 (struct isl_basic_map *)bset);
5036 static int isl_basic_map_fast_cmp(const struct isl_basic_map *bmap1,
5037 const struct isl_basic_map *bmap2)
5044 if (isl_basic_map_n_param(bmap1) != isl_basic_map_n_param(bmap2))
5045 return isl_basic_map_n_param(bmap1) - isl_basic_map_n_param(bmap2);
5046 if (isl_basic_map_n_in(bmap1) != isl_basic_map_n_in(bmap2))
5047 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
5048 if (isl_basic_map_n_out(bmap1) != isl_basic_map_n_out(bmap2))
5049 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
5050 if (F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY) &&
5051 F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
5053 if (F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY))
5055 if (F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
5057 if (bmap1->n_eq != bmap2->n_eq)
5058 return bmap1->n_eq - bmap2->n_eq;
5059 if (bmap1->n_ineq != bmap2->n_ineq)
5060 return bmap1->n_ineq - bmap2->n_ineq;
5061 if (bmap1->n_div != bmap2->n_div)
5062 return bmap1->n_div - bmap2->n_div;
5063 total = isl_basic_map_total_dim(bmap1);
5064 for (i = 0; i < bmap1->n_eq; ++i) {
5065 cmp = isl_seq_cmp(bmap1->eq[i], bmap2->eq[i], 1+total);
5069 for (i = 0; i < bmap1->n_ineq; ++i) {
5070 cmp = isl_seq_cmp(bmap1->ineq[i], bmap2->ineq[i], 1+total);
5074 for (i = 0; i < bmap1->n_div; ++i) {
5075 cmp = isl_seq_cmp(bmap1->div[i], bmap2->div[i], 1+1+total);
5082 static int isl_basic_map_fast_is_equal(struct isl_basic_map *bmap1,
5083 struct isl_basic_map *bmap2)
5085 return isl_basic_map_fast_cmp(bmap1, bmap2) == 0;
5088 static int qsort_bmap_cmp(const void *p1, const void *p2)
5090 const struct isl_basic_map *bmap1 = *(const struct isl_basic_map **)p1;
5091 const struct isl_basic_map *bmap2 = *(const struct isl_basic_map **)p2;
5093 return isl_basic_map_fast_cmp(bmap1, bmap2);
5096 /* We normalize in place, but if anything goes wrong we need
5097 * to return NULL, so we need to make sure we don't change the
5098 * meaning of any possible other copies of map.
5100 struct isl_map *isl_map_normalize(struct isl_map *map)
5103 struct isl_basic_map *bmap;
5107 if (F_ISSET(map, ISL_MAP_NORMALIZED))
5109 for (i = 0; i < map->n; ++i) {
5110 bmap = isl_basic_map_normalize(isl_basic_map_copy(map->p[i]));
5113 isl_basic_map_free(map->p[i]);
5116 qsort(map->p, map->n, sizeof(struct isl_basic_map *), qsort_bmap_cmp);
5117 F_SET(map, ISL_MAP_NORMALIZED);
5118 map = isl_map_remove_empty_parts(map);
5121 for (i = map->n - 1; i >= 1; --i) {
5122 if (!isl_basic_map_fast_is_equal(map->p[i-1], map->p[i]))
5124 isl_basic_map_free(map->p[i-1]);
5125 for (j = i; j < map->n; ++j)
5126 map->p[j-1] = map->p[j];
5136 struct isl_set *isl_set_normalize(struct isl_set *set)
5138 return (struct isl_set *)isl_map_normalize((struct isl_map *)set);
5141 int isl_map_fast_is_equal(struct isl_map *map1, struct isl_map *map2)
5151 if (!isl_dim_equal(map1->dim, map2->dim))
5154 map1 = isl_map_copy(map1);
5155 map2 = isl_map_copy(map2);
5156 map1 = isl_map_normalize(map1);
5157 map2 = isl_map_normalize(map2);
5160 equal = map1->n == map2->n;
5161 for (i = 0; equal && i < map1->n; ++i) {
5162 equal = isl_basic_map_fast_is_equal(map1->p[i], map2->p[i]);
5175 int isl_set_fast_is_equal(struct isl_set *set1, struct isl_set *set2)
5177 return isl_map_fast_is_equal((struct isl_map *)set1,
5178 (struct isl_map *)set2);
5181 /* Return an interval that ranges from min to max (inclusive)
5183 struct isl_basic_set *isl_basic_set_interval(struct isl_ctx *ctx,
5184 isl_int min, isl_int max)
5187 struct isl_basic_set *bset = NULL;
5189 bset = isl_basic_set_alloc(ctx, 0, 1, 0, 0, 2);
5193 k = isl_basic_set_alloc_inequality(bset);
5196 isl_int_set_si(bset->ineq[k][1], 1);
5197 isl_int_neg(bset->ineq[k][0], min);
5199 k = isl_basic_set_alloc_inequality(bset);
5202 isl_int_set_si(bset->ineq[k][1], -1);
5203 isl_int_set(bset->ineq[k][0], max);
5207 isl_basic_set_free(bset);
5211 /* Return the Cartesian product of the basic sets in list (in the given order).
5213 struct isl_basic_set *isl_basic_set_product(struct isl_basic_set_list *list)
5221 struct isl_basic_set *product = NULL;
5225 isl_assert(list->ctx, list->n > 0, goto error);
5226 isl_assert(list->ctx, list->p[0], goto error);
5227 nparam = isl_basic_set_n_param(list->p[0]);
5228 dim = isl_basic_set_n_dim(list->p[0]);
5229 extra = list->p[0]->n_div;
5230 n_eq = list->p[0]->n_eq;
5231 n_ineq = list->p[0]->n_ineq;
5232 for (i = 1; i < list->n; ++i) {
5233 isl_assert(list->ctx, list->p[i], goto error);
5234 isl_assert(list->ctx,
5235 nparam == isl_basic_set_n_param(list->p[i]), goto error);
5236 dim += isl_basic_set_n_dim(list->p[i]);
5237 extra += list->p[i]->n_div;
5238 n_eq += list->p[i]->n_eq;
5239 n_ineq += list->p[i]->n_ineq;
5241 product = isl_basic_set_alloc(list->ctx, nparam, dim, extra,
5246 for (i = 0; i < list->n; ++i) {
5247 set_add_constraints(product,
5248 isl_basic_set_copy(list->p[i]), dim);
5249 dim += isl_basic_set_n_dim(list->p[i]);
5251 isl_basic_set_list_free(list);
5254 isl_basic_set_free(product);
5255 isl_basic_set_list_free(list);
5259 uint32_t isl_basic_set_get_hash(struct isl_basic_set *bset)
5267 bset = isl_basic_set_copy(bset);
5268 bset = isl_basic_set_normalize(bset);
5271 total = isl_basic_set_total_dim(bset);
5272 isl_hash_byte(hash, bset->n_eq & 0xFF);
5273 for (i = 0; i < bset->n_eq; ++i) {
5275 c_hash = isl_seq_get_hash(bset->eq[i], 1 + total);
5276 isl_hash_hash(hash, c_hash);
5278 isl_hash_byte(hash, bset->n_ineq & 0xFF);
5279 for (i = 0; i < bset->n_ineq; ++i) {
5281 c_hash = isl_seq_get_hash(bset->ineq[i], 1 + total);
5282 isl_hash_hash(hash, c_hash);
5284 isl_hash_byte(hash, bset->n_div & 0xFF);
5285 for (i = 0; i < bset->n_div; ++i) {
5287 if (isl_int_is_zero(bset->div[i][0]))
5289 isl_hash_byte(hash, i & 0xFF);
5290 c_hash = isl_seq_get_hash(bset->div[i], 1 + 1 + total);
5291 isl_hash_hash(hash, c_hash);
5293 isl_basic_set_free(bset);
5297 uint32_t isl_set_get_hash(struct isl_set *set)
5304 set = isl_set_copy(set);
5305 set = isl_set_normalize(set);
5309 hash = isl_hash_init();
5310 for (i = 0; i < set->n; ++i) {
5312 bset_hash = isl_basic_set_get_hash(set->p[i]);
5313 isl_hash_hash(hash, bset_hash);
5321 /* Check if the value for dimension dim is completely determined
5322 * by the values of the other parameters and variables.
5323 * That is, check if dimension dim is involved in an equality.
5325 int isl_basic_set_dim_is_unique(struct isl_basic_set *bset, unsigned dim)
5332 nparam = isl_basic_set_n_param(bset);
5333 for (i = 0; i < bset->n_eq; ++i)
5334 if (!isl_int_is_zero(bset->eq[i][1 + nparam + dim]))
5339 /* Check if the value for dimension dim is completely determined
5340 * by the values of the other parameters and variables.
5341 * That is, check if dimension dim is involved in an equality
5342 * for each of the subsets.
5344 int isl_set_dim_is_unique(struct isl_set *set, unsigned dim)
5350 for (i = 0; i < set->n; ++i) {
5352 unique = isl_basic_set_dim_is_unique(set->p[i], dim);