5 #include "isl_equalities.h"
10 #include "isl_map_private.h"
11 #include "isl_map_piplib.h"
12 #include "isl_sample.h"
15 static struct isl_basic_map *basic_map_init(struct isl_ctx *ctx,
16 struct isl_basic_map *bmap,
17 unsigned nparam, unsigned n_in, unsigned n_out, unsigned extra,
18 unsigned n_eq, unsigned n_ineq)
21 size_t row_size = 1 + nparam + n_in + n_out + extra;
23 bmap->block = isl_blk_alloc(ctx, (n_eq + n_ineq) * row_size);
24 if (isl_blk_is_error(bmap->block)) {
29 bmap->eq = isl_alloc_array(ctx, isl_int *, n_eq + n_ineq);
31 isl_blk_free(ctx, bmap->block);
37 bmap->block2 = isl_blk_empty();
40 bmap->block2 = isl_blk_alloc(ctx, extra * (1 + row_size));
41 if (isl_blk_is_error(bmap->block2)) {
43 isl_blk_free(ctx, bmap->block);
48 bmap->div = isl_alloc_array(ctx, isl_int *, extra);
50 isl_blk_free(ctx, bmap->block2);
52 isl_blk_free(ctx, bmap->block);
58 for (i = 0; i < n_eq + n_ineq; ++i)
59 bmap->eq[i] = bmap->block.data + i * row_size;
61 for (i = 0; i < extra; ++i)
62 bmap->div[i] = bmap->block2.data + i * (1 + row_size);
68 bmap->c_size = n_eq + n_ineq;
69 bmap->ineq = bmap->eq + n_eq;
70 bmap->nparam = nparam;
82 struct isl_basic_set *isl_basic_set_alloc(struct isl_ctx *ctx,
83 unsigned nparam, unsigned dim, unsigned extra,
84 unsigned n_eq, unsigned n_ineq)
86 struct isl_basic_map *bmap;
87 bmap = isl_basic_map_alloc(ctx, nparam, 0, dim, extra, n_eq, n_ineq);
88 return (struct isl_basic_set *)bmap;
91 struct isl_basic_map *isl_basic_map_alloc(struct isl_ctx *ctx,
92 unsigned nparam, unsigned in, unsigned out, unsigned extra,
93 unsigned n_eq, unsigned n_ineq)
95 struct isl_basic_map *bmap;
97 bmap = isl_alloc_type(ctx, struct isl_basic_map);
101 return basic_map_init(ctx, bmap,
102 nparam, in, out, extra, n_eq, n_ineq);
105 static void dup_constraints(
106 struct isl_basic_map *dst, struct isl_basic_map *src)
109 unsigned total = src->nparam + src->n_in + src->n_out + src->n_div;
111 for (i = 0; i < src->n_eq; ++i) {
112 int j = isl_basic_map_alloc_equality(dst);
113 isl_seq_cpy(dst->eq[j], src->eq[i], 1+total);
116 for (i = 0; i < src->n_ineq; ++i) {
117 int j = isl_basic_map_alloc_inequality(dst);
118 isl_seq_cpy(dst->ineq[j], src->ineq[i], 1+total);
121 for (i = 0; i < src->n_div; ++i) {
122 int j = isl_basic_map_alloc_div(dst);
123 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total);
125 F_SET(dst, ISL_BASIC_SET_FINAL);
128 struct isl_basic_map *isl_basic_map_dup(struct isl_basic_map *bmap)
130 struct isl_basic_map *dup;
134 dup = isl_basic_map_alloc(bmap->ctx, bmap->nparam,
135 bmap->n_in, bmap->n_out,
136 bmap->n_div, bmap->n_eq, bmap->n_ineq);
139 dup->flags = bmap->flags;
140 dup_constraints(dup, bmap);
141 dup->sample = isl_vec_copy(bmap->ctx, bmap->sample);
145 struct isl_basic_set *isl_basic_set_dup(struct isl_basic_set *bset)
147 struct isl_basic_map *dup;
149 dup = isl_basic_map_dup((struct isl_basic_map *)bset);
150 return (struct isl_basic_set *)dup;
153 struct isl_basic_set *isl_basic_set_copy(struct isl_basic_set *bset)
158 if (F_ISSET(bset, ISL_BASIC_SET_FINAL)) {
162 return isl_basic_set_dup(bset);
165 struct isl_set *isl_set_copy(struct isl_set *set)
174 struct isl_basic_map *isl_basic_map_copy(struct isl_basic_map *bmap)
179 if (F_ISSET(bmap, ISL_BASIC_SET_FINAL)) {
183 return isl_basic_map_dup(bmap);
186 struct isl_map *isl_map_copy(struct isl_map *map)
195 void isl_basic_map_free(struct isl_basic_map *bmap)
203 isl_ctx_deref(bmap->ctx);
205 isl_blk_free(bmap->ctx, bmap->block2);
207 isl_blk_free(bmap->ctx, bmap->block);
208 isl_vec_free(bmap->ctx, bmap->sample);
212 void isl_basic_set_free(struct isl_basic_set *bset)
214 isl_basic_map_free((struct isl_basic_map *)bset);
217 int isl_basic_map_alloc_equality(struct isl_basic_map *bmap)
223 isl_assert(ctx, bmap->n_eq + bmap->n_ineq < bmap->c_size, return -1);
224 isl_assert(ctx, bmap->eq + bmap->n_eq <= bmap->ineq, return -1);
225 if (bmap->eq + bmap->n_eq == bmap->ineq) {
227 int j = isl_basic_map_alloc_inequality(bmap);
231 bmap->ineq[0] = bmap->ineq[j];
239 int isl_basic_set_alloc_equality(struct isl_basic_set *bset)
241 return isl_basic_map_alloc_equality((struct isl_basic_map *)bset);
244 int isl_basic_map_free_equality(struct isl_basic_map *bmap, unsigned n)
248 isl_assert(bmap->ctx, n <= bmap->n_eq, return -1);
253 int isl_basic_map_drop_equality(struct isl_basic_map *bmap, unsigned pos)
258 isl_assert(bmap->ctx, pos < bmap->n_eq, return -1);
260 if (pos != bmap->n_eq - 1) {
262 bmap->eq[pos] = bmap->eq[bmap->n_eq - 1];
263 bmap->eq[bmap->n_eq - 1] = t;
269 int isl_basic_set_drop_equality(struct isl_basic_set *bset, unsigned pos)
271 return isl_basic_map_drop_equality((struct isl_basic_map *)bset, pos);
274 void isl_basic_map_inequality_to_equality(
275 struct isl_basic_map *bmap, unsigned pos)
280 bmap->ineq[pos] = bmap->ineq[0];
281 bmap->ineq[0] = bmap->eq[bmap->n_eq];
282 bmap->eq[bmap->n_eq] = t;
288 int isl_basic_map_alloc_inequality(struct isl_basic_map *bmap)
294 isl_assert(ctx, (bmap->ineq - bmap->eq) + bmap->n_ineq < bmap->c_size,
296 F_CLR(bmap, ISL_BASIC_MAP_NO_IMPLICIT);
297 F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
298 return bmap->n_ineq++;
301 int isl_basic_set_alloc_inequality(struct isl_basic_set *bset)
303 return isl_basic_map_alloc_inequality((struct isl_basic_map *)bset);
306 int isl_basic_map_free_inequality(struct isl_basic_map *bmap, unsigned n)
310 isl_assert(bmap->ctx, n <= bmap->n_ineq, return -1);
315 int isl_basic_set_free_inequality(struct isl_basic_set *bset, unsigned n)
317 return isl_basic_map_free_inequality((struct isl_basic_map *)bset, n);
320 int isl_basic_map_drop_inequality(struct isl_basic_map *bmap, unsigned pos)
325 isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
327 if (pos != bmap->n_ineq - 1) {
329 bmap->ineq[pos] = bmap->ineq[bmap->n_ineq - 1];
330 bmap->ineq[bmap->n_ineq - 1] = t;
336 int isl_basic_set_drop_inequality(struct isl_basic_set *bset, unsigned pos)
338 return isl_basic_map_drop_inequality((struct isl_basic_map *)bset, pos);
341 int isl_basic_map_alloc_div(struct isl_basic_map *bmap)
345 isl_assert(bmap->ctx, bmap->n_div < bmap->extra, return -1);
346 return bmap->n_div++;
349 int isl_basic_map_free_div(struct isl_basic_map *bmap, unsigned n)
353 isl_assert(bmap->ctx, n <= bmap->n_div, return -1);
358 /* Copy constraint from src to dst, putting the vars of src at offset
359 * dim_off in dst and the divs of src at offset div_off in dst.
360 * If both sets are actually map, then dim_off applies to the input
363 static void copy_constraint(struct isl_basic_map *dst_map, isl_int *dst,
364 struct isl_basic_map *src_map, isl_int *src,
365 unsigned in_off, unsigned out_off, unsigned div_off)
367 isl_int_set(dst[0], src[0]);
368 isl_seq_cpy(dst+1, src+1, isl_min(dst_map->nparam, src_map->nparam));
369 if (dst_map->nparam > src_map->nparam)
370 isl_seq_clr(dst+1+src_map->nparam,
371 dst_map->nparam - src_map->nparam);
372 isl_seq_clr(dst+1+dst_map->nparam, in_off);
373 isl_seq_cpy(dst+1+dst_map->nparam+in_off,
374 src+1+src_map->nparam,
375 isl_min(dst_map->n_in-in_off, src_map->n_in));
376 if (dst_map->n_in-in_off > src_map->n_in)
377 isl_seq_clr(dst+1+dst_map->nparam+in_off+src_map->n_in,
378 dst_map->n_in - in_off - src_map->n_in);
379 isl_seq_clr(dst+1+dst_map->nparam+dst_map->n_in, out_off);
380 isl_seq_cpy(dst+1+dst_map->nparam+dst_map->n_in+out_off,
381 src+1+src_map->nparam+src_map->n_in,
382 isl_min(dst_map->n_out-out_off, src_map->n_out));
383 if (dst_map->n_out-out_off > src_map->n_out)
384 isl_seq_clr(dst+1+dst_map->nparam+dst_map->n_in+out_off+src_map->n_out,
385 dst_map->n_out - out_off - src_map->n_out);
386 isl_seq_clr(dst+1+dst_map->nparam+dst_map->n_in+dst_map->n_out, div_off);
387 isl_seq_cpy(dst+1+dst_map->nparam+dst_map->n_in+dst_map->n_out+div_off,
388 src+1+src_map->nparam+src_map->n_in+src_map->n_out,
389 isl_min(dst_map->extra-div_off, src_map->extra));
390 if (dst_map->extra-div_off > src_map->extra)
391 isl_seq_clr(dst+1+dst_map->nparam+dst_map->n_in+dst_map->n_out+
392 div_off+src_map->extra,
393 dst_map->extra - div_off - src_map->extra);
396 static void copy_div(struct isl_basic_map *dst_map, isl_int *dst,
397 struct isl_basic_map *src_map, isl_int *src,
398 unsigned in_off, unsigned out_off, unsigned div_off)
400 isl_int_set(dst[0], src[0]);
401 copy_constraint(dst_map, dst+1, src_map, src+1, in_off, out_off, div_off);
404 static struct isl_basic_map *add_constraints(struct isl_basic_map *bmap1,
405 struct isl_basic_map *bmap2, unsigned i_pos, unsigned o_pos)
410 if (!bmap1 || !bmap2)
413 div_off = bmap1->n_div;
415 for (i = 0; i < bmap2->n_eq; ++i) {
416 int i1 = isl_basic_map_alloc_equality(bmap1);
419 copy_constraint(bmap1, bmap1->eq[i1], bmap2, bmap2->eq[i],
420 i_pos, o_pos, div_off);
423 for (i = 0; i < bmap2->n_ineq; ++i) {
424 int i1 = isl_basic_map_alloc_inequality(bmap1);
427 copy_constraint(bmap1, bmap1->ineq[i1], bmap2, bmap2->ineq[i],
428 i_pos, o_pos, div_off);
431 for (i = 0; i < bmap2->n_div; ++i) {
432 int i1 = isl_basic_map_alloc_div(bmap1);
435 copy_div(bmap1, bmap1->div[i1], bmap2, bmap2->div[i],
436 i_pos, o_pos, div_off);
439 isl_basic_map_free(bmap2);
444 isl_basic_map_free(bmap1);
445 isl_basic_map_free(bmap2);
449 static struct isl_basic_set *set_add_constraints(struct isl_basic_set *bset1,
450 struct isl_basic_set *bset2, unsigned pos)
452 return (struct isl_basic_set *)
453 add_constraints((struct isl_basic_map *)bset1,
454 (struct isl_basic_map *)bset2, 0, pos);
457 struct isl_basic_map *isl_basic_map_extend(struct isl_basic_map *base,
458 unsigned nparam, unsigned n_in, unsigned n_out, unsigned extra,
459 unsigned n_eq, unsigned n_ineq)
461 struct isl_basic_map *ext;
465 base = isl_basic_map_cow(base);
469 dims_ok = base && base->nparam == nparam &&
470 base->n_in == n_in && base->n_out == n_out &&
471 base->extra >= base->n_div + extra;
473 if (dims_ok && n_eq == 0 && n_ineq == 0)
476 isl_assert(base->ctx, base->nparam <= nparam, goto error);
477 isl_assert(base->ctx, base->n_in <= n_in, goto error);
478 isl_assert(base->ctx, base->n_out <= n_out, goto error);
479 extra += base->extra;
481 n_ineq += base->n_ineq;
483 ext = isl_basic_map_alloc(base->ctx, nparam, n_in, n_out,
484 extra, n_eq, n_ineq);
491 ext = add_constraints(ext, base, 0, 0);
494 F_CLR(ext, ISL_BASIC_SET_FINAL);
500 isl_basic_map_free(base);
504 struct isl_basic_set *isl_basic_set_extend(struct isl_basic_set *base,
505 unsigned nparam, unsigned dim, unsigned extra,
506 unsigned n_eq, unsigned n_ineq)
508 return (struct isl_basic_set *)
509 isl_basic_map_extend((struct isl_basic_map *)base,
510 nparam, 0, dim, extra, n_eq, n_ineq);
513 struct isl_basic_set *isl_basic_set_cow(struct isl_basic_set *bset)
515 return (struct isl_basic_set *)
516 isl_basic_map_cow((struct isl_basic_map *)bset);
519 struct isl_basic_map *isl_basic_map_cow(struct isl_basic_map *bmap)
526 bmap = isl_basic_map_dup(bmap);
528 F_CLR(bmap, ISL_BASIC_SET_FINAL);
532 struct isl_set *isl_set_cow(struct isl_set *set)
540 return isl_set_dup(set);
543 struct isl_map *isl_map_cow(struct isl_map *map)
551 return isl_map_dup(map);
554 static void swap_vars(struct isl_blk blk, isl_int *a,
555 unsigned a_len, unsigned b_len)
557 isl_seq_cpy(blk.data, a+a_len, b_len);
558 isl_seq_cpy(blk.data+b_len, a, a_len);
559 isl_seq_cpy(a, blk.data, b_len+a_len);
562 struct isl_basic_set *isl_basic_set_swap_vars(
563 struct isl_basic_set *bset, unsigned n)
571 isl_assert(bset->ctx, n <= bset->dim, goto error);
576 bset = isl_basic_set_cow(bset);
580 blk = isl_blk_alloc(bset->ctx, bset->dim);
581 if (isl_blk_is_error(blk))
584 for (i = 0; i < bset->n_eq; ++i)
586 bset->eq[i]+1+bset->nparam, n, bset->dim - n);
588 for (i = 0; i < bset->n_ineq; ++i)
590 bset->ineq[i]+1+bset->nparam, n, bset->dim - n);
592 for (i = 0; i < bset->n_div; ++i)
594 bset->div[i]+1+1+bset->nparam, n, bset->dim - n);
596 isl_blk_free(bset->ctx, blk);
601 isl_basic_set_free(bset);
605 struct isl_set *isl_set_swap_vars(struct isl_set *set, unsigned n)
608 set = isl_set_cow(set);
612 for (i = 0; i < set->n; ++i) {
613 set->p[i] = isl_basic_set_swap_vars(set->p[i], n);
622 static void constraint_drop_vars(isl_int *c, unsigned n, unsigned rem)
624 isl_seq_cpy(c, c + n, rem);
625 isl_seq_clr(c + rem, n);
628 struct isl_basic_set *isl_basic_set_drop_dims(
629 struct isl_basic_set *bset, unsigned first, unsigned n)
636 isl_assert(bset->ctx, first + n <= bset->dim, goto error);
641 bset = isl_basic_set_cow(bset);
645 for (i = 0; i < bset->n_eq; ++i)
646 constraint_drop_vars(bset->eq[i]+1+bset->nparam+first, n,
647 (bset->dim-first-n)+bset->extra);
649 for (i = 0; i < bset->n_ineq; ++i)
650 constraint_drop_vars(bset->ineq[i]+1+bset->nparam+first, n,
651 (bset->dim-first-n)+bset->extra);
653 for (i = 0; i < bset->n_div; ++i)
654 constraint_drop_vars(bset->div[i]+1+1+bset->nparam+first, n,
655 (bset->dim-first-n)+bset->extra);
660 bset = isl_basic_set_simplify(bset);
661 return isl_basic_set_finalize(bset);
663 isl_basic_set_free(bset);
667 static struct isl_set *isl_set_drop_dims(
668 struct isl_set *set, unsigned first, unsigned n)
675 isl_assert(set->ctx, first + n <= set->dim, goto error);
679 set = isl_set_cow(set);
683 for (i = 0; i < set->n; ++i) {
684 set->p[i] = isl_basic_set_drop_dims(set->p[i], first, n);
696 struct isl_basic_map *isl_basic_map_drop_inputs(
697 struct isl_basic_map *bmap, unsigned first, unsigned n)
704 isl_assert(bmap->ctx, first + n <= bmap->n_in, goto error);
709 bmap = isl_basic_map_cow(bmap);
713 for (i = 0; i < bmap->n_eq; ++i)
714 constraint_drop_vars(bmap->eq[i]+1+bmap->nparam+first, n,
715 (bmap->n_in-first-n)+bmap->n_out+bmap->extra);
717 for (i = 0; i < bmap->n_ineq; ++i)
718 constraint_drop_vars(bmap->ineq[i]+1+bmap->nparam+first, n,
719 (bmap->n_in-first-n)+bmap->n_out+bmap->extra);
721 for (i = 0; i < bmap->n_div; ++i)
722 constraint_drop_vars(bmap->div[i]+1+1+bmap->nparam+first, n,
723 (bmap->n_in-first-n)+bmap->n_out+bmap->extra);
728 bmap = isl_basic_map_simplify(bmap);
729 return isl_basic_map_finalize(bmap);
731 isl_basic_map_free(bmap);
735 static struct isl_map *isl_map_drop_inputs(
736 struct isl_map *map, unsigned first, unsigned n)
743 isl_assert(map->ctx, first + n <= map->n_in, goto error);
747 map = isl_map_cow(map);
751 for (i = 0; i < map->n; ++i) {
752 map->p[i] = isl_basic_map_drop_inputs(map->p[i], first, n);
765 * We don't cow, as the div is assumed to be redundant.
767 static struct isl_basic_map *isl_basic_map_drop_div(
768 struct isl_basic_map *bmap, unsigned div)
776 pos = 1 + bmap->nparam + bmap->n_in + bmap->n_out + div;
778 isl_assert(bmap->ctx, div < bmap->n_div, goto error);
780 for (i = 0; i < bmap->n_eq; ++i)
781 constraint_drop_vars(bmap->eq[i]+pos, 1, bmap->extra-div-1);
783 for (i = 0; i < bmap->n_ineq; ++i) {
784 if (!isl_int_is_zero(bmap->ineq[i][pos])) {
785 isl_basic_map_drop_inequality(bmap, i);
789 constraint_drop_vars(bmap->ineq[i]+pos, 1, bmap->extra-div-1);
792 for (i = 0; i < bmap->n_div; ++i)
793 constraint_drop_vars(bmap->div[i]+1+pos, 1, bmap->extra-div-1);
795 if (div != bmap->n_div - 1) {
797 isl_int *t = bmap->div[div];
799 for (j = div; j < bmap->n_div - 1; ++j)
800 bmap->div[j] = bmap->div[j+1];
802 bmap->div[bmap->n_div - 1] = t;
804 isl_basic_map_free_div(bmap, 1);
808 isl_basic_map_free(bmap);
812 static void eliminate_div(struct isl_basic_map *bmap, isl_int *eq, unsigned div)
815 unsigned pos = 1 + bmap->nparam + bmap->n_in + bmap->n_out + div;
817 len = 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
819 for (i = 0; i < bmap->n_eq; ++i)
820 if (bmap->eq[i] != eq)
821 isl_seq_elim(bmap->eq[i], eq, pos, len, NULL);
823 for (i = 0; i < bmap->n_ineq; ++i)
824 isl_seq_elim(bmap->ineq[i], eq, pos, len, NULL);
826 /* We need to be careful about circular definitions,
827 * so for now we just remove the definitions of other divs that
828 * depend on this div and (possibly) recompute them later.
830 for (i = 0; i < bmap->n_div; ++i)
831 if (!isl_int_is_zero(bmap->div[i][0]) &&
832 !isl_int_is_zero(bmap->div[i][1 + pos]))
833 isl_seq_clr(bmap->div[i], 1 + len);
835 isl_basic_map_drop_div(bmap, div);
838 struct isl_basic_map *isl_basic_map_set_to_empty(struct isl_basic_map *bmap)
844 total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->extra;
845 isl_basic_map_free_div(bmap, bmap->n_div);
846 isl_basic_map_free_inequality(bmap, bmap->n_ineq);
848 isl_basic_map_free_equality(bmap, bmap->n_eq-1);
850 isl_basic_map_alloc_equality(bmap);
854 isl_int_set_si(bmap->eq[i][0], 1);
855 isl_seq_clr(bmap->eq[i]+1, total);
856 F_SET(bmap, ISL_BASIC_MAP_EMPTY);
857 return isl_basic_map_finalize(bmap);
859 isl_basic_map_free(bmap);
863 struct isl_basic_set *isl_basic_set_set_to_empty(struct isl_basic_set *bset)
865 return (struct isl_basic_set *)
866 isl_basic_map_set_to_empty((struct isl_basic_map *)bset);
869 static void swap_equality(struct isl_basic_map *bmap, int a, int b)
871 isl_int *t = bmap->eq[a];
872 bmap->eq[a] = bmap->eq[b];
876 static void swap_inequality(struct isl_basic_map *bmap, int a, int b)
879 isl_int *t = bmap->ineq[a];
880 bmap->ineq[a] = bmap->ineq[b];
885 static void set_swap_inequality(struct isl_basic_set *bset, int a, int b)
887 swap_inequality((struct isl_basic_map *)bset, a, b);
890 static void swap_div(struct isl_basic_map *bmap, int a, int b)
893 unsigned off = bmap->nparam + bmap->n_in + bmap->n_out;
894 isl_int *t = bmap->div[a];
895 bmap->div[a] = bmap->div[b];
898 for (i = 0; i < bmap->n_eq; ++i)
899 isl_int_swap(bmap->eq[i][1+off+a], bmap->eq[i][1+off+b]);
901 for (i = 0; i < bmap->n_ineq; ++i)
902 isl_int_swap(bmap->ineq[i][1+off+a], bmap->ineq[i][1+off+b]);
904 for (i = 0; i < bmap->n_div; ++i)
905 isl_int_swap(bmap->div[i][1+1+off+a], bmap->div[i][1+1+off+b]);
908 static void eliminate_var_using_equality(struct isl_basic_map *bmap,
909 unsigned pos, isl_int *eq, int *progress)
914 total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
915 for (k = 0; k < bmap->n_eq; ++k) {
916 if (bmap->eq[k] == eq)
918 if (isl_int_is_zero(bmap->eq[k][1+pos]))
922 isl_seq_elim(bmap->eq[k], eq, 1+pos, 1+total, NULL);
925 for (k = 0; k < bmap->n_ineq; ++k) {
926 if (isl_int_is_zero(bmap->ineq[k][1+pos]))
930 isl_seq_elim(bmap->ineq[k], eq, 1+pos, 1+total, NULL);
933 for (k = 0; k < bmap->n_div; ++k) {
934 if (isl_int_is_zero(bmap->div[k][0]))
936 if (isl_int_is_zero(bmap->div[k][1+1+pos]))
940 isl_seq_elim(bmap->div[k]+1, eq,
941 1+pos, 1+total, &bmap->div[k][0]);
946 struct isl_basic_map *isl_basic_map_gauss(
947 struct isl_basic_map *bmap, int *progress)
958 total_var = bmap->nparam + bmap->n_in + bmap->n_out;
959 total = total_var + bmap->n_div;
961 last_var = total - 1;
962 for (done = 0; done < bmap->n_eq; ++done) {
963 for (; last_var >= 0; --last_var) {
964 for (k = done; k < bmap->n_eq; ++k)
965 if (!isl_int_is_zero(bmap->eq[k][1+last_var]))
973 swap_equality(bmap, k, done);
974 if (isl_int_is_neg(bmap->eq[done][1+last_var]))
975 isl_seq_neg(bmap->eq[done], bmap->eq[done], 1+total);
977 eliminate_var_using_equality(bmap, last_var, bmap->eq[done],
980 if (last_var >= total_var &&
981 isl_int_is_zero(bmap->div[last_var - total_var][0])) {
982 unsigned div = last_var - total_var;
983 isl_seq_neg(bmap->div[div]+1, bmap->eq[done], 1+total);
984 isl_int_set_si(bmap->div[div][1+1+last_var], 0);
985 isl_int_set(bmap->div[div][0],
986 bmap->eq[done][1+last_var]);
989 if (done == bmap->n_eq)
991 for (k = done; k < bmap->n_eq; ++k) {
992 if (isl_int_is_zero(bmap->eq[k][0]))
994 return isl_basic_map_set_to_empty(bmap);
996 isl_basic_map_free_equality(bmap, bmap->n_eq-done);
1000 struct isl_basic_set *isl_basic_set_gauss(
1001 struct isl_basic_set *bset, int *progress)
1003 return (struct isl_basic_set*)isl_basic_map_gauss(
1004 (struct isl_basic_map *)bset, progress);
1007 static unsigned int round_up(unsigned int v)
1018 static int hash_index(int *index, unsigned int size, int bits,
1019 struct isl_basic_map *bmap, int k)
1022 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
1023 u_int32_t hash = isl_seq_hash(bmap->ineq[k]+1, total, bits);
1024 for (h = hash; index[h]; h = (h+1) % size)
1025 if (k != index[h]-1 &&
1026 isl_seq_eq(bmap->ineq[k]+1,
1027 bmap->ineq[index[h]-1]+1, total))
1032 static struct isl_basic_map *remove_duplicate_constraints(
1033 struct isl_basic_map *bmap, int *progress)
1039 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
1042 if (bmap->n_ineq <= 1)
1045 size = round_up(4 * (bmap->n_ineq+1) / 3 - 1);
1046 bits = ffs(size) - 1;
1047 index = isl_alloc_array(ctx, int, size);
1048 memset(index, 0, size * sizeof(int));
1052 index[isl_seq_hash(bmap->ineq[0]+1, total, bits)] = 1;
1053 for (k = 1; k < bmap->n_ineq; ++k) {
1054 h = hash_index(index, size, bits, bmap, k);
1062 if (isl_int_lt(bmap->ineq[k][0], bmap->ineq[l][0]))
1063 swap_inequality(bmap, k, l);
1064 isl_basic_map_drop_inequality(bmap, k);
1068 for (k = 0; k < bmap->n_ineq-1; ++k) {
1069 isl_seq_neg(bmap->ineq[k]+1, bmap->ineq[k]+1, total);
1070 h = hash_index(index, size, bits, bmap, k);
1071 isl_seq_neg(bmap->ineq[k]+1, bmap->ineq[k]+1, total);
1075 isl_int_add(sum, bmap->ineq[k][0], bmap->ineq[l][0]);
1076 if (isl_int_is_pos(sum))
1078 if (isl_int_is_zero(sum)) {
1079 /* We need to break out of the loop after these
1080 * changes since the contents of the hash
1081 * will no longer be valid.
1082 * Plus, we probably we want to regauss first.
1084 isl_basic_map_drop_inequality(bmap, l);
1085 isl_basic_map_inequality_to_equality(bmap, k);
1087 bmap = isl_basic_map_set_to_empty(bmap);
1096 static struct isl_basic_map *remove_duplicate_divs(
1097 struct isl_basic_map *bmap, int *progress)
1104 unsigned total_var = bmap->nparam + bmap->n_in + bmap->n_out;
1105 unsigned total = total_var + bmap->n_div;
1106 struct isl_ctx *ctx;
1108 if (bmap->n_div <= 1)
1112 for (k = bmap->n_div - 1; k >= 0; --k)
1113 if (!isl_int_is_zero(bmap->div[k][0]))
1118 size = round_up(4 * bmap->n_div / 3 - 1);
1119 bits = ffs(size) - 1;
1120 index = isl_alloc_array(ctx, int, size);
1121 memset(index, 0, size * sizeof(int));
1124 eq = isl_blk_alloc(ctx, 1+total);
1125 if (isl_blk_is_error(eq))
1128 isl_seq_clr(eq.data, 1+total);
1129 index[isl_seq_hash(bmap->div[k], 2+total, bits)] = k + 1;
1130 for (--k; k >= 0; --k) {
1133 if (isl_int_is_zero(bmap->div[k][0]))
1136 hash = isl_seq_hash(bmap->div[k], 2+total, bits);
1137 for (h = hash; index[h]; h = (h+1) % size)
1138 if (isl_seq_eq(bmap->div[k],
1139 bmap->div[index[h]-1], 2+total))
1144 isl_int_set_si(eq.data[1+total_var+k], -1);
1145 isl_int_set_si(eq.data[1+total_var+l], 1);
1146 eliminate_div(bmap, eq.data, l);
1147 isl_int_set_si(eq.data[1+total_var+k], 0);
1148 isl_int_set_si(eq.data[1+total_var+l], 0);
1153 isl_blk_free(ctx, eq);
1159 /* Elimininate divs based on equalities
1161 static struct isl_basic_map *eliminate_divs_eq(
1162 struct isl_basic_map *bmap, int *progress)
1172 off = 1 + bmap->nparam + bmap->n_in + bmap->n_out;
1174 for (d = bmap->n_div - 1; d >= 0 ; --d) {
1175 for (i = 0; i < bmap->n_eq; ++i) {
1176 if (!isl_int_is_one(bmap->eq[i][off + d]) &&
1177 !isl_int_is_negone(bmap->eq[i][off + d]))
1181 eliminate_div(bmap, bmap->eq[i], d);
1182 isl_basic_map_drop_equality(bmap, i);
1187 return eliminate_divs_eq(bmap, progress);
1191 static struct isl_basic_map *normalize_constraints(struct isl_basic_map *bmap)
1195 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
1198 for (i = bmap->n_eq - 1; i >= 0; --i) {
1199 isl_seq_gcd(bmap->eq[i]+1, total, &gcd);
1200 if (isl_int_is_zero(gcd)) {
1201 if (!isl_int_is_zero(bmap->eq[i][0])) {
1202 bmap = isl_basic_map_set_to_empty(bmap);
1205 isl_basic_map_drop_equality(bmap, i);
1208 if (F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL))
1209 isl_int_gcd(gcd, gcd, bmap->eq[i][0]);
1210 if (isl_int_is_one(gcd))
1212 if (!isl_int_is_divisible_by(bmap->eq[i][0], gcd)) {
1213 bmap = isl_basic_map_set_to_empty(bmap);
1216 isl_seq_scale_down(bmap->eq[i], bmap->eq[i], gcd, 1+total);
1219 for (i = bmap->n_ineq - 1; i >= 0; --i) {
1220 isl_seq_gcd(bmap->ineq[i]+1, total, &gcd);
1221 if (isl_int_is_zero(gcd)) {
1222 if (isl_int_is_neg(bmap->ineq[i][0])) {
1223 bmap = isl_basic_map_set_to_empty(bmap);
1226 isl_basic_map_drop_inequality(bmap, i);
1229 if (F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL))
1230 isl_int_gcd(gcd, gcd, bmap->ineq[i][0]);
1231 if (isl_int_is_one(gcd))
1233 isl_int_fdiv_q(bmap->ineq[i][0], bmap->ineq[i][0], gcd);
1234 isl_seq_scale_down(bmap->ineq[i]+1, bmap->ineq[i]+1, gcd, total);
1242 /* Eliminate the specified variables from the constraints using
1243 * Fourier-Motzkin. The variables themselves are not removed.
1245 struct isl_basic_map *isl_basic_map_eliminate_vars(
1246 struct isl_basic_map *bmap, int pos, unsigned n)
1255 total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
1256 extra = bmap->extra - bmap->n_div;
1258 bmap = isl_basic_map_cow(bmap);
1259 for (d = pos + n - 1; d >= pos; --d) {
1260 int n_lower, n_upper;
1263 for (i = 0; i < bmap->n_eq; ++i) {
1264 if (isl_int_is_zero(bmap->eq[i][1+d]))
1266 eliminate_var_using_equality(bmap, d, bmap->eq[i], NULL);
1267 isl_basic_map_drop_equality(bmap, i);
1274 for (i = 0; i < bmap->n_ineq; ++i) {
1275 if (isl_int_is_pos(bmap->ineq[i][1+d]))
1277 else if (isl_int_is_neg(bmap->ineq[i][1+d]))
1280 bmap = isl_basic_map_extend(bmap,
1281 bmap->nparam, bmap->n_in, bmap->n_out, 0,
1282 0, n_lower * n_upper);
1283 for (i = bmap->n_ineq - 1; i >= 0; --i) {
1285 if (isl_int_is_zero(bmap->ineq[i][1+d]))
1288 for (j = 0; j < i; ++j) {
1289 if (isl_int_is_zero(bmap->ineq[j][1+d]))
1292 if (isl_int_sgn(bmap->ineq[i][1+d]) ==
1293 isl_int_sgn(bmap->ineq[j][1+d]))
1295 k = isl_basic_map_alloc_inequality(bmap);
1298 isl_seq_cpy(bmap->ineq[k], bmap->ineq[i],
1300 isl_seq_clr(bmap->ineq[k]+1+total, extra);
1301 isl_seq_elim(bmap->ineq[k], bmap->ineq[j],
1302 1+d, 1+total, NULL);
1304 isl_basic_map_drop_inequality(bmap, i);
1307 if (n_lower > 0 && n_upper > 0) {
1308 bmap = normalize_constraints(bmap);
1309 bmap = remove_duplicate_constraints(bmap, NULL);
1310 bmap = isl_basic_map_gauss(bmap, NULL);
1311 bmap = isl_basic_map_convex_hull(bmap);
1314 if (F_ISSET(bmap, ISL_BASIC_MAP_EMPTY))
1320 isl_basic_map_free(bmap);
1324 struct isl_basic_set *isl_basic_set_eliminate_vars(
1325 struct isl_basic_set *bset, unsigned pos, unsigned n)
1327 return (struct isl_basic_set *)isl_basic_map_eliminate_vars(
1328 (struct isl_basic_map *)bset, pos, n);
1331 /* Project out n dimensions starting at first using Fourier-Motzkin */
1332 struct isl_set *isl_set_remove_dims(struct isl_set *set,
1333 unsigned first, unsigned n)
1340 set = isl_set_cow(set);
1343 isl_assert(set->ctx, first+n <= set->dim, goto error);
1345 for (i = 0; i < set->n; ++i) {
1346 set->p[i] = isl_basic_set_eliminate_vars(set->p[i],
1347 set->nparam + first, n);
1351 set = isl_set_drop_dims(set, first, n);
1358 /* Project out n inputs starting at first using Fourier-Motzkin */
1359 struct isl_map *isl_map_remove_inputs(struct isl_map *map,
1360 unsigned first, unsigned n)
1367 map = isl_map_cow(map);
1370 isl_assert(map->ctx, first+n <= map->n_in, goto error);
1372 for (i = 0; i < map->n; ++i) {
1373 map->p[i] = isl_basic_map_eliminate_vars(map->p[i],
1374 map->nparam + first, n);
1378 map = isl_map_drop_inputs(map, first, n);
1385 /* Project out n dimensions starting at first using Fourier-Motzkin */
1386 struct isl_basic_set *isl_basic_set_remove_dims(struct isl_basic_set *bset,
1387 unsigned first, unsigned n)
1389 bset = isl_basic_set_eliminate_vars(bset, bset->nparam + first, n);
1390 bset = isl_basic_set_drop_dims(bset, first, n);
1394 /* Elimininate divs based on inequalities
1396 static struct isl_basic_map *eliminate_divs_ineq(
1397 struct isl_basic_map *bmap, int *progress)
1402 struct isl_ctx *ctx;
1408 off = 1 + bmap->nparam + bmap->n_in + bmap->n_out;
1410 for (d = bmap->n_div - 1; d >= 0 ; --d) {
1411 for (i = 0; i < bmap->n_eq; ++i)
1412 if (!isl_int_is_zero(bmap->eq[i][off + d]))
1416 for (i = 0; i < bmap->n_ineq; ++i)
1417 if (isl_int_abs_gt(bmap->ineq[i][off + d], ctx->one))
1419 if (i < bmap->n_ineq)
1422 bmap = isl_basic_map_eliminate_vars(bmap, (off-1)+d, 1);
1423 if (F_ISSET(bmap, ISL_BASIC_MAP_EMPTY))
1425 bmap = isl_basic_map_drop_div(bmap, d);
1432 struct isl_basic_map *isl_basic_map_simplify(struct isl_basic_map *bmap)
1439 bmap = normalize_constraints(bmap);
1440 bmap = eliminate_divs_eq(bmap, &progress);
1441 bmap = eliminate_divs_ineq(bmap, &progress);
1442 bmap = isl_basic_map_gauss(bmap, &progress);
1443 bmap = remove_duplicate_divs(bmap, &progress);
1444 bmap = remove_duplicate_constraints(bmap, &progress);
1449 struct isl_basic_set *isl_basic_set_simplify(struct isl_basic_set *bset)
1451 return (struct isl_basic_set *)
1452 isl_basic_map_simplify((struct isl_basic_map *)bset);
1455 static void dump_term(struct isl_basic_map *bmap,
1456 isl_int c, int pos, FILE *out)
1458 unsigned in = bmap->n_in;
1459 unsigned dim = bmap->n_in + bmap->n_out;
1461 isl_int_print(out, c);
1463 if (!isl_int_is_one(c))
1464 isl_int_print(out, c);
1465 if (pos < 1 + bmap->nparam)
1466 fprintf(out, "p%d", pos - 1);
1467 else if (pos < 1 + bmap->nparam + in)
1468 fprintf(out, "i%d", pos - 1 - bmap->nparam);
1469 else if (pos < 1 + bmap->nparam + dim)
1470 fprintf(out, "o%d", pos - 1 - bmap->nparam - in);
1472 fprintf(out, "e%d", pos - 1 - bmap->nparam - dim);
1476 static void dump_constraint_sign(struct isl_basic_map *bmap, isl_int *c,
1477 int sign, FILE *out)
1481 unsigned len = 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
1485 for (i = 0, first = 1; i < len; ++i) {
1486 if (isl_int_sgn(c[i]) * sign <= 0)
1489 fprintf(out, " + ");
1491 isl_int_abs(v, c[i]);
1492 dump_term(bmap, v, i, out);
1499 static void dump_constraint(struct isl_basic_map *bmap, isl_int *c,
1500 const char *op, FILE *out, int indent)
1504 fprintf(out, "%*s", indent, "");
1506 dump_constraint_sign(bmap, c, 1, out);
1507 fprintf(out, " %s ", op);
1508 dump_constraint_sign(bmap, c, -1, out);
1512 for (i = bmap->n_div; i < bmap->extra; ++i) {
1513 if (isl_int_is_zero(c[1+bmap->nparam+bmap->n_in+bmap->n_out+i]))
1515 fprintf(out, "%*s", indent, "");
1516 fprintf(out, "ERROR: unused div coefficient not zero\n");
1520 static void dump_constraints(struct isl_basic_map *bmap,
1521 isl_int **c, unsigned n,
1522 const char *op, FILE *out, int indent)
1526 for (i = 0; i < n; ++i)
1527 dump_constraint(bmap, c[i], op, out, indent);
1530 static void dump_affine(struct isl_basic_map *bmap, isl_int *exp, FILE *out)
1534 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
1536 for (j = 0; j < 1 + total; ++j) {
1537 if (isl_int_is_zero(exp[j]))
1539 if (!first && isl_int_is_pos(exp[j]))
1541 dump_term(bmap, exp[j], j, out);
1546 static void dump(struct isl_basic_map *bmap, FILE *out, int indent)
1550 dump_constraints(bmap, bmap->eq, bmap->n_eq, "=", out, indent);
1551 dump_constraints(bmap, bmap->ineq, bmap->n_ineq, ">=", out, indent);
1553 for (i = 0; i < bmap->n_div; ++i) {
1554 fprintf(out, "%*s", indent, "");
1555 fprintf(out, "e%d = [(", i);
1556 dump_affine(bmap, bmap->div[i]+1, out);
1558 isl_int_print(out, bmap->div[i][0]);
1559 fprintf(out, "]\n");
1563 void isl_basic_set_dump(struct isl_basic_set *bset, FILE *out, int indent)
1566 fprintf(out, "null basic set\n");
1570 fprintf(out, "%*s", indent, "");
1571 fprintf(out, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n",
1572 bset->ref, bset->nparam, bset->dim, bset->extra,
1574 dump((struct isl_basic_map *)bset, out, indent);
1577 void isl_basic_map_dump(struct isl_basic_map *bmap, FILE *out, int indent)
1580 fprintf(out, "null basic map\n");
1584 fprintf(out, "%*s", indent, "");
1585 fprintf(out, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, flags: %x\n",
1587 bmap->nparam, bmap->n_in, bmap->n_out, bmap->extra, bmap->flags);
1588 dump(bmap, out, indent);
1591 int isl_inequality_negate(struct isl_basic_map *bmap, unsigned pos)
1593 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
1596 isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
1597 isl_seq_neg(bmap->ineq[pos], bmap->ineq[pos], 1 + total);
1598 isl_int_sub_ui(bmap->ineq[pos][0], bmap->ineq[pos][0], 1);
1602 struct isl_set *isl_set_alloc(struct isl_ctx *ctx,
1603 unsigned nparam, unsigned dim, int n, unsigned flags)
1605 struct isl_set *set;
1607 isl_assert(ctx, n >= 0, return NULL);
1608 set = isl_alloc(ctx, struct isl_set,
1609 sizeof(struct isl_set) +
1610 n * sizeof(struct isl_basic_set *));
1619 set->nparam = nparam;
1626 struct isl_set *isl_set_dup(struct isl_set *set)
1629 struct isl_set *dup;
1634 dup = isl_set_alloc(set->ctx, set->nparam, set->dim, set->n, set->flags);
1637 for (i = 0; i < set->n; ++i)
1638 dup = isl_set_add(dup,
1639 isl_basic_set_dup(set->p[i]));
1643 struct isl_set *isl_set_from_basic_set(struct isl_basic_set *bset)
1645 struct isl_set *set;
1650 set = isl_set_alloc(bset->ctx, bset->nparam, bset->dim, 1, ISL_MAP_DISJOINT);
1652 isl_basic_set_free(bset);
1655 return isl_set_add(set, bset);
1658 struct isl_map *isl_map_from_basic_map(struct isl_basic_map *bmap)
1660 struct isl_map *map;
1665 map = isl_map_alloc(bmap->ctx, bmap->nparam, bmap->n_in, bmap->n_out, 1,
1668 isl_basic_map_free(bmap);
1671 return isl_map_add(map, bmap);
1674 struct isl_set *isl_set_add(struct isl_set *set, struct isl_basic_set *bset)
1678 isl_assert(set->ctx, set->nparam == bset->nparam, goto error);
1679 isl_assert(set->ctx, set->dim == bset->dim, goto error);
1680 isl_assert(set->ctx, set->n < set->size, goto error);
1681 set->p[set->n] = bset;
1688 isl_basic_set_free(bset);
1692 void isl_set_free(struct isl_set *set)
1702 isl_ctx_deref(set->ctx);
1703 for (i = 0; i < set->n; ++i)
1704 isl_basic_set_free(set->p[i]);
1708 void isl_set_dump(struct isl_set *set, FILE *out, int indent)
1713 fprintf(out, "null set\n");
1717 fprintf(out, "%*s", indent, "");
1718 fprintf(out, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
1719 set->ref, set->n, set->nparam, set->dim, set->flags);
1720 for (i = 0; i < set->n; ++i) {
1721 fprintf(out, "%*s", indent, "");
1722 fprintf(out, "basic set %d:\n", i);
1723 isl_basic_set_dump(set->p[i], out, indent+4);
1727 void isl_map_dump(struct isl_map *map, FILE *out, int indent)
1732 fprintf(out, "null map\n");
1736 fprintf(out, "%*s", indent, "");
1737 fprintf(out, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, flags: %x\n",
1738 map->ref, map->n, map->nparam, map->n_in, map->n_out,
1740 for (i = 0; i < map->n; ++i) {
1741 fprintf(out, "%*s", indent, "");
1742 fprintf(out, "basic map %d:\n", i);
1743 isl_basic_map_dump(map->p[i], out, indent+4);
1747 struct isl_basic_map *isl_basic_map_intersect_domain(
1748 struct isl_basic_map *bmap, struct isl_basic_set *bset)
1750 struct isl_basic_map *bmap_domain;
1755 isl_assert(bset->ctx, bset->dim == bmap->n_in, goto error);
1756 isl_assert(bset->ctx, bset->nparam == bmap->nparam, goto error);
1758 bmap = isl_basic_map_extend(bmap,
1759 bset->nparam, bmap->n_in, bmap->n_out,
1760 bset->n_div, bset->n_eq, bset->n_ineq);
1763 bmap_domain = isl_basic_map_from_basic_set(bset,
1765 bmap = add_constraints(bmap, bmap_domain, 0, 0);
1767 bmap = isl_basic_map_simplify(bmap);
1768 return isl_basic_map_finalize(bmap);
1770 isl_basic_map_free(bmap);
1771 isl_basic_set_free(bset);
1775 struct isl_basic_map *isl_basic_map_intersect_range(
1776 struct isl_basic_map *bmap, struct isl_basic_set *bset)
1778 struct isl_basic_map *bmap_range;
1783 isl_assert(bset->ctx, bset->dim == bmap->n_out, goto error);
1784 isl_assert(bset->ctx, bset->nparam == bmap->nparam, goto error);
1786 bmap = isl_basic_map_extend(bmap,
1787 bset->nparam, bmap->n_in, bmap->n_out,
1788 bset->n_div, bset->n_eq, bset->n_ineq);
1791 bmap_range = isl_basic_map_from_basic_set(bset,
1793 bmap = add_constraints(bmap, bmap_range, 0, 0);
1795 bmap = isl_basic_map_simplify(bmap);
1796 return isl_basic_map_finalize(bmap);
1798 isl_basic_map_free(bmap);
1799 isl_basic_set_free(bset);
1803 struct isl_basic_map *isl_basic_map_intersect(
1804 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
1806 if (!bmap1 || !bmap2)
1809 isl_assert(bmap1->ctx, bmap1->nparam == bmap2->nparam, goto error);
1810 isl_assert(bmap1->ctx, bmap1->n_in == bmap2->n_in, goto error);
1811 isl_assert(bmap1->ctx, bmap1->n_out == bmap2->n_out, goto error);
1813 bmap1 = isl_basic_map_extend(bmap1,
1814 bmap1->nparam, bmap1->n_in, bmap1->n_out,
1815 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
1818 bmap1 = add_constraints(bmap1, bmap2, 0, 0);
1820 bmap1 = isl_basic_map_simplify(bmap1);
1821 return isl_basic_map_finalize(bmap1);
1823 isl_basic_map_free(bmap1);
1824 isl_basic_map_free(bmap2);
1828 struct isl_basic_set *isl_basic_set_intersect(
1829 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
1831 return (struct isl_basic_set *)
1832 isl_basic_map_intersect(
1833 (struct isl_basic_map *)bset1,
1834 (struct isl_basic_map *)bset2);
1837 struct isl_map *isl_map_intersect(struct isl_map *map1, struct isl_map *map2)
1840 struct isl_map *result;
1846 if (F_ISSET(map1, ISL_MAP_DISJOINT) &&
1847 F_ISSET(map2, ISL_MAP_DISJOINT))
1848 FL_SET(flags, ISL_MAP_DISJOINT);
1850 result = isl_map_alloc(map1->ctx, map1->nparam, map1->n_in, map1->n_out,
1851 map1->n * map2->n, flags);
1854 for (i = 0; i < map1->n; ++i)
1855 for (j = 0; j < map2->n; ++j) {
1856 struct isl_basic_map *part;
1857 part = isl_basic_map_intersect(
1858 isl_basic_map_copy(map1->p[i]),
1859 isl_basic_map_copy(map2->p[j]));
1860 if (isl_basic_map_is_empty(part))
1861 isl_basic_map_free(part);
1863 result = isl_map_add(result, part);
1876 struct isl_set *isl_set_intersect(struct isl_set *set1, struct isl_set *set2)
1878 return (struct isl_set *)
1879 isl_map_intersect((struct isl_map *)set1,
1880 (struct isl_map *)set2);
1883 struct isl_basic_map *isl_basic_map_reverse(struct isl_basic_map *bmap)
1885 struct isl_basic_set *bset;
1890 bmap = isl_basic_map_cow(bmap);
1894 bset = isl_basic_set_from_basic_map(bmap);
1895 bset = isl_basic_set_swap_vars(bset, in);
1896 return isl_basic_map_from_basic_set(bset, bset->dim-in, in);
1899 /* Turn final n dimensions into existentially quantified variables.
1901 struct isl_basic_set *isl_basic_set_project_out(
1902 struct isl_basic_set *bset, unsigned n, unsigned flags)
1912 isl_assert(bset->ctx, n <= bset->dim, goto error);
1917 bset = isl_basic_set_cow(bset);
1919 row_size = 1 + bset->nparam + bset->dim + bset->extra;
1920 old = bset->block2.data;
1921 bset->block2 = isl_blk_extend(bset->ctx, bset->block2,
1922 (bset->extra + n) * (1 + row_size));
1923 if (!bset->block2.data)
1925 new_div = isl_alloc_array(ctx, isl_int *, bset->extra + n);
1928 for (i = 0; i < n; ++i) {
1929 new_div[i] = bset->block2.data +
1930 (bset->extra + i) * (1 + row_size);
1931 isl_seq_clr(new_div[i], 1 + row_size);
1933 for (i = 0; i < bset->extra; ++i)
1934 new_div[n + i] = bset->block2.data + (bset->div[i] - old);
1936 bset->div = new_div;
1940 bset = isl_basic_set_simplify(bset);
1941 return isl_basic_set_finalize(bset);
1943 isl_basic_set_free(bset);
1947 struct isl_basic_map *isl_basic_map_apply_range(
1948 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
1950 struct isl_basic_set *bset;
1951 unsigned n_in, n_out;
1953 if (!bmap1 || !bmap2)
1956 isl_assert(bmap->ctx, bmap1->n_out == bmap2->n_in, goto error);
1957 isl_assert(bmap->ctx, bmap1->nparam == bmap2->nparam, goto error);
1960 n_out = bmap2->n_out;
1962 bmap2 = isl_basic_map_reverse(bmap2);
1965 bmap1 = isl_basic_map_extend(bmap1, bmap1->nparam,
1966 bmap1->n_in + bmap2->n_in, bmap1->n_out,
1967 bmap2->extra, bmap2->n_eq, bmap2->n_ineq);
1970 bmap1 = add_constraints(bmap1, bmap2, bmap1->n_in - bmap2->n_in, 0);
1971 bmap1 = isl_basic_map_simplify(bmap1);
1972 bset = isl_basic_set_from_basic_map(bmap1);
1973 bset = isl_basic_set_project_out(bset,
1974 bset->dim - (n_in + n_out), 0);
1975 return isl_basic_map_from_basic_set(bset, n_in, n_out);
1977 isl_basic_map_free(bmap1);
1978 isl_basic_map_free(bmap2);
1982 struct isl_basic_set *isl_basic_set_apply(
1983 struct isl_basic_set *bset, struct isl_basic_map *bmap)
1988 isl_assert(bset->ctx, bset->dim == bmap->n_in, goto error);
1990 return (struct isl_basic_set *)
1991 isl_basic_map_apply_range((struct isl_basic_map *)bset, bmap);
1993 isl_basic_set_free(bset);
1994 isl_basic_map_free(bmap);
1998 struct isl_basic_map *isl_basic_map_apply_domain(
1999 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2001 if (!bmap1 || !bmap2)
2004 isl_assert(ctx, bmap1->n_in == bmap2->n_in, goto error);
2005 isl_assert(ctx, bmap1->nparam == bmap2->nparam, goto error);
2007 bmap1 = isl_basic_map_reverse(bmap1);
2008 bmap1 = isl_basic_map_apply_range(bmap1, bmap2);
2009 return isl_basic_map_reverse(bmap1);
2011 isl_basic_map_free(bmap1);
2012 isl_basic_map_free(bmap2);
2016 static struct isl_basic_map *var_equal(struct isl_ctx *ctx,
2017 struct isl_basic_map *bmap, unsigned pos)
2020 i = isl_basic_map_alloc_equality(bmap);
2023 isl_seq_clr(bmap->eq[i],
2024 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->extra);
2025 isl_int_set_si(bmap->eq[i][1+bmap->nparam+pos], -1);
2026 isl_int_set_si(bmap->eq[i][1+bmap->nparam+bmap->n_in+pos], 1);
2027 return isl_basic_map_finalize(bmap);
2029 isl_basic_map_free(bmap);
2033 static struct isl_basic_map *var_more(struct isl_ctx *ctx,
2034 struct isl_basic_map *bmap, unsigned pos)
2037 i = isl_basic_map_alloc_inequality(bmap);
2040 isl_seq_clr(bmap->ineq[i],
2041 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->extra);
2042 isl_int_set_si(bmap->ineq[i][0], -1);
2043 isl_int_set_si(bmap->ineq[i][1+bmap->nparam+pos], -1);
2044 isl_int_set_si(bmap->ineq[i][1+bmap->nparam+bmap->n_in+pos], 1);
2045 return isl_basic_map_finalize(bmap);
2047 isl_basic_map_free(bmap);
2051 static struct isl_basic_map *var_less(struct isl_ctx *ctx,
2052 struct isl_basic_map *bmap, unsigned pos)
2055 i = isl_basic_map_alloc_inequality(bmap);
2058 isl_seq_clr(bmap->ineq[i],
2059 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->extra);
2060 isl_int_set_si(bmap->ineq[i][0], -1);
2061 isl_int_set_si(bmap->ineq[i][1+bmap->nparam+pos], 1);
2062 isl_int_set_si(bmap->ineq[i][1+bmap->nparam+bmap->n_in+pos], -1);
2063 return isl_basic_map_finalize(bmap);
2065 isl_basic_map_free(bmap);
2069 struct isl_basic_map *isl_basic_map_equal(struct isl_ctx *ctx,
2070 unsigned nparam, unsigned in, unsigned out, unsigned n_equal)
2073 struct isl_basic_map *bmap;
2074 bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, n_equal, 0);
2077 for (i = 0; i < n_equal && bmap; ++i)
2078 bmap = var_equal(ctx, bmap, i);
2079 return isl_basic_map_finalize(bmap);
2082 struct isl_basic_map *isl_basic_map_less_at(struct isl_ctx *ctx,
2083 unsigned nparam, unsigned in, unsigned out, unsigned pos)
2086 struct isl_basic_map *bmap;
2087 bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, pos, 1);
2090 for (i = 0; i < pos && bmap; ++i)
2091 bmap = var_equal(ctx, bmap, i);
2093 bmap = var_less(ctx, bmap, pos);
2094 return isl_basic_map_finalize(bmap);
2097 struct isl_basic_map *isl_basic_map_more_at(struct isl_ctx *ctx,
2098 unsigned nparam, unsigned in, unsigned out, unsigned pos)
2101 struct isl_basic_map *bmap;
2102 bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, pos, 1);
2105 for (i = 0; i < pos && bmap; ++i)
2106 bmap = var_equal(ctx, bmap, i);
2108 bmap = var_more(ctx, bmap, pos);
2109 return isl_basic_map_finalize(bmap);
2112 struct isl_basic_map *isl_basic_map_from_basic_set(
2113 struct isl_basic_set *bset, unsigned n_in, unsigned n_out)
2115 struct isl_basic_map *bmap;
2117 bset = isl_basic_set_cow(bset);
2121 isl_assert(ctx, bset->dim == n_in + n_out, goto error);
2122 bmap = (struct isl_basic_map *) bset;
2124 bmap->n_out = n_out;
2125 return isl_basic_map_finalize(bmap);
2127 isl_basic_set_free(bset);
2131 struct isl_basic_set *isl_basic_set_from_basic_map(struct isl_basic_map *bmap)
2135 if (bmap->n_in == 0)
2136 return (struct isl_basic_set *)bmap;
2137 bmap = isl_basic_map_cow(bmap);
2140 bmap->n_out += bmap->n_in;
2142 bmap = isl_basic_map_finalize(bmap);
2143 return (struct isl_basic_set *)bmap;
2148 /* For a div d = floor(f/m), add the constraints
2151 * -(f-(n-1)) + m d >= 0
2153 * Note that the second constraint is the negation of
2157 static int add_div_constraints(struct isl_basic_map *bmap, unsigned div)
2160 unsigned div_pos = 1 + bmap->nparam + bmap->n_in + bmap->n_out + div;
2161 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->extra;
2163 i = isl_basic_map_alloc_inequality(bmap);
2166 isl_seq_cpy(bmap->ineq[i], bmap->div[div]+1, 1+total);
2167 isl_int_neg(bmap->ineq[i][div_pos], bmap->div[div][0]);
2169 j = isl_basic_map_alloc_inequality(bmap);
2172 isl_seq_neg(bmap->ineq[j], bmap->ineq[i], 1 + total);
2173 isl_int_add(bmap->ineq[j][0], bmap->ineq[j][0], bmap->ineq[j][div_pos]);
2174 isl_int_sub_ui(bmap->ineq[j][0], bmap->ineq[j][0], 1);
2178 struct isl_basic_set *isl_basic_map_underlying_set(
2179 struct isl_basic_map *bmap)
2183 if (bmap->nparam == 0 && bmap->n_in == 0 && bmap->n_div == 0)
2184 return (struct isl_basic_set *)bmap;
2185 bmap = isl_basic_map_cow(bmap);
2188 bmap->n_out += bmap->nparam + bmap->n_in + bmap->n_div;
2191 bmap->extra -= bmap->n_div;
2193 bmap = isl_basic_map_finalize(bmap);
2194 return (struct isl_basic_set *)bmap;
2199 struct isl_basic_map *isl_basic_map_overlying_set(
2200 struct isl_basic_set *bset, struct isl_basic_map *like)
2202 struct isl_basic_map *bmap;
2203 struct isl_ctx *ctx;
2210 isl_assert(ctx, bset->dim ==
2211 like->nparam + like->n_in + like->n_out + like->n_div,
2213 if (like->nparam == 0 && like->n_in == 0 && like->n_div == 0) {
2214 isl_basic_map_free(like);
2215 return (struct isl_basic_map *)bset;
2217 bset = isl_basic_set_cow(bset);
2220 total = bset->dim + bset->extra;
2221 bmap = (struct isl_basic_map *)bset;
2222 bmap->nparam = like->nparam;
2223 bmap->n_in = like->n_in;
2224 bmap->n_out = like->n_out;
2225 bmap->extra += like->n_div;
2228 ltotal = total - bmap->extra + like->extra;
2231 bmap->block2 = isl_blk_extend(ctx, bmap->block2,
2232 bmap->extra * (1 + 1 + total));
2233 if (isl_blk_is_error(bmap->block2))
2235 bmap->div = isl_realloc_array(ctx, bmap->div, isl_int *,
2239 bmap = isl_basic_map_extend(bmap, bmap->nparam,
2240 bmap->n_in, bmap->n_out, 0, 0, 2 * like->n_div);
2241 for (i = 0; i < like->n_div; ++i) {
2242 k = isl_basic_map_alloc_div(bmap);
2245 isl_seq_cpy(bmap->div[k], like->div[i], 1 + 1 + ltotal);
2246 isl_seq_clr(bmap->div[k]+1+1+ltotal, total - ltotal);
2247 if (add_div_constraints(bmap, k) < 0)
2251 isl_basic_map_free(like);
2252 bmap = isl_basic_map_finalize(bmap);
2255 isl_basic_map_free(like);
2256 isl_basic_set_free(bset);
2260 struct isl_basic_set *isl_basic_set_from_underlying_set(
2261 struct isl_basic_set *bset, struct isl_basic_set *like)
2263 return (struct isl_basic_set *)
2264 isl_basic_map_overlying_set(bset, (struct isl_basic_map *)like);
2267 struct isl_set *isl_set_from_underlying_set(
2268 struct isl_set *set, struct isl_basic_set *like)
2274 isl_assert(set->ctx, set->dim == like->nparam + like->dim + like->n_div,
2276 if (like->nparam == 0 && like->n_div == 0) {
2277 isl_basic_set_free(like);
2280 set = isl_set_cow(set);
2283 for (i = 0; i < set->n; ++i) {
2284 set->p[i] = isl_basic_set_from_underlying_set(set->p[i],
2285 isl_basic_set_copy(like));
2289 set->nparam = like->nparam;
2290 set->dim = like->dim;
2291 isl_basic_set_free(like);
2294 isl_basic_set_free(like);
2299 struct isl_set *isl_map_underlying_set(struct isl_map *map)
2303 map = isl_map_align_divs(map);
2304 map = isl_map_cow(map);
2308 for (i = 0; i < map->n; ++i) {
2309 map->p[i] = (struct isl_basic_map *)
2310 isl_basic_map_underlying_set(map->p[i]);
2315 map->n_out += map->nparam + map->n_in;
2317 map->n_out = map->p[0]->n_out;
2320 return (struct isl_set *)map;
2326 struct isl_set *isl_set_to_underlying_set(struct isl_set *set)
2328 return (struct isl_set *)isl_map_underlying_set((struct isl_map *)set);
2331 struct isl_basic_set *isl_basic_map_domain(struct isl_basic_map *bmap)
2333 struct isl_basic_set *domain;
2337 n_out = bmap->n_out;
2338 domain = isl_basic_set_from_basic_map(bmap);
2339 return isl_basic_set_project_out(domain, n_out, 0);
2342 struct isl_basic_set *isl_basic_map_range(struct isl_basic_map *bmap)
2344 return isl_basic_map_domain(isl_basic_map_reverse(bmap));
2347 struct isl_set *isl_map_range(struct isl_map *map)
2350 struct isl_set *set;
2354 map = isl_map_cow(map);
2358 set = (struct isl_set *) map;
2360 for (i = 0; i < map->n; ++i) {
2361 set->p[i] = isl_basic_map_range(map->p[i]);
2365 F_CLR(set, ISL_MAP_DISJOINT);
2372 struct isl_map *isl_map_from_set(struct isl_set *set,
2373 unsigned n_in, unsigned n_out)
2376 struct isl_map *map = NULL;
2380 isl_assert(set->ctx, set->dim == n_in + n_out, goto error);
2381 set = isl_set_cow(set);
2384 map = (struct isl_map *)set;
2385 for (i = 0; i < set->n; ++i) {
2386 map->p[i] = isl_basic_map_from_basic_set(
2387 set->p[i], n_in, n_out);
2399 struct isl_set *isl_set_from_map(struct isl_map *map)
2402 struct isl_set *set = NULL;
2406 map = isl_map_cow(map);
2409 map->n_out += map->n_in;
2411 set = (struct isl_set *)map;
2412 for (i = 0; i < map->n; ++i) {
2413 set->p[i] = isl_basic_set_from_basic_map(map->p[i]);
2423 struct isl_map *isl_map_alloc(struct isl_ctx *ctx,
2424 unsigned nparam, unsigned in, unsigned out, int n,
2427 struct isl_map *map;
2429 map = isl_alloc(ctx, struct isl_map,
2430 sizeof(struct isl_map) +
2431 n * sizeof(struct isl_basic_map *));
2440 map->nparam = nparam;
2447 struct isl_basic_map *isl_basic_map_empty(struct isl_ctx *ctx,
2448 unsigned nparam, unsigned in, unsigned out)
2450 struct isl_basic_map *bmap;
2451 bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, 1, 0);
2452 bmap = isl_basic_map_set_to_empty(bmap);
2456 struct isl_basic_set *isl_basic_set_empty(struct isl_ctx *ctx,
2457 unsigned nparam, unsigned dim)
2459 struct isl_basic_set *bset;
2460 bset = isl_basic_set_alloc(ctx, nparam, dim, 0, 1, 0);
2461 bset = isl_basic_set_set_to_empty(bset);
2465 struct isl_basic_map *isl_basic_map_universe(struct isl_ctx *ctx,
2466 unsigned nparam, unsigned in, unsigned out)
2468 struct isl_basic_map *bmap;
2469 bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, 0, 0);
2473 struct isl_basic_set *isl_basic_set_universe(struct isl_ctx *ctx,
2474 unsigned nparam, unsigned dim)
2476 struct isl_basic_set *bset;
2477 bset = isl_basic_set_alloc(ctx, nparam, dim, 0, 0, 0);
2481 struct isl_map *isl_map_empty(struct isl_ctx *ctx,
2482 unsigned nparam, unsigned in, unsigned out)
2484 return isl_map_alloc(ctx, nparam, in, out, 0, ISL_MAP_DISJOINT);
2487 struct isl_set *isl_set_empty(struct isl_ctx *ctx,
2488 unsigned nparam, unsigned dim)
2490 return isl_set_alloc(ctx, nparam, dim, 0, ISL_MAP_DISJOINT);
2493 struct isl_map *isl_map_dup(struct isl_map *map)
2496 struct isl_map *dup;
2500 dup = isl_map_alloc(map->ctx, map->nparam, map->n_in, map->n_out, map->n,
2502 for (i = 0; i < map->n; ++i)
2503 dup = isl_map_add(dup,
2504 isl_basic_map_dup(map->p[i]));
2508 struct isl_map *isl_map_add(struct isl_map *map, struct isl_basic_map *bmap)
2512 isl_assert(map->ctx, map->nparam == bmap->nparam, goto error);
2513 isl_assert(map->ctx, map->n_in == bmap->n_in, goto error);
2514 isl_assert(map->ctx, map->n_out == bmap->n_out, goto error);
2515 isl_assert(map->ctx, map->n < map->size, goto error);
2516 map->p[map->n] = bmap;
2523 isl_basic_map_free(bmap);
2527 void isl_map_free(struct isl_map *map)
2537 isl_ctx_deref(map->ctx);
2538 for (i = 0; i < map->n; ++i)
2539 isl_basic_map_free(map->p[i]);
2543 struct isl_map *isl_map_extend(struct isl_map *base,
2544 unsigned nparam, unsigned n_in, unsigned n_out)
2548 base = isl_map_cow(base);
2552 isl_assert(base->ctx, base->nparam <= nparam, goto error);
2553 isl_assert(base->ctx, base->n_in <= n_in, goto error);
2554 isl_assert(base->ctx, base->n_out <= n_out, goto error);
2555 base->nparam = nparam;
2557 base->n_out = n_out;
2558 for (i = 0; i < base->n; ++i) {
2559 base->p[i] = isl_basic_map_extend(base->p[i],
2560 nparam, n_in, n_out, 0, 0, 0);
2570 struct isl_set *isl_set_extend(struct isl_set *base,
2571 unsigned nparam, unsigned dim)
2573 return (struct isl_set *)isl_map_extend((struct isl_map *)base,
2577 static struct isl_basic_map *isl_basic_map_fix_var(struct isl_basic_map *bmap,
2578 unsigned var, int value)
2582 bmap = isl_basic_map_cow(bmap);
2583 bmap = isl_basic_map_extend(bmap,
2584 bmap->nparam, bmap->n_in, bmap->n_out, 0, 1, 0);
2585 j = isl_basic_map_alloc_equality(bmap);
2588 isl_seq_clr(bmap->eq[j],
2589 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->extra);
2590 isl_int_set_si(bmap->eq[j][1 + var], -1);
2591 isl_int_set_si(bmap->eq[j][0], value);
2592 bmap = isl_basic_map_simplify(bmap);
2593 return isl_basic_map_finalize(bmap);
2595 isl_basic_map_free(bmap);
2599 struct isl_basic_map *isl_basic_map_fix_input_si(struct isl_basic_map *bmap,
2600 unsigned input, int value)
2604 isl_assert(bmap->ctx, input < bmap->n_in, goto error);
2605 return isl_basic_map_fix_var(bmap, bmap->nparam + input, value);
2607 isl_basic_map_free(bmap);
2611 struct isl_basic_set *isl_basic_set_fix_dim_si(struct isl_basic_set *bset,
2612 unsigned dim, int value)
2616 isl_assert(bset->ctx, dim < bset->dim, goto error);
2617 return (struct isl_basic_set *)
2618 isl_basic_map_fix_var((struct isl_basic_map *)bset,
2619 bset->nparam + dim, value);
2621 isl_basic_set_free(bset);
2625 struct isl_map *isl_map_fix_input_si(struct isl_map *map,
2626 unsigned input, int value)
2630 map = isl_map_cow(map);
2634 isl_assert(ctx, input < map->n_in, goto error);
2635 for (i = 0; i < map->n; ++i) {
2636 map->p[i] = isl_basic_map_fix_input_si(map->p[i], input, value);
2646 struct isl_set *isl_set_fix_dim_si(struct isl_set *set, unsigned dim, int value)
2650 set = isl_set_cow(set);
2654 isl_assert(set->ctx, dim < set->dim, goto error);
2655 for (i = 0; i < set->n; ++i) {
2656 set->p[i] = isl_basic_set_fix_dim_si(set->p[i], dim, value);
2666 struct isl_basic_set *isl_basic_set_lower_bound_dim(struct isl_basic_set *bset,
2667 unsigned dim, isl_int value)
2671 bset = isl_basic_set_cow(bset);
2672 bset = isl_basic_set_extend(bset, bset->nparam, bset->dim, 0, 0, 1);
2673 j = isl_basic_set_alloc_inequality(bset);
2676 isl_seq_clr(bset->ineq[j], 1 + bset->nparam + bset->dim + bset->extra);
2677 isl_int_set_si(bset->ineq[j][1 + bset->nparam + dim], 1);
2678 isl_int_neg(bset->ineq[j][0], value);
2679 bset = isl_basic_set_simplify(bset);
2680 return isl_basic_set_finalize(bset);
2682 isl_basic_set_free(bset);
2686 struct isl_set *isl_set_lower_bound_dim(struct isl_set *set, unsigned dim,
2691 set = isl_set_cow(set);
2695 isl_assert(set->ctx, dim < set->dim, goto error);
2696 for (i = 0; i < set->n; ++i) {
2697 set->p[i] = isl_basic_set_lower_bound_dim(set->p[i], dim, value);
2707 struct isl_map *isl_map_reverse(struct isl_map *map)
2712 map = isl_map_cow(map);
2717 map->n_in = map->n_out;
2719 for (i = 0; i < map->n; ++i) {
2720 map->p[i] = isl_basic_map_reverse(map->p[i]);
2730 struct isl_map *isl_basic_map_lexmax(
2731 struct isl_basic_map *bmap, struct isl_basic_set *dom,
2732 struct isl_set **empty)
2734 return isl_pip_basic_map_lexmax(bmap, dom, empty);
2737 struct isl_map *isl_basic_map_lexmin(
2738 struct isl_basic_map *bmap, struct isl_basic_set *dom,
2739 struct isl_set **empty)
2741 return isl_pip_basic_map_lexmin(bmap, dom, empty);
2744 struct isl_set *isl_basic_set_lexmin(struct isl_basic_set *bset)
2746 struct isl_basic_map *bmap = NULL;
2747 struct isl_basic_set *dom = NULL;
2748 struct isl_map *min;
2752 bmap = isl_basic_map_from_basic_set(bset, 0, bset->dim);
2755 dom = isl_basic_set_alloc(bmap->ctx, bmap->nparam, 0, 0, 0, 0);
2758 min = isl_basic_map_lexmin(bmap, dom, NULL);
2759 return isl_map_range(min);
2761 isl_basic_map_free(bmap);
2765 struct isl_map *isl_basic_map_compute_divs(struct isl_basic_map *bmap)
2769 if (bmap->n_div == 0)
2770 return isl_map_from_basic_map(bmap);
2771 return isl_pip_basic_map_compute_divs(bmap);
2774 struct isl_map *isl_map_compute_divs(struct isl_map *map)
2777 struct isl_map *res;
2783 res = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[0]));
2784 for (i = 1 ; i < map->n; ++i) {
2786 r2 = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[i]));
2787 if (F_ISSET(map, ISL_MAP_DISJOINT))
2788 res = isl_map_union_disjoint(res, r2);
2790 res = isl_map_union(res, r2);
2797 struct isl_set *isl_basic_set_compute_divs(struct isl_basic_set *bset)
2799 return (struct isl_set *)
2800 isl_basic_map_compute_divs((struct isl_basic_map *)bset);
2803 struct isl_set *isl_set_compute_divs(struct isl_set *set)
2805 return (struct isl_set *)
2806 isl_map_compute_divs((struct isl_map *)set);
2809 struct isl_set *isl_map_domain(struct isl_map *map)
2812 struct isl_set *set;
2817 map = isl_map_cow(map);
2821 set = (struct isl_set *)map;
2822 set->dim = map->n_in;
2824 for (i = 0; i < map->n; ++i) {
2825 set->p[i] = isl_basic_map_domain(map->p[i]);
2829 F_CLR(set, ISL_MAP_DISJOINT);
2836 struct isl_map *isl_map_union_disjoint(
2837 struct isl_map *map1, struct isl_map *map2)
2841 struct isl_map *map = NULL;
2855 isl_assert(map1->ctx, map1->nparam == map2->nparam, goto error);
2856 isl_assert(map1->ctx, map1->n_in == map2->n_in, goto error);
2857 isl_assert(map1->ctx, map1->n_out == map2->n_out, goto error);
2859 if (F_ISSET(map1, ISL_MAP_DISJOINT) &&
2860 F_ISSET(map2, ISL_MAP_DISJOINT))
2861 FL_SET(flags, ISL_MAP_DISJOINT);
2863 map = isl_map_alloc(map1->ctx, map1->nparam, map1->n_in, map1->n_out,
2864 map1->n + map2->n, flags);
2867 for (i = 0; i < map1->n; ++i) {
2868 map = isl_map_add(map,
2869 isl_basic_map_copy(map1->p[i]));
2873 for (i = 0; i < map2->n; ++i) {
2874 map = isl_map_add(map,
2875 isl_basic_map_copy(map2->p[i]));
2889 struct isl_map *isl_map_union(struct isl_map *map1, struct isl_map *map2)
2891 map1 = isl_map_union_disjoint(map1, map2);
2895 F_CLR(map1, ISL_MAP_DISJOINT);
2899 struct isl_set *isl_set_union_disjoint(
2900 struct isl_set *set1, struct isl_set *set2)
2902 return (struct isl_set *)
2903 isl_map_union_disjoint(
2904 (struct isl_map *)set1, (struct isl_map *)set2);
2907 struct isl_set *isl_set_union(struct isl_set *set1, struct isl_set *set2)
2909 return (struct isl_set *)
2910 isl_map_union((struct isl_map *)set1, (struct isl_map *)set2);
2913 struct isl_map *isl_map_intersect_range(
2914 struct isl_map *map, struct isl_set *set)
2917 struct isl_map *result;
2923 if (F_ISSET(map, ISL_MAP_DISJOINT) &&
2924 F_ISSET(set, ISL_MAP_DISJOINT))
2925 FL_SET(flags, ISL_MAP_DISJOINT);
2927 result = isl_map_alloc(map->ctx, map->nparam, map->n_in, map->n_out,
2928 map->n * set->n, flags);
2931 for (i = 0; i < map->n; ++i)
2932 for (j = 0; j < set->n; ++j) {
2933 result = isl_map_add(result,
2934 isl_basic_map_intersect_range(
2935 isl_basic_map_copy(map->p[i]),
2936 isl_basic_set_copy(set->p[j])));
2949 struct isl_map *isl_map_intersect_domain(
2950 struct isl_map *map, struct isl_set *set)
2952 return isl_map_reverse(
2953 isl_map_intersect_range(isl_map_reverse(map), set));
2956 struct isl_map *isl_map_apply_domain(
2957 struct isl_map *map1, struct isl_map *map2)
2961 map1 = isl_map_reverse(map1);
2962 map1 = isl_map_apply_range(map1, map2);
2963 return isl_map_reverse(map1);
2970 struct isl_map *isl_map_apply_range(
2971 struct isl_map *map1, struct isl_map *map2)
2973 struct isl_map *result;
2979 isl_assert(map1->ctx, map1->nparam == map2->nparam, goto error);
2980 isl_assert(map1->ctx, map1->n_out == map2->n_in, goto error);
2982 result = isl_map_alloc(map1->ctx, map1->nparam, map1->n_in, map2->n_out,
2983 map1->n * map2->n, 0);
2986 for (i = 0; i < map1->n; ++i)
2987 for (j = 0; j < map2->n; ++j) {
2988 result = isl_map_add(result,
2989 isl_basic_map_apply_range(
2990 isl_basic_map_copy(map1->p[i]),
2991 isl_basic_map_copy(map2->p[j])));
2997 if (result && result->n <= 1)
2998 F_SET(result, ISL_MAP_DISJOINT);
3007 * returns range - domain
3009 struct isl_basic_set *isl_basic_map_deltas(struct isl_basic_map *bmap)
3011 struct isl_basic_set *bset;
3017 isl_assert(bmap->ctx, bmap->n_in == bmap->n_out, goto error);
3019 bset = isl_basic_set_from_basic_map(bmap);
3020 bset = isl_basic_set_extend(bset, bset->nparam, 3*dim, 0,
3022 bset = isl_basic_set_swap_vars(bset, 2*dim);
3023 for (i = 0; i < dim; ++i) {
3024 int j = isl_basic_map_alloc_equality(
3025 (struct isl_basic_map *)bset);
3028 isl_seq_clr(bset->eq[j],
3029 1 + bset->nparam + bset->dim + bset->extra);
3030 isl_int_set_si(bset->eq[j][1+bset->nparam+i], 1);
3031 isl_int_set_si(bset->eq[j][1+bset->nparam+dim+i], 1);
3032 isl_int_set_si(bset->eq[j][1+bset->nparam+2*dim+i], -1);
3034 return isl_basic_set_project_out(bset, 2*dim, 0);
3036 isl_basic_map_free(bmap);
3041 * returns range - domain
3043 struct isl_set *isl_map_deltas(struct isl_map *map)
3046 struct isl_set *result;
3051 isl_assert(map->ctx, map->n_in == map->n_out, goto error);
3052 result = isl_set_alloc(map->ctx, map->nparam, map->n_in, map->n, map->flags);
3055 for (i = 0; i < map->n; ++i)
3056 result = isl_set_add(result,
3057 isl_basic_map_deltas(isl_basic_map_copy(map->p[i])));
3065 /* If the only constraints a div d=floor(f/m)
3066 * appears in are its two defining constraints
3069 * -(f - (m - 1)) + m d >= 0
3071 * then it can safely be removed.
3073 static int div_is_redundant(struct isl_basic_map *bmap, int div)
3076 unsigned pos = 1 + bmap->nparam + bmap->n_in + bmap->n_out + div;
3078 for (i = 0; i < bmap->n_eq; ++i)
3079 if (!isl_int_is_zero(bmap->eq[i][pos]))
3082 for (i = 0; i < bmap->n_ineq; ++i) {
3083 if (isl_int_is_zero(bmap->ineq[i][pos]))
3085 if (isl_int_eq(bmap->ineq[i][pos], bmap->div[div][0])) {
3087 isl_int_sub(bmap->div[div][1],
3088 bmap->div[div][1], bmap->div[div][0]);
3089 isl_int_add_ui(bmap->div[div][1], bmap->div[div][1], 1);
3090 neg = isl_seq_is_neg(bmap->ineq[i], bmap->div[div]+1, pos);
3091 isl_int_sub_ui(bmap->div[div][1], bmap->div[div][1], 1);
3092 isl_int_add(bmap->div[div][1],
3093 bmap->div[div][1], bmap->div[div][0]);
3096 if (isl_seq_first_non_zero(bmap->ineq[i]+pos+1,
3097 bmap->n_div-div-1) != -1)
3099 } else if (isl_int_abs_eq(bmap->ineq[i][pos], bmap->div[div][0])) {
3100 if (!isl_seq_eq(bmap->ineq[i], bmap->div[div]+1, pos))
3102 if (isl_seq_first_non_zero(bmap->ineq[i]+pos+1,
3103 bmap->n_div-div-1) != -1)
3109 for (i = 0; i < bmap->n_div; ++i)
3110 if (!isl_int_is_zero(bmap->div[i][1+pos]))
3117 * Remove divs that don't occur in any of the constraints or other divs.
3118 * These can arise when dropping some of the variables in a quast
3119 * returned by piplib.
3121 static struct isl_basic_map *remove_redundant_divs(struct isl_basic_map *bmap)
3128 for (i = bmap->n_div-1; i >= 0; --i) {
3129 if (!div_is_redundant(bmap, i))
3131 bmap = isl_basic_map_drop_div(bmap, i);
3136 struct isl_basic_map *isl_basic_map_finalize(struct isl_basic_map *bmap)
3138 bmap = remove_redundant_divs(bmap);
3141 F_SET(bmap, ISL_BASIC_SET_FINAL);
3145 struct isl_basic_set *isl_basic_set_finalize(struct isl_basic_set *bset)
3147 return (struct isl_basic_set *)
3148 isl_basic_map_finalize((struct isl_basic_map *)bset);
3151 struct isl_set *isl_set_finalize(struct isl_set *set)
3157 for (i = 0; i < set->n; ++i) {
3158 set->p[i] = isl_basic_set_finalize(set->p[i]);
3168 struct isl_map *isl_map_finalize(struct isl_map *map)
3174 for (i = 0; i < map->n; ++i) {
3175 map->p[i] = isl_basic_map_finalize(map->p[i]);
3185 struct isl_basic_map *isl_basic_map_identity(struct isl_ctx *ctx,
3186 unsigned nparam, unsigned dim)
3188 struct isl_basic_map *bmap;
3191 bmap = isl_basic_map_alloc(ctx, nparam, dim, dim, 0, dim, 0);
3195 for (i = 0; i < dim; ++i) {
3196 int j = isl_basic_map_alloc_equality(bmap);
3199 isl_seq_clr(bmap->eq[j],
3200 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->extra);
3201 isl_int_set_si(bmap->eq[j][1+nparam+i], 1);
3202 isl_int_set_si(bmap->eq[j][1+nparam+dim+i], -1);
3204 return isl_basic_map_finalize(bmap);
3206 isl_basic_map_free(bmap);
3210 struct isl_map *isl_map_identity(struct isl_ctx *ctx,
3211 unsigned nparam, unsigned dim)
3213 struct isl_map *map = isl_map_alloc(ctx, nparam, dim, dim, 1,
3217 map = isl_map_add(map,
3218 isl_basic_map_identity(ctx, nparam, dim));
3225 int isl_set_is_equal(struct isl_set *set1, struct isl_set *set2)
3227 return isl_map_is_equal((struct isl_map *)set1, (struct isl_map *)set2);
3230 int isl_set_is_subset(struct isl_set *set1, struct isl_set *set2)
3232 return isl_map_is_subset(
3233 (struct isl_map *)set1, (struct isl_map *)set2);
3236 int isl_basic_map_is_subset(
3237 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3240 struct isl_map *map1;
3241 struct isl_map *map2;
3243 if (!bmap1 || !bmap2)
3246 map1 = isl_map_from_basic_map(isl_basic_map_copy(bmap1));
3247 map2 = isl_map_from_basic_map(isl_basic_map_copy(bmap2));
3249 is_subset = isl_map_is_subset(map1, map2);
3257 int isl_basic_map_is_equal(
3258 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3262 if (!bmap1 || !bmap2)
3264 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
3267 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
3271 int isl_basic_set_is_equal(
3272 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
3274 return isl_basic_map_is_equal(
3275 (struct isl_basic_map *)bset1, (struct isl_basic_map *)bset2);
3278 int isl_map_is_empty(struct isl_map *map)
3285 for (i = 0; i < map->n; ++i) {
3286 is_empty = isl_basic_map_is_empty(map->p[i]);
3295 int isl_set_is_empty(struct isl_set *set)
3297 return isl_map_is_empty((struct isl_map *)set);
3300 int isl_map_is_subset(struct isl_map *map1, struct isl_map *map2)
3304 struct isl_map *diff;
3309 if (isl_map_is_empty(map1))
3312 if (isl_map_is_empty(map2))
3315 diff = isl_map_subtract(isl_map_copy(map1), isl_map_copy(map2));
3319 is_subset = isl_map_is_empty(diff);
3325 int isl_map_is_equal(struct isl_map *map1, struct isl_map *map2)
3331 is_subset = isl_map_is_subset(map1, map2);
3334 is_subset = isl_map_is_subset(map2, map1);
3338 int isl_basic_map_is_strict_subset(
3339 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3343 if (!bmap1 || !bmap2)
3345 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
3348 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
3349 if (is_subset == -1)
3354 static int basic_map_contains(struct isl_basic_map *bmap, struct isl_vec *vec)
3360 total = 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
3361 if (total != vec->size)
3366 for (i = 0; i < bmap->n_eq; ++i) {
3367 isl_seq_inner_product(vec->block.data, bmap->eq[i], total, &s);
3368 if (!isl_int_is_zero(s)) {
3374 for (i = 0; i < bmap->n_ineq; ++i) {
3375 isl_seq_inner_product(vec->block.data, bmap->ineq[i], total, &s);
3376 if (isl_int_is_neg(s)) {
3387 int isl_basic_map_is_universe(struct isl_basic_map *bmap)
3391 return bmap->n_eq == 0 && bmap->n_ineq == 0;
3394 int isl_basic_map_is_empty(struct isl_basic_map *bmap)
3396 struct isl_basic_set *bset = NULL;
3397 struct isl_vec *sample = NULL;
3404 if (F_ISSET(bmap, ISL_BASIC_MAP_EMPTY))
3407 if (F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL)) {
3408 struct isl_basic_map *copy = isl_basic_map_copy(bmap);
3409 copy = isl_basic_map_convex_hull(copy);
3410 empty = F_ISSET(copy, ISL_BASIC_MAP_EMPTY);
3411 isl_basic_map_free(copy);
3415 total = 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
3416 if (bmap->sample && bmap->sample->size == total) {
3417 int contains = basic_map_contains(bmap, bmap->sample);
3423 bset = isl_basic_map_underlying_set(isl_basic_map_copy(bmap));
3426 sample = isl_basic_set_sample(bset);
3429 empty = sample->size == 0;
3431 isl_vec_free(bmap->ctx, bmap->sample);
3432 bmap->sample = sample;
3437 struct isl_map *isl_basic_map_union(
3438 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3440 struct isl_map *map;
3441 if (!bmap1 || !bmap2)
3444 isl_assert(bmap1->ctx, bmap1->nparam == bmap2->nparam, goto error);
3445 isl_assert(bmap1->ctx, bmap1->n_in == bmap2->n_in, goto error);
3446 isl_assert(bmap1->ctx, bmap1->n_out == bmap2->n_out, goto error);
3448 map = isl_map_alloc(bmap1->ctx, bmap1->nparam,
3449 bmap1->n_in, bmap1->n_out, 2, 0);
3452 map = isl_map_add(map, bmap1);
3453 map = isl_map_add(map, bmap2);
3456 isl_basic_map_free(bmap1);
3457 isl_basic_map_free(bmap2);
3461 struct isl_set *isl_basic_set_union(
3462 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
3464 return (struct isl_set *)isl_basic_map_union(
3465 (struct isl_basic_map *)bset1,
3466 (struct isl_basic_map *)bset2);
3469 /* Order divs such that any div only depends on previous divs */
3470 static struct isl_basic_map *order_divs(struct isl_basic_map *bmap)
3473 unsigned off = bmap->nparam + bmap->n_in + bmap->n_out;
3475 for (i = 0; i < bmap->n_div; ++i) {
3477 pos = isl_seq_first_non_zero(bmap->div[i]+1+1+off+i,
3481 swap_div(bmap, i, pos);
3487 static int find_div(struct isl_basic_map *dst,
3488 struct isl_basic_map *src, unsigned div)
3492 unsigned total = src->nparam + src->n_in + src->n_out + src->n_div;
3494 for (i = 0; i < dst->n_div; ++i)
3495 if (isl_seq_eq(dst->div[i], src->div[div], 1+1+total) &&
3496 isl_seq_first_non_zero(dst->div[i]+1+1+total,
3497 dst->n_div - src->n_div) == -1)
3502 struct isl_basic_map *isl_basic_map_align_divs(
3503 struct isl_basic_map *dst, struct isl_basic_map *src)
3506 unsigned total = src->nparam + src->n_in + src->n_out + src->n_div;
3508 if (src->n_div == 0)
3511 src = order_divs(src);
3512 dst = isl_basic_map_extend(dst, dst->nparam, dst->n_in,
3513 dst->n_out, src->n_div, 0, 2 * src->n_div);
3516 for (i = 0; i < src->n_div; ++i) {
3517 int j = find_div(dst, src, i);
3519 j = isl_basic_map_alloc_div(dst);
3522 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total);
3523 isl_seq_clr(dst->div[j]+1+1+total,
3524 dst->extra - src->n_div);
3525 if (add_div_constraints(dst, j) < 0)
3529 swap_div(dst, i, j);
3533 isl_basic_map_free(dst);
3537 struct isl_map *isl_map_align_divs(struct isl_map *map)
3541 map = isl_map_compute_divs(map);
3542 map = isl_map_cow(map);
3546 for (i = 1; i < map->n; ++i)
3547 map->p[0] = isl_basic_map_align_divs(map->p[0], map->p[i]);
3548 for (i = 1; i < map->n; ++i)
3549 map->p[i] = isl_basic_map_align_divs(map->p[i], map->p[0]);
3554 static struct isl_map *add_cut_constraint(struct isl_map *dst,
3555 struct isl_basic_map *src, isl_int *c,
3556 unsigned len, int oppose)
3558 struct isl_basic_map *copy = NULL;
3563 copy = isl_basic_map_copy(src);
3564 copy = isl_basic_map_cow(copy);
3567 copy = isl_basic_map_extend(copy,
3568 copy->nparam, copy->n_in, copy->n_out, 0, 0, 1);
3569 k = isl_basic_map_alloc_inequality(copy);
3573 isl_seq_neg(copy->ineq[k], c, len);
3575 isl_seq_cpy(copy->ineq[k], c, len);
3576 total = 1 + copy->nparam + copy->n_in + copy->n_out + copy->extra;
3577 isl_seq_clr(copy->ineq[k]+len, total - len);
3578 isl_inequality_negate(copy, k);
3579 copy = isl_basic_map_simplify(copy);
3580 copy = isl_basic_map_finalize(copy);
3581 is_empty = isl_basic_map_is_empty(copy);
3585 dst = isl_map_add(dst, copy);
3587 isl_basic_map_free(copy);
3590 isl_basic_map_free(copy);
3595 static struct isl_map *subtract(struct isl_map *map, struct isl_basic_map *bmap)
3599 struct isl_map *rest = NULL;
3601 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
3608 if (F_ISSET(map, ISL_MAP_DISJOINT))
3609 FL_SET(flags, ISL_MAP_DISJOINT);
3611 max = map->n * (2 * bmap->n_eq + bmap->n_ineq);
3612 rest = isl_map_alloc(map->ctx, map->nparam, map->n_in, map->n_out,
3617 for (i = 0; i < map->n; ++i) {
3618 map->p[i] = isl_basic_map_align_divs(map->p[i], bmap);
3623 for (j = 0; j < map->n; ++j)
3624 map->p[j] = isl_basic_map_cow(map->p[j]);
3626 for (i = 0; i < bmap->n_eq; ++i) {
3627 for (j = 0; j < map->n; ++j) {
3628 rest = add_cut_constraint(rest,
3629 map->p[j], bmap->eq[i], 1+total, 0);
3633 rest = add_cut_constraint(rest,
3634 map->p[j], bmap->eq[i], 1+total, 1);
3638 map->p[j] = isl_basic_map_extend(map->p[j],
3639 map->p[j]->nparam, map->p[j]->n_in,
3640 map->p[j]->n_out, 0, 1, 0);
3643 k = isl_basic_map_alloc_equality(map->p[j]);
3646 isl_seq_cpy(map->p[j]->eq[k], bmap->eq[i], 1+total);
3647 isl_seq_clr(map->p[j]->eq[k]+1+total,
3648 map->p[j]->extra - bmap->n_div);
3652 for (i = 0; i < bmap->n_ineq; ++i) {
3653 for (j = 0; j < map->n; ++j) {
3654 rest = add_cut_constraint(rest,
3655 map->p[j], bmap->ineq[i], 1+total, 0);
3659 map->p[j] = isl_basic_map_extend(map->p[j],
3660 map->p[j]->nparam, map->p[j]->n_in,
3661 map->p[j]->n_out, 0, 0, 1);
3664 k = isl_basic_map_alloc_inequality(map->p[j]);
3667 isl_seq_cpy(map->p[j]->ineq[k], bmap->ineq[i], 1+total);
3668 isl_seq_clr(map->p[j]->ineq[k]+1+total,
3669 map->p[j]->extra - bmap->n_div);
3681 struct isl_map *isl_map_subtract(struct isl_map *map1, struct isl_map *map2)
3687 isl_assert(map1->ctx, map1->nparam == map2->nparam, goto error);
3688 isl_assert(map1->ctx, map1->n_in == map2->n_in, goto error);
3689 isl_assert(map1->ctx, map1->n_out == map2->n_out, goto error);
3691 if (isl_map_is_empty(map2)) {
3696 map1 = isl_map_compute_divs(map1);
3697 map2 = isl_map_compute_divs(map2);
3701 for (i = 0; map1 && i < map2->n; ++i)
3702 map1 = subtract(map1, map2->p[i]);
3712 struct isl_set *isl_set_subtract(struct isl_set *set1, struct isl_set *set2)
3714 return (struct isl_set *)
3716 (struct isl_map *)set1, (struct isl_map *)set2);
3719 struct isl_set *isl_set_apply(struct isl_set *set, struct isl_map *map)
3723 isl_assert(set->ctx, set->dim == map->n_in, goto error);
3724 map = isl_map_intersect_domain(map, set);
3725 set = isl_map_range(map);
3733 /* There is no need to cow as removing empty parts doesn't change
3734 * the meaning of the set.
3736 struct isl_map *isl_map_remove_empty_parts(struct isl_map *map)
3743 for (i = map->n-1; i >= 0; --i) {
3744 if (!F_ISSET(map->p[i], ISL_BASIC_MAP_EMPTY))
3746 isl_basic_map_free(map->p[i]);
3748 map->p[i] = map->p[map->n-1];
3755 struct isl_set *isl_set_remove_empty_parts(struct isl_set *set)
3757 return (struct isl_set *)
3758 isl_map_remove_empty_parts((struct isl_map *)set);
3761 struct isl_basic_set *isl_set_copy_basic_set(struct isl_set *set)
3763 struct isl_basic_set *bset;
3764 if (!set || set->n == 0)
3766 bset = set->p[set->n-1];
3767 isl_assert(set->ctx, F_ISSET(bset, ISL_BASIC_SET_FINAL), return NULL);
3768 return isl_basic_set_copy(bset);
3771 struct isl_set *isl_set_drop_basic_set(struct isl_set *set,
3772 struct isl_basic_set *bset)
3778 for (i = set->n-1; i >= 0; --i) {
3779 if (set->p[i] != bset)
3781 set = isl_set_cow(set);
3784 isl_basic_set_free(set->p[i]);
3786 set->p[i] = set->p[set->n-1];
3790 isl_basic_set_free(bset);
3794 isl_basic_set_free(bset);
3798 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
3799 * for any common value of the parameters and dimensions preceding dim
3800 * in both basic sets, the values of dimension pos in bset1 are
3801 * smaller or larger then those in bset2.
3804 * 1 if bset1 follows bset2
3805 * -1 if bset1 precedes bset2
3806 * 0 if bset1 and bset2 are incomparable
3807 * -2 if some error occurred.
3809 int isl_basic_set_compare_at(struct isl_basic_set *bset1,
3810 struct isl_basic_set *bset2, int pos)
3812 struct isl_basic_map *bmap1 = NULL;
3813 struct isl_basic_map *bmap2 = NULL;
3814 struct isl_ctx *ctx;
3815 struct isl_vec *obj;
3818 enum isl_lp_result res;
3821 if (!bset1 || !bset2)
3824 bmap1 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset1),
3825 pos, bset1->dim - pos);
3826 bmap2 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset2),
3827 pos, bset2->dim - pos);
3828 if (!bmap1 || !bmap2)
3830 bmap1 = isl_basic_map_extend(bmap1, bmap1->nparam,
3831 bmap1->n_in, bmap1->n_out + bmap2->n_out,
3832 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
3835 total = bmap1->nparam + bmap1->n_in + bmap1->n_out + bmap1->n_div;
3837 obj = isl_vec_alloc(ctx, total);
3838 isl_seq_clr(obj->block.data, total);
3839 isl_int_set_si(obj->block.data[bmap1->nparam+bmap1->n_in], 1);
3840 isl_int_set_si(obj->block.data[bmap1->nparam+bmap1->n_in+
3841 bmap1->n_out-bmap2->n_out], -1);
3844 bmap1 = add_constraints(bmap1, bmap2, 0, bmap1->n_out - bmap2->n_out);
3847 res = isl_solve_lp(bmap1, 0, obj->block.data, ctx->one, &num, &den);
3848 if (res == isl_lp_empty)
3850 else if (res == isl_lp_ok && isl_int_is_pos(num))
3852 else if ((res == isl_lp_ok && isl_int_is_neg(num)) ||
3853 res == isl_lp_unbounded)
3859 isl_basic_map_free(bmap1);
3860 isl_vec_free(ctx, obj);
3863 isl_basic_map_free(bmap1);
3864 isl_basic_map_free(bmap2);
3868 static int isl_basic_map_fast_has_fixed_var(struct isl_basic_map *bmap,
3869 unsigned pos, isl_int *val)
3877 total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
3878 for (i = 0, d = total-1; i < bmap->n_eq && d+1 > pos; ++i) {
3879 for (; d+1 > pos; --d)
3880 if (!isl_int_is_zero(bmap->eq[i][1+d]))
3884 if (isl_seq_first_non_zero(bmap->eq[i]+1, d) != -1)
3886 if (isl_seq_first_non_zero(bmap->eq[i]+1+d+1, total-d-1) != -1)
3888 if (!isl_int_is_one(bmap->eq[i][1+d]))
3891 isl_int_neg(*val, bmap->eq[i][0]);
3897 static int isl_map_fast_has_fixed_var(struct isl_map *map,
3898 unsigned pos, isl_int *val)
3910 return isl_basic_map_fast_has_fixed_var(map->p[0], pos, val);
3913 fixed = isl_basic_map_fast_has_fixed_var(map->p[0], pos, &v);
3914 for (i = 1; fixed == 1 && i < map->n; ++i) {
3915 fixed = isl_basic_map_fast_has_fixed_var(map->p[i], pos, &tmp);
3916 if (fixed == 1 && isl_int_ne(tmp, v))
3920 isl_int_set(*val, v);
3926 static int isl_set_fast_has_fixed_var(struct isl_set *set, unsigned pos,
3929 return isl_map_fast_has_fixed_var((struct isl_map *)set, pos, val);
3932 /* Check if dimension dim has fixed value and if so and if val is not NULL,
3933 * then return this fixed value in *val.
3935 int isl_set_fast_dim_is_fixed(struct isl_set *set, unsigned dim, isl_int *val)
3937 return isl_set_fast_has_fixed_var(set, set->nparam + dim, val);
3940 /* Check if input variable in has fixed value and if so and if val is not NULL,
3941 * then return this fixed value in *val.
3943 int isl_map_fast_input_is_fixed(struct isl_map *map, unsigned in, isl_int *val)
3945 return isl_map_fast_has_fixed_var(map, map->nparam + in, val);
3948 /* Check if dimension dim has an (obvious) fixed lower bound and if so
3949 * and if val is not NULL, then return this lower bound in *val.
3951 int isl_basic_set_fast_dim_has_fixed_lower_bound(struct isl_basic_set *bset,
3952 unsigned dim, isl_int *val)
3954 int i, i_eq = -1, i_ineq = -1;
3960 total = bset->nparam + bset->dim + bset->n_div;
3961 for (i = 0; i < bset->n_eq; ++i) {
3962 if (isl_int_is_zero(bset->eq[i][1+bset->nparam+dim]))
3968 for (i = 0; i < bset->n_ineq; ++i) {
3969 if (!isl_int_is_pos(bset->ineq[i][1+bset->nparam+dim]))
3971 if (i_eq != -1 || i_ineq != -1)
3975 if (i_eq == -1 && i_ineq == -1)
3977 c = i_eq != -1 ? bset->eq[i_eq] : bset->ineq[i_ineq];
3978 /* The coefficient should always be one due to normalization. */
3979 if (!isl_int_is_one(c[1+bset->nparam+dim]))
3981 if (isl_seq_first_non_zero(c+1, bset->nparam+dim) != -1)
3983 if (isl_seq_first_non_zero(c+1+bset->nparam+dim+1,
3984 total - bset->nparam - dim - 1) != -1)
3987 isl_int_neg(*val, c[0]);
3991 int isl_set_fast_dim_has_fixed_lower_bound(struct isl_set *set,
3992 unsigned dim, isl_int *val)
4004 return isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[0],
4008 fixed = isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[0],
4010 for (i = 1; fixed == 1 && i < set->n; ++i) {
4011 fixed = isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[i],
4013 if (fixed == 1 && isl_int_ne(tmp, v))
4017 isl_int_set(*val, v);
4023 /* Remove all information from bset that is redundant in the context
4024 * of context. In particular, equalities that are linear combinations
4025 * of those in context are remobed. Then the inequalities that are
4026 * redundant in the context of the equalities and inequalities of
4027 * context are removed.
4029 static struct isl_basic_set *uset_gist(struct isl_basic_set *bset,
4030 struct isl_basic_set *context)
4034 struct isl_basic_set *combined;
4035 struct isl_ctx *ctx;
4036 enum isl_lp_result res = isl_lp_ok;
4038 if (!bset || !context)
4041 if (context->n_eq > 0) {
4044 struct isl_ctx *ctx = context->ctx;
4045 context = isl_basic_set_remove_equalities(context, &T, &T2);
4048 bset = isl_basic_set_preimage(ctx, bset, T);
4049 bset = uset_gist(bset, context);
4050 bset = isl_basic_set_preimage(ctx, bset, T2);
4053 combined = isl_basic_set_extend(isl_basic_set_copy(bset),
4054 0, bset->dim, 0, context->n_eq, context->n_ineq);
4055 context = set_add_constraints(combined, context, 0);
4060 for (i = bset->n_ineq-1; i >= 0; --i) {
4061 set_swap_inequality(context, i, context->n_ineq-1);
4063 res = isl_solve_lp((struct isl_basic_map *)context, 0,
4064 context->ineq[context->n_ineq]+1, ctx->one, &opt, NULL);
4066 set_swap_inequality(context, i, context->n_ineq-1);
4067 if (res == isl_lp_unbounded)
4069 if (res == isl_lp_error)
4071 if (res == isl_lp_empty) {
4072 bset = isl_basic_set_set_to_empty(bset);
4075 isl_int_add(opt, opt, context->ineq[i][0]);
4076 if (!isl_int_is_neg(opt)) {
4077 isl_basic_set_drop_inequality(context, i);
4078 isl_basic_set_drop_inequality(bset, i);
4082 if (res == isl_lp_error)
4084 isl_basic_set_free(context);
4087 isl_basic_set_free(context);
4088 isl_basic_set_free(bset);
4092 struct isl_basic_map *isl_basic_map_gist(struct isl_basic_map *bmap,
4093 struct isl_basic_map *context)
4095 struct isl_basic_set *bset;
4097 if (!bmap || !context)
4100 context = isl_basic_map_align_divs(context, bmap);
4101 bmap = isl_basic_map_align_divs(bmap, context);
4103 bset = uset_gist(isl_basic_map_underlying_set(isl_basic_map_copy(bmap)),
4104 isl_basic_map_underlying_set(context));
4106 return isl_basic_map_overlying_set(bset, bmap);
4108 isl_basic_map_free(bmap);
4109 isl_basic_map_free(context);
4113 struct isl_map *isl_map_gist(struct isl_map *map, struct isl_basic_map *context)
4117 map = isl_map_cow(map);
4118 if (!map || !context)
4120 isl_assert(map->ctx, map->nparam == context->nparam, goto error);
4121 isl_assert(map->ctx, map->n_in == context->n_in, goto error);
4122 isl_assert(map->ctx, map->n_out == context->n_out, goto error);
4123 for (i = 0; i < map->n; ++i)
4124 context = isl_basic_map_align_divs(context, map->p[i]);
4125 for (i = 0; i < map->n; ++i) {
4126 map->p[i] = isl_basic_map_gist(map->p[i],
4127 isl_basic_map_copy(context));
4131 isl_basic_map_free(context);
4135 isl_basic_map_free(context);
4139 struct isl_set *isl_set_gist(struct isl_set *set, struct isl_basic_set *context)
4141 return (struct isl_set *)isl_map_gist((struct isl_map *)set,
4142 (struct isl_basic_map *)context);