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 (isl_blk_is_error(bmap->block)) {
27 bmap->eq = isl_alloc_array(ctx, isl_int *, n_eq + n_ineq);
29 isl_blk_free(ctx, bmap->block);
35 bmap->block2 = isl_blk_empty();
38 bmap->block2 = isl_blk_alloc(ctx, extra * (1 + row_size));
39 if (isl_blk_is_error(bmap->block2)) {
41 isl_blk_free(ctx, bmap->block);
46 bmap->div = isl_alloc_array(ctx, isl_int *, extra);
48 isl_blk_free(ctx, bmap->block2);
50 isl_blk_free(ctx, bmap->block);
56 for (i = 0; i < n_eq + n_ineq; ++i)
57 bmap->eq[i] = bmap->block.data + i * row_size;
59 for (i = 0; i < extra; ++i)
60 bmap->div[i] = bmap->block2.data + i * (1 + row_size);
66 bmap->c_size = n_eq + n_ineq;
67 bmap->ineq = bmap->eq + n_eq;
68 bmap->nparam = nparam;
80 struct isl_basic_set *isl_basic_set_alloc(struct isl_ctx *ctx,
81 unsigned nparam, unsigned dim, unsigned extra,
82 unsigned n_eq, unsigned n_ineq)
84 struct isl_basic_map *bmap;
85 bmap = isl_basic_map_alloc(ctx, nparam, 0, dim, extra, n_eq, n_ineq);
86 return (struct isl_basic_set *)bmap;
89 struct isl_basic_map *isl_basic_map_alloc(struct isl_ctx *ctx,
90 unsigned nparam, unsigned in, unsigned out, unsigned extra,
91 unsigned n_eq, unsigned n_ineq)
93 struct isl_basic_map *bmap;
95 bmap = isl_alloc_type(ctx, struct isl_basic_map);
99 return basic_map_init(ctx, bmap,
100 nparam, in, out, extra, n_eq, n_ineq);
103 static void dup_constraints(
104 struct isl_basic_map *dst, struct isl_basic_map *src)
107 unsigned total = src->nparam + src->n_in + src->n_out + src->n_div;
109 for (i = 0; i < src->n_eq; ++i) {
110 int j = isl_basic_map_alloc_equality(dst);
111 isl_seq_cpy(dst->eq[j], src->eq[i], 1+total);
114 for (i = 0; i < src->n_ineq; ++i) {
115 int j = isl_basic_map_alloc_inequality(dst);
116 isl_seq_cpy(dst->ineq[j], src->ineq[i], 1+total);
119 for (i = 0; i < src->n_div; ++i) {
120 int j = isl_basic_map_alloc_div(dst);
121 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total);
123 F_SET(dst, ISL_BASIC_SET_FINAL);
126 struct isl_basic_map *isl_basic_map_dup(struct isl_basic_map *bmap)
128 struct isl_basic_map *dup;
132 dup = isl_basic_map_alloc(bmap->ctx, bmap->nparam,
133 bmap->n_in, bmap->n_out,
134 bmap->n_div, bmap->n_eq, bmap->n_ineq);
137 dup->flags = bmap->flags;
138 dup_constraints(dup, bmap);
139 dup->sample = isl_vec_copy(bmap->ctx, bmap->sample);
143 struct isl_basic_set *isl_basic_set_dup(struct isl_basic_set *bset)
145 struct isl_basic_map *dup;
147 dup = isl_basic_map_dup((struct isl_basic_map *)bset);
148 return (struct isl_basic_set *)dup;
151 struct isl_basic_set *isl_basic_set_copy(struct isl_basic_set *bset)
156 if (F_ISSET(bset, ISL_BASIC_SET_FINAL)) {
160 return isl_basic_set_dup(bset);
163 struct isl_set *isl_set_copy(struct isl_set *set)
172 struct isl_basic_map *isl_basic_map_copy(struct isl_basic_map *bmap)
177 if (F_ISSET(bmap, ISL_BASIC_SET_FINAL)) {
181 return isl_basic_map_dup(bmap);
184 struct isl_map *isl_map_copy(struct isl_map *map)
193 void isl_basic_map_free(struct isl_basic_map *bmap)
201 isl_ctx_deref(bmap->ctx);
203 isl_blk_free(bmap->ctx, bmap->block2);
205 isl_blk_free(bmap->ctx, bmap->block);
206 isl_vec_free(bmap->ctx, bmap->sample);
210 void isl_basic_set_free(struct isl_basic_set *bset)
212 isl_basic_map_free((struct isl_basic_map *)bset);
215 int isl_basic_map_alloc_equality(struct isl_basic_map *bmap)
221 isl_assert(ctx, bmap->n_eq + bmap->n_ineq < bmap->c_size, return -1);
222 isl_assert(ctx, bmap->eq + bmap->n_eq <= bmap->ineq, return -1);
223 if (bmap->eq + bmap->n_eq == bmap->ineq) {
225 int j = isl_basic_map_alloc_inequality(bmap);
229 bmap->ineq[0] = bmap->ineq[j];
237 int isl_basic_set_alloc_equality(struct isl_basic_set *bset)
239 return isl_basic_map_alloc_equality((struct isl_basic_map *)bset);
242 int isl_basic_map_free_equality(struct isl_basic_map *bmap, unsigned n)
246 isl_assert(bmap->ctx, n <= bmap->n_eq, return -1);
251 int isl_basic_map_drop_equality(struct isl_basic_map *bmap, unsigned pos)
256 isl_assert(bmap->ctx, pos < bmap->n_eq, return -1);
258 if (pos != bmap->n_eq - 1) {
260 bmap->eq[pos] = bmap->eq[bmap->n_eq - 1];
261 bmap->eq[bmap->n_eq - 1] = t;
267 int isl_basic_set_drop_equality(struct isl_basic_set *bset, unsigned pos)
269 return isl_basic_map_drop_equality((struct isl_basic_map *)bset, pos);
272 void isl_basic_map_inequality_to_equality(
273 struct isl_basic_map *bmap, unsigned pos)
278 bmap->ineq[pos] = bmap->ineq[0];
279 bmap->ineq[0] = bmap->eq[bmap->n_eq];
280 bmap->eq[bmap->n_eq] = t;
286 int isl_basic_map_alloc_inequality(struct isl_basic_map *bmap)
292 isl_assert(ctx, (bmap->ineq - bmap->eq) + bmap->n_ineq < bmap->c_size,
294 F_CLR(bmap, ISL_BASIC_MAP_NO_IMPLICIT);
295 F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
296 return bmap->n_ineq++;
299 int isl_basic_set_alloc_inequality(struct isl_basic_set *bset)
301 return isl_basic_map_alloc_inequality((struct isl_basic_map *)bset);
304 int isl_basic_map_free_inequality(struct isl_basic_map *bmap, unsigned n)
308 isl_assert(bmap->ctx, n <= bmap->n_ineq, return -1);
313 int isl_basic_set_free_inequality(struct isl_basic_set *bset, unsigned n)
315 return isl_basic_map_free_inequality((struct isl_basic_map *)bset, n);
318 int isl_basic_map_drop_inequality(struct isl_basic_map *bmap, unsigned pos)
323 isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
325 if (pos != bmap->n_ineq - 1) {
327 bmap->ineq[pos] = bmap->ineq[bmap->n_ineq - 1];
328 bmap->ineq[bmap->n_ineq - 1] = t;
334 int isl_basic_set_drop_inequality(struct isl_basic_set *bset, unsigned pos)
336 return isl_basic_map_drop_inequality((struct isl_basic_map *)bset, pos);
339 int isl_basic_map_alloc_div(struct isl_basic_map *bmap)
343 isl_assert(bmap->ctx, bmap->n_div < bmap->extra, return -1);
344 return bmap->n_div++;
347 int isl_basic_map_free_div(struct isl_basic_map *bmap, unsigned n)
351 isl_assert(bmap->ctx, n <= bmap->n_div, return -1);
356 /* Copy constraint from src to dst, putting the vars of src at offset
357 * dim_off in dst and the divs of src at offset div_off in dst.
358 * If both sets are actually map, then dim_off applies to the input
361 static void copy_constraint(struct isl_basic_map *dst_map, isl_int *dst,
362 struct isl_basic_map *src_map, isl_int *src,
363 unsigned in_off, unsigned out_off, unsigned div_off)
365 isl_int_set(dst[0], src[0]);
366 isl_seq_cpy(dst+1, src+1, isl_min(dst_map->nparam, src_map->nparam));
367 if (dst_map->nparam > src_map->nparam)
368 isl_seq_clr(dst+1+src_map->nparam,
369 dst_map->nparam - src_map->nparam);
370 isl_seq_clr(dst+1+dst_map->nparam, in_off);
371 isl_seq_cpy(dst+1+dst_map->nparam+in_off,
372 src+1+src_map->nparam,
373 isl_min(dst_map->n_in-in_off, src_map->n_in));
374 if (dst_map->n_in-in_off > src_map->n_in)
375 isl_seq_clr(dst+1+dst_map->nparam+in_off+src_map->n_in,
376 dst_map->n_in - in_off - src_map->n_in);
377 isl_seq_clr(dst+1+dst_map->nparam+dst_map->n_in, out_off);
378 isl_seq_cpy(dst+1+dst_map->nparam+dst_map->n_in+out_off,
379 src+1+src_map->nparam+src_map->n_in,
380 isl_min(dst_map->n_out-out_off, src_map->n_out));
381 if (dst_map->n_out-out_off > src_map->n_out)
382 isl_seq_clr(dst+1+dst_map->nparam+dst_map->n_in+out_off+src_map->n_out,
383 dst_map->n_out - out_off - src_map->n_out);
384 isl_seq_clr(dst+1+dst_map->nparam+dst_map->n_in+dst_map->n_out, div_off);
385 isl_seq_cpy(dst+1+dst_map->nparam+dst_map->n_in+dst_map->n_out+div_off,
386 src+1+src_map->nparam+src_map->n_in+src_map->n_out,
387 isl_min(dst_map->extra-div_off, src_map->extra));
388 if (dst_map->extra-div_off > src_map->extra)
389 isl_seq_clr(dst+1+dst_map->nparam+dst_map->n_in+dst_map->n_out+
390 div_off+src_map->extra,
391 dst_map->extra - div_off - src_map->extra);
394 static void copy_div(struct isl_basic_map *dst_map, isl_int *dst,
395 struct isl_basic_map *src_map, isl_int *src,
396 unsigned in_off, unsigned out_off, unsigned div_off)
398 isl_int_set(dst[0], src[0]);
399 copy_constraint(dst_map, dst+1, src_map, src+1, in_off, out_off, div_off);
402 static struct isl_basic_map *add_constraints(struct isl_basic_map *bmap1,
403 struct isl_basic_map *bmap2, unsigned i_pos, unsigned o_pos)
406 unsigned div_off = bmap1->n_div;
408 for (i = 0; i < bmap2->n_eq; ++i) {
409 int i1 = isl_basic_map_alloc_equality(bmap1);
412 copy_constraint(bmap1, bmap1->eq[i1], bmap2, bmap2->eq[i],
413 i_pos, o_pos, div_off);
416 for (i = 0; i < bmap2->n_ineq; ++i) {
417 int i1 = isl_basic_map_alloc_inequality(bmap1);
420 copy_constraint(bmap1, bmap1->ineq[i1], bmap2, bmap2->ineq[i],
421 i_pos, o_pos, div_off);
424 for (i = 0; i < bmap2->n_div; ++i) {
425 int i1 = isl_basic_map_alloc_div(bmap1);
428 copy_div(bmap1, bmap1->div[i1], bmap2, bmap2->div[i],
429 i_pos, o_pos, div_off);
432 isl_basic_map_free(bmap2);
437 isl_basic_map_free(bmap1);
438 isl_basic_map_free(bmap2);
442 struct isl_basic_map *isl_basic_map_extend(struct isl_basic_map *base,
443 unsigned nparam, unsigned n_in, unsigned n_out, unsigned extra,
444 unsigned n_eq, unsigned n_ineq)
446 struct isl_basic_map *ext;
450 base = isl_basic_map_cow(base);
454 dims_ok = base && base->nparam == nparam &&
455 base->n_in == n_in && base->n_out == n_out &&
456 base->extra >= base->n_div + extra;
458 if (dims_ok && n_eq == 0 && n_ineq == 0)
461 isl_assert(base->ctx, base->nparam <= nparam, goto error);
462 isl_assert(base->ctx, base->n_in <= n_in, goto error);
463 isl_assert(base->ctx, base->n_out <= n_out, goto error);
464 extra += base->extra;
466 n_ineq += base->n_ineq;
468 ext = isl_basic_map_alloc(base->ctx, nparam, n_in, n_out,
469 extra, n_eq, n_ineq);
476 ext = add_constraints(ext, base, 0, 0);
479 F_CLR(ext, ISL_BASIC_SET_FINAL);
485 isl_basic_map_free(base);
489 struct isl_basic_set *isl_basic_set_extend(struct isl_basic_set *base,
490 unsigned nparam, unsigned dim, unsigned extra,
491 unsigned n_eq, unsigned n_ineq)
493 return (struct isl_basic_set *)
494 isl_basic_map_extend((struct isl_basic_map *)base,
495 nparam, 0, dim, extra, n_eq, n_ineq);
498 struct isl_basic_set *isl_basic_set_cow(struct isl_basic_set *bset)
500 return (struct isl_basic_set *)
501 isl_basic_map_cow((struct isl_basic_map *)bset);
504 struct isl_basic_map *isl_basic_map_cow(struct isl_basic_map *bmap)
511 bmap = isl_basic_map_dup(bmap);
513 F_CLR(bmap, ISL_BASIC_SET_FINAL);
517 struct isl_set *isl_set_cow(struct isl_set *set)
525 return isl_set_dup(set);
528 struct isl_map *isl_map_cow(struct isl_map *map)
536 return isl_map_dup(map);
539 static void swap_vars(struct isl_blk blk, isl_int *a,
540 unsigned a_len, unsigned b_len)
542 isl_seq_cpy(blk.data, a+a_len, b_len);
543 isl_seq_cpy(blk.data+b_len, a, a_len);
544 isl_seq_cpy(a, blk.data, b_len+a_len);
547 struct isl_basic_set *isl_basic_set_swap_vars(
548 struct isl_basic_set *bset, unsigned n)
556 isl_assert(bset->ctx, n <= bset->dim, goto error);
561 bset = isl_basic_set_cow(bset);
565 blk = isl_blk_alloc(bset->ctx, bset->dim);
566 if (isl_blk_is_error(blk))
569 for (i = 0; i < bset->n_eq; ++i)
571 bset->eq[i]+1+bset->nparam, n, bset->dim - n);
573 for (i = 0; i < bset->n_ineq; ++i)
575 bset->ineq[i]+1+bset->nparam, n, bset->dim - n);
577 for (i = 0; i < bset->n_div; ++i)
579 bset->div[i]+1+1+bset->nparam, n, bset->dim - n);
581 isl_blk_free(bset->ctx, blk);
586 isl_basic_set_free(bset);
590 struct isl_set *isl_set_swap_vars(struct isl_set *set, unsigned n)
593 set = isl_set_cow(set);
597 for (i = 0; i < set->n; ++i) {
598 set->p[i] = isl_basic_set_swap_vars(set->p[i], n);
607 static void constraint_drop_vars(isl_int *c, unsigned n, unsigned rem)
609 isl_seq_cpy(c, c + n, rem);
610 isl_seq_clr(c + rem, n);
613 struct isl_basic_set *isl_basic_set_drop_dims(
614 struct isl_basic_set *bset, unsigned first, unsigned n)
621 isl_assert(bset->ctx, first + n <= bset->dim, goto error);
626 bset = isl_basic_set_cow(bset);
630 for (i = 0; i < bset->n_eq; ++i)
631 constraint_drop_vars(bset->eq[i]+1+bset->nparam+first, n,
632 (bset->dim-first-n)+bset->extra);
634 for (i = 0; i < bset->n_ineq; ++i)
635 constraint_drop_vars(bset->ineq[i]+1+bset->nparam+first, n,
636 (bset->dim-first-n)+bset->extra);
638 for (i = 0; i < bset->n_div; ++i)
639 constraint_drop_vars(bset->div[i]+1+1+bset->nparam+first, n,
640 (bset->dim-first-n)+bset->extra);
645 return isl_basic_set_finalize(bset);
647 isl_basic_set_free(bset);
651 static struct isl_set *isl_set_drop_dims(
652 struct isl_set *set, unsigned first, unsigned n)
659 isl_assert(set->ctx, first + n <= set->dim, goto error);
663 set = isl_set_cow(set);
667 for (i = 0; i < set->n; ++i) {
668 set->p[i] = isl_basic_set_drop_dims(set->p[i], first, n);
681 * We don't cow, as the div is assumed to be redundant.
683 static struct isl_basic_map *isl_basic_map_drop_div(
684 struct isl_basic_map *bmap, unsigned div)
692 pos = 1 + bmap->nparam + bmap->n_in + bmap->n_out + div;
694 isl_assert(bmap->ctx, div < bmap->n_div, goto error);
696 for (i = 0; i < bmap->n_eq; ++i)
697 constraint_drop_vars(bmap->eq[i]+pos, 1, bmap->extra-div-1);
699 for (i = 0; i < bmap->n_ineq; ++i) {
700 if (!isl_int_is_zero(bmap->ineq[i][pos])) {
701 isl_basic_map_drop_inequality(bmap, i);
705 constraint_drop_vars(bmap->ineq[i]+pos, 1, bmap->extra-div-1);
708 for (i = 0; i < bmap->n_div; ++i)
709 constraint_drop_vars(bmap->div[i]+1+pos, 1, bmap->extra-div-1);
711 if (div != bmap->n_div - 1) {
713 isl_int *t = bmap->div[div];
715 for (j = div; j < bmap->n_div - 1; ++j)
716 bmap->div[j] = bmap->div[j+1];
718 bmap->div[bmap->n_div - 1] = t;
720 isl_basic_map_free_div(bmap, 1);
724 isl_basic_map_free(bmap);
728 static void eliminate_div(struct isl_basic_map *bmap, isl_int *eq, unsigned div)
731 unsigned pos = 1 + bmap->nparam + bmap->n_in + bmap->n_out + div;
733 len = 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
735 for (i = 0; i < bmap->n_eq; ++i)
736 if (bmap->eq[i] != eq)
737 isl_seq_elim(bmap->eq[i], eq, pos, len, NULL);
739 for (i = 0; i < bmap->n_ineq; ++i)
740 isl_seq_elim(bmap->ineq[i], eq, pos, len, NULL);
742 /* We need to be careful about circular definitions,
743 * so for now we just remove the definitions of other divs that
744 * depend on this div and (possibly) recompute them later.
746 for (i = 0; i < bmap->n_div; ++i)
747 if (!isl_int_is_zero(bmap->div[i][0]) &&
748 !isl_int_is_zero(bmap->div[i][1 + pos]))
749 isl_seq_clr(bmap->div[i], 1 + len);
751 isl_basic_map_drop_div(bmap, div);
754 struct isl_basic_map *isl_basic_map_set_to_empty(struct isl_basic_map *bmap)
760 total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->extra;
761 isl_basic_map_free_div(bmap, bmap->n_div);
762 isl_basic_map_free_inequality(bmap, bmap->n_ineq);
764 isl_basic_map_free_equality(bmap, bmap->n_eq-1);
766 isl_basic_map_alloc_equality(bmap);
770 isl_int_set_si(bmap->eq[i][0], 1);
771 isl_seq_clr(bmap->eq[i]+1, total);
772 F_SET(bmap, ISL_BASIC_MAP_EMPTY);
773 return isl_basic_map_finalize(bmap);
775 isl_basic_map_free(bmap);
779 struct isl_basic_set *isl_basic_set_set_to_empty(struct isl_basic_set *bset)
781 return (struct isl_basic_set *)
782 isl_basic_map_set_to_empty((struct isl_basic_map *)bset);
785 static void swap_equality(struct isl_basic_map *bmap, int a, int b)
787 isl_int *t = bmap->eq[a];
788 bmap->eq[a] = bmap->eq[b];
792 static void swap_inequality(struct isl_basic_map *bmap, int a, int b)
794 isl_int *t = bmap->ineq[a];
795 bmap->ineq[a] = bmap->ineq[b];
799 static void swap_div(struct isl_basic_map *bmap, int a, int b)
802 unsigned off = bmap->nparam + bmap->n_in + bmap->n_out;
803 isl_int *t = bmap->div[a];
804 bmap->div[a] = bmap->div[b];
807 for (i = 0; i < bmap->n_eq; ++i)
808 isl_int_swap(bmap->eq[i][1+off+a], bmap->eq[i][1+off+b]);
810 for (i = 0; i < bmap->n_ineq; ++i)
811 isl_int_swap(bmap->ineq[i][1+off+a], bmap->ineq[i][1+off+b]);
813 for (i = 0; i < bmap->n_div; ++i)
814 isl_int_swap(bmap->div[i][1+1+off+a], bmap->div[i][1+1+off+b]);
817 struct isl_basic_map *isl_basic_map_gauss(
818 struct isl_basic_map *bmap, int *progress)
829 total_var = bmap->nparam + bmap->n_in + bmap->n_out;
830 total = total_var + bmap->n_div;
832 last_var = total - 1;
833 for (done = 0; done < bmap->n_eq; ++done) {
834 for (; last_var >= 0; --last_var) {
835 for (k = done; k < bmap->n_eq; ++k)
836 if (!isl_int_is_zero(bmap->eq[k][1+last_var]))
844 swap_equality(bmap, k, done);
845 if (isl_int_is_neg(bmap->eq[done][1+last_var]))
846 isl_seq_neg(bmap->eq[done], bmap->eq[done], 1+total);
848 for (k = 0; k < bmap->n_eq; ++k) {
851 if (isl_int_is_zero(bmap->eq[k][1+last_var]))
855 isl_seq_elim(bmap->eq[k], bmap->eq[done],
856 1+last_var, 1+total, NULL);
859 for (k = 0; k < bmap->n_ineq; ++k) {
860 if (isl_int_is_zero(bmap->ineq[k][1+last_var]))
864 isl_seq_elim(bmap->ineq[k], bmap->eq[done],
865 1+last_var, 1+total, NULL);
868 for (k = 0; k < bmap->n_div; ++k) {
869 if (isl_int_is_zero(bmap->div[k][0]))
871 if (isl_int_is_zero(bmap->div[k][1+1+last_var]))
875 isl_seq_elim(bmap->div[k]+1, bmap->eq[done],
876 1+last_var, 1+total, &bmap->div[k][0]);
879 if (last_var >= total_var &&
880 isl_int_is_zero(bmap->div[last_var - total_var][0])) {
881 unsigned div = last_var - total_var;
882 isl_seq_neg(bmap->div[div]+1, bmap->eq[done], 1+total);
883 isl_int_set_si(bmap->div[div][1+1+last_var], 0);
884 isl_int_set(bmap->div[div][0],
885 bmap->eq[done][1+last_var]);
888 if (done == bmap->n_eq)
890 for (k = done; k < bmap->n_eq; ++k) {
891 if (isl_int_is_zero(bmap->eq[k][0]))
893 return isl_basic_map_set_to_empty(bmap);
895 isl_basic_map_free_equality(bmap, bmap->n_eq-done);
899 struct isl_basic_set *isl_basic_set_gauss(
900 struct isl_basic_set *bset, int *progress)
902 return (struct isl_basic_set*)isl_basic_map_gauss(
903 (struct isl_basic_map *)bset, progress);
906 static unsigned int round_up(unsigned int v)
917 static int hash_index(int *index, unsigned int size, int bits,
918 struct isl_basic_map *bmap, int k)
921 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
922 u_int32_t hash = isl_seq_hash(bmap->ineq[k]+1, total, bits);
923 for (h = hash; index[h]; h = (h+1) % size)
924 if (k != index[h]-1 &&
925 isl_seq_eq(bmap->ineq[k]+1,
926 bmap->ineq[index[h]-1]+1, total))
931 static struct isl_basic_map *remove_duplicate_constraints(
932 struct isl_basic_map *bmap, int *progress)
938 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
941 if (bmap->n_ineq <= 1)
944 size = round_up(4 * (bmap->n_ineq+1) / 3 - 1);
945 bits = ffs(size) - 1;
946 index = isl_alloc_array(ctx, int, size);
947 memset(index, 0, size * sizeof(int));
951 index[isl_seq_hash(bmap->ineq[0]+1, total, bits)] = 1;
952 for (k = 1; k < bmap->n_ineq; ++k) {
953 h = hash_index(index, size, bits, bmap, k);
960 if (isl_int_lt(bmap->ineq[k][0], bmap->ineq[l][0]))
961 swap_inequality(bmap, k, l);
962 isl_basic_map_drop_inequality(bmap, k);
966 for (k = 0; k < bmap->n_ineq-1; ++k) {
967 isl_seq_neg(bmap->ineq[k]+1, bmap->ineq[k]+1, total);
968 h = hash_index(index, size, bits, bmap, k);
969 isl_seq_neg(bmap->ineq[k]+1, bmap->ineq[k]+1, total);
973 isl_int_add(sum, bmap->ineq[k][0], bmap->ineq[l][0]);
974 if (isl_int_is_pos(sum))
976 if (isl_int_is_zero(sum)) {
977 /* We need to break out of the loop after these
978 * changes since the contents of the hash
979 * will no longer be valid.
980 * Plus, we probably we want to regauss first.
982 isl_basic_map_drop_inequality(bmap, l);
983 isl_basic_map_inequality_to_equality(bmap, k);
985 bmap = isl_basic_map_set_to_empty(bmap);
994 static struct isl_basic_map *remove_duplicate_divs(
995 struct isl_basic_map *bmap, int *progress)
1002 unsigned total_var = bmap->nparam + bmap->n_in + bmap->n_out;
1003 unsigned total = total_var + bmap->n_div;
1004 struct isl_ctx *ctx;
1006 if (bmap->n_div <= 1)
1010 for (k = bmap->n_div - 1; k >= 0; --k)
1011 if (!isl_int_is_zero(bmap->div[k][0]))
1016 size = round_up(4 * bmap->n_div / 3 - 1);
1017 bits = ffs(size) - 1;
1018 index = isl_alloc_array(ctx, int, size);
1019 memset(index, 0, size * sizeof(int));
1022 eq = isl_blk_alloc(ctx, 1+total);
1023 if (isl_blk_is_error(eq))
1026 isl_seq_clr(eq.data, 1+total);
1027 index[isl_seq_hash(bmap->div[k], 2+total, bits)] = k + 1;
1028 for (--k; k >= 0; --k) {
1031 if (isl_int_is_zero(bmap->div[k][0]))
1034 hash = isl_seq_hash(bmap->div[k], 2+total, bits);
1035 for (h = hash; index[h]; h = (h+1) % size)
1036 if (isl_seq_eq(bmap->div[k],
1037 bmap->div[index[h]-1], 2+total))
1042 isl_int_set_si(eq.data[1+total_var+k], -1);
1043 isl_int_set_si(eq.data[1+total_var+l], 1);
1044 eliminate_div(bmap, eq.data, l);
1045 isl_int_set_si(eq.data[1+total_var+k], 0);
1046 isl_int_set_si(eq.data[1+total_var+l], 0);
1051 isl_blk_free(ctx, eq);
1057 /* Elimininate divs based on equalities
1059 static struct isl_basic_map *eliminate_divs_eq(
1060 struct isl_basic_map *bmap, int *progress)
1070 off = 1 + bmap->nparam + bmap->n_in + bmap->n_out;
1072 for (d = bmap->n_div - 1; d >= 0 ; --d) {
1073 for (i = 0; i < bmap->n_eq; ++i) {
1074 if (!isl_int_is_one(bmap->eq[i][off + d]) &&
1075 !isl_int_is_negone(bmap->eq[i][off + d]))
1079 eliminate_div(bmap, bmap->eq[i], d);
1080 isl_basic_map_drop_equality(bmap, i);
1085 return eliminate_divs_eq(bmap, progress);
1089 static struct isl_basic_map *normalize_constraints(struct isl_basic_map *bmap)
1093 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
1096 for (i = bmap->n_eq - 1; i >= 0; --i) {
1097 isl_seq_gcd(bmap->eq[i]+1, total, &gcd);
1098 if (isl_int_is_zero(gcd)) {
1099 if (!isl_int_is_zero(bmap->eq[i][0])) {
1100 bmap = isl_basic_map_set_to_empty(bmap);
1103 isl_basic_map_drop_equality(bmap, i);
1106 if (F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL))
1107 isl_int_gcd(gcd, gcd, bmap->eq[i][0]);
1108 if (isl_int_is_one(gcd))
1110 if (!isl_int_is_divisible_by(bmap->eq[i][0], gcd)) {
1111 bmap = isl_basic_map_set_to_empty(bmap);
1114 isl_seq_scale_down(bmap->eq[i], bmap->eq[i], gcd, 1+total);
1117 for (i = bmap->n_ineq - 1; i >= 0; --i) {
1118 isl_seq_gcd(bmap->ineq[i]+1, total, &gcd);
1119 if (isl_int_is_zero(gcd)) {
1120 if (isl_int_is_neg(bmap->ineq[i][0])) {
1121 bmap = isl_basic_map_set_to_empty(bmap);
1124 isl_basic_map_drop_inequality(bmap, i);
1127 if (F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL))
1128 isl_int_gcd(gcd, gcd, bmap->ineq[i][0]);
1129 if (isl_int_is_one(gcd))
1131 isl_int_fdiv_q(bmap->ineq[i][0], bmap->ineq[i][0], gcd);
1132 isl_seq_scale_down(bmap->ineq[i]+1, bmap->ineq[i]+1, gcd, total);
1140 /* Eliminate the specified variables from the constraints using
1141 * Fourier-Motzkin. The variables themselves are not removed.
1143 struct isl_basic_map *isl_basic_map_eliminate_vars(
1144 struct isl_basic_map *bmap, int pos, unsigned n)
1153 total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
1154 extra = bmap->extra - bmap->n_div;
1156 bmap = isl_basic_map_cow(bmap);
1157 bmap = isl_basic_map_gauss(bmap, NULL);
1158 for (d = pos + n - 1; d >= pos; --d) {
1159 int n_lower, n_upper;
1162 for (i = 0; i < bmap->n_eq; ++i) {
1163 if (isl_int_is_zero(bmap->eq[i][1+d]))
1165 isl_basic_map_drop_equality(bmap, i);
1172 for (i = 0; i < bmap->n_ineq; ++i) {
1173 if (isl_int_is_pos(bmap->ineq[i][1+d]))
1175 else if (isl_int_is_neg(bmap->ineq[i][1+d]))
1178 bmap = isl_basic_map_extend(bmap,
1179 bmap->nparam, bmap->n_in, bmap->n_out, 0,
1180 0, n_lower * n_upper);
1181 for (i = bmap->n_ineq - 1; i >= 0; --i) {
1183 if (isl_int_is_zero(bmap->ineq[i][1+d]))
1186 for (j = 0; j < i; ++j) {
1187 if (isl_int_is_zero(bmap->ineq[j][1+d]))
1190 if (isl_int_sgn(bmap->ineq[i][1+d]) ==
1191 isl_int_sgn(bmap->ineq[j][1+d]))
1193 k = isl_basic_map_alloc_inequality(bmap);
1196 isl_seq_cpy(bmap->ineq[k], bmap->ineq[i],
1198 isl_seq_clr(bmap->ineq[k]+1+total, extra);
1199 isl_seq_elim(bmap->ineq[k], bmap->ineq[j],
1200 1+d, 1+total, NULL);
1202 isl_basic_map_drop_inequality(bmap, i);
1205 if (n_lower > 0 && n_upper > 0) {
1206 bmap = normalize_constraints(bmap);
1207 bmap = isl_basic_map_gauss(bmap, NULL);
1208 if (F_ISSET(bmap, ISL_BASIC_MAP_EMPTY))
1214 isl_basic_map_free(bmap);
1218 struct isl_basic_set *isl_basic_set_eliminate_vars(
1219 struct isl_basic_set *bset, unsigned pos, unsigned n)
1221 return (struct isl_basic_set *)isl_basic_map_eliminate_vars(
1222 (struct isl_basic_map *)bset, pos, n);
1225 /* Project out n dimensions starting at first using Fourier-Motzkin */
1226 struct isl_set *isl_set_remove_dims(struct isl_set *set,
1227 unsigned first, unsigned n)
1234 set = isl_set_cow(set);
1237 isl_assert(set->ctx, first+n <= set->dim, goto error);
1239 for (i = 0; i < set->n; ++i) {
1240 set->p[i] = isl_basic_set_eliminate_vars(set->p[i],
1241 set->nparam + first, n);
1245 set = isl_set_drop_dims(set, first, n);
1252 /* Project out n dimensions starting at first using Fourier-Motzkin */
1253 struct isl_basic_set *isl_basic_set_remove_dims(struct isl_basic_set *bset,
1254 unsigned first, unsigned n)
1256 bset = isl_basic_set_eliminate_vars(bset, bset->nparam + first, n);
1257 bset = isl_basic_set_drop_dims(bset, first, n);
1261 /* Elimininate divs based on inequalities
1263 static struct isl_basic_map *eliminate_divs_ineq(
1264 struct isl_basic_map *bmap, int *progress)
1269 struct isl_ctx *ctx;
1275 off = 1 + bmap->nparam + bmap->n_in + bmap->n_out;
1277 for (d = bmap->n_div - 1; d >= 0 ; --d) {
1278 for (i = 0; i < bmap->n_eq; ++i)
1279 if (!isl_int_is_zero(bmap->eq[i][off + d]))
1283 for (i = 0; i < bmap->n_ineq; ++i)
1284 if (isl_int_abs_gt(bmap->ineq[i][off + d], ctx->one))
1286 if (i < bmap->n_ineq)
1289 bmap = isl_basic_map_eliminate_vars(bmap, (off-1)+d, 1);
1290 if (F_ISSET(bmap, ISL_BASIC_MAP_EMPTY))
1292 bmap = isl_basic_map_drop_div(bmap, d);
1299 struct isl_basic_map *isl_basic_map_simplify(struct isl_basic_map *bmap)
1306 bmap = normalize_constraints(bmap);
1307 bmap = eliminate_divs_eq(bmap, &progress);
1308 bmap = eliminate_divs_ineq(bmap, &progress);
1309 bmap = isl_basic_map_gauss(bmap, &progress);
1310 bmap = remove_duplicate_divs(bmap, &progress);
1311 bmap = remove_duplicate_constraints(bmap, &progress);
1316 struct isl_basic_set *isl_basic_set_simplify(struct isl_basic_set *bset)
1318 return (struct isl_basic_set *)
1319 isl_basic_map_simplify((struct isl_basic_map *)bset);
1322 static void dump_term(struct isl_basic_map *bmap,
1323 isl_int c, int pos, FILE *out)
1325 unsigned in = bmap->n_in;
1326 unsigned dim = bmap->n_in + bmap->n_out;
1328 isl_int_print(out, c);
1330 if (!isl_int_is_one(c))
1331 isl_int_print(out, c);
1332 if (pos < 1 + bmap->nparam)
1333 fprintf(out, "p%d", pos - 1);
1334 else if (pos < 1 + bmap->nparam + in)
1335 fprintf(out, "i%d", pos - 1 - bmap->nparam);
1336 else if (pos < 1 + bmap->nparam + dim)
1337 fprintf(out, "o%d", pos - 1 - bmap->nparam - in);
1339 fprintf(out, "e%d", pos - 1 - bmap->nparam - dim);
1343 static void dump_constraint_sign(struct isl_basic_map *bmap, isl_int *c,
1344 int sign, FILE *out)
1348 unsigned len = 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
1352 for (i = 0, first = 1; i < len; ++i) {
1353 if (isl_int_sgn(c[i]) * sign <= 0)
1356 fprintf(out, " + ");
1358 isl_int_abs(v, c[i]);
1359 dump_term(bmap, v, i, out);
1366 static void dump_constraint(struct isl_basic_map *bmap, isl_int *c,
1367 const char *op, FILE *out, int indent)
1371 fprintf(out, "%*s", indent, "");
1373 dump_constraint_sign(bmap, c, 1, out);
1374 fprintf(out, " %s ", op);
1375 dump_constraint_sign(bmap, c, -1, out);
1379 for (i = bmap->n_div; i < bmap->extra; ++i) {
1380 if (isl_int_is_zero(c[1+bmap->nparam+bmap->n_in+bmap->n_out+i]))
1382 fprintf(out, "%*s", indent, "");
1383 fprintf(out, "ERROR: unused div coefficient not zero\n");
1387 static void dump_constraints(struct isl_basic_map *bmap,
1388 isl_int **c, unsigned n,
1389 const char *op, FILE *out, int indent)
1393 for (i = 0; i < n; ++i)
1394 dump_constraint(bmap, c[i], op, out, indent);
1397 static void dump_affine(struct isl_basic_map *bmap, isl_int *exp, FILE *out)
1401 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
1403 for (j = 0; j < 1 + total; ++j) {
1404 if (isl_int_is_zero(exp[j]))
1406 if (!first && isl_int_is_pos(exp[j]))
1408 dump_term(bmap, exp[j], j, out);
1413 static void dump(struct isl_basic_map *bmap, FILE *out, int indent)
1417 dump_constraints(bmap, bmap->eq, bmap->n_eq, "=", out, indent);
1418 dump_constraints(bmap, bmap->ineq, bmap->n_ineq, ">=", out, indent);
1420 for (i = 0; i < bmap->n_div; ++i) {
1421 fprintf(out, "%*s", indent, "");
1422 fprintf(out, "e%d = [(", i);
1423 dump_affine(bmap, bmap->div[i]+1, out);
1425 isl_int_print(out, bmap->div[i][0]);
1426 fprintf(out, "]\n");
1430 void isl_basic_set_dump(struct isl_basic_set *bset, FILE *out, int indent)
1433 fprintf(out, "null basic set\n");
1437 fprintf(out, "%*s", indent, "");
1438 fprintf(out, "ref: %d, nparam: %d, dim: %d, extra: %d\n",
1439 bset->ref, bset->nparam, bset->dim, bset->extra);
1440 dump((struct isl_basic_map *)bset, out, indent);
1443 void isl_basic_map_dump(struct isl_basic_map *bmap, FILE *out, int indent)
1446 fprintf(out, "null basic map\n");
1450 fprintf(out, "%*s", indent, "");
1451 fprintf(out, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, flags: %x\n",
1453 bmap->nparam, bmap->n_in, bmap->n_out, bmap->extra, bmap->flags);
1454 dump(bmap, out, indent);
1457 int isl_inequality_negate(struct isl_basic_map *bmap, unsigned pos)
1459 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
1462 isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
1463 isl_seq_neg(bmap->ineq[pos], bmap->ineq[pos], 1 + total);
1464 isl_int_sub_ui(bmap->ineq[pos][0], bmap->ineq[pos][0], 1);
1468 struct isl_set *isl_set_alloc(struct isl_ctx *ctx,
1469 unsigned nparam, unsigned dim, int n, unsigned flags)
1471 struct isl_set *set;
1473 isl_assert(ctx, n >= 0, return NULL);
1474 set = isl_alloc(ctx, struct isl_set,
1475 sizeof(struct isl_set) +
1476 n * sizeof(struct isl_basic_set *));
1485 set->nparam = nparam;
1492 struct isl_set *isl_set_dup(struct isl_set *set)
1495 struct isl_set *dup;
1500 dup = isl_set_alloc(set->ctx, set->nparam, set->dim, set->n, set->flags);
1503 for (i = 0; i < set->n; ++i)
1504 dup = isl_set_add(dup,
1505 isl_basic_set_dup(set->p[i]));
1509 struct isl_set *isl_set_from_basic_set(struct isl_basic_set *bset)
1511 struct isl_set *set;
1516 set = isl_set_alloc(bset->ctx, bset->nparam, bset->dim, 1, ISL_MAP_DISJOINT);
1518 isl_basic_set_free(bset);
1521 return isl_set_add(set, bset);
1524 struct isl_map *isl_map_from_basic_map(struct isl_basic_map *bmap)
1526 struct isl_map *map;
1531 map = isl_map_alloc(bmap->ctx, bmap->nparam, bmap->n_in, bmap->n_out, 1,
1534 isl_basic_map_free(bmap);
1537 return isl_map_add(map, bmap);
1540 struct isl_set *isl_set_add(struct isl_set *set, struct isl_basic_set *bset)
1544 isl_assert(set->ctx, set->nparam == bset->nparam, goto error);
1545 isl_assert(set->ctx, set->dim == bset->dim, goto error);
1546 isl_assert(set->ctx, set->n < set->size, goto error);
1547 set->p[set->n] = bset;
1554 isl_basic_set_free(bset);
1558 void isl_set_free(struct isl_set *set)
1568 isl_ctx_deref(set->ctx);
1569 for (i = 0; i < set->n; ++i)
1570 isl_basic_set_free(set->p[i]);
1574 void isl_set_dump(struct isl_set *set, FILE *out, int indent)
1579 fprintf(out, "null set\n");
1583 fprintf(out, "%*s", indent, "");
1584 fprintf(out, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
1585 set->ref, set->n, set->nparam, set->dim, set->flags);
1586 for (i = 0; i < set->n; ++i) {
1587 fprintf(out, "%*s", indent, "");
1588 fprintf(out, "basic set %d:\n", i);
1589 isl_basic_set_dump(set->p[i], out, indent+4);
1593 void isl_map_dump(struct isl_map *map, FILE *out, int indent)
1598 fprintf(out, "null map\n");
1602 fprintf(out, "%*s", indent, "");
1603 fprintf(out, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, flags: %x\n",
1604 map->ref, map->n, map->nparam, map->n_in, map->n_out,
1606 for (i = 0; i < map->n; ++i) {
1607 fprintf(out, "%*s", indent, "");
1608 fprintf(out, "basic map %d:\n", i);
1609 isl_basic_map_dump(map->p[i], out, indent+4);
1613 struct isl_basic_map *isl_basic_map_intersect_domain(
1614 struct isl_basic_map *bmap, struct isl_basic_set *bset)
1616 struct isl_basic_map *bmap_domain;
1621 isl_assert(bset->ctx, bset->dim == bmap->n_in, goto error);
1622 isl_assert(bset->ctx, bset->nparam == bmap->nparam, goto error);
1624 bmap = isl_basic_map_extend(bmap,
1625 bset->nparam, bmap->n_in, bmap->n_out,
1626 bset->n_div, bset->n_eq, bset->n_ineq);
1629 bmap_domain = isl_basic_map_from_basic_set(bset,
1631 bmap = add_constraints(bmap, bmap_domain, 0, 0);
1633 bmap = isl_basic_map_simplify(bmap);
1634 return isl_basic_map_finalize(bmap);
1636 isl_basic_map_free(bmap);
1637 isl_basic_set_free(bset);
1641 struct isl_basic_map *isl_basic_map_intersect_range(
1642 struct isl_basic_map *bmap, struct isl_basic_set *bset)
1644 struct isl_basic_map *bmap_range;
1649 isl_assert(bset->ctx, bset->dim == bmap->n_out, goto error);
1650 isl_assert(bset->ctx, bset->nparam == bmap->nparam, goto error);
1652 bmap = isl_basic_map_extend(bmap,
1653 bset->nparam, bmap->n_in, bmap->n_out,
1654 bset->n_div, bset->n_eq, bset->n_ineq);
1657 bmap_range = isl_basic_map_from_basic_set(bset,
1659 bmap = add_constraints(bmap, bmap_range, 0, 0);
1661 bmap = isl_basic_map_simplify(bmap);
1662 return isl_basic_map_finalize(bmap);
1664 isl_basic_map_free(bmap);
1665 isl_basic_set_free(bset);
1669 struct isl_basic_map *isl_basic_map_intersect(
1670 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
1672 if (!bmap1 || !bmap2)
1675 isl_assert(bmap1->ctx, bmap1->nparam == bmap2->nparam, goto error);
1676 isl_assert(bmap1->ctx, bmap1->n_in == bmap2->n_in, goto error);
1677 isl_assert(bmap1->ctx, bmap1->n_out == bmap2->n_out, goto error);
1679 bmap1 = isl_basic_map_extend(bmap1,
1680 bmap1->nparam, bmap1->n_in, bmap1->n_out,
1681 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
1684 bmap1 = add_constraints(bmap1, bmap2, 0, 0);
1686 bmap1 = isl_basic_map_simplify(bmap1);
1687 return isl_basic_map_finalize(bmap1);
1689 isl_basic_map_free(bmap1);
1690 isl_basic_map_free(bmap2);
1694 struct isl_basic_set *isl_basic_set_intersect(
1695 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
1697 return (struct isl_basic_set *)
1698 isl_basic_map_intersect(
1699 (struct isl_basic_map *)bset1,
1700 (struct isl_basic_map *)bset2);
1703 struct isl_map *isl_map_intersect(struct isl_map *map1, struct isl_map *map2)
1706 struct isl_map *result;
1712 if (F_ISSET(map1, ISL_MAP_DISJOINT) &&
1713 F_ISSET(map2, ISL_MAP_DISJOINT))
1714 FL_SET(flags, ISL_MAP_DISJOINT);
1716 result = isl_map_alloc(map1->ctx, map1->nparam, map1->n_in, map1->n_out,
1717 map1->n * map2->n, flags);
1720 for (i = 0; i < map1->n; ++i)
1721 for (j = 0; j < map2->n; ++j) {
1722 struct isl_basic_map *part;
1723 part = isl_basic_map_intersect(
1724 isl_basic_map_copy(map1->p[i]),
1725 isl_basic_map_copy(map2->p[j]));
1726 if (isl_basic_map_is_empty(part))
1727 isl_basic_map_free(part);
1729 result = isl_map_add(result, part);
1742 struct isl_set *isl_set_intersect(struct isl_set *set1, struct isl_set *set2)
1744 return (struct isl_set *)
1745 isl_map_intersect((struct isl_map *)set1,
1746 (struct isl_map *)set2);
1749 struct isl_basic_map *isl_basic_map_reverse(struct isl_basic_map *bmap)
1751 struct isl_basic_set *bset;
1756 bmap = isl_basic_map_cow(bmap);
1760 bset = isl_basic_set_from_basic_map(bmap);
1761 bset = isl_basic_set_swap_vars(bset, in);
1762 return isl_basic_map_from_basic_set(bset, bset->dim-in, in);
1765 /* Turn final n dimensions into existentially quantified variables.
1767 struct isl_basic_set *isl_basic_set_project_out(
1768 struct isl_basic_set *bset, unsigned n, unsigned flags)
1778 isl_assert(bset->ctx, n <= bset->dim, goto error);
1783 bset = isl_basic_set_cow(bset);
1785 row_size = 1 + bset->nparam + bset->dim + bset->extra;
1786 old = bset->block2.data;
1787 bset->block2 = isl_blk_extend(bset->ctx, bset->block2,
1788 (bset->extra + n) * (1 + row_size));
1789 if (!bset->block2.data)
1791 new_div = isl_alloc_array(ctx, isl_int *, bset->extra + n);
1794 for (i = 0; i < n; ++i) {
1795 new_div[i] = bset->block2.data +
1796 (bset->extra + i) * (1 + row_size);
1797 isl_seq_clr(new_div[i], 1 + row_size);
1799 for (i = 0; i < bset->extra; ++i)
1800 new_div[n + i] = bset->block2.data + (bset->div[i] - old);
1802 bset->div = new_div;
1806 bset = isl_basic_set_simplify(bset);
1807 return isl_basic_set_finalize(bset);
1809 isl_basic_set_free(bset);
1813 struct isl_basic_map *isl_basic_map_apply_range(
1814 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
1816 struct isl_basic_set *bset;
1817 unsigned n_in, n_out;
1819 if (!bmap1 || !bmap2)
1822 isl_assert(bmap->ctx, bmap1->n_out == bmap2->n_in, goto error);
1823 isl_assert(bmap->ctx, bmap1->nparam == bmap2->nparam, goto error);
1826 n_out = bmap2->n_out;
1828 bmap2 = isl_basic_map_reverse(bmap2);
1831 bmap1 = isl_basic_map_extend(bmap1, bmap1->nparam,
1832 bmap1->n_in + bmap2->n_in, bmap1->n_out,
1833 bmap2->extra, bmap2->n_eq, bmap2->n_ineq);
1836 bmap1 = add_constraints(bmap1, bmap2, bmap1->n_in - bmap2->n_in, 0);
1837 bmap1 = isl_basic_map_simplify(bmap1);
1838 bset = isl_basic_set_from_basic_map(bmap1);
1839 bset = isl_basic_set_project_out(bset,
1840 bset->dim - (n_in + n_out), 0);
1841 return isl_basic_map_from_basic_set(bset, n_in, n_out);
1843 isl_basic_map_free(bmap1);
1844 isl_basic_map_free(bmap2);
1848 struct isl_basic_set *isl_basic_set_apply(
1849 struct isl_basic_set *bset, struct isl_basic_map *bmap)
1854 isl_assert(bset->ctx, bset->dim == bmap->n_in, goto error);
1856 return (struct isl_basic_set *)
1857 isl_basic_map_apply_range((struct isl_basic_map *)bset, bmap);
1859 isl_basic_set_free(bset);
1860 isl_basic_map_free(bmap);
1864 struct isl_basic_map *isl_basic_map_apply_domain(
1865 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
1867 if (!bmap1 || !bmap2)
1870 isl_assert(ctx, bmap1->n_in == bmap2->n_in, goto error);
1871 isl_assert(ctx, bmap1->nparam == bmap2->nparam, goto error);
1873 bmap1 = isl_basic_map_reverse(bmap1);
1874 bmap1 = isl_basic_map_apply_range(bmap1, bmap2);
1875 return isl_basic_map_reverse(bmap1);
1877 isl_basic_map_free(bmap1);
1878 isl_basic_map_free(bmap2);
1882 static struct isl_basic_map *var_equal(struct isl_ctx *ctx,
1883 struct isl_basic_map *bmap, unsigned pos)
1886 i = isl_basic_map_alloc_equality(bmap);
1889 isl_seq_clr(bmap->eq[i],
1890 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->extra);
1891 isl_int_set_si(bmap->eq[i][1+bmap->nparam+pos], -1);
1892 isl_int_set_si(bmap->eq[i][1+bmap->nparam+bmap->n_in+pos], 1);
1893 return isl_basic_map_finalize(bmap);
1895 isl_basic_map_free(bmap);
1899 static struct isl_basic_map *var_more(struct isl_ctx *ctx,
1900 struct isl_basic_map *bmap, unsigned pos)
1903 i = isl_basic_map_alloc_inequality(bmap);
1906 isl_seq_clr(bmap->ineq[i],
1907 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->extra);
1908 isl_int_set_si(bmap->ineq[i][0], -1);
1909 isl_int_set_si(bmap->ineq[i][1+bmap->nparam+pos], -1);
1910 isl_int_set_si(bmap->ineq[i][1+bmap->nparam+bmap->n_in+pos], 1);
1911 return isl_basic_map_finalize(bmap);
1913 isl_basic_map_free(bmap);
1917 static struct isl_basic_map *var_less(struct isl_ctx *ctx,
1918 struct isl_basic_map *bmap, unsigned pos)
1921 i = isl_basic_map_alloc_inequality(bmap);
1924 isl_seq_clr(bmap->ineq[i],
1925 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->extra);
1926 isl_int_set_si(bmap->ineq[i][0], -1);
1927 isl_int_set_si(bmap->ineq[i][1+bmap->nparam+pos], 1);
1928 isl_int_set_si(bmap->ineq[i][1+bmap->nparam+bmap->n_in+pos], -1);
1929 return isl_basic_map_finalize(bmap);
1931 isl_basic_map_free(bmap);
1935 struct isl_basic_map *isl_basic_map_equal(struct isl_ctx *ctx,
1936 unsigned nparam, unsigned in, unsigned out, unsigned n_equal)
1939 struct isl_basic_map *bmap;
1940 bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, n_equal, 0);
1943 for (i = 0; i < n_equal && bmap; ++i)
1944 bmap = var_equal(ctx, bmap, i);
1945 return isl_basic_map_finalize(bmap);
1948 struct isl_basic_map *isl_basic_map_less_at(struct isl_ctx *ctx,
1949 unsigned nparam, unsigned in, unsigned out, unsigned pos)
1952 struct isl_basic_map *bmap;
1953 bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, pos, 1);
1956 for (i = 0; i < pos && bmap; ++i)
1957 bmap = var_equal(ctx, bmap, i);
1959 bmap = var_less(ctx, bmap, pos);
1960 return isl_basic_map_finalize(bmap);
1963 struct isl_basic_map *isl_basic_map_more_at(struct isl_ctx *ctx,
1964 unsigned nparam, unsigned in, unsigned out, unsigned pos)
1967 struct isl_basic_map *bmap;
1968 bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, pos, 1);
1971 for (i = 0; i < pos && bmap; ++i)
1972 bmap = var_equal(ctx, bmap, i);
1974 bmap = var_more(ctx, bmap, pos);
1975 return isl_basic_map_finalize(bmap);
1978 struct isl_basic_map *isl_basic_map_from_basic_set(
1979 struct isl_basic_set *bset, unsigned n_in, unsigned n_out)
1981 struct isl_basic_map *bmap;
1983 bset = isl_basic_set_cow(bset);
1987 isl_assert(ctx, bset->dim == n_in + n_out, goto error);
1988 bmap = (struct isl_basic_map *) bset;
1990 bmap->n_out = n_out;
1991 return isl_basic_map_finalize(bmap);
1993 isl_basic_set_free(bset);
1997 struct isl_basic_set *isl_basic_set_from_basic_map(struct isl_basic_map *bmap)
2001 if (bmap->n_in == 0)
2002 return (struct isl_basic_set *)bmap;
2003 bmap = isl_basic_map_cow(bmap);
2006 bmap->n_out += bmap->n_in;
2008 bmap = isl_basic_map_finalize(bmap);
2009 return (struct isl_basic_set *)bmap;
2014 /* For a div d = floor(f/m), add the constraints
2017 * -(f-(n-1)) + m d >= 0
2019 * Note that the second constraint is the negation of
2023 static int add_div_constraints(struct isl_basic_map *bmap, unsigned div)
2026 unsigned div_pos = 1 + bmap->nparam + bmap->n_in + bmap->n_out + div;
2027 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->extra;
2029 i = isl_basic_map_alloc_inequality(bmap);
2032 isl_seq_cpy(bmap->ineq[i], bmap->div[div]+1, 1+total);
2033 isl_int_neg(bmap->ineq[i][div_pos], bmap->div[div][0]);
2035 j = isl_basic_map_alloc_inequality(bmap);
2038 isl_seq_neg(bmap->ineq[j], bmap->ineq[i], 1 + total);
2039 isl_int_add(bmap->ineq[j][0], bmap->ineq[j][0], bmap->ineq[j][div_pos]);
2040 isl_int_sub_ui(bmap->ineq[j][0], bmap->ineq[j][0], 1);
2044 struct isl_basic_set *isl_basic_map_underlying_set(
2045 struct isl_basic_map *bmap)
2049 if (bmap->nparam == 0 && bmap->n_in == 0 && bmap->n_div == 0)
2050 return (struct isl_basic_set *)bmap;
2051 bmap = isl_basic_map_cow(bmap);
2054 bmap->n_out += bmap->nparam + bmap->n_in + bmap->n_div;
2057 bmap->extra -= bmap->n_div;
2059 bmap = isl_basic_map_finalize(bmap);
2060 return (struct isl_basic_set *)bmap;
2065 struct isl_basic_map *isl_basic_map_overlying_set(
2066 struct isl_basic_set *bset, struct isl_basic_map *like)
2068 struct isl_basic_map *bmap;
2069 struct isl_ctx *ctx;
2076 isl_assert(ctx, bset->dim ==
2077 like->nparam + like->n_in + like->n_out + like->n_div,
2079 if (like->nparam == 0 && like->n_in == 0 && like->n_div == 0) {
2080 isl_basic_map_free(like);
2081 return (struct isl_basic_map *)bset;
2083 bset = isl_basic_set_cow(bset);
2086 total = bset->dim + bset->extra;
2087 bmap = (struct isl_basic_map *)bset;
2088 bmap->nparam = like->nparam;
2089 bmap->n_in = like->n_in;
2090 bmap->n_out = like->n_out;
2091 bmap->extra += like->n_div;
2094 ltotal = total - bmap->extra + like->extra;
2097 bmap->block2 = isl_blk_extend(ctx, bmap->block2,
2098 bmap->extra * (1 + 1 + total));
2099 if (isl_blk_is_error(bmap->block2))
2101 bmap->div = isl_realloc_array(ctx, bmap->div, isl_int *,
2105 bmap = isl_basic_map_extend(bmap, bmap->nparam,
2106 bmap->n_in, bmap->n_out, 0, 0, 2 * like->n_div);
2107 for (i = 0; i < like->n_div; ++i) {
2108 k = isl_basic_map_alloc_div(bmap);
2111 isl_seq_cpy(bmap->div[k], like->div[i], 1 + 1 + ltotal);
2112 isl_seq_clr(bmap->div[k]+1+1+ltotal, total - ltotal);
2113 if (add_div_constraints(bmap, k) < 0)
2117 isl_basic_map_free(like);
2118 bmap = isl_basic_map_finalize(bmap);
2121 isl_basic_map_free(like);
2122 isl_basic_set_free(bset);
2126 struct isl_basic_set *isl_basic_set_from_underlying_set(
2127 struct isl_basic_set *bset, struct isl_basic_set *like)
2129 return (struct isl_basic_set *)
2130 isl_basic_map_overlying_set(bset, (struct isl_basic_map *)like);
2133 struct isl_set *isl_set_from_underlying_set(
2134 struct isl_set *set, struct isl_basic_set *like)
2140 isl_assert(set->ctx, set->dim == like->nparam + like->dim + like->n_div,
2142 if (like->nparam == 0 && like->n_div == 0) {
2143 isl_basic_set_free(like);
2146 set = isl_set_cow(set);
2149 for (i = 0; i < set->n; ++i) {
2150 set->p[i] = isl_basic_set_from_underlying_set(set->p[i],
2151 isl_basic_set_copy(like));
2155 set->nparam = like->nparam;
2156 set->dim = like->dim;
2157 isl_basic_set_free(like);
2160 isl_basic_set_free(like);
2165 struct isl_set *isl_map_underlying_set(struct isl_map *map)
2169 map = isl_map_align_divs(map);
2170 map = isl_map_cow(map);
2174 for (i = 0; i < map->n; ++i) {
2175 map->p[i] = (struct isl_basic_map *)
2176 isl_basic_map_underlying_set(map->p[i]);
2181 map->n_out += map->nparam + map->n_in;
2183 map->n_out = map->p[0]->n_out;
2186 return (struct isl_set *)map;
2192 struct isl_set *isl_set_to_underlying_set(struct isl_set *set)
2194 return (struct isl_set *)isl_map_underlying_set((struct isl_map *)set);
2197 struct isl_basic_set *isl_basic_map_domain(struct isl_basic_map *bmap)
2199 struct isl_basic_set *domain;
2203 n_out = bmap->n_out;
2204 domain = isl_basic_set_from_basic_map(bmap);
2205 return isl_basic_set_project_out(domain, n_out, 0);
2208 struct isl_basic_set *isl_basic_map_range(struct isl_basic_map *bmap)
2210 return isl_basic_map_domain(isl_basic_map_reverse(bmap));
2213 struct isl_set *isl_map_range(struct isl_map *map)
2216 struct isl_set *set;
2220 map = isl_map_cow(map);
2224 set = (struct isl_set *) map;
2226 for (i = 0; i < map->n; ++i) {
2227 set->p[i] = isl_basic_map_range(map->p[i]);
2231 F_CLR(set, ISL_MAP_DISJOINT);
2238 struct isl_map *isl_map_from_set(struct isl_set *set,
2239 unsigned n_in, unsigned n_out)
2242 struct isl_map *map = NULL;
2246 isl_assert(set->ctx, set->dim == n_in + n_out, goto error);
2247 set = isl_set_cow(set);
2250 map = (struct isl_map *)set;
2251 for (i = 0; i < set->n; ++i) {
2252 map->p[i] = isl_basic_map_from_basic_set(
2253 set->p[i], n_in, n_out);
2265 struct isl_set *isl_set_from_map(struct isl_map *map)
2268 struct isl_set *set = NULL;
2272 map = isl_map_cow(map);
2275 map->n_out += map->n_in;
2277 set = (struct isl_set *)map;
2278 for (i = 0; i < map->n; ++i) {
2279 set->p[i] = isl_basic_set_from_basic_map(map->p[i]);
2289 struct isl_map *isl_map_alloc(struct isl_ctx *ctx,
2290 unsigned nparam, unsigned in, unsigned out, int n,
2293 struct isl_map *map;
2295 map = isl_alloc(ctx, struct isl_map,
2296 sizeof(struct isl_map) +
2297 n * sizeof(struct isl_basic_map *));
2306 map->nparam = nparam;
2313 struct isl_basic_map *isl_basic_map_empty(struct isl_ctx *ctx,
2314 unsigned nparam, unsigned in, unsigned out)
2316 struct isl_basic_map *bmap;
2317 bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, 1, 0);
2318 bmap = isl_basic_map_set_to_empty(bmap);
2322 struct isl_basic_set *isl_basic_set_empty(struct isl_ctx *ctx,
2323 unsigned nparam, unsigned dim)
2325 struct isl_basic_set *bset;
2326 bset = isl_basic_set_alloc(ctx, nparam, dim, 0, 1, 0);
2327 bset = isl_basic_set_set_to_empty(bset);
2331 struct isl_basic_map *isl_basic_map_universe(struct isl_ctx *ctx,
2332 unsigned nparam, unsigned in, unsigned out)
2334 struct isl_basic_map *bmap;
2335 bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, 0, 0);
2339 struct isl_basic_set *isl_basic_set_universe(struct isl_ctx *ctx,
2340 unsigned nparam, unsigned dim)
2342 struct isl_basic_set *bset;
2343 bset = isl_basic_set_alloc(ctx, nparam, dim, 0, 0, 0);
2347 struct isl_map *isl_map_empty(struct isl_ctx *ctx,
2348 unsigned nparam, unsigned in, unsigned out)
2350 return isl_map_alloc(ctx, nparam, in, out, 0, ISL_MAP_DISJOINT);
2353 struct isl_set *isl_set_empty(struct isl_ctx *ctx,
2354 unsigned nparam, unsigned dim)
2356 return isl_set_alloc(ctx, nparam, dim, 0, ISL_MAP_DISJOINT);
2359 struct isl_map *isl_map_dup(struct isl_map *map)
2362 struct isl_map *dup;
2366 dup = isl_map_alloc(map->ctx, map->nparam, map->n_in, map->n_out, map->n,
2368 for (i = 0; i < map->n; ++i)
2369 dup = isl_map_add(dup,
2370 isl_basic_map_dup(map->p[i]));
2374 struct isl_map *isl_map_add(struct isl_map *map, struct isl_basic_map *bmap)
2378 isl_assert(map->ctx, map->nparam == bmap->nparam, goto error);
2379 isl_assert(map->ctx, map->n_in == bmap->n_in, goto error);
2380 isl_assert(map->ctx, map->n_out == bmap->n_out, goto error);
2381 isl_assert(map->ctx, map->n < map->size, goto error);
2382 map->p[map->n] = bmap;
2389 isl_basic_map_free(bmap);
2393 void isl_map_free(struct isl_map *map)
2403 isl_ctx_deref(map->ctx);
2404 for (i = 0; i < map->n; ++i)
2405 isl_basic_map_free(map->p[i]);
2409 struct isl_map *isl_map_extend(struct isl_map *base,
2410 unsigned nparam, unsigned n_in, unsigned n_out)
2414 base = isl_map_cow(base);
2418 isl_assert(base->ctx, base->nparam <= nparam, goto error);
2419 isl_assert(base->ctx, base->n_in <= n_in, goto error);
2420 isl_assert(base->ctx, base->n_out <= n_out, goto error);
2421 base->nparam = nparam;
2423 base->n_out = n_out;
2424 for (i = 0; i < base->n; ++i) {
2425 base->p[i] = isl_basic_map_extend(base->p[i],
2426 nparam, n_in, n_out, 0, 0, 0);
2436 struct isl_set *isl_set_extend(struct isl_set *base,
2437 unsigned nparam, unsigned dim)
2439 return (struct isl_set *)isl_map_extend((struct isl_map *)base,
2443 static struct isl_basic_map *isl_basic_map_fix_var(struct isl_basic_map *bmap,
2444 unsigned var, int value)
2448 bmap = isl_basic_map_cow(bmap);
2449 bmap = isl_basic_map_extend(bmap,
2450 bmap->nparam, bmap->n_in, bmap->n_out, 0, 1, 0);
2451 j = isl_basic_map_alloc_equality(bmap);
2454 isl_seq_clr(bmap->eq[j],
2455 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->extra);
2456 isl_int_set_si(bmap->eq[j][1 + var], -1);
2457 isl_int_set_si(bmap->eq[j][0], value);
2458 bmap = isl_basic_map_simplify(bmap);
2459 return isl_basic_map_finalize(bmap);
2461 isl_basic_map_free(bmap);
2465 struct isl_basic_map *isl_basic_map_fix_input_si(struct isl_basic_map *bmap,
2466 unsigned input, int value)
2470 isl_assert(bmap->ctx, input < bmap->n_in, goto error);
2471 return isl_basic_map_fix_var(bmap, bmap->nparam + input, value);
2473 isl_basic_map_free(bmap);
2477 struct isl_basic_set *isl_basic_set_fix_dim_si(struct isl_basic_set *bset,
2478 unsigned dim, int value)
2482 isl_assert(bset->ctx, dim < bset->dim, goto error);
2483 return (struct isl_basic_set *)
2484 isl_basic_map_fix_var((struct isl_basic_map *)bset,
2485 bset->nparam + dim, value);
2487 isl_basic_set_free(bset);
2491 struct isl_map *isl_map_fix_input_si(struct isl_map *map,
2492 unsigned input, int value)
2496 map = isl_map_cow(map);
2500 isl_assert(ctx, input < map->n_in, goto error);
2501 for (i = 0; i < map->n; ++i) {
2502 map->p[i] = isl_basic_map_fix_input_si(map->p[i], input, value);
2512 struct isl_set *isl_set_fix_dim_si(struct isl_set *set, unsigned dim, int value)
2516 set = isl_set_cow(set);
2520 isl_assert(set->ctx, dim < set->dim, goto error);
2521 for (i = 0; i < set->n; ++i) {
2522 set->p[i] = isl_basic_set_fix_dim_si(set->p[i], dim, value);
2532 struct isl_map *isl_map_reverse(struct isl_map *map)
2537 map = isl_map_cow(map);
2542 map->n_in = map->n_out;
2544 for (i = 0; i < map->n; ++i) {
2545 map->p[i] = isl_basic_map_reverse(map->p[i]);
2555 struct isl_map *isl_basic_map_lexmax(
2556 struct isl_basic_map *bmap, struct isl_basic_set *dom,
2557 struct isl_set **empty)
2559 return isl_pip_basic_map_lexmax(bmap, dom, empty);
2562 struct isl_map *isl_basic_map_lexmin(
2563 struct isl_basic_map *bmap, struct isl_basic_set *dom,
2564 struct isl_set **empty)
2566 return isl_pip_basic_map_lexmin(bmap, dom, empty);
2569 struct isl_set *isl_basic_set_lexmin(struct isl_basic_set *bset)
2571 struct isl_basic_map *bmap = NULL;
2572 struct isl_basic_set *dom = NULL;
2573 struct isl_map *min;
2577 bmap = isl_basic_map_from_basic_set(bset, 0, bset->dim);
2580 dom = isl_basic_set_alloc(bmap->ctx, bmap->nparam, 0, 0, 0, 0);
2583 min = isl_basic_map_lexmin(bmap, dom, NULL);
2584 return isl_map_range(min);
2586 isl_basic_map_free(bmap);
2590 struct isl_map *isl_basic_map_compute_divs(struct isl_basic_map *bmap)
2594 if (bmap->n_div == 0)
2595 return isl_map_from_basic_map(bmap);
2596 return isl_pip_basic_map_compute_divs(bmap);
2599 struct isl_map *isl_map_compute_divs(struct isl_map *map)
2602 struct isl_map *res;
2608 res = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[0]));
2609 for (i = 1 ; i < map->n; ++i) {
2611 r2 = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[i]));
2612 if (F_ISSET(map, ISL_MAP_DISJOINT))
2613 res = isl_map_union_disjoint(res, r2);
2615 res = isl_map_union(res, r2);
2622 struct isl_set *isl_basic_set_compute_divs(struct isl_basic_set *bset)
2624 return (struct isl_set *)
2625 isl_basic_map_compute_divs((struct isl_basic_map *)bset);
2628 struct isl_set *isl_set_compute_divs(struct isl_set *set)
2630 return (struct isl_set *)
2631 isl_map_compute_divs((struct isl_map *)set);
2634 struct isl_set *isl_map_domain(struct isl_map *map)
2637 struct isl_set *set;
2642 map = isl_map_cow(map);
2646 set = (struct isl_set *)map;
2647 set->dim = map->n_in;
2649 for (i = 0; i < map->n; ++i) {
2650 set->p[i] = isl_basic_map_domain(map->p[i]);
2654 F_CLR(set, ISL_MAP_DISJOINT);
2661 struct isl_map *isl_map_union_disjoint(
2662 struct isl_map *map1, struct isl_map *map2)
2666 struct isl_map *map = NULL;
2680 isl_assert(map1->ctx, map1->nparam == map2->nparam, goto error);
2681 isl_assert(map1->ctx, map1->n_in == map2->n_in, goto error);
2682 isl_assert(map1->ctx, map1->n_out == map2->n_out, goto error);
2684 if (F_ISSET(map1, ISL_MAP_DISJOINT) &&
2685 F_ISSET(map2, ISL_MAP_DISJOINT))
2686 FL_SET(flags, ISL_MAP_DISJOINT);
2688 map = isl_map_alloc(map1->ctx, map1->nparam, map1->n_in, map1->n_out,
2689 map1->n + map2->n, flags);
2692 for (i = 0; i < map1->n; ++i) {
2693 map = isl_map_add(map,
2694 isl_basic_map_copy(map1->p[i]));
2698 for (i = 0; i < map2->n; ++i) {
2699 map = isl_map_add(map,
2700 isl_basic_map_copy(map2->p[i]));
2714 struct isl_map *isl_map_union(struct isl_map *map1, struct isl_map *map2)
2716 map1 = isl_map_union_disjoint(map1, map2);
2720 F_CLR(map1, ISL_MAP_DISJOINT);
2724 struct isl_set *isl_set_union_disjoint(
2725 struct isl_set *set1, struct isl_set *set2)
2727 return (struct isl_set *)
2728 isl_map_union_disjoint(
2729 (struct isl_map *)set1, (struct isl_map *)set2);
2732 struct isl_set *isl_set_union(struct isl_set *set1, struct isl_set *set2)
2734 return (struct isl_set *)
2735 isl_map_union((struct isl_map *)set1, (struct isl_map *)set2);
2738 struct isl_map *isl_map_intersect_range(
2739 struct isl_map *map, struct isl_set *set)
2742 struct isl_map *result;
2748 if (F_ISSET(map, ISL_MAP_DISJOINT) &&
2749 F_ISSET(set, ISL_MAP_DISJOINT))
2750 FL_SET(flags, ISL_MAP_DISJOINT);
2752 result = isl_map_alloc(map->ctx, map->nparam, map->n_in, map->n_out,
2753 map->n * set->n, flags);
2756 for (i = 0; i < map->n; ++i)
2757 for (j = 0; j < set->n; ++j) {
2758 result = isl_map_add(result,
2759 isl_basic_map_intersect_range(
2760 isl_basic_map_copy(map->p[i]),
2761 isl_basic_set_copy(set->p[j])));
2774 struct isl_map *isl_map_intersect_domain(
2775 struct isl_map *map, struct isl_set *set)
2777 return isl_map_reverse(
2778 isl_map_intersect_range(isl_map_reverse(map), set));
2781 struct isl_map *isl_map_apply_domain(
2782 struct isl_map *map1, struct isl_map *map2)
2786 map1 = isl_map_reverse(map1);
2787 map1 = isl_map_apply_range(map1, map2);
2788 return isl_map_reverse(map1);
2795 struct isl_map *isl_map_apply_range(
2796 struct isl_map *map1, struct isl_map *map2)
2798 struct isl_map *result;
2804 isl_assert(map1->ctx, map1->nparam == map2->nparam, goto error);
2805 isl_assert(map1->ctx, map1->n_out == map2->n_in, goto error);
2807 result = isl_map_alloc(map1->ctx, map1->nparam, map1->n_in, map2->n_out,
2808 map1->n * map2->n, 0);
2811 for (i = 0; i < map1->n; ++i)
2812 for (j = 0; j < map2->n; ++j) {
2813 result = isl_map_add(result,
2814 isl_basic_map_apply_range(
2815 isl_basic_map_copy(map1->p[i]),
2816 isl_basic_map_copy(map2->p[j])));
2822 if (result && result->n <= 1)
2823 F_SET(result, ISL_MAP_DISJOINT);
2832 * returns range - domain
2834 struct isl_basic_set *isl_basic_map_deltas(struct isl_basic_map *bmap)
2836 struct isl_basic_set *bset;
2842 isl_assert(bmap->ctx, bmap->n_in == bmap->n_out, goto error);
2844 bset = isl_basic_set_from_basic_map(bmap);
2845 bset = isl_basic_set_extend(bset, bset->nparam, 3*dim, 0,
2847 bset = isl_basic_set_swap_vars(bset, 2*dim);
2848 for (i = 0; i < dim; ++i) {
2849 int j = isl_basic_map_alloc_equality(
2850 (struct isl_basic_map *)bset);
2853 isl_seq_clr(bset->eq[j],
2854 1 + bset->nparam + bset->dim + bset->extra);
2855 isl_int_set_si(bset->eq[j][1+bset->nparam+i], 1);
2856 isl_int_set_si(bset->eq[j][1+bset->nparam+dim+i], 1);
2857 isl_int_set_si(bset->eq[j][1+bset->nparam+2*dim+i], -1);
2859 return isl_basic_set_project_out(bset, 2*dim, 0);
2861 isl_basic_map_free(bmap);
2865 /* If the only constraints a div d=floor(f/m)
2866 * appears in are its two defining constraints
2869 * -(f - (m - 1)) + m d >= 0
2871 * then it can safely be removed.
2873 static int div_is_redundant(struct isl_basic_map *bmap, int div)
2876 unsigned pos = 1 + bmap->nparam + bmap->n_in + bmap->n_out + div;
2878 for (i = 0; i < bmap->n_eq; ++i)
2879 if (!isl_int_is_zero(bmap->eq[i][pos]))
2882 for (i = 0; i < bmap->n_ineq; ++i) {
2883 if (isl_int_is_zero(bmap->ineq[i][pos]))
2885 if (isl_int_eq(bmap->ineq[i][pos], bmap->div[div][0])) {
2887 isl_int_sub(bmap->div[div][1],
2888 bmap->div[div][1], bmap->div[div][0]);
2889 isl_int_add_ui(bmap->div[div][1], bmap->div[div][1], 1);
2890 neg = isl_seq_is_neg(bmap->ineq[i], bmap->div[div]+1, pos);
2891 isl_int_sub_ui(bmap->div[div][1], bmap->div[div][1], 1);
2892 isl_int_add(bmap->div[div][1],
2893 bmap->div[div][1], bmap->div[div][0]);
2896 if (isl_seq_first_non_zero(bmap->ineq[i]+pos+1,
2897 bmap->n_div-div-1) != -1)
2899 } else if (isl_int_abs_eq(bmap->ineq[i][pos], bmap->div[div][0])) {
2900 if (!isl_seq_eq(bmap->ineq[i], bmap->div[div]+1, pos))
2902 if (isl_seq_first_non_zero(bmap->ineq[i]+pos+1,
2903 bmap->n_div-div-1) != -1)
2909 for (i = 0; i < bmap->n_div; ++i)
2910 if (!isl_int_is_zero(bmap->div[i][1+pos]))
2917 * Remove divs that don't occur in any of the constraints or other divs.
2918 * These can arise when dropping some of the variables in a quast
2919 * returned by piplib.
2921 static struct isl_basic_map *remove_redundant_divs(struct isl_basic_map *bmap)
2928 for (i = bmap->n_div-1; i >= 0; --i) {
2929 if (!div_is_redundant(bmap, i))
2931 bmap = isl_basic_map_drop_div(bmap, i);
2936 struct isl_basic_map *isl_basic_map_finalize(struct isl_basic_map *bmap)
2938 bmap = remove_redundant_divs(bmap);
2941 F_SET(bmap, ISL_BASIC_SET_FINAL);
2945 struct isl_basic_set *isl_basic_set_finalize(struct isl_basic_set *bset)
2947 return (struct isl_basic_set *)
2948 isl_basic_map_finalize((struct isl_basic_map *)bset);
2951 struct isl_set *isl_set_finalize(struct isl_set *set)
2957 for (i = 0; i < set->n; ++i) {
2958 set->p[i] = isl_basic_set_finalize(set->p[i]);
2968 struct isl_map *isl_map_finalize(struct isl_map *map)
2974 for (i = 0; i < map->n; ++i) {
2975 map->p[i] = isl_basic_map_finalize(map->p[i]);
2985 struct isl_basic_map *isl_basic_map_identity(struct isl_ctx *ctx,
2986 unsigned nparam, unsigned dim)
2988 struct isl_basic_map *bmap;
2991 bmap = isl_basic_map_alloc(ctx, nparam, dim, dim, 0, dim, 0);
2995 for (i = 0; i < dim; ++i) {
2996 int j = isl_basic_map_alloc_equality(bmap);
2999 isl_seq_clr(bmap->eq[j],
3000 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->extra);
3001 isl_int_set_si(bmap->eq[j][1+nparam+i], 1);
3002 isl_int_set_si(bmap->eq[j][1+nparam+dim+i], -1);
3004 return isl_basic_map_finalize(bmap);
3006 isl_basic_map_free(bmap);
3010 struct isl_map *isl_map_identity(struct isl_ctx *ctx,
3011 unsigned nparam, unsigned dim)
3013 struct isl_map *map = isl_map_alloc(ctx, nparam, dim, dim, 1,
3017 map = isl_map_add(map,
3018 isl_basic_map_identity(ctx, nparam, dim));
3025 int isl_set_is_equal(struct isl_set *set1, struct isl_set *set2)
3027 return isl_map_is_equal((struct isl_map *)set1, (struct isl_map *)set2);
3030 int isl_set_is_subset(struct isl_set *set1, struct isl_set *set2)
3032 return isl_map_is_subset(
3033 (struct isl_map *)set1, (struct isl_map *)set2);
3036 int isl_basic_map_is_subset(
3037 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3040 struct isl_map *map1;
3041 struct isl_map *map2;
3043 if (!bmap1 || !bmap2)
3046 map1 = isl_map_from_basic_map(isl_basic_map_copy(bmap1));
3047 map2 = isl_map_from_basic_map(isl_basic_map_copy(bmap2));
3049 is_subset = isl_map_is_subset(map1, map2);
3057 int isl_basic_map_is_equal(
3058 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3062 if (!bmap1 || !bmap2)
3064 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
3067 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
3071 int isl_basic_set_is_equal(
3072 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
3074 return isl_basic_map_is_equal(
3075 (struct isl_basic_map *)bset1, (struct isl_basic_map *)bset2);
3078 int isl_map_is_empty(struct isl_map *map)
3085 for (i = 0; i < map->n; ++i) {
3086 is_empty = isl_basic_map_is_empty(map->p[i]);
3095 int isl_set_is_empty(struct isl_set *set)
3097 return isl_map_is_empty((struct isl_map *)set);
3100 int isl_map_is_subset(struct isl_map *map1, struct isl_map *map2)
3104 struct isl_map *diff;
3109 if (isl_map_is_empty(map1))
3112 if (isl_map_is_empty(map2))
3115 diff = isl_map_subtract(isl_map_copy(map1), isl_map_copy(map2));
3119 is_subset = isl_map_is_empty(diff);
3125 int isl_map_is_equal(struct isl_map *map1, struct isl_map *map2)
3131 is_subset = isl_map_is_subset(map1, map2);
3134 is_subset = isl_map_is_subset(map2, map1);
3138 int isl_basic_map_is_strict_subset(
3139 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3143 if (!bmap1 || !bmap2)
3145 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
3148 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
3149 if (is_subset == -1)
3154 static int basic_map_contains(struct isl_basic_map *bmap, struct isl_vec *vec)
3160 total = 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
3161 if (total != vec->size)
3166 for (i = 0; i < bmap->n_eq; ++i) {
3167 isl_seq_inner_product(vec->block.data, bmap->eq[i], total, &s);
3168 if (!isl_int_is_zero(s)) {
3174 for (i = 0; i < bmap->n_ineq; ++i) {
3175 isl_seq_inner_product(vec->block.data, bmap->ineq[i], total, &s);
3176 if (isl_int_is_neg(s)) {
3187 int isl_basic_map_is_universe(struct isl_basic_map *bmap)
3191 return bmap->n_eq == 0 && bmap->n_ineq == 0;
3194 int isl_basic_map_is_empty(struct isl_basic_map *bmap)
3196 struct isl_basic_set *bset = NULL;
3197 struct isl_vec *sample = NULL;
3204 if (F_ISSET(bmap, ISL_BASIC_MAP_EMPTY))
3207 total = 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
3208 if (bmap->sample && bmap->sample->size == total) {
3209 int contains = basic_map_contains(bmap, bmap->sample);
3215 bset = isl_basic_map_underlying_set(isl_basic_map_copy(bmap));
3218 sample = isl_basic_set_sample(bset);
3221 empty = sample->size == 0;
3223 isl_vec_free(bmap->ctx, bmap->sample);
3224 bmap->sample = sample;
3229 struct isl_map *isl_basic_map_union(
3230 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3232 struct isl_map *map;
3233 if (!bmap1 || !bmap2)
3236 isl_assert(bmap1->ctx, bmap1->nparam == bmap2->nparam, goto error);
3237 isl_assert(bmap1->ctx, bmap1->n_in == bmap2->n_in, goto error);
3238 isl_assert(bmap1->ctx, bmap1->n_out == bmap2->n_out, goto error);
3240 map = isl_map_alloc(bmap1->ctx, bmap1->nparam,
3241 bmap1->n_in, bmap1->n_out, 2, 0);
3244 map = isl_map_add(map, bmap1);
3245 map = isl_map_add(map, bmap2);
3248 isl_basic_map_free(bmap1);
3249 isl_basic_map_free(bmap2);
3253 struct isl_set *isl_basic_set_union(
3254 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
3256 return (struct isl_set *)isl_basic_map_union(
3257 (struct isl_basic_map *)bset1,
3258 (struct isl_basic_map *)bset2);
3261 /* Order divs such that any div only depends on previous divs */
3262 static struct isl_basic_map *order_divs(struct isl_basic_map *bmap)
3265 unsigned off = bmap->nparam + bmap->n_in + bmap->n_out;
3267 for (i = 0; i < bmap->n_div; ++i) {
3269 pos = isl_seq_first_non_zero(bmap->div[i]+1+1+off+i,
3273 swap_div(bmap, i, pos);
3279 static int find_div(struct isl_basic_map *dst,
3280 struct isl_basic_map *src, unsigned div)
3284 unsigned total = src->nparam + src->n_in + src->n_out + src->n_div;
3286 for (i = 0; i < dst->n_div; ++i)
3287 if (isl_seq_eq(dst->div[i], src->div[div], 1+1+total) &&
3288 isl_seq_first_non_zero(dst->div[i]+1+1+total,
3289 dst->n_div - src->n_div) == -1)
3294 struct isl_basic_map *isl_basic_map_align_divs(
3295 struct isl_basic_map *dst, struct isl_basic_map *src)
3298 unsigned total = src->nparam + src->n_in + src->n_out + src->n_div;
3300 if (src->n_div == 0)
3303 src = order_divs(src);
3304 dst = isl_basic_map_extend(dst, dst->nparam, dst->n_in,
3305 dst->n_out, src->n_div, 0, 2 * src->n_div);
3308 for (i = 0; i < src->n_div; ++i) {
3309 int j = find_div(dst, src, i);
3311 j = isl_basic_map_alloc_div(dst);
3314 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total);
3315 isl_seq_clr(dst->div[j]+1+1+total,
3316 dst->extra - src->n_div);
3317 if (add_div_constraints(dst, j) < 0)
3321 swap_div(dst, i, j);
3325 isl_basic_map_free(dst);
3329 struct isl_map *isl_map_align_divs(struct isl_map *map)
3333 map = isl_map_compute_divs(map);
3334 map = isl_map_cow(map);
3338 for (i = 1; i < map->n; ++i)
3339 map->p[0] = isl_basic_map_align_divs(map->p[0], map->p[i]);
3340 for (i = 1; i < map->n; ++i)
3341 map->p[i] = isl_basic_map_align_divs(map->p[i], map->p[0]);
3346 static struct isl_map *add_cut_constraint(struct isl_map *dst,
3347 struct isl_basic_map *src, isl_int *c,
3348 unsigned len, int oppose)
3350 struct isl_basic_map *copy = NULL;
3355 copy = isl_basic_map_copy(src);
3356 copy = isl_basic_map_cow(copy);
3359 copy = isl_basic_map_extend(copy,
3360 copy->nparam, copy->n_in, copy->n_out, 0, 0, 1);
3361 k = isl_basic_map_alloc_inequality(copy);
3365 isl_seq_neg(copy->ineq[k], c, len);
3367 isl_seq_cpy(copy->ineq[k], c, len);
3368 total = 1 + copy->nparam + copy->n_in + copy->n_out + copy->extra;
3369 isl_seq_clr(copy->ineq[k]+len, total - len);
3370 isl_inequality_negate(copy, k);
3371 copy = isl_basic_map_simplify(copy);
3372 copy = isl_basic_map_finalize(copy);
3373 is_empty = isl_basic_map_is_empty(copy);
3377 dst = isl_map_add(dst, copy);
3379 isl_basic_map_free(copy);
3382 isl_basic_map_free(copy);
3387 static struct isl_map *subtract(struct isl_map *map, struct isl_basic_map *bmap)
3391 struct isl_map *rest = NULL;
3393 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
3400 if (F_ISSET(map, ISL_MAP_DISJOINT))
3401 FL_SET(flags, ISL_MAP_DISJOINT);
3403 max = map->n * (2 * bmap->n_eq + bmap->n_ineq);
3404 rest = isl_map_alloc(map->ctx, map->nparam, map->n_in, map->n_out,
3409 for (i = 0; i < map->n; ++i) {
3410 map->p[i] = isl_basic_map_align_divs(map->p[i], bmap);
3415 for (j = 0; j < map->n; ++j)
3416 map->p[j] = isl_basic_map_cow(map->p[j]);
3418 for (i = 0; i < bmap->n_eq; ++i) {
3419 for (j = 0; j < map->n; ++j) {
3420 rest = add_cut_constraint(rest,
3421 map->p[j], bmap->eq[i], 1+total, 0);
3425 rest = add_cut_constraint(rest,
3426 map->p[j], bmap->eq[i], 1+total, 1);
3430 map->p[j] = isl_basic_map_extend(map->p[j],
3431 map->p[j]->nparam, map->p[j]->n_in,
3432 map->p[j]->n_out, 0, 1, 0);
3435 k = isl_basic_map_alloc_equality(map->p[j]);
3438 isl_seq_cpy(map->p[j]->eq[k], bmap->eq[i], 1+total);
3439 isl_seq_clr(map->p[j]->eq[k]+1+total,
3440 map->p[j]->extra - bmap->n_div);
3444 for (i = 0; i < bmap->n_ineq; ++i) {
3445 for (j = 0; j < map->n; ++j) {
3446 rest = add_cut_constraint(rest,
3447 map->p[j], bmap->ineq[i], 1+total, 0);
3451 map->p[j] = isl_basic_map_extend(map->p[j],
3452 map->p[j]->nparam, map->p[j]->n_in,
3453 map->p[j]->n_out, 0, 0, 1);
3456 k = isl_basic_map_alloc_inequality(map->p[j]);
3459 isl_seq_cpy(map->p[j]->ineq[k], bmap->ineq[i], 1+total);
3460 isl_seq_clr(map->p[j]->ineq[k]+1+total,
3461 map->p[j]->extra - bmap->n_div);
3473 struct isl_map *isl_map_subtract(struct isl_map *map1, struct isl_map *map2)
3479 isl_assert(map1->ctx, map1->nparam == map2->nparam, goto error);
3480 isl_assert(map1->ctx, map1->n_in == map2->n_in, goto error);
3481 isl_assert(map1->ctx, map1->n_out == map2->n_out, goto error);
3483 if (isl_map_is_empty(map2)) {
3488 map1 = isl_map_compute_divs(map1);
3489 map2 = isl_map_compute_divs(map2);
3493 for (i = 0; map1 && i < map2->n; ++i)
3494 map1 = subtract(map1, map2->p[i]);
3504 struct isl_set *isl_set_subtract(struct isl_set *set1, struct isl_set *set2)
3506 return (struct isl_set *)
3508 (struct isl_map *)set1, (struct isl_map *)set2);
3511 struct isl_set *isl_set_apply(struct isl_set *set, struct isl_map *map)
3515 isl_assert(set->ctx, set->dim == map->n_in, goto error);
3516 map = isl_map_intersect_domain(map, set);
3517 set = isl_map_range(map);
3525 /* There is no need to cow as removing empty parts doesn't change
3526 * the meaning of the set.
3528 struct isl_map *isl_map_remove_empty_parts(struct isl_map *map)
3535 for (i = map->n-1; i >= 0; --i) {
3536 if (!F_ISSET(map->p[i], ISL_BASIC_MAP_EMPTY))
3538 isl_basic_map_free(map->p[i]);
3540 map->p[i] = map->p[map->n-1];
3547 struct isl_set *isl_set_remove_empty_parts(struct isl_set *set)
3549 return (struct isl_set *)
3550 isl_map_remove_empty_parts((struct isl_map *)set);
3553 struct isl_basic_set *isl_set_copy_basic_set(struct isl_set *set)
3555 struct isl_basic_set *bset;
3556 if (!set || set->n == 0)
3558 bset = set->p[set->n-1];
3559 isl_assert(set->ctx, F_ISSET(bset, ISL_BASIC_SET_FINAL), return NULL);
3560 return isl_basic_set_copy(bset);
3563 struct isl_set *isl_set_drop_basic_set(struct isl_set *set,
3564 struct isl_basic_set *bset)
3570 for (i = set->n-1; i >= 0; --i) {
3571 if (set->p[i] != bset)
3573 set = isl_set_cow(set);
3576 isl_basic_set_free(set->p[i]);
3578 set->p[i] = set->p[set->n-1];
3582 isl_basic_set_free(bset);
3586 isl_basic_set_free(bset);