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 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 struct isl_basic_set *isl_basic_set_set_to_empty(
678 struct isl_ctx *ctx, struct isl_basic_set *bset)
680 return (struct isl_basic_set *)
681 isl_basic_map_set_to_empty(ctx, (struct isl_basic_map *)bset);
684 static void swap_equality(struct isl_basic_map *bmap, int a, int b)
686 isl_int *t = bmap->eq[a];
687 bmap->eq[a] = bmap->eq[b];
691 static void swap_inequality(struct isl_basic_map *bmap, int a, int b)
693 isl_int *t = bmap->ineq[a];
694 bmap->ineq[a] = bmap->ineq[b];
698 static void swap_div(struct isl_basic_map *bmap, int a, int b)
701 unsigned off = bmap->nparam + bmap->n_in + bmap->n_out;
702 isl_int *t = bmap->div[a];
703 bmap->div[a] = bmap->div[b];
706 for (i = 0; i < bmap->n_eq; ++i)
707 isl_int_swap(bmap->eq[i][1+off+a], bmap->eq[i][1+off+b]);
709 for (i = 0; i < bmap->n_ineq; ++i)
710 isl_int_swap(bmap->ineq[i][1+off+a], bmap->ineq[i][1+off+b]);
712 for (i = 0; i < bmap->n_div; ++i)
713 isl_int_swap(bmap->div[i][1+1+off+a], bmap->div[i][1+1+off+b]);
716 struct isl_basic_map *isl_basic_map_gauss(struct isl_ctx *ctx,
717 struct isl_basic_map *bmap, int *progress)
728 total_var = bmap->nparam + bmap->n_in + bmap->n_out;
729 total = total_var + bmap->n_div;
731 last_var = total - 1;
732 for (done = 0; done < bmap->n_eq; ++done) {
733 for (; last_var >= 0; --last_var) {
734 for (k = done; k < bmap->n_eq; ++k)
735 if (!isl_int_is_zero(bmap->eq[k][1+last_var]))
743 swap_equality(bmap, k, done);
744 if (isl_int_is_neg(bmap->eq[done][1+last_var]))
745 isl_seq_neg(bmap->eq[done], bmap->eq[done], 1+total);
747 for (k = 0; k < bmap->n_eq; ++k) {
750 if (isl_int_is_zero(bmap->eq[k][1+last_var]))
754 isl_seq_elim(bmap->eq[k], bmap->eq[done],
755 1+last_var, 1+total, NULL);
758 for (k = 0; k < bmap->n_ineq; ++k) {
759 if (isl_int_is_zero(bmap->ineq[k][1+last_var]))
763 isl_seq_elim(bmap->ineq[k], bmap->eq[done],
764 1+last_var, 1+total, NULL);
767 for (k = 0; k < bmap->n_div; ++k) {
768 if (isl_int_is_zero(bmap->div[k][0]))
770 if (isl_int_is_zero(bmap->div[k][1+1+last_var]))
774 isl_seq_elim(bmap->div[k]+1, bmap->eq[done],
775 1+last_var, 1+total, &bmap->div[k][0]);
778 if (last_var >= total_var &&
779 isl_int_is_zero(bmap->div[last_var - total_var][0])) {
780 unsigned div = last_var - total_var;
781 isl_seq_neg(bmap->div[div]+1, bmap->eq[done], 1+total);
782 isl_int_set_si(bmap->div[div][1+1+last_var], 0);
783 isl_int_set(bmap->div[div][0],
784 bmap->eq[done][1+last_var]);
787 if (done == bmap->n_eq)
789 for (k = done; k < bmap->n_eq; ++k) {
790 if (isl_int_is_zero(bmap->eq[k][0]))
792 return isl_basic_map_set_to_empty(ctx, bmap);
794 isl_basic_map_free_equality(ctx, bmap, bmap->n_eq-done);
798 struct isl_basic_set *isl_basic_set_gauss(struct isl_ctx *ctx,
799 struct isl_basic_set *bset, int *progress)
801 return (struct isl_basic_set*)isl_basic_map_gauss(ctx,
802 (struct isl_basic_map *)bset, progress);
805 static unsigned int round_up(unsigned int v)
816 static struct isl_basic_map *remove_duplicate_constraints(
818 struct isl_basic_map *bmap, int *progress)
824 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
826 if (bmap->n_ineq <= 1)
829 size = round_up(4 * bmap->n_ineq / 3 - 1);
830 bits = ffs(size) - 1;
831 index = isl_alloc_array(ctx, int, size);
832 memset(index, 0, size * sizeof(int));
836 index[isl_seq_hash(bmap->ineq[0]+1, total, bits)] = 1;
837 for (k = 1; k < bmap->n_ineq; ++k) {
838 u_int32_t hash = isl_seq_hash(bmap->ineq[k]+1, total, bits);
839 for (h = hash; index[h]; h = (h+1) % size)
840 if (isl_seq_eq(bmap->ineq[k]+1,
841 bmap->ineq[index[h]-1]+1, total))
849 if (isl_int_lt(bmap->ineq[k][0], bmap->ineq[l][0]))
850 swap_inequality(bmap, k, l);
851 isl_basic_map_drop_inequality(ctx, bmap, k);
859 static struct isl_basic_map *remove_duplicate_divs(struct isl_ctx *ctx,
860 struct isl_basic_map *bmap, int *progress)
867 unsigned total_var = bmap->nparam + bmap->n_in + bmap->n_out;
868 unsigned total = total_var + bmap->n_div;
870 if (bmap->n_div <= 1)
873 for (k = bmap->n_div - 1; k >= 0; --k)
874 if (!isl_int_is_zero(bmap->div[k][0]))
879 size = round_up(4 * bmap->n_div / 3 - 1);
880 bits = ffs(size) - 1;
881 index = isl_alloc_array(ctx, int, size);
882 memset(index, 0, size * sizeof(int));
885 eq = isl_blk_alloc(ctx, 1+total);
889 isl_seq_clr(eq.data, 1+total);
890 index[isl_seq_hash(bmap->div[k], 2+total, bits)] = k + 1;
891 for (--k; k >= 0; --k) {
894 if (isl_int_is_zero(bmap->div[k][0]))
897 hash = isl_seq_hash(bmap->div[k], 2+total, bits);
898 for (h = hash; index[h]; h = (h+1) % size)
899 if (isl_seq_eq(bmap->div[k],
900 bmap->div[index[h]-1], 2+total))
905 isl_int_set_si(eq.data[1+total_var+k], -1);
906 isl_int_set_si(eq.data[1+total_var+l], 1);
907 eliminate_div(ctx, bmap, eq.data, l);
908 isl_int_set_si(eq.data[1+total_var+k], 0);
909 isl_int_set_si(eq.data[1+total_var+l], 0);
914 isl_blk_free(ctx, eq);
920 static struct isl_basic_map *eliminate_divs(
921 struct isl_ctx *ctx, struct isl_basic_map *bmap,
932 off = 1 + bmap->nparam + bmap->n_in + bmap->n_out;
934 for (d = bmap->n_div - 1; d >= 0 ; --d) {
935 for (i = 0; i < bmap->n_eq; ++i) {
936 if (!isl_int_is_one(bmap->eq[i][off + d]) &&
937 !isl_int_is_negone(bmap->eq[i][off + d]))
941 eliminate_div(ctx, bmap, bmap->eq[i], d);
942 isl_basic_map_drop_equality(ctx, bmap, i);
946 return eliminate_divs(ctx, bmap, progress);
950 static struct isl_basic_map *normalize_constraints(
951 struct isl_ctx *ctx, struct isl_basic_map *bmap)
955 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
958 for (i = bmap->n_eq - 1; i >= 0; --i) {
959 isl_seq_gcd(bmap->eq[i]+1, total, &gcd);
960 if (isl_int_is_zero(gcd)) {
961 if (!isl_int_is_zero(bmap->eq[i][0])) {
962 bmap = isl_basic_map_set_to_empty(ctx, bmap);
965 isl_basic_map_drop_equality(ctx, bmap, i);
968 if (isl_int_is_one(gcd))
970 if (!isl_int_is_divisible_by(bmap->eq[i][0], gcd)) {
971 bmap = isl_basic_map_set_to_empty(ctx, bmap);
974 isl_seq_scale_down(bmap->eq[i], bmap->eq[i], gcd, 1+total);
977 for (i = bmap->n_ineq - 1; i >= 0; --i) {
978 isl_seq_gcd(bmap->ineq[i]+1, total, &gcd);
979 if (isl_int_is_zero(gcd)) {
980 if (isl_int_is_neg(bmap->ineq[i][0])) {
981 bmap = isl_basic_map_set_to_empty(ctx, bmap);
984 isl_basic_map_drop_inequality(ctx, bmap, i);
987 if (isl_int_is_one(gcd))
989 isl_int_fdiv_q(bmap->ineq[i][0], bmap->ineq[i][0], gcd);
990 isl_seq_scale_down(bmap->ineq[i]+1, bmap->ineq[i]+1, gcd, total);
997 struct isl_basic_map *isl_basic_map_simplify(
998 struct isl_ctx *ctx, struct isl_basic_map *bmap)
1005 bmap = normalize_constraints(ctx, bmap);
1006 bmap = eliminate_divs(ctx, bmap, &progress);
1007 bmap = isl_basic_map_gauss(ctx, bmap, &progress);
1008 bmap = remove_duplicate_divs(ctx, bmap, &progress);
1009 bmap = remove_duplicate_constraints(ctx, bmap, &progress);
1014 struct isl_basic_set *isl_basic_set_simplify(
1015 struct isl_ctx *ctx, struct isl_basic_set *bset)
1017 return (struct isl_basic_set *)
1018 isl_basic_map_simplify(ctx,
1019 (struct isl_basic_map *)bset);
1022 static void dump_term(struct isl_basic_map *bmap,
1023 isl_int c, int pos, FILE *out)
1025 unsigned in = bmap->n_in;
1026 unsigned dim = bmap->n_in + bmap->n_out;
1028 isl_int_print(out, c);
1030 if (!isl_int_is_one(c))
1031 isl_int_print(out, c);
1032 if (pos < 1 + bmap->nparam)
1033 fprintf(out, "p%d", pos - 1);
1034 else if (pos < 1 + bmap->nparam + in)
1035 fprintf(out, "i%d", pos - 1 - bmap->nparam);
1036 else if (pos < 1 + bmap->nparam + dim)
1037 fprintf(out, "o%d", pos - 1 - bmap->nparam - in);
1039 fprintf(out, "e%d", pos - 1 - bmap->nparam - dim);
1043 static void dump_constraint_sign(struct isl_basic_map *bmap, isl_int *c,
1044 int sign, FILE *out)
1048 unsigned len = 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
1052 for (i = 0, first = 1; i < len; ++i) {
1053 if (isl_int_sgn(c[i]) * sign <= 0)
1056 fprintf(out, " + ");
1058 isl_int_abs(v, c[i]);
1059 dump_term(bmap, v, i, out);
1066 static void dump_constraint(struct isl_basic_map *bmap, isl_int *c,
1067 const char *op, FILE *out, int indent)
1069 fprintf(out, "%*s", indent, "");
1071 dump_constraint_sign(bmap, c, 1, out);
1072 fprintf(out, " %s ", op);
1073 dump_constraint_sign(bmap, c, -1, out);
1078 static void dump_constraints(struct isl_basic_map *bmap,
1079 isl_int **c, unsigned n,
1080 const char *op, FILE *out, int indent)
1084 for (i = 0; i < n; ++i)
1085 dump_constraint(bmap, c[i], op, out, indent);
1088 static void dump_affine(struct isl_basic_map *bmap, isl_int *exp, FILE *out)
1092 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
1094 for (j = 0; j < 1 + total; ++j) {
1095 if (isl_int_is_zero(exp[j]))
1097 if (!first && isl_int_is_pos(exp[j]))
1099 dump_term(bmap, exp[j], j, out);
1104 static void dump(struct isl_basic_map *bmap, FILE *out, int indent)
1108 dump_constraints(bmap, bmap->eq, bmap->n_eq, "=", out, indent);
1109 dump_constraints(bmap, bmap->ineq, bmap->n_ineq, ">=", out, indent);
1111 for (i = 0; i < bmap->n_div; ++i) {
1112 fprintf(out, "%*s", indent, "");
1113 fprintf(out, "e%d = [(", i);
1114 dump_affine(bmap, bmap->div[i]+1, out);
1116 isl_int_print(out, bmap->div[i][0]);
1117 fprintf(out, "]\n");
1121 void isl_basic_set_dump(struct isl_ctx *ctx, struct isl_basic_set *bset,
1122 FILE *out, int indent)
1124 fprintf(out, "%*s", indent, "");
1125 fprintf(out, "nparam: %d, dim: %d, extra: %d\n",
1126 bset->nparam, bset->dim, bset->extra);
1127 dump((struct isl_basic_map *)bset, out, indent);
1130 void isl_basic_map_dump(struct isl_ctx *ctx, struct isl_basic_map *bmap,
1131 FILE *out, int indent)
1133 fprintf(out, "%*s", indent, "");
1134 fprintf(out, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d\n",
1136 bmap->nparam, bmap->n_in, bmap->n_out, bmap->extra);
1137 dump(bmap, out, indent);
1140 int isl_inequality_negate(struct isl_ctx *ctx,
1141 struct isl_basic_map *bmap, unsigned pos)
1143 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
1144 isl_assert(ctx, pos < bmap->n_ineq, return -1);
1145 isl_seq_neg(bmap->ineq[pos], bmap->ineq[pos], 1 + total);
1146 isl_int_sub_ui(bmap->ineq[pos][0], bmap->ineq[pos][0], 1);
1150 struct isl_set *isl_set_alloc(struct isl_ctx *ctx,
1151 unsigned nparam, unsigned dim, int n, unsigned flags)
1153 struct isl_set *set;
1155 set = isl_alloc(ctx, struct isl_set,
1156 sizeof(struct isl_set) +
1157 n * sizeof(struct isl_basic_set *));
1164 set->nparam = nparam;
1171 struct isl_set *isl_set_dup(struct isl_ctx *ctx, struct isl_set *set)
1174 struct isl_set *dup;
1176 dup = isl_set_alloc(ctx, set->nparam, set->dim, set->n, set->flags);
1179 for (i = 0; i < set->n; ++i)
1180 dup = isl_set_add(ctx, dup,
1181 isl_basic_set_dup(ctx, set->p[i]));
1185 struct isl_set *isl_set_from_basic_set(struct isl_ctx *ctx,
1186 struct isl_basic_set *bset)
1188 struct isl_set *set;
1190 set = isl_set_alloc(ctx, bset->nparam, bset->dim, 1, ISL_MAP_DISJOINT);
1192 isl_basic_set_free(ctx, bset);
1195 return isl_set_add(ctx, set, bset);
1198 struct isl_map *isl_map_from_basic_map(struct isl_ctx *ctx,
1199 struct isl_basic_map *bmap)
1201 struct isl_map *map;
1203 map = isl_map_alloc(ctx, bmap->nparam, bmap->n_in, bmap->n_out, 1,
1206 isl_basic_map_free(ctx, bmap);
1209 return isl_map_add(ctx, map, bmap);
1212 struct isl_set *isl_set_add(struct isl_ctx *ctx, struct isl_set *set,
1213 struct isl_basic_set *bset)
1217 isl_assert(ctx, set->nparam == bset->nparam, goto error);
1218 isl_assert(ctx, set->dim == bset->dim, goto error);
1219 isl_assert(ctx, set->n < set->size, goto error);
1220 set->p[set->n] = bset;
1225 isl_set_free(ctx, set);
1227 isl_basic_set_free(ctx, bset);
1231 void isl_set_free(struct isl_ctx *ctx, struct isl_set *set)
1241 for (i = 0; i < set->n; ++i)
1242 isl_basic_set_free(ctx, set->p[i]);
1246 void isl_set_dump(struct isl_ctx *ctx, struct isl_set *set, FILE *out,
1252 fprintf(out, "null set\n");
1256 fprintf(out, "%*s", indent, "");
1257 fprintf(out, "ref: %d, n: %d\n", set->ref, set->n);
1258 for (i = 0; i < set->n; ++i) {
1259 fprintf(out, "%*s", indent, "");
1260 fprintf(out, "basic set %d:\n", i);
1261 isl_basic_set_dump(ctx, set->p[i], out, indent+4);
1265 void isl_map_dump(struct isl_ctx *ctx, struct isl_map *map, FILE *out,
1270 fprintf(out, "%*s", indent, "");
1271 fprintf(out, "ref: %d, n: %d, nparam: %d, in: %d, out: %d\n",
1272 map->ref, map->n, map->nparam, map->n_in, map->n_out);
1273 for (i = 0; i < map->n; ++i) {
1274 fprintf(out, "%*s", indent, "");
1275 fprintf(out, "basic map %d:\n", i);
1276 isl_basic_map_dump(ctx, map->p[i], out, indent+4);
1280 struct isl_basic_map *isl_basic_map_intersect_domain(
1281 struct isl_ctx *ctx, struct isl_basic_map *bmap,
1282 struct isl_basic_set *bset)
1284 struct isl_basic_map *bmap_domain;
1289 isl_assert(ctx, bset->dim == bmap->n_in, goto error);
1290 isl_assert(ctx, bset->nparam == bmap->nparam, goto error);
1292 bmap = isl_basic_map_extend(ctx, bmap,
1293 bset->nparam, bmap->n_in, bmap->n_out,
1294 bset->n_div, bset->n_eq, bset->n_ineq);
1297 bmap_domain = isl_basic_map_from_basic_set(ctx, bset,
1299 bmap = add_constraints(ctx, bmap, bmap_domain, 0, 0);
1301 bmap = isl_basic_map_simplify(ctx, bmap);
1302 return isl_basic_map_finalize(ctx, bmap);
1304 isl_basic_map_free(ctx, bmap);
1305 isl_basic_set_free(ctx, bset);
1309 struct isl_basic_map *isl_basic_map_intersect_range(
1310 struct isl_ctx *ctx, struct isl_basic_map *bmap,
1311 struct isl_basic_set *bset)
1313 struct isl_basic_map *bmap_range;
1318 isl_assert(ctx, bset->dim == bmap->n_out, goto error);
1319 isl_assert(ctx, bset->nparam == bmap->nparam, goto error);
1321 bmap = isl_basic_map_extend(ctx, bmap,
1322 bset->nparam, bmap->n_in, bmap->n_out,
1323 bset->n_div, bset->n_eq, bset->n_ineq);
1326 bmap_range = isl_basic_map_from_basic_set(ctx, bset,
1328 bmap = add_constraints(ctx, bmap, bmap_range, 0, 0);
1330 bmap = isl_basic_map_simplify(ctx, bmap);
1331 return isl_basic_map_finalize(ctx, bmap);
1333 isl_basic_map_free(ctx, bmap);
1334 isl_basic_set_free(ctx, bset);
1338 struct isl_basic_map *isl_basic_map_intersect(
1339 struct isl_ctx *ctx, struct isl_basic_map *bmap1,
1340 struct isl_basic_map *bmap2)
1342 isl_assert(ctx, bmap1->nparam == bmap2->nparam, goto error);
1343 isl_assert(ctx, bmap1->n_in == bmap2->n_in, goto error);
1344 isl_assert(ctx, bmap1->n_out == bmap2->n_out, goto error);
1346 bmap1 = isl_basic_map_extend(ctx, bmap1,
1347 bmap1->nparam, bmap1->n_in, bmap1->n_out,
1348 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
1351 bmap1 = add_constraints(ctx, bmap1, bmap2, 0, 0);
1353 bmap1 = isl_basic_map_simplify(ctx, bmap1);
1354 return isl_basic_map_finalize(ctx, bmap1);
1356 isl_basic_map_free(ctx, bmap1);
1357 isl_basic_map_free(ctx, bmap2);
1361 struct isl_basic_set *isl_basic_set_intersect(
1362 struct isl_ctx *ctx, struct isl_basic_set *bset1,
1363 struct isl_basic_set *bset2)
1365 return (struct isl_basic_set *)
1366 isl_basic_map_intersect(ctx,
1367 (struct isl_basic_map *)bset1,
1368 (struct isl_basic_map *)bset2);
1371 struct isl_map *isl_map_intersect(struct isl_ctx *ctx, struct isl_map *map1,
1372 struct isl_map *map2)
1375 struct isl_map *result;
1381 if (F_ISSET(map1, ISL_MAP_DISJOINT) &&
1382 F_ISSET(map2, ISL_MAP_DISJOINT))
1383 FL_SET(flags, ISL_MAP_DISJOINT);
1385 result = isl_map_alloc(ctx, map1->nparam, map1->n_in, map1->n_out,
1386 map1->n * map2->n, flags);
1389 for (i = 0; i < map1->n; ++i)
1390 for (j = 0; j < map2->n; ++j) {
1391 struct isl_basic_map *part;
1392 part = isl_basic_map_intersect(ctx,
1393 isl_basic_map_copy(ctx, map1->p[i]),
1394 isl_basic_map_copy(ctx, map2->p[j]));
1395 if (isl_basic_map_is_empty(ctx, part))
1396 isl_basic_map_free(ctx, part);
1398 result = isl_map_add(ctx, result, part);
1402 isl_map_free(ctx, map1);
1403 isl_map_free(ctx, map2);
1406 isl_map_free(ctx, map1);
1407 isl_map_free(ctx, map2);
1411 struct isl_basic_map *isl_basic_map_reverse(struct isl_ctx *ctx,
1412 struct isl_basic_map *bmap)
1414 struct isl_basic_set *bset;
1419 bmap = isl_basic_map_cow(ctx, bmap);
1423 bset = isl_basic_set_from_basic_map(ctx, bmap);
1424 bset = isl_basic_set_swap_vars(ctx, bset, in);
1425 return isl_basic_map_from_basic_set(ctx, bset, bset->dim-in, in);
1428 /* Turn final n dimensions into existentially quantified variables.
1430 struct isl_basic_set *isl_basic_set_project_out(
1431 struct isl_ctx *ctx, struct isl_basic_set *bset,
1432 unsigned n, unsigned flags)
1442 isl_assert(ctx, n <= bset->dim, goto error);
1447 bset = isl_basic_set_cow(ctx, bset);
1449 row_size = 1 + bset->nparam + bset->dim + bset->extra;
1450 old = bset->block2.data;
1451 bset->block2 = isl_blk_extend(ctx, bset->block2,
1452 (bset->extra + n) * (1 + row_size));
1453 if (!bset->block2.data)
1455 new_div = isl_alloc_array(ctx, isl_int *, bset->extra + n);
1458 for (i = 0; i < n; ++i) {
1459 new_div[i] = bset->block2.data +
1460 (bset->extra + i) * (1 + row_size);
1461 isl_seq_clr(new_div[i], 1 + row_size);
1463 for (i = 0; i < bset->extra; ++i)
1464 new_div[n + i] = bset->block2.data + (bset->div[i] - old);
1466 bset->div = new_div;
1470 bset = isl_basic_set_simplify(ctx, bset);
1471 return isl_basic_set_finalize(ctx, bset);
1473 isl_basic_set_free(ctx, bset);
1477 struct isl_basic_map *isl_basic_map_apply_range(
1478 struct isl_ctx *ctx, struct isl_basic_map *bmap1,
1479 struct isl_basic_map *bmap2)
1481 struct isl_basic_set *bset;
1482 unsigned n_in, n_out;
1484 if (!bmap1 || !bmap2)
1487 isl_assert(ctx, bmap1->n_out == bmap2->n_in, goto error);
1488 isl_assert(ctx, bmap1->nparam == bmap2->nparam, goto error);
1491 n_out = bmap2->n_out;
1493 bmap2 = isl_basic_map_reverse(ctx, bmap2);
1496 bmap1 = isl_basic_map_extend(ctx, bmap1, bmap1->nparam,
1497 bmap1->n_in + bmap2->n_in, bmap1->n_out,
1498 bmap2->extra, bmap2->n_eq, bmap2->n_ineq);
1501 bmap1 = add_constraints(ctx, bmap1, bmap2, bmap1->n_in - bmap2->n_in, 0);
1502 bmap1 = isl_basic_map_simplify(ctx, bmap1);
1503 bset = isl_basic_set_from_basic_map(ctx, bmap1);
1504 bset = isl_basic_set_project_out(ctx, bset,
1505 bset->dim - (n_in + n_out), 0);
1506 return isl_basic_map_from_basic_set(ctx, bset, n_in, n_out);
1508 isl_basic_map_free(ctx, bmap1);
1509 isl_basic_map_free(ctx, bmap2);
1513 struct isl_basic_map *isl_basic_map_apply_domain(
1514 struct isl_ctx *ctx, struct isl_basic_map *bmap1,
1515 struct isl_basic_map *bmap2)
1517 if (!bmap1 || !bmap2)
1520 isl_assert(ctx, bmap1->n_in == bmap2->n_in, goto error);
1521 isl_assert(ctx, bmap1->nparam == bmap2->nparam, goto error);
1523 bmap1 = isl_basic_map_reverse(ctx, bmap1);
1524 bmap1 = isl_basic_map_apply_range(ctx, bmap1, bmap2);
1525 return isl_basic_map_reverse(ctx, bmap1);
1527 isl_basic_map_free(ctx, bmap1);
1528 isl_basic_map_free(ctx, bmap2);
1532 static struct isl_basic_map *var_equal(struct isl_ctx *ctx,
1533 struct isl_basic_map *bmap, unsigned pos)
1536 i = isl_basic_map_alloc_equality(ctx, bmap);
1539 isl_seq_clr(bmap->eq[i],
1540 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->extra);
1541 isl_int_set_si(bmap->eq[i][1+bmap->nparam+pos], -1);
1542 isl_int_set_si(bmap->eq[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_more(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 static struct isl_basic_map *var_less(struct isl_ctx *ctx,
1568 struct isl_basic_map *bmap, unsigned pos)
1571 i = isl_basic_map_alloc_inequality(ctx, bmap);
1574 isl_seq_clr(bmap->ineq[i],
1575 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->extra);
1576 isl_int_set_si(bmap->ineq[i][0], -1);
1577 isl_int_set_si(bmap->ineq[i][1+bmap->nparam+pos], 1);
1578 isl_int_set_si(bmap->ineq[i][1+bmap->nparam+bmap->n_in+pos], -1);
1579 return isl_basic_map_finalize(ctx, bmap);
1581 isl_basic_map_free(ctx, bmap);
1585 struct isl_basic_map *isl_basic_map_equal(struct isl_ctx *ctx,
1586 unsigned nparam, unsigned in, unsigned out, unsigned n_equal)
1589 struct isl_basic_map *bmap;
1590 bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, n_equal, 0);
1593 for (i = 0; i < n_equal && bmap; ++i)
1594 bmap = var_equal(ctx, bmap, i);
1595 return isl_basic_map_finalize(ctx, bmap);
1598 struct isl_basic_map *isl_basic_map_less_at(struct isl_ctx *ctx,
1599 unsigned nparam, unsigned in, unsigned out, unsigned pos)
1602 struct isl_basic_map *bmap;
1603 bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, pos, 1);
1606 for (i = 0; i < pos && bmap; ++i)
1607 bmap = var_equal(ctx, bmap, i);
1609 bmap = var_less(ctx, bmap, pos);
1610 return isl_basic_map_finalize(ctx, bmap);
1613 struct isl_basic_map *isl_basic_map_more_at(struct isl_ctx *ctx,
1614 unsigned nparam, unsigned in, unsigned out, unsigned pos)
1617 struct isl_basic_map *bmap;
1618 bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, pos, 1);
1621 for (i = 0; i < pos && bmap; ++i)
1622 bmap = var_equal(ctx, bmap, i);
1624 bmap = var_more(ctx, bmap, pos);
1625 return isl_basic_map_finalize(ctx, bmap);
1628 struct isl_basic_map *isl_basic_map_from_basic_set(
1629 struct isl_ctx *ctx, struct isl_basic_set *bset,
1630 unsigned n_in, unsigned n_out)
1632 struct isl_basic_map *bmap;
1634 bset = isl_basic_set_cow(ctx, bset);
1638 isl_assert(ctx, bset->dim == n_in + n_out, goto error);
1639 bmap = (struct isl_basic_map *) bset;
1641 bmap->n_out = n_out;
1642 return isl_basic_map_finalize(ctx, bmap);
1644 isl_basic_set_free(ctx, bset);
1648 struct isl_basic_set *isl_basic_set_from_basic_map(
1649 struct isl_ctx *ctx, struct isl_basic_map *bmap)
1653 if (bmap->n_in == 0)
1654 return (struct isl_basic_set *)bmap;
1655 bmap = isl_basic_map_cow(ctx, bmap);
1658 bmap->n_out += bmap->n_in;
1660 bmap = isl_basic_map_finalize(ctx, bmap);
1661 return (struct isl_basic_set *)bmap;
1666 static struct isl_basic_set *isl_basic_map_underlying_set(
1667 struct isl_ctx *ctx, struct isl_basic_map *bmap)
1671 if (bmap->nparam == 0 && bmap->n_in == 0 && bmap->n_div == 0)
1672 return (struct isl_basic_set *)bmap;
1673 bmap = isl_basic_map_cow(ctx, bmap);
1676 bmap->n_out += bmap->nparam + bmap->n_in + bmap->n_div;
1680 bmap = isl_basic_map_finalize(ctx, bmap);
1681 return (struct isl_basic_set *)bmap;
1686 struct isl_basic_set *isl_basic_map_domain(struct isl_ctx *ctx,
1687 struct isl_basic_map *bmap)
1689 struct isl_basic_set *domain;
1693 n_out = bmap->n_out;
1694 domain = isl_basic_set_from_basic_map(ctx, bmap);
1695 return isl_basic_set_project_out(ctx, domain, n_out, 0);
1698 struct isl_basic_set *isl_basic_map_range(struct isl_ctx *ctx,
1699 struct isl_basic_map *bmap)
1701 return isl_basic_map_domain(ctx,
1702 isl_basic_map_reverse(ctx, bmap));
1705 struct isl_set *isl_map_range(struct isl_ctx *ctx, struct isl_map *map)
1708 struct isl_set *set;
1712 map = isl_map_cow(ctx, map);
1716 set = (struct isl_set *) map;
1718 for (i = 0; i < map->n; ++i) {
1719 set->p[i] = isl_basic_map_range(ctx, map->p[i]);
1723 F_CLR(set, ISL_MAP_DISJOINT);
1726 isl_map_free(ctx, map);
1730 struct isl_map *isl_map_from_set(
1731 struct isl_ctx *ctx, struct isl_set *set,
1732 unsigned n_in, unsigned n_out)
1735 struct isl_map *map = NULL;
1739 isl_assert(ctx, set->dim == n_in + n_out, goto error);
1740 set = isl_set_cow(ctx, set);
1743 map = (struct isl_map *)set;
1744 for (i = 0; i < set->n; ++i) {
1745 map->p[i] = isl_basic_map_from_basic_set(ctx,
1746 set->p[i], n_in, n_out);
1754 isl_set_free(ctx, set);
1758 struct isl_map *isl_map_alloc(struct isl_ctx *ctx,
1759 unsigned nparam, unsigned in, unsigned out, int n,
1762 struct isl_map *map;
1764 map = isl_alloc(ctx, struct isl_map,
1765 sizeof(struct isl_map) +
1766 n * sizeof(struct isl_basic_map *));
1773 map->nparam = nparam;
1780 struct isl_basic_map *isl_basic_map_empty(struct isl_ctx *ctx,
1781 unsigned nparam, unsigned in, unsigned out)
1783 struct isl_basic_map *bmap;
1784 bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, 1, 0);
1785 bmap = isl_basic_map_set_to_empty(ctx, bmap);
1789 struct isl_map *isl_map_empty(struct isl_ctx *ctx,
1790 unsigned nparam, unsigned in, unsigned out)
1792 return isl_map_alloc(ctx, nparam, in, out, 0, ISL_MAP_DISJOINT);
1795 struct isl_set *isl_set_empty(struct isl_ctx *ctx,
1796 unsigned nparam, unsigned dim)
1798 return isl_set_alloc(ctx, nparam, dim, 0, ISL_MAP_DISJOINT);
1801 struct isl_map *isl_map_dup(struct isl_ctx *ctx, struct isl_map *map)
1804 struct isl_map *dup;
1806 dup = isl_map_alloc(ctx, map->nparam, map->n_in, map->n_out, map->n,
1808 for (i = 0; i < map->n; ++i)
1809 dup = isl_map_add(ctx, dup,
1810 isl_basic_map_dup(ctx, map->p[i]));
1814 struct isl_map *isl_map_add(struct isl_ctx *ctx, struct isl_map *map,
1815 struct isl_basic_map *bmap)
1819 isl_assert(ctx, map->nparam == bmap->nparam, goto error);
1820 isl_assert(ctx, map->n_in == bmap->n_in, goto error);
1821 isl_assert(ctx, map->n_out == bmap->n_out, goto error);
1822 isl_assert(ctx, map->n < map->size, goto error);
1823 map->p[map->n] = bmap;
1828 isl_map_free(ctx, map);
1830 isl_basic_map_free(ctx, bmap);
1834 void isl_map_free(struct isl_ctx *ctx, struct isl_map *map)
1844 for (i = 0; i < map->n; ++i)
1845 isl_basic_map_free(ctx, map->p[i]);
1849 struct isl_map *isl_map_extend(struct isl_ctx *ctx, struct isl_map *base,
1850 unsigned nparam, unsigned n_in, unsigned n_out)
1854 base = isl_map_cow(ctx, base);
1858 isl_assert(ctx, base->nparam <= nparam, goto error);
1859 isl_assert(ctx, base->n_in <= n_in, goto error);
1860 isl_assert(ctx, base->n_out <= n_out, goto error);
1861 base->nparam = nparam;
1863 base->n_out = n_out;
1864 for (i = 0; i < base->n; ++i) {
1865 base->p[i] = isl_basic_map_extend(ctx, base->p[i],
1866 nparam, n_in, n_out, 0, 0, 0);
1872 isl_map_free(ctx, base);
1876 struct isl_basic_map *isl_basic_map_fix_input_si(struct isl_ctx *ctx,
1877 struct isl_basic_map *bmap,
1878 unsigned input, int value)
1882 bmap = isl_basic_map_cow(ctx, bmap);
1885 isl_assert(ctx, input < bmap->n_in, goto error);
1887 bmap = isl_basic_map_extend(ctx, bmap,
1888 bmap->nparam, bmap->n_in, bmap->n_out, 0, 1, 0);
1889 j = isl_basic_map_alloc_equality(ctx, bmap);
1892 isl_int_set_si(bmap->eq[j][1+bmap->nparam+input], -1);
1893 isl_int_set_si(bmap->eq[j][0], value);
1894 bmap = isl_basic_map_simplify(ctx, bmap);
1895 return isl_basic_map_finalize(ctx, bmap);
1897 isl_basic_map_free(ctx, bmap);
1901 struct isl_map *isl_map_fix_input_si(struct isl_ctx *ctx, struct isl_map *map,
1902 unsigned input, int value)
1906 map = isl_map_cow(ctx, map);
1910 isl_assert(ctx, input < map->n_in, goto error);
1911 for (i = 0; i < map->n; ++i) {
1912 map->p[i] = isl_basic_map_fix_input_si(ctx, map->p[i],
1919 isl_map_free(ctx, map);
1923 struct isl_map *isl_map_reverse(struct isl_ctx *ctx, struct isl_map *map)
1928 map = isl_map_cow(ctx, map);
1933 map->n_in = map->n_out;
1935 for (i = 0; i < map->n; ++i) {
1936 map->p[i] = isl_basic_map_reverse(ctx, map->p[i]);
1942 isl_map_free(ctx, map);
1946 struct isl_map *isl_basic_map_lexmax(struct isl_ctx *ctx,
1947 struct isl_basic_map *bmap, struct isl_basic_set *dom,
1948 struct isl_set **empty)
1950 return isl_pip_basic_map_lexmax(ctx, bmap, dom, empty);
1953 struct isl_map *isl_basic_map_lexmin(struct isl_ctx *ctx,
1954 struct isl_basic_map *bmap, struct isl_basic_set *dom,
1955 struct isl_set **empty)
1957 return isl_pip_basic_map_lexmin(ctx, bmap, dom, empty);
1960 struct isl_set *isl_basic_set_lexmin(struct isl_ctx *ctx,
1961 struct isl_basic_set *bset)
1963 struct isl_basic_map *bmap = NULL;
1964 struct isl_basic_set *dom = NULL;
1965 struct isl_map *min;
1969 bmap = isl_basic_map_from_basic_set(ctx, bset, 0, bset->dim);
1972 dom = isl_basic_set_alloc(ctx, bmap->nparam, 0, 0, 0, 0);
1975 min = isl_basic_map_lexmin(ctx, bmap, dom, NULL);
1976 return isl_map_range(ctx, min);
1978 isl_basic_map_free(ctx, bmap);
1982 struct isl_map *isl_basic_map_compute_divs(struct isl_ctx *ctx,
1983 struct isl_basic_map *bmap)
1985 if (bmap->n_div == 0)
1986 return isl_map_from_basic_map(ctx, bmap);
1987 return isl_pip_basic_map_compute_divs(ctx, bmap);
1990 struct isl_map *isl_map_compute_divs(struct isl_ctx *ctx, struct isl_map *map)
1993 struct isl_map *res;
1999 res = isl_basic_map_compute_divs(ctx,
2000 isl_basic_map_copy(ctx, map->p[0]));
2001 for (i = 1 ; i < map->n; ++i) {
2003 r2 = isl_basic_map_compute_divs(ctx,
2004 isl_basic_map_copy(ctx, map->p[i]));
2005 if (F_ISSET(map, ISL_MAP_DISJOINT))
2006 res = isl_map_union_disjoint(ctx, res, r2);
2008 res = isl_map_union(ctx, res, r2);
2010 isl_map_free(ctx, map);
2015 struct isl_set *isl_basic_set_compute_divs(struct isl_ctx *ctx,
2016 struct isl_basic_set *bset)
2018 return (struct isl_set *)
2019 isl_basic_map_compute_divs(ctx,
2020 (struct isl_basic_map *)bset);
2023 struct isl_set *isl_map_domain(struct isl_ctx *ctx, struct isl_map *map)
2026 struct isl_set *set;
2031 map = isl_map_cow(ctx, map);
2035 set = (struct isl_set *)map;
2036 set->dim = map->n_in;
2038 for (i = 0; i < map->n; ++i) {
2039 set->p[i] = isl_basic_map_domain(ctx, map->p[i]);
2043 F_CLR(set, ISL_MAP_DISJOINT);
2046 isl_map_free(ctx, map);
2050 struct isl_map *isl_map_union_disjoint(struct isl_ctx *ctx,
2051 struct isl_map *map1, struct isl_map *map2)
2055 struct isl_map *map = NULL;
2061 isl_map_free(ctx, map1);
2065 isl_map_free(ctx, map2);
2069 isl_assert(ctx, map1->nparam == map2->nparam, goto error);
2070 isl_assert(ctx, map1->n_in == map2->n_in, goto error);
2071 isl_assert(ctx, map1->n_out == map2->n_out, goto error);
2073 if (F_ISSET(map1, ISL_MAP_DISJOINT) &&
2074 F_ISSET(map2, ISL_MAP_DISJOINT))
2075 FL_SET(flags, ISL_MAP_DISJOINT);
2077 map = isl_map_alloc(ctx, map1->nparam, map1->n_in, map1->n_out,
2078 map1->n + map2->n, flags);
2081 for (i = 0; i < map1->n; ++i) {
2082 map = isl_map_add(ctx, map,
2083 isl_basic_map_copy(ctx, map1->p[i]));
2087 for (i = 0; i < map2->n; ++i) {
2088 map = isl_map_add(ctx, map,
2089 isl_basic_map_copy(ctx, map2->p[i]));
2093 isl_map_free(ctx, map1);
2094 isl_map_free(ctx, map2);
2097 isl_map_free(ctx, map);
2098 isl_map_free(ctx, map1);
2099 isl_map_free(ctx, map2);
2103 struct isl_map *isl_map_union(struct isl_ctx *ctx,
2104 struct isl_map *map1, struct isl_map *map2)
2106 map1 = isl_map_union_disjoint(ctx, map1, map2);
2110 F_CLR(map1, ISL_MAP_DISJOINT);
2114 struct isl_set *isl_set_union_disjoint(struct isl_ctx *ctx,
2115 struct isl_set *set1, struct isl_set *set2)
2117 return (struct isl_set *)
2118 isl_map_union_disjoint(ctx,
2119 (struct isl_map *)set1, (struct isl_map *)set2);
2122 struct isl_set *isl_set_union(struct isl_ctx *ctx,
2123 struct isl_set *set1, struct isl_set *set2)
2125 return (struct isl_set *)
2127 (struct isl_map *)set1, (struct isl_map *)set2);
2130 struct isl_map *isl_map_intersect_range(
2131 struct isl_ctx *ctx, struct isl_map *map,
2132 struct isl_set *set)
2135 struct isl_map *result;
2141 if (F_ISSET(map, ISL_MAP_DISJOINT) &&
2142 F_ISSET(set, ISL_MAP_DISJOINT))
2143 FL_SET(flags, ISL_MAP_DISJOINT);
2145 result = isl_map_alloc(ctx, map->nparam, map->n_in, map->n_out,
2146 map->n * set->n, flags);
2149 for (i = 0; i < map->n; ++i)
2150 for (j = 0; j < set->n; ++j) {
2151 result = isl_map_add(ctx, result,
2152 isl_basic_map_intersect_range(ctx,
2153 isl_basic_map_copy(ctx, map->p[i]),
2154 isl_basic_set_copy(ctx, set->p[j])));
2158 isl_map_free(ctx, map);
2159 isl_set_free(ctx, set);
2162 isl_map_free(ctx, map);
2163 isl_set_free(ctx, set);
2167 struct isl_map *isl_map_intersect_domain(
2168 struct isl_ctx *ctx, struct isl_map *map,
2169 struct isl_set *set)
2171 return isl_map_reverse(ctx,
2172 isl_map_intersect_range(ctx, isl_map_reverse(ctx, map), set));
2175 struct isl_map *isl_map_apply_domain(
2176 struct isl_ctx *ctx, struct isl_map *map1,
2177 struct isl_map *map2)
2181 map1 = isl_map_reverse(ctx, map1);
2182 map1 = isl_map_apply_range(ctx, map1, map2);
2183 return isl_map_reverse(ctx, map1);
2185 isl_map_free(ctx, map1);
2186 isl_map_free(ctx, map2);
2190 struct isl_map *isl_map_apply_range(
2191 struct isl_ctx *ctx, struct isl_map *map1,
2192 struct isl_map *map2)
2194 struct isl_map *result;
2200 isl_assert(ctx, map1->nparam == map2->nparam, goto error);
2201 isl_assert(ctx, map1->n_out == map2->n_in, goto error);
2203 result = isl_map_alloc(ctx, map1->nparam, map1->n_in, map2->n_out,
2204 map1->n * map2->n, 0);
2207 for (i = 0; i < map1->n; ++i)
2208 for (j = 0; j < map2->n; ++j) {
2209 result = isl_map_add(ctx, result,
2210 isl_basic_map_apply_range(ctx,
2211 isl_basic_map_copy(ctx, map1->p[i]),
2212 isl_basic_map_copy(ctx, map2->p[j])));
2216 isl_map_free(ctx, map1);
2217 isl_map_free(ctx, map2);
2220 isl_map_free(ctx, map1);
2221 isl_map_free(ctx, map2);
2226 * returns range - domain
2228 struct isl_basic_set *isl_basic_map_deltas(struct isl_ctx *ctx,
2229 struct isl_basic_map *bmap)
2231 struct isl_basic_set *bset;
2237 isl_assert(ctx, bmap->n_in == bmap->n_out, goto error);
2239 bset = isl_basic_set_from_basic_map(ctx, bmap);
2240 bset = isl_basic_set_extend(ctx, bset, bset->nparam, 3*dim, 0,
2242 bset = isl_basic_set_swap_vars(ctx, bset, 2*dim);
2243 for (i = 0; i < dim; ++i) {
2244 int j = isl_basic_map_alloc_equality(ctx,
2245 (struct isl_basic_map *)bset);
2248 isl_int_set_si(bset->eq[j][1+bset->nparam+i], 1);
2249 isl_int_set_si(bset->eq[j][1+bset->nparam+dim+i], 1);
2250 isl_int_set_si(bset->eq[j][1+bset->nparam+2*dim+i], -1);
2252 return isl_basic_set_project_out(ctx, bset, 2*dim, 0);
2254 isl_basic_map_free(ctx, bmap);
2258 /* If the only constraints a div d=floor(f/m)
2259 * appears in are its two defining constraints
2262 * -(f - (m - 1)) + m d >= 0
2264 * then it can safely be removed.
2266 static int div_is_redundant(struct isl_ctx *ctx, struct isl_basic_map *bmap,
2270 unsigned pos = 1 + bmap->nparam + bmap->n_in + bmap->n_out + div;
2272 for (i = 0; i < bmap->n_eq; ++i)
2273 if (!isl_int_is_zero(bmap->eq[i][pos]))
2276 for (i = 0; i < bmap->n_ineq; ++i) {
2277 if (isl_int_is_zero(bmap->ineq[i][pos]))
2279 if (isl_int_eq(bmap->ineq[i][pos], bmap->div[div][0])) {
2281 isl_int_sub(bmap->div[div][1],
2282 bmap->div[div][1], bmap->div[div][0]);
2283 isl_int_add_ui(bmap->div[div][1], bmap->div[div][1], 1);
2284 neg = isl_seq_is_neg(bmap->ineq[i], bmap->div[div]+1, pos);
2285 isl_int_sub_ui(bmap->div[div][1], bmap->div[div][1], 1);
2286 isl_int_add(bmap->div[div][1],
2287 bmap->div[div][1], bmap->div[div][0]);
2290 if (isl_seq_first_non_zero(bmap->ineq[i]+pos+1,
2291 bmap->n_div-div-1) != -1)
2293 } else if (isl_int_abs_eq(bmap->ineq[i][pos], bmap->div[div][0])) {
2294 if (!isl_seq_eq(bmap->ineq[i], bmap->div[div]+1, pos))
2296 if (isl_seq_first_non_zero(bmap->ineq[i]+pos+1,
2297 bmap->n_div-div-1) != -1)
2303 for (i = 0; i < bmap->n_div; ++i)
2304 if (!isl_int_is_zero(bmap->div[i][1+pos]))
2311 * Remove divs that don't occur in any of the constraints or other divs.
2312 * These can arise when dropping some of the variables in a quast
2313 * returned by piplib.
2315 static struct isl_basic_map *remove_redundant_divs(struct isl_ctx *ctx,
2316 struct isl_basic_map *bmap)
2320 for (i = bmap->n_div-1; i >= 0; --i) {
2321 if (!div_is_redundant(ctx, bmap, i))
2323 bmap = isl_basic_map_drop_div(ctx, bmap, i);
2328 struct isl_basic_map *isl_basic_map_finalize(struct isl_ctx *ctx,
2329 struct isl_basic_map *bmap)
2331 bmap = remove_redundant_divs(ctx, bmap);
2334 F_SET(bmap, ISL_BASIC_SET_FINAL);
2338 struct isl_basic_set *isl_basic_set_finalize(struct isl_ctx *ctx,
2339 struct isl_basic_set *bset)
2341 return (struct isl_basic_set *)
2342 isl_basic_map_finalize(ctx,
2343 (struct isl_basic_map *)bset);
2346 struct isl_set *isl_set_finalize(struct isl_ctx *ctx, struct isl_set *set)
2352 for (i = 0; i < set->n; ++i) {
2353 set->p[i] = isl_basic_set_finalize(ctx, set->p[i]);
2359 isl_set_free(ctx, set);
2363 struct isl_map *isl_map_finalize(struct isl_ctx *ctx, struct isl_map *map)
2369 for (i = 0; i < map->n; ++i) {
2370 map->p[i] = isl_basic_map_finalize(ctx, map->p[i]);
2376 isl_map_free(ctx, map);
2380 struct isl_basic_map *isl_basic_map_identity(struct isl_ctx *ctx,
2381 unsigned nparam, unsigned dim)
2383 struct isl_basic_map *bmap;
2386 bmap = isl_basic_map_alloc(ctx, nparam, dim, dim, 0, dim, 0);
2390 for (i = 0; i < dim; ++i) {
2391 int j = isl_basic_map_alloc_equality(ctx, bmap);
2394 isl_int_set_si(bmap->eq[j][1+nparam+i], 1);
2395 isl_int_set_si(bmap->eq[j][1+nparam+dim+i], -1);
2397 return isl_basic_map_finalize(ctx, bmap);
2399 isl_basic_map_free(ctx, bmap);
2403 struct isl_map *isl_map_identity(struct isl_ctx *ctx,
2404 unsigned nparam, unsigned dim)
2406 struct isl_map *map = isl_map_alloc(ctx, nparam, dim, dim, 1,
2410 map = isl_map_add(ctx, map,
2411 isl_basic_map_identity(ctx, nparam, dim));
2414 isl_map_free(ctx, map);
2418 int isl_set_is_equal(struct isl_ctx *ctx,
2419 struct isl_set *set1, struct isl_set *set2)
2421 return isl_map_is_equal(ctx,
2422 (struct isl_map *)set1, (struct isl_map *)set2);
2425 int isl_set_is_subset(struct isl_ctx *ctx,
2426 struct isl_set *set1, struct isl_set *set2)
2428 return isl_map_is_subset(ctx,
2429 (struct isl_map *)set1, (struct isl_map *)set2);
2432 int isl_basic_map_is_subset(struct isl_ctx *ctx,
2433 struct isl_basic_map *bmap1,
2434 struct isl_basic_map *bmap2)
2437 struct isl_map *map1;
2438 struct isl_map *map2;
2440 if (!bmap1 || !bmap2)
2443 map1 = isl_map_from_basic_map(ctx,
2444 isl_basic_map_copy(ctx, bmap1));
2445 map2 = isl_map_from_basic_map(ctx,
2446 isl_basic_map_copy(ctx, bmap2));
2448 is_subset = isl_map_is_subset(ctx, map1, map2);
2450 isl_map_free(ctx, map1);
2451 isl_map_free(ctx, map2);
2456 int isl_map_is_empty(struct isl_ctx *ctx, struct isl_map *map)
2463 for (i = 0; i < map->n; ++i) {
2464 is_empty = isl_basic_map_is_empty(ctx, map->p[i]);
2473 int isl_set_is_empty(struct isl_ctx *ctx, struct isl_set *set)
2475 return isl_map_is_empty(ctx, (struct isl_map *)set);
2478 int isl_map_is_subset(struct isl_ctx *ctx, struct isl_map *map1,
2479 struct isl_map *map2)
2483 struct isl_map *diff;
2488 if (isl_map_is_empty(ctx, map1))
2491 if (isl_map_is_empty(ctx, map2))
2494 diff = isl_map_subtract(ctx, isl_map_copy(ctx, map1),
2495 isl_map_copy(ctx, map2));
2499 is_subset = isl_map_is_empty(ctx, diff);
2500 isl_map_free(ctx, diff);
2505 int isl_map_is_equal(struct isl_ctx *ctx,
2506 struct isl_map *map1, struct isl_map *map2)
2512 is_subset = isl_map_is_subset(ctx, map1, map2);
2515 is_subset = isl_map_is_subset(ctx, map2, map1);
2519 int isl_basic_map_is_strict_subset(struct isl_ctx *ctx,
2520 struct isl_basic_map *bmap1,
2521 struct isl_basic_map *bmap2)
2525 if (!bmap1 || !bmap2)
2527 is_subset = isl_basic_map_is_subset(ctx, bmap1, bmap2);
2530 is_subset = isl_basic_map_is_subset(ctx, bmap2, bmap1);
2531 if (is_subset == -1)
2536 int isl_basic_map_is_empty(struct isl_ctx *ctx,
2537 struct isl_basic_map *bmap)
2539 struct isl_basic_set *bset = NULL;
2540 struct isl_vec *sample = NULL;
2546 if (F_ISSET(bmap, ISL_BASIC_MAP_EMPTY))
2549 bset = isl_basic_map_underlying_set(ctx,
2550 isl_basic_map_copy(ctx, bmap));
2553 sample = isl_basic_set_sample(ctx, bset);
2556 empty = sample->size == 0;
2557 isl_vec_free(ctx, sample);
2562 struct isl_map *isl_basic_map_union(
2563 struct isl_ctx *ctx, struct isl_basic_map *bmap1,
2564 struct isl_basic_map *bmap2)
2566 struct isl_map *map;
2567 if (!bmap1 || !bmap2)
2570 isl_assert(ctx, bmap1->nparam == bmap2->nparam, goto error);
2571 isl_assert(ctx, bmap1->n_in == bmap2->n_in, goto error);
2572 isl_assert(ctx, bmap1->n_out == bmap2->n_out, goto error);
2574 map = isl_map_alloc(ctx, bmap1->nparam,
2575 bmap1->n_in, bmap1->n_out, 2, 0);
2578 map = isl_map_add(ctx, map, bmap1);
2579 map = isl_map_add(ctx, map, bmap2);
2582 isl_basic_map_free(ctx, bmap1);
2583 isl_basic_map_free(ctx, bmap2);
2587 struct isl_set *isl_basic_set_union(
2588 struct isl_ctx *ctx, struct isl_basic_set *bset1,
2589 struct isl_basic_set *bset2)
2591 return (struct isl_set *)isl_basic_map_union(ctx,
2592 (struct isl_basic_map *)bset1,
2593 (struct isl_basic_map *)bset2);
2596 /* Order divs such that any div only depends on previous divs */
2597 static struct isl_basic_map *order_divs(struct isl_ctx *ctx,
2598 struct isl_basic_map *bmap)
2601 unsigned off = bmap->nparam + bmap->n_in + bmap->n_out;
2603 for (i = 0; i < bmap->n_div; ++i) {
2605 pos = isl_seq_first_non_zero(bmap->div[i]+1+1+off+i,
2609 swap_div(bmap, i, pos);
2615 static int find_div(struct isl_basic_map *dst,
2616 struct isl_basic_map *src, unsigned div)
2620 unsigned total = src->nparam + src->n_in + src->n_out + src->n_div;
2622 for (i = 0; i < dst->n_div; ++i)
2623 if (isl_seq_eq(dst->div[i], src->div[div], 1+1+total) &&
2624 isl_seq_first_non_zero(dst->div[i]+1+1+total,
2625 dst->n_div - src->n_div) == -1)
2630 /* For a div d = floor(f/m), add the constraints
2633 * -(f-(n-1)) + m d >= 0
2635 * Note that the second constraint is the negation of
2639 static int add_div_constraints(struct isl_ctx *ctx,
2640 struct isl_basic_map *bmap, unsigned div)
2643 unsigned div_pos = 1 + bmap->nparam + bmap->n_in + bmap->n_out + div;
2644 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
2646 i = isl_basic_map_alloc_inequality(ctx, bmap);
2649 isl_seq_cpy(bmap->ineq[i], bmap->div[div]+1, 1+total);
2650 isl_int_neg(bmap->ineq[i][div_pos], bmap->div[div][0]);
2652 j = isl_basic_map_alloc_inequality(ctx, bmap);
2655 isl_seq_neg(bmap->ineq[j], bmap->ineq[i], 1 + total);
2656 isl_int_add(bmap->ineq[j][0], bmap->ineq[j][0], bmap->ineq[j][div_pos]);
2657 isl_int_sub_ui(bmap->ineq[j][0], bmap->ineq[j][0], 1);
2661 struct isl_basic_map *isl_basic_map_align_divs(struct isl_ctx *ctx,
2662 struct isl_basic_map *dst, struct isl_basic_map *src)
2665 unsigned total = src->nparam + src->n_in + src->n_out + src->n_div;
2667 if (src->n_div == 0)
2670 src = order_divs(ctx, src);
2671 dst = isl_basic_map_extend(ctx, dst, dst->nparam, dst->n_in,
2672 dst->n_out, src->n_div, 0, 2 * src->n_div);
2675 for (i = 0; i < src->n_div; ++i) {
2676 int j = find_div(dst, src, i);
2678 j = isl_basic_map_alloc_div(ctx, dst);
2681 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total);
2682 if (add_div_constraints(ctx, dst, j) < 0)
2686 swap_div(dst, i, j);
2690 isl_basic_map_free(ctx, dst);
2694 static struct isl_map *add_cut_constraint(struct isl_ctx *ctx,
2695 struct isl_map *dst,
2696 struct isl_basic_map *src, isl_int *c,
2697 unsigned len, unsigned extra, int oppose)
2699 struct isl_basic_map *copy = NULL;
2703 copy = isl_basic_map_copy(ctx, src);
2704 copy = isl_basic_map_cow(ctx, copy);
2707 copy = isl_basic_map_extend(ctx, copy,
2708 copy->nparam, copy->n_in, copy->n_out, 0, 0, 1);
2709 k = isl_basic_map_alloc_inequality(ctx, copy);
2713 isl_seq_neg(copy->ineq[k], c, len);
2715 isl_seq_cpy(copy->ineq[k], c, len);
2716 isl_seq_clr(copy->ineq[k]+len, extra);
2717 isl_inequality_negate(ctx, copy, k);
2718 copy = isl_basic_map_simplify(ctx, copy);
2719 copy = isl_basic_map_finalize(ctx, copy);
2720 is_empty = isl_basic_map_is_empty(ctx, copy);
2724 dst = isl_map_add(ctx, dst, copy);
2726 isl_basic_map_free(ctx, copy);
2729 isl_basic_map_free(ctx, copy);
2730 isl_map_free(ctx, dst);
2734 static struct isl_map *subtract(struct isl_ctx *ctx, struct isl_map *map,
2735 struct isl_basic_map *bmap)
2739 struct isl_map *rest = NULL;
2741 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
2748 if (F_ISSET(map, ISL_MAP_DISJOINT))
2749 FL_SET(flags, ISL_MAP_DISJOINT);
2751 max = map->n * (2 * bmap->n_eq + bmap->n_ineq);
2752 rest = isl_map_alloc(ctx, map->nparam, map->n_in, map->n_out,
2757 for (i = 0; i < map->n; ++i) {
2758 map->p[i] = isl_basic_map_align_divs(ctx, map->p[i], bmap);
2763 for (j = 0; j < map->n; ++j)
2764 map->p[j] = isl_basic_map_cow(ctx, map->p[j]);
2766 for (i = 0; i < bmap->n_eq; ++i) {
2767 for (j = 0; j < map->n; ++j) {
2768 rest = add_cut_constraint(ctx, rest,
2769 map->p[j], bmap->eq[i],
2770 1+total, map->p[j]->n_div - bmap->n_div, 0);
2774 rest = add_cut_constraint(ctx, rest,
2775 map->p[j], bmap->eq[i],
2776 1+total, map->p[j]->n_div - bmap->n_div, 1);
2780 map->p[j] = isl_basic_map_extend(ctx, map->p[j],
2781 map->p[j]->nparam, map->p[j]->n_in,
2782 map->p[j]->n_out, 0, 1, 0);
2785 k = isl_basic_map_alloc_equality(ctx, map->p[j]);
2788 isl_seq_cpy(map->p[j]->eq[k], bmap->eq[i], 1+total);
2789 isl_seq_clr(map->p[j]->eq[k]+1+total,
2790 map->p[j]->n_div - bmap->n_div);
2794 for (i = 0; i < bmap->n_ineq; ++i) {
2795 for (j = 0; j < map->n; ++j) {
2796 rest = add_cut_constraint(ctx, rest,
2797 map->p[j], bmap->ineq[i],
2798 1+total, map->p[j]->n_div - bmap->n_div, 0);
2802 map->p[j] = isl_basic_map_extend(ctx, map->p[j],
2803 map->p[j]->nparam, map->p[j]->n_in,
2804 map->p[j]->n_out, 0, 0, 1);
2807 k = isl_basic_map_alloc_inequality(ctx, map->p[j]);
2810 isl_seq_cpy(map->p[j]->ineq[k], bmap->ineq[i], 1+total);
2811 isl_seq_clr(map->p[j]->ineq[k]+1+total,
2812 map->p[j]->n_div - bmap->n_div);
2816 isl_map_free(ctx, map);
2819 isl_map_free(ctx, map);
2820 isl_map_free(ctx, rest);
2824 struct isl_map *isl_map_subtract(struct isl_ctx *ctx, struct isl_map *map1,
2825 struct isl_map *map2)
2831 isl_assert(ctx, map1->nparam == map2->nparam, goto error);
2832 isl_assert(ctx, map1->n_in == map2->n_in, goto error);
2833 isl_assert(ctx, map1->n_out == map2->n_out, goto error);
2835 if (isl_map_is_empty(ctx, map2)) {
2836 isl_map_free(ctx, map2);
2840 map1 = isl_map_compute_divs(ctx, map1);
2841 map2 = isl_map_compute_divs(ctx, map2);
2845 for (i = 0; map1 && i < map2->n; ++i)
2846 map1 = subtract(ctx, map1, map2->p[i]);
2848 isl_map_free(ctx, map2);
2851 isl_map_free(ctx, map1);
2852 isl_map_free(ctx, map2);
2856 struct isl_set *isl_set_subtract(struct isl_ctx *ctx, struct isl_set *set1,
2857 struct isl_set *set2)
2859 return (struct isl_set *)
2860 isl_map_subtract(ctx,
2861 (struct isl_map *)set1, (struct isl_map *)set2);
2864 struct isl_set *isl_set_apply(struct isl_ctx *ctx, struct isl_set *set,
2865 struct isl_map *map)
2867 isl_assert(ctx, set->dim == map->n_in, goto error);
2868 map = isl_map_intersect_domain(ctx, map, set);
2869 set = isl_map_range(ctx, map);
2872 isl_set_free(ctx, set);
2873 isl_map_free(ctx, map);