8 #include "isl_map_private.h"
9 #include "isl_map_piplib.h"
10 #include "isl_sample.h"
13 static struct isl_basic_map *basic_map_init(struct isl_ctx *ctx,
14 struct isl_basic_map *bmap,
15 unsigned nparam, unsigned n_in, unsigned n_out, unsigned extra,
16 unsigned n_eq, unsigned n_ineq)
19 size_t row_size = 1 + nparam + n_in + n_out + extra;
21 bmap->block = isl_blk_alloc(ctx, (n_eq + n_ineq) * row_size);
22 if (!bmap->block.data) {
27 bmap->eq = isl_alloc_array(ctx, isl_int *, n_eq + n_ineq);
29 isl_blk_free(ctx, bmap->block);
35 bmap->block2.size = 0;
36 bmap->block2.data = NULL;
39 bmap->block2 = isl_blk_alloc(ctx, extra * (1 + row_size));
40 if (!bmap->block2.data) {
42 isl_blk_free(ctx, bmap->block);
47 bmap->div = isl_alloc_array(ctx, isl_int *, extra);
49 isl_blk_free(ctx, bmap->block2);
51 isl_blk_free(ctx, bmap->block);
57 for (i = 0; i < n_eq + n_ineq; ++i)
58 bmap->eq[i] = bmap->block.data + i * row_size;
60 for (i = 0; i < extra; ++i)
61 bmap->div[i] = bmap->block2.data + i * (1 + row_size);
65 bmap->c_size = n_eq + n_ineq;
66 bmap->ineq = bmap->eq + n_eq;
67 bmap->nparam = nparam;
79 struct isl_basic_set *isl_basic_set_alloc(struct isl_ctx *ctx,
80 unsigned nparam, unsigned dim, unsigned extra,
81 unsigned n_eq, unsigned n_ineq)
83 struct isl_basic_map *bmap;
84 bmap = isl_basic_map_alloc(ctx, nparam, 0, dim, extra, n_eq, n_ineq);
85 return (struct isl_basic_set *)bmap;
88 struct isl_basic_map *isl_basic_map_alloc(struct isl_ctx *ctx,
89 unsigned nparam, unsigned in, unsigned out, unsigned extra,
90 unsigned n_eq, unsigned n_ineq)
92 struct isl_basic_map *bmap;
94 bmap = isl_alloc_type(ctx, struct isl_basic_map);
98 return basic_map_init(ctx, bmap,
99 nparam, in, out, extra, n_eq, n_ineq);
102 static void dup_constraints(struct isl_ctx *ctx,
103 struct isl_basic_map *dst, struct isl_basic_map *src)
106 unsigned total = src->nparam + src->n_in + src->n_out + src->n_div;
108 for (i = 0; i < src->n_eq; ++i) {
109 int j = isl_basic_map_alloc_equality(ctx, dst);
110 isl_seq_cpy(dst->eq[j], src->eq[i], 1+total);
113 for (i = 0; i < src->n_ineq; ++i) {
114 int j = isl_basic_map_alloc_inequality(ctx, dst);
115 isl_seq_cpy(dst->ineq[j], src->ineq[i], 1+total);
118 for (i = 0; i < src->n_div; ++i) {
119 int j = isl_basic_map_alloc_div(ctx, dst);
120 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total);
122 F_SET(dst, ISL_BASIC_SET_FINAL);
125 struct isl_basic_map *isl_basic_map_dup(struct isl_ctx *ctx,
126 struct isl_basic_map *bmap)
128 struct isl_basic_map *dup;
130 dup = isl_basic_map_alloc(ctx, bmap->nparam,
131 bmap->n_in, bmap->n_out,
132 bmap->n_div, bmap->n_eq, bmap->n_ineq);
135 dup_constraints(ctx, dup, bmap);
136 dup->sample = isl_vec_copy(ctx, bmap->sample);
140 struct isl_basic_set *isl_basic_set_dup(struct isl_ctx *ctx,
141 struct isl_basic_set *bset)
143 struct isl_basic_map *dup;
145 dup = isl_basic_map_dup(ctx, (struct isl_basic_map *)bset);
146 return (struct isl_basic_set *)dup;
149 struct isl_basic_set *isl_basic_set_copy(struct isl_ctx *ctx,
150 struct isl_basic_set *bset)
155 if (F_ISSET(bset, ISL_BASIC_SET_FINAL)) {
159 return isl_basic_set_dup(ctx, bset);
162 struct isl_set *isl_set_copy(struct isl_ctx *ctx, struct isl_set *set)
171 struct isl_basic_map *isl_basic_map_copy(struct isl_ctx *ctx,
172 struct isl_basic_map *bmap)
177 if (F_ISSET(bmap, ISL_BASIC_SET_FINAL)) {
181 return isl_basic_map_dup(ctx, bmap);
184 struct isl_map *isl_map_copy(struct isl_ctx *ctx, struct isl_map *map)
193 void isl_basic_map_free(struct isl_ctx *ctx, struct isl_basic_map *bmap)
202 isl_blk_free(ctx, bmap->block2);
204 isl_blk_free(ctx, bmap->block);
205 isl_vec_free(ctx, bmap->sample);
209 void isl_basic_set_free(struct isl_ctx *ctx, struct isl_basic_set *bset)
211 isl_basic_map_free(ctx, (struct isl_basic_map *)bset);
214 int isl_basic_map_alloc_equality(struct isl_ctx *ctx,
215 struct isl_basic_map *bmap)
219 isl_assert(ctx, bmap->n_eq + bmap->n_ineq < bmap->c_size, return -1);
220 isl_assert(ctx, bmap->eq + bmap->n_eq <= bmap->ineq, return -1);
221 if (bmap->eq + bmap->n_eq == bmap->ineq) {
223 int j = isl_basic_map_alloc_inequality(ctx, bmap);
227 bmap->ineq[0] = bmap->ineq[j];
235 int isl_basic_map_free_equality(struct isl_ctx *ctx,
236 struct isl_basic_map *bmap, unsigned n)
238 isl_assert(ctx, n <= bmap->n_eq, return -1);
243 int isl_basic_map_drop_equality(struct isl_ctx *ctx,
244 struct isl_basic_map *bmap, unsigned pos)
247 isl_assert(ctx, pos < bmap->n_eq, return -1);
249 if (pos != bmap->n_eq - 1) {
251 bmap->eq[pos] = bmap->eq[bmap->n_eq - 1];
252 bmap->eq[bmap->n_eq - 1] = t;
258 void isl_basic_map_inequality_to_equality(struct isl_ctx *ctx,
259 struct isl_basic_map *bmap, unsigned pos)
264 bmap->ineq[pos] = bmap->ineq[0];
265 bmap->ineq[0] = bmap->eq[bmap->n_eq];
266 bmap->eq[bmap->n_eq] = t;
272 int isl_basic_map_alloc_inequality(struct isl_ctx *ctx,
273 struct isl_basic_map *bmap)
275 isl_assert(ctx, (bmap->ineq - bmap->eq) + bmap->n_ineq < bmap->c_size,
277 return bmap->n_ineq++;
280 int isl_basic_map_free_inequality(struct isl_ctx *ctx,
281 struct isl_basic_map *bmap, unsigned n)
283 isl_assert(ctx, n <= bmap->n_ineq, return -1);
288 int isl_basic_map_drop_inequality(struct isl_ctx *ctx,
289 struct isl_basic_map *bmap, unsigned pos)
292 isl_assert(ctx, pos < bmap->n_ineq, return -1);
294 if (pos != bmap->n_ineq - 1) {
296 bmap->ineq[pos] = bmap->ineq[bmap->n_ineq - 1];
297 bmap->ineq[bmap->n_ineq - 1] = t;
303 int isl_basic_map_alloc_div(struct isl_ctx *ctx,
304 struct isl_basic_map *bmap)
306 isl_assert(ctx, bmap->n_div < bmap->extra, return -1);
307 return bmap->n_div++;
310 int isl_basic_map_free_div(struct isl_ctx *ctx,
311 struct isl_basic_map *bmap, unsigned n)
313 isl_assert(ctx, n <= bmap->n_div, return -1);
318 /* Copy constraint from src to dst, putting the vars of src at offset
319 * dim_off in dst and the divs of src at offset div_off in dst.
320 * If both sets are actually map, then dim_off applies to the input
323 static void copy_constraint(struct isl_basic_map *dst_map, isl_int *dst,
324 struct isl_basic_map *src_map, isl_int *src,
325 unsigned in_off, unsigned out_off, unsigned div_off)
327 isl_int_set(dst[0], src[0]);
328 isl_seq_cpy(dst+1, src+1, isl_min(dst_map->nparam, src_map->nparam));
329 if (dst_map->nparam > src_map->nparam)
330 isl_seq_clr(dst+1+src_map->nparam,
331 dst_map->nparam - src_map->nparam);
332 isl_seq_clr(dst+1+dst_map->nparam, in_off);
333 isl_seq_cpy(dst+1+dst_map->nparam+in_off,
334 src+1+src_map->nparam,
335 isl_min(dst_map->n_in-in_off, src_map->n_in));
336 if (dst_map->n_in-in_off > src_map->n_in)
337 isl_seq_clr(dst+1+dst_map->nparam+in_off+src_map->n_in,
338 dst_map->n_in - in_off - src_map->n_in);
339 isl_seq_clr(dst+1+dst_map->nparam+dst_map->n_in, out_off);
340 isl_seq_cpy(dst+1+dst_map->nparam+dst_map->n_in+out_off,
341 src+1+src_map->nparam+src_map->n_in,
342 isl_min(dst_map->n_out-out_off, src_map->n_out));
343 if (dst_map->n_out-out_off > src_map->n_out)
344 isl_seq_clr(dst+1+dst_map->nparam+dst_map->n_in+out_off+src_map->n_out,
345 dst_map->n_out - out_off - src_map->n_out);
346 isl_seq_clr(dst+1+dst_map->nparam+dst_map->n_in+dst_map->n_out, div_off);
347 isl_seq_cpy(dst+1+dst_map->nparam+dst_map->n_in+dst_map->n_out+div_off,
348 src+1+src_map->nparam+src_map->n_in+src_map->n_out,
349 isl_min(dst_map->extra-div_off, src_map->extra));
350 if (dst_map->extra-div_off > src_map->extra)
351 isl_seq_clr(dst+1+dst_map->nparam+dst_map->n_in+dst_map->n_out+
352 div_off+src_map->extra,
353 dst_map->extra - div_off - src_map->extra);
356 static void copy_div(struct isl_basic_map *dst_map, isl_int *dst,
357 struct isl_basic_map *src_map, isl_int *src,
358 unsigned in_off, unsigned out_off, unsigned div_off)
360 isl_int_set(dst[0], src[0]);
361 copy_constraint(dst_map, dst+1, src_map, src+1, in_off, out_off, div_off);
364 static struct isl_basic_map *add_constraints(struct isl_ctx *ctx,
365 struct isl_basic_map *bmap1,
366 struct isl_basic_map *bmap2, unsigned i_pos, unsigned o_pos)
369 unsigned div_off = bmap1->n_div;
371 for (i = 0; i < bmap2->n_eq; ++i) {
372 int i1 = isl_basic_map_alloc_equality(ctx, bmap1);
375 copy_constraint(bmap1, bmap1->eq[i1], bmap2, bmap2->eq[i],
376 i_pos, o_pos, div_off);
379 for (i = 0; i < bmap2->n_ineq; ++i) {
380 int i1 = isl_basic_map_alloc_inequality(ctx, bmap1);
383 copy_constraint(bmap1, bmap1->ineq[i1], bmap2, bmap2->ineq[i],
384 i_pos, o_pos, div_off);
387 for (i = 0; i < bmap2->n_div; ++i) {
388 int i1 = isl_basic_map_alloc_div(ctx, bmap1);
391 copy_div(bmap1, bmap1->div[i1], bmap2, bmap2->div[i],
392 i_pos, o_pos, div_off);
395 isl_basic_map_free(ctx, bmap2);
400 isl_basic_map_free(ctx, bmap1);
401 isl_basic_map_free(ctx, bmap2);
405 struct isl_basic_map *isl_basic_map_extend(struct isl_ctx *ctx,
406 struct isl_basic_map *base,
407 unsigned nparam, unsigned n_in, unsigned n_out, unsigned extra,
408 unsigned n_eq, unsigned n_ineq)
410 struct isl_basic_map *ext;
413 base = isl_basic_map_cow(ctx, base);
417 dims_ok = base && base->nparam == nparam &&
418 base->n_in == n_in && base->n_out == n_out &&
419 base->extra >= base->n_div + extra;
421 if (dims_ok && n_eq == 0 && n_ineq == 0)
425 isl_assert(ctx, base->nparam <= nparam, goto error);
426 isl_assert(ctx, base->n_in <= n_in, goto error);
427 isl_assert(ctx, base->n_out <= n_out, goto error);
428 extra += base->extra;
430 n_ineq += base->n_ineq;
433 ext = isl_basic_map_alloc(ctx, nparam, n_in, n_out,
434 extra, n_eq, n_ineq);
440 ext = add_constraints(ctx, ext, base, 0, 0);
445 isl_basic_map_free(ctx, base);
449 struct isl_basic_set *isl_basic_set_extend(struct isl_ctx *ctx,
450 struct isl_basic_set *base,
451 unsigned nparam, unsigned dim, unsigned extra,
452 unsigned n_eq, unsigned n_ineq)
454 return (struct isl_basic_set *)
455 isl_basic_map_extend(ctx, (struct isl_basic_map *)base,
456 nparam, 0, dim, extra, n_eq, n_ineq);
459 struct isl_basic_set *isl_basic_set_cow(struct isl_ctx *ctx,
460 struct isl_basic_set *bset)
462 return (struct isl_basic_set *)
463 isl_basic_map_cow(ctx, (struct isl_basic_map *)bset);
466 struct isl_basic_map *isl_basic_map_cow(struct isl_ctx *ctx,
467 struct isl_basic_map *bmap)
474 bmap = isl_basic_map_dup(ctx, bmap);
476 F_CLR(bmap, ISL_BASIC_SET_FINAL);
480 static struct isl_set *isl_set_cow(struct isl_ctx *ctx, struct isl_set *set)
488 return isl_set_dup(ctx, set);
491 struct isl_map *isl_map_cow(struct isl_ctx *ctx, struct isl_map *map)
499 return isl_map_dup(ctx, map);
502 static void swap_vars(struct isl_blk blk, isl_int *a,
503 unsigned a_len, unsigned b_len)
505 isl_seq_cpy(blk.data, a+a_len, b_len);
506 isl_seq_cpy(blk.data+b_len, a, a_len);
507 isl_seq_cpy(a, blk.data, b_len+a_len);
510 struct isl_basic_set *isl_basic_set_swap_vars(struct isl_ctx *ctx,
511 struct isl_basic_set *bset, unsigned n)
519 isl_assert(ctx, n <= bset->dim, goto error);
524 bset = isl_basic_set_cow(ctx, bset);
528 blk = isl_blk_alloc(ctx, bset->dim);
532 for (i = 0; i < bset->n_eq; ++i)
534 bset->eq[i]+1+bset->nparam, n, bset->dim - n);
536 for (i = 0; i < bset->n_ineq; ++i)
538 bset->ineq[i]+1+bset->nparam, n, bset->dim - n);
540 for (i = 0; i < bset->n_div; ++i)
542 bset->div[i]+1+1+bset->nparam, n, bset->dim - n);
544 isl_blk_free(ctx, blk);
549 isl_basic_set_free(ctx, bset);
553 struct isl_set *isl_set_swap_vars(struct isl_ctx *ctx,
554 struct isl_set *set, unsigned n)
557 set = isl_set_cow(ctx, set);
561 for (i = 0; i < set->n; ++i) {
562 set->p[i] = isl_basic_set_swap_vars(ctx, set->p[i], n);
564 isl_set_free(ctx, set);
571 static void constraint_drop_vars(isl_int *c, unsigned n, unsigned rem)
573 isl_seq_cpy(c, c + n, rem);
574 isl_seq_clr(c + rem, n);
577 struct isl_basic_set *isl_basic_set_drop_vars(struct isl_ctx *ctx,
578 struct isl_basic_set *bset, unsigned first, unsigned n)
585 isl_assert(ctx, first + n <= bset->dim, goto error);
590 bset = isl_basic_set_cow(ctx, bset);
594 for (i = 0; i < bset->n_eq; ++i)
595 constraint_drop_vars(bset->eq[i]+1+bset->nparam+first, n,
596 (bset->dim-first-n)+bset->extra);
598 for (i = 0; i < bset->n_ineq; ++i)
599 constraint_drop_vars(bset->ineq[i]+1+bset->nparam+first, n,
600 (bset->dim-first-n)+bset->extra);
602 for (i = 0; i < bset->n_div; ++i)
603 constraint_drop_vars(bset->div[i]+1+1+bset->nparam+first, n,
604 (bset->dim-first-n)+bset->extra);
609 return isl_basic_set_finalize(ctx, bset);
611 isl_basic_set_free(ctx, bset);
616 * We don't cow, as the div is assumed to be redundant.
618 static struct isl_basic_map *isl_basic_map_drop_div(struct isl_ctx *ctx,
619 struct isl_basic_map *bmap, unsigned div)
627 pos = 1 + bmap->nparam + bmap->n_in + bmap->n_out + div;
629 isl_assert(ctx, div < bmap->n_div, goto error);
631 for (i = 0; i < bmap->n_eq; ++i)
632 constraint_drop_vars(bmap->eq[i]+pos, 1, bmap->extra-div-1);
634 for (i = 0; i < bmap->n_ineq; ++i) {
635 if (!isl_int_is_zero(bmap->ineq[i][pos])) {
636 isl_basic_map_drop_inequality(ctx, bmap, i);
640 constraint_drop_vars(bmap->ineq[i]+pos, 1, bmap->extra-div-1);
643 for (i = 0; i < bmap->n_div; ++i)
644 constraint_drop_vars(bmap->div[i]+1+pos, 1, bmap->extra-div-1);
646 if (div != bmap->n_div - 1) {
648 isl_int *t = bmap->div[div];
650 for (j = div; j < bmap->n_div - 1; ++j)
651 bmap->div[j] = bmap->div[j+1];
653 bmap->div[bmap->n_div - 1] = t;
655 isl_basic_map_free_div(ctx, bmap, 1);
659 isl_basic_map_free(ctx, bmap);
663 static void eliminate_div(struct isl_ctx *ctx, struct isl_basic_map *bmap,
664 isl_int *eq, unsigned div)
667 unsigned pos = 1 + bmap->nparam + bmap->n_in + bmap->n_out + div;
669 len = 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
671 for (i = 0; i < bmap->n_eq; ++i)
672 if (bmap->eq[i] != eq)
673 isl_seq_elim(bmap->eq[i], eq, pos, len, NULL);
675 for (i = 0; i < bmap->n_ineq; ++i)
676 isl_seq_elim(bmap->ineq[i], eq, pos, len, NULL);
678 /* We need to be careful about circular definitions,
679 * so for now we just remove the definitions of other divs that
680 * depend on this div and (possibly) recompute them later.
682 for (i = 0; i < bmap->n_div; ++i)
683 if (!isl_int_is_zero(bmap->div[i][0]) &&
684 !isl_int_is_zero(bmap->div[i][1 + pos]))
685 isl_seq_clr(bmap->div[i], 1 + len);
687 isl_basic_map_drop_div(ctx, bmap, div);
690 struct isl_basic_map *isl_basic_map_set_to_empty(
691 struct isl_ctx *ctx, struct isl_basic_map *bmap)
697 total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->extra;
698 isl_basic_map_free_div(ctx, bmap, bmap->n_div);
699 isl_basic_map_free_inequality(ctx, bmap, bmap->n_ineq);
701 isl_basic_map_free_equality(ctx, bmap, bmap->n_eq-1);
703 isl_basic_map_alloc_equality(ctx, bmap);
707 isl_int_set_si(bmap->eq[i][0], 1);
708 isl_seq_clr(bmap->eq[i]+1, total);
709 F_SET(bmap, ISL_BASIC_MAP_EMPTY);
710 return isl_basic_map_finalize(ctx, bmap);
712 isl_basic_map_free(ctx, bmap);
716 struct isl_basic_set *isl_basic_set_set_to_empty(
717 struct isl_ctx *ctx, struct isl_basic_set *bset)
719 return (struct isl_basic_set *)
720 isl_basic_map_set_to_empty(ctx, (struct isl_basic_map *)bset);
723 static void swap_equality(struct isl_basic_map *bmap, int a, int b)
725 isl_int *t = bmap->eq[a];
726 bmap->eq[a] = bmap->eq[b];
730 static void swap_inequality(struct isl_basic_map *bmap, int a, int b)
732 isl_int *t = bmap->ineq[a];
733 bmap->ineq[a] = bmap->ineq[b];
737 static void swap_div(struct isl_basic_map *bmap, int a, int b)
740 unsigned off = bmap->nparam + bmap->n_in + bmap->n_out;
741 isl_int *t = bmap->div[a];
742 bmap->div[a] = bmap->div[b];
745 for (i = 0; i < bmap->n_eq; ++i)
746 isl_int_swap(bmap->eq[i][1+off+a], bmap->eq[i][1+off+b]);
748 for (i = 0; i < bmap->n_ineq; ++i)
749 isl_int_swap(bmap->ineq[i][1+off+a], bmap->ineq[i][1+off+b]);
751 for (i = 0; i < bmap->n_div; ++i)
752 isl_int_swap(bmap->div[i][1+1+off+a], bmap->div[i][1+1+off+b]);
755 struct isl_basic_map *isl_basic_map_gauss(struct isl_ctx *ctx,
756 struct isl_basic_map *bmap, int *progress)
767 total_var = bmap->nparam + bmap->n_in + bmap->n_out;
768 total = total_var + bmap->n_div;
770 last_var = total - 1;
771 for (done = 0; done < bmap->n_eq; ++done) {
772 for (; last_var >= 0; --last_var) {
773 for (k = done; k < bmap->n_eq; ++k)
774 if (!isl_int_is_zero(bmap->eq[k][1+last_var]))
782 swap_equality(bmap, k, done);
783 if (isl_int_is_neg(bmap->eq[done][1+last_var]))
784 isl_seq_neg(bmap->eq[done], bmap->eq[done], 1+total);
786 for (k = 0; k < bmap->n_eq; ++k) {
789 if (isl_int_is_zero(bmap->eq[k][1+last_var]))
793 isl_seq_elim(bmap->eq[k], bmap->eq[done],
794 1+last_var, 1+total, NULL);
797 for (k = 0; k < bmap->n_ineq; ++k) {
798 if (isl_int_is_zero(bmap->ineq[k][1+last_var]))
802 isl_seq_elim(bmap->ineq[k], bmap->eq[done],
803 1+last_var, 1+total, NULL);
806 for (k = 0; k < bmap->n_div; ++k) {
807 if (isl_int_is_zero(bmap->div[k][0]))
809 if (isl_int_is_zero(bmap->div[k][1+1+last_var]))
813 isl_seq_elim(bmap->div[k]+1, bmap->eq[done],
814 1+last_var, 1+total, &bmap->div[k][0]);
817 if (last_var >= total_var &&
818 isl_int_is_zero(bmap->div[last_var - total_var][0])) {
819 unsigned div = last_var - total_var;
820 isl_seq_neg(bmap->div[div]+1, bmap->eq[done], 1+total);
821 isl_int_set_si(bmap->div[div][1+1+last_var], 0);
822 isl_int_set(bmap->div[div][0],
823 bmap->eq[done][1+last_var]);
826 if (done == bmap->n_eq)
828 for (k = done; k < bmap->n_eq; ++k) {
829 if (isl_int_is_zero(bmap->eq[k][0]))
831 return isl_basic_map_set_to_empty(ctx, bmap);
833 isl_basic_map_free_equality(ctx, bmap, bmap->n_eq-done);
837 struct isl_basic_set *isl_basic_set_gauss(struct isl_ctx *ctx,
838 struct isl_basic_set *bset, int *progress)
840 return (struct isl_basic_set*)isl_basic_map_gauss(ctx,
841 (struct isl_basic_map *)bset, progress);
844 static unsigned int round_up(unsigned int v)
855 static int hash_index(int *index, unsigned int size, int bits,
856 struct isl_basic_map *bmap, int k)
859 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
860 u_int32_t hash = isl_seq_hash(bmap->ineq[k]+1, total, bits);
861 for (h = hash; index[h]; h = (h+1) % size)
862 if (k != index[h]-1 &&
863 isl_seq_eq(bmap->ineq[k]+1,
864 bmap->ineq[index[h]-1]+1, total))
869 static struct isl_basic_map *remove_duplicate_constraints(
871 struct isl_basic_map *bmap, int *progress)
877 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
880 if (bmap->n_ineq <= 1)
883 size = round_up(4 * (bmap->n_ineq+1) / 3 - 1);
884 bits = ffs(size) - 1;
885 index = isl_alloc_array(ctx, int, size);
886 memset(index, 0, size * sizeof(int));
890 index[isl_seq_hash(bmap->ineq[0]+1, total, bits)] = 1;
891 for (k = 1; k < bmap->n_ineq; ++k) {
892 h = hash_index(index, size, bits, bmap, k);
899 if (isl_int_lt(bmap->ineq[k][0], bmap->ineq[l][0]))
900 swap_inequality(bmap, k, l);
901 isl_basic_map_drop_inequality(ctx, bmap, k);
905 for (k = 0; k < bmap->n_ineq-1; ++k) {
906 isl_seq_neg(bmap->ineq[k]+1, bmap->ineq[k]+1, total);
907 h = hash_index(index, size, bits, bmap, k);
908 isl_seq_neg(bmap->ineq[k]+1, bmap->ineq[k]+1, total);
912 isl_int_add(sum, bmap->ineq[k][0], bmap->ineq[l][0]);
913 if (isl_int_is_pos(sum))
915 if (isl_int_is_zero(sum)) {
916 /* We need to break out of the loop after these
917 * changes since the contents of the hash
918 * will no longer be valid.
919 * Plus, we probably we want to regauss first.
921 isl_basic_map_drop_inequality(ctx, bmap, l);
922 isl_basic_map_inequality_to_equality(ctx, bmap, k);
924 bmap = isl_basic_map_set_to_empty(ctx, bmap);
933 static struct isl_basic_map *remove_duplicate_divs(struct isl_ctx *ctx,
934 struct isl_basic_map *bmap, int *progress)
941 unsigned total_var = bmap->nparam + bmap->n_in + bmap->n_out;
942 unsigned total = total_var + bmap->n_div;
944 if (bmap->n_div <= 1)
947 for (k = bmap->n_div - 1; k >= 0; --k)
948 if (!isl_int_is_zero(bmap->div[k][0]))
953 size = round_up(4 * bmap->n_div / 3 - 1);
954 bits = ffs(size) - 1;
955 index = isl_alloc_array(ctx, int, size);
956 memset(index, 0, size * sizeof(int));
959 eq = isl_blk_alloc(ctx, 1+total);
963 isl_seq_clr(eq.data, 1+total);
964 index[isl_seq_hash(bmap->div[k], 2+total, bits)] = k + 1;
965 for (--k; k >= 0; --k) {
968 if (isl_int_is_zero(bmap->div[k][0]))
971 hash = isl_seq_hash(bmap->div[k], 2+total, bits);
972 for (h = hash; index[h]; h = (h+1) % size)
973 if (isl_seq_eq(bmap->div[k],
974 bmap->div[index[h]-1], 2+total))
979 isl_int_set_si(eq.data[1+total_var+k], -1);
980 isl_int_set_si(eq.data[1+total_var+l], 1);
981 eliminate_div(ctx, bmap, eq.data, l);
982 isl_int_set_si(eq.data[1+total_var+k], 0);
983 isl_int_set_si(eq.data[1+total_var+l], 0);
988 isl_blk_free(ctx, eq);
994 static struct isl_basic_map *eliminate_divs(
995 struct isl_ctx *ctx, struct isl_basic_map *bmap,
1006 off = 1 + bmap->nparam + bmap->n_in + bmap->n_out;
1008 for (d = bmap->n_div - 1; d >= 0 ; --d) {
1009 for (i = 0; i < bmap->n_eq; ++i) {
1010 if (!isl_int_is_one(bmap->eq[i][off + d]) &&
1011 !isl_int_is_negone(bmap->eq[i][off + d]))
1015 eliminate_div(ctx, bmap, bmap->eq[i], d);
1016 isl_basic_map_drop_equality(ctx, bmap, i);
1020 return eliminate_divs(ctx, bmap, progress);
1024 static struct isl_basic_map *normalize_constraints(
1025 struct isl_ctx *ctx, struct isl_basic_map *bmap)
1029 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
1032 for (i = bmap->n_eq - 1; i >= 0; --i) {
1033 isl_seq_gcd(bmap->eq[i]+1, total, &gcd);
1034 if (isl_int_is_zero(gcd)) {
1035 if (!isl_int_is_zero(bmap->eq[i][0])) {
1036 bmap = isl_basic_map_set_to_empty(ctx, bmap);
1039 isl_basic_map_drop_equality(ctx, bmap, i);
1042 if (isl_int_is_one(gcd))
1044 if (!isl_int_is_divisible_by(bmap->eq[i][0], gcd)) {
1045 bmap = isl_basic_map_set_to_empty(ctx, bmap);
1048 isl_seq_scale_down(bmap->eq[i], bmap->eq[i], gcd, 1+total);
1051 for (i = bmap->n_ineq - 1; i >= 0; --i) {
1052 isl_seq_gcd(bmap->ineq[i]+1, total, &gcd);
1053 if (isl_int_is_zero(gcd)) {
1054 if (isl_int_is_neg(bmap->ineq[i][0])) {
1055 bmap = isl_basic_map_set_to_empty(ctx, bmap);
1058 isl_basic_map_drop_inequality(ctx, bmap, i);
1061 if (isl_int_is_one(gcd))
1063 isl_int_fdiv_q(bmap->ineq[i][0], bmap->ineq[i][0], gcd);
1064 isl_seq_scale_down(bmap->ineq[i]+1, bmap->ineq[i]+1, gcd, total);
1071 struct isl_basic_map *isl_basic_map_simplify(
1072 struct isl_ctx *ctx, struct isl_basic_map *bmap)
1079 bmap = normalize_constraints(ctx, bmap);
1080 bmap = eliminate_divs(ctx, bmap, &progress);
1081 bmap = isl_basic_map_gauss(ctx, bmap, &progress);
1082 bmap = remove_duplicate_divs(ctx, bmap, &progress);
1083 bmap = remove_duplicate_constraints(ctx, bmap, &progress);
1088 struct isl_basic_set *isl_basic_set_simplify(
1089 struct isl_ctx *ctx, struct isl_basic_set *bset)
1091 return (struct isl_basic_set *)
1092 isl_basic_map_simplify(ctx,
1093 (struct isl_basic_map *)bset);
1096 static void dump_term(struct isl_basic_map *bmap,
1097 isl_int c, int pos, FILE *out)
1099 unsigned in = bmap->n_in;
1100 unsigned dim = bmap->n_in + bmap->n_out;
1102 isl_int_print(out, c);
1104 if (!isl_int_is_one(c))
1105 isl_int_print(out, c);
1106 if (pos < 1 + bmap->nparam)
1107 fprintf(out, "p%d", pos - 1);
1108 else if (pos < 1 + bmap->nparam + in)
1109 fprintf(out, "i%d", pos - 1 - bmap->nparam);
1110 else if (pos < 1 + bmap->nparam + dim)
1111 fprintf(out, "o%d", pos - 1 - bmap->nparam - in);
1113 fprintf(out, "e%d", pos - 1 - bmap->nparam - dim);
1117 static void dump_constraint_sign(struct isl_basic_map *bmap, isl_int *c,
1118 int sign, FILE *out)
1122 unsigned len = 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
1126 for (i = 0, first = 1; i < len; ++i) {
1127 if (isl_int_sgn(c[i]) * sign <= 0)
1130 fprintf(out, " + ");
1132 isl_int_abs(v, c[i]);
1133 dump_term(bmap, v, i, out);
1140 static void dump_constraint(struct isl_basic_map *bmap, isl_int *c,
1141 const char *op, FILE *out, int indent)
1145 fprintf(out, "%*s", indent, "");
1147 dump_constraint_sign(bmap, c, 1, out);
1148 fprintf(out, " %s ", op);
1149 dump_constraint_sign(bmap, c, -1, out);
1153 for (i = bmap->n_div; i < bmap->extra; ++i) {
1154 if (isl_int_is_zero(c[1+bmap->nparam+bmap->n_in+bmap->n_out+i]))
1156 fprintf(out, "%*s", indent, "");
1157 fprintf(out, "ERROR: unused div coefficient not zero\n");
1161 static void dump_constraints(struct isl_basic_map *bmap,
1162 isl_int **c, unsigned n,
1163 const char *op, FILE *out, int indent)
1167 for (i = 0; i < n; ++i)
1168 dump_constraint(bmap, c[i], op, out, indent);
1171 static void dump_affine(struct isl_basic_map *bmap, isl_int *exp, FILE *out)
1175 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
1177 for (j = 0; j < 1 + total; ++j) {
1178 if (isl_int_is_zero(exp[j]))
1180 if (!first && isl_int_is_pos(exp[j]))
1182 dump_term(bmap, exp[j], j, out);
1187 static void dump(struct isl_basic_map *bmap, FILE *out, int indent)
1191 dump_constraints(bmap, bmap->eq, bmap->n_eq, "=", out, indent);
1192 dump_constraints(bmap, bmap->ineq, bmap->n_ineq, ">=", out, indent);
1194 for (i = 0; i < bmap->n_div; ++i) {
1195 fprintf(out, "%*s", indent, "");
1196 fprintf(out, "e%d = [(", i);
1197 dump_affine(bmap, bmap->div[i]+1, out);
1199 isl_int_print(out, bmap->div[i][0]);
1200 fprintf(out, "]\n");
1204 void isl_basic_set_dump(struct isl_ctx *ctx, struct isl_basic_set *bset,
1205 FILE *out, int indent)
1208 fprintf(out, "null basic set\n");
1212 fprintf(out, "%*s", indent, "");
1213 fprintf(out, "nparam: %d, dim: %d, extra: %d\n",
1214 bset->nparam, bset->dim, bset->extra);
1215 dump((struct isl_basic_map *)bset, out, indent);
1218 void isl_basic_map_dump(struct isl_ctx *ctx, struct isl_basic_map *bmap,
1219 FILE *out, int indent)
1222 fprintf(out, "null basic map\n");
1226 fprintf(out, "%*s", indent, "");
1227 fprintf(out, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d\n",
1229 bmap->nparam, bmap->n_in, bmap->n_out, bmap->extra);
1230 dump(bmap, out, indent);
1233 int isl_inequality_negate(struct isl_ctx *ctx,
1234 struct isl_basic_map *bmap, unsigned pos)
1236 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
1237 isl_assert(ctx, pos < bmap->n_ineq, return -1);
1238 isl_seq_neg(bmap->ineq[pos], bmap->ineq[pos], 1 + total);
1239 isl_int_sub_ui(bmap->ineq[pos][0], bmap->ineq[pos][0], 1);
1243 struct isl_set *isl_set_alloc(struct isl_ctx *ctx,
1244 unsigned nparam, unsigned dim, int n, unsigned flags)
1246 struct isl_set *set;
1248 set = isl_alloc(ctx, struct isl_set,
1249 sizeof(struct isl_set) +
1250 n * sizeof(struct isl_basic_set *));
1257 set->nparam = nparam;
1264 struct isl_set *isl_set_dup(struct isl_ctx *ctx, struct isl_set *set)
1267 struct isl_set *dup;
1269 dup = isl_set_alloc(ctx, set->nparam, set->dim, set->n, set->flags);
1272 for (i = 0; i < set->n; ++i)
1273 dup = isl_set_add(ctx, dup,
1274 isl_basic_set_dup(ctx, set->p[i]));
1278 struct isl_set *isl_set_from_basic_set(struct isl_ctx *ctx,
1279 struct isl_basic_set *bset)
1281 struct isl_set *set;
1283 set = isl_set_alloc(ctx, bset->nparam, bset->dim, 1, ISL_MAP_DISJOINT);
1285 isl_basic_set_free(ctx, bset);
1288 return isl_set_add(ctx, set, bset);
1291 struct isl_map *isl_map_from_basic_map(struct isl_ctx *ctx,
1292 struct isl_basic_map *bmap)
1294 struct isl_map *map;
1296 map = isl_map_alloc(ctx, bmap->nparam, bmap->n_in, bmap->n_out, 1,
1299 isl_basic_map_free(ctx, bmap);
1302 return isl_map_add(ctx, map, bmap);
1305 struct isl_set *isl_set_add(struct isl_ctx *ctx, struct isl_set *set,
1306 struct isl_basic_set *bset)
1310 isl_assert(ctx, set->nparam == bset->nparam, goto error);
1311 isl_assert(ctx, set->dim == bset->dim, goto error);
1312 isl_assert(ctx, set->n < set->size, goto error);
1313 set->p[set->n] = bset;
1318 isl_set_free(ctx, set);
1320 isl_basic_set_free(ctx, bset);
1324 void isl_set_free(struct isl_ctx *ctx, struct isl_set *set)
1334 for (i = 0; i < set->n; ++i)
1335 isl_basic_set_free(ctx, set->p[i]);
1339 void isl_set_dump(struct isl_ctx *ctx, struct isl_set *set, FILE *out,
1345 fprintf(out, "null set\n");
1349 fprintf(out, "%*s", indent, "");
1350 fprintf(out, "ref: %d, n: %d\n", set->ref, set->n);
1351 for (i = 0; i < set->n; ++i) {
1352 fprintf(out, "%*s", indent, "");
1353 fprintf(out, "basic set %d:\n", i);
1354 isl_basic_set_dump(ctx, set->p[i], out, indent+4);
1358 void isl_map_dump(struct isl_ctx *ctx, struct isl_map *map, FILE *out,
1364 fprintf(out, "null map\n");
1368 fprintf(out, "%*s", indent, "");
1369 fprintf(out, "ref: %d, n: %d, nparam: %d, in: %d, out: %d\n",
1370 map->ref, map->n, map->nparam, map->n_in, map->n_out);
1371 for (i = 0; i < map->n; ++i) {
1372 fprintf(out, "%*s", indent, "");
1373 fprintf(out, "basic map %d:\n", i);
1374 isl_basic_map_dump(ctx, map->p[i], out, indent+4);
1378 struct isl_basic_map *isl_basic_map_intersect_domain(
1379 struct isl_ctx *ctx, struct isl_basic_map *bmap,
1380 struct isl_basic_set *bset)
1382 struct isl_basic_map *bmap_domain;
1387 isl_assert(ctx, bset->dim == bmap->n_in, goto error);
1388 isl_assert(ctx, bset->nparam == bmap->nparam, goto error);
1390 bmap = isl_basic_map_extend(ctx, bmap,
1391 bset->nparam, bmap->n_in, bmap->n_out,
1392 bset->n_div, bset->n_eq, bset->n_ineq);
1395 bmap_domain = isl_basic_map_from_basic_set(ctx, bset,
1397 bmap = add_constraints(ctx, bmap, bmap_domain, 0, 0);
1399 bmap = isl_basic_map_simplify(ctx, bmap);
1400 return isl_basic_map_finalize(ctx, bmap);
1402 isl_basic_map_free(ctx, bmap);
1403 isl_basic_set_free(ctx, bset);
1407 struct isl_basic_map *isl_basic_map_intersect_range(
1408 struct isl_ctx *ctx, struct isl_basic_map *bmap,
1409 struct isl_basic_set *bset)
1411 struct isl_basic_map *bmap_range;
1416 isl_assert(ctx, bset->dim == bmap->n_out, goto error);
1417 isl_assert(ctx, bset->nparam == bmap->nparam, goto error);
1419 bmap = isl_basic_map_extend(ctx, bmap,
1420 bset->nparam, bmap->n_in, bmap->n_out,
1421 bset->n_div, bset->n_eq, bset->n_ineq);
1424 bmap_range = isl_basic_map_from_basic_set(ctx, bset,
1426 bmap = add_constraints(ctx, bmap, bmap_range, 0, 0);
1428 bmap = isl_basic_map_simplify(ctx, bmap);
1429 return isl_basic_map_finalize(ctx, bmap);
1431 isl_basic_map_free(ctx, bmap);
1432 isl_basic_set_free(ctx, bset);
1436 struct isl_basic_map *isl_basic_map_intersect(
1437 struct isl_ctx *ctx, struct isl_basic_map *bmap1,
1438 struct isl_basic_map *bmap2)
1440 if (!bmap1 || !bmap2)
1443 isl_assert(ctx, bmap1->nparam == bmap2->nparam, goto error);
1444 isl_assert(ctx, bmap1->n_in == bmap2->n_in, goto error);
1445 isl_assert(ctx, bmap1->n_out == bmap2->n_out, goto error);
1447 bmap1 = isl_basic_map_extend(ctx, bmap1,
1448 bmap1->nparam, bmap1->n_in, bmap1->n_out,
1449 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
1452 bmap1 = add_constraints(ctx, bmap1, bmap2, 0, 0);
1454 bmap1 = isl_basic_map_simplify(ctx, bmap1);
1455 return isl_basic_map_finalize(ctx, bmap1);
1457 isl_basic_map_free(ctx, bmap1);
1458 isl_basic_map_free(ctx, bmap2);
1462 struct isl_basic_set *isl_basic_set_intersect(
1463 struct isl_ctx *ctx, struct isl_basic_set *bset1,
1464 struct isl_basic_set *bset2)
1466 return (struct isl_basic_set *)
1467 isl_basic_map_intersect(ctx,
1468 (struct isl_basic_map *)bset1,
1469 (struct isl_basic_map *)bset2);
1472 struct isl_map *isl_map_intersect(struct isl_ctx *ctx, struct isl_map *map1,
1473 struct isl_map *map2)
1476 struct isl_map *result;
1482 if (F_ISSET(map1, ISL_MAP_DISJOINT) &&
1483 F_ISSET(map2, ISL_MAP_DISJOINT))
1484 FL_SET(flags, ISL_MAP_DISJOINT);
1486 result = isl_map_alloc(ctx, map1->nparam, map1->n_in, map1->n_out,
1487 map1->n * map2->n, flags);
1490 for (i = 0; i < map1->n; ++i)
1491 for (j = 0; j < map2->n; ++j) {
1492 struct isl_basic_map *part;
1493 part = isl_basic_map_intersect(ctx,
1494 isl_basic_map_copy(ctx, map1->p[i]),
1495 isl_basic_map_copy(ctx, map2->p[j]));
1496 if (isl_basic_map_is_empty(ctx, part))
1497 isl_basic_map_free(ctx, part);
1499 result = isl_map_add(ctx, result, part);
1503 isl_map_free(ctx, map1);
1504 isl_map_free(ctx, map2);
1507 isl_map_free(ctx, map1);
1508 isl_map_free(ctx, map2);
1512 struct isl_basic_map *isl_basic_map_reverse(struct isl_ctx *ctx,
1513 struct isl_basic_map *bmap)
1515 struct isl_basic_set *bset;
1520 bmap = isl_basic_map_cow(ctx, bmap);
1524 bset = isl_basic_set_from_basic_map(ctx, bmap);
1525 bset = isl_basic_set_swap_vars(ctx, bset, in);
1526 return isl_basic_map_from_basic_set(ctx, bset, bset->dim-in, in);
1529 /* Turn final n dimensions into existentially quantified variables.
1531 struct isl_basic_set *isl_basic_set_project_out(
1532 struct isl_ctx *ctx, struct isl_basic_set *bset,
1533 unsigned n, unsigned flags)
1543 isl_assert(ctx, n <= bset->dim, goto error);
1548 bset = isl_basic_set_cow(ctx, bset);
1550 row_size = 1 + bset->nparam + bset->dim + bset->extra;
1551 old = bset->block2.data;
1552 bset->block2 = isl_blk_extend(ctx, bset->block2,
1553 (bset->extra + n) * (1 + row_size));
1554 if (!bset->block2.data)
1556 new_div = isl_alloc_array(ctx, isl_int *, bset->extra + n);
1559 for (i = 0; i < n; ++i) {
1560 new_div[i] = bset->block2.data +
1561 (bset->extra + i) * (1 + row_size);
1562 isl_seq_clr(new_div[i], 1 + row_size);
1564 for (i = 0; i < bset->extra; ++i)
1565 new_div[n + i] = bset->block2.data + (bset->div[i] - old);
1567 bset->div = new_div;
1571 bset = isl_basic_set_simplify(ctx, bset);
1572 return isl_basic_set_finalize(ctx, bset);
1574 isl_basic_set_free(ctx, bset);
1578 struct isl_basic_map *isl_basic_map_apply_range(
1579 struct isl_ctx *ctx, struct isl_basic_map *bmap1,
1580 struct isl_basic_map *bmap2)
1582 struct isl_basic_set *bset;
1583 unsigned n_in, n_out;
1585 if (!bmap1 || !bmap2)
1588 isl_assert(ctx, bmap1->n_out == bmap2->n_in, goto error);
1589 isl_assert(ctx, bmap1->nparam == bmap2->nparam, goto error);
1592 n_out = bmap2->n_out;
1594 bmap2 = isl_basic_map_reverse(ctx, bmap2);
1597 bmap1 = isl_basic_map_extend(ctx, bmap1, bmap1->nparam,
1598 bmap1->n_in + bmap2->n_in, bmap1->n_out,
1599 bmap2->extra, bmap2->n_eq, bmap2->n_ineq);
1602 bmap1 = add_constraints(ctx, bmap1, bmap2, bmap1->n_in - bmap2->n_in, 0);
1603 bmap1 = isl_basic_map_simplify(ctx, bmap1);
1604 bset = isl_basic_set_from_basic_map(ctx, bmap1);
1605 bset = isl_basic_set_project_out(ctx, bset,
1606 bset->dim - (n_in + n_out), 0);
1607 return isl_basic_map_from_basic_set(ctx, bset, n_in, n_out);
1609 isl_basic_map_free(ctx, bmap1);
1610 isl_basic_map_free(ctx, bmap2);
1614 struct isl_basic_map *isl_basic_map_apply_domain(
1615 struct isl_ctx *ctx, struct isl_basic_map *bmap1,
1616 struct isl_basic_map *bmap2)
1618 if (!bmap1 || !bmap2)
1621 isl_assert(ctx, bmap1->n_in == bmap2->n_in, goto error);
1622 isl_assert(ctx, bmap1->nparam == bmap2->nparam, goto error);
1624 bmap1 = isl_basic_map_reverse(ctx, bmap1);
1625 bmap1 = isl_basic_map_apply_range(ctx, bmap1, bmap2);
1626 return isl_basic_map_reverse(ctx, bmap1);
1628 isl_basic_map_free(ctx, bmap1);
1629 isl_basic_map_free(ctx, bmap2);
1633 static struct isl_basic_map *var_equal(struct isl_ctx *ctx,
1634 struct isl_basic_map *bmap, unsigned pos)
1637 i = isl_basic_map_alloc_equality(ctx, bmap);
1640 isl_seq_clr(bmap->eq[i],
1641 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->extra);
1642 isl_int_set_si(bmap->eq[i][1+bmap->nparam+pos], -1);
1643 isl_int_set_si(bmap->eq[i][1+bmap->nparam+bmap->n_in+pos], 1);
1644 return isl_basic_map_finalize(ctx, bmap);
1646 isl_basic_map_free(ctx, bmap);
1650 static struct isl_basic_map *var_more(struct isl_ctx *ctx,
1651 struct isl_basic_map *bmap, unsigned pos)
1654 i = isl_basic_map_alloc_inequality(ctx, bmap);
1657 isl_seq_clr(bmap->ineq[i],
1658 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->extra);
1659 isl_int_set_si(bmap->ineq[i][0], -1);
1660 isl_int_set_si(bmap->ineq[i][1+bmap->nparam+pos], -1);
1661 isl_int_set_si(bmap->ineq[i][1+bmap->nparam+bmap->n_in+pos], 1);
1662 return isl_basic_map_finalize(ctx, bmap);
1664 isl_basic_map_free(ctx, bmap);
1668 static struct isl_basic_map *var_less(struct isl_ctx *ctx,
1669 struct isl_basic_map *bmap, unsigned pos)
1672 i = isl_basic_map_alloc_inequality(ctx, bmap);
1675 isl_seq_clr(bmap->ineq[i],
1676 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->extra);
1677 isl_int_set_si(bmap->ineq[i][0], -1);
1678 isl_int_set_si(bmap->ineq[i][1+bmap->nparam+pos], 1);
1679 isl_int_set_si(bmap->ineq[i][1+bmap->nparam+bmap->n_in+pos], -1);
1680 return isl_basic_map_finalize(ctx, bmap);
1682 isl_basic_map_free(ctx, bmap);
1686 struct isl_basic_map *isl_basic_map_equal(struct isl_ctx *ctx,
1687 unsigned nparam, unsigned in, unsigned out, unsigned n_equal)
1690 struct isl_basic_map *bmap;
1691 bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, n_equal, 0);
1694 for (i = 0; i < n_equal && bmap; ++i)
1695 bmap = var_equal(ctx, bmap, i);
1696 return isl_basic_map_finalize(ctx, bmap);
1699 struct isl_basic_map *isl_basic_map_less_at(struct isl_ctx *ctx,
1700 unsigned nparam, unsigned in, unsigned out, unsigned pos)
1703 struct isl_basic_map *bmap;
1704 bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, pos, 1);
1707 for (i = 0; i < pos && bmap; ++i)
1708 bmap = var_equal(ctx, bmap, i);
1710 bmap = var_less(ctx, bmap, pos);
1711 return isl_basic_map_finalize(ctx, bmap);
1714 struct isl_basic_map *isl_basic_map_more_at(struct isl_ctx *ctx,
1715 unsigned nparam, unsigned in, unsigned out, unsigned pos)
1718 struct isl_basic_map *bmap;
1719 bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, pos, 1);
1722 for (i = 0; i < pos && bmap; ++i)
1723 bmap = var_equal(ctx, bmap, i);
1725 bmap = var_more(ctx, bmap, pos);
1726 return isl_basic_map_finalize(ctx, bmap);
1729 struct isl_basic_map *isl_basic_map_from_basic_set(
1730 struct isl_ctx *ctx, struct isl_basic_set *bset,
1731 unsigned n_in, unsigned n_out)
1733 struct isl_basic_map *bmap;
1735 bset = isl_basic_set_cow(ctx, bset);
1739 isl_assert(ctx, bset->dim == n_in + n_out, goto error);
1740 bmap = (struct isl_basic_map *) bset;
1742 bmap->n_out = n_out;
1743 return isl_basic_map_finalize(ctx, bmap);
1745 isl_basic_set_free(ctx, bset);
1749 struct isl_basic_set *isl_basic_set_from_basic_map(
1750 struct isl_ctx *ctx, struct isl_basic_map *bmap)
1754 if (bmap->n_in == 0)
1755 return (struct isl_basic_set *)bmap;
1756 bmap = isl_basic_map_cow(ctx, bmap);
1759 bmap->n_out += bmap->n_in;
1761 bmap = isl_basic_map_finalize(ctx, bmap);
1762 return (struct isl_basic_set *)bmap;
1767 static struct isl_basic_set *isl_basic_map_underlying_set(
1768 struct isl_ctx *ctx, struct isl_basic_map *bmap)
1772 if (bmap->nparam == 0 && bmap->n_in == 0 && bmap->n_div == 0)
1773 return (struct isl_basic_set *)bmap;
1774 bmap = isl_basic_map_cow(ctx, bmap);
1777 bmap->n_out += bmap->nparam + bmap->n_in + bmap->n_div;
1781 bmap = isl_basic_map_finalize(ctx, bmap);
1782 return (struct isl_basic_set *)bmap;
1787 struct isl_basic_set *isl_basic_map_domain(struct isl_ctx *ctx,
1788 struct isl_basic_map *bmap)
1790 struct isl_basic_set *domain;
1794 n_out = bmap->n_out;
1795 domain = isl_basic_set_from_basic_map(ctx, bmap);
1796 return isl_basic_set_project_out(ctx, domain, n_out, 0);
1799 struct isl_basic_set *isl_basic_map_range(struct isl_ctx *ctx,
1800 struct isl_basic_map *bmap)
1802 return isl_basic_map_domain(ctx,
1803 isl_basic_map_reverse(ctx, bmap));
1806 struct isl_set *isl_map_range(struct isl_ctx *ctx, struct isl_map *map)
1809 struct isl_set *set;
1813 map = isl_map_cow(ctx, map);
1817 set = (struct isl_set *) map;
1819 for (i = 0; i < map->n; ++i) {
1820 set->p[i] = isl_basic_map_range(ctx, map->p[i]);
1824 F_CLR(set, ISL_MAP_DISJOINT);
1827 isl_map_free(ctx, map);
1831 struct isl_map *isl_map_from_set(
1832 struct isl_ctx *ctx, struct isl_set *set,
1833 unsigned n_in, unsigned n_out)
1836 struct isl_map *map = NULL;
1840 isl_assert(ctx, set->dim == n_in + n_out, goto error);
1841 set = isl_set_cow(ctx, set);
1844 map = (struct isl_map *)set;
1845 for (i = 0; i < set->n; ++i) {
1846 map->p[i] = isl_basic_map_from_basic_set(ctx,
1847 set->p[i], n_in, n_out);
1855 isl_set_free(ctx, set);
1859 struct isl_map *isl_map_alloc(struct isl_ctx *ctx,
1860 unsigned nparam, unsigned in, unsigned out, int n,
1863 struct isl_map *map;
1865 map = isl_alloc(ctx, struct isl_map,
1866 sizeof(struct isl_map) +
1867 n * sizeof(struct isl_basic_map *));
1874 map->nparam = nparam;
1881 struct isl_basic_map *isl_basic_map_empty(struct isl_ctx *ctx,
1882 unsigned nparam, unsigned in, unsigned out)
1884 struct isl_basic_map *bmap;
1885 bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, 1, 0);
1886 bmap = isl_basic_map_set_to_empty(ctx, bmap);
1890 struct isl_map *isl_map_empty(struct isl_ctx *ctx,
1891 unsigned nparam, unsigned in, unsigned out)
1893 return isl_map_alloc(ctx, nparam, in, out, 0, ISL_MAP_DISJOINT);
1896 struct isl_set *isl_set_empty(struct isl_ctx *ctx,
1897 unsigned nparam, unsigned dim)
1899 return isl_set_alloc(ctx, nparam, dim, 0, ISL_MAP_DISJOINT);
1902 struct isl_map *isl_map_dup(struct isl_ctx *ctx, struct isl_map *map)
1905 struct isl_map *dup;
1907 dup = isl_map_alloc(ctx, map->nparam, map->n_in, map->n_out, map->n,
1909 for (i = 0; i < map->n; ++i)
1910 dup = isl_map_add(ctx, dup,
1911 isl_basic_map_dup(ctx, map->p[i]));
1915 struct isl_map *isl_map_add(struct isl_ctx *ctx, struct isl_map *map,
1916 struct isl_basic_map *bmap)
1920 isl_assert(ctx, map->nparam == bmap->nparam, goto error);
1921 isl_assert(ctx, map->n_in == bmap->n_in, goto error);
1922 isl_assert(ctx, map->n_out == bmap->n_out, goto error);
1923 isl_assert(ctx, map->n < map->size, goto error);
1924 map->p[map->n] = bmap;
1929 isl_map_free(ctx, map);
1931 isl_basic_map_free(ctx, bmap);
1935 void isl_map_free(struct isl_ctx *ctx, struct isl_map *map)
1945 for (i = 0; i < map->n; ++i)
1946 isl_basic_map_free(ctx, map->p[i]);
1950 struct isl_map *isl_map_extend(struct isl_ctx *ctx, struct isl_map *base,
1951 unsigned nparam, unsigned n_in, unsigned n_out)
1955 base = isl_map_cow(ctx, base);
1959 isl_assert(ctx, base->nparam <= nparam, goto error);
1960 isl_assert(ctx, base->n_in <= n_in, goto error);
1961 isl_assert(ctx, base->n_out <= n_out, goto error);
1962 base->nparam = nparam;
1964 base->n_out = n_out;
1965 for (i = 0; i < base->n; ++i) {
1966 base->p[i] = isl_basic_map_extend(ctx, base->p[i],
1967 nparam, n_in, n_out, 0, 0, 0);
1973 isl_map_free(ctx, base);
1977 struct isl_basic_map *isl_basic_map_fix_input_si(struct isl_ctx *ctx,
1978 struct isl_basic_map *bmap,
1979 unsigned input, int value)
1983 bmap = isl_basic_map_cow(ctx, bmap);
1986 isl_assert(ctx, input < bmap->n_in, goto error);
1988 bmap = isl_basic_map_extend(ctx, bmap,
1989 bmap->nparam, bmap->n_in, bmap->n_out, 0, 1, 0);
1990 j = isl_basic_map_alloc_equality(ctx, bmap);
1993 isl_seq_clr(bmap->eq[j],
1994 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->extra);
1995 isl_int_set_si(bmap->eq[j][1+bmap->nparam+input], -1);
1996 isl_int_set_si(bmap->eq[j][0], value);
1997 bmap = isl_basic_map_simplify(ctx, bmap);
1998 return isl_basic_map_finalize(ctx, bmap);
2000 isl_basic_map_free(ctx, bmap);
2004 struct isl_map *isl_map_fix_input_si(struct isl_ctx *ctx, struct isl_map *map,
2005 unsigned input, int value)
2009 map = isl_map_cow(ctx, map);
2013 isl_assert(ctx, input < map->n_in, goto error);
2014 for (i = 0; i < map->n; ++i) {
2015 map->p[i] = isl_basic_map_fix_input_si(ctx, map->p[i],
2022 isl_map_free(ctx, map);
2026 struct isl_map *isl_map_reverse(struct isl_ctx *ctx, struct isl_map *map)
2031 map = isl_map_cow(ctx, map);
2036 map->n_in = map->n_out;
2038 for (i = 0; i < map->n; ++i) {
2039 map->p[i] = isl_basic_map_reverse(ctx, map->p[i]);
2045 isl_map_free(ctx, map);
2049 struct isl_map *isl_basic_map_lexmax(struct isl_ctx *ctx,
2050 struct isl_basic_map *bmap, struct isl_basic_set *dom,
2051 struct isl_set **empty)
2053 return isl_pip_basic_map_lexmax(ctx, bmap, dom, empty);
2056 struct isl_map *isl_basic_map_lexmin(struct isl_ctx *ctx,
2057 struct isl_basic_map *bmap, struct isl_basic_set *dom,
2058 struct isl_set **empty)
2060 return isl_pip_basic_map_lexmin(ctx, bmap, dom, empty);
2063 struct isl_set *isl_basic_set_lexmin(struct isl_ctx *ctx,
2064 struct isl_basic_set *bset)
2066 struct isl_basic_map *bmap = NULL;
2067 struct isl_basic_set *dom = NULL;
2068 struct isl_map *min;
2072 bmap = isl_basic_map_from_basic_set(ctx, bset, 0, bset->dim);
2075 dom = isl_basic_set_alloc(ctx, bmap->nparam, 0, 0, 0, 0);
2078 min = isl_basic_map_lexmin(ctx, bmap, dom, NULL);
2079 return isl_map_range(ctx, min);
2081 isl_basic_map_free(ctx, bmap);
2085 struct isl_map *isl_basic_map_compute_divs(struct isl_ctx *ctx,
2086 struct isl_basic_map *bmap)
2090 if (bmap->n_div == 0)
2091 return isl_map_from_basic_map(ctx, bmap);
2092 return isl_pip_basic_map_compute_divs(ctx, bmap);
2095 struct isl_map *isl_map_compute_divs(struct isl_ctx *ctx, struct isl_map *map)
2098 struct isl_map *res;
2104 res = isl_basic_map_compute_divs(ctx,
2105 isl_basic_map_copy(ctx, map->p[0]));
2106 for (i = 1 ; i < map->n; ++i) {
2108 r2 = isl_basic_map_compute_divs(ctx,
2109 isl_basic_map_copy(ctx, map->p[i]));
2110 if (F_ISSET(map, ISL_MAP_DISJOINT))
2111 res = isl_map_union_disjoint(ctx, res, r2);
2113 res = isl_map_union(ctx, res, r2);
2115 isl_map_free(ctx, map);
2120 struct isl_set *isl_basic_set_compute_divs(struct isl_ctx *ctx,
2121 struct isl_basic_set *bset)
2123 return (struct isl_set *)
2124 isl_basic_map_compute_divs(ctx,
2125 (struct isl_basic_map *)bset);
2128 struct isl_set *isl_map_domain(struct isl_ctx *ctx, struct isl_map *map)
2131 struct isl_set *set;
2136 map = isl_map_cow(ctx, map);
2140 set = (struct isl_set *)map;
2141 set->dim = map->n_in;
2143 for (i = 0; i < map->n; ++i) {
2144 set->p[i] = isl_basic_map_domain(ctx, map->p[i]);
2148 F_CLR(set, ISL_MAP_DISJOINT);
2151 isl_map_free(ctx, map);
2155 struct isl_map *isl_map_union_disjoint(struct isl_ctx *ctx,
2156 struct isl_map *map1, struct isl_map *map2)
2160 struct isl_map *map = NULL;
2166 isl_map_free(ctx, map1);
2170 isl_map_free(ctx, map2);
2174 isl_assert(ctx, map1->nparam == map2->nparam, goto error);
2175 isl_assert(ctx, map1->n_in == map2->n_in, goto error);
2176 isl_assert(ctx, map1->n_out == map2->n_out, goto error);
2178 if (F_ISSET(map1, ISL_MAP_DISJOINT) &&
2179 F_ISSET(map2, ISL_MAP_DISJOINT))
2180 FL_SET(flags, ISL_MAP_DISJOINT);
2182 map = isl_map_alloc(ctx, map1->nparam, map1->n_in, map1->n_out,
2183 map1->n + map2->n, flags);
2186 for (i = 0; i < map1->n; ++i) {
2187 map = isl_map_add(ctx, map,
2188 isl_basic_map_copy(ctx, map1->p[i]));
2192 for (i = 0; i < map2->n; ++i) {
2193 map = isl_map_add(ctx, map,
2194 isl_basic_map_copy(ctx, map2->p[i]));
2198 isl_map_free(ctx, map1);
2199 isl_map_free(ctx, map2);
2202 isl_map_free(ctx, map);
2203 isl_map_free(ctx, map1);
2204 isl_map_free(ctx, map2);
2208 struct isl_map *isl_map_union(struct isl_ctx *ctx,
2209 struct isl_map *map1, struct isl_map *map2)
2211 map1 = isl_map_union_disjoint(ctx, map1, map2);
2215 F_CLR(map1, ISL_MAP_DISJOINT);
2219 struct isl_set *isl_set_union_disjoint(struct isl_ctx *ctx,
2220 struct isl_set *set1, struct isl_set *set2)
2222 return (struct isl_set *)
2223 isl_map_union_disjoint(ctx,
2224 (struct isl_map *)set1, (struct isl_map *)set2);
2227 struct isl_set *isl_set_union(struct isl_ctx *ctx,
2228 struct isl_set *set1, struct isl_set *set2)
2230 return (struct isl_set *)
2232 (struct isl_map *)set1, (struct isl_map *)set2);
2235 struct isl_map *isl_map_intersect_range(
2236 struct isl_ctx *ctx, struct isl_map *map,
2237 struct isl_set *set)
2240 struct isl_map *result;
2246 if (F_ISSET(map, ISL_MAP_DISJOINT) &&
2247 F_ISSET(set, ISL_MAP_DISJOINT))
2248 FL_SET(flags, ISL_MAP_DISJOINT);
2250 result = isl_map_alloc(ctx, map->nparam, map->n_in, map->n_out,
2251 map->n * set->n, flags);
2254 for (i = 0; i < map->n; ++i)
2255 for (j = 0; j < set->n; ++j) {
2256 result = isl_map_add(ctx, result,
2257 isl_basic_map_intersect_range(ctx,
2258 isl_basic_map_copy(ctx, map->p[i]),
2259 isl_basic_set_copy(ctx, set->p[j])));
2263 isl_map_free(ctx, map);
2264 isl_set_free(ctx, set);
2267 isl_map_free(ctx, map);
2268 isl_set_free(ctx, set);
2272 struct isl_map *isl_map_intersect_domain(
2273 struct isl_ctx *ctx, struct isl_map *map,
2274 struct isl_set *set)
2276 return isl_map_reverse(ctx,
2277 isl_map_intersect_range(ctx, isl_map_reverse(ctx, map), set));
2280 struct isl_map *isl_map_apply_domain(
2281 struct isl_ctx *ctx, struct isl_map *map1,
2282 struct isl_map *map2)
2286 map1 = isl_map_reverse(ctx, map1);
2287 map1 = isl_map_apply_range(ctx, map1, map2);
2288 return isl_map_reverse(ctx, map1);
2290 isl_map_free(ctx, map1);
2291 isl_map_free(ctx, map2);
2295 struct isl_map *isl_map_apply_range(
2296 struct isl_ctx *ctx, struct isl_map *map1,
2297 struct isl_map *map2)
2299 struct isl_map *result;
2305 isl_assert(ctx, map1->nparam == map2->nparam, goto error);
2306 isl_assert(ctx, map1->n_out == map2->n_in, goto error);
2308 result = isl_map_alloc(ctx, map1->nparam, map1->n_in, map2->n_out,
2309 map1->n * map2->n, 0);
2312 for (i = 0; i < map1->n; ++i)
2313 for (j = 0; j < map2->n; ++j) {
2314 result = isl_map_add(ctx, result,
2315 isl_basic_map_apply_range(ctx,
2316 isl_basic_map_copy(ctx, map1->p[i]),
2317 isl_basic_map_copy(ctx, map2->p[j])));
2321 isl_map_free(ctx, map1);
2322 isl_map_free(ctx, map2);
2325 isl_map_free(ctx, map1);
2326 isl_map_free(ctx, map2);
2331 * returns range - domain
2333 struct isl_basic_set *isl_basic_map_deltas(struct isl_ctx *ctx,
2334 struct isl_basic_map *bmap)
2336 struct isl_basic_set *bset;
2342 isl_assert(ctx, bmap->n_in == bmap->n_out, goto error);
2344 bset = isl_basic_set_from_basic_map(ctx, bmap);
2345 bset = isl_basic_set_extend(ctx, bset, bset->nparam, 3*dim, 0,
2347 bset = isl_basic_set_swap_vars(ctx, bset, 2*dim);
2348 for (i = 0; i < dim; ++i) {
2349 int j = isl_basic_map_alloc_equality(ctx,
2350 (struct isl_basic_map *)bset);
2353 isl_seq_clr(bset->eq[j],
2354 1 + bset->nparam + bset->dim + bset->extra);
2355 isl_int_set_si(bset->eq[j][1+bset->nparam+i], 1);
2356 isl_int_set_si(bset->eq[j][1+bset->nparam+dim+i], 1);
2357 isl_int_set_si(bset->eq[j][1+bset->nparam+2*dim+i], -1);
2359 return isl_basic_set_project_out(ctx, bset, 2*dim, 0);
2361 isl_basic_map_free(ctx, bmap);
2365 /* If the only constraints a div d=floor(f/m)
2366 * appears in are its two defining constraints
2369 * -(f - (m - 1)) + m d >= 0
2371 * then it can safely be removed.
2373 static int div_is_redundant(struct isl_ctx *ctx, struct isl_basic_map *bmap,
2377 unsigned pos = 1 + bmap->nparam + bmap->n_in + bmap->n_out + div;
2379 for (i = 0; i < bmap->n_eq; ++i)
2380 if (!isl_int_is_zero(bmap->eq[i][pos]))
2383 for (i = 0; i < bmap->n_ineq; ++i) {
2384 if (isl_int_is_zero(bmap->ineq[i][pos]))
2386 if (isl_int_eq(bmap->ineq[i][pos], bmap->div[div][0])) {
2388 isl_int_sub(bmap->div[div][1],
2389 bmap->div[div][1], bmap->div[div][0]);
2390 isl_int_add_ui(bmap->div[div][1], bmap->div[div][1], 1);
2391 neg = isl_seq_is_neg(bmap->ineq[i], bmap->div[div]+1, pos);
2392 isl_int_sub_ui(bmap->div[div][1], bmap->div[div][1], 1);
2393 isl_int_add(bmap->div[div][1],
2394 bmap->div[div][1], bmap->div[div][0]);
2397 if (isl_seq_first_non_zero(bmap->ineq[i]+pos+1,
2398 bmap->n_div-div-1) != -1)
2400 } else if (isl_int_abs_eq(bmap->ineq[i][pos], bmap->div[div][0])) {
2401 if (!isl_seq_eq(bmap->ineq[i], bmap->div[div]+1, pos))
2403 if (isl_seq_first_non_zero(bmap->ineq[i]+pos+1,
2404 bmap->n_div-div-1) != -1)
2410 for (i = 0; i < bmap->n_div; ++i)
2411 if (!isl_int_is_zero(bmap->div[i][1+pos]))
2418 * Remove divs that don't occur in any of the constraints or other divs.
2419 * These can arise when dropping some of the variables in a quast
2420 * returned by piplib.
2422 static struct isl_basic_map *remove_redundant_divs(struct isl_ctx *ctx,
2423 struct isl_basic_map *bmap)
2427 for (i = bmap->n_div-1; i >= 0; --i) {
2428 if (!div_is_redundant(ctx, bmap, i))
2430 bmap = isl_basic_map_drop_div(ctx, bmap, i);
2435 struct isl_basic_map *isl_basic_map_finalize(struct isl_ctx *ctx,
2436 struct isl_basic_map *bmap)
2438 bmap = remove_redundant_divs(ctx, bmap);
2441 F_SET(bmap, ISL_BASIC_SET_FINAL);
2445 struct isl_basic_set *isl_basic_set_finalize(struct isl_ctx *ctx,
2446 struct isl_basic_set *bset)
2448 return (struct isl_basic_set *)
2449 isl_basic_map_finalize(ctx,
2450 (struct isl_basic_map *)bset);
2453 struct isl_set *isl_set_finalize(struct isl_ctx *ctx, struct isl_set *set)
2459 for (i = 0; i < set->n; ++i) {
2460 set->p[i] = isl_basic_set_finalize(ctx, set->p[i]);
2466 isl_set_free(ctx, set);
2470 struct isl_map *isl_map_finalize(struct isl_ctx *ctx, struct isl_map *map)
2476 for (i = 0; i < map->n; ++i) {
2477 map->p[i] = isl_basic_map_finalize(ctx, map->p[i]);
2483 isl_map_free(ctx, map);
2487 struct isl_basic_map *isl_basic_map_identity(struct isl_ctx *ctx,
2488 unsigned nparam, unsigned dim)
2490 struct isl_basic_map *bmap;
2493 bmap = isl_basic_map_alloc(ctx, nparam, dim, dim, 0, dim, 0);
2497 for (i = 0; i < dim; ++i) {
2498 int j = isl_basic_map_alloc_equality(ctx, bmap);
2501 isl_seq_clr(bmap->eq[j],
2502 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->extra);
2503 isl_int_set_si(bmap->eq[j][1+nparam+i], 1);
2504 isl_int_set_si(bmap->eq[j][1+nparam+dim+i], -1);
2506 return isl_basic_map_finalize(ctx, bmap);
2508 isl_basic_map_free(ctx, bmap);
2512 struct isl_map *isl_map_identity(struct isl_ctx *ctx,
2513 unsigned nparam, unsigned dim)
2515 struct isl_map *map = isl_map_alloc(ctx, nparam, dim, dim, 1,
2519 map = isl_map_add(ctx, map,
2520 isl_basic_map_identity(ctx, nparam, dim));
2523 isl_map_free(ctx, map);
2527 int isl_set_is_equal(struct isl_ctx *ctx,
2528 struct isl_set *set1, struct isl_set *set2)
2530 return isl_map_is_equal(ctx,
2531 (struct isl_map *)set1, (struct isl_map *)set2);
2534 int isl_set_is_subset(struct isl_ctx *ctx,
2535 struct isl_set *set1, struct isl_set *set2)
2537 return isl_map_is_subset(ctx,
2538 (struct isl_map *)set1, (struct isl_map *)set2);
2541 int isl_basic_map_is_subset(struct isl_ctx *ctx,
2542 struct isl_basic_map *bmap1,
2543 struct isl_basic_map *bmap2)
2546 struct isl_map *map1;
2547 struct isl_map *map2;
2549 if (!bmap1 || !bmap2)
2552 map1 = isl_map_from_basic_map(ctx,
2553 isl_basic_map_copy(ctx, bmap1));
2554 map2 = isl_map_from_basic_map(ctx,
2555 isl_basic_map_copy(ctx, bmap2));
2557 is_subset = isl_map_is_subset(ctx, map1, map2);
2559 isl_map_free(ctx, map1);
2560 isl_map_free(ctx, map2);
2565 int isl_map_is_empty(struct isl_ctx *ctx, struct isl_map *map)
2572 for (i = 0; i < map->n; ++i) {
2573 is_empty = isl_basic_map_is_empty(ctx, map->p[i]);
2582 int isl_set_is_empty(struct isl_ctx *ctx, struct isl_set *set)
2584 return isl_map_is_empty(ctx, (struct isl_map *)set);
2587 int isl_map_is_subset(struct isl_ctx *ctx, struct isl_map *map1,
2588 struct isl_map *map2)
2592 struct isl_map *diff;
2597 if (isl_map_is_empty(ctx, map1))
2600 if (isl_map_is_empty(ctx, map2))
2603 diff = isl_map_subtract(ctx, isl_map_copy(ctx, map1),
2604 isl_map_copy(ctx, map2));
2608 is_subset = isl_map_is_empty(ctx, diff);
2609 isl_map_free(ctx, diff);
2614 int isl_map_is_equal(struct isl_ctx *ctx,
2615 struct isl_map *map1, struct isl_map *map2)
2621 is_subset = isl_map_is_subset(ctx, map1, map2);
2624 is_subset = isl_map_is_subset(ctx, map2, map1);
2628 int isl_basic_map_is_strict_subset(struct isl_ctx *ctx,
2629 struct isl_basic_map *bmap1,
2630 struct isl_basic_map *bmap2)
2634 if (!bmap1 || !bmap2)
2636 is_subset = isl_basic_map_is_subset(ctx, bmap1, bmap2);
2639 is_subset = isl_basic_map_is_subset(ctx, bmap2, bmap1);
2640 if (is_subset == -1)
2645 static int basic_map_contains(struct isl_ctx *ctx, struct isl_basic_map *bmap,
2646 struct isl_vec *vec)
2652 total = 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
2653 if (total != vec->size)
2658 for (i = 0; i < bmap->n_eq; ++i) {
2659 isl_seq_inner_product(vec->block.data, bmap->eq[i], total, &s);
2660 if (!isl_int_is_zero(s)) {
2666 for (i = 0; i < bmap->n_ineq; ++i) {
2667 isl_seq_inner_product(vec->block.data, bmap->ineq[i], total, &s);
2668 if (isl_int_is_neg(s)) {
2679 int isl_basic_map_is_empty(struct isl_ctx *ctx,
2680 struct isl_basic_map *bmap)
2682 struct isl_basic_set *bset = NULL;
2683 struct isl_vec *sample = NULL;
2690 if (F_ISSET(bmap, ISL_BASIC_MAP_EMPTY))
2693 total = 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
2694 if (bmap->sample && bmap->sample->size == total) {
2695 int contains = basic_map_contains(ctx, bmap, bmap->sample);
2701 bset = isl_basic_map_underlying_set(ctx,
2702 isl_basic_map_copy(ctx, bmap));
2705 sample = isl_basic_set_sample(ctx, bset);
2708 empty = sample->size == 0;
2710 isl_vec_free(ctx, bmap->sample);
2711 bmap->sample = sample;
2716 struct isl_map *isl_basic_map_union(
2717 struct isl_ctx *ctx, struct isl_basic_map *bmap1,
2718 struct isl_basic_map *bmap2)
2720 struct isl_map *map;
2721 if (!bmap1 || !bmap2)
2724 isl_assert(ctx, bmap1->nparam == bmap2->nparam, goto error);
2725 isl_assert(ctx, bmap1->n_in == bmap2->n_in, goto error);
2726 isl_assert(ctx, bmap1->n_out == bmap2->n_out, goto error);
2728 map = isl_map_alloc(ctx, bmap1->nparam,
2729 bmap1->n_in, bmap1->n_out, 2, 0);
2732 map = isl_map_add(ctx, map, bmap1);
2733 map = isl_map_add(ctx, map, bmap2);
2736 isl_basic_map_free(ctx, bmap1);
2737 isl_basic_map_free(ctx, bmap2);
2741 struct isl_set *isl_basic_set_union(
2742 struct isl_ctx *ctx, struct isl_basic_set *bset1,
2743 struct isl_basic_set *bset2)
2745 return (struct isl_set *)isl_basic_map_union(ctx,
2746 (struct isl_basic_map *)bset1,
2747 (struct isl_basic_map *)bset2);
2750 /* Order divs such that any div only depends on previous divs */
2751 static struct isl_basic_map *order_divs(struct isl_ctx *ctx,
2752 struct isl_basic_map *bmap)
2755 unsigned off = bmap->nparam + bmap->n_in + bmap->n_out;
2757 for (i = 0; i < bmap->n_div; ++i) {
2759 pos = isl_seq_first_non_zero(bmap->div[i]+1+1+off+i,
2763 swap_div(bmap, i, pos);
2769 static int find_div(struct isl_basic_map *dst,
2770 struct isl_basic_map *src, unsigned div)
2774 unsigned total = src->nparam + src->n_in + src->n_out + src->n_div;
2776 for (i = 0; i < dst->n_div; ++i)
2777 if (isl_seq_eq(dst->div[i], src->div[div], 1+1+total) &&
2778 isl_seq_first_non_zero(dst->div[i]+1+1+total,
2779 dst->n_div - src->n_div) == -1)
2784 /* For a div d = floor(f/m), add the constraints
2787 * -(f-(n-1)) + m d >= 0
2789 * Note that the second constraint is the negation of
2793 static int add_div_constraints(struct isl_ctx *ctx,
2794 struct isl_basic_map *bmap, unsigned div)
2797 unsigned div_pos = 1 + bmap->nparam + bmap->n_in + bmap->n_out + div;
2798 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->extra;
2800 i = isl_basic_map_alloc_inequality(ctx, bmap);
2803 isl_seq_cpy(bmap->ineq[i], bmap->div[div]+1, 1+total);
2804 isl_int_neg(bmap->ineq[i][div_pos], bmap->div[div][0]);
2806 j = isl_basic_map_alloc_inequality(ctx, bmap);
2809 isl_seq_neg(bmap->ineq[j], bmap->ineq[i], 1 + total);
2810 isl_int_add(bmap->ineq[j][0], bmap->ineq[j][0], bmap->ineq[j][div_pos]);
2811 isl_int_sub_ui(bmap->ineq[j][0], bmap->ineq[j][0], 1);
2815 struct isl_basic_map *isl_basic_map_align_divs(struct isl_ctx *ctx,
2816 struct isl_basic_map *dst, struct isl_basic_map *src)
2819 unsigned total = src->nparam + src->n_in + src->n_out + src->n_div;
2821 if (src->n_div == 0)
2824 src = order_divs(ctx, src);
2825 dst = isl_basic_map_extend(ctx, dst, dst->nparam, dst->n_in,
2826 dst->n_out, src->n_div, 0, 2 * src->n_div);
2829 for (i = 0; i < src->n_div; ++i) {
2830 int j = find_div(dst, src, i);
2832 j = isl_basic_map_alloc_div(ctx, dst);
2835 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total);
2836 isl_seq_clr(dst->div[j]+1+1+total,
2837 dst->extra - src->n_div);
2838 if (add_div_constraints(ctx, dst, j) < 0)
2842 swap_div(dst, i, j);
2846 isl_basic_map_free(ctx, dst);
2850 static struct isl_map *add_cut_constraint(struct isl_ctx *ctx,
2851 struct isl_map *dst,
2852 struct isl_basic_map *src, isl_int *c,
2853 unsigned len, int oppose)
2855 struct isl_basic_map *copy = NULL;
2860 copy = isl_basic_map_copy(ctx, src);
2861 copy = isl_basic_map_cow(ctx, copy);
2864 copy = isl_basic_map_extend(ctx, copy,
2865 copy->nparam, copy->n_in, copy->n_out, 0, 0, 1);
2866 k = isl_basic_map_alloc_inequality(ctx, copy);
2870 isl_seq_neg(copy->ineq[k], c, len);
2872 isl_seq_cpy(copy->ineq[k], c, len);
2873 total = 1 + copy->nparam + copy->n_in + copy->n_out + copy->extra;
2874 isl_seq_clr(copy->ineq[k]+len, total - len);
2875 isl_inequality_negate(ctx, copy, k);
2876 copy = isl_basic_map_simplify(ctx, copy);
2877 copy = isl_basic_map_finalize(ctx, copy);
2878 is_empty = isl_basic_map_is_empty(ctx, copy);
2882 dst = isl_map_add(ctx, dst, copy);
2884 isl_basic_map_free(ctx, copy);
2887 isl_basic_map_free(ctx, copy);
2888 isl_map_free(ctx, dst);
2892 static struct isl_map *subtract(struct isl_ctx *ctx, struct isl_map *map,
2893 struct isl_basic_map *bmap)
2897 struct isl_map *rest = NULL;
2899 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
2906 if (F_ISSET(map, ISL_MAP_DISJOINT))
2907 FL_SET(flags, ISL_MAP_DISJOINT);
2909 max = map->n * (2 * bmap->n_eq + bmap->n_ineq);
2910 rest = isl_map_alloc(ctx, map->nparam, map->n_in, map->n_out,
2915 for (i = 0; i < map->n; ++i) {
2916 map->p[i] = isl_basic_map_align_divs(ctx, map->p[i], bmap);
2921 for (j = 0; j < map->n; ++j)
2922 map->p[j] = isl_basic_map_cow(ctx, map->p[j]);
2924 for (i = 0; i < bmap->n_eq; ++i) {
2925 for (j = 0; j < map->n; ++j) {
2926 rest = add_cut_constraint(ctx, rest,
2927 map->p[j], bmap->eq[i], 1+total, 0);
2931 rest = add_cut_constraint(ctx, rest,
2932 map->p[j], bmap->eq[i], 1+total, 1);
2936 map->p[j] = isl_basic_map_extend(ctx, map->p[j],
2937 map->p[j]->nparam, map->p[j]->n_in,
2938 map->p[j]->n_out, 0, 1, 0);
2941 k = isl_basic_map_alloc_equality(ctx, map->p[j]);
2944 isl_seq_cpy(map->p[j]->eq[k], bmap->eq[i], 1+total);
2945 isl_seq_clr(map->p[j]->eq[k]+1+total,
2946 map->p[j]->extra - bmap->n_div);
2950 for (i = 0; i < bmap->n_ineq; ++i) {
2951 for (j = 0; j < map->n; ++j) {
2952 rest = add_cut_constraint(ctx, rest,
2953 map->p[j], bmap->ineq[i], 1+total, 0);
2957 map->p[j] = isl_basic_map_extend(ctx, map->p[j],
2958 map->p[j]->nparam, map->p[j]->n_in,
2959 map->p[j]->n_out, 0, 0, 1);
2962 k = isl_basic_map_alloc_inequality(ctx, map->p[j]);
2965 isl_seq_cpy(map->p[j]->ineq[k], bmap->ineq[i], 1+total);
2966 isl_seq_clr(map->p[j]->ineq[k]+1+total,
2967 map->p[j]->extra - bmap->n_div);
2971 isl_map_free(ctx, map);
2974 isl_map_free(ctx, map);
2975 isl_map_free(ctx, rest);
2979 struct isl_map *isl_map_subtract(struct isl_ctx *ctx, struct isl_map *map1,
2980 struct isl_map *map2)
2986 isl_assert(ctx, map1->nparam == map2->nparam, goto error);
2987 isl_assert(ctx, map1->n_in == map2->n_in, goto error);
2988 isl_assert(ctx, map1->n_out == map2->n_out, goto error);
2990 if (isl_map_is_empty(ctx, map2)) {
2991 isl_map_free(ctx, map2);
2995 map1 = isl_map_compute_divs(ctx, map1);
2996 map2 = isl_map_compute_divs(ctx, map2);
3000 for (i = 0; map1 && i < map2->n; ++i)
3001 map1 = subtract(ctx, map1, map2->p[i]);
3003 isl_map_free(ctx, map2);
3006 isl_map_free(ctx, map1);
3007 isl_map_free(ctx, map2);
3011 struct isl_set *isl_set_subtract(struct isl_ctx *ctx, struct isl_set *set1,
3012 struct isl_set *set2)
3014 return (struct isl_set *)
3015 isl_map_subtract(ctx,
3016 (struct isl_map *)set1, (struct isl_map *)set2);
3019 struct isl_set *isl_set_apply(struct isl_ctx *ctx, struct isl_set *set,
3020 struct isl_map *map)
3022 isl_assert(ctx, set->dim == map->n_in, goto error);
3023 map = isl_map_intersect_domain(ctx, map, set);
3024 set = isl_map_range(ctx, map);
3027 isl_set_free(ctx, set);
3028 isl_map_free(ctx, map);