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]);
774 if (done == bmap->n_eq)
776 for (k = done; k < bmap->n_eq; ++k) {
777 if (isl_int_is_zero(bmap->eq[k][0]))
779 return isl_basic_map_set_to_empty(ctx, bmap);
781 isl_basic_map_free_equality(ctx, bmap, bmap->n_eq-done);
785 static unsigned int round_up(unsigned int v)
796 static struct isl_basic_map *remove_duplicate_constraints(
798 struct isl_basic_map *bmap, int *progress)
804 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
806 if (bmap->n_ineq <= 1)
809 size = round_up(4 * bmap->n_ineq / 3 - 1);
810 bits = ffs(size) - 1;
811 index = isl_alloc_array(ctx, int, size);
812 memset(index, 0, size * sizeof(int));
816 index[isl_seq_hash(bmap->ineq[0]+1, total, bits)] = 1;
817 for (k = 1; k < bmap->n_ineq; ++k) {
818 u_int32_t hash = isl_seq_hash(bmap->ineq[k]+1, total, bits);
819 for (h = hash; index[h]; h = (h+1) % size)
820 if (isl_seq_eq(bmap->ineq[k]+1,
821 bmap->ineq[index[h]-1]+1, total))
829 if (isl_int_lt(bmap->ineq[k][0], bmap->ineq[l][0]))
830 swap_inequality(bmap, k, l);
831 isl_basic_map_drop_inequality(ctx, bmap, k);
839 static struct isl_basic_map *remove_duplicate_divs(struct isl_ctx *ctx,
840 struct isl_basic_map *bmap, int *progress)
847 unsigned total_var = bmap->nparam + bmap->n_in + bmap->n_out;
848 unsigned total = total_var + bmap->n_div;
850 if (bmap->n_div <= 1)
853 for (k = bmap->n_div - 1; k >= 0; --k)
854 if (!isl_int_is_zero(bmap->div[k][0]))
859 size = round_up(4 * bmap->n_div / 3 - 1);
860 bits = ffs(size) - 1;
861 index = isl_alloc_array(ctx, int, size);
862 memset(index, 0, size * sizeof(int));
865 eq = isl_blk_alloc(ctx, 1+total);
869 isl_seq_clr(eq.data, 1+total);
870 index[isl_seq_hash(bmap->div[k], 2+total, bits)] = k + 1;
871 for (--k; k >= 0; --k) {
874 if (isl_int_is_zero(bmap->div[k][0]))
877 hash = isl_seq_hash(bmap->div[k], 2+total, bits);
878 for (h = hash; index[h]; h = (h+1) % size)
879 if (isl_seq_eq(bmap->div[k],
880 bmap->div[index[h]-1], 2+total))
885 isl_int_set_si(eq.data[1+total_var+k], -1);
886 isl_int_set_si(eq.data[1+total_var+l], 1);
887 eliminate_div(ctx, bmap, eq.data, l);
888 isl_int_set_si(eq.data[1+total_var+k], 0);
889 isl_int_set_si(eq.data[1+total_var+l], 0);
894 isl_blk_free(ctx, eq);
900 static struct isl_basic_map *eliminate_divs(
901 struct isl_ctx *ctx, struct isl_basic_map *bmap,
912 off = 1 + bmap->nparam + bmap->n_in + bmap->n_out;
914 for (d = bmap->n_div - 1; d >= 0 ; --d) {
915 for (i = 0; i < bmap->n_eq; ++i) {
916 if (!isl_int_is_one(bmap->eq[i][off + d]) &&
917 !isl_int_is_negone(bmap->eq[i][off + d]))
921 eliminate_div(ctx, bmap, bmap->eq[i], d);
922 isl_basic_map_drop_equality(ctx, bmap, i);
926 return eliminate_divs(ctx, bmap, progress);
930 static struct isl_basic_map *normalize_constraints(
931 struct isl_ctx *ctx, struct isl_basic_map *bmap)
935 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
938 for (i = bmap->n_eq - 1; i >= 0; --i) {
939 isl_seq_gcd(bmap->eq[i]+1, total, &gcd);
940 if (isl_int_is_zero(gcd)) {
941 if (!isl_int_is_zero(bmap->eq[i][0])) {
942 bmap = isl_basic_map_set_to_empty(ctx, bmap);
945 isl_basic_map_drop_equality(ctx, bmap, i);
948 if (isl_int_is_one(gcd))
950 if (!isl_int_is_divisible_by(bmap->eq[i][0], gcd)) {
951 bmap = isl_basic_map_set_to_empty(ctx, bmap);
954 isl_seq_scale_down(bmap->eq[i], bmap->eq[i], gcd, 1+total);
957 for (i = bmap->n_ineq - 1; i >= 0; --i) {
958 isl_seq_gcd(bmap->ineq[i]+1, total, &gcd);
959 if (isl_int_is_zero(gcd)) {
960 if (isl_int_is_neg(bmap->ineq[i][0])) {
961 bmap = isl_basic_map_set_to_empty(ctx, bmap);
964 isl_basic_map_drop_inequality(ctx, bmap, i);
967 if (isl_int_is_one(gcd))
969 isl_int_fdiv_q(bmap->ineq[i][0], bmap->ineq[i][0], gcd);
970 isl_seq_scale_down(bmap->ineq[i]+1, bmap->ineq[i]+1, gcd, total);
977 struct isl_basic_map *isl_basic_map_simplify(
978 struct isl_ctx *ctx, struct isl_basic_map *bmap)
985 bmap = normalize_constraints(ctx, bmap);
986 bmap = eliminate_divs(ctx, bmap, &progress);
987 bmap = isl_basic_map_gauss(ctx, bmap, &progress);
988 bmap = remove_duplicate_divs(ctx, bmap, &progress);
989 bmap = remove_duplicate_constraints(ctx, bmap, &progress);
994 struct isl_basic_set *isl_basic_set_simplify(
995 struct isl_ctx *ctx, struct isl_basic_set *bset)
997 return (struct isl_basic_set *)
998 isl_basic_map_simplify(ctx,
999 (struct isl_basic_map *)bset);
1002 static void dump_term(struct isl_basic_map *bmap,
1003 isl_int c, int pos, FILE *out)
1005 unsigned in = bmap->n_in;
1006 unsigned dim = bmap->n_in + bmap->n_out;
1008 isl_int_print(out, c);
1010 if (!isl_int_is_one(c))
1011 isl_int_print(out, c);
1012 if (pos < 1 + bmap->nparam)
1013 fprintf(out, "p%d", pos - 1);
1014 else if (pos < 1 + bmap->nparam + in)
1015 fprintf(out, "i%d", pos - 1 - bmap->nparam);
1016 else if (pos < 1 + bmap->nparam + dim)
1017 fprintf(out, "o%d", pos - 1 - bmap->nparam - in);
1019 fprintf(out, "e%d", pos - 1 - bmap->nparam - dim);
1023 static void dump_constraint_sign(struct isl_basic_map *bmap, isl_int *c,
1024 int sign, FILE *out)
1028 unsigned len = 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
1032 for (i = 0, first = 1; i < len; ++i) {
1033 if (isl_int_sgn(c[i]) * sign <= 0)
1036 fprintf(out, " + ");
1038 isl_int_abs(v, c[i]);
1039 dump_term(bmap, v, i, out);
1046 static void dump_constraint(struct isl_basic_map *bmap, isl_int *c,
1047 const char *op, FILE *out, int indent)
1049 fprintf(out, "%*s", indent, "");
1051 dump_constraint_sign(bmap, c, 1, out);
1052 fprintf(out, " %s ", op);
1053 dump_constraint_sign(bmap, c, -1, out);
1058 static void dump_constraints(struct isl_basic_map *bmap,
1059 isl_int **c, unsigned n,
1060 const char *op, FILE *out, int indent)
1064 for (i = 0; i < n; ++i)
1065 dump_constraint(bmap, c[i], op, out, indent);
1068 static void dump_affine(struct isl_basic_map *bmap, isl_int *exp, FILE *out)
1072 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
1074 for (j = 0; j < 1 + total; ++j) {
1075 if (isl_int_is_zero(exp[j]))
1077 if (!first && isl_int_is_pos(exp[j]))
1079 dump_term(bmap, exp[j], j, out);
1084 static void dump(struct isl_basic_map *bmap, FILE *out, int indent)
1088 dump_constraints(bmap, bmap->eq, bmap->n_eq, "=", out, indent);
1089 dump_constraints(bmap, bmap->ineq, bmap->n_ineq, ">=", out, indent);
1091 for (i = 0; i < bmap->n_div; ++i) {
1092 fprintf(out, "%*s", indent, "");
1093 fprintf(out, "e%d = [(", i);
1094 dump_affine(bmap, bmap->div[i]+1, out);
1096 isl_int_print(out, bmap->div[i][0]);
1097 fprintf(out, "]\n");
1101 void isl_basic_set_dump(struct isl_ctx *ctx, struct isl_basic_set *bset,
1102 FILE *out, int indent)
1104 fprintf(out, "%*s", indent, "");
1105 fprintf(out, "nparam: %d, dim: %d, extra: %d\n",
1106 bset->nparam, bset->dim, bset->extra);
1107 dump((struct isl_basic_map *)bset, out, indent);
1110 void isl_basic_map_dump(struct isl_ctx *ctx, struct isl_basic_map *bmap,
1111 FILE *out, int indent)
1113 fprintf(out, "%*s", indent, "");
1114 fprintf(out, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d\n",
1116 bmap->nparam, bmap->n_in, bmap->n_out, bmap->extra);
1117 dump(bmap, out, indent);
1120 int isl_inequality_negate(struct isl_ctx *ctx,
1121 struct isl_basic_map *bmap, unsigned pos)
1123 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
1124 isl_assert(ctx, pos < bmap->n_ineq, return -1);
1125 isl_seq_neg(bmap->ineq[pos], bmap->ineq[pos], 1 + total);
1126 isl_int_sub_ui(bmap->ineq[pos][0], bmap->ineq[pos][0], 1);
1130 struct isl_set *isl_set_alloc(struct isl_ctx *ctx,
1131 unsigned nparam, unsigned dim, int n, unsigned flags)
1133 struct isl_set *set;
1135 set = isl_alloc(ctx, struct isl_set,
1136 sizeof(struct isl_set) +
1137 n * sizeof(struct isl_basic_set *));
1144 set->nparam = nparam;
1151 struct isl_set *isl_set_dup(struct isl_ctx *ctx, struct isl_set *set)
1154 struct isl_set *dup;
1156 dup = isl_set_alloc(ctx, set->nparam, set->dim, set->n, set->flags);
1159 for (i = 0; i < set->n; ++i)
1160 dup = isl_set_add(ctx, dup,
1161 isl_basic_set_dup(ctx, set->p[i]));
1165 struct isl_set *isl_set_from_basic_set(struct isl_ctx *ctx,
1166 struct isl_basic_set *bset)
1168 struct isl_set *set;
1170 set = isl_set_alloc(ctx, bset->nparam, bset->dim, 1, ISL_MAP_DISJOINT);
1172 isl_basic_set_free(ctx, bset);
1175 return isl_set_add(ctx, set, bset);
1178 struct isl_map *isl_map_from_basic_map(struct isl_ctx *ctx,
1179 struct isl_basic_map *bmap)
1181 struct isl_map *map;
1183 map = isl_map_alloc(ctx, bmap->nparam, bmap->n_in, bmap->n_out, 1,
1186 isl_basic_map_free(ctx, bmap);
1189 return isl_map_add(ctx, map, bmap);
1192 struct isl_set *isl_set_add(struct isl_ctx *ctx, struct isl_set *set,
1193 struct isl_basic_set *bset)
1197 isl_assert(ctx, set->nparam == bset->nparam, goto error);
1198 isl_assert(ctx, set->dim == bset->dim, goto error);
1199 isl_assert(ctx, set->n < set->size, goto error);
1200 set->p[set->n] = bset;
1205 isl_set_free(ctx, set);
1207 isl_basic_set_free(ctx, bset);
1211 void isl_set_free(struct isl_ctx *ctx, struct isl_set *set)
1221 for (i = 0; i < set->n; ++i)
1222 isl_basic_set_free(ctx, set->p[i]);
1226 void isl_set_dump(struct isl_ctx *ctx, struct isl_set *set, FILE *out,
1232 fprintf(out, "null set\n");
1236 fprintf(out, "%*s", indent, "");
1237 fprintf(out, "ref: %d, n: %d\n", set->ref, set->n);
1238 for (i = 0; i < set->n; ++i) {
1239 fprintf(out, "%*s", indent, "");
1240 fprintf(out, "basic set %d:\n", i);
1241 isl_basic_set_dump(ctx, set->p[i], out, indent+4);
1245 void isl_map_dump(struct isl_ctx *ctx, struct isl_map *map, FILE *out,
1250 fprintf(out, "%*s", indent, "");
1251 fprintf(out, "ref: %d, n: %d, nparam: %d, in: %d, out: %d\n",
1252 map->ref, map->n, map->nparam, map->n_in, map->n_out);
1253 for (i = 0; i < map->n; ++i) {
1254 fprintf(out, "%*s", indent, "");
1255 fprintf(out, "basic map %d:\n", i);
1256 isl_basic_map_dump(ctx, map->p[i], out, indent+4);
1260 struct isl_basic_map *isl_basic_map_intersect_domain(
1261 struct isl_ctx *ctx, struct isl_basic_map *bmap,
1262 struct isl_basic_set *bset)
1264 struct isl_basic_map *bmap_domain;
1269 isl_assert(ctx, bset->dim == bmap->n_in, goto error);
1270 isl_assert(ctx, bset->nparam == bmap->nparam, goto error);
1272 bmap = isl_basic_map_extend(ctx, bmap,
1273 bset->nparam, bmap->n_in, bmap->n_out,
1274 bset->n_div, bset->n_eq, bset->n_ineq);
1277 bmap_domain = isl_basic_map_from_basic_set(ctx, bset,
1279 bmap = add_constraints(ctx, bmap, bmap_domain, 0, 0);
1281 return isl_basic_map_finalize(ctx, bmap);
1283 isl_basic_map_free(ctx, bmap);
1284 isl_basic_set_free(ctx, bset);
1288 struct isl_basic_map *isl_basic_map_intersect_range(
1289 struct isl_ctx *ctx, struct isl_basic_map *bmap,
1290 struct isl_basic_set *bset)
1292 struct isl_basic_map *bmap_range;
1297 isl_assert(ctx, bset->dim == bmap->n_out, goto error);
1298 isl_assert(ctx, bset->nparam == bmap->nparam, goto error);
1300 bmap = isl_basic_map_extend(ctx, bmap,
1301 bset->nparam, bmap->n_in, bmap->n_out,
1302 bset->n_div, bset->n_eq, bset->n_ineq);
1305 bmap_range = isl_basic_map_from_basic_set(ctx, bset,
1307 bmap = add_constraints(ctx, bmap, bmap_range, 0, 0);
1309 return isl_basic_map_finalize(ctx, bmap);
1311 isl_basic_map_free(ctx, bmap);
1312 isl_basic_set_free(ctx, bset);
1316 struct isl_basic_map *isl_basic_map_intersect(
1317 struct isl_ctx *ctx, struct isl_basic_map *bmap1,
1318 struct isl_basic_map *bmap2)
1320 isl_assert(ctx, bmap1->nparam == bmap2->nparam, goto error);
1321 isl_assert(ctx, bmap1->n_in == bmap2->n_in, goto error);
1322 isl_assert(ctx, bmap1->n_out == bmap2->n_out, goto error);
1324 bmap1 = isl_basic_map_extend(ctx, bmap1,
1325 bmap1->nparam, bmap1->n_in, bmap1->n_out,
1326 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
1329 bmap1 = add_constraints(ctx, bmap1, bmap2, 0, 0);
1331 return isl_basic_map_finalize(ctx, bmap1);
1333 isl_basic_map_free(ctx, bmap1);
1334 isl_basic_map_free(ctx, bmap2);
1338 struct isl_basic_set *isl_basic_set_intersect(
1339 struct isl_ctx *ctx, struct isl_basic_set *bset1,
1340 struct isl_basic_set *bset2)
1342 return (struct isl_basic_set *)
1343 isl_basic_map_intersect(ctx,
1344 (struct isl_basic_map *)bset1,
1345 (struct isl_basic_map *)bset2);
1348 struct isl_map *isl_map_intersect(struct isl_ctx *ctx, struct isl_map *map1,
1349 struct isl_map *map2)
1352 struct isl_map *result;
1358 if (F_ISSET(map1, ISL_MAP_DISJOINT) &&
1359 F_ISSET(map2, ISL_MAP_DISJOINT))
1360 FL_SET(flags, ISL_MAP_DISJOINT);
1362 result = isl_map_alloc(ctx, map1->nparam, map1->n_in, map1->n_out,
1363 map1->n * map2->n, flags);
1366 for (i = 0; i < map1->n; ++i)
1367 for (j = 0; j < map2->n; ++j) {
1368 struct isl_basic_map *part;
1369 part = isl_basic_map_intersect(ctx,
1370 isl_basic_map_copy(ctx, map1->p[i]),
1371 isl_basic_map_copy(ctx, map2->p[j]));
1372 if (isl_basic_map_is_empty(ctx, part))
1373 isl_basic_map_free(ctx, part);
1375 result = isl_map_add(ctx, result, part);
1379 isl_map_free(ctx, map1);
1380 isl_map_free(ctx, map2);
1383 isl_map_free(ctx, map1);
1384 isl_map_free(ctx, map2);
1388 struct isl_basic_map *isl_basic_map_reverse(struct isl_ctx *ctx,
1389 struct isl_basic_map *bmap)
1391 struct isl_basic_set *bset;
1396 bmap = isl_basic_map_cow(ctx, bmap);
1400 bset = isl_basic_set_from_basic_map(ctx, bmap);
1401 bset = isl_basic_set_swap_vars(ctx, bset, in);
1402 return isl_basic_map_from_basic_set(ctx, bset, bset->dim-in, in);
1405 /* Turn final n dimensions into existentially quantified variables.
1407 struct isl_basic_set *isl_basic_set_project_out(
1408 struct isl_ctx *ctx, struct isl_basic_set *bset,
1409 unsigned n, unsigned flags)
1419 isl_assert(ctx, n <= bset->dim, goto error);
1424 bset = isl_basic_set_cow(ctx, bset);
1426 row_size = 1 + bset->nparam + bset->dim + bset->extra;
1427 old = bset->block2.data;
1428 bset->block2 = isl_blk_extend(ctx, bset->block2,
1429 (bset->extra + n) * (1 + row_size));
1430 if (!bset->block2.data)
1432 new_div = isl_alloc_array(ctx, isl_int *, bset->extra + n);
1435 for (i = 0; i < n; ++i) {
1436 new_div[i] = bset->block2.data +
1437 (bset->extra + i) * (1 + row_size);
1438 isl_seq_clr(new_div[i], 1 + row_size);
1440 for (i = 0; i < bset->extra; ++i)
1441 new_div[n + i] = bset->block2.data + (bset->div[i] - old);
1443 bset->div = new_div;
1447 bset = isl_basic_set_simplify(ctx, bset);
1448 return isl_basic_set_finalize(ctx, bset);
1450 isl_basic_set_free(ctx, bset);
1454 struct isl_basic_map *isl_basic_map_apply_range(
1455 struct isl_ctx *ctx, struct isl_basic_map *bmap1,
1456 struct isl_basic_map *bmap2)
1458 struct isl_basic_set *bset;
1459 unsigned n_in, n_out;
1461 if (!bmap1 || !bmap2)
1464 isl_assert(ctx, bmap1->n_out == bmap2->n_in, goto error);
1465 isl_assert(ctx, bmap1->nparam == bmap2->nparam, goto error);
1468 n_out = bmap2->n_out;
1470 bmap2 = isl_basic_map_reverse(ctx, bmap2);
1473 bmap1 = isl_basic_map_extend(ctx, bmap1, bmap1->nparam,
1474 bmap1->n_in + bmap2->n_in, bmap1->n_out,
1475 bmap2->extra, bmap2->n_eq, bmap2->n_ineq);
1478 bmap1 = add_constraints(ctx, bmap1, bmap2, bmap1->n_in - bmap2->n_in, 0);
1479 bset = isl_basic_set_from_basic_map(ctx, bmap1);
1480 bset = isl_basic_set_project_out(ctx, bset,
1481 bset->dim - (n_in + n_out), 0);
1482 return isl_basic_map_from_basic_set(ctx, bset, n_in, n_out);
1484 isl_basic_map_free(ctx, bmap1);
1485 isl_basic_map_free(ctx, bmap2);
1489 struct isl_basic_map *isl_basic_map_apply_domain(
1490 struct isl_ctx *ctx, struct isl_basic_map *bmap1,
1491 struct isl_basic_map *bmap2)
1493 if (!bmap1 || !bmap2)
1496 isl_assert(ctx, bmap1->n_in == bmap2->n_in, goto error);
1497 isl_assert(ctx, bmap1->nparam == bmap2->nparam, goto error);
1499 bmap1 = isl_basic_map_reverse(ctx, bmap1);
1500 bmap1 = isl_basic_map_apply_range(ctx, bmap1, bmap2);
1501 return isl_basic_map_reverse(ctx, bmap1);
1503 isl_basic_map_free(ctx, bmap1);
1504 isl_basic_map_free(ctx, bmap2);
1508 static struct isl_basic_map *var_equal(struct isl_ctx *ctx,
1509 struct isl_basic_map *bmap, unsigned pos)
1512 i = isl_basic_map_alloc_equality(ctx, bmap);
1515 isl_seq_clr(bmap->eq[i],
1516 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->extra);
1517 isl_int_set_si(bmap->eq[i][1+bmap->nparam+pos], -1);
1518 isl_int_set_si(bmap->eq[i][1+bmap->nparam+bmap->n_in+pos], 1);
1519 return isl_basic_map_finalize(ctx, bmap);
1521 isl_basic_map_free(ctx, bmap);
1525 static struct isl_basic_map *var_more(struct isl_ctx *ctx,
1526 struct isl_basic_map *bmap, unsigned pos)
1529 i = isl_basic_map_alloc_inequality(ctx, bmap);
1532 isl_seq_clr(bmap->ineq[i],
1533 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->extra);
1534 isl_int_set_si(bmap->ineq[i][0], -1);
1535 isl_int_set_si(bmap->ineq[i][1+bmap->nparam+pos], -1);
1536 isl_int_set_si(bmap->ineq[i][1+bmap->nparam+bmap->n_in+pos], 1);
1537 return isl_basic_map_finalize(ctx, bmap);
1539 isl_basic_map_free(ctx, bmap);
1543 static struct isl_basic_map *var_less(struct isl_ctx *ctx,
1544 struct isl_basic_map *bmap, unsigned pos)
1547 i = isl_basic_map_alloc_inequality(ctx, bmap);
1550 isl_seq_clr(bmap->ineq[i],
1551 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->extra);
1552 isl_int_set_si(bmap->ineq[i][0], -1);
1553 isl_int_set_si(bmap->ineq[i][1+bmap->nparam+pos], 1);
1554 isl_int_set_si(bmap->ineq[i][1+bmap->nparam+bmap->n_in+pos], -1);
1555 return isl_basic_map_finalize(ctx, bmap);
1557 isl_basic_map_free(ctx, bmap);
1561 struct isl_basic_map *isl_basic_map_equal(struct isl_ctx *ctx,
1562 unsigned nparam, unsigned in, unsigned out, unsigned n_equal)
1565 struct isl_basic_map *bmap;
1566 bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, n_equal, 0);
1569 for (i = 0; i < n_equal && bmap; ++i)
1570 bmap = var_equal(ctx, bmap, i);
1571 return isl_basic_map_finalize(ctx, bmap);
1574 struct isl_basic_map *isl_basic_map_less_at(struct isl_ctx *ctx,
1575 unsigned nparam, unsigned in, unsigned out, unsigned pos)
1578 struct isl_basic_map *bmap;
1579 bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, pos, 1);
1582 for (i = 0; i < pos && bmap; ++i)
1583 bmap = var_equal(ctx, bmap, i);
1585 bmap = var_less(ctx, bmap, pos);
1586 return isl_basic_map_finalize(ctx, bmap);
1589 struct isl_basic_map *isl_basic_map_more_at(struct isl_ctx *ctx,
1590 unsigned nparam, unsigned in, unsigned out, unsigned pos)
1593 struct isl_basic_map *bmap;
1594 bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, pos, 1);
1597 for (i = 0; i < pos && bmap; ++i)
1598 bmap = var_equal(ctx, bmap, i);
1600 bmap = var_more(ctx, bmap, pos);
1601 return isl_basic_map_finalize(ctx, bmap);
1604 struct isl_basic_map *isl_basic_map_from_basic_set(
1605 struct isl_ctx *ctx, struct isl_basic_set *bset,
1606 unsigned n_in, unsigned n_out)
1608 struct isl_basic_map *bmap;
1610 bset = isl_basic_set_cow(ctx, bset);
1614 isl_assert(ctx, bset->dim == n_in + n_out, goto error);
1615 bmap = (struct isl_basic_map *) bset;
1617 bmap->n_out = n_out;
1618 return isl_basic_map_finalize(ctx, bmap);
1620 isl_basic_set_free(ctx, bset);
1624 struct isl_basic_set *isl_basic_set_from_basic_map(
1625 struct isl_ctx *ctx, struct isl_basic_map *bmap)
1629 if (bmap->n_in == 0)
1630 return (struct isl_basic_set *)bmap;
1631 bmap = isl_basic_map_cow(ctx, bmap);
1634 bmap->n_out += bmap->n_in;
1636 bmap = isl_basic_map_finalize(ctx, bmap);
1637 return (struct isl_basic_set *)bmap;
1642 struct isl_basic_set *isl_basic_map_domain(struct isl_ctx *ctx,
1643 struct isl_basic_map *bmap)
1645 struct isl_basic_set *domain;
1649 n_out = bmap->n_out;
1650 domain = isl_basic_set_from_basic_map(ctx, bmap);
1651 return isl_basic_set_project_out(ctx, domain, n_out, 0);
1654 struct isl_basic_set *isl_basic_map_range(struct isl_ctx *ctx,
1655 struct isl_basic_map *bmap)
1657 return isl_basic_map_domain(ctx,
1658 isl_basic_map_reverse(ctx, bmap));
1661 struct isl_set *isl_map_range(struct isl_ctx *ctx, struct isl_map *map)
1664 struct isl_set *set;
1668 map = isl_map_cow(ctx, map);
1672 set = (struct isl_set *) map;
1674 for (i = 0; i < map->n; ++i) {
1675 set->p[i] = isl_basic_map_range(ctx, map->p[i]);
1679 F_CLR(set, ISL_MAP_DISJOINT);
1682 isl_map_free(ctx, map);
1686 struct isl_map *isl_map_from_set(
1687 struct isl_ctx *ctx, struct isl_set *set,
1688 unsigned n_in, unsigned n_out)
1691 struct isl_map *map = NULL;
1695 isl_assert(ctx, set->dim == n_in + n_out, goto error);
1696 set = isl_set_cow(ctx, set);
1699 map = (struct isl_map *)set;
1700 for (i = 0; i < set->n; ++i) {
1701 map->p[i] = isl_basic_map_from_basic_set(ctx,
1702 set->p[i], n_in, n_out);
1710 isl_set_free(ctx, set);
1714 struct isl_map *isl_map_alloc(struct isl_ctx *ctx,
1715 unsigned nparam, unsigned in, unsigned out, int n,
1718 struct isl_map *map;
1720 map = isl_alloc(ctx, struct isl_map,
1721 sizeof(struct isl_map) +
1722 n * sizeof(struct isl_basic_map *));
1729 map->nparam = nparam;
1736 struct isl_basic_map *isl_basic_map_empty(struct isl_ctx *ctx,
1737 unsigned nparam, unsigned in, unsigned out)
1739 struct isl_basic_map *bmap;
1740 bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, 1, 0);
1741 bmap = isl_basic_map_set_to_empty(ctx, bmap);
1745 struct isl_map *isl_map_empty(struct isl_ctx *ctx,
1746 unsigned nparam, unsigned in, unsigned out)
1748 return isl_map_alloc(ctx, nparam, in, out, 0, ISL_MAP_DISJOINT);
1751 struct isl_set *isl_set_empty(struct isl_ctx *ctx,
1752 unsigned nparam, unsigned dim)
1754 return isl_set_alloc(ctx, nparam, dim, 0, ISL_MAP_DISJOINT);
1757 struct isl_map *isl_map_dup(struct isl_ctx *ctx, struct isl_map *map)
1760 struct isl_map *dup;
1762 dup = isl_map_alloc(ctx, map->nparam, map->n_in, map->n_out, map->n,
1764 for (i = 0; i < map->n; ++i)
1765 dup = isl_map_add(ctx, dup,
1766 isl_basic_map_dup(ctx, map->p[i]));
1770 struct isl_map *isl_map_add(struct isl_ctx *ctx, struct isl_map *map,
1771 struct isl_basic_map *bmap)
1775 isl_assert(ctx, map->nparam == bmap->nparam, goto error);
1776 isl_assert(ctx, map->n_in == bmap->n_in, goto error);
1777 isl_assert(ctx, map->n_out == bmap->n_out, goto error);
1778 isl_assert(ctx, map->n < map->size, goto error);
1779 map->p[map->n] = bmap;
1784 isl_map_free(ctx, map);
1786 isl_basic_map_free(ctx, bmap);
1790 void isl_map_free(struct isl_ctx *ctx, struct isl_map *map)
1800 for (i = 0; i < map->n; ++i)
1801 isl_basic_map_free(ctx, map->p[i]);
1805 struct isl_map *isl_map_extend(struct isl_ctx *ctx, struct isl_map *base,
1806 unsigned nparam, unsigned n_in, unsigned n_out)
1810 base = isl_map_cow(ctx, base);
1814 isl_assert(ctx, base->nparam <= nparam, goto error);
1815 isl_assert(ctx, base->n_in <= n_in, goto error);
1816 isl_assert(ctx, base->n_out <= n_out, goto error);
1817 base->nparam = nparam;
1819 base->n_out = n_out;
1820 for (i = 0; i < base->n; ++i) {
1821 base->p[i] = isl_basic_map_extend(ctx, base->p[i],
1822 nparam, n_in, n_out, 0, 0, 0);
1828 isl_map_free(ctx, base);
1832 struct isl_basic_map *isl_basic_map_fix_input_si(struct isl_ctx *ctx,
1833 struct isl_basic_map *bmap,
1834 unsigned input, int value)
1838 bmap = isl_basic_map_cow(ctx, bmap);
1841 isl_assert(ctx, input < bmap->n_in, goto error);
1843 bmap = isl_basic_map_extend(ctx, bmap,
1844 bmap->nparam, bmap->n_in, bmap->n_out, 0, 1, 0);
1845 j = isl_basic_map_alloc_equality(ctx, bmap);
1848 isl_int_set_si(bmap->eq[j][1+bmap->nparam+input], -1);
1849 isl_int_set_si(bmap->eq[j][0], value);
1850 return isl_basic_map_finalize(ctx, bmap);
1852 isl_basic_map_free(ctx, bmap);
1856 struct isl_map *isl_map_fix_input_si(struct isl_ctx *ctx, struct isl_map *map,
1857 unsigned input, int value)
1861 map = isl_map_cow(ctx, map);
1865 isl_assert(ctx, input < map->n_in, goto error);
1866 for (i = 0; i < map->n; ++i) {
1867 map->p[i] = isl_basic_map_fix_input_si(ctx, map->p[i],
1874 isl_map_free(ctx, map);
1878 struct isl_map *isl_map_reverse(struct isl_ctx *ctx, struct isl_map *map)
1883 map = isl_map_cow(ctx, map);
1888 map->n_in = map->n_out;
1890 for (i = 0; i < map->n; ++i) {
1891 map->p[i] = isl_basic_map_reverse(ctx, map->p[i]);
1897 isl_map_free(ctx, map);
1901 struct isl_map *isl_basic_map_lexmax(struct isl_ctx *ctx,
1902 struct isl_basic_map *bmap, struct isl_basic_set *dom,
1903 struct isl_set **empty)
1906 return pip_isl_basic_map_lexmax(ctx, bmap, dom, empty);
1908 isl_basic_map_free(ctx, bmap);
1909 isl_basic_set_free(ctx, dom);
1914 struct isl_map *isl_basic_map_lexmin(struct isl_ctx *ctx,
1915 struct isl_basic_map *bmap, struct isl_basic_set *dom,
1916 struct isl_set **empty)
1919 return pip_isl_basic_map_lexmin(ctx, bmap, dom, empty);
1921 isl_basic_map_free(ctx, bmap);
1922 isl_basic_set_free(ctx, dom);
1927 struct isl_set *isl_basic_set_lexmin(struct isl_ctx *ctx,
1928 struct isl_basic_set *bset)
1930 struct isl_basic_map *bmap = NULL;
1931 struct isl_basic_set *dom = NULL;
1932 struct isl_map *min;
1936 bmap = isl_basic_map_from_basic_set(ctx, bset, 0, bset->dim);
1939 dom = isl_basic_set_alloc(ctx, bmap->nparam, 0, 0, 0, 0);
1942 min = isl_basic_map_lexmin(ctx, bmap, dom, NULL);
1943 return isl_map_range(ctx, min);
1945 isl_basic_map_free(ctx, bmap);
1949 struct isl_map *isl_basic_map_compute_divs(struct isl_ctx *ctx,
1950 struct isl_basic_map *bmap)
1952 if (bmap->n_div == 0)
1953 return isl_map_from_basic_map(ctx, bmap);
1955 return pip_isl_basic_map_compute_divs(ctx, bmap);
1957 isl_basic_map_free(ctx, bmap);
1962 struct isl_map *isl_map_compute_divs(struct isl_ctx *ctx, struct isl_map *map)
1965 struct isl_map *res;
1971 res = isl_basic_map_compute_divs(ctx,
1972 isl_basic_map_copy(ctx, map->p[0]));
1973 for (i = 1 ; i < map->n; ++i) {
1975 r2 = isl_basic_map_compute_divs(ctx,
1976 isl_basic_map_copy(ctx, map->p[i]));
1977 if (F_ISSET(map, ISL_MAP_DISJOINT))
1978 res = isl_map_union_disjoint(ctx, res, r2);
1980 res = isl_map_union(ctx, res, r2);
1982 isl_map_free(ctx, map);
1987 struct isl_set *isl_basic_set_compute_divs(struct isl_ctx *ctx,
1988 struct isl_basic_set *bset)
1990 return (struct isl_set *)
1991 isl_basic_map_compute_divs(ctx,
1992 (struct isl_basic_map *)bset);
1995 struct isl_set *isl_map_domain(struct isl_ctx *ctx, struct isl_map *map)
1998 struct isl_set *set;
2003 map = isl_map_cow(ctx, map);
2007 set = (struct isl_set *)map;
2008 set->dim = map->n_in;
2010 for (i = 0; i < map->n; ++i) {
2011 set->p[i] = isl_basic_map_domain(ctx, map->p[i]);
2015 F_CLR(set, ISL_MAP_DISJOINT);
2018 isl_map_free(ctx, map);
2022 struct isl_map *isl_map_union_disjoint(struct isl_ctx *ctx,
2023 struct isl_map *map1, struct isl_map *map2)
2027 struct isl_map *map = NULL;
2033 isl_map_free(ctx, map1);
2037 isl_map_free(ctx, map2);
2041 isl_assert(ctx, map1->nparam == map2->nparam, goto error);
2042 isl_assert(ctx, map1->n_in == map2->n_in, goto error);
2043 isl_assert(ctx, map1->n_out == map2->n_out, goto error);
2045 if (F_ISSET(map1, ISL_MAP_DISJOINT) &&
2046 F_ISSET(map2, ISL_MAP_DISJOINT))
2047 FL_SET(flags, ISL_MAP_DISJOINT);
2049 map = isl_map_alloc(ctx, map1->nparam, map1->n_in, map1->n_out,
2050 map1->n + map2->n, flags);
2053 for (i = 0; i < map1->n; ++i) {
2054 map = isl_map_add(ctx, map,
2055 isl_basic_map_copy(ctx, map1->p[i]));
2059 for (i = 0; i < map2->n; ++i) {
2060 map = isl_map_add(ctx, map,
2061 isl_basic_map_copy(ctx, map2->p[i]));
2065 isl_map_free(ctx, map1);
2066 isl_map_free(ctx, map2);
2069 isl_map_free(ctx, map);
2070 isl_map_free(ctx, map1);
2071 isl_map_free(ctx, map2);
2075 struct isl_map *isl_map_union(struct isl_ctx *ctx,
2076 struct isl_map *map1, struct isl_map *map2)
2078 map1 = isl_map_union_disjoint(ctx, map1, map2);
2082 F_CLR(map1, ISL_MAP_DISJOINT);
2086 struct isl_set *isl_set_union_disjoint(struct isl_ctx *ctx,
2087 struct isl_set *set1, struct isl_set *set2)
2089 return (struct isl_set *)
2090 isl_map_union_disjoint(ctx,
2091 (struct isl_map *)set1, (struct isl_map *)set2);
2094 struct isl_set *isl_set_union(struct isl_ctx *ctx,
2095 struct isl_set *set1, struct isl_set *set2)
2097 return (struct isl_set *)
2099 (struct isl_map *)set1, (struct isl_map *)set2);
2102 struct isl_map *isl_map_intersect_range(
2103 struct isl_ctx *ctx, struct isl_map *map,
2104 struct isl_set *set)
2107 struct isl_map *result;
2113 if (F_ISSET(map, ISL_MAP_DISJOINT) &&
2114 F_ISSET(set, ISL_MAP_DISJOINT))
2115 FL_SET(flags, ISL_MAP_DISJOINT);
2117 result = isl_map_alloc(ctx, map->nparam, map->n_in, map->n_out,
2118 map->n * set->n, flags);
2121 for (i = 0; i < map->n; ++i)
2122 for (j = 0; j < set->n; ++j) {
2123 result = isl_map_add(ctx, result,
2124 isl_basic_map_intersect_range(ctx,
2125 isl_basic_map_copy(ctx, map->p[i]),
2126 isl_basic_set_copy(ctx, set->p[j])));
2130 isl_map_free(ctx, map);
2131 isl_set_free(ctx, set);
2134 isl_map_free(ctx, map);
2135 isl_set_free(ctx, set);
2139 struct isl_map *isl_map_intersect_domain(
2140 struct isl_ctx *ctx, struct isl_map *map,
2141 struct isl_set *set)
2143 return isl_map_reverse(ctx,
2144 isl_map_intersect_range(ctx, isl_map_reverse(ctx, map), set));
2147 struct isl_map *isl_map_apply_domain(
2148 struct isl_ctx *ctx, struct isl_map *map1,
2149 struct isl_map *map2)
2153 map1 = isl_map_reverse(ctx, map1);
2154 map1 = isl_map_apply_range(ctx, map1, map2);
2155 return isl_map_reverse(ctx, map1);
2157 isl_map_free(ctx, map1);
2158 isl_map_free(ctx, map2);
2162 struct isl_map *isl_map_apply_range(
2163 struct isl_ctx *ctx, struct isl_map *map1,
2164 struct isl_map *map2)
2166 struct isl_map *result;
2172 isl_assert(ctx, map1->nparam == map2->nparam, goto error);
2173 isl_assert(ctx, map1->n_out == map2->n_in, goto error);
2175 result = isl_map_alloc(ctx, map1->nparam, map1->n_in, map2->n_out,
2176 map1->n * map2->n, 0);
2179 for (i = 0; i < map1->n; ++i)
2180 for (j = 0; j < map2->n; ++j) {
2181 result = isl_map_add(ctx, result,
2182 isl_basic_map_apply_range(ctx,
2183 isl_basic_map_copy(ctx, map1->p[i]),
2184 isl_basic_map_copy(ctx, map2->p[j])));
2188 isl_map_free(ctx, map1);
2189 isl_map_free(ctx, map2);
2192 isl_map_free(ctx, map1);
2193 isl_map_free(ctx, map2);
2198 * returns range - domain
2200 struct isl_basic_set *isl_basic_map_deltas(struct isl_ctx *ctx,
2201 struct isl_basic_map *bmap)
2203 struct isl_basic_set *bset;
2209 isl_assert(ctx, bmap->n_in == bmap->n_out, goto error);
2211 bset = isl_basic_set_from_basic_map(ctx, bmap);
2212 bset = isl_basic_set_extend(ctx, bset, bset->nparam, 3*dim, 0,
2214 bset = isl_basic_set_swap_vars(ctx, bset, 2*dim);
2215 for (i = 0; i < dim; ++i) {
2216 int j = isl_basic_map_alloc_equality(ctx,
2217 (struct isl_basic_map *)bset);
2220 isl_int_set_si(bset->eq[j][1+bset->nparam+i], 1);
2221 isl_int_set_si(bset->eq[j][1+bset->nparam+dim+i], 1);
2222 isl_int_set_si(bset->eq[j][1+bset->nparam+2*dim+i], -1);
2224 return isl_basic_set_project_out(ctx, bset, 2*dim, 0);
2226 isl_basic_map_free(ctx, bmap);
2230 static int div_is_redundant(struct isl_ctx *ctx, struct isl_basic_map *bmap,
2234 unsigned pos = 1 + bmap->nparam + bmap->n_in + bmap->n_out + div;
2236 for (i = 0; i < bmap->n_eq; ++i)
2237 if (!isl_int_is_zero(bmap->eq[i][pos]))
2240 for (i = 0; i < bmap->n_ineq; ++i)
2241 if (!isl_int_is_zero(bmap->ineq[i][pos]))
2244 for (i = 0; i < bmap->n_div; ++i)
2245 if (!isl_int_is_zero(bmap->div[i][1+pos]))
2252 * Remove divs that don't occur in any of the constraints or other divs.
2253 * These can arise when dropping some of the variables in a quast
2254 * returned by piplib.
2256 static struct isl_basic_map *remove_redundant_divs(struct isl_ctx *ctx,
2257 struct isl_basic_map *bmap)
2261 for (i = bmap->n_div-1; i >= 0; --i) {
2262 if (!div_is_redundant(ctx, bmap, i))
2264 bmap = isl_basic_map_drop_div(ctx, bmap, i);
2269 struct isl_basic_map *isl_basic_map_finalize(struct isl_ctx *ctx,
2270 struct isl_basic_map *bmap)
2272 bmap = remove_redundant_divs(ctx, bmap);
2275 F_SET(bmap, ISL_PRIMITIVE_SET_FINAL);
2279 struct isl_basic_set *isl_basic_set_finalize(struct isl_ctx *ctx,
2280 struct isl_basic_set *bset)
2282 return (struct isl_basic_set *)
2283 isl_basic_map_finalize(ctx,
2284 (struct isl_basic_map *)bset);
2287 struct isl_set *isl_set_finalize(struct isl_ctx *ctx, struct isl_set *set)
2293 for (i = 0; i < set->n; ++i) {
2294 set->p[i] = isl_basic_set_finalize(ctx, set->p[i]);
2300 isl_set_free(ctx, set);
2304 struct isl_map *isl_map_finalize(struct isl_ctx *ctx, struct isl_map *map)
2310 for (i = 0; i < map->n; ++i) {
2311 map->p[i] = isl_basic_map_finalize(ctx, map->p[i]);
2317 isl_map_free(ctx, map);
2321 struct isl_basic_map *isl_basic_map_identity(struct isl_ctx *ctx,
2322 unsigned nparam, unsigned dim)
2324 struct isl_basic_map *bmap;
2327 bmap = isl_basic_map_alloc(ctx, nparam, dim, dim, 0, dim, 0);
2331 for (i = 0; i < dim; ++i) {
2332 int j = isl_basic_map_alloc_equality(ctx, bmap);
2335 isl_int_set_si(bmap->eq[j][1+nparam+i], 1);
2336 isl_int_set_si(bmap->eq[j][1+nparam+dim+i], -1);
2338 return isl_basic_map_finalize(ctx, bmap);
2340 isl_basic_map_free(ctx, bmap);
2344 struct isl_map *isl_map_identity(struct isl_ctx *ctx,
2345 unsigned nparam, unsigned dim)
2347 struct isl_map *map = isl_map_alloc(ctx, nparam, dim, dim, 1,
2351 map = isl_map_add(ctx, map,
2352 isl_basic_map_identity(ctx, nparam, dim));
2355 isl_map_free(ctx, map);
2359 int isl_set_is_equal(struct isl_ctx *ctx,
2360 struct isl_set *set1, struct isl_set *set2)
2362 return isl_map_is_equal(ctx,
2363 (struct isl_map *)set1, (struct isl_map *)set2);
2366 int isl_set_is_subset(struct isl_ctx *ctx,
2367 struct isl_set *set1, struct isl_set *set2)
2369 return isl_map_is_subset(ctx,
2370 (struct isl_map *)set1, (struct isl_map *)set2);
2373 int isl_basic_map_is_subset(struct isl_ctx *ctx,
2374 struct isl_basic_map *bmap1,
2375 struct isl_basic_map *bmap2)
2378 struct isl_map *map1;
2379 struct isl_map *map2;
2381 if (!bmap1 || !bmap2)
2384 map1 = isl_map_from_basic_map(ctx,
2385 isl_basic_map_copy(ctx, bmap1));
2386 map2 = isl_map_from_basic_map(ctx,
2387 isl_basic_map_copy(ctx, bmap2));
2389 is_subset = isl_map_is_subset(ctx, map1, map2);
2391 isl_map_free(ctx, map1);
2392 isl_map_free(ctx, map2);
2397 int isl_map_is_empty(struct isl_ctx *ctx, struct isl_map *map)
2404 for (i = 0; i < map->n; ++i) {
2405 is_empty = isl_basic_map_is_empty(ctx, map->p[i]);
2414 int isl_set_is_empty(struct isl_ctx *ctx, struct isl_set *set)
2416 return isl_map_is_empty(ctx, (struct isl_map *)set);
2419 int isl_map_is_subset(struct isl_ctx *ctx, struct isl_map *map1,
2420 struct isl_map *map2)
2424 struct isl_map *diff;
2429 if (isl_map_is_empty(ctx, map1))
2432 if (isl_map_is_empty(ctx, map2))
2435 diff = isl_map_subtract(ctx, isl_map_copy(ctx, map1),
2436 isl_map_copy(ctx, map2));
2440 is_subset = isl_map_is_empty(ctx, diff);
2441 isl_map_free(ctx, diff);
2446 int isl_map_is_equal(struct isl_ctx *ctx,
2447 struct isl_map *map1, struct isl_map *map2)
2453 is_subset = isl_map_is_subset(ctx, map1, map2);
2456 is_subset = isl_map_is_subset(ctx, map2, map1);
2460 int isl_basic_map_is_strict_subset(struct isl_ctx *ctx,
2461 struct isl_basic_map *bmap1,
2462 struct isl_basic_map *bmap2)
2466 if (!bmap1 || !bmap2)
2468 is_subset = isl_basic_map_is_subset(ctx, bmap1, bmap2);
2471 is_subset = isl_basic_map_is_subset(ctx, bmap2, bmap1);
2472 if (is_subset == -1)
2477 int isl_basic_map_is_empty(struct isl_ctx *ctx,
2478 struct isl_basic_map *bmap)
2480 struct isl_basic_set *bset = NULL;
2481 struct isl_set *min = NULL;
2487 bset = isl_basic_set_from_basic_map(ctx,
2488 isl_basic_map_copy(ctx, bmap));
2491 min = isl_basic_set_lexmin(ctx, bset);
2494 empty = min->n == 0;
2495 isl_set_free(ctx, min);
2499 struct isl_map *isl_basic_map_union(
2500 struct isl_ctx *ctx, struct isl_basic_map *bmap1,
2501 struct isl_basic_map *bmap2)
2503 struct isl_map *map;
2504 if (!bmap1 || !bmap2)
2507 isl_assert(ctx, bmap1->nparam == bmap2->nparam, goto error);
2508 isl_assert(ctx, bmap1->n_in == bmap2->n_in, goto error);
2509 isl_assert(ctx, bmap1->n_out == bmap2->n_out, goto error);
2511 map = isl_map_alloc(ctx, bmap1->nparam,
2512 bmap1->n_in, bmap1->n_out, 2, 0);
2515 map = isl_map_add(ctx, map, bmap1);
2516 map = isl_map_add(ctx, map, bmap2);
2519 isl_basic_map_free(ctx, bmap1);
2520 isl_basic_map_free(ctx, bmap2);
2524 struct isl_set *isl_basic_set_union(
2525 struct isl_ctx *ctx, struct isl_basic_set *bset1,
2526 struct isl_basic_set *bset2)
2528 return (struct isl_set *)isl_basic_map_union(ctx,
2529 (struct isl_basic_map *)bset1,
2530 (struct isl_basic_map *)bset2);
2533 /* Order divs such that any div only depends on previous divs */
2534 static struct isl_basic_map *order_divs(struct isl_ctx *ctx,
2535 struct isl_basic_map *bmap)
2538 unsigned off = bmap->nparam + bmap->n_in + bmap->n_out;
2540 for (i = 0; i < bmap->n_div; ++i) {
2542 pos = isl_seq_first_non_zero(bmap->div[i]+1+1+off+i,
2546 swap_div(bmap, i, pos);
2552 static int find_div(struct isl_basic_map *dst,
2553 struct isl_basic_map *src, unsigned div)
2557 unsigned total = src->nparam + src->n_in + src->n_out + src->n_div;
2559 for (i = 0; i < dst->n_div; ++i)
2560 if (isl_seq_eq(dst->div[i], src->div[div], 1+1+total) &&
2561 isl_seq_first_non_zero(dst->div[i]+1+1+total,
2562 dst->n_div - src->n_div) == -1)
2567 struct isl_basic_map *isl_basic_map_align_divs(struct isl_ctx *ctx,
2568 struct isl_basic_map *dst, struct isl_basic_map *src)
2571 unsigned total = src->nparam + src->n_in + src->n_out + src->n_div;
2573 if (src->n_div == 0)
2576 src = order_divs(ctx, src);
2577 dst = isl_basic_map_extend(ctx, dst, dst->nparam, dst->n_in,
2578 dst->n_out, src->n_div, 0, 0);
2581 for (i = 0; i < src->n_div; ++i) {
2582 int j = find_div(dst, src, i);
2584 j = isl_basic_map_alloc_div(ctx, dst);
2587 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total);
2590 swap_div(dst, i, j);
2594 isl_basic_map_free(ctx, dst);
2598 static struct isl_map *add_cut_constraint(struct isl_ctx *ctx,
2599 struct isl_map *dst,
2600 struct isl_basic_map *src, isl_int *c,
2601 unsigned len, unsigned extra, int oppose)
2603 struct isl_basic_map *copy = NULL;
2607 copy = isl_basic_map_copy(ctx, src);
2608 copy = isl_basic_map_cow(ctx, copy);
2611 copy = isl_basic_map_extend(ctx, copy,
2612 copy->nparam, copy->n_in, copy->n_out, 0, 0, 1);
2613 k = isl_basic_map_alloc_inequality(ctx, copy);
2617 isl_seq_neg(copy->ineq[k], c, len);
2619 isl_seq_cpy(copy->ineq[k], c, len);
2620 isl_seq_clr(copy->ineq[k]+len, extra);
2621 isl_inequality_negate(ctx, copy, k);
2622 is_empty = isl_basic_map_is_empty(ctx, copy);
2626 dst = isl_map_add(ctx, dst, copy);
2628 isl_basic_map_free(ctx, copy);
2631 isl_basic_map_free(ctx, copy);
2632 isl_map_free(ctx, dst);
2636 static struct isl_map *subtract(struct isl_ctx *ctx, struct isl_map *map,
2637 struct isl_basic_map *bmap)
2641 struct isl_map *rest = NULL;
2643 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
2650 if (F_ISSET(map, ISL_MAP_DISJOINT))
2651 FL_SET(flags, ISL_MAP_DISJOINT);
2653 max = map->n * (2 * bmap->n_eq + bmap->n_ineq);
2654 rest = isl_map_alloc(ctx, map->nparam, map->n_in, map->n_out,
2659 for (i = 0; i < map->n; ++i) {
2660 map->p[i] = isl_basic_map_align_divs(ctx, map->p[i], bmap);
2665 for (j = 0; j < map->n; ++j)
2666 map->p[j] = isl_basic_map_cow(ctx, map->p[j]);
2668 for (i = 0; i < bmap->n_eq; ++i) {
2669 for (j = 0; j < map->n; ++j) {
2670 rest = add_cut_constraint(ctx, rest,
2671 map->p[j], bmap->eq[i],
2672 1+total, map->p[j]->n_div - bmap->n_div, 0);
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, 1);
2682 map->p[j] = isl_basic_map_extend(ctx, map->p[j],
2683 map->p[j]->nparam, map->p[j]->n_in,
2684 map->p[j]->n_out, 0, 1, 0);
2687 k = isl_basic_map_alloc_equality(ctx, map->p[j]);
2690 isl_seq_cpy(map->p[j]->eq[k], bmap->eq[i], 1+total);
2691 isl_seq_clr(map->p[j]->eq[k]+1+total,
2692 map->p[j]->n_div - bmap->n_div);
2696 for (i = 0; i < bmap->n_ineq; ++i) {
2697 for (j = 0; j < map->n; ++j) {
2698 rest = add_cut_constraint(ctx, rest,
2699 map->p[j], bmap->ineq[i],
2700 1+total, map->p[j]->n_div - bmap->n_div, 0);
2704 map->p[j] = isl_basic_map_extend(ctx, map->p[j],
2705 map->p[j]->nparam, map->p[j]->n_in,
2706 map->p[j]->n_out, 0, 0, 1);
2709 k = isl_basic_map_alloc_inequality(ctx, map->p[j]);
2712 isl_seq_cpy(map->p[j]->ineq[k], bmap->ineq[i], 1+total);
2713 isl_seq_clr(map->p[j]->ineq[k]+1+total,
2714 map->p[j]->n_div - bmap->n_div);
2718 isl_map_free(ctx, map);
2721 isl_map_free(ctx, map);
2722 isl_map_free(ctx, rest);
2726 struct isl_map *isl_map_subtract(struct isl_ctx *ctx, struct isl_map *map1,
2727 struct isl_map *map2)
2733 isl_assert(ctx, map1->nparam == map2->nparam, goto error);
2734 isl_assert(ctx, map1->n_in == map2->n_in, goto error);
2735 isl_assert(ctx, map1->n_out == map2->n_out, goto error);
2737 if (isl_map_is_empty(ctx, map2)) {
2738 isl_map_free(ctx, map2);
2742 map1 = isl_map_compute_divs(ctx, map1);
2743 map2 = isl_map_compute_divs(ctx, map2);
2747 for (i = 0; map1 && i < map2->n; ++i)
2748 map1 = subtract(ctx, map1, map2->p[i]);
2750 isl_map_free(ctx, map2);
2753 isl_map_free(ctx, map1);
2754 isl_map_free(ctx, map2);
2758 struct isl_set *isl_set_subtract(struct isl_ctx *ctx, struct isl_set *set1,
2759 struct isl_set *set2)
2761 return (struct isl_set *)
2762 isl_map_subtract(ctx,
2763 (struct isl_map *)set1, (struct isl_map *)set2);
2766 struct isl_set *isl_set_apply(struct isl_ctx *ctx, struct isl_set *set,
2767 struct isl_map *map)
2769 isl_assert(ctx, set->dim == map->n_in, goto error);
2770 map = isl_map_intersect_domain(ctx, map, set);
2771 set = isl_map_range(ctx, map);
2774 isl_set_free(ctx, set);
2775 isl_map_free(ctx, map);