8 #include "isl_map_private.h"
10 #include "isl_map_piplib.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 (!bmap->block.data) {
27 bmap->eq = isl_alloc_array(ctx, isl_int *, n_eq + n_ineq);
29 isl_blk_free(ctx, bmap->block);
35 bmap->block2.size = 0;
36 bmap->block2.data = NULL;
39 bmap->block2 = isl_blk_alloc(ctx, extra * (1 + row_size));
40 if (!bmap->block2.data) {
42 isl_blk_free(ctx, bmap->block);
47 bmap->div = isl_alloc_array(ctx, isl_int *, extra);
49 isl_blk_free(ctx, bmap->block2);
51 isl_blk_free(ctx, bmap->block);
57 for (i = 0; i < n_eq + n_ineq; ++i)
58 bmap->eq[i] = bmap->block.data + i * row_size;
60 for (i = 0; i < extra; ++i)
61 bmap->div[i] = bmap->block2.data + i * (1 + row_size);
65 bmap->c_size = n_eq + n_ineq;
66 bmap->ineq = bmap->eq + n_eq;
67 bmap->nparam = nparam;
78 struct isl_basic_set *isl_basic_set_alloc(struct isl_ctx *ctx,
79 unsigned nparam, unsigned dim, unsigned extra,
80 unsigned n_eq, unsigned n_ineq)
82 struct isl_basic_map *bmap;
83 bmap = isl_basic_map_alloc(ctx, nparam, 0, dim, extra, n_eq, n_ineq);
84 return (struct isl_basic_set *)bmap;
87 struct isl_basic_map *isl_basic_map_alloc(struct isl_ctx *ctx,
88 unsigned nparam, unsigned in, unsigned out, unsigned extra,
89 unsigned n_eq, unsigned n_ineq)
91 struct isl_basic_map *bmap;
93 bmap = isl_alloc_type(ctx, struct isl_basic_map);
97 return basic_map_init(ctx, bmap,
98 nparam, in, out, extra, n_eq, n_ineq);
101 static void dup_constraints(struct isl_ctx *ctx,
102 struct isl_basic_map *dst, struct isl_basic_map *src)
105 unsigned total = src->nparam + src->n_in + src->n_out + src->n_div;
107 for (i = 0; i < src->n_eq; ++i) {
108 int j = isl_basic_map_alloc_equality(ctx, dst);
109 isl_seq_cpy(dst->eq[j], src->eq[i], 1+total);
112 for (i = 0; i < src->n_ineq; ++i) {
113 int j = isl_basic_map_alloc_inequality(ctx, dst);
114 isl_seq_cpy(dst->ineq[j], src->ineq[i], 1+total);
117 for (i = 0; i < src->n_div; ++i) {
118 int j = isl_basic_map_alloc_div(ctx, dst);
119 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total);
121 F_SET(dst, ISL_BASIC_SET_FINAL);
124 struct isl_basic_map *isl_basic_map_dup(struct isl_ctx *ctx,
125 struct isl_basic_map *bmap)
127 struct isl_basic_map *dup;
129 dup = isl_basic_map_alloc(ctx, bmap->nparam,
130 bmap->n_in, bmap->n_out,
131 bmap->n_div, bmap->n_eq, bmap->n_ineq);
134 dup_constraints(ctx, dup, bmap);
138 struct isl_basic_set *isl_basic_set_dup(struct isl_ctx *ctx,
139 struct isl_basic_set *bset)
141 struct isl_basic_map *dup;
143 dup = isl_basic_map_dup(ctx, (struct isl_basic_map *)bset);
144 return (struct isl_basic_set *)dup;
147 struct isl_basic_set *isl_basic_set_copy(struct isl_ctx *ctx,
148 struct isl_basic_set *bset)
153 if (F_ISSET(bset, ISL_BASIC_SET_FINAL)) {
157 return isl_basic_set_dup(ctx, bset);
160 struct isl_set *isl_set_copy(struct isl_ctx *ctx, struct isl_set *set)
169 struct isl_basic_map *isl_basic_map_copy(struct isl_ctx *ctx,
170 struct isl_basic_map *bmap)
175 if (F_ISSET(bmap, ISL_BASIC_SET_FINAL)) {
179 return isl_basic_map_dup(ctx, bmap);
182 struct isl_map *isl_map_copy(struct isl_ctx *ctx, struct isl_map *map)
191 void isl_basic_map_free(struct isl_ctx *ctx, struct isl_basic_map *bmap)
200 isl_blk_free(ctx, bmap->block2);
202 isl_blk_free(ctx, bmap->block);
206 void isl_basic_set_free(struct isl_ctx *ctx, struct isl_basic_set *bset)
208 isl_basic_map_free(ctx, (struct isl_basic_map *)bset);
211 int isl_basic_map_alloc_equality(struct isl_ctx *ctx,
212 struct isl_basic_map *bmap)
216 isl_assert(ctx, bmap->n_eq + bmap->n_ineq < bmap->c_size, return -1);
217 isl_assert(ctx, bmap->eq + bmap->n_eq <= bmap->ineq, return -1);
218 if (bmap->eq + bmap->n_eq == bmap->ineq) {
220 int j = isl_basic_map_alloc_inequality(ctx, bmap);
224 bmap->ineq[0] = bmap->ineq[j];
232 int isl_basic_map_free_equality(struct isl_ctx *ctx,
233 struct isl_basic_map *bmap, unsigned n)
235 isl_assert(ctx, n <= bmap->n_eq, return -1);
240 int isl_basic_map_drop_equality(struct isl_ctx *ctx,
241 struct isl_basic_map *bmap, unsigned pos)
244 isl_assert(ctx, pos < bmap->n_eq, return -1);
246 if (pos != bmap->n_eq - 1) {
248 bmap->eq[pos] = bmap->eq[bmap->n_eq - 1];
249 bmap->eq[bmap->n_eq - 1] = t;
255 int isl_basic_map_alloc_inequality(struct isl_ctx *ctx,
256 struct isl_basic_map *bmap)
258 isl_assert(ctx, (bmap->ineq - bmap->eq) + bmap->n_ineq < bmap->c_size,
260 return bmap->n_ineq++;
263 int isl_basic_map_free_inequality(struct isl_ctx *ctx,
264 struct isl_basic_map *bmap, unsigned n)
266 isl_assert(ctx, n <= bmap->n_ineq, return -1);
271 int isl_basic_map_drop_inequality(struct isl_ctx *ctx,
272 struct isl_basic_map *bmap, unsigned pos)
275 isl_assert(ctx, pos < bmap->n_ineq, return -1);
277 if (pos != bmap->n_ineq - 1) {
279 bmap->ineq[pos] = bmap->ineq[bmap->n_ineq - 1];
280 bmap->ineq[bmap->n_ineq - 1] = t;
286 int isl_basic_map_alloc_div(struct isl_ctx *ctx,
287 struct isl_basic_map *bmap)
289 isl_assert(ctx, bmap->n_div < bmap->extra, return -1);
290 return bmap->n_div++;
293 int isl_basic_map_free_div(struct isl_ctx *ctx,
294 struct isl_basic_map *bmap, unsigned n)
296 isl_assert(ctx, n <= bmap->n_div, return -1);
301 /* Copy constraint from src to dst, putting the vars of src at offset
302 * dim_off in dst and the divs of src at offset div_off in dst.
303 * If both sets are actually map, then dim_off applies to the input
306 static void copy_constraint(struct isl_basic_map *dst_map, isl_int *dst,
307 struct isl_basic_map *src_map, isl_int *src,
308 unsigned in_off, unsigned out_off, unsigned div_off)
310 isl_int_set(dst[0], src[0]);
311 isl_seq_cpy(dst+1, src+1, isl_min(dst_map->nparam, src_map->nparam));
312 isl_seq_cpy(dst+1+dst_map->nparam+in_off,
313 src+1+src_map->nparam,
314 isl_min(dst_map->n_in-in_off, src_map->n_in));
315 isl_seq_cpy(dst+1+dst_map->nparam+dst_map->n_in+out_off,
316 src+1+src_map->nparam+src_map->n_in,
317 isl_min(dst_map->n_out-out_off, src_map->n_out));
318 isl_seq_cpy(dst+1+dst_map->nparam+dst_map->n_in+dst_map->n_out+div_off,
319 src+1+src_map->nparam+src_map->n_in+src_map->n_out,
320 isl_min(dst_map->extra-div_off, src_map->extra));
323 static void copy_div(struct isl_basic_map *dst_map, isl_int *dst,
324 struct isl_basic_map *src_map, isl_int *src,
325 unsigned in_off, unsigned out_off, unsigned div_off)
327 isl_int_set(dst[0], src[0]);
328 copy_constraint(dst_map, dst+1, src_map, src+1, in_off, out_off, div_off);
331 static struct isl_basic_map *add_constraints(struct isl_ctx *ctx,
332 struct isl_basic_map *bmap1,
333 struct isl_basic_map *bmap2, unsigned i_pos, unsigned o_pos)
336 unsigned div_off = bmap1->n_div;
338 for (i = 0; i < bmap2->n_eq; ++i) {
339 int i1 = isl_basic_map_alloc_equality(ctx, bmap1);
342 copy_constraint(bmap1, bmap1->eq[i1], bmap2, bmap2->eq[i],
343 i_pos, o_pos, div_off);
346 for (i = 0; i < bmap2->n_ineq; ++i) {
347 int i1 = isl_basic_map_alloc_inequality(ctx, bmap1);
350 copy_constraint(bmap1, bmap1->ineq[i1], bmap2, bmap2->ineq[i],
351 i_pos, o_pos, div_off);
354 for (i = 0; i < bmap2->n_div; ++i) {
355 int i1 = isl_basic_map_alloc_div(ctx, bmap1);
358 copy_div(bmap1, bmap1->div[i1], bmap2, bmap2->div[i],
359 i_pos, o_pos, div_off);
362 isl_basic_map_free(ctx, bmap2);
367 isl_basic_map_free(ctx, bmap1);
368 isl_basic_map_free(ctx, bmap2);
372 struct isl_basic_map *isl_basic_map_extend(struct isl_ctx *ctx,
373 struct isl_basic_map *base,
374 unsigned nparam, unsigned n_in, unsigned n_out, unsigned extra,
375 unsigned n_eq, unsigned n_ineq)
377 struct isl_basic_map *ext;
380 base = isl_basic_map_cow(ctx, base);
384 dims_ok = base && base->nparam == nparam &&
385 base->n_in == n_in && base->n_out == n_out &&
386 base->extra >= base->n_div + extra;
388 if (dims_ok && n_eq == 0 && n_ineq == 0)
392 isl_assert(ctx, base->nparam <= nparam, goto error);
393 isl_assert(ctx, base->n_in <= n_in, goto error);
394 isl_assert(ctx, base->n_out <= n_out, goto error);
395 extra += base->extra;
397 n_ineq += base->n_ineq;
400 ext = isl_basic_map_alloc(ctx, nparam, n_in, n_out,
401 extra, n_eq, n_ineq);
407 ext = add_constraints(ctx, ext, base, 0, 0);
412 isl_basic_map_free(ctx, base);
416 struct isl_basic_set *isl_basic_set_extend(struct isl_ctx *ctx,
417 struct isl_basic_set *base,
418 unsigned nparam, unsigned dim, unsigned extra,
419 unsigned n_eq, unsigned n_ineq)
421 return (struct isl_basic_set *)
422 isl_basic_map_extend(ctx, (struct isl_basic_map *)base,
423 nparam, 0, dim, extra, n_eq, n_ineq);
426 static struct isl_basic_set *isl_basic_set_cow(struct isl_ctx *ctx,
427 struct isl_basic_set *bset)
429 return (struct isl_basic_set *)
430 isl_basic_map_cow(ctx, (struct isl_basic_map *)bset);
433 struct isl_basic_map *isl_basic_map_cow(struct isl_ctx *ctx,
434 struct isl_basic_map *bmap)
441 bmap = isl_basic_map_dup(ctx, bmap);
443 F_CLR(bmap, ISL_BASIC_SET_FINAL);
447 static struct isl_set *isl_set_cow(struct isl_ctx *ctx, struct isl_set *set)
452 return isl_set_dup(ctx, set);
455 struct isl_map *isl_map_cow(struct isl_ctx *ctx, struct isl_map *map)
460 return isl_map_dup(ctx, map);
463 static void swap_vars(struct isl_blk blk, isl_int *a,
464 unsigned a_len, unsigned b_len)
466 isl_seq_cpy(blk.data, a+a_len, b_len);
467 isl_seq_cpy(blk.data+b_len, a, a_len);
468 isl_seq_cpy(a, blk.data, b_len+a_len);
471 struct isl_basic_set *isl_basic_set_swap_vars(struct isl_ctx *ctx,
472 struct isl_basic_set *bset, unsigned n)
480 isl_assert(ctx, n <= bset->dim, goto error);
485 bset = isl_basic_set_cow(ctx, bset);
489 blk = isl_blk_alloc(ctx, bset->dim);
493 for (i = 0; i < bset->n_eq; ++i)
495 bset->eq[i]+1+bset->nparam, n, bset->dim - n);
497 for (i = 0; i < bset->n_ineq; ++i)
499 bset->ineq[i]+1+bset->nparam, n, bset->dim - n);
501 for (i = 0; i < bset->n_div; ++i)
503 bset->div[i]+1+1+bset->nparam, n, bset->dim - n);
505 isl_blk_free(ctx, blk);
510 isl_basic_set_free(ctx, bset);
514 struct isl_set *isl_set_swap_vars(struct isl_ctx *ctx,
515 struct isl_set *set, unsigned n)
518 set = isl_set_cow(ctx, set);
522 for (i = 0; i < set->n; ++i) {
523 set->p[i] = isl_basic_set_swap_vars(ctx, set->p[i], n);
525 isl_set_free(ctx, set);
532 static void constraint_drop_vars(isl_int *c, unsigned n, unsigned rem)
534 isl_seq_cpy(c, c + n, rem);
535 isl_seq_clr(c + rem, n);
538 struct isl_basic_set *isl_basic_set_drop_vars(struct isl_ctx *ctx,
539 struct isl_basic_set *bset, unsigned first, unsigned n)
546 isl_assert(ctx, first + n <= bset->dim, goto error);
551 bset = isl_basic_set_cow(ctx, bset);
555 for (i = 0; i < bset->n_eq; ++i)
556 constraint_drop_vars(bset->eq[i]+1+bset->nparam+first, n,
557 (bset->dim-first-n)+bset->extra);
559 for (i = 0; i < bset->n_ineq; ++i)
560 constraint_drop_vars(bset->ineq[i]+1+bset->nparam+first, n,
561 (bset->dim-first-n)+bset->extra);
563 for (i = 0; i < bset->n_div; ++i)
564 constraint_drop_vars(bset->div[i]+1+1+bset->nparam+first, n,
565 (bset->dim-first-n)+bset->extra);
570 return isl_basic_set_finalize(ctx, bset);
572 isl_basic_set_free(ctx, bset);
577 * We don't cow, as the div is assumed to be redundant.
579 static struct isl_basic_map *isl_basic_map_drop_div(struct isl_ctx *ctx,
580 struct isl_basic_map *bmap, unsigned div)
588 pos = 1 + bmap->nparam + bmap->n_in + bmap->n_out + div;
590 isl_assert(ctx, div < bmap->n_div, goto error);
592 for (i = 0; i < bmap->n_eq; ++i)
593 constraint_drop_vars(bmap->eq[i]+pos, 1, bmap->extra-div-1);
595 for (i = 0; i < bmap->n_ineq; ++i)
596 constraint_drop_vars(bmap->ineq[i]+pos, 1, bmap->extra-div-1);
598 for (i = 0; i < bmap->n_div; ++i)
599 constraint_drop_vars(bmap->div[i]+1+pos, 1, bmap->extra-div-1);
601 if (div != bmap->n_div - 1) {
603 isl_int *t = bmap->div[div];
605 for (j = div; j < bmap->n_div - 1; ++j)
606 bmap->div[j] = bmap->div[j+1];
608 bmap->div[bmap->n_div - 1] = t;
610 isl_basic_map_free_div(ctx, bmap, 1);
614 isl_basic_map_free(ctx, bmap);
618 static void eliminate_div(struct isl_ctx *ctx, struct isl_basic_map *bmap,
619 isl_int *eq, unsigned div)
622 unsigned pos = 1 + bmap->nparam + bmap->n_in + bmap->n_out + div;
624 len = 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
626 for (i = 0; i < bmap->n_eq; ++i)
627 if (bmap->eq[i] != eq)
628 isl_seq_elim(bmap->eq[i], eq, pos, len, NULL);
630 for (i = 0; i < bmap->n_ineq; ++i)
631 isl_seq_elim(bmap->ineq[i], eq, pos, len, NULL);
633 /* We need to be careful about circular definitions,
634 * so for now we just remove the definitions of other divs that
635 * depend on this div and (possibly) recompute them later.
637 for (i = 0; i < bmap->n_div; ++i)
638 if (!isl_int_is_zero(bmap->div[i][0]) &&
639 !isl_int_is_zero(bmap->div[i][1 + pos]))
640 isl_seq_clr(bmap->div[i], 1 + len);
642 isl_basic_map_drop_div(ctx, bmap, div);
645 struct isl_basic_map *isl_basic_map_set_to_empty(
646 struct isl_ctx *ctx, struct isl_basic_map *bmap)
652 total = bmap->nparam + bmap->n_in + bmap->n_out;
653 isl_assert(ctx, bmap->n_ineq + bmap->n_eq > 0, goto error);
654 isl_basic_map_free_div(ctx, bmap, bmap->n_div);
655 isl_basic_map_free_inequality(ctx, bmap, bmap->n_ineq);
657 isl_basic_map_free_equality(ctx, bmap, bmap->n_eq-1);
659 isl_basic_map_alloc_equality(ctx, bmap);
663 isl_int_set_si(bmap->eq[i][0], 1);
664 isl_seq_clr(bmap->eq[i]+1, total);
665 F_SET(bmap, ISL_BASIC_MAP_EMPTY);
666 return isl_basic_map_finalize(ctx, bmap);
668 isl_basic_map_free(ctx, bmap);
672 static void swap_equality(struct isl_basic_map *bmap, int a, int b)
674 isl_int *t = bmap->eq[a];
675 bmap->eq[a] = bmap->eq[b];
679 static void swap_inequality(struct isl_basic_map *bmap, int a, int b)
681 isl_int *t = bmap->ineq[a];
682 bmap->ineq[a] = bmap->ineq[b];
686 static void swap_div(struct isl_basic_map *bmap, int a, int b)
689 unsigned off = bmap->nparam + bmap->n_in + bmap->n_out;
690 isl_int *t = bmap->div[a];
691 bmap->div[a] = bmap->div[b];
694 for (i = 0; i < bmap->n_eq; ++i)
695 isl_int_swap(bmap->eq[i][1+off+a], bmap->eq[i][1+off+b]);
697 for (i = 0; i < bmap->n_ineq; ++i)
698 isl_int_swap(bmap->ineq[i][1+off+a], bmap->ineq[i][1+off+b]);
700 for (i = 0; i < bmap->n_div; ++i)
701 isl_int_swap(bmap->div[i][1+1+off+a], bmap->div[i][1+1+off+b]);
704 struct isl_basic_map *isl_basic_map_gauss(struct isl_ctx *ctx,
705 struct isl_basic_map *bmap, int *progress)
716 total_var = bmap->nparam + bmap->n_in + bmap->n_out;
717 total = total_var + bmap->n_div;
719 last_var = total - 1;
720 for (done = 0; done < bmap->n_eq; ++done) {
721 for (; last_var >= 0; --last_var) {
722 for (k = done; k < bmap->n_eq; ++k)
723 if (!isl_int_is_zero(bmap->eq[k][1+last_var]))
731 swap_equality(bmap, k, done);
732 if (isl_int_is_neg(bmap->eq[done][1+last_var]))
733 isl_seq_neg(bmap->eq[done], bmap->eq[done], 1+total);
735 for (k = 0; k < bmap->n_eq; ++k) {
738 if (isl_int_is_zero(bmap->eq[k][1+last_var]))
742 isl_seq_elim(bmap->eq[k], bmap->eq[done],
743 1+last_var, 1+total, NULL);
746 for (k = 0; k < bmap->n_ineq; ++k) {
747 if (isl_int_is_zero(bmap->ineq[k][1+last_var]))
751 isl_seq_elim(bmap->ineq[k], bmap->eq[done],
752 1+last_var, 1+total, NULL);
755 for (k = 0; k < bmap->n_div; ++k) {
756 if (isl_int_is_zero(bmap->div[k][0]))
758 if (isl_int_is_zero(bmap->div[k][1+1+last_var]))
762 isl_seq_elim(bmap->div[k]+1, bmap->eq[done],
763 1+last_var, 1+total, &bmap->div[k][0]);
766 if (last_var >= total_var &&
767 isl_int_is_zero(bmap->div[last_var - total_var][0])) {
768 unsigned div = last_var - total_var;
769 isl_seq_neg(bmap->div[div]+1, bmap->eq[done], 1+total);
770 isl_int_set_si(bmap->div[div][1+1+last_var], 0);
771 isl_int_set(bmap->div[div][0],
772 bmap->eq[done][1+last_var]);
775 if (done == bmap->n_eq)
777 for (k = done; k < bmap->n_eq; ++k) {
778 if (isl_int_is_zero(bmap->eq[k][0]))
780 return isl_basic_map_set_to_empty(ctx, bmap);
782 isl_basic_map_free_equality(ctx, bmap, bmap->n_eq-done);
786 static unsigned int round_up(unsigned int v)
797 static struct isl_basic_map *remove_duplicate_constraints(
799 struct isl_basic_map *bmap, int *progress)
805 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
807 if (bmap->n_ineq <= 1)
810 size = round_up(4 * bmap->n_ineq / 3 - 1);
811 bits = ffs(size) - 1;
812 index = isl_alloc_array(ctx, int, size);
813 memset(index, 0, size * sizeof(int));
817 index[isl_seq_hash(bmap->ineq[0]+1, total, bits)] = 1;
818 for (k = 1; k < bmap->n_ineq; ++k) {
819 u_int32_t hash = isl_seq_hash(bmap->ineq[k]+1, total, bits);
820 for (h = hash; index[h]; h = (h+1) % size)
821 if (isl_seq_eq(bmap->ineq[k]+1,
822 bmap->ineq[index[h]-1]+1, total))
830 if (isl_int_lt(bmap->ineq[k][0], bmap->ineq[l][0]))
831 swap_inequality(bmap, k, l);
832 isl_basic_map_drop_inequality(ctx, bmap, k);
840 static struct isl_basic_map *remove_duplicate_divs(struct isl_ctx *ctx,
841 struct isl_basic_map *bmap, int *progress)
848 unsigned total_var = bmap->nparam + bmap->n_in + bmap->n_out;
849 unsigned total = total_var + bmap->n_div;
851 if (bmap->n_div <= 1)
854 for (k = bmap->n_div - 1; k >= 0; --k)
855 if (!isl_int_is_zero(bmap->div[k][0]))
860 size = round_up(4 * bmap->n_div / 3 - 1);
861 bits = ffs(size) - 1;
862 index = isl_alloc_array(ctx, int, size);
863 memset(index, 0, size * sizeof(int));
866 eq = isl_blk_alloc(ctx, 1+total);
870 isl_seq_clr(eq.data, 1+total);
871 index[isl_seq_hash(bmap->div[k], 2+total, bits)] = k + 1;
872 for (--k; k >= 0; --k) {
875 if (isl_int_is_zero(bmap->div[k][0]))
878 hash = isl_seq_hash(bmap->div[k], 2+total, bits);
879 for (h = hash; index[h]; h = (h+1) % size)
880 if (isl_seq_eq(bmap->div[k],
881 bmap->div[index[h]-1], 2+total))
886 isl_int_set_si(eq.data[1+total_var+k], -1);
887 isl_int_set_si(eq.data[1+total_var+l], 1);
888 eliminate_div(ctx, bmap, eq.data, l);
889 isl_int_set_si(eq.data[1+total_var+k], 0);
890 isl_int_set_si(eq.data[1+total_var+l], 0);
895 isl_blk_free(ctx, eq);
901 static struct isl_basic_map *eliminate_divs(
902 struct isl_ctx *ctx, struct isl_basic_map *bmap,
913 off = 1 + bmap->nparam + bmap->n_in + bmap->n_out;
915 for (d = bmap->n_div - 1; d >= 0 ; --d) {
916 for (i = 0; i < bmap->n_eq; ++i) {
917 if (!isl_int_is_one(bmap->eq[i][off + d]) &&
918 !isl_int_is_negone(bmap->eq[i][off + d]))
922 eliminate_div(ctx, bmap, bmap->eq[i], d);
923 isl_basic_map_drop_equality(ctx, bmap, i);
927 return eliminate_divs(ctx, bmap, progress);
931 static struct isl_basic_map *normalize_constraints(
932 struct isl_ctx *ctx, struct isl_basic_map *bmap)
936 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
939 for (i = bmap->n_eq - 1; i >= 0; --i) {
940 isl_seq_gcd(bmap->eq[i]+1, total, &gcd);
941 if (isl_int_is_zero(gcd)) {
942 if (!isl_int_is_zero(bmap->eq[i][0])) {
943 bmap = isl_basic_map_set_to_empty(ctx, bmap);
946 isl_basic_map_drop_equality(ctx, bmap, i);
949 if (isl_int_is_one(gcd))
951 if (!isl_int_is_divisible_by(bmap->eq[i][0], gcd)) {
952 bmap = isl_basic_map_set_to_empty(ctx, bmap);
955 isl_seq_scale_down(bmap->eq[i], bmap->eq[i], gcd, 1+total);
958 for (i = bmap->n_ineq - 1; i >= 0; --i) {
959 isl_seq_gcd(bmap->ineq[i]+1, total, &gcd);
960 if (isl_int_is_zero(gcd)) {
961 if (isl_int_is_neg(bmap->ineq[i][0])) {
962 bmap = isl_basic_map_set_to_empty(ctx, bmap);
965 isl_basic_map_drop_inequality(ctx, bmap, i);
968 if (isl_int_is_one(gcd))
970 isl_int_fdiv_q(bmap->ineq[i][0], bmap->ineq[i][0], gcd);
971 isl_seq_scale_down(bmap->ineq[i]+1, bmap->ineq[i]+1, gcd, total);
978 struct isl_basic_map *isl_basic_map_simplify(
979 struct isl_ctx *ctx, struct isl_basic_map *bmap)
986 bmap = normalize_constraints(ctx, bmap);
987 bmap = eliminate_divs(ctx, bmap, &progress);
988 bmap = isl_basic_map_gauss(ctx, bmap, &progress);
989 bmap = remove_duplicate_divs(ctx, bmap, &progress);
990 bmap = remove_duplicate_constraints(ctx, bmap, &progress);
995 struct isl_basic_set *isl_basic_set_simplify(
996 struct isl_ctx *ctx, struct isl_basic_set *bset)
998 return (struct isl_basic_set *)
999 isl_basic_map_simplify(ctx,
1000 (struct isl_basic_map *)bset);
1003 static void dump_term(struct isl_basic_map *bmap,
1004 isl_int c, int pos, FILE *out)
1006 unsigned in = bmap->n_in;
1007 unsigned dim = bmap->n_in + bmap->n_out;
1009 isl_int_print(out, c);
1011 if (!isl_int_is_one(c))
1012 isl_int_print(out, c);
1013 if (pos < 1 + bmap->nparam)
1014 fprintf(out, "p%d", pos - 1);
1015 else if (pos < 1 + bmap->nparam + in)
1016 fprintf(out, "i%d", pos - 1 - bmap->nparam);
1017 else if (pos < 1 + bmap->nparam + dim)
1018 fprintf(out, "o%d", pos - 1 - bmap->nparam - in);
1020 fprintf(out, "e%d", pos - 1 - bmap->nparam - dim);
1024 static void dump_constraint_sign(struct isl_basic_map *bmap, isl_int *c,
1025 int sign, FILE *out)
1029 unsigned len = 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
1033 for (i = 0, first = 1; i < len; ++i) {
1034 if (isl_int_sgn(c[i]) * sign <= 0)
1037 fprintf(out, " + ");
1039 isl_int_abs(v, c[i]);
1040 dump_term(bmap, v, i, out);
1047 static void dump_constraint(struct isl_basic_map *bmap, isl_int *c,
1048 const char *op, FILE *out, int indent)
1050 fprintf(out, "%*s", indent, "");
1052 dump_constraint_sign(bmap, c, 1, out);
1053 fprintf(out, " %s ", op);
1054 dump_constraint_sign(bmap, c, -1, out);
1059 static void dump_constraints(struct isl_basic_map *bmap,
1060 isl_int **c, unsigned n,
1061 const char *op, FILE *out, int indent)
1065 for (i = 0; i < n; ++i)
1066 dump_constraint(bmap, c[i], op, out, indent);
1069 static void dump_affine(struct isl_basic_map *bmap, isl_int *exp, FILE *out)
1073 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
1075 for (j = 0; j < 1 + total; ++j) {
1076 if (isl_int_is_zero(exp[j]))
1078 if (!first && isl_int_is_pos(exp[j]))
1080 dump_term(bmap, exp[j], j, out);
1085 static void dump(struct isl_basic_map *bmap, FILE *out, int indent)
1089 dump_constraints(bmap, bmap->eq, bmap->n_eq, "=", out, indent);
1090 dump_constraints(bmap, bmap->ineq, bmap->n_ineq, ">=", out, indent);
1092 for (i = 0; i < bmap->n_div; ++i) {
1093 fprintf(out, "%*s", indent, "");
1094 fprintf(out, "e%d = [(", i);
1095 dump_affine(bmap, bmap->div[i]+1, out);
1097 isl_int_print(out, bmap->div[i][0]);
1098 fprintf(out, "]\n");
1102 void isl_basic_set_dump(struct isl_ctx *ctx, struct isl_basic_set *bset,
1103 FILE *out, int indent)
1105 fprintf(out, "%*s", indent, "");
1106 fprintf(out, "nparam: %d, dim: %d, extra: %d\n",
1107 bset->nparam, bset->dim, bset->extra);
1108 dump((struct isl_basic_map *)bset, out, indent);
1111 void isl_basic_map_dump(struct isl_ctx *ctx, struct isl_basic_map *bmap,
1112 FILE *out, int indent)
1114 fprintf(out, "%*s", indent, "");
1115 fprintf(out, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d\n",
1117 bmap->nparam, bmap->n_in, bmap->n_out, bmap->extra);
1118 dump(bmap, out, indent);
1121 int isl_inequality_negate(struct isl_ctx *ctx,
1122 struct isl_basic_map *bmap, unsigned pos)
1124 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
1125 isl_assert(ctx, pos < bmap->n_ineq, return -1);
1126 isl_seq_neg(bmap->ineq[pos], bmap->ineq[pos], 1 + total);
1127 isl_int_sub_ui(bmap->ineq[pos][0], bmap->ineq[pos][0], 1);
1131 struct isl_set *isl_set_alloc(struct isl_ctx *ctx,
1132 unsigned nparam, unsigned dim, int n, unsigned flags)
1134 struct isl_set *set;
1136 set = isl_alloc(ctx, struct isl_set,
1137 sizeof(struct isl_set) +
1138 n * sizeof(struct isl_basic_set *));
1145 set->nparam = nparam;
1152 struct isl_set *isl_set_dup(struct isl_ctx *ctx, struct isl_set *set)
1155 struct isl_set *dup;
1157 dup = isl_set_alloc(ctx, set->nparam, set->dim, set->n, set->flags);
1160 for (i = 0; i < set->n; ++i)
1161 dup = isl_set_add(ctx, dup,
1162 isl_basic_set_dup(ctx, set->p[i]));
1166 struct isl_set *isl_set_from_basic_set(struct isl_ctx *ctx,
1167 struct isl_basic_set *bset)
1169 struct isl_set *set;
1171 set = isl_set_alloc(ctx, bset->nparam, bset->dim, 1, ISL_MAP_DISJOINT);
1173 isl_basic_set_free(ctx, bset);
1176 return isl_set_add(ctx, set, bset);
1179 struct isl_map *isl_map_from_basic_map(struct isl_ctx *ctx,
1180 struct isl_basic_map *bmap)
1182 struct isl_map *map;
1184 map = isl_map_alloc(ctx, bmap->nparam, bmap->n_in, bmap->n_out, 1,
1187 isl_basic_map_free(ctx, bmap);
1190 return isl_map_add(ctx, map, bmap);
1193 struct isl_set *isl_set_add(struct isl_ctx *ctx, struct isl_set *set,
1194 struct isl_basic_set *bset)
1198 isl_assert(ctx, set->nparam == bset->nparam, goto error);
1199 isl_assert(ctx, set->dim == bset->dim, goto error);
1200 isl_assert(ctx, set->n < set->size, goto error);
1201 set->p[set->n] = bset;
1206 isl_set_free(ctx, set);
1208 isl_basic_set_free(ctx, bset);
1212 void isl_set_free(struct isl_ctx *ctx, struct isl_set *set)
1222 for (i = 0; i < set->n; ++i)
1223 isl_basic_set_free(ctx, set->p[i]);
1227 void isl_set_dump(struct isl_ctx *ctx, struct isl_set *set, FILE *out,
1233 fprintf(out, "null set\n");
1237 fprintf(out, "%*s", indent, "");
1238 fprintf(out, "ref: %d, n: %d\n", set->ref, set->n);
1239 for (i = 0; i < set->n; ++i) {
1240 fprintf(out, "%*s", indent, "");
1241 fprintf(out, "basic set %d:\n", i);
1242 isl_basic_set_dump(ctx, set->p[i], out, indent+4);
1246 void isl_map_dump(struct isl_ctx *ctx, struct isl_map *map, FILE *out,
1251 fprintf(out, "%*s", indent, "");
1252 fprintf(out, "ref: %d, n: %d, nparam: %d, in: %d, out: %d\n",
1253 map->ref, map->n, map->nparam, map->n_in, map->n_out);
1254 for (i = 0; i < map->n; ++i) {
1255 fprintf(out, "%*s", indent, "");
1256 fprintf(out, "basic map %d:\n", i);
1257 isl_basic_map_dump(ctx, map->p[i], out, indent+4);
1261 struct isl_basic_map *isl_basic_map_intersect_domain(
1262 struct isl_ctx *ctx, struct isl_basic_map *bmap,
1263 struct isl_basic_set *bset)
1265 struct isl_basic_map *bmap_domain;
1270 isl_assert(ctx, bset->dim == bmap->n_in, goto error);
1271 isl_assert(ctx, bset->nparam == bmap->nparam, goto error);
1273 bmap = isl_basic_map_extend(ctx, bmap,
1274 bset->nparam, bmap->n_in, bmap->n_out,
1275 bset->n_div, bset->n_eq, bset->n_ineq);
1278 bmap_domain = isl_basic_map_from_basic_set(ctx, bset,
1280 bmap = add_constraints(ctx, bmap, bmap_domain, 0, 0);
1282 return isl_basic_map_finalize(ctx, bmap);
1284 isl_basic_map_free(ctx, bmap);
1285 isl_basic_set_free(ctx, bset);
1289 struct isl_basic_map *isl_basic_map_intersect_range(
1290 struct isl_ctx *ctx, struct isl_basic_map *bmap,
1291 struct isl_basic_set *bset)
1293 struct isl_basic_map *bmap_range;
1298 isl_assert(ctx, bset->dim == bmap->n_out, goto error);
1299 isl_assert(ctx, bset->nparam == bmap->nparam, goto error);
1301 bmap = isl_basic_map_extend(ctx, bmap,
1302 bset->nparam, bmap->n_in, bmap->n_out,
1303 bset->n_div, bset->n_eq, bset->n_ineq);
1306 bmap_range = isl_basic_map_from_basic_set(ctx, bset,
1308 bmap = add_constraints(ctx, bmap, bmap_range, 0, 0);
1310 return isl_basic_map_finalize(ctx, bmap);
1312 isl_basic_map_free(ctx, bmap);
1313 isl_basic_set_free(ctx, bset);
1317 struct isl_basic_map *isl_basic_map_intersect(
1318 struct isl_ctx *ctx, struct isl_basic_map *bmap1,
1319 struct isl_basic_map *bmap2)
1321 isl_assert(ctx, bmap1->nparam == bmap2->nparam, goto error);
1322 isl_assert(ctx, bmap1->n_in == bmap2->n_in, goto error);
1323 isl_assert(ctx, bmap1->n_out == bmap2->n_out, goto error);
1325 bmap1 = isl_basic_map_extend(ctx, bmap1,
1326 bmap1->nparam, bmap1->n_in, bmap1->n_out,
1327 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
1330 bmap1 = add_constraints(ctx, bmap1, bmap2, 0, 0);
1332 return isl_basic_map_finalize(ctx, bmap1);
1334 isl_basic_map_free(ctx, bmap1);
1335 isl_basic_map_free(ctx, bmap2);
1339 struct isl_basic_set *isl_basic_set_intersect(
1340 struct isl_ctx *ctx, struct isl_basic_set *bset1,
1341 struct isl_basic_set *bset2)
1343 return (struct isl_basic_set *)
1344 isl_basic_map_intersect(ctx,
1345 (struct isl_basic_map *)bset1,
1346 (struct isl_basic_map *)bset2);
1349 struct isl_map *isl_map_intersect(struct isl_ctx *ctx, struct isl_map *map1,
1350 struct isl_map *map2)
1353 struct isl_map *result;
1359 if (F_ISSET(map1, ISL_MAP_DISJOINT) &&
1360 F_ISSET(map2, ISL_MAP_DISJOINT))
1361 FL_SET(flags, ISL_MAP_DISJOINT);
1363 result = isl_map_alloc(ctx, map1->nparam, map1->n_in, map1->n_out,
1364 map1->n * map2->n, flags);
1367 for (i = 0; i < map1->n; ++i)
1368 for (j = 0; j < map2->n; ++j) {
1369 struct isl_basic_map *part;
1370 part = isl_basic_map_intersect(ctx,
1371 isl_basic_map_copy(ctx, map1->p[i]),
1372 isl_basic_map_copy(ctx, map2->p[j]));
1373 if (isl_basic_map_is_empty(ctx, part))
1374 isl_basic_map_free(ctx, part);
1376 result = isl_map_add(ctx, result, part);
1380 isl_map_free(ctx, map1);
1381 isl_map_free(ctx, map2);
1384 isl_map_free(ctx, map1);
1385 isl_map_free(ctx, map2);
1389 struct isl_basic_map *isl_basic_map_reverse(struct isl_ctx *ctx,
1390 struct isl_basic_map *bmap)
1392 struct isl_basic_set *bset;
1397 bmap = isl_basic_map_cow(ctx, bmap);
1401 bset = isl_basic_set_from_basic_map(ctx, bmap);
1402 bset = isl_basic_set_swap_vars(ctx, bset, in);
1403 return isl_basic_map_from_basic_set(ctx, bset, bset->dim-in, in);
1406 /* Turn final n dimensions into existentially quantified variables.
1408 struct isl_basic_set *isl_basic_set_project_out(
1409 struct isl_ctx *ctx, struct isl_basic_set *bset,
1410 unsigned n, unsigned flags)
1420 isl_assert(ctx, n <= bset->dim, goto error);
1425 bset = isl_basic_set_cow(ctx, bset);
1427 row_size = 1 + bset->nparam + bset->dim + bset->extra;
1428 old = bset->block2.data;
1429 bset->block2 = isl_blk_extend(ctx, bset->block2,
1430 (bset->extra + n) * (1 + row_size));
1431 if (!bset->block2.data)
1433 new_div = isl_alloc_array(ctx, isl_int *, bset->extra + n);
1436 for (i = 0; i < n; ++i) {
1437 new_div[i] = bset->block2.data +
1438 (bset->extra + i) * (1 + row_size);
1439 isl_seq_clr(new_div[i], 1 + row_size);
1441 for (i = 0; i < bset->extra; ++i)
1442 new_div[n + i] = bset->block2.data + (bset->div[i] - old);
1444 bset->div = new_div;
1448 bset = isl_basic_set_simplify(ctx, bset);
1449 return isl_basic_set_finalize(ctx, bset);
1451 isl_basic_set_free(ctx, bset);
1455 struct isl_basic_map *isl_basic_map_apply_range(
1456 struct isl_ctx *ctx, struct isl_basic_map *bmap1,
1457 struct isl_basic_map *bmap2)
1459 struct isl_basic_set *bset;
1460 unsigned n_in, n_out;
1462 if (!bmap1 || !bmap2)
1465 isl_assert(ctx, bmap1->n_out == bmap2->n_in, goto error);
1466 isl_assert(ctx, bmap1->nparam == bmap2->nparam, goto error);
1469 n_out = bmap2->n_out;
1471 bmap2 = isl_basic_map_reverse(ctx, bmap2);
1474 bmap1 = isl_basic_map_extend(ctx, bmap1, bmap1->nparam,
1475 bmap1->n_in + bmap2->n_in, bmap1->n_out,
1476 bmap2->extra, bmap2->n_eq, bmap2->n_ineq);
1479 bmap1 = add_constraints(ctx, bmap1, bmap2, bmap1->n_in - bmap2->n_in, 0);
1480 bset = isl_basic_set_from_basic_map(ctx, bmap1);
1481 bset = isl_basic_set_project_out(ctx, bset,
1482 bset->dim - (n_in + n_out), 0);
1483 return isl_basic_map_from_basic_set(ctx, bset, n_in, n_out);
1485 isl_basic_map_free(ctx, bmap1);
1486 isl_basic_map_free(ctx, bmap2);
1490 struct isl_basic_map *isl_basic_map_apply_domain(
1491 struct isl_ctx *ctx, struct isl_basic_map *bmap1,
1492 struct isl_basic_map *bmap2)
1494 if (!bmap1 || !bmap2)
1497 isl_assert(ctx, bmap1->n_in == bmap2->n_in, goto error);
1498 isl_assert(ctx, bmap1->nparam == bmap2->nparam, goto error);
1500 bmap1 = isl_basic_map_reverse(ctx, bmap1);
1501 bmap1 = isl_basic_map_apply_range(ctx, bmap1, bmap2);
1502 return isl_basic_map_reverse(ctx, bmap1);
1504 isl_basic_map_free(ctx, bmap1);
1505 isl_basic_map_free(ctx, bmap2);
1509 static struct isl_basic_map *var_equal(struct isl_ctx *ctx,
1510 struct isl_basic_map *bmap, unsigned pos)
1513 i = isl_basic_map_alloc_equality(ctx, bmap);
1516 isl_seq_clr(bmap->eq[i],
1517 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->extra);
1518 isl_int_set_si(bmap->eq[i][1+bmap->nparam+pos], -1);
1519 isl_int_set_si(bmap->eq[i][1+bmap->nparam+bmap->n_in+pos], 1);
1520 return isl_basic_map_finalize(ctx, bmap);
1522 isl_basic_map_free(ctx, bmap);
1526 static struct isl_basic_map *var_more(struct isl_ctx *ctx,
1527 struct isl_basic_map *bmap, unsigned pos)
1530 i = isl_basic_map_alloc_inequality(ctx, bmap);
1533 isl_seq_clr(bmap->ineq[i],
1534 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->extra);
1535 isl_int_set_si(bmap->ineq[i][0], -1);
1536 isl_int_set_si(bmap->ineq[i][1+bmap->nparam+pos], -1);
1537 isl_int_set_si(bmap->ineq[i][1+bmap->nparam+bmap->n_in+pos], 1);
1538 return isl_basic_map_finalize(ctx, bmap);
1540 isl_basic_map_free(ctx, bmap);
1544 static struct isl_basic_map *var_less(struct isl_ctx *ctx,
1545 struct isl_basic_map *bmap, unsigned pos)
1548 i = isl_basic_map_alloc_inequality(ctx, bmap);
1551 isl_seq_clr(bmap->ineq[i],
1552 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->extra);
1553 isl_int_set_si(bmap->ineq[i][0], -1);
1554 isl_int_set_si(bmap->ineq[i][1+bmap->nparam+pos], 1);
1555 isl_int_set_si(bmap->ineq[i][1+bmap->nparam+bmap->n_in+pos], -1);
1556 return isl_basic_map_finalize(ctx, bmap);
1558 isl_basic_map_free(ctx, bmap);
1562 struct isl_basic_map *isl_basic_map_equal(struct isl_ctx *ctx,
1563 unsigned nparam, unsigned in, unsigned out, unsigned n_equal)
1566 struct isl_basic_map *bmap;
1567 bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, n_equal, 0);
1570 for (i = 0; i < n_equal && bmap; ++i)
1571 bmap = var_equal(ctx, bmap, i);
1572 return isl_basic_map_finalize(ctx, bmap);
1575 struct isl_basic_map *isl_basic_map_less_at(struct isl_ctx *ctx,
1576 unsigned nparam, unsigned in, unsigned out, unsigned pos)
1579 struct isl_basic_map *bmap;
1580 bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, pos, 1);
1583 for (i = 0; i < pos && bmap; ++i)
1584 bmap = var_equal(ctx, bmap, i);
1586 bmap = var_less(ctx, bmap, pos);
1587 return isl_basic_map_finalize(ctx, bmap);
1590 struct isl_basic_map *isl_basic_map_more_at(struct isl_ctx *ctx,
1591 unsigned nparam, unsigned in, unsigned out, unsigned pos)
1594 struct isl_basic_map *bmap;
1595 bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, pos, 1);
1598 for (i = 0; i < pos && bmap; ++i)
1599 bmap = var_equal(ctx, bmap, i);
1601 bmap = var_more(ctx, bmap, pos);
1602 return isl_basic_map_finalize(ctx, bmap);
1605 struct isl_basic_map *isl_basic_map_from_basic_set(
1606 struct isl_ctx *ctx, struct isl_basic_set *bset,
1607 unsigned n_in, unsigned n_out)
1609 struct isl_basic_map *bmap;
1611 bset = isl_basic_set_cow(ctx, bset);
1615 isl_assert(ctx, bset->dim == n_in + n_out, goto error);
1616 bmap = (struct isl_basic_map *) bset;
1618 bmap->n_out = n_out;
1619 return isl_basic_map_finalize(ctx, bmap);
1621 isl_basic_set_free(ctx, bset);
1625 struct isl_basic_set *isl_basic_set_from_basic_map(
1626 struct isl_ctx *ctx, struct isl_basic_map *bmap)
1630 if (bmap->n_in == 0)
1631 return (struct isl_basic_set *)bmap;
1632 bmap = isl_basic_map_cow(ctx, bmap);
1635 bmap->n_out += bmap->n_in;
1637 bmap = isl_basic_map_finalize(ctx, bmap);
1638 return (struct isl_basic_set *)bmap;
1643 struct isl_basic_set *isl_basic_map_domain(struct isl_ctx *ctx,
1644 struct isl_basic_map *bmap)
1646 struct isl_basic_set *domain;
1650 n_out = bmap->n_out;
1651 domain = isl_basic_set_from_basic_map(ctx, bmap);
1652 return isl_basic_set_project_out(ctx, domain, n_out, 0);
1655 struct isl_basic_set *isl_basic_map_range(struct isl_ctx *ctx,
1656 struct isl_basic_map *bmap)
1658 return isl_basic_map_domain(ctx,
1659 isl_basic_map_reverse(ctx, bmap));
1662 struct isl_set *isl_map_range(struct isl_ctx *ctx, struct isl_map *map)
1665 struct isl_set *set;
1669 map = isl_map_cow(ctx, map);
1673 set = (struct isl_set *) map;
1675 for (i = 0; i < map->n; ++i) {
1676 set->p[i] = isl_basic_map_range(ctx, map->p[i]);
1680 F_CLR(set, ISL_MAP_DISJOINT);
1683 isl_map_free(ctx, map);
1687 struct isl_map *isl_map_from_set(
1688 struct isl_ctx *ctx, struct isl_set *set,
1689 unsigned n_in, unsigned n_out)
1692 struct isl_map *map = NULL;
1696 isl_assert(ctx, set->dim == n_in + n_out, goto error);
1697 set = isl_set_cow(ctx, set);
1700 map = (struct isl_map *)set;
1701 for (i = 0; i < set->n; ++i) {
1702 map->p[i] = isl_basic_map_from_basic_set(ctx,
1703 set->p[i], n_in, n_out);
1711 isl_set_free(ctx, set);
1715 struct isl_map *isl_map_alloc(struct isl_ctx *ctx,
1716 unsigned nparam, unsigned in, unsigned out, int n,
1719 struct isl_map *map;
1721 map = isl_alloc(ctx, struct isl_map,
1722 sizeof(struct isl_map) +
1723 n * sizeof(struct isl_basic_map *));
1730 map->nparam = nparam;
1737 struct isl_basic_map *isl_basic_map_empty(struct isl_ctx *ctx,
1738 unsigned nparam, unsigned in, unsigned out)
1740 struct isl_basic_map *bmap;
1741 bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, 1, 0);
1742 bmap = isl_basic_map_set_to_empty(ctx, bmap);
1746 struct isl_map *isl_map_empty(struct isl_ctx *ctx,
1747 unsigned nparam, unsigned in, unsigned out)
1749 return isl_map_alloc(ctx, nparam, in, out, 0, ISL_MAP_DISJOINT);
1752 struct isl_set *isl_set_empty(struct isl_ctx *ctx,
1753 unsigned nparam, unsigned dim)
1755 return isl_set_alloc(ctx, nparam, dim, 0, ISL_MAP_DISJOINT);
1758 struct isl_map *isl_map_dup(struct isl_ctx *ctx, struct isl_map *map)
1761 struct isl_map *dup;
1763 dup = isl_map_alloc(ctx, map->nparam, map->n_in, map->n_out, map->n,
1765 for (i = 0; i < map->n; ++i)
1766 dup = isl_map_add(ctx, dup,
1767 isl_basic_map_dup(ctx, map->p[i]));
1771 struct isl_map *isl_map_add(struct isl_ctx *ctx, struct isl_map *map,
1772 struct isl_basic_map *bmap)
1776 isl_assert(ctx, map->nparam == bmap->nparam, goto error);
1777 isl_assert(ctx, map->n_in == bmap->n_in, goto error);
1778 isl_assert(ctx, map->n_out == bmap->n_out, goto error);
1779 isl_assert(ctx, map->n < map->size, goto error);
1780 map->p[map->n] = bmap;
1785 isl_map_free(ctx, map);
1787 isl_basic_map_free(ctx, bmap);
1791 void isl_map_free(struct isl_ctx *ctx, struct isl_map *map)
1801 for (i = 0; i < map->n; ++i)
1802 isl_basic_map_free(ctx, map->p[i]);
1806 struct isl_map *isl_map_extend(struct isl_ctx *ctx, struct isl_map *base,
1807 unsigned nparam, unsigned n_in, unsigned n_out)
1811 base = isl_map_cow(ctx, base);
1815 isl_assert(ctx, base->nparam <= nparam, goto error);
1816 isl_assert(ctx, base->n_in <= n_in, goto error);
1817 isl_assert(ctx, base->n_out <= n_out, goto error);
1818 base->nparam = nparam;
1820 base->n_out = n_out;
1821 for (i = 0; i < base->n; ++i) {
1822 base->p[i] = isl_basic_map_extend(ctx, base->p[i],
1823 nparam, n_in, n_out, 0, 0, 0);
1829 isl_map_free(ctx, base);
1833 struct isl_basic_map *isl_basic_map_fix_input_si(struct isl_ctx *ctx,
1834 struct isl_basic_map *bmap,
1835 unsigned input, int value)
1839 bmap = isl_basic_map_cow(ctx, bmap);
1842 isl_assert(ctx, input < bmap->n_in, goto error);
1844 bmap = isl_basic_map_extend(ctx, bmap,
1845 bmap->nparam, bmap->n_in, bmap->n_out, 0, 1, 0);
1846 j = isl_basic_map_alloc_equality(ctx, bmap);
1849 isl_int_set_si(bmap->eq[j][1+bmap->nparam+input], -1);
1850 isl_int_set_si(bmap->eq[j][0], value);
1851 return isl_basic_map_finalize(ctx, bmap);
1853 isl_basic_map_free(ctx, bmap);
1857 struct isl_map *isl_map_fix_input_si(struct isl_ctx *ctx, struct isl_map *map,
1858 unsigned input, int value)
1862 map = isl_map_cow(ctx, map);
1866 isl_assert(ctx, input < map->n_in, goto error);
1867 for (i = 0; i < map->n; ++i) {
1868 map->p[i] = isl_basic_map_fix_input_si(ctx, map->p[i],
1875 isl_map_free(ctx, map);
1879 struct isl_map *isl_map_reverse(struct isl_ctx *ctx, struct isl_map *map)
1884 map = isl_map_cow(ctx, map);
1889 map->n_in = map->n_out;
1891 for (i = 0; i < map->n; ++i) {
1892 map->p[i] = isl_basic_map_reverse(ctx, map->p[i]);
1898 isl_map_free(ctx, map);
1902 struct isl_map *isl_basic_map_lexmax(struct isl_ctx *ctx,
1903 struct isl_basic_map *bmap, struct isl_basic_set *dom,
1904 struct isl_set **empty)
1907 return pip_isl_basic_map_lexmax(ctx, bmap, dom, empty);
1909 isl_basic_map_free(ctx, bmap);
1910 isl_basic_set_free(ctx, dom);
1915 struct isl_map *isl_basic_map_lexmin(struct isl_ctx *ctx,
1916 struct isl_basic_map *bmap, struct isl_basic_set *dom,
1917 struct isl_set **empty)
1920 return pip_isl_basic_map_lexmin(ctx, bmap, dom, empty);
1922 isl_basic_map_free(ctx, bmap);
1923 isl_basic_set_free(ctx, dom);
1928 struct isl_set *isl_basic_set_lexmin(struct isl_ctx *ctx,
1929 struct isl_basic_set *bset)
1931 struct isl_basic_map *bmap = NULL;
1932 struct isl_basic_set *dom = NULL;
1933 struct isl_map *min;
1937 bmap = isl_basic_map_from_basic_set(ctx, bset, 0, bset->dim);
1940 dom = isl_basic_set_alloc(ctx, bmap->nparam, 0, 0, 0, 0);
1943 min = isl_basic_map_lexmin(ctx, bmap, dom, NULL);
1944 return isl_map_range(ctx, min);
1946 isl_basic_map_free(ctx, bmap);
1950 struct isl_map *isl_basic_map_compute_divs(struct isl_ctx *ctx,
1951 struct isl_basic_map *bmap)
1953 if (bmap->n_div == 0)
1954 return isl_map_from_basic_map(ctx, bmap);
1956 return pip_isl_basic_map_compute_divs(ctx, bmap);
1958 isl_basic_map_free(ctx, bmap);
1963 struct isl_map *isl_map_compute_divs(struct isl_ctx *ctx, struct isl_map *map)
1966 struct isl_map *res;
1972 res = isl_basic_map_compute_divs(ctx,
1973 isl_basic_map_copy(ctx, map->p[0]));
1974 for (i = 1 ; i < map->n; ++i) {
1976 r2 = isl_basic_map_compute_divs(ctx,
1977 isl_basic_map_copy(ctx, map->p[i]));
1978 if (F_ISSET(map, ISL_MAP_DISJOINT))
1979 res = isl_map_union_disjoint(ctx, res, r2);
1981 res = isl_map_union(ctx, res, r2);
1983 isl_map_free(ctx, map);
1988 struct isl_set *isl_basic_set_compute_divs(struct isl_ctx *ctx,
1989 struct isl_basic_set *bset)
1991 return (struct isl_set *)
1992 isl_basic_map_compute_divs(ctx,
1993 (struct isl_basic_map *)bset);
1996 struct isl_set *isl_map_domain(struct isl_ctx *ctx, struct isl_map *map)
1999 struct isl_set *set;
2004 map = isl_map_cow(ctx, map);
2008 set = (struct isl_set *)map;
2009 set->dim = map->n_in;
2011 for (i = 0; i < map->n; ++i) {
2012 set->p[i] = isl_basic_map_domain(ctx, map->p[i]);
2016 F_CLR(set, ISL_MAP_DISJOINT);
2019 isl_map_free(ctx, map);
2023 struct isl_map *isl_map_union_disjoint(struct isl_ctx *ctx,
2024 struct isl_map *map1, struct isl_map *map2)
2028 struct isl_map *map = NULL;
2034 isl_map_free(ctx, map1);
2038 isl_map_free(ctx, map2);
2042 isl_assert(ctx, map1->nparam == map2->nparam, goto error);
2043 isl_assert(ctx, map1->n_in == map2->n_in, goto error);
2044 isl_assert(ctx, map1->n_out == map2->n_out, goto error);
2046 if (F_ISSET(map1, ISL_MAP_DISJOINT) &&
2047 F_ISSET(map2, ISL_MAP_DISJOINT))
2048 FL_SET(flags, ISL_MAP_DISJOINT);
2050 map = isl_map_alloc(ctx, map1->nparam, map1->n_in, map1->n_out,
2051 map1->n + map2->n, flags);
2054 for (i = 0; i < map1->n; ++i) {
2055 map = isl_map_add(ctx, map,
2056 isl_basic_map_copy(ctx, map1->p[i]));
2060 for (i = 0; i < map2->n; ++i) {
2061 map = isl_map_add(ctx, map,
2062 isl_basic_map_copy(ctx, map2->p[i]));
2066 isl_map_free(ctx, map1);
2067 isl_map_free(ctx, map2);
2070 isl_map_free(ctx, map);
2071 isl_map_free(ctx, map1);
2072 isl_map_free(ctx, map2);
2076 struct isl_map *isl_map_union(struct isl_ctx *ctx,
2077 struct isl_map *map1, struct isl_map *map2)
2079 map1 = isl_map_union_disjoint(ctx, map1, map2);
2083 F_CLR(map1, ISL_MAP_DISJOINT);
2087 struct isl_set *isl_set_union_disjoint(struct isl_ctx *ctx,
2088 struct isl_set *set1, struct isl_set *set2)
2090 return (struct isl_set *)
2091 isl_map_union_disjoint(ctx,
2092 (struct isl_map *)set1, (struct isl_map *)set2);
2095 struct isl_set *isl_set_union(struct isl_ctx *ctx,
2096 struct isl_set *set1, struct isl_set *set2)
2098 return (struct isl_set *)
2100 (struct isl_map *)set1, (struct isl_map *)set2);
2103 struct isl_map *isl_map_intersect_range(
2104 struct isl_ctx *ctx, struct isl_map *map,
2105 struct isl_set *set)
2108 struct isl_map *result;
2114 if (F_ISSET(map, ISL_MAP_DISJOINT) &&
2115 F_ISSET(set, ISL_MAP_DISJOINT))
2116 FL_SET(flags, ISL_MAP_DISJOINT);
2118 result = isl_map_alloc(ctx, map->nparam, map->n_in, map->n_out,
2119 map->n * set->n, flags);
2122 for (i = 0; i < map->n; ++i)
2123 for (j = 0; j < set->n; ++j) {
2124 result = isl_map_add(ctx, result,
2125 isl_basic_map_intersect_range(ctx,
2126 isl_basic_map_copy(ctx, map->p[i]),
2127 isl_basic_set_copy(ctx, set->p[j])));
2131 isl_map_free(ctx, map);
2132 isl_set_free(ctx, set);
2135 isl_map_free(ctx, map);
2136 isl_set_free(ctx, set);
2140 struct isl_map *isl_map_intersect_domain(
2141 struct isl_ctx *ctx, struct isl_map *map,
2142 struct isl_set *set)
2144 return isl_map_reverse(ctx,
2145 isl_map_intersect_range(ctx, isl_map_reverse(ctx, map), set));
2148 struct isl_map *isl_map_apply_domain(
2149 struct isl_ctx *ctx, struct isl_map *map1,
2150 struct isl_map *map2)
2154 map1 = isl_map_reverse(ctx, map1);
2155 map1 = isl_map_apply_range(ctx, map1, map2);
2156 return isl_map_reverse(ctx, map1);
2158 isl_map_free(ctx, map1);
2159 isl_map_free(ctx, map2);
2163 struct isl_map *isl_map_apply_range(
2164 struct isl_ctx *ctx, struct isl_map *map1,
2165 struct isl_map *map2)
2167 struct isl_map *result;
2173 isl_assert(ctx, map1->nparam == map2->nparam, goto error);
2174 isl_assert(ctx, map1->n_out == map2->n_in, goto error);
2176 result = isl_map_alloc(ctx, map1->nparam, map1->n_in, map2->n_out,
2177 map1->n * map2->n, 0);
2180 for (i = 0; i < map1->n; ++i)
2181 for (j = 0; j < map2->n; ++j) {
2182 result = isl_map_add(ctx, result,
2183 isl_basic_map_apply_range(ctx,
2184 isl_basic_map_copy(ctx, map1->p[i]),
2185 isl_basic_map_copy(ctx, map2->p[j])));
2189 isl_map_free(ctx, map1);
2190 isl_map_free(ctx, map2);
2193 isl_map_free(ctx, map1);
2194 isl_map_free(ctx, map2);
2199 * returns range - domain
2201 struct isl_basic_set *isl_basic_map_deltas(struct isl_ctx *ctx,
2202 struct isl_basic_map *bmap)
2204 struct isl_basic_set *bset;
2210 isl_assert(ctx, bmap->n_in == bmap->n_out, goto error);
2212 bset = isl_basic_set_from_basic_map(ctx, bmap);
2213 bset = isl_basic_set_extend(ctx, bset, bset->nparam, 3*dim, 0,
2215 bset = isl_basic_set_swap_vars(ctx, bset, 2*dim);
2216 for (i = 0; i < dim; ++i) {
2217 int j = isl_basic_map_alloc_equality(ctx,
2218 (struct isl_basic_map *)bset);
2221 isl_int_set_si(bset->eq[j][1+bset->nparam+i], 1);
2222 isl_int_set_si(bset->eq[j][1+bset->nparam+dim+i], 1);
2223 isl_int_set_si(bset->eq[j][1+bset->nparam+2*dim+i], -1);
2225 return isl_basic_set_project_out(ctx, bset, 2*dim, 0);
2227 isl_basic_map_free(ctx, bmap);
2231 static int div_is_redundant(struct isl_ctx *ctx, struct isl_basic_map *bmap,
2235 unsigned pos = 1 + bmap->nparam + bmap->n_in + bmap->n_out + div;
2237 for (i = 0; i < bmap->n_eq; ++i)
2238 if (!isl_int_is_zero(bmap->eq[i][pos]))
2241 for (i = 0; i < bmap->n_ineq; ++i)
2242 if (!isl_int_is_zero(bmap->ineq[i][pos]))
2245 for (i = 0; i < bmap->n_div; ++i)
2246 if (!isl_int_is_zero(bmap->div[i][1+pos]))
2253 * Remove divs that don't occur in any of the constraints or other divs.
2254 * These can arise when dropping some of the variables in a quast
2255 * returned by piplib.
2257 static struct isl_basic_map *remove_redundant_divs(struct isl_ctx *ctx,
2258 struct isl_basic_map *bmap)
2262 for (i = bmap->n_div-1; i >= 0; --i) {
2263 if (!div_is_redundant(ctx, bmap, i))
2265 bmap = isl_basic_map_drop_div(ctx, bmap, i);
2270 struct isl_basic_map *isl_basic_map_finalize(struct isl_ctx *ctx,
2271 struct isl_basic_map *bmap)
2273 bmap = remove_redundant_divs(ctx, bmap);
2276 F_SET(bmap, ISL_BASIC_SET_FINAL);
2280 struct isl_basic_set *isl_basic_set_finalize(struct isl_ctx *ctx,
2281 struct isl_basic_set *bset)
2283 return (struct isl_basic_set *)
2284 isl_basic_map_finalize(ctx,
2285 (struct isl_basic_map *)bset);
2288 struct isl_set *isl_set_finalize(struct isl_ctx *ctx, struct isl_set *set)
2294 for (i = 0; i < set->n; ++i) {
2295 set->p[i] = isl_basic_set_finalize(ctx, set->p[i]);
2301 isl_set_free(ctx, set);
2305 struct isl_map *isl_map_finalize(struct isl_ctx *ctx, struct isl_map *map)
2311 for (i = 0; i < map->n; ++i) {
2312 map->p[i] = isl_basic_map_finalize(ctx, map->p[i]);
2318 isl_map_free(ctx, map);
2322 struct isl_basic_map *isl_basic_map_identity(struct isl_ctx *ctx,
2323 unsigned nparam, unsigned dim)
2325 struct isl_basic_map *bmap;
2328 bmap = isl_basic_map_alloc(ctx, nparam, dim, dim, 0, dim, 0);
2332 for (i = 0; i < dim; ++i) {
2333 int j = isl_basic_map_alloc_equality(ctx, bmap);
2336 isl_int_set_si(bmap->eq[j][1+nparam+i], 1);
2337 isl_int_set_si(bmap->eq[j][1+nparam+dim+i], -1);
2339 return isl_basic_map_finalize(ctx, bmap);
2341 isl_basic_map_free(ctx, bmap);
2345 struct isl_map *isl_map_identity(struct isl_ctx *ctx,
2346 unsigned nparam, unsigned dim)
2348 struct isl_map *map = isl_map_alloc(ctx, nparam, dim, dim, 1,
2352 map = isl_map_add(ctx, map,
2353 isl_basic_map_identity(ctx, nparam, dim));
2356 isl_map_free(ctx, map);
2360 int isl_set_is_equal(struct isl_ctx *ctx,
2361 struct isl_set *set1, struct isl_set *set2)
2363 return isl_map_is_equal(ctx,
2364 (struct isl_map *)set1, (struct isl_map *)set2);
2367 int isl_set_is_subset(struct isl_ctx *ctx,
2368 struct isl_set *set1, struct isl_set *set2)
2370 return isl_map_is_subset(ctx,
2371 (struct isl_map *)set1, (struct isl_map *)set2);
2374 int isl_basic_map_is_subset(struct isl_ctx *ctx,
2375 struct isl_basic_map *bmap1,
2376 struct isl_basic_map *bmap2)
2379 struct isl_map *map1;
2380 struct isl_map *map2;
2382 if (!bmap1 || !bmap2)
2385 map1 = isl_map_from_basic_map(ctx,
2386 isl_basic_map_copy(ctx, bmap1));
2387 map2 = isl_map_from_basic_map(ctx,
2388 isl_basic_map_copy(ctx, bmap2));
2390 is_subset = isl_map_is_subset(ctx, map1, map2);
2392 isl_map_free(ctx, map1);
2393 isl_map_free(ctx, map2);
2398 int isl_map_is_empty(struct isl_ctx *ctx, struct isl_map *map)
2405 for (i = 0; i < map->n; ++i) {
2406 is_empty = isl_basic_map_is_empty(ctx, map->p[i]);
2415 int isl_set_is_empty(struct isl_ctx *ctx, struct isl_set *set)
2417 return isl_map_is_empty(ctx, (struct isl_map *)set);
2420 int isl_map_is_subset(struct isl_ctx *ctx, struct isl_map *map1,
2421 struct isl_map *map2)
2425 struct isl_map *diff;
2430 if (isl_map_is_empty(ctx, map1))
2433 if (isl_map_is_empty(ctx, map2))
2436 diff = isl_map_subtract(ctx, isl_map_copy(ctx, map1),
2437 isl_map_copy(ctx, map2));
2441 is_subset = isl_map_is_empty(ctx, diff);
2442 isl_map_free(ctx, diff);
2447 int isl_map_is_equal(struct isl_ctx *ctx,
2448 struct isl_map *map1, struct isl_map *map2)
2454 is_subset = isl_map_is_subset(ctx, map1, map2);
2457 is_subset = isl_map_is_subset(ctx, map2, map1);
2461 int isl_basic_map_is_strict_subset(struct isl_ctx *ctx,
2462 struct isl_basic_map *bmap1,
2463 struct isl_basic_map *bmap2)
2467 if (!bmap1 || !bmap2)
2469 is_subset = isl_basic_map_is_subset(ctx, bmap1, bmap2);
2472 is_subset = isl_basic_map_is_subset(ctx, bmap2, bmap1);
2473 if (is_subset == -1)
2478 int isl_basic_map_is_empty(struct isl_ctx *ctx,
2479 struct isl_basic_map *bmap)
2481 struct isl_basic_set *bset = NULL;
2482 struct isl_set *min = NULL;
2488 if (F_ISSET(bmap, ISL_BASIC_MAP_EMPTY))
2491 bset = isl_basic_set_from_basic_map(ctx,
2492 isl_basic_map_copy(ctx, bmap));
2495 min = isl_basic_set_lexmin(ctx, bset);
2498 empty = min->n == 0;
2499 isl_set_free(ctx, min);
2503 struct isl_map *isl_basic_map_union(
2504 struct isl_ctx *ctx, struct isl_basic_map *bmap1,
2505 struct isl_basic_map *bmap2)
2507 struct isl_map *map;
2508 if (!bmap1 || !bmap2)
2511 isl_assert(ctx, bmap1->nparam == bmap2->nparam, goto error);
2512 isl_assert(ctx, bmap1->n_in == bmap2->n_in, goto error);
2513 isl_assert(ctx, bmap1->n_out == bmap2->n_out, goto error);
2515 map = isl_map_alloc(ctx, bmap1->nparam,
2516 bmap1->n_in, bmap1->n_out, 2, 0);
2519 map = isl_map_add(ctx, map, bmap1);
2520 map = isl_map_add(ctx, map, bmap2);
2523 isl_basic_map_free(ctx, bmap1);
2524 isl_basic_map_free(ctx, bmap2);
2528 struct isl_set *isl_basic_set_union(
2529 struct isl_ctx *ctx, struct isl_basic_set *bset1,
2530 struct isl_basic_set *bset2)
2532 return (struct isl_set *)isl_basic_map_union(ctx,
2533 (struct isl_basic_map *)bset1,
2534 (struct isl_basic_map *)bset2);
2537 /* Order divs such that any div only depends on previous divs */
2538 static struct isl_basic_map *order_divs(struct isl_ctx *ctx,
2539 struct isl_basic_map *bmap)
2542 unsigned off = bmap->nparam + bmap->n_in + bmap->n_out;
2544 for (i = 0; i < bmap->n_div; ++i) {
2546 pos = isl_seq_first_non_zero(bmap->div[i]+1+1+off+i,
2550 swap_div(bmap, i, pos);
2556 static int find_div(struct isl_basic_map *dst,
2557 struct isl_basic_map *src, unsigned div)
2561 unsigned total = src->nparam + src->n_in + src->n_out + src->n_div;
2563 for (i = 0; i < dst->n_div; ++i)
2564 if (isl_seq_eq(dst->div[i], src->div[div], 1+1+total) &&
2565 isl_seq_first_non_zero(dst->div[i]+1+1+total,
2566 dst->n_div - src->n_div) == -1)
2571 struct isl_basic_map *isl_basic_map_align_divs(struct isl_ctx *ctx,
2572 struct isl_basic_map *dst, struct isl_basic_map *src)
2575 unsigned total = src->nparam + src->n_in + src->n_out + src->n_div;
2577 if (src->n_div == 0)
2580 src = order_divs(ctx, src);
2581 dst = isl_basic_map_extend(ctx, dst, dst->nparam, dst->n_in,
2582 dst->n_out, src->n_div, 0, 0);
2585 for (i = 0; i < src->n_div; ++i) {
2586 int j = find_div(dst, src, i);
2588 j = isl_basic_map_alloc_div(ctx, dst);
2591 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total);
2594 swap_div(dst, i, j);
2598 isl_basic_map_free(ctx, dst);
2602 static struct isl_map *add_cut_constraint(struct isl_ctx *ctx,
2603 struct isl_map *dst,
2604 struct isl_basic_map *src, isl_int *c,
2605 unsigned len, unsigned extra, int oppose)
2607 struct isl_basic_map *copy = NULL;
2611 copy = isl_basic_map_copy(ctx, src);
2612 copy = isl_basic_map_cow(ctx, copy);
2615 copy = isl_basic_map_extend(ctx, copy,
2616 copy->nparam, copy->n_in, copy->n_out, 0, 0, 1);
2617 k = isl_basic_map_alloc_inequality(ctx, copy);
2621 isl_seq_neg(copy->ineq[k], c, len);
2623 isl_seq_cpy(copy->ineq[k], c, len);
2624 isl_seq_clr(copy->ineq[k]+len, extra);
2625 isl_inequality_negate(ctx, copy, k);
2626 copy = isl_basic_map_simplify(ctx, copy);
2627 copy = isl_basic_map_finalize(ctx, copy);
2628 is_empty = isl_basic_map_is_empty(ctx, copy);
2632 dst = isl_map_add(ctx, dst, copy);
2634 isl_basic_map_free(ctx, copy);
2637 isl_basic_map_free(ctx, copy);
2638 isl_map_free(ctx, dst);
2642 static struct isl_map *subtract(struct isl_ctx *ctx, struct isl_map *map,
2643 struct isl_basic_map *bmap)
2647 struct isl_map *rest = NULL;
2649 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
2656 if (F_ISSET(map, ISL_MAP_DISJOINT))
2657 FL_SET(flags, ISL_MAP_DISJOINT);
2659 max = map->n * (2 * bmap->n_eq + bmap->n_ineq);
2660 rest = isl_map_alloc(ctx, map->nparam, map->n_in, map->n_out,
2665 for (i = 0; i < map->n; ++i) {
2666 map->p[i] = isl_basic_map_align_divs(ctx, map->p[i], bmap);
2671 for (j = 0; j < map->n; ++j)
2672 map->p[j] = isl_basic_map_cow(ctx, map->p[j]);
2674 for (i = 0; i < bmap->n_eq; ++i) {
2675 for (j = 0; j < map->n; ++j) {
2676 rest = add_cut_constraint(ctx, rest,
2677 map->p[j], bmap->eq[i],
2678 1+total, map->p[j]->n_div - bmap->n_div, 0);
2682 rest = add_cut_constraint(ctx, rest,
2683 map->p[j], bmap->eq[i],
2684 1+total, map->p[j]->n_div - bmap->n_div, 1);
2688 map->p[j] = isl_basic_map_extend(ctx, map->p[j],
2689 map->p[j]->nparam, map->p[j]->n_in,
2690 map->p[j]->n_out, 0, 1, 0);
2693 k = isl_basic_map_alloc_equality(ctx, map->p[j]);
2696 isl_seq_cpy(map->p[j]->eq[k], bmap->eq[i], 1+total);
2697 isl_seq_clr(map->p[j]->eq[k]+1+total,
2698 map->p[j]->n_div - bmap->n_div);
2702 for (i = 0; i < bmap->n_ineq; ++i) {
2703 for (j = 0; j < map->n; ++j) {
2704 rest = add_cut_constraint(ctx, rest,
2705 map->p[j], bmap->ineq[i],
2706 1+total, map->p[j]->n_div - bmap->n_div, 0);
2710 map->p[j] = isl_basic_map_extend(ctx, map->p[j],
2711 map->p[j]->nparam, map->p[j]->n_in,
2712 map->p[j]->n_out, 0, 0, 1);
2715 k = isl_basic_map_alloc_inequality(ctx, map->p[j]);
2718 isl_seq_cpy(map->p[j]->ineq[k], bmap->ineq[i], 1+total);
2719 isl_seq_clr(map->p[j]->ineq[k]+1+total,
2720 map->p[j]->n_div - bmap->n_div);
2724 isl_map_free(ctx, map);
2727 isl_map_free(ctx, map);
2728 isl_map_free(ctx, rest);
2732 struct isl_map *isl_map_subtract(struct isl_ctx *ctx, struct isl_map *map1,
2733 struct isl_map *map2)
2739 isl_assert(ctx, map1->nparam == map2->nparam, goto error);
2740 isl_assert(ctx, map1->n_in == map2->n_in, goto error);
2741 isl_assert(ctx, map1->n_out == map2->n_out, goto error);
2743 if (isl_map_is_empty(ctx, map2)) {
2744 isl_map_free(ctx, map2);
2748 map1 = isl_map_compute_divs(ctx, map1);
2749 map2 = isl_map_compute_divs(ctx, map2);
2753 for (i = 0; map1 && i < map2->n; ++i)
2754 map1 = subtract(ctx, map1, map2->p[i]);
2756 isl_map_free(ctx, map2);
2759 isl_map_free(ctx, map1);
2760 isl_map_free(ctx, map2);
2764 struct isl_set *isl_set_subtract(struct isl_ctx *ctx, struct isl_set *set1,
2765 struct isl_set *set2)
2767 return (struct isl_set *)
2768 isl_map_subtract(ctx,
2769 (struct isl_map *)set1, (struct isl_map *)set2);
2772 struct isl_set *isl_set_apply(struct isl_ctx *ctx, struct isl_set *set,
2773 struct isl_map *map)
2775 isl_assert(ctx, set->dim == map->n_in, goto error);
2776 map = isl_map_intersect_domain(ctx, map, set);
2777 set = isl_map_range(ctx, map);
2780 isl_set_free(ctx, set);
2781 isl_map_free(ctx, map);