8 #include "isl_map_private.h"
9 #include "isl_map_piplib.h"
10 #include "isl_sample.h"
13 static struct isl_basic_map *basic_map_init(struct isl_ctx *ctx,
14 struct isl_basic_map *bmap,
15 unsigned nparam, unsigned n_in, unsigned n_out, unsigned extra,
16 unsigned n_eq, unsigned n_ineq)
19 size_t row_size = 1 + nparam + n_in + n_out + extra;
21 bmap->block = isl_blk_alloc(ctx, (n_eq + n_ineq) * row_size);
22 if (!bmap->block.data) {
27 bmap->eq = isl_alloc_array(ctx, isl_int *, n_eq + n_ineq);
29 isl_blk_free(ctx, bmap->block);
35 bmap->block2.size = 0;
36 bmap->block2.data = NULL;
39 bmap->block2 = isl_blk_alloc(ctx, extra * (1 + row_size));
40 if (!bmap->block2.data) {
42 isl_blk_free(ctx, bmap->block);
47 bmap->div = isl_alloc_array(ctx, isl_int *, extra);
49 isl_blk_free(ctx, bmap->block2);
51 isl_blk_free(ctx, bmap->block);
57 for (i = 0; i < n_eq + n_ineq; ++i)
58 bmap->eq[i] = bmap->block.data + i * row_size;
60 for (i = 0; i < extra; ++i)
61 bmap->div[i] = bmap->block2.data + i * (1 + row_size);
65 bmap->c_size = n_eq + n_ineq;
66 bmap->ineq = bmap->eq + n_eq;
67 bmap->nparam = nparam;
78 struct isl_basic_set *isl_basic_set_alloc(struct isl_ctx *ctx,
79 unsigned nparam, unsigned dim, unsigned extra,
80 unsigned n_eq, unsigned n_ineq)
82 struct isl_basic_map *bmap;
83 bmap = isl_basic_map_alloc(ctx, nparam, 0, dim, extra, n_eq, n_ineq);
84 return (struct isl_basic_set *)bmap;
87 struct isl_basic_map *isl_basic_map_alloc(struct isl_ctx *ctx,
88 unsigned nparam, unsigned in, unsigned out, unsigned extra,
89 unsigned n_eq, unsigned n_ineq)
91 struct isl_basic_map *bmap;
93 bmap = isl_alloc_type(ctx, struct isl_basic_map);
97 return basic_map_init(ctx, bmap,
98 nparam, in, out, extra, n_eq, n_ineq);
101 static void dup_constraints(struct isl_ctx *ctx,
102 struct isl_basic_map *dst, struct isl_basic_map *src)
105 unsigned total = src->nparam + src->n_in + src->n_out + src->n_div;
107 for (i = 0; i < src->n_eq; ++i) {
108 int j = isl_basic_map_alloc_equality(ctx, dst);
109 isl_seq_cpy(dst->eq[j], src->eq[i], 1+total);
112 for (i = 0; i < src->n_ineq; ++i) {
113 int j = isl_basic_map_alloc_inequality(ctx, dst);
114 isl_seq_cpy(dst->ineq[j], src->ineq[i], 1+total);
117 for (i = 0; i < src->n_div; ++i) {
118 int j = isl_basic_map_alloc_div(ctx, dst);
119 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total);
121 F_SET(dst, ISL_BASIC_SET_FINAL);
124 struct isl_basic_map *isl_basic_map_dup(struct isl_ctx *ctx,
125 struct isl_basic_map *bmap)
127 struct isl_basic_map *dup;
129 dup = isl_basic_map_alloc(ctx, bmap->nparam,
130 bmap->n_in, bmap->n_out,
131 bmap->n_div, bmap->n_eq, bmap->n_ineq);
134 dup_constraints(ctx, dup, bmap);
138 struct isl_basic_set *isl_basic_set_dup(struct isl_ctx *ctx,
139 struct isl_basic_set *bset)
141 struct isl_basic_map *dup;
143 dup = isl_basic_map_dup(ctx, (struct isl_basic_map *)bset);
144 return (struct isl_basic_set *)dup;
147 struct isl_basic_set *isl_basic_set_copy(struct isl_ctx *ctx,
148 struct isl_basic_set *bset)
153 if (F_ISSET(bset, ISL_BASIC_SET_FINAL)) {
157 return isl_basic_set_dup(ctx, bset);
160 struct isl_set *isl_set_copy(struct isl_ctx *ctx, struct isl_set *set)
169 struct isl_basic_map *isl_basic_map_copy(struct isl_ctx *ctx,
170 struct isl_basic_map *bmap)
175 if (F_ISSET(bmap, ISL_BASIC_SET_FINAL)) {
179 return isl_basic_map_dup(ctx, bmap);
182 struct isl_map *isl_map_copy(struct isl_ctx *ctx, struct isl_map *map)
191 void isl_basic_map_free(struct isl_ctx *ctx, struct isl_basic_map *bmap)
200 isl_blk_free(ctx, bmap->block2);
202 isl_blk_free(ctx, bmap->block);
206 void isl_basic_set_free(struct isl_ctx *ctx, struct isl_basic_set *bset)
208 isl_basic_map_free(ctx, (struct isl_basic_map *)bset);
211 int isl_basic_map_alloc_equality(struct isl_ctx *ctx,
212 struct isl_basic_map *bmap)
216 isl_assert(ctx, bmap->n_eq + bmap->n_ineq < bmap->c_size, return -1);
217 isl_assert(ctx, bmap->eq + bmap->n_eq <= bmap->ineq, return -1);
218 if (bmap->eq + bmap->n_eq == bmap->ineq) {
220 int j = isl_basic_map_alloc_inequality(ctx, bmap);
224 bmap->ineq[0] = bmap->ineq[j];
232 int isl_basic_map_free_equality(struct isl_ctx *ctx,
233 struct isl_basic_map *bmap, unsigned n)
235 isl_assert(ctx, n <= bmap->n_eq, return -1);
240 int isl_basic_map_drop_equality(struct isl_ctx *ctx,
241 struct isl_basic_map *bmap, unsigned pos)
244 isl_assert(ctx, pos < bmap->n_eq, return -1);
246 if (pos != bmap->n_eq - 1) {
248 bmap->eq[pos] = bmap->eq[bmap->n_eq - 1];
249 bmap->eq[bmap->n_eq - 1] = t;
255 int isl_basic_map_alloc_inequality(struct isl_ctx *ctx,
256 struct isl_basic_map *bmap)
258 isl_assert(ctx, (bmap->ineq - bmap->eq) + bmap->n_ineq < bmap->c_size,
260 return bmap->n_ineq++;
263 int isl_basic_map_free_inequality(struct isl_ctx *ctx,
264 struct isl_basic_map *bmap, unsigned n)
266 isl_assert(ctx, n <= bmap->n_ineq, return -1);
271 int isl_basic_map_drop_inequality(struct isl_ctx *ctx,
272 struct isl_basic_map *bmap, unsigned pos)
275 isl_assert(ctx, pos < bmap->n_ineq, return -1);
277 if (pos != bmap->n_ineq - 1) {
279 bmap->ineq[pos] = bmap->ineq[bmap->n_ineq - 1];
280 bmap->ineq[bmap->n_ineq - 1] = t;
286 int isl_basic_map_alloc_div(struct isl_ctx *ctx,
287 struct isl_basic_map *bmap)
289 isl_assert(ctx, bmap->n_div < bmap->extra, return -1);
290 return bmap->n_div++;
293 int isl_basic_map_free_div(struct isl_ctx *ctx,
294 struct isl_basic_map *bmap, unsigned n)
296 isl_assert(ctx, n <= bmap->n_div, return -1);
301 /* Copy constraint from src to dst, putting the vars of src at offset
302 * dim_off in dst and the divs of src at offset div_off in dst.
303 * If both sets are actually map, then dim_off applies to the input
306 static void copy_constraint(struct isl_basic_map *dst_map, isl_int *dst,
307 struct isl_basic_map *src_map, isl_int *src,
308 unsigned in_off, unsigned out_off, unsigned div_off)
310 isl_int_set(dst[0], src[0]);
311 isl_seq_cpy(dst+1, src+1, isl_min(dst_map->nparam, src_map->nparam));
312 isl_seq_cpy(dst+1+dst_map->nparam+in_off,
313 src+1+src_map->nparam,
314 isl_min(dst_map->n_in-in_off, src_map->n_in));
315 isl_seq_cpy(dst+1+dst_map->nparam+dst_map->n_in+out_off,
316 src+1+src_map->nparam+src_map->n_in,
317 isl_min(dst_map->n_out-out_off, src_map->n_out));
318 isl_seq_cpy(dst+1+dst_map->nparam+dst_map->n_in+dst_map->n_out+div_off,
319 src+1+src_map->nparam+src_map->n_in+src_map->n_out,
320 isl_min(dst_map->extra-div_off, src_map->extra));
323 static void copy_div(struct isl_basic_map *dst_map, isl_int *dst,
324 struct isl_basic_map *src_map, isl_int *src,
325 unsigned in_off, unsigned out_off, unsigned div_off)
327 isl_int_set(dst[0], src[0]);
328 copy_constraint(dst_map, dst+1, src_map, src+1, in_off, out_off, div_off);
331 static struct isl_basic_map *add_constraints(struct isl_ctx *ctx,
332 struct isl_basic_map *bmap1,
333 struct isl_basic_map *bmap2, unsigned i_pos, unsigned o_pos)
336 unsigned div_off = bmap1->n_div;
338 for (i = 0; i < bmap2->n_eq; ++i) {
339 int i1 = isl_basic_map_alloc_equality(ctx, bmap1);
342 copy_constraint(bmap1, bmap1->eq[i1], bmap2, bmap2->eq[i],
343 i_pos, o_pos, div_off);
346 for (i = 0; i < bmap2->n_ineq; ++i) {
347 int i1 = isl_basic_map_alloc_inequality(ctx, bmap1);
350 copy_constraint(bmap1, bmap1->ineq[i1], bmap2, bmap2->ineq[i],
351 i_pos, o_pos, div_off);
354 for (i = 0; i < bmap2->n_div; ++i) {
355 int i1 = isl_basic_map_alloc_div(ctx, bmap1);
358 copy_div(bmap1, bmap1->div[i1], bmap2, bmap2->div[i],
359 i_pos, o_pos, div_off);
362 isl_basic_map_free(ctx, bmap2);
367 isl_basic_map_free(ctx, bmap1);
368 isl_basic_map_free(ctx, bmap2);
372 struct isl_basic_map *isl_basic_map_extend(struct isl_ctx *ctx,
373 struct isl_basic_map *base,
374 unsigned nparam, unsigned n_in, unsigned n_out, unsigned extra,
375 unsigned n_eq, unsigned n_ineq)
377 struct isl_basic_map *ext;
380 base = isl_basic_map_cow(ctx, base);
384 dims_ok = base && base->nparam == nparam &&
385 base->n_in == n_in && base->n_out == n_out &&
386 base->extra >= base->n_div + extra;
388 if (dims_ok && n_eq == 0 && n_ineq == 0)
392 isl_assert(ctx, base->nparam <= nparam, goto error);
393 isl_assert(ctx, base->n_in <= n_in, goto error);
394 isl_assert(ctx, base->n_out <= n_out, goto error);
395 extra += base->extra;
397 n_ineq += base->n_ineq;
400 ext = isl_basic_map_alloc(ctx, nparam, n_in, n_out,
401 extra, n_eq, n_ineq);
407 ext = add_constraints(ctx, ext, base, 0, 0);
412 isl_basic_map_free(ctx, base);
416 struct isl_basic_set *isl_basic_set_extend(struct isl_ctx *ctx,
417 struct isl_basic_set *base,
418 unsigned nparam, unsigned dim, unsigned extra,
419 unsigned n_eq, unsigned n_ineq)
421 return (struct isl_basic_set *)
422 isl_basic_map_extend(ctx, (struct isl_basic_map *)base,
423 nparam, 0, dim, extra, n_eq, n_ineq);
426 static struct isl_basic_set *isl_basic_set_cow(struct isl_ctx *ctx,
427 struct isl_basic_set *bset)
429 return (struct isl_basic_set *)
430 isl_basic_map_cow(ctx, (struct isl_basic_map *)bset);
433 struct isl_basic_map *isl_basic_map_cow(struct isl_ctx *ctx,
434 struct isl_basic_map *bmap)
441 bmap = isl_basic_map_dup(ctx, bmap);
443 F_CLR(bmap, ISL_BASIC_SET_FINAL);
447 static struct isl_set *isl_set_cow(struct isl_ctx *ctx, struct isl_set *set)
452 return isl_set_dup(ctx, set);
455 struct isl_map *isl_map_cow(struct isl_ctx *ctx, struct isl_map *map)
460 return isl_map_dup(ctx, map);
463 static void swap_vars(struct isl_blk blk, isl_int *a,
464 unsigned a_len, unsigned b_len)
466 isl_seq_cpy(blk.data, a+a_len, b_len);
467 isl_seq_cpy(blk.data+b_len, a, a_len);
468 isl_seq_cpy(a, blk.data, b_len+a_len);
471 struct isl_basic_set *isl_basic_set_swap_vars(struct isl_ctx *ctx,
472 struct isl_basic_set *bset, unsigned n)
480 isl_assert(ctx, n <= bset->dim, goto error);
485 bset = isl_basic_set_cow(ctx, bset);
489 blk = isl_blk_alloc(ctx, bset->dim);
493 for (i = 0; i < bset->n_eq; ++i)
495 bset->eq[i]+1+bset->nparam, n, bset->dim - n);
497 for (i = 0; i < bset->n_ineq; ++i)
499 bset->ineq[i]+1+bset->nparam, n, bset->dim - n);
501 for (i = 0; i < bset->n_div; ++i)
503 bset->div[i]+1+1+bset->nparam, n, bset->dim - n);
505 isl_blk_free(ctx, blk);
510 isl_basic_set_free(ctx, bset);
514 struct isl_set *isl_set_swap_vars(struct isl_ctx *ctx,
515 struct isl_set *set, unsigned n)
518 set = isl_set_cow(ctx, set);
522 for (i = 0; i < set->n; ++i) {
523 set->p[i] = isl_basic_set_swap_vars(ctx, set->p[i], n);
525 isl_set_free(ctx, set);
532 static void constraint_drop_vars(isl_int *c, unsigned n, unsigned rem)
534 isl_seq_cpy(c, c + n, rem);
535 isl_seq_clr(c + rem, n);
538 struct isl_basic_set *isl_basic_set_drop_vars(struct isl_ctx *ctx,
539 struct isl_basic_set *bset, unsigned first, unsigned n)
546 isl_assert(ctx, first + n <= bset->dim, goto error);
551 bset = isl_basic_set_cow(ctx, bset);
555 for (i = 0; i < bset->n_eq; ++i)
556 constraint_drop_vars(bset->eq[i]+1+bset->nparam+first, n,
557 (bset->dim-first-n)+bset->extra);
559 for (i = 0; i < bset->n_ineq; ++i)
560 constraint_drop_vars(bset->ineq[i]+1+bset->nparam+first, n,
561 (bset->dim-first-n)+bset->extra);
563 for (i = 0; i < bset->n_div; ++i)
564 constraint_drop_vars(bset->div[i]+1+1+bset->nparam+first, n,
565 (bset->dim-first-n)+bset->extra);
570 return isl_basic_set_finalize(ctx, bset);
572 isl_basic_set_free(ctx, bset);
577 * We don't cow, as the div is assumed to be redundant.
579 static struct isl_basic_map *isl_basic_map_drop_div(struct isl_ctx *ctx,
580 struct isl_basic_map *bmap, unsigned div)
588 pos = 1 + bmap->nparam + bmap->n_in + bmap->n_out + div;
590 isl_assert(ctx, div < bmap->n_div, goto error);
592 for (i = 0; i < bmap->n_eq; ++i)
593 constraint_drop_vars(bmap->eq[i]+pos, 1, bmap->extra-div-1);
595 for (i = 0; i < bmap->n_ineq; ++i) {
596 if (!isl_int_is_zero(bmap->ineq[i][pos])) {
597 isl_basic_map_drop_inequality(ctx, bmap, i);
601 constraint_drop_vars(bmap->ineq[i]+pos, 1, bmap->extra-div-1);
604 for (i = 0; i < bmap->n_div; ++i)
605 constraint_drop_vars(bmap->div[i]+1+pos, 1, bmap->extra-div-1);
607 if (div != bmap->n_div - 1) {
609 isl_int *t = bmap->div[div];
611 for (j = div; j < bmap->n_div - 1; ++j)
612 bmap->div[j] = bmap->div[j+1];
614 bmap->div[bmap->n_div - 1] = t;
616 isl_basic_map_free_div(ctx, bmap, 1);
620 isl_basic_map_free(ctx, bmap);
624 static void eliminate_div(struct isl_ctx *ctx, struct isl_basic_map *bmap,
625 isl_int *eq, unsigned div)
628 unsigned pos = 1 + bmap->nparam + bmap->n_in + bmap->n_out + div;
630 len = 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
632 for (i = 0; i < bmap->n_eq; ++i)
633 if (bmap->eq[i] != eq)
634 isl_seq_elim(bmap->eq[i], eq, pos, len, NULL);
636 for (i = 0; i < bmap->n_ineq; ++i)
637 isl_seq_elim(bmap->ineq[i], eq, pos, len, NULL);
639 /* We need to be careful about circular definitions,
640 * so for now we just remove the definitions of other divs that
641 * depend on this div and (possibly) recompute them later.
643 for (i = 0; i < bmap->n_div; ++i)
644 if (!isl_int_is_zero(bmap->div[i][0]) &&
645 !isl_int_is_zero(bmap->div[i][1 + pos]))
646 isl_seq_clr(bmap->div[i], 1 + len);
648 isl_basic_map_drop_div(ctx, bmap, div);
651 struct isl_basic_map *isl_basic_map_set_to_empty(
652 struct isl_ctx *ctx, struct isl_basic_map *bmap)
658 total = bmap->nparam + bmap->n_in + bmap->n_out;
659 isl_basic_map_free_div(ctx, bmap, bmap->n_div);
660 isl_basic_map_free_inequality(ctx, bmap, bmap->n_ineq);
662 isl_basic_map_free_equality(ctx, bmap, bmap->n_eq-1);
664 isl_basic_map_alloc_equality(ctx, bmap);
668 isl_int_set_si(bmap->eq[i][0], 1);
669 isl_seq_clr(bmap->eq[i]+1, total);
670 F_SET(bmap, ISL_BASIC_MAP_EMPTY);
671 return isl_basic_map_finalize(ctx, bmap);
673 isl_basic_map_free(ctx, bmap);
677 static void swap_equality(struct isl_basic_map *bmap, int a, int b)
679 isl_int *t = bmap->eq[a];
680 bmap->eq[a] = bmap->eq[b];
684 static void swap_inequality(struct isl_basic_map *bmap, int a, int b)
686 isl_int *t = bmap->ineq[a];
687 bmap->ineq[a] = bmap->ineq[b];
691 static void swap_div(struct isl_basic_map *bmap, int a, int b)
694 unsigned off = bmap->nparam + bmap->n_in + bmap->n_out;
695 isl_int *t = bmap->div[a];
696 bmap->div[a] = bmap->div[b];
699 for (i = 0; i < bmap->n_eq; ++i)
700 isl_int_swap(bmap->eq[i][1+off+a], bmap->eq[i][1+off+b]);
702 for (i = 0; i < bmap->n_ineq; ++i)
703 isl_int_swap(bmap->ineq[i][1+off+a], bmap->ineq[i][1+off+b]);
705 for (i = 0; i < bmap->n_div; ++i)
706 isl_int_swap(bmap->div[i][1+1+off+a], bmap->div[i][1+1+off+b]);
709 struct isl_basic_map *isl_basic_map_gauss(struct isl_ctx *ctx,
710 struct isl_basic_map *bmap, int *progress)
721 total_var = bmap->nparam + bmap->n_in + bmap->n_out;
722 total = total_var + bmap->n_div;
724 last_var = total - 1;
725 for (done = 0; done < bmap->n_eq; ++done) {
726 for (; last_var >= 0; --last_var) {
727 for (k = done; k < bmap->n_eq; ++k)
728 if (!isl_int_is_zero(bmap->eq[k][1+last_var]))
736 swap_equality(bmap, k, done);
737 if (isl_int_is_neg(bmap->eq[done][1+last_var]))
738 isl_seq_neg(bmap->eq[done], bmap->eq[done], 1+total);
740 for (k = 0; k < bmap->n_eq; ++k) {
743 if (isl_int_is_zero(bmap->eq[k][1+last_var]))
747 isl_seq_elim(bmap->eq[k], bmap->eq[done],
748 1+last_var, 1+total, NULL);
751 for (k = 0; k < bmap->n_ineq; ++k) {
752 if (isl_int_is_zero(bmap->ineq[k][1+last_var]))
756 isl_seq_elim(bmap->ineq[k], bmap->eq[done],
757 1+last_var, 1+total, NULL);
760 for (k = 0; k < bmap->n_div; ++k) {
761 if (isl_int_is_zero(bmap->div[k][0]))
763 if (isl_int_is_zero(bmap->div[k][1+1+last_var]))
767 isl_seq_elim(bmap->div[k]+1, bmap->eq[done],
768 1+last_var, 1+total, &bmap->div[k][0]);
771 if (last_var >= total_var &&
772 isl_int_is_zero(bmap->div[last_var - total_var][0])) {
773 unsigned div = last_var - total_var;
774 isl_seq_neg(bmap->div[div]+1, bmap->eq[done], 1+total);
775 isl_int_set_si(bmap->div[div][1+1+last_var], 0);
776 isl_int_set(bmap->div[div][0],
777 bmap->eq[done][1+last_var]);
780 if (done == bmap->n_eq)
782 for (k = done; k < bmap->n_eq; ++k) {
783 if (isl_int_is_zero(bmap->eq[k][0]))
785 return isl_basic_map_set_to_empty(ctx, bmap);
787 isl_basic_map_free_equality(ctx, bmap, bmap->n_eq-done);
791 static unsigned int round_up(unsigned int v)
802 static struct isl_basic_map *remove_duplicate_constraints(
804 struct isl_basic_map *bmap, int *progress)
810 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
812 if (bmap->n_ineq <= 1)
815 size = round_up(4 * bmap->n_ineq / 3 - 1);
816 bits = ffs(size) - 1;
817 index = isl_alloc_array(ctx, int, size);
818 memset(index, 0, size * sizeof(int));
822 index[isl_seq_hash(bmap->ineq[0]+1, total, bits)] = 1;
823 for (k = 1; k < bmap->n_ineq; ++k) {
824 u_int32_t hash = isl_seq_hash(bmap->ineq[k]+1, total, bits);
825 for (h = hash; index[h]; h = (h+1) % size)
826 if (isl_seq_eq(bmap->ineq[k]+1,
827 bmap->ineq[index[h]-1]+1, total))
835 if (isl_int_lt(bmap->ineq[k][0], bmap->ineq[l][0]))
836 swap_inequality(bmap, k, l);
837 isl_basic_map_drop_inequality(ctx, bmap, k);
845 static struct isl_basic_map *remove_duplicate_divs(struct isl_ctx *ctx,
846 struct isl_basic_map *bmap, int *progress)
853 unsigned total_var = bmap->nparam + bmap->n_in + bmap->n_out;
854 unsigned total = total_var + bmap->n_div;
856 if (bmap->n_div <= 1)
859 for (k = bmap->n_div - 1; k >= 0; --k)
860 if (!isl_int_is_zero(bmap->div[k][0]))
865 size = round_up(4 * bmap->n_div / 3 - 1);
866 bits = ffs(size) - 1;
867 index = isl_alloc_array(ctx, int, size);
868 memset(index, 0, size * sizeof(int));
871 eq = isl_blk_alloc(ctx, 1+total);
875 isl_seq_clr(eq.data, 1+total);
876 index[isl_seq_hash(bmap->div[k], 2+total, bits)] = k + 1;
877 for (--k; k >= 0; --k) {
880 if (isl_int_is_zero(bmap->div[k][0]))
883 hash = isl_seq_hash(bmap->div[k], 2+total, bits);
884 for (h = hash; index[h]; h = (h+1) % size)
885 if (isl_seq_eq(bmap->div[k],
886 bmap->div[index[h]-1], 2+total))
891 isl_int_set_si(eq.data[1+total_var+k], -1);
892 isl_int_set_si(eq.data[1+total_var+l], 1);
893 eliminate_div(ctx, bmap, eq.data, l);
894 isl_int_set_si(eq.data[1+total_var+k], 0);
895 isl_int_set_si(eq.data[1+total_var+l], 0);
900 isl_blk_free(ctx, eq);
906 static struct isl_basic_map *eliminate_divs(
907 struct isl_ctx *ctx, struct isl_basic_map *bmap,
918 off = 1 + bmap->nparam + bmap->n_in + bmap->n_out;
920 for (d = bmap->n_div - 1; d >= 0 ; --d) {
921 for (i = 0; i < bmap->n_eq; ++i) {
922 if (!isl_int_is_one(bmap->eq[i][off + d]) &&
923 !isl_int_is_negone(bmap->eq[i][off + d]))
927 eliminate_div(ctx, bmap, bmap->eq[i], d);
928 isl_basic_map_drop_equality(ctx, bmap, i);
932 return eliminate_divs(ctx, bmap, progress);
936 static struct isl_basic_map *normalize_constraints(
937 struct isl_ctx *ctx, struct isl_basic_map *bmap)
941 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
944 for (i = bmap->n_eq - 1; i >= 0; --i) {
945 isl_seq_gcd(bmap->eq[i]+1, total, &gcd);
946 if (isl_int_is_zero(gcd)) {
947 if (!isl_int_is_zero(bmap->eq[i][0])) {
948 bmap = isl_basic_map_set_to_empty(ctx, bmap);
951 isl_basic_map_drop_equality(ctx, bmap, i);
954 if (isl_int_is_one(gcd))
956 if (!isl_int_is_divisible_by(bmap->eq[i][0], gcd)) {
957 bmap = isl_basic_map_set_to_empty(ctx, bmap);
960 isl_seq_scale_down(bmap->eq[i], bmap->eq[i], gcd, 1+total);
963 for (i = bmap->n_ineq - 1; i >= 0; --i) {
964 isl_seq_gcd(bmap->ineq[i]+1, total, &gcd);
965 if (isl_int_is_zero(gcd)) {
966 if (isl_int_is_neg(bmap->ineq[i][0])) {
967 bmap = isl_basic_map_set_to_empty(ctx, bmap);
970 isl_basic_map_drop_inequality(ctx, bmap, i);
973 if (isl_int_is_one(gcd))
975 isl_int_fdiv_q(bmap->ineq[i][0], bmap->ineq[i][0], gcd);
976 isl_seq_scale_down(bmap->ineq[i]+1, bmap->ineq[i]+1, gcd, total);
983 struct isl_basic_map *isl_basic_map_simplify(
984 struct isl_ctx *ctx, struct isl_basic_map *bmap)
991 bmap = normalize_constraints(ctx, bmap);
992 bmap = eliminate_divs(ctx, bmap, &progress);
993 bmap = isl_basic_map_gauss(ctx, bmap, &progress);
994 bmap = remove_duplicate_divs(ctx, bmap, &progress);
995 bmap = remove_duplicate_constraints(ctx, bmap, &progress);
1000 struct isl_basic_set *isl_basic_set_simplify(
1001 struct isl_ctx *ctx, struct isl_basic_set *bset)
1003 return (struct isl_basic_set *)
1004 isl_basic_map_simplify(ctx,
1005 (struct isl_basic_map *)bset);
1008 static void dump_term(struct isl_basic_map *bmap,
1009 isl_int c, int pos, FILE *out)
1011 unsigned in = bmap->n_in;
1012 unsigned dim = bmap->n_in + bmap->n_out;
1014 isl_int_print(out, c);
1016 if (!isl_int_is_one(c))
1017 isl_int_print(out, c);
1018 if (pos < 1 + bmap->nparam)
1019 fprintf(out, "p%d", pos - 1);
1020 else if (pos < 1 + bmap->nparam + in)
1021 fprintf(out, "i%d", pos - 1 - bmap->nparam);
1022 else if (pos < 1 + bmap->nparam + dim)
1023 fprintf(out, "o%d", pos - 1 - bmap->nparam - in);
1025 fprintf(out, "e%d", pos - 1 - bmap->nparam - dim);
1029 static void dump_constraint_sign(struct isl_basic_map *bmap, isl_int *c,
1030 int sign, FILE *out)
1034 unsigned len = 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
1038 for (i = 0, first = 1; i < len; ++i) {
1039 if (isl_int_sgn(c[i]) * sign <= 0)
1042 fprintf(out, " + ");
1044 isl_int_abs(v, c[i]);
1045 dump_term(bmap, v, i, out);
1052 static void dump_constraint(struct isl_basic_map *bmap, isl_int *c,
1053 const char *op, FILE *out, int indent)
1055 fprintf(out, "%*s", indent, "");
1057 dump_constraint_sign(bmap, c, 1, out);
1058 fprintf(out, " %s ", op);
1059 dump_constraint_sign(bmap, c, -1, out);
1064 static void dump_constraints(struct isl_basic_map *bmap,
1065 isl_int **c, unsigned n,
1066 const char *op, FILE *out, int indent)
1070 for (i = 0; i < n; ++i)
1071 dump_constraint(bmap, c[i], op, out, indent);
1074 static void dump_affine(struct isl_basic_map *bmap, isl_int *exp, FILE *out)
1078 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
1080 for (j = 0; j < 1 + total; ++j) {
1081 if (isl_int_is_zero(exp[j]))
1083 if (!first && isl_int_is_pos(exp[j]))
1085 dump_term(bmap, exp[j], j, out);
1090 static void dump(struct isl_basic_map *bmap, FILE *out, int indent)
1094 dump_constraints(bmap, bmap->eq, bmap->n_eq, "=", out, indent);
1095 dump_constraints(bmap, bmap->ineq, bmap->n_ineq, ">=", out, indent);
1097 for (i = 0; i < bmap->n_div; ++i) {
1098 fprintf(out, "%*s", indent, "");
1099 fprintf(out, "e%d = [(", i);
1100 dump_affine(bmap, bmap->div[i]+1, out);
1102 isl_int_print(out, bmap->div[i][0]);
1103 fprintf(out, "]\n");
1107 void isl_basic_set_dump(struct isl_ctx *ctx, struct isl_basic_set *bset,
1108 FILE *out, int indent)
1110 fprintf(out, "%*s", indent, "");
1111 fprintf(out, "nparam: %d, dim: %d, extra: %d\n",
1112 bset->nparam, bset->dim, bset->extra);
1113 dump((struct isl_basic_map *)bset, out, indent);
1116 void isl_basic_map_dump(struct isl_ctx *ctx, struct isl_basic_map *bmap,
1117 FILE *out, int indent)
1119 fprintf(out, "%*s", indent, "");
1120 fprintf(out, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d\n",
1122 bmap->nparam, bmap->n_in, bmap->n_out, bmap->extra);
1123 dump(bmap, out, indent);
1126 int isl_inequality_negate(struct isl_ctx *ctx,
1127 struct isl_basic_map *bmap, unsigned pos)
1129 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
1130 isl_assert(ctx, pos < bmap->n_ineq, return -1);
1131 isl_seq_neg(bmap->ineq[pos], bmap->ineq[pos], 1 + total);
1132 isl_int_sub_ui(bmap->ineq[pos][0], bmap->ineq[pos][0], 1);
1136 struct isl_set *isl_set_alloc(struct isl_ctx *ctx,
1137 unsigned nparam, unsigned dim, int n, unsigned flags)
1139 struct isl_set *set;
1141 set = isl_alloc(ctx, struct isl_set,
1142 sizeof(struct isl_set) +
1143 n * sizeof(struct isl_basic_set *));
1150 set->nparam = nparam;
1157 struct isl_set *isl_set_dup(struct isl_ctx *ctx, struct isl_set *set)
1160 struct isl_set *dup;
1162 dup = isl_set_alloc(ctx, set->nparam, set->dim, set->n, set->flags);
1165 for (i = 0; i < set->n; ++i)
1166 dup = isl_set_add(ctx, dup,
1167 isl_basic_set_dup(ctx, set->p[i]));
1171 struct isl_set *isl_set_from_basic_set(struct isl_ctx *ctx,
1172 struct isl_basic_set *bset)
1174 struct isl_set *set;
1176 set = isl_set_alloc(ctx, bset->nparam, bset->dim, 1, ISL_MAP_DISJOINT);
1178 isl_basic_set_free(ctx, bset);
1181 return isl_set_add(ctx, set, bset);
1184 struct isl_map *isl_map_from_basic_map(struct isl_ctx *ctx,
1185 struct isl_basic_map *bmap)
1187 struct isl_map *map;
1189 map = isl_map_alloc(ctx, bmap->nparam, bmap->n_in, bmap->n_out, 1,
1192 isl_basic_map_free(ctx, bmap);
1195 return isl_map_add(ctx, map, bmap);
1198 struct isl_set *isl_set_add(struct isl_ctx *ctx, struct isl_set *set,
1199 struct isl_basic_set *bset)
1203 isl_assert(ctx, set->nparam == bset->nparam, goto error);
1204 isl_assert(ctx, set->dim == bset->dim, goto error);
1205 isl_assert(ctx, set->n < set->size, goto error);
1206 set->p[set->n] = bset;
1211 isl_set_free(ctx, set);
1213 isl_basic_set_free(ctx, bset);
1217 void isl_set_free(struct isl_ctx *ctx, struct isl_set *set)
1227 for (i = 0; i < set->n; ++i)
1228 isl_basic_set_free(ctx, set->p[i]);
1232 void isl_set_dump(struct isl_ctx *ctx, struct isl_set *set, FILE *out,
1238 fprintf(out, "null set\n");
1242 fprintf(out, "%*s", indent, "");
1243 fprintf(out, "ref: %d, n: %d\n", set->ref, set->n);
1244 for (i = 0; i < set->n; ++i) {
1245 fprintf(out, "%*s", indent, "");
1246 fprintf(out, "basic set %d:\n", i);
1247 isl_basic_set_dump(ctx, set->p[i], out, indent+4);
1251 void isl_map_dump(struct isl_ctx *ctx, struct isl_map *map, FILE *out,
1256 fprintf(out, "%*s", indent, "");
1257 fprintf(out, "ref: %d, n: %d, nparam: %d, in: %d, out: %d\n",
1258 map->ref, map->n, map->nparam, map->n_in, map->n_out);
1259 for (i = 0; i < map->n; ++i) {
1260 fprintf(out, "%*s", indent, "");
1261 fprintf(out, "basic map %d:\n", i);
1262 isl_basic_map_dump(ctx, map->p[i], out, indent+4);
1266 struct isl_basic_map *isl_basic_map_intersect_domain(
1267 struct isl_ctx *ctx, struct isl_basic_map *bmap,
1268 struct isl_basic_set *bset)
1270 struct isl_basic_map *bmap_domain;
1275 isl_assert(ctx, bset->dim == bmap->n_in, goto error);
1276 isl_assert(ctx, bset->nparam == bmap->nparam, goto error);
1278 bmap = isl_basic_map_extend(ctx, bmap,
1279 bset->nparam, bmap->n_in, bmap->n_out,
1280 bset->n_div, bset->n_eq, bset->n_ineq);
1283 bmap_domain = isl_basic_map_from_basic_set(ctx, bset,
1285 bmap = add_constraints(ctx, bmap, bmap_domain, 0, 0);
1287 return isl_basic_map_finalize(ctx, bmap);
1289 isl_basic_map_free(ctx, bmap);
1290 isl_basic_set_free(ctx, bset);
1294 struct isl_basic_map *isl_basic_map_intersect_range(
1295 struct isl_ctx *ctx, struct isl_basic_map *bmap,
1296 struct isl_basic_set *bset)
1298 struct isl_basic_map *bmap_range;
1303 isl_assert(ctx, bset->dim == bmap->n_out, goto error);
1304 isl_assert(ctx, bset->nparam == bmap->nparam, goto error);
1306 bmap = isl_basic_map_extend(ctx, bmap,
1307 bset->nparam, bmap->n_in, bmap->n_out,
1308 bset->n_div, bset->n_eq, bset->n_ineq);
1311 bmap_range = isl_basic_map_from_basic_set(ctx, bset,
1313 bmap = add_constraints(ctx, bmap, bmap_range, 0, 0);
1315 return isl_basic_map_finalize(ctx, bmap);
1317 isl_basic_map_free(ctx, bmap);
1318 isl_basic_set_free(ctx, bset);
1322 struct isl_basic_map *isl_basic_map_intersect(
1323 struct isl_ctx *ctx, struct isl_basic_map *bmap1,
1324 struct isl_basic_map *bmap2)
1326 isl_assert(ctx, bmap1->nparam == bmap2->nparam, goto error);
1327 isl_assert(ctx, bmap1->n_in == bmap2->n_in, goto error);
1328 isl_assert(ctx, bmap1->n_out == bmap2->n_out, goto error);
1330 bmap1 = isl_basic_map_extend(ctx, bmap1,
1331 bmap1->nparam, bmap1->n_in, bmap1->n_out,
1332 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
1335 bmap1 = add_constraints(ctx, bmap1, bmap2, 0, 0);
1337 return isl_basic_map_finalize(ctx, bmap1);
1339 isl_basic_map_free(ctx, bmap1);
1340 isl_basic_map_free(ctx, bmap2);
1344 struct isl_basic_set *isl_basic_set_intersect(
1345 struct isl_ctx *ctx, struct isl_basic_set *bset1,
1346 struct isl_basic_set *bset2)
1348 return (struct isl_basic_set *)
1349 isl_basic_map_intersect(ctx,
1350 (struct isl_basic_map *)bset1,
1351 (struct isl_basic_map *)bset2);
1354 struct isl_map *isl_map_intersect(struct isl_ctx *ctx, struct isl_map *map1,
1355 struct isl_map *map2)
1358 struct isl_map *result;
1364 if (F_ISSET(map1, ISL_MAP_DISJOINT) &&
1365 F_ISSET(map2, ISL_MAP_DISJOINT))
1366 FL_SET(flags, ISL_MAP_DISJOINT);
1368 result = isl_map_alloc(ctx, map1->nparam, map1->n_in, map1->n_out,
1369 map1->n * map2->n, flags);
1372 for (i = 0; i < map1->n; ++i)
1373 for (j = 0; j < map2->n; ++j) {
1374 struct isl_basic_map *part;
1375 part = isl_basic_map_intersect(ctx,
1376 isl_basic_map_copy(ctx, map1->p[i]),
1377 isl_basic_map_copy(ctx, map2->p[j]));
1378 if (isl_basic_map_is_empty(ctx, part))
1379 isl_basic_map_free(ctx, part);
1381 result = isl_map_add(ctx, result, part);
1385 isl_map_free(ctx, map1);
1386 isl_map_free(ctx, map2);
1389 isl_map_free(ctx, map1);
1390 isl_map_free(ctx, map2);
1394 struct isl_basic_map *isl_basic_map_reverse(struct isl_ctx *ctx,
1395 struct isl_basic_map *bmap)
1397 struct isl_basic_set *bset;
1402 bmap = isl_basic_map_cow(ctx, bmap);
1406 bset = isl_basic_set_from_basic_map(ctx, bmap);
1407 bset = isl_basic_set_swap_vars(ctx, bset, in);
1408 return isl_basic_map_from_basic_set(ctx, bset, bset->dim-in, in);
1411 /* Turn final n dimensions into existentially quantified variables.
1413 struct isl_basic_set *isl_basic_set_project_out(
1414 struct isl_ctx *ctx, struct isl_basic_set *bset,
1415 unsigned n, unsigned flags)
1425 isl_assert(ctx, n <= bset->dim, goto error);
1430 bset = isl_basic_set_cow(ctx, bset);
1432 row_size = 1 + bset->nparam + bset->dim + bset->extra;
1433 old = bset->block2.data;
1434 bset->block2 = isl_blk_extend(ctx, bset->block2,
1435 (bset->extra + n) * (1 + row_size));
1436 if (!bset->block2.data)
1438 new_div = isl_alloc_array(ctx, isl_int *, bset->extra + n);
1441 for (i = 0; i < n; ++i) {
1442 new_div[i] = bset->block2.data +
1443 (bset->extra + i) * (1 + row_size);
1444 isl_seq_clr(new_div[i], 1 + row_size);
1446 for (i = 0; i < bset->extra; ++i)
1447 new_div[n + i] = bset->block2.data + (bset->div[i] - old);
1449 bset->div = new_div;
1453 bset = isl_basic_set_simplify(ctx, bset);
1454 return isl_basic_set_finalize(ctx, bset);
1456 isl_basic_set_free(ctx, bset);
1460 struct isl_basic_map *isl_basic_map_apply_range(
1461 struct isl_ctx *ctx, struct isl_basic_map *bmap1,
1462 struct isl_basic_map *bmap2)
1464 struct isl_basic_set *bset;
1465 unsigned n_in, n_out;
1467 if (!bmap1 || !bmap2)
1470 isl_assert(ctx, bmap1->n_out == bmap2->n_in, goto error);
1471 isl_assert(ctx, bmap1->nparam == bmap2->nparam, goto error);
1474 n_out = bmap2->n_out;
1476 bmap2 = isl_basic_map_reverse(ctx, bmap2);
1479 bmap1 = isl_basic_map_extend(ctx, bmap1, bmap1->nparam,
1480 bmap1->n_in + bmap2->n_in, bmap1->n_out,
1481 bmap2->extra, bmap2->n_eq, bmap2->n_ineq);
1484 bmap1 = add_constraints(ctx, bmap1, bmap2, bmap1->n_in - bmap2->n_in, 0);
1485 bset = isl_basic_set_from_basic_map(ctx, bmap1);
1486 bset = isl_basic_set_project_out(ctx, bset,
1487 bset->dim - (n_in + n_out), 0);
1488 return isl_basic_map_from_basic_set(ctx, bset, n_in, n_out);
1490 isl_basic_map_free(ctx, bmap1);
1491 isl_basic_map_free(ctx, bmap2);
1495 struct isl_basic_map *isl_basic_map_apply_domain(
1496 struct isl_ctx *ctx, struct isl_basic_map *bmap1,
1497 struct isl_basic_map *bmap2)
1499 if (!bmap1 || !bmap2)
1502 isl_assert(ctx, bmap1->n_in == bmap2->n_in, goto error);
1503 isl_assert(ctx, bmap1->nparam == bmap2->nparam, goto error);
1505 bmap1 = isl_basic_map_reverse(ctx, bmap1);
1506 bmap1 = isl_basic_map_apply_range(ctx, bmap1, bmap2);
1507 return isl_basic_map_reverse(ctx, bmap1);
1509 isl_basic_map_free(ctx, bmap1);
1510 isl_basic_map_free(ctx, bmap2);
1514 static struct isl_basic_map *var_equal(struct isl_ctx *ctx,
1515 struct isl_basic_map *bmap, unsigned pos)
1518 i = isl_basic_map_alloc_equality(ctx, bmap);
1521 isl_seq_clr(bmap->eq[i],
1522 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->extra);
1523 isl_int_set_si(bmap->eq[i][1+bmap->nparam+pos], -1);
1524 isl_int_set_si(bmap->eq[i][1+bmap->nparam+bmap->n_in+pos], 1);
1525 return isl_basic_map_finalize(ctx, bmap);
1527 isl_basic_map_free(ctx, bmap);
1531 static struct isl_basic_map *var_more(struct isl_ctx *ctx,
1532 struct isl_basic_map *bmap, unsigned pos)
1535 i = isl_basic_map_alloc_inequality(ctx, bmap);
1538 isl_seq_clr(bmap->ineq[i],
1539 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->extra);
1540 isl_int_set_si(bmap->ineq[i][0], -1);
1541 isl_int_set_si(bmap->ineq[i][1+bmap->nparam+pos], -1);
1542 isl_int_set_si(bmap->ineq[i][1+bmap->nparam+bmap->n_in+pos], 1);
1543 return isl_basic_map_finalize(ctx, bmap);
1545 isl_basic_map_free(ctx, bmap);
1549 static struct isl_basic_map *var_less(struct isl_ctx *ctx,
1550 struct isl_basic_map *bmap, unsigned pos)
1553 i = isl_basic_map_alloc_inequality(ctx, bmap);
1556 isl_seq_clr(bmap->ineq[i],
1557 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->extra);
1558 isl_int_set_si(bmap->ineq[i][0], -1);
1559 isl_int_set_si(bmap->ineq[i][1+bmap->nparam+pos], 1);
1560 isl_int_set_si(bmap->ineq[i][1+bmap->nparam+bmap->n_in+pos], -1);
1561 return isl_basic_map_finalize(ctx, bmap);
1563 isl_basic_map_free(ctx, bmap);
1567 struct isl_basic_map *isl_basic_map_equal(struct isl_ctx *ctx,
1568 unsigned nparam, unsigned in, unsigned out, unsigned n_equal)
1571 struct isl_basic_map *bmap;
1572 bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, n_equal, 0);
1575 for (i = 0; i < n_equal && bmap; ++i)
1576 bmap = var_equal(ctx, bmap, i);
1577 return isl_basic_map_finalize(ctx, bmap);
1580 struct isl_basic_map *isl_basic_map_less_at(struct isl_ctx *ctx,
1581 unsigned nparam, unsigned in, unsigned out, unsigned pos)
1584 struct isl_basic_map *bmap;
1585 bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, pos, 1);
1588 for (i = 0; i < pos && bmap; ++i)
1589 bmap = var_equal(ctx, bmap, i);
1591 bmap = var_less(ctx, bmap, pos);
1592 return isl_basic_map_finalize(ctx, bmap);
1595 struct isl_basic_map *isl_basic_map_more_at(struct isl_ctx *ctx,
1596 unsigned nparam, unsigned in, unsigned out, unsigned pos)
1599 struct isl_basic_map *bmap;
1600 bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, pos, 1);
1603 for (i = 0; i < pos && bmap; ++i)
1604 bmap = var_equal(ctx, bmap, i);
1606 bmap = var_more(ctx, bmap, pos);
1607 return isl_basic_map_finalize(ctx, bmap);
1610 struct isl_basic_map *isl_basic_map_from_basic_set(
1611 struct isl_ctx *ctx, struct isl_basic_set *bset,
1612 unsigned n_in, unsigned n_out)
1614 struct isl_basic_map *bmap;
1616 bset = isl_basic_set_cow(ctx, bset);
1620 isl_assert(ctx, bset->dim == n_in + n_out, goto error);
1621 bmap = (struct isl_basic_map *) bset;
1623 bmap->n_out = n_out;
1624 return isl_basic_map_finalize(ctx, bmap);
1626 isl_basic_set_free(ctx, bset);
1630 struct isl_basic_set *isl_basic_set_from_basic_map(
1631 struct isl_ctx *ctx, struct isl_basic_map *bmap)
1635 if (bmap->n_in == 0)
1636 return (struct isl_basic_set *)bmap;
1637 bmap = isl_basic_map_cow(ctx, bmap);
1640 bmap->n_out += bmap->n_in;
1642 bmap = isl_basic_map_finalize(ctx, bmap);
1643 return (struct isl_basic_set *)bmap;
1648 static struct isl_basic_set *isl_basic_map_underlying_set(
1649 struct isl_ctx *ctx, struct isl_basic_map *bmap)
1653 if (bmap->nparam == 0 && bmap->n_in == 0 && bmap->n_div == 0)
1654 return (struct isl_basic_set *)bmap;
1655 bmap = isl_basic_map_cow(ctx, bmap);
1658 bmap->n_out += bmap->nparam + bmap->n_in + bmap->n_div;
1662 bmap = isl_basic_map_finalize(ctx, bmap);
1663 return (struct isl_basic_set *)bmap;
1668 struct isl_basic_set *isl_basic_map_domain(struct isl_ctx *ctx,
1669 struct isl_basic_map *bmap)
1671 struct isl_basic_set *domain;
1675 n_out = bmap->n_out;
1676 domain = isl_basic_set_from_basic_map(ctx, bmap);
1677 return isl_basic_set_project_out(ctx, domain, n_out, 0);
1680 struct isl_basic_set *isl_basic_map_range(struct isl_ctx *ctx,
1681 struct isl_basic_map *bmap)
1683 return isl_basic_map_domain(ctx,
1684 isl_basic_map_reverse(ctx, bmap));
1687 struct isl_set *isl_map_range(struct isl_ctx *ctx, struct isl_map *map)
1690 struct isl_set *set;
1694 map = isl_map_cow(ctx, map);
1698 set = (struct isl_set *) map;
1700 for (i = 0; i < map->n; ++i) {
1701 set->p[i] = isl_basic_map_range(ctx, map->p[i]);
1705 F_CLR(set, ISL_MAP_DISJOINT);
1708 isl_map_free(ctx, map);
1712 struct isl_map *isl_map_from_set(
1713 struct isl_ctx *ctx, struct isl_set *set,
1714 unsigned n_in, unsigned n_out)
1717 struct isl_map *map = NULL;
1721 isl_assert(ctx, set->dim == n_in + n_out, goto error);
1722 set = isl_set_cow(ctx, set);
1725 map = (struct isl_map *)set;
1726 for (i = 0; i < set->n; ++i) {
1727 map->p[i] = isl_basic_map_from_basic_set(ctx,
1728 set->p[i], n_in, n_out);
1736 isl_set_free(ctx, set);
1740 struct isl_map *isl_map_alloc(struct isl_ctx *ctx,
1741 unsigned nparam, unsigned in, unsigned out, int n,
1744 struct isl_map *map;
1746 map = isl_alloc(ctx, struct isl_map,
1747 sizeof(struct isl_map) +
1748 n * sizeof(struct isl_basic_map *));
1755 map->nparam = nparam;
1762 struct isl_basic_map *isl_basic_map_empty(struct isl_ctx *ctx,
1763 unsigned nparam, unsigned in, unsigned out)
1765 struct isl_basic_map *bmap;
1766 bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, 1, 0);
1767 bmap = isl_basic_map_set_to_empty(ctx, bmap);
1771 struct isl_map *isl_map_empty(struct isl_ctx *ctx,
1772 unsigned nparam, unsigned in, unsigned out)
1774 return isl_map_alloc(ctx, nparam, in, out, 0, ISL_MAP_DISJOINT);
1777 struct isl_set *isl_set_empty(struct isl_ctx *ctx,
1778 unsigned nparam, unsigned dim)
1780 return isl_set_alloc(ctx, nparam, dim, 0, ISL_MAP_DISJOINT);
1783 struct isl_map *isl_map_dup(struct isl_ctx *ctx, struct isl_map *map)
1786 struct isl_map *dup;
1788 dup = isl_map_alloc(ctx, map->nparam, map->n_in, map->n_out, map->n,
1790 for (i = 0; i < map->n; ++i)
1791 dup = isl_map_add(ctx, dup,
1792 isl_basic_map_dup(ctx, map->p[i]));
1796 struct isl_map *isl_map_add(struct isl_ctx *ctx, struct isl_map *map,
1797 struct isl_basic_map *bmap)
1801 isl_assert(ctx, map->nparam == bmap->nparam, goto error);
1802 isl_assert(ctx, map->n_in == bmap->n_in, goto error);
1803 isl_assert(ctx, map->n_out == bmap->n_out, goto error);
1804 isl_assert(ctx, map->n < map->size, goto error);
1805 map->p[map->n] = bmap;
1810 isl_map_free(ctx, map);
1812 isl_basic_map_free(ctx, bmap);
1816 void isl_map_free(struct isl_ctx *ctx, struct isl_map *map)
1826 for (i = 0; i < map->n; ++i)
1827 isl_basic_map_free(ctx, map->p[i]);
1831 struct isl_map *isl_map_extend(struct isl_ctx *ctx, struct isl_map *base,
1832 unsigned nparam, unsigned n_in, unsigned n_out)
1836 base = isl_map_cow(ctx, base);
1840 isl_assert(ctx, base->nparam <= nparam, goto error);
1841 isl_assert(ctx, base->n_in <= n_in, goto error);
1842 isl_assert(ctx, base->n_out <= n_out, goto error);
1843 base->nparam = nparam;
1845 base->n_out = n_out;
1846 for (i = 0; i < base->n; ++i) {
1847 base->p[i] = isl_basic_map_extend(ctx, base->p[i],
1848 nparam, n_in, n_out, 0, 0, 0);
1854 isl_map_free(ctx, base);
1858 struct isl_basic_map *isl_basic_map_fix_input_si(struct isl_ctx *ctx,
1859 struct isl_basic_map *bmap,
1860 unsigned input, int value)
1864 bmap = isl_basic_map_cow(ctx, bmap);
1867 isl_assert(ctx, input < bmap->n_in, goto error);
1869 bmap = isl_basic_map_extend(ctx, bmap,
1870 bmap->nparam, bmap->n_in, bmap->n_out, 0, 1, 0);
1871 j = isl_basic_map_alloc_equality(ctx, bmap);
1874 isl_int_set_si(bmap->eq[j][1+bmap->nparam+input], -1);
1875 isl_int_set_si(bmap->eq[j][0], value);
1876 return isl_basic_map_finalize(ctx, bmap);
1878 isl_basic_map_free(ctx, bmap);
1882 struct isl_map *isl_map_fix_input_si(struct isl_ctx *ctx, struct isl_map *map,
1883 unsigned input, int value)
1887 map = isl_map_cow(ctx, map);
1891 isl_assert(ctx, input < map->n_in, goto error);
1892 for (i = 0; i < map->n; ++i) {
1893 map->p[i] = isl_basic_map_fix_input_si(ctx, map->p[i],
1900 isl_map_free(ctx, map);
1904 struct isl_map *isl_map_reverse(struct isl_ctx *ctx, struct isl_map *map)
1909 map = isl_map_cow(ctx, map);
1914 map->n_in = map->n_out;
1916 for (i = 0; i < map->n; ++i) {
1917 map->p[i] = isl_basic_map_reverse(ctx, map->p[i]);
1923 isl_map_free(ctx, map);
1927 struct isl_map *isl_basic_map_lexmax(struct isl_ctx *ctx,
1928 struct isl_basic_map *bmap, struct isl_basic_set *dom,
1929 struct isl_set **empty)
1931 return isl_pip_basic_map_lexmax(ctx, bmap, dom, empty);
1934 struct isl_map *isl_basic_map_lexmin(struct isl_ctx *ctx,
1935 struct isl_basic_map *bmap, struct isl_basic_set *dom,
1936 struct isl_set **empty)
1938 return isl_pip_basic_map_lexmin(ctx, bmap, dom, empty);
1941 struct isl_set *isl_basic_set_lexmin(struct isl_ctx *ctx,
1942 struct isl_basic_set *bset)
1944 struct isl_basic_map *bmap = NULL;
1945 struct isl_basic_set *dom = NULL;
1946 struct isl_map *min;
1950 bmap = isl_basic_map_from_basic_set(ctx, bset, 0, bset->dim);
1953 dom = isl_basic_set_alloc(ctx, bmap->nparam, 0, 0, 0, 0);
1956 min = isl_basic_map_lexmin(ctx, bmap, dom, NULL);
1957 return isl_map_range(ctx, min);
1959 isl_basic_map_free(ctx, bmap);
1963 struct isl_map *isl_basic_map_compute_divs(struct isl_ctx *ctx,
1964 struct isl_basic_map *bmap)
1966 if (bmap->n_div == 0)
1967 return isl_map_from_basic_map(ctx, bmap);
1968 return isl_pip_basic_map_compute_divs(ctx, bmap);
1971 struct isl_map *isl_map_compute_divs(struct isl_ctx *ctx, struct isl_map *map)
1974 struct isl_map *res;
1980 res = isl_basic_map_compute_divs(ctx,
1981 isl_basic_map_copy(ctx, map->p[0]));
1982 for (i = 1 ; i < map->n; ++i) {
1984 r2 = isl_basic_map_compute_divs(ctx,
1985 isl_basic_map_copy(ctx, map->p[i]));
1986 if (F_ISSET(map, ISL_MAP_DISJOINT))
1987 res = isl_map_union_disjoint(ctx, res, r2);
1989 res = isl_map_union(ctx, res, r2);
1991 isl_map_free(ctx, map);
1996 struct isl_set *isl_basic_set_compute_divs(struct isl_ctx *ctx,
1997 struct isl_basic_set *bset)
1999 return (struct isl_set *)
2000 isl_basic_map_compute_divs(ctx,
2001 (struct isl_basic_map *)bset);
2004 struct isl_set *isl_map_domain(struct isl_ctx *ctx, struct isl_map *map)
2007 struct isl_set *set;
2012 map = isl_map_cow(ctx, map);
2016 set = (struct isl_set *)map;
2017 set->dim = map->n_in;
2019 for (i = 0; i < map->n; ++i) {
2020 set->p[i] = isl_basic_map_domain(ctx, map->p[i]);
2024 F_CLR(set, ISL_MAP_DISJOINT);
2027 isl_map_free(ctx, map);
2031 struct isl_map *isl_map_union_disjoint(struct isl_ctx *ctx,
2032 struct isl_map *map1, struct isl_map *map2)
2036 struct isl_map *map = NULL;
2042 isl_map_free(ctx, map1);
2046 isl_map_free(ctx, map2);
2050 isl_assert(ctx, map1->nparam == map2->nparam, goto error);
2051 isl_assert(ctx, map1->n_in == map2->n_in, goto error);
2052 isl_assert(ctx, map1->n_out == map2->n_out, goto error);
2054 if (F_ISSET(map1, ISL_MAP_DISJOINT) &&
2055 F_ISSET(map2, ISL_MAP_DISJOINT))
2056 FL_SET(flags, ISL_MAP_DISJOINT);
2058 map = isl_map_alloc(ctx, map1->nparam, map1->n_in, map1->n_out,
2059 map1->n + map2->n, flags);
2062 for (i = 0; i < map1->n; ++i) {
2063 map = isl_map_add(ctx, map,
2064 isl_basic_map_copy(ctx, map1->p[i]));
2068 for (i = 0; i < map2->n; ++i) {
2069 map = isl_map_add(ctx, map,
2070 isl_basic_map_copy(ctx, map2->p[i]));
2074 isl_map_free(ctx, map1);
2075 isl_map_free(ctx, map2);
2078 isl_map_free(ctx, map);
2079 isl_map_free(ctx, map1);
2080 isl_map_free(ctx, map2);
2084 struct isl_map *isl_map_union(struct isl_ctx *ctx,
2085 struct isl_map *map1, struct isl_map *map2)
2087 map1 = isl_map_union_disjoint(ctx, map1, map2);
2091 F_CLR(map1, ISL_MAP_DISJOINT);
2095 struct isl_set *isl_set_union_disjoint(struct isl_ctx *ctx,
2096 struct isl_set *set1, struct isl_set *set2)
2098 return (struct isl_set *)
2099 isl_map_union_disjoint(ctx,
2100 (struct isl_map *)set1, (struct isl_map *)set2);
2103 struct isl_set *isl_set_union(struct isl_ctx *ctx,
2104 struct isl_set *set1, struct isl_set *set2)
2106 return (struct isl_set *)
2108 (struct isl_map *)set1, (struct isl_map *)set2);
2111 struct isl_map *isl_map_intersect_range(
2112 struct isl_ctx *ctx, struct isl_map *map,
2113 struct isl_set *set)
2116 struct isl_map *result;
2122 if (F_ISSET(map, ISL_MAP_DISJOINT) &&
2123 F_ISSET(set, ISL_MAP_DISJOINT))
2124 FL_SET(flags, ISL_MAP_DISJOINT);
2126 result = isl_map_alloc(ctx, map->nparam, map->n_in, map->n_out,
2127 map->n * set->n, flags);
2130 for (i = 0; i < map->n; ++i)
2131 for (j = 0; j < set->n; ++j) {
2132 result = isl_map_add(ctx, result,
2133 isl_basic_map_intersect_range(ctx,
2134 isl_basic_map_copy(ctx, map->p[i]),
2135 isl_basic_set_copy(ctx, set->p[j])));
2139 isl_map_free(ctx, map);
2140 isl_set_free(ctx, set);
2143 isl_map_free(ctx, map);
2144 isl_set_free(ctx, set);
2148 struct isl_map *isl_map_intersect_domain(
2149 struct isl_ctx *ctx, struct isl_map *map,
2150 struct isl_set *set)
2152 return isl_map_reverse(ctx,
2153 isl_map_intersect_range(ctx, isl_map_reverse(ctx, map), set));
2156 struct isl_map *isl_map_apply_domain(
2157 struct isl_ctx *ctx, struct isl_map *map1,
2158 struct isl_map *map2)
2162 map1 = isl_map_reverse(ctx, map1);
2163 map1 = isl_map_apply_range(ctx, map1, map2);
2164 return isl_map_reverse(ctx, map1);
2166 isl_map_free(ctx, map1);
2167 isl_map_free(ctx, map2);
2171 struct isl_map *isl_map_apply_range(
2172 struct isl_ctx *ctx, struct isl_map *map1,
2173 struct isl_map *map2)
2175 struct isl_map *result;
2181 isl_assert(ctx, map1->nparam == map2->nparam, goto error);
2182 isl_assert(ctx, map1->n_out == map2->n_in, goto error);
2184 result = isl_map_alloc(ctx, map1->nparam, map1->n_in, map2->n_out,
2185 map1->n * map2->n, 0);
2188 for (i = 0; i < map1->n; ++i)
2189 for (j = 0; j < map2->n; ++j) {
2190 result = isl_map_add(ctx, result,
2191 isl_basic_map_apply_range(ctx,
2192 isl_basic_map_copy(ctx, map1->p[i]),
2193 isl_basic_map_copy(ctx, map2->p[j])));
2197 isl_map_free(ctx, map1);
2198 isl_map_free(ctx, map2);
2201 isl_map_free(ctx, map1);
2202 isl_map_free(ctx, map2);
2207 * returns range - domain
2209 struct isl_basic_set *isl_basic_map_deltas(struct isl_ctx *ctx,
2210 struct isl_basic_map *bmap)
2212 struct isl_basic_set *bset;
2218 isl_assert(ctx, bmap->n_in == bmap->n_out, goto error);
2220 bset = isl_basic_set_from_basic_map(ctx, bmap);
2221 bset = isl_basic_set_extend(ctx, bset, bset->nparam, 3*dim, 0,
2223 bset = isl_basic_set_swap_vars(ctx, bset, 2*dim);
2224 for (i = 0; i < dim; ++i) {
2225 int j = isl_basic_map_alloc_equality(ctx,
2226 (struct isl_basic_map *)bset);
2229 isl_int_set_si(bset->eq[j][1+bset->nparam+i], 1);
2230 isl_int_set_si(bset->eq[j][1+bset->nparam+dim+i], 1);
2231 isl_int_set_si(bset->eq[j][1+bset->nparam+2*dim+i], -1);
2233 return isl_basic_set_project_out(ctx, bset, 2*dim, 0);
2235 isl_basic_map_free(ctx, bmap);
2239 /* If the only constraints a div d=floor(f/m)
2240 * appears in are its two defining constraints
2243 * -(f - (m - 1)) + m d >= 0
2245 * then it can safely be removed.
2247 static int div_is_redundant(struct isl_ctx *ctx, struct isl_basic_map *bmap,
2251 unsigned pos = 1 + bmap->nparam + bmap->n_in + bmap->n_out + div;
2253 for (i = 0; i < bmap->n_eq; ++i)
2254 if (!isl_int_is_zero(bmap->eq[i][pos]))
2257 for (i = 0; i < bmap->n_ineq; ++i) {
2258 if (isl_int_is_zero(bmap->ineq[i][pos]))
2260 if (isl_int_eq(bmap->ineq[i][pos], bmap->div[div][0])) {
2262 isl_int_sub(bmap->div[div][1],
2263 bmap->div[div][1], bmap->div[div][0]);
2264 isl_int_add_ui(bmap->div[div][1], bmap->div[div][1], 1);
2265 neg = isl_seq_is_neg(bmap->ineq[i], bmap->div[div]+1, pos);
2266 isl_int_sub_ui(bmap->div[div][1], bmap->div[div][1], 1);
2267 isl_int_add(bmap->div[div][1],
2268 bmap->div[div][1], bmap->div[div][0]);
2271 if (isl_seq_first_non_zero(bmap->ineq[i]+pos+1,
2272 bmap->n_div-div-1) != -1)
2274 } else if (isl_int_abs_eq(bmap->ineq[i][pos], bmap->div[div][0])) {
2275 if (!isl_seq_eq(bmap->ineq[i], bmap->div[div]+1, pos))
2277 if (isl_seq_first_non_zero(bmap->ineq[i]+pos+1,
2278 bmap->n_div-div-1) != -1)
2284 for (i = 0; i < bmap->n_div; ++i)
2285 if (!isl_int_is_zero(bmap->div[i][1+pos]))
2292 * Remove divs that don't occur in any of the constraints or other divs.
2293 * These can arise when dropping some of the variables in a quast
2294 * returned by piplib.
2296 static struct isl_basic_map *remove_redundant_divs(struct isl_ctx *ctx,
2297 struct isl_basic_map *bmap)
2301 for (i = bmap->n_div-1; i >= 0; --i) {
2302 if (!div_is_redundant(ctx, bmap, i))
2304 bmap = isl_basic_map_drop_div(ctx, bmap, i);
2309 struct isl_basic_map *isl_basic_map_finalize(struct isl_ctx *ctx,
2310 struct isl_basic_map *bmap)
2312 bmap = remove_redundant_divs(ctx, bmap);
2315 F_SET(bmap, ISL_BASIC_SET_FINAL);
2319 struct isl_basic_set *isl_basic_set_finalize(struct isl_ctx *ctx,
2320 struct isl_basic_set *bset)
2322 return (struct isl_basic_set *)
2323 isl_basic_map_finalize(ctx,
2324 (struct isl_basic_map *)bset);
2327 struct isl_set *isl_set_finalize(struct isl_ctx *ctx, struct isl_set *set)
2333 for (i = 0; i < set->n; ++i) {
2334 set->p[i] = isl_basic_set_finalize(ctx, set->p[i]);
2340 isl_set_free(ctx, set);
2344 struct isl_map *isl_map_finalize(struct isl_ctx *ctx, struct isl_map *map)
2350 for (i = 0; i < map->n; ++i) {
2351 map->p[i] = isl_basic_map_finalize(ctx, map->p[i]);
2357 isl_map_free(ctx, map);
2361 struct isl_basic_map *isl_basic_map_identity(struct isl_ctx *ctx,
2362 unsigned nparam, unsigned dim)
2364 struct isl_basic_map *bmap;
2367 bmap = isl_basic_map_alloc(ctx, nparam, dim, dim, 0, dim, 0);
2371 for (i = 0; i < dim; ++i) {
2372 int j = isl_basic_map_alloc_equality(ctx, bmap);
2375 isl_int_set_si(bmap->eq[j][1+nparam+i], 1);
2376 isl_int_set_si(bmap->eq[j][1+nparam+dim+i], -1);
2378 return isl_basic_map_finalize(ctx, bmap);
2380 isl_basic_map_free(ctx, bmap);
2384 struct isl_map *isl_map_identity(struct isl_ctx *ctx,
2385 unsigned nparam, unsigned dim)
2387 struct isl_map *map = isl_map_alloc(ctx, nparam, dim, dim, 1,
2391 map = isl_map_add(ctx, map,
2392 isl_basic_map_identity(ctx, nparam, dim));
2395 isl_map_free(ctx, map);
2399 int isl_set_is_equal(struct isl_ctx *ctx,
2400 struct isl_set *set1, struct isl_set *set2)
2402 return isl_map_is_equal(ctx,
2403 (struct isl_map *)set1, (struct isl_map *)set2);
2406 int isl_set_is_subset(struct isl_ctx *ctx,
2407 struct isl_set *set1, struct isl_set *set2)
2409 return isl_map_is_subset(ctx,
2410 (struct isl_map *)set1, (struct isl_map *)set2);
2413 int isl_basic_map_is_subset(struct isl_ctx *ctx,
2414 struct isl_basic_map *bmap1,
2415 struct isl_basic_map *bmap2)
2418 struct isl_map *map1;
2419 struct isl_map *map2;
2421 if (!bmap1 || !bmap2)
2424 map1 = isl_map_from_basic_map(ctx,
2425 isl_basic_map_copy(ctx, bmap1));
2426 map2 = isl_map_from_basic_map(ctx,
2427 isl_basic_map_copy(ctx, bmap2));
2429 is_subset = isl_map_is_subset(ctx, map1, map2);
2431 isl_map_free(ctx, map1);
2432 isl_map_free(ctx, map2);
2437 int isl_map_is_empty(struct isl_ctx *ctx, struct isl_map *map)
2444 for (i = 0; i < map->n; ++i) {
2445 is_empty = isl_basic_map_is_empty(ctx, map->p[i]);
2454 int isl_set_is_empty(struct isl_ctx *ctx, struct isl_set *set)
2456 return isl_map_is_empty(ctx, (struct isl_map *)set);
2459 int isl_map_is_subset(struct isl_ctx *ctx, struct isl_map *map1,
2460 struct isl_map *map2)
2464 struct isl_map *diff;
2469 if (isl_map_is_empty(ctx, map1))
2472 if (isl_map_is_empty(ctx, map2))
2475 diff = isl_map_subtract(ctx, isl_map_copy(ctx, map1),
2476 isl_map_copy(ctx, map2));
2480 is_subset = isl_map_is_empty(ctx, diff);
2481 isl_map_free(ctx, diff);
2486 int isl_map_is_equal(struct isl_ctx *ctx,
2487 struct isl_map *map1, struct isl_map *map2)
2493 is_subset = isl_map_is_subset(ctx, map1, map2);
2496 is_subset = isl_map_is_subset(ctx, map2, map1);
2500 int isl_basic_map_is_strict_subset(struct isl_ctx *ctx,
2501 struct isl_basic_map *bmap1,
2502 struct isl_basic_map *bmap2)
2506 if (!bmap1 || !bmap2)
2508 is_subset = isl_basic_map_is_subset(ctx, bmap1, bmap2);
2511 is_subset = isl_basic_map_is_subset(ctx, bmap2, bmap1);
2512 if (is_subset == -1)
2517 int isl_basic_map_is_empty(struct isl_ctx *ctx,
2518 struct isl_basic_map *bmap)
2520 struct isl_basic_set *bset = NULL;
2521 struct isl_vec *sample = NULL;
2527 if (F_ISSET(bmap, ISL_BASIC_MAP_EMPTY))
2530 bset = isl_basic_map_underlying_set(ctx,
2531 isl_basic_map_copy(ctx, bmap));
2534 sample = isl_basic_set_sample(ctx, bset);
2537 empty = sample->size == 0;
2538 isl_vec_free(ctx, sample);
2543 struct isl_map *isl_basic_map_union(
2544 struct isl_ctx *ctx, struct isl_basic_map *bmap1,
2545 struct isl_basic_map *bmap2)
2547 struct isl_map *map;
2548 if (!bmap1 || !bmap2)
2551 isl_assert(ctx, bmap1->nparam == bmap2->nparam, goto error);
2552 isl_assert(ctx, bmap1->n_in == bmap2->n_in, goto error);
2553 isl_assert(ctx, bmap1->n_out == bmap2->n_out, goto error);
2555 map = isl_map_alloc(ctx, bmap1->nparam,
2556 bmap1->n_in, bmap1->n_out, 2, 0);
2559 map = isl_map_add(ctx, map, bmap1);
2560 map = isl_map_add(ctx, map, bmap2);
2563 isl_basic_map_free(ctx, bmap1);
2564 isl_basic_map_free(ctx, bmap2);
2568 struct isl_set *isl_basic_set_union(
2569 struct isl_ctx *ctx, struct isl_basic_set *bset1,
2570 struct isl_basic_set *bset2)
2572 return (struct isl_set *)isl_basic_map_union(ctx,
2573 (struct isl_basic_map *)bset1,
2574 (struct isl_basic_map *)bset2);
2577 /* Order divs such that any div only depends on previous divs */
2578 static struct isl_basic_map *order_divs(struct isl_ctx *ctx,
2579 struct isl_basic_map *bmap)
2582 unsigned off = bmap->nparam + bmap->n_in + bmap->n_out;
2584 for (i = 0; i < bmap->n_div; ++i) {
2586 pos = isl_seq_first_non_zero(bmap->div[i]+1+1+off+i,
2590 swap_div(bmap, i, pos);
2596 static int find_div(struct isl_basic_map *dst,
2597 struct isl_basic_map *src, unsigned div)
2601 unsigned total = src->nparam + src->n_in + src->n_out + src->n_div;
2603 for (i = 0; i < dst->n_div; ++i)
2604 if (isl_seq_eq(dst->div[i], src->div[div], 1+1+total) &&
2605 isl_seq_first_non_zero(dst->div[i]+1+1+total,
2606 dst->n_div - src->n_div) == -1)
2611 /* For a div d = floor(f/m), add the constraints
2614 * -(f-(n-1)) + m d >= 0
2616 * Note that the second constraint is the negation of
2620 static int add_div_constraints(struct isl_ctx *ctx,
2621 struct isl_basic_map *bmap, unsigned div)
2624 unsigned div_pos = 1 + bmap->nparam + bmap->n_in + bmap->n_out + div;
2625 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
2627 i = isl_basic_map_alloc_inequality(ctx, bmap);
2630 isl_seq_cpy(bmap->ineq[i], bmap->div[div]+1, 1+total);
2631 isl_int_neg(bmap->ineq[i][div_pos], bmap->div[div][0]);
2633 j = isl_basic_map_alloc_inequality(ctx, bmap);
2636 isl_seq_neg(bmap->ineq[j], bmap->ineq[i], 1 + total);
2637 isl_int_add(bmap->ineq[j][0], bmap->ineq[j][0], bmap->ineq[j][div_pos]);
2638 isl_int_sub_ui(bmap->ineq[j][0], bmap->ineq[j][0], 1);
2642 struct isl_basic_map *isl_basic_map_align_divs(struct isl_ctx *ctx,
2643 struct isl_basic_map *dst, struct isl_basic_map *src)
2646 unsigned total = src->nparam + src->n_in + src->n_out + src->n_div;
2648 if (src->n_div == 0)
2651 src = order_divs(ctx, src);
2652 dst = isl_basic_map_extend(ctx, dst, dst->nparam, dst->n_in,
2653 dst->n_out, src->n_div, 0, 2 * src->n_div);
2656 for (i = 0; i < src->n_div; ++i) {
2657 int j = find_div(dst, src, i);
2659 j = isl_basic_map_alloc_div(ctx, dst);
2662 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total);
2663 if (add_div_constraints(ctx, dst, j) < 0)
2667 swap_div(dst, i, j);
2671 isl_basic_map_free(ctx, dst);
2675 static struct isl_map *add_cut_constraint(struct isl_ctx *ctx,
2676 struct isl_map *dst,
2677 struct isl_basic_map *src, isl_int *c,
2678 unsigned len, unsigned extra, int oppose)
2680 struct isl_basic_map *copy = NULL;
2684 copy = isl_basic_map_copy(ctx, src);
2685 copy = isl_basic_map_cow(ctx, copy);
2688 copy = isl_basic_map_extend(ctx, copy,
2689 copy->nparam, copy->n_in, copy->n_out, 0, 0, 1);
2690 k = isl_basic_map_alloc_inequality(ctx, copy);
2694 isl_seq_neg(copy->ineq[k], c, len);
2696 isl_seq_cpy(copy->ineq[k], c, len);
2697 isl_seq_clr(copy->ineq[k]+len, extra);
2698 isl_inequality_negate(ctx, copy, k);
2699 copy = isl_basic_map_simplify(ctx, copy);
2700 copy = isl_basic_map_finalize(ctx, copy);
2701 is_empty = isl_basic_map_is_empty(ctx, copy);
2705 dst = isl_map_add(ctx, dst, copy);
2707 isl_basic_map_free(ctx, copy);
2710 isl_basic_map_free(ctx, copy);
2711 isl_map_free(ctx, dst);
2715 static struct isl_map *subtract(struct isl_ctx *ctx, struct isl_map *map,
2716 struct isl_basic_map *bmap)
2720 struct isl_map *rest = NULL;
2722 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
2729 if (F_ISSET(map, ISL_MAP_DISJOINT))
2730 FL_SET(flags, ISL_MAP_DISJOINT);
2732 max = map->n * (2 * bmap->n_eq + bmap->n_ineq);
2733 rest = isl_map_alloc(ctx, map->nparam, map->n_in, map->n_out,
2738 for (i = 0; i < map->n; ++i) {
2739 map->p[i] = isl_basic_map_align_divs(ctx, map->p[i], bmap);
2744 for (j = 0; j < map->n; ++j)
2745 map->p[j] = isl_basic_map_cow(ctx, map->p[j]);
2747 for (i = 0; i < bmap->n_eq; ++i) {
2748 for (j = 0; j < map->n; ++j) {
2749 rest = add_cut_constraint(ctx, rest,
2750 map->p[j], bmap->eq[i],
2751 1+total, map->p[j]->n_div - bmap->n_div, 0);
2755 rest = add_cut_constraint(ctx, rest,
2756 map->p[j], bmap->eq[i],
2757 1+total, map->p[j]->n_div - bmap->n_div, 1);
2761 map->p[j] = isl_basic_map_extend(ctx, map->p[j],
2762 map->p[j]->nparam, map->p[j]->n_in,
2763 map->p[j]->n_out, 0, 1, 0);
2766 k = isl_basic_map_alloc_equality(ctx, map->p[j]);
2769 isl_seq_cpy(map->p[j]->eq[k], bmap->eq[i], 1+total);
2770 isl_seq_clr(map->p[j]->eq[k]+1+total,
2771 map->p[j]->n_div - bmap->n_div);
2775 for (i = 0; i < bmap->n_ineq; ++i) {
2776 for (j = 0; j < map->n; ++j) {
2777 rest = add_cut_constraint(ctx, rest,
2778 map->p[j], bmap->ineq[i],
2779 1+total, map->p[j]->n_div - bmap->n_div, 0);
2783 map->p[j] = isl_basic_map_extend(ctx, map->p[j],
2784 map->p[j]->nparam, map->p[j]->n_in,
2785 map->p[j]->n_out, 0, 0, 1);
2788 k = isl_basic_map_alloc_inequality(ctx, map->p[j]);
2791 isl_seq_cpy(map->p[j]->ineq[k], bmap->ineq[i], 1+total);
2792 isl_seq_clr(map->p[j]->ineq[k]+1+total,
2793 map->p[j]->n_div - bmap->n_div);
2797 isl_map_free(ctx, map);
2800 isl_map_free(ctx, map);
2801 isl_map_free(ctx, rest);
2805 struct isl_map *isl_map_subtract(struct isl_ctx *ctx, struct isl_map *map1,
2806 struct isl_map *map2)
2812 isl_assert(ctx, map1->nparam == map2->nparam, goto error);
2813 isl_assert(ctx, map1->n_in == map2->n_in, goto error);
2814 isl_assert(ctx, map1->n_out == map2->n_out, goto error);
2816 if (isl_map_is_empty(ctx, map2)) {
2817 isl_map_free(ctx, map2);
2821 map1 = isl_map_compute_divs(ctx, map1);
2822 map2 = isl_map_compute_divs(ctx, map2);
2826 for (i = 0; map1 && i < map2->n; ++i)
2827 map1 = subtract(ctx, map1, map2->p[i]);
2829 isl_map_free(ctx, map2);
2832 isl_map_free(ctx, map1);
2833 isl_map_free(ctx, map2);
2837 struct isl_set *isl_set_subtract(struct isl_ctx *ctx, struct isl_set *set1,
2838 struct isl_set *set2)
2840 return (struct isl_set *)
2841 isl_map_subtract(ctx,
2842 (struct isl_map *)set1, (struct isl_map *)set2);
2845 struct isl_set *isl_set_apply(struct isl_ctx *ctx, struct isl_set *set,
2846 struct isl_map *map)
2848 isl_assert(ctx, set->dim == map->n_in, goto error);
2849 map = isl_map_intersect_domain(ctx, map, set);
2850 set = isl_map_range(ctx, map);
2853 isl_set_free(ctx, set);
2854 isl_map_free(ctx, map);