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 bmap = isl_basic_map_simplify(ctx, bmap);
1288 return isl_basic_map_finalize(ctx, bmap);
1290 isl_basic_map_free(ctx, bmap);
1291 isl_basic_set_free(ctx, bset);
1295 struct isl_basic_map *isl_basic_map_intersect_range(
1296 struct isl_ctx *ctx, struct isl_basic_map *bmap,
1297 struct isl_basic_set *bset)
1299 struct isl_basic_map *bmap_range;
1304 isl_assert(ctx, bset->dim == bmap->n_out, goto error);
1305 isl_assert(ctx, bset->nparam == bmap->nparam, goto error);
1307 bmap = isl_basic_map_extend(ctx, bmap,
1308 bset->nparam, bmap->n_in, bmap->n_out,
1309 bset->n_div, bset->n_eq, bset->n_ineq);
1312 bmap_range = isl_basic_map_from_basic_set(ctx, bset,
1314 bmap = add_constraints(ctx, bmap, bmap_range, 0, 0);
1316 bmap = isl_basic_map_simplify(ctx, bmap);
1317 return isl_basic_map_finalize(ctx, bmap);
1319 isl_basic_map_free(ctx, bmap);
1320 isl_basic_set_free(ctx, bset);
1324 struct isl_basic_map *isl_basic_map_intersect(
1325 struct isl_ctx *ctx, struct isl_basic_map *bmap1,
1326 struct isl_basic_map *bmap2)
1328 isl_assert(ctx, bmap1->nparam == bmap2->nparam, goto error);
1329 isl_assert(ctx, bmap1->n_in == bmap2->n_in, goto error);
1330 isl_assert(ctx, bmap1->n_out == bmap2->n_out, goto error);
1332 bmap1 = isl_basic_map_extend(ctx, bmap1,
1333 bmap1->nparam, bmap1->n_in, bmap1->n_out,
1334 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
1337 bmap1 = add_constraints(ctx, bmap1, bmap2, 0, 0);
1339 bmap1 = isl_basic_map_simplify(ctx, bmap1);
1340 return isl_basic_map_finalize(ctx, bmap1);
1342 isl_basic_map_free(ctx, bmap1);
1343 isl_basic_map_free(ctx, bmap2);
1347 struct isl_basic_set *isl_basic_set_intersect(
1348 struct isl_ctx *ctx, struct isl_basic_set *bset1,
1349 struct isl_basic_set *bset2)
1351 return (struct isl_basic_set *)
1352 isl_basic_map_intersect(ctx,
1353 (struct isl_basic_map *)bset1,
1354 (struct isl_basic_map *)bset2);
1357 struct isl_map *isl_map_intersect(struct isl_ctx *ctx, struct isl_map *map1,
1358 struct isl_map *map2)
1361 struct isl_map *result;
1367 if (F_ISSET(map1, ISL_MAP_DISJOINT) &&
1368 F_ISSET(map2, ISL_MAP_DISJOINT))
1369 FL_SET(flags, ISL_MAP_DISJOINT);
1371 result = isl_map_alloc(ctx, map1->nparam, map1->n_in, map1->n_out,
1372 map1->n * map2->n, flags);
1375 for (i = 0; i < map1->n; ++i)
1376 for (j = 0; j < map2->n; ++j) {
1377 struct isl_basic_map *part;
1378 part = isl_basic_map_intersect(ctx,
1379 isl_basic_map_copy(ctx, map1->p[i]),
1380 isl_basic_map_copy(ctx, map2->p[j]));
1381 if (isl_basic_map_is_empty(ctx, part))
1382 isl_basic_map_free(ctx, part);
1384 result = isl_map_add(ctx, result, part);
1388 isl_map_free(ctx, map1);
1389 isl_map_free(ctx, map2);
1392 isl_map_free(ctx, map1);
1393 isl_map_free(ctx, map2);
1397 struct isl_basic_map *isl_basic_map_reverse(struct isl_ctx *ctx,
1398 struct isl_basic_map *bmap)
1400 struct isl_basic_set *bset;
1405 bmap = isl_basic_map_cow(ctx, bmap);
1409 bset = isl_basic_set_from_basic_map(ctx, bmap);
1410 bset = isl_basic_set_swap_vars(ctx, bset, in);
1411 return isl_basic_map_from_basic_set(ctx, bset, bset->dim-in, in);
1414 /* Turn final n dimensions into existentially quantified variables.
1416 struct isl_basic_set *isl_basic_set_project_out(
1417 struct isl_ctx *ctx, struct isl_basic_set *bset,
1418 unsigned n, unsigned flags)
1428 isl_assert(ctx, n <= bset->dim, goto error);
1433 bset = isl_basic_set_cow(ctx, bset);
1435 row_size = 1 + bset->nparam + bset->dim + bset->extra;
1436 old = bset->block2.data;
1437 bset->block2 = isl_blk_extend(ctx, bset->block2,
1438 (bset->extra + n) * (1 + row_size));
1439 if (!bset->block2.data)
1441 new_div = isl_alloc_array(ctx, isl_int *, bset->extra + n);
1444 for (i = 0; i < n; ++i) {
1445 new_div[i] = bset->block2.data +
1446 (bset->extra + i) * (1 + row_size);
1447 isl_seq_clr(new_div[i], 1 + row_size);
1449 for (i = 0; i < bset->extra; ++i)
1450 new_div[n + i] = bset->block2.data + (bset->div[i] - old);
1452 bset->div = new_div;
1456 bset = isl_basic_set_simplify(ctx, bset);
1457 return isl_basic_set_finalize(ctx, bset);
1459 isl_basic_set_free(ctx, bset);
1463 struct isl_basic_map *isl_basic_map_apply_range(
1464 struct isl_ctx *ctx, struct isl_basic_map *bmap1,
1465 struct isl_basic_map *bmap2)
1467 struct isl_basic_set *bset;
1468 unsigned n_in, n_out;
1470 if (!bmap1 || !bmap2)
1473 isl_assert(ctx, bmap1->n_out == bmap2->n_in, goto error);
1474 isl_assert(ctx, bmap1->nparam == bmap2->nparam, goto error);
1477 n_out = bmap2->n_out;
1479 bmap2 = isl_basic_map_reverse(ctx, bmap2);
1482 bmap1 = isl_basic_map_extend(ctx, bmap1, bmap1->nparam,
1483 bmap1->n_in + bmap2->n_in, bmap1->n_out,
1484 bmap2->extra, bmap2->n_eq, bmap2->n_ineq);
1487 bmap1 = add_constraints(ctx, bmap1, bmap2, bmap1->n_in - bmap2->n_in, 0);
1488 bmap1 = isl_basic_map_simplify(ctx, bmap1);
1489 bset = isl_basic_set_from_basic_map(ctx, bmap1);
1490 bset = isl_basic_set_project_out(ctx, bset,
1491 bset->dim - (n_in + n_out), 0);
1492 return isl_basic_map_from_basic_set(ctx, bset, n_in, n_out);
1494 isl_basic_map_free(ctx, bmap1);
1495 isl_basic_map_free(ctx, bmap2);
1499 struct isl_basic_map *isl_basic_map_apply_domain(
1500 struct isl_ctx *ctx, struct isl_basic_map *bmap1,
1501 struct isl_basic_map *bmap2)
1503 if (!bmap1 || !bmap2)
1506 isl_assert(ctx, bmap1->n_in == bmap2->n_in, goto error);
1507 isl_assert(ctx, bmap1->nparam == bmap2->nparam, goto error);
1509 bmap1 = isl_basic_map_reverse(ctx, bmap1);
1510 bmap1 = isl_basic_map_apply_range(ctx, bmap1, bmap2);
1511 return isl_basic_map_reverse(ctx, bmap1);
1513 isl_basic_map_free(ctx, bmap1);
1514 isl_basic_map_free(ctx, bmap2);
1518 static struct isl_basic_map *var_equal(struct isl_ctx *ctx,
1519 struct isl_basic_map *bmap, unsigned pos)
1522 i = isl_basic_map_alloc_equality(ctx, bmap);
1525 isl_seq_clr(bmap->eq[i],
1526 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->extra);
1527 isl_int_set_si(bmap->eq[i][1+bmap->nparam+pos], -1);
1528 isl_int_set_si(bmap->eq[i][1+bmap->nparam+bmap->n_in+pos], 1);
1529 return isl_basic_map_finalize(ctx, bmap);
1531 isl_basic_map_free(ctx, bmap);
1535 static struct isl_basic_map *var_more(struct isl_ctx *ctx,
1536 struct isl_basic_map *bmap, unsigned pos)
1539 i = isl_basic_map_alloc_inequality(ctx, bmap);
1542 isl_seq_clr(bmap->ineq[i],
1543 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->extra);
1544 isl_int_set_si(bmap->ineq[i][0], -1);
1545 isl_int_set_si(bmap->ineq[i][1+bmap->nparam+pos], -1);
1546 isl_int_set_si(bmap->ineq[i][1+bmap->nparam+bmap->n_in+pos], 1);
1547 return isl_basic_map_finalize(ctx, bmap);
1549 isl_basic_map_free(ctx, bmap);
1553 static struct isl_basic_map *var_less(struct isl_ctx *ctx,
1554 struct isl_basic_map *bmap, unsigned pos)
1557 i = isl_basic_map_alloc_inequality(ctx, bmap);
1560 isl_seq_clr(bmap->ineq[i],
1561 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->extra);
1562 isl_int_set_si(bmap->ineq[i][0], -1);
1563 isl_int_set_si(bmap->ineq[i][1+bmap->nparam+pos], 1);
1564 isl_int_set_si(bmap->ineq[i][1+bmap->nparam+bmap->n_in+pos], -1);
1565 return isl_basic_map_finalize(ctx, bmap);
1567 isl_basic_map_free(ctx, bmap);
1571 struct isl_basic_map *isl_basic_map_equal(struct isl_ctx *ctx,
1572 unsigned nparam, unsigned in, unsigned out, unsigned n_equal)
1575 struct isl_basic_map *bmap;
1576 bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, n_equal, 0);
1579 for (i = 0; i < n_equal && bmap; ++i)
1580 bmap = var_equal(ctx, bmap, i);
1581 return isl_basic_map_finalize(ctx, bmap);
1584 struct isl_basic_map *isl_basic_map_less_at(struct isl_ctx *ctx,
1585 unsigned nparam, unsigned in, unsigned out, unsigned pos)
1588 struct isl_basic_map *bmap;
1589 bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, pos, 1);
1592 for (i = 0; i < pos && bmap; ++i)
1593 bmap = var_equal(ctx, bmap, i);
1595 bmap = var_less(ctx, bmap, pos);
1596 return isl_basic_map_finalize(ctx, bmap);
1599 struct isl_basic_map *isl_basic_map_more_at(struct isl_ctx *ctx,
1600 unsigned nparam, unsigned in, unsigned out, unsigned pos)
1603 struct isl_basic_map *bmap;
1604 bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, pos, 1);
1607 for (i = 0; i < pos && bmap; ++i)
1608 bmap = var_equal(ctx, bmap, i);
1610 bmap = var_more(ctx, bmap, pos);
1611 return isl_basic_map_finalize(ctx, bmap);
1614 struct isl_basic_map *isl_basic_map_from_basic_set(
1615 struct isl_ctx *ctx, struct isl_basic_set *bset,
1616 unsigned n_in, unsigned n_out)
1618 struct isl_basic_map *bmap;
1620 bset = isl_basic_set_cow(ctx, bset);
1624 isl_assert(ctx, bset->dim == n_in + n_out, goto error);
1625 bmap = (struct isl_basic_map *) bset;
1627 bmap->n_out = n_out;
1628 return isl_basic_map_finalize(ctx, bmap);
1630 isl_basic_set_free(ctx, bset);
1634 struct isl_basic_set *isl_basic_set_from_basic_map(
1635 struct isl_ctx *ctx, struct isl_basic_map *bmap)
1639 if (bmap->n_in == 0)
1640 return (struct isl_basic_set *)bmap;
1641 bmap = isl_basic_map_cow(ctx, bmap);
1644 bmap->n_out += bmap->n_in;
1646 bmap = isl_basic_map_finalize(ctx, bmap);
1647 return (struct isl_basic_set *)bmap;
1652 static struct isl_basic_set *isl_basic_map_underlying_set(
1653 struct isl_ctx *ctx, struct isl_basic_map *bmap)
1657 if (bmap->nparam == 0 && bmap->n_in == 0 && bmap->n_div == 0)
1658 return (struct isl_basic_set *)bmap;
1659 bmap = isl_basic_map_cow(ctx, bmap);
1662 bmap->n_out += bmap->nparam + bmap->n_in + bmap->n_div;
1666 bmap = isl_basic_map_finalize(ctx, bmap);
1667 return (struct isl_basic_set *)bmap;
1672 struct isl_basic_set *isl_basic_map_domain(struct isl_ctx *ctx,
1673 struct isl_basic_map *bmap)
1675 struct isl_basic_set *domain;
1679 n_out = bmap->n_out;
1680 domain = isl_basic_set_from_basic_map(ctx, bmap);
1681 return isl_basic_set_project_out(ctx, domain, n_out, 0);
1684 struct isl_basic_set *isl_basic_map_range(struct isl_ctx *ctx,
1685 struct isl_basic_map *bmap)
1687 return isl_basic_map_domain(ctx,
1688 isl_basic_map_reverse(ctx, bmap));
1691 struct isl_set *isl_map_range(struct isl_ctx *ctx, struct isl_map *map)
1694 struct isl_set *set;
1698 map = isl_map_cow(ctx, map);
1702 set = (struct isl_set *) map;
1704 for (i = 0; i < map->n; ++i) {
1705 set->p[i] = isl_basic_map_range(ctx, map->p[i]);
1709 F_CLR(set, ISL_MAP_DISJOINT);
1712 isl_map_free(ctx, map);
1716 struct isl_map *isl_map_from_set(
1717 struct isl_ctx *ctx, struct isl_set *set,
1718 unsigned n_in, unsigned n_out)
1721 struct isl_map *map = NULL;
1725 isl_assert(ctx, set->dim == n_in + n_out, goto error);
1726 set = isl_set_cow(ctx, set);
1729 map = (struct isl_map *)set;
1730 for (i = 0; i < set->n; ++i) {
1731 map->p[i] = isl_basic_map_from_basic_set(ctx,
1732 set->p[i], n_in, n_out);
1740 isl_set_free(ctx, set);
1744 struct isl_map *isl_map_alloc(struct isl_ctx *ctx,
1745 unsigned nparam, unsigned in, unsigned out, int n,
1748 struct isl_map *map;
1750 map = isl_alloc(ctx, struct isl_map,
1751 sizeof(struct isl_map) +
1752 n * sizeof(struct isl_basic_map *));
1759 map->nparam = nparam;
1766 struct isl_basic_map *isl_basic_map_empty(struct isl_ctx *ctx,
1767 unsigned nparam, unsigned in, unsigned out)
1769 struct isl_basic_map *bmap;
1770 bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, 1, 0);
1771 bmap = isl_basic_map_set_to_empty(ctx, bmap);
1775 struct isl_map *isl_map_empty(struct isl_ctx *ctx,
1776 unsigned nparam, unsigned in, unsigned out)
1778 return isl_map_alloc(ctx, nparam, in, out, 0, ISL_MAP_DISJOINT);
1781 struct isl_set *isl_set_empty(struct isl_ctx *ctx,
1782 unsigned nparam, unsigned dim)
1784 return isl_set_alloc(ctx, nparam, dim, 0, ISL_MAP_DISJOINT);
1787 struct isl_map *isl_map_dup(struct isl_ctx *ctx, struct isl_map *map)
1790 struct isl_map *dup;
1792 dup = isl_map_alloc(ctx, map->nparam, map->n_in, map->n_out, map->n,
1794 for (i = 0; i < map->n; ++i)
1795 dup = isl_map_add(ctx, dup,
1796 isl_basic_map_dup(ctx, map->p[i]));
1800 struct isl_map *isl_map_add(struct isl_ctx *ctx, struct isl_map *map,
1801 struct isl_basic_map *bmap)
1805 isl_assert(ctx, map->nparam == bmap->nparam, goto error);
1806 isl_assert(ctx, map->n_in == bmap->n_in, goto error);
1807 isl_assert(ctx, map->n_out == bmap->n_out, goto error);
1808 isl_assert(ctx, map->n < map->size, goto error);
1809 map->p[map->n] = bmap;
1814 isl_map_free(ctx, map);
1816 isl_basic_map_free(ctx, bmap);
1820 void isl_map_free(struct isl_ctx *ctx, struct isl_map *map)
1830 for (i = 0; i < map->n; ++i)
1831 isl_basic_map_free(ctx, map->p[i]);
1835 struct isl_map *isl_map_extend(struct isl_ctx *ctx, struct isl_map *base,
1836 unsigned nparam, unsigned n_in, unsigned n_out)
1840 base = isl_map_cow(ctx, base);
1844 isl_assert(ctx, base->nparam <= nparam, goto error);
1845 isl_assert(ctx, base->n_in <= n_in, goto error);
1846 isl_assert(ctx, base->n_out <= n_out, goto error);
1847 base->nparam = nparam;
1849 base->n_out = n_out;
1850 for (i = 0; i < base->n; ++i) {
1851 base->p[i] = isl_basic_map_extend(ctx, base->p[i],
1852 nparam, n_in, n_out, 0, 0, 0);
1858 isl_map_free(ctx, base);
1862 struct isl_basic_map *isl_basic_map_fix_input_si(struct isl_ctx *ctx,
1863 struct isl_basic_map *bmap,
1864 unsigned input, int value)
1868 bmap = isl_basic_map_cow(ctx, bmap);
1871 isl_assert(ctx, input < bmap->n_in, goto error);
1873 bmap = isl_basic_map_extend(ctx, bmap,
1874 bmap->nparam, bmap->n_in, bmap->n_out, 0, 1, 0);
1875 j = isl_basic_map_alloc_equality(ctx, bmap);
1878 isl_int_set_si(bmap->eq[j][1+bmap->nparam+input], -1);
1879 isl_int_set_si(bmap->eq[j][0], value);
1880 bmap = isl_basic_map_simplify(ctx, bmap);
1881 return isl_basic_map_finalize(ctx, bmap);
1883 isl_basic_map_free(ctx, bmap);
1887 struct isl_map *isl_map_fix_input_si(struct isl_ctx *ctx, struct isl_map *map,
1888 unsigned input, int value)
1892 map = isl_map_cow(ctx, map);
1896 isl_assert(ctx, input < map->n_in, goto error);
1897 for (i = 0; i < map->n; ++i) {
1898 map->p[i] = isl_basic_map_fix_input_si(ctx, map->p[i],
1905 isl_map_free(ctx, map);
1909 struct isl_map *isl_map_reverse(struct isl_ctx *ctx, struct isl_map *map)
1914 map = isl_map_cow(ctx, map);
1919 map->n_in = map->n_out;
1921 for (i = 0; i < map->n; ++i) {
1922 map->p[i] = isl_basic_map_reverse(ctx, map->p[i]);
1928 isl_map_free(ctx, map);
1932 struct isl_map *isl_basic_map_lexmax(struct isl_ctx *ctx,
1933 struct isl_basic_map *bmap, struct isl_basic_set *dom,
1934 struct isl_set **empty)
1936 return isl_pip_basic_map_lexmax(ctx, bmap, dom, empty);
1939 struct isl_map *isl_basic_map_lexmin(struct isl_ctx *ctx,
1940 struct isl_basic_map *bmap, struct isl_basic_set *dom,
1941 struct isl_set **empty)
1943 return isl_pip_basic_map_lexmin(ctx, bmap, dom, empty);
1946 struct isl_set *isl_basic_set_lexmin(struct isl_ctx *ctx,
1947 struct isl_basic_set *bset)
1949 struct isl_basic_map *bmap = NULL;
1950 struct isl_basic_set *dom = NULL;
1951 struct isl_map *min;
1955 bmap = isl_basic_map_from_basic_set(ctx, bset, 0, bset->dim);
1958 dom = isl_basic_set_alloc(ctx, bmap->nparam, 0, 0, 0, 0);
1961 min = isl_basic_map_lexmin(ctx, bmap, dom, NULL);
1962 return isl_map_range(ctx, min);
1964 isl_basic_map_free(ctx, bmap);
1968 struct isl_map *isl_basic_map_compute_divs(struct isl_ctx *ctx,
1969 struct isl_basic_map *bmap)
1971 if (bmap->n_div == 0)
1972 return isl_map_from_basic_map(ctx, bmap);
1973 return isl_pip_basic_map_compute_divs(ctx, bmap);
1976 struct isl_map *isl_map_compute_divs(struct isl_ctx *ctx, struct isl_map *map)
1979 struct isl_map *res;
1985 res = isl_basic_map_compute_divs(ctx,
1986 isl_basic_map_copy(ctx, map->p[0]));
1987 for (i = 1 ; i < map->n; ++i) {
1989 r2 = isl_basic_map_compute_divs(ctx,
1990 isl_basic_map_copy(ctx, map->p[i]));
1991 if (F_ISSET(map, ISL_MAP_DISJOINT))
1992 res = isl_map_union_disjoint(ctx, res, r2);
1994 res = isl_map_union(ctx, res, r2);
1996 isl_map_free(ctx, map);
2001 struct isl_set *isl_basic_set_compute_divs(struct isl_ctx *ctx,
2002 struct isl_basic_set *bset)
2004 return (struct isl_set *)
2005 isl_basic_map_compute_divs(ctx,
2006 (struct isl_basic_map *)bset);
2009 struct isl_set *isl_map_domain(struct isl_ctx *ctx, struct isl_map *map)
2012 struct isl_set *set;
2017 map = isl_map_cow(ctx, map);
2021 set = (struct isl_set *)map;
2022 set->dim = map->n_in;
2024 for (i = 0; i < map->n; ++i) {
2025 set->p[i] = isl_basic_map_domain(ctx, map->p[i]);
2029 F_CLR(set, ISL_MAP_DISJOINT);
2032 isl_map_free(ctx, map);
2036 struct isl_map *isl_map_union_disjoint(struct isl_ctx *ctx,
2037 struct isl_map *map1, struct isl_map *map2)
2041 struct isl_map *map = NULL;
2047 isl_map_free(ctx, map1);
2051 isl_map_free(ctx, map2);
2055 isl_assert(ctx, map1->nparam == map2->nparam, goto error);
2056 isl_assert(ctx, map1->n_in == map2->n_in, goto error);
2057 isl_assert(ctx, map1->n_out == map2->n_out, goto error);
2059 if (F_ISSET(map1, ISL_MAP_DISJOINT) &&
2060 F_ISSET(map2, ISL_MAP_DISJOINT))
2061 FL_SET(flags, ISL_MAP_DISJOINT);
2063 map = isl_map_alloc(ctx, map1->nparam, map1->n_in, map1->n_out,
2064 map1->n + map2->n, flags);
2067 for (i = 0; i < map1->n; ++i) {
2068 map = isl_map_add(ctx, map,
2069 isl_basic_map_copy(ctx, map1->p[i]));
2073 for (i = 0; i < map2->n; ++i) {
2074 map = isl_map_add(ctx, map,
2075 isl_basic_map_copy(ctx, map2->p[i]));
2079 isl_map_free(ctx, map1);
2080 isl_map_free(ctx, map2);
2083 isl_map_free(ctx, map);
2084 isl_map_free(ctx, map1);
2085 isl_map_free(ctx, map2);
2089 struct isl_map *isl_map_union(struct isl_ctx *ctx,
2090 struct isl_map *map1, struct isl_map *map2)
2092 map1 = isl_map_union_disjoint(ctx, map1, map2);
2096 F_CLR(map1, ISL_MAP_DISJOINT);
2100 struct isl_set *isl_set_union_disjoint(struct isl_ctx *ctx,
2101 struct isl_set *set1, struct isl_set *set2)
2103 return (struct isl_set *)
2104 isl_map_union_disjoint(ctx,
2105 (struct isl_map *)set1, (struct isl_map *)set2);
2108 struct isl_set *isl_set_union(struct isl_ctx *ctx,
2109 struct isl_set *set1, struct isl_set *set2)
2111 return (struct isl_set *)
2113 (struct isl_map *)set1, (struct isl_map *)set2);
2116 struct isl_map *isl_map_intersect_range(
2117 struct isl_ctx *ctx, struct isl_map *map,
2118 struct isl_set *set)
2121 struct isl_map *result;
2127 if (F_ISSET(map, ISL_MAP_DISJOINT) &&
2128 F_ISSET(set, ISL_MAP_DISJOINT))
2129 FL_SET(flags, ISL_MAP_DISJOINT);
2131 result = isl_map_alloc(ctx, map->nparam, map->n_in, map->n_out,
2132 map->n * set->n, flags);
2135 for (i = 0; i < map->n; ++i)
2136 for (j = 0; j < set->n; ++j) {
2137 result = isl_map_add(ctx, result,
2138 isl_basic_map_intersect_range(ctx,
2139 isl_basic_map_copy(ctx, map->p[i]),
2140 isl_basic_set_copy(ctx, set->p[j])));
2144 isl_map_free(ctx, map);
2145 isl_set_free(ctx, set);
2148 isl_map_free(ctx, map);
2149 isl_set_free(ctx, set);
2153 struct isl_map *isl_map_intersect_domain(
2154 struct isl_ctx *ctx, struct isl_map *map,
2155 struct isl_set *set)
2157 return isl_map_reverse(ctx,
2158 isl_map_intersect_range(ctx, isl_map_reverse(ctx, map), set));
2161 struct isl_map *isl_map_apply_domain(
2162 struct isl_ctx *ctx, struct isl_map *map1,
2163 struct isl_map *map2)
2167 map1 = isl_map_reverse(ctx, map1);
2168 map1 = isl_map_apply_range(ctx, map1, map2);
2169 return isl_map_reverse(ctx, map1);
2171 isl_map_free(ctx, map1);
2172 isl_map_free(ctx, map2);
2176 struct isl_map *isl_map_apply_range(
2177 struct isl_ctx *ctx, struct isl_map *map1,
2178 struct isl_map *map2)
2180 struct isl_map *result;
2186 isl_assert(ctx, map1->nparam == map2->nparam, goto error);
2187 isl_assert(ctx, map1->n_out == map2->n_in, goto error);
2189 result = isl_map_alloc(ctx, map1->nparam, map1->n_in, map2->n_out,
2190 map1->n * map2->n, 0);
2193 for (i = 0; i < map1->n; ++i)
2194 for (j = 0; j < map2->n; ++j) {
2195 result = isl_map_add(ctx, result,
2196 isl_basic_map_apply_range(ctx,
2197 isl_basic_map_copy(ctx, map1->p[i]),
2198 isl_basic_map_copy(ctx, map2->p[j])));
2202 isl_map_free(ctx, map1);
2203 isl_map_free(ctx, map2);
2206 isl_map_free(ctx, map1);
2207 isl_map_free(ctx, map2);
2212 * returns range - domain
2214 struct isl_basic_set *isl_basic_map_deltas(struct isl_ctx *ctx,
2215 struct isl_basic_map *bmap)
2217 struct isl_basic_set *bset;
2223 isl_assert(ctx, bmap->n_in == bmap->n_out, goto error);
2225 bset = isl_basic_set_from_basic_map(ctx, bmap);
2226 bset = isl_basic_set_extend(ctx, bset, bset->nparam, 3*dim, 0,
2228 bset = isl_basic_set_swap_vars(ctx, bset, 2*dim);
2229 for (i = 0; i < dim; ++i) {
2230 int j = isl_basic_map_alloc_equality(ctx,
2231 (struct isl_basic_map *)bset);
2234 isl_int_set_si(bset->eq[j][1+bset->nparam+i], 1);
2235 isl_int_set_si(bset->eq[j][1+bset->nparam+dim+i], 1);
2236 isl_int_set_si(bset->eq[j][1+bset->nparam+2*dim+i], -1);
2238 return isl_basic_set_project_out(ctx, bset, 2*dim, 0);
2240 isl_basic_map_free(ctx, bmap);
2244 /* If the only constraints a div d=floor(f/m)
2245 * appears in are its two defining constraints
2248 * -(f - (m - 1)) + m d >= 0
2250 * then it can safely be removed.
2252 static int div_is_redundant(struct isl_ctx *ctx, struct isl_basic_map *bmap,
2256 unsigned pos = 1 + bmap->nparam + bmap->n_in + bmap->n_out + div;
2258 for (i = 0; i < bmap->n_eq; ++i)
2259 if (!isl_int_is_zero(bmap->eq[i][pos]))
2262 for (i = 0; i < bmap->n_ineq; ++i) {
2263 if (isl_int_is_zero(bmap->ineq[i][pos]))
2265 if (isl_int_eq(bmap->ineq[i][pos], bmap->div[div][0])) {
2267 isl_int_sub(bmap->div[div][1],
2268 bmap->div[div][1], bmap->div[div][0]);
2269 isl_int_add_ui(bmap->div[div][1], bmap->div[div][1], 1);
2270 neg = isl_seq_is_neg(bmap->ineq[i], bmap->div[div]+1, pos);
2271 isl_int_sub_ui(bmap->div[div][1], bmap->div[div][1], 1);
2272 isl_int_add(bmap->div[div][1],
2273 bmap->div[div][1], bmap->div[div][0]);
2276 if (isl_seq_first_non_zero(bmap->ineq[i]+pos+1,
2277 bmap->n_div-div-1) != -1)
2279 } else if (isl_int_abs_eq(bmap->ineq[i][pos], bmap->div[div][0])) {
2280 if (!isl_seq_eq(bmap->ineq[i], bmap->div[div]+1, pos))
2282 if (isl_seq_first_non_zero(bmap->ineq[i]+pos+1,
2283 bmap->n_div-div-1) != -1)
2289 for (i = 0; i < bmap->n_div; ++i)
2290 if (!isl_int_is_zero(bmap->div[i][1+pos]))
2297 * Remove divs that don't occur in any of the constraints or other divs.
2298 * These can arise when dropping some of the variables in a quast
2299 * returned by piplib.
2301 static struct isl_basic_map *remove_redundant_divs(struct isl_ctx *ctx,
2302 struct isl_basic_map *bmap)
2306 for (i = bmap->n_div-1; i >= 0; --i) {
2307 if (!div_is_redundant(ctx, bmap, i))
2309 bmap = isl_basic_map_drop_div(ctx, bmap, i);
2314 struct isl_basic_map *isl_basic_map_finalize(struct isl_ctx *ctx,
2315 struct isl_basic_map *bmap)
2317 bmap = remove_redundant_divs(ctx, bmap);
2320 F_SET(bmap, ISL_BASIC_SET_FINAL);
2324 struct isl_basic_set *isl_basic_set_finalize(struct isl_ctx *ctx,
2325 struct isl_basic_set *bset)
2327 return (struct isl_basic_set *)
2328 isl_basic_map_finalize(ctx,
2329 (struct isl_basic_map *)bset);
2332 struct isl_set *isl_set_finalize(struct isl_ctx *ctx, struct isl_set *set)
2338 for (i = 0; i < set->n; ++i) {
2339 set->p[i] = isl_basic_set_finalize(ctx, set->p[i]);
2345 isl_set_free(ctx, set);
2349 struct isl_map *isl_map_finalize(struct isl_ctx *ctx, struct isl_map *map)
2355 for (i = 0; i < map->n; ++i) {
2356 map->p[i] = isl_basic_map_finalize(ctx, map->p[i]);
2362 isl_map_free(ctx, map);
2366 struct isl_basic_map *isl_basic_map_identity(struct isl_ctx *ctx,
2367 unsigned nparam, unsigned dim)
2369 struct isl_basic_map *bmap;
2372 bmap = isl_basic_map_alloc(ctx, nparam, dim, dim, 0, dim, 0);
2376 for (i = 0; i < dim; ++i) {
2377 int j = isl_basic_map_alloc_equality(ctx, bmap);
2380 isl_int_set_si(bmap->eq[j][1+nparam+i], 1);
2381 isl_int_set_si(bmap->eq[j][1+nparam+dim+i], -1);
2383 return isl_basic_map_finalize(ctx, bmap);
2385 isl_basic_map_free(ctx, bmap);
2389 struct isl_map *isl_map_identity(struct isl_ctx *ctx,
2390 unsigned nparam, unsigned dim)
2392 struct isl_map *map = isl_map_alloc(ctx, nparam, dim, dim, 1,
2396 map = isl_map_add(ctx, map,
2397 isl_basic_map_identity(ctx, nparam, dim));
2400 isl_map_free(ctx, map);
2404 int isl_set_is_equal(struct isl_ctx *ctx,
2405 struct isl_set *set1, struct isl_set *set2)
2407 return isl_map_is_equal(ctx,
2408 (struct isl_map *)set1, (struct isl_map *)set2);
2411 int isl_set_is_subset(struct isl_ctx *ctx,
2412 struct isl_set *set1, struct isl_set *set2)
2414 return isl_map_is_subset(ctx,
2415 (struct isl_map *)set1, (struct isl_map *)set2);
2418 int isl_basic_map_is_subset(struct isl_ctx *ctx,
2419 struct isl_basic_map *bmap1,
2420 struct isl_basic_map *bmap2)
2423 struct isl_map *map1;
2424 struct isl_map *map2;
2426 if (!bmap1 || !bmap2)
2429 map1 = isl_map_from_basic_map(ctx,
2430 isl_basic_map_copy(ctx, bmap1));
2431 map2 = isl_map_from_basic_map(ctx,
2432 isl_basic_map_copy(ctx, bmap2));
2434 is_subset = isl_map_is_subset(ctx, map1, map2);
2436 isl_map_free(ctx, map1);
2437 isl_map_free(ctx, map2);
2442 int isl_map_is_empty(struct isl_ctx *ctx, struct isl_map *map)
2449 for (i = 0; i < map->n; ++i) {
2450 is_empty = isl_basic_map_is_empty(ctx, map->p[i]);
2459 int isl_set_is_empty(struct isl_ctx *ctx, struct isl_set *set)
2461 return isl_map_is_empty(ctx, (struct isl_map *)set);
2464 int isl_map_is_subset(struct isl_ctx *ctx, struct isl_map *map1,
2465 struct isl_map *map2)
2469 struct isl_map *diff;
2474 if (isl_map_is_empty(ctx, map1))
2477 if (isl_map_is_empty(ctx, map2))
2480 diff = isl_map_subtract(ctx, isl_map_copy(ctx, map1),
2481 isl_map_copy(ctx, map2));
2485 is_subset = isl_map_is_empty(ctx, diff);
2486 isl_map_free(ctx, diff);
2491 int isl_map_is_equal(struct isl_ctx *ctx,
2492 struct isl_map *map1, struct isl_map *map2)
2498 is_subset = isl_map_is_subset(ctx, map1, map2);
2501 is_subset = isl_map_is_subset(ctx, map2, map1);
2505 int isl_basic_map_is_strict_subset(struct isl_ctx *ctx,
2506 struct isl_basic_map *bmap1,
2507 struct isl_basic_map *bmap2)
2511 if (!bmap1 || !bmap2)
2513 is_subset = isl_basic_map_is_subset(ctx, bmap1, bmap2);
2516 is_subset = isl_basic_map_is_subset(ctx, bmap2, bmap1);
2517 if (is_subset == -1)
2522 int isl_basic_map_is_empty(struct isl_ctx *ctx,
2523 struct isl_basic_map *bmap)
2525 struct isl_basic_set *bset = NULL;
2526 struct isl_vec *sample = NULL;
2532 if (F_ISSET(bmap, ISL_BASIC_MAP_EMPTY))
2535 bset = isl_basic_map_underlying_set(ctx,
2536 isl_basic_map_copy(ctx, bmap));
2539 sample = isl_basic_set_sample(ctx, bset);
2542 empty = sample->size == 0;
2543 isl_vec_free(ctx, sample);
2548 struct isl_map *isl_basic_map_union(
2549 struct isl_ctx *ctx, struct isl_basic_map *bmap1,
2550 struct isl_basic_map *bmap2)
2552 struct isl_map *map;
2553 if (!bmap1 || !bmap2)
2556 isl_assert(ctx, bmap1->nparam == bmap2->nparam, goto error);
2557 isl_assert(ctx, bmap1->n_in == bmap2->n_in, goto error);
2558 isl_assert(ctx, bmap1->n_out == bmap2->n_out, goto error);
2560 map = isl_map_alloc(ctx, bmap1->nparam,
2561 bmap1->n_in, bmap1->n_out, 2, 0);
2564 map = isl_map_add(ctx, map, bmap1);
2565 map = isl_map_add(ctx, map, bmap2);
2568 isl_basic_map_free(ctx, bmap1);
2569 isl_basic_map_free(ctx, bmap2);
2573 struct isl_set *isl_basic_set_union(
2574 struct isl_ctx *ctx, struct isl_basic_set *bset1,
2575 struct isl_basic_set *bset2)
2577 return (struct isl_set *)isl_basic_map_union(ctx,
2578 (struct isl_basic_map *)bset1,
2579 (struct isl_basic_map *)bset2);
2582 /* Order divs such that any div only depends on previous divs */
2583 static struct isl_basic_map *order_divs(struct isl_ctx *ctx,
2584 struct isl_basic_map *bmap)
2587 unsigned off = bmap->nparam + bmap->n_in + bmap->n_out;
2589 for (i = 0; i < bmap->n_div; ++i) {
2591 pos = isl_seq_first_non_zero(bmap->div[i]+1+1+off+i,
2595 swap_div(bmap, i, pos);
2601 static int find_div(struct isl_basic_map *dst,
2602 struct isl_basic_map *src, unsigned div)
2606 unsigned total = src->nparam + src->n_in + src->n_out + src->n_div;
2608 for (i = 0; i < dst->n_div; ++i)
2609 if (isl_seq_eq(dst->div[i], src->div[div], 1+1+total) &&
2610 isl_seq_first_non_zero(dst->div[i]+1+1+total,
2611 dst->n_div - src->n_div) == -1)
2616 /* For a div d = floor(f/m), add the constraints
2619 * -(f-(n-1)) + m d >= 0
2621 * Note that the second constraint is the negation of
2625 static int add_div_constraints(struct isl_ctx *ctx,
2626 struct isl_basic_map *bmap, unsigned div)
2629 unsigned div_pos = 1 + bmap->nparam + bmap->n_in + bmap->n_out + div;
2630 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
2632 i = isl_basic_map_alloc_inequality(ctx, bmap);
2635 isl_seq_cpy(bmap->ineq[i], bmap->div[div]+1, 1+total);
2636 isl_int_neg(bmap->ineq[i][div_pos], bmap->div[div][0]);
2638 j = isl_basic_map_alloc_inequality(ctx, bmap);
2641 isl_seq_neg(bmap->ineq[j], bmap->ineq[i], 1 + total);
2642 isl_int_add(bmap->ineq[j][0], bmap->ineq[j][0], bmap->ineq[j][div_pos]);
2643 isl_int_sub_ui(bmap->ineq[j][0], bmap->ineq[j][0], 1);
2647 struct isl_basic_map *isl_basic_map_align_divs(struct isl_ctx *ctx,
2648 struct isl_basic_map *dst, struct isl_basic_map *src)
2651 unsigned total = src->nparam + src->n_in + src->n_out + src->n_div;
2653 if (src->n_div == 0)
2656 src = order_divs(ctx, src);
2657 dst = isl_basic_map_extend(ctx, dst, dst->nparam, dst->n_in,
2658 dst->n_out, src->n_div, 0, 2 * src->n_div);
2661 for (i = 0; i < src->n_div; ++i) {
2662 int j = find_div(dst, src, i);
2664 j = isl_basic_map_alloc_div(ctx, dst);
2667 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total);
2668 if (add_div_constraints(ctx, dst, j) < 0)
2672 swap_div(dst, i, j);
2676 isl_basic_map_free(ctx, dst);
2680 static struct isl_map *add_cut_constraint(struct isl_ctx *ctx,
2681 struct isl_map *dst,
2682 struct isl_basic_map *src, isl_int *c,
2683 unsigned len, unsigned extra, int oppose)
2685 struct isl_basic_map *copy = NULL;
2689 copy = isl_basic_map_copy(ctx, src);
2690 copy = isl_basic_map_cow(ctx, copy);
2693 copy = isl_basic_map_extend(ctx, copy,
2694 copy->nparam, copy->n_in, copy->n_out, 0, 0, 1);
2695 k = isl_basic_map_alloc_inequality(ctx, copy);
2699 isl_seq_neg(copy->ineq[k], c, len);
2701 isl_seq_cpy(copy->ineq[k], c, len);
2702 isl_seq_clr(copy->ineq[k]+len, extra);
2703 isl_inequality_negate(ctx, copy, k);
2704 copy = isl_basic_map_simplify(ctx, copy);
2705 copy = isl_basic_map_finalize(ctx, copy);
2706 is_empty = isl_basic_map_is_empty(ctx, copy);
2710 dst = isl_map_add(ctx, dst, copy);
2712 isl_basic_map_free(ctx, copy);
2715 isl_basic_map_free(ctx, copy);
2716 isl_map_free(ctx, dst);
2720 static struct isl_map *subtract(struct isl_ctx *ctx, struct isl_map *map,
2721 struct isl_basic_map *bmap)
2725 struct isl_map *rest = NULL;
2727 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
2734 if (F_ISSET(map, ISL_MAP_DISJOINT))
2735 FL_SET(flags, ISL_MAP_DISJOINT);
2737 max = map->n * (2 * bmap->n_eq + bmap->n_ineq);
2738 rest = isl_map_alloc(ctx, map->nparam, map->n_in, map->n_out,
2743 for (i = 0; i < map->n; ++i) {
2744 map->p[i] = isl_basic_map_align_divs(ctx, map->p[i], bmap);
2749 for (j = 0; j < map->n; ++j)
2750 map->p[j] = isl_basic_map_cow(ctx, map->p[j]);
2752 for (i = 0; i < bmap->n_eq; ++i) {
2753 for (j = 0; j < map->n; ++j) {
2754 rest = add_cut_constraint(ctx, rest,
2755 map->p[j], bmap->eq[i],
2756 1+total, map->p[j]->n_div - bmap->n_div, 0);
2760 rest = add_cut_constraint(ctx, rest,
2761 map->p[j], bmap->eq[i],
2762 1+total, map->p[j]->n_div - bmap->n_div, 1);
2766 map->p[j] = isl_basic_map_extend(ctx, map->p[j],
2767 map->p[j]->nparam, map->p[j]->n_in,
2768 map->p[j]->n_out, 0, 1, 0);
2771 k = isl_basic_map_alloc_equality(ctx, map->p[j]);
2774 isl_seq_cpy(map->p[j]->eq[k], bmap->eq[i], 1+total);
2775 isl_seq_clr(map->p[j]->eq[k]+1+total,
2776 map->p[j]->n_div - bmap->n_div);
2780 for (i = 0; i < bmap->n_ineq; ++i) {
2781 for (j = 0; j < map->n; ++j) {
2782 rest = add_cut_constraint(ctx, rest,
2783 map->p[j], bmap->ineq[i],
2784 1+total, map->p[j]->n_div - bmap->n_div, 0);
2788 map->p[j] = isl_basic_map_extend(ctx, map->p[j],
2789 map->p[j]->nparam, map->p[j]->n_in,
2790 map->p[j]->n_out, 0, 0, 1);
2793 k = isl_basic_map_alloc_inequality(ctx, map->p[j]);
2796 isl_seq_cpy(map->p[j]->ineq[k], bmap->ineq[i], 1+total);
2797 isl_seq_clr(map->p[j]->ineq[k]+1+total,
2798 map->p[j]->n_div - bmap->n_div);
2802 isl_map_free(ctx, map);
2805 isl_map_free(ctx, map);
2806 isl_map_free(ctx, rest);
2810 struct isl_map *isl_map_subtract(struct isl_ctx *ctx, struct isl_map *map1,
2811 struct isl_map *map2)
2817 isl_assert(ctx, map1->nparam == map2->nparam, goto error);
2818 isl_assert(ctx, map1->n_in == map2->n_in, goto error);
2819 isl_assert(ctx, map1->n_out == map2->n_out, goto error);
2821 if (isl_map_is_empty(ctx, map2)) {
2822 isl_map_free(ctx, map2);
2826 map1 = isl_map_compute_divs(ctx, map1);
2827 map2 = isl_map_compute_divs(ctx, map2);
2831 for (i = 0; map1 && i < map2->n; ++i)
2832 map1 = subtract(ctx, map1, map2->p[i]);
2834 isl_map_free(ctx, map2);
2837 isl_map_free(ctx, map1);
2838 isl_map_free(ctx, map2);
2842 struct isl_set *isl_set_subtract(struct isl_ctx *ctx, struct isl_set *set1,
2843 struct isl_set *set2)
2845 return (struct isl_set *)
2846 isl_map_subtract(ctx,
2847 (struct isl_map *)set1, (struct isl_map *)set2);
2850 struct isl_set *isl_set_apply(struct isl_ctx *ctx, struct isl_set *set,
2851 struct isl_map *map)
2853 isl_assert(ctx, set->dim == map->n_in, goto error);
2854 map = isl_map_intersect_domain(ctx, map, set);
2855 set = isl_map_range(ctx, map);
2858 isl_set_free(ctx, set);
2859 isl_map_free(ctx, map);