8 #include "isl_map_private.h"
9 #include "isl_map_piplib.h"
11 static struct isl_basic_map *basic_map_init(struct isl_ctx *ctx,
12 struct isl_basic_map *bmap,
13 unsigned nparam, unsigned n_in, unsigned n_out, unsigned extra,
14 unsigned n_eq, unsigned n_ineq)
17 size_t row_size = 1 + nparam + n_in + n_out + extra;
19 bmap->block = isl_blk_alloc(ctx, (n_eq + n_ineq) * row_size);
20 if (!bmap->block.data) {
25 bmap->eq = isl_alloc_array(ctx, isl_int *, n_eq + n_ineq);
27 isl_blk_free(ctx, bmap->block);
33 bmap->block2.size = 0;
34 bmap->block2.data = NULL;
37 bmap->block2 = isl_blk_alloc(ctx, extra * (1 + row_size));
38 if (!bmap->block2.data) {
40 isl_blk_free(ctx, bmap->block);
45 bmap->div = isl_alloc_array(ctx, isl_int *, extra);
47 isl_blk_free(ctx, bmap->block2);
49 isl_blk_free(ctx, bmap->block);
55 for (i = 0; i < n_eq + n_ineq; ++i)
56 bmap->eq[i] = bmap->block.data + i * row_size;
58 for (i = 0; i < extra; ++i)
59 bmap->div[i] = bmap->block2.data + i * (1 + row_size);
63 bmap->c_size = n_eq + n_ineq;
64 bmap->ineq = bmap->eq + n_eq;
65 bmap->nparam = nparam;
76 struct isl_basic_set *isl_basic_set_alloc(struct isl_ctx *ctx,
77 unsigned nparam, unsigned dim, unsigned extra,
78 unsigned n_eq, unsigned n_ineq)
80 struct isl_basic_map *bmap;
81 bmap = isl_basic_map_alloc(ctx, nparam, 0, dim, extra, n_eq, n_ineq);
82 return (struct isl_basic_set *)bmap;
85 struct isl_basic_map *isl_basic_map_alloc(struct isl_ctx *ctx,
86 unsigned nparam, unsigned in, unsigned out, unsigned extra,
87 unsigned n_eq, unsigned n_ineq)
89 struct isl_basic_map *bmap;
91 bmap = isl_alloc_type(ctx, struct isl_basic_map);
95 return basic_map_init(ctx, bmap,
96 nparam, in, out, extra, n_eq, n_ineq);
99 static void dup_constraints(struct isl_ctx *ctx,
100 struct isl_basic_map *dst, struct isl_basic_map *src)
103 unsigned total = src->nparam + src->n_in + src->n_out + src->n_div;
105 for (i = 0; i < src->n_eq; ++i) {
106 int j = isl_basic_map_alloc_equality(ctx, dst);
107 isl_seq_cpy(dst->eq[j], src->eq[i], 1+total);
110 for (i = 0; i < src->n_ineq; ++i) {
111 int j = isl_basic_map_alloc_inequality(ctx, dst);
112 isl_seq_cpy(dst->ineq[j], src->ineq[i], 1+total);
115 for (i = 0; i < src->n_div; ++i) {
116 int j = isl_basic_map_alloc_div(ctx, dst);
117 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total);
119 F_SET(dst, ISL_BASIC_SET_FINAL);
122 struct isl_basic_map *isl_basic_map_dup(struct isl_ctx *ctx,
123 struct isl_basic_map *bmap)
125 struct isl_basic_map *dup;
127 dup = isl_basic_map_alloc(ctx, bmap->nparam,
128 bmap->n_in, bmap->n_out,
129 bmap->n_div, bmap->n_eq, bmap->n_ineq);
132 dup_constraints(ctx, dup, bmap);
136 struct isl_basic_set *isl_basic_set_dup(struct isl_ctx *ctx,
137 struct isl_basic_set *bset)
139 struct isl_basic_map *dup;
141 dup = isl_basic_map_dup(ctx, (struct isl_basic_map *)bset);
142 return (struct isl_basic_set *)dup;
145 struct isl_basic_set *isl_basic_set_copy(struct isl_ctx *ctx,
146 struct isl_basic_set *bset)
151 if (F_ISSET(bset, ISL_BASIC_SET_FINAL)) {
155 return isl_basic_set_dup(ctx, bset);
158 struct isl_set *isl_set_copy(struct isl_ctx *ctx, struct isl_set *set)
167 struct isl_basic_map *isl_basic_map_copy(struct isl_ctx *ctx,
168 struct isl_basic_map *bmap)
173 if (F_ISSET(bmap, ISL_BASIC_SET_FINAL)) {
177 return isl_basic_map_dup(ctx, bmap);
180 struct isl_map *isl_map_copy(struct isl_ctx *ctx, struct isl_map *map)
189 void isl_basic_map_free(struct isl_ctx *ctx, struct isl_basic_map *bmap)
198 isl_blk_free(ctx, bmap->block2);
200 isl_blk_free(ctx, bmap->block);
204 void isl_basic_set_free(struct isl_ctx *ctx, struct isl_basic_set *bset)
206 isl_basic_map_free(ctx, (struct isl_basic_map *)bset);
209 int isl_basic_map_alloc_equality(struct isl_ctx *ctx,
210 struct isl_basic_map *bmap)
214 isl_assert(ctx, bmap->n_eq + bmap->n_ineq < bmap->c_size, return -1);
215 isl_assert(ctx, bmap->eq + bmap->n_eq <= bmap->ineq, return -1);
216 if (bmap->eq + bmap->n_eq == bmap->ineq) {
218 int j = isl_basic_map_alloc_inequality(ctx, bmap);
222 bmap->ineq[0] = bmap->ineq[j];
230 int isl_basic_map_free_equality(struct isl_ctx *ctx,
231 struct isl_basic_map *bmap, unsigned n)
233 isl_assert(ctx, n <= bmap->n_eq, return -1);
238 int isl_basic_map_drop_equality(struct isl_ctx *ctx,
239 struct isl_basic_map *bmap, unsigned pos)
242 isl_assert(ctx, pos < bmap->n_eq, return -1);
244 if (pos != bmap->n_eq - 1) {
246 bmap->eq[pos] = bmap->eq[bmap->n_eq - 1];
247 bmap->eq[bmap->n_eq - 1] = t;
253 int isl_basic_map_alloc_inequality(struct isl_ctx *ctx,
254 struct isl_basic_map *bmap)
256 isl_assert(ctx, (bmap->ineq - bmap->eq) + bmap->n_ineq < bmap->c_size,
258 return bmap->n_ineq++;
261 int isl_basic_map_free_inequality(struct isl_ctx *ctx,
262 struct isl_basic_map *bmap, unsigned n)
264 isl_assert(ctx, n <= bmap->n_ineq, return -1);
269 int isl_basic_map_drop_inequality(struct isl_ctx *ctx,
270 struct isl_basic_map *bmap, unsigned pos)
273 isl_assert(ctx, pos < bmap->n_ineq, return -1);
275 if (pos != bmap->n_ineq - 1) {
277 bmap->ineq[pos] = bmap->ineq[bmap->n_ineq - 1];
278 bmap->ineq[bmap->n_ineq - 1] = t;
284 int isl_basic_map_alloc_div(struct isl_ctx *ctx,
285 struct isl_basic_map *bmap)
287 isl_assert(ctx, bmap->n_div < bmap->extra, return -1);
288 return bmap->n_div++;
291 int isl_basic_map_free_div(struct isl_ctx *ctx,
292 struct isl_basic_map *bmap, unsigned n)
294 isl_assert(ctx, n <= bmap->n_div, return -1);
299 /* Copy constraint from src to dst, putting the vars of src at offset
300 * dim_off in dst and the divs of src at offset div_off in dst.
301 * If both sets are actually map, then dim_off applies to the input
304 static void copy_constraint(struct isl_basic_map *dst_map, isl_int *dst,
305 struct isl_basic_map *src_map, isl_int *src,
306 unsigned in_off, unsigned out_off, unsigned div_off)
308 isl_int_set(dst[0], src[0]);
309 isl_seq_cpy(dst+1, src+1, isl_min(dst_map->nparam, src_map->nparam));
310 isl_seq_cpy(dst+1+dst_map->nparam+in_off,
311 src+1+src_map->nparam,
312 isl_min(dst_map->n_in-in_off, src_map->n_in));
313 isl_seq_cpy(dst+1+dst_map->nparam+dst_map->n_in+out_off,
314 src+1+src_map->nparam+src_map->n_in,
315 isl_min(dst_map->n_out-out_off, src_map->n_out));
316 isl_seq_cpy(dst+1+dst_map->nparam+dst_map->n_in+dst_map->n_out+div_off,
317 src+1+src_map->nparam+src_map->n_in+src_map->n_out,
318 isl_min(dst_map->extra-div_off, src_map->extra));
321 static void copy_div(struct isl_basic_map *dst_map, isl_int *dst,
322 struct isl_basic_map *src_map, isl_int *src,
323 unsigned in_off, unsigned out_off, unsigned div_off)
325 isl_int_set(dst[0], src[0]);
326 copy_constraint(dst_map, dst+1, src_map, src+1, in_off, out_off, div_off);
329 static struct isl_basic_map *add_constraints(struct isl_ctx *ctx,
330 struct isl_basic_map *bmap1,
331 struct isl_basic_map *bmap2, unsigned i_pos, unsigned o_pos)
334 unsigned div_off = bmap1->n_div;
336 for (i = 0; i < bmap2->n_eq; ++i) {
337 int i1 = isl_basic_map_alloc_equality(ctx, bmap1);
340 copy_constraint(bmap1, bmap1->eq[i1], bmap2, bmap2->eq[i],
341 i_pos, o_pos, div_off);
344 for (i = 0; i < bmap2->n_ineq; ++i) {
345 int i1 = isl_basic_map_alloc_inequality(ctx, bmap1);
348 copy_constraint(bmap1, bmap1->ineq[i1], bmap2, bmap2->ineq[i],
349 i_pos, o_pos, div_off);
352 for (i = 0; i < bmap2->n_div; ++i) {
353 int i1 = isl_basic_map_alloc_div(ctx, bmap1);
356 copy_div(bmap1, bmap1->div[i1], bmap2, bmap2->div[i],
357 i_pos, o_pos, div_off);
360 isl_basic_map_free(ctx, bmap2);
365 isl_basic_map_free(ctx, bmap1);
366 isl_basic_map_free(ctx, bmap2);
370 struct isl_basic_map *isl_basic_map_extend(struct isl_ctx *ctx,
371 struct isl_basic_map *base,
372 unsigned nparam, unsigned n_in, unsigned n_out, unsigned extra,
373 unsigned n_eq, unsigned n_ineq)
375 struct isl_basic_map *ext;
378 base = isl_basic_map_cow(ctx, base);
382 dims_ok = base && base->nparam == nparam &&
383 base->n_in == n_in && base->n_out == n_out &&
384 base->extra >= base->n_div + extra;
386 if (dims_ok && n_eq == 0 && n_ineq == 0)
390 isl_assert(ctx, base->nparam <= nparam, goto error);
391 isl_assert(ctx, base->n_in <= n_in, goto error);
392 isl_assert(ctx, base->n_out <= n_out, goto error);
393 extra += base->extra;
395 n_ineq += base->n_ineq;
398 ext = isl_basic_map_alloc(ctx, nparam, n_in, n_out,
399 extra, n_eq, n_ineq);
405 ext = add_constraints(ctx, ext, base, 0, 0);
410 isl_basic_map_free(ctx, base);
414 struct isl_basic_set *isl_basic_set_extend(struct isl_ctx *ctx,
415 struct isl_basic_set *base,
416 unsigned nparam, unsigned dim, unsigned extra,
417 unsigned n_eq, unsigned n_ineq)
419 return (struct isl_basic_set *)
420 isl_basic_map_extend(ctx, (struct isl_basic_map *)base,
421 nparam, 0, dim, extra, n_eq, n_ineq);
424 static struct isl_basic_set *isl_basic_set_cow(struct isl_ctx *ctx,
425 struct isl_basic_set *bset)
427 return (struct isl_basic_set *)
428 isl_basic_map_cow(ctx, (struct isl_basic_map *)bset);
431 struct isl_basic_map *isl_basic_map_cow(struct isl_ctx *ctx,
432 struct isl_basic_map *bmap)
439 bmap = isl_basic_map_dup(ctx, bmap);
441 F_CLR(bmap, ISL_BASIC_SET_FINAL);
445 static struct isl_set *isl_set_cow(struct isl_ctx *ctx, struct isl_set *set)
450 return isl_set_dup(ctx, set);
453 struct isl_map *isl_map_cow(struct isl_ctx *ctx, struct isl_map *map)
458 return isl_map_dup(ctx, map);
461 static void swap_vars(struct isl_blk blk, isl_int *a,
462 unsigned a_len, unsigned b_len)
464 isl_seq_cpy(blk.data, a+a_len, b_len);
465 isl_seq_cpy(blk.data+b_len, a, a_len);
466 isl_seq_cpy(a, blk.data, b_len+a_len);
469 struct isl_basic_set *isl_basic_set_swap_vars(struct isl_ctx *ctx,
470 struct isl_basic_set *bset, unsigned n)
478 isl_assert(ctx, n <= bset->dim, goto error);
483 bset = isl_basic_set_cow(ctx, bset);
487 blk = isl_blk_alloc(ctx, bset->dim);
491 for (i = 0; i < bset->n_eq; ++i)
493 bset->eq[i]+1+bset->nparam, n, bset->dim - n);
495 for (i = 0; i < bset->n_ineq; ++i)
497 bset->ineq[i]+1+bset->nparam, n, bset->dim - n);
499 for (i = 0; i < bset->n_div; ++i)
501 bset->div[i]+1+1+bset->nparam, n, bset->dim - n);
503 isl_blk_free(ctx, blk);
508 isl_basic_set_free(ctx, bset);
512 struct isl_set *isl_set_swap_vars(struct isl_ctx *ctx,
513 struct isl_set *set, unsigned n)
516 set = isl_set_cow(ctx, set);
520 for (i = 0; i < set->n; ++i) {
521 set->p[i] = isl_basic_set_swap_vars(ctx, set->p[i], n);
523 isl_set_free(ctx, set);
530 static void constraint_drop_vars(isl_int *c, unsigned n, unsigned rem)
532 isl_seq_cpy(c, c + n, rem);
533 isl_seq_clr(c + rem, n);
536 struct isl_basic_set *isl_basic_set_drop_vars(struct isl_ctx *ctx,
537 struct isl_basic_set *bset, unsigned first, unsigned n)
544 isl_assert(ctx, first + n <= bset->dim, goto error);
549 bset = isl_basic_set_cow(ctx, bset);
553 for (i = 0; i < bset->n_eq; ++i)
554 constraint_drop_vars(bset->eq[i]+1+bset->nparam+first, n,
555 (bset->dim-first-n)+bset->extra);
557 for (i = 0; i < bset->n_ineq; ++i)
558 constraint_drop_vars(bset->ineq[i]+1+bset->nparam+first, n,
559 (bset->dim-first-n)+bset->extra);
561 for (i = 0; i < bset->n_div; ++i)
562 constraint_drop_vars(bset->div[i]+1+1+bset->nparam+first, n,
563 (bset->dim-first-n)+bset->extra);
568 return isl_basic_set_finalize(ctx, bset);
570 isl_basic_set_free(ctx, bset);
575 * We don't cow, as the div is assumed to be redundant.
577 static struct isl_basic_map *isl_basic_map_drop_div(struct isl_ctx *ctx,
578 struct isl_basic_map *bmap, unsigned div)
586 pos = 1 + bmap->nparam + bmap->n_in + bmap->n_out + div;
588 isl_assert(ctx, div < bmap->n_div, goto error);
590 for (i = 0; i < bmap->n_eq; ++i)
591 constraint_drop_vars(bmap->eq[i]+pos, 1, bmap->extra-div-1);
593 for (i = 0; i < bmap->n_ineq; ++i) {
594 if (!isl_int_is_zero(bmap->ineq[i][pos])) {
595 isl_basic_map_drop_inequality(ctx, bmap, i);
599 constraint_drop_vars(bmap->ineq[i]+pos, 1, bmap->extra-div-1);
602 for (i = 0; i < bmap->n_div; ++i)
603 constraint_drop_vars(bmap->div[i]+1+pos, 1, bmap->extra-div-1);
605 if (div != bmap->n_div - 1) {
607 isl_int *t = bmap->div[div];
609 for (j = div; j < bmap->n_div - 1; ++j)
610 bmap->div[j] = bmap->div[j+1];
612 bmap->div[bmap->n_div - 1] = t;
614 isl_basic_map_free_div(ctx, bmap, 1);
618 isl_basic_map_free(ctx, bmap);
622 static void eliminate_div(struct isl_ctx *ctx, struct isl_basic_map *bmap,
623 isl_int *eq, unsigned div)
626 unsigned pos = 1 + bmap->nparam + bmap->n_in + bmap->n_out + div;
628 len = 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
630 for (i = 0; i < bmap->n_eq; ++i)
631 if (bmap->eq[i] != eq)
632 isl_seq_elim(bmap->eq[i], eq, pos, len, NULL);
634 for (i = 0; i < bmap->n_ineq; ++i)
635 isl_seq_elim(bmap->ineq[i], eq, pos, len, NULL);
637 /* We need to be careful about circular definitions,
638 * so for now we just remove the definitions of other divs that
639 * depend on this div and (possibly) recompute them later.
641 for (i = 0; i < bmap->n_div; ++i)
642 if (!isl_int_is_zero(bmap->div[i][0]) &&
643 !isl_int_is_zero(bmap->div[i][1 + pos]))
644 isl_seq_clr(bmap->div[i], 1 + len);
646 isl_basic_map_drop_div(ctx, bmap, div);
649 struct isl_basic_map *isl_basic_map_set_to_empty(
650 struct isl_ctx *ctx, struct isl_basic_map *bmap)
656 total = bmap->nparam + bmap->n_in + bmap->n_out;
657 isl_assert(ctx, bmap->n_ineq + bmap->n_eq > 0, goto error);
658 isl_basic_map_free_div(ctx, bmap, bmap->n_div);
659 isl_basic_map_free_inequality(ctx, bmap, bmap->n_ineq);
661 isl_basic_map_free_equality(ctx, bmap, bmap->n_eq-1);
663 isl_basic_map_alloc_equality(ctx, bmap);
667 isl_int_set_si(bmap->eq[i][0], 1);
668 isl_seq_clr(bmap->eq[i]+1, total);
669 F_SET(bmap, ISL_BASIC_MAP_EMPTY);
670 return isl_basic_map_finalize(ctx, bmap);
672 isl_basic_map_free(ctx, bmap);
676 static void swap_equality(struct isl_basic_map *bmap, int a, int b)
678 isl_int *t = bmap->eq[a];
679 bmap->eq[a] = bmap->eq[b];
683 static void swap_inequality(struct isl_basic_map *bmap, int a, int b)
685 isl_int *t = bmap->ineq[a];
686 bmap->ineq[a] = bmap->ineq[b];
690 static void swap_div(struct isl_basic_map *bmap, int a, int b)
693 unsigned off = bmap->nparam + bmap->n_in + bmap->n_out;
694 isl_int *t = bmap->div[a];
695 bmap->div[a] = bmap->div[b];
698 for (i = 0; i < bmap->n_eq; ++i)
699 isl_int_swap(bmap->eq[i][1+off+a], bmap->eq[i][1+off+b]);
701 for (i = 0; i < bmap->n_ineq; ++i)
702 isl_int_swap(bmap->ineq[i][1+off+a], bmap->ineq[i][1+off+b]);
704 for (i = 0; i < bmap->n_div; ++i)
705 isl_int_swap(bmap->div[i][1+1+off+a], bmap->div[i][1+1+off+b]);
708 struct isl_basic_map *isl_basic_map_gauss(struct isl_ctx *ctx,
709 struct isl_basic_map *bmap, int *progress)
720 total_var = bmap->nparam + bmap->n_in + bmap->n_out;
721 total = total_var + bmap->n_div;
723 last_var = total - 1;
724 for (done = 0; done < bmap->n_eq; ++done) {
725 for (; last_var >= 0; --last_var) {
726 for (k = done; k < bmap->n_eq; ++k)
727 if (!isl_int_is_zero(bmap->eq[k][1+last_var]))
735 swap_equality(bmap, k, done);
736 if (isl_int_is_neg(bmap->eq[done][1+last_var]))
737 isl_seq_neg(bmap->eq[done], bmap->eq[done], 1+total);
739 for (k = 0; k < bmap->n_eq; ++k) {
742 if (isl_int_is_zero(bmap->eq[k][1+last_var]))
746 isl_seq_elim(bmap->eq[k], bmap->eq[done],
747 1+last_var, 1+total, NULL);
750 for (k = 0; k < bmap->n_ineq; ++k) {
751 if (isl_int_is_zero(bmap->ineq[k][1+last_var]))
755 isl_seq_elim(bmap->ineq[k], bmap->eq[done],
756 1+last_var, 1+total, NULL);
759 for (k = 0; k < bmap->n_div; ++k) {
760 if (isl_int_is_zero(bmap->div[k][0]))
762 if (isl_int_is_zero(bmap->div[k][1+1+last_var]))
766 isl_seq_elim(bmap->div[k]+1, bmap->eq[done],
767 1+last_var, 1+total, &bmap->div[k][0]);
770 if (last_var >= total_var &&
771 isl_int_is_zero(bmap->div[last_var - total_var][0])) {
772 unsigned div = last_var - total_var;
773 isl_seq_neg(bmap->div[div]+1, bmap->eq[done], 1+total);
774 isl_int_set_si(bmap->div[div][1+1+last_var], 0);
775 isl_int_set(bmap->div[div][0],
776 bmap->eq[done][1+last_var]);
779 if (done == bmap->n_eq)
781 for (k = done; k < bmap->n_eq; ++k) {
782 if (isl_int_is_zero(bmap->eq[k][0]))
784 return isl_basic_map_set_to_empty(ctx, bmap);
786 isl_basic_map_free_equality(ctx, bmap, bmap->n_eq-done);
790 static unsigned int round_up(unsigned int v)
801 static struct isl_basic_map *remove_duplicate_constraints(
803 struct isl_basic_map *bmap, int *progress)
809 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
811 if (bmap->n_ineq <= 1)
814 size = round_up(4 * bmap->n_ineq / 3 - 1);
815 bits = ffs(size) - 1;
816 index = isl_alloc_array(ctx, int, size);
817 memset(index, 0, size * sizeof(int));
821 index[isl_seq_hash(bmap->ineq[0]+1, total, bits)] = 1;
822 for (k = 1; k < bmap->n_ineq; ++k) {
823 u_int32_t hash = isl_seq_hash(bmap->ineq[k]+1, total, bits);
824 for (h = hash; index[h]; h = (h+1) % size)
825 if (isl_seq_eq(bmap->ineq[k]+1,
826 bmap->ineq[index[h]-1]+1, total))
834 if (isl_int_lt(bmap->ineq[k][0], bmap->ineq[l][0]))
835 swap_inequality(bmap, k, l);
836 isl_basic_map_drop_inequality(ctx, bmap, k);
844 static struct isl_basic_map *remove_duplicate_divs(struct isl_ctx *ctx,
845 struct isl_basic_map *bmap, int *progress)
852 unsigned total_var = bmap->nparam + bmap->n_in + bmap->n_out;
853 unsigned total = total_var + bmap->n_div;
855 if (bmap->n_div <= 1)
858 for (k = bmap->n_div - 1; k >= 0; --k)
859 if (!isl_int_is_zero(bmap->div[k][0]))
864 size = round_up(4 * bmap->n_div / 3 - 1);
865 bits = ffs(size) - 1;
866 index = isl_alloc_array(ctx, int, size);
867 memset(index, 0, size * sizeof(int));
870 eq = isl_blk_alloc(ctx, 1+total);
874 isl_seq_clr(eq.data, 1+total);
875 index[isl_seq_hash(bmap->div[k], 2+total, bits)] = k + 1;
876 for (--k; k >= 0; --k) {
879 if (isl_int_is_zero(bmap->div[k][0]))
882 hash = isl_seq_hash(bmap->div[k], 2+total, bits);
883 for (h = hash; index[h]; h = (h+1) % size)
884 if (isl_seq_eq(bmap->div[k],
885 bmap->div[index[h]-1], 2+total))
890 isl_int_set_si(eq.data[1+total_var+k], -1);
891 isl_int_set_si(eq.data[1+total_var+l], 1);
892 eliminate_div(ctx, bmap, eq.data, l);
893 isl_int_set_si(eq.data[1+total_var+k], 0);
894 isl_int_set_si(eq.data[1+total_var+l], 0);
899 isl_blk_free(ctx, eq);
905 static struct isl_basic_map *eliminate_divs(
906 struct isl_ctx *ctx, struct isl_basic_map *bmap,
917 off = 1 + bmap->nparam + bmap->n_in + bmap->n_out;
919 for (d = bmap->n_div - 1; d >= 0 ; --d) {
920 for (i = 0; i < bmap->n_eq; ++i) {
921 if (!isl_int_is_one(bmap->eq[i][off + d]) &&
922 !isl_int_is_negone(bmap->eq[i][off + d]))
926 eliminate_div(ctx, bmap, bmap->eq[i], d);
927 isl_basic_map_drop_equality(ctx, bmap, i);
931 return eliminate_divs(ctx, bmap, progress);
935 static struct isl_basic_map *normalize_constraints(
936 struct isl_ctx *ctx, struct isl_basic_map *bmap)
940 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
943 for (i = bmap->n_eq - 1; i >= 0; --i) {
944 isl_seq_gcd(bmap->eq[i]+1, total, &gcd);
945 if (isl_int_is_zero(gcd)) {
946 if (!isl_int_is_zero(bmap->eq[i][0])) {
947 bmap = isl_basic_map_set_to_empty(ctx, bmap);
950 isl_basic_map_drop_equality(ctx, bmap, i);
953 if (isl_int_is_one(gcd))
955 if (!isl_int_is_divisible_by(bmap->eq[i][0], gcd)) {
956 bmap = isl_basic_map_set_to_empty(ctx, bmap);
959 isl_seq_scale_down(bmap->eq[i], bmap->eq[i], gcd, 1+total);
962 for (i = bmap->n_ineq - 1; i >= 0; --i) {
963 isl_seq_gcd(bmap->ineq[i]+1, total, &gcd);
964 if (isl_int_is_zero(gcd)) {
965 if (isl_int_is_neg(bmap->ineq[i][0])) {
966 bmap = isl_basic_map_set_to_empty(ctx, bmap);
969 isl_basic_map_drop_inequality(ctx, bmap, i);
972 if (isl_int_is_one(gcd))
974 isl_int_fdiv_q(bmap->ineq[i][0], bmap->ineq[i][0], gcd);
975 isl_seq_scale_down(bmap->ineq[i]+1, bmap->ineq[i]+1, gcd, total);
982 struct isl_basic_map *isl_basic_map_simplify(
983 struct isl_ctx *ctx, struct isl_basic_map *bmap)
990 bmap = normalize_constraints(ctx, bmap);
991 bmap = eliminate_divs(ctx, bmap, &progress);
992 bmap = isl_basic_map_gauss(ctx, bmap, &progress);
993 bmap = remove_duplicate_divs(ctx, bmap, &progress);
994 bmap = remove_duplicate_constraints(ctx, bmap, &progress);
999 struct isl_basic_set *isl_basic_set_simplify(
1000 struct isl_ctx *ctx, struct isl_basic_set *bset)
1002 return (struct isl_basic_set *)
1003 isl_basic_map_simplify(ctx,
1004 (struct isl_basic_map *)bset);
1007 static void dump_term(struct isl_basic_map *bmap,
1008 isl_int c, int pos, FILE *out)
1010 unsigned in = bmap->n_in;
1011 unsigned dim = bmap->n_in + bmap->n_out;
1013 isl_int_print(out, c);
1015 if (!isl_int_is_one(c))
1016 isl_int_print(out, c);
1017 if (pos < 1 + bmap->nparam)
1018 fprintf(out, "p%d", pos - 1);
1019 else if (pos < 1 + bmap->nparam + in)
1020 fprintf(out, "i%d", pos - 1 - bmap->nparam);
1021 else if (pos < 1 + bmap->nparam + dim)
1022 fprintf(out, "o%d", pos - 1 - bmap->nparam - in);
1024 fprintf(out, "e%d", pos - 1 - bmap->nparam - dim);
1028 static void dump_constraint_sign(struct isl_basic_map *bmap, isl_int *c,
1029 int sign, FILE *out)
1033 unsigned len = 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
1037 for (i = 0, first = 1; i < len; ++i) {
1038 if (isl_int_sgn(c[i]) * sign <= 0)
1041 fprintf(out, " + ");
1043 isl_int_abs(v, c[i]);
1044 dump_term(bmap, v, i, out);
1051 static void dump_constraint(struct isl_basic_map *bmap, isl_int *c,
1052 const char *op, FILE *out, int indent)
1054 fprintf(out, "%*s", indent, "");
1056 dump_constraint_sign(bmap, c, 1, out);
1057 fprintf(out, " %s ", op);
1058 dump_constraint_sign(bmap, c, -1, out);
1063 static void dump_constraints(struct isl_basic_map *bmap,
1064 isl_int **c, unsigned n,
1065 const char *op, FILE *out, int indent)
1069 for (i = 0; i < n; ++i)
1070 dump_constraint(bmap, c[i], op, out, indent);
1073 static void dump_affine(struct isl_basic_map *bmap, isl_int *exp, FILE *out)
1077 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
1079 for (j = 0; j < 1 + total; ++j) {
1080 if (isl_int_is_zero(exp[j]))
1082 if (!first && isl_int_is_pos(exp[j]))
1084 dump_term(bmap, exp[j], j, out);
1089 static void dump(struct isl_basic_map *bmap, FILE *out, int indent)
1093 dump_constraints(bmap, bmap->eq, bmap->n_eq, "=", out, indent);
1094 dump_constraints(bmap, bmap->ineq, bmap->n_ineq, ">=", out, indent);
1096 for (i = 0; i < bmap->n_div; ++i) {
1097 fprintf(out, "%*s", indent, "");
1098 fprintf(out, "e%d = [(", i);
1099 dump_affine(bmap, bmap->div[i]+1, out);
1101 isl_int_print(out, bmap->div[i][0]);
1102 fprintf(out, "]\n");
1106 void isl_basic_set_dump(struct isl_ctx *ctx, struct isl_basic_set *bset,
1107 FILE *out, int indent)
1109 fprintf(out, "%*s", indent, "");
1110 fprintf(out, "nparam: %d, dim: %d, extra: %d\n",
1111 bset->nparam, bset->dim, bset->extra);
1112 dump((struct isl_basic_map *)bset, out, indent);
1115 void isl_basic_map_dump(struct isl_ctx *ctx, struct isl_basic_map *bmap,
1116 FILE *out, int indent)
1118 fprintf(out, "%*s", indent, "");
1119 fprintf(out, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d\n",
1121 bmap->nparam, bmap->n_in, bmap->n_out, bmap->extra);
1122 dump(bmap, out, indent);
1125 int isl_inequality_negate(struct isl_ctx *ctx,
1126 struct isl_basic_map *bmap, unsigned pos)
1128 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
1129 isl_assert(ctx, pos < bmap->n_ineq, return -1);
1130 isl_seq_neg(bmap->ineq[pos], bmap->ineq[pos], 1 + total);
1131 isl_int_sub_ui(bmap->ineq[pos][0], bmap->ineq[pos][0], 1);
1135 struct isl_set *isl_set_alloc(struct isl_ctx *ctx,
1136 unsigned nparam, unsigned dim, int n, unsigned flags)
1138 struct isl_set *set;
1140 set = isl_alloc(ctx, struct isl_set,
1141 sizeof(struct isl_set) +
1142 n * sizeof(struct isl_basic_set *));
1149 set->nparam = nparam;
1156 struct isl_set *isl_set_dup(struct isl_ctx *ctx, struct isl_set *set)
1159 struct isl_set *dup;
1161 dup = isl_set_alloc(ctx, set->nparam, set->dim, set->n, set->flags);
1164 for (i = 0; i < set->n; ++i)
1165 dup = isl_set_add(ctx, dup,
1166 isl_basic_set_dup(ctx, set->p[i]));
1170 struct isl_set *isl_set_from_basic_set(struct isl_ctx *ctx,
1171 struct isl_basic_set *bset)
1173 struct isl_set *set;
1175 set = isl_set_alloc(ctx, bset->nparam, bset->dim, 1, ISL_MAP_DISJOINT);
1177 isl_basic_set_free(ctx, bset);
1180 return isl_set_add(ctx, set, bset);
1183 struct isl_map *isl_map_from_basic_map(struct isl_ctx *ctx,
1184 struct isl_basic_map *bmap)
1186 struct isl_map *map;
1188 map = isl_map_alloc(ctx, bmap->nparam, bmap->n_in, bmap->n_out, 1,
1191 isl_basic_map_free(ctx, bmap);
1194 return isl_map_add(ctx, map, bmap);
1197 struct isl_set *isl_set_add(struct isl_ctx *ctx, struct isl_set *set,
1198 struct isl_basic_set *bset)
1202 isl_assert(ctx, set->nparam == bset->nparam, goto error);
1203 isl_assert(ctx, set->dim == bset->dim, goto error);
1204 isl_assert(ctx, set->n < set->size, goto error);
1205 set->p[set->n] = bset;
1210 isl_set_free(ctx, set);
1212 isl_basic_set_free(ctx, bset);
1216 void isl_set_free(struct isl_ctx *ctx, struct isl_set *set)
1226 for (i = 0; i < set->n; ++i)
1227 isl_basic_set_free(ctx, set->p[i]);
1231 void isl_set_dump(struct isl_ctx *ctx, struct isl_set *set, FILE *out,
1237 fprintf(out, "null set\n");
1241 fprintf(out, "%*s", indent, "");
1242 fprintf(out, "ref: %d, n: %d\n", set->ref, set->n);
1243 for (i = 0; i < set->n; ++i) {
1244 fprintf(out, "%*s", indent, "");
1245 fprintf(out, "basic set %d:\n", i);
1246 isl_basic_set_dump(ctx, set->p[i], out, indent+4);
1250 void isl_map_dump(struct isl_ctx *ctx, struct isl_map *map, FILE *out,
1255 fprintf(out, "%*s", indent, "");
1256 fprintf(out, "ref: %d, n: %d, nparam: %d, in: %d, out: %d\n",
1257 map->ref, map->n, map->nparam, map->n_in, map->n_out);
1258 for (i = 0; i < map->n; ++i) {
1259 fprintf(out, "%*s", indent, "");
1260 fprintf(out, "basic map %d:\n", i);
1261 isl_basic_map_dump(ctx, map->p[i], out, indent+4);
1265 struct isl_basic_map *isl_basic_map_intersect_domain(
1266 struct isl_ctx *ctx, struct isl_basic_map *bmap,
1267 struct isl_basic_set *bset)
1269 struct isl_basic_map *bmap_domain;
1274 isl_assert(ctx, bset->dim == bmap->n_in, goto error);
1275 isl_assert(ctx, bset->nparam == bmap->nparam, goto error);
1277 bmap = isl_basic_map_extend(ctx, bmap,
1278 bset->nparam, bmap->n_in, bmap->n_out,
1279 bset->n_div, bset->n_eq, bset->n_ineq);
1282 bmap_domain = isl_basic_map_from_basic_set(ctx, bset,
1284 bmap = add_constraints(ctx, bmap, bmap_domain, 0, 0);
1286 return isl_basic_map_finalize(ctx, bmap);
1288 isl_basic_map_free(ctx, bmap);
1289 isl_basic_set_free(ctx, bset);
1293 struct isl_basic_map *isl_basic_map_intersect_range(
1294 struct isl_ctx *ctx, struct isl_basic_map *bmap,
1295 struct isl_basic_set *bset)
1297 struct isl_basic_map *bmap_range;
1302 isl_assert(ctx, bset->dim == bmap->n_out, goto error);
1303 isl_assert(ctx, bset->nparam == bmap->nparam, goto error);
1305 bmap = isl_basic_map_extend(ctx, bmap,
1306 bset->nparam, bmap->n_in, bmap->n_out,
1307 bset->n_div, bset->n_eq, bset->n_ineq);
1310 bmap_range = isl_basic_map_from_basic_set(ctx, bset,
1312 bmap = add_constraints(ctx, bmap, bmap_range, 0, 0);
1314 return isl_basic_map_finalize(ctx, bmap);
1316 isl_basic_map_free(ctx, bmap);
1317 isl_basic_set_free(ctx, bset);
1321 struct isl_basic_map *isl_basic_map_intersect(
1322 struct isl_ctx *ctx, struct isl_basic_map *bmap1,
1323 struct isl_basic_map *bmap2)
1325 isl_assert(ctx, bmap1->nparam == bmap2->nparam, goto error);
1326 isl_assert(ctx, bmap1->n_in == bmap2->n_in, goto error);
1327 isl_assert(ctx, bmap1->n_out == bmap2->n_out, goto error);
1329 bmap1 = isl_basic_map_extend(ctx, bmap1,
1330 bmap1->nparam, bmap1->n_in, bmap1->n_out,
1331 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
1334 bmap1 = add_constraints(ctx, bmap1, bmap2, 0, 0);
1336 return isl_basic_map_finalize(ctx, bmap1);
1338 isl_basic_map_free(ctx, bmap1);
1339 isl_basic_map_free(ctx, bmap2);
1343 struct isl_basic_set *isl_basic_set_intersect(
1344 struct isl_ctx *ctx, struct isl_basic_set *bset1,
1345 struct isl_basic_set *bset2)
1347 return (struct isl_basic_set *)
1348 isl_basic_map_intersect(ctx,
1349 (struct isl_basic_map *)bset1,
1350 (struct isl_basic_map *)bset2);
1353 struct isl_map *isl_map_intersect(struct isl_ctx *ctx, struct isl_map *map1,
1354 struct isl_map *map2)
1357 struct isl_map *result;
1363 if (F_ISSET(map1, ISL_MAP_DISJOINT) &&
1364 F_ISSET(map2, ISL_MAP_DISJOINT))
1365 FL_SET(flags, ISL_MAP_DISJOINT);
1367 result = isl_map_alloc(ctx, map1->nparam, map1->n_in, map1->n_out,
1368 map1->n * map2->n, flags);
1371 for (i = 0; i < map1->n; ++i)
1372 for (j = 0; j < map2->n; ++j) {
1373 struct isl_basic_map *part;
1374 part = isl_basic_map_intersect(ctx,
1375 isl_basic_map_copy(ctx, map1->p[i]),
1376 isl_basic_map_copy(ctx, map2->p[j]));
1377 if (isl_basic_map_is_empty(ctx, part))
1378 isl_basic_map_free(ctx, part);
1380 result = isl_map_add(ctx, result, part);
1384 isl_map_free(ctx, map1);
1385 isl_map_free(ctx, map2);
1388 isl_map_free(ctx, map1);
1389 isl_map_free(ctx, map2);
1393 struct isl_basic_map *isl_basic_map_reverse(struct isl_ctx *ctx,
1394 struct isl_basic_map *bmap)
1396 struct isl_basic_set *bset;
1401 bmap = isl_basic_map_cow(ctx, bmap);
1405 bset = isl_basic_set_from_basic_map(ctx, bmap);
1406 bset = isl_basic_set_swap_vars(ctx, bset, in);
1407 return isl_basic_map_from_basic_set(ctx, bset, bset->dim-in, in);
1410 /* Turn final n dimensions into existentially quantified variables.
1412 struct isl_basic_set *isl_basic_set_project_out(
1413 struct isl_ctx *ctx, struct isl_basic_set *bset,
1414 unsigned n, unsigned flags)
1424 isl_assert(ctx, n <= bset->dim, goto error);
1429 bset = isl_basic_set_cow(ctx, bset);
1431 row_size = 1 + bset->nparam + bset->dim + bset->extra;
1432 old = bset->block2.data;
1433 bset->block2 = isl_blk_extend(ctx, bset->block2,
1434 (bset->extra + n) * (1 + row_size));
1435 if (!bset->block2.data)
1437 new_div = isl_alloc_array(ctx, isl_int *, bset->extra + n);
1440 for (i = 0; i < n; ++i) {
1441 new_div[i] = bset->block2.data +
1442 (bset->extra + i) * (1 + row_size);
1443 isl_seq_clr(new_div[i], 1 + row_size);
1445 for (i = 0; i < bset->extra; ++i)
1446 new_div[n + i] = bset->block2.data + (bset->div[i] - old);
1448 bset->div = new_div;
1452 bset = isl_basic_set_simplify(ctx, bset);
1453 return isl_basic_set_finalize(ctx, bset);
1455 isl_basic_set_free(ctx, bset);
1459 struct isl_basic_map *isl_basic_map_apply_range(
1460 struct isl_ctx *ctx, struct isl_basic_map *bmap1,
1461 struct isl_basic_map *bmap2)
1463 struct isl_basic_set *bset;
1464 unsigned n_in, n_out;
1466 if (!bmap1 || !bmap2)
1469 isl_assert(ctx, bmap1->n_out == bmap2->n_in, goto error);
1470 isl_assert(ctx, bmap1->nparam == bmap2->nparam, goto error);
1473 n_out = bmap2->n_out;
1475 bmap2 = isl_basic_map_reverse(ctx, bmap2);
1478 bmap1 = isl_basic_map_extend(ctx, bmap1, bmap1->nparam,
1479 bmap1->n_in + bmap2->n_in, bmap1->n_out,
1480 bmap2->extra, bmap2->n_eq, bmap2->n_ineq);
1483 bmap1 = add_constraints(ctx, bmap1, bmap2, bmap1->n_in - bmap2->n_in, 0);
1484 bset = isl_basic_set_from_basic_map(ctx, bmap1);
1485 bset = isl_basic_set_project_out(ctx, bset,
1486 bset->dim - (n_in + n_out), 0);
1487 return isl_basic_map_from_basic_set(ctx, bset, n_in, n_out);
1489 isl_basic_map_free(ctx, bmap1);
1490 isl_basic_map_free(ctx, bmap2);
1494 struct isl_basic_map *isl_basic_map_apply_domain(
1495 struct isl_ctx *ctx, struct isl_basic_map *bmap1,
1496 struct isl_basic_map *bmap2)
1498 if (!bmap1 || !bmap2)
1501 isl_assert(ctx, bmap1->n_in == bmap2->n_in, goto error);
1502 isl_assert(ctx, bmap1->nparam == bmap2->nparam, goto error);
1504 bmap1 = isl_basic_map_reverse(ctx, bmap1);
1505 bmap1 = isl_basic_map_apply_range(ctx, bmap1, bmap2);
1506 return isl_basic_map_reverse(ctx, bmap1);
1508 isl_basic_map_free(ctx, bmap1);
1509 isl_basic_map_free(ctx, bmap2);
1513 static struct isl_basic_map *var_equal(struct isl_ctx *ctx,
1514 struct isl_basic_map *bmap, unsigned pos)
1517 i = isl_basic_map_alloc_equality(ctx, bmap);
1520 isl_seq_clr(bmap->eq[i],
1521 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->extra);
1522 isl_int_set_si(bmap->eq[i][1+bmap->nparam+pos], -1);
1523 isl_int_set_si(bmap->eq[i][1+bmap->nparam+bmap->n_in+pos], 1);
1524 return isl_basic_map_finalize(ctx, bmap);
1526 isl_basic_map_free(ctx, bmap);
1530 static struct isl_basic_map *var_more(struct isl_ctx *ctx,
1531 struct isl_basic_map *bmap, unsigned pos)
1534 i = isl_basic_map_alloc_inequality(ctx, bmap);
1537 isl_seq_clr(bmap->ineq[i],
1538 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->extra);
1539 isl_int_set_si(bmap->ineq[i][0], -1);
1540 isl_int_set_si(bmap->ineq[i][1+bmap->nparam+pos], -1);
1541 isl_int_set_si(bmap->ineq[i][1+bmap->nparam+bmap->n_in+pos], 1);
1542 return isl_basic_map_finalize(ctx, bmap);
1544 isl_basic_map_free(ctx, bmap);
1548 static struct isl_basic_map *var_less(struct isl_ctx *ctx,
1549 struct isl_basic_map *bmap, unsigned pos)
1552 i = isl_basic_map_alloc_inequality(ctx, bmap);
1555 isl_seq_clr(bmap->ineq[i],
1556 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->extra);
1557 isl_int_set_si(bmap->ineq[i][0], -1);
1558 isl_int_set_si(bmap->ineq[i][1+bmap->nparam+pos], 1);
1559 isl_int_set_si(bmap->ineq[i][1+bmap->nparam+bmap->n_in+pos], -1);
1560 return isl_basic_map_finalize(ctx, bmap);
1562 isl_basic_map_free(ctx, bmap);
1566 struct isl_basic_map *isl_basic_map_equal(struct isl_ctx *ctx,
1567 unsigned nparam, unsigned in, unsigned out, unsigned n_equal)
1570 struct isl_basic_map *bmap;
1571 bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, n_equal, 0);
1574 for (i = 0; i < n_equal && bmap; ++i)
1575 bmap = var_equal(ctx, bmap, i);
1576 return isl_basic_map_finalize(ctx, bmap);
1579 struct isl_basic_map *isl_basic_map_less_at(struct isl_ctx *ctx,
1580 unsigned nparam, unsigned in, unsigned out, unsigned pos)
1583 struct isl_basic_map *bmap;
1584 bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, pos, 1);
1587 for (i = 0; i < pos && bmap; ++i)
1588 bmap = var_equal(ctx, bmap, i);
1590 bmap = var_less(ctx, bmap, pos);
1591 return isl_basic_map_finalize(ctx, bmap);
1594 struct isl_basic_map *isl_basic_map_more_at(struct isl_ctx *ctx,
1595 unsigned nparam, unsigned in, unsigned out, unsigned pos)
1598 struct isl_basic_map *bmap;
1599 bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, pos, 1);
1602 for (i = 0; i < pos && bmap; ++i)
1603 bmap = var_equal(ctx, bmap, i);
1605 bmap = var_more(ctx, bmap, pos);
1606 return isl_basic_map_finalize(ctx, bmap);
1609 struct isl_basic_map *isl_basic_map_from_basic_set(
1610 struct isl_ctx *ctx, struct isl_basic_set *bset,
1611 unsigned n_in, unsigned n_out)
1613 struct isl_basic_map *bmap;
1615 bset = isl_basic_set_cow(ctx, bset);
1619 isl_assert(ctx, bset->dim == n_in + n_out, goto error);
1620 bmap = (struct isl_basic_map *) bset;
1622 bmap->n_out = n_out;
1623 return isl_basic_map_finalize(ctx, bmap);
1625 isl_basic_set_free(ctx, bset);
1629 struct isl_basic_set *isl_basic_set_from_basic_map(
1630 struct isl_ctx *ctx, struct isl_basic_map *bmap)
1634 if (bmap->n_in == 0)
1635 return (struct isl_basic_set *)bmap;
1636 bmap = isl_basic_map_cow(ctx, bmap);
1639 bmap->n_out += bmap->n_in;
1641 bmap = isl_basic_map_finalize(ctx, bmap);
1642 return (struct isl_basic_set *)bmap;
1647 struct isl_basic_set *isl_basic_map_domain(struct isl_ctx *ctx,
1648 struct isl_basic_map *bmap)
1650 struct isl_basic_set *domain;
1654 n_out = bmap->n_out;
1655 domain = isl_basic_set_from_basic_map(ctx, bmap);
1656 return isl_basic_set_project_out(ctx, domain, n_out, 0);
1659 struct isl_basic_set *isl_basic_map_range(struct isl_ctx *ctx,
1660 struct isl_basic_map *bmap)
1662 return isl_basic_map_domain(ctx,
1663 isl_basic_map_reverse(ctx, bmap));
1666 struct isl_set *isl_map_range(struct isl_ctx *ctx, struct isl_map *map)
1669 struct isl_set *set;
1673 map = isl_map_cow(ctx, map);
1677 set = (struct isl_set *) map;
1679 for (i = 0; i < map->n; ++i) {
1680 set->p[i] = isl_basic_map_range(ctx, map->p[i]);
1684 F_CLR(set, ISL_MAP_DISJOINT);
1687 isl_map_free(ctx, map);
1691 struct isl_map *isl_map_from_set(
1692 struct isl_ctx *ctx, struct isl_set *set,
1693 unsigned n_in, unsigned n_out)
1696 struct isl_map *map = NULL;
1700 isl_assert(ctx, set->dim == n_in + n_out, goto error);
1701 set = isl_set_cow(ctx, set);
1704 map = (struct isl_map *)set;
1705 for (i = 0; i < set->n; ++i) {
1706 map->p[i] = isl_basic_map_from_basic_set(ctx,
1707 set->p[i], n_in, n_out);
1715 isl_set_free(ctx, set);
1719 struct isl_map *isl_map_alloc(struct isl_ctx *ctx,
1720 unsigned nparam, unsigned in, unsigned out, int n,
1723 struct isl_map *map;
1725 map = isl_alloc(ctx, struct isl_map,
1726 sizeof(struct isl_map) +
1727 n * sizeof(struct isl_basic_map *));
1734 map->nparam = nparam;
1741 struct isl_basic_map *isl_basic_map_empty(struct isl_ctx *ctx,
1742 unsigned nparam, unsigned in, unsigned out)
1744 struct isl_basic_map *bmap;
1745 bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, 1, 0);
1746 bmap = isl_basic_map_set_to_empty(ctx, bmap);
1750 struct isl_map *isl_map_empty(struct isl_ctx *ctx,
1751 unsigned nparam, unsigned in, unsigned out)
1753 return isl_map_alloc(ctx, nparam, in, out, 0, ISL_MAP_DISJOINT);
1756 struct isl_set *isl_set_empty(struct isl_ctx *ctx,
1757 unsigned nparam, unsigned dim)
1759 return isl_set_alloc(ctx, nparam, dim, 0, ISL_MAP_DISJOINT);
1762 struct isl_map *isl_map_dup(struct isl_ctx *ctx, struct isl_map *map)
1765 struct isl_map *dup;
1767 dup = isl_map_alloc(ctx, map->nparam, map->n_in, map->n_out, map->n,
1769 for (i = 0; i < map->n; ++i)
1770 dup = isl_map_add(ctx, dup,
1771 isl_basic_map_dup(ctx, map->p[i]));
1775 struct isl_map *isl_map_add(struct isl_ctx *ctx, struct isl_map *map,
1776 struct isl_basic_map *bmap)
1780 isl_assert(ctx, map->nparam == bmap->nparam, goto error);
1781 isl_assert(ctx, map->n_in == bmap->n_in, goto error);
1782 isl_assert(ctx, map->n_out == bmap->n_out, goto error);
1783 isl_assert(ctx, map->n < map->size, goto error);
1784 map->p[map->n] = bmap;
1789 isl_map_free(ctx, map);
1791 isl_basic_map_free(ctx, bmap);
1795 void isl_map_free(struct isl_ctx *ctx, struct isl_map *map)
1805 for (i = 0; i < map->n; ++i)
1806 isl_basic_map_free(ctx, map->p[i]);
1810 struct isl_map *isl_map_extend(struct isl_ctx *ctx, struct isl_map *base,
1811 unsigned nparam, unsigned n_in, unsigned n_out)
1815 base = isl_map_cow(ctx, base);
1819 isl_assert(ctx, base->nparam <= nparam, goto error);
1820 isl_assert(ctx, base->n_in <= n_in, goto error);
1821 isl_assert(ctx, base->n_out <= n_out, goto error);
1822 base->nparam = nparam;
1824 base->n_out = n_out;
1825 for (i = 0; i < base->n; ++i) {
1826 base->p[i] = isl_basic_map_extend(ctx, base->p[i],
1827 nparam, n_in, n_out, 0, 0, 0);
1833 isl_map_free(ctx, base);
1837 struct isl_basic_map *isl_basic_map_fix_input_si(struct isl_ctx *ctx,
1838 struct isl_basic_map *bmap,
1839 unsigned input, int value)
1843 bmap = isl_basic_map_cow(ctx, bmap);
1846 isl_assert(ctx, input < bmap->n_in, goto error);
1848 bmap = isl_basic_map_extend(ctx, bmap,
1849 bmap->nparam, bmap->n_in, bmap->n_out, 0, 1, 0);
1850 j = isl_basic_map_alloc_equality(ctx, bmap);
1853 isl_int_set_si(bmap->eq[j][1+bmap->nparam+input], -1);
1854 isl_int_set_si(bmap->eq[j][0], value);
1855 return isl_basic_map_finalize(ctx, bmap);
1857 isl_basic_map_free(ctx, bmap);
1861 struct isl_map *isl_map_fix_input_si(struct isl_ctx *ctx, struct isl_map *map,
1862 unsigned input, int value)
1866 map = isl_map_cow(ctx, map);
1870 isl_assert(ctx, input < map->n_in, goto error);
1871 for (i = 0; i < map->n; ++i) {
1872 map->p[i] = isl_basic_map_fix_input_si(ctx, map->p[i],
1879 isl_map_free(ctx, map);
1883 struct isl_map *isl_map_reverse(struct isl_ctx *ctx, struct isl_map *map)
1888 map = isl_map_cow(ctx, map);
1893 map->n_in = map->n_out;
1895 for (i = 0; i < map->n; ++i) {
1896 map->p[i] = isl_basic_map_reverse(ctx, map->p[i]);
1902 isl_map_free(ctx, map);
1906 struct isl_map *isl_basic_map_lexmax(struct isl_ctx *ctx,
1907 struct isl_basic_map *bmap, struct isl_basic_set *dom,
1908 struct isl_set **empty)
1910 return isl_pip_basic_map_lexmax(ctx, bmap, dom, empty);
1913 struct isl_map *isl_basic_map_lexmin(struct isl_ctx *ctx,
1914 struct isl_basic_map *bmap, struct isl_basic_set *dom,
1915 struct isl_set **empty)
1917 return isl_pip_basic_map_lexmin(ctx, bmap, dom, empty);
1920 struct isl_set *isl_basic_set_lexmin(struct isl_ctx *ctx,
1921 struct isl_basic_set *bset)
1923 struct isl_basic_map *bmap = NULL;
1924 struct isl_basic_set *dom = NULL;
1925 struct isl_map *min;
1929 bmap = isl_basic_map_from_basic_set(ctx, bset, 0, bset->dim);
1932 dom = isl_basic_set_alloc(ctx, bmap->nparam, 0, 0, 0, 0);
1935 min = isl_basic_map_lexmin(ctx, bmap, dom, NULL);
1936 return isl_map_range(ctx, min);
1938 isl_basic_map_free(ctx, bmap);
1942 struct isl_map *isl_basic_map_compute_divs(struct isl_ctx *ctx,
1943 struct isl_basic_map *bmap)
1945 if (bmap->n_div == 0)
1946 return isl_map_from_basic_map(ctx, bmap);
1947 return isl_pip_basic_map_compute_divs(ctx, bmap);
1950 struct isl_map *isl_map_compute_divs(struct isl_ctx *ctx, struct isl_map *map)
1953 struct isl_map *res;
1959 res = isl_basic_map_compute_divs(ctx,
1960 isl_basic_map_copy(ctx, map->p[0]));
1961 for (i = 1 ; i < map->n; ++i) {
1963 r2 = isl_basic_map_compute_divs(ctx,
1964 isl_basic_map_copy(ctx, map->p[i]));
1965 if (F_ISSET(map, ISL_MAP_DISJOINT))
1966 res = isl_map_union_disjoint(ctx, res, r2);
1968 res = isl_map_union(ctx, res, r2);
1970 isl_map_free(ctx, map);
1975 struct isl_set *isl_basic_set_compute_divs(struct isl_ctx *ctx,
1976 struct isl_basic_set *bset)
1978 return (struct isl_set *)
1979 isl_basic_map_compute_divs(ctx,
1980 (struct isl_basic_map *)bset);
1983 struct isl_set *isl_map_domain(struct isl_ctx *ctx, struct isl_map *map)
1986 struct isl_set *set;
1991 map = isl_map_cow(ctx, map);
1995 set = (struct isl_set *)map;
1996 set->dim = map->n_in;
1998 for (i = 0; i < map->n; ++i) {
1999 set->p[i] = isl_basic_map_domain(ctx, map->p[i]);
2003 F_CLR(set, ISL_MAP_DISJOINT);
2006 isl_map_free(ctx, map);
2010 struct isl_map *isl_map_union_disjoint(struct isl_ctx *ctx,
2011 struct isl_map *map1, struct isl_map *map2)
2015 struct isl_map *map = NULL;
2021 isl_map_free(ctx, map1);
2025 isl_map_free(ctx, map2);
2029 isl_assert(ctx, map1->nparam == map2->nparam, goto error);
2030 isl_assert(ctx, map1->n_in == map2->n_in, goto error);
2031 isl_assert(ctx, map1->n_out == map2->n_out, goto error);
2033 if (F_ISSET(map1, ISL_MAP_DISJOINT) &&
2034 F_ISSET(map2, ISL_MAP_DISJOINT))
2035 FL_SET(flags, ISL_MAP_DISJOINT);
2037 map = isl_map_alloc(ctx, map1->nparam, map1->n_in, map1->n_out,
2038 map1->n + map2->n, flags);
2041 for (i = 0; i < map1->n; ++i) {
2042 map = isl_map_add(ctx, map,
2043 isl_basic_map_copy(ctx, map1->p[i]));
2047 for (i = 0; i < map2->n; ++i) {
2048 map = isl_map_add(ctx, map,
2049 isl_basic_map_copy(ctx, map2->p[i]));
2053 isl_map_free(ctx, map1);
2054 isl_map_free(ctx, map2);
2057 isl_map_free(ctx, map);
2058 isl_map_free(ctx, map1);
2059 isl_map_free(ctx, map2);
2063 struct isl_map *isl_map_union(struct isl_ctx *ctx,
2064 struct isl_map *map1, struct isl_map *map2)
2066 map1 = isl_map_union_disjoint(ctx, map1, map2);
2070 F_CLR(map1, ISL_MAP_DISJOINT);
2074 struct isl_set *isl_set_union_disjoint(struct isl_ctx *ctx,
2075 struct isl_set *set1, struct isl_set *set2)
2077 return (struct isl_set *)
2078 isl_map_union_disjoint(ctx,
2079 (struct isl_map *)set1, (struct isl_map *)set2);
2082 struct isl_set *isl_set_union(struct isl_ctx *ctx,
2083 struct isl_set *set1, struct isl_set *set2)
2085 return (struct isl_set *)
2087 (struct isl_map *)set1, (struct isl_map *)set2);
2090 struct isl_map *isl_map_intersect_range(
2091 struct isl_ctx *ctx, struct isl_map *map,
2092 struct isl_set *set)
2095 struct isl_map *result;
2101 if (F_ISSET(map, ISL_MAP_DISJOINT) &&
2102 F_ISSET(set, ISL_MAP_DISJOINT))
2103 FL_SET(flags, ISL_MAP_DISJOINT);
2105 result = isl_map_alloc(ctx, map->nparam, map->n_in, map->n_out,
2106 map->n * set->n, flags);
2109 for (i = 0; i < map->n; ++i)
2110 for (j = 0; j < set->n; ++j) {
2111 result = isl_map_add(ctx, result,
2112 isl_basic_map_intersect_range(ctx,
2113 isl_basic_map_copy(ctx, map->p[i]),
2114 isl_basic_set_copy(ctx, set->p[j])));
2118 isl_map_free(ctx, map);
2119 isl_set_free(ctx, set);
2122 isl_map_free(ctx, map);
2123 isl_set_free(ctx, set);
2127 struct isl_map *isl_map_intersect_domain(
2128 struct isl_ctx *ctx, struct isl_map *map,
2129 struct isl_set *set)
2131 return isl_map_reverse(ctx,
2132 isl_map_intersect_range(ctx, isl_map_reverse(ctx, map), set));
2135 struct isl_map *isl_map_apply_domain(
2136 struct isl_ctx *ctx, struct isl_map *map1,
2137 struct isl_map *map2)
2141 map1 = isl_map_reverse(ctx, map1);
2142 map1 = isl_map_apply_range(ctx, map1, map2);
2143 return isl_map_reverse(ctx, map1);
2145 isl_map_free(ctx, map1);
2146 isl_map_free(ctx, map2);
2150 struct isl_map *isl_map_apply_range(
2151 struct isl_ctx *ctx, struct isl_map *map1,
2152 struct isl_map *map2)
2154 struct isl_map *result;
2160 isl_assert(ctx, map1->nparam == map2->nparam, goto error);
2161 isl_assert(ctx, map1->n_out == map2->n_in, goto error);
2163 result = isl_map_alloc(ctx, map1->nparam, map1->n_in, map2->n_out,
2164 map1->n * map2->n, 0);
2167 for (i = 0; i < map1->n; ++i)
2168 for (j = 0; j < map2->n; ++j) {
2169 result = isl_map_add(ctx, result,
2170 isl_basic_map_apply_range(ctx,
2171 isl_basic_map_copy(ctx, map1->p[i]),
2172 isl_basic_map_copy(ctx, map2->p[j])));
2176 isl_map_free(ctx, map1);
2177 isl_map_free(ctx, map2);
2180 isl_map_free(ctx, map1);
2181 isl_map_free(ctx, map2);
2186 * returns range - domain
2188 struct isl_basic_set *isl_basic_map_deltas(struct isl_ctx *ctx,
2189 struct isl_basic_map *bmap)
2191 struct isl_basic_set *bset;
2197 isl_assert(ctx, bmap->n_in == bmap->n_out, goto error);
2199 bset = isl_basic_set_from_basic_map(ctx, bmap);
2200 bset = isl_basic_set_extend(ctx, bset, bset->nparam, 3*dim, 0,
2202 bset = isl_basic_set_swap_vars(ctx, bset, 2*dim);
2203 for (i = 0; i < dim; ++i) {
2204 int j = isl_basic_map_alloc_equality(ctx,
2205 (struct isl_basic_map *)bset);
2208 isl_int_set_si(bset->eq[j][1+bset->nparam+i], 1);
2209 isl_int_set_si(bset->eq[j][1+bset->nparam+dim+i], 1);
2210 isl_int_set_si(bset->eq[j][1+bset->nparam+2*dim+i], -1);
2212 return isl_basic_set_project_out(ctx, bset, 2*dim, 0);
2214 isl_basic_map_free(ctx, bmap);
2218 /* If the only constraints a div d=floor(f/m)
2219 * appears in are its two defining constraints
2222 * -(f - (m - 1)) + m d >= 0
2224 * then it can safely be removed.
2226 static int div_is_redundant(struct isl_ctx *ctx, struct isl_basic_map *bmap,
2230 unsigned pos = 1 + bmap->nparam + bmap->n_in + bmap->n_out + div;
2232 for (i = 0; i < bmap->n_eq; ++i)
2233 if (!isl_int_is_zero(bmap->eq[i][pos]))
2236 for (i = 0; i < bmap->n_ineq; ++i) {
2237 if (isl_int_is_zero(bmap->ineq[i][pos]))
2239 if (isl_int_eq(bmap->ineq[i][pos], bmap->div[div][0])) {
2241 isl_int_sub(bmap->div[div][1],
2242 bmap->div[div][1], bmap->div[div][0]);
2243 isl_int_add_ui(bmap->div[div][1], bmap->div[div][1], 1);
2244 neg = isl_seq_is_neg(bmap->ineq[i], bmap->div[div]+1, pos);
2245 isl_int_sub_ui(bmap->div[div][1], bmap->div[div][1], 1);
2246 isl_int_add(bmap->div[div][1],
2247 bmap->div[div][1], bmap->div[div][0]);
2250 if (isl_seq_first_non_zero(bmap->ineq[i]+pos+1,
2251 bmap->n_div-div-1) != -1)
2253 } else if (isl_int_abs_eq(bmap->ineq[i][pos], bmap->div[div][0])) {
2254 if (!isl_seq_eq(bmap->ineq[i], bmap->div[div]+1, pos))
2256 if (isl_seq_first_non_zero(bmap->ineq[i]+pos+1,
2257 bmap->n_div-div-1) != -1)
2263 for (i = 0; i < bmap->n_div; ++i)
2264 if (!isl_int_is_zero(bmap->div[i][1+pos]))
2271 * Remove divs that don't occur in any of the constraints or other divs.
2272 * These can arise when dropping some of the variables in a quast
2273 * returned by piplib.
2275 static struct isl_basic_map *remove_redundant_divs(struct isl_ctx *ctx,
2276 struct isl_basic_map *bmap)
2280 for (i = bmap->n_div-1; i >= 0; --i) {
2281 if (!div_is_redundant(ctx, bmap, i))
2283 bmap = isl_basic_map_drop_div(ctx, bmap, i);
2288 struct isl_basic_map *isl_basic_map_finalize(struct isl_ctx *ctx,
2289 struct isl_basic_map *bmap)
2291 bmap = remove_redundant_divs(ctx, bmap);
2294 F_SET(bmap, ISL_BASIC_SET_FINAL);
2298 struct isl_basic_set *isl_basic_set_finalize(struct isl_ctx *ctx,
2299 struct isl_basic_set *bset)
2301 return (struct isl_basic_set *)
2302 isl_basic_map_finalize(ctx,
2303 (struct isl_basic_map *)bset);
2306 struct isl_set *isl_set_finalize(struct isl_ctx *ctx, struct isl_set *set)
2312 for (i = 0; i < set->n; ++i) {
2313 set->p[i] = isl_basic_set_finalize(ctx, set->p[i]);
2319 isl_set_free(ctx, set);
2323 struct isl_map *isl_map_finalize(struct isl_ctx *ctx, struct isl_map *map)
2329 for (i = 0; i < map->n; ++i) {
2330 map->p[i] = isl_basic_map_finalize(ctx, map->p[i]);
2336 isl_map_free(ctx, map);
2340 struct isl_basic_map *isl_basic_map_identity(struct isl_ctx *ctx,
2341 unsigned nparam, unsigned dim)
2343 struct isl_basic_map *bmap;
2346 bmap = isl_basic_map_alloc(ctx, nparam, dim, dim, 0, dim, 0);
2350 for (i = 0; i < dim; ++i) {
2351 int j = isl_basic_map_alloc_equality(ctx, bmap);
2354 isl_int_set_si(bmap->eq[j][1+nparam+i], 1);
2355 isl_int_set_si(bmap->eq[j][1+nparam+dim+i], -1);
2357 return isl_basic_map_finalize(ctx, bmap);
2359 isl_basic_map_free(ctx, bmap);
2363 struct isl_map *isl_map_identity(struct isl_ctx *ctx,
2364 unsigned nparam, unsigned dim)
2366 struct isl_map *map = isl_map_alloc(ctx, nparam, dim, dim, 1,
2370 map = isl_map_add(ctx, map,
2371 isl_basic_map_identity(ctx, nparam, dim));
2374 isl_map_free(ctx, map);
2378 int isl_set_is_equal(struct isl_ctx *ctx,
2379 struct isl_set *set1, struct isl_set *set2)
2381 return isl_map_is_equal(ctx,
2382 (struct isl_map *)set1, (struct isl_map *)set2);
2385 int isl_set_is_subset(struct isl_ctx *ctx,
2386 struct isl_set *set1, struct isl_set *set2)
2388 return isl_map_is_subset(ctx,
2389 (struct isl_map *)set1, (struct isl_map *)set2);
2392 int isl_basic_map_is_subset(struct isl_ctx *ctx,
2393 struct isl_basic_map *bmap1,
2394 struct isl_basic_map *bmap2)
2397 struct isl_map *map1;
2398 struct isl_map *map2;
2400 if (!bmap1 || !bmap2)
2403 map1 = isl_map_from_basic_map(ctx,
2404 isl_basic_map_copy(ctx, bmap1));
2405 map2 = isl_map_from_basic_map(ctx,
2406 isl_basic_map_copy(ctx, bmap2));
2408 is_subset = isl_map_is_subset(ctx, map1, map2);
2410 isl_map_free(ctx, map1);
2411 isl_map_free(ctx, map2);
2416 int isl_map_is_empty(struct isl_ctx *ctx, struct isl_map *map)
2423 for (i = 0; i < map->n; ++i) {
2424 is_empty = isl_basic_map_is_empty(ctx, map->p[i]);
2433 int isl_set_is_empty(struct isl_ctx *ctx, struct isl_set *set)
2435 return isl_map_is_empty(ctx, (struct isl_map *)set);
2438 int isl_map_is_subset(struct isl_ctx *ctx, struct isl_map *map1,
2439 struct isl_map *map2)
2443 struct isl_map *diff;
2448 if (isl_map_is_empty(ctx, map1))
2451 if (isl_map_is_empty(ctx, map2))
2454 diff = isl_map_subtract(ctx, isl_map_copy(ctx, map1),
2455 isl_map_copy(ctx, map2));
2459 is_subset = isl_map_is_empty(ctx, diff);
2460 isl_map_free(ctx, diff);
2465 int isl_map_is_equal(struct isl_ctx *ctx,
2466 struct isl_map *map1, struct isl_map *map2)
2472 is_subset = isl_map_is_subset(ctx, map1, map2);
2475 is_subset = isl_map_is_subset(ctx, map2, map1);
2479 int isl_basic_map_is_strict_subset(struct isl_ctx *ctx,
2480 struct isl_basic_map *bmap1,
2481 struct isl_basic_map *bmap2)
2485 if (!bmap1 || !bmap2)
2487 is_subset = isl_basic_map_is_subset(ctx, bmap1, bmap2);
2490 is_subset = isl_basic_map_is_subset(ctx, bmap2, bmap1);
2491 if (is_subset == -1)
2496 int isl_basic_map_is_empty(struct isl_ctx *ctx,
2497 struct isl_basic_map *bmap)
2499 struct isl_basic_set *bset = NULL;
2500 struct isl_set *min = NULL;
2506 if (F_ISSET(bmap, ISL_BASIC_MAP_EMPTY))
2509 bset = isl_basic_set_from_basic_map(ctx,
2510 isl_basic_map_copy(ctx, bmap));
2513 min = isl_basic_set_lexmin(ctx, bset);
2516 empty = min->n == 0;
2517 isl_set_free(ctx, min);
2521 struct isl_map *isl_basic_map_union(
2522 struct isl_ctx *ctx, struct isl_basic_map *bmap1,
2523 struct isl_basic_map *bmap2)
2525 struct isl_map *map;
2526 if (!bmap1 || !bmap2)
2529 isl_assert(ctx, bmap1->nparam == bmap2->nparam, goto error);
2530 isl_assert(ctx, bmap1->n_in == bmap2->n_in, goto error);
2531 isl_assert(ctx, bmap1->n_out == bmap2->n_out, goto error);
2533 map = isl_map_alloc(ctx, bmap1->nparam,
2534 bmap1->n_in, bmap1->n_out, 2, 0);
2537 map = isl_map_add(ctx, map, bmap1);
2538 map = isl_map_add(ctx, map, bmap2);
2541 isl_basic_map_free(ctx, bmap1);
2542 isl_basic_map_free(ctx, bmap2);
2546 struct isl_set *isl_basic_set_union(
2547 struct isl_ctx *ctx, struct isl_basic_set *bset1,
2548 struct isl_basic_set *bset2)
2550 return (struct isl_set *)isl_basic_map_union(ctx,
2551 (struct isl_basic_map *)bset1,
2552 (struct isl_basic_map *)bset2);
2555 /* Order divs such that any div only depends on previous divs */
2556 static struct isl_basic_map *order_divs(struct isl_ctx *ctx,
2557 struct isl_basic_map *bmap)
2560 unsigned off = bmap->nparam + bmap->n_in + bmap->n_out;
2562 for (i = 0; i < bmap->n_div; ++i) {
2564 pos = isl_seq_first_non_zero(bmap->div[i]+1+1+off+i,
2568 swap_div(bmap, i, pos);
2574 static int find_div(struct isl_basic_map *dst,
2575 struct isl_basic_map *src, unsigned div)
2579 unsigned total = src->nparam + src->n_in + src->n_out + src->n_div;
2581 for (i = 0; i < dst->n_div; ++i)
2582 if (isl_seq_eq(dst->div[i], src->div[div], 1+1+total) &&
2583 isl_seq_first_non_zero(dst->div[i]+1+1+total,
2584 dst->n_div - src->n_div) == -1)
2589 /* For a div d = floor(f/m), add the constraints
2592 * -(f-(n-1)) + m d >= 0
2594 * Note that the second constraint is the negation of
2598 static int add_div_constraints(struct isl_ctx *ctx,
2599 struct isl_basic_map *bmap, unsigned div)
2602 unsigned div_pos = 1 + bmap->nparam + bmap->n_in + bmap->n_out + div;
2603 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
2605 i = isl_basic_map_alloc_inequality(ctx, bmap);
2608 isl_seq_cpy(bmap->ineq[i], bmap->div[div]+1, 1+total);
2609 isl_int_neg(bmap->ineq[i][div_pos], bmap->div[div][0]);
2611 j = isl_basic_map_alloc_inequality(ctx, bmap);
2614 isl_seq_neg(bmap->ineq[j], bmap->ineq[i], 1 + total);
2615 isl_int_add(bmap->ineq[j][0], bmap->ineq[j][0], bmap->ineq[j][div_pos]);
2616 isl_int_sub_ui(bmap->ineq[j][0], bmap->ineq[j][0], 1);
2620 struct isl_basic_map *isl_basic_map_align_divs(struct isl_ctx *ctx,
2621 struct isl_basic_map *dst, struct isl_basic_map *src)
2624 unsigned total = src->nparam + src->n_in + src->n_out + src->n_div;
2626 if (src->n_div == 0)
2629 src = order_divs(ctx, src);
2630 dst = isl_basic_map_extend(ctx, dst, dst->nparam, dst->n_in,
2631 dst->n_out, src->n_div, 0, 2 * src->n_div);
2634 for (i = 0; i < src->n_div; ++i) {
2635 int j = find_div(dst, src, i);
2637 j = isl_basic_map_alloc_div(ctx, dst);
2640 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total);
2641 if (add_div_constraints(ctx, dst, j) < 0)
2645 swap_div(dst, i, j);
2649 isl_basic_map_free(ctx, dst);
2653 static struct isl_map *add_cut_constraint(struct isl_ctx *ctx,
2654 struct isl_map *dst,
2655 struct isl_basic_map *src, isl_int *c,
2656 unsigned len, unsigned extra, int oppose)
2658 struct isl_basic_map *copy = NULL;
2662 copy = isl_basic_map_copy(ctx, src);
2663 copy = isl_basic_map_cow(ctx, copy);
2666 copy = isl_basic_map_extend(ctx, copy,
2667 copy->nparam, copy->n_in, copy->n_out, 0, 0, 1);
2668 k = isl_basic_map_alloc_inequality(ctx, copy);
2672 isl_seq_neg(copy->ineq[k], c, len);
2674 isl_seq_cpy(copy->ineq[k], c, len);
2675 isl_seq_clr(copy->ineq[k]+len, extra);
2676 isl_inequality_negate(ctx, copy, k);
2677 copy = isl_basic_map_simplify(ctx, copy);
2678 copy = isl_basic_map_finalize(ctx, copy);
2679 is_empty = isl_basic_map_is_empty(ctx, copy);
2683 dst = isl_map_add(ctx, dst, copy);
2685 isl_basic_map_free(ctx, copy);
2688 isl_basic_map_free(ctx, copy);
2689 isl_map_free(ctx, dst);
2693 static struct isl_map *subtract(struct isl_ctx *ctx, struct isl_map *map,
2694 struct isl_basic_map *bmap)
2698 struct isl_map *rest = NULL;
2700 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
2707 if (F_ISSET(map, ISL_MAP_DISJOINT))
2708 FL_SET(flags, ISL_MAP_DISJOINT);
2710 max = map->n * (2 * bmap->n_eq + bmap->n_ineq);
2711 rest = isl_map_alloc(ctx, map->nparam, map->n_in, map->n_out,
2716 for (i = 0; i < map->n; ++i) {
2717 map->p[i] = isl_basic_map_align_divs(ctx, map->p[i], bmap);
2722 for (j = 0; j < map->n; ++j)
2723 map->p[j] = isl_basic_map_cow(ctx, map->p[j]);
2725 for (i = 0; i < bmap->n_eq; ++i) {
2726 for (j = 0; j < map->n; ++j) {
2727 rest = add_cut_constraint(ctx, rest,
2728 map->p[j], bmap->eq[i],
2729 1+total, map->p[j]->n_div - bmap->n_div, 0);
2733 rest = add_cut_constraint(ctx, rest,
2734 map->p[j], bmap->eq[i],
2735 1+total, map->p[j]->n_div - bmap->n_div, 1);
2739 map->p[j] = isl_basic_map_extend(ctx, map->p[j],
2740 map->p[j]->nparam, map->p[j]->n_in,
2741 map->p[j]->n_out, 0, 1, 0);
2744 k = isl_basic_map_alloc_equality(ctx, map->p[j]);
2747 isl_seq_cpy(map->p[j]->eq[k], bmap->eq[i], 1+total);
2748 isl_seq_clr(map->p[j]->eq[k]+1+total,
2749 map->p[j]->n_div - bmap->n_div);
2753 for (i = 0; i < bmap->n_ineq; ++i) {
2754 for (j = 0; j < map->n; ++j) {
2755 rest = add_cut_constraint(ctx, rest,
2756 map->p[j], bmap->ineq[i],
2757 1+total, map->p[j]->n_div - bmap->n_div, 0);
2761 map->p[j] = isl_basic_map_extend(ctx, map->p[j],
2762 map->p[j]->nparam, map->p[j]->n_in,
2763 map->p[j]->n_out, 0, 0, 1);
2766 k = isl_basic_map_alloc_inequality(ctx, map->p[j]);
2769 isl_seq_cpy(map->p[j]->ineq[k], bmap->ineq[i], 1+total);
2770 isl_seq_clr(map->p[j]->ineq[k]+1+total,
2771 map->p[j]->n_div - bmap->n_div);
2775 isl_map_free(ctx, map);
2778 isl_map_free(ctx, map);
2779 isl_map_free(ctx, rest);
2783 struct isl_map *isl_map_subtract(struct isl_ctx *ctx, struct isl_map *map1,
2784 struct isl_map *map2)
2790 isl_assert(ctx, map1->nparam == map2->nparam, goto error);
2791 isl_assert(ctx, map1->n_in == map2->n_in, goto error);
2792 isl_assert(ctx, map1->n_out == map2->n_out, goto error);
2794 if (isl_map_is_empty(ctx, map2)) {
2795 isl_map_free(ctx, map2);
2799 map1 = isl_map_compute_divs(ctx, map1);
2800 map2 = isl_map_compute_divs(ctx, map2);
2804 for (i = 0; map1 && i < map2->n; ++i)
2805 map1 = subtract(ctx, map1, map2->p[i]);
2807 isl_map_free(ctx, map2);
2810 isl_map_free(ctx, map1);
2811 isl_map_free(ctx, map2);
2815 struct isl_set *isl_set_subtract(struct isl_ctx *ctx, struct isl_set *set1,
2816 struct isl_set *set2)
2818 return (struct isl_set *)
2819 isl_map_subtract(ctx,
2820 (struct isl_map *)set1, (struct isl_map *)set2);
2823 struct isl_set *isl_set_apply(struct isl_ctx *ctx, struct isl_set *set,
2824 struct isl_map *map)
2826 isl_assert(ctx, set->dim == map->n_in, goto error);
2827 map = isl_map_intersect_domain(ctx, map, set);
2828 set = isl_map_range(ctx, map);
2831 isl_set_free(ctx, set);
2832 isl_map_free(ctx, map);