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 constraint_drop_vars(bmap->ineq[i]+pos, 1, bmap->extra-div-1);
596 for (i = 0; i < bmap->n_div; ++i)
597 constraint_drop_vars(bmap->div[i]+1+pos, 1, bmap->extra-div-1);
599 if (div != bmap->n_div - 1) {
601 isl_int *t = bmap->div[div];
603 for (j = div; j < bmap->n_div - 1; ++j)
604 bmap->div[j] = bmap->div[j+1];
606 bmap->div[bmap->n_div - 1] = t;
608 isl_basic_map_free_div(ctx, bmap, 1);
612 isl_basic_map_free(ctx, bmap);
616 static void eliminate_div(struct isl_ctx *ctx, struct isl_basic_map *bmap,
617 isl_int *eq, unsigned div)
620 unsigned pos = 1 + bmap->nparam + bmap->n_in + bmap->n_out + div;
622 len = 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
624 for (i = 0; i < bmap->n_eq; ++i)
625 if (bmap->eq[i] != eq)
626 isl_seq_elim(bmap->eq[i], eq, pos, len, NULL);
628 for (i = 0; i < bmap->n_ineq; ++i)
629 isl_seq_elim(bmap->ineq[i], eq, pos, len, NULL);
631 /* We need to be careful about circular definitions,
632 * so for now we just remove the definitions of other divs that
633 * depend on this div and (possibly) recompute them later.
635 for (i = 0; i < bmap->n_div; ++i)
636 if (!isl_int_is_zero(bmap->div[i][0]) &&
637 !isl_int_is_zero(bmap->div[i][1 + pos]))
638 isl_seq_clr(bmap->div[i], 1 + len);
640 isl_basic_map_drop_div(ctx, bmap, div);
643 struct isl_basic_map *isl_basic_map_set_to_empty(
644 struct isl_ctx *ctx, struct isl_basic_map *bmap)
650 total = bmap->nparam + bmap->n_in + bmap->n_out;
651 isl_assert(ctx, bmap->n_ineq + bmap->n_eq > 0, goto error);
652 isl_basic_map_free_div(ctx, bmap, bmap->n_div);
653 isl_basic_map_free_inequality(ctx, bmap, bmap->n_ineq);
655 isl_basic_map_free_equality(ctx, bmap, bmap->n_eq-1);
657 isl_basic_map_alloc_equality(ctx, bmap);
661 isl_int_set_si(bmap->eq[i][0], 1);
662 isl_seq_clr(bmap->eq[i]+1, total);
663 F_SET(bmap, ISL_BASIC_MAP_EMPTY);
664 return isl_basic_map_finalize(ctx, bmap);
666 isl_basic_map_free(ctx, bmap);
670 static void swap_equality(struct isl_basic_map *bmap, int a, int b)
672 isl_int *t = bmap->eq[a];
673 bmap->eq[a] = bmap->eq[b];
677 static void swap_inequality(struct isl_basic_map *bmap, int a, int b)
679 isl_int *t = bmap->ineq[a];
680 bmap->ineq[a] = bmap->ineq[b];
684 static void swap_div(struct isl_basic_map *bmap, int a, int b)
687 unsigned off = bmap->nparam + bmap->n_in + bmap->n_out;
688 isl_int *t = bmap->div[a];
689 bmap->div[a] = bmap->div[b];
692 for (i = 0; i < bmap->n_eq; ++i)
693 isl_int_swap(bmap->eq[i][1+off+a], bmap->eq[i][1+off+b]);
695 for (i = 0; i < bmap->n_ineq; ++i)
696 isl_int_swap(bmap->ineq[i][1+off+a], bmap->ineq[i][1+off+b]);
698 for (i = 0; i < bmap->n_div; ++i)
699 isl_int_swap(bmap->div[i][1+1+off+a], bmap->div[i][1+1+off+b]);
702 struct isl_basic_map *isl_basic_map_gauss(struct isl_ctx *ctx,
703 struct isl_basic_map *bmap, int *progress)
714 total_var = bmap->nparam + bmap->n_in + bmap->n_out;
715 total = total_var + bmap->n_div;
717 last_var = total - 1;
718 for (done = 0; done < bmap->n_eq; ++done) {
719 for (; last_var >= 0; --last_var) {
720 for (k = done; k < bmap->n_eq; ++k)
721 if (!isl_int_is_zero(bmap->eq[k][1+last_var]))
729 swap_equality(bmap, k, done);
730 if (isl_int_is_neg(bmap->eq[done][1+last_var]))
731 isl_seq_neg(bmap->eq[done], bmap->eq[done], 1+total);
733 for (k = 0; k < bmap->n_eq; ++k) {
736 if (isl_int_is_zero(bmap->eq[k][1+last_var]))
740 isl_seq_elim(bmap->eq[k], bmap->eq[done],
741 1+last_var, 1+total, NULL);
744 for (k = 0; k < bmap->n_ineq; ++k) {
745 if (isl_int_is_zero(bmap->ineq[k][1+last_var]))
749 isl_seq_elim(bmap->ineq[k], bmap->eq[done],
750 1+last_var, 1+total, NULL);
753 for (k = 0; k < bmap->n_div; ++k) {
754 if (isl_int_is_zero(bmap->div[k][0]))
756 if (isl_int_is_zero(bmap->div[k][1+1+last_var]))
760 isl_seq_elim(bmap->div[k]+1, bmap->eq[done],
761 1+last_var, 1+total, &bmap->div[k][0]);
764 if (last_var >= total_var &&
765 isl_int_is_zero(bmap->div[last_var - total_var][0])) {
766 unsigned div = last_var - total_var;
767 isl_seq_neg(bmap->div[div]+1, bmap->eq[done], 1+total);
768 isl_int_set_si(bmap->div[div][1+1+last_var], 0);
769 isl_int_set(bmap->div[div][0],
770 bmap->eq[done][1+last_var]);
773 if (done == bmap->n_eq)
775 for (k = done; k < bmap->n_eq; ++k) {
776 if (isl_int_is_zero(bmap->eq[k][0]))
778 return isl_basic_map_set_to_empty(ctx, bmap);
780 isl_basic_map_free_equality(ctx, bmap, bmap->n_eq-done);
784 static unsigned int round_up(unsigned int v)
795 static struct isl_basic_map *remove_duplicate_constraints(
797 struct isl_basic_map *bmap, int *progress)
803 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
805 if (bmap->n_ineq <= 1)
808 size = round_up(4 * bmap->n_ineq / 3 - 1);
809 bits = ffs(size) - 1;
810 index = isl_alloc_array(ctx, int, size);
811 memset(index, 0, size * sizeof(int));
815 index[isl_seq_hash(bmap->ineq[0]+1, total, bits)] = 1;
816 for (k = 1; k < bmap->n_ineq; ++k) {
817 u_int32_t hash = isl_seq_hash(bmap->ineq[k]+1, total, bits);
818 for (h = hash; index[h]; h = (h+1) % size)
819 if (isl_seq_eq(bmap->ineq[k]+1,
820 bmap->ineq[index[h]-1]+1, total))
828 if (isl_int_lt(bmap->ineq[k][0], bmap->ineq[l][0]))
829 swap_inequality(bmap, k, l);
830 isl_basic_map_drop_inequality(ctx, bmap, k);
838 static struct isl_basic_map *remove_duplicate_divs(struct isl_ctx *ctx,
839 struct isl_basic_map *bmap, int *progress)
846 unsigned total_var = bmap->nparam + bmap->n_in + bmap->n_out;
847 unsigned total = total_var + bmap->n_div;
849 if (bmap->n_div <= 1)
852 for (k = bmap->n_div - 1; k >= 0; --k)
853 if (!isl_int_is_zero(bmap->div[k][0]))
858 size = round_up(4 * bmap->n_div / 3 - 1);
859 bits = ffs(size) - 1;
860 index = isl_alloc_array(ctx, int, size);
861 memset(index, 0, size * sizeof(int));
864 eq = isl_blk_alloc(ctx, 1+total);
868 isl_seq_clr(eq.data, 1+total);
869 index[isl_seq_hash(bmap->div[k], 2+total, bits)] = k + 1;
870 for (--k; k >= 0; --k) {
873 if (isl_int_is_zero(bmap->div[k][0]))
876 hash = isl_seq_hash(bmap->div[k], 2+total, bits);
877 for (h = hash; index[h]; h = (h+1) % size)
878 if (isl_seq_eq(bmap->div[k],
879 bmap->div[index[h]-1], 2+total))
884 isl_int_set_si(eq.data[1+total_var+k], -1);
885 isl_int_set_si(eq.data[1+total_var+l], 1);
886 eliminate_div(ctx, bmap, eq.data, l);
887 isl_int_set_si(eq.data[1+total_var+k], 0);
888 isl_int_set_si(eq.data[1+total_var+l], 0);
893 isl_blk_free(ctx, eq);
899 static struct isl_basic_map *eliminate_divs(
900 struct isl_ctx *ctx, struct isl_basic_map *bmap,
911 off = 1 + bmap->nparam + bmap->n_in + bmap->n_out;
913 for (d = bmap->n_div - 1; d >= 0 ; --d) {
914 for (i = 0; i < bmap->n_eq; ++i) {
915 if (!isl_int_is_one(bmap->eq[i][off + d]) &&
916 !isl_int_is_negone(bmap->eq[i][off + d]))
920 eliminate_div(ctx, bmap, bmap->eq[i], d);
921 isl_basic_map_drop_equality(ctx, bmap, i);
925 return eliminate_divs(ctx, bmap, progress);
929 static struct isl_basic_map *normalize_constraints(
930 struct isl_ctx *ctx, struct isl_basic_map *bmap)
934 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
937 for (i = bmap->n_eq - 1; i >= 0; --i) {
938 isl_seq_gcd(bmap->eq[i]+1, total, &gcd);
939 if (isl_int_is_zero(gcd)) {
940 if (!isl_int_is_zero(bmap->eq[i][0])) {
941 bmap = isl_basic_map_set_to_empty(ctx, bmap);
944 isl_basic_map_drop_equality(ctx, bmap, i);
947 if (isl_int_is_one(gcd))
949 if (!isl_int_is_divisible_by(bmap->eq[i][0], gcd)) {
950 bmap = isl_basic_map_set_to_empty(ctx, bmap);
953 isl_seq_scale_down(bmap->eq[i], bmap->eq[i], gcd, 1+total);
956 for (i = bmap->n_ineq - 1; i >= 0; --i) {
957 isl_seq_gcd(bmap->ineq[i]+1, total, &gcd);
958 if (isl_int_is_zero(gcd)) {
959 if (isl_int_is_neg(bmap->ineq[i][0])) {
960 bmap = isl_basic_map_set_to_empty(ctx, bmap);
963 isl_basic_map_drop_inequality(ctx, bmap, i);
966 if (isl_int_is_one(gcd))
968 isl_int_fdiv_q(bmap->ineq[i][0], bmap->ineq[i][0], gcd);
969 isl_seq_scale_down(bmap->ineq[i]+1, bmap->ineq[i]+1, gcd, total);
976 struct isl_basic_map *isl_basic_map_simplify(
977 struct isl_ctx *ctx, struct isl_basic_map *bmap)
984 bmap = normalize_constraints(ctx, bmap);
985 bmap = eliminate_divs(ctx, bmap, &progress);
986 bmap = isl_basic_map_gauss(ctx, bmap, &progress);
987 bmap = remove_duplicate_divs(ctx, bmap, &progress);
988 bmap = remove_duplicate_constraints(ctx, bmap, &progress);
993 struct isl_basic_set *isl_basic_set_simplify(
994 struct isl_ctx *ctx, struct isl_basic_set *bset)
996 return (struct isl_basic_set *)
997 isl_basic_map_simplify(ctx,
998 (struct isl_basic_map *)bset);
1001 static void dump_term(struct isl_basic_map *bmap,
1002 isl_int c, int pos, FILE *out)
1004 unsigned in = bmap->n_in;
1005 unsigned dim = bmap->n_in + bmap->n_out;
1007 isl_int_print(out, c);
1009 if (!isl_int_is_one(c))
1010 isl_int_print(out, c);
1011 if (pos < 1 + bmap->nparam)
1012 fprintf(out, "p%d", pos - 1);
1013 else if (pos < 1 + bmap->nparam + in)
1014 fprintf(out, "i%d", pos - 1 - bmap->nparam);
1015 else if (pos < 1 + bmap->nparam + dim)
1016 fprintf(out, "o%d", pos - 1 - bmap->nparam - in);
1018 fprintf(out, "e%d", pos - 1 - bmap->nparam - dim);
1022 static void dump_constraint_sign(struct isl_basic_map *bmap, isl_int *c,
1023 int sign, FILE *out)
1027 unsigned len = 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
1031 for (i = 0, first = 1; i < len; ++i) {
1032 if (isl_int_sgn(c[i]) * sign <= 0)
1035 fprintf(out, " + ");
1037 isl_int_abs(v, c[i]);
1038 dump_term(bmap, v, i, out);
1045 static void dump_constraint(struct isl_basic_map *bmap, isl_int *c,
1046 const char *op, FILE *out, int indent)
1048 fprintf(out, "%*s", indent, "");
1050 dump_constraint_sign(bmap, c, 1, out);
1051 fprintf(out, " %s ", op);
1052 dump_constraint_sign(bmap, c, -1, out);
1057 static void dump_constraints(struct isl_basic_map *bmap,
1058 isl_int **c, unsigned n,
1059 const char *op, FILE *out, int indent)
1063 for (i = 0; i < n; ++i)
1064 dump_constraint(bmap, c[i], op, out, indent);
1067 static void dump_affine(struct isl_basic_map *bmap, isl_int *exp, FILE *out)
1071 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
1073 for (j = 0; j < 1 + total; ++j) {
1074 if (isl_int_is_zero(exp[j]))
1076 if (!first && isl_int_is_pos(exp[j]))
1078 dump_term(bmap, exp[j], j, out);
1083 static void dump(struct isl_basic_map *bmap, FILE *out, int indent)
1087 dump_constraints(bmap, bmap->eq, bmap->n_eq, "=", out, indent);
1088 dump_constraints(bmap, bmap->ineq, bmap->n_ineq, ">=", out, indent);
1090 for (i = 0; i < bmap->n_div; ++i) {
1091 fprintf(out, "%*s", indent, "");
1092 fprintf(out, "e%d = [(", i);
1093 dump_affine(bmap, bmap->div[i]+1, out);
1095 isl_int_print(out, bmap->div[i][0]);
1096 fprintf(out, "]\n");
1100 void isl_basic_set_dump(struct isl_ctx *ctx, struct isl_basic_set *bset,
1101 FILE *out, int indent)
1103 fprintf(out, "%*s", indent, "");
1104 fprintf(out, "nparam: %d, dim: %d, extra: %d\n",
1105 bset->nparam, bset->dim, bset->extra);
1106 dump((struct isl_basic_map *)bset, out, indent);
1109 void isl_basic_map_dump(struct isl_ctx *ctx, struct isl_basic_map *bmap,
1110 FILE *out, int indent)
1112 fprintf(out, "%*s", indent, "");
1113 fprintf(out, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d\n",
1115 bmap->nparam, bmap->n_in, bmap->n_out, bmap->extra);
1116 dump(bmap, out, indent);
1119 int isl_inequality_negate(struct isl_ctx *ctx,
1120 struct isl_basic_map *bmap, unsigned pos)
1122 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
1123 isl_assert(ctx, pos < bmap->n_ineq, return -1);
1124 isl_seq_neg(bmap->ineq[pos], bmap->ineq[pos], 1 + total);
1125 isl_int_sub_ui(bmap->ineq[pos][0], bmap->ineq[pos][0], 1);
1129 struct isl_set *isl_set_alloc(struct isl_ctx *ctx,
1130 unsigned nparam, unsigned dim, int n, unsigned flags)
1132 struct isl_set *set;
1134 set = isl_alloc(ctx, struct isl_set,
1135 sizeof(struct isl_set) +
1136 n * sizeof(struct isl_basic_set *));
1143 set->nparam = nparam;
1150 struct isl_set *isl_set_dup(struct isl_ctx *ctx, struct isl_set *set)
1153 struct isl_set *dup;
1155 dup = isl_set_alloc(ctx, set->nparam, set->dim, set->n, set->flags);
1158 for (i = 0; i < set->n; ++i)
1159 dup = isl_set_add(ctx, dup,
1160 isl_basic_set_dup(ctx, set->p[i]));
1164 struct isl_set *isl_set_from_basic_set(struct isl_ctx *ctx,
1165 struct isl_basic_set *bset)
1167 struct isl_set *set;
1169 set = isl_set_alloc(ctx, bset->nparam, bset->dim, 1, ISL_MAP_DISJOINT);
1171 isl_basic_set_free(ctx, bset);
1174 return isl_set_add(ctx, set, bset);
1177 struct isl_map *isl_map_from_basic_map(struct isl_ctx *ctx,
1178 struct isl_basic_map *bmap)
1180 struct isl_map *map;
1182 map = isl_map_alloc(ctx, bmap->nparam, bmap->n_in, bmap->n_out, 1,
1185 isl_basic_map_free(ctx, bmap);
1188 return isl_map_add(ctx, map, bmap);
1191 struct isl_set *isl_set_add(struct isl_ctx *ctx, struct isl_set *set,
1192 struct isl_basic_set *bset)
1196 isl_assert(ctx, set->nparam == bset->nparam, goto error);
1197 isl_assert(ctx, set->dim == bset->dim, goto error);
1198 isl_assert(ctx, set->n < set->size, goto error);
1199 set->p[set->n] = bset;
1204 isl_set_free(ctx, set);
1206 isl_basic_set_free(ctx, bset);
1210 void isl_set_free(struct isl_ctx *ctx, struct isl_set *set)
1220 for (i = 0; i < set->n; ++i)
1221 isl_basic_set_free(ctx, set->p[i]);
1225 void isl_set_dump(struct isl_ctx *ctx, struct isl_set *set, FILE *out,
1231 fprintf(out, "null set\n");
1235 fprintf(out, "%*s", indent, "");
1236 fprintf(out, "ref: %d, n: %d\n", set->ref, set->n);
1237 for (i = 0; i < set->n; ++i) {
1238 fprintf(out, "%*s", indent, "");
1239 fprintf(out, "basic set %d:\n", i);
1240 isl_basic_set_dump(ctx, set->p[i], out, indent+4);
1244 void isl_map_dump(struct isl_ctx *ctx, struct isl_map *map, FILE *out,
1249 fprintf(out, "%*s", indent, "");
1250 fprintf(out, "ref: %d, n: %d, nparam: %d, in: %d, out: %d\n",
1251 map->ref, map->n, map->nparam, map->n_in, map->n_out);
1252 for (i = 0; i < map->n; ++i) {
1253 fprintf(out, "%*s", indent, "");
1254 fprintf(out, "basic map %d:\n", i);
1255 isl_basic_map_dump(ctx, map->p[i], out, indent+4);
1259 struct isl_basic_map *isl_basic_map_intersect_domain(
1260 struct isl_ctx *ctx, struct isl_basic_map *bmap,
1261 struct isl_basic_set *bset)
1263 struct isl_basic_map *bmap_domain;
1268 isl_assert(ctx, bset->dim == bmap->n_in, goto error);
1269 isl_assert(ctx, bset->nparam == bmap->nparam, goto error);
1271 bmap = isl_basic_map_extend(ctx, bmap,
1272 bset->nparam, bmap->n_in, bmap->n_out,
1273 bset->n_div, bset->n_eq, bset->n_ineq);
1276 bmap_domain = isl_basic_map_from_basic_set(ctx, bset,
1278 bmap = add_constraints(ctx, bmap, bmap_domain, 0, 0);
1280 return isl_basic_map_finalize(ctx, bmap);
1282 isl_basic_map_free(ctx, bmap);
1283 isl_basic_set_free(ctx, bset);
1287 struct isl_basic_map *isl_basic_map_intersect_range(
1288 struct isl_ctx *ctx, struct isl_basic_map *bmap,
1289 struct isl_basic_set *bset)
1291 struct isl_basic_map *bmap_range;
1296 isl_assert(ctx, bset->dim == bmap->n_out, goto error);
1297 isl_assert(ctx, bset->nparam == bmap->nparam, goto error);
1299 bmap = isl_basic_map_extend(ctx, bmap,
1300 bset->nparam, bmap->n_in, bmap->n_out,
1301 bset->n_div, bset->n_eq, bset->n_ineq);
1304 bmap_range = isl_basic_map_from_basic_set(ctx, bset,
1306 bmap = add_constraints(ctx, bmap, bmap_range, 0, 0);
1308 return isl_basic_map_finalize(ctx, bmap);
1310 isl_basic_map_free(ctx, bmap);
1311 isl_basic_set_free(ctx, bset);
1315 struct isl_basic_map *isl_basic_map_intersect(
1316 struct isl_ctx *ctx, struct isl_basic_map *bmap1,
1317 struct isl_basic_map *bmap2)
1319 isl_assert(ctx, bmap1->nparam == bmap2->nparam, goto error);
1320 isl_assert(ctx, bmap1->n_in == bmap2->n_in, goto error);
1321 isl_assert(ctx, bmap1->n_out == bmap2->n_out, goto error);
1323 bmap1 = isl_basic_map_extend(ctx, bmap1,
1324 bmap1->nparam, bmap1->n_in, bmap1->n_out,
1325 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
1328 bmap1 = add_constraints(ctx, bmap1, bmap2, 0, 0);
1330 return isl_basic_map_finalize(ctx, bmap1);
1332 isl_basic_map_free(ctx, bmap1);
1333 isl_basic_map_free(ctx, bmap2);
1337 struct isl_basic_set *isl_basic_set_intersect(
1338 struct isl_ctx *ctx, struct isl_basic_set *bset1,
1339 struct isl_basic_set *bset2)
1341 return (struct isl_basic_set *)
1342 isl_basic_map_intersect(ctx,
1343 (struct isl_basic_map *)bset1,
1344 (struct isl_basic_map *)bset2);
1347 struct isl_map *isl_map_intersect(struct isl_ctx *ctx, struct isl_map *map1,
1348 struct isl_map *map2)
1351 struct isl_map *result;
1357 if (F_ISSET(map1, ISL_MAP_DISJOINT) &&
1358 F_ISSET(map2, ISL_MAP_DISJOINT))
1359 FL_SET(flags, ISL_MAP_DISJOINT);
1361 result = isl_map_alloc(ctx, map1->nparam, map1->n_in, map1->n_out,
1362 map1->n * map2->n, flags);
1365 for (i = 0; i < map1->n; ++i)
1366 for (j = 0; j < map2->n; ++j) {
1367 struct isl_basic_map *part;
1368 part = isl_basic_map_intersect(ctx,
1369 isl_basic_map_copy(ctx, map1->p[i]),
1370 isl_basic_map_copy(ctx, map2->p[j]));
1371 if (isl_basic_map_is_empty(ctx, part))
1372 isl_basic_map_free(ctx, part);
1374 result = isl_map_add(ctx, result, part);
1378 isl_map_free(ctx, map1);
1379 isl_map_free(ctx, map2);
1382 isl_map_free(ctx, map1);
1383 isl_map_free(ctx, map2);
1387 struct isl_basic_map *isl_basic_map_reverse(struct isl_ctx *ctx,
1388 struct isl_basic_map *bmap)
1390 struct isl_basic_set *bset;
1395 bmap = isl_basic_map_cow(ctx, bmap);
1399 bset = isl_basic_set_from_basic_map(ctx, bmap);
1400 bset = isl_basic_set_swap_vars(ctx, bset, in);
1401 return isl_basic_map_from_basic_set(ctx, bset, bset->dim-in, in);
1404 /* Turn final n dimensions into existentially quantified variables.
1406 struct isl_basic_set *isl_basic_set_project_out(
1407 struct isl_ctx *ctx, struct isl_basic_set *bset,
1408 unsigned n, unsigned flags)
1418 isl_assert(ctx, n <= bset->dim, goto error);
1423 bset = isl_basic_set_cow(ctx, bset);
1425 row_size = 1 + bset->nparam + bset->dim + bset->extra;
1426 old = bset->block2.data;
1427 bset->block2 = isl_blk_extend(ctx, bset->block2,
1428 (bset->extra + n) * (1 + row_size));
1429 if (!bset->block2.data)
1431 new_div = isl_alloc_array(ctx, isl_int *, bset->extra + n);
1434 for (i = 0; i < n; ++i) {
1435 new_div[i] = bset->block2.data +
1436 (bset->extra + i) * (1 + row_size);
1437 isl_seq_clr(new_div[i], 1 + row_size);
1439 for (i = 0; i < bset->extra; ++i)
1440 new_div[n + i] = bset->block2.data + (bset->div[i] - old);
1442 bset->div = new_div;
1446 bset = isl_basic_set_simplify(ctx, bset);
1447 return isl_basic_set_finalize(ctx, bset);
1449 isl_basic_set_free(ctx, bset);
1453 struct isl_basic_map *isl_basic_map_apply_range(
1454 struct isl_ctx *ctx, struct isl_basic_map *bmap1,
1455 struct isl_basic_map *bmap2)
1457 struct isl_basic_set *bset;
1458 unsigned n_in, n_out;
1460 if (!bmap1 || !bmap2)
1463 isl_assert(ctx, bmap1->n_out == bmap2->n_in, goto error);
1464 isl_assert(ctx, bmap1->nparam == bmap2->nparam, goto error);
1467 n_out = bmap2->n_out;
1469 bmap2 = isl_basic_map_reverse(ctx, bmap2);
1472 bmap1 = isl_basic_map_extend(ctx, bmap1, bmap1->nparam,
1473 bmap1->n_in + bmap2->n_in, bmap1->n_out,
1474 bmap2->extra, bmap2->n_eq, bmap2->n_ineq);
1477 bmap1 = add_constraints(ctx, bmap1, bmap2, bmap1->n_in - bmap2->n_in, 0);
1478 bset = isl_basic_set_from_basic_map(ctx, bmap1);
1479 bset = isl_basic_set_project_out(ctx, bset,
1480 bset->dim - (n_in + n_out), 0);
1481 return isl_basic_map_from_basic_set(ctx, bset, n_in, n_out);
1483 isl_basic_map_free(ctx, bmap1);
1484 isl_basic_map_free(ctx, bmap2);
1488 struct isl_basic_map *isl_basic_map_apply_domain(
1489 struct isl_ctx *ctx, struct isl_basic_map *bmap1,
1490 struct isl_basic_map *bmap2)
1492 if (!bmap1 || !bmap2)
1495 isl_assert(ctx, bmap1->n_in == bmap2->n_in, goto error);
1496 isl_assert(ctx, bmap1->nparam == bmap2->nparam, goto error);
1498 bmap1 = isl_basic_map_reverse(ctx, bmap1);
1499 bmap1 = isl_basic_map_apply_range(ctx, bmap1, bmap2);
1500 return isl_basic_map_reverse(ctx, bmap1);
1502 isl_basic_map_free(ctx, bmap1);
1503 isl_basic_map_free(ctx, bmap2);
1507 static struct isl_basic_map *var_equal(struct isl_ctx *ctx,
1508 struct isl_basic_map *bmap, unsigned pos)
1511 i = isl_basic_map_alloc_equality(ctx, bmap);
1514 isl_seq_clr(bmap->eq[i],
1515 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->extra);
1516 isl_int_set_si(bmap->eq[i][1+bmap->nparam+pos], -1);
1517 isl_int_set_si(bmap->eq[i][1+bmap->nparam+bmap->n_in+pos], 1);
1518 return isl_basic_map_finalize(ctx, bmap);
1520 isl_basic_map_free(ctx, bmap);
1524 static struct isl_basic_map *var_more(struct isl_ctx *ctx,
1525 struct isl_basic_map *bmap, unsigned pos)
1528 i = isl_basic_map_alloc_inequality(ctx, bmap);
1531 isl_seq_clr(bmap->ineq[i],
1532 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->extra);
1533 isl_int_set_si(bmap->ineq[i][0], -1);
1534 isl_int_set_si(bmap->ineq[i][1+bmap->nparam+pos], -1);
1535 isl_int_set_si(bmap->ineq[i][1+bmap->nparam+bmap->n_in+pos], 1);
1536 return isl_basic_map_finalize(ctx, bmap);
1538 isl_basic_map_free(ctx, bmap);
1542 static struct isl_basic_map *var_less(struct isl_ctx *ctx,
1543 struct isl_basic_map *bmap, unsigned pos)
1546 i = isl_basic_map_alloc_inequality(ctx, bmap);
1549 isl_seq_clr(bmap->ineq[i],
1550 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->extra);
1551 isl_int_set_si(bmap->ineq[i][0], -1);
1552 isl_int_set_si(bmap->ineq[i][1+bmap->nparam+pos], 1);
1553 isl_int_set_si(bmap->ineq[i][1+bmap->nparam+bmap->n_in+pos], -1);
1554 return isl_basic_map_finalize(ctx, bmap);
1556 isl_basic_map_free(ctx, bmap);
1560 struct isl_basic_map *isl_basic_map_equal(struct isl_ctx *ctx,
1561 unsigned nparam, unsigned in, unsigned out, unsigned n_equal)
1564 struct isl_basic_map *bmap;
1565 bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, n_equal, 0);
1568 for (i = 0; i < n_equal && bmap; ++i)
1569 bmap = var_equal(ctx, bmap, i);
1570 return isl_basic_map_finalize(ctx, bmap);
1573 struct isl_basic_map *isl_basic_map_less_at(struct isl_ctx *ctx,
1574 unsigned nparam, unsigned in, unsigned out, unsigned pos)
1577 struct isl_basic_map *bmap;
1578 bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, pos, 1);
1581 for (i = 0; i < pos && bmap; ++i)
1582 bmap = var_equal(ctx, bmap, i);
1584 bmap = var_less(ctx, bmap, pos);
1585 return isl_basic_map_finalize(ctx, bmap);
1588 struct isl_basic_map *isl_basic_map_more_at(struct isl_ctx *ctx,
1589 unsigned nparam, unsigned in, unsigned out, unsigned pos)
1592 struct isl_basic_map *bmap;
1593 bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, pos, 1);
1596 for (i = 0; i < pos && bmap; ++i)
1597 bmap = var_equal(ctx, bmap, i);
1599 bmap = var_more(ctx, bmap, pos);
1600 return isl_basic_map_finalize(ctx, bmap);
1603 struct isl_basic_map *isl_basic_map_from_basic_set(
1604 struct isl_ctx *ctx, struct isl_basic_set *bset,
1605 unsigned n_in, unsigned n_out)
1607 struct isl_basic_map *bmap;
1609 bset = isl_basic_set_cow(ctx, bset);
1613 isl_assert(ctx, bset->dim == n_in + n_out, goto error);
1614 bmap = (struct isl_basic_map *) bset;
1616 bmap->n_out = n_out;
1617 return isl_basic_map_finalize(ctx, bmap);
1619 isl_basic_set_free(ctx, bset);
1623 struct isl_basic_set *isl_basic_set_from_basic_map(
1624 struct isl_ctx *ctx, struct isl_basic_map *bmap)
1628 if (bmap->n_in == 0)
1629 return (struct isl_basic_set *)bmap;
1630 bmap = isl_basic_map_cow(ctx, bmap);
1633 bmap->n_out += bmap->n_in;
1635 bmap = isl_basic_map_finalize(ctx, bmap);
1636 return (struct isl_basic_set *)bmap;
1641 struct isl_basic_set *isl_basic_map_domain(struct isl_ctx *ctx,
1642 struct isl_basic_map *bmap)
1644 struct isl_basic_set *domain;
1648 n_out = bmap->n_out;
1649 domain = isl_basic_set_from_basic_map(ctx, bmap);
1650 return isl_basic_set_project_out(ctx, domain, n_out, 0);
1653 struct isl_basic_set *isl_basic_map_range(struct isl_ctx *ctx,
1654 struct isl_basic_map *bmap)
1656 return isl_basic_map_domain(ctx,
1657 isl_basic_map_reverse(ctx, bmap));
1660 struct isl_set *isl_map_range(struct isl_ctx *ctx, struct isl_map *map)
1663 struct isl_set *set;
1667 map = isl_map_cow(ctx, map);
1671 set = (struct isl_set *) map;
1673 for (i = 0; i < map->n; ++i) {
1674 set->p[i] = isl_basic_map_range(ctx, map->p[i]);
1678 F_CLR(set, ISL_MAP_DISJOINT);
1681 isl_map_free(ctx, map);
1685 struct isl_map *isl_map_from_set(
1686 struct isl_ctx *ctx, struct isl_set *set,
1687 unsigned n_in, unsigned n_out)
1690 struct isl_map *map = NULL;
1694 isl_assert(ctx, set->dim == n_in + n_out, goto error);
1695 set = isl_set_cow(ctx, set);
1698 map = (struct isl_map *)set;
1699 for (i = 0; i < set->n; ++i) {
1700 map->p[i] = isl_basic_map_from_basic_set(ctx,
1701 set->p[i], n_in, n_out);
1709 isl_set_free(ctx, set);
1713 struct isl_map *isl_map_alloc(struct isl_ctx *ctx,
1714 unsigned nparam, unsigned in, unsigned out, int n,
1717 struct isl_map *map;
1719 map = isl_alloc(ctx, struct isl_map,
1720 sizeof(struct isl_map) +
1721 n * sizeof(struct isl_basic_map *));
1728 map->nparam = nparam;
1735 struct isl_basic_map *isl_basic_map_empty(struct isl_ctx *ctx,
1736 unsigned nparam, unsigned in, unsigned out)
1738 struct isl_basic_map *bmap;
1739 bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, 1, 0);
1740 bmap = isl_basic_map_set_to_empty(ctx, bmap);
1744 struct isl_map *isl_map_empty(struct isl_ctx *ctx,
1745 unsigned nparam, unsigned in, unsigned out)
1747 return isl_map_alloc(ctx, nparam, in, out, 0, ISL_MAP_DISJOINT);
1750 struct isl_set *isl_set_empty(struct isl_ctx *ctx,
1751 unsigned nparam, unsigned dim)
1753 return isl_set_alloc(ctx, nparam, dim, 0, ISL_MAP_DISJOINT);
1756 struct isl_map *isl_map_dup(struct isl_ctx *ctx, struct isl_map *map)
1759 struct isl_map *dup;
1761 dup = isl_map_alloc(ctx, map->nparam, map->n_in, map->n_out, map->n,
1763 for (i = 0; i < map->n; ++i)
1764 dup = isl_map_add(ctx, dup,
1765 isl_basic_map_dup(ctx, map->p[i]));
1769 struct isl_map *isl_map_add(struct isl_ctx *ctx, struct isl_map *map,
1770 struct isl_basic_map *bmap)
1774 isl_assert(ctx, map->nparam == bmap->nparam, goto error);
1775 isl_assert(ctx, map->n_in == bmap->n_in, goto error);
1776 isl_assert(ctx, map->n_out == bmap->n_out, goto error);
1777 isl_assert(ctx, map->n < map->size, goto error);
1778 map->p[map->n] = bmap;
1783 isl_map_free(ctx, map);
1785 isl_basic_map_free(ctx, bmap);
1789 void isl_map_free(struct isl_ctx *ctx, struct isl_map *map)
1799 for (i = 0; i < map->n; ++i)
1800 isl_basic_map_free(ctx, map->p[i]);
1804 struct isl_map *isl_map_extend(struct isl_ctx *ctx, struct isl_map *base,
1805 unsigned nparam, unsigned n_in, unsigned n_out)
1809 base = isl_map_cow(ctx, base);
1813 isl_assert(ctx, base->nparam <= nparam, goto error);
1814 isl_assert(ctx, base->n_in <= n_in, goto error);
1815 isl_assert(ctx, base->n_out <= n_out, goto error);
1816 base->nparam = nparam;
1818 base->n_out = n_out;
1819 for (i = 0; i < base->n; ++i) {
1820 base->p[i] = isl_basic_map_extend(ctx, base->p[i],
1821 nparam, n_in, n_out, 0, 0, 0);
1827 isl_map_free(ctx, base);
1831 struct isl_basic_map *isl_basic_map_fix_input_si(struct isl_ctx *ctx,
1832 struct isl_basic_map *bmap,
1833 unsigned input, int value)
1837 bmap = isl_basic_map_cow(ctx, bmap);
1840 isl_assert(ctx, input < bmap->n_in, goto error);
1842 bmap = isl_basic_map_extend(ctx, bmap,
1843 bmap->nparam, bmap->n_in, bmap->n_out, 0, 1, 0);
1844 j = isl_basic_map_alloc_equality(ctx, bmap);
1847 isl_int_set_si(bmap->eq[j][1+bmap->nparam+input], -1);
1848 isl_int_set_si(bmap->eq[j][0], value);
1849 return isl_basic_map_finalize(ctx, bmap);
1851 isl_basic_map_free(ctx, bmap);
1855 struct isl_map *isl_map_fix_input_si(struct isl_ctx *ctx, struct isl_map *map,
1856 unsigned input, int value)
1860 map = isl_map_cow(ctx, map);
1864 isl_assert(ctx, input < map->n_in, goto error);
1865 for (i = 0; i < map->n; ++i) {
1866 map->p[i] = isl_basic_map_fix_input_si(ctx, map->p[i],
1873 isl_map_free(ctx, map);
1877 struct isl_map *isl_map_reverse(struct isl_ctx *ctx, struct isl_map *map)
1882 map = isl_map_cow(ctx, map);
1887 map->n_in = map->n_out;
1889 for (i = 0; i < map->n; ++i) {
1890 map->p[i] = isl_basic_map_reverse(ctx, map->p[i]);
1896 isl_map_free(ctx, map);
1900 struct isl_map *isl_basic_map_lexmax(struct isl_ctx *ctx,
1901 struct isl_basic_map *bmap, struct isl_basic_set *dom,
1902 struct isl_set **empty)
1904 return isl_pip_basic_map_lexmax(ctx, bmap, dom, empty);
1907 struct isl_map *isl_basic_map_lexmin(struct isl_ctx *ctx,
1908 struct isl_basic_map *bmap, struct isl_basic_set *dom,
1909 struct isl_set **empty)
1911 return isl_pip_basic_map_lexmin(ctx, bmap, dom, empty);
1914 struct isl_set *isl_basic_set_lexmin(struct isl_ctx *ctx,
1915 struct isl_basic_set *bset)
1917 struct isl_basic_map *bmap = NULL;
1918 struct isl_basic_set *dom = NULL;
1919 struct isl_map *min;
1923 bmap = isl_basic_map_from_basic_set(ctx, bset, 0, bset->dim);
1926 dom = isl_basic_set_alloc(ctx, bmap->nparam, 0, 0, 0, 0);
1929 min = isl_basic_map_lexmin(ctx, bmap, dom, NULL);
1930 return isl_map_range(ctx, min);
1932 isl_basic_map_free(ctx, bmap);
1936 struct isl_map *isl_basic_map_compute_divs(struct isl_ctx *ctx,
1937 struct isl_basic_map *bmap)
1939 if (bmap->n_div == 0)
1940 return isl_map_from_basic_map(ctx, bmap);
1941 return isl_pip_basic_map_compute_divs(ctx, bmap);
1944 struct isl_map *isl_map_compute_divs(struct isl_ctx *ctx, struct isl_map *map)
1947 struct isl_map *res;
1953 res = isl_basic_map_compute_divs(ctx,
1954 isl_basic_map_copy(ctx, map->p[0]));
1955 for (i = 1 ; i < map->n; ++i) {
1957 r2 = isl_basic_map_compute_divs(ctx,
1958 isl_basic_map_copy(ctx, map->p[i]));
1959 if (F_ISSET(map, ISL_MAP_DISJOINT))
1960 res = isl_map_union_disjoint(ctx, res, r2);
1962 res = isl_map_union(ctx, res, r2);
1964 isl_map_free(ctx, map);
1969 struct isl_set *isl_basic_set_compute_divs(struct isl_ctx *ctx,
1970 struct isl_basic_set *bset)
1972 return (struct isl_set *)
1973 isl_basic_map_compute_divs(ctx,
1974 (struct isl_basic_map *)bset);
1977 struct isl_set *isl_map_domain(struct isl_ctx *ctx, struct isl_map *map)
1980 struct isl_set *set;
1985 map = isl_map_cow(ctx, map);
1989 set = (struct isl_set *)map;
1990 set->dim = map->n_in;
1992 for (i = 0; i < map->n; ++i) {
1993 set->p[i] = isl_basic_map_domain(ctx, map->p[i]);
1997 F_CLR(set, ISL_MAP_DISJOINT);
2000 isl_map_free(ctx, map);
2004 struct isl_map *isl_map_union_disjoint(struct isl_ctx *ctx,
2005 struct isl_map *map1, struct isl_map *map2)
2009 struct isl_map *map = NULL;
2015 isl_map_free(ctx, map1);
2019 isl_map_free(ctx, map2);
2023 isl_assert(ctx, map1->nparam == map2->nparam, goto error);
2024 isl_assert(ctx, map1->n_in == map2->n_in, goto error);
2025 isl_assert(ctx, map1->n_out == map2->n_out, goto error);
2027 if (F_ISSET(map1, ISL_MAP_DISJOINT) &&
2028 F_ISSET(map2, ISL_MAP_DISJOINT))
2029 FL_SET(flags, ISL_MAP_DISJOINT);
2031 map = isl_map_alloc(ctx, map1->nparam, map1->n_in, map1->n_out,
2032 map1->n + map2->n, flags);
2035 for (i = 0; i < map1->n; ++i) {
2036 map = isl_map_add(ctx, map,
2037 isl_basic_map_copy(ctx, map1->p[i]));
2041 for (i = 0; i < map2->n; ++i) {
2042 map = isl_map_add(ctx, map,
2043 isl_basic_map_copy(ctx, map2->p[i]));
2047 isl_map_free(ctx, map1);
2048 isl_map_free(ctx, map2);
2051 isl_map_free(ctx, map);
2052 isl_map_free(ctx, map1);
2053 isl_map_free(ctx, map2);
2057 struct isl_map *isl_map_union(struct isl_ctx *ctx,
2058 struct isl_map *map1, struct isl_map *map2)
2060 map1 = isl_map_union_disjoint(ctx, map1, map2);
2064 F_CLR(map1, ISL_MAP_DISJOINT);
2068 struct isl_set *isl_set_union_disjoint(struct isl_ctx *ctx,
2069 struct isl_set *set1, struct isl_set *set2)
2071 return (struct isl_set *)
2072 isl_map_union_disjoint(ctx,
2073 (struct isl_map *)set1, (struct isl_map *)set2);
2076 struct isl_set *isl_set_union(struct isl_ctx *ctx,
2077 struct isl_set *set1, struct isl_set *set2)
2079 return (struct isl_set *)
2081 (struct isl_map *)set1, (struct isl_map *)set2);
2084 struct isl_map *isl_map_intersect_range(
2085 struct isl_ctx *ctx, struct isl_map *map,
2086 struct isl_set *set)
2089 struct isl_map *result;
2095 if (F_ISSET(map, ISL_MAP_DISJOINT) &&
2096 F_ISSET(set, ISL_MAP_DISJOINT))
2097 FL_SET(flags, ISL_MAP_DISJOINT);
2099 result = isl_map_alloc(ctx, map->nparam, map->n_in, map->n_out,
2100 map->n * set->n, flags);
2103 for (i = 0; i < map->n; ++i)
2104 for (j = 0; j < set->n; ++j) {
2105 result = isl_map_add(ctx, result,
2106 isl_basic_map_intersect_range(ctx,
2107 isl_basic_map_copy(ctx, map->p[i]),
2108 isl_basic_set_copy(ctx, set->p[j])));
2112 isl_map_free(ctx, map);
2113 isl_set_free(ctx, set);
2116 isl_map_free(ctx, map);
2117 isl_set_free(ctx, set);
2121 struct isl_map *isl_map_intersect_domain(
2122 struct isl_ctx *ctx, struct isl_map *map,
2123 struct isl_set *set)
2125 return isl_map_reverse(ctx,
2126 isl_map_intersect_range(ctx, isl_map_reverse(ctx, map), set));
2129 struct isl_map *isl_map_apply_domain(
2130 struct isl_ctx *ctx, struct isl_map *map1,
2131 struct isl_map *map2)
2135 map1 = isl_map_reverse(ctx, map1);
2136 map1 = isl_map_apply_range(ctx, map1, map2);
2137 return isl_map_reverse(ctx, map1);
2139 isl_map_free(ctx, map1);
2140 isl_map_free(ctx, map2);
2144 struct isl_map *isl_map_apply_range(
2145 struct isl_ctx *ctx, struct isl_map *map1,
2146 struct isl_map *map2)
2148 struct isl_map *result;
2154 isl_assert(ctx, map1->nparam == map2->nparam, goto error);
2155 isl_assert(ctx, map1->n_out == map2->n_in, goto error);
2157 result = isl_map_alloc(ctx, map1->nparam, map1->n_in, map2->n_out,
2158 map1->n * map2->n, 0);
2161 for (i = 0; i < map1->n; ++i)
2162 for (j = 0; j < map2->n; ++j) {
2163 result = isl_map_add(ctx, result,
2164 isl_basic_map_apply_range(ctx,
2165 isl_basic_map_copy(ctx, map1->p[i]),
2166 isl_basic_map_copy(ctx, map2->p[j])));
2170 isl_map_free(ctx, map1);
2171 isl_map_free(ctx, map2);
2174 isl_map_free(ctx, map1);
2175 isl_map_free(ctx, map2);
2180 * returns range - domain
2182 struct isl_basic_set *isl_basic_map_deltas(struct isl_ctx *ctx,
2183 struct isl_basic_map *bmap)
2185 struct isl_basic_set *bset;
2191 isl_assert(ctx, bmap->n_in == bmap->n_out, goto error);
2193 bset = isl_basic_set_from_basic_map(ctx, bmap);
2194 bset = isl_basic_set_extend(ctx, bset, bset->nparam, 3*dim, 0,
2196 bset = isl_basic_set_swap_vars(ctx, bset, 2*dim);
2197 for (i = 0; i < dim; ++i) {
2198 int j = isl_basic_map_alloc_equality(ctx,
2199 (struct isl_basic_map *)bset);
2202 isl_int_set_si(bset->eq[j][1+bset->nparam+i], 1);
2203 isl_int_set_si(bset->eq[j][1+bset->nparam+dim+i], 1);
2204 isl_int_set_si(bset->eq[j][1+bset->nparam+2*dim+i], -1);
2206 return isl_basic_set_project_out(ctx, bset, 2*dim, 0);
2208 isl_basic_map_free(ctx, bmap);
2212 static int div_is_redundant(struct isl_ctx *ctx, struct isl_basic_map *bmap,
2216 unsigned pos = 1 + bmap->nparam + bmap->n_in + bmap->n_out + div;
2218 for (i = 0; i < bmap->n_eq; ++i)
2219 if (!isl_int_is_zero(bmap->eq[i][pos]))
2222 for (i = 0; i < bmap->n_ineq; ++i)
2223 if (!isl_int_is_zero(bmap->ineq[i][pos]))
2226 for (i = 0; i < bmap->n_div; ++i)
2227 if (!isl_int_is_zero(bmap->div[i][1+pos]))
2234 * Remove divs that don't occur in any of the constraints or other divs.
2235 * These can arise when dropping some of the variables in a quast
2236 * returned by piplib.
2238 static struct isl_basic_map *remove_redundant_divs(struct isl_ctx *ctx,
2239 struct isl_basic_map *bmap)
2243 for (i = bmap->n_div-1; i >= 0; --i) {
2244 if (!div_is_redundant(ctx, bmap, i))
2246 bmap = isl_basic_map_drop_div(ctx, bmap, i);
2251 struct isl_basic_map *isl_basic_map_finalize(struct isl_ctx *ctx,
2252 struct isl_basic_map *bmap)
2254 bmap = remove_redundant_divs(ctx, bmap);
2257 F_SET(bmap, ISL_BASIC_SET_FINAL);
2261 struct isl_basic_set *isl_basic_set_finalize(struct isl_ctx *ctx,
2262 struct isl_basic_set *bset)
2264 return (struct isl_basic_set *)
2265 isl_basic_map_finalize(ctx,
2266 (struct isl_basic_map *)bset);
2269 struct isl_set *isl_set_finalize(struct isl_ctx *ctx, struct isl_set *set)
2275 for (i = 0; i < set->n; ++i) {
2276 set->p[i] = isl_basic_set_finalize(ctx, set->p[i]);
2282 isl_set_free(ctx, set);
2286 struct isl_map *isl_map_finalize(struct isl_ctx *ctx, struct isl_map *map)
2292 for (i = 0; i < map->n; ++i) {
2293 map->p[i] = isl_basic_map_finalize(ctx, map->p[i]);
2299 isl_map_free(ctx, map);
2303 struct isl_basic_map *isl_basic_map_identity(struct isl_ctx *ctx,
2304 unsigned nparam, unsigned dim)
2306 struct isl_basic_map *bmap;
2309 bmap = isl_basic_map_alloc(ctx, nparam, dim, dim, 0, dim, 0);
2313 for (i = 0; i < dim; ++i) {
2314 int j = isl_basic_map_alloc_equality(ctx, bmap);
2317 isl_int_set_si(bmap->eq[j][1+nparam+i], 1);
2318 isl_int_set_si(bmap->eq[j][1+nparam+dim+i], -1);
2320 return isl_basic_map_finalize(ctx, bmap);
2322 isl_basic_map_free(ctx, bmap);
2326 struct isl_map *isl_map_identity(struct isl_ctx *ctx,
2327 unsigned nparam, unsigned dim)
2329 struct isl_map *map = isl_map_alloc(ctx, nparam, dim, dim, 1,
2333 map = isl_map_add(ctx, map,
2334 isl_basic_map_identity(ctx, nparam, dim));
2337 isl_map_free(ctx, map);
2341 int isl_set_is_equal(struct isl_ctx *ctx,
2342 struct isl_set *set1, struct isl_set *set2)
2344 return isl_map_is_equal(ctx,
2345 (struct isl_map *)set1, (struct isl_map *)set2);
2348 int isl_set_is_subset(struct isl_ctx *ctx,
2349 struct isl_set *set1, struct isl_set *set2)
2351 return isl_map_is_subset(ctx,
2352 (struct isl_map *)set1, (struct isl_map *)set2);
2355 int isl_basic_map_is_subset(struct isl_ctx *ctx,
2356 struct isl_basic_map *bmap1,
2357 struct isl_basic_map *bmap2)
2360 struct isl_map *map1;
2361 struct isl_map *map2;
2363 if (!bmap1 || !bmap2)
2366 map1 = isl_map_from_basic_map(ctx,
2367 isl_basic_map_copy(ctx, bmap1));
2368 map2 = isl_map_from_basic_map(ctx,
2369 isl_basic_map_copy(ctx, bmap2));
2371 is_subset = isl_map_is_subset(ctx, map1, map2);
2373 isl_map_free(ctx, map1);
2374 isl_map_free(ctx, map2);
2379 int isl_map_is_empty(struct isl_ctx *ctx, struct isl_map *map)
2386 for (i = 0; i < map->n; ++i) {
2387 is_empty = isl_basic_map_is_empty(ctx, map->p[i]);
2396 int isl_set_is_empty(struct isl_ctx *ctx, struct isl_set *set)
2398 return isl_map_is_empty(ctx, (struct isl_map *)set);
2401 int isl_map_is_subset(struct isl_ctx *ctx, struct isl_map *map1,
2402 struct isl_map *map2)
2406 struct isl_map *diff;
2411 if (isl_map_is_empty(ctx, map1))
2414 if (isl_map_is_empty(ctx, map2))
2417 diff = isl_map_subtract(ctx, isl_map_copy(ctx, map1),
2418 isl_map_copy(ctx, map2));
2422 is_subset = isl_map_is_empty(ctx, diff);
2423 isl_map_free(ctx, diff);
2428 int isl_map_is_equal(struct isl_ctx *ctx,
2429 struct isl_map *map1, struct isl_map *map2)
2435 is_subset = isl_map_is_subset(ctx, map1, map2);
2438 is_subset = isl_map_is_subset(ctx, map2, map1);
2442 int isl_basic_map_is_strict_subset(struct isl_ctx *ctx,
2443 struct isl_basic_map *bmap1,
2444 struct isl_basic_map *bmap2)
2448 if (!bmap1 || !bmap2)
2450 is_subset = isl_basic_map_is_subset(ctx, bmap1, bmap2);
2453 is_subset = isl_basic_map_is_subset(ctx, bmap2, bmap1);
2454 if (is_subset == -1)
2459 int isl_basic_map_is_empty(struct isl_ctx *ctx,
2460 struct isl_basic_map *bmap)
2462 struct isl_basic_set *bset = NULL;
2463 struct isl_set *min = NULL;
2469 if (F_ISSET(bmap, ISL_BASIC_MAP_EMPTY))
2472 bset = isl_basic_set_from_basic_map(ctx,
2473 isl_basic_map_copy(ctx, bmap));
2476 min = isl_basic_set_lexmin(ctx, bset);
2479 empty = min->n == 0;
2480 isl_set_free(ctx, min);
2484 struct isl_map *isl_basic_map_union(
2485 struct isl_ctx *ctx, struct isl_basic_map *bmap1,
2486 struct isl_basic_map *bmap2)
2488 struct isl_map *map;
2489 if (!bmap1 || !bmap2)
2492 isl_assert(ctx, bmap1->nparam == bmap2->nparam, goto error);
2493 isl_assert(ctx, bmap1->n_in == bmap2->n_in, goto error);
2494 isl_assert(ctx, bmap1->n_out == bmap2->n_out, goto error);
2496 map = isl_map_alloc(ctx, bmap1->nparam,
2497 bmap1->n_in, bmap1->n_out, 2, 0);
2500 map = isl_map_add(ctx, map, bmap1);
2501 map = isl_map_add(ctx, map, bmap2);
2504 isl_basic_map_free(ctx, bmap1);
2505 isl_basic_map_free(ctx, bmap2);
2509 struct isl_set *isl_basic_set_union(
2510 struct isl_ctx *ctx, struct isl_basic_set *bset1,
2511 struct isl_basic_set *bset2)
2513 return (struct isl_set *)isl_basic_map_union(ctx,
2514 (struct isl_basic_map *)bset1,
2515 (struct isl_basic_map *)bset2);
2518 /* Order divs such that any div only depends on previous divs */
2519 static struct isl_basic_map *order_divs(struct isl_ctx *ctx,
2520 struct isl_basic_map *bmap)
2523 unsigned off = bmap->nparam + bmap->n_in + bmap->n_out;
2525 for (i = 0; i < bmap->n_div; ++i) {
2527 pos = isl_seq_first_non_zero(bmap->div[i]+1+1+off+i,
2531 swap_div(bmap, i, pos);
2537 static int find_div(struct isl_basic_map *dst,
2538 struct isl_basic_map *src, unsigned div)
2542 unsigned total = src->nparam + src->n_in + src->n_out + src->n_div;
2544 for (i = 0; i < dst->n_div; ++i)
2545 if (isl_seq_eq(dst->div[i], src->div[div], 1+1+total) &&
2546 isl_seq_first_non_zero(dst->div[i]+1+1+total,
2547 dst->n_div - src->n_div) == -1)
2552 struct isl_basic_map *isl_basic_map_align_divs(struct isl_ctx *ctx,
2553 struct isl_basic_map *dst, struct isl_basic_map *src)
2556 unsigned total = src->nparam + src->n_in + src->n_out + src->n_div;
2558 if (src->n_div == 0)
2561 src = order_divs(ctx, src);
2562 dst = isl_basic_map_extend(ctx, dst, dst->nparam, dst->n_in,
2563 dst->n_out, src->n_div, 0, 0);
2566 for (i = 0; i < src->n_div; ++i) {
2567 int j = find_div(dst, src, i);
2569 j = isl_basic_map_alloc_div(ctx, dst);
2572 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total);
2575 swap_div(dst, i, j);
2579 isl_basic_map_free(ctx, dst);
2583 static struct isl_map *add_cut_constraint(struct isl_ctx *ctx,
2584 struct isl_map *dst,
2585 struct isl_basic_map *src, isl_int *c,
2586 unsigned len, unsigned extra, int oppose)
2588 struct isl_basic_map *copy = NULL;
2592 copy = isl_basic_map_copy(ctx, src);
2593 copy = isl_basic_map_cow(ctx, copy);
2596 copy = isl_basic_map_extend(ctx, copy,
2597 copy->nparam, copy->n_in, copy->n_out, 0, 0, 1);
2598 k = isl_basic_map_alloc_inequality(ctx, copy);
2602 isl_seq_neg(copy->ineq[k], c, len);
2604 isl_seq_cpy(copy->ineq[k], c, len);
2605 isl_seq_clr(copy->ineq[k]+len, extra);
2606 isl_inequality_negate(ctx, copy, k);
2607 copy = isl_basic_map_simplify(ctx, copy);
2608 copy = isl_basic_map_finalize(ctx, copy);
2609 is_empty = isl_basic_map_is_empty(ctx, copy);
2613 dst = isl_map_add(ctx, dst, copy);
2615 isl_basic_map_free(ctx, copy);
2618 isl_basic_map_free(ctx, copy);
2619 isl_map_free(ctx, dst);
2623 static struct isl_map *subtract(struct isl_ctx *ctx, struct isl_map *map,
2624 struct isl_basic_map *bmap)
2628 struct isl_map *rest = NULL;
2630 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
2637 if (F_ISSET(map, ISL_MAP_DISJOINT))
2638 FL_SET(flags, ISL_MAP_DISJOINT);
2640 max = map->n * (2 * bmap->n_eq + bmap->n_ineq);
2641 rest = isl_map_alloc(ctx, map->nparam, map->n_in, map->n_out,
2646 for (i = 0; i < map->n; ++i) {
2647 map->p[i] = isl_basic_map_align_divs(ctx, map->p[i], bmap);
2652 for (j = 0; j < map->n; ++j)
2653 map->p[j] = isl_basic_map_cow(ctx, map->p[j]);
2655 for (i = 0; i < bmap->n_eq; ++i) {
2656 for (j = 0; j < map->n; ++j) {
2657 rest = add_cut_constraint(ctx, rest,
2658 map->p[j], bmap->eq[i],
2659 1+total, map->p[j]->n_div - bmap->n_div, 0);
2663 rest = add_cut_constraint(ctx, rest,
2664 map->p[j], bmap->eq[i],
2665 1+total, map->p[j]->n_div - bmap->n_div, 1);
2669 map->p[j] = isl_basic_map_extend(ctx, map->p[j],
2670 map->p[j]->nparam, map->p[j]->n_in,
2671 map->p[j]->n_out, 0, 1, 0);
2674 k = isl_basic_map_alloc_equality(ctx, map->p[j]);
2677 isl_seq_cpy(map->p[j]->eq[k], bmap->eq[i], 1+total);
2678 isl_seq_clr(map->p[j]->eq[k]+1+total,
2679 map->p[j]->n_div - bmap->n_div);
2683 for (i = 0; i < bmap->n_ineq; ++i) {
2684 for (j = 0; j < map->n; ++j) {
2685 rest = add_cut_constraint(ctx, rest,
2686 map->p[j], bmap->ineq[i],
2687 1+total, map->p[j]->n_div - bmap->n_div, 0);
2691 map->p[j] = isl_basic_map_extend(ctx, map->p[j],
2692 map->p[j]->nparam, map->p[j]->n_in,
2693 map->p[j]->n_out, 0, 0, 1);
2696 k = isl_basic_map_alloc_inequality(ctx, map->p[j]);
2699 isl_seq_cpy(map->p[j]->ineq[k], bmap->ineq[i], 1+total);
2700 isl_seq_clr(map->p[j]->ineq[k]+1+total,
2701 map->p[j]->n_div - bmap->n_div);
2705 isl_map_free(ctx, map);
2708 isl_map_free(ctx, map);
2709 isl_map_free(ctx, rest);
2713 struct isl_map *isl_map_subtract(struct isl_ctx *ctx, struct isl_map *map1,
2714 struct isl_map *map2)
2720 isl_assert(ctx, map1->nparam == map2->nparam, goto error);
2721 isl_assert(ctx, map1->n_in == map2->n_in, goto error);
2722 isl_assert(ctx, map1->n_out == map2->n_out, goto error);
2724 if (isl_map_is_empty(ctx, map2)) {
2725 isl_map_free(ctx, map2);
2729 map1 = isl_map_compute_divs(ctx, map1);
2730 map2 = isl_map_compute_divs(ctx, map2);
2734 for (i = 0; map1 && i < map2->n; ++i)
2735 map1 = subtract(ctx, map1, map2->p[i]);
2737 isl_map_free(ctx, map2);
2740 isl_map_free(ctx, map1);
2741 isl_map_free(ctx, map2);
2745 struct isl_set *isl_set_subtract(struct isl_ctx *ctx, struct isl_set *set1,
2746 struct isl_set *set2)
2748 return (struct isl_set *)
2749 isl_map_subtract(ctx,
2750 (struct isl_map *)set1, (struct isl_map *)set2);
2753 struct isl_set *isl_set_apply(struct isl_ctx *ctx, struct isl_set *set,
2754 struct isl_map *map)
2756 isl_assert(ctx, set->dim == map->n_in, goto error);
2757 map = isl_map_intersect_domain(ctx, map, set);
2758 set = isl_map_range(ctx, map);
2761 isl_set_free(ctx, set);
2762 isl_map_free(ctx, map);