8 #include "isl_map_private.h"
9 #include "isl_map_piplib.h"
10 #include "isl_sample.h"
13 static struct isl_basic_map *basic_map_init(struct isl_ctx *ctx,
14 struct isl_basic_map *bmap,
15 unsigned nparam, unsigned n_in, unsigned n_out, unsigned extra,
16 unsigned n_eq, unsigned n_ineq)
19 size_t row_size = 1 + nparam + n_in + n_out + extra;
21 bmap->block = isl_blk_alloc(ctx, (n_eq + n_ineq) * row_size);
22 if (isl_blk_is_error(bmap->block)) {
27 bmap->eq = isl_alloc_array(ctx, isl_int *, n_eq + n_ineq);
29 isl_blk_free(ctx, bmap->block);
35 bmap->block2 = isl_blk_empty();
38 bmap->block2 = isl_blk_alloc(ctx, extra * (1 + row_size));
39 if (isl_blk_is_error(bmap->block2)) {
41 isl_blk_free(ctx, bmap->block);
46 bmap->div = isl_alloc_array(ctx, isl_int *, extra);
48 isl_blk_free(ctx, bmap->block2);
50 isl_blk_free(ctx, bmap->block);
56 for (i = 0; i < n_eq + n_ineq; ++i)
57 bmap->eq[i] = bmap->block.data + i * row_size;
59 for (i = 0; i < extra; ++i)
60 bmap->div[i] = bmap->block2.data + i * (1 + row_size);
64 bmap->c_size = n_eq + n_ineq;
65 bmap->ineq = bmap->eq + n_eq;
66 bmap->nparam = nparam;
78 struct isl_basic_set *isl_basic_set_alloc(struct isl_ctx *ctx,
79 unsigned nparam, unsigned dim, unsigned extra,
80 unsigned n_eq, unsigned n_ineq)
82 struct isl_basic_map *bmap;
83 bmap = isl_basic_map_alloc(ctx, nparam, 0, dim, extra, n_eq, n_ineq);
84 return (struct isl_basic_set *)bmap;
87 struct isl_basic_map *isl_basic_map_alloc(struct isl_ctx *ctx,
88 unsigned nparam, unsigned in, unsigned out, unsigned extra,
89 unsigned n_eq, unsigned n_ineq)
91 struct isl_basic_map *bmap;
93 bmap = isl_alloc_type(ctx, struct isl_basic_map);
97 return basic_map_init(ctx, bmap,
98 nparam, in, out, extra, n_eq, n_ineq);
101 static void dup_constraints(struct isl_ctx *ctx,
102 struct isl_basic_map *dst, struct isl_basic_map *src)
105 unsigned total = src->nparam + src->n_in + src->n_out + src->n_div;
107 for (i = 0; i < src->n_eq; ++i) {
108 int j = isl_basic_map_alloc_equality(ctx, dst);
109 isl_seq_cpy(dst->eq[j], src->eq[i], 1+total);
112 for (i = 0; i < src->n_ineq; ++i) {
113 int j = isl_basic_map_alloc_inequality(ctx, dst);
114 isl_seq_cpy(dst->ineq[j], src->ineq[i], 1+total);
117 for (i = 0; i < src->n_div; ++i) {
118 int j = isl_basic_map_alloc_div(ctx, dst);
119 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total);
121 F_SET(dst, ISL_BASIC_SET_FINAL);
124 struct isl_basic_map *isl_basic_map_dup(struct isl_ctx *ctx,
125 struct isl_basic_map *bmap)
127 struct isl_basic_map *dup;
129 dup = isl_basic_map_alloc(ctx, bmap->nparam,
130 bmap->n_in, bmap->n_out,
131 bmap->n_div, bmap->n_eq, bmap->n_ineq);
134 dup->flags = bmap->flags;
135 dup_constraints(ctx, dup, bmap);
136 dup->sample = isl_vec_copy(ctx, bmap->sample);
140 struct isl_basic_set *isl_basic_set_dup(struct isl_ctx *ctx,
141 struct isl_basic_set *bset)
143 struct isl_basic_map *dup;
145 dup = isl_basic_map_dup(ctx, (struct isl_basic_map *)bset);
146 return (struct isl_basic_set *)dup;
149 struct isl_basic_set *isl_basic_set_copy(struct isl_ctx *ctx,
150 struct isl_basic_set *bset)
155 if (F_ISSET(bset, ISL_BASIC_SET_FINAL)) {
159 return isl_basic_set_dup(ctx, bset);
162 struct isl_set *isl_set_copy(struct isl_ctx *ctx, struct isl_set *set)
171 struct isl_basic_map *isl_basic_map_copy(struct isl_ctx *ctx,
172 struct isl_basic_map *bmap)
177 if (F_ISSET(bmap, ISL_BASIC_SET_FINAL)) {
181 return isl_basic_map_dup(ctx, bmap);
184 struct isl_map *isl_map_copy(struct isl_ctx *ctx, struct isl_map *map)
193 void isl_basic_map_free(struct isl_ctx *ctx, struct isl_basic_map *bmap)
202 isl_blk_free(ctx, bmap->block2);
204 isl_blk_free(ctx, bmap->block);
205 isl_vec_free(ctx, bmap->sample);
209 void isl_basic_set_free(struct isl_ctx *ctx, struct isl_basic_set *bset)
211 isl_basic_map_free(ctx, (struct isl_basic_map *)bset);
214 int isl_basic_map_alloc_equality(struct isl_ctx *ctx,
215 struct isl_basic_map *bmap)
219 isl_assert(ctx, bmap->n_eq + bmap->n_ineq < bmap->c_size, return -1);
220 isl_assert(ctx, bmap->eq + bmap->n_eq <= bmap->ineq, return -1);
221 if (bmap->eq + bmap->n_eq == bmap->ineq) {
223 int j = isl_basic_map_alloc_inequality(ctx, bmap);
227 bmap->ineq[0] = bmap->ineq[j];
235 int isl_basic_set_alloc_equality(struct isl_ctx *ctx,
236 struct isl_basic_set *bset)
238 return isl_basic_map_alloc_equality(ctx, (struct isl_basic_map *)bset);
241 int isl_basic_map_free_equality(struct isl_ctx *ctx,
242 struct isl_basic_map *bmap, unsigned n)
244 isl_assert(ctx, n <= bmap->n_eq, return -1);
249 int isl_basic_map_drop_equality(struct isl_ctx *ctx,
250 struct isl_basic_map *bmap, unsigned pos)
253 isl_assert(ctx, pos < bmap->n_eq, return -1);
255 if (pos != bmap->n_eq - 1) {
257 bmap->eq[pos] = bmap->eq[bmap->n_eq - 1];
258 bmap->eq[bmap->n_eq - 1] = t;
264 int isl_basic_set_drop_equality(struct isl_ctx *ctx,
265 struct isl_basic_set *bset, unsigned pos)
267 return isl_basic_map_drop_equality(ctx,
268 (struct isl_basic_map *)bset, pos);
271 void isl_basic_map_inequality_to_equality(struct isl_ctx *ctx,
272 struct isl_basic_map *bmap, unsigned pos)
277 bmap->ineq[pos] = bmap->ineq[0];
278 bmap->ineq[0] = bmap->eq[bmap->n_eq];
279 bmap->eq[bmap->n_eq] = t;
285 int isl_basic_map_alloc_inequality(struct isl_ctx *ctx,
286 struct isl_basic_map *bmap)
288 isl_assert(ctx, (bmap->ineq - bmap->eq) + bmap->n_ineq < bmap->c_size,
290 F_CLR(bmap, ISL_BASIC_MAP_NO_IMPLICIT);
291 F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
292 return bmap->n_ineq++;
295 int isl_basic_set_alloc_inequality(struct isl_ctx *ctx,
296 struct isl_basic_set *bset)
298 return isl_basic_map_alloc_inequality(ctx, (struct isl_basic_map *)bset);
301 int isl_basic_map_free_inequality(struct isl_ctx *ctx,
302 struct isl_basic_map *bmap, unsigned n)
304 isl_assert(ctx, n <= bmap->n_ineq, return -1);
309 int isl_basic_set_free_inequality(struct isl_ctx *ctx,
310 struct isl_basic_set *bset, unsigned n)
312 return isl_basic_map_free_inequality(ctx,
313 (struct isl_basic_map *)bset, n);
316 int isl_basic_map_drop_inequality(struct isl_ctx *ctx,
317 struct isl_basic_map *bmap, unsigned pos)
320 isl_assert(ctx, pos < bmap->n_ineq, return -1);
322 if (pos != bmap->n_ineq - 1) {
324 bmap->ineq[pos] = bmap->ineq[bmap->n_ineq - 1];
325 bmap->ineq[bmap->n_ineq - 1] = t;
331 int isl_basic_set_drop_inequality(struct isl_ctx *ctx,
332 struct isl_basic_set *bset, unsigned pos)
334 return isl_basic_map_drop_inequality(ctx,
335 (struct isl_basic_map *)bset, pos);
338 int isl_basic_map_alloc_div(struct isl_ctx *ctx,
339 struct isl_basic_map *bmap)
341 isl_assert(ctx, bmap->n_div < bmap->extra, return -1);
342 return bmap->n_div++;
345 int isl_basic_map_free_div(struct isl_ctx *ctx,
346 struct isl_basic_map *bmap, unsigned n)
348 isl_assert(ctx, n <= bmap->n_div, return -1);
353 /* Copy constraint from src to dst, putting the vars of src at offset
354 * dim_off in dst and the divs of src at offset div_off in dst.
355 * If both sets are actually map, then dim_off applies to the input
358 static void copy_constraint(struct isl_basic_map *dst_map, isl_int *dst,
359 struct isl_basic_map *src_map, isl_int *src,
360 unsigned in_off, unsigned out_off, unsigned div_off)
362 isl_int_set(dst[0], src[0]);
363 isl_seq_cpy(dst+1, src+1, isl_min(dst_map->nparam, src_map->nparam));
364 if (dst_map->nparam > src_map->nparam)
365 isl_seq_clr(dst+1+src_map->nparam,
366 dst_map->nparam - src_map->nparam);
367 isl_seq_clr(dst+1+dst_map->nparam, in_off);
368 isl_seq_cpy(dst+1+dst_map->nparam+in_off,
369 src+1+src_map->nparam,
370 isl_min(dst_map->n_in-in_off, src_map->n_in));
371 if (dst_map->n_in-in_off > src_map->n_in)
372 isl_seq_clr(dst+1+dst_map->nparam+in_off+src_map->n_in,
373 dst_map->n_in - in_off - src_map->n_in);
374 isl_seq_clr(dst+1+dst_map->nparam+dst_map->n_in, out_off);
375 isl_seq_cpy(dst+1+dst_map->nparam+dst_map->n_in+out_off,
376 src+1+src_map->nparam+src_map->n_in,
377 isl_min(dst_map->n_out-out_off, src_map->n_out));
378 if (dst_map->n_out-out_off > src_map->n_out)
379 isl_seq_clr(dst+1+dst_map->nparam+dst_map->n_in+out_off+src_map->n_out,
380 dst_map->n_out - out_off - src_map->n_out);
381 isl_seq_clr(dst+1+dst_map->nparam+dst_map->n_in+dst_map->n_out, div_off);
382 isl_seq_cpy(dst+1+dst_map->nparam+dst_map->n_in+dst_map->n_out+div_off,
383 src+1+src_map->nparam+src_map->n_in+src_map->n_out,
384 isl_min(dst_map->extra-div_off, src_map->extra));
385 if (dst_map->extra-div_off > src_map->extra)
386 isl_seq_clr(dst+1+dst_map->nparam+dst_map->n_in+dst_map->n_out+
387 div_off+src_map->extra,
388 dst_map->extra - div_off - src_map->extra);
391 static void copy_div(struct isl_basic_map *dst_map, isl_int *dst,
392 struct isl_basic_map *src_map, isl_int *src,
393 unsigned in_off, unsigned out_off, unsigned div_off)
395 isl_int_set(dst[0], src[0]);
396 copy_constraint(dst_map, dst+1, src_map, src+1, in_off, out_off, div_off);
399 static struct isl_basic_map *add_constraints(struct isl_ctx *ctx,
400 struct isl_basic_map *bmap1,
401 struct isl_basic_map *bmap2, unsigned i_pos, unsigned o_pos)
404 unsigned div_off = bmap1->n_div;
406 for (i = 0; i < bmap2->n_eq; ++i) {
407 int i1 = isl_basic_map_alloc_equality(ctx, bmap1);
410 copy_constraint(bmap1, bmap1->eq[i1], bmap2, bmap2->eq[i],
411 i_pos, o_pos, div_off);
414 for (i = 0; i < bmap2->n_ineq; ++i) {
415 int i1 = isl_basic_map_alloc_inequality(ctx, bmap1);
418 copy_constraint(bmap1, bmap1->ineq[i1], bmap2, bmap2->ineq[i],
419 i_pos, o_pos, div_off);
422 for (i = 0; i < bmap2->n_div; ++i) {
423 int i1 = isl_basic_map_alloc_div(ctx, bmap1);
426 copy_div(bmap1, bmap1->div[i1], bmap2, bmap2->div[i],
427 i_pos, o_pos, div_off);
430 isl_basic_map_free(ctx, bmap2);
435 isl_basic_map_free(ctx, bmap1);
436 isl_basic_map_free(ctx, bmap2);
440 struct isl_basic_map *isl_basic_map_extend(struct isl_ctx *ctx,
441 struct isl_basic_map *base,
442 unsigned nparam, unsigned n_in, unsigned n_out, unsigned extra,
443 unsigned n_eq, unsigned n_ineq)
445 struct isl_basic_map *ext;
449 base = isl_basic_map_cow(ctx, base);
453 dims_ok = base && base->nparam == nparam &&
454 base->n_in == n_in && base->n_out == n_out &&
455 base->extra >= base->n_div + extra;
457 if (dims_ok && n_eq == 0 && n_ineq == 0)
461 isl_assert(ctx, base->nparam <= nparam, goto error);
462 isl_assert(ctx, base->n_in <= n_in, goto error);
463 isl_assert(ctx, base->n_out <= n_out, goto error);
464 extra += base->extra;
466 n_ineq += base->n_ineq;
469 ext = isl_basic_map_alloc(ctx, nparam, n_in, n_out,
470 extra, n_eq, n_ineq);
477 ext = add_constraints(ctx, ext, base, 0, 0);
480 F_CLR(ext, ISL_BASIC_SET_FINAL);
486 isl_basic_map_free(ctx, base);
490 struct isl_basic_set *isl_basic_set_extend(struct isl_ctx *ctx,
491 struct isl_basic_set *base,
492 unsigned nparam, unsigned dim, unsigned extra,
493 unsigned n_eq, unsigned n_ineq)
495 return (struct isl_basic_set *)
496 isl_basic_map_extend(ctx, (struct isl_basic_map *)base,
497 nparam, 0, dim, extra, n_eq, n_ineq);
500 struct isl_basic_set *isl_basic_set_cow(struct isl_ctx *ctx,
501 struct isl_basic_set *bset)
503 return (struct isl_basic_set *)
504 isl_basic_map_cow(ctx, (struct isl_basic_map *)bset);
507 struct isl_basic_map *isl_basic_map_cow(struct isl_ctx *ctx,
508 struct isl_basic_map *bmap)
515 bmap = isl_basic_map_dup(ctx, bmap);
517 F_CLR(bmap, ISL_BASIC_SET_FINAL);
521 struct isl_set *isl_set_cow(struct isl_ctx *ctx, struct isl_set *set)
529 return isl_set_dup(ctx, set);
532 struct isl_map *isl_map_cow(struct isl_ctx *ctx, struct isl_map *map)
540 return isl_map_dup(ctx, map);
543 static void swap_vars(struct isl_blk blk, isl_int *a,
544 unsigned a_len, unsigned b_len)
546 isl_seq_cpy(blk.data, a+a_len, b_len);
547 isl_seq_cpy(blk.data+b_len, a, a_len);
548 isl_seq_cpy(a, blk.data, b_len+a_len);
551 struct isl_basic_set *isl_basic_set_swap_vars(struct isl_ctx *ctx,
552 struct isl_basic_set *bset, unsigned n)
560 isl_assert(ctx, n <= bset->dim, goto error);
565 bset = isl_basic_set_cow(ctx, bset);
569 blk = isl_blk_alloc(ctx, bset->dim);
570 if (isl_blk_is_error(blk))
573 for (i = 0; i < bset->n_eq; ++i)
575 bset->eq[i]+1+bset->nparam, n, bset->dim - n);
577 for (i = 0; i < bset->n_ineq; ++i)
579 bset->ineq[i]+1+bset->nparam, n, bset->dim - n);
581 for (i = 0; i < bset->n_div; ++i)
583 bset->div[i]+1+1+bset->nparam, n, bset->dim - n);
585 isl_blk_free(ctx, blk);
590 isl_basic_set_free(ctx, bset);
594 struct isl_set *isl_set_swap_vars(struct isl_ctx *ctx,
595 struct isl_set *set, unsigned n)
598 set = isl_set_cow(ctx, set);
602 for (i = 0; i < set->n; ++i) {
603 set->p[i] = isl_basic_set_swap_vars(ctx, set->p[i], n);
605 isl_set_free(ctx, set);
612 static void constraint_drop_vars(isl_int *c, unsigned n, unsigned rem)
614 isl_seq_cpy(c, c + n, rem);
615 isl_seq_clr(c + rem, n);
618 struct isl_basic_set *isl_basic_set_drop_vars(struct isl_ctx *ctx,
619 struct isl_basic_set *bset, unsigned first, unsigned n)
626 isl_assert(ctx, first + n <= bset->dim, goto error);
631 bset = isl_basic_set_cow(ctx, bset);
635 for (i = 0; i < bset->n_eq; ++i)
636 constraint_drop_vars(bset->eq[i]+1+bset->nparam+first, n,
637 (bset->dim-first-n)+bset->extra);
639 for (i = 0; i < bset->n_ineq; ++i)
640 constraint_drop_vars(bset->ineq[i]+1+bset->nparam+first, n,
641 (bset->dim-first-n)+bset->extra);
643 for (i = 0; i < bset->n_div; ++i)
644 constraint_drop_vars(bset->div[i]+1+1+bset->nparam+first, n,
645 (bset->dim-first-n)+bset->extra);
650 return isl_basic_set_finalize(ctx, bset);
652 isl_basic_set_free(ctx, bset);
656 struct isl_set *isl_set_drop_vars(struct isl_ctx *ctx,
657 struct isl_set *set, unsigned first, unsigned n)
664 isl_assert(ctx, first + n <= set->dim, goto error);
668 set = isl_set_cow(ctx, set);
672 for (i = 0; i < set->n; ++i) {
673 set->p[i] = isl_basic_set_drop_vars(ctx, set->p[i], first, n);
681 isl_set_free(ctx, set);
686 * We don't cow, as the div is assumed to be redundant.
688 static struct isl_basic_map *isl_basic_map_drop_div(struct isl_ctx *ctx,
689 struct isl_basic_map *bmap, unsigned div)
697 pos = 1 + bmap->nparam + bmap->n_in + bmap->n_out + div;
699 isl_assert(ctx, div < bmap->n_div, goto error);
701 for (i = 0; i < bmap->n_eq; ++i)
702 constraint_drop_vars(bmap->eq[i]+pos, 1, bmap->extra-div-1);
704 for (i = 0; i < bmap->n_ineq; ++i) {
705 if (!isl_int_is_zero(bmap->ineq[i][pos])) {
706 isl_basic_map_drop_inequality(ctx, bmap, i);
710 constraint_drop_vars(bmap->ineq[i]+pos, 1, bmap->extra-div-1);
713 for (i = 0; i < bmap->n_div; ++i)
714 constraint_drop_vars(bmap->div[i]+1+pos, 1, bmap->extra-div-1);
716 if (div != bmap->n_div - 1) {
718 isl_int *t = bmap->div[div];
720 for (j = div; j < bmap->n_div - 1; ++j)
721 bmap->div[j] = bmap->div[j+1];
723 bmap->div[bmap->n_div - 1] = t;
725 isl_basic_map_free_div(ctx, bmap, 1);
729 isl_basic_map_free(ctx, bmap);
733 static void eliminate_div(struct isl_ctx *ctx, struct isl_basic_map *bmap,
734 isl_int *eq, unsigned div)
737 unsigned pos = 1 + bmap->nparam + bmap->n_in + bmap->n_out + div;
739 len = 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
741 for (i = 0; i < bmap->n_eq; ++i)
742 if (bmap->eq[i] != eq)
743 isl_seq_elim(bmap->eq[i], eq, pos, len, NULL);
745 for (i = 0; i < bmap->n_ineq; ++i)
746 isl_seq_elim(bmap->ineq[i], eq, pos, len, NULL);
748 /* We need to be careful about circular definitions,
749 * so for now we just remove the definitions of other divs that
750 * depend on this div and (possibly) recompute them later.
752 for (i = 0; i < bmap->n_div; ++i)
753 if (!isl_int_is_zero(bmap->div[i][0]) &&
754 !isl_int_is_zero(bmap->div[i][1 + pos]))
755 isl_seq_clr(bmap->div[i], 1 + len);
757 isl_basic_map_drop_div(ctx, bmap, div);
760 struct isl_basic_map *isl_basic_map_set_to_empty(
761 struct isl_ctx *ctx, struct isl_basic_map *bmap)
767 total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->extra;
768 isl_basic_map_free_div(ctx, bmap, bmap->n_div);
769 isl_basic_map_free_inequality(ctx, bmap, bmap->n_ineq);
771 isl_basic_map_free_equality(ctx, bmap, bmap->n_eq-1);
773 isl_basic_map_alloc_equality(ctx, bmap);
777 isl_int_set_si(bmap->eq[i][0], 1);
778 isl_seq_clr(bmap->eq[i]+1, total);
779 F_SET(bmap, ISL_BASIC_MAP_EMPTY);
780 return isl_basic_map_finalize(ctx, bmap);
782 isl_basic_map_free(ctx, bmap);
786 struct isl_basic_set *isl_basic_set_set_to_empty(
787 struct isl_ctx *ctx, struct isl_basic_set *bset)
789 return (struct isl_basic_set *)
790 isl_basic_map_set_to_empty(ctx, (struct isl_basic_map *)bset);
793 static void swap_equality(struct isl_basic_map *bmap, int a, int b)
795 isl_int *t = bmap->eq[a];
796 bmap->eq[a] = bmap->eq[b];
800 static void swap_inequality(struct isl_basic_map *bmap, int a, int b)
802 isl_int *t = bmap->ineq[a];
803 bmap->ineq[a] = bmap->ineq[b];
807 static void swap_div(struct isl_basic_map *bmap, int a, int b)
810 unsigned off = bmap->nparam + bmap->n_in + bmap->n_out;
811 isl_int *t = bmap->div[a];
812 bmap->div[a] = bmap->div[b];
815 for (i = 0; i < bmap->n_eq; ++i)
816 isl_int_swap(bmap->eq[i][1+off+a], bmap->eq[i][1+off+b]);
818 for (i = 0; i < bmap->n_ineq; ++i)
819 isl_int_swap(bmap->ineq[i][1+off+a], bmap->ineq[i][1+off+b]);
821 for (i = 0; i < bmap->n_div; ++i)
822 isl_int_swap(bmap->div[i][1+1+off+a], bmap->div[i][1+1+off+b]);
825 struct isl_basic_map *isl_basic_map_gauss(struct isl_ctx *ctx,
826 struct isl_basic_map *bmap, int *progress)
837 total_var = bmap->nparam + bmap->n_in + bmap->n_out;
838 total = total_var + bmap->n_div;
840 last_var = total - 1;
841 for (done = 0; done < bmap->n_eq; ++done) {
842 for (; last_var >= 0; --last_var) {
843 for (k = done; k < bmap->n_eq; ++k)
844 if (!isl_int_is_zero(bmap->eq[k][1+last_var]))
852 swap_equality(bmap, k, done);
853 if (isl_int_is_neg(bmap->eq[done][1+last_var]))
854 isl_seq_neg(bmap->eq[done], bmap->eq[done], 1+total);
856 for (k = 0; k < bmap->n_eq; ++k) {
859 if (isl_int_is_zero(bmap->eq[k][1+last_var]))
863 isl_seq_elim(bmap->eq[k], bmap->eq[done],
864 1+last_var, 1+total, NULL);
867 for (k = 0; k < bmap->n_ineq; ++k) {
868 if (isl_int_is_zero(bmap->ineq[k][1+last_var]))
872 isl_seq_elim(bmap->ineq[k], bmap->eq[done],
873 1+last_var, 1+total, NULL);
876 for (k = 0; k < bmap->n_div; ++k) {
877 if (isl_int_is_zero(bmap->div[k][0]))
879 if (isl_int_is_zero(bmap->div[k][1+1+last_var]))
883 isl_seq_elim(bmap->div[k]+1, bmap->eq[done],
884 1+last_var, 1+total, &bmap->div[k][0]);
887 if (last_var >= total_var &&
888 isl_int_is_zero(bmap->div[last_var - total_var][0])) {
889 unsigned div = last_var - total_var;
890 isl_seq_neg(bmap->div[div]+1, bmap->eq[done], 1+total);
891 isl_int_set_si(bmap->div[div][1+1+last_var], 0);
892 isl_int_set(bmap->div[div][0],
893 bmap->eq[done][1+last_var]);
896 if (done == bmap->n_eq)
898 for (k = done; k < bmap->n_eq; ++k) {
899 if (isl_int_is_zero(bmap->eq[k][0]))
901 return isl_basic_map_set_to_empty(ctx, bmap);
903 isl_basic_map_free_equality(ctx, bmap, bmap->n_eq-done);
907 struct isl_basic_set *isl_basic_set_gauss(struct isl_ctx *ctx,
908 struct isl_basic_set *bset, int *progress)
910 return (struct isl_basic_set*)isl_basic_map_gauss(ctx,
911 (struct isl_basic_map *)bset, progress);
914 static unsigned int round_up(unsigned int v)
925 static int hash_index(int *index, unsigned int size, int bits,
926 struct isl_basic_map *bmap, int k)
929 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
930 u_int32_t hash = isl_seq_hash(bmap->ineq[k]+1, total, bits);
931 for (h = hash; index[h]; h = (h+1) % size)
932 if (k != index[h]-1 &&
933 isl_seq_eq(bmap->ineq[k]+1,
934 bmap->ineq[index[h]-1]+1, total))
939 static struct isl_basic_map *remove_duplicate_constraints(
941 struct isl_basic_map *bmap, int *progress)
947 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
950 if (bmap->n_ineq <= 1)
953 size = round_up(4 * (bmap->n_ineq+1) / 3 - 1);
954 bits = ffs(size) - 1;
955 index = isl_alloc_array(ctx, int, size);
956 memset(index, 0, size * sizeof(int));
960 index[isl_seq_hash(bmap->ineq[0]+1, total, bits)] = 1;
961 for (k = 1; k < bmap->n_ineq; ++k) {
962 h = hash_index(index, size, bits, bmap, k);
969 if (isl_int_lt(bmap->ineq[k][0], bmap->ineq[l][0]))
970 swap_inequality(bmap, k, l);
971 isl_basic_map_drop_inequality(ctx, bmap, k);
975 for (k = 0; k < bmap->n_ineq-1; ++k) {
976 isl_seq_neg(bmap->ineq[k]+1, bmap->ineq[k]+1, total);
977 h = hash_index(index, size, bits, bmap, k);
978 isl_seq_neg(bmap->ineq[k]+1, bmap->ineq[k]+1, total);
982 isl_int_add(sum, bmap->ineq[k][0], bmap->ineq[l][0]);
983 if (isl_int_is_pos(sum))
985 if (isl_int_is_zero(sum)) {
986 /* We need to break out of the loop after these
987 * changes since the contents of the hash
988 * will no longer be valid.
989 * Plus, we probably we want to regauss first.
991 isl_basic_map_drop_inequality(ctx, bmap, l);
992 isl_basic_map_inequality_to_equality(ctx, bmap, k);
994 bmap = isl_basic_map_set_to_empty(ctx, bmap);
1003 static struct isl_basic_map *remove_duplicate_divs(struct isl_ctx *ctx,
1004 struct isl_basic_map *bmap, int *progress)
1011 unsigned total_var = bmap->nparam + bmap->n_in + bmap->n_out;
1012 unsigned total = total_var + bmap->n_div;
1014 if (bmap->n_div <= 1)
1017 for (k = bmap->n_div - 1; k >= 0; --k)
1018 if (!isl_int_is_zero(bmap->div[k][0]))
1023 size = round_up(4 * bmap->n_div / 3 - 1);
1024 bits = ffs(size) - 1;
1025 index = isl_alloc_array(ctx, int, size);
1026 memset(index, 0, size * sizeof(int));
1029 eq = isl_blk_alloc(ctx, 1+total);
1030 if (isl_blk_is_error(eq))
1033 isl_seq_clr(eq.data, 1+total);
1034 index[isl_seq_hash(bmap->div[k], 2+total, bits)] = k + 1;
1035 for (--k; k >= 0; --k) {
1038 if (isl_int_is_zero(bmap->div[k][0]))
1041 hash = isl_seq_hash(bmap->div[k], 2+total, bits);
1042 for (h = hash; index[h]; h = (h+1) % size)
1043 if (isl_seq_eq(bmap->div[k],
1044 bmap->div[index[h]-1], 2+total))
1049 isl_int_set_si(eq.data[1+total_var+k], -1);
1050 isl_int_set_si(eq.data[1+total_var+l], 1);
1051 eliminate_div(ctx, bmap, eq.data, l);
1052 isl_int_set_si(eq.data[1+total_var+k], 0);
1053 isl_int_set_si(eq.data[1+total_var+l], 0);
1058 isl_blk_free(ctx, eq);
1064 /* Elimininate divs based on equalities
1066 static struct isl_basic_map *eliminate_divs_eq(
1067 struct isl_ctx *ctx, struct isl_basic_map *bmap,
1078 off = 1 + bmap->nparam + bmap->n_in + bmap->n_out;
1080 for (d = bmap->n_div - 1; d >= 0 ; --d) {
1081 for (i = 0; i < bmap->n_eq; ++i) {
1082 if (!isl_int_is_one(bmap->eq[i][off + d]) &&
1083 !isl_int_is_negone(bmap->eq[i][off + d]))
1087 eliminate_div(ctx, bmap, bmap->eq[i], d);
1088 isl_basic_map_drop_equality(ctx, bmap, i);
1093 return eliminate_divs_eq(ctx, bmap, progress);
1097 static struct isl_basic_map *normalize_constraints(
1098 struct isl_ctx *ctx, struct isl_basic_map *bmap)
1102 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
1105 for (i = bmap->n_eq - 1; i >= 0; --i) {
1106 isl_seq_gcd(bmap->eq[i]+1, total, &gcd);
1107 if (isl_int_is_zero(gcd)) {
1108 if (!isl_int_is_zero(bmap->eq[i][0])) {
1109 bmap = isl_basic_map_set_to_empty(ctx, bmap);
1112 isl_basic_map_drop_equality(ctx, bmap, i);
1115 if (F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL))
1116 isl_int_gcd(gcd, gcd, bmap->eq[i][0]);
1117 if (isl_int_is_one(gcd))
1119 if (!isl_int_is_divisible_by(bmap->eq[i][0], gcd)) {
1120 bmap = isl_basic_map_set_to_empty(ctx, bmap);
1123 isl_seq_scale_down(bmap->eq[i], bmap->eq[i], gcd, 1+total);
1126 for (i = bmap->n_ineq - 1; i >= 0; --i) {
1127 isl_seq_gcd(bmap->ineq[i]+1, total, &gcd);
1128 if (isl_int_is_zero(gcd)) {
1129 if (isl_int_is_neg(bmap->ineq[i][0])) {
1130 bmap = isl_basic_map_set_to_empty(ctx, bmap);
1133 isl_basic_map_drop_inequality(ctx, bmap, i);
1136 if (F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL))
1137 isl_int_gcd(gcd, gcd, bmap->ineq[i][0]);
1138 if (isl_int_is_one(gcd))
1140 isl_int_fdiv_q(bmap->ineq[i][0], bmap->ineq[i][0], gcd);
1141 isl_seq_scale_down(bmap->ineq[i]+1, bmap->ineq[i]+1, gcd, total);
1149 /* Eliminate the specified variables from the constraints using
1150 * Fourier-Motzkin. The variables themselves are not removed.
1152 struct isl_basic_map *isl_basic_map_eliminate_vars(struct isl_ctx *ctx,
1153 struct isl_basic_map *bmap, int pos, unsigned n)
1162 total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
1163 extra = bmap->extra - bmap->n_div;
1165 bmap = isl_basic_map_cow(ctx, bmap);
1166 bmap = isl_basic_map_gauss(ctx, bmap, NULL);
1167 for (d = pos + n - 1; d >= pos; --d) {
1168 int n_lower, n_upper;
1171 for (i = 0; i < bmap->n_eq; ++i) {
1172 if (isl_int_is_zero(bmap->eq[i][1+d]))
1174 isl_basic_map_drop_equality(ctx, bmap, i);
1181 for (i = 0; i < bmap->n_ineq; ++i) {
1182 if (isl_int_is_pos(bmap->ineq[i][1+d]))
1184 else if (isl_int_is_neg(bmap->ineq[i][1+d]))
1187 bmap = isl_basic_map_extend(ctx, bmap,
1188 bmap->nparam, bmap->n_in, bmap->n_out, 0,
1189 0, n_lower * n_upper);
1190 for (i = bmap->n_ineq - 1; i >= 0; --i) {
1192 if (isl_int_is_zero(bmap->ineq[i][1+d]))
1195 for (j = 0; j < i; ++j) {
1196 if (isl_int_is_zero(bmap->ineq[j][1+d]))
1199 if (isl_int_sgn(bmap->ineq[i][1+d]) ==
1200 isl_int_sgn(bmap->ineq[j][1+d]))
1202 k = isl_basic_map_alloc_inequality(ctx, bmap);
1205 isl_seq_cpy(bmap->ineq[k], bmap->ineq[i],
1207 isl_seq_clr(bmap->ineq[k]+1+total, extra);
1208 isl_seq_elim(bmap->ineq[k], bmap->ineq[j],
1209 1+d, 1+total, NULL);
1211 isl_basic_map_drop_inequality(ctx, bmap, i);
1214 if (n_lower > 0 && n_upper > 0) {
1215 bmap = normalize_constraints(ctx, bmap);
1216 bmap = isl_basic_map_gauss(ctx, bmap, NULL);
1217 if (F_ISSET(bmap, ISL_BASIC_MAP_EMPTY))
1223 isl_basic_map_free(ctx, bmap);
1227 struct isl_basic_set *isl_basic_set_eliminate_vars(struct isl_ctx *ctx,
1228 struct isl_basic_set *bset, unsigned pos, unsigned n)
1230 return (struct isl_basic_set *)isl_basic_map_eliminate_vars(ctx,
1231 (struct isl_basic_map *)bset, pos, n);
1234 /* Elimininate divs based on inequalities
1236 static struct isl_basic_map *eliminate_divs_ineq(
1237 struct isl_ctx *ctx, struct isl_basic_map *bmap,
1247 off = 1 + bmap->nparam + bmap->n_in + bmap->n_out;
1249 for (d = bmap->n_div - 1; d >= 0 ; --d) {
1250 for (i = 0; i < bmap->n_eq; ++i)
1251 if (!isl_int_is_zero(bmap->eq[i][off + d]))
1255 for (i = 0; i < bmap->n_ineq; ++i)
1256 if (isl_int_abs_gt(bmap->ineq[i][off + d], ctx->one))
1258 if (i < bmap->n_ineq)
1261 bmap = isl_basic_map_eliminate_vars(ctx, bmap, (off-1)+d, 1);
1262 if (F_ISSET(bmap, ISL_BASIC_MAP_EMPTY))
1264 bmap = isl_basic_map_drop_div(ctx, bmap, d);
1271 struct isl_basic_map *isl_basic_map_simplify(
1272 struct isl_ctx *ctx, struct isl_basic_map *bmap)
1279 bmap = normalize_constraints(ctx, bmap);
1280 bmap = eliminate_divs_eq(ctx, bmap, &progress);
1281 bmap = eliminate_divs_ineq(ctx, bmap, &progress);
1282 bmap = isl_basic_map_gauss(ctx, bmap, &progress);
1283 bmap = remove_duplicate_divs(ctx, bmap, &progress);
1284 bmap = remove_duplicate_constraints(ctx, bmap, &progress);
1289 struct isl_basic_set *isl_basic_set_simplify(
1290 struct isl_ctx *ctx, struct isl_basic_set *bset)
1292 return (struct isl_basic_set *)
1293 isl_basic_map_simplify(ctx,
1294 (struct isl_basic_map *)bset);
1297 static void dump_term(struct isl_basic_map *bmap,
1298 isl_int c, int pos, FILE *out)
1300 unsigned in = bmap->n_in;
1301 unsigned dim = bmap->n_in + bmap->n_out;
1303 isl_int_print(out, c);
1305 if (!isl_int_is_one(c))
1306 isl_int_print(out, c);
1307 if (pos < 1 + bmap->nparam)
1308 fprintf(out, "p%d", pos - 1);
1309 else if (pos < 1 + bmap->nparam + in)
1310 fprintf(out, "i%d", pos - 1 - bmap->nparam);
1311 else if (pos < 1 + bmap->nparam + dim)
1312 fprintf(out, "o%d", pos - 1 - bmap->nparam - in);
1314 fprintf(out, "e%d", pos - 1 - bmap->nparam - dim);
1318 static void dump_constraint_sign(struct isl_basic_map *bmap, isl_int *c,
1319 int sign, FILE *out)
1323 unsigned len = 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
1327 for (i = 0, first = 1; i < len; ++i) {
1328 if (isl_int_sgn(c[i]) * sign <= 0)
1331 fprintf(out, " + ");
1333 isl_int_abs(v, c[i]);
1334 dump_term(bmap, v, i, out);
1341 static void dump_constraint(struct isl_basic_map *bmap, isl_int *c,
1342 const char *op, FILE *out, int indent)
1346 fprintf(out, "%*s", indent, "");
1348 dump_constraint_sign(bmap, c, 1, out);
1349 fprintf(out, " %s ", op);
1350 dump_constraint_sign(bmap, c, -1, out);
1354 for (i = bmap->n_div; i < bmap->extra; ++i) {
1355 if (isl_int_is_zero(c[1+bmap->nparam+bmap->n_in+bmap->n_out+i]))
1357 fprintf(out, "%*s", indent, "");
1358 fprintf(out, "ERROR: unused div coefficient not zero\n");
1362 static void dump_constraints(struct isl_basic_map *bmap,
1363 isl_int **c, unsigned n,
1364 const char *op, FILE *out, int indent)
1368 for (i = 0; i < n; ++i)
1369 dump_constraint(bmap, c[i], op, out, indent);
1372 static void dump_affine(struct isl_basic_map *bmap, isl_int *exp, FILE *out)
1376 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
1378 for (j = 0; j < 1 + total; ++j) {
1379 if (isl_int_is_zero(exp[j]))
1381 if (!first && isl_int_is_pos(exp[j]))
1383 dump_term(bmap, exp[j], j, out);
1388 static void dump(struct isl_basic_map *bmap, FILE *out, int indent)
1392 dump_constraints(bmap, bmap->eq, bmap->n_eq, "=", out, indent);
1393 dump_constraints(bmap, bmap->ineq, bmap->n_ineq, ">=", out, indent);
1395 for (i = 0; i < bmap->n_div; ++i) {
1396 fprintf(out, "%*s", indent, "");
1397 fprintf(out, "e%d = [(", i);
1398 dump_affine(bmap, bmap->div[i]+1, out);
1400 isl_int_print(out, bmap->div[i][0]);
1401 fprintf(out, "]\n");
1405 void isl_basic_set_dump(struct isl_ctx *ctx, struct isl_basic_set *bset,
1406 FILE *out, int indent)
1409 fprintf(out, "null basic set\n");
1413 fprintf(out, "%*s", indent, "");
1414 fprintf(out, "nparam: %d, dim: %d, extra: %d\n",
1415 bset->nparam, bset->dim, bset->extra);
1416 dump((struct isl_basic_map *)bset, out, indent);
1419 void isl_basic_map_dump(struct isl_ctx *ctx, struct isl_basic_map *bmap,
1420 FILE *out, int indent)
1423 fprintf(out, "null basic map\n");
1427 fprintf(out, "%*s", indent, "");
1428 fprintf(out, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, flags: %x\n",
1430 bmap->nparam, bmap->n_in, bmap->n_out, bmap->extra, bmap->flags);
1431 dump(bmap, out, indent);
1434 int isl_inequality_negate(struct isl_ctx *ctx,
1435 struct isl_basic_map *bmap, unsigned pos)
1437 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
1438 isl_assert(ctx, pos < bmap->n_ineq, return -1);
1439 isl_seq_neg(bmap->ineq[pos], bmap->ineq[pos], 1 + total);
1440 isl_int_sub_ui(bmap->ineq[pos][0], bmap->ineq[pos][0], 1);
1444 struct isl_set *isl_set_alloc(struct isl_ctx *ctx,
1445 unsigned nparam, unsigned dim, int n, unsigned flags)
1447 struct isl_set *set;
1449 set = isl_alloc(ctx, struct isl_set,
1450 sizeof(struct isl_set) +
1451 n * sizeof(struct isl_basic_set *));
1458 set->nparam = nparam;
1465 struct isl_set *isl_set_dup(struct isl_ctx *ctx, struct isl_set *set)
1468 struct isl_set *dup;
1470 dup = isl_set_alloc(ctx, set->nparam, set->dim, set->n, set->flags);
1473 for (i = 0; i < set->n; ++i)
1474 dup = isl_set_add(ctx, dup,
1475 isl_basic_set_dup(ctx, set->p[i]));
1479 struct isl_set *isl_set_from_basic_set(struct isl_ctx *ctx,
1480 struct isl_basic_set *bset)
1482 struct isl_set *set;
1484 set = isl_set_alloc(ctx, bset->nparam, bset->dim, 1, ISL_MAP_DISJOINT);
1486 isl_basic_set_free(ctx, bset);
1489 return isl_set_add(ctx, set, bset);
1492 struct isl_map *isl_map_from_basic_map(struct isl_ctx *ctx,
1493 struct isl_basic_map *bmap)
1495 struct isl_map *map;
1497 map = isl_map_alloc(ctx, bmap->nparam, bmap->n_in, bmap->n_out, 1,
1500 isl_basic_map_free(ctx, bmap);
1503 return isl_map_add(ctx, map, bmap);
1506 struct isl_set *isl_set_add(struct isl_ctx *ctx, struct isl_set *set,
1507 struct isl_basic_set *bset)
1511 isl_assert(ctx, set->nparam == bset->nparam, goto error);
1512 isl_assert(ctx, set->dim == bset->dim, goto error);
1513 isl_assert(ctx, set->n < set->size, goto error);
1514 set->p[set->n] = bset;
1519 isl_set_free(ctx, set);
1521 isl_basic_set_free(ctx, bset);
1525 void isl_set_free(struct isl_ctx *ctx, struct isl_set *set)
1535 for (i = 0; i < set->n; ++i)
1536 isl_basic_set_free(ctx, set->p[i]);
1540 void isl_set_dump(struct isl_ctx *ctx, struct isl_set *set, FILE *out,
1546 fprintf(out, "null set\n");
1550 fprintf(out, "%*s", indent, "");
1551 fprintf(out, "ref: %d, n: %d\n", set->ref, set->n);
1552 for (i = 0; i < set->n; ++i) {
1553 fprintf(out, "%*s", indent, "");
1554 fprintf(out, "basic set %d:\n", i);
1555 isl_basic_set_dump(ctx, set->p[i], out, indent+4);
1559 void isl_map_dump(struct isl_ctx *ctx, struct isl_map *map, FILE *out,
1565 fprintf(out, "null map\n");
1569 fprintf(out, "%*s", indent, "");
1570 fprintf(out, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, flags: %x\n",
1571 map->ref, map->n, map->nparam, map->n_in, map->n_out,
1573 for (i = 0; i < map->n; ++i) {
1574 fprintf(out, "%*s", indent, "");
1575 fprintf(out, "basic map %d:\n", i);
1576 isl_basic_map_dump(ctx, map->p[i], out, indent+4);
1580 struct isl_basic_map *isl_basic_map_intersect_domain(
1581 struct isl_ctx *ctx, struct isl_basic_map *bmap,
1582 struct isl_basic_set *bset)
1584 struct isl_basic_map *bmap_domain;
1589 isl_assert(ctx, bset->dim == bmap->n_in, goto error);
1590 isl_assert(ctx, bset->nparam == bmap->nparam, goto error);
1592 bmap = isl_basic_map_extend(ctx, bmap,
1593 bset->nparam, bmap->n_in, bmap->n_out,
1594 bset->n_div, bset->n_eq, bset->n_ineq);
1597 bmap_domain = isl_basic_map_from_basic_set(ctx, bset,
1599 bmap = add_constraints(ctx, bmap, bmap_domain, 0, 0);
1601 bmap = isl_basic_map_simplify(ctx, bmap);
1602 return isl_basic_map_finalize(ctx, bmap);
1604 isl_basic_map_free(ctx, bmap);
1605 isl_basic_set_free(ctx, bset);
1609 struct isl_basic_map *isl_basic_map_intersect_range(
1610 struct isl_ctx *ctx, struct isl_basic_map *bmap,
1611 struct isl_basic_set *bset)
1613 struct isl_basic_map *bmap_range;
1618 isl_assert(ctx, bset->dim == bmap->n_out, goto error);
1619 isl_assert(ctx, bset->nparam == bmap->nparam, goto error);
1621 bmap = isl_basic_map_extend(ctx, bmap,
1622 bset->nparam, bmap->n_in, bmap->n_out,
1623 bset->n_div, bset->n_eq, bset->n_ineq);
1626 bmap_range = isl_basic_map_from_basic_set(ctx, bset,
1628 bmap = add_constraints(ctx, bmap, bmap_range, 0, 0);
1630 bmap = isl_basic_map_simplify(ctx, bmap);
1631 return isl_basic_map_finalize(ctx, bmap);
1633 isl_basic_map_free(ctx, bmap);
1634 isl_basic_set_free(ctx, bset);
1638 struct isl_basic_map *isl_basic_map_intersect(
1639 struct isl_ctx *ctx, struct isl_basic_map *bmap1,
1640 struct isl_basic_map *bmap2)
1642 if (!bmap1 || !bmap2)
1645 isl_assert(ctx, bmap1->nparam == bmap2->nparam, goto error);
1646 isl_assert(ctx, bmap1->n_in == bmap2->n_in, goto error);
1647 isl_assert(ctx, bmap1->n_out == bmap2->n_out, goto error);
1649 bmap1 = isl_basic_map_extend(ctx, bmap1,
1650 bmap1->nparam, bmap1->n_in, bmap1->n_out,
1651 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
1654 bmap1 = add_constraints(ctx, bmap1, bmap2, 0, 0);
1656 bmap1 = isl_basic_map_simplify(ctx, bmap1);
1657 return isl_basic_map_finalize(ctx, bmap1);
1659 isl_basic_map_free(ctx, bmap1);
1660 isl_basic_map_free(ctx, bmap2);
1664 struct isl_basic_set *isl_basic_set_intersect(
1665 struct isl_ctx *ctx, struct isl_basic_set *bset1,
1666 struct isl_basic_set *bset2)
1668 return (struct isl_basic_set *)
1669 isl_basic_map_intersect(ctx,
1670 (struct isl_basic_map *)bset1,
1671 (struct isl_basic_map *)bset2);
1674 struct isl_map *isl_map_intersect(struct isl_ctx *ctx, struct isl_map *map1,
1675 struct isl_map *map2)
1678 struct isl_map *result;
1684 if (F_ISSET(map1, ISL_MAP_DISJOINT) &&
1685 F_ISSET(map2, ISL_MAP_DISJOINT))
1686 FL_SET(flags, ISL_MAP_DISJOINT);
1688 result = isl_map_alloc(ctx, map1->nparam, map1->n_in, map1->n_out,
1689 map1->n * map2->n, flags);
1692 for (i = 0; i < map1->n; ++i)
1693 for (j = 0; j < map2->n; ++j) {
1694 struct isl_basic_map *part;
1695 part = isl_basic_map_intersect(ctx,
1696 isl_basic_map_copy(ctx, map1->p[i]),
1697 isl_basic_map_copy(ctx, map2->p[j]));
1698 if (isl_basic_map_is_empty(ctx, part))
1699 isl_basic_map_free(ctx, part);
1701 result = isl_map_add(ctx, result, part);
1705 isl_map_free(ctx, map1);
1706 isl_map_free(ctx, map2);
1709 isl_map_free(ctx, map1);
1710 isl_map_free(ctx, map2);
1714 struct isl_basic_map *isl_basic_map_reverse(struct isl_ctx *ctx,
1715 struct isl_basic_map *bmap)
1717 struct isl_basic_set *bset;
1722 bmap = isl_basic_map_cow(ctx, bmap);
1726 bset = isl_basic_set_from_basic_map(ctx, bmap);
1727 bset = isl_basic_set_swap_vars(ctx, bset, in);
1728 return isl_basic_map_from_basic_set(ctx, bset, bset->dim-in, in);
1731 /* Turn final n dimensions into existentially quantified variables.
1733 struct isl_basic_set *isl_basic_set_project_out(
1734 struct isl_ctx *ctx, struct isl_basic_set *bset,
1735 unsigned n, unsigned flags)
1745 isl_assert(ctx, n <= bset->dim, goto error);
1750 bset = isl_basic_set_cow(ctx, bset);
1752 row_size = 1 + bset->nparam + bset->dim + bset->extra;
1753 old = bset->block2.data;
1754 bset->block2 = isl_blk_extend(ctx, bset->block2,
1755 (bset->extra + n) * (1 + row_size));
1756 if (!bset->block2.data)
1758 new_div = isl_alloc_array(ctx, isl_int *, bset->extra + n);
1761 for (i = 0; i < n; ++i) {
1762 new_div[i] = bset->block2.data +
1763 (bset->extra + i) * (1 + row_size);
1764 isl_seq_clr(new_div[i], 1 + row_size);
1766 for (i = 0; i < bset->extra; ++i)
1767 new_div[n + i] = bset->block2.data + (bset->div[i] - old);
1769 bset->div = new_div;
1773 bset = isl_basic_set_simplify(ctx, bset);
1774 return isl_basic_set_finalize(ctx, bset);
1776 isl_basic_set_free(ctx, bset);
1780 struct isl_basic_map *isl_basic_map_apply_range(
1781 struct isl_ctx *ctx, struct isl_basic_map *bmap1,
1782 struct isl_basic_map *bmap2)
1784 struct isl_basic_set *bset;
1785 unsigned n_in, n_out;
1787 if (!bmap1 || !bmap2)
1790 isl_assert(ctx, bmap1->n_out == bmap2->n_in, goto error);
1791 isl_assert(ctx, bmap1->nparam == bmap2->nparam, goto error);
1794 n_out = bmap2->n_out;
1796 bmap2 = isl_basic_map_reverse(ctx, bmap2);
1799 bmap1 = isl_basic_map_extend(ctx, bmap1, bmap1->nparam,
1800 bmap1->n_in + bmap2->n_in, bmap1->n_out,
1801 bmap2->extra, bmap2->n_eq, bmap2->n_ineq);
1804 bmap1 = add_constraints(ctx, bmap1, bmap2, bmap1->n_in - bmap2->n_in, 0);
1805 bmap1 = isl_basic_map_simplify(ctx, bmap1);
1806 bset = isl_basic_set_from_basic_map(ctx, bmap1);
1807 bset = isl_basic_set_project_out(ctx, bset,
1808 bset->dim - (n_in + n_out), 0);
1809 return isl_basic_map_from_basic_set(ctx, bset, n_in, n_out);
1811 isl_basic_map_free(ctx, bmap1);
1812 isl_basic_map_free(ctx, bmap2);
1816 struct isl_basic_map *isl_basic_map_apply_domain(
1817 struct isl_ctx *ctx, struct isl_basic_map *bmap1,
1818 struct isl_basic_map *bmap2)
1820 if (!bmap1 || !bmap2)
1823 isl_assert(ctx, bmap1->n_in == bmap2->n_in, goto error);
1824 isl_assert(ctx, bmap1->nparam == bmap2->nparam, goto error);
1826 bmap1 = isl_basic_map_reverse(ctx, bmap1);
1827 bmap1 = isl_basic_map_apply_range(ctx, bmap1, bmap2);
1828 return isl_basic_map_reverse(ctx, bmap1);
1830 isl_basic_map_free(ctx, bmap1);
1831 isl_basic_map_free(ctx, bmap2);
1835 static struct isl_basic_map *var_equal(struct isl_ctx *ctx,
1836 struct isl_basic_map *bmap, unsigned pos)
1839 i = isl_basic_map_alloc_equality(ctx, bmap);
1842 isl_seq_clr(bmap->eq[i],
1843 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->extra);
1844 isl_int_set_si(bmap->eq[i][1+bmap->nparam+pos], -1);
1845 isl_int_set_si(bmap->eq[i][1+bmap->nparam+bmap->n_in+pos], 1);
1846 return isl_basic_map_finalize(ctx, bmap);
1848 isl_basic_map_free(ctx, bmap);
1852 static struct isl_basic_map *var_more(struct isl_ctx *ctx,
1853 struct isl_basic_map *bmap, unsigned pos)
1856 i = isl_basic_map_alloc_inequality(ctx, bmap);
1859 isl_seq_clr(bmap->ineq[i],
1860 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->extra);
1861 isl_int_set_si(bmap->ineq[i][0], -1);
1862 isl_int_set_si(bmap->ineq[i][1+bmap->nparam+pos], -1);
1863 isl_int_set_si(bmap->ineq[i][1+bmap->nparam+bmap->n_in+pos], 1);
1864 return isl_basic_map_finalize(ctx, bmap);
1866 isl_basic_map_free(ctx, bmap);
1870 static struct isl_basic_map *var_less(struct isl_ctx *ctx,
1871 struct isl_basic_map *bmap, unsigned pos)
1874 i = isl_basic_map_alloc_inequality(ctx, bmap);
1877 isl_seq_clr(bmap->ineq[i],
1878 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->extra);
1879 isl_int_set_si(bmap->ineq[i][0], -1);
1880 isl_int_set_si(bmap->ineq[i][1+bmap->nparam+pos], 1);
1881 isl_int_set_si(bmap->ineq[i][1+bmap->nparam+bmap->n_in+pos], -1);
1882 return isl_basic_map_finalize(ctx, bmap);
1884 isl_basic_map_free(ctx, bmap);
1888 struct isl_basic_map *isl_basic_map_equal(struct isl_ctx *ctx,
1889 unsigned nparam, unsigned in, unsigned out, unsigned n_equal)
1892 struct isl_basic_map *bmap;
1893 bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, n_equal, 0);
1896 for (i = 0; i < n_equal && bmap; ++i)
1897 bmap = var_equal(ctx, bmap, i);
1898 return isl_basic_map_finalize(ctx, bmap);
1901 struct isl_basic_map *isl_basic_map_less_at(struct isl_ctx *ctx,
1902 unsigned nparam, unsigned in, unsigned out, unsigned pos)
1905 struct isl_basic_map *bmap;
1906 bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, pos, 1);
1909 for (i = 0; i < pos && bmap; ++i)
1910 bmap = var_equal(ctx, bmap, i);
1912 bmap = var_less(ctx, bmap, pos);
1913 return isl_basic_map_finalize(ctx, bmap);
1916 struct isl_basic_map *isl_basic_map_more_at(struct isl_ctx *ctx,
1917 unsigned nparam, unsigned in, unsigned out, unsigned pos)
1920 struct isl_basic_map *bmap;
1921 bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, pos, 1);
1924 for (i = 0; i < pos && bmap; ++i)
1925 bmap = var_equal(ctx, bmap, i);
1927 bmap = var_more(ctx, bmap, pos);
1928 return isl_basic_map_finalize(ctx, bmap);
1931 struct isl_basic_map *isl_basic_map_from_basic_set(
1932 struct isl_ctx *ctx, struct isl_basic_set *bset,
1933 unsigned n_in, unsigned n_out)
1935 struct isl_basic_map *bmap;
1937 bset = isl_basic_set_cow(ctx, bset);
1941 isl_assert(ctx, bset->dim == n_in + n_out, goto error);
1942 bmap = (struct isl_basic_map *) bset;
1944 bmap->n_out = n_out;
1945 return isl_basic_map_finalize(ctx, bmap);
1947 isl_basic_set_free(ctx, bset);
1951 struct isl_basic_set *isl_basic_set_from_basic_map(
1952 struct isl_ctx *ctx, struct isl_basic_map *bmap)
1956 if (bmap->n_in == 0)
1957 return (struct isl_basic_set *)bmap;
1958 bmap = isl_basic_map_cow(ctx, bmap);
1961 bmap->n_out += bmap->n_in;
1963 bmap = isl_basic_map_finalize(ctx, bmap);
1964 return (struct isl_basic_set *)bmap;
1969 /* For a div d = floor(f/m), add the constraints
1972 * -(f-(n-1)) + m d >= 0
1974 * Note that the second constraint is the negation of
1978 static int add_div_constraints(struct isl_ctx *ctx,
1979 struct isl_basic_map *bmap, unsigned div)
1982 unsigned div_pos = 1 + bmap->nparam + bmap->n_in + bmap->n_out + div;
1983 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->extra;
1985 i = isl_basic_map_alloc_inequality(ctx, bmap);
1988 isl_seq_cpy(bmap->ineq[i], bmap->div[div]+1, 1+total);
1989 isl_int_neg(bmap->ineq[i][div_pos], bmap->div[div][0]);
1991 j = isl_basic_map_alloc_inequality(ctx, bmap);
1994 isl_seq_neg(bmap->ineq[j], bmap->ineq[i], 1 + total);
1995 isl_int_add(bmap->ineq[j][0], bmap->ineq[j][0], bmap->ineq[j][div_pos]);
1996 isl_int_sub_ui(bmap->ineq[j][0], bmap->ineq[j][0], 1);
2000 struct isl_basic_set *isl_basic_map_underlying_set(
2001 struct isl_ctx *ctx, struct isl_basic_map *bmap)
2005 if (bmap->nparam == 0 && bmap->n_in == 0 && bmap->n_div == 0)
2006 return (struct isl_basic_set *)bmap;
2007 bmap = isl_basic_map_cow(ctx, bmap);
2010 bmap->n_out += bmap->nparam + bmap->n_in + bmap->n_div;
2013 bmap->extra -= bmap->n_div;
2015 bmap = isl_basic_map_finalize(ctx, bmap);
2016 return (struct isl_basic_set *)bmap;
2021 struct isl_basic_map *isl_basic_map_overlying_set(
2022 struct isl_ctx *ctx, struct isl_basic_set *bset,
2023 struct isl_basic_map *like)
2025 struct isl_basic_map *bmap;
2031 isl_assert(ctx, bset->dim ==
2032 like->nparam + like->n_in + like->n_out + like->n_div,
2034 if (like->nparam == 0 && like->n_in == 0 && like->n_div == 0) {
2035 isl_basic_map_free(ctx, like);
2036 return (struct isl_basic_map *)bset;
2038 bset = isl_basic_set_cow(ctx, bset);
2039 total = bset->dim + bset->extra;
2042 bmap = (struct isl_basic_map *)bset;
2043 bmap->nparam = like->nparam;
2044 bmap->n_in = like->n_in;
2045 bmap->n_out = like->n_out;
2046 bmap->extra += like->n_div;
2049 ltotal = total - bmap->extra + like->extra;
2052 bmap->block2 = isl_blk_extend(ctx, bmap->block2,
2053 bmap->extra * (1 + 1 + total));
2054 if (isl_blk_is_error(bmap->block2))
2056 bmap->div = isl_realloc_array(ctx, bmap->div, isl_int *,
2060 bmap = isl_basic_map_extend(ctx, bmap, bmap->nparam,
2061 bmap->n_in, bmap->n_out, 0, 0, 2 * like->n_div);
2062 for (i = 0; i < like->n_div; ++i) {
2063 k = isl_basic_map_alloc_div(ctx, bmap);
2066 isl_seq_cpy(bmap->div[k], like->div[i], 1 + 1 + ltotal);
2067 isl_seq_clr(bmap->div[k]+1+1+ltotal, total - ltotal);
2068 if (add_div_constraints(ctx, bmap, k) < 0)
2072 isl_basic_map_free(ctx, like);
2073 bmap = isl_basic_map_finalize(ctx, bmap);
2076 isl_basic_map_free(ctx, like);
2077 isl_basic_set_free(ctx, bset);
2081 struct isl_set *isl_map_underlying_set(struct isl_ctx *ctx, struct isl_map *map)
2085 map = isl_map_align_divs(ctx, map);
2086 map = isl_map_cow(ctx, map);
2090 for (i = 0; i < map->n; ++i) {
2091 map->p[i] = (struct isl_basic_map *)
2092 isl_basic_map_underlying_set(ctx, map->p[i]);
2097 map->n_out += map->nparam + map->n_in;
2099 map->n_out = map->p[0]->n_out;
2102 return (struct isl_set *)map;
2104 isl_map_free(ctx, map);
2108 struct isl_basic_set *isl_basic_map_domain(struct isl_ctx *ctx,
2109 struct isl_basic_map *bmap)
2111 struct isl_basic_set *domain;
2115 n_out = bmap->n_out;
2116 domain = isl_basic_set_from_basic_map(ctx, bmap);
2117 return isl_basic_set_project_out(ctx, domain, n_out, 0);
2120 struct isl_basic_set *isl_basic_map_range(struct isl_ctx *ctx,
2121 struct isl_basic_map *bmap)
2123 return isl_basic_map_domain(ctx,
2124 isl_basic_map_reverse(ctx, bmap));
2127 struct isl_set *isl_map_range(struct isl_ctx *ctx, struct isl_map *map)
2130 struct isl_set *set;
2134 map = isl_map_cow(ctx, map);
2138 set = (struct isl_set *) map;
2140 for (i = 0; i < map->n; ++i) {
2141 set->p[i] = isl_basic_map_range(ctx, map->p[i]);
2145 F_CLR(set, ISL_MAP_DISJOINT);
2148 isl_map_free(ctx, map);
2152 struct isl_map *isl_map_from_set(
2153 struct isl_ctx *ctx, struct isl_set *set,
2154 unsigned n_in, unsigned n_out)
2157 struct isl_map *map = NULL;
2161 isl_assert(ctx, set->dim == n_in + n_out, goto error);
2162 set = isl_set_cow(ctx, set);
2165 map = (struct isl_map *)set;
2166 for (i = 0; i < set->n; ++i) {
2167 map->p[i] = isl_basic_map_from_basic_set(ctx,
2168 set->p[i], n_in, n_out);
2176 isl_set_free(ctx, set);
2180 struct isl_map *isl_map_alloc(struct isl_ctx *ctx,
2181 unsigned nparam, unsigned in, unsigned out, int n,
2184 struct isl_map *map;
2186 map = isl_alloc(ctx, struct isl_map,
2187 sizeof(struct isl_map) +
2188 n * sizeof(struct isl_basic_map *));
2195 map->nparam = nparam;
2202 struct isl_basic_map *isl_basic_map_empty(struct isl_ctx *ctx,
2203 unsigned nparam, unsigned in, unsigned out)
2205 struct isl_basic_map *bmap;
2206 bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, 1, 0);
2207 bmap = isl_basic_map_set_to_empty(ctx, bmap);
2211 struct isl_basic_set *isl_basic_set_empty(struct isl_ctx *ctx,
2212 unsigned nparam, unsigned dim)
2214 struct isl_basic_set *bset;
2215 bset = isl_basic_set_alloc(ctx, nparam, dim, 0, 1, 0);
2216 bset = isl_basic_set_set_to_empty(ctx, bset);
2220 struct isl_basic_map *isl_basic_map_universe(struct isl_ctx *ctx,
2221 unsigned nparam, unsigned in, unsigned out)
2223 struct isl_basic_map *bmap;
2224 bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, 0, 0);
2228 struct isl_basic_set *isl_basic_set_universe(struct isl_ctx *ctx,
2229 unsigned nparam, unsigned dim)
2231 struct isl_basic_set *bset;
2232 bset = isl_basic_set_alloc(ctx, nparam, dim, 0, 0, 0);
2236 struct isl_map *isl_map_empty(struct isl_ctx *ctx,
2237 unsigned nparam, unsigned in, unsigned out)
2239 return isl_map_alloc(ctx, nparam, in, out, 0, ISL_MAP_DISJOINT);
2242 struct isl_set *isl_set_empty(struct isl_ctx *ctx,
2243 unsigned nparam, unsigned dim)
2245 return isl_set_alloc(ctx, nparam, dim, 0, ISL_MAP_DISJOINT);
2248 struct isl_map *isl_map_dup(struct isl_ctx *ctx, struct isl_map *map)
2251 struct isl_map *dup;
2253 dup = isl_map_alloc(ctx, map->nparam, map->n_in, map->n_out, map->n,
2255 for (i = 0; i < map->n; ++i)
2256 dup = isl_map_add(ctx, dup,
2257 isl_basic_map_dup(ctx, map->p[i]));
2261 struct isl_map *isl_map_add(struct isl_ctx *ctx, struct isl_map *map,
2262 struct isl_basic_map *bmap)
2266 isl_assert(ctx, map->nparam == bmap->nparam, goto error);
2267 isl_assert(ctx, map->n_in == bmap->n_in, goto error);
2268 isl_assert(ctx, map->n_out == bmap->n_out, goto error);
2269 isl_assert(ctx, map->n < map->size, goto error);
2270 map->p[map->n] = bmap;
2275 isl_map_free(ctx, map);
2277 isl_basic_map_free(ctx, bmap);
2281 void isl_map_free(struct isl_ctx *ctx, struct isl_map *map)
2291 for (i = 0; i < map->n; ++i)
2292 isl_basic_map_free(ctx, map->p[i]);
2296 struct isl_map *isl_map_extend(struct isl_ctx *ctx, struct isl_map *base,
2297 unsigned nparam, unsigned n_in, unsigned n_out)
2301 base = isl_map_cow(ctx, base);
2305 isl_assert(ctx, base->nparam <= nparam, goto error);
2306 isl_assert(ctx, base->n_in <= n_in, goto error);
2307 isl_assert(ctx, base->n_out <= n_out, goto error);
2308 base->nparam = nparam;
2310 base->n_out = n_out;
2311 for (i = 0; i < base->n; ++i) {
2312 base->p[i] = isl_basic_map_extend(ctx, base->p[i],
2313 nparam, n_in, n_out, 0, 0, 0);
2319 isl_map_free(ctx, base);
2323 static struct isl_basic_map *isl_basic_map_fix_var(struct isl_ctx *ctx,
2324 struct isl_basic_map *bmap,
2325 unsigned var, int value)
2329 bmap = isl_basic_map_cow(ctx, bmap);
2330 bmap = isl_basic_map_extend(ctx, bmap,
2331 bmap->nparam, bmap->n_in, bmap->n_out, 0, 1, 0);
2332 j = isl_basic_map_alloc_equality(ctx, bmap);
2335 isl_seq_clr(bmap->eq[j],
2336 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->extra);
2337 isl_int_set_si(bmap->eq[j][1 + var], -1);
2338 isl_int_set_si(bmap->eq[j][0], value);
2339 bmap = isl_basic_map_simplify(ctx, bmap);
2340 return isl_basic_map_finalize(ctx, bmap);
2342 isl_basic_map_free(ctx, bmap);
2346 struct isl_basic_map *isl_basic_map_fix_input_si(struct isl_ctx *ctx,
2347 struct isl_basic_map *bmap,
2348 unsigned input, int value)
2352 isl_assert(ctx, input < bmap->n_in, goto error);
2353 return isl_basic_map_fix_var(ctx, bmap, bmap->nparam + input, value);
2355 isl_basic_map_free(ctx, bmap);
2359 struct isl_basic_set *isl_basic_set_fix_dim_si(struct isl_ctx *ctx,
2360 struct isl_basic_set *bset,
2361 unsigned dim, int value)
2365 isl_assert(ctx, dim < bset->dim, goto error);
2366 return (struct isl_basic_set *)
2367 isl_basic_map_fix_var(ctx, (struct isl_basic_map *)bset,
2368 bset->nparam + dim, value);
2370 isl_basic_set_free(ctx, bset);
2374 struct isl_map *isl_map_fix_input_si(struct isl_ctx *ctx, struct isl_map *map,
2375 unsigned input, int value)
2379 map = isl_map_cow(ctx, map);
2383 isl_assert(ctx, input < map->n_in, goto error);
2384 for (i = 0; i < map->n; ++i) {
2385 map->p[i] = isl_basic_map_fix_input_si(ctx, map->p[i],
2392 isl_map_free(ctx, map);
2396 struct isl_set *isl_set_fix_dim_si(struct isl_ctx *ctx, struct isl_set *set,
2397 unsigned dim, int value)
2401 set = isl_set_cow(ctx, set);
2405 isl_assert(ctx, dim < set->dim, goto error);
2406 for (i = 0; i < set->n; ++i) {
2407 set->p[i] = isl_basic_set_fix_dim_si(ctx, set->p[i],
2414 isl_set_free(ctx, set);
2418 struct isl_map *isl_map_reverse(struct isl_ctx *ctx, struct isl_map *map)
2423 map = isl_map_cow(ctx, map);
2428 map->n_in = map->n_out;
2430 for (i = 0; i < map->n; ++i) {
2431 map->p[i] = isl_basic_map_reverse(ctx, map->p[i]);
2437 isl_map_free(ctx, map);
2441 struct isl_map *isl_basic_map_lexmax(struct isl_ctx *ctx,
2442 struct isl_basic_map *bmap, struct isl_basic_set *dom,
2443 struct isl_set **empty)
2445 return isl_pip_basic_map_lexmax(ctx, bmap, dom, empty);
2448 struct isl_map *isl_basic_map_lexmin(struct isl_ctx *ctx,
2449 struct isl_basic_map *bmap, struct isl_basic_set *dom,
2450 struct isl_set **empty)
2452 return isl_pip_basic_map_lexmin(ctx, bmap, dom, empty);
2455 struct isl_set *isl_basic_set_lexmin(struct isl_ctx *ctx,
2456 struct isl_basic_set *bset)
2458 struct isl_basic_map *bmap = NULL;
2459 struct isl_basic_set *dom = NULL;
2460 struct isl_map *min;
2464 bmap = isl_basic_map_from_basic_set(ctx, bset, 0, bset->dim);
2467 dom = isl_basic_set_alloc(ctx, bmap->nparam, 0, 0, 0, 0);
2470 min = isl_basic_map_lexmin(ctx, bmap, dom, NULL);
2471 return isl_map_range(ctx, min);
2473 isl_basic_map_free(ctx, bmap);
2477 struct isl_map *isl_basic_map_compute_divs(struct isl_ctx *ctx,
2478 struct isl_basic_map *bmap)
2482 if (bmap->n_div == 0)
2483 return isl_map_from_basic_map(ctx, bmap);
2484 return isl_pip_basic_map_compute_divs(ctx, bmap);
2487 struct isl_map *isl_map_compute_divs(struct isl_ctx *ctx, struct isl_map *map)
2490 struct isl_map *res;
2496 res = isl_basic_map_compute_divs(ctx,
2497 isl_basic_map_copy(ctx, map->p[0]));
2498 for (i = 1 ; i < map->n; ++i) {
2500 r2 = isl_basic_map_compute_divs(ctx,
2501 isl_basic_map_copy(ctx, map->p[i]));
2502 if (F_ISSET(map, ISL_MAP_DISJOINT))
2503 res = isl_map_union_disjoint(ctx, res, r2);
2505 res = isl_map_union(ctx, res, r2);
2507 isl_map_free(ctx, map);
2512 struct isl_set *isl_basic_set_compute_divs(struct isl_ctx *ctx,
2513 struct isl_basic_set *bset)
2515 return (struct isl_set *)
2516 isl_basic_map_compute_divs(ctx,
2517 (struct isl_basic_map *)bset);
2520 struct isl_set *isl_set_compute_divs(struct isl_ctx *ctx,
2521 struct isl_set *set)
2523 return (struct isl_set *)
2524 isl_map_compute_divs(ctx, (struct isl_map *)set);
2527 struct isl_set *isl_map_domain(struct isl_ctx *ctx, struct isl_map *map)
2530 struct isl_set *set;
2535 map = isl_map_cow(ctx, map);
2539 set = (struct isl_set *)map;
2540 set->dim = map->n_in;
2542 for (i = 0; i < map->n; ++i) {
2543 set->p[i] = isl_basic_map_domain(ctx, map->p[i]);
2547 F_CLR(set, ISL_MAP_DISJOINT);
2550 isl_map_free(ctx, map);
2554 struct isl_map *isl_map_union_disjoint(struct isl_ctx *ctx,
2555 struct isl_map *map1, struct isl_map *map2)
2559 struct isl_map *map = NULL;
2565 isl_map_free(ctx, map1);
2569 isl_map_free(ctx, map2);
2573 isl_assert(ctx, map1->nparam == map2->nparam, goto error);
2574 isl_assert(ctx, map1->n_in == map2->n_in, goto error);
2575 isl_assert(ctx, map1->n_out == map2->n_out, goto error);
2577 if (F_ISSET(map1, ISL_MAP_DISJOINT) &&
2578 F_ISSET(map2, ISL_MAP_DISJOINT))
2579 FL_SET(flags, ISL_MAP_DISJOINT);
2581 map = isl_map_alloc(ctx, map1->nparam, map1->n_in, map1->n_out,
2582 map1->n + map2->n, flags);
2585 for (i = 0; i < map1->n; ++i) {
2586 map = isl_map_add(ctx, map,
2587 isl_basic_map_copy(ctx, map1->p[i]));
2591 for (i = 0; i < map2->n; ++i) {
2592 map = isl_map_add(ctx, map,
2593 isl_basic_map_copy(ctx, map2->p[i]));
2597 isl_map_free(ctx, map1);
2598 isl_map_free(ctx, map2);
2601 isl_map_free(ctx, map);
2602 isl_map_free(ctx, map1);
2603 isl_map_free(ctx, map2);
2607 struct isl_map *isl_map_union(struct isl_ctx *ctx,
2608 struct isl_map *map1, struct isl_map *map2)
2610 map1 = isl_map_union_disjoint(ctx, map1, map2);
2614 F_CLR(map1, ISL_MAP_DISJOINT);
2618 struct isl_set *isl_set_union_disjoint(struct isl_ctx *ctx,
2619 struct isl_set *set1, struct isl_set *set2)
2621 return (struct isl_set *)
2622 isl_map_union_disjoint(ctx,
2623 (struct isl_map *)set1, (struct isl_map *)set2);
2626 struct isl_set *isl_set_union(struct isl_ctx *ctx,
2627 struct isl_set *set1, struct isl_set *set2)
2629 return (struct isl_set *)
2631 (struct isl_map *)set1, (struct isl_map *)set2);
2634 struct isl_map *isl_map_intersect_range(
2635 struct isl_ctx *ctx, struct isl_map *map,
2636 struct isl_set *set)
2639 struct isl_map *result;
2645 if (F_ISSET(map, ISL_MAP_DISJOINT) &&
2646 F_ISSET(set, ISL_MAP_DISJOINT))
2647 FL_SET(flags, ISL_MAP_DISJOINT);
2649 result = isl_map_alloc(ctx, map->nparam, map->n_in, map->n_out,
2650 map->n * set->n, flags);
2653 for (i = 0; i < map->n; ++i)
2654 for (j = 0; j < set->n; ++j) {
2655 result = isl_map_add(ctx, result,
2656 isl_basic_map_intersect_range(ctx,
2657 isl_basic_map_copy(ctx, map->p[i]),
2658 isl_basic_set_copy(ctx, set->p[j])));
2662 isl_map_free(ctx, map);
2663 isl_set_free(ctx, set);
2666 isl_map_free(ctx, map);
2667 isl_set_free(ctx, set);
2671 struct isl_map *isl_map_intersect_domain(
2672 struct isl_ctx *ctx, struct isl_map *map,
2673 struct isl_set *set)
2675 return isl_map_reverse(ctx,
2676 isl_map_intersect_range(ctx, isl_map_reverse(ctx, map), set));
2679 struct isl_map *isl_map_apply_domain(
2680 struct isl_ctx *ctx, struct isl_map *map1,
2681 struct isl_map *map2)
2685 map1 = isl_map_reverse(ctx, map1);
2686 map1 = isl_map_apply_range(ctx, map1, map2);
2687 return isl_map_reverse(ctx, map1);
2689 isl_map_free(ctx, map1);
2690 isl_map_free(ctx, map2);
2694 struct isl_map *isl_map_apply_range(
2695 struct isl_ctx *ctx, struct isl_map *map1,
2696 struct isl_map *map2)
2698 struct isl_map *result;
2704 isl_assert(ctx, map1->nparam == map2->nparam, goto error);
2705 isl_assert(ctx, map1->n_out == map2->n_in, goto error);
2707 result = isl_map_alloc(ctx, map1->nparam, map1->n_in, map2->n_out,
2708 map1->n * map2->n, 0);
2711 for (i = 0; i < map1->n; ++i)
2712 for (j = 0; j < map2->n; ++j) {
2713 result = isl_map_add(ctx, result,
2714 isl_basic_map_apply_range(ctx,
2715 isl_basic_map_copy(ctx, map1->p[i]),
2716 isl_basic_map_copy(ctx, map2->p[j])));
2720 isl_map_free(ctx, map1);
2721 isl_map_free(ctx, map2);
2722 if (result && result->n <= 1)
2723 F_SET(result, ISL_MAP_DISJOINT);
2726 isl_map_free(ctx, map1);
2727 isl_map_free(ctx, map2);
2732 * returns range - domain
2734 struct isl_basic_set *isl_basic_map_deltas(struct isl_ctx *ctx,
2735 struct isl_basic_map *bmap)
2737 struct isl_basic_set *bset;
2743 isl_assert(ctx, bmap->n_in == bmap->n_out, goto error);
2745 bset = isl_basic_set_from_basic_map(ctx, bmap);
2746 bset = isl_basic_set_extend(ctx, bset, bset->nparam, 3*dim, 0,
2748 bset = isl_basic_set_swap_vars(ctx, bset, 2*dim);
2749 for (i = 0; i < dim; ++i) {
2750 int j = isl_basic_map_alloc_equality(ctx,
2751 (struct isl_basic_map *)bset);
2754 isl_seq_clr(bset->eq[j],
2755 1 + bset->nparam + bset->dim + bset->extra);
2756 isl_int_set_si(bset->eq[j][1+bset->nparam+i], 1);
2757 isl_int_set_si(bset->eq[j][1+bset->nparam+dim+i], 1);
2758 isl_int_set_si(bset->eq[j][1+bset->nparam+2*dim+i], -1);
2760 return isl_basic_set_project_out(ctx, bset, 2*dim, 0);
2762 isl_basic_map_free(ctx, bmap);
2766 /* If the only constraints a div d=floor(f/m)
2767 * appears in are its two defining constraints
2770 * -(f - (m - 1)) + m d >= 0
2772 * then it can safely be removed.
2774 static int div_is_redundant(struct isl_ctx *ctx, struct isl_basic_map *bmap,
2778 unsigned pos = 1 + bmap->nparam + bmap->n_in + bmap->n_out + div;
2780 for (i = 0; i < bmap->n_eq; ++i)
2781 if (!isl_int_is_zero(bmap->eq[i][pos]))
2784 for (i = 0; i < bmap->n_ineq; ++i) {
2785 if (isl_int_is_zero(bmap->ineq[i][pos]))
2787 if (isl_int_eq(bmap->ineq[i][pos], bmap->div[div][0])) {
2789 isl_int_sub(bmap->div[div][1],
2790 bmap->div[div][1], bmap->div[div][0]);
2791 isl_int_add_ui(bmap->div[div][1], bmap->div[div][1], 1);
2792 neg = isl_seq_is_neg(bmap->ineq[i], bmap->div[div]+1, pos);
2793 isl_int_sub_ui(bmap->div[div][1], bmap->div[div][1], 1);
2794 isl_int_add(bmap->div[div][1],
2795 bmap->div[div][1], bmap->div[div][0]);
2798 if (isl_seq_first_non_zero(bmap->ineq[i]+pos+1,
2799 bmap->n_div-div-1) != -1)
2801 } else if (isl_int_abs_eq(bmap->ineq[i][pos], bmap->div[div][0])) {
2802 if (!isl_seq_eq(bmap->ineq[i], bmap->div[div]+1, pos))
2804 if (isl_seq_first_non_zero(bmap->ineq[i]+pos+1,
2805 bmap->n_div-div-1) != -1)
2811 for (i = 0; i < bmap->n_div; ++i)
2812 if (!isl_int_is_zero(bmap->div[i][1+pos]))
2819 * Remove divs that don't occur in any of the constraints or other divs.
2820 * These can arise when dropping some of the variables in a quast
2821 * returned by piplib.
2823 static struct isl_basic_map *remove_redundant_divs(struct isl_ctx *ctx,
2824 struct isl_basic_map *bmap)
2831 for (i = bmap->n_div-1; i >= 0; --i) {
2832 if (!div_is_redundant(ctx, bmap, i))
2834 bmap = isl_basic_map_drop_div(ctx, bmap, i);
2839 struct isl_basic_map *isl_basic_map_finalize(struct isl_ctx *ctx,
2840 struct isl_basic_map *bmap)
2842 bmap = remove_redundant_divs(ctx, bmap);
2845 F_SET(bmap, ISL_BASIC_SET_FINAL);
2849 struct isl_basic_set *isl_basic_set_finalize(struct isl_ctx *ctx,
2850 struct isl_basic_set *bset)
2852 return (struct isl_basic_set *)
2853 isl_basic_map_finalize(ctx,
2854 (struct isl_basic_map *)bset);
2857 struct isl_set *isl_set_finalize(struct isl_ctx *ctx, struct isl_set *set)
2863 for (i = 0; i < set->n; ++i) {
2864 set->p[i] = isl_basic_set_finalize(ctx, set->p[i]);
2870 isl_set_free(ctx, set);
2874 struct isl_map *isl_map_finalize(struct isl_ctx *ctx, struct isl_map *map)
2880 for (i = 0; i < map->n; ++i) {
2881 map->p[i] = isl_basic_map_finalize(ctx, map->p[i]);
2887 isl_map_free(ctx, map);
2891 struct isl_basic_map *isl_basic_map_identity(struct isl_ctx *ctx,
2892 unsigned nparam, unsigned dim)
2894 struct isl_basic_map *bmap;
2897 bmap = isl_basic_map_alloc(ctx, nparam, dim, dim, 0, dim, 0);
2901 for (i = 0; i < dim; ++i) {
2902 int j = isl_basic_map_alloc_equality(ctx, bmap);
2905 isl_seq_clr(bmap->eq[j],
2906 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->extra);
2907 isl_int_set_si(bmap->eq[j][1+nparam+i], 1);
2908 isl_int_set_si(bmap->eq[j][1+nparam+dim+i], -1);
2910 return isl_basic_map_finalize(ctx, bmap);
2912 isl_basic_map_free(ctx, bmap);
2916 struct isl_map *isl_map_identity(struct isl_ctx *ctx,
2917 unsigned nparam, unsigned dim)
2919 struct isl_map *map = isl_map_alloc(ctx, nparam, dim, dim, 1,
2923 map = isl_map_add(ctx, map,
2924 isl_basic_map_identity(ctx, nparam, dim));
2927 isl_map_free(ctx, map);
2931 int isl_set_is_equal(struct isl_ctx *ctx,
2932 struct isl_set *set1, struct isl_set *set2)
2934 return isl_map_is_equal(ctx,
2935 (struct isl_map *)set1, (struct isl_map *)set2);
2938 int isl_set_is_subset(struct isl_ctx *ctx,
2939 struct isl_set *set1, struct isl_set *set2)
2941 return isl_map_is_subset(ctx,
2942 (struct isl_map *)set1, (struct isl_map *)set2);
2945 int isl_basic_map_is_subset(struct isl_ctx *ctx,
2946 struct isl_basic_map *bmap1,
2947 struct isl_basic_map *bmap2)
2950 struct isl_map *map1;
2951 struct isl_map *map2;
2953 if (!bmap1 || !bmap2)
2956 map1 = isl_map_from_basic_map(ctx,
2957 isl_basic_map_copy(ctx, bmap1));
2958 map2 = isl_map_from_basic_map(ctx,
2959 isl_basic_map_copy(ctx, bmap2));
2961 is_subset = isl_map_is_subset(ctx, map1, map2);
2963 isl_map_free(ctx, map1);
2964 isl_map_free(ctx, map2);
2969 int isl_basic_map_is_equal(struct isl_ctx *ctx,
2970 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2974 if (!bmap1 || !bmap2)
2976 is_subset = isl_basic_map_is_subset(ctx, bmap1, bmap2);
2979 is_subset = isl_basic_map_is_subset(ctx, bmap2, bmap1);
2983 int isl_basic_set_is_equal(struct isl_ctx *ctx,
2984 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
2986 return isl_basic_map_is_equal(ctx,
2987 (struct isl_basic_map *)bset1, (struct isl_basic_map *)bset2);
2990 int isl_map_is_empty(struct isl_ctx *ctx, struct isl_map *map)
2997 for (i = 0; i < map->n; ++i) {
2998 is_empty = isl_basic_map_is_empty(ctx, map->p[i]);
3007 int isl_set_is_empty(struct isl_ctx *ctx, struct isl_set *set)
3009 return isl_map_is_empty(ctx, (struct isl_map *)set);
3012 int isl_map_is_subset(struct isl_ctx *ctx, struct isl_map *map1,
3013 struct isl_map *map2)
3017 struct isl_map *diff;
3022 if (isl_map_is_empty(ctx, map1))
3025 if (isl_map_is_empty(ctx, map2))
3028 diff = isl_map_subtract(ctx, isl_map_copy(ctx, map1),
3029 isl_map_copy(ctx, map2));
3033 is_subset = isl_map_is_empty(ctx, diff);
3034 isl_map_free(ctx, diff);
3039 int isl_map_is_equal(struct isl_ctx *ctx,
3040 struct isl_map *map1, struct isl_map *map2)
3046 is_subset = isl_map_is_subset(ctx, map1, map2);
3049 is_subset = isl_map_is_subset(ctx, map2, map1);
3053 int isl_basic_map_is_strict_subset(struct isl_ctx *ctx,
3054 struct isl_basic_map *bmap1,
3055 struct isl_basic_map *bmap2)
3059 if (!bmap1 || !bmap2)
3061 is_subset = isl_basic_map_is_subset(ctx, bmap1, bmap2);
3064 is_subset = isl_basic_map_is_subset(ctx, bmap2, bmap1);
3065 if (is_subset == -1)
3070 static int basic_map_contains(struct isl_ctx *ctx, struct isl_basic_map *bmap,
3071 struct isl_vec *vec)
3077 total = 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
3078 if (total != vec->size)
3083 for (i = 0; i < bmap->n_eq; ++i) {
3084 isl_seq_inner_product(vec->block.data, bmap->eq[i], total, &s);
3085 if (!isl_int_is_zero(s)) {
3091 for (i = 0; i < bmap->n_ineq; ++i) {
3092 isl_seq_inner_product(vec->block.data, bmap->ineq[i], total, &s);
3093 if (isl_int_is_neg(s)) {
3104 int isl_basic_map_is_universe(struct isl_ctx *ctx,
3105 struct isl_basic_map *bmap)
3109 return bmap->n_eq == 0 && bmap->n_ineq == 0;
3112 int isl_basic_map_is_empty(struct isl_ctx *ctx,
3113 struct isl_basic_map *bmap)
3115 struct isl_basic_set *bset = NULL;
3116 struct isl_vec *sample = NULL;
3123 if (F_ISSET(bmap, ISL_BASIC_MAP_EMPTY))
3126 total = 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
3127 if (bmap->sample && bmap->sample->size == total) {
3128 int contains = basic_map_contains(ctx, bmap, bmap->sample);
3134 bset = isl_basic_map_underlying_set(ctx,
3135 isl_basic_map_copy(ctx, bmap));
3138 sample = isl_basic_set_sample(ctx, bset);
3141 empty = sample->size == 0;
3143 isl_vec_free(ctx, bmap->sample);
3144 bmap->sample = sample;
3149 struct isl_map *isl_basic_map_union(
3150 struct isl_ctx *ctx, struct isl_basic_map *bmap1,
3151 struct isl_basic_map *bmap2)
3153 struct isl_map *map;
3154 if (!bmap1 || !bmap2)
3157 isl_assert(ctx, bmap1->nparam == bmap2->nparam, goto error);
3158 isl_assert(ctx, bmap1->n_in == bmap2->n_in, goto error);
3159 isl_assert(ctx, bmap1->n_out == bmap2->n_out, goto error);
3161 map = isl_map_alloc(ctx, bmap1->nparam,
3162 bmap1->n_in, bmap1->n_out, 2, 0);
3165 map = isl_map_add(ctx, map, bmap1);
3166 map = isl_map_add(ctx, map, bmap2);
3169 isl_basic_map_free(ctx, bmap1);
3170 isl_basic_map_free(ctx, bmap2);
3174 struct isl_set *isl_basic_set_union(
3175 struct isl_ctx *ctx, struct isl_basic_set *bset1,
3176 struct isl_basic_set *bset2)
3178 return (struct isl_set *)isl_basic_map_union(ctx,
3179 (struct isl_basic_map *)bset1,
3180 (struct isl_basic_map *)bset2);
3183 /* Order divs such that any div only depends on previous divs */
3184 static struct isl_basic_map *order_divs(struct isl_ctx *ctx,
3185 struct isl_basic_map *bmap)
3188 unsigned off = bmap->nparam + bmap->n_in + bmap->n_out;
3190 for (i = 0; i < bmap->n_div; ++i) {
3192 pos = isl_seq_first_non_zero(bmap->div[i]+1+1+off+i,
3196 swap_div(bmap, i, pos);
3202 static int find_div(struct isl_basic_map *dst,
3203 struct isl_basic_map *src, unsigned div)
3207 unsigned total = src->nparam + src->n_in + src->n_out + src->n_div;
3209 for (i = 0; i < dst->n_div; ++i)
3210 if (isl_seq_eq(dst->div[i], src->div[div], 1+1+total) &&
3211 isl_seq_first_non_zero(dst->div[i]+1+1+total,
3212 dst->n_div - src->n_div) == -1)
3217 struct isl_basic_map *isl_basic_map_align_divs(struct isl_ctx *ctx,
3218 struct isl_basic_map *dst, struct isl_basic_map *src)
3221 unsigned total = src->nparam + src->n_in + src->n_out + src->n_div;
3223 if (src->n_div == 0)
3226 src = order_divs(ctx, src);
3227 dst = isl_basic_map_extend(ctx, dst, dst->nparam, dst->n_in,
3228 dst->n_out, src->n_div, 0, 2 * src->n_div);
3231 for (i = 0; i < src->n_div; ++i) {
3232 int j = find_div(dst, src, i);
3234 j = isl_basic_map_alloc_div(ctx, dst);
3237 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total);
3238 isl_seq_clr(dst->div[j]+1+1+total,
3239 dst->extra - src->n_div);
3240 if (add_div_constraints(ctx, dst, j) < 0)
3244 swap_div(dst, i, j);
3248 isl_basic_map_free(ctx, dst);
3252 struct isl_map *isl_map_align_divs(struct isl_ctx *ctx, struct isl_map *map)
3256 map = isl_map_compute_divs(ctx, map);
3257 map = isl_map_cow(ctx, map);
3261 for (i = 1; i < map->n; ++i)
3262 map->p[0] = isl_basic_map_align_divs(ctx, map->p[0], map->p[i]);
3263 for (i = 1; i < map->n; ++i)
3264 map->p[i] = isl_basic_map_align_divs(ctx, map->p[i], map->p[0]);
3269 static struct isl_map *add_cut_constraint(struct isl_ctx *ctx,
3270 struct isl_map *dst,
3271 struct isl_basic_map *src, isl_int *c,
3272 unsigned len, int oppose)
3274 struct isl_basic_map *copy = NULL;
3279 copy = isl_basic_map_copy(ctx, src);
3280 copy = isl_basic_map_cow(ctx, copy);
3283 copy = isl_basic_map_extend(ctx, copy,
3284 copy->nparam, copy->n_in, copy->n_out, 0, 0, 1);
3285 k = isl_basic_map_alloc_inequality(ctx, copy);
3289 isl_seq_neg(copy->ineq[k], c, len);
3291 isl_seq_cpy(copy->ineq[k], c, len);
3292 total = 1 + copy->nparam + copy->n_in + copy->n_out + copy->extra;
3293 isl_seq_clr(copy->ineq[k]+len, total - len);
3294 isl_inequality_negate(ctx, copy, k);
3295 copy = isl_basic_map_simplify(ctx, copy);
3296 copy = isl_basic_map_finalize(ctx, copy);
3297 is_empty = isl_basic_map_is_empty(ctx, copy);
3301 dst = isl_map_add(ctx, dst, copy);
3303 isl_basic_map_free(ctx, copy);
3306 isl_basic_map_free(ctx, copy);
3307 isl_map_free(ctx, dst);
3311 static struct isl_map *subtract(struct isl_ctx *ctx, struct isl_map *map,
3312 struct isl_basic_map *bmap)
3316 struct isl_map *rest = NULL;
3318 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
3325 if (F_ISSET(map, ISL_MAP_DISJOINT))
3326 FL_SET(flags, ISL_MAP_DISJOINT);
3328 max = map->n * (2 * bmap->n_eq + bmap->n_ineq);
3329 rest = isl_map_alloc(ctx, map->nparam, map->n_in, map->n_out,
3334 for (i = 0; i < map->n; ++i) {
3335 map->p[i] = isl_basic_map_align_divs(ctx, map->p[i], bmap);
3340 for (j = 0; j < map->n; ++j)
3341 map->p[j] = isl_basic_map_cow(ctx, map->p[j]);
3343 for (i = 0; i < bmap->n_eq; ++i) {
3344 for (j = 0; j < map->n; ++j) {
3345 rest = add_cut_constraint(ctx, rest,
3346 map->p[j], bmap->eq[i], 1+total, 0);
3350 rest = add_cut_constraint(ctx, rest,
3351 map->p[j], bmap->eq[i], 1+total, 1);
3355 map->p[j] = isl_basic_map_extend(ctx, map->p[j],
3356 map->p[j]->nparam, map->p[j]->n_in,
3357 map->p[j]->n_out, 0, 1, 0);
3360 k = isl_basic_map_alloc_equality(ctx, map->p[j]);
3363 isl_seq_cpy(map->p[j]->eq[k], bmap->eq[i], 1+total);
3364 isl_seq_clr(map->p[j]->eq[k]+1+total,
3365 map->p[j]->extra - bmap->n_div);
3369 for (i = 0; i < bmap->n_ineq; ++i) {
3370 for (j = 0; j < map->n; ++j) {
3371 rest = add_cut_constraint(ctx, rest,
3372 map->p[j], bmap->ineq[i], 1+total, 0);
3376 map->p[j] = isl_basic_map_extend(ctx, map->p[j],
3377 map->p[j]->nparam, map->p[j]->n_in,
3378 map->p[j]->n_out, 0, 0, 1);
3381 k = isl_basic_map_alloc_inequality(ctx, map->p[j]);
3384 isl_seq_cpy(map->p[j]->ineq[k], bmap->ineq[i], 1+total);
3385 isl_seq_clr(map->p[j]->ineq[k]+1+total,
3386 map->p[j]->extra - bmap->n_div);
3390 isl_map_free(ctx, map);
3393 isl_map_free(ctx, map);
3394 isl_map_free(ctx, rest);
3398 struct isl_map *isl_map_subtract(struct isl_ctx *ctx, struct isl_map *map1,
3399 struct isl_map *map2)
3405 isl_assert(ctx, map1->nparam == map2->nparam, goto error);
3406 isl_assert(ctx, map1->n_in == map2->n_in, goto error);
3407 isl_assert(ctx, map1->n_out == map2->n_out, goto error);
3409 if (isl_map_is_empty(ctx, map2)) {
3410 isl_map_free(ctx, map2);
3414 map1 = isl_map_compute_divs(ctx, map1);
3415 map2 = isl_map_compute_divs(ctx, map2);
3419 for (i = 0; map1 && i < map2->n; ++i)
3420 map1 = subtract(ctx, map1, map2->p[i]);
3422 isl_map_free(ctx, map2);
3425 isl_map_free(ctx, map1);
3426 isl_map_free(ctx, map2);
3430 struct isl_set *isl_set_subtract(struct isl_ctx *ctx, struct isl_set *set1,
3431 struct isl_set *set2)
3433 return (struct isl_set *)
3434 isl_map_subtract(ctx,
3435 (struct isl_map *)set1, (struct isl_map *)set2);
3438 struct isl_set *isl_set_apply(struct isl_ctx *ctx, struct isl_set *set,
3439 struct isl_map *map)
3441 isl_assert(ctx, set->dim == map->n_in, goto error);
3442 map = isl_map_intersect_domain(ctx, map, set);
3443 set = isl_map_range(ctx, map);
3446 isl_set_free(ctx, set);
3447 isl_map_free(ctx, map);
3451 /* There is no need to cow as removing empty parts doesn't change
3452 * the meaning of the set.
3454 struct isl_map *isl_map_remove_empty_parts(struct isl_ctx *ctx,
3455 struct isl_map *map)
3462 for (i = map->n-1; i >= 0; --i) {
3463 if (!F_ISSET(map->p[i], ISL_BASIC_MAP_EMPTY))
3465 isl_basic_map_free(ctx, map->p[i]);
3467 map->p[i] = map->p[map->n-1];
3474 struct isl_set *isl_set_remove_empty_parts(struct isl_ctx *ctx,
3475 struct isl_set *set)
3477 return (struct isl_set *)
3478 isl_map_remove_empty_parts(ctx, (struct isl_map *)set);