9 #include "isl_map_private.h"
10 #include "isl_map_piplib.h"
11 #include "isl_sample.h"
14 static struct isl_basic_map *basic_map_init(struct isl_ctx *ctx,
15 struct isl_basic_map *bmap,
16 unsigned nparam, unsigned n_in, unsigned n_out, unsigned extra,
17 unsigned n_eq, unsigned n_ineq)
20 size_t row_size = 1 + nparam + n_in + n_out + extra;
22 bmap->block = isl_blk_alloc(ctx, (n_eq + n_ineq) * row_size);
23 if (isl_blk_is_error(bmap->block)) {
28 bmap->eq = isl_alloc_array(ctx, isl_int *, n_eq + n_ineq);
30 isl_blk_free(ctx, bmap->block);
36 bmap->block2 = isl_blk_empty();
39 bmap->block2 = isl_blk_alloc(ctx, extra * (1 + row_size));
40 if (isl_blk_is_error(bmap->block2)) {
42 isl_blk_free(ctx, bmap->block);
47 bmap->div = isl_alloc_array(ctx, isl_int *, extra);
49 isl_blk_free(ctx, bmap->block2);
51 isl_blk_free(ctx, bmap->block);
57 for (i = 0; i < n_eq + n_ineq; ++i)
58 bmap->eq[i] = bmap->block.data + i * row_size;
60 for (i = 0; i < extra; ++i)
61 bmap->div[i] = bmap->block2.data + i * (1 + row_size);
67 bmap->c_size = n_eq + n_ineq;
68 bmap->ineq = bmap->eq + n_eq;
69 bmap->nparam = nparam;
81 struct isl_basic_set *isl_basic_set_alloc(struct isl_ctx *ctx,
82 unsigned nparam, unsigned dim, unsigned extra,
83 unsigned n_eq, unsigned n_ineq)
85 struct isl_basic_map *bmap;
86 bmap = isl_basic_map_alloc(ctx, nparam, 0, dim, extra, n_eq, n_ineq);
87 return (struct isl_basic_set *)bmap;
90 struct isl_basic_map *isl_basic_map_alloc(struct isl_ctx *ctx,
91 unsigned nparam, unsigned in, unsigned out, unsigned extra,
92 unsigned n_eq, unsigned n_ineq)
94 struct isl_basic_map *bmap;
96 bmap = isl_alloc_type(ctx, struct isl_basic_map);
100 return basic_map_init(ctx, bmap,
101 nparam, in, out, extra, n_eq, n_ineq);
104 static void dup_constraints(
105 struct isl_basic_map *dst, struct isl_basic_map *src)
108 unsigned total = src->nparam + src->n_in + src->n_out + src->n_div;
110 for (i = 0; i < src->n_eq; ++i) {
111 int j = isl_basic_map_alloc_equality(dst);
112 isl_seq_cpy(dst->eq[j], src->eq[i], 1+total);
115 for (i = 0; i < src->n_ineq; ++i) {
116 int j = isl_basic_map_alloc_inequality(dst);
117 isl_seq_cpy(dst->ineq[j], src->ineq[i], 1+total);
120 for (i = 0; i < src->n_div; ++i) {
121 int j = isl_basic_map_alloc_div(dst);
122 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total);
124 F_SET(dst, ISL_BASIC_SET_FINAL);
127 struct isl_basic_map *isl_basic_map_dup(struct isl_basic_map *bmap)
129 struct isl_basic_map *dup;
133 dup = isl_basic_map_alloc(bmap->ctx, bmap->nparam,
134 bmap->n_in, bmap->n_out,
135 bmap->n_div, bmap->n_eq, bmap->n_ineq);
138 dup->flags = bmap->flags;
139 dup_constraints(dup, bmap);
140 dup->sample = isl_vec_copy(bmap->ctx, bmap->sample);
144 struct isl_basic_set *isl_basic_set_dup(struct isl_basic_set *bset)
146 struct isl_basic_map *dup;
148 dup = isl_basic_map_dup((struct isl_basic_map *)bset);
149 return (struct isl_basic_set *)dup;
152 struct isl_basic_set *isl_basic_set_copy(struct isl_basic_set *bset)
157 if (F_ISSET(bset, ISL_BASIC_SET_FINAL)) {
161 return isl_basic_set_dup(bset);
164 struct isl_set *isl_set_copy(struct isl_set *set)
173 struct isl_basic_map *isl_basic_map_copy(struct isl_basic_map *bmap)
178 if (F_ISSET(bmap, ISL_BASIC_SET_FINAL)) {
182 return isl_basic_map_dup(bmap);
185 struct isl_map *isl_map_copy(struct isl_map *map)
194 void isl_basic_map_free(struct isl_basic_map *bmap)
202 isl_ctx_deref(bmap->ctx);
204 isl_blk_free(bmap->ctx, bmap->block2);
206 isl_blk_free(bmap->ctx, bmap->block);
207 isl_vec_free(bmap->ctx, bmap->sample);
211 void isl_basic_set_free(struct isl_basic_set *bset)
213 isl_basic_map_free((struct isl_basic_map *)bset);
216 int isl_basic_map_alloc_equality(struct isl_basic_map *bmap)
222 isl_assert(ctx, bmap->n_eq + bmap->n_ineq < bmap->c_size, return -1);
223 isl_assert(ctx, bmap->eq + bmap->n_eq <= bmap->ineq, return -1);
224 if (bmap->eq + bmap->n_eq == bmap->ineq) {
226 int j = isl_basic_map_alloc_inequality(bmap);
230 bmap->ineq[0] = bmap->ineq[j];
238 int isl_basic_set_alloc_equality(struct isl_basic_set *bset)
240 return isl_basic_map_alloc_equality((struct isl_basic_map *)bset);
243 int isl_basic_map_free_equality(struct isl_basic_map *bmap, unsigned n)
247 isl_assert(bmap->ctx, n <= bmap->n_eq, return -1);
252 int isl_basic_map_drop_equality(struct isl_basic_map *bmap, unsigned pos)
257 isl_assert(bmap->ctx, pos < bmap->n_eq, return -1);
259 if (pos != bmap->n_eq - 1) {
261 bmap->eq[pos] = bmap->eq[bmap->n_eq - 1];
262 bmap->eq[bmap->n_eq - 1] = t;
268 int isl_basic_set_drop_equality(struct isl_basic_set *bset, unsigned pos)
270 return isl_basic_map_drop_equality((struct isl_basic_map *)bset, pos);
273 void isl_basic_map_inequality_to_equality(
274 struct isl_basic_map *bmap, unsigned pos)
279 bmap->ineq[pos] = bmap->ineq[0];
280 bmap->ineq[0] = bmap->eq[bmap->n_eq];
281 bmap->eq[bmap->n_eq] = t;
287 int isl_basic_map_alloc_inequality(struct isl_basic_map *bmap)
293 isl_assert(ctx, (bmap->ineq - bmap->eq) + bmap->n_ineq < bmap->c_size,
295 F_CLR(bmap, ISL_BASIC_MAP_NO_IMPLICIT);
296 F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
297 return bmap->n_ineq++;
300 int isl_basic_set_alloc_inequality(struct isl_basic_set *bset)
302 return isl_basic_map_alloc_inequality((struct isl_basic_map *)bset);
305 int isl_basic_map_free_inequality(struct isl_basic_map *bmap, unsigned n)
309 isl_assert(bmap->ctx, n <= bmap->n_ineq, return -1);
314 int isl_basic_set_free_inequality(struct isl_basic_set *bset, unsigned n)
316 return isl_basic_map_free_inequality((struct isl_basic_map *)bset, n);
319 int isl_basic_map_drop_inequality(struct isl_basic_map *bmap, unsigned pos)
324 isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
326 if (pos != bmap->n_ineq - 1) {
328 bmap->ineq[pos] = bmap->ineq[bmap->n_ineq - 1];
329 bmap->ineq[bmap->n_ineq - 1] = t;
335 int isl_basic_set_drop_inequality(struct isl_basic_set *bset, unsigned pos)
337 return isl_basic_map_drop_inequality((struct isl_basic_map *)bset, pos);
340 int isl_basic_map_alloc_div(struct isl_basic_map *bmap)
344 isl_assert(bmap->ctx, bmap->n_div < bmap->extra, return -1);
345 return bmap->n_div++;
348 int isl_basic_map_free_div(struct isl_basic_map *bmap, unsigned n)
352 isl_assert(bmap->ctx, n <= bmap->n_div, return -1);
357 /* Copy constraint from src to dst, putting the vars of src at offset
358 * dim_off in dst and the divs of src at offset div_off in dst.
359 * If both sets are actually map, then dim_off applies to the input
362 static void copy_constraint(struct isl_basic_map *dst_map, isl_int *dst,
363 struct isl_basic_map *src_map, isl_int *src,
364 unsigned in_off, unsigned out_off, unsigned div_off)
366 isl_int_set(dst[0], src[0]);
367 isl_seq_cpy(dst+1, src+1, isl_min(dst_map->nparam, src_map->nparam));
368 if (dst_map->nparam > src_map->nparam)
369 isl_seq_clr(dst+1+src_map->nparam,
370 dst_map->nparam - src_map->nparam);
371 isl_seq_clr(dst+1+dst_map->nparam, in_off);
372 isl_seq_cpy(dst+1+dst_map->nparam+in_off,
373 src+1+src_map->nparam,
374 isl_min(dst_map->n_in-in_off, src_map->n_in));
375 if (dst_map->n_in-in_off > src_map->n_in)
376 isl_seq_clr(dst+1+dst_map->nparam+in_off+src_map->n_in,
377 dst_map->n_in - in_off - src_map->n_in);
378 isl_seq_clr(dst+1+dst_map->nparam+dst_map->n_in, out_off);
379 isl_seq_cpy(dst+1+dst_map->nparam+dst_map->n_in+out_off,
380 src+1+src_map->nparam+src_map->n_in,
381 isl_min(dst_map->n_out-out_off, src_map->n_out));
382 if (dst_map->n_out-out_off > src_map->n_out)
383 isl_seq_clr(dst+1+dst_map->nparam+dst_map->n_in+out_off+src_map->n_out,
384 dst_map->n_out - out_off - src_map->n_out);
385 isl_seq_clr(dst+1+dst_map->nparam+dst_map->n_in+dst_map->n_out, div_off);
386 isl_seq_cpy(dst+1+dst_map->nparam+dst_map->n_in+dst_map->n_out+div_off,
387 src+1+src_map->nparam+src_map->n_in+src_map->n_out,
388 isl_min(dst_map->extra-div_off, src_map->extra));
389 if (dst_map->extra-div_off > src_map->extra)
390 isl_seq_clr(dst+1+dst_map->nparam+dst_map->n_in+dst_map->n_out+
391 div_off+src_map->extra,
392 dst_map->extra - div_off - src_map->extra);
395 static void copy_div(struct isl_basic_map *dst_map, isl_int *dst,
396 struct isl_basic_map *src_map, isl_int *src,
397 unsigned in_off, unsigned out_off, unsigned div_off)
399 isl_int_set(dst[0], src[0]);
400 copy_constraint(dst_map, dst+1, src_map, src+1, in_off, out_off, div_off);
403 static struct isl_basic_map *add_constraints(struct isl_basic_map *bmap1,
404 struct isl_basic_map *bmap2, unsigned i_pos, unsigned o_pos)
407 unsigned div_off = bmap1->n_div;
409 for (i = 0; i < bmap2->n_eq; ++i) {
410 int i1 = isl_basic_map_alloc_equality(bmap1);
413 copy_constraint(bmap1, bmap1->eq[i1], bmap2, bmap2->eq[i],
414 i_pos, o_pos, div_off);
417 for (i = 0; i < bmap2->n_ineq; ++i) {
418 int i1 = isl_basic_map_alloc_inequality(bmap1);
421 copy_constraint(bmap1, bmap1->ineq[i1], bmap2, bmap2->ineq[i],
422 i_pos, o_pos, div_off);
425 for (i = 0; i < bmap2->n_div; ++i) {
426 int i1 = isl_basic_map_alloc_div(bmap1);
429 copy_div(bmap1, bmap1->div[i1], bmap2, bmap2->div[i],
430 i_pos, o_pos, div_off);
433 isl_basic_map_free(bmap2);
438 isl_basic_map_free(bmap1);
439 isl_basic_map_free(bmap2);
443 struct isl_basic_map *isl_basic_map_extend(struct isl_basic_map *base,
444 unsigned nparam, unsigned n_in, unsigned n_out, unsigned extra,
445 unsigned n_eq, unsigned n_ineq)
447 struct isl_basic_map *ext;
451 base = isl_basic_map_cow(base);
455 dims_ok = base && base->nparam == nparam &&
456 base->n_in == n_in && base->n_out == n_out &&
457 base->extra >= base->n_div + extra;
459 if (dims_ok && n_eq == 0 && n_ineq == 0)
462 isl_assert(base->ctx, base->nparam <= nparam, goto error);
463 isl_assert(base->ctx, base->n_in <= n_in, goto error);
464 isl_assert(base->ctx, base->n_out <= n_out, goto error);
465 extra += base->extra;
467 n_ineq += base->n_ineq;
469 ext = isl_basic_map_alloc(base->ctx, nparam, n_in, n_out,
470 extra, n_eq, n_ineq);
477 ext = add_constraints(ext, base, 0, 0);
480 F_CLR(ext, ISL_BASIC_SET_FINAL);
486 isl_basic_map_free(base);
490 struct isl_basic_set *isl_basic_set_extend(struct isl_basic_set *base,
491 unsigned nparam, unsigned dim, unsigned extra,
492 unsigned n_eq, unsigned n_ineq)
494 return (struct isl_basic_set *)
495 isl_basic_map_extend((struct isl_basic_map *)base,
496 nparam, 0, dim, extra, n_eq, n_ineq);
499 struct isl_basic_set *isl_basic_set_cow(struct isl_basic_set *bset)
501 return (struct isl_basic_set *)
502 isl_basic_map_cow((struct isl_basic_map *)bset);
505 struct isl_basic_map *isl_basic_map_cow(struct isl_basic_map *bmap)
512 bmap = isl_basic_map_dup(bmap);
514 F_CLR(bmap, ISL_BASIC_SET_FINAL);
518 struct isl_set *isl_set_cow(struct isl_set *set)
526 return isl_set_dup(set);
529 struct isl_map *isl_map_cow(struct isl_map *map)
537 return isl_map_dup(map);
540 static void swap_vars(struct isl_blk blk, isl_int *a,
541 unsigned a_len, unsigned b_len)
543 isl_seq_cpy(blk.data, a+a_len, b_len);
544 isl_seq_cpy(blk.data+b_len, a, a_len);
545 isl_seq_cpy(a, blk.data, b_len+a_len);
548 struct isl_basic_set *isl_basic_set_swap_vars(
549 struct isl_basic_set *bset, unsigned n)
557 isl_assert(bset->ctx, n <= bset->dim, goto error);
562 bset = isl_basic_set_cow(bset);
566 blk = isl_blk_alloc(bset->ctx, bset->dim);
567 if (isl_blk_is_error(blk))
570 for (i = 0; i < bset->n_eq; ++i)
572 bset->eq[i]+1+bset->nparam, n, bset->dim - n);
574 for (i = 0; i < bset->n_ineq; ++i)
576 bset->ineq[i]+1+bset->nparam, n, bset->dim - n);
578 for (i = 0; i < bset->n_div; ++i)
580 bset->div[i]+1+1+bset->nparam, n, bset->dim - n);
582 isl_blk_free(bset->ctx, blk);
587 isl_basic_set_free(bset);
591 struct isl_set *isl_set_swap_vars(struct isl_set *set, unsigned n)
594 set = isl_set_cow(set);
598 for (i = 0; i < set->n; ++i) {
599 set->p[i] = isl_basic_set_swap_vars(set->p[i], n);
608 static void constraint_drop_vars(isl_int *c, unsigned n, unsigned rem)
610 isl_seq_cpy(c, c + n, rem);
611 isl_seq_clr(c + rem, n);
614 struct isl_basic_set *isl_basic_set_drop_dims(
615 struct isl_basic_set *bset, unsigned first, unsigned n)
622 isl_assert(bset->ctx, first + n <= bset->dim, goto error);
627 bset = isl_basic_set_cow(bset);
631 for (i = 0; i < bset->n_eq; ++i)
632 constraint_drop_vars(bset->eq[i]+1+bset->nparam+first, n,
633 (bset->dim-first-n)+bset->extra);
635 for (i = 0; i < bset->n_ineq; ++i)
636 constraint_drop_vars(bset->ineq[i]+1+bset->nparam+first, n,
637 (bset->dim-first-n)+bset->extra);
639 for (i = 0; i < bset->n_div; ++i)
640 constraint_drop_vars(bset->div[i]+1+1+bset->nparam+first, n,
641 (bset->dim-first-n)+bset->extra);
646 return isl_basic_set_finalize(bset);
648 isl_basic_set_free(bset);
652 static struct isl_set *isl_set_drop_dims(
653 struct isl_set *set, unsigned first, unsigned n)
660 isl_assert(set->ctx, first + n <= set->dim, goto error);
664 set = isl_set_cow(set);
668 for (i = 0; i < set->n; ++i) {
669 set->p[i] = isl_basic_set_drop_dims(set->p[i], first, n);
682 * We don't cow, as the div is assumed to be redundant.
684 static struct isl_basic_map *isl_basic_map_drop_div(
685 struct isl_basic_map *bmap, unsigned div)
693 pos = 1 + bmap->nparam + bmap->n_in + bmap->n_out + div;
695 isl_assert(bmap->ctx, div < bmap->n_div, goto error);
697 for (i = 0; i < bmap->n_eq; ++i)
698 constraint_drop_vars(bmap->eq[i]+pos, 1, bmap->extra-div-1);
700 for (i = 0; i < bmap->n_ineq; ++i) {
701 if (!isl_int_is_zero(bmap->ineq[i][pos])) {
702 isl_basic_map_drop_inequality(bmap, i);
706 constraint_drop_vars(bmap->ineq[i]+pos, 1, bmap->extra-div-1);
709 for (i = 0; i < bmap->n_div; ++i)
710 constraint_drop_vars(bmap->div[i]+1+pos, 1, bmap->extra-div-1);
712 if (div != bmap->n_div - 1) {
714 isl_int *t = bmap->div[div];
716 for (j = div; j < bmap->n_div - 1; ++j)
717 bmap->div[j] = bmap->div[j+1];
719 bmap->div[bmap->n_div - 1] = t;
721 isl_basic_map_free_div(bmap, 1);
725 isl_basic_map_free(bmap);
729 static void eliminate_div(struct isl_basic_map *bmap, isl_int *eq, unsigned div)
732 unsigned pos = 1 + bmap->nparam + bmap->n_in + bmap->n_out + div;
734 len = 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
736 for (i = 0; i < bmap->n_eq; ++i)
737 if (bmap->eq[i] != eq)
738 isl_seq_elim(bmap->eq[i], eq, pos, len, NULL);
740 for (i = 0; i < bmap->n_ineq; ++i)
741 isl_seq_elim(bmap->ineq[i], eq, pos, len, NULL);
743 /* We need to be careful about circular definitions,
744 * so for now we just remove the definitions of other divs that
745 * depend on this div and (possibly) recompute them later.
747 for (i = 0; i < bmap->n_div; ++i)
748 if (!isl_int_is_zero(bmap->div[i][0]) &&
749 !isl_int_is_zero(bmap->div[i][1 + pos]))
750 isl_seq_clr(bmap->div[i], 1 + len);
752 isl_basic_map_drop_div(bmap, div);
755 struct isl_basic_map *isl_basic_map_set_to_empty(struct isl_basic_map *bmap)
761 total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->extra;
762 isl_basic_map_free_div(bmap, bmap->n_div);
763 isl_basic_map_free_inequality(bmap, bmap->n_ineq);
765 isl_basic_map_free_equality(bmap, bmap->n_eq-1);
767 isl_basic_map_alloc_equality(bmap);
771 isl_int_set_si(bmap->eq[i][0], 1);
772 isl_seq_clr(bmap->eq[i]+1, total);
773 F_SET(bmap, ISL_BASIC_MAP_EMPTY);
774 return isl_basic_map_finalize(bmap);
776 isl_basic_map_free(bmap);
780 struct isl_basic_set *isl_basic_set_set_to_empty(struct isl_basic_set *bset)
782 return (struct isl_basic_set *)
783 isl_basic_map_set_to_empty((struct isl_basic_map *)bset);
786 static void swap_equality(struct isl_basic_map *bmap, int a, int b)
788 isl_int *t = bmap->eq[a];
789 bmap->eq[a] = bmap->eq[b];
793 static void swap_inequality(struct isl_basic_map *bmap, int a, int b)
795 isl_int *t = bmap->ineq[a];
796 bmap->ineq[a] = bmap->ineq[b];
800 static void swap_div(struct isl_basic_map *bmap, int a, int b)
803 unsigned off = bmap->nparam + bmap->n_in + bmap->n_out;
804 isl_int *t = bmap->div[a];
805 bmap->div[a] = bmap->div[b];
808 for (i = 0; i < bmap->n_eq; ++i)
809 isl_int_swap(bmap->eq[i][1+off+a], bmap->eq[i][1+off+b]);
811 for (i = 0; i < bmap->n_ineq; ++i)
812 isl_int_swap(bmap->ineq[i][1+off+a], bmap->ineq[i][1+off+b]);
814 for (i = 0; i < bmap->n_div; ++i)
815 isl_int_swap(bmap->div[i][1+1+off+a], bmap->div[i][1+1+off+b]);
818 struct isl_basic_map *isl_basic_map_gauss(
819 struct isl_basic_map *bmap, int *progress)
830 total_var = bmap->nparam + bmap->n_in + bmap->n_out;
831 total = total_var + bmap->n_div;
833 last_var = total - 1;
834 for (done = 0; done < bmap->n_eq; ++done) {
835 for (; last_var >= 0; --last_var) {
836 for (k = done; k < bmap->n_eq; ++k)
837 if (!isl_int_is_zero(bmap->eq[k][1+last_var]))
845 swap_equality(bmap, k, done);
846 if (isl_int_is_neg(bmap->eq[done][1+last_var]))
847 isl_seq_neg(bmap->eq[done], bmap->eq[done], 1+total);
849 for (k = 0; k < bmap->n_eq; ++k) {
852 if (isl_int_is_zero(bmap->eq[k][1+last_var]))
856 isl_seq_elim(bmap->eq[k], bmap->eq[done],
857 1+last_var, 1+total, NULL);
860 for (k = 0; k < bmap->n_ineq; ++k) {
861 if (isl_int_is_zero(bmap->ineq[k][1+last_var]))
865 isl_seq_elim(bmap->ineq[k], bmap->eq[done],
866 1+last_var, 1+total, NULL);
869 for (k = 0; k < bmap->n_div; ++k) {
870 if (isl_int_is_zero(bmap->div[k][0]))
872 if (isl_int_is_zero(bmap->div[k][1+1+last_var]))
876 isl_seq_elim(bmap->div[k]+1, bmap->eq[done],
877 1+last_var, 1+total, &bmap->div[k][0]);
880 if (last_var >= total_var &&
881 isl_int_is_zero(bmap->div[last_var - total_var][0])) {
882 unsigned div = last_var - total_var;
883 isl_seq_neg(bmap->div[div]+1, bmap->eq[done], 1+total);
884 isl_int_set_si(bmap->div[div][1+1+last_var], 0);
885 isl_int_set(bmap->div[div][0],
886 bmap->eq[done][1+last_var]);
889 if (done == bmap->n_eq)
891 for (k = done; k < bmap->n_eq; ++k) {
892 if (isl_int_is_zero(bmap->eq[k][0]))
894 return isl_basic_map_set_to_empty(bmap);
896 isl_basic_map_free_equality(bmap, bmap->n_eq-done);
900 struct isl_basic_set *isl_basic_set_gauss(
901 struct isl_basic_set *bset, int *progress)
903 return (struct isl_basic_set*)isl_basic_map_gauss(
904 (struct isl_basic_map *)bset, progress);
907 static unsigned int round_up(unsigned int v)
918 static int hash_index(int *index, unsigned int size, int bits,
919 struct isl_basic_map *bmap, int k)
922 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
923 u_int32_t hash = isl_seq_hash(bmap->ineq[k]+1, total, bits);
924 for (h = hash; index[h]; h = (h+1) % size)
925 if (k != index[h]-1 &&
926 isl_seq_eq(bmap->ineq[k]+1,
927 bmap->ineq[index[h]-1]+1, total))
932 static struct isl_basic_map *remove_duplicate_constraints(
933 struct isl_basic_map *bmap, int *progress)
939 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
942 if (bmap->n_ineq <= 1)
945 size = round_up(4 * (bmap->n_ineq+1) / 3 - 1);
946 bits = ffs(size) - 1;
947 index = isl_alloc_array(ctx, int, size);
948 memset(index, 0, size * sizeof(int));
952 index[isl_seq_hash(bmap->ineq[0]+1, total, bits)] = 1;
953 for (k = 1; k < bmap->n_ineq; ++k) {
954 h = hash_index(index, size, bits, bmap, k);
962 if (isl_int_lt(bmap->ineq[k][0], bmap->ineq[l][0]))
963 swap_inequality(bmap, k, l);
964 isl_basic_map_drop_inequality(bmap, k);
968 for (k = 0; k < bmap->n_ineq-1; ++k) {
969 isl_seq_neg(bmap->ineq[k]+1, bmap->ineq[k]+1, total);
970 h = hash_index(index, size, bits, bmap, k);
971 isl_seq_neg(bmap->ineq[k]+1, bmap->ineq[k]+1, total);
975 isl_int_add(sum, bmap->ineq[k][0], bmap->ineq[l][0]);
976 if (isl_int_is_pos(sum))
978 if (isl_int_is_zero(sum)) {
979 /* We need to break out of the loop after these
980 * changes since the contents of the hash
981 * will no longer be valid.
982 * Plus, we probably we want to regauss first.
984 isl_basic_map_drop_inequality(bmap, l);
985 isl_basic_map_inequality_to_equality(bmap, k);
987 bmap = isl_basic_map_set_to_empty(bmap);
996 static struct isl_basic_map *remove_duplicate_divs(
997 struct isl_basic_map *bmap, int *progress)
1004 unsigned total_var = bmap->nparam + bmap->n_in + bmap->n_out;
1005 unsigned total = total_var + bmap->n_div;
1006 struct isl_ctx *ctx;
1008 if (bmap->n_div <= 1)
1012 for (k = bmap->n_div - 1; k >= 0; --k)
1013 if (!isl_int_is_zero(bmap->div[k][0]))
1018 size = round_up(4 * bmap->n_div / 3 - 1);
1019 bits = ffs(size) - 1;
1020 index = isl_alloc_array(ctx, int, size);
1021 memset(index, 0, size * sizeof(int));
1024 eq = isl_blk_alloc(ctx, 1+total);
1025 if (isl_blk_is_error(eq))
1028 isl_seq_clr(eq.data, 1+total);
1029 index[isl_seq_hash(bmap->div[k], 2+total, bits)] = k + 1;
1030 for (--k; k >= 0; --k) {
1033 if (isl_int_is_zero(bmap->div[k][0]))
1036 hash = isl_seq_hash(bmap->div[k], 2+total, bits);
1037 for (h = hash; index[h]; h = (h+1) % size)
1038 if (isl_seq_eq(bmap->div[k],
1039 bmap->div[index[h]-1], 2+total))
1044 isl_int_set_si(eq.data[1+total_var+k], -1);
1045 isl_int_set_si(eq.data[1+total_var+l], 1);
1046 eliminate_div(bmap, eq.data, l);
1047 isl_int_set_si(eq.data[1+total_var+k], 0);
1048 isl_int_set_si(eq.data[1+total_var+l], 0);
1053 isl_blk_free(ctx, eq);
1059 /* Elimininate divs based on equalities
1061 static struct isl_basic_map *eliminate_divs_eq(
1062 struct isl_basic_map *bmap, int *progress)
1072 off = 1 + bmap->nparam + bmap->n_in + bmap->n_out;
1074 for (d = bmap->n_div - 1; d >= 0 ; --d) {
1075 for (i = 0; i < bmap->n_eq; ++i) {
1076 if (!isl_int_is_one(bmap->eq[i][off + d]) &&
1077 !isl_int_is_negone(bmap->eq[i][off + d]))
1081 eliminate_div(bmap, bmap->eq[i], d);
1082 isl_basic_map_drop_equality(bmap, i);
1087 return eliminate_divs_eq(bmap, progress);
1091 static struct isl_basic_map *normalize_constraints(struct isl_basic_map *bmap)
1095 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
1098 for (i = bmap->n_eq - 1; i >= 0; --i) {
1099 isl_seq_gcd(bmap->eq[i]+1, total, &gcd);
1100 if (isl_int_is_zero(gcd)) {
1101 if (!isl_int_is_zero(bmap->eq[i][0])) {
1102 bmap = isl_basic_map_set_to_empty(bmap);
1105 isl_basic_map_drop_equality(bmap, i);
1108 if (F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL))
1109 isl_int_gcd(gcd, gcd, bmap->eq[i][0]);
1110 if (isl_int_is_one(gcd))
1112 if (!isl_int_is_divisible_by(bmap->eq[i][0], gcd)) {
1113 bmap = isl_basic_map_set_to_empty(bmap);
1116 isl_seq_scale_down(bmap->eq[i], bmap->eq[i], gcd, 1+total);
1119 for (i = bmap->n_ineq - 1; i >= 0; --i) {
1120 isl_seq_gcd(bmap->ineq[i]+1, total, &gcd);
1121 if (isl_int_is_zero(gcd)) {
1122 if (isl_int_is_neg(bmap->ineq[i][0])) {
1123 bmap = isl_basic_map_set_to_empty(bmap);
1126 isl_basic_map_drop_inequality(bmap, i);
1129 if (F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL))
1130 isl_int_gcd(gcd, gcd, bmap->ineq[i][0]);
1131 if (isl_int_is_one(gcd))
1133 isl_int_fdiv_q(bmap->ineq[i][0], bmap->ineq[i][0], gcd);
1134 isl_seq_scale_down(bmap->ineq[i]+1, bmap->ineq[i]+1, gcd, total);
1142 /* Eliminate the specified variables from the constraints using
1143 * Fourier-Motzkin. The variables themselves are not removed.
1145 struct isl_basic_map *isl_basic_map_eliminate_vars(
1146 struct isl_basic_map *bmap, int pos, unsigned n)
1155 total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
1156 extra = bmap->extra - bmap->n_div;
1158 bmap = isl_basic_map_cow(bmap);
1159 bmap = isl_basic_map_gauss(bmap, NULL);
1160 for (d = pos + n - 1; d >= pos; --d) {
1161 int n_lower, n_upper;
1164 for (i = 0; i < bmap->n_eq; ++i) {
1165 if (isl_int_is_zero(bmap->eq[i][1+d]))
1167 isl_basic_map_drop_equality(bmap, i);
1174 for (i = 0; i < bmap->n_ineq; ++i) {
1175 if (isl_int_is_pos(bmap->ineq[i][1+d]))
1177 else if (isl_int_is_neg(bmap->ineq[i][1+d]))
1180 bmap = isl_basic_map_extend(bmap,
1181 bmap->nparam, bmap->n_in, bmap->n_out, 0,
1182 0, n_lower * n_upper);
1183 for (i = bmap->n_ineq - 1; i >= 0; --i) {
1185 if (isl_int_is_zero(bmap->ineq[i][1+d]))
1188 for (j = 0; j < i; ++j) {
1189 if (isl_int_is_zero(bmap->ineq[j][1+d]))
1192 if (isl_int_sgn(bmap->ineq[i][1+d]) ==
1193 isl_int_sgn(bmap->ineq[j][1+d]))
1195 k = isl_basic_map_alloc_inequality(bmap);
1198 isl_seq_cpy(bmap->ineq[k], bmap->ineq[i],
1200 isl_seq_clr(bmap->ineq[k]+1+total, extra);
1201 isl_seq_elim(bmap->ineq[k], bmap->ineq[j],
1202 1+d, 1+total, NULL);
1204 isl_basic_map_drop_inequality(bmap, i);
1207 if (n_lower > 0 && n_upper > 0) {
1208 bmap = normalize_constraints(bmap);
1209 bmap = remove_duplicate_constraints(bmap, NULL);
1210 bmap = isl_basic_map_gauss(bmap, NULL);
1211 bmap = isl_basic_map_convex_hull(bmap);
1214 if (F_ISSET(bmap, ISL_BASIC_MAP_EMPTY))
1220 isl_basic_map_free(bmap);
1224 struct isl_basic_set *isl_basic_set_eliminate_vars(
1225 struct isl_basic_set *bset, unsigned pos, unsigned n)
1227 return (struct isl_basic_set *)isl_basic_map_eliminate_vars(
1228 (struct isl_basic_map *)bset, pos, n);
1231 /* Project out n dimensions starting at first using Fourier-Motzkin */
1232 struct isl_set *isl_set_remove_dims(struct isl_set *set,
1233 unsigned first, unsigned n)
1240 set = isl_set_cow(set);
1243 isl_assert(set->ctx, first+n <= set->dim, goto error);
1245 for (i = 0; i < set->n; ++i) {
1246 set->p[i] = isl_basic_set_eliminate_vars(set->p[i],
1247 set->nparam + first, n);
1251 set = isl_set_drop_dims(set, first, n);
1258 /* Project out n dimensions starting at first using Fourier-Motzkin */
1259 struct isl_basic_set *isl_basic_set_remove_dims(struct isl_basic_set *bset,
1260 unsigned first, unsigned n)
1262 bset = isl_basic_set_eliminate_vars(bset, bset->nparam + first, n);
1263 bset = isl_basic_set_drop_dims(bset, first, n);
1267 /* Elimininate divs based on inequalities
1269 static struct isl_basic_map *eliminate_divs_ineq(
1270 struct isl_basic_map *bmap, int *progress)
1275 struct isl_ctx *ctx;
1281 off = 1 + bmap->nparam + bmap->n_in + bmap->n_out;
1283 for (d = bmap->n_div - 1; d >= 0 ; --d) {
1284 for (i = 0; i < bmap->n_eq; ++i)
1285 if (!isl_int_is_zero(bmap->eq[i][off + d]))
1289 for (i = 0; i < bmap->n_ineq; ++i)
1290 if (isl_int_abs_gt(bmap->ineq[i][off + d], ctx->one))
1292 if (i < bmap->n_ineq)
1295 bmap = isl_basic_map_eliminate_vars(bmap, (off-1)+d, 1);
1296 if (F_ISSET(bmap, ISL_BASIC_MAP_EMPTY))
1298 bmap = isl_basic_map_drop_div(bmap, d);
1305 struct isl_basic_map *isl_basic_map_simplify(struct isl_basic_map *bmap)
1312 bmap = normalize_constraints(bmap);
1313 bmap = eliminate_divs_eq(bmap, &progress);
1314 bmap = eliminate_divs_ineq(bmap, &progress);
1315 bmap = isl_basic_map_gauss(bmap, &progress);
1316 bmap = remove_duplicate_divs(bmap, &progress);
1317 bmap = remove_duplicate_constraints(bmap, &progress);
1322 struct isl_basic_set *isl_basic_set_simplify(struct isl_basic_set *bset)
1324 return (struct isl_basic_set *)
1325 isl_basic_map_simplify((struct isl_basic_map *)bset);
1328 static void dump_term(struct isl_basic_map *bmap,
1329 isl_int c, int pos, FILE *out)
1331 unsigned in = bmap->n_in;
1332 unsigned dim = bmap->n_in + bmap->n_out;
1334 isl_int_print(out, c);
1336 if (!isl_int_is_one(c))
1337 isl_int_print(out, c);
1338 if (pos < 1 + bmap->nparam)
1339 fprintf(out, "p%d", pos - 1);
1340 else if (pos < 1 + bmap->nparam + in)
1341 fprintf(out, "i%d", pos - 1 - bmap->nparam);
1342 else if (pos < 1 + bmap->nparam + dim)
1343 fprintf(out, "o%d", pos - 1 - bmap->nparam - in);
1345 fprintf(out, "e%d", pos - 1 - bmap->nparam - dim);
1349 static void dump_constraint_sign(struct isl_basic_map *bmap, isl_int *c,
1350 int sign, FILE *out)
1354 unsigned len = 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
1358 for (i = 0, first = 1; i < len; ++i) {
1359 if (isl_int_sgn(c[i]) * sign <= 0)
1362 fprintf(out, " + ");
1364 isl_int_abs(v, c[i]);
1365 dump_term(bmap, v, i, out);
1372 static void dump_constraint(struct isl_basic_map *bmap, isl_int *c,
1373 const char *op, FILE *out, int indent)
1377 fprintf(out, "%*s", indent, "");
1379 dump_constraint_sign(bmap, c, 1, out);
1380 fprintf(out, " %s ", op);
1381 dump_constraint_sign(bmap, c, -1, out);
1385 for (i = bmap->n_div; i < bmap->extra; ++i) {
1386 if (isl_int_is_zero(c[1+bmap->nparam+bmap->n_in+bmap->n_out+i]))
1388 fprintf(out, "%*s", indent, "");
1389 fprintf(out, "ERROR: unused div coefficient not zero\n");
1393 static void dump_constraints(struct isl_basic_map *bmap,
1394 isl_int **c, unsigned n,
1395 const char *op, FILE *out, int indent)
1399 for (i = 0; i < n; ++i)
1400 dump_constraint(bmap, c[i], op, out, indent);
1403 static void dump_affine(struct isl_basic_map *bmap, isl_int *exp, FILE *out)
1407 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
1409 for (j = 0; j < 1 + total; ++j) {
1410 if (isl_int_is_zero(exp[j]))
1412 if (!first && isl_int_is_pos(exp[j]))
1414 dump_term(bmap, exp[j], j, out);
1419 static void dump(struct isl_basic_map *bmap, FILE *out, int indent)
1423 dump_constraints(bmap, bmap->eq, bmap->n_eq, "=", out, indent);
1424 dump_constraints(bmap, bmap->ineq, bmap->n_ineq, ">=", out, indent);
1426 for (i = 0; i < bmap->n_div; ++i) {
1427 fprintf(out, "%*s", indent, "");
1428 fprintf(out, "e%d = [(", i);
1429 dump_affine(bmap, bmap->div[i]+1, out);
1431 isl_int_print(out, bmap->div[i][0]);
1432 fprintf(out, "]\n");
1436 void isl_basic_set_dump(struct isl_basic_set *bset, FILE *out, int indent)
1439 fprintf(out, "null basic set\n");
1443 fprintf(out, "%*s", indent, "");
1444 fprintf(out, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n",
1445 bset->ref, bset->nparam, bset->dim, bset->extra,
1447 dump((struct isl_basic_map *)bset, out, indent);
1450 void isl_basic_map_dump(struct isl_basic_map *bmap, FILE *out, int indent)
1453 fprintf(out, "null basic map\n");
1457 fprintf(out, "%*s", indent, "");
1458 fprintf(out, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, flags: %x\n",
1460 bmap->nparam, bmap->n_in, bmap->n_out, bmap->extra, bmap->flags);
1461 dump(bmap, out, indent);
1464 int isl_inequality_negate(struct isl_basic_map *bmap, unsigned pos)
1466 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
1469 isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
1470 isl_seq_neg(bmap->ineq[pos], bmap->ineq[pos], 1 + total);
1471 isl_int_sub_ui(bmap->ineq[pos][0], bmap->ineq[pos][0], 1);
1475 struct isl_set *isl_set_alloc(struct isl_ctx *ctx,
1476 unsigned nparam, unsigned dim, int n, unsigned flags)
1478 struct isl_set *set;
1480 isl_assert(ctx, n >= 0, return NULL);
1481 set = isl_alloc(ctx, struct isl_set,
1482 sizeof(struct isl_set) +
1483 n * sizeof(struct isl_basic_set *));
1492 set->nparam = nparam;
1499 struct isl_set *isl_set_dup(struct isl_set *set)
1502 struct isl_set *dup;
1507 dup = isl_set_alloc(set->ctx, set->nparam, set->dim, set->n, set->flags);
1510 for (i = 0; i < set->n; ++i)
1511 dup = isl_set_add(dup,
1512 isl_basic_set_dup(set->p[i]));
1516 struct isl_set *isl_set_from_basic_set(struct isl_basic_set *bset)
1518 struct isl_set *set;
1523 set = isl_set_alloc(bset->ctx, bset->nparam, bset->dim, 1, ISL_MAP_DISJOINT);
1525 isl_basic_set_free(bset);
1528 return isl_set_add(set, bset);
1531 struct isl_map *isl_map_from_basic_map(struct isl_basic_map *bmap)
1533 struct isl_map *map;
1538 map = isl_map_alloc(bmap->ctx, bmap->nparam, bmap->n_in, bmap->n_out, 1,
1541 isl_basic_map_free(bmap);
1544 return isl_map_add(map, bmap);
1547 struct isl_set *isl_set_add(struct isl_set *set, struct isl_basic_set *bset)
1551 isl_assert(set->ctx, set->nparam == bset->nparam, goto error);
1552 isl_assert(set->ctx, set->dim == bset->dim, goto error);
1553 isl_assert(set->ctx, set->n < set->size, goto error);
1554 set->p[set->n] = bset;
1561 isl_basic_set_free(bset);
1565 void isl_set_free(struct isl_set *set)
1575 isl_ctx_deref(set->ctx);
1576 for (i = 0; i < set->n; ++i)
1577 isl_basic_set_free(set->p[i]);
1581 void isl_set_dump(struct isl_set *set, FILE *out, int indent)
1586 fprintf(out, "null set\n");
1590 fprintf(out, "%*s", indent, "");
1591 fprintf(out, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
1592 set->ref, set->n, set->nparam, set->dim, set->flags);
1593 for (i = 0; i < set->n; ++i) {
1594 fprintf(out, "%*s", indent, "");
1595 fprintf(out, "basic set %d:\n", i);
1596 isl_basic_set_dump(set->p[i], out, indent+4);
1600 void isl_map_dump(struct isl_map *map, FILE *out, int indent)
1605 fprintf(out, "null map\n");
1609 fprintf(out, "%*s", indent, "");
1610 fprintf(out, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, flags: %x\n",
1611 map->ref, map->n, map->nparam, map->n_in, map->n_out,
1613 for (i = 0; i < map->n; ++i) {
1614 fprintf(out, "%*s", indent, "");
1615 fprintf(out, "basic map %d:\n", i);
1616 isl_basic_map_dump(map->p[i], out, indent+4);
1620 struct isl_basic_map *isl_basic_map_intersect_domain(
1621 struct isl_basic_map *bmap, struct isl_basic_set *bset)
1623 struct isl_basic_map *bmap_domain;
1628 isl_assert(bset->ctx, bset->dim == bmap->n_in, goto error);
1629 isl_assert(bset->ctx, bset->nparam == bmap->nparam, goto error);
1631 bmap = isl_basic_map_extend(bmap,
1632 bset->nparam, bmap->n_in, bmap->n_out,
1633 bset->n_div, bset->n_eq, bset->n_ineq);
1636 bmap_domain = isl_basic_map_from_basic_set(bset,
1638 bmap = add_constraints(bmap, bmap_domain, 0, 0);
1640 bmap = isl_basic_map_simplify(bmap);
1641 return isl_basic_map_finalize(bmap);
1643 isl_basic_map_free(bmap);
1644 isl_basic_set_free(bset);
1648 struct isl_basic_map *isl_basic_map_intersect_range(
1649 struct isl_basic_map *bmap, struct isl_basic_set *bset)
1651 struct isl_basic_map *bmap_range;
1656 isl_assert(bset->ctx, bset->dim == bmap->n_out, goto error);
1657 isl_assert(bset->ctx, bset->nparam == bmap->nparam, goto error);
1659 bmap = isl_basic_map_extend(bmap,
1660 bset->nparam, bmap->n_in, bmap->n_out,
1661 bset->n_div, bset->n_eq, bset->n_ineq);
1664 bmap_range = isl_basic_map_from_basic_set(bset,
1666 bmap = add_constraints(bmap, bmap_range, 0, 0);
1668 bmap = isl_basic_map_simplify(bmap);
1669 return isl_basic_map_finalize(bmap);
1671 isl_basic_map_free(bmap);
1672 isl_basic_set_free(bset);
1676 struct isl_basic_map *isl_basic_map_intersect(
1677 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
1679 if (!bmap1 || !bmap2)
1682 isl_assert(bmap1->ctx, bmap1->nparam == bmap2->nparam, goto error);
1683 isl_assert(bmap1->ctx, bmap1->n_in == bmap2->n_in, goto error);
1684 isl_assert(bmap1->ctx, bmap1->n_out == bmap2->n_out, goto error);
1686 bmap1 = isl_basic_map_extend(bmap1,
1687 bmap1->nparam, bmap1->n_in, bmap1->n_out,
1688 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
1691 bmap1 = add_constraints(bmap1, bmap2, 0, 0);
1693 bmap1 = isl_basic_map_simplify(bmap1);
1694 return isl_basic_map_finalize(bmap1);
1696 isl_basic_map_free(bmap1);
1697 isl_basic_map_free(bmap2);
1701 struct isl_basic_set *isl_basic_set_intersect(
1702 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
1704 return (struct isl_basic_set *)
1705 isl_basic_map_intersect(
1706 (struct isl_basic_map *)bset1,
1707 (struct isl_basic_map *)bset2);
1710 struct isl_map *isl_map_intersect(struct isl_map *map1, struct isl_map *map2)
1713 struct isl_map *result;
1719 if (F_ISSET(map1, ISL_MAP_DISJOINT) &&
1720 F_ISSET(map2, ISL_MAP_DISJOINT))
1721 FL_SET(flags, ISL_MAP_DISJOINT);
1723 result = isl_map_alloc(map1->ctx, map1->nparam, map1->n_in, map1->n_out,
1724 map1->n * map2->n, flags);
1727 for (i = 0; i < map1->n; ++i)
1728 for (j = 0; j < map2->n; ++j) {
1729 struct isl_basic_map *part;
1730 part = isl_basic_map_intersect(
1731 isl_basic_map_copy(map1->p[i]),
1732 isl_basic_map_copy(map2->p[j]));
1733 if (isl_basic_map_is_empty(part))
1734 isl_basic_map_free(part);
1736 result = isl_map_add(result, part);
1749 struct isl_set *isl_set_intersect(struct isl_set *set1, struct isl_set *set2)
1751 return (struct isl_set *)
1752 isl_map_intersect((struct isl_map *)set1,
1753 (struct isl_map *)set2);
1756 struct isl_basic_map *isl_basic_map_reverse(struct isl_basic_map *bmap)
1758 struct isl_basic_set *bset;
1763 bmap = isl_basic_map_cow(bmap);
1767 bset = isl_basic_set_from_basic_map(bmap);
1768 bset = isl_basic_set_swap_vars(bset, in);
1769 return isl_basic_map_from_basic_set(bset, bset->dim-in, in);
1772 /* Turn final n dimensions into existentially quantified variables.
1774 struct isl_basic_set *isl_basic_set_project_out(
1775 struct isl_basic_set *bset, unsigned n, unsigned flags)
1785 isl_assert(bset->ctx, n <= bset->dim, goto error);
1790 bset = isl_basic_set_cow(bset);
1792 row_size = 1 + bset->nparam + bset->dim + bset->extra;
1793 old = bset->block2.data;
1794 bset->block2 = isl_blk_extend(bset->ctx, bset->block2,
1795 (bset->extra + n) * (1 + row_size));
1796 if (!bset->block2.data)
1798 new_div = isl_alloc_array(ctx, isl_int *, bset->extra + n);
1801 for (i = 0; i < n; ++i) {
1802 new_div[i] = bset->block2.data +
1803 (bset->extra + i) * (1 + row_size);
1804 isl_seq_clr(new_div[i], 1 + row_size);
1806 for (i = 0; i < bset->extra; ++i)
1807 new_div[n + i] = bset->block2.data + (bset->div[i] - old);
1809 bset->div = new_div;
1813 bset = isl_basic_set_simplify(bset);
1814 return isl_basic_set_finalize(bset);
1816 isl_basic_set_free(bset);
1820 struct isl_basic_map *isl_basic_map_apply_range(
1821 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
1823 struct isl_basic_set *bset;
1824 unsigned n_in, n_out;
1826 if (!bmap1 || !bmap2)
1829 isl_assert(bmap->ctx, bmap1->n_out == bmap2->n_in, goto error);
1830 isl_assert(bmap->ctx, bmap1->nparam == bmap2->nparam, goto error);
1833 n_out = bmap2->n_out;
1835 bmap2 = isl_basic_map_reverse(bmap2);
1838 bmap1 = isl_basic_map_extend(bmap1, bmap1->nparam,
1839 bmap1->n_in + bmap2->n_in, bmap1->n_out,
1840 bmap2->extra, bmap2->n_eq, bmap2->n_ineq);
1843 bmap1 = add_constraints(bmap1, bmap2, bmap1->n_in - bmap2->n_in, 0);
1844 bmap1 = isl_basic_map_simplify(bmap1);
1845 bset = isl_basic_set_from_basic_map(bmap1);
1846 bset = isl_basic_set_project_out(bset,
1847 bset->dim - (n_in + n_out), 0);
1848 return isl_basic_map_from_basic_set(bset, n_in, n_out);
1850 isl_basic_map_free(bmap1);
1851 isl_basic_map_free(bmap2);
1855 struct isl_basic_set *isl_basic_set_apply(
1856 struct isl_basic_set *bset, struct isl_basic_map *bmap)
1861 isl_assert(bset->ctx, bset->dim == bmap->n_in, goto error);
1863 return (struct isl_basic_set *)
1864 isl_basic_map_apply_range((struct isl_basic_map *)bset, bmap);
1866 isl_basic_set_free(bset);
1867 isl_basic_map_free(bmap);
1871 struct isl_basic_map *isl_basic_map_apply_domain(
1872 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
1874 if (!bmap1 || !bmap2)
1877 isl_assert(ctx, bmap1->n_in == bmap2->n_in, goto error);
1878 isl_assert(ctx, bmap1->nparam == bmap2->nparam, goto error);
1880 bmap1 = isl_basic_map_reverse(bmap1);
1881 bmap1 = isl_basic_map_apply_range(bmap1, bmap2);
1882 return isl_basic_map_reverse(bmap1);
1884 isl_basic_map_free(bmap1);
1885 isl_basic_map_free(bmap2);
1889 static struct isl_basic_map *var_equal(struct isl_ctx *ctx,
1890 struct isl_basic_map *bmap, unsigned pos)
1893 i = isl_basic_map_alloc_equality(bmap);
1896 isl_seq_clr(bmap->eq[i],
1897 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->extra);
1898 isl_int_set_si(bmap->eq[i][1+bmap->nparam+pos], -1);
1899 isl_int_set_si(bmap->eq[i][1+bmap->nparam+bmap->n_in+pos], 1);
1900 return isl_basic_map_finalize(bmap);
1902 isl_basic_map_free(bmap);
1906 static struct isl_basic_map *var_more(struct isl_ctx *ctx,
1907 struct isl_basic_map *bmap, unsigned pos)
1910 i = isl_basic_map_alloc_inequality(bmap);
1913 isl_seq_clr(bmap->ineq[i],
1914 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->extra);
1915 isl_int_set_si(bmap->ineq[i][0], -1);
1916 isl_int_set_si(bmap->ineq[i][1+bmap->nparam+pos], -1);
1917 isl_int_set_si(bmap->ineq[i][1+bmap->nparam+bmap->n_in+pos], 1);
1918 return isl_basic_map_finalize(bmap);
1920 isl_basic_map_free(bmap);
1924 static struct isl_basic_map *var_less(struct isl_ctx *ctx,
1925 struct isl_basic_map *bmap, unsigned pos)
1928 i = isl_basic_map_alloc_inequality(bmap);
1931 isl_seq_clr(bmap->ineq[i],
1932 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->extra);
1933 isl_int_set_si(bmap->ineq[i][0], -1);
1934 isl_int_set_si(bmap->ineq[i][1+bmap->nparam+pos], 1);
1935 isl_int_set_si(bmap->ineq[i][1+bmap->nparam+bmap->n_in+pos], -1);
1936 return isl_basic_map_finalize(bmap);
1938 isl_basic_map_free(bmap);
1942 struct isl_basic_map *isl_basic_map_equal(struct isl_ctx *ctx,
1943 unsigned nparam, unsigned in, unsigned out, unsigned n_equal)
1946 struct isl_basic_map *bmap;
1947 bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, n_equal, 0);
1950 for (i = 0; i < n_equal && bmap; ++i)
1951 bmap = var_equal(ctx, bmap, i);
1952 return isl_basic_map_finalize(bmap);
1955 struct isl_basic_map *isl_basic_map_less_at(struct isl_ctx *ctx,
1956 unsigned nparam, unsigned in, unsigned out, unsigned pos)
1959 struct isl_basic_map *bmap;
1960 bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, pos, 1);
1963 for (i = 0; i < pos && bmap; ++i)
1964 bmap = var_equal(ctx, bmap, i);
1966 bmap = var_less(ctx, bmap, pos);
1967 return isl_basic_map_finalize(bmap);
1970 struct isl_basic_map *isl_basic_map_more_at(struct isl_ctx *ctx,
1971 unsigned nparam, unsigned in, unsigned out, unsigned pos)
1974 struct isl_basic_map *bmap;
1975 bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, pos, 1);
1978 for (i = 0; i < pos && bmap; ++i)
1979 bmap = var_equal(ctx, bmap, i);
1981 bmap = var_more(ctx, bmap, pos);
1982 return isl_basic_map_finalize(bmap);
1985 struct isl_basic_map *isl_basic_map_from_basic_set(
1986 struct isl_basic_set *bset, unsigned n_in, unsigned n_out)
1988 struct isl_basic_map *bmap;
1990 bset = isl_basic_set_cow(bset);
1994 isl_assert(ctx, bset->dim == n_in + n_out, goto error);
1995 bmap = (struct isl_basic_map *) bset;
1997 bmap->n_out = n_out;
1998 return isl_basic_map_finalize(bmap);
2000 isl_basic_set_free(bset);
2004 struct isl_basic_set *isl_basic_set_from_basic_map(struct isl_basic_map *bmap)
2008 if (bmap->n_in == 0)
2009 return (struct isl_basic_set *)bmap;
2010 bmap = isl_basic_map_cow(bmap);
2013 bmap->n_out += bmap->n_in;
2015 bmap = isl_basic_map_finalize(bmap);
2016 return (struct isl_basic_set *)bmap;
2021 /* For a div d = floor(f/m), add the constraints
2024 * -(f-(n-1)) + m d >= 0
2026 * Note that the second constraint is the negation of
2030 static int add_div_constraints(struct isl_basic_map *bmap, unsigned div)
2033 unsigned div_pos = 1 + bmap->nparam + bmap->n_in + bmap->n_out + div;
2034 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->extra;
2036 i = isl_basic_map_alloc_inequality(bmap);
2039 isl_seq_cpy(bmap->ineq[i], bmap->div[div]+1, 1+total);
2040 isl_int_neg(bmap->ineq[i][div_pos], bmap->div[div][0]);
2042 j = isl_basic_map_alloc_inequality(bmap);
2045 isl_seq_neg(bmap->ineq[j], bmap->ineq[i], 1 + total);
2046 isl_int_add(bmap->ineq[j][0], bmap->ineq[j][0], bmap->ineq[j][div_pos]);
2047 isl_int_sub_ui(bmap->ineq[j][0], bmap->ineq[j][0], 1);
2051 struct isl_basic_set *isl_basic_map_underlying_set(
2052 struct isl_basic_map *bmap)
2056 if (bmap->nparam == 0 && bmap->n_in == 0 && bmap->n_div == 0)
2057 return (struct isl_basic_set *)bmap;
2058 bmap = isl_basic_map_cow(bmap);
2061 bmap->n_out += bmap->nparam + bmap->n_in + bmap->n_div;
2064 bmap->extra -= bmap->n_div;
2066 bmap = isl_basic_map_finalize(bmap);
2067 return (struct isl_basic_set *)bmap;
2072 struct isl_basic_map *isl_basic_map_overlying_set(
2073 struct isl_basic_set *bset, struct isl_basic_map *like)
2075 struct isl_basic_map *bmap;
2076 struct isl_ctx *ctx;
2083 isl_assert(ctx, bset->dim ==
2084 like->nparam + like->n_in + like->n_out + like->n_div,
2086 if (like->nparam == 0 && like->n_in == 0 && like->n_div == 0) {
2087 isl_basic_map_free(like);
2088 return (struct isl_basic_map *)bset;
2090 bset = isl_basic_set_cow(bset);
2093 total = bset->dim + bset->extra;
2094 bmap = (struct isl_basic_map *)bset;
2095 bmap->nparam = like->nparam;
2096 bmap->n_in = like->n_in;
2097 bmap->n_out = like->n_out;
2098 bmap->extra += like->n_div;
2101 ltotal = total - bmap->extra + like->extra;
2104 bmap->block2 = isl_blk_extend(ctx, bmap->block2,
2105 bmap->extra * (1 + 1 + total));
2106 if (isl_blk_is_error(bmap->block2))
2108 bmap->div = isl_realloc_array(ctx, bmap->div, isl_int *,
2112 bmap = isl_basic_map_extend(bmap, bmap->nparam,
2113 bmap->n_in, bmap->n_out, 0, 0, 2 * like->n_div);
2114 for (i = 0; i < like->n_div; ++i) {
2115 k = isl_basic_map_alloc_div(bmap);
2118 isl_seq_cpy(bmap->div[k], like->div[i], 1 + 1 + ltotal);
2119 isl_seq_clr(bmap->div[k]+1+1+ltotal, total - ltotal);
2120 if (add_div_constraints(bmap, k) < 0)
2124 isl_basic_map_free(like);
2125 bmap = isl_basic_map_finalize(bmap);
2128 isl_basic_map_free(like);
2129 isl_basic_set_free(bset);
2133 struct isl_basic_set *isl_basic_set_from_underlying_set(
2134 struct isl_basic_set *bset, struct isl_basic_set *like)
2136 return (struct isl_basic_set *)
2137 isl_basic_map_overlying_set(bset, (struct isl_basic_map *)like);
2140 struct isl_set *isl_set_from_underlying_set(
2141 struct isl_set *set, struct isl_basic_set *like)
2147 isl_assert(set->ctx, set->dim == like->nparam + like->dim + like->n_div,
2149 if (like->nparam == 0 && like->n_div == 0) {
2150 isl_basic_set_free(like);
2153 set = isl_set_cow(set);
2156 for (i = 0; i < set->n; ++i) {
2157 set->p[i] = isl_basic_set_from_underlying_set(set->p[i],
2158 isl_basic_set_copy(like));
2162 set->nparam = like->nparam;
2163 set->dim = like->dim;
2164 isl_basic_set_free(like);
2167 isl_basic_set_free(like);
2172 struct isl_set *isl_map_underlying_set(struct isl_map *map)
2176 map = isl_map_align_divs(map);
2177 map = isl_map_cow(map);
2181 for (i = 0; i < map->n; ++i) {
2182 map->p[i] = (struct isl_basic_map *)
2183 isl_basic_map_underlying_set(map->p[i]);
2188 map->n_out += map->nparam + map->n_in;
2190 map->n_out = map->p[0]->n_out;
2193 return (struct isl_set *)map;
2199 struct isl_set *isl_set_to_underlying_set(struct isl_set *set)
2201 return (struct isl_set *)isl_map_underlying_set((struct isl_map *)set);
2204 struct isl_basic_set *isl_basic_map_domain(struct isl_basic_map *bmap)
2206 struct isl_basic_set *domain;
2210 n_out = bmap->n_out;
2211 domain = isl_basic_set_from_basic_map(bmap);
2212 return isl_basic_set_project_out(domain, n_out, 0);
2215 struct isl_basic_set *isl_basic_map_range(struct isl_basic_map *bmap)
2217 return isl_basic_map_domain(isl_basic_map_reverse(bmap));
2220 struct isl_set *isl_map_range(struct isl_map *map)
2223 struct isl_set *set;
2227 map = isl_map_cow(map);
2231 set = (struct isl_set *) map;
2233 for (i = 0; i < map->n; ++i) {
2234 set->p[i] = isl_basic_map_range(map->p[i]);
2238 F_CLR(set, ISL_MAP_DISJOINT);
2245 struct isl_map *isl_map_from_set(struct isl_set *set,
2246 unsigned n_in, unsigned n_out)
2249 struct isl_map *map = NULL;
2253 isl_assert(set->ctx, set->dim == n_in + n_out, goto error);
2254 set = isl_set_cow(set);
2257 map = (struct isl_map *)set;
2258 for (i = 0; i < set->n; ++i) {
2259 map->p[i] = isl_basic_map_from_basic_set(
2260 set->p[i], n_in, n_out);
2272 struct isl_set *isl_set_from_map(struct isl_map *map)
2275 struct isl_set *set = NULL;
2279 map = isl_map_cow(map);
2282 map->n_out += map->n_in;
2284 set = (struct isl_set *)map;
2285 for (i = 0; i < map->n; ++i) {
2286 set->p[i] = isl_basic_set_from_basic_map(map->p[i]);
2296 struct isl_map *isl_map_alloc(struct isl_ctx *ctx,
2297 unsigned nparam, unsigned in, unsigned out, int n,
2300 struct isl_map *map;
2302 map = isl_alloc(ctx, struct isl_map,
2303 sizeof(struct isl_map) +
2304 n * sizeof(struct isl_basic_map *));
2313 map->nparam = nparam;
2320 struct isl_basic_map *isl_basic_map_empty(struct isl_ctx *ctx,
2321 unsigned nparam, unsigned in, unsigned out)
2323 struct isl_basic_map *bmap;
2324 bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, 1, 0);
2325 bmap = isl_basic_map_set_to_empty(bmap);
2329 struct isl_basic_set *isl_basic_set_empty(struct isl_ctx *ctx,
2330 unsigned nparam, unsigned dim)
2332 struct isl_basic_set *bset;
2333 bset = isl_basic_set_alloc(ctx, nparam, dim, 0, 1, 0);
2334 bset = isl_basic_set_set_to_empty(bset);
2338 struct isl_basic_map *isl_basic_map_universe(struct isl_ctx *ctx,
2339 unsigned nparam, unsigned in, unsigned out)
2341 struct isl_basic_map *bmap;
2342 bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, 0, 0);
2346 struct isl_basic_set *isl_basic_set_universe(struct isl_ctx *ctx,
2347 unsigned nparam, unsigned dim)
2349 struct isl_basic_set *bset;
2350 bset = isl_basic_set_alloc(ctx, nparam, dim, 0, 0, 0);
2354 struct isl_map *isl_map_empty(struct isl_ctx *ctx,
2355 unsigned nparam, unsigned in, unsigned out)
2357 return isl_map_alloc(ctx, nparam, in, out, 0, ISL_MAP_DISJOINT);
2360 struct isl_set *isl_set_empty(struct isl_ctx *ctx,
2361 unsigned nparam, unsigned dim)
2363 return isl_set_alloc(ctx, nparam, dim, 0, ISL_MAP_DISJOINT);
2366 struct isl_map *isl_map_dup(struct isl_map *map)
2369 struct isl_map *dup;
2373 dup = isl_map_alloc(map->ctx, map->nparam, map->n_in, map->n_out, map->n,
2375 for (i = 0; i < map->n; ++i)
2376 dup = isl_map_add(dup,
2377 isl_basic_map_dup(map->p[i]));
2381 struct isl_map *isl_map_add(struct isl_map *map, struct isl_basic_map *bmap)
2385 isl_assert(map->ctx, map->nparam == bmap->nparam, goto error);
2386 isl_assert(map->ctx, map->n_in == bmap->n_in, goto error);
2387 isl_assert(map->ctx, map->n_out == bmap->n_out, goto error);
2388 isl_assert(map->ctx, map->n < map->size, goto error);
2389 map->p[map->n] = bmap;
2396 isl_basic_map_free(bmap);
2400 void isl_map_free(struct isl_map *map)
2410 isl_ctx_deref(map->ctx);
2411 for (i = 0; i < map->n; ++i)
2412 isl_basic_map_free(map->p[i]);
2416 struct isl_map *isl_map_extend(struct isl_map *base,
2417 unsigned nparam, unsigned n_in, unsigned n_out)
2421 base = isl_map_cow(base);
2425 isl_assert(base->ctx, base->nparam <= nparam, goto error);
2426 isl_assert(base->ctx, base->n_in <= n_in, goto error);
2427 isl_assert(base->ctx, base->n_out <= n_out, goto error);
2428 base->nparam = nparam;
2430 base->n_out = n_out;
2431 for (i = 0; i < base->n; ++i) {
2432 base->p[i] = isl_basic_map_extend(base->p[i],
2433 nparam, n_in, n_out, 0, 0, 0);
2443 struct isl_set *isl_set_extend(struct isl_set *base,
2444 unsigned nparam, unsigned dim)
2446 return (struct isl_set *)isl_map_extend((struct isl_map *)base,
2450 static struct isl_basic_map *isl_basic_map_fix_var(struct isl_basic_map *bmap,
2451 unsigned var, int value)
2455 bmap = isl_basic_map_cow(bmap);
2456 bmap = isl_basic_map_extend(bmap,
2457 bmap->nparam, bmap->n_in, bmap->n_out, 0, 1, 0);
2458 j = isl_basic_map_alloc_equality(bmap);
2461 isl_seq_clr(bmap->eq[j],
2462 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->extra);
2463 isl_int_set_si(bmap->eq[j][1 + var], -1);
2464 isl_int_set_si(bmap->eq[j][0], value);
2465 bmap = isl_basic_map_simplify(bmap);
2466 return isl_basic_map_finalize(bmap);
2468 isl_basic_map_free(bmap);
2472 struct isl_basic_map *isl_basic_map_fix_input_si(struct isl_basic_map *bmap,
2473 unsigned input, int value)
2477 isl_assert(bmap->ctx, input < bmap->n_in, goto error);
2478 return isl_basic_map_fix_var(bmap, bmap->nparam + input, value);
2480 isl_basic_map_free(bmap);
2484 struct isl_basic_set *isl_basic_set_fix_dim_si(struct isl_basic_set *bset,
2485 unsigned dim, int value)
2489 isl_assert(bset->ctx, dim < bset->dim, goto error);
2490 return (struct isl_basic_set *)
2491 isl_basic_map_fix_var((struct isl_basic_map *)bset,
2492 bset->nparam + dim, value);
2494 isl_basic_set_free(bset);
2498 struct isl_map *isl_map_fix_input_si(struct isl_map *map,
2499 unsigned input, int value)
2503 map = isl_map_cow(map);
2507 isl_assert(ctx, input < map->n_in, goto error);
2508 for (i = 0; i < map->n; ++i) {
2509 map->p[i] = isl_basic_map_fix_input_si(map->p[i], input, value);
2519 struct isl_set *isl_set_fix_dim_si(struct isl_set *set, unsigned dim, int value)
2523 set = isl_set_cow(set);
2527 isl_assert(set->ctx, dim < set->dim, goto error);
2528 for (i = 0; i < set->n; ++i) {
2529 set->p[i] = isl_basic_set_fix_dim_si(set->p[i], dim, value);
2539 struct isl_map *isl_map_reverse(struct isl_map *map)
2544 map = isl_map_cow(map);
2549 map->n_in = map->n_out;
2551 for (i = 0; i < map->n; ++i) {
2552 map->p[i] = isl_basic_map_reverse(map->p[i]);
2562 struct isl_map *isl_basic_map_lexmax(
2563 struct isl_basic_map *bmap, struct isl_basic_set *dom,
2564 struct isl_set **empty)
2566 return isl_pip_basic_map_lexmax(bmap, dom, empty);
2569 struct isl_map *isl_basic_map_lexmin(
2570 struct isl_basic_map *bmap, struct isl_basic_set *dom,
2571 struct isl_set **empty)
2573 return isl_pip_basic_map_lexmin(bmap, dom, empty);
2576 struct isl_set *isl_basic_set_lexmin(struct isl_basic_set *bset)
2578 struct isl_basic_map *bmap = NULL;
2579 struct isl_basic_set *dom = NULL;
2580 struct isl_map *min;
2584 bmap = isl_basic_map_from_basic_set(bset, 0, bset->dim);
2587 dom = isl_basic_set_alloc(bmap->ctx, bmap->nparam, 0, 0, 0, 0);
2590 min = isl_basic_map_lexmin(bmap, dom, NULL);
2591 return isl_map_range(min);
2593 isl_basic_map_free(bmap);
2597 struct isl_map *isl_basic_map_compute_divs(struct isl_basic_map *bmap)
2601 if (bmap->n_div == 0)
2602 return isl_map_from_basic_map(bmap);
2603 return isl_pip_basic_map_compute_divs(bmap);
2606 struct isl_map *isl_map_compute_divs(struct isl_map *map)
2609 struct isl_map *res;
2615 res = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[0]));
2616 for (i = 1 ; i < map->n; ++i) {
2618 r2 = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[i]));
2619 if (F_ISSET(map, ISL_MAP_DISJOINT))
2620 res = isl_map_union_disjoint(res, r2);
2622 res = isl_map_union(res, r2);
2629 struct isl_set *isl_basic_set_compute_divs(struct isl_basic_set *bset)
2631 return (struct isl_set *)
2632 isl_basic_map_compute_divs((struct isl_basic_map *)bset);
2635 struct isl_set *isl_set_compute_divs(struct isl_set *set)
2637 return (struct isl_set *)
2638 isl_map_compute_divs((struct isl_map *)set);
2641 struct isl_set *isl_map_domain(struct isl_map *map)
2644 struct isl_set *set;
2649 map = isl_map_cow(map);
2653 set = (struct isl_set *)map;
2654 set->dim = map->n_in;
2656 for (i = 0; i < map->n; ++i) {
2657 set->p[i] = isl_basic_map_domain(map->p[i]);
2661 F_CLR(set, ISL_MAP_DISJOINT);
2668 struct isl_map *isl_map_union_disjoint(
2669 struct isl_map *map1, struct isl_map *map2)
2673 struct isl_map *map = NULL;
2687 isl_assert(map1->ctx, map1->nparam == map2->nparam, goto error);
2688 isl_assert(map1->ctx, map1->n_in == map2->n_in, goto error);
2689 isl_assert(map1->ctx, map1->n_out == map2->n_out, goto error);
2691 if (F_ISSET(map1, ISL_MAP_DISJOINT) &&
2692 F_ISSET(map2, ISL_MAP_DISJOINT))
2693 FL_SET(flags, ISL_MAP_DISJOINT);
2695 map = isl_map_alloc(map1->ctx, map1->nparam, map1->n_in, map1->n_out,
2696 map1->n + map2->n, flags);
2699 for (i = 0; i < map1->n; ++i) {
2700 map = isl_map_add(map,
2701 isl_basic_map_copy(map1->p[i]));
2705 for (i = 0; i < map2->n; ++i) {
2706 map = isl_map_add(map,
2707 isl_basic_map_copy(map2->p[i]));
2721 struct isl_map *isl_map_union(struct isl_map *map1, struct isl_map *map2)
2723 map1 = isl_map_union_disjoint(map1, map2);
2727 F_CLR(map1, ISL_MAP_DISJOINT);
2731 struct isl_set *isl_set_union_disjoint(
2732 struct isl_set *set1, struct isl_set *set2)
2734 return (struct isl_set *)
2735 isl_map_union_disjoint(
2736 (struct isl_map *)set1, (struct isl_map *)set2);
2739 struct isl_set *isl_set_union(struct isl_set *set1, struct isl_set *set2)
2741 return (struct isl_set *)
2742 isl_map_union((struct isl_map *)set1, (struct isl_map *)set2);
2745 struct isl_map *isl_map_intersect_range(
2746 struct isl_map *map, struct isl_set *set)
2749 struct isl_map *result;
2755 if (F_ISSET(map, ISL_MAP_DISJOINT) &&
2756 F_ISSET(set, ISL_MAP_DISJOINT))
2757 FL_SET(flags, ISL_MAP_DISJOINT);
2759 result = isl_map_alloc(map->ctx, map->nparam, map->n_in, map->n_out,
2760 map->n * set->n, flags);
2763 for (i = 0; i < map->n; ++i)
2764 for (j = 0; j < set->n; ++j) {
2765 result = isl_map_add(result,
2766 isl_basic_map_intersect_range(
2767 isl_basic_map_copy(map->p[i]),
2768 isl_basic_set_copy(set->p[j])));
2781 struct isl_map *isl_map_intersect_domain(
2782 struct isl_map *map, struct isl_set *set)
2784 return isl_map_reverse(
2785 isl_map_intersect_range(isl_map_reverse(map), set));
2788 struct isl_map *isl_map_apply_domain(
2789 struct isl_map *map1, struct isl_map *map2)
2793 map1 = isl_map_reverse(map1);
2794 map1 = isl_map_apply_range(map1, map2);
2795 return isl_map_reverse(map1);
2802 struct isl_map *isl_map_apply_range(
2803 struct isl_map *map1, struct isl_map *map2)
2805 struct isl_map *result;
2811 isl_assert(map1->ctx, map1->nparam == map2->nparam, goto error);
2812 isl_assert(map1->ctx, map1->n_out == map2->n_in, goto error);
2814 result = isl_map_alloc(map1->ctx, map1->nparam, map1->n_in, map2->n_out,
2815 map1->n * map2->n, 0);
2818 for (i = 0; i < map1->n; ++i)
2819 for (j = 0; j < map2->n; ++j) {
2820 result = isl_map_add(result,
2821 isl_basic_map_apply_range(
2822 isl_basic_map_copy(map1->p[i]),
2823 isl_basic_map_copy(map2->p[j])));
2829 if (result && result->n <= 1)
2830 F_SET(result, ISL_MAP_DISJOINT);
2839 * returns range - domain
2841 struct isl_basic_set *isl_basic_map_deltas(struct isl_basic_map *bmap)
2843 struct isl_basic_set *bset;
2849 isl_assert(bmap->ctx, bmap->n_in == bmap->n_out, goto error);
2851 bset = isl_basic_set_from_basic_map(bmap);
2852 bset = isl_basic_set_extend(bset, bset->nparam, 3*dim, 0,
2854 bset = isl_basic_set_swap_vars(bset, 2*dim);
2855 for (i = 0; i < dim; ++i) {
2856 int j = isl_basic_map_alloc_equality(
2857 (struct isl_basic_map *)bset);
2860 isl_seq_clr(bset->eq[j],
2861 1 + bset->nparam + bset->dim + bset->extra);
2862 isl_int_set_si(bset->eq[j][1+bset->nparam+i], 1);
2863 isl_int_set_si(bset->eq[j][1+bset->nparam+dim+i], 1);
2864 isl_int_set_si(bset->eq[j][1+bset->nparam+2*dim+i], -1);
2866 return isl_basic_set_project_out(bset, 2*dim, 0);
2868 isl_basic_map_free(bmap);
2873 * returns range - domain
2875 struct isl_set *isl_map_deltas(struct isl_map *map)
2878 struct isl_set *result;
2883 isl_assert(map->ctx, map->n_in == map->n_out, goto error);
2884 result = isl_set_alloc(map->ctx, map->nparam, map->n_in, map->n, map->flags);
2887 for (i = 0; i < map->n; ++i)
2888 result = isl_set_add(result,
2889 isl_basic_map_deltas(isl_basic_map_copy(map->p[i])));
2897 /* If the only constraints a div d=floor(f/m)
2898 * appears in are its two defining constraints
2901 * -(f - (m - 1)) + m d >= 0
2903 * then it can safely be removed.
2905 static int div_is_redundant(struct isl_basic_map *bmap, int div)
2908 unsigned pos = 1 + bmap->nparam + bmap->n_in + bmap->n_out + div;
2910 for (i = 0; i < bmap->n_eq; ++i)
2911 if (!isl_int_is_zero(bmap->eq[i][pos]))
2914 for (i = 0; i < bmap->n_ineq; ++i) {
2915 if (isl_int_is_zero(bmap->ineq[i][pos]))
2917 if (isl_int_eq(bmap->ineq[i][pos], bmap->div[div][0])) {
2919 isl_int_sub(bmap->div[div][1],
2920 bmap->div[div][1], bmap->div[div][0]);
2921 isl_int_add_ui(bmap->div[div][1], bmap->div[div][1], 1);
2922 neg = isl_seq_is_neg(bmap->ineq[i], bmap->div[div]+1, pos);
2923 isl_int_sub_ui(bmap->div[div][1], bmap->div[div][1], 1);
2924 isl_int_add(bmap->div[div][1],
2925 bmap->div[div][1], bmap->div[div][0]);
2928 if (isl_seq_first_non_zero(bmap->ineq[i]+pos+1,
2929 bmap->n_div-div-1) != -1)
2931 } else if (isl_int_abs_eq(bmap->ineq[i][pos], bmap->div[div][0])) {
2932 if (!isl_seq_eq(bmap->ineq[i], bmap->div[div]+1, pos))
2934 if (isl_seq_first_non_zero(bmap->ineq[i]+pos+1,
2935 bmap->n_div-div-1) != -1)
2941 for (i = 0; i < bmap->n_div; ++i)
2942 if (!isl_int_is_zero(bmap->div[i][1+pos]))
2949 * Remove divs that don't occur in any of the constraints or other divs.
2950 * These can arise when dropping some of the variables in a quast
2951 * returned by piplib.
2953 static struct isl_basic_map *remove_redundant_divs(struct isl_basic_map *bmap)
2960 for (i = bmap->n_div-1; i >= 0; --i) {
2961 if (!div_is_redundant(bmap, i))
2963 bmap = isl_basic_map_drop_div(bmap, i);
2968 struct isl_basic_map *isl_basic_map_finalize(struct isl_basic_map *bmap)
2970 bmap = remove_redundant_divs(bmap);
2973 F_SET(bmap, ISL_BASIC_SET_FINAL);
2977 struct isl_basic_set *isl_basic_set_finalize(struct isl_basic_set *bset)
2979 return (struct isl_basic_set *)
2980 isl_basic_map_finalize((struct isl_basic_map *)bset);
2983 struct isl_set *isl_set_finalize(struct isl_set *set)
2989 for (i = 0; i < set->n; ++i) {
2990 set->p[i] = isl_basic_set_finalize(set->p[i]);
3000 struct isl_map *isl_map_finalize(struct isl_map *map)
3006 for (i = 0; i < map->n; ++i) {
3007 map->p[i] = isl_basic_map_finalize(map->p[i]);
3017 struct isl_basic_map *isl_basic_map_identity(struct isl_ctx *ctx,
3018 unsigned nparam, unsigned dim)
3020 struct isl_basic_map *bmap;
3023 bmap = isl_basic_map_alloc(ctx, nparam, dim, dim, 0, dim, 0);
3027 for (i = 0; i < dim; ++i) {
3028 int j = isl_basic_map_alloc_equality(bmap);
3031 isl_seq_clr(bmap->eq[j],
3032 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->extra);
3033 isl_int_set_si(bmap->eq[j][1+nparam+i], 1);
3034 isl_int_set_si(bmap->eq[j][1+nparam+dim+i], -1);
3036 return isl_basic_map_finalize(bmap);
3038 isl_basic_map_free(bmap);
3042 struct isl_map *isl_map_identity(struct isl_ctx *ctx,
3043 unsigned nparam, unsigned dim)
3045 struct isl_map *map = isl_map_alloc(ctx, nparam, dim, dim, 1,
3049 map = isl_map_add(map,
3050 isl_basic_map_identity(ctx, nparam, dim));
3057 int isl_set_is_equal(struct isl_set *set1, struct isl_set *set2)
3059 return isl_map_is_equal((struct isl_map *)set1, (struct isl_map *)set2);
3062 int isl_set_is_subset(struct isl_set *set1, struct isl_set *set2)
3064 return isl_map_is_subset(
3065 (struct isl_map *)set1, (struct isl_map *)set2);
3068 int isl_basic_map_is_subset(
3069 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3072 struct isl_map *map1;
3073 struct isl_map *map2;
3075 if (!bmap1 || !bmap2)
3078 map1 = isl_map_from_basic_map(isl_basic_map_copy(bmap1));
3079 map2 = isl_map_from_basic_map(isl_basic_map_copy(bmap2));
3081 is_subset = isl_map_is_subset(map1, map2);
3089 int isl_basic_map_is_equal(
3090 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3094 if (!bmap1 || !bmap2)
3096 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
3099 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
3103 int isl_basic_set_is_equal(
3104 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
3106 return isl_basic_map_is_equal(
3107 (struct isl_basic_map *)bset1, (struct isl_basic_map *)bset2);
3110 int isl_map_is_empty(struct isl_map *map)
3117 for (i = 0; i < map->n; ++i) {
3118 is_empty = isl_basic_map_is_empty(map->p[i]);
3127 int isl_set_is_empty(struct isl_set *set)
3129 return isl_map_is_empty((struct isl_map *)set);
3132 int isl_map_is_subset(struct isl_map *map1, struct isl_map *map2)
3136 struct isl_map *diff;
3141 if (isl_map_is_empty(map1))
3144 if (isl_map_is_empty(map2))
3147 diff = isl_map_subtract(isl_map_copy(map1), isl_map_copy(map2));
3151 is_subset = isl_map_is_empty(diff);
3157 int isl_map_is_equal(struct isl_map *map1, struct isl_map *map2)
3163 is_subset = isl_map_is_subset(map1, map2);
3166 is_subset = isl_map_is_subset(map2, map1);
3170 int isl_basic_map_is_strict_subset(
3171 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3175 if (!bmap1 || !bmap2)
3177 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
3180 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
3181 if (is_subset == -1)
3186 static int basic_map_contains(struct isl_basic_map *bmap, struct isl_vec *vec)
3192 total = 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
3193 if (total != vec->size)
3198 for (i = 0; i < bmap->n_eq; ++i) {
3199 isl_seq_inner_product(vec->block.data, bmap->eq[i], total, &s);
3200 if (!isl_int_is_zero(s)) {
3206 for (i = 0; i < bmap->n_ineq; ++i) {
3207 isl_seq_inner_product(vec->block.data, bmap->ineq[i], total, &s);
3208 if (isl_int_is_neg(s)) {
3219 int isl_basic_map_is_universe(struct isl_basic_map *bmap)
3223 return bmap->n_eq == 0 && bmap->n_ineq == 0;
3226 int isl_basic_map_is_empty(struct isl_basic_map *bmap)
3228 struct isl_basic_set *bset = NULL;
3229 struct isl_vec *sample = NULL;
3236 if (F_ISSET(bmap, ISL_BASIC_MAP_EMPTY))
3239 if (F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL)) {
3240 struct isl_basic_map *copy = isl_basic_map_copy(bmap);
3241 copy = isl_basic_map_convex_hull(copy);
3242 empty = F_ISSET(copy, ISL_BASIC_MAP_EMPTY);
3243 isl_basic_map_free(copy);
3247 total = 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
3248 if (bmap->sample && bmap->sample->size == total) {
3249 int contains = basic_map_contains(bmap, bmap->sample);
3255 bset = isl_basic_map_underlying_set(isl_basic_map_copy(bmap));
3258 sample = isl_basic_set_sample(bset);
3261 empty = sample->size == 0;
3263 isl_vec_free(bmap->ctx, bmap->sample);
3264 bmap->sample = sample;
3269 struct isl_map *isl_basic_map_union(
3270 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3272 struct isl_map *map;
3273 if (!bmap1 || !bmap2)
3276 isl_assert(bmap1->ctx, bmap1->nparam == bmap2->nparam, goto error);
3277 isl_assert(bmap1->ctx, bmap1->n_in == bmap2->n_in, goto error);
3278 isl_assert(bmap1->ctx, bmap1->n_out == bmap2->n_out, goto error);
3280 map = isl_map_alloc(bmap1->ctx, bmap1->nparam,
3281 bmap1->n_in, bmap1->n_out, 2, 0);
3284 map = isl_map_add(map, bmap1);
3285 map = isl_map_add(map, bmap2);
3288 isl_basic_map_free(bmap1);
3289 isl_basic_map_free(bmap2);
3293 struct isl_set *isl_basic_set_union(
3294 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
3296 return (struct isl_set *)isl_basic_map_union(
3297 (struct isl_basic_map *)bset1,
3298 (struct isl_basic_map *)bset2);
3301 /* Order divs such that any div only depends on previous divs */
3302 static struct isl_basic_map *order_divs(struct isl_basic_map *bmap)
3305 unsigned off = bmap->nparam + bmap->n_in + bmap->n_out;
3307 for (i = 0; i < bmap->n_div; ++i) {
3309 pos = isl_seq_first_non_zero(bmap->div[i]+1+1+off+i,
3313 swap_div(bmap, i, pos);
3319 static int find_div(struct isl_basic_map *dst,
3320 struct isl_basic_map *src, unsigned div)
3324 unsigned total = src->nparam + src->n_in + src->n_out + src->n_div;
3326 for (i = 0; i < dst->n_div; ++i)
3327 if (isl_seq_eq(dst->div[i], src->div[div], 1+1+total) &&
3328 isl_seq_first_non_zero(dst->div[i]+1+1+total,
3329 dst->n_div - src->n_div) == -1)
3334 struct isl_basic_map *isl_basic_map_align_divs(
3335 struct isl_basic_map *dst, struct isl_basic_map *src)
3338 unsigned total = src->nparam + src->n_in + src->n_out + src->n_div;
3340 if (src->n_div == 0)
3343 src = order_divs(src);
3344 dst = isl_basic_map_extend(dst, dst->nparam, dst->n_in,
3345 dst->n_out, src->n_div, 0, 2 * src->n_div);
3348 for (i = 0; i < src->n_div; ++i) {
3349 int j = find_div(dst, src, i);
3351 j = isl_basic_map_alloc_div(dst);
3354 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total);
3355 isl_seq_clr(dst->div[j]+1+1+total,
3356 dst->extra - src->n_div);
3357 if (add_div_constraints(dst, j) < 0)
3361 swap_div(dst, i, j);
3365 isl_basic_map_free(dst);
3369 struct isl_map *isl_map_align_divs(struct isl_map *map)
3373 map = isl_map_compute_divs(map);
3374 map = isl_map_cow(map);
3378 for (i = 1; i < map->n; ++i)
3379 map->p[0] = isl_basic_map_align_divs(map->p[0], map->p[i]);
3380 for (i = 1; i < map->n; ++i)
3381 map->p[i] = isl_basic_map_align_divs(map->p[i], map->p[0]);
3386 static struct isl_map *add_cut_constraint(struct isl_map *dst,
3387 struct isl_basic_map *src, isl_int *c,
3388 unsigned len, int oppose)
3390 struct isl_basic_map *copy = NULL;
3395 copy = isl_basic_map_copy(src);
3396 copy = isl_basic_map_cow(copy);
3399 copy = isl_basic_map_extend(copy,
3400 copy->nparam, copy->n_in, copy->n_out, 0, 0, 1);
3401 k = isl_basic_map_alloc_inequality(copy);
3405 isl_seq_neg(copy->ineq[k], c, len);
3407 isl_seq_cpy(copy->ineq[k], c, len);
3408 total = 1 + copy->nparam + copy->n_in + copy->n_out + copy->extra;
3409 isl_seq_clr(copy->ineq[k]+len, total - len);
3410 isl_inequality_negate(copy, k);
3411 copy = isl_basic_map_simplify(copy);
3412 copy = isl_basic_map_finalize(copy);
3413 is_empty = isl_basic_map_is_empty(copy);
3417 dst = isl_map_add(dst, copy);
3419 isl_basic_map_free(copy);
3422 isl_basic_map_free(copy);
3427 static struct isl_map *subtract(struct isl_map *map, struct isl_basic_map *bmap)
3431 struct isl_map *rest = NULL;
3433 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
3440 if (F_ISSET(map, ISL_MAP_DISJOINT))
3441 FL_SET(flags, ISL_MAP_DISJOINT);
3443 max = map->n * (2 * bmap->n_eq + bmap->n_ineq);
3444 rest = isl_map_alloc(map->ctx, map->nparam, map->n_in, map->n_out,
3449 for (i = 0; i < map->n; ++i) {
3450 map->p[i] = isl_basic_map_align_divs(map->p[i], bmap);
3455 for (j = 0; j < map->n; ++j)
3456 map->p[j] = isl_basic_map_cow(map->p[j]);
3458 for (i = 0; i < bmap->n_eq; ++i) {
3459 for (j = 0; j < map->n; ++j) {
3460 rest = add_cut_constraint(rest,
3461 map->p[j], bmap->eq[i], 1+total, 0);
3465 rest = add_cut_constraint(rest,
3466 map->p[j], bmap->eq[i], 1+total, 1);
3470 map->p[j] = isl_basic_map_extend(map->p[j],
3471 map->p[j]->nparam, map->p[j]->n_in,
3472 map->p[j]->n_out, 0, 1, 0);
3475 k = isl_basic_map_alloc_equality(map->p[j]);
3478 isl_seq_cpy(map->p[j]->eq[k], bmap->eq[i], 1+total);
3479 isl_seq_clr(map->p[j]->eq[k]+1+total,
3480 map->p[j]->extra - bmap->n_div);
3484 for (i = 0; i < bmap->n_ineq; ++i) {
3485 for (j = 0; j < map->n; ++j) {
3486 rest = add_cut_constraint(rest,
3487 map->p[j], bmap->ineq[i], 1+total, 0);
3491 map->p[j] = isl_basic_map_extend(map->p[j],
3492 map->p[j]->nparam, map->p[j]->n_in,
3493 map->p[j]->n_out, 0, 0, 1);
3496 k = isl_basic_map_alloc_inequality(map->p[j]);
3499 isl_seq_cpy(map->p[j]->ineq[k], bmap->ineq[i], 1+total);
3500 isl_seq_clr(map->p[j]->ineq[k]+1+total,
3501 map->p[j]->extra - bmap->n_div);
3513 struct isl_map *isl_map_subtract(struct isl_map *map1, struct isl_map *map2)
3519 isl_assert(map1->ctx, map1->nparam == map2->nparam, goto error);
3520 isl_assert(map1->ctx, map1->n_in == map2->n_in, goto error);
3521 isl_assert(map1->ctx, map1->n_out == map2->n_out, goto error);
3523 if (isl_map_is_empty(map2)) {
3528 map1 = isl_map_compute_divs(map1);
3529 map2 = isl_map_compute_divs(map2);
3533 for (i = 0; map1 && i < map2->n; ++i)
3534 map1 = subtract(map1, map2->p[i]);
3544 struct isl_set *isl_set_subtract(struct isl_set *set1, struct isl_set *set2)
3546 return (struct isl_set *)
3548 (struct isl_map *)set1, (struct isl_map *)set2);
3551 struct isl_set *isl_set_apply(struct isl_set *set, struct isl_map *map)
3555 isl_assert(set->ctx, set->dim == map->n_in, goto error);
3556 map = isl_map_intersect_domain(map, set);
3557 set = isl_map_range(map);
3565 /* There is no need to cow as removing empty parts doesn't change
3566 * the meaning of the set.
3568 struct isl_map *isl_map_remove_empty_parts(struct isl_map *map)
3575 for (i = map->n-1; i >= 0; --i) {
3576 if (!F_ISSET(map->p[i], ISL_BASIC_MAP_EMPTY))
3578 isl_basic_map_free(map->p[i]);
3580 map->p[i] = map->p[map->n-1];
3587 struct isl_set *isl_set_remove_empty_parts(struct isl_set *set)
3589 return (struct isl_set *)
3590 isl_map_remove_empty_parts((struct isl_map *)set);
3593 struct isl_basic_set *isl_set_copy_basic_set(struct isl_set *set)
3595 struct isl_basic_set *bset;
3596 if (!set || set->n == 0)
3598 bset = set->p[set->n-1];
3599 isl_assert(set->ctx, F_ISSET(bset, ISL_BASIC_SET_FINAL), return NULL);
3600 return isl_basic_set_copy(bset);
3603 struct isl_set *isl_set_drop_basic_set(struct isl_set *set,
3604 struct isl_basic_set *bset)
3610 for (i = set->n-1; i >= 0; --i) {
3611 if (set->p[i] != bset)
3613 set = isl_set_cow(set);
3616 isl_basic_set_free(set->p[i]);
3618 set->p[i] = set->p[set->n-1];
3622 isl_basic_set_free(bset);
3626 isl_basic_set_free(bset);
3630 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
3631 * for any common value of the parameters and dimensions preceding dim
3632 * in both basic sets, the values of dimension pos in bset1 are
3633 * smaller or larger then those in bset2.
3636 * 1 if bset1 follows bset2
3637 * -1 if bset1 precedes bset2
3638 * 0 if bset1 and bset2 are incomparable
3639 * -2 if some error occurred.
3641 int isl_basic_set_compare_at(struct isl_basic_set *bset1,
3642 struct isl_basic_set *bset2, int pos)
3644 struct isl_basic_map *bmap1 = NULL;
3645 struct isl_basic_map *bmap2 = NULL;
3646 struct isl_ctx *ctx;
3647 struct isl_vec *obj;
3650 enum isl_lp_result res;
3653 if (!bset1 || !bset2)
3656 bmap1 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset1),
3657 pos, bset1->dim - pos);
3658 bmap2 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset2),
3659 pos, bset2->dim - pos);
3660 if (!bmap1 || !bmap2)
3662 bmap1 = isl_basic_map_extend(bmap1, bmap1->nparam,
3663 bmap1->n_in, bmap1->n_out + bmap2->n_out,
3664 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
3667 total = bmap1->nparam + bmap1->n_in + bmap1->n_out + bmap1->n_div;
3669 obj = isl_vec_alloc(ctx, total);
3670 isl_seq_clr(obj->block.data, total);
3671 isl_int_set_si(obj->block.data[bmap1->nparam+bmap1->n_in], 1);
3672 isl_int_set_si(obj->block.data[bmap1->nparam+bmap1->n_in+
3673 bmap1->n_out-bmap2->n_out], -1);
3676 bmap1 = add_constraints(bmap1, bmap2, 0, bmap1->n_out - bmap2->n_out);
3679 res = isl_solve_lp(bmap1, 0, obj->block.data, ctx->one, &num, &den);
3680 if (res == isl_lp_empty)
3682 else if (res == isl_lp_ok && isl_int_is_pos(num))
3684 else if ((res == isl_lp_ok && isl_int_is_neg(num)) ||
3685 res == isl_lp_unbounded)
3691 isl_basic_map_free(bmap1);
3692 isl_vec_free(ctx, obj);
3695 isl_basic_map_free(bmap1);
3696 isl_basic_map_free(bmap2);