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_PRIMITIVE_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_PRIMITIVE_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_PRIMITIVE_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_PRIMITIVE_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 return isl_basic_map_finalize(ctx, bmap);
667 isl_basic_map_free(ctx, bmap);
671 static void swap_equality(struct isl_basic_map *bmap, int a, int b)
673 isl_int *t = bmap->eq[a];
674 bmap->eq[a] = bmap->eq[b];
678 static void swap_inequality(struct isl_basic_map *bmap, int a, int b)
680 isl_int *t = bmap->ineq[a];
681 bmap->ineq[a] = bmap->ineq[b];
685 static void swap_div(struct isl_basic_map *bmap, int a, int b)
688 unsigned off = bmap->nparam + bmap->n_in + bmap->n_out;
689 isl_int *t = bmap->div[a];
690 bmap->div[a] = bmap->div[b];
693 for (i = 0; i < bmap->n_eq; ++i)
694 isl_int_swap(bmap->eq[i][1+off+a], bmap->eq[i][1+off+b]);
696 for (i = 0; i < bmap->n_ineq; ++i)
697 isl_int_swap(bmap->ineq[i][1+off+a], bmap->ineq[i][1+off+b]);
699 for (i = 0; i < bmap->n_div; ++i)
700 isl_int_swap(bmap->div[i][1+1+off+a], bmap->div[i][1+1+off+b]);
703 struct isl_basic_map *isl_basic_map_gauss(struct isl_ctx *ctx,
704 struct isl_basic_map *bmap, int *progress)
715 total_var = bmap->nparam + bmap->n_in + bmap->n_out;
716 total = total_var + bmap->n_div;
718 last_var = total - 1;
719 for (done = 0; done < bmap->n_eq; ++done) {
720 for (; last_var >= 0; --last_var) {
721 for (k = done; k < bmap->n_eq; ++k)
722 if (!isl_int_is_zero(bmap->eq[k][1+last_var]))
730 swap_equality(bmap, k, done);
731 if (isl_int_is_neg(bmap->eq[done][1+last_var]))
732 isl_seq_neg(bmap->eq[done], bmap->eq[done], 1+total);
734 for (k = 0; k < bmap->n_eq; ++k) {
737 if (isl_int_is_zero(bmap->eq[k][1+last_var]))
741 isl_seq_elim(bmap->eq[k], bmap->eq[done],
742 1+last_var, 1+total, NULL);
745 for (k = 0; k < bmap->n_ineq; ++k) {
746 if (isl_int_is_zero(bmap->ineq[k][1+last_var]))
750 isl_seq_elim(bmap->ineq[k], bmap->eq[done],
751 1+last_var, 1+total, NULL);
754 for (k = 0; k < bmap->n_div; ++k) {
755 if (isl_int_is_zero(bmap->div[k][0]))
757 if (isl_int_is_zero(bmap->div[k][1+1+last_var]))
761 isl_seq_elim(bmap->div[k]+1, bmap->eq[done],
762 1+last_var, 1+total, &bmap->div[k][0]);
765 if (last_var >= total_var &&
766 isl_int_is_zero(bmap->div[last_var - total_var][0])) {
767 unsigned div = last_var - total_var;
768 isl_seq_neg(bmap->div[div]+1, bmap->eq[done], 1+total);
769 isl_int_set_si(bmap->div[div][1+1+last_var], 0);
770 isl_int_set(bmap->div[div][0],
771 bmap->eq[done][1+last_var]);
777 static unsigned int round_up(unsigned int v)
788 static struct isl_basic_map *remove_duplicate_constraints(
790 struct isl_basic_map *bmap, int *progress)
796 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
798 if (bmap->n_ineq <= 1)
801 size = round_up(4 * bmap->n_ineq / 3 - 1);
802 bits = ffs(size) - 1;
803 index = isl_alloc_array(ctx, int, size);
804 memset(index, 0, size * sizeof(int));
808 index[isl_seq_hash(bmap->ineq[0]+1, total, bits)] = 1;
809 for (k = 1; k < bmap->n_ineq; ++k) {
810 u_int32_t hash = isl_seq_hash(bmap->ineq[k]+1, total, bits);
811 for (h = hash; index[h]; h = (h+1) % size)
812 if (isl_seq_eq(bmap->ineq[k]+1,
813 bmap->ineq[index[h]-1]+1, total))
821 if (isl_int_lt(bmap->ineq[k][0], bmap->ineq[l][0]))
822 swap_inequality(bmap, k, l);
823 isl_basic_map_drop_inequality(ctx, bmap, k);
831 static struct isl_basic_map *remove_duplicate_divs(struct isl_ctx *ctx,
832 struct isl_basic_map *bmap, int *progress)
839 unsigned total_var = bmap->nparam + bmap->n_in + bmap->n_out;
840 unsigned total = total_var + bmap->n_div;
842 if (bmap->n_div <= 1)
845 for (k = bmap->n_div - 1; k >= 0; --k)
846 if (!isl_int_is_zero(bmap->div[k][0]))
851 size = round_up(4 * bmap->n_div / 3 - 1);
852 bits = ffs(size) - 1;
853 index = isl_alloc_array(ctx, int, size);
854 memset(index, 0, size * sizeof(int));
857 eq = isl_blk_alloc(ctx, 1+total);
861 isl_seq_clr(eq.data, 1+total);
862 index[isl_seq_hash(bmap->div[k], 2+total, bits)] = k + 1;
863 for (--k; k >= 0; --k) {
866 if (isl_int_is_zero(bmap->div[k][0]))
869 hash = isl_seq_hash(bmap->div[k], 2+total, bits);
870 for (h = hash; index[h]; h = (h+1) % size)
871 if (isl_seq_eq(bmap->div[k],
872 bmap->div[index[h]-1], 2+total))
877 isl_int_set_si(eq.data[1+total_var+k], -1);
878 isl_int_set_si(eq.data[1+total_var+l], 1);
879 eliminate_div(ctx, bmap, eq.data, l);
880 isl_int_set_si(eq.data[1+total_var+k], 0);
881 isl_int_set_si(eq.data[1+total_var+l], 0);
886 isl_blk_free(ctx, eq);
892 static struct isl_basic_map *eliminate_divs(
893 struct isl_ctx *ctx, struct isl_basic_map *bmap,
904 off = 1 + bmap->nparam + bmap->n_in + bmap->n_out;
906 for (d = bmap->n_div - 1; d >= 0 ; --d) {
907 for (i = 0; i < bmap->n_eq; ++i) {
908 if (!isl_int_is_one(bmap->eq[i][off + d]) &&
909 !isl_int_is_negone(bmap->eq[i][off + d]))
913 eliminate_div(ctx, bmap, bmap->eq[i], d);
914 isl_basic_map_drop_equality(ctx, bmap, i);
918 return eliminate_divs(ctx, bmap, progress);
922 static struct isl_basic_map *normalize_constraints(
923 struct isl_ctx *ctx, struct isl_basic_map *bmap)
927 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
930 for (i = bmap->n_eq - 1; i >= 0; --i) {
931 isl_seq_gcd(bmap->eq[i]+1, total, &gcd);
932 if (isl_int_is_zero(gcd)) {
933 if (!isl_int_is_zero(bmap->eq[i][0])) {
934 bmap = isl_basic_map_set_to_empty(ctx, bmap);
937 isl_basic_map_drop_equality(ctx, bmap, i);
940 if (isl_int_is_one(gcd))
942 if (!isl_int_is_divisible_by(bmap->eq[i][0], gcd)) {
943 bmap = isl_basic_map_set_to_empty(ctx, bmap);
946 isl_seq_scale_down(bmap->eq[i], bmap->eq[i], gcd, 1+total);
949 for (i = bmap->n_ineq - 1; i >= 0; --i) {
950 isl_seq_gcd(bmap->ineq[i]+1, total, &gcd);
951 if (isl_int_is_zero(gcd)) {
952 if (isl_int_is_neg(bmap->ineq[i][0])) {
953 bmap = isl_basic_map_set_to_empty(ctx, bmap);
956 isl_basic_map_drop_inequality(ctx, bmap, i);
959 if (isl_int_is_one(gcd))
961 isl_int_cdiv_q(bmap->ineq[i][0], bmap->ineq[i][0], gcd);
962 isl_seq_scale_down(bmap->ineq[i]+1, bmap->ineq[i]+1, gcd, total);
969 struct isl_basic_map *isl_basic_map_simplify(
970 struct isl_ctx *ctx, struct isl_basic_map *bmap)
977 bmap = normalize_constraints(ctx, bmap);
978 bmap = eliminate_divs(ctx, bmap, &progress);
979 bmap = isl_basic_map_gauss(ctx, bmap, &progress);
980 bmap = remove_duplicate_divs(ctx, bmap, &progress);
981 bmap = remove_duplicate_constraints(ctx, bmap, &progress);
986 struct isl_basic_set *isl_basic_set_simplify(
987 struct isl_ctx *ctx, struct isl_basic_set *bset)
989 return (struct isl_basic_set *)
990 isl_basic_map_simplify(ctx,
991 (struct isl_basic_map *)bset);
994 static void dump_term(struct isl_basic_map *bmap,
995 isl_int c, int pos, FILE *out)
997 unsigned in = bmap->n_in;
998 unsigned dim = bmap->n_in + bmap->n_out;
1000 isl_int_print(out, c);
1002 if (!isl_int_is_one(c))
1003 isl_int_print(out, c);
1004 if (pos < 1 + bmap->nparam)
1005 fprintf(out, "p%d", pos - 1);
1006 else if (pos < 1 + bmap->nparam + in)
1007 fprintf(out, "i%d", pos - 1 - bmap->nparam);
1008 else if (pos < 1 + bmap->nparam + dim)
1009 fprintf(out, "o%d", pos - 1 - bmap->nparam - in);
1011 fprintf(out, "e%d", pos - 1 - bmap->nparam - dim);
1015 static void dump_constraint_sign(struct isl_basic_map *bmap, isl_int *c,
1016 int sign, FILE *out)
1020 unsigned len = 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
1024 for (i = 0, first = 1; i < len; ++i) {
1025 if (isl_int_sgn(c[i]) * sign <= 0)
1028 fprintf(out, " + ");
1030 isl_int_abs(v, c[i]);
1031 dump_term(bmap, v, i, out);
1038 static void dump_constraint(struct isl_basic_map *bmap, isl_int *c,
1039 const char *op, FILE *out, int indent)
1041 fprintf(out, "%*s", indent, "");
1043 dump_constraint_sign(bmap, c, 1, out);
1044 fprintf(out, " %s ", op);
1045 dump_constraint_sign(bmap, c, -1, out);
1050 static void dump_constraints(struct isl_basic_map *bmap,
1051 isl_int **c, unsigned n,
1052 const char *op, FILE *out, int indent)
1056 for (i = 0; i < n; ++i)
1057 dump_constraint(bmap, c[i], op, out, indent);
1060 static void dump_affine(struct isl_basic_map *bmap, isl_int *exp, FILE *out)
1064 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
1066 for (j = 0; j < 1 + total; ++j) {
1067 if (isl_int_is_zero(exp[j]))
1069 if (!first && isl_int_is_pos(exp[j]))
1071 dump_term(bmap, exp[j], j, out);
1076 static void dump(struct isl_basic_map *bmap, FILE *out, int indent)
1080 dump_constraints(bmap, bmap->eq, bmap->n_eq, "=", out, indent);
1081 dump_constraints(bmap, bmap->ineq, bmap->n_ineq, ">=", out, indent);
1083 for (i = 0; i < bmap->n_div; ++i) {
1084 fprintf(out, "%*s", indent, "");
1085 fprintf(out, "e%d = [(", i);
1086 dump_affine(bmap, bmap->div[i]+1, out);
1088 isl_int_print(out, bmap->div[i][0]);
1089 fprintf(out, "]\n");
1093 void isl_basic_set_dump(struct isl_ctx *ctx, struct isl_basic_set *bset,
1094 FILE *out, int indent)
1096 fprintf(out, "%*s", indent, "");
1097 fprintf(out, "nparam: %d, dim: %d, extra: %d\n",
1098 bset->nparam, bset->dim, bset->extra);
1099 dump((struct isl_basic_map *)bset, out, indent);
1102 void isl_basic_map_dump(struct isl_ctx *ctx, struct isl_basic_map *bmap,
1103 FILE *out, int indent)
1105 fprintf(out, "%*s", indent, "");
1106 fprintf(out, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d\n",
1108 bmap->nparam, bmap->n_in, bmap->n_out, bmap->extra);
1109 dump(bmap, out, indent);
1112 int isl_inequality_negate(struct isl_ctx *ctx,
1113 struct isl_basic_map *bmap, unsigned pos)
1115 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
1116 isl_assert(ctx, pos < bmap->n_ineq, return -1);
1117 isl_seq_neg(bmap->ineq[pos], bmap->ineq[pos], 1 + total);
1118 isl_int_sub_ui(bmap->ineq[pos][0], bmap->ineq[pos][0], 1);
1122 struct isl_set *isl_set_alloc(struct isl_ctx *ctx,
1123 unsigned nparam, unsigned dim, int n, unsigned flags)
1125 struct isl_set *set;
1127 set = isl_alloc(ctx, struct isl_set,
1128 sizeof(struct isl_set) +
1129 n * sizeof(struct isl_basic_set *));
1136 set->nparam = nparam;
1143 struct isl_set *isl_set_dup(struct isl_ctx *ctx, struct isl_set *set)
1146 struct isl_set *dup;
1148 dup = isl_set_alloc(ctx, set->nparam, set->dim, set->n, set->flags);
1151 for (i = 0; i < set->n; ++i)
1152 dup = isl_set_add(ctx, dup,
1153 isl_basic_set_dup(ctx, set->p[i]));
1157 struct isl_set *isl_set_from_basic_set(struct isl_ctx *ctx,
1158 struct isl_basic_set *bset)
1160 struct isl_set *set;
1162 set = isl_set_alloc(ctx, bset->nparam, bset->dim, 1, ISL_MAP_DISJOINT);
1164 isl_basic_set_free(ctx, bset);
1167 return isl_set_add(ctx, set, bset);
1170 struct isl_map *isl_map_from_basic_map(struct isl_ctx *ctx,
1171 struct isl_basic_map *bmap)
1173 struct isl_map *map;
1175 map = isl_map_alloc(ctx, bmap->nparam, bmap->n_in, bmap->n_out, 1,
1178 isl_basic_map_free(ctx, bmap);
1181 return isl_map_add(ctx, map, bmap);
1184 struct isl_set *isl_set_add(struct isl_ctx *ctx, struct isl_set *set,
1185 struct isl_basic_set *bset)
1189 isl_assert(ctx, set->nparam == bset->nparam, goto error);
1190 isl_assert(ctx, set->dim == bset->dim, goto error);
1191 isl_assert(ctx, set->n < set->size, goto error);
1192 set->p[set->n] = bset;
1197 isl_set_free(ctx, set);
1199 isl_basic_set_free(ctx, bset);
1203 void isl_set_free(struct isl_ctx *ctx, struct isl_set *set)
1213 for (i = 0; i < set->n; ++i)
1214 isl_basic_set_free(ctx, set->p[i]);
1218 void isl_set_dump(struct isl_ctx *ctx, struct isl_set *set, FILE *out,
1224 fprintf(out, "null set\n");
1228 fprintf(out, "%*s", indent, "");
1229 fprintf(out, "ref: %d, n: %d\n", set->ref, set->n);
1230 for (i = 0; i < set->n; ++i) {
1231 fprintf(out, "%*s", indent, "");
1232 fprintf(out, "basic set %d:\n", i);
1233 isl_basic_set_dump(ctx, set->p[i], out, indent+4);
1237 void isl_map_dump(struct isl_ctx *ctx, struct isl_map *map, FILE *out,
1242 fprintf(out, "%*s", indent, "");
1243 fprintf(out, "ref: %d, n: %d, nparam: %d, in: %d, out: %d\n",
1244 map->ref, map->n, map->nparam, map->n_in, map->n_out);
1245 for (i = 0; i < map->n; ++i) {
1246 fprintf(out, "%*s", indent, "");
1247 fprintf(out, "basic map %d:\n", i);
1248 isl_basic_map_dump(ctx, map->p[i], out, indent+4);
1252 struct isl_basic_map *isl_basic_map_intersect_domain(
1253 struct isl_ctx *ctx, struct isl_basic_map *bmap,
1254 struct isl_basic_set *bset)
1256 struct isl_basic_map *bmap_domain;
1261 isl_assert(ctx, bset->dim == bmap->n_in, goto error);
1262 isl_assert(ctx, bset->nparam == bmap->nparam, goto error);
1264 bmap = isl_basic_map_extend(ctx, bmap,
1265 bset->nparam, bmap->n_in, bmap->n_out,
1266 bset->n_div, bset->n_eq, bset->n_ineq);
1269 bmap_domain = isl_basic_map_from_basic_set(ctx, bset,
1271 bmap = add_constraints(ctx, bmap, bmap_domain, 0, 0);
1273 return isl_basic_map_finalize(ctx, bmap);
1275 isl_basic_map_free(ctx, bmap);
1276 isl_basic_set_free(ctx, bset);
1280 struct isl_basic_map *isl_basic_map_intersect_range(
1281 struct isl_ctx *ctx, struct isl_basic_map *bmap,
1282 struct isl_basic_set *bset)
1284 struct isl_basic_map *bmap_range;
1289 isl_assert(ctx, bset->dim == bmap->n_out, goto error);
1290 isl_assert(ctx, bset->nparam == bmap->nparam, goto error);
1292 bmap = isl_basic_map_extend(ctx, bmap,
1293 bset->nparam, bmap->n_in, bmap->n_out,
1294 bset->n_div, bset->n_eq, bset->n_ineq);
1297 bmap_range = isl_basic_map_from_basic_set(ctx, bset,
1299 bmap = add_constraints(ctx, bmap, bmap_range, 0, 0);
1301 return isl_basic_map_finalize(ctx, bmap);
1303 isl_basic_map_free(ctx, bmap);
1304 isl_basic_set_free(ctx, bset);
1308 struct isl_basic_map *isl_basic_map_intersect(
1309 struct isl_ctx *ctx, struct isl_basic_map *bmap1,
1310 struct isl_basic_map *bmap2)
1312 isl_assert(ctx, bmap1->nparam == bmap2->nparam, goto error);
1313 isl_assert(ctx, bmap1->n_in == bmap2->n_in, goto error);
1314 isl_assert(ctx, bmap1->n_out == bmap2->n_out, goto error);
1316 bmap1 = isl_basic_map_extend(ctx, bmap1,
1317 bmap1->nparam, bmap1->n_in, bmap1->n_out,
1318 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
1321 bmap1 = add_constraints(ctx, bmap1, bmap2, 0, 0);
1323 return isl_basic_map_finalize(ctx, bmap1);
1325 isl_basic_map_free(ctx, bmap1);
1326 isl_basic_map_free(ctx, bmap2);
1330 struct isl_basic_set *isl_basic_set_intersect(
1331 struct isl_ctx *ctx, struct isl_basic_set *bset1,
1332 struct isl_basic_set *bset2)
1334 return (struct isl_basic_set *)
1335 isl_basic_map_intersect(ctx,
1336 (struct isl_basic_map *)bset1,
1337 (struct isl_basic_map *)bset2);
1340 struct isl_map *isl_map_intersect(struct isl_ctx *ctx, struct isl_map *map1,
1341 struct isl_map *map2)
1344 struct isl_map *result;
1350 if (F_ISSET(map1, ISL_MAP_DISJOINT) &&
1351 F_ISSET(map2, ISL_MAP_DISJOINT))
1352 FL_SET(flags, ISL_MAP_DISJOINT);
1354 result = isl_map_alloc(ctx, map1->nparam, map1->n_in, map1->n_out,
1355 map1->n * map2->n, flags);
1358 for (i = 0; i < map1->n; ++i)
1359 for (j = 0; j < map2->n; ++j) {
1360 struct isl_basic_map *part;
1361 part = isl_basic_map_intersect(ctx,
1362 isl_basic_map_copy(ctx, map1->p[i]),
1363 isl_basic_map_copy(ctx, map2->p[j]));
1364 if (isl_basic_map_is_empty(ctx, part))
1365 isl_basic_map_free(ctx, part);
1367 result = isl_map_add(ctx, result, part);
1371 isl_map_free(ctx, map1);
1372 isl_map_free(ctx, map2);
1375 isl_map_free(ctx, map1);
1376 isl_map_free(ctx, map2);
1380 struct isl_basic_map *isl_basic_map_reverse(struct isl_ctx *ctx,
1381 struct isl_basic_map *bmap)
1383 struct isl_basic_set *bset;
1388 bmap = isl_basic_map_cow(ctx, bmap);
1392 bset = isl_basic_set_from_basic_map(ctx, bmap);
1393 bset = isl_basic_set_swap_vars(ctx, bset, in);
1394 return isl_basic_map_from_basic_set(ctx, bset, bset->dim-in, in);
1397 /* Turn final n dimensions into existentially quantified variables.
1399 struct isl_basic_set *isl_basic_set_project_out(
1400 struct isl_ctx *ctx, struct isl_basic_set *bset,
1401 unsigned n, unsigned flags)
1411 isl_assert(ctx, n <= bset->dim, goto error);
1416 bset = isl_basic_set_cow(ctx, bset);
1418 row_size = 1 + bset->nparam + bset->dim + bset->extra;
1419 old = bset->block2.data;
1420 bset->block2 = isl_blk_extend(ctx, bset->block2,
1421 (bset->extra + n) * (1 + row_size));
1422 if (!bset->block2.data)
1424 new_div = isl_alloc_array(ctx, isl_int *, bset->extra + n);
1427 for (i = 0; i < n; ++i) {
1428 new_div[i] = bset->block2.data +
1429 (bset->extra + i) * (1 + row_size);
1430 isl_seq_clr(new_div[i], 1 + row_size);
1432 for (i = 0; i < bset->extra; ++i)
1433 new_div[n + i] = bset->block2.data + (bset->div[i] - old);
1435 bset->div = new_div;
1439 bset = isl_basic_set_simplify(ctx, bset);
1440 return isl_basic_set_finalize(ctx, bset);
1442 isl_basic_set_free(ctx, bset);
1446 struct isl_basic_map *isl_basic_map_apply_range(
1447 struct isl_ctx *ctx, struct isl_basic_map *bmap1,
1448 struct isl_basic_map *bmap2)
1450 struct isl_basic_set *bset;
1451 unsigned n_in, n_out;
1453 if (!bmap1 || !bmap2)
1456 isl_assert(ctx, bmap1->n_out == bmap2->n_in, goto error);
1457 isl_assert(ctx, bmap1->nparam == bmap2->nparam, goto error);
1460 n_out = bmap2->n_out;
1462 bmap2 = isl_basic_map_reverse(ctx, bmap2);
1465 bmap1 = isl_basic_map_extend(ctx, bmap1, bmap1->nparam,
1466 bmap1->n_in + bmap2->n_in, bmap1->n_out,
1467 bmap2->extra, bmap2->n_eq, bmap2->n_ineq);
1470 bmap1 = add_constraints(ctx, bmap1, bmap2, bmap1->n_in - bmap2->n_in, 0);
1471 bset = isl_basic_set_from_basic_map(ctx, bmap1);
1472 bset = isl_basic_set_project_out(ctx, bset,
1473 bset->dim - (n_in + n_out), 0);
1474 return isl_basic_map_from_basic_set(ctx, bset, n_in, n_out);
1476 isl_basic_map_free(ctx, bmap1);
1477 isl_basic_map_free(ctx, bmap2);
1481 struct isl_basic_map *isl_basic_map_apply_domain(
1482 struct isl_ctx *ctx, struct isl_basic_map *bmap1,
1483 struct isl_basic_map *bmap2)
1485 if (!bmap1 || !bmap2)
1488 isl_assert(ctx, bmap1->n_in == bmap2->n_in, goto error);
1489 isl_assert(ctx, bmap1->nparam == bmap2->nparam, goto error);
1491 bmap1 = isl_basic_map_reverse(ctx, bmap1);
1492 bmap1 = isl_basic_map_apply_range(ctx, bmap1, bmap2);
1493 return isl_basic_map_reverse(ctx, bmap1);
1495 isl_basic_map_free(ctx, bmap1);
1496 isl_basic_map_free(ctx, bmap2);
1500 static struct isl_basic_map *var_equal(struct isl_ctx *ctx,
1501 struct isl_basic_map *bmap, unsigned pos)
1504 i = isl_basic_map_alloc_equality(ctx, bmap);
1507 isl_seq_clr(bmap->eq[i],
1508 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->extra);
1509 isl_int_set_si(bmap->eq[i][1+bmap->nparam+pos], -1);
1510 isl_int_set_si(bmap->eq[i][1+bmap->nparam+bmap->n_in+pos], 1);
1511 return isl_basic_map_finalize(ctx, bmap);
1513 isl_basic_map_free(ctx, bmap);
1517 static struct isl_basic_map *var_more(struct isl_ctx *ctx,
1518 struct isl_basic_map *bmap, unsigned pos)
1521 i = isl_basic_map_alloc_inequality(ctx, bmap);
1524 isl_seq_clr(bmap->ineq[i],
1525 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->extra);
1526 isl_int_set_si(bmap->ineq[i][0], -1);
1527 isl_int_set_si(bmap->ineq[i][1+bmap->nparam+pos], -1);
1528 isl_int_set_si(bmap->ineq[i][1+bmap->nparam+bmap->n_in+pos], 1);
1529 return isl_basic_map_finalize(ctx, bmap);
1531 isl_basic_map_free(ctx, bmap);
1535 static struct isl_basic_map *var_less(struct isl_ctx *ctx,
1536 struct isl_basic_map *bmap, unsigned pos)
1539 i = isl_basic_map_alloc_inequality(ctx, bmap);
1542 isl_seq_clr(bmap->ineq[i],
1543 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->extra);
1544 isl_int_set_si(bmap->ineq[i][0], -1);
1545 isl_int_set_si(bmap->ineq[i][1+bmap->nparam+pos], 1);
1546 isl_int_set_si(bmap->ineq[i][1+bmap->nparam+bmap->n_in+pos], -1);
1547 return isl_basic_map_finalize(ctx, bmap);
1549 isl_basic_map_free(ctx, bmap);
1553 struct isl_basic_map *isl_basic_map_equal(struct isl_ctx *ctx,
1554 unsigned nparam, unsigned in, unsigned out, unsigned n_equal)
1557 struct isl_basic_map *bmap;
1558 bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, n_equal, 0);
1561 for (i = 0; i < n_equal && bmap; ++i)
1562 bmap = var_equal(ctx, bmap, i);
1563 return isl_basic_map_finalize(ctx, bmap);
1566 struct isl_basic_map *isl_basic_map_less_at(struct isl_ctx *ctx,
1567 unsigned nparam, unsigned in, unsigned out, unsigned pos)
1570 struct isl_basic_map *bmap;
1571 bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, pos, 1);
1574 for (i = 0; i < pos && bmap; ++i)
1575 bmap = var_equal(ctx, bmap, i);
1577 bmap = var_less(ctx, bmap, pos);
1578 return isl_basic_map_finalize(ctx, bmap);
1581 struct isl_basic_map *isl_basic_map_more_at(struct isl_ctx *ctx,
1582 unsigned nparam, unsigned in, unsigned out, unsigned pos)
1585 struct isl_basic_map *bmap;
1586 bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, pos, 1);
1589 for (i = 0; i < pos && bmap; ++i)
1590 bmap = var_equal(ctx, bmap, i);
1592 bmap = var_more(ctx, bmap, pos);
1593 return isl_basic_map_finalize(ctx, bmap);
1596 struct isl_basic_map *isl_basic_map_from_basic_set(
1597 struct isl_ctx *ctx, struct isl_basic_set *bset,
1598 unsigned n_in, unsigned n_out)
1600 struct isl_basic_map *bmap;
1602 bset = isl_basic_set_cow(ctx, bset);
1606 isl_assert(ctx, bset->dim == n_in + n_out, goto error);
1607 bmap = (struct isl_basic_map *) bset;
1609 bmap->n_out = n_out;
1610 return isl_basic_map_finalize(ctx, bmap);
1612 isl_basic_set_free(ctx, bset);
1616 struct isl_basic_set *isl_basic_set_from_basic_map(
1617 struct isl_ctx *ctx, struct isl_basic_map *bmap)
1621 if (bmap->n_in == 0)
1622 return (struct isl_basic_set *)bmap;
1623 bmap = isl_basic_map_cow(ctx, bmap);
1626 bmap->n_out += bmap->n_in;
1628 bmap = isl_basic_map_finalize(ctx, bmap);
1629 return (struct isl_basic_set *)bmap;
1634 struct isl_basic_set *isl_basic_map_domain(struct isl_ctx *ctx,
1635 struct isl_basic_map *bmap)
1637 struct isl_basic_set *domain;
1641 n_out = bmap->n_out;
1642 domain = isl_basic_set_from_basic_map(ctx, bmap);
1643 return isl_basic_set_project_out(ctx, domain, n_out, 0);
1646 struct isl_basic_set *isl_basic_map_range(struct isl_ctx *ctx,
1647 struct isl_basic_map *bmap)
1649 return isl_basic_map_domain(ctx,
1650 isl_basic_map_reverse(ctx, bmap));
1653 struct isl_set *isl_map_range(struct isl_ctx *ctx, struct isl_map *map)
1656 struct isl_set *set;
1660 map = isl_map_cow(ctx, map);
1664 set = (struct isl_set *) map;
1666 for (i = 0; i < map->n; ++i) {
1667 set->p[i] = isl_basic_map_range(ctx, map->p[i]);
1671 F_CLR(set, ISL_MAP_DISJOINT);
1674 isl_map_free(ctx, map);
1678 struct isl_map *isl_map_from_set(
1679 struct isl_ctx *ctx, struct isl_set *set,
1680 unsigned n_in, unsigned n_out)
1683 struct isl_map *map = NULL;
1687 isl_assert(ctx, set->dim == n_in + n_out, goto error);
1688 set = isl_set_cow(ctx, set);
1691 map = (struct isl_map *)set;
1692 for (i = 0; i < set->n; ++i) {
1693 map->p[i] = isl_basic_map_from_basic_set(ctx,
1694 set->p[i], n_in, n_out);
1702 isl_set_free(ctx, set);
1706 struct isl_map *isl_map_alloc(struct isl_ctx *ctx,
1707 unsigned nparam, unsigned in, unsigned out, int n,
1710 struct isl_map *map;
1712 map = isl_alloc(ctx, struct isl_map,
1713 sizeof(struct isl_map) +
1714 n * sizeof(struct isl_basic_map *));
1721 map->nparam = nparam;
1728 struct isl_basic_map *isl_basic_map_empty(struct isl_ctx *ctx,
1729 unsigned nparam, unsigned in, unsigned out)
1731 struct isl_basic_map *bmap;
1732 bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, 1, 0);
1733 bmap = isl_basic_map_set_to_empty(ctx, bmap);
1737 struct isl_map *isl_map_empty(struct isl_ctx *ctx,
1738 unsigned nparam, unsigned in, unsigned out)
1740 return isl_map_alloc(ctx, nparam, in, out, 0, ISL_MAP_DISJOINT);
1743 struct isl_set *isl_set_empty(struct isl_ctx *ctx,
1744 unsigned nparam, unsigned dim)
1746 return isl_set_alloc(ctx, nparam, dim, 0, ISL_MAP_DISJOINT);
1749 struct isl_map *isl_map_dup(struct isl_ctx *ctx, struct isl_map *map)
1752 struct isl_map *dup;
1754 dup = isl_map_alloc(ctx, map->nparam, map->n_in, map->n_out, map->n,
1756 for (i = 0; i < map->n; ++i)
1757 dup = isl_map_add(ctx, dup,
1758 isl_basic_map_dup(ctx, map->p[i]));
1762 struct isl_map *isl_map_add(struct isl_ctx *ctx, struct isl_map *map,
1763 struct isl_basic_map *bmap)
1767 isl_assert(ctx, map->nparam == bmap->nparam, goto error);
1768 isl_assert(ctx, map->n_in == bmap->n_in, goto error);
1769 isl_assert(ctx, map->n_out == bmap->n_out, goto error);
1770 isl_assert(ctx, map->n < map->size, goto error);
1771 map->p[map->n] = bmap;
1776 isl_map_free(ctx, map);
1778 isl_basic_map_free(ctx, bmap);
1782 void isl_map_free(struct isl_ctx *ctx, struct isl_map *map)
1792 for (i = 0; i < map->n; ++i)
1793 isl_basic_map_free(ctx, map->p[i]);
1797 struct isl_map *isl_map_extend(struct isl_ctx *ctx, struct isl_map *base,
1798 unsigned nparam, unsigned n_in, unsigned n_out)
1802 base = isl_map_cow(ctx, base);
1806 isl_assert(ctx, base->nparam <= nparam, goto error);
1807 isl_assert(ctx, base->n_in <= n_in, goto error);
1808 isl_assert(ctx, base->n_out <= n_out, goto error);
1809 base->nparam = nparam;
1811 base->n_out = n_out;
1812 for (i = 0; i < base->n; ++i) {
1813 base->p[i] = isl_basic_map_extend(ctx, base->p[i],
1814 nparam, n_in, n_out, 0, 0, 0);
1820 isl_map_free(ctx, base);
1824 struct isl_basic_map *isl_basic_map_fix_input_si(struct isl_ctx *ctx,
1825 struct isl_basic_map *bmap,
1826 unsigned input, int value)
1830 bmap = isl_basic_map_cow(ctx, bmap);
1833 isl_assert(ctx, input < bmap->n_in, goto error);
1835 bmap = isl_basic_map_extend(ctx, bmap,
1836 bmap->nparam, bmap->n_in, bmap->n_out, 0, 1, 0);
1837 j = isl_basic_map_alloc_equality(ctx, bmap);
1840 isl_int_set_si(bmap->eq[j][1+bmap->nparam+input], -1);
1841 isl_int_set_si(bmap->eq[j][0], value);
1842 return isl_basic_map_finalize(ctx, bmap);
1844 isl_basic_map_free(ctx, bmap);
1848 struct isl_map *isl_map_fix_input_si(struct isl_ctx *ctx, struct isl_map *map,
1849 unsigned input, int value)
1853 map = isl_map_cow(ctx, map);
1857 isl_assert(ctx, input < map->n_in, goto error);
1858 for (i = 0; i < map->n; ++i) {
1859 map->p[i] = isl_basic_map_fix_input_si(ctx, map->p[i],
1866 isl_map_free(ctx, map);
1870 struct isl_map *isl_map_reverse(struct isl_ctx *ctx, struct isl_map *map)
1875 map = isl_map_cow(ctx, map);
1880 map->n_in = map->n_out;
1882 for (i = 0; i < map->n; ++i) {
1883 map->p[i] = isl_basic_map_reverse(ctx, map->p[i]);
1889 isl_map_free(ctx, map);
1893 struct isl_map *isl_basic_map_lexmax(struct isl_ctx *ctx,
1894 struct isl_basic_map *bmap, struct isl_basic_set *dom,
1895 struct isl_set **empty)
1898 return pip_isl_basic_map_lexmax(ctx, bmap, dom, empty);
1900 isl_basic_map_free(ctx, bmap);
1901 isl_basic_set_free(ctx, dom);
1906 struct isl_map *isl_basic_map_lexmin(struct isl_ctx *ctx,
1907 struct isl_basic_map *bmap, struct isl_basic_set *dom,
1908 struct isl_set **empty)
1911 return pip_isl_basic_map_lexmin(ctx, bmap, dom, empty);
1913 isl_basic_map_free(ctx, bmap);
1914 isl_basic_set_free(ctx, dom);
1919 struct isl_set *isl_basic_set_lexmin(struct isl_ctx *ctx,
1920 struct isl_basic_set *bset)
1922 struct isl_basic_map *bmap = NULL;
1923 struct isl_basic_set *dom = NULL;
1924 struct isl_map *min;
1928 bmap = isl_basic_map_from_basic_set(ctx, bset, 0, bset->dim);
1931 dom = isl_basic_set_alloc(ctx, bmap->nparam, 0, 0, 0, 0);
1934 min = isl_basic_map_lexmin(ctx, bmap, dom, NULL);
1935 return isl_map_range(ctx, min);
1937 isl_basic_map_free(ctx, bmap);
1941 struct isl_map *isl_basic_map_compute_divs(struct isl_ctx *ctx,
1942 struct isl_basic_map *bmap)
1944 if (bmap->n_div == 0)
1945 return isl_map_from_basic_map(ctx, bmap);
1947 return pip_isl_basic_map_compute_divs(ctx, bmap);
1949 isl_basic_map_free(ctx, bmap);
1954 struct isl_map *isl_map_compute_divs(struct isl_ctx *ctx, struct isl_map *map)
1957 struct isl_map *res;
1963 res = isl_basic_map_compute_divs(ctx,
1964 isl_basic_map_copy(ctx, map->p[0]));
1965 for (i = 1 ; i < map->n; ++i) {
1967 r2 = isl_basic_map_compute_divs(ctx,
1968 isl_basic_map_copy(ctx, map->p[i]));
1969 if (F_ISSET(map, ISL_MAP_DISJOINT))
1970 res = isl_map_union_disjoint(ctx, res, r2);
1972 res = isl_map_union(ctx, res, r2);
1974 isl_map_free(ctx, map);
1979 struct isl_set *isl_basic_set_compute_divs(struct isl_ctx *ctx,
1980 struct isl_basic_set *bset)
1982 return (struct isl_set *)
1983 isl_basic_map_compute_divs(ctx,
1984 (struct isl_basic_map *)bset);
1987 struct isl_set *isl_map_domain(struct isl_ctx *ctx, struct isl_map *map)
1990 struct isl_set *set;
1995 map = isl_map_cow(ctx, map);
1999 set = (struct isl_set *)map;
2000 set->dim = map->n_in;
2002 for (i = 0; i < map->n; ++i) {
2003 set->p[i] = isl_basic_map_domain(ctx, map->p[i]);
2007 F_CLR(set, ISL_MAP_DISJOINT);
2010 isl_map_free(ctx, map);
2014 struct isl_map *isl_map_union_disjoint(struct isl_ctx *ctx,
2015 struct isl_map *map1, struct isl_map *map2)
2019 struct isl_map *map = NULL;
2025 isl_map_free(ctx, map1);
2029 isl_map_free(ctx, map2);
2033 isl_assert(ctx, map1->nparam == map2->nparam, goto error);
2034 isl_assert(ctx, map1->n_in == map2->n_in, goto error);
2035 isl_assert(ctx, map1->n_out == map2->n_out, goto error);
2037 if (F_ISSET(map1, ISL_MAP_DISJOINT) &&
2038 F_ISSET(map2, ISL_MAP_DISJOINT))
2039 FL_SET(flags, ISL_MAP_DISJOINT);
2041 map = isl_map_alloc(ctx, map1->nparam, map1->n_in, map1->n_out,
2042 map1->n + map2->n, flags);
2045 for (i = 0; i < map1->n; ++i) {
2046 map = isl_map_add(ctx, map,
2047 isl_basic_map_copy(ctx, map1->p[i]));
2051 for (i = 0; i < map2->n; ++i) {
2052 map = isl_map_add(ctx, map,
2053 isl_basic_map_copy(ctx, map2->p[i]));
2057 isl_map_free(ctx, map1);
2058 isl_map_free(ctx, map2);
2061 isl_map_free(ctx, map);
2062 isl_map_free(ctx, map1);
2063 isl_map_free(ctx, map2);
2067 struct isl_map *isl_map_union(struct isl_ctx *ctx,
2068 struct isl_map *map1, struct isl_map *map2)
2070 map1 = isl_map_union_disjoint(ctx, map1, map2);
2074 F_CLR(map1, ISL_MAP_DISJOINT);
2078 struct isl_set *isl_set_union_disjoint(struct isl_ctx *ctx,
2079 struct isl_set *set1, struct isl_set *set2)
2081 return (struct isl_set *)
2082 isl_map_union_disjoint(ctx,
2083 (struct isl_map *)set1, (struct isl_map *)set2);
2086 struct isl_set *isl_set_union(struct isl_ctx *ctx,
2087 struct isl_set *set1, struct isl_set *set2)
2089 return (struct isl_set *)
2091 (struct isl_map *)set1, (struct isl_map *)set2);
2094 struct isl_map *isl_map_intersect_range(
2095 struct isl_ctx *ctx, struct isl_map *map,
2096 struct isl_set *set)
2099 struct isl_map *result;
2105 if (F_ISSET(map, ISL_MAP_DISJOINT) &&
2106 F_ISSET(set, ISL_MAP_DISJOINT))
2107 FL_SET(flags, ISL_MAP_DISJOINT);
2109 result = isl_map_alloc(ctx, map->nparam, map->n_in, map->n_out,
2110 map->n * set->n, flags);
2113 for (i = 0; i < map->n; ++i)
2114 for (j = 0; j < set->n; ++j) {
2115 result = isl_map_add(ctx, result,
2116 isl_basic_map_intersect_range(ctx,
2117 isl_basic_map_copy(ctx, map->p[i]),
2118 isl_basic_set_copy(ctx, set->p[j])));
2122 isl_map_free(ctx, map);
2123 isl_set_free(ctx, set);
2126 isl_map_free(ctx, map);
2127 isl_set_free(ctx, set);
2131 struct isl_map *isl_map_intersect_domain(
2132 struct isl_ctx *ctx, struct isl_map *map,
2133 struct isl_set *set)
2135 return isl_map_reverse(ctx,
2136 isl_map_intersect_range(ctx, isl_map_reverse(ctx, map), set));
2139 struct isl_map *isl_map_apply_domain(
2140 struct isl_ctx *ctx, struct isl_map *map1,
2141 struct isl_map *map2)
2145 map1 = isl_map_reverse(ctx, map1);
2146 map1 = isl_map_apply_range(ctx, map1, map2);
2147 return isl_map_reverse(ctx, map1);
2149 isl_map_free(ctx, map1);
2150 isl_map_free(ctx, map2);
2154 struct isl_map *isl_map_apply_range(
2155 struct isl_ctx *ctx, struct isl_map *map1,
2156 struct isl_map *map2)
2158 struct isl_map *result;
2164 isl_assert(ctx, map1->nparam == map2->nparam, goto error);
2165 isl_assert(ctx, map1->n_out == map2->n_in, goto error);
2167 result = isl_map_alloc(ctx, map1->nparam, map1->n_in, map2->n_out,
2168 map1->n * map2->n, 0);
2171 for (i = 0; i < map1->n; ++i)
2172 for (j = 0; j < map2->n; ++j) {
2173 result = isl_map_add(ctx, result,
2174 isl_basic_map_apply_range(ctx,
2175 isl_basic_map_copy(ctx, map1->p[i]),
2176 isl_basic_map_copy(ctx, map2->p[j])));
2180 isl_map_free(ctx, map1);
2181 isl_map_free(ctx, map2);
2184 isl_map_free(ctx, map1);
2185 isl_map_free(ctx, map2);
2190 * returns range - domain
2192 struct isl_basic_set *isl_basic_map_deltas(struct isl_ctx *ctx,
2193 struct isl_basic_map *bmap)
2195 struct isl_basic_set *bset;
2201 isl_assert(ctx, bmap->n_in == bmap->n_out, goto error);
2203 bset = isl_basic_set_from_basic_map(ctx, bmap);
2204 bset = isl_basic_set_extend(ctx, bset, bset->nparam, 3*dim, 0,
2206 bset = isl_basic_set_swap_vars(ctx, bset, 2*dim);
2207 for (i = 0; i < dim; ++i) {
2208 int j = isl_basic_map_alloc_equality(ctx,
2209 (struct isl_basic_map *)bset);
2212 isl_int_set_si(bset->eq[j][1+bset->nparam+i], 1);
2213 isl_int_set_si(bset->eq[j][1+bset->nparam+dim+i], 1);
2214 isl_int_set_si(bset->eq[j][1+bset->nparam+2*dim+i], -1);
2216 return isl_basic_set_project_out(ctx, bset, 2*dim, 0);
2218 isl_basic_map_free(ctx, bmap);
2222 static int div_is_redundant(struct isl_ctx *ctx, struct isl_basic_map *bmap,
2226 unsigned pos = 1 + bmap->nparam + bmap->n_in + bmap->n_out + div;
2228 for (i = 0; i < bmap->n_eq; ++i)
2229 if (!isl_int_is_zero(bmap->eq[i][pos]))
2232 for (i = 0; i < bmap->n_ineq; ++i)
2233 if (!isl_int_is_zero(bmap->ineq[i][pos]))
2236 for (i = 0; i < bmap->n_div; ++i)
2237 if (!isl_int_is_zero(bmap->div[i][1+pos]))
2244 * Remove divs that don't occur in any of the constraints or other divs.
2245 * These can arise when dropping some of the variables in a quast
2246 * returned by piplib.
2248 static struct isl_basic_map *remove_redundant_divs(struct isl_ctx *ctx,
2249 struct isl_basic_map *bmap)
2253 for (i = bmap->n_div-1; i >= 0; --i) {
2254 if (!div_is_redundant(ctx, bmap, i))
2256 bmap = isl_basic_map_drop_div(ctx, bmap, i);
2261 struct isl_basic_map *isl_basic_map_finalize(struct isl_ctx *ctx,
2262 struct isl_basic_map *bmap)
2264 bmap = remove_redundant_divs(ctx, bmap);
2267 F_SET(bmap, ISL_PRIMITIVE_SET_FINAL);
2271 struct isl_basic_set *isl_basic_set_finalize(struct isl_ctx *ctx,
2272 struct isl_basic_set *bset)
2274 return (struct isl_basic_set *)
2275 isl_basic_map_finalize(ctx,
2276 (struct isl_basic_map *)bset);
2279 struct isl_set *isl_set_finalize(struct isl_ctx *ctx, struct isl_set *set)
2285 for (i = 0; i < set->n; ++i) {
2286 set->p[i] = isl_basic_set_finalize(ctx, set->p[i]);
2292 isl_set_free(ctx, set);
2296 struct isl_map *isl_map_finalize(struct isl_ctx *ctx, struct isl_map *map)
2302 for (i = 0; i < map->n; ++i) {
2303 map->p[i] = isl_basic_map_finalize(ctx, map->p[i]);
2309 isl_map_free(ctx, map);
2313 struct isl_basic_map *isl_basic_map_identity(struct isl_ctx *ctx,
2314 unsigned nparam, unsigned dim)
2316 struct isl_basic_map *bmap;
2319 bmap = isl_basic_map_alloc(ctx, nparam, dim, dim, 0, dim, 0);
2323 for (i = 0; i < dim; ++i) {
2324 int j = isl_basic_map_alloc_equality(ctx, bmap);
2327 isl_int_set_si(bmap->eq[j][1+nparam+i], 1);
2328 isl_int_set_si(bmap->eq[j][1+nparam+dim+i], -1);
2330 return isl_basic_map_finalize(ctx, bmap);
2332 isl_basic_map_free(ctx, bmap);
2336 struct isl_map *isl_map_identity(struct isl_ctx *ctx,
2337 unsigned nparam, unsigned dim)
2339 struct isl_map *map = isl_map_alloc(ctx, nparam, dim, dim, 1,
2343 map = isl_map_add(ctx, map,
2344 isl_basic_map_identity(ctx, nparam, dim));
2347 isl_map_free(ctx, map);
2351 int isl_set_is_equal(struct isl_ctx *ctx,
2352 struct isl_set *set1, struct isl_set *set2)
2354 return isl_map_is_equal(ctx,
2355 (struct isl_map *)set1, (struct isl_map *)set2);
2358 int isl_set_is_subset(struct isl_ctx *ctx,
2359 struct isl_set *set1, struct isl_set *set2)
2361 return isl_map_is_subset(ctx,
2362 (struct isl_map *)set1, (struct isl_map *)set2);
2365 int isl_basic_map_is_subset(struct isl_ctx *ctx,
2366 struct isl_basic_map *bmap1,
2367 struct isl_basic_map *bmap2)
2370 struct isl_map *map1;
2371 struct isl_map *map2;
2373 if (!bmap1 || !bmap2)
2376 map1 = isl_map_from_basic_map(ctx,
2377 isl_basic_map_copy(ctx, bmap1));
2378 map2 = isl_map_from_basic_map(ctx,
2379 isl_basic_map_copy(ctx, bmap2));
2381 is_subset = isl_map_is_subset(ctx, map1, map2);
2383 isl_map_free(ctx, map1);
2384 isl_map_free(ctx, map2);
2389 int isl_map_is_empty(struct isl_ctx *ctx, struct isl_map *map)
2396 for (i = 0; i < map->n; ++i) {
2397 is_empty = isl_basic_map_is_empty(ctx, map->p[i]);
2406 int isl_set_is_empty(struct isl_ctx *ctx, struct isl_set *set)
2408 return isl_map_is_empty(ctx, (struct isl_map *)set);
2411 int isl_map_is_subset(struct isl_ctx *ctx, struct isl_map *map1,
2412 struct isl_map *map2)
2416 struct isl_map *diff;
2421 if (isl_map_is_empty(ctx, map1))
2424 if (isl_map_is_empty(ctx, map2))
2427 diff = isl_map_subtract(ctx, isl_map_copy(ctx, map1),
2428 isl_map_copy(ctx, map2));
2432 is_subset = isl_map_is_empty(ctx, diff);
2433 isl_map_free(ctx, diff);
2438 int isl_map_is_equal(struct isl_ctx *ctx,
2439 struct isl_map *map1, struct isl_map *map2)
2445 is_subset = isl_map_is_subset(ctx, map1, map2);
2448 is_subset = isl_map_is_subset(ctx, map2, map1);
2452 int isl_basic_map_is_strict_subset(struct isl_ctx *ctx,
2453 struct isl_basic_map *bmap1,
2454 struct isl_basic_map *bmap2)
2458 if (!bmap1 || !bmap2)
2460 is_subset = isl_basic_map_is_subset(ctx, bmap1, bmap2);
2463 is_subset = isl_basic_map_is_subset(ctx, bmap2, bmap1);
2464 if (is_subset == -1)
2469 int isl_basic_map_is_empty(struct isl_ctx *ctx,
2470 struct isl_basic_map *bmap)
2472 struct isl_basic_set *bset = NULL;
2473 struct isl_set *min = NULL;
2479 bset = isl_basic_set_from_basic_map(ctx,
2480 isl_basic_map_copy(ctx, bmap));
2483 min = isl_basic_set_lexmin(ctx, bset);
2486 empty = min->n == 0;
2487 isl_set_free(ctx, min);
2491 struct isl_map *isl_basic_map_union(
2492 struct isl_ctx *ctx, struct isl_basic_map *bmap1,
2493 struct isl_basic_map *bmap2)
2495 struct isl_map *map;
2496 if (!bmap1 || !bmap2)
2499 isl_assert(ctx, bmap1->nparam == bmap2->nparam, goto error);
2500 isl_assert(ctx, bmap1->n_in == bmap2->n_in, goto error);
2501 isl_assert(ctx, bmap1->n_out == bmap2->n_out, goto error);
2503 map = isl_map_alloc(ctx, bmap1->nparam,
2504 bmap1->n_in, bmap1->n_out, 2, 0);
2507 map = isl_map_add(ctx, map, bmap1);
2508 map = isl_map_add(ctx, map, bmap2);
2511 isl_basic_map_free(ctx, bmap1);
2512 isl_basic_map_free(ctx, bmap2);
2516 struct isl_set *isl_basic_set_union(
2517 struct isl_ctx *ctx, struct isl_basic_set *bset1,
2518 struct isl_basic_set *bset2)
2520 return (struct isl_set *)isl_basic_map_union(ctx,
2521 (struct isl_basic_map *)bset1,
2522 (struct isl_basic_map *)bset2);
2525 /* Order divs such that any div only depends on previous divs */
2526 static struct isl_basic_map *order_divs(struct isl_ctx *ctx,
2527 struct isl_basic_map *bmap)
2530 unsigned off = bmap->nparam + bmap->n_in + bmap->n_out;
2532 for (i = 0; i < bmap->n_div; ++i) {
2534 pos = isl_seq_first_non_zero(bmap->div[i]+1+1+off+i,
2538 swap_div(bmap, i, pos);
2544 static int find_div(struct isl_basic_map *dst,
2545 struct isl_basic_map *src, unsigned div)
2549 unsigned total = src->nparam + src->n_in + src->n_out + src->n_div;
2551 for (i = 0; i < dst->n_div; ++i)
2552 if (isl_seq_eq(dst->div[i], src->div[div], 1+1+total) &&
2553 isl_seq_first_non_zero(dst->div[i]+1+1+total,
2554 dst->n_div - src->n_div) == -1)
2559 struct isl_basic_map *isl_basic_map_align_divs(struct isl_ctx *ctx,
2560 struct isl_basic_map *dst, struct isl_basic_map *src)
2563 unsigned total = src->nparam + src->n_in + src->n_out + src->n_div;
2565 if (src->n_div == 0)
2568 src = order_divs(ctx, src);
2569 dst = isl_basic_map_extend(ctx, dst, dst->nparam, dst->n_in,
2570 dst->n_out, src->n_div, 0, 0);
2573 for (i = 0; i < src->n_div; ++i) {
2574 int j = find_div(dst, src, i);
2576 j = isl_basic_map_alloc_div(ctx, dst);
2579 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total);
2582 swap_div(dst, i, j);
2586 isl_basic_map_free(ctx, dst);
2590 static struct isl_map *add_cut_constraint(struct isl_ctx *ctx,
2591 struct isl_map *dst,
2592 struct isl_basic_map *src, isl_int *c,
2593 unsigned len, unsigned extra, int oppose)
2595 struct isl_basic_map *copy = NULL;
2599 copy = isl_basic_map_copy(ctx, src);
2600 copy = isl_basic_map_cow(ctx, copy);
2603 copy = isl_basic_map_extend(ctx, copy,
2604 copy->nparam, copy->n_in, copy->n_out, 0, 0, 1);
2605 k = isl_basic_map_alloc_inequality(ctx, copy);
2609 isl_seq_neg(copy->ineq[k], c, len);
2611 isl_seq_cpy(copy->ineq[k], c, len);
2612 isl_seq_clr(copy->ineq[k]+len, extra);
2613 isl_inequality_negate(ctx, copy, k);
2614 is_empty = isl_basic_map_is_empty(ctx, copy);
2618 dst = isl_map_add(ctx, dst, copy);
2620 isl_basic_map_free(ctx, copy);
2623 isl_basic_map_free(ctx, copy);
2624 isl_map_free(ctx, dst);
2628 static struct isl_map *subtract(struct isl_ctx *ctx, struct isl_map *map,
2629 struct isl_basic_map *bmap)
2633 struct isl_map *rest = NULL;
2635 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
2642 if (F_ISSET(map, ISL_MAP_DISJOINT))
2643 FL_SET(flags, ISL_MAP_DISJOINT);
2645 max = map->n * (2 * bmap->n_eq + bmap->n_ineq);
2646 rest = isl_map_alloc(ctx, map->nparam, map->n_in, map->n_out,
2651 for (i = 0; i < map->n; ++i) {
2652 map->p[i] = isl_basic_map_align_divs(ctx, map->p[i], bmap);
2657 for (j = 0; j < map->n; ++j)
2658 map->p[j] = isl_basic_map_cow(ctx, map->p[j]);
2660 for (i = 0; i < bmap->n_eq; ++i) {
2661 for (j = 0; j < map->n; ++j) {
2662 rest = add_cut_constraint(ctx, rest,
2663 map->p[j], bmap->eq[i],
2664 1+total, map->p[j]->n_div - bmap->n_div, 0);
2668 rest = add_cut_constraint(ctx, rest,
2669 map->p[j], bmap->eq[i],
2670 1+total, map->p[j]->n_div - bmap->n_div, 1);
2674 map->p[j] = isl_basic_map_extend(ctx, map->p[j],
2675 map->p[j]->nparam, map->p[j]->n_in,
2676 map->p[j]->n_out, 0, 1, 0);
2679 k = isl_basic_map_alloc_equality(ctx, map->p[j]);
2682 isl_seq_cpy(map->p[j]->eq[k], bmap->eq[i], 1+total);
2683 isl_seq_clr(map->p[j]->eq[k]+1+total,
2684 map->p[j]->n_div - bmap->n_div);
2688 for (i = 0; i < bmap->n_ineq; ++i) {
2689 for (j = 0; j < map->n; ++j) {
2690 rest = add_cut_constraint(ctx, rest,
2691 map->p[j], bmap->ineq[i],
2692 1+total, map->p[j]->n_div - bmap->n_div, 0);
2696 map->p[j] = isl_basic_map_extend(ctx, map->p[j],
2697 map->p[j]->nparam, map->p[j]->n_in,
2698 map->p[j]->n_out, 0, 0, 1);
2701 k = isl_basic_map_alloc_inequality(ctx, map->p[j]);
2704 isl_seq_cpy(map->p[j]->ineq[k], bmap->ineq[i], 1+total);
2705 isl_seq_clr(map->p[j]->ineq[k]+1+total,
2706 map->p[j]->n_div - bmap->n_div);
2710 isl_map_free(ctx, map);
2713 isl_map_free(ctx, map);
2714 isl_map_free(ctx, rest);
2718 struct isl_map *isl_map_subtract(struct isl_ctx *ctx, struct isl_map *map1,
2719 struct isl_map *map2)
2725 isl_assert(ctx, map1->nparam == map2->nparam, goto error);
2726 isl_assert(ctx, map1->n_in == map2->n_in, goto error);
2727 isl_assert(ctx, map1->n_out == map2->n_out, goto error);
2729 if (isl_map_is_empty(ctx, map2)) {
2730 isl_map_free(ctx, map2);
2734 map1 = isl_map_compute_divs(ctx, map1);
2735 map2 = isl_map_compute_divs(ctx, map2);
2739 for (i = 0; map1 && i < map2->n; ++i)
2740 map1 = subtract(ctx, map1, map2->p[i]);
2742 isl_map_free(ctx, map2);
2745 isl_map_free(ctx, map1);
2746 isl_map_free(ctx, map2);
2750 struct isl_set *isl_set_subtract(struct isl_ctx *ctx, struct isl_set *set1,
2751 struct isl_set *set2)
2753 return (struct isl_set *)
2754 isl_map_subtract(ctx,
2755 (struct isl_map *)set1, (struct isl_map *)set2);
2758 struct isl_set *isl_set_apply(struct isl_ctx *ctx, struct isl_set *set,
2759 struct isl_map *map)
2761 isl_assert(ctx, set->dim == map->n_in, goto error);
2762 map = isl_map_intersect_domain(ctx, map, set);
2763 set = isl_map_range(ctx, map);
2766 isl_set_free(ctx, set);
2767 isl_map_free(ctx, map);