8 #include "isl_map_private.h"
9 #include "isl_map_piplib.h"
10 #include "isl_sample.h"
13 static struct isl_basic_map *basic_map_init(struct isl_ctx *ctx,
14 struct isl_basic_map *bmap,
15 unsigned nparam, unsigned n_in, unsigned n_out, unsigned extra,
16 unsigned n_eq, unsigned n_ineq)
19 size_t row_size = 1 + nparam + n_in + n_out + extra;
21 bmap->block = isl_blk_alloc(ctx, (n_eq + n_ineq) * row_size);
22 if (isl_blk_is_error(bmap->block)) {
27 bmap->eq = isl_alloc_array(ctx, isl_int *, n_eq + n_ineq);
29 isl_blk_free(ctx, bmap->block);
35 bmap->block2 = isl_blk_empty();
38 bmap->block2 = isl_blk_alloc(ctx, extra * (1 + row_size));
39 if (isl_blk_is_error(bmap->block2)) {
41 isl_blk_free(ctx, bmap->block);
46 bmap->div = isl_alloc_array(ctx, isl_int *, extra);
48 isl_blk_free(ctx, bmap->block2);
50 isl_blk_free(ctx, bmap->block);
56 for (i = 0; i < n_eq + n_ineq; ++i)
57 bmap->eq[i] = bmap->block.data + i * row_size;
59 for (i = 0; i < extra; ++i)
60 bmap->div[i] = bmap->block2.data + i * (1 + row_size);
64 bmap->c_size = n_eq + n_ineq;
65 bmap->ineq = bmap->eq + n_eq;
66 bmap->nparam = nparam;
78 struct isl_basic_set *isl_basic_set_alloc(struct isl_ctx *ctx,
79 unsigned nparam, unsigned dim, unsigned extra,
80 unsigned n_eq, unsigned n_ineq)
82 struct isl_basic_map *bmap;
83 bmap = isl_basic_map_alloc(ctx, nparam, 0, dim, extra, n_eq, n_ineq);
84 return (struct isl_basic_set *)bmap;
87 struct isl_basic_map *isl_basic_map_alloc(struct isl_ctx *ctx,
88 unsigned nparam, unsigned in, unsigned out, unsigned extra,
89 unsigned n_eq, unsigned n_ineq)
91 struct isl_basic_map *bmap;
93 bmap = isl_alloc_type(ctx, struct isl_basic_map);
97 return basic_map_init(ctx, bmap,
98 nparam, in, out, extra, n_eq, n_ineq);
101 static void dup_constraints(struct isl_ctx *ctx,
102 struct isl_basic_map *dst, struct isl_basic_map *src)
105 unsigned total = src->nparam + src->n_in + src->n_out + src->n_div;
107 for (i = 0; i < src->n_eq; ++i) {
108 int j = isl_basic_map_alloc_equality(ctx, dst);
109 isl_seq_cpy(dst->eq[j], src->eq[i], 1+total);
112 for (i = 0; i < src->n_ineq; ++i) {
113 int j = isl_basic_map_alloc_inequality(ctx, dst);
114 isl_seq_cpy(dst->ineq[j], src->ineq[i], 1+total);
117 for (i = 0; i < src->n_div; ++i) {
118 int j = isl_basic_map_alloc_div(ctx, dst);
119 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total);
121 F_SET(dst, ISL_BASIC_SET_FINAL);
124 struct isl_basic_map *isl_basic_map_dup(struct isl_ctx *ctx,
125 struct isl_basic_map *bmap)
127 struct isl_basic_map *dup;
129 dup = isl_basic_map_alloc(ctx, bmap->nparam,
130 bmap->n_in, bmap->n_out,
131 bmap->n_div, bmap->n_eq, bmap->n_ineq);
134 dup_constraints(ctx, dup, bmap);
135 dup->sample = isl_vec_copy(ctx, bmap->sample);
139 struct isl_basic_set *isl_basic_set_dup(struct isl_ctx *ctx,
140 struct isl_basic_set *bset)
142 struct isl_basic_map *dup;
144 dup = isl_basic_map_dup(ctx, (struct isl_basic_map *)bset);
145 return (struct isl_basic_set *)dup;
148 struct isl_basic_set *isl_basic_set_copy(struct isl_ctx *ctx,
149 struct isl_basic_set *bset)
154 if (F_ISSET(bset, ISL_BASIC_SET_FINAL)) {
158 return isl_basic_set_dup(ctx, bset);
161 struct isl_set *isl_set_copy(struct isl_ctx *ctx, struct isl_set *set)
170 struct isl_basic_map *isl_basic_map_copy(struct isl_ctx *ctx,
171 struct isl_basic_map *bmap)
176 if (F_ISSET(bmap, ISL_BASIC_SET_FINAL)) {
180 return isl_basic_map_dup(ctx, bmap);
183 struct isl_map *isl_map_copy(struct isl_ctx *ctx, struct isl_map *map)
192 void isl_basic_map_free(struct isl_ctx *ctx, struct isl_basic_map *bmap)
201 isl_blk_free(ctx, bmap->block2);
203 isl_blk_free(ctx, bmap->block);
204 isl_vec_free(ctx, bmap->sample);
208 void isl_basic_set_free(struct isl_ctx *ctx, struct isl_basic_set *bset)
210 isl_basic_map_free(ctx, (struct isl_basic_map *)bset);
213 int isl_basic_map_alloc_equality(struct isl_ctx *ctx,
214 struct isl_basic_map *bmap)
218 isl_assert(ctx, bmap->n_eq + bmap->n_ineq < bmap->c_size, return -1);
219 isl_assert(ctx, bmap->eq + bmap->n_eq <= bmap->ineq, return -1);
220 if (bmap->eq + bmap->n_eq == bmap->ineq) {
222 int j = isl_basic_map_alloc_inequality(ctx, bmap);
226 bmap->ineq[0] = bmap->ineq[j];
234 int isl_basic_set_alloc_equality(struct isl_ctx *ctx,
235 struct isl_basic_set *bset)
237 return isl_basic_map_alloc_equality(ctx, (struct isl_basic_map *)bset);
240 int isl_basic_map_free_equality(struct isl_ctx *ctx,
241 struct isl_basic_map *bmap, unsigned n)
243 isl_assert(ctx, n <= bmap->n_eq, return -1);
248 int isl_basic_map_drop_equality(struct isl_ctx *ctx,
249 struct isl_basic_map *bmap, unsigned pos)
252 isl_assert(ctx, pos < bmap->n_eq, return -1);
254 if (pos != bmap->n_eq - 1) {
256 bmap->eq[pos] = bmap->eq[bmap->n_eq - 1];
257 bmap->eq[bmap->n_eq - 1] = t;
263 void isl_basic_map_inequality_to_equality(struct isl_ctx *ctx,
264 struct isl_basic_map *bmap, unsigned pos)
269 bmap->ineq[pos] = bmap->ineq[0];
270 bmap->ineq[0] = bmap->eq[bmap->n_eq];
271 bmap->eq[bmap->n_eq] = t;
277 int isl_basic_map_alloc_inequality(struct isl_ctx *ctx,
278 struct isl_basic_map *bmap)
280 isl_assert(ctx, (bmap->ineq - bmap->eq) + bmap->n_ineq < bmap->c_size,
282 F_CLR(bmap, ISL_BASIC_MAP_NO_IMPLICIT);
283 return bmap->n_ineq++;
286 int isl_basic_set_alloc_inequality(struct isl_ctx *ctx,
287 struct isl_basic_set *bset)
289 return isl_basic_map_alloc_inequality(ctx, (struct isl_basic_map *)bset);
292 int isl_basic_map_free_inequality(struct isl_ctx *ctx,
293 struct isl_basic_map *bmap, unsigned n)
295 isl_assert(ctx, n <= bmap->n_ineq, return -1);
300 int isl_basic_map_drop_inequality(struct isl_ctx *ctx,
301 struct isl_basic_map *bmap, unsigned pos)
304 isl_assert(ctx, pos < bmap->n_ineq, return -1);
306 if (pos != bmap->n_ineq - 1) {
308 bmap->ineq[pos] = bmap->ineq[bmap->n_ineq - 1];
309 bmap->ineq[bmap->n_ineq - 1] = t;
315 int isl_basic_map_alloc_div(struct isl_ctx *ctx,
316 struct isl_basic_map *bmap)
318 isl_assert(ctx, bmap->n_div < bmap->extra, return -1);
319 return bmap->n_div++;
322 int isl_basic_map_free_div(struct isl_ctx *ctx,
323 struct isl_basic_map *bmap, unsigned n)
325 isl_assert(ctx, n <= bmap->n_div, return -1);
330 /* Copy constraint from src to dst, putting the vars of src at offset
331 * dim_off in dst and the divs of src at offset div_off in dst.
332 * If both sets are actually map, then dim_off applies to the input
335 static void copy_constraint(struct isl_basic_map *dst_map, isl_int *dst,
336 struct isl_basic_map *src_map, isl_int *src,
337 unsigned in_off, unsigned out_off, unsigned div_off)
339 isl_int_set(dst[0], src[0]);
340 isl_seq_cpy(dst+1, src+1, isl_min(dst_map->nparam, src_map->nparam));
341 if (dst_map->nparam > src_map->nparam)
342 isl_seq_clr(dst+1+src_map->nparam,
343 dst_map->nparam - src_map->nparam);
344 isl_seq_clr(dst+1+dst_map->nparam, in_off);
345 isl_seq_cpy(dst+1+dst_map->nparam+in_off,
346 src+1+src_map->nparam,
347 isl_min(dst_map->n_in-in_off, src_map->n_in));
348 if (dst_map->n_in-in_off > src_map->n_in)
349 isl_seq_clr(dst+1+dst_map->nparam+in_off+src_map->n_in,
350 dst_map->n_in - in_off - src_map->n_in);
351 isl_seq_clr(dst+1+dst_map->nparam+dst_map->n_in, out_off);
352 isl_seq_cpy(dst+1+dst_map->nparam+dst_map->n_in+out_off,
353 src+1+src_map->nparam+src_map->n_in,
354 isl_min(dst_map->n_out-out_off, src_map->n_out));
355 if (dst_map->n_out-out_off > src_map->n_out)
356 isl_seq_clr(dst+1+dst_map->nparam+dst_map->n_in+out_off+src_map->n_out,
357 dst_map->n_out - out_off - src_map->n_out);
358 isl_seq_clr(dst+1+dst_map->nparam+dst_map->n_in+dst_map->n_out, div_off);
359 isl_seq_cpy(dst+1+dst_map->nparam+dst_map->n_in+dst_map->n_out+div_off,
360 src+1+src_map->nparam+src_map->n_in+src_map->n_out,
361 isl_min(dst_map->extra-div_off, src_map->extra));
362 if (dst_map->extra-div_off > src_map->extra)
363 isl_seq_clr(dst+1+dst_map->nparam+dst_map->n_in+dst_map->n_out+
364 div_off+src_map->extra,
365 dst_map->extra - div_off - src_map->extra);
368 static void copy_div(struct isl_basic_map *dst_map, isl_int *dst,
369 struct isl_basic_map *src_map, isl_int *src,
370 unsigned in_off, unsigned out_off, unsigned div_off)
372 isl_int_set(dst[0], src[0]);
373 copy_constraint(dst_map, dst+1, src_map, src+1, in_off, out_off, div_off);
376 static struct isl_basic_map *add_constraints(struct isl_ctx *ctx,
377 struct isl_basic_map *bmap1,
378 struct isl_basic_map *bmap2, unsigned i_pos, unsigned o_pos)
381 unsigned div_off = bmap1->n_div;
383 for (i = 0; i < bmap2->n_eq; ++i) {
384 int i1 = isl_basic_map_alloc_equality(ctx, bmap1);
387 copy_constraint(bmap1, bmap1->eq[i1], bmap2, bmap2->eq[i],
388 i_pos, o_pos, div_off);
391 for (i = 0; i < bmap2->n_ineq; ++i) {
392 int i1 = isl_basic_map_alloc_inequality(ctx, bmap1);
395 copy_constraint(bmap1, bmap1->ineq[i1], bmap2, bmap2->ineq[i],
396 i_pos, o_pos, div_off);
399 for (i = 0; i < bmap2->n_div; ++i) {
400 int i1 = isl_basic_map_alloc_div(ctx, bmap1);
403 copy_div(bmap1, bmap1->div[i1], bmap2, bmap2->div[i],
404 i_pos, o_pos, div_off);
407 isl_basic_map_free(ctx, bmap2);
412 isl_basic_map_free(ctx, bmap1);
413 isl_basic_map_free(ctx, bmap2);
417 struct isl_basic_map *isl_basic_map_extend(struct isl_ctx *ctx,
418 struct isl_basic_map *base,
419 unsigned nparam, unsigned n_in, unsigned n_out, unsigned extra,
420 unsigned n_eq, unsigned n_ineq)
422 struct isl_basic_map *ext;
425 base = isl_basic_map_cow(ctx, base);
429 dims_ok = base && base->nparam == nparam &&
430 base->n_in == n_in && base->n_out == n_out &&
431 base->extra >= base->n_div + extra;
433 if (dims_ok && n_eq == 0 && n_ineq == 0)
437 isl_assert(ctx, base->nparam <= nparam, goto error);
438 isl_assert(ctx, base->n_in <= n_in, goto error);
439 isl_assert(ctx, base->n_out <= n_out, goto error);
440 extra += base->extra;
442 n_ineq += base->n_ineq;
445 ext = isl_basic_map_alloc(ctx, nparam, n_in, n_out,
446 extra, n_eq, n_ineq);
452 ext = add_constraints(ctx, ext, base, 0, 0);
457 isl_basic_map_free(ctx, base);
461 struct isl_basic_set *isl_basic_set_extend(struct isl_ctx *ctx,
462 struct isl_basic_set *base,
463 unsigned nparam, unsigned dim, unsigned extra,
464 unsigned n_eq, unsigned n_ineq)
466 return (struct isl_basic_set *)
467 isl_basic_map_extend(ctx, (struct isl_basic_map *)base,
468 nparam, 0, dim, extra, n_eq, n_ineq);
471 struct isl_basic_set *isl_basic_set_cow(struct isl_ctx *ctx,
472 struct isl_basic_set *bset)
474 return (struct isl_basic_set *)
475 isl_basic_map_cow(ctx, (struct isl_basic_map *)bset);
478 struct isl_basic_map *isl_basic_map_cow(struct isl_ctx *ctx,
479 struct isl_basic_map *bmap)
486 bmap = isl_basic_map_dup(ctx, bmap);
488 F_CLR(bmap, ISL_BASIC_SET_FINAL);
492 static struct isl_set *isl_set_cow(struct isl_ctx *ctx, struct isl_set *set)
500 return isl_set_dup(ctx, set);
503 struct isl_map *isl_map_cow(struct isl_ctx *ctx, struct isl_map *map)
511 return isl_map_dup(ctx, map);
514 static void swap_vars(struct isl_blk blk, isl_int *a,
515 unsigned a_len, unsigned b_len)
517 isl_seq_cpy(blk.data, a+a_len, b_len);
518 isl_seq_cpy(blk.data+b_len, a, a_len);
519 isl_seq_cpy(a, blk.data, b_len+a_len);
522 struct isl_basic_set *isl_basic_set_swap_vars(struct isl_ctx *ctx,
523 struct isl_basic_set *bset, unsigned n)
531 isl_assert(ctx, n <= bset->dim, goto error);
536 bset = isl_basic_set_cow(ctx, bset);
540 blk = isl_blk_alloc(ctx, bset->dim);
541 if (isl_blk_is_error(blk))
544 for (i = 0; i < bset->n_eq; ++i)
546 bset->eq[i]+1+bset->nparam, n, bset->dim - n);
548 for (i = 0; i < bset->n_ineq; ++i)
550 bset->ineq[i]+1+bset->nparam, n, bset->dim - n);
552 for (i = 0; i < bset->n_div; ++i)
554 bset->div[i]+1+1+bset->nparam, n, bset->dim - n);
556 isl_blk_free(ctx, blk);
561 isl_basic_set_free(ctx, bset);
565 struct isl_set *isl_set_swap_vars(struct isl_ctx *ctx,
566 struct isl_set *set, unsigned n)
569 set = isl_set_cow(ctx, set);
573 for (i = 0; i < set->n; ++i) {
574 set->p[i] = isl_basic_set_swap_vars(ctx, set->p[i], n);
576 isl_set_free(ctx, set);
583 static void constraint_drop_vars(isl_int *c, unsigned n, unsigned rem)
585 isl_seq_cpy(c, c + n, rem);
586 isl_seq_clr(c + rem, n);
589 struct isl_basic_set *isl_basic_set_drop_vars(struct isl_ctx *ctx,
590 struct isl_basic_set *bset, unsigned first, unsigned n)
597 isl_assert(ctx, first + n <= bset->dim, goto error);
602 bset = isl_basic_set_cow(ctx, bset);
606 for (i = 0; i < bset->n_eq; ++i)
607 constraint_drop_vars(bset->eq[i]+1+bset->nparam+first, n,
608 (bset->dim-first-n)+bset->extra);
610 for (i = 0; i < bset->n_ineq; ++i)
611 constraint_drop_vars(bset->ineq[i]+1+bset->nparam+first, n,
612 (bset->dim-first-n)+bset->extra);
614 for (i = 0; i < bset->n_div; ++i)
615 constraint_drop_vars(bset->div[i]+1+1+bset->nparam+first, n,
616 (bset->dim-first-n)+bset->extra);
621 return isl_basic_set_finalize(ctx, bset);
623 isl_basic_set_free(ctx, bset);
628 * We don't cow, as the div is assumed to be redundant.
630 static struct isl_basic_map *isl_basic_map_drop_div(struct isl_ctx *ctx,
631 struct isl_basic_map *bmap, unsigned div)
639 pos = 1 + bmap->nparam + bmap->n_in + bmap->n_out + div;
641 isl_assert(ctx, div < bmap->n_div, goto error);
643 for (i = 0; i < bmap->n_eq; ++i)
644 constraint_drop_vars(bmap->eq[i]+pos, 1, bmap->extra-div-1);
646 for (i = 0; i < bmap->n_ineq; ++i) {
647 if (!isl_int_is_zero(bmap->ineq[i][pos])) {
648 isl_basic_map_drop_inequality(ctx, bmap, i);
652 constraint_drop_vars(bmap->ineq[i]+pos, 1, bmap->extra-div-1);
655 for (i = 0; i < bmap->n_div; ++i)
656 constraint_drop_vars(bmap->div[i]+1+pos, 1, bmap->extra-div-1);
658 if (div != bmap->n_div - 1) {
660 isl_int *t = bmap->div[div];
662 for (j = div; j < bmap->n_div - 1; ++j)
663 bmap->div[j] = bmap->div[j+1];
665 bmap->div[bmap->n_div - 1] = t;
667 isl_basic_map_free_div(ctx, bmap, 1);
671 isl_basic_map_free(ctx, bmap);
675 static void eliminate_div(struct isl_ctx *ctx, struct isl_basic_map *bmap,
676 isl_int *eq, unsigned div)
679 unsigned pos = 1 + bmap->nparam + bmap->n_in + bmap->n_out + div;
681 len = 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
683 for (i = 0; i < bmap->n_eq; ++i)
684 if (bmap->eq[i] != eq)
685 isl_seq_elim(bmap->eq[i], eq, pos, len, NULL);
687 for (i = 0; i < bmap->n_ineq; ++i)
688 isl_seq_elim(bmap->ineq[i], eq, pos, len, NULL);
690 /* We need to be careful about circular definitions,
691 * so for now we just remove the definitions of other divs that
692 * depend on this div and (possibly) recompute them later.
694 for (i = 0; i < bmap->n_div; ++i)
695 if (!isl_int_is_zero(bmap->div[i][0]) &&
696 !isl_int_is_zero(bmap->div[i][1 + pos]))
697 isl_seq_clr(bmap->div[i], 1 + len);
699 isl_basic_map_drop_div(ctx, bmap, div);
702 struct isl_basic_map *isl_basic_map_set_to_empty(
703 struct isl_ctx *ctx, struct isl_basic_map *bmap)
709 total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->extra;
710 isl_basic_map_free_div(ctx, bmap, bmap->n_div);
711 isl_basic_map_free_inequality(ctx, bmap, bmap->n_ineq);
713 isl_basic_map_free_equality(ctx, bmap, bmap->n_eq-1);
715 isl_basic_map_alloc_equality(ctx, bmap);
719 isl_int_set_si(bmap->eq[i][0], 1);
720 isl_seq_clr(bmap->eq[i]+1, total);
721 F_SET(bmap, ISL_BASIC_MAP_EMPTY);
722 return isl_basic_map_finalize(ctx, bmap);
724 isl_basic_map_free(ctx, bmap);
728 struct isl_basic_set *isl_basic_set_set_to_empty(
729 struct isl_ctx *ctx, struct isl_basic_set *bset)
731 return (struct isl_basic_set *)
732 isl_basic_map_set_to_empty(ctx, (struct isl_basic_map *)bset);
735 static void swap_equality(struct isl_basic_map *bmap, int a, int b)
737 isl_int *t = bmap->eq[a];
738 bmap->eq[a] = bmap->eq[b];
742 static void swap_inequality(struct isl_basic_map *bmap, int a, int b)
744 isl_int *t = bmap->ineq[a];
745 bmap->ineq[a] = bmap->ineq[b];
749 static void swap_div(struct isl_basic_map *bmap, int a, int b)
752 unsigned off = bmap->nparam + bmap->n_in + bmap->n_out;
753 isl_int *t = bmap->div[a];
754 bmap->div[a] = bmap->div[b];
757 for (i = 0; i < bmap->n_eq; ++i)
758 isl_int_swap(bmap->eq[i][1+off+a], bmap->eq[i][1+off+b]);
760 for (i = 0; i < bmap->n_ineq; ++i)
761 isl_int_swap(bmap->ineq[i][1+off+a], bmap->ineq[i][1+off+b]);
763 for (i = 0; i < bmap->n_div; ++i)
764 isl_int_swap(bmap->div[i][1+1+off+a], bmap->div[i][1+1+off+b]);
767 struct isl_basic_map *isl_basic_map_gauss(struct isl_ctx *ctx,
768 struct isl_basic_map *bmap, int *progress)
779 total_var = bmap->nparam + bmap->n_in + bmap->n_out;
780 total = total_var + bmap->n_div;
782 last_var = total - 1;
783 for (done = 0; done < bmap->n_eq; ++done) {
784 for (; last_var >= 0; --last_var) {
785 for (k = done; k < bmap->n_eq; ++k)
786 if (!isl_int_is_zero(bmap->eq[k][1+last_var]))
794 swap_equality(bmap, k, done);
795 if (isl_int_is_neg(bmap->eq[done][1+last_var]))
796 isl_seq_neg(bmap->eq[done], bmap->eq[done], 1+total);
798 for (k = 0; k < bmap->n_eq; ++k) {
801 if (isl_int_is_zero(bmap->eq[k][1+last_var]))
805 isl_seq_elim(bmap->eq[k], bmap->eq[done],
806 1+last_var, 1+total, NULL);
809 for (k = 0; k < bmap->n_ineq; ++k) {
810 if (isl_int_is_zero(bmap->ineq[k][1+last_var]))
814 isl_seq_elim(bmap->ineq[k], bmap->eq[done],
815 1+last_var, 1+total, NULL);
818 for (k = 0; k < bmap->n_div; ++k) {
819 if (isl_int_is_zero(bmap->div[k][0]))
821 if (isl_int_is_zero(bmap->div[k][1+1+last_var]))
825 isl_seq_elim(bmap->div[k]+1, bmap->eq[done],
826 1+last_var, 1+total, &bmap->div[k][0]);
829 if (last_var >= total_var &&
830 isl_int_is_zero(bmap->div[last_var - total_var][0])) {
831 unsigned div = last_var - total_var;
832 isl_seq_neg(bmap->div[div]+1, bmap->eq[done], 1+total);
833 isl_int_set_si(bmap->div[div][1+1+last_var], 0);
834 isl_int_set(bmap->div[div][0],
835 bmap->eq[done][1+last_var]);
838 if (done == bmap->n_eq)
840 for (k = done; k < bmap->n_eq; ++k) {
841 if (isl_int_is_zero(bmap->eq[k][0]))
843 return isl_basic_map_set_to_empty(ctx, bmap);
845 isl_basic_map_free_equality(ctx, bmap, bmap->n_eq-done);
849 struct isl_basic_set *isl_basic_set_gauss(struct isl_ctx *ctx,
850 struct isl_basic_set *bset, int *progress)
852 return (struct isl_basic_set*)isl_basic_map_gauss(ctx,
853 (struct isl_basic_map *)bset, progress);
856 static unsigned int round_up(unsigned int v)
867 static int hash_index(int *index, unsigned int size, int bits,
868 struct isl_basic_map *bmap, int k)
871 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
872 u_int32_t hash = isl_seq_hash(bmap->ineq[k]+1, total, bits);
873 for (h = hash; index[h]; h = (h+1) % size)
874 if (k != index[h]-1 &&
875 isl_seq_eq(bmap->ineq[k]+1,
876 bmap->ineq[index[h]-1]+1, total))
881 static struct isl_basic_map *remove_duplicate_constraints(
883 struct isl_basic_map *bmap, int *progress)
889 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
892 if (bmap->n_ineq <= 1)
895 size = round_up(4 * (bmap->n_ineq+1) / 3 - 1);
896 bits = ffs(size) - 1;
897 index = isl_alloc_array(ctx, int, size);
898 memset(index, 0, size * sizeof(int));
902 index[isl_seq_hash(bmap->ineq[0]+1, total, bits)] = 1;
903 for (k = 1; k < bmap->n_ineq; ++k) {
904 h = hash_index(index, size, bits, bmap, k);
911 if (isl_int_lt(bmap->ineq[k][0], bmap->ineq[l][0]))
912 swap_inequality(bmap, k, l);
913 isl_basic_map_drop_inequality(ctx, bmap, k);
917 for (k = 0; k < bmap->n_ineq-1; ++k) {
918 isl_seq_neg(bmap->ineq[k]+1, bmap->ineq[k]+1, total);
919 h = hash_index(index, size, bits, bmap, k);
920 isl_seq_neg(bmap->ineq[k]+1, bmap->ineq[k]+1, total);
924 isl_int_add(sum, bmap->ineq[k][0], bmap->ineq[l][0]);
925 if (isl_int_is_pos(sum))
927 if (isl_int_is_zero(sum)) {
928 /* We need to break out of the loop after these
929 * changes since the contents of the hash
930 * will no longer be valid.
931 * Plus, we probably we want to regauss first.
933 isl_basic_map_drop_inequality(ctx, bmap, l);
934 isl_basic_map_inequality_to_equality(ctx, bmap, k);
936 bmap = isl_basic_map_set_to_empty(ctx, bmap);
945 static struct isl_basic_map *remove_duplicate_divs(struct isl_ctx *ctx,
946 struct isl_basic_map *bmap, int *progress)
953 unsigned total_var = bmap->nparam + bmap->n_in + bmap->n_out;
954 unsigned total = total_var + bmap->n_div;
956 if (bmap->n_div <= 1)
959 for (k = bmap->n_div - 1; k >= 0; --k)
960 if (!isl_int_is_zero(bmap->div[k][0]))
965 size = round_up(4 * bmap->n_div / 3 - 1);
966 bits = ffs(size) - 1;
967 index = isl_alloc_array(ctx, int, size);
968 memset(index, 0, size * sizeof(int));
971 eq = isl_blk_alloc(ctx, 1+total);
972 if (isl_blk_is_error(eq))
975 isl_seq_clr(eq.data, 1+total);
976 index[isl_seq_hash(bmap->div[k], 2+total, bits)] = k + 1;
977 for (--k; k >= 0; --k) {
980 if (isl_int_is_zero(bmap->div[k][0]))
983 hash = isl_seq_hash(bmap->div[k], 2+total, bits);
984 for (h = hash; index[h]; h = (h+1) % size)
985 if (isl_seq_eq(bmap->div[k],
986 bmap->div[index[h]-1], 2+total))
991 isl_int_set_si(eq.data[1+total_var+k], -1);
992 isl_int_set_si(eq.data[1+total_var+l], 1);
993 eliminate_div(ctx, bmap, eq.data, l);
994 isl_int_set_si(eq.data[1+total_var+k], 0);
995 isl_int_set_si(eq.data[1+total_var+l], 0);
1000 isl_blk_free(ctx, eq);
1006 static struct isl_basic_map *eliminate_divs(
1007 struct isl_ctx *ctx, struct isl_basic_map *bmap,
1018 off = 1 + bmap->nparam + bmap->n_in + bmap->n_out;
1020 for (d = bmap->n_div - 1; d >= 0 ; --d) {
1021 for (i = 0; i < bmap->n_eq; ++i) {
1022 if (!isl_int_is_one(bmap->eq[i][off + d]) &&
1023 !isl_int_is_negone(bmap->eq[i][off + d]))
1027 eliminate_div(ctx, bmap, bmap->eq[i], d);
1028 isl_basic_map_drop_equality(ctx, bmap, i);
1032 return eliminate_divs(ctx, bmap, progress);
1036 static struct isl_basic_map *normalize_constraints(
1037 struct isl_ctx *ctx, struct isl_basic_map *bmap)
1041 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
1044 for (i = bmap->n_eq - 1; i >= 0; --i) {
1045 isl_seq_gcd(bmap->eq[i]+1, total, &gcd);
1046 if (isl_int_is_zero(gcd)) {
1047 if (!isl_int_is_zero(bmap->eq[i][0])) {
1048 bmap = isl_basic_map_set_to_empty(ctx, bmap);
1051 isl_basic_map_drop_equality(ctx, bmap, i);
1054 if (isl_int_is_one(gcd))
1056 if (!isl_int_is_divisible_by(bmap->eq[i][0], gcd)) {
1057 bmap = isl_basic_map_set_to_empty(ctx, bmap);
1060 isl_seq_scale_down(bmap->eq[i], bmap->eq[i], gcd, 1+total);
1063 for (i = bmap->n_ineq - 1; i >= 0; --i) {
1064 isl_seq_gcd(bmap->ineq[i]+1, total, &gcd);
1065 if (isl_int_is_zero(gcd)) {
1066 if (isl_int_is_neg(bmap->ineq[i][0])) {
1067 bmap = isl_basic_map_set_to_empty(ctx, bmap);
1070 isl_basic_map_drop_inequality(ctx, bmap, i);
1073 if (isl_int_is_one(gcd))
1075 isl_int_fdiv_q(bmap->ineq[i][0], bmap->ineq[i][0], gcd);
1076 isl_seq_scale_down(bmap->ineq[i]+1, bmap->ineq[i]+1, gcd, total);
1083 struct isl_basic_map *isl_basic_map_simplify(
1084 struct isl_ctx *ctx, struct isl_basic_map *bmap)
1091 bmap = normalize_constraints(ctx, bmap);
1092 bmap = eliminate_divs(ctx, bmap, &progress);
1093 bmap = isl_basic_map_gauss(ctx, bmap, &progress);
1094 bmap = remove_duplicate_divs(ctx, bmap, &progress);
1095 bmap = remove_duplicate_constraints(ctx, bmap, &progress);
1100 struct isl_basic_set *isl_basic_set_simplify(
1101 struct isl_ctx *ctx, struct isl_basic_set *bset)
1103 return (struct isl_basic_set *)
1104 isl_basic_map_simplify(ctx,
1105 (struct isl_basic_map *)bset);
1108 static void dump_term(struct isl_basic_map *bmap,
1109 isl_int c, int pos, FILE *out)
1111 unsigned in = bmap->n_in;
1112 unsigned dim = bmap->n_in + bmap->n_out;
1114 isl_int_print(out, c);
1116 if (!isl_int_is_one(c))
1117 isl_int_print(out, c);
1118 if (pos < 1 + bmap->nparam)
1119 fprintf(out, "p%d", pos - 1);
1120 else if (pos < 1 + bmap->nparam + in)
1121 fprintf(out, "i%d", pos - 1 - bmap->nparam);
1122 else if (pos < 1 + bmap->nparam + dim)
1123 fprintf(out, "o%d", pos - 1 - bmap->nparam - in);
1125 fprintf(out, "e%d", pos - 1 - bmap->nparam - dim);
1129 static void dump_constraint_sign(struct isl_basic_map *bmap, isl_int *c,
1130 int sign, FILE *out)
1134 unsigned len = 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
1138 for (i = 0, first = 1; i < len; ++i) {
1139 if (isl_int_sgn(c[i]) * sign <= 0)
1142 fprintf(out, " + ");
1144 isl_int_abs(v, c[i]);
1145 dump_term(bmap, v, i, out);
1152 static void dump_constraint(struct isl_basic_map *bmap, isl_int *c,
1153 const char *op, FILE *out, int indent)
1157 fprintf(out, "%*s", indent, "");
1159 dump_constraint_sign(bmap, c, 1, out);
1160 fprintf(out, " %s ", op);
1161 dump_constraint_sign(bmap, c, -1, out);
1165 for (i = bmap->n_div; i < bmap->extra; ++i) {
1166 if (isl_int_is_zero(c[1+bmap->nparam+bmap->n_in+bmap->n_out+i]))
1168 fprintf(out, "%*s", indent, "");
1169 fprintf(out, "ERROR: unused div coefficient not zero\n");
1173 static void dump_constraints(struct isl_basic_map *bmap,
1174 isl_int **c, unsigned n,
1175 const char *op, FILE *out, int indent)
1179 for (i = 0; i < n; ++i)
1180 dump_constraint(bmap, c[i], op, out, indent);
1183 static void dump_affine(struct isl_basic_map *bmap, isl_int *exp, FILE *out)
1187 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
1189 for (j = 0; j < 1 + total; ++j) {
1190 if (isl_int_is_zero(exp[j]))
1192 if (!first && isl_int_is_pos(exp[j]))
1194 dump_term(bmap, exp[j], j, out);
1199 static void dump(struct isl_basic_map *bmap, FILE *out, int indent)
1203 dump_constraints(bmap, bmap->eq, bmap->n_eq, "=", out, indent);
1204 dump_constraints(bmap, bmap->ineq, bmap->n_ineq, ">=", out, indent);
1206 for (i = 0; i < bmap->n_div; ++i) {
1207 fprintf(out, "%*s", indent, "");
1208 fprintf(out, "e%d = [(", i);
1209 dump_affine(bmap, bmap->div[i]+1, out);
1211 isl_int_print(out, bmap->div[i][0]);
1212 fprintf(out, "]\n");
1216 void isl_basic_set_dump(struct isl_ctx *ctx, struct isl_basic_set *bset,
1217 FILE *out, int indent)
1220 fprintf(out, "null basic set\n");
1224 fprintf(out, "%*s", indent, "");
1225 fprintf(out, "nparam: %d, dim: %d, extra: %d\n",
1226 bset->nparam, bset->dim, bset->extra);
1227 dump((struct isl_basic_map *)bset, out, indent);
1230 void isl_basic_map_dump(struct isl_ctx *ctx, struct isl_basic_map *bmap,
1231 FILE *out, int indent)
1234 fprintf(out, "null basic map\n");
1238 fprintf(out, "%*s", indent, "");
1239 fprintf(out, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d\n",
1241 bmap->nparam, bmap->n_in, bmap->n_out, bmap->extra);
1242 dump(bmap, out, indent);
1245 int isl_inequality_negate(struct isl_ctx *ctx,
1246 struct isl_basic_map *bmap, unsigned pos)
1248 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
1249 isl_assert(ctx, pos < bmap->n_ineq, return -1);
1250 isl_seq_neg(bmap->ineq[pos], bmap->ineq[pos], 1 + total);
1251 isl_int_sub_ui(bmap->ineq[pos][0], bmap->ineq[pos][0], 1);
1255 struct isl_set *isl_set_alloc(struct isl_ctx *ctx,
1256 unsigned nparam, unsigned dim, int n, unsigned flags)
1258 struct isl_set *set;
1260 set = isl_alloc(ctx, struct isl_set,
1261 sizeof(struct isl_set) +
1262 n * sizeof(struct isl_basic_set *));
1269 set->nparam = nparam;
1276 struct isl_set *isl_set_dup(struct isl_ctx *ctx, struct isl_set *set)
1279 struct isl_set *dup;
1281 dup = isl_set_alloc(ctx, set->nparam, set->dim, set->n, set->flags);
1284 for (i = 0; i < set->n; ++i)
1285 dup = isl_set_add(ctx, dup,
1286 isl_basic_set_dup(ctx, set->p[i]));
1290 struct isl_set *isl_set_from_basic_set(struct isl_ctx *ctx,
1291 struct isl_basic_set *bset)
1293 struct isl_set *set;
1295 set = isl_set_alloc(ctx, bset->nparam, bset->dim, 1, ISL_MAP_DISJOINT);
1297 isl_basic_set_free(ctx, bset);
1300 return isl_set_add(ctx, set, bset);
1303 struct isl_map *isl_map_from_basic_map(struct isl_ctx *ctx,
1304 struct isl_basic_map *bmap)
1306 struct isl_map *map;
1308 map = isl_map_alloc(ctx, bmap->nparam, bmap->n_in, bmap->n_out, 1,
1311 isl_basic_map_free(ctx, bmap);
1314 return isl_map_add(ctx, map, bmap);
1317 struct isl_set *isl_set_add(struct isl_ctx *ctx, struct isl_set *set,
1318 struct isl_basic_set *bset)
1322 isl_assert(ctx, set->nparam == bset->nparam, goto error);
1323 isl_assert(ctx, set->dim == bset->dim, goto error);
1324 isl_assert(ctx, set->n < set->size, goto error);
1325 set->p[set->n] = bset;
1330 isl_set_free(ctx, set);
1332 isl_basic_set_free(ctx, bset);
1336 void isl_set_free(struct isl_ctx *ctx, struct isl_set *set)
1346 for (i = 0; i < set->n; ++i)
1347 isl_basic_set_free(ctx, set->p[i]);
1351 void isl_set_dump(struct isl_ctx *ctx, struct isl_set *set, FILE *out,
1357 fprintf(out, "null set\n");
1361 fprintf(out, "%*s", indent, "");
1362 fprintf(out, "ref: %d, n: %d\n", set->ref, set->n);
1363 for (i = 0; i < set->n; ++i) {
1364 fprintf(out, "%*s", indent, "");
1365 fprintf(out, "basic set %d:\n", i);
1366 isl_basic_set_dump(ctx, set->p[i], out, indent+4);
1370 void isl_map_dump(struct isl_ctx *ctx, struct isl_map *map, FILE *out,
1376 fprintf(out, "null map\n");
1380 fprintf(out, "%*s", indent, "");
1381 fprintf(out, "ref: %d, n: %d, nparam: %d, in: %d, out: %d\n",
1382 map->ref, map->n, map->nparam, map->n_in, map->n_out);
1383 for (i = 0; i < map->n; ++i) {
1384 fprintf(out, "%*s", indent, "");
1385 fprintf(out, "basic map %d:\n", i);
1386 isl_basic_map_dump(ctx, map->p[i], out, indent+4);
1390 struct isl_basic_map *isl_basic_map_intersect_domain(
1391 struct isl_ctx *ctx, struct isl_basic_map *bmap,
1392 struct isl_basic_set *bset)
1394 struct isl_basic_map *bmap_domain;
1399 isl_assert(ctx, bset->dim == bmap->n_in, goto error);
1400 isl_assert(ctx, bset->nparam == bmap->nparam, goto error);
1402 bmap = isl_basic_map_extend(ctx, bmap,
1403 bset->nparam, bmap->n_in, bmap->n_out,
1404 bset->n_div, bset->n_eq, bset->n_ineq);
1407 bmap_domain = isl_basic_map_from_basic_set(ctx, bset,
1409 bmap = add_constraints(ctx, bmap, bmap_domain, 0, 0);
1411 bmap = isl_basic_map_simplify(ctx, bmap);
1412 return isl_basic_map_finalize(ctx, bmap);
1414 isl_basic_map_free(ctx, bmap);
1415 isl_basic_set_free(ctx, bset);
1419 struct isl_basic_map *isl_basic_map_intersect_range(
1420 struct isl_ctx *ctx, struct isl_basic_map *bmap,
1421 struct isl_basic_set *bset)
1423 struct isl_basic_map *bmap_range;
1428 isl_assert(ctx, bset->dim == bmap->n_out, goto error);
1429 isl_assert(ctx, bset->nparam == bmap->nparam, goto error);
1431 bmap = isl_basic_map_extend(ctx, bmap,
1432 bset->nparam, bmap->n_in, bmap->n_out,
1433 bset->n_div, bset->n_eq, bset->n_ineq);
1436 bmap_range = isl_basic_map_from_basic_set(ctx, bset,
1438 bmap = add_constraints(ctx, bmap, bmap_range, 0, 0);
1440 bmap = isl_basic_map_simplify(ctx, bmap);
1441 return isl_basic_map_finalize(ctx, bmap);
1443 isl_basic_map_free(ctx, bmap);
1444 isl_basic_set_free(ctx, bset);
1448 struct isl_basic_map *isl_basic_map_intersect(
1449 struct isl_ctx *ctx, struct isl_basic_map *bmap1,
1450 struct isl_basic_map *bmap2)
1452 if (!bmap1 || !bmap2)
1455 isl_assert(ctx, bmap1->nparam == bmap2->nparam, goto error);
1456 isl_assert(ctx, bmap1->n_in == bmap2->n_in, goto error);
1457 isl_assert(ctx, bmap1->n_out == bmap2->n_out, goto error);
1459 bmap1 = isl_basic_map_extend(ctx, bmap1,
1460 bmap1->nparam, bmap1->n_in, bmap1->n_out,
1461 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
1464 bmap1 = add_constraints(ctx, bmap1, bmap2, 0, 0);
1466 bmap1 = isl_basic_map_simplify(ctx, bmap1);
1467 return isl_basic_map_finalize(ctx, bmap1);
1469 isl_basic_map_free(ctx, bmap1);
1470 isl_basic_map_free(ctx, bmap2);
1474 struct isl_basic_set *isl_basic_set_intersect(
1475 struct isl_ctx *ctx, struct isl_basic_set *bset1,
1476 struct isl_basic_set *bset2)
1478 return (struct isl_basic_set *)
1479 isl_basic_map_intersect(ctx,
1480 (struct isl_basic_map *)bset1,
1481 (struct isl_basic_map *)bset2);
1484 struct isl_map *isl_map_intersect(struct isl_ctx *ctx, struct isl_map *map1,
1485 struct isl_map *map2)
1488 struct isl_map *result;
1494 if (F_ISSET(map1, ISL_MAP_DISJOINT) &&
1495 F_ISSET(map2, ISL_MAP_DISJOINT))
1496 FL_SET(flags, ISL_MAP_DISJOINT);
1498 result = isl_map_alloc(ctx, map1->nparam, map1->n_in, map1->n_out,
1499 map1->n * map2->n, flags);
1502 for (i = 0; i < map1->n; ++i)
1503 for (j = 0; j < map2->n; ++j) {
1504 struct isl_basic_map *part;
1505 part = isl_basic_map_intersect(ctx,
1506 isl_basic_map_copy(ctx, map1->p[i]),
1507 isl_basic_map_copy(ctx, map2->p[j]));
1508 if (isl_basic_map_is_empty(ctx, part))
1509 isl_basic_map_free(ctx, part);
1511 result = isl_map_add(ctx, result, part);
1515 isl_map_free(ctx, map1);
1516 isl_map_free(ctx, map2);
1519 isl_map_free(ctx, map1);
1520 isl_map_free(ctx, map2);
1524 struct isl_basic_map *isl_basic_map_reverse(struct isl_ctx *ctx,
1525 struct isl_basic_map *bmap)
1527 struct isl_basic_set *bset;
1532 bmap = isl_basic_map_cow(ctx, bmap);
1536 bset = isl_basic_set_from_basic_map(ctx, bmap);
1537 bset = isl_basic_set_swap_vars(ctx, bset, in);
1538 return isl_basic_map_from_basic_set(ctx, bset, bset->dim-in, in);
1541 /* Turn final n dimensions into existentially quantified variables.
1543 struct isl_basic_set *isl_basic_set_project_out(
1544 struct isl_ctx *ctx, struct isl_basic_set *bset,
1545 unsigned n, unsigned flags)
1555 isl_assert(ctx, n <= bset->dim, goto error);
1560 bset = isl_basic_set_cow(ctx, bset);
1562 row_size = 1 + bset->nparam + bset->dim + bset->extra;
1563 old = bset->block2.data;
1564 bset->block2 = isl_blk_extend(ctx, bset->block2,
1565 (bset->extra + n) * (1 + row_size));
1566 if (!bset->block2.data)
1568 new_div = isl_alloc_array(ctx, isl_int *, bset->extra + n);
1571 for (i = 0; i < n; ++i) {
1572 new_div[i] = bset->block2.data +
1573 (bset->extra + i) * (1 + row_size);
1574 isl_seq_clr(new_div[i], 1 + row_size);
1576 for (i = 0; i < bset->extra; ++i)
1577 new_div[n + i] = bset->block2.data + (bset->div[i] - old);
1579 bset->div = new_div;
1583 bset = isl_basic_set_simplify(ctx, bset);
1584 return isl_basic_set_finalize(ctx, bset);
1586 isl_basic_set_free(ctx, bset);
1590 struct isl_basic_map *isl_basic_map_apply_range(
1591 struct isl_ctx *ctx, struct isl_basic_map *bmap1,
1592 struct isl_basic_map *bmap2)
1594 struct isl_basic_set *bset;
1595 unsigned n_in, n_out;
1597 if (!bmap1 || !bmap2)
1600 isl_assert(ctx, bmap1->n_out == bmap2->n_in, goto error);
1601 isl_assert(ctx, bmap1->nparam == bmap2->nparam, goto error);
1604 n_out = bmap2->n_out;
1606 bmap2 = isl_basic_map_reverse(ctx, bmap2);
1609 bmap1 = isl_basic_map_extend(ctx, bmap1, bmap1->nparam,
1610 bmap1->n_in + bmap2->n_in, bmap1->n_out,
1611 bmap2->extra, bmap2->n_eq, bmap2->n_ineq);
1614 bmap1 = add_constraints(ctx, bmap1, bmap2, bmap1->n_in - bmap2->n_in, 0);
1615 bmap1 = isl_basic_map_simplify(ctx, bmap1);
1616 bset = isl_basic_set_from_basic_map(ctx, bmap1);
1617 bset = isl_basic_set_project_out(ctx, bset,
1618 bset->dim - (n_in + n_out), 0);
1619 return isl_basic_map_from_basic_set(ctx, bset, n_in, n_out);
1621 isl_basic_map_free(ctx, bmap1);
1622 isl_basic_map_free(ctx, bmap2);
1626 struct isl_basic_map *isl_basic_map_apply_domain(
1627 struct isl_ctx *ctx, struct isl_basic_map *bmap1,
1628 struct isl_basic_map *bmap2)
1630 if (!bmap1 || !bmap2)
1633 isl_assert(ctx, bmap1->n_in == bmap2->n_in, goto error);
1634 isl_assert(ctx, bmap1->nparam == bmap2->nparam, goto error);
1636 bmap1 = isl_basic_map_reverse(ctx, bmap1);
1637 bmap1 = isl_basic_map_apply_range(ctx, bmap1, bmap2);
1638 return isl_basic_map_reverse(ctx, bmap1);
1640 isl_basic_map_free(ctx, bmap1);
1641 isl_basic_map_free(ctx, bmap2);
1645 static struct isl_basic_map *var_equal(struct isl_ctx *ctx,
1646 struct isl_basic_map *bmap, unsigned pos)
1649 i = isl_basic_map_alloc_equality(ctx, bmap);
1652 isl_seq_clr(bmap->eq[i],
1653 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->extra);
1654 isl_int_set_si(bmap->eq[i][1+bmap->nparam+pos], -1);
1655 isl_int_set_si(bmap->eq[i][1+bmap->nparam+bmap->n_in+pos], 1);
1656 return isl_basic_map_finalize(ctx, bmap);
1658 isl_basic_map_free(ctx, bmap);
1662 static struct isl_basic_map *var_more(struct isl_ctx *ctx,
1663 struct isl_basic_map *bmap, unsigned pos)
1666 i = isl_basic_map_alloc_inequality(ctx, bmap);
1669 isl_seq_clr(bmap->ineq[i],
1670 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->extra);
1671 isl_int_set_si(bmap->ineq[i][0], -1);
1672 isl_int_set_si(bmap->ineq[i][1+bmap->nparam+pos], -1);
1673 isl_int_set_si(bmap->ineq[i][1+bmap->nparam+bmap->n_in+pos], 1);
1674 return isl_basic_map_finalize(ctx, bmap);
1676 isl_basic_map_free(ctx, bmap);
1680 static struct isl_basic_map *var_less(struct isl_ctx *ctx,
1681 struct isl_basic_map *bmap, unsigned pos)
1684 i = isl_basic_map_alloc_inequality(ctx, bmap);
1687 isl_seq_clr(bmap->ineq[i],
1688 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->extra);
1689 isl_int_set_si(bmap->ineq[i][0], -1);
1690 isl_int_set_si(bmap->ineq[i][1+bmap->nparam+pos], 1);
1691 isl_int_set_si(bmap->ineq[i][1+bmap->nparam+bmap->n_in+pos], -1);
1692 return isl_basic_map_finalize(ctx, bmap);
1694 isl_basic_map_free(ctx, bmap);
1698 struct isl_basic_map *isl_basic_map_equal(struct isl_ctx *ctx,
1699 unsigned nparam, unsigned in, unsigned out, unsigned n_equal)
1702 struct isl_basic_map *bmap;
1703 bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, n_equal, 0);
1706 for (i = 0; i < n_equal && bmap; ++i)
1707 bmap = var_equal(ctx, bmap, i);
1708 return isl_basic_map_finalize(ctx, bmap);
1711 struct isl_basic_map *isl_basic_map_less_at(struct isl_ctx *ctx,
1712 unsigned nparam, unsigned in, unsigned out, unsigned pos)
1715 struct isl_basic_map *bmap;
1716 bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, pos, 1);
1719 for (i = 0; i < pos && bmap; ++i)
1720 bmap = var_equal(ctx, bmap, i);
1722 bmap = var_less(ctx, bmap, pos);
1723 return isl_basic_map_finalize(ctx, bmap);
1726 struct isl_basic_map *isl_basic_map_more_at(struct isl_ctx *ctx,
1727 unsigned nparam, unsigned in, unsigned out, unsigned pos)
1730 struct isl_basic_map *bmap;
1731 bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, pos, 1);
1734 for (i = 0; i < pos && bmap; ++i)
1735 bmap = var_equal(ctx, bmap, i);
1737 bmap = var_more(ctx, bmap, pos);
1738 return isl_basic_map_finalize(ctx, bmap);
1741 struct isl_basic_map *isl_basic_map_from_basic_set(
1742 struct isl_ctx *ctx, struct isl_basic_set *bset,
1743 unsigned n_in, unsigned n_out)
1745 struct isl_basic_map *bmap;
1747 bset = isl_basic_set_cow(ctx, bset);
1751 isl_assert(ctx, bset->dim == n_in + n_out, goto error);
1752 bmap = (struct isl_basic_map *) bset;
1754 bmap->n_out = n_out;
1755 return isl_basic_map_finalize(ctx, bmap);
1757 isl_basic_set_free(ctx, bset);
1761 struct isl_basic_set *isl_basic_set_from_basic_map(
1762 struct isl_ctx *ctx, struct isl_basic_map *bmap)
1766 if (bmap->n_in == 0)
1767 return (struct isl_basic_set *)bmap;
1768 bmap = isl_basic_map_cow(ctx, bmap);
1771 bmap->n_out += bmap->n_in;
1773 bmap = isl_basic_map_finalize(ctx, bmap);
1774 return (struct isl_basic_set *)bmap;
1779 static struct isl_basic_set *isl_basic_map_underlying_set(
1780 struct isl_ctx *ctx, struct isl_basic_map *bmap)
1784 if (bmap->nparam == 0 && bmap->n_in == 0 && bmap->n_div == 0)
1785 return (struct isl_basic_set *)bmap;
1786 bmap = isl_basic_map_cow(ctx, bmap);
1789 bmap->n_out += bmap->nparam + bmap->n_in + bmap->n_div;
1793 bmap = isl_basic_map_finalize(ctx, bmap);
1794 return (struct isl_basic_set *)bmap;
1799 struct isl_basic_set *isl_basic_map_domain(struct isl_ctx *ctx,
1800 struct isl_basic_map *bmap)
1802 struct isl_basic_set *domain;
1806 n_out = bmap->n_out;
1807 domain = isl_basic_set_from_basic_map(ctx, bmap);
1808 return isl_basic_set_project_out(ctx, domain, n_out, 0);
1811 struct isl_basic_set *isl_basic_map_range(struct isl_ctx *ctx,
1812 struct isl_basic_map *bmap)
1814 return isl_basic_map_domain(ctx,
1815 isl_basic_map_reverse(ctx, bmap));
1818 struct isl_set *isl_map_range(struct isl_ctx *ctx, struct isl_map *map)
1821 struct isl_set *set;
1825 map = isl_map_cow(ctx, map);
1829 set = (struct isl_set *) map;
1831 for (i = 0; i < map->n; ++i) {
1832 set->p[i] = isl_basic_map_range(ctx, map->p[i]);
1836 F_CLR(set, ISL_MAP_DISJOINT);
1839 isl_map_free(ctx, map);
1843 struct isl_map *isl_map_from_set(
1844 struct isl_ctx *ctx, struct isl_set *set,
1845 unsigned n_in, unsigned n_out)
1848 struct isl_map *map = NULL;
1852 isl_assert(ctx, set->dim == n_in + n_out, goto error);
1853 set = isl_set_cow(ctx, set);
1856 map = (struct isl_map *)set;
1857 for (i = 0; i < set->n; ++i) {
1858 map->p[i] = isl_basic_map_from_basic_set(ctx,
1859 set->p[i], n_in, n_out);
1867 isl_set_free(ctx, set);
1871 struct isl_map *isl_map_alloc(struct isl_ctx *ctx,
1872 unsigned nparam, unsigned in, unsigned out, int n,
1875 struct isl_map *map;
1877 map = isl_alloc(ctx, struct isl_map,
1878 sizeof(struct isl_map) +
1879 n * sizeof(struct isl_basic_map *));
1886 map->nparam = nparam;
1893 struct isl_basic_map *isl_basic_map_empty(struct isl_ctx *ctx,
1894 unsigned nparam, unsigned in, unsigned out)
1896 struct isl_basic_map *bmap;
1897 bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, 1, 0);
1898 bmap = isl_basic_map_set_to_empty(ctx, bmap);
1902 struct isl_map *isl_map_empty(struct isl_ctx *ctx,
1903 unsigned nparam, unsigned in, unsigned out)
1905 return isl_map_alloc(ctx, nparam, in, out, 0, ISL_MAP_DISJOINT);
1908 struct isl_set *isl_set_empty(struct isl_ctx *ctx,
1909 unsigned nparam, unsigned dim)
1911 return isl_set_alloc(ctx, nparam, dim, 0, ISL_MAP_DISJOINT);
1914 struct isl_map *isl_map_dup(struct isl_ctx *ctx, struct isl_map *map)
1917 struct isl_map *dup;
1919 dup = isl_map_alloc(ctx, map->nparam, map->n_in, map->n_out, map->n,
1921 for (i = 0; i < map->n; ++i)
1922 dup = isl_map_add(ctx, dup,
1923 isl_basic_map_dup(ctx, map->p[i]));
1927 struct isl_map *isl_map_add(struct isl_ctx *ctx, struct isl_map *map,
1928 struct isl_basic_map *bmap)
1932 isl_assert(ctx, map->nparam == bmap->nparam, goto error);
1933 isl_assert(ctx, map->n_in == bmap->n_in, goto error);
1934 isl_assert(ctx, map->n_out == bmap->n_out, goto error);
1935 isl_assert(ctx, map->n < map->size, goto error);
1936 map->p[map->n] = bmap;
1941 isl_map_free(ctx, map);
1943 isl_basic_map_free(ctx, bmap);
1947 void isl_map_free(struct isl_ctx *ctx, struct isl_map *map)
1957 for (i = 0; i < map->n; ++i)
1958 isl_basic_map_free(ctx, map->p[i]);
1962 struct isl_map *isl_map_extend(struct isl_ctx *ctx, struct isl_map *base,
1963 unsigned nparam, unsigned n_in, unsigned n_out)
1967 base = isl_map_cow(ctx, base);
1971 isl_assert(ctx, base->nparam <= nparam, goto error);
1972 isl_assert(ctx, base->n_in <= n_in, goto error);
1973 isl_assert(ctx, base->n_out <= n_out, goto error);
1974 base->nparam = nparam;
1976 base->n_out = n_out;
1977 for (i = 0; i < base->n; ++i) {
1978 base->p[i] = isl_basic_map_extend(ctx, base->p[i],
1979 nparam, n_in, n_out, 0, 0, 0);
1985 isl_map_free(ctx, base);
1989 struct isl_basic_map *isl_basic_map_fix_input_si(struct isl_ctx *ctx,
1990 struct isl_basic_map *bmap,
1991 unsigned input, int value)
1995 bmap = isl_basic_map_cow(ctx, bmap);
1998 isl_assert(ctx, input < bmap->n_in, goto error);
2000 bmap = isl_basic_map_extend(ctx, bmap,
2001 bmap->nparam, bmap->n_in, bmap->n_out, 0, 1, 0);
2002 j = isl_basic_map_alloc_equality(ctx, bmap);
2005 isl_seq_clr(bmap->eq[j],
2006 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->extra);
2007 isl_int_set_si(bmap->eq[j][1+bmap->nparam+input], -1);
2008 isl_int_set_si(bmap->eq[j][0], value);
2009 bmap = isl_basic_map_simplify(ctx, bmap);
2010 return isl_basic_map_finalize(ctx, bmap);
2012 isl_basic_map_free(ctx, bmap);
2016 struct isl_map *isl_map_fix_input_si(struct isl_ctx *ctx, struct isl_map *map,
2017 unsigned input, int value)
2021 map = isl_map_cow(ctx, map);
2025 isl_assert(ctx, input < map->n_in, goto error);
2026 for (i = 0; i < map->n; ++i) {
2027 map->p[i] = isl_basic_map_fix_input_si(ctx, map->p[i],
2034 isl_map_free(ctx, map);
2038 struct isl_map *isl_map_reverse(struct isl_ctx *ctx, struct isl_map *map)
2043 map = isl_map_cow(ctx, map);
2048 map->n_in = map->n_out;
2050 for (i = 0; i < map->n; ++i) {
2051 map->p[i] = isl_basic_map_reverse(ctx, map->p[i]);
2057 isl_map_free(ctx, map);
2061 struct isl_map *isl_basic_map_lexmax(struct isl_ctx *ctx,
2062 struct isl_basic_map *bmap, struct isl_basic_set *dom,
2063 struct isl_set **empty)
2065 return isl_pip_basic_map_lexmax(ctx, bmap, dom, empty);
2068 struct isl_map *isl_basic_map_lexmin(struct isl_ctx *ctx,
2069 struct isl_basic_map *bmap, struct isl_basic_set *dom,
2070 struct isl_set **empty)
2072 return isl_pip_basic_map_lexmin(ctx, bmap, dom, empty);
2075 struct isl_set *isl_basic_set_lexmin(struct isl_ctx *ctx,
2076 struct isl_basic_set *bset)
2078 struct isl_basic_map *bmap = NULL;
2079 struct isl_basic_set *dom = NULL;
2080 struct isl_map *min;
2084 bmap = isl_basic_map_from_basic_set(ctx, bset, 0, bset->dim);
2087 dom = isl_basic_set_alloc(ctx, bmap->nparam, 0, 0, 0, 0);
2090 min = isl_basic_map_lexmin(ctx, bmap, dom, NULL);
2091 return isl_map_range(ctx, min);
2093 isl_basic_map_free(ctx, bmap);
2097 struct isl_map *isl_basic_map_compute_divs(struct isl_ctx *ctx,
2098 struct isl_basic_map *bmap)
2102 if (bmap->n_div == 0)
2103 return isl_map_from_basic_map(ctx, bmap);
2104 return isl_pip_basic_map_compute_divs(ctx, bmap);
2107 struct isl_map *isl_map_compute_divs(struct isl_ctx *ctx, struct isl_map *map)
2110 struct isl_map *res;
2116 res = isl_basic_map_compute_divs(ctx,
2117 isl_basic_map_copy(ctx, map->p[0]));
2118 for (i = 1 ; i < map->n; ++i) {
2120 r2 = isl_basic_map_compute_divs(ctx,
2121 isl_basic_map_copy(ctx, map->p[i]));
2122 if (F_ISSET(map, ISL_MAP_DISJOINT))
2123 res = isl_map_union_disjoint(ctx, res, r2);
2125 res = isl_map_union(ctx, res, r2);
2127 isl_map_free(ctx, map);
2132 struct isl_set *isl_basic_set_compute_divs(struct isl_ctx *ctx,
2133 struct isl_basic_set *bset)
2135 return (struct isl_set *)
2136 isl_basic_map_compute_divs(ctx,
2137 (struct isl_basic_map *)bset);
2140 struct isl_set *isl_map_domain(struct isl_ctx *ctx, struct isl_map *map)
2143 struct isl_set *set;
2148 map = isl_map_cow(ctx, map);
2152 set = (struct isl_set *)map;
2153 set->dim = map->n_in;
2155 for (i = 0; i < map->n; ++i) {
2156 set->p[i] = isl_basic_map_domain(ctx, map->p[i]);
2160 F_CLR(set, ISL_MAP_DISJOINT);
2163 isl_map_free(ctx, map);
2167 struct isl_map *isl_map_union_disjoint(struct isl_ctx *ctx,
2168 struct isl_map *map1, struct isl_map *map2)
2172 struct isl_map *map = NULL;
2178 isl_map_free(ctx, map1);
2182 isl_map_free(ctx, map2);
2186 isl_assert(ctx, map1->nparam == map2->nparam, goto error);
2187 isl_assert(ctx, map1->n_in == map2->n_in, goto error);
2188 isl_assert(ctx, map1->n_out == map2->n_out, goto error);
2190 if (F_ISSET(map1, ISL_MAP_DISJOINT) &&
2191 F_ISSET(map2, ISL_MAP_DISJOINT))
2192 FL_SET(flags, ISL_MAP_DISJOINT);
2194 map = isl_map_alloc(ctx, map1->nparam, map1->n_in, map1->n_out,
2195 map1->n + map2->n, flags);
2198 for (i = 0; i < map1->n; ++i) {
2199 map = isl_map_add(ctx, map,
2200 isl_basic_map_copy(ctx, map1->p[i]));
2204 for (i = 0; i < map2->n; ++i) {
2205 map = isl_map_add(ctx, map,
2206 isl_basic_map_copy(ctx, map2->p[i]));
2210 isl_map_free(ctx, map1);
2211 isl_map_free(ctx, map2);
2214 isl_map_free(ctx, map);
2215 isl_map_free(ctx, map1);
2216 isl_map_free(ctx, map2);
2220 struct isl_map *isl_map_union(struct isl_ctx *ctx,
2221 struct isl_map *map1, struct isl_map *map2)
2223 map1 = isl_map_union_disjoint(ctx, map1, map2);
2227 F_CLR(map1, ISL_MAP_DISJOINT);
2231 struct isl_set *isl_set_union_disjoint(struct isl_ctx *ctx,
2232 struct isl_set *set1, struct isl_set *set2)
2234 return (struct isl_set *)
2235 isl_map_union_disjoint(ctx,
2236 (struct isl_map *)set1, (struct isl_map *)set2);
2239 struct isl_set *isl_set_union(struct isl_ctx *ctx,
2240 struct isl_set *set1, struct isl_set *set2)
2242 return (struct isl_set *)
2244 (struct isl_map *)set1, (struct isl_map *)set2);
2247 struct isl_map *isl_map_intersect_range(
2248 struct isl_ctx *ctx, struct isl_map *map,
2249 struct isl_set *set)
2252 struct isl_map *result;
2258 if (F_ISSET(map, ISL_MAP_DISJOINT) &&
2259 F_ISSET(set, ISL_MAP_DISJOINT))
2260 FL_SET(flags, ISL_MAP_DISJOINT);
2262 result = isl_map_alloc(ctx, map->nparam, map->n_in, map->n_out,
2263 map->n * set->n, flags);
2266 for (i = 0; i < map->n; ++i)
2267 for (j = 0; j < set->n; ++j) {
2268 result = isl_map_add(ctx, result,
2269 isl_basic_map_intersect_range(ctx,
2270 isl_basic_map_copy(ctx, map->p[i]),
2271 isl_basic_set_copy(ctx, set->p[j])));
2275 isl_map_free(ctx, map);
2276 isl_set_free(ctx, set);
2279 isl_map_free(ctx, map);
2280 isl_set_free(ctx, set);
2284 struct isl_map *isl_map_intersect_domain(
2285 struct isl_ctx *ctx, struct isl_map *map,
2286 struct isl_set *set)
2288 return isl_map_reverse(ctx,
2289 isl_map_intersect_range(ctx, isl_map_reverse(ctx, map), set));
2292 struct isl_map *isl_map_apply_domain(
2293 struct isl_ctx *ctx, struct isl_map *map1,
2294 struct isl_map *map2)
2298 map1 = isl_map_reverse(ctx, map1);
2299 map1 = isl_map_apply_range(ctx, map1, map2);
2300 return isl_map_reverse(ctx, map1);
2302 isl_map_free(ctx, map1);
2303 isl_map_free(ctx, map2);
2307 struct isl_map *isl_map_apply_range(
2308 struct isl_ctx *ctx, struct isl_map *map1,
2309 struct isl_map *map2)
2311 struct isl_map *result;
2317 isl_assert(ctx, map1->nparam == map2->nparam, goto error);
2318 isl_assert(ctx, map1->n_out == map2->n_in, goto error);
2320 result = isl_map_alloc(ctx, map1->nparam, map1->n_in, map2->n_out,
2321 map1->n * map2->n, 0);
2324 for (i = 0; i < map1->n; ++i)
2325 for (j = 0; j < map2->n; ++j) {
2326 result = isl_map_add(ctx, result,
2327 isl_basic_map_apply_range(ctx,
2328 isl_basic_map_copy(ctx, map1->p[i]),
2329 isl_basic_map_copy(ctx, map2->p[j])));
2333 isl_map_free(ctx, map1);
2334 isl_map_free(ctx, map2);
2337 isl_map_free(ctx, map1);
2338 isl_map_free(ctx, map2);
2343 * returns range - domain
2345 struct isl_basic_set *isl_basic_map_deltas(struct isl_ctx *ctx,
2346 struct isl_basic_map *bmap)
2348 struct isl_basic_set *bset;
2354 isl_assert(ctx, bmap->n_in == bmap->n_out, goto error);
2356 bset = isl_basic_set_from_basic_map(ctx, bmap);
2357 bset = isl_basic_set_extend(ctx, bset, bset->nparam, 3*dim, 0,
2359 bset = isl_basic_set_swap_vars(ctx, bset, 2*dim);
2360 for (i = 0; i < dim; ++i) {
2361 int j = isl_basic_map_alloc_equality(ctx,
2362 (struct isl_basic_map *)bset);
2365 isl_seq_clr(bset->eq[j],
2366 1 + bset->nparam + bset->dim + bset->extra);
2367 isl_int_set_si(bset->eq[j][1+bset->nparam+i], 1);
2368 isl_int_set_si(bset->eq[j][1+bset->nparam+dim+i], 1);
2369 isl_int_set_si(bset->eq[j][1+bset->nparam+2*dim+i], -1);
2371 return isl_basic_set_project_out(ctx, bset, 2*dim, 0);
2373 isl_basic_map_free(ctx, bmap);
2377 /* If the only constraints a div d=floor(f/m)
2378 * appears in are its two defining constraints
2381 * -(f - (m - 1)) + m d >= 0
2383 * then it can safely be removed.
2385 static int div_is_redundant(struct isl_ctx *ctx, struct isl_basic_map *bmap,
2389 unsigned pos = 1 + bmap->nparam + bmap->n_in + bmap->n_out + div;
2391 for (i = 0; i < bmap->n_eq; ++i)
2392 if (!isl_int_is_zero(bmap->eq[i][pos]))
2395 for (i = 0; i < bmap->n_ineq; ++i) {
2396 if (isl_int_is_zero(bmap->ineq[i][pos]))
2398 if (isl_int_eq(bmap->ineq[i][pos], bmap->div[div][0])) {
2400 isl_int_sub(bmap->div[div][1],
2401 bmap->div[div][1], bmap->div[div][0]);
2402 isl_int_add_ui(bmap->div[div][1], bmap->div[div][1], 1);
2403 neg = isl_seq_is_neg(bmap->ineq[i], bmap->div[div]+1, pos);
2404 isl_int_sub_ui(bmap->div[div][1], bmap->div[div][1], 1);
2405 isl_int_add(bmap->div[div][1],
2406 bmap->div[div][1], bmap->div[div][0]);
2409 if (isl_seq_first_non_zero(bmap->ineq[i]+pos+1,
2410 bmap->n_div-div-1) != -1)
2412 } else if (isl_int_abs_eq(bmap->ineq[i][pos], bmap->div[div][0])) {
2413 if (!isl_seq_eq(bmap->ineq[i], bmap->div[div]+1, pos))
2415 if (isl_seq_first_non_zero(bmap->ineq[i]+pos+1,
2416 bmap->n_div-div-1) != -1)
2422 for (i = 0; i < bmap->n_div; ++i)
2423 if (!isl_int_is_zero(bmap->div[i][1+pos]))
2430 * Remove divs that don't occur in any of the constraints or other divs.
2431 * These can arise when dropping some of the variables in a quast
2432 * returned by piplib.
2434 static struct isl_basic_map *remove_redundant_divs(struct isl_ctx *ctx,
2435 struct isl_basic_map *bmap)
2439 for (i = bmap->n_div-1; i >= 0; --i) {
2440 if (!div_is_redundant(ctx, bmap, i))
2442 bmap = isl_basic_map_drop_div(ctx, bmap, i);
2447 struct isl_basic_map *isl_basic_map_finalize(struct isl_ctx *ctx,
2448 struct isl_basic_map *bmap)
2450 bmap = remove_redundant_divs(ctx, bmap);
2453 F_SET(bmap, ISL_BASIC_SET_FINAL);
2457 struct isl_basic_set *isl_basic_set_finalize(struct isl_ctx *ctx,
2458 struct isl_basic_set *bset)
2460 return (struct isl_basic_set *)
2461 isl_basic_map_finalize(ctx,
2462 (struct isl_basic_map *)bset);
2465 struct isl_set *isl_set_finalize(struct isl_ctx *ctx, struct isl_set *set)
2471 for (i = 0; i < set->n; ++i) {
2472 set->p[i] = isl_basic_set_finalize(ctx, set->p[i]);
2478 isl_set_free(ctx, set);
2482 struct isl_map *isl_map_finalize(struct isl_ctx *ctx, struct isl_map *map)
2488 for (i = 0; i < map->n; ++i) {
2489 map->p[i] = isl_basic_map_finalize(ctx, map->p[i]);
2495 isl_map_free(ctx, map);
2499 struct isl_basic_map *isl_basic_map_identity(struct isl_ctx *ctx,
2500 unsigned nparam, unsigned dim)
2502 struct isl_basic_map *bmap;
2505 bmap = isl_basic_map_alloc(ctx, nparam, dim, dim, 0, dim, 0);
2509 for (i = 0; i < dim; ++i) {
2510 int j = isl_basic_map_alloc_equality(ctx, bmap);
2513 isl_seq_clr(bmap->eq[j],
2514 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->extra);
2515 isl_int_set_si(bmap->eq[j][1+nparam+i], 1);
2516 isl_int_set_si(bmap->eq[j][1+nparam+dim+i], -1);
2518 return isl_basic_map_finalize(ctx, bmap);
2520 isl_basic_map_free(ctx, bmap);
2524 struct isl_map *isl_map_identity(struct isl_ctx *ctx,
2525 unsigned nparam, unsigned dim)
2527 struct isl_map *map = isl_map_alloc(ctx, nparam, dim, dim, 1,
2531 map = isl_map_add(ctx, map,
2532 isl_basic_map_identity(ctx, nparam, dim));
2535 isl_map_free(ctx, map);
2539 int isl_set_is_equal(struct isl_ctx *ctx,
2540 struct isl_set *set1, struct isl_set *set2)
2542 return isl_map_is_equal(ctx,
2543 (struct isl_map *)set1, (struct isl_map *)set2);
2546 int isl_set_is_subset(struct isl_ctx *ctx,
2547 struct isl_set *set1, struct isl_set *set2)
2549 return isl_map_is_subset(ctx,
2550 (struct isl_map *)set1, (struct isl_map *)set2);
2553 int isl_basic_map_is_subset(struct isl_ctx *ctx,
2554 struct isl_basic_map *bmap1,
2555 struct isl_basic_map *bmap2)
2558 struct isl_map *map1;
2559 struct isl_map *map2;
2561 if (!bmap1 || !bmap2)
2564 map1 = isl_map_from_basic_map(ctx,
2565 isl_basic_map_copy(ctx, bmap1));
2566 map2 = isl_map_from_basic_map(ctx,
2567 isl_basic_map_copy(ctx, bmap2));
2569 is_subset = isl_map_is_subset(ctx, map1, map2);
2571 isl_map_free(ctx, map1);
2572 isl_map_free(ctx, map2);
2577 int isl_map_is_empty(struct isl_ctx *ctx, struct isl_map *map)
2584 for (i = 0; i < map->n; ++i) {
2585 is_empty = isl_basic_map_is_empty(ctx, map->p[i]);
2594 int isl_set_is_empty(struct isl_ctx *ctx, struct isl_set *set)
2596 return isl_map_is_empty(ctx, (struct isl_map *)set);
2599 int isl_map_is_subset(struct isl_ctx *ctx, struct isl_map *map1,
2600 struct isl_map *map2)
2604 struct isl_map *diff;
2609 if (isl_map_is_empty(ctx, map1))
2612 if (isl_map_is_empty(ctx, map2))
2615 diff = isl_map_subtract(ctx, isl_map_copy(ctx, map1),
2616 isl_map_copy(ctx, map2));
2620 is_subset = isl_map_is_empty(ctx, diff);
2621 isl_map_free(ctx, diff);
2626 int isl_map_is_equal(struct isl_ctx *ctx,
2627 struct isl_map *map1, struct isl_map *map2)
2633 is_subset = isl_map_is_subset(ctx, map1, map2);
2636 is_subset = isl_map_is_subset(ctx, map2, map1);
2640 int isl_basic_map_is_strict_subset(struct isl_ctx *ctx,
2641 struct isl_basic_map *bmap1,
2642 struct isl_basic_map *bmap2)
2646 if (!bmap1 || !bmap2)
2648 is_subset = isl_basic_map_is_subset(ctx, bmap1, bmap2);
2651 is_subset = isl_basic_map_is_subset(ctx, bmap2, bmap1);
2652 if (is_subset == -1)
2657 static int basic_map_contains(struct isl_ctx *ctx, struct isl_basic_map *bmap,
2658 struct isl_vec *vec)
2664 total = 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
2665 if (total != vec->size)
2670 for (i = 0; i < bmap->n_eq; ++i) {
2671 isl_seq_inner_product(vec->block.data, bmap->eq[i], total, &s);
2672 if (!isl_int_is_zero(s)) {
2678 for (i = 0; i < bmap->n_ineq; ++i) {
2679 isl_seq_inner_product(vec->block.data, bmap->ineq[i], total, &s);
2680 if (isl_int_is_neg(s)) {
2691 int isl_basic_map_is_empty(struct isl_ctx *ctx,
2692 struct isl_basic_map *bmap)
2694 struct isl_basic_set *bset = NULL;
2695 struct isl_vec *sample = NULL;
2702 if (F_ISSET(bmap, ISL_BASIC_MAP_EMPTY))
2705 total = 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
2706 if (bmap->sample && bmap->sample->size == total) {
2707 int contains = basic_map_contains(ctx, bmap, bmap->sample);
2713 bset = isl_basic_map_underlying_set(ctx,
2714 isl_basic_map_copy(ctx, bmap));
2717 sample = isl_basic_set_sample(ctx, bset);
2720 empty = sample->size == 0;
2722 isl_vec_free(ctx, bmap->sample);
2723 bmap->sample = sample;
2728 struct isl_map *isl_basic_map_union(
2729 struct isl_ctx *ctx, struct isl_basic_map *bmap1,
2730 struct isl_basic_map *bmap2)
2732 struct isl_map *map;
2733 if (!bmap1 || !bmap2)
2736 isl_assert(ctx, bmap1->nparam == bmap2->nparam, goto error);
2737 isl_assert(ctx, bmap1->n_in == bmap2->n_in, goto error);
2738 isl_assert(ctx, bmap1->n_out == bmap2->n_out, goto error);
2740 map = isl_map_alloc(ctx, bmap1->nparam,
2741 bmap1->n_in, bmap1->n_out, 2, 0);
2744 map = isl_map_add(ctx, map, bmap1);
2745 map = isl_map_add(ctx, map, bmap2);
2748 isl_basic_map_free(ctx, bmap1);
2749 isl_basic_map_free(ctx, bmap2);
2753 struct isl_set *isl_basic_set_union(
2754 struct isl_ctx *ctx, struct isl_basic_set *bset1,
2755 struct isl_basic_set *bset2)
2757 return (struct isl_set *)isl_basic_map_union(ctx,
2758 (struct isl_basic_map *)bset1,
2759 (struct isl_basic_map *)bset2);
2762 /* Order divs such that any div only depends on previous divs */
2763 static struct isl_basic_map *order_divs(struct isl_ctx *ctx,
2764 struct isl_basic_map *bmap)
2767 unsigned off = bmap->nparam + bmap->n_in + bmap->n_out;
2769 for (i = 0; i < bmap->n_div; ++i) {
2771 pos = isl_seq_first_non_zero(bmap->div[i]+1+1+off+i,
2775 swap_div(bmap, i, pos);
2781 static int find_div(struct isl_basic_map *dst,
2782 struct isl_basic_map *src, unsigned div)
2786 unsigned total = src->nparam + src->n_in + src->n_out + src->n_div;
2788 for (i = 0; i < dst->n_div; ++i)
2789 if (isl_seq_eq(dst->div[i], src->div[div], 1+1+total) &&
2790 isl_seq_first_non_zero(dst->div[i]+1+1+total,
2791 dst->n_div - src->n_div) == -1)
2796 /* For a div d = floor(f/m), add the constraints
2799 * -(f-(n-1)) + m d >= 0
2801 * Note that the second constraint is the negation of
2805 static int add_div_constraints(struct isl_ctx *ctx,
2806 struct isl_basic_map *bmap, unsigned div)
2809 unsigned div_pos = 1 + bmap->nparam + bmap->n_in + bmap->n_out + div;
2810 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->extra;
2812 i = isl_basic_map_alloc_inequality(ctx, bmap);
2815 isl_seq_cpy(bmap->ineq[i], bmap->div[div]+1, 1+total);
2816 isl_int_neg(bmap->ineq[i][div_pos], bmap->div[div][0]);
2818 j = isl_basic_map_alloc_inequality(ctx, bmap);
2821 isl_seq_neg(bmap->ineq[j], bmap->ineq[i], 1 + total);
2822 isl_int_add(bmap->ineq[j][0], bmap->ineq[j][0], bmap->ineq[j][div_pos]);
2823 isl_int_sub_ui(bmap->ineq[j][0], bmap->ineq[j][0], 1);
2827 struct isl_basic_map *isl_basic_map_align_divs(struct isl_ctx *ctx,
2828 struct isl_basic_map *dst, struct isl_basic_map *src)
2831 unsigned total = src->nparam + src->n_in + src->n_out + src->n_div;
2833 if (src->n_div == 0)
2836 src = order_divs(ctx, src);
2837 dst = isl_basic_map_extend(ctx, dst, dst->nparam, dst->n_in,
2838 dst->n_out, src->n_div, 0, 2 * src->n_div);
2841 for (i = 0; i < src->n_div; ++i) {
2842 int j = find_div(dst, src, i);
2844 j = isl_basic_map_alloc_div(ctx, dst);
2847 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total);
2848 isl_seq_clr(dst->div[j]+1+1+total,
2849 dst->extra - src->n_div);
2850 if (add_div_constraints(ctx, dst, j) < 0)
2854 swap_div(dst, i, j);
2858 isl_basic_map_free(ctx, dst);
2862 struct isl_map *isl_map_align_divs(struct isl_ctx *ctx, struct isl_map *map)
2866 map = isl_map_compute_divs(ctx, map);
2867 map = isl_map_cow(ctx, map);
2871 for (i = 1; i < map->n; ++i)
2872 map->p[0] = isl_basic_map_align_divs(ctx, map->p[0], map->p[i]);
2873 for (i = 1; i < map->n; ++i)
2874 map->p[i] = isl_basic_map_align_divs(ctx, map->p[i], map->p[0]);
2879 static struct isl_map *add_cut_constraint(struct isl_ctx *ctx,
2880 struct isl_map *dst,
2881 struct isl_basic_map *src, isl_int *c,
2882 unsigned len, int oppose)
2884 struct isl_basic_map *copy = NULL;
2889 copy = isl_basic_map_copy(ctx, src);
2890 copy = isl_basic_map_cow(ctx, copy);
2893 copy = isl_basic_map_extend(ctx, copy,
2894 copy->nparam, copy->n_in, copy->n_out, 0, 0, 1);
2895 k = isl_basic_map_alloc_inequality(ctx, copy);
2899 isl_seq_neg(copy->ineq[k], c, len);
2901 isl_seq_cpy(copy->ineq[k], c, len);
2902 total = 1 + copy->nparam + copy->n_in + copy->n_out + copy->extra;
2903 isl_seq_clr(copy->ineq[k]+len, total - len);
2904 isl_inequality_negate(ctx, copy, k);
2905 copy = isl_basic_map_simplify(ctx, copy);
2906 copy = isl_basic_map_finalize(ctx, copy);
2907 is_empty = isl_basic_map_is_empty(ctx, copy);
2911 dst = isl_map_add(ctx, dst, copy);
2913 isl_basic_map_free(ctx, copy);
2916 isl_basic_map_free(ctx, copy);
2917 isl_map_free(ctx, dst);
2921 static struct isl_map *subtract(struct isl_ctx *ctx, struct isl_map *map,
2922 struct isl_basic_map *bmap)
2926 struct isl_map *rest = NULL;
2928 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
2935 if (F_ISSET(map, ISL_MAP_DISJOINT))
2936 FL_SET(flags, ISL_MAP_DISJOINT);
2938 max = map->n * (2 * bmap->n_eq + bmap->n_ineq);
2939 rest = isl_map_alloc(ctx, map->nparam, map->n_in, map->n_out,
2944 for (i = 0; i < map->n; ++i) {
2945 map->p[i] = isl_basic_map_align_divs(ctx, map->p[i], bmap);
2950 for (j = 0; j < map->n; ++j)
2951 map->p[j] = isl_basic_map_cow(ctx, map->p[j]);
2953 for (i = 0; i < bmap->n_eq; ++i) {
2954 for (j = 0; j < map->n; ++j) {
2955 rest = add_cut_constraint(ctx, rest,
2956 map->p[j], bmap->eq[i], 1+total, 0);
2960 rest = add_cut_constraint(ctx, rest,
2961 map->p[j], bmap->eq[i], 1+total, 1);
2965 map->p[j] = isl_basic_map_extend(ctx, map->p[j],
2966 map->p[j]->nparam, map->p[j]->n_in,
2967 map->p[j]->n_out, 0, 1, 0);
2970 k = isl_basic_map_alloc_equality(ctx, map->p[j]);
2973 isl_seq_cpy(map->p[j]->eq[k], bmap->eq[i], 1+total);
2974 isl_seq_clr(map->p[j]->eq[k]+1+total,
2975 map->p[j]->extra - bmap->n_div);
2979 for (i = 0; i < bmap->n_ineq; ++i) {
2980 for (j = 0; j < map->n; ++j) {
2981 rest = add_cut_constraint(ctx, rest,
2982 map->p[j], bmap->ineq[i], 1+total, 0);
2986 map->p[j] = isl_basic_map_extend(ctx, map->p[j],
2987 map->p[j]->nparam, map->p[j]->n_in,
2988 map->p[j]->n_out, 0, 0, 1);
2991 k = isl_basic_map_alloc_inequality(ctx, map->p[j]);
2994 isl_seq_cpy(map->p[j]->ineq[k], bmap->ineq[i], 1+total);
2995 isl_seq_clr(map->p[j]->ineq[k]+1+total,
2996 map->p[j]->extra - bmap->n_div);
3000 isl_map_free(ctx, map);
3003 isl_map_free(ctx, map);
3004 isl_map_free(ctx, rest);
3008 struct isl_map *isl_map_subtract(struct isl_ctx *ctx, struct isl_map *map1,
3009 struct isl_map *map2)
3015 isl_assert(ctx, map1->nparam == map2->nparam, goto error);
3016 isl_assert(ctx, map1->n_in == map2->n_in, goto error);
3017 isl_assert(ctx, map1->n_out == map2->n_out, goto error);
3019 if (isl_map_is_empty(ctx, map2)) {
3020 isl_map_free(ctx, map2);
3024 map1 = isl_map_compute_divs(ctx, map1);
3025 map2 = isl_map_compute_divs(ctx, map2);
3029 for (i = 0; map1 && i < map2->n; ++i)
3030 map1 = subtract(ctx, map1, map2->p[i]);
3032 isl_map_free(ctx, map2);
3035 isl_map_free(ctx, map1);
3036 isl_map_free(ctx, map2);
3040 struct isl_set *isl_set_subtract(struct isl_ctx *ctx, struct isl_set *set1,
3041 struct isl_set *set2)
3043 return (struct isl_set *)
3044 isl_map_subtract(ctx,
3045 (struct isl_map *)set1, (struct isl_map *)set2);
3048 struct isl_set *isl_set_apply(struct isl_ctx *ctx, struct isl_set *set,
3049 struct isl_map *map)
3051 isl_assert(ctx, set->dim == map->n_in, goto error);
3052 map = isl_map_intersect_domain(ctx, map, set);
3053 set = isl_map_range(ctx, map);
3056 isl_set_free(ctx, set);
3057 isl_map_free(ctx, map);
3061 /* There is no need to cow as removing empty parts doesn't change
3062 * the meaning of the set.
3064 struct isl_map *isl_map_remove_empty_parts(struct isl_ctx *ctx,
3065 struct isl_map *map)
3072 for (i = map->n-1; i >= 0; --i) {
3073 if (!F_ISSET(map->p[i], ISL_BASIC_MAP_EMPTY))
3075 isl_basic_map_free(ctx, map->p[i]);
3077 map->p[i] = map->p[map->n-1];
3084 struct isl_set *isl_set_remove_empty_parts(struct isl_ctx *ctx,
3085 struct isl_set *set)
3087 return (struct isl_set *)
3088 isl_map_remove_empty_parts(ctx, (struct isl_map *)set);