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_basic_map_free_div(ctx, bmap, bmap->n_div);
658 isl_basic_map_free_inequality(ctx, bmap, bmap->n_ineq);
660 isl_basic_map_free_equality(ctx, bmap, bmap->n_eq-1);
662 isl_basic_map_alloc_equality(ctx, bmap);
666 isl_int_set_si(bmap->eq[i][0], 1);
667 isl_seq_clr(bmap->eq[i]+1, total);
668 F_SET(bmap, ISL_BASIC_MAP_EMPTY);
669 return isl_basic_map_finalize(ctx, bmap);
671 isl_basic_map_free(ctx, bmap);
675 static void swap_equality(struct isl_basic_map *bmap, int a, int b)
677 isl_int *t = bmap->eq[a];
678 bmap->eq[a] = bmap->eq[b];
682 static void swap_inequality(struct isl_basic_map *bmap, int a, int b)
684 isl_int *t = bmap->ineq[a];
685 bmap->ineq[a] = bmap->ineq[b];
689 static void swap_div(struct isl_basic_map *bmap, int a, int b)
692 unsigned off = bmap->nparam + bmap->n_in + bmap->n_out;
693 isl_int *t = bmap->div[a];
694 bmap->div[a] = bmap->div[b];
697 for (i = 0; i < bmap->n_eq; ++i)
698 isl_int_swap(bmap->eq[i][1+off+a], bmap->eq[i][1+off+b]);
700 for (i = 0; i < bmap->n_ineq; ++i)
701 isl_int_swap(bmap->ineq[i][1+off+a], bmap->ineq[i][1+off+b]);
703 for (i = 0; i < bmap->n_div; ++i)
704 isl_int_swap(bmap->div[i][1+1+off+a], bmap->div[i][1+1+off+b]);
707 struct isl_basic_map *isl_basic_map_gauss(struct isl_ctx *ctx,
708 struct isl_basic_map *bmap, int *progress)
719 total_var = bmap->nparam + bmap->n_in + bmap->n_out;
720 total = total_var + bmap->n_div;
722 last_var = total - 1;
723 for (done = 0; done < bmap->n_eq; ++done) {
724 for (; last_var >= 0; --last_var) {
725 for (k = done; k < bmap->n_eq; ++k)
726 if (!isl_int_is_zero(bmap->eq[k][1+last_var]))
734 swap_equality(bmap, k, done);
735 if (isl_int_is_neg(bmap->eq[done][1+last_var]))
736 isl_seq_neg(bmap->eq[done], bmap->eq[done], 1+total);
738 for (k = 0; k < bmap->n_eq; ++k) {
741 if (isl_int_is_zero(bmap->eq[k][1+last_var]))
745 isl_seq_elim(bmap->eq[k], bmap->eq[done],
746 1+last_var, 1+total, NULL);
749 for (k = 0; k < bmap->n_ineq; ++k) {
750 if (isl_int_is_zero(bmap->ineq[k][1+last_var]))
754 isl_seq_elim(bmap->ineq[k], bmap->eq[done],
755 1+last_var, 1+total, NULL);
758 for (k = 0; k < bmap->n_div; ++k) {
759 if (isl_int_is_zero(bmap->div[k][0]))
761 if (isl_int_is_zero(bmap->div[k][1+1+last_var]))
765 isl_seq_elim(bmap->div[k]+1, bmap->eq[done],
766 1+last_var, 1+total, &bmap->div[k][0]);
769 if (last_var >= total_var &&
770 isl_int_is_zero(bmap->div[last_var - total_var][0])) {
771 unsigned div = last_var - total_var;
772 isl_seq_neg(bmap->div[div]+1, bmap->eq[done], 1+total);
773 isl_int_set_si(bmap->div[div][1+1+last_var], 0);
774 isl_int_set(bmap->div[div][0],
775 bmap->eq[done][1+last_var]);
778 if (done == bmap->n_eq)
780 for (k = done; k < bmap->n_eq; ++k) {
781 if (isl_int_is_zero(bmap->eq[k][0]))
783 return isl_basic_map_set_to_empty(ctx, bmap);
785 isl_basic_map_free_equality(ctx, bmap, bmap->n_eq-done);
789 static unsigned int round_up(unsigned int v)
800 static struct isl_basic_map *remove_duplicate_constraints(
802 struct isl_basic_map *bmap, int *progress)
808 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
810 if (bmap->n_ineq <= 1)
813 size = round_up(4 * bmap->n_ineq / 3 - 1);
814 bits = ffs(size) - 1;
815 index = isl_alloc_array(ctx, int, size);
816 memset(index, 0, size * sizeof(int));
820 index[isl_seq_hash(bmap->ineq[0]+1, total, bits)] = 1;
821 for (k = 1; k < bmap->n_ineq; ++k) {
822 u_int32_t hash = isl_seq_hash(bmap->ineq[k]+1, total, bits);
823 for (h = hash; index[h]; h = (h+1) % size)
824 if (isl_seq_eq(bmap->ineq[k]+1,
825 bmap->ineq[index[h]-1]+1, total))
833 if (isl_int_lt(bmap->ineq[k][0], bmap->ineq[l][0]))
834 swap_inequality(bmap, k, l);
835 isl_basic_map_drop_inequality(ctx, bmap, k);
843 static struct isl_basic_map *remove_duplicate_divs(struct isl_ctx *ctx,
844 struct isl_basic_map *bmap, int *progress)
851 unsigned total_var = bmap->nparam + bmap->n_in + bmap->n_out;
852 unsigned total = total_var + bmap->n_div;
854 if (bmap->n_div <= 1)
857 for (k = bmap->n_div - 1; k >= 0; --k)
858 if (!isl_int_is_zero(bmap->div[k][0]))
863 size = round_up(4 * bmap->n_div / 3 - 1);
864 bits = ffs(size) - 1;
865 index = isl_alloc_array(ctx, int, size);
866 memset(index, 0, size * sizeof(int));
869 eq = isl_blk_alloc(ctx, 1+total);
873 isl_seq_clr(eq.data, 1+total);
874 index[isl_seq_hash(bmap->div[k], 2+total, bits)] = k + 1;
875 for (--k; k >= 0; --k) {
878 if (isl_int_is_zero(bmap->div[k][0]))
881 hash = isl_seq_hash(bmap->div[k], 2+total, bits);
882 for (h = hash; index[h]; h = (h+1) % size)
883 if (isl_seq_eq(bmap->div[k],
884 bmap->div[index[h]-1], 2+total))
889 isl_int_set_si(eq.data[1+total_var+k], -1);
890 isl_int_set_si(eq.data[1+total_var+l], 1);
891 eliminate_div(ctx, bmap, eq.data, l);
892 isl_int_set_si(eq.data[1+total_var+k], 0);
893 isl_int_set_si(eq.data[1+total_var+l], 0);
898 isl_blk_free(ctx, eq);
904 static struct isl_basic_map *eliminate_divs(
905 struct isl_ctx *ctx, struct isl_basic_map *bmap,
916 off = 1 + bmap->nparam + bmap->n_in + bmap->n_out;
918 for (d = bmap->n_div - 1; d >= 0 ; --d) {
919 for (i = 0; i < bmap->n_eq; ++i) {
920 if (!isl_int_is_one(bmap->eq[i][off + d]) &&
921 !isl_int_is_negone(bmap->eq[i][off + d]))
925 eliminate_div(ctx, bmap, bmap->eq[i], d);
926 isl_basic_map_drop_equality(ctx, bmap, i);
930 return eliminate_divs(ctx, bmap, progress);
934 static struct isl_basic_map *normalize_constraints(
935 struct isl_ctx *ctx, struct isl_basic_map *bmap)
939 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
942 for (i = bmap->n_eq - 1; i >= 0; --i) {
943 isl_seq_gcd(bmap->eq[i]+1, total, &gcd);
944 if (isl_int_is_zero(gcd)) {
945 if (!isl_int_is_zero(bmap->eq[i][0])) {
946 bmap = isl_basic_map_set_to_empty(ctx, bmap);
949 isl_basic_map_drop_equality(ctx, bmap, i);
952 if (isl_int_is_one(gcd))
954 if (!isl_int_is_divisible_by(bmap->eq[i][0], gcd)) {
955 bmap = isl_basic_map_set_to_empty(ctx, bmap);
958 isl_seq_scale_down(bmap->eq[i], bmap->eq[i], gcd, 1+total);
961 for (i = bmap->n_ineq - 1; i >= 0; --i) {
962 isl_seq_gcd(bmap->ineq[i]+1, total, &gcd);
963 if (isl_int_is_zero(gcd)) {
964 if (isl_int_is_neg(bmap->ineq[i][0])) {
965 bmap = isl_basic_map_set_to_empty(ctx, bmap);
968 isl_basic_map_drop_inequality(ctx, bmap, i);
971 if (isl_int_is_one(gcd))
973 isl_int_fdiv_q(bmap->ineq[i][0], bmap->ineq[i][0], gcd);
974 isl_seq_scale_down(bmap->ineq[i]+1, bmap->ineq[i]+1, gcd, total);
981 struct isl_basic_map *isl_basic_map_simplify(
982 struct isl_ctx *ctx, struct isl_basic_map *bmap)
989 bmap = normalize_constraints(ctx, bmap);
990 bmap = eliminate_divs(ctx, bmap, &progress);
991 bmap = isl_basic_map_gauss(ctx, bmap, &progress);
992 bmap = remove_duplicate_divs(ctx, bmap, &progress);
993 bmap = remove_duplicate_constraints(ctx, bmap, &progress);
998 struct isl_basic_set *isl_basic_set_simplify(
999 struct isl_ctx *ctx, struct isl_basic_set *bset)
1001 return (struct isl_basic_set *)
1002 isl_basic_map_simplify(ctx,
1003 (struct isl_basic_map *)bset);
1006 static void dump_term(struct isl_basic_map *bmap,
1007 isl_int c, int pos, FILE *out)
1009 unsigned in = bmap->n_in;
1010 unsigned dim = bmap->n_in + bmap->n_out;
1012 isl_int_print(out, c);
1014 if (!isl_int_is_one(c))
1015 isl_int_print(out, c);
1016 if (pos < 1 + bmap->nparam)
1017 fprintf(out, "p%d", pos - 1);
1018 else if (pos < 1 + bmap->nparam + in)
1019 fprintf(out, "i%d", pos - 1 - bmap->nparam);
1020 else if (pos < 1 + bmap->nparam + dim)
1021 fprintf(out, "o%d", pos - 1 - bmap->nparam - in);
1023 fprintf(out, "e%d", pos - 1 - bmap->nparam - dim);
1027 static void dump_constraint_sign(struct isl_basic_map *bmap, isl_int *c,
1028 int sign, FILE *out)
1032 unsigned len = 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
1036 for (i = 0, first = 1; i < len; ++i) {
1037 if (isl_int_sgn(c[i]) * sign <= 0)
1040 fprintf(out, " + ");
1042 isl_int_abs(v, c[i]);
1043 dump_term(bmap, v, i, out);
1050 static void dump_constraint(struct isl_basic_map *bmap, isl_int *c,
1051 const char *op, FILE *out, int indent)
1053 fprintf(out, "%*s", indent, "");
1055 dump_constraint_sign(bmap, c, 1, out);
1056 fprintf(out, " %s ", op);
1057 dump_constraint_sign(bmap, c, -1, out);
1062 static void dump_constraints(struct isl_basic_map *bmap,
1063 isl_int **c, unsigned n,
1064 const char *op, FILE *out, int indent)
1068 for (i = 0; i < n; ++i)
1069 dump_constraint(bmap, c[i], op, out, indent);
1072 static void dump_affine(struct isl_basic_map *bmap, isl_int *exp, FILE *out)
1076 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
1078 for (j = 0; j < 1 + total; ++j) {
1079 if (isl_int_is_zero(exp[j]))
1081 if (!first && isl_int_is_pos(exp[j]))
1083 dump_term(bmap, exp[j], j, out);
1088 static void dump(struct isl_basic_map *bmap, FILE *out, int indent)
1092 dump_constraints(bmap, bmap->eq, bmap->n_eq, "=", out, indent);
1093 dump_constraints(bmap, bmap->ineq, bmap->n_ineq, ">=", out, indent);
1095 for (i = 0; i < bmap->n_div; ++i) {
1096 fprintf(out, "%*s", indent, "");
1097 fprintf(out, "e%d = [(", i);
1098 dump_affine(bmap, bmap->div[i]+1, out);
1100 isl_int_print(out, bmap->div[i][0]);
1101 fprintf(out, "]\n");
1105 void isl_basic_set_dump(struct isl_ctx *ctx, struct isl_basic_set *bset,
1106 FILE *out, int indent)
1108 fprintf(out, "%*s", indent, "");
1109 fprintf(out, "nparam: %d, dim: %d, extra: %d\n",
1110 bset->nparam, bset->dim, bset->extra);
1111 dump((struct isl_basic_map *)bset, out, indent);
1114 void isl_basic_map_dump(struct isl_ctx *ctx, struct isl_basic_map *bmap,
1115 FILE *out, int indent)
1117 fprintf(out, "%*s", indent, "");
1118 fprintf(out, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d\n",
1120 bmap->nparam, bmap->n_in, bmap->n_out, bmap->extra);
1121 dump(bmap, out, indent);
1124 int isl_inequality_negate(struct isl_ctx *ctx,
1125 struct isl_basic_map *bmap, unsigned pos)
1127 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
1128 isl_assert(ctx, pos < bmap->n_ineq, return -1);
1129 isl_seq_neg(bmap->ineq[pos], bmap->ineq[pos], 1 + total);
1130 isl_int_sub_ui(bmap->ineq[pos][0], bmap->ineq[pos][0], 1);
1134 struct isl_set *isl_set_alloc(struct isl_ctx *ctx,
1135 unsigned nparam, unsigned dim, int n, unsigned flags)
1137 struct isl_set *set;
1139 set = isl_alloc(ctx, struct isl_set,
1140 sizeof(struct isl_set) +
1141 n * sizeof(struct isl_basic_set *));
1148 set->nparam = nparam;
1155 struct isl_set *isl_set_dup(struct isl_ctx *ctx, struct isl_set *set)
1158 struct isl_set *dup;
1160 dup = isl_set_alloc(ctx, set->nparam, set->dim, set->n, set->flags);
1163 for (i = 0; i < set->n; ++i)
1164 dup = isl_set_add(ctx, dup,
1165 isl_basic_set_dup(ctx, set->p[i]));
1169 struct isl_set *isl_set_from_basic_set(struct isl_ctx *ctx,
1170 struct isl_basic_set *bset)
1172 struct isl_set *set;
1174 set = isl_set_alloc(ctx, bset->nparam, bset->dim, 1, ISL_MAP_DISJOINT);
1176 isl_basic_set_free(ctx, bset);
1179 return isl_set_add(ctx, set, bset);
1182 struct isl_map *isl_map_from_basic_map(struct isl_ctx *ctx,
1183 struct isl_basic_map *bmap)
1185 struct isl_map *map;
1187 map = isl_map_alloc(ctx, bmap->nparam, bmap->n_in, bmap->n_out, 1,
1190 isl_basic_map_free(ctx, bmap);
1193 return isl_map_add(ctx, map, bmap);
1196 struct isl_set *isl_set_add(struct isl_ctx *ctx, struct isl_set *set,
1197 struct isl_basic_set *bset)
1201 isl_assert(ctx, set->nparam == bset->nparam, goto error);
1202 isl_assert(ctx, set->dim == bset->dim, goto error);
1203 isl_assert(ctx, set->n < set->size, goto error);
1204 set->p[set->n] = bset;
1209 isl_set_free(ctx, set);
1211 isl_basic_set_free(ctx, bset);
1215 void isl_set_free(struct isl_ctx *ctx, struct isl_set *set)
1225 for (i = 0; i < set->n; ++i)
1226 isl_basic_set_free(ctx, set->p[i]);
1230 void isl_set_dump(struct isl_ctx *ctx, struct isl_set *set, FILE *out,
1236 fprintf(out, "null set\n");
1240 fprintf(out, "%*s", indent, "");
1241 fprintf(out, "ref: %d, n: %d\n", set->ref, set->n);
1242 for (i = 0; i < set->n; ++i) {
1243 fprintf(out, "%*s", indent, "");
1244 fprintf(out, "basic set %d:\n", i);
1245 isl_basic_set_dump(ctx, set->p[i], out, indent+4);
1249 void isl_map_dump(struct isl_ctx *ctx, struct isl_map *map, FILE *out,
1254 fprintf(out, "%*s", indent, "");
1255 fprintf(out, "ref: %d, n: %d, nparam: %d, in: %d, out: %d\n",
1256 map->ref, map->n, map->nparam, map->n_in, map->n_out);
1257 for (i = 0; i < map->n; ++i) {
1258 fprintf(out, "%*s", indent, "");
1259 fprintf(out, "basic map %d:\n", i);
1260 isl_basic_map_dump(ctx, map->p[i], out, indent+4);
1264 struct isl_basic_map *isl_basic_map_intersect_domain(
1265 struct isl_ctx *ctx, struct isl_basic_map *bmap,
1266 struct isl_basic_set *bset)
1268 struct isl_basic_map *bmap_domain;
1273 isl_assert(ctx, bset->dim == bmap->n_in, goto error);
1274 isl_assert(ctx, bset->nparam == bmap->nparam, goto error);
1276 bmap = isl_basic_map_extend(ctx, bmap,
1277 bset->nparam, bmap->n_in, bmap->n_out,
1278 bset->n_div, bset->n_eq, bset->n_ineq);
1281 bmap_domain = isl_basic_map_from_basic_set(ctx, bset,
1283 bmap = add_constraints(ctx, bmap, bmap_domain, 0, 0);
1285 return isl_basic_map_finalize(ctx, bmap);
1287 isl_basic_map_free(ctx, bmap);
1288 isl_basic_set_free(ctx, bset);
1292 struct isl_basic_map *isl_basic_map_intersect_range(
1293 struct isl_ctx *ctx, struct isl_basic_map *bmap,
1294 struct isl_basic_set *bset)
1296 struct isl_basic_map *bmap_range;
1301 isl_assert(ctx, bset->dim == bmap->n_out, goto error);
1302 isl_assert(ctx, bset->nparam == bmap->nparam, goto error);
1304 bmap = isl_basic_map_extend(ctx, bmap,
1305 bset->nparam, bmap->n_in, bmap->n_out,
1306 bset->n_div, bset->n_eq, bset->n_ineq);
1309 bmap_range = isl_basic_map_from_basic_set(ctx, bset,
1311 bmap = add_constraints(ctx, bmap, bmap_range, 0, 0);
1313 return isl_basic_map_finalize(ctx, bmap);
1315 isl_basic_map_free(ctx, bmap);
1316 isl_basic_set_free(ctx, bset);
1320 struct isl_basic_map *isl_basic_map_intersect(
1321 struct isl_ctx *ctx, struct isl_basic_map *bmap1,
1322 struct isl_basic_map *bmap2)
1324 isl_assert(ctx, bmap1->nparam == bmap2->nparam, goto error);
1325 isl_assert(ctx, bmap1->n_in == bmap2->n_in, goto error);
1326 isl_assert(ctx, bmap1->n_out == bmap2->n_out, goto error);
1328 bmap1 = isl_basic_map_extend(ctx, bmap1,
1329 bmap1->nparam, bmap1->n_in, bmap1->n_out,
1330 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
1333 bmap1 = add_constraints(ctx, bmap1, bmap2, 0, 0);
1335 return isl_basic_map_finalize(ctx, bmap1);
1337 isl_basic_map_free(ctx, bmap1);
1338 isl_basic_map_free(ctx, bmap2);
1342 struct isl_basic_set *isl_basic_set_intersect(
1343 struct isl_ctx *ctx, struct isl_basic_set *bset1,
1344 struct isl_basic_set *bset2)
1346 return (struct isl_basic_set *)
1347 isl_basic_map_intersect(ctx,
1348 (struct isl_basic_map *)bset1,
1349 (struct isl_basic_map *)bset2);
1352 struct isl_map *isl_map_intersect(struct isl_ctx *ctx, struct isl_map *map1,
1353 struct isl_map *map2)
1356 struct isl_map *result;
1362 if (F_ISSET(map1, ISL_MAP_DISJOINT) &&
1363 F_ISSET(map2, ISL_MAP_DISJOINT))
1364 FL_SET(flags, ISL_MAP_DISJOINT);
1366 result = isl_map_alloc(ctx, map1->nparam, map1->n_in, map1->n_out,
1367 map1->n * map2->n, flags);
1370 for (i = 0; i < map1->n; ++i)
1371 for (j = 0; j < map2->n; ++j) {
1372 struct isl_basic_map *part;
1373 part = isl_basic_map_intersect(ctx,
1374 isl_basic_map_copy(ctx, map1->p[i]),
1375 isl_basic_map_copy(ctx, map2->p[j]));
1376 if (isl_basic_map_is_empty(ctx, part))
1377 isl_basic_map_free(ctx, part);
1379 result = isl_map_add(ctx, result, part);
1383 isl_map_free(ctx, map1);
1384 isl_map_free(ctx, map2);
1387 isl_map_free(ctx, map1);
1388 isl_map_free(ctx, map2);
1392 struct isl_basic_map *isl_basic_map_reverse(struct isl_ctx *ctx,
1393 struct isl_basic_map *bmap)
1395 struct isl_basic_set *bset;
1400 bmap = isl_basic_map_cow(ctx, bmap);
1404 bset = isl_basic_set_from_basic_map(ctx, bmap);
1405 bset = isl_basic_set_swap_vars(ctx, bset, in);
1406 return isl_basic_map_from_basic_set(ctx, bset, bset->dim-in, in);
1409 /* Turn final n dimensions into existentially quantified variables.
1411 struct isl_basic_set *isl_basic_set_project_out(
1412 struct isl_ctx *ctx, struct isl_basic_set *bset,
1413 unsigned n, unsigned flags)
1423 isl_assert(ctx, n <= bset->dim, goto error);
1428 bset = isl_basic_set_cow(ctx, bset);
1430 row_size = 1 + bset->nparam + bset->dim + bset->extra;
1431 old = bset->block2.data;
1432 bset->block2 = isl_blk_extend(ctx, bset->block2,
1433 (bset->extra + n) * (1 + row_size));
1434 if (!bset->block2.data)
1436 new_div = isl_alloc_array(ctx, isl_int *, bset->extra + n);
1439 for (i = 0; i < n; ++i) {
1440 new_div[i] = bset->block2.data +
1441 (bset->extra + i) * (1 + row_size);
1442 isl_seq_clr(new_div[i], 1 + row_size);
1444 for (i = 0; i < bset->extra; ++i)
1445 new_div[n + i] = bset->block2.data + (bset->div[i] - old);
1447 bset->div = new_div;
1451 bset = isl_basic_set_simplify(ctx, bset);
1452 return isl_basic_set_finalize(ctx, bset);
1454 isl_basic_set_free(ctx, bset);
1458 struct isl_basic_map *isl_basic_map_apply_range(
1459 struct isl_ctx *ctx, struct isl_basic_map *bmap1,
1460 struct isl_basic_map *bmap2)
1462 struct isl_basic_set *bset;
1463 unsigned n_in, n_out;
1465 if (!bmap1 || !bmap2)
1468 isl_assert(ctx, bmap1->n_out == bmap2->n_in, goto error);
1469 isl_assert(ctx, bmap1->nparam == bmap2->nparam, goto error);
1472 n_out = bmap2->n_out;
1474 bmap2 = isl_basic_map_reverse(ctx, bmap2);
1477 bmap1 = isl_basic_map_extend(ctx, bmap1, bmap1->nparam,
1478 bmap1->n_in + bmap2->n_in, bmap1->n_out,
1479 bmap2->extra, bmap2->n_eq, bmap2->n_ineq);
1482 bmap1 = add_constraints(ctx, bmap1, bmap2, bmap1->n_in - bmap2->n_in, 0);
1483 bset = isl_basic_set_from_basic_map(ctx, bmap1);
1484 bset = isl_basic_set_project_out(ctx, bset,
1485 bset->dim - (n_in + n_out), 0);
1486 return isl_basic_map_from_basic_set(ctx, bset, n_in, n_out);
1488 isl_basic_map_free(ctx, bmap1);
1489 isl_basic_map_free(ctx, bmap2);
1493 struct isl_basic_map *isl_basic_map_apply_domain(
1494 struct isl_ctx *ctx, struct isl_basic_map *bmap1,
1495 struct isl_basic_map *bmap2)
1497 if (!bmap1 || !bmap2)
1500 isl_assert(ctx, bmap1->n_in == bmap2->n_in, goto error);
1501 isl_assert(ctx, bmap1->nparam == bmap2->nparam, goto error);
1503 bmap1 = isl_basic_map_reverse(ctx, bmap1);
1504 bmap1 = isl_basic_map_apply_range(ctx, bmap1, bmap2);
1505 return isl_basic_map_reverse(ctx, bmap1);
1507 isl_basic_map_free(ctx, bmap1);
1508 isl_basic_map_free(ctx, bmap2);
1512 static struct isl_basic_map *var_equal(struct isl_ctx *ctx,
1513 struct isl_basic_map *bmap, unsigned pos)
1516 i = isl_basic_map_alloc_equality(ctx, bmap);
1519 isl_seq_clr(bmap->eq[i],
1520 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->extra);
1521 isl_int_set_si(bmap->eq[i][1+bmap->nparam+pos], -1);
1522 isl_int_set_si(bmap->eq[i][1+bmap->nparam+bmap->n_in+pos], 1);
1523 return isl_basic_map_finalize(ctx, bmap);
1525 isl_basic_map_free(ctx, bmap);
1529 static struct isl_basic_map *var_more(struct isl_ctx *ctx,
1530 struct isl_basic_map *bmap, unsigned pos)
1533 i = isl_basic_map_alloc_inequality(ctx, bmap);
1536 isl_seq_clr(bmap->ineq[i],
1537 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->extra);
1538 isl_int_set_si(bmap->ineq[i][0], -1);
1539 isl_int_set_si(bmap->ineq[i][1+bmap->nparam+pos], -1);
1540 isl_int_set_si(bmap->ineq[i][1+bmap->nparam+bmap->n_in+pos], 1);
1541 return isl_basic_map_finalize(ctx, bmap);
1543 isl_basic_map_free(ctx, bmap);
1547 static struct isl_basic_map *var_less(struct isl_ctx *ctx,
1548 struct isl_basic_map *bmap, unsigned pos)
1551 i = isl_basic_map_alloc_inequality(ctx, bmap);
1554 isl_seq_clr(bmap->ineq[i],
1555 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->extra);
1556 isl_int_set_si(bmap->ineq[i][0], -1);
1557 isl_int_set_si(bmap->ineq[i][1+bmap->nparam+pos], 1);
1558 isl_int_set_si(bmap->ineq[i][1+bmap->nparam+bmap->n_in+pos], -1);
1559 return isl_basic_map_finalize(ctx, bmap);
1561 isl_basic_map_free(ctx, bmap);
1565 struct isl_basic_map *isl_basic_map_equal(struct isl_ctx *ctx,
1566 unsigned nparam, unsigned in, unsigned out, unsigned n_equal)
1569 struct isl_basic_map *bmap;
1570 bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, n_equal, 0);
1573 for (i = 0; i < n_equal && bmap; ++i)
1574 bmap = var_equal(ctx, bmap, i);
1575 return isl_basic_map_finalize(ctx, bmap);
1578 struct isl_basic_map *isl_basic_map_less_at(struct isl_ctx *ctx,
1579 unsigned nparam, unsigned in, unsigned out, unsigned pos)
1582 struct isl_basic_map *bmap;
1583 bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, pos, 1);
1586 for (i = 0; i < pos && bmap; ++i)
1587 bmap = var_equal(ctx, bmap, i);
1589 bmap = var_less(ctx, bmap, pos);
1590 return isl_basic_map_finalize(ctx, bmap);
1593 struct isl_basic_map *isl_basic_map_more_at(struct isl_ctx *ctx,
1594 unsigned nparam, unsigned in, unsigned out, unsigned pos)
1597 struct isl_basic_map *bmap;
1598 bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, pos, 1);
1601 for (i = 0; i < pos && bmap; ++i)
1602 bmap = var_equal(ctx, bmap, i);
1604 bmap = var_more(ctx, bmap, pos);
1605 return isl_basic_map_finalize(ctx, bmap);
1608 struct isl_basic_map *isl_basic_map_from_basic_set(
1609 struct isl_ctx *ctx, struct isl_basic_set *bset,
1610 unsigned n_in, unsigned n_out)
1612 struct isl_basic_map *bmap;
1614 bset = isl_basic_set_cow(ctx, bset);
1618 isl_assert(ctx, bset->dim == n_in + n_out, goto error);
1619 bmap = (struct isl_basic_map *) bset;
1621 bmap->n_out = n_out;
1622 return isl_basic_map_finalize(ctx, bmap);
1624 isl_basic_set_free(ctx, bset);
1628 struct isl_basic_set *isl_basic_set_from_basic_map(
1629 struct isl_ctx *ctx, struct isl_basic_map *bmap)
1633 if (bmap->n_in == 0)
1634 return (struct isl_basic_set *)bmap;
1635 bmap = isl_basic_map_cow(ctx, bmap);
1638 bmap->n_out += bmap->n_in;
1640 bmap = isl_basic_map_finalize(ctx, bmap);
1641 return (struct isl_basic_set *)bmap;
1646 struct isl_basic_set *isl_basic_map_domain(struct isl_ctx *ctx,
1647 struct isl_basic_map *bmap)
1649 struct isl_basic_set *domain;
1653 n_out = bmap->n_out;
1654 domain = isl_basic_set_from_basic_map(ctx, bmap);
1655 return isl_basic_set_project_out(ctx, domain, n_out, 0);
1658 struct isl_basic_set *isl_basic_map_range(struct isl_ctx *ctx,
1659 struct isl_basic_map *bmap)
1661 return isl_basic_map_domain(ctx,
1662 isl_basic_map_reverse(ctx, bmap));
1665 struct isl_set *isl_map_range(struct isl_ctx *ctx, struct isl_map *map)
1668 struct isl_set *set;
1672 map = isl_map_cow(ctx, map);
1676 set = (struct isl_set *) map;
1678 for (i = 0; i < map->n; ++i) {
1679 set->p[i] = isl_basic_map_range(ctx, map->p[i]);
1683 F_CLR(set, ISL_MAP_DISJOINT);
1686 isl_map_free(ctx, map);
1690 struct isl_map *isl_map_from_set(
1691 struct isl_ctx *ctx, struct isl_set *set,
1692 unsigned n_in, unsigned n_out)
1695 struct isl_map *map = NULL;
1699 isl_assert(ctx, set->dim == n_in + n_out, goto error);
1700 set = isl_set_cow(ctx, set);
1703 map = (struct isl_map *)set;
1704 for (i = 0; i < set->n; ++i) {
1705 map->p[i] = isl_basic_map_from_basic_set(ctx,
1706 set->p[i], n_in, n_out);
1714 isl_set_free(ctx, set);
1718 struct isl_map *isl_map_alloc(struct isl_ctx *ctx,
1719 unsigned nparam, unsigned in, unsigned out, int n,
1722 struct isl_map *map;
1724 map = isl_alloc(ctx, struct isl_map,
1725 sizeof(struct isl_map) +
1726 n * sizeof(struct isl_basic_map *));
1733 map->nparam = nparam;
1740 struct isl_basic_map *isl_basic_map_empty(struct isl_ctx *ctx,
1741 unsigned nparam, unsigned in, unsigned out)
1743 struct isl_basic_map *bmap;
1744 bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, 1, 0);
1745 bmap = isl_basic_map_set_to_empty(ctx, bmap);
1749 struct isl_map *isl_map_empty(struct isl_ctx *ctx,
1750 unsigned nparam, unsigned in, unsigned out)
1752 return isl_map_alloc(ctx, nparam, in, out, 0, ISL_MAP_DISJOINT);
1755 struct isl_set *isl_set_empty(struct isl_ctx *ctx,
1756 unsigned nparam, unsigned dim)
1758 return isl_set_alloc(ctx, nparam, dim, 0, ISL_MAP_DISJOINT);
1761 struct isl_map *isl_map_dup(struct isl_ctx *ctx, struct isl_map *map)
1764 struct isl_map *dup;
1766 dup = isl_map_alloc(ctx, map->nparam, map->n_in, map->n_out, map->n,
1768 for (i = 0; i < map->n; ++i)
1769 dup = isl_map_add(ctx, dup,
1770 isl_basic_map_dup(ctx, map->p[i]));
1774 struct isl_map *isl_map_add(struct isl_ctx *ctx, struct isl_map *map,
1775 struct isl_basic_map *bmap)
1779 isl_assert(ctx, map->nparam == bmap->nparam, goto error);
1780 isl_assert(ctx, map->n_in == bmap->n_in, goto error);
1781 isl_assert(ctx, map->n_out == bmap->n_out, goto error);
1782 isl_assert(ctx, map->n < map->size, goto error);
1783 map->p[map->n] = bmap;
1788 isl_map_free(ctx, map);
1790 isl_basic_map_free(ctx, bmap);
1794 void isl_map_free(struct isl_ctx *ctx, struct isl_map *map)
1804 for (i = 0; i < map->n; ++i)
1805 isl_basic_map_free(ctx, map->p[i]);
1809 struct isl_map *isl_map_extend(struct isl_ctx *ctx, struct isl_map *base,
1810 unsigned nparam, unsigned n_in, unsigned n_out)
1814 base = isl_map_cow(ctx, base);
1818 isl_assert(ctx, base->nparam <= nparam, goto error);
1819 isl_assert(ctx, base->n_in <= n_in, goto error);
1820 isl_assert(ctx, base->n_out <= n_out, goto error);
1821 base->nparam = nparam;
1823 base->n_out = n_out;
1824 for (i = 0; i < base->n; ++i) {
1825 base->p[i] = isl_basic_map_extend(ctx, base->p[i],
1826 nparam, n_in, n_out, 0, 0, 0);
1832 isl_map_free(ctx, base);
1836 struct isl_basic_map *isl_basic_map_fix_input_si(struct isl_ctx *ctx,
1837 struct isl_basic_map *bmap,
1838 unsigned input, int value)
1842 bmap = isl_basic_map_cow(ctx, bmap);
1845 isl_assert(ctx, input < bmap->n_in, goto error);
1847 bmap = isl_basic_map_extend(ctx, bmap,
1848 bmap->nparam, bmap->n_in, bmap->n_out, 0, 1, 0);
1849 j = isl_basic_map_alloc_equality(ctx, bmap);
1852 isl_int_set_si(bmap->eq[j][1+bmap->nparam+input], -1);
1853 isl_int_set_si(bmap->eq[j][0], value);
1854 return isl_basic_map_finalize(ctx, bmap);
1856 isl_basic_map_free(ctx, bmap);
1860 struct isl_map *isl_map_fix_input_si(struct isl_ctx *ctx, struct isl_map *map,
1861 unsigned input, int value)
1865 map = isl_map_cow(ctx, map);
1869 isl_assert(ctx, input < map->n_in, goto error);
1870 for (i = 0; i < map->n; ++i) {
1871 map->p[i] = isl_basic_map_fix_input_si(ctx, map->p[i],
1878 isl_map_free(ctx, map);
1882 struct isl_map *isl_map_reverse(struct isl_ctx *ctx, struct isl_map *map)
1887 map = isl_map_cow(ctx, map);
1892 map->n_in = map->n_out;
1894 for (i = 0; i < map->n; ++i) {
1895 map->p[i] = isl_basic_map_reverse(ctx, map->p[i]);
1901 isl_map_free(ctx, map);
1905 struct isl_map *isl_basic_map_lexmax(struct isl_ctx *ctx,
1906 struct isl_basic_map *bmap, struct isl_basic_set *dom,
1907 struct isl_set **empty)
1909 return isl_pip_basic_map_lexmax(ctx, bmap, dom, empty);
1912 struct isl_map *isl_basic_map_lexmin(struct isl_ctx *ctx,
1913 struct isl_basic_map *bmap, struct isl_basic_set *dom,
1914 struct isl_set **empty)
1916 return isl_pip_basic_map_lexmin(ctx, bmap, dom, empty);
1919 struct isl_set *isl_basic_set_lexmin(struct isl_ctx *ctx,
1920 struct isl_basic_set *bset)
1922 struct isl_basic_map *bmap = NULL;
1923 struct isl_basic_set *dom = NULL;
1924 struct isl_map *min;
1928 bmap = isl_basic_map_from_basic_set(ctx, bset, 0, bset->dim);
1931 dom = isl_basic_set_alloc(ctx, bmap->nparam, 0, 0, 0, 0);
1934 min = isl_basic_map_lexmin(ctx, bmap, dom, NULL);
1935 return isl_map_range(ctx, min);
1937 isl_basic_map_free(ctx, bmap);
1941 struct isl_map *isl_basic_map_compute_divs(struct isl_ctx *ctx,
1942 struct isl_basic_map *bmap)
1944 if (bmap->n_div == 0)
1945 return isl_map_from_basic_map(ctx, bmap);
1946 return isl_pip_basic_map_compute_divs(ctx, bmap);
1949 struct isl_map *isl_map_compute_divs(struct isl_ctx *ctx, struct isl_map *map)
1952 struct isl_map *res;
1958 res = isl_basic_map_compute_divs(ctx,
1959 isl_basic_map_copy(ctx, map->p[0]));
1960 for (i = 1 ; i < map->n; ++i) {
1962 r2 = isl_basic_map_compute_divs(ctx,
1963 isl_basic_map_copy(ctx, map->p[i]));
1964 if (F_ISSET(map, ISL_MAP_DISJOINT))
1965 res = isl_map_union_disjoint(ctx, res, r2);
1967 res = isl_map_union(ctx, res, r2);
1969 isl_map_free(ctx, map);
1974 struct isl_set *isl_basic_set_compute_divs(struct isl_ctx *ctx,
1975 struct isl_basic_set *bset)
1977 return (struct isl_set *)
1978 isl_basic_map_compute_divs(ctx,
1979 (struct isl_basic_map *)bset);
1982 struct isl_set *isl_map_domain(struct isl_ctx *ctx, struct isl_map *map)
1985 struct isl_set *set;
1990 map = isl_map_cow(ctx, map);
1994 set = (struct isl_set *)map;
1995 set->dim = map->n_in;
1997 for (i = 0; i < map->n; ++i) {
1998 set->p[i] = isl_basic_map_domain(ctx, map->p[i]);
2002 F_CLR(set, ISL_MAP_DISJOINT);
2005 isl_map_free(ctx, map);
2009 struct isl_map *isl_map_union_disjoint(struct isl_ctx *ctx,
2010 struct isl_map *map1, struct isl_map *map2)
2014 struct isl_map *map = NULL;
2020 isl_map_free(ctx, map1);
2024 isl_map_free(ctx, map2);
2028 isl_assert(ctx, map1->nparam == map2->nparam, goto error);
2029 isl_assert(ctx, map1->n_in == map2->n_in, goto error);
2030 isl_assert(ctx, map1->n_out == map2->n_out, goto error);
2032 if (F_ISSET(map1, ISL_MAP_DISJOINT) &&
2033 F_ISSET(map2, ISL_MAP_DISJOINT))
2034 FL_SET(flags, ISL_MAP_DISJOINT);
2036 map = isl_map_alloc(ctx, map1->nparam, map1->n_in, map1->n_out,
2037 map1->n + map2->n, flags);
2040 for (i = 0; i < map1->n; ++i) {
2041 map = isl_map_add(ctx, map,
2042 isl_basic_map_copy(ctx, map1->p[i]));
2046 for (i = 0; i < map2->n; ++i) {
2047 map = isl_map_add(ctx, map,
2048 isl_basic_map_copy(ctx, map2->p[i]));
2052 isl_map_free(ctx, map1);
2053 isl_map_free(ctx, map2);
2056 isl_map_free(ctx, map);
2057 isl_map_free(ctx, map1);
2058 isl_map_free(ctx, map2);
2062 struct isl_map *isl_map_union(struct isl_ctx *ctx,
2063 struct isl_map *map1, struct isl_map *map2)
2065 map1 = isl_map_union_disjoint(ctx, map1, map2);
2069 F_CLR(map1, ISL_MAP_DISJOINT);
2073 struct isl_set *isl_set_union_disjoint(struct isl_ctx *ctx,
2074 struct isl_set *set1, struct isl_set *set2)
2076 return (struct isl_set *)
2077 isl_map_union_disjoint(ctx,
2078 (struct isl_map *)set1, (struct isl_map *)set2);
2081 struct isl_set *isl_set_union(struct isl_ctx *ctx,
2082 struct isl_set *set1, struct isl_set *set2)
2084 return (struct isl_set *)
2086 (struct isl_map *)set1, (struct isl_map *)set2);
2089 struct isl_map *isl_map_intersect_range(
2090 struct isl_ctx *ctx, struct isl_map *map,
2091 struct isl_set *set)
2094 struct isl_map *result;
2100 if (F_ISSET(map, ISL_MAP_DISJOINT) &&
2101 F_ISSET(set, ISL_MAP_DISJOINT))
2102 FL_SET(flags, ISL_MAP_DISJOINT);
2104 result = isl_map_alloc(ctx, map->nparam, map->n_in, map->n_out,
2105 map->n * set->n, flags);
2108 for (i = 0; i < map->n; ++i)
2109 for (j = 0; j < set->n; ++j) {
2110 result = isl_map_add(ctx, result,
2111 isl_basic_map_intersect_range(ctx,
2112 isl_basic_map_copy(ctx, map->p[i]),
2113 isl_basic_set_copy(ctx, set->p[j])));
2117 isl_map_free(ctx, map);
2118 isl_set_free(ctx, set);
2121 isl_map_free(ctx, map);
2122 isl_set_free(ctx, set);
2126 struct isl_map *isl_map_intersect_domain(
2127 struct isl_ctx *ctx, struct isl_map *map,
2128 struct isl_set *set)
2130 return isl_map_reverse(ctx,
2131 isl_map_intersect_range(ctx, isl_map_reverse(ctx, map), set));
2134 struct isl_map *isl_map_apply_domain(
2135 struct isl_ctx *ctx, struct isl_map *map1,
2136 struct isl_map *map2)
2140 map1 = isl_map_reverse(ctx, map1);
2141 map1 = isl_map_apply_range(ctx, map1, map2);
2142 return isl_map_reverse(ctx, map1);
2144 isl_map_free(ctx, map1);
2145 isl_map_free(ctx, map2);
2149 struct isl_map *isl_map_apply_range(
2150 struct isl_ctx *ctx, struct isl_map *map1,
2151 struct isl_map *map2)
2153 struct isl_map *result;
2159 isl_assert(ctx, map1->nparam == map2->nparam, goto error);
2160 isl_assert(ctx, map1->n_out == map2->n_in, goto error);
2162 result = isl_map_alloc(ctx, map1->nparam, map1->n_in, map2->n_out,
2163 map1->n * map2->n, 0);
2166 for (i = 0; i < map1->n; ++i)
2167 for (j = 0; j < map2->n; ++j) {
2168 result = isl_map_add(ctx, result,
2169 isl_basic_map_apply_range(ctx,
2170 isl_basic_map_copy(ctx, map1->p[i]),
2171 isl_basic_map_copy(ctx, map2->p[j])));
2175 isl_map_free(ctx, map1);
2176 isl_map_free(ctx, map2);
2179 isl_map_free(ctx, map1);
2180 isl_map_free(ctx, map2);
2185 * returns range - domain
2187 struct isl_basic_set *isl_basic_map_deltas(struct isl_ctx *ctx,
2188 struct isl_basic_map *bmap)
2190 struct isl_basic_set *bset;
2196 isl_assert(ctx, bmap->n_in == bmap->n_out, goto error);
2198 bset = isl_basic_set_from_basic_map(ctx, bmap);
2199 bset = isl_basic_set_extend(ctx, bset, bset->nparam, 3*dim, 0,
2201 bset = isl_basic_set_swap_vars(ctx, bset, 2*dim);
2202 for (i = 0; i < dim; ++i) {
2203 int j = isl_basic_map_alloc_equality(ctx,
2204 (struct isl_basic_map *)bset);
2207 isl_int_set_si(bset->eq[j][1+bset->nparam+i], 1);
2208 isl_int_set_si(bset->eq[j][1+bset->nparam+dim+i], 1);
2209 isl_int_set_si(bset->eq[j][1+bset->nparam+2*dim+i], -1);
2211 return isl_basic_set_project_out(ctx, bset, 2*dim, 0);
2213 isl_basic_map_free(ctx, bmap);
2217 /* If the only constraints a div d=floor(f/m)
2218 * appears in are its two defining constraints
2221 * -(f - (m - 1)) + m d >= 0
2223 * then it can safely be removed.
2225 static int div_is_redundant(struct isl_ctx *ctx, struct isl_basic_map *bmap,
2229 unsigned pos = 1 + bmap->nparam + bmap->n_in + bmap->n_out + div;
2231 for (i = 0; i < bmap->n_eq; ++i)
2232 if (!isl_int_is_zero(bmap->eq[i][pos]))
2235 for (i = 0; i < bmap->n_ineq; ++i) {
2236 if (isl_int_is_zero(bmap->ineq[i][pos]))
2238 if (isl_int_eq(bmap->ineq[i][pos], bmap->div[div][0])) {
2240 isl_int_sub(bmap->div[div][1],
2241 bmap->div[div][1], bmap->div[div][0]);
2242 isl_int_add_ui(bmap->div[div][1], bmap->div[div][1], 1);
2243 neg = isl_seq_is_neg(bmap->ineq[i], bmap->div[div]+1, pos);
2244 isl_int_sub_ui(bmap->div[div][1], bmap->div[div][1], 1);
2245 isl_int_add(bmap->div[div][1],
2246 bmap->div[div][1], bmap->div[div][0]);
2249 if (isl_seq_first_non_zero(bmap->ineq[i]+pos+1,
2250 bmap->n_div-div-1) != -1)
2252 } else if (isl_int_abs_eq(bmap->ineq[i][pos], bmap->div[div][0])) {
2253 if (!isl_seq_eq(bmap->ineq[i], bmap->div[div]+1, pos))
2255 if (isl_seq_first_non_zero(bmap->ineq[i]+pos+1,
2256 bmap->n_div-div-1) != -1)
2262 for (i = 0; i < bmap->n_div; ++i)
2263 if (!isl_int_is_zero(bmap->div[i][1+pos]))
2270 * Remove divs that don't occur in any of the constraints or other divs.
2271 * These can arise when dropping some of the variables in a quast
2272 * returned by piplib.
2274 static struct isl_basic_map *remove_redundant_divs(struct isl_ctx *ctx,
2275 struct isl_basic_map *bmap)
2279 for (i = bmap->n_div-1; i >= 0; --i) {
2280 if (!div_is_redundant(ctx, bmap, i))
2282 bmap = isl_basic_map_drop_div(ctx, bmap, i);
2287 struct isl_basic_map *isl_basic_map_finalize(struct isl_ctx *ctx,
2288 struct isl_basic_map *bmap)
2290 bmap = remove_redundant_divs(ctx, bmap);
2293 F_SET(bmap, ISL_BASIC_SET_FINAL);
2297 struct isl_basic_set *isl_basic_set_finalize(struct isl_ctx *ctx,
2298 struct isl_basic_set *bset)
2300 return (struct isl_basic_set *)
2301 isl_basic_map_finalize(ctx,
2302 (struct isl_basic_map *)bset);
2305 struct isl_set *isl_set_finalize(struct isl_ctx *ctx, struct isl_set *set)
2311 for (i = 0; i < set->n; ++i) {
2312 set->p[i] = isl_basic_set_finalize(ctx, set->p[i]);
2318 isl_set_free(ctx, set);
2322 struct isl_map *isl_map_finalize(struct isl_ctx *ctx, struct isl_map *map)
2328 for (i = 0; i < map->n; ++i) {
2329 map->p[i] = isl_basic_map_finalize(ctx, map->p[i]);
2335 isl_map_free(ctx, map);
2339 struct isl_basic_map *isl_basic_map_identity(struct isl_ctx *ctx,
2340 unsigned nparam, unsigned dim)
2342 struct isl_basic_map *bmap;
2345 bmap = isl_basic_map_alloc(ctx, nparam, dim, dim, 0, dim, 0);
2349 for (i = 0; i < dim; ++i) {
2350 int j = isl_basic_map_alloc_equality(ctx, bmap);
2353 isl_int_set_si(bmap->eq[j][1+nparam+i], 1);
2354 isl_int_set_si(bmap->eq[j][1+nparam+dim+i], -1);
2356 return isl_basic_map_finalize(ctx, bmap);
2358 isl_basic_map_free(ctx, bmap);
2362 struct isl_map *isl_map_identity(struct isl_ctx *ctx,
2363 unsigned nparam, unsigned dim)
2365 struct isl_map *map = isl_map_alloc(ctx, nparam, dim, dim, 1,
2369 map = isl_map_add(ctx, map,
2370 isl_basic_map_identity(ctx, nparam, dim));
2373 isl_map_free(ctx, map);
2377 int isl_set_is_equal(struct isl_ctx *ctx,
2378 struct isl_set *set1, struct isl_set *set2)
2380 return isl_map_is_equal(ctx,
2381 (struct isl_map *)set1, (struct isl_map *)set2);
2384 int isl_set_is_subset(struct isl_ctx *ctx,
2385 struct isl_set *set1, struct isl_set *set2)
2387 return isl_map_is_subset(ctx,
2388 (struct isl_map *)set1, (struct isl_map *)set2);
2391 int isl_basic_map_is_subset(struct isl_ctx *ctx,
2392 struct isl_basic_map *bmap1,
2393 struct isl_basic_map *bmap2)
2396 struct isl_map *map1;
2397 struct isl_map *map2;
2399 if (!bmap1 || !bmap2)
2402 map1 = isl_map_from_basic_map(ctx,
2403 isl_basic_map_copy(ctx, bmap1));
2404 map2 = isl_map_from_basic_map(ctx,
2405 isl_basic_map_copy(ctx, bmap2));
2407 is_subset = isl_map_is_subset(ctx, map1, map2);
2409 isl_map_free(ctx, map1);
2410 isl_map_free(ctx, map2);
2415 int isl_map_is_empty(struct isl_ctx *ctx, struct isl_map *map)
2422 for (i = 0; i < map->n; ++i) {
2423 is_empty = isl_basic_map_is_empty(ctx, map->p[i]);
2432 int isl_set_is_empty(struct isl_ctx *ctx, struct isl_set *set)
2434 return isl_map_is_empty(ctx, (struct isl_map *)set);
2437 int isl_map_is_subset(struct isl_ctx *ctx, struct isl_map *map1,
2438 struct isl_map *map2)
2442 struct isl_map *diff;
2447 if (isl_map_is_empty(ctx, map1))
2450 if (isl_map_is_empty(ctx, map2))
2453 diff = isl_map_subtract(ctx, isl_map_copy(ctx, map1),
2454 isl_map_copy(ctx, map2));
2458 is_subset = isl_map_is_empty(ctx, diff);
2459 isl_map_free(ctx, diff);
2464 int isl_map_is_equal(struct isl_ctx *ctx,
2465 struct isl_map *map1, struct isl_map *map2)
2471 is_subset = isl_map_is_subset(ctx, map1, map2);
2474 is_subset = isl_map_is_subset(ctx, map2, map1);
2478 int isl_basic_map_is_strict_subset(struct isl_ctx *ctx,
2479 struct isl_basic_map *bmap1,
2480 struct isl_basic_map *bmap2)
2484 if (!bmap1 || !bmap2)
2486 is_subset = isl_basic_map_is_subset(ctx, bmap1, bmap2);
2489 is_subset = isl_basic_map_is_subset(ctx, bmap2, bmap1);
2490 if (is_subset == -1)
2495 int isl_basic_map_is_empty(struct isl_ctx *ctx,
2496 struct isl_basic_map *bmap)
2498 struct isl_basic_set *bset = NULL;
2499 struct isl_set *min = NULL;
2505 if (F_ISSET(bmap, ISL_BASIC_MAP_EMPTY))
2508 bset = isl_basic_set_from_basic_map(ctx,
2509 isl_basic_map_copy(ctx, bmap));
2512 min = isl_basic_set_lexmin(ctx, bset);
2515 empty = min->n == 0;
2516 isl_set_free(ctx, min);
2520 struct isl_map *isl_basic_map_union(
2521 struct isl_ctx *ctx, struct isl_basic_map *bmap1,
2522 struct isl_basic_map *bmap2)
2524 struct isl_map *map;
2525 if (!bmap1 || !bmap2)
2528 isl_assert(ctx, bmap1->nparam == bmap2->nparam, goto error);
2529 isl_assert(ctx, bmap1->n_in == bmap2->n_in, goto error);
2530 isl_assert(ctx, bmap1->n_out == bmap2->n_out, goto error);
2532 map = isl_map_alloc(ctx, bmap1->nparam,
2533 bmap1->n_in, bmap1->n_out, 2, 0);
2536 map = isl_map_add(ctx, map, bmap1);
2537 map = isl_map_add(ctx, map, bmap2);
2540 isl_basic_map_free(ctx, bmap1);
2541 isl_basic_map_free(ctx, bmap2);
2545 struct isl_set *isl_basic_set_union(
2546 struct isl_ctx *ctx, struct isl_basic_set *bset1,
2547 struct isl_basic_set *bset2)
2549 return (struct isl_set *)isl_basic_map_union(ctx,
2550 (struct isl_basic_map *)bset1,
2551 (struct isl_basic_map *)bset2);
2554 /* Order divs such that any div only depends on previous divs */
2555 static struct isl_basic_map *order_divs(struct isl_ctx *ctx,
2556 struct isl_basic_map *bmap)
2559 unsigned off = bmap->nparam + bmap->n_in + bmap->n_out;
2561 for (i = 0; i < bmap->n_div; ++i) {
2563 pos = isl_seq_first_non_zero(bmap->div[i]+1+1+off+i,
2567 swap_div(bmap, i, pos);
2573 static int find_div(struct isl_basic_map *dst,
2574 struct isl_basic_map *src, unsigned div)
2578 unsigned total = src->nparam + src->n_in + src->n_out + src->n_div;
2580 for (i = 0; i < dst->n_div; ++i)
2581 if (isl_seq_eq(dst->div[i], src->div[div], 1+1+total) &&
2582 isl_seq_first_non_zero(dst->div[i]+1+1+total,
2583 dst->n_div - src->n_div) == -1)
2588 /* For a div d = floor(f/m), add the constraints
2591 * -(f-(n-1)) + m d >= 0
2593 * Note that the second constraint is the negation of
2597 static int add_div_constraints(struct isl_ctx *ctx,
2598 struct isl_basic_map *bmap, unsigned div)
2601 unsigned div_pos = 1 + bmap->nparam + bmap->n_in + bmap->n_out + div;
2602 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
2604 i = isl_basic_map_alloc_inequality(ctx, bmap);
2607 isl_seq_cpy(bmap->ineq[i], bmap->div[div]+1, 1+total);
2608 isl_int_neg(bmap->ineq[i][div_pos], bmap->div[div][0]);
2610 j = isl_basic_map_alloc_inequality(ctx, bmap);
2613 isl_seq_neg(bmap->ineq[j], bmap->ineq[i], 1 + total);
2614 isl_int_add(bmap->ineq[j][0], bmap->ineq[j][0], bmap->ineq[j][div_pos]);
2615 isl_int_sub_ui(bmap->ineq[j][0], bmap->ineq[j][0], 1);
2619 struct isl_basic_map *isl_basic_map_align_divs(struct isl_ctx *ctx,
2620 struct isl_basic_map *dst, struct isl_basic_map *src)
2623 unsigned total = src->nparam + src->n_in + src->n_out + src->n_div;
2625 if (src->n_div == 0)
2628 src = order_divs(ctx, src);
2629 dst = isl_basic_map_extend(ctx, dst, dst->nparam, dst->n_in,
2630 dst->n_out, src->n_div, 0, 2 * src->n_div);
2633 for (i = 0; i < src->n_div; ++i) {
2634 int j = find_div(dst, src, i);
2636 j = isl_basic_map_alloc_div(ctx, dst);
2639 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total);
2640 if (add_div_constraints(ctx, dst, j) < 0)
2644 swap_div(dst, i, j);
2648 isl_basic_map_free(ctx, dst);
2652 static struct isl_map *add_cut_constraint(struct isl_ctx *ctx,
2653 struct isl_map *dst,
2654 struct isl_basic_map *src, isl_int *c,
2655 unsigned len, unsigned extra, int oppose)
2657 struct isl_basic_map *copy = NULL;
2661 copy = isl_basic_map_copy(ctx, src);
2662 copy = isl_basic_map_cow(ctx, copy);
2665 copy = isl_basic_map_extend(ctx, copy,
2666 copy->nparam, copy->n_in, copy->n_out, 0, 0, 1);
2667 k = isl_basic_map_alloc_inequality(ctx, copy);
2671 isl_seq_neg(copy->ineq[k], c, len);
2673 isl_seq_cpy(copy->ineq[k], c, len);
2674 isl_seq_clr(copy->ineq[k]+len, extra);
2675 isl_inequality_negate(ctx, copy, k);
2676 copy = isl_basic_map_simplify(ctx, copy);
2677 copy = isl_basic_map_finalize(ctx, copy);
2678 is_empty = isl_basic_map_is_empty(ctx, copy);
2682 dst = isl_map_add(ctx, dst, copy);
2684 isl_basic_map_free(ctx, copy);
2687 isl_basic_map_free(ctx, copy);
2688 isl_map_free(ctx, dst);
2692 static struct isl_map *subtract(struct isl_ctx *ctx, struct isl_map *map,
2693 struct isl_basic_map *bmap)
2697 struct isl_map *rest = NULL;
2699 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
2706 if (F_ISSET(map, ISL_MAP_DISJOINT))
2707 FL_SET(flags, ISL_MAP_DISJOINT);
2709 max = map->n * (2 * bmap->n_eq + bmap->n_ineq);
2710 rest = isl_map_alloc(ctx, map->nparam, map->n_in, map->n_out,
2715 for (i = 0; i < map->n; ++i) {
2716 map->p[i] = isl_basic_map_align_divs(ctx, map->p[i], bmap);
2721 for (j = 0; j < map->n; ++j)
2722 map->p[j] = isl_basic_map_cow(ctx, map->p[j]);
2724 for (i = 0; i < bmap->n_eq; ++i) {
2725 for (j = 0; j < map->n; ++j) {
2726 rest = add_cut_constraint(ctx, rest,
2727 map->p[j], bmap->eq[i],
2728 1+total, map->p[j]->n_div - bmap->n_div, 0);
2732 rest = add_cut_constraint(ctx, rest,
2733 map->p[j], bmap->eq[i],
2734 1+total, map->p[j]->n_div - bmap->n_div, 1);
2738 map->p[j] = isl_basic_map_extend(ctx, map->p[j],
2739 map->p[j]->nparam, map->p[j]->n_in,
2740 map->p[j]->n_out, 0, 1, 0);
2743 k = isl_basic_map_alloc_equality(ctx, map->p[j]);
2746 isl_seq_cpy(map->p[j]->eq[k], bmap->eq[i], 1+total);
2747 isl_seq_clr(map->p[j]->eq[k]+1+total,
2748 map->p[j]->n_div - bmap->n_div);
2752 for (i = 0; i < bmap->n_ineq; ++i) {
2753 for (j = 0; j < map->n; ++j) {
2754 rest = add_cut_constraint(ctx, rest,
2755 map->p[j], bmap->ineq[i],
2756 1+total, map->p[j]->n_div - bmap->n_div, 0);
2760 map->p[j] = isl_basic_map_extend(ctx, map->p[j],
2761 map->p[j]->nparam, map->p[j]->n_in,
2762 map->p[j]->n_out, 0, 0, 1);
2765 k = isl_basic_map_alloc_inequality(ctx, map->p[j]);
2768 isl_seq_cpy(map->p[j]->ineq[k], bmap->ineq[i], 1+total);
2769 isl_seq_clr(map->p[j]->ineq[k]+1+total,
2770 map->p[j]->n_div - bmap->n_div);
2774 isl_map_free(ctx, map);
2777 isl_map_free(ctx, map);
2778 isl_map_free(ctx, rest);
2782 struct isl_map *isl_map_subtract(struct isl_ctx *ctx, struct isl_map *map1,
2783 struct isl_map *map2)
2789 isl_assert(ctx, map1->nparam == map2->nparam, goto error);
2790 isl_assert(ctx, map1->n_in == map2->n_in, goto error);
2791 isl_assert(ctx, map1->n_out == map2->n_out, goto error);
2793 if (isl_map_is_empty(ctx, map2)) {
2794 isl_map_free(ctx, map2);
2798 map1 = isl_map_compute_divs(ctx, map1);
2799 map2 = isl_map_compute_divs(ctx, map2);
2803 for (i = 0; map1 && i < map2->n; ++i)
2804 map1 = subtract(ctx, map1, map2->p[i]);
2806 isl_map_free(ctx, map2);
2809 isl_map_free(ctx, map1);
2810 isl_map_free(ctx, map2);
2814 struct isl_set *isl_set_subtract(struct isl_ctx *ctx, struct isl_set *set1,
2815 struct isl_set *set2)
2817 return (struct isl_set *)
2818 isl_map_subtract(ctx,
2819 (struct isl_map *)set1, (struct isl_map *)set2);
2822 struct isl_set *isl_set_apply(struct isl_ctx *ctx, struct isl_set *set,
2823 struct isl_map *map)
2825 isl_assert(ctx, set->dim == map->n_in, goto error);
2826 map = isl_map_intersect_domain(ctx, map, set);
2827 set = isl_map_range(ctx, map);
2830 isl_set_free(ctx, set);
2831 isl_map_free(ctx, map);