8 #include "isl_map_private.h"
9 #include "isl_map_piplib.h"
10 #include "isl_sample.h"
13 static struct isl_basic_map *basic_map_init(struct isl_ctx *ctx,
14 struct isl_basic_map *bmap,
15 unsigned nparam, unsigned n_in, unsigned n_out, unsigned extra,
16 unsigned n_eq, unsigned n_ineq)
19 size_t row_size = 1 + nparam + n_in + n_out + extra;
21 bmap->block = isl_blk_alloc(ctx, (n_eq + n_ineq) * row_size);
22 if (isl_blk_is_error(bmap->block)) {
27 bmap->eq = isl_alloc_array(ctx, isl_int *, n_eq + n_ineq);
29 isl_blk_free(ctx, bmap->block);
35 bmap->block2 = isl_blk_empty();
38 bmap->block2 = isl_blk_alloc(ctx, extra * (1 + row_size));
39 if (isl_blk_is_error(bmap->block2)) {
41 isl_blk_free(ctx, bmap->block);
46 bmap->div = isl_alloc_array(ctx, isl_int *, extra);
48 isl_blk_free(ctx, bmap->block2);
50 isl_blk_free(ctx, bmap->block);
56 for (i = 0; i < n_eq + n_ineq; ++i)
57 bmap->eq[i] = bmap->block.data + i * row_size;
59 for (i = 0; i < extra; ++i)
60 bmap->div[i] = bmap->block2.data + i * (1 + row_size);
64 bmap->c_size = n_eq + n_ineq;
65 bmap->ineq = bmap->eq + n_eq;
66 bmap->nparam = nparam;
78 struct isl_basic_set *isl_basic_set_alloc(struct isl_ctx *ctx,
79 unsigned nparam, unsigned dim, unsigned extra,
80 unsigned n_eq, unsigned n_ineq)
82 struct isl_basic_map *bmap;
83 bmap = isl_basic_map_alloc(ctx, nparam, 0, dim, extra, n_eq, n_ineq);
84 return (struct isl_basic_set *)bmap;
87 struct isl_basic_map *isl_basic_map_alloc(struct isl_ctx *ctx,
88 unsigned nparam, unsigned in, unsigned out, unsigned extra,
89 unsigned n_eq, unsigned n_ineq)
91 struct isl_basic_map *bmap;
93 bmap = isl_alloc_type(ctx, struct isl_basic_map);
97 return basic_map_init(ctx, bmap,
98 nparam, in, out, extra, n_eq, n_ineq);
101 static void dup_constraints(struct isl_ctx *ctx,
102 struct isl_basic_map *dst, struct isl_basic_map *src)
105 unsigned total = src->nparam + src->n_in + src->n_out + src->n_div;
107 for (i = 0; i < src->n_eq; ++i) {
108 int j = isl_basic_map_alloc_equality(ctx, dst);
109 isl_seq_cpy(dst->eq[j], src->eq[i], 1+total);
112 for (i = 0; i < src->n_ineq; ++i) {
113 int j = isl_basic_map_alloc_inequality(ctx, dst);
114 isl_seq_cpy(dst->ineq[j], src->ineq[i], 1+total);
117 for (i = 0; i < src->n_div; ++i) {
118 int j = isl_basic_map_alloc_div(ctx, dst);
119 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total);
121 F_SET(dst, ISL_BASIC_SET_FINAL);
124 struct isl_basic_map *isl_basic_map_dup(struct isl_ctx *ctx,
125 struct isl_basic_map *bmap)
127 struct isl_basic_map *dup;
129 dup = isl_basic_map_alloc(ctx, bmap->nparam,
130 bmap->n_in, bmap->n_out,
131 bmap->n_div, bmap->n_eq, bmap->n_ineq);
134 dup_constraints(ctx, dup, bmap);
135 dup->sample = isl_vec_copy(ctx, bmap->sample);
139 struct isl_basic_set *isl_basic_set_dup(struct isl_ctx *ctx,
140 struct isl_basic_set *bset)
142 struct isl_basic_map *dup;
144 dup = isl_basic_map_dup(ctx, (struct isl_basic_map *)bset);
145 return (struct isl_basic_set *)dup;
148 struct isl_basic_set *isl_basic_set_copy(struct isl_ctx *ctx,
149 struct isl_basic_set *bset)
154 if (F_ISSET(bset, ISL_BASIC_SET_FINAL)) {
158 return isl_basic_set_dup(ctx, bset);
161 struct isl_set *isl_set_copy(struct isl_ctx *ctx, struct isl_set *set)
170 struct isl_basic_map *isl_basic_map_copy(struct isl_ctx *ctx,
171 struct isl_basic_map *bmap)
176 if (F_ISSET(bmap, ISL_BASIC_SET_FINAL)) {
180 return isl_basic_map_dup(ctx, bmap);
183 struct isl_map *isl_map_copy(struct isl_ctx *ctx, struct isl_map *map)
192 void isl_basic_map_free(struct isl_ctx *ctx, struct isl_basic_map *bmap)
201 isl_blk_free(ctx, bmap->block2);
203 isl_blk_free(ctx, bmap->block);
204 isl_vec_free(ctx, bmap->sample);
208 void isl_basic_set_free(struct isl_ctx *ctx, struct isl_basic_set *bset)
210 isl_basic_map_free(ctx, (struct isl_basic_map *)bset);
213 int isl_basic_map_alloc_equality(struct isl_ctx *ctx,
214 struct isl_basic_map *bmap)
218 isl_assert(ctx, bmap->n_eq + bmap->n_ineq < bmap->c_size, return -1);
219 isl_assert(ctx, bmap->eq + bmap->n_eq <= bmap->ineq, return -1);
220 if (bmap->eq + bmap->n_eq == bmap->ineq) {
222 int j = isl_basic_map_alloc_inequality(ctx, bmap);
226 bmap->ineq[0] = bmap->ineq[j];
234 int isl_basic_map_free_equality(struct isl_ctx *ctx,
235 struct isl_basic_map *bmap, unsigned n)
237 isl_assert(ctx, n <= bmap->n_eq, return -1);
242 int isl_basic_map_drop_equality(struct isl_ctx *ctx,
243 struct isl_basic_map *bmap, unsigned pos)
246 isl_assert(ctx, pos < bmap->n_eq, return -1);
248 if (pos != bmap->n_eq - 1) {
250 bmap->eq[pos] = bmap->eq[bmap->n_eq - 1];
251 bmap->eq[bmap->n_eq - 1] = t;
257 void isl_basic_map_inequality_to_equality(struct isl_ctx *ctx,
258 struct isl_basic_map *bmap, unsigned pos)
263 bmap->ineq[pos] = bmap->ineq[0];
264 bmap->ineq[0] = bmap->eq[bmap->n_eq];
265 bmap->eq[bmap->n_eq] = t;
271 int isl_basic_map_alloc_inequality(struct isl_ctx *ctx,
272 struct isl_basic_map *bmap)
274 isl_assert(ctx, (bmap->ineq - bmap->eq) + bmap->n_ineq < bmap->c_size,
276 return bmap->n_ineq++;
279 int isl_basic_map_free_inequality(struct isl_ctx *ctx,
280 struct isl_basic_map *bmap, unsigned n)
282 isl_assert(ctx, n <= bmap->n_ineq, return -1);
287 int isl_basic_map_drop_inequality(struct isl_ctx *ctx,
288 struct isl_basic_map *bmap, unsigned pos)
291 isl_assert(ctx, pos < bmap->n_ineq, return -1);
293 if (pos != bmap->n_ineq - 1) {
295 bmap->ineq[pos] = bmap->ineq[bmap->n_ineq - 1];
296 bmap->ineq[bmap->n_ineq - 1] = t;
302 int isl_basic_map_alloc_div(struct isl_ctx *ctx,
303 struct isl_basic_map *bmap)
305 isl_assert(ctx, bmap->n_div < bmap->extra, return -1);
306 return bmap->n_div++;
309 int isl_basic_map_free_div(struct isl_ctx *ctx,
310 struct isl_basic_map *bmap, unsigned n)
312 isl_assert(ctx, n <= bmap->n_div, return -1);
317 /* Copy constraint from src to dst, putting the vars of src at offset
318 * dim_off in dst and the divs of src at offset div_off in dst.
319 * If both sets are actually map, then dim_off applies to the input
322 static void copy_constraint(struct isl_basic_map *dst_map, isl_int *dst,
323 struct isl_basic_map *src_map, isl_int *src,
324 unsigned in_off, unsigned out_off, unsigned div_off)
326 isl_int_set(dst[0], src[0]);
327 isl_seq_cpy(dst+1, src+1, isl_min(dst_map->nparam, src_map->nparam));
328 if (dst_map->nparam > src_map->nparam)
329 isl_seq_clr(dst+1+src_map->nparam,
330 dst_map->nparam - src_map->nparam);
331 isl_seq_clr(dst+1+dst_map->nparam, in_off);
332 isl_seq_cpy(dst+1+dst_map->nparam+in_off,
333 src+1+src_map->nparam,
334 isl_min(dst_map->n_in-in_off, src_map->n_in));
335 if (dst_map->n_in-in_off > src_map->n_in)
336 isl_seq_clr(dst+1+dst_map->nparam+in_off+src_map->n_in,
337 dst_map->n_in - in_off - src_map->n_in);
338 isl_seq_clr(dst+1+dst_map->nparam+dst_map->n_in, out_off);
339 isl_seq_cpy(dst+1+dst_map->nparam+dst_map->n_in+out_off,
340 src+1+src_map->nparam+src_map->n_in,
341 isl_min(dst_map->n_out-out_off, src_map->n_out));
342 if (dst_map->n_out-out_off > src_map->n_out)
343 isl_seq_clr(dst+1+dst_map->nparam+dst_map->n_in+out_off+src_map->n_out,
344 dst_map->n_out - out_off - src_map->n_out);
345 isl_seq_clr(dst+1+dst_map->nparam+dst_map->n_in+dst_map->n_out, div_off);
346 isl_seq_cpy(dst+1+dst_map->nparam+dst_map->n_in+dst_map->n_out+div_off,
347 src+1+src_map->nparam+src_map->n_in+src_map->n_out,
348 isl_min(dst_map->extra-div_off, src_map->extra));
349 if (dst_map->extra-div_off > src_map->extra)
350 isl_seq_clr(dst+1+dst_map->nparam+dst_map->n_in+dst_map->n_out+
351 div_off+src_map->extra,
352 dst_map->extra - div_off - src_map->extra);
355 static void copy_div(struct isl_basic_map *dst_map, isl_int *dst,
356 struct isl_basic_map *src_map, isl_int *src,
357 unsigned in_off, unsigned out_off, unsigned div_off)
359 isl_int_set(dst[0], src[0]);
360 copy_constraint(dst_map, dst+1, src_map, src+1, in_off, out_off, div_off);
363 static struct isl_basic_map *add_constraints(struct isl_ctx *ctx,
364 struct isl_basic_map *bmap1,
365 struct isl_basic_map *bmap2, unsigned i_pos, unsigned o_pos)
368 unsigned div_off = bmap1->n_div;
370 for (i = 0; i < bmap2->n_eq; ++i) {
371 int i1 = isl_basic_map_alloc_equality(ctx, bmap1);
374 copy_constraint(bmap1, bmap1->eq[i1], bmap2, bmap2->eq[i],
375 i_pos, o_pos, div_off);
378 for (i = 0; i < bmap2->n_ineq; ++i) {
379 int i1 = isl_basic_map_alloc_inequality(ctx, bmap1);
382 copy_constraint(bmap1, bmap1->ineq[i1], bmap2, bmap2->ineq[i],
383 i_pos, o_pos, div_off);
386 for (i = 0; i < bmap2->n_div; ++i) {
387 int i1 = isl_basic_map_alloc_div(ctx, bmap1);
390 copy_div(bmap1, bmap1->div[i1], bmap2, bmap2->div[i],
391 i_pos, o_pos, div_off);
394 isl_basic_map_free(ctx, bmap2);
399 isl_basic_map_free(ctx, bmap1);
400 isl_basic_map_free(ctx, bmap2);
404 struct isl_basic_map *isl_basic_map_extend(struct isl_ctx *ctx,
405 struct isl_basic_map *base,
406 unsigned nparam, unsigned n_in, unsigned n_out, unsigned extra,
407 unsigned n_eq, unsigned n_ineq)
409 struct isl_basic_map *ext;
412 base = isl_basic_map_cow(ctx, base);
416 dims_ok = base && base->nparam == nparam &&
417 base->n_in == n_in && base->n_out == n_out &&
418 base->extra >= base->n_div + extra;
420 if (dims_ok && n_eq == 0 && n_ineq == 0)
424 isl_assert(ctx, base->nparam <= nparam, goto error);
425 isl_assert(ctx, base->n_in <= n_in, goto error);
426 isl_assert(ctx, base->n_out <= n_out, goto error);
427 extra += base->extra;
429 n_ineq += base->n_ineq;
432 ext = isl_basic_map_alloc(ctx, nparam, n_in, n_out,
433 extra, n_eq, n_ineq);
439 ext = add_constraints(ctx, ext, base, 0, 0);
444 isl_basic_map_free(ctx, base);
448 struct isl_basic_set *isl_basic_set_extend(struct isl_ctx *ctx,
449 struct isl_basic_set *base,
450 unsigned nparam, unsigned dim, unsigned extra,
451 unsigned n_eq, unsigned n_ineq)
453 return (struct isl_basic_set *)
454 isl_basic_map_extend(ctx, (struct isl_basic_map *)base,
455 nparam, 0, dim, extra, n_eq, n_ineq);
458 struct isl_basic_set *isl_basic_set_cow(struct isl_ctx *ctx,
459 struct isl_basic_set *bset)
461 return (struct isl_basic_set *)
462 isl_basic_map_cow(ctx, (struct isl_basic_map *)bset);
465 struct isl_basic_map *isl_basic_map_cow(struct isl_ctx *ctx,
466 struct isl_basic_map *bmap)
473 bmap = isl_basic_map_dup(ctx, bmap);
475 F_CLR(bmap, ISL_BASIC_SET_FINAL);
479 static struct isl_set *isl_set_cow(struct isl_ctx *ctx, struct isl_set *set)
487 return isl_set_dup(ctx, set);
490 struct isl_map *isl_map_cow(struct isl_ctx *ctx, struct isl_map *map)
498 return isl_map_dup(ctx, map);
501 static void swap_vars(struct isl_blk blk, isl_int *a,
502 unsigned a_len, unsigned b_len)
504 isl_seq_cpy(blk.data, a+a_len, b_len);
505 isl_seq_cpy(blk.data+b_len, a, a_len);
506 isl_seq_cpy(a, blk.data, b_len+a_len);
509 struct isl_basic_set *isl_basic_set_swap_vars(struct isl_ctx *ctx,
510 struct isl_basic_set *bset, unsigned n)
518 isl_assert(ctx, n <= bset->dim, goto error);
523 bset = isl_basic_set_cow(ctx, bset);
527 blk = isl_blk_alloc(ctx, bset->dim);
528 if (isl_blk_is_error(blk))
531 for (i = 0; i < bset->n_eq; ++i)
533 bset->eq[i]+1+bset->nparam, n, bset->dim - n);
535 for (i = 0; i < bset->n_ineq; ++i)
537 bset->ineq[i]+1+bset->nparam, n, bset->dim - n);
539 for (i = 0; i < bset->n_div; ++i)
541 bset->div[i]+1+1+bset->nparam, n, bset->dim - n);
543 isl_blk_free(ctx, blk);
548 isl_basic_set_free(ctx, bset);
552 struct isl_set *isl_set_swap_vars(struct isl_ctx *ctx,
553 struct isl_set *set, unsigned n)
556 set = isl_set_cow(ctx, set);
560 for (i = 0; i < set->n; ++i) {
561 set->p[i] = isl_basic_set_swap_vars(ctx, set->p[i], n);
563 isl_set_free(ctx, set);
570 static void constraint_drop_vars(isl_int *c, unsigned n, unsigned rem)
572 isl_seq_cpy(c, c + n, rem);
573 isl_seq_clr(c + rem, n);
576 struct isl_basic_set *isl_basic_set_drop_vars(struct isl_ctx *ctx,
577 struct isl_basic_set *bset, unsigned first, unsigned n)
584 isl_assert(ctx, first + n <= bset->dim, goto error);
589 bset = isl_basic_set_cow(ctx, bset);
593 for (i = 0; i < bset->n_eq; ++i)
594 constraint_drop_vars(bset->eq[i]+1+bset->nparam+first, n,
595 (bset->dim-first-n)+bset->extra);
597 for (i = 0; i < bset->n_ineq; ++i)
598 constraint_drop_vars(bset->ineq[i]+1+bset->nparam+first, n,
599 (bset->dim-first-n)+bset->extra);
601 for (i = 0; i < bset->n_div; ++i)
602 constraint_drop_vars(bset->div[i]+1+1+bset->nparam+first, n,
603 (bset->dim-first-n)+bset->extra);
608 return isl_basic_set_finalize(ctx, bset);
610 isl_basic_set_free(ctx, bset);
615 * We don't cow, as the div is assumed to be redundant.
617 static struct isl_basic_map *isl_basic_map_drop_div(struct isl_ctx *ctx,
618 struct isl_basic_map *bmap, unsigned div)
626 pos = 1 + bmap->nparam + bmap->n_in + bmap->n_out + div;
628 isl_assert(ctx, div < bmap->n_div, goto error);
630 for (i = 0; i < bmap->n_eq; ++i)
631 constraint_drop_vars(bmap->eq[i]+pos, 1, bmap->extra-div-1);
633 for (i = 0; i < bmap->n_ineq; ++i) {
634 if (!isl_int_is_zero(bmap->ineq[i][pos])) {
635 isl_basic_map_drop_inequality(ctx, bmap, i);
639 constraint_drop_vars(bmap->ineq[i]+pos, 1, bmap->extra-div-1);
642 for (i = 0; i < bmap->n_div; ++i)
643 constraint_drop_vars(bmap->div[i]+1+pos, 1, bmap->extra-div-1);
645 if (div != bmap->n_div - 1) {
647 isl_int *t = bmap->div[div];
649 for (j = div; j < bmap->n_div - 1; ++j)
650 bmap->div[j] = bmap->div[j+1];
652 bmap->div[bmap->n_div - 1] = t;
654 isl_basic_map_free_div(ctx, bmap, 1);
658 isl_basic_map_free(ctx, bmap);
662 static void eliminate_div(struct isl_ctx *ctx, struct isl_basic_map *bmap,
663 isl_int *eq, unsigned div)
666 unsigned pos = 1 + bmap->nparam + bmap->n_in + bmap->n_out + div;
668 len = 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
670 for (i = 0; i < bmap->n_eq; ++i)
671 if (bmap->eq[i] != eq)
672 isl_seq_elim(bmap->eq[i], eq, pos, len, NULL);
674 for (i = 0; i < bmap->n_ineq; ++i)
675 isl_seq_elim(bmap->ineq[i], eq, pos, len, NULL);
677 /* We need to be careful about circular definitions,
678 * so for now we just remove the definitions of other divs that
679 * depend on this div and (possibly) recompute them later.
681 for (i = 0; i < bmap->n_div; ++i)
682 if (!isl_int_is_zero(bmap->div[i][0]) &&
683 !isl_int_is_zero(bmap->div[i][1 + pos]))
684 isl_seq_clr(bmap->div[i], 1 + len);
686 isl_basic_map_drop_div(ctx, bmap, div);
689 struct isl_basic_map *isl_basic_map_set_to_empty(
690 struct isl_ctx *ctx, struct isl_basic_map *bmap)
696 total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->extra;
697 isl_basic_map_free_div(ctx, bmap, bmap->n_div);
698 isl_basic_map_free_inequality(ctx, bmap, bmap->n_ineq);
700 isl_basic_map_free_equality(ctx, bmap, bmap->n_eq-1);
702 isl_basic_map_alloc_equality(ctx, bmap);
706 isl_int_set_si(bmap->eq[i][0], 1);
707 isl_seq_clr(bmap->eq[i]+1, total);
708 F_SET(bmap, ISL_BASIC_MAP_EMPTY);
709 return isl_basic_map_finalize(ctx, bmap);
711 isl_basic_map_free(ctx, bmap);
715 struct isl_basic_set *isl_basic_set_set_to_empty(
716 struct isl_ctx *ctx, struct isl_basic_set *bset)
718 return (struct isl_basic_set *)
719 isl_basic_map_set_to_empty(ctx, (struct isl_basic_map *)bset);
722 static void swap_equality(struct isl_basic_map *bmap, int a, int b)
724 isl_int *t = bmap->eq[a];
725 bmap->eq[a] = bmap->eq[b];
729 static void swap_inequality(struct isl_basic_map *bmap, int a, int b)
731 isl_int *t = bmap->ineq[a];
732 bmap->ineq[a] = bmap->ineq[b];
736 static void swap_div(struct isl_basic_map *bmap, int a, int b)
739 unsigned off = bmap->nparam + bmap->n_in + bmap->n_out;
740 isl_int *t = bmap->div[a];
741 bmap->div[a] = bmap->div[b];
744 for (i = 0; i < bmap->n_eq; ++i)
745 isl_int_swap(bmap->eq[i][1+off+a], bmap->eq[i][1+off+b]);
747 for (i = 0; i < bmap->n_ineq; ++i)
748 isl_int_swap(bmap->ineq[i][1+off+a], bmap->ineq[i][1+off+b]);
750 for (i = 0; i < bmap->n_div; ++i)
751 isl_int_swap(bmap->div[i][1+1+off+a], bmap->div[i][1+1+off+b]);
754 struct isl_basic_map *isl_basic_map_gauss(struct isl_ctx *ctx,
755 struct isl_basic_map *bmap, int *progress)
766 total_var = bmap->nparam + bmap->n_in + bmap->n_out;
767 total = total_var + bmap->n_div;
769 last_var = total - 1;
770 for (done = 0; done < bmap->n_eq; ++done) {
771 for (; last_var >= 0; --last_var) {
772 for (k = done; k < bmap->n_eq; ++k)
773 if (!isl_int_is_zero(bmap->eq[k][1+last_var]))
781 swap_equality(bmap, k, done);
782 if (isl_int_is_neg(bmap->eq[done][1+last_var]))
783 isl_seq_neg(bmap->eq[done], bmap->eq[done], 1+total);
785 for (k = 0; k < bmap->n_eq; ++k) {
788 if (isl_int_is_zero(bmap->eq[k][1+last_var]))
792 isl_seq_elim(bmap->eq[k], bmap->eq[done],
793 1+last_var, 1+total, NULL);
796 for (k = 0; k < bmap->n_ineq; ++k) {
797 if (isl_int_is_zero(bmap->ineq[k][1+last_var]))
801 isl_seq_elim(bmap->ineq[k], bmap->eq[done],
802 1+last_var, 1+total, NULL);
805 for (k = 0; k < bmap->n_div; ++k) {
806 if (isl_int_is_zero(bmap->div[k][0]))
808 if (isl_int_is_zero(bmap->div[k][1+1+last_var]))
812 isl_seq_elim(bmap->div[k]+1, bmap->eq[done],
813 1+last_var, 1+total, &bmap->div[k][0]);
816 if (last_var >= total_var &&
817 isl_int_is_zero(bmap->div[last_var - total_var][0])) {
818 unsigned div = last_var - total_var;
819 isl_seq_neg(bmap->div[div]+1, bmap->eq[done], 1+total);
820 isl_int_set_si(bmap->div[div][1+1+last_var], 0);
821 isl_int_set(bmap->div[div][0],
822 bmap->eq[done][1+last_var]);
825 if (done == bmap->n_eq)
827 for (k = done; k < bmap->n_eq; ++k) {
828 if (isl_int_is_zero(bmap->eq[k][0]))
830 return isl_basic_map_set_to_empty(ctx, bmap);
832 isl_basic_map_free_equality(ctx, bmap, bmap->n_eq-done);
836 struct isl_basic_set *isl_basic_set_gauss(struct isl_ctx *ctx,
837 struct isl_basic_set *bset, int *progress)
839 return (struct isl_basic_set*)isl_basic_map_gauss(ctx,
840 (struct isl_basic_map *)bset, progress);
843 static unsigned int round_up(unsigned int v)
854 static int hash_index(int *index, unsigned int size, int bits,
855 struct isl_basic_map *bmap, int k)
858 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
859 u_int32_t hash = isl_seq_hash(bmap->ineq[k]+1, total, bits);
860 for (h = hash; index[h]; h = (h+1) % size)
861 if (k != index[h]-1 &&
862 isl_seq_eq(bmap->ineq[k]+1,
863 bmap->ineq[index[h]-1]+1, total))
868 static struct isl_basic_map *remove_duplicate_constraints(
870 struct isl_basic_map *bmap, int *progress)
876 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
879 if (bmap->n_ineq <= 1)
882 size = round_up(4 * (bmap->n_ineq+1) / 3 - 1);
883 bits = ffs(size) - 1;
884 index = isl_alloc_array(ctx, int, size);
885 memset(index, 0, size * sizeof(int));
889 index[isl_seq_hash(bmap->ineq[0]+1, total, bits)] = 1;
890 for (k = 1; k < bmap->n_ineq; ++k) {
891 h = hash_index(index, size, bits, bmap, k);
898 if (isl_int_lt(bmap->ineq[k][0], bmap->ineq[l][0]))
899 swap_inequality(bmap, k, l);
900 isl_basic_map_drop_inequality(ctx, bmap, k);
904 for (k = 0; k < bmap->n_ineq-1; ++k) {
905 isl_seq_neg(bmap->ineq[k]+1, bmap->ineq[k]+1, total);
906 h = hash_index(index, size, bits, bmap, k);
907 isl_seq_neg(bmap->ineq[k]+1, bmap->ineq[k]+1, total);
911 isl_int_add(sum, bmap->ineq[k][0], bmap->ineq[l][0]);
912 if (isl_int_is_pos(sum))
914 if (isl_int_is_zero(sum)) {
915 /* We need to break out of the loop after these
916 * changes since the contents of the hash
917 * will no longer be valid.
918 * Plus, we probably we want to regauss first.
920 isl_basic_map_drop_inequality(ctx, bmap, l);
921 isl_basic_map_inequality_to_equality(ctx, bmap, k);
923 bmap = isl_basic_map_set_to_empty(ctx, bmap);
932 static struct isl_basic_map *remove_duplicate_divs(struct isl_ctx *ctx,
933 struct isl_basic_map *bmap, int *progress)
940 unsigned total_var = bmap->nparam + bmap->n_in + bmap->n_out;
941 unsigned total = total_var + bmap->n_div;
943 if (bmap->n_div <= 1)
946 for (k = bmap->n_div - 1; k >= 0; --k)
947 if (!isl_int_is_zero(bmap->div[k][0]))
952 size = round_up(4 * bmap->n_div / 3 - 1);
953 bits = ffs(size) - 1;
954 index = isl_alloc_array(ctx, int, size);
955 memset(index, 0, size * sizeof(int));
958 eq = isl_blk_alloc(ctx, 1+total);
959 if (isl_blk_is_error(eq))
962 isl_seq_clr(eq.data, 1+total);
963 index[isl_seq_hash(bmap->div[k], 2+total, bits)] = k + 1;
964 for (--k; k >= 0; --k) {
967 if (isl_int_is_zero(bmap->div[k][0]))
970 hash = isl_seq_hash(bmap->div[k], 2+total, bits);
971 for (h = hash; index[h]; h = (h+1) % size)
972 if (isl_seq_eq(bmap->div[k],
973 bmap->div[index[h]-1], 2+total))
978 isl_int_set_si(eq.data[1+total_var+k], -1);
979 isl_int_set_si(eq.data[1+total_var+l], 1);
980 eliminate_div(ctx, bmap, eq.data, l);
981 isl_int_set_si(eq.data[1+total_var+k], 0);
982 isl_int_set_si(eq.data[1+total_var+l], 0);
987 isl_blk_free(ctx, eq);
993 static struct isl_basic_map *eliminate_divs(
994 struct isl_ctx *ctx, struct isl_basic_map *bmap,
1005 off = 1 + bmap->nparam + bmap->n_in + bmap->n_out;
1007 for (d = bmap->n_div - 1; d >= 0 ; --d) {
1008 for (i = 0; i < bmap->n_eq; ++i) {
1009 if (!isl_int_is_one(bmap->eq[i][off + d]) &&
1010 !isl_int_is_negone(bmap->eq[i][off + d]))
1014 eliminate_div(ctx, bmap, bmap->eq[i], d);
1015 isl_basic_map_drop_equality(ctx, bmap, i);
1019 return eliminate_divs(ctx, bmap, progress);
1023 static struct isl_basic_map *normalize_constraints(
1024 struct isl_ctx *ctx, struct isl_basic_map *bmap)
1028 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
1031 for (i = bmap->n_eq - 1; i >= 0; --i) {
1032 isl_seq_gcd(bmap->eq[i]+1, total, &gcd);
1033 if (isl_int_is_zero(gcd)) {
1034 if (!isl_int_is_zero(bmap->eq[i][0])) {
1035 bmap = isl_basic_map_set_to_empty(ctx, bmap);
1038 isl_basic_map_drop_equality(ctx, bmap, i);
1041 if (isl_int_is_one(gcd))
1043 if (!isl_int_is_divisible_by(bmap->eq[i][0], gcd)) {
1044 bmap = isl_basic_map_set_to_empty(ctx, bmap);
1047 isl_seq_scale_down(bmap->eq[i], bmap->eq[i], gcd, 1+total);
1050 for (i = bmap->n_ineq - 1; i >= 0; --i) {
1051 isl_seq_gcd(bmap->ineq[i]+1, total, &gcd);
1052 if (isl_int_is_zero(gcd)) {
1053 if (isl_int_is_neg(bmap->ineq[i][0])) {
1054 bmap = isl_basic_map_set_to_empty(ctx, bmap);
1057 isl_basic_map_drop_inequality(ctx, bmap, i);
1060 if (isl_int_is_one(gcd))
1062 isl_int_fdiv_q(bmap->ineq[i][0], bmap->ineq[i][0], gcd);
1063 isl_seq_scale_down(bmap->ineq[i]+1, bmap->ineq[i]+1, gcd, total);
1070 struct isl_basic_map *isl_basic_map_simplify(
1071 struct isl_ctx *ctx, struct isl_basic_map *bmap)
1078 bmap = normalize_constraints(ctx, bmap);
1079 bmap = eliminate_divs(ctx, bmap, &progress);
1080 bmap = isl_basic_map_gauss(ctx, bmap, &progress);
1081 bmap = remove_duplicate_divs(ctx, bmap, &progress);
1082 bmap = remove_duplicate_constraints(ctx, bmap, &progress);
1087 struct isl_basic_set *isl_basic_set_simplify(
1088 struct isl_ctx *ctx, struct isl_basic_set *bset)
1090 return (struct isl_basic_set *)
1091 isl_basic_map_simplify(ctx,
1092 (struct isl_basic_map *)bset);
1095 static void dump_term(struct isl_basic_map *bmap,
1096 isl_int c, int pos, FILE *out)
1098 unsigned in = bmap->n_in;
1099 unsigned dim = bmap->n_in + bmap->n_out;
1101 isl_int_print(out, c);
1103 if (!isl_int_is_one(c))
1104 isl_int_print(out, c);
1105 if (pos < 1 + bmap->nparam)
1106 fprintf(out, "p%d", pos - 1);
1107 else if (pos < 1 + bmap->nparam + in)
1108 fprintf(out, "i%d", pos - 1 - bmap->nparam);
1109 else if (pos < 1 + bmap->nparam + dim)
1110 fprintf(out, "o%d", pos - 1 - bmap->nparam - in);
1112 fprintf(out, "e%d", pos - 1 - bmap->nparam - dim);
1116 static void dump_constraint_sign(struct isl_basic_map *bmap, isl_int *c,
1117 int sign, FILE *out)
1121 unsigned len = 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
1125 for (i = 0, first = 1; i < len; ++i) {
1126 if (isl_int_sgn(c[i]) * sign <= 0)
1129 fprintf(out, " + ");
1131 isl_int_abs(v, c[i]);
1132 dump_term(bmap, v, i, out);
1139 static void dump_constraint(struct isl_basic_map *bmap, isl_int *c,
1140 const char *op, FILE *out, int indent)
1144 fprintf(out, "%*s", indent, "");
1146 dump_constraint_sign(bmap, c, 1, out);
1147 fprintf(out, " %s ", op);
1148 dump_constraint_sign(bmap, c, -1, out);
1152 for (i = bmap->n_div; i < bmap->extra; ++i) {
1153 if (isl_int_is_zero(c[1+bmap->nparam+bmap->n_in+bmap->n_out+i]))
1155 fprintf(out, "%*s", indent, "");
1156 fprintf(out, "ERROR: unused div coefficient not zero\n");
1160 static void dump_constraints(struct isl_basic_map *bmap,
1161 isl_int **c, unsigned n,
1162 const char *op, FILE *out, int indent)
1166 for (i = 0; i < n; ++i)
1167 dump_constraint(bmap, c[i], op, out, indent);
1170 static void dump_affine(struct isl_basic_map *bmap, isl_int *exp, FILE *out)
1174 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
1176 for (j = 0; j < 1 + total; ++j) {
1177 if (isl_int_is_zero(exp[j]))
1179 if (!first && isl_int_is_pos(exp[j]))
1181 dump_term(bmap, exp[j], j, out);
1186 static void dump(struct isl_basic_map *bmap, FILE *out, int indent)
1190 dump_constraints(bmap, bmap->eq, bmap->n_eq, "=", out, indent);
1191 dump_constraints(bmap, bmap->ineq, bmap->n_ineq, ">=", out, indent);
1193 for (i = 0; i < bmap->n_div; ++i) {
1194 fprintf(out, "%*s", indent, "");
1195 fprintf(out, "e%d = [(", i);
1196 dump_affine(bmap, bmap->div[i]+1, out);
1198 isl_int_print(out, bmap->div[i][0]);
1199 fprintf(out, "]\n");
1203 void isl_basic_set_dump(struct isl_ctx *ctx, struct isl_basic_set *bset,
1204 FILE *out, int indent)
1207 fprintf(out, "null basic set\n");
1211 fprintf(out, "%*s", indent, "");
1212 fprintf(out, "nparam: %d, dim: %d, extra: %d\n",
1213 bset->nparam, bset->dim, bset->extra);
1214 dump((struct isl_basic_map *)bset, out, indent);
1217 void isl_basic_map_dump(struct isl_ctx *ctx, struct isl_basic_map *bmap,
1218 FILE *out, int indent)
1221 fprintf(out, "null basic map\n");
1225 fprintf(out, "%*s", indent, "");
1226 fprintf(out, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d\n",
1228 bmap->nparam, bmap->n_in, bmap->n_out, bmap->extra);
1229 dump(bmap, out, indent);
1232 int isl_inequality_negate(struct isl_ctx *ctx,
1233 struct isl_basic_map *bmap, unsigned pos)
1235 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
1236 isl_assert(ctx, pos < bmap->n_ineq, return -1);
1237 isl_seq_neg(bmap->ineq[pos], bmap->ineq[pos], 1 + total);
1238 isl_int_sub_ui(bmap->ineq[pos][0], bmap->ineq[pos][0], 1);
1242 struct isl_set *isl_set_alloc(struct isl_ctx *ctx,
1243 unsigned nparam, unsigned dim, int n, unsigned flags)
1245 struct isl_set *set;
1247 set = isl_alloc(ctx, struct isl_set,
1248 sizeof(struct isl_set) +
1249 n * sizeof(struct isl_basic_set *));
1256 set->nparam = nparam;
1263 struct isl_set *isl_set_dup(struct isl_ctx *ctx, struct isl_set *set)
1266 struct isl_set *dup;
1268 dup = isl_set_alloc(ctx, set->nparam, set->dim, set->n, set->flags);
1271 for (i = 0; i < set->n; ++i)
1272 dup = isl_set_add(ctx, dup,
1273 isl_basic_set_dup(ctx, set->p[i]));
1277 struct isl_set *isl_set_from_basic_set(struct isl_ctx *ctx,
1278 struct isl_basic_set *bset)
1280 struct isl_set *set;
1282 set = isl_set_alloc(ctx, bset->nparam, bset->dim, 1, ISL_MAP_DISJOINT);
1284 isl_basic_set_free(ctx, bset);
1287 return isl_set_add(ctx, set, bset);
1290 struct isl_map *isl_map_from_basic_map(struct isl_ctx *ctx,
1291 struct isl_basic_map *bmap)
1293 struct isl_map *map;
1295 map = isl_map_alloc(ctx, bmap->nparam, bmap->n_in, bmap->n_out, 1,
1298 isl_basic_map_free(ctx, bmap);
1301 return isl_map_add(ctx, map, bmap);
1304 struct isl_set *isl_set_add(struct isl_ctx *ctx, struct isl_set *set,
1305 struct isl_basic_set *bset)
1309 isl_assert(ctx, set->nparam == bset->nparam, goto error);
1310 isl_assert(ctx, set->dim == bset->dim, goto error);
1311 isl_assert(ctx, set->n < set->size, goto error);
1312 set->p[set->n] = bset;
1317 isl_set_free(ctx, set);
1319 isl_basic_set_free(ctx, bset);
1323 void isl_set_free(struct isl_ctx *ctx, struct isl_set *set)
1333 for (i = 0; i < set->n; ++i)
1334 isl_basic_set_free(ctx, set->p[i]);
1338 void isl_set_dump(struct isl_ctx *ctx, struct isl_set *set, FILE *out,
1344 fprintf(out, "null set\n");
1348 fprintf(out, "%*s", indent, "");
1349 fprintf(out, "ref: %d, n: %d\n", set->ref, set->n);
1350 for (i = 0; i < set->n; ++i) {
1351 fprintf(out, "%*s", indent, "");
1352 fprintf(out, "basic set %d:\n", i);
1353 isl_basic_set_dump(ctx, set->p[i], out, indent+4);
1357 void isl_map_dump(struct isl_ctx *ctx, struct isl_map *map, FILE *out,
1363 fprintf(out, "null map\n");
1367 fprintf(out, "%*s", indent, "");
1368 fprintf(out, "ref: %d, n: %d, nparam: %d, in: %d, out: %d\n",
1369 map->ref, map->n, map->nparam, map->n_in, map->n_out);
1370 for (i = 0; i < map->n; ++i) {
1371 fprintf(out, "%*s", indent, "");
1372 fprintf(out, "basic map %d:\n", i);
1373 isl_basic_map_dump(ctx, map->p[i], out, indent+4);
1377 struct isl_basic_map *isl_basic_map_intersect_domain(
1378 struct isl_ctx *ctx, struct isl_basic_map *bmap,
1379 struct isl_basic_set *bset)
1381 struct isl_basic_map *bmap_domain;
1386 isl_assert(ctx, bset->dim == bmap->n_in, goto error);
1387 isl_assert(ctx, bset->nparam == bmap->nparam, goto error);
1389 bmap = isl_basic_map_extend(ctx, bmap,
1390 bset->nparam, bmap->n_in, bmap->n_out,
1391 bset->n_div, bset->n_eq, bset->n_ineq);
1394 bmap_domain = isl_basic_map_from_basic_set(ctx, bset,
1396 bmap = add_constraints(ctx, bmap, bmap_domain, 0, 0);
1398 bmap = isl_basic_map_simplify(ctx, bmap);
1399 return isl_basic_map_finalize(ctx, bmap);
1401 isl_basic_map_free(ctx, bmap);
1402 isl_basic_set_free(ctx, bset);
1406 struct isl_basic_map *isl_basic_map_intersect_range(
1407 struct isl_ctx *ctx, struct isl_basic_map *bmap,
1408 struct isl_basic_set *bset)
1410 struct isl_basic_map *bmap_range;
1415 isl_assert(ctx, bset->dim == bmap->n_out, goto error);
1416 isl_assert(ctx, bset->nparam == bmap->nparam, goto error);
1418 bmap = isl_basic_map_extend(ctx, bmap,
1419 bset->nparam, bmap->n_in, bmap->n_out,
1420 bset->n_div, bset->n_eq, bset->n_ineq);
1423 bmap_range = isl_basic_map_from_basic_set(ctx, bset,
1425 bmap = add_constraints(ctx, bmap, bmap_range, 0, 0);
1427 bmap = isl_basic_map_simplify(ctx, bmap);
1428 return isl_basic_map_finalize(ctx, bmap);
1430 isl_basic_map_free(ctx, bmap);
1431 isl_basic_set_free(ctx, bset);
1435 struct isl_basic_map *isl_basic_map_intersect(
1436 struct isl_ctx *ctx, struct isl_basic_map *bmap1,
1437 struct isl_basic_map *bmap2)
1439 if (!bmap1 || !bmap2)
1442 isl_assert(ctx, bmap1->nparam == bmap2->nparam, goto error);
1443 isl_assert(ctx, bmap1->n_in == bmap2->n_in, goto error);
1444 isl_assert(ctx, bmap1->n_out == bmap2->n_out, goto error);
1446 bmap1 = isl_basic_map_extend(ctx, bmap1,
1447 bmap1->nparam, bmap1->n_in, bmap1->n_out,
1448 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
1451 bmap1 = add_constraints(ctx, bmap1, bmap2, 0, 0);
1453 bmap1 = isl_basic_map_simplify(ctx, bmap1);
1454 return isl_basic_map_finalize(ctx, bmap1);
1456 isl_basic_map_free(ctx, bmap1);
1457 isl_basic_map_free(ctx, bmap2);
1461 struct isl_basic_set *isl_basic_set_intersect(
1462 struct isl_ctx *ctx, struct isl_basic_set *bset1,
1463 struct isl_basic_set *bset2)
1465 return (struct isl_basic_set *)
1466 isl_basic_map_intersect(ctx,
1467 (struct isl_basic_map *)bset1,
1468 (struct isl_basic_map *)bset2);
1471 struct isl_map *isl_map_intersect(struct isl_ctx *ctx, struct isl_map *map1,
1472 struct isl_map *map2)
1475 struct isl_map *result;
1481 if (F_ISSET(map1, ISL_MAP_DISJOINT) &&
1482 F_ISSET(map2, ISL_MAP_DISJOINT))
1483 FL_SET(flags, ISL_MAP_DISJOINT);
1485 result = isl_map_alloc(ctx, map1->nparam, map1->n_in, map1->n_out,
1486 map1->n * map2->n, flags);
1489 for (i = 0; i < map1->n; ++i)
1490 for (j = 0; j < map2->n; ++j) {
1491 struct isl_basic_map *part;
1492 part = isl_basic_map_intersect(ctx,
1493 isl_basic_map_copy(ctx, map1->p[i]),
1494 isl_basic_map_copy(ctx, map2->p[j]));
1495 if (isl_basic_map_is_empty(ctx, part))
1496 isl_basic_map_free(ctx, part);
1498 result = isl_map_add(ctx, result, part);
1502 isl_map_free(ctx, map1);
1503 isl_map_free(ctx, map2);
1506 isl_map_free(ctx, map1);
1507 isl_map_free(ctx, map2);
1511 struct isl_basic_map *isl_basic_map_reverse(struct isl_ctx *ctx,
1512 struct isl_basic_map *bmap)
1514 struct isl_basic_set *bset;
1519 bmap = isl_basic_map_cow(ctx, bmap);
1523 bset = isl_basic_set_from_basic_map(ctx, bmap);
1524 bset = isl_basic_set_swap_vars(ctx, bset, in);
1525 return isl_basic_map_from_basic_set(ctx, bset, bset->dim-in, in);
1528 /* Turn final n dimensions into existentially quantified variables.
1530 struct isl_basic_set *isl_basic_set_project_out(
1531 struct isl_ctx *ctx, struct isl_basic_set *bset,
1532 unsigned n, unsigned flags)
1542 isl_assert(ctx, n <= bset->dim, goto error);
1547 bset = isl_basic_set_cow(ctx, bset);
1549 row_size = 1 + bset->nparam + bset->dim + bset->extra;
1550 old = bset->block2.data;
1551 bset->block2 = isl_blk_extend(ctx, bset->block2,
1552 (bset->extra + n) * (1 + row_size));
1553 if (!bset->block2.data)
1555 new_div = isl_alloc_array(ctx, isl_int *, bset->extra + n);
1558 for (i = 0; i < n; ++i) {
1559 new_div[i] = bset->block2.data +
1560 (bset->extra + i) * (1 + row_size);
1561 isl_seq_clr(new_div[i], 1 + row_size);
1563 for (i = 0; i < bset->extra; ++i)
1564 new_div[n + i] = bset->block2.data + (bset->div[i] - old);
1566 bset->div = new_div;
1570 bset = isl_basic_set_simplify(ctx, bset);
1571 return isl_basic_set_finalize(ctx, bset);
1573 isl_basic_set_free(ctx, bset);
1577 struct isl_basic_map *isl_basic_map_apply_range(
1578 struct isl_ctx *ctx, struct isl_basic_map *bmap1,
1579 struct isl_basic_map *bmap2)
1581 struct isl_basic_set *bset;
1582 unsigned n_in, n_out;
1584 if (!bmap1 || !bmap2)
1587 isl_assert(ctx, bmap1->n_out == bmap2->n_in, goto error);
1588 isl_assert(ctx, bmap1->nparam == bmap2->nparam, goto error);
1591 n_out = bmap2->n_out;
1593 bmap2 = isl_basic_map_reverse(ctx, bmap2);
1596 bmap1 = isl_basic_map_extend(ctx, bmap1, bmap1->nparam,
1597 bmap1->n_in + bmap2->n_in, bmap1->n_out,
1598 bmap2->extra, bmap2->n_eq, bmap2->n_ineq);
1601 bmap1 = add_constraints(ctx, bmap1, bmap2, bmap1->n_in - bmap2->n_in, 0);
1602 bmap1 = isl_basic_map_simplify(ctx, bmap1);
1603 bset = isl_basic_set_from_basic_map(ctx, bmap1);
1604 bset = isl_basic_set_project_out(ctx, bset,
1605 bset->dim - (n_in + n_out), 0);
1606 return isl_basic_map_from_basic_set(ctx, bset, n_in, n_out);
1608 isl_basic_map_free(ctx, bmap1);
1609 isl_basic_map_free(ctx, bmap2);
1613 struct isl_basic_map *isl_basic_map_apply_domain(
1614 struct isl_ctx *ctx, struct isl_basic_map *bmap1,
1615 struct isl_basic_map *bmap2)
1617 if (!bmap1 || !bmap2)
1620 isl_assert(ctx, bmap1->n_in == bmap2->n_in, goto error);
1621 isl_assert(ctx, bmap1->nparam == bmap2->nparam, goto error);
1623 bmap1 = isl_basic_map_reverse(ctx, bmap1);
1624 bmap1 = isl_basic_map_apply_range(ctx, bmap1, bmap2);
1625 return isl_basic_map_reverse(ctx, bmap1);
1627 isl_basic_map_free(ctx, bmap1);
1628 isl_basic_map_free(ctx, bmap2);
1632 static struct isl_basic_map *var_equal(struct isl_ctx *ctx,
1633 struct isl_basic_map *bmap, unsigned pos)
1636 i = isl_basic_map_alloc_equality(ctx, bmap);
1639 isl_seq_clr(bmap->eq[i],
1640 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->extra);
1641 isl_int_set_si(bmap->eq[i][1+bmap->nparam+pos], -1);
1642 isl_int_set_si(bmap->eq[i][1+bmap->nparam+bmap->n_in+pos], 1);
1643 return isl_basic_map_finalize(ctx, bmap);
1645 isl_basic_map_free(ctx, bmap);
1649 static struct isl_basic_map *var_more(struct isl_ctx *ctx,
1650 struct isl_basic_map *bmap, unsigned pos)
1653 i = isl_basic_map_alloc_inequality(ctx, bmap);
1656 isl_seq_clr(bmap->ineq[i],
1657 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->extra);
1658 isl_int_set_si(bmap->ineq[i][0], -1);
1659 isl_int_set_si(bmap->ineq[i][1+bmap->nparam+pos], -1);
1660 isl_int_set_si(bmap->ineq[i][1+bmap->nparam+bmap->n_in+pos], 1);
1661 return isl_basic_map_finalize(ctx, bmap);
1663 isl_basic_map_free(ctx, bmap);
1667 static struct isl_basic_map *var_less(struct isl_ctx *ctx,
1668 struct isl_basic_map *bmap, unsigned pos)
1671 i = isl_basic_map_alloc_inequality(ctx, bmap);
1674 isl_seq_clr(bmap->ineq[i],
1675 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->extra);
1676 isl_int_set_si(bmap->ineq[i][0], -1);
1677 isl_int_set_si(bmap->ineq[i][1+bmap->nparam+pos], 1);
1678 isl_int_set_si(bmap->ineq[i][1+bmap->nparam+bmap->n_in+pos], -1);
1679 return isl_basic_map_finalize(ctx, bmap);
1681 isl_basic_map_free(ctx, bmap);
1685 struct isl_basic_map *isl_basic_map_equal(struct isl_ctx *ctx,
1686 unsigned nparam, unsigned in, unsigned out, unsigned n_equal)
1689 struct isl_basic_map *bmap;
1690 bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, n_equal, 0);
1693 for (i = 0; i < n_equal && bmap; ++i)
1694 bmap = var_equal(ctx, bmap, i);
1695 return isl_basic_map_finalize(ctx, bmap);
1698 struct isl_basic_map *isl_basic_map_less_at(struct isl_ctx *ctx,
1699 unsigned nparam, unsigned in, unsigned out, unsigned pos)
1702 struct isl_basic_map *bmap;
1703 bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, pos, 1);
1706 for (i = 0; i < pos && bmap; ++i)
1707 bmap = var_equal(ctx, bmap, i);
1709 bmap = var_less(ctx, bmap, pos);
1710 return isl_basic_map_finalize(ctx, bmap);
1713 struct isl_basic_map *isl_basic_map_more_at(struct isl_ctx *ctx,
1714 unsigned nparam, unsigned in, unsigned out, unsigned pos)
1717 struct isl_basic_map *bmap;
1718 bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, pos, 1);
1721 for (i = 0; i < pos && bmap; ++i)
1722 bmap = var_equal(ctx, bmap, i);
1724 bmap = var_more(ctx, bmap, pos);
1725 return isl_basic_map_finalize(ctx, bmap);
1728 struct isl_basic_map *isl_basic_map_from_basic_set(
1729 struct isl_ctx *ctx, struct isl_basic_set *bset,
1730 unsigned n_in, unsigned n_out)
1732 struct isl_basic_map *bmap;
1734 bset = isl_basic_set_cow(ctx, bset);
1738 isl_assert(ctx, bset->dim == n_in + n_out, goto error);
1739 bmap = (struct isl_basic_map *) bset;
1741 bmap->n_out = n_out;
1742 return isl_basic_map_finalize(ctx, bmap);
1744 isl_basic_set_free(ctx, bset);
1748 struct isl_basic_set *isl_basic_set_from_basic_map(
1749 struct isl_ctx *ctx, struct isl_basic_map *bmap)
1753 if (bmap->n_in == 0)
1754 return (struct isl_basic_set *)bmap;
1755 bmap = isl_basic_map_cow(ctx, bmap);
1758 bmap->n_out += bmap->n_in;
1760 bmap = isl_basic_map_finalize(ctx, bmap);
1761 return (struct isl_basic_set *)bmap;
1766 static struct isl_basic_set *isl_basic_map_underlying_set(
1767 struct isl_ctx *ctx, struct isl_basic_map *bmap)
1771 if (bmap->nparam == 0 && bmap->n_in == 0 && bmap->n_div == 0)
1772 return (struct isl_basic_set *)bmap;
1773 bmap = isl_basic_map_cow(ctx, bmap);
1776 bmap->n_out += bmap->nparam + bmap->n_in + bmap->n_div;
1780 bmap = isl_basic_map_finalize(ctx, bmap);
1781 return (struct isl_basic_set *)bmap;
1786 struct isl_basic_set *isl_basic_map_domain(struct isl_ctx *ctx,
1787 struct isl_basic_map *bmap)
1789 struct isl_basic_set *domain;
1793 n_out = bmap->n_out;
1794 domain = isl_basic_set_from_basic_map(ctx, bmap);
1795 return isl_basic_set_project_out(ctx, domain, n_out, 0);
1798 struct isl_basic_set *isl_basic_map_range(struct isl_ctx *ctx,
1799 struct isl_basic_map *bmap)
1801 return isl_basic_map_domain(ctx,
1802 isl_basic_map_reverse(ctx, bmap));
1805 struct isl_set *isl_map_range(struct isl_ctx *ctx, struct isl_map *map)
1808 struct isl_set *set;
1812 map = isl_map_cow(ctx, map);
1816 set = (struct isl_set *) map;
1818 for (i = 0; i < map->n; ++i) {
1819 set->p[i] = isl_basic_map_range(ctx, map->p[i]);
1823 F_CLR(set, ISL_MAP_DISJOINT);
1826 isl_map_free(ctx, map);
1830 struct isl_map *isl_map_from_set(
1831 struct isl_ctx *ctx, struct isl_set *set,
1832 unsigned n_in, unsigned n_out)
1835 struct isl_map *map = NULL;
1839 isl_assert(ctx, set->dim == n_in + n_out, goto error);
1840 set = isl_set_cow(ctx, set);
1843 map = (struct isl_map *)set;
1844 for (i = 0; i < set->n; ++i) {
1845 map->p[i] = isl_basic_map_from_basic_set(ctx,
1846 set->p[i], n_in, n_out);
1854 isl_set_free(ctx, set);
1858 struct isl_map *isl_map_alloc(struct isl_ctx *ctx,
1859 unsigned nparam, unsigned in, unsigned out, int n,
1862 struct isl_map *map;
1864 map = isl_alloc(ctx, struct isl_map,
1865 sizeof(struct isl_map) +
1866 n * sizeof(struct isl_basic_map *));
1873 map->nparam = nparam;
1880 struct isl_basic_map *isl_basic_map_empty(struct isl_ctx *ctx,
1881 unsigned nparam, unsigned in, unsigned out)
1883 struct isl_basic_map *bmap;
1884 bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, 1, 0);
1885 bmap = isl_basic_map_set_to_empty(ctx, bmap);
1889 struct isl_map *isl_map_empty(struct isl_ctx *ctx,
1890 unsigned nparam, unsigned in, unsigned out)
1892 return isl_map_alloc(ctx, nparam, in, out, 0, ISL_MAP_DISJOINT);
1895 struct isl_set *isl_set_empty(struct isl_ctx *ctx,
1896 unsigned nparam, unsigned dim)
1898 return isl_set_alloc(ctx, nparam, dim, 0, ISL_MAP_DISJOINT);
1901 struct isl_map *isl_map_dup(struct isl_ctx *ctx, struct isl_map *map)
1904 struct isl_map *dup;
1906 dup = isl_map_alloc(ctx, map->nparam, map->n_in, map->n_out, map->n,
1908 for (i = 0; i < map->n; ++i)
1909 dup = isl_map_add(ctx, dup,
1910 isl_basic_map_dup(ctx, map->p[i]));
1914 struct isl_map *isl_map_add(struct isl_ctx *ctx, struct isl_map *map,
1915 struct isl_basic_map *bmap)
1919 isl_assert(ctx, map->nparam == bmap->nparam, goto error);
1920 isl_assert(ctx, map->n_in == bmap->n_in, goto error);
1921 isl_assert(ctx, map->n_out == bmap->n_out, goto error);
1922 isl_assert(ctx, map->n < map->size, goto error);
1923 map->p[map->n] = bmap;
1928 isl_map_free(ctx, map);
1930 isl_basic_map_free(ctx, bmap);
1934 void isl_map_free(struct isl_ctx *ctx, struct isl_map *map)
1944 for (i = 0; i < map->n; ++i)
1945 isl_basic_map_free(ctx, map->p[i]);
1949 struct isl_map *isl_map_extend(struct isl_ctx *ctx, struct isl_map *base,
1950 unsigned nparam, unsigned n_in, unsigned n_out)
1954 base = isl_map_cow(ctx, base);
1958 isl_assert(ctx, base->nparam <= nparam, goto error);
1959 isl_assert(ctx, base->n_in <= n_in, goto error);
1960 isl_assert(ctx, base->n_out <= n_out, goto error);
1961 base->nparam = nparam;
1963 base->n_out = n_out;
1964 for (i = 0; i < base->n; ++i) {
1965 base->p[i] = isl_basic_map_extend(ctx, base->p[i],
1966 nparam, n_in, n_out, 0, 0, 0);
1972 isl_map_free(ctx, base);
1976 struct isl_basic_map *isl_basic_map_fix_input_si(struct isl_ctx *ctx,
1977 struct isl_basic_map *bmap,
1978 unsigned input, int value)
1982 bmap = isl_basic_map_cow(ctx, bmap);
1985 isl_assert(ctx, input < bmap->n_in, goto error);
1987 bmap = isl_basic_map_extend(ctx, bmap,
1988 bmap->nparam, bmap->n_in, bmap->n_out, 0, 1, 0);
1989 j = isl_basic_map_alloc_equality(ctx, bmap);
1992 isl_seq_clr(bmap->eq[j],
1993 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->extra);
1994 isl_int_set_si(bmap->eq[j][1+bmap->nparam+input], -1);
1995 isl_int_set_si(bmap->eq[j][0], value);
1996 bmap = isl_basic_map_simplify(ctx, bmap);
1997 return isl_basic_map_finalize(ctx, bmap);
1999 isl_basic_map_free(ctx, bmap);
2003 struct isl_map *isl_map_fix_input_si(struct isl_ctx *ctx, struct isl_map *map,
2004 unsigned input, int value)
2008 map = isl_map_cow(ctx, map);
2012 isl_assert(ctx, input < map->n_in, goto error);
2013 for (i = 0; i < map->n; ++i) {
2014 map->p[i] = isl_basic_map_fix_input_si(ctx, map->p[i],
2021 isl_map_free(ctx, map);
2025 struct isl_map *isl_map_reverse(struct isl_ctx *ctx, struct isl_map *map)
2030 map = isl_map_cow(ctx, map);
2035 map->n_in = map->n_out;
2037 for (i = 0; i < map->n; ++i) {
2038 map->p[i] = isl_basic_map_reverse(ctx, map->p[i]);
2044 isl_map_free(ctx, map);
2048 struct isl_map *isl_basic_map_lexmax(struct isl_ctx *ctx,
2049 struct isl_basic_map *bmap, struct isl_basic_set *dom,
2050 struct isl_set **empty)
2052 return isl_pip_basic_map_lexmax(ctx, bmap, dom, empty);
2055 struct isl_map *isl_basic_map_lexmin(struct isl_ctx *ctx,
2056 struct isl_basic_map *bmap, struct isl_basic_set *dom,
2057 struct isl_set **empty)
2059 return isl_pip_basic_map_lexmin(ctx, bmap, dom, empty);
2062 struct isl_set *isl_basic_set_lexmin(struct isl_ctx *ctx,
2063 struct isl_basic_set *bset)
2065 struct isl_basic_map *bmap = NULL;
2066 struct isl_basic_set *dom = NULL;
2067 struct isl_map *min;
2071 bmap = isl_basic_map_from_basic_set(ctx, bset, 0, bset->dim);
2074 dom = isl_basic_set_alloc(ctx, bmap->nparam, 0, 0, 0, 0);
2077 min = isl_basic_map_lexmin(ctx, bmap, dom, NULL);
2078 return isl_map_range(ctx, min);
2080 isl_basic_map_free(ctx, bmap);
2084 struct isl_map *isl_basic_map_compute_divs(struct isl_ctx *ctx,
2085 struct isl_basic_map *bmap)
2089 if (bmap->n_div == 0)
2090 return isl_map_from_basic_map(ctx, bmap);
2091 return isl_pip_basic_map_compute_divs(ctx, bmap);
2094 struct isl_map *isl_map_compute_divs(struct isl_ctx *ctx, struct isl_map *map)
2097 struct isl_map *res;
2103 res = isl_basic_map_compute_divs(ctx,
2104 isl_basic_map_copy(ctx, map->p[0]));
2105 for (i = 1 ; i < map->n; ++i) {
2107 r2 = isl_basic_map_compute_divs(ctx,
2108 isl_basic_map_copy(ctx, map->p[i]));
2109 if (F_ISSET(map, ISL_MAP_DISJOINT))
2110 res = isl_map_union_disjoint(ctx, res, r2);
2112 res = isl_map_union(ctx, res, r2);
2114 isl_map_free(ctx, map);
2119 struct isl_set *isl_basic_set_compute_divs(struct isl_ctx *ctx,
2120 struct isl_basic_set *bset)
2122 return (struct isl_set *)
2123 isl_basic_map_compute_divs(ctx,
2124 (struct isl_basic_map *)bset);
2127 struct isl_set *isl_map_domain(struct isl_ctx *ctx, struct isl_map *map)
2130 struct isl_set *set;
2135 map = isl_map_cow(ctx, map);
2139 set = (struct isl_set *)map;
2140 set->dim = map->n_in;
2142 for (i = 0; i < map->n; ++i) {
2143 set->p[i] = isl_basic_map_domain(ctx, map->p[i]);
2147 F_CLR(set, ISL_MAP_DISJOINT);
2150 isl_map_free(ctx, map);
2154 struct isl_map *isl_map_union_disjoint(struct isl_ctx *ctx,
2155 struct isl_map *map1, struct isl_map *map2)
2159 struct isl_map *map = NULL;
2165 isl_map_free(ctx, map1);
2169 isl_map_free(ctx, map2);
2173 isl_assert(ctx, map1->nparam == map2->nparam, goto error);
2174 isl_assert(ctx, map1->n_in == map2->n_in, goto error);
2175 isl_assert(ctx, map1->n_out == map2->n_out, goto error);
2177 if (F_ISSET(map1, ISL_MAP_DISJOINT) &&
2178 F_ISSET(map2, ISL_MAP_DISJOINT))
2179 FL_SET(flags, ISL_MAP_DISJOINT);
2181 map = isl_map_alloc(ctx, map1->nparam, map1->n_in, map1->n_out,
2182 map1->n + map2->n, flags);
2185 for (i = 0; i < map1->n; ++i) {
2186 map = isl_map_add(ctx, map,
2187 isl_basic_map_copy(ctx, map1->p[i]));
2191 for (i = 0; i < map2->n; ++i) {
2192 map = isl_map_add(ctx, map,
2193 isl_basic_map_copy(ctx, map2->p[i]));
2197 isl_map_free(ctx, map1);
2198 isl_map_free(ctx, map2);
2201 isl_map_free(ctx, map);
2202 isl_map_free(ctx, map1);
2203 isl_map_free(ctx, map2);
2207 struct isl_map *isl_map_union(struct isl_ctx *ctx,
2208 struct isl_map *map1, struct isl_map *map2)
2210 map1 = isl_map_union_disjoint(ctx, map1, map2);
2214 F_CLR(map1, ISL_MAP_DISJOINT);
2218 struct isl_set *isl_set_union_disjoint(struct isl_ctx *ctx,
2219 struct isl_set *set1, struct isl_set *set2)
2221 return (struct isl_set *)
2222 isl_map_union_disjoint(ctx,
2223 (struct isl_map *)set1, (struct isl_map *)set2);
2226 struct isl_set *isl_set_union(struct isl_ctx *ctx,
2227 struct isl_set *set1, struct isl_set *set2)
2229 return (struct isl_set *)
2231 (struct isl_map *)set1, (struct isl_map *)set2);
2234 struct isl_map *isl_map_intersect_range(
2235 struct isl_ctx *ctx, struct isl_map *map,
2236 struct isl_set *set)
2239 struct isl_map *result;
2245 if (F_ISSET(map, ISL_MAP_DISJOINT) &&
2246 F_ISSET(set, ISL_MAP_DISJOINT))
2247 FL_SET(flags, ISL_MAP_DISJOINT);
2249 result = isl_map_alloc(ctx, map->nparam, map->n_in, map->n_out,
2250 map->n * set->n, flags);
2253 for (i = 0; i < map->n; ++i)
2254 for (j = 0; j < set->n; ++j) {
2255 result = isl_map_add(ctx, result,
2256 isl_basic_map_intersect_range(ctx,
2257 isl_basic_map_copy(ctx, map->p[i]),
2258 isl_basic_set_copy(ctx, set->p[j])));
2262 isl_map_free(ctx, map);
2263 isl_set_free(ctx, set);
2266 isl_map_free(ctx, map);
2267 isl_set_free(ctx, set);
2271 struct isl_map *isl_map_intersect_domain(
2272 struct isl_ctx *ctx, struct isl_map *map,
2273 struct isl_set *set)
2275 return isl_map_reverse(ctx,
2276 isl_map_intersect_range(ctx, isl_map_reverse(ctx, map), set));
2279 struct isl_map *isl_map_apply_domain(
2280 struct isl_ctx *ctx, struct isl_map *map1,
2281 struct isl_map *map2)
2285 map1 = isl_map_reverse(ctx, map1);
2286 map1 = isl_map_apply_range(ctx, map1, map2);
2287 return isl_map_reverse(ctx, map1);
2289 isl_map_free(ctx, map1);
2290 isl_map_free(ctx, map2);
2294 struct isl_map *isl_map_apply_range(
2295 struct isl_ctx *ctx, struct isl_map *map1,
2296 struct isl_map *map2)
2298 struct isl_map *result;
2304 isl_assert(ctx, map1->nparam == map2->nparam, goto error);
2305 isl_assert(ctx, map1->n_out == map2->n_in, goto error);
2307 result = isl_map_alloc(ctx, map1->nparam, map1->n_in, map2->n_out,
2308 map1->n * map2->n, 0);
2311 for (i = 0; i < map1->n; ++i)
2312 for (j = 0; j < map2->n; ++j) {
2313 result = isl_map_add(ctx, result,
2314 isl_basic_map_apply_range(ctx,
2315 isl_basic_map_copy(ctx, map1->p[i]),
2316 isl_basic_map_copy(ctx, map2->p[j])));
2320 isl_map_free(ctx, map1);
2321 isl_map_free(ctx, map2);
2324 isl_map_free(ctx, map1);
2325 isl_map_free(ctx, map2);
2330 * returns range - domain
2332 struct isl_basic_set *isl_basic_map_deltas(struct isl_ctx *ctx,
2333 struct isl_basic_map *bmap)
2335 struct isl_basic_set *bset;
2341 isl_assert(ctx, bmap->n_in == bmap->n_out, goto error);
2343 bset = isl_basic_set_from_basic_map(ctx, bmap);
2344 bset = isl_basic_set_extend(ctx, bset, bset->nparam, 3*dim, 0,
2346 bset = isl_basic_set_swap_vars(ctx, bset, 2*dim);
2347 for (i = 0; i < dim; ++i) {
2348 int j = isl_basic_map_alloc_equality(ctx,
2349 (struct isl_basic_map *)bset);
2352 isl_seq_clr(bset->eq[j],
2353 1 + bset->nparam + bset->dim + bset->extra);
2354 isl_int_set_si(bset->eq[j][1+bset->nparam+i], 1);
2355 isl_int_set_si(bset->eq[j][1+bset->nparam+dim+i], 1);
2356 isl_int_set_si(bset->eq[j][1+bset->nparam+2*dim+i], -1);
2358 return isl_basic_set_project_out(ctx, bset, 2*dim, 0);
2360 isl_basic_map_free(ctx, bmap);
2364 /* If the only constraints a div d=floor(f/m)
2365 * appears in are its two defining constraints
2368 * -(f - (m - 1)) + m d >= 0
2370 * then it can safely be removed.
2372 static int div_is_redundant(struct isl_ctx *ctx, struct isl_basic_map *bmap,
2376 unsigned pos = 1 + bmap->nparam + bmap->n_in + bmap->n_out + div;
2378 for (i = 0; i < bmap->n_eq; ++i)
2379 if (!isl_int_is_zero(bmap->eq[i][pos]))
2382 for (i = 0; i < bmap->n_ineq; ++i) {
2383 if (isl_int_is_zero(bmap->ineq[i][pos]))
2385 if (isl_int_eq(bmap->ineq[i][pos], bmap->div[div][0])) {
2387 isl_int_sub(bmap->div[div][1],
2388 bmap->div[div][1], bmap->div[div][0]);
2389 isl_int_add_ui(bmap->div[div][1], bmap->div[div][1], 1);
2390 neg = isl_seq_is_neg(bmap->ineq[i], bmap->div[div]+1, pos);
2391 isl_int_sub_ui(bmap->div[div][1], bmap->div[div][1], 1);
2392 isl_int_add(bmap->div[div][1],
2393 bmap->div[div][1], bmap->div[div][0]);
2396 if (isl_seq_first_non_zero(bmap->ineq[i]+pos+1,
2397 bmap->n_div-div-1) != -1)
2399 } else if (isl_int_abs_eq(bmap->ineq[i][pos], bmap->div[div][0])) {
2400 if (!isl_seq_eq(bmap->ineq[i], bmap->div[div]+1, pos))
2402 if (isl_seq_first_non_zero(bmap->ineq[i]+pos+1,
2403 bmap->n_div-div-1) != -1)
2409 for (i = 0; i < bmap->n_div; ++i)
2410 if (!isl_int_is_zero(bmap->div[i][1+pos]))
2417 * Remove divs that don't occur in any of the constraints or other divs.
2418 * These can arise when dropping some of the variables in a quast
2419 * returned by piplib.
2421 static struct isl_basic_map *remove_redundant_divs(struct isl_ctx *ctx,
2422 struct isl_basic_map *bmap)
2426 for (i = bmap->n_div-1; i >= 0; --i) {
2427 if (!div_is_redundant(ctx, bmap, i))
2429 bmap = isl_basic_map_drop_div(ctx, bmap, i);
2434 struct isl_basic_map *isl_basic_map_finalize(struct isl_ctx *ctx,
2435 struct isl_basic_map *bmap)
2437 bmap = remove_redundant_divs(ctx, bmap);
2440 F_SET(bmap, ISL_BASIC_SET_FINAL);
2444 struct isl_basic_set *isl_basic_set_finalize(struct isl_ctx *ctx,
2445 struct isl_basic_set *bset)
2447 return (struct isl_basic_set *)
2448 isl_basic_map_finalize(ctx,
2449 (struct isl_basic_map *)bset);
2452 struct isl_set *isl_set_finalize(struct isl_ctx *ctx, struct isl_set *set)
2458 for (i = 0; i < set->n; ++i) {
2459 set->p[i] = isl_basic_set_finalize(ctx, set->p[i]);
2465 isl_set_free(ctx, set);
2469 struct isl_map *isl_map_finalize(struct isl_ctx *ctx, struct isl_map *map)
2475 for (i = 0; i < map->n; ++i) {
2476 map->p[i] = isl_basic_map_finalize(ctx, map->p[i]);
2482 isl_map_free(ctx, map);
2486 struct isl_basic_map *isl_basic_map_identity(struct isl_ctx *ctx,
2487 unsigned nparam, unsigned dim)
2489 struct isl_basic_map *bmap;
2492 bmap = isl_basic_map_alloc(ctx, nparam, dim, dim, 0, dim, 0);
2496 for (i = 0; i < dim; ++i) {
2497 int j = isl_basic_map_alloc_equality(ctx, bmap);
2500 isl_seq_clr(bmap->eq[j],
2501 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->extra);
2502 isl_int_set_si(bmap->eq[j][1+nparam+i], 1);
2503 isl_int_set_si(bmap->eq[j][1+nparam+dim+i], -1);
2505 return isl_basic_map_finalize(ctx, bmap);
2507 isl_basic_map_free(ctx, bmap);
2511 struct isl_map *isl_map_identity(struct isl_ctx *ctx,
2512 unsigned nparam, unsigned dim)
2514 struct isl_map *map = isl_map_alloc(ctx, nparam, dim, dim, 1,
2518 map = isl_map_add(ctx, map,
2519 isl_basic_map_identity(ctx, nparam, dim));
2522 isl_map_free(ctx, map);
2526 int isl_set_is_equal(struct isl_ctx *ctx,
2527 struct isl_set *set1, struct isl_set *set2)
2529 return isl_map_is_equal(ctx,
2530 (struct isl_map *)set1, (struct isl_map *)set2);
2533 int isl_set_is_subset(struct isl_ctx *ctx,
2534 struct isl_set *set1, struct isl_set *set2)
2536 return isl_map_is_subset(ctx,
2537 (struct isl_map *)set1, (struct isl_map *)set2);
2540 int isl_basic_map_is_subset(struct isl_ctx *ctx,
2541 struct isl_basic_map *bmap1,
2542 struct isl_basic_map *bmap2)
2545 struct isl_map *map1;
2546 struct isl_map *map2;
2548 if (!bmap1 || !bmap2)
2551 map1 = isl_map_from_basic_map(ctx,
2552 isl_basic_map_copy(ctx, bmap1));
2553 map2 = isl_map_from_basic_map(ctx,
2554 isl_basic_map_copy(ctx, bmap2));
2556 is_subset = isl_map_is_subset(ctx, map1, map2);
2558 isl_map_free(ctx, map1);
2559 isl_map_free(ctx, map2);
2564 int isl_map_is_empty(struct isl_ctx *ctx, struct isl_map *map)
2571 for (i = 0; i < map->n; ++i) {
2572 is_empty = isl_basic_map_is_empty(ctx, map->p[i]);
2581 int isl_set_is_empty(struct isl_ctx *ctx, struct isl_set *set)
2583 return isl_map_is_empty(ctx, (struct isl_map *)set);
2586 int isl_map_is_subset(struct isl_ctx *ctx, struct isl_map *map1,
2587 struct isl_map *map2)
2591 struct isl_map *diff;
2596 if (isl_map_is_empty(ctx, map1))
2599 if (isl_map_is_empty(ctx, map2))
2602 diff = isl_map_subtract(ctx, isl_map_copy(ctx, map1),
2603 isl_map_copy(ctx, map2));
2607 is_subset = isl_map_is_empty(ctx, diff);
2608 isl_map_free(ctx, diff);
2613 int isl_map_is_equal(struct isl_ctx *ctx,
2614 struct isl_map *map1, struct isl_map *map2)
2620 is_subset = isl_map_is_subset(ctx, map1, map2);
2623 is_subset = isl_map_is_subset(ctx, map2, map1);
2627 int isl_basic_map_is_strict_subset(struct isl_ctx *ctx,
2628 struct isl_basic_map *bmap1,
2629 struct isl_basic_map *bmap2)
2633 if (!bmap1 || !bmap2)
2635 is_subset = isl_basic_map_is_subset(ctx, bmap1, bmap2);
2638 is_subset = isl_basic_map_is_subset(ctx, bmap2, bmap1);
2639 if (is_subset == -1)
2644 static int basic_map_contains(struct isl_ctx *ctx, struct isl_basic_map *bmap,
2645 struct isl_vec *vec)
2651 total = 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
2652 if (total != vec->size)
2657 for (i = 0; i < bmap->n_eq; ++i) {
2658 isl_seq_inner_product(vec->block.data, bmap->eq[i], total, &s);
2659 if (!isl_int_is_zero(s)) {
2665 for (i = 0; i < bmap->n_ineq; ++i) {
2666 isl_seq_inner_product(vec->block.data, bmap->ineq[i], total, &s);
2667 if (isl_int_is_neg(s)) {
2678 int isl_basic_map_is_empty(struct isl_ctx *ctx,
2679 struct isl_basic_map *bmap)
2681 struct isl_basic_set *bset = NULL;
2682 struct isl_vec *sample = NULL;
2689 if (F_ISSET(bmap, ISL_BASIC_MAP_EMPTY))
2692 total = 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
2693 if (bmap->sample && bmap->sample->size == total) {
2694 int contains = basic_map_contains(ctx, bmap, bmap->sample);
2700 bset = isl_basic_map_underlying_set(ctx,
2701 isl_basic_map_copy(ctx, bmap));
2704 sample = isl_basic_set_sample(ctx, bset);
2707 empty = sample->size == 0;
2709 isl_vec_free(ctx, bmap->sample);
2710 bmap->sample = sample;
2715 struct isl_map *isl_basic_map_union(
2716 struct isl_ctx *ctx, struct isl_basic_map *bmap1,
2717 struct isl_basic_map *bmap2)
2719 struct isl_map *map;
2720 if (!bmap1 || !bmap2)
2723 isl_assert(ctx, bmap1->nparam == bmap2->nparam, goto error);
2724 isl_assert(ctx, bmap1->n_in == bmap2->n_in, goto error);
2725 isl_assert(ctx, bmap1->n_out == bmap2->n_out, goto error);
2727 map = isl_map_alloc(ctx, bmap1->nparam,
2728 bmap1->n_in, bmap1->n_out, 2, 0);
2731 map = isl_map_add(ctx, map, bmap1);
2732 map = isl_map_add(ctx, map, bmap2);
2735 isl_basic_map_free(ctx, bmap1);
2736 isl_basic_map_free(ctx, bmap2);
2740 struct isl_set *isl_basic_set_union(
2741 struct isl_ctx *ctx, struct isl_basic_set *bset1,
2742 struct isl_basic_set *bset2)
2744 return (struct isl_set *)isl_basic_map_union(ctx,
2745 (struct isl_basic_map *)bset1,
2746 (struct isl_basic_map *)bset2);
2749 /* Order divs such that any div only depends on previous divs */
2750 static struct isl_basic_map *order_divs(struct isl_ctx *ctx,
2751 struct isl_basic_map *bmap)
2754 unsigned off = bmap->nparam + bmap->n_in + bmap->n_out;
2756 for (i = 0; i < bmap->n_div; ++i) {
2758 pos = isl_seq_first_non_zero(bmap->div[i]+1+1+off+i,
2762 swap_div(bmap, i, pos);
2768 static int find_div(struct isl_basic_map *dst,
2769 struct isl_basic_map *src, unsigned div)
2773 unsigned total = src->nparam + src->n_in + src->n_out + src->n_div;
2775 for (i = 0; i < dst->n_div; ++i)
2776 if (isl_seq_eq(dst->div[i], src->div[div], 1+1+total) &&
2777 isl_seq_first_non_zero(dst->div[i]+1+1+total,
2778 dst->n_div - src->n_div) == -1)
2783 /* For a div d = floor(f/m), add the constraints
2786 * -(f-(n-1)) + m d >= 0
2788 * Note that the second constraint is the negation of
2792 static int add_div_constraints(struct isl_ctx *ctx,
2793 struct isl_basic_map *bmap, unsigned div)
2796 unsigned div_pos = 1 + bmap->nparam + bmap->n_in + bmap->n_out + div;
2797 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->extra;
2799 i = isl_basic_map_alloc_inequality(ctx, bmap);
2802 isl_seq_cpy(bmap->ineq[i], bmap->div[div]+1, 1+total);
2803 isl_int_neg(bmap->ineq[i][div_pos], bmap->div[div][0]);
2805 j = isl_basic_map_alloc_inequality(ctx, bmap);
2808 isl_seq_neg(bmap->ineq[j], bmap->ineq[i], 1 + total);
2809 isl_int_add(bmap->ineq[j][0], bmap->ineq[j][0], bmap->ineq[j][div_pos]);
2810 isl_int_sub_ui(bmap->ineq[j][0], bmap->ineq[j][0], 1);
2814 struct isl_basic_map *isl_basic_map_align_divs(struct isl_ctx *ctx,
2815 struct isl_basic_map *dst, struct isl_basic_map *src)
2818 unsigned total = src->nparam + src->n_in + src->n_out + src->n_div;
2820 if (src->n_div == 0)
2823 src = order_divs(ctx, src);
2824 dst = isl_basic_map_extend(ctx, dst, dst->nparam, dst->n_in,
2825 dst->n_out, src->n_div, 0, 2 * src->n_div);
2828 for (i = 0; i < src->n_div; ++i) {
2829 int j = find_div(dst, src, i);
2831 j = isl_basic_map_alloc_div(ctx, dst);
2834 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total);
2835 isl_seq_clr(dst->div[j]+1+1+total,
2836 dst->extra - src->n_div);
2837 if (add_div_constraints(ctx, dst, j) < 0)
2841 swap_div(dst, i, j);
2845 isl_basic_map_free(ctx, dst);
2849 static struct isl_map *add_cut_constraint(struct isl_ctx *ctx,
2850 struct isl_map *dst,
2851 struct isl_basic_map *src, isl_int *c,
2852 unsigned len, int oppose)
2854 struct isl_basic_map *copy = NULL;
2859 copy = isl_basic_map_copy(ctx, src);
2860 copy = isl_basic_map_cow(ctx, copy);
2863 copy = isl_basic_map_extend(ctx, copy,
2864 copy->nparam, copy->n_in, copy->n_out, 0, 0, 1);
2865 k = isl_basic_map_alloc_inequality(ctx, copy);
2869 isl_seq_neg(copy->ineq[k], c, len);
2871 isl_seq_cpy(copy->ineq[k], c, len);
2872 total = 1 + copy->nparam + copy->n_in + copy->n_out + copy->extra;
2873 isl_seq_clr(copy->ineq[k]+len, total - len);
2874 isl_inequality_negate(ctx, copy, k);
2875 copy = isl_basic_map_simplify(ctx, copy);
2876 copy = isl_basic_map_finalize(ctx, copy);
2877 is_empty = isl_basic_map_is_empty(ctx, copy);
2881 dst = isl_map_add(ctx, dst, copy);
2883 isl_basic_map_free(ctx, copy);
2886 isl_basic_map_free(ctx, copy);
2887 isl_map_free(ctx, dst);
2891 static struct isl_map *subtract(struct isl_ctx *ctx, struct isl_map *map,
2892 struct isl_basic_map *bmap)
2896 struct isl_map *rest = NULL;
2898 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
2905 if (F_ISSET(map, ISL_MAP_DISJOINT))
2906 FL_SET(flags, ISL_MAP_DISJOINT);
2908 max = map->n * (2 * bmap->n_eq + bmap->n_ineq);
2909 rest = isl_map_alloc(ctx, map->nparam, map->n_in, map->n_out,
2914 for (i = 0; i < map->n; ++i) {
2915 map->p[i] = isl_basic_map_align_divs(ctx, map->p[i], bmap);
2920 for (j = 0; j < map->n; ++j)
2921 map->p[j] = isl_basic_map_cow(ctx, map->p[j]);
2923 for (i = 0; i < bmap->n_eq; ++i) {
2924 for (j = 0; j < map->n; ++j) {
2925 rest = add_cut_constraint(ctx, rest,
2926 map->p[j], bmap->eq[i], 1+total, 0);
2930 rest = add_cut_constraint(ctx, rest,
2931 map->p[j], bmap->eq[i], 1+total, 1);
2935 map->p[j] = isl_basic_map_extend(ctx, map->p[j],
2936 map->p[j]->nparam, map->p[j]->n_in,
2937 map->p[j]->n_out, 0, 1, 0);
2940 k = isl_basic_map_alloc_equality(ctx, map->p[j]);
2943 isl_seq_cpy(map->p[j]->eq[k], bmap->eq[i], 1+total);
2944 isl_seq_clr(map->p[j]->eq[k]+1+total,
2945 map->p[j]->extra - bmap->n_div);
2949 for (i = 0; i < bmap->n_ineq; ++i) {
2950 for (j = 0; j < map->n; ++j) {
2951 rest = add_cut_constraint(ctx, rest,
2952 map->p[j], bmap->ineq[i], 1+total, 0);
2956 map->p[j] = isl_basic_map_extend(ctx, map->p[j],
2957 map->p[j]->nparam, map->p[j]->n_in,
2958 map->p[j]->n_out, 0, 0, 1);
2961 k = isl_basic_map_alloc_inequality(ctx, map->p[j]);
2964 isl_seq_cpy(map->p[j]->ineq[k], bmap->ineq[i], 1+total);
2965 isl_seq_clr(map->p[j]->ineq[k]+1+total,
2966 map->p[j]->extra - bmap->n_div);
2970 isl_map_free(ctx, map);
2973 isl_map_free(ctx, map);
2974 isl_map_free(ctx, rest);
2978 struct isl_map *isl_map_subtract(struct isl_ctx *ctx, struct isl_map *map1,
2979 struct isl_map *map2)
2985 isl_assert(ctx, map1->nparam == map2->nparam, goto error);
2986 isl_assert(ctx, map1->n_in == map2->n_in, goto error);
2987 isl_assert(ctx, map1->n_out == map2->n_out, goto error);
2989 if (isl_map_is_empty(ctx, map2)) {
2990 isl_map_free(ctx, map2);
2994 map1 = isl_map_compute_divs(ctx, map1);
2995 map2 = isl_map_compute_divs(ctx, map2);
2999 for (i = 0; map1 && i < map2->n; ++i)
3000 map1 = subtract(ctx, map1, map2->p[i]);
3002 isl_map_free(ctx, map2);
3005 isl_map_free(ctx, map1);
3006 isl_map_free(ctx, map2);
3010 struct isl_set *isl_set_subtract(struct isl_ctx *ctx, struct isl_set *set1,
3011 struct isl_set *set2)
3013 return (struct isl_set *)
3014 isl_map_subtract(ctx,
3015 (struct isl_map *)set1, (struct isl_map *)set2);
3018 struct isl_set *isl_set_apply(struct isl_ctx *ctx, struct isl_set *set,
3019 struct isl_map *map)
3021 isl_assert(ctx, set->dim == map->n_in, goto error);
3022 map = isl_map_intersect_domain(ctx, map, set);
3023 set = isl_map_range(ctx, map);
3026 isl_set_free(ctx, set);
3027 isl_map_free(ctx, map);