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_set_alloc_equality(struct isl_ctx *ctx,
235 struct isl_basic_set *bset)
237 return isl_basic_map_alloc_equality(ctx, (struct isl_basic_map *)bset);
240 int isl_basic_map_free_equality(struct isl_ctx *ctx,
241 struct isl_basic_map *bmap, unsigned n)
243 isl_assert(ctx, n <= bmap->n_eq, return -1);
248 int isl_basic_map_drop_equality(struct isl_ctx *ctx,
249 struct isl_basic_map *bmap, unsigned pos)
252 isl_assert(ctx, pos < bmap->n_eq, return -1);
254 if (pos != bmap->n_eq - 1) {
256 bmap->eq[pos] = bmap->eq[bmap->n_eq - 1];
257 bmap->eq[bmap->n_eq - 1] = t;
263 void isl_basic_map_inequality_to_equality(struct isl_ctx *ctx,
264 struct isl_basic_map *bmap, unsigned pos)
269 bmap->ineq[pos] = bmap->ineq[0];
270 bmap->ineq[0] = bmap->eq[bmap->n_eq];
271 bmap->eq[bmap->n_eq] = t;
277 int isl_basic_map_alloc_inequality(struct isl_ctx *ctx,
278 struct isl_basic_map *bmap)
280 isl_assert(ctx, (bmap->ineq - bmap->eq) + bmap->n_ineq < bmap->c_size,
282 return bmap->n_ineq++;
285 int isl_basic_set_alloc_inequality(struct isl_ctx *ctx,
286 struct isl_basic_set *bset)
288 return isl_basic_map_alloc_inequality(ctx, (struct isl_basic_map *)bset);
291 int isl_basic_map_free_inequality(struct isl_ctx *ctx,
292 struct isl_basic_map *bmap, unsigned n)
294 isl_assert(ctx, n <= bmap->n_ineq, return -1);
299 int isl_basic_map_drop_inequality(struct isl_ctx *ctx,
300 struct isl_basic_map *bmap, unsigned pos)
303 isl_assert(ctx, pos < bmap->n_ineq, return -1);
305 if (pos != bmap->n_ineq - 1) {
307 bmap->ineq[pos] = bmap->ineq[bmap->n_ineq - 1];
308 bmap->ineq[bmap->n_ineq - 1] = t;
314 int isl_basic_map_alloc_div(struct isl_ctx *ctx,
315 struct isl_basic_map *bmap)
317 isl_assert(ctx, bmap->n_div < bmap->extra, return -1);
318 return bmap->n_div++;
321 int isl_basic_map_free_div(struct isl_ctx *ctx,
322 struct isl_basic_map *bmap, unsigned n)
324 isl_assert(ctx, n <= bmap->n_div, return -1);
329 /* Copy constraint from src to dst, putting the vars of src at offset
330 * dim_off in dst and the divs of src at offset div_off in dst.
331 * If both sets are actually map, then dim_off applies to the input
334 static void copy_constraint(struct isl_basic_map *dst_map, isl_int *dst,
335 struct isl_basic_map *src_map, isl_int *src,
336 unsigned in_off, unsigned out_off, unsigned div_off)
338 isl_int_set(dst[0], src[0]);
339 isl_seq_cpy(dst+1, src+1, isl_min(dst_map->nparam, src_map->nparam));
340 if (dst_map->nparam > src_map->nparam)
341 isl_seq_clr(dst+1+src_map->nparam,
342 dst_map->nparam - src_map->nparam);
343 isl_seq_clr(dst+1+dst_map->nparam, in_off);
344 isl_seq_cpy(dst+1+dst_map->nparam+in_off,
345 src+1+src_map->nparam,
346 isl_min(dst_map->n_in-in_off, src_map->n_in));
347 if (dst_map->n_in-in_off > src_map->n_in)
348 isl_seq_clr(dst+1+dst_map->nparam+in_off+src_map->n_in,
349 dst_map->n_in - in_off - src_map->n_in);
350 isl_seq_clr(dst+1+dst_map->nparam+dst_map->n_in, out_off);
351 isl_seq_cpy(dst+1+dst_map->nparam+dst_map->n_in+out_off,
352 src+1+src_map->nparam+src_map->n_in,
353 isl_min(dst_map->n_out-out_off, src_map->n_out));
354 if (dst_map->n_out-out_off > src_map->n_out)
355 isl_seq_clr(dst+1+dst_map->nparam+dst_map->n_in+out_off+src_map->n_out,
356 dst_map->n_out - out_off - src_map->n_out);
357 isl_seq_clr(dst+1+dst_map->nparam+dst_map->n_in+dst_map->n_out, div_off);
358 isl_seq_cpy(dst+1+dst_map->nparam+dst_map->n_in+dst_map->n_out+div_off,
359 src+1+src_map->nparam+src_map->n_in+src_map->n_out,
360 isl_min(dst_map->extra-div_off, src_map->extra));
361 if (dst_map->extra-div_off > src_map->extra)
362 isl_seq_clr(dst+1+dst_map->nparam+dst_map->n_in+dst_map->n_out+
363 div_off+src_map->extra,
364 dst_map->extra - div_off - src_map->extra);
367 static void copy_div(struct isl_basic_map *dst_map, isl_int *dst,
368 struct isl_basic_map *src_map, isl_int *src,
369 unsigned in_off, unsigned out_off, unsigned div_off)
371 isl_int_set(dst[0], src[0]);
372 copy_constraint(dst_map, dst+1, src_map, src+1, in_off, out_off, div_off);
375 static struct isl_basic_map *add_constraints(struct isl_ctx *ctx,
376 struct isl_basic_map *bmap1,
377 struct isl_basic_map *bmap2, unsigned i_pos, unsigned o_pos)
380 unsigned div_off = bmap1->n_div;
382 for (i = 0; i < bmap2->n_eq; ++i) {
383 int i1 = isl_basic_map_alloc_equality(ctx, bmap1);
386 copy_constraint(bmap1, bmap1->eq[i1], bmap2, bmap2->eq[i],
387 i_pos, o_pos, div_off);
390 for (i = 0; i < bmap2->n_ineq; ++i) {
391 int i1 = isl_basic_map_alloc_inequality(ctx, bmap1);
394 copy_constraint(bmap1, bmap1->ineq[i1], bmap2, bmap2->ineq[i],
395 i_pos, o_pos, div_off);
398 for (i = 0; i < bmap2->n_div; ++i) {
399 int i1 = isl_basic_map_alloc_div(ctx, bmap1);
402 copy_div(bmap1, bmap1->div[i1], bmap2, bmap2->div[i],
403 i_pos, o_pos, div_off);
406 isl_basic_map_free(ctx, bmap2);
411 isl_basic_map_free(ctx, bmap1);
412 isl_basic_map_free(ctx, bmap2);
416 struct isl_basic_map *isl_basic_map_extend(struct isl_ctx *ctx,
417 struct isl_basic_map *base,
418 unsigned nparam, unsigned n_in, unsigned n_out, unsigned extra,
419 unsigned n_eq, unsigned n_ineq)
421 struct isl_basic_map *ext;
424 base = isl_basic_map_cow(ctx, base);
428 dims_ok = base && base->nparam == nparam &&
429 base->n_in == n_in && base->n_out == n_out &&
430 base->extra >= base->n_div + extra;
432 if (dims_ok && n_eq == 0 && n_ineq == 0)
436 isl_assert(ctx, base->nparam <= nparam, goto error);
437 isl_assert(ctx, base->n_in <= n_in, goto error);
438 isl_assert(ctx, base->n_out <= n_out, goto error);
439 extra += base->extra;
441 n_ineq += base->n_ineq;
444 ext = isl_basic_map_alloc(ctx, nparam, n_in, n_out,
445 extra, n_eq, n_ineq);
451 ext = add_constraints(ctx, ext, base, 0, 0);
456 isl_basic_map_free(ctx, base);
460 struct isl_basic_set *isl_basic_set_extend(struct isl_ctx *ctx,
461 struct isl_basic_set *base,
462 unsigned nparam, unsigned dim, unsigned extra,
463 unsigned n_eq, unsigned n_ineq)
465 return (struct isl_basic_set *)
466 isl_basic_map_extend(ctx, (struct isl_basic_map *)base,
467 nparam, 0, dim, extra, n_eq, n_ineq);
470 struct isl_basic_set *isl_basic_set_cow(struct isl_ctx *ctx,
471 struct isl_basic_set *bset)
473 return (struct isl_basic_set *)
474 isl_basic_map_cow(ctx, (struct isl_basic_map *)bset);
477 struct isl_basic_map *isl_basic_map_cow(struct isl_ctx *ctx,
478 struct isl_basic_map *bmap)
485 bmap = isl_basic_map_dup(ctx, bmap);
487 F_CLR(bmap, ISL_BASIC_SET_FINAL);
491 static struct isl_set *isl_set_cow(struct isl_ctx *ctx, struct isl_set *set)
499 return isl_set_dup(ctx, set);
502 struct isl_map *isl_map_cow(struct isl_ctx *ctx, struct isl_map *map)
510 return isl_map_dup(ctx, map);
513 static void swap_vars(struct isl_blk blk, isl_int *a,
514 unsigned a_len, unsigned b_len)
516 isl_seq_cpy(blk.data, a+a_len, b_len);
517 isl_seq_cpy(blk.data+b_len, a, a_len);
518 isl_seq_cpy(a, blk.data, b_len+a_len);
521 struct isl_basic_set *isl_basic_set_swap_vars(struct isl_ctx *ctx,
522 struct isl_basic_set *bset, unsigned n)
530 isl_assert(ctx, n <= bset->dim, goto error);
535 bset = isl_basic_set_cow(ctx, bset);
539 blk = isl_blk_alloc(ctx, bset->dim);
540 if (isl_blk_is_error(blk))
543 for (i = 0; i < bset->n_eq; ++i)
545 bset->eq[i]+1+bset->nparam, n, bset->dim - n);
547 for (i = 0; i < bset->n_ineq; ++i)
549 bset->ineq[i]+1+bset->nparam, n, bset->dim - n);
551 for (i = 0; i < bset->n_div; ++i)
553 bset->div[i]+1+1+bset->nparam, n, bset->dim - n);
555 isl_blk_free(ctx, blk);
560 isl_basic_set_free(ctx, bset);
564 struct isl_set *isl_set_swap_vars(struct isl_ctx *ctx,
565 struct isl_set *set, unsigned n)
568 set = isl_set_cow(ctx, set);
572 for (i = 0; i < set->n; ++i) {
573 set->p[i] = isl_basic_set_swap_vars(ctx, set->p[i], n);
575 isl_set_free(ctx, set);
582 static void constraint_drop_vars(isl_int *c, unsigned n, unsigned rem)
584 isl_seq_cpy(c, c + n, rem);
585 isl_seq_clr(c + rem, n);
588 struct isl_basic_set *isl_basic_set_drop_vars(struct isl_ctx *ctx,
589 struct isl_basic_set *bset, unsigned first, unsigned n)
596 isl_assert(ctx, first + n <= bset->dim, goto error);
601 bset = isl_basic_set_cow(ctx, bset);
605 for (i = 0; i < bset->n_eq; ++i)
606 constraint_drop_vars(bset->eq[i]+1+bset->nparam+first, n,
607 (bset->dim-first-n)+bset->extra);
609 for (i = 0; i < bset->n_ineq; ++i)
610 constraint_drop_vars(bset->ineq[i]+1+bset->nparam+first, n,
611 (bset->dim-first-n)+bset->extra);
613 for (i = 0; i < bset->n_div; ++i)
614 constraint_drop_vars(bset->div[i]+1+1+bset->nparam+first, n,
615 (bset->dim-first-n)+bset->extra);
620 return isl_basic_set_finalize(ctx, bset);
622 isl_basic_set_free(ctx, bset);
627 * We don't cow, as the div is assumed to be redundant.
629 static struct isl_basic_map *isl_basic_map_drop_div(struct isl_ctx *ctx,
630 struct isl_basic_map *bmap, unsigned div)
638 pos = 1 + bmap->nparam + bmap->n_in + bmap->n_out + div;
640 isl_assert(ctx, div < bmap->n_div, goto error);
642 for (i = 0; i < bmap->n_eq; ++i)
643 constraint_drop_vars(bmap->eq[i]+pos, 1, bmap->extra-div-1);
645 for (i = 0; i < bmap->n_ineq; ++i) {
646 if (!isl_int_is_zero(bmap->ineq[i][pos])) {
647 isl_basic_map_drop_inequality(ctx, bmap, i);
651 constraint_drop_vars(bmap->ineq[i]+pos, 1, bmap->extra-div-1);
654 for (i = 0; i < bmap->n_div; ++i)
655 constraint_drop_vars(bmap->div[i]+1+pos, 1, bmap->extra-div-1);
657 if (div != bmap->n_div - 1) {
659 isl_int *t = bmap->div[div];
661 for (j = div; j < bmap->n_div - 1; ++j)
662 bmap->div[j] = bmap->div[j+1];
664 bmap->div[bmap->n_div - 1] = t;
666 isl_basic_map_free_div(ctx, bmap, 1);
670 isl_basic_map_free(ctx, bmap);
674 static void eliminate_div(struct isl_ctx *ctx, struct isl_basic_map *bmap,
675 isl_int *eq, unsigned div)
678 unsigned pos = 1 + bmap->nparam + bmap->n_in + bmap->n_out + div;
680 len = 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
682 for (i = 0; i < bmap->n_eq; ++i)
683 if (bmap->eq[i] != eq)
684 isl_seq_elim(bmap->eq[i], eq, pos, len, NULL);
686 for (i = 0; i < bmap->n_ineq; ++i)
687 isl_seq_elim(bmap->ineq[i], eq, pos, len, NULL);
689 /* We need to be careful about circular definitions,
690 * so for now we just remove the definitions of other divs that
691 * depend on this div and (possibly) recompute them later.
693 for (i = 0; i < bmap->n_div; ++i)
694 if (!isl_int_is_zero(bmap->div[i][0]) &&
695 !isl_int_is_zero(bmap->div[i][1 + pos]))
696 isl_seq_clr(bmap->div[i], 1 + len);
698 isl_basic_map_drop_div(ctx, bmap, div);
701 struct isl_basic_map *isl_basic_map_set_to_empty(
702 struct isl_ctx *ctx, struct isl_basic_map *bmap)
708 total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->extra;
709 isl_basic_map_free_div(ctx, bmap, bmap->n_div);
710 isl_basic_map_free_inequality(ctx, bmap, bmap->n_ineq);
712 isl_basic_map_free_equality(ctx, bmap, bmap->n_eq-1);
714 isl_basic_map_alloc_equality(ctx, bmap);
718 isl_int_set_si(bmap->eq[i][0], 1);
719 isl_seq_clr(bmap->eq[i]+1, total);
720 F_SET(bmap, ISL_BASIC_MAP_EMPTY);
721 return isl_basic_map_finalize(ctx, bmap);
723 isl_basic_map_free(ctx, bmap);
727 struct isl_basic_set *isl_basic_set_set_to_empty(
728 struct isl_ctx *ctx, struct isl_basic_set *bset)
730 return (struct isl_basic_set *)
731 isl_basic_map_set_to_empty(ctx, (struct isl_basic_map *)bset);
734 static void swap_equality(struct isl_basic_map *bmap, int a, int b)
736 isl_int *t = bmap->eq[a];
737 bmap->eq[a] = bmap->eq[b];
741 static void swap_inequality(struct isl_basic_map *bmap, int a, int b)
743 isl_int *t = bmap->ineq[a];
744 bmap->ineq[a] = bmap->ineq[b];
748 static void swap_div(struct isl_basic_map *bmap, int a, int b)
751 unsigned off = bmap->nparam + bmap->n_in + bmap->n_out;
752 isl_int *t = bmap->div[a];
753 bmap->div[a] = bmap->div[b];
756 for (i = 0; i < bmap->n_eq; ++i)
757 isl_int_swap(bmap->eq[i][1+off+a], bmap->eq[i][1+off+b]);
759 for (i = 0; i < bmap->n_ineq; ++i)
760 isl_int_swap(bmap->ineq[i][1+off+a], bmap->ineq[i][1+off+b]);
762 for (i = 0; i < bmap->n_div; ++i)
763 isl_int_swap(bmap->div[i][1+1+off+a], bmap->div[i][1+1+off+b]);
766 struct isl_basic_map *isl_basic_map_gauss(struct isl_ctx *ctx,
767 struct isl_basic_map *bmap, int *progress)
778 total_var = bmap->nparam + bmap->n_in + bmap->n_out;
779 total = total_var + bmap->n_div;
781 last_var = total - 1;
782 for (done = 0; done < bmap->n_eq; ++done) {
783 for (; last_var >= 0; --last_var) {
784 for (k = done; k < bmap->n_eq; ++k)
785 if (!isl_int_is_zero(bmap->eq[k][1+last_var]))
793 swap_equality(bmap, k, done);
794 if (isl_int_is_neg(bmap->eq[done][1+last_var]))
795 isl_seq_neg(bmap->eq[done], bmap->eq[done], 1+total);
797 for (k = 0; k < bmap->n_eq; ++k) {
800 if (isl_int_is_zero(bmap->eq[k][1+last_var]))
804 isl_seq_elim(bmap->eq[k], bmap->eq[done],
805 1+last_var, 1+total, NULL);
808 for (k = 0; k < bmap->n_ineq; ++k) {
809 if (isl_int_is_zero(bmap->ineq[k][1+last_var]))
813 isl_seq_elim(bmap->ineq[k], bmap->eq[done],
814 1+last_var, 1+total, NULL);
817 for (k = 0; k < bmap->n_div; ++k) {
818 if (isl_int_is_zero(bmap->div[k][0]))
820 if (isl_int_is_zero(bmap->div[k][1+1+last_var]))
824 isl_seq_elim(bmap->div[k]+1, bmap->eq[done],
825 1+last_var, 1+total, &bmap->div[k][0]);
828 if (last_var >= total_var &&
829 isl_int_is_zero(bmap->div[last_var - total_var][0])) {
830 unsigned div = last_var - total_var;
831 isl_seq_neg(bmap->div[div]+1, bmap->eq[done], 1+total);
832 isl_int_set_si(bmap->div[div][1+1+last_var], 0);
833 isl_int_set(bmap->div[div][0],
834 bmap->eq[done][1+last_var]);
837 if (done == bmap->n_eq)
839 for (k = done; k < bmap->n_eq; ++k) {
840 if (isl_int_is_zero(bmap->eq[k][0]))
842 return isl_basic_map_set_to_empty(ctx, bmap);
844 isl_basic_map_free_equality(ctx, bmap, bmap->n_eq-done);
848 struct isl_basic_set *isl_basic_set_gauss(struct isl_ctx *ctx,
849 struct isl_basic_set *bset, int *progress)
851 return (struct isl_basic_set*)isl_basic_map_gauss(ctx,
852 (struct isl_basic_map *)bset, progress);
855 static unsigned int round_up(unsigned int v)
866 static int hash_index(int *index, unsigned int size, int bits,
867 struct isl_basic_map *bmap, int k)
870 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
871 u_int32_t hash = isl_seq_hash(bmap->ineq[k]+1, total, bits);
872 for (h = hash; index[h]; h = (h+1) % size)
873 if (k != index[h]-1 &&
874 isl_seq_eq(bmap->ineq[k]+1,
875 bmap->ineq[index[h]-1]+1, total))
880 static struct isl_basic_map *remove_duplicate_constraints(
882 struct isl_basic_map *bmap, int *progress)
888 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
891 if (bmap->n_ineq <= 1)
894 size = round_up(4 * (bmap->n_ineq+1) / 3 - 1);
895 bits = ffs(size) - 1;
896 index = isl_alloc_array(ctx, int, size);
897 memset(index, 0, size * sizeof(int));
901 index[isl_seq_hash(bmap->ineq[0]+1, total, bits)] = 1;
902 for (k = 1; k < bmap->n_ineq; ++k) {
903 h = hash_index(index, size, bits, bmap, k);
910 if (isl_int_lt(bmap->ineq[k][0], bmap->ineq[l][0]))
911 swap_inequality(bmap, k, l);
912 isl_basic_map_drop_inequality(ctx, bmap, k);
916 for (k = 0; k < bmap->n_ineq-1; ++k) {
917 isl_seq_neg(bmap->ineq[k]+1, bmap->ineq[k]+1, total);
918 h = hash_index(index, size, bits, bmap, k);
919 isl_seq_neg(bmap->ineq[k]+1, bmap->ineq[k]+1, total);
923 isl_int_add(sum, bmap->ineq[k][0], bmap->ineq[l][0]);
924 if (isl_int_is_pos(sum))
926 if (isl_int_is_zero(sum)) {
927 /* We need to break out of the loop after these
928 * changes since the contents of the hash
929 * will no longer be valid.
930 * Plus, we probably we want to regauss first.
932 isl_basic_map_drop_inequality(ctx, bmap, l);
933 isl_basic_map_inequality_to_equality(ctx, bmap, k);
935 bmap = isl_basic_map_set_to_empty(ctx, bmap);
944 static struct isl_basic_map *remove_duplicate_divs(struct isl_ctx *ctx,
945 struct isl_basic_map *bmap, int *progress)
952 unsigned total_var = bmap->nparam + bmap->n_in + bmap->n_out;
953 unsigned total = total_var + bmap->n_div;
955 if (bmap->n_div <= 1)
958 for (k = bmap->n_div - 1; k >= 0; --k)
959 if (!isl_int_is_zero(bmap->div[k][0]))
964 size = round_up(4 * bmap->n_div / 3 - 1);
965 bits = ffs(size) - 1;
966 index = isl_alloc_array(ctx, int, size);
967 memset(index, 0, size * sizeof(int));
970 eq = isl_blk_alloc(ctx, 1+total);
971 if (isl_blk_is_error(eq))
974 isl_seq_clr(eq.data, 1+total);
975 index[isl_seq_hash(bmap->div[k], 2+total, bits)] = k + 1;
976 for (--k; k >= 0; --k) {
979 if (isl_int_is_zero(bmap->div[k][0]))
982 hash = isl_seq_hash(bmap->div[k], 2+total, bits);
983 for (h = hash; index[h]; h = (h+1) % size)
984 if (isl_seq_eq(bmap->div[k],
985 bmap->div[index[h]-1], 2+total))
990 isl_int_set_si(eq.data[1+total_var+k], -1);
991 isl_int_set_si(eq.data[1+total_var+l], 1);
992 eliminate_div(ctx, bmap, eq.data, l);
993 isl_int_set_si(eq.data[1+total_var+k], 0);
994 isl_int_set_si(eq.data[1+total_var+l], 0);
999 isl_blk_free(ctx, eq);
1005 static struct isl_basic_map *eliminate_divs(
1006 struct isl_ctx *ctx, struct isl_basic_map *bmap,
1017 off = 1 + bmap->nparam + bmap->n_in + bmap->n_out;
1019 for (d = bmap->n_div - 1; d >= 0 ; --d) {
1020 for (i = 0; i < bmap->n_eq; ++i) {
1021 if (!isl_int_is_one(bmap->eq[i][off + d]) &&
1022 !isl_int_is_negone(bmap->eq[i][off + d]))
1026 eliminate_div(ctx, bmap, bmap->eq[i], d);
1027 isl_basic_map_drop_equality(ctx, bmap, i);
1031 return eliminate_divs(ctx, bmap, progress);
1035 static struct isl_basic_map *normalize_constraints(
1036 struct isl_ctx *ctx, struct isl_basic_map *bmap)
1040 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
1043 for (i = bmap->n_eq - 1; i >= 0; --i) {
1044 isl_seq_gcd(bmap->eq[i]+1, total, &gcd);
1045 if (isl_int_is_zero(gcd)) {
1046 if (!isl_int_is_zero(bmap->eq[i][0])) {
1047 bmap = isl_basic_map_set_to_empty(ctx, bmap);
1050 isl_basic_map_drop_equality(ctx, bmap, i);
1053 if (isl_int_is_one(gcd))
1055 if (!isl_int_is_divisible_by(bmap->eq[i][0], gcd)) {
1056 bmap = isl_basic_map_set_to_empty(ctx, bmap);
1059 isl_seq_scale_down(bmap->eq[i], bmap->eq[i], gcd, 1+total);
1062 for (i = bmap->n_ineq - 1; i >= 0; --i) {
1063 isl_seq_gcd(bmap->ineq[i]+1, total, &gcd);
1064 if (isl_int_is_zero(gcd)) {
1065 if (isl_int_is_neg(bmap->ineq[i][0])) {
1066 bmap = isl_basic_map_set_to_empty(ctx, bmap);
1069 isl_basic_map_drop_inequality(ctx, bmap, i);
1072 if (isl_int_is_one(gcd))
1074 isl_int_fdiv_q(bmap->ineq[i][0], bmap->ineq[i][0], gcd);
1075 isl_seq_scale_down(bmap->ineq[i]+1, bmap->ineq[i]+1, gcd, total);
1082 struct isl_basic_map *isl_basic_map_simplify(
1083 struct isl_ctx *ctx, struct isl_basic_map *bmap)
1090 bmap = normalize_constraints(ctx, bmap);
1091 bmap = eliminate_divs(ctx, bmap, &progress);
1092 bmap = isl_basic_map_gauss(ctx, bmap, &progress);
1093 bmap = remove_duplicate_divs(ctx, bmap, &progress);
1094 bmap = remove_duplicate_constraints(ctx, bmap, &progress);
1099 struct isl_basic_set *isl_basic_set_simplify(
1100 struct isl_ctx *ctx, struct isl_basic_set *bset)
1102 return (struct isl_basic_set *)
1103 isl_basic_map_simplify(ctx,
1104 (struct isl_basic_map *)bset);
1107 static void dump_term(struct isl_basic_map *bmap,
1108 isl_int c, int pos, FILE *out)
1110 unsigned in = bmap->n_in;
1111 unsigned dim = bmap->n_in + bmap->n_out;
1113 isl_int_print(out, c);
1115 if (!isl_int_is_one(c))
1116 isl_int_print(out, c);
1117 if (pos < 1 + bmap->nparam)
1118 fprintf(out, "p%d", pos - 1);
1119 else if (pos < 1 + bmap->nparam + in)
1120 fprintf(out, "i%d", pos - 1 - bmap->nparam);
1121 else if (pos < 1 + bmap->nparam + dim)
1122 fprintf(out, "o%d", pos - 1 - bmap->nparam - in);
1124 fprintf(out, "e%d", pos - 1 - bmap->nparam - dim);
1128 static void dump_constraint_sign(struct isl_basic_map *bmap, isl_int *c,
1129 int sign, FILE *out)
1133 unsigned len = 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
1137 for (i = 0, first = 1; i < len; ++i) {
1138 if (isl_int_sgn(c[i]) * sign <= 0)
1141 fprintf(out, " + ");
1143 isl_int_abs(v, c[i]);
1144 dump_term(bmap, v, i, out);
1151 static void dump_constraint(struct isl_basic_map *bmap, isl_int *c,
1152 const char *op, FILE *out, int indent)
1156 fprintf(out, "%*s", indent, "");
1158 dump_constraint_sign(bmap, c, 1, out);
1159 fprintf(out, " %s ", op);
1160 dump_constraint_sign(bmap, c, -1, out);
1164 for (i = bmap->n_div; i < bmap->extra; ++i) {
1165 if (isl_int_is_zero(c[1+bmap->nparam+bmap->n_in+bmap->n_out+i]))
1167 fprintf(out, "%*s", indent, "");
1168 fprintf(out, "ERROR: unused div coefficient not zero\n");
1172 static void dump_constraints(struct isl_basic_map *bmap,
1173 isl_int **c, unsigned n,
1174 const char *op, FILE *out, int indent)
1178 for (i = 0; i < n; ++i)
1179 dump_constraint(bmap, c[i], op, out, indent);
1182 static void dump_affine(struct isl_basic_map *bmap, isl_int *exp, FILE *out)
1186 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
1188 for (j = 0; j < 1 + total; ++j) {
1189 if (isl_int_is_zero(exp[j]))
1191 if (!first && isl_int_is_pos(exp[j]))
1193 dump_term(bmap, exp[j], j, out);
1198 static void dump(struct isl_basic_map *bmap, FILE *out, int indent)
1202 dump_constraints(bmap, bmap->eq, bmap->n_eq, "=", out, indent);
1203 dump_constraints(bmap, bmap->ineq, bmap->n_ineq, ">=", out, indent);
1205 for (i = 0; i < bmap->n_div; ++i) {
1206 fprintf(out, "%*s", indent, "");
1207 fprintf(out, "e%d = [(", i);
1208 dump_affine(bmap, bmap->div[i]+1, out);
1210 isl_int_print(out, bmap->div[i][0]);
1211 fprintf(out, "]\n");
1215 void isl_basic_set_dump(struct isl_ctx *ctx, struct isl_basic_set *bset,
1216 FILE *out, int indent)
1219 fprintf(out, "null basic set\n");
1223 fprintf(out, "%*s", indent, "");
1224 fprintf(out, "nparam: %d, dim: %d, extra: %d\n",
1225 bset->nparam, bset->dim, bset->extra);
1226 dump((struct isl_basic_map *)bset, out, indent);
1229 void isl_basic_map_dump(struct isl_ctx *ctx, struct isl_basic_map *bmap,
1230 FILE *out, int indent)
1233 fprintf(out, "null basic map\n");
1237 fprintf(out, "%*s", indent, "");
1238 fprintf(out, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d\n",
1240 bmap->nparam, bmap->n_in, bmap->n_out, bmap->extra);
1241 dump(bmap, out, indent);
1244 int isl_inequality_negate(struct isl_ctx *ctx,
1245 struct isl_basic_map *bmap, unsigned pos)
1247 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
1248 isl_assert(ctx, pos < bmap->n_ineq, return -1);
1249 isl_seq_neg(bmap->ineq[pos], bmap->ineq[pos], 1 + total);
1250 isl_int_sub_ui(bmap->ineq[pos][0], bmap->ineq[pos][0], 1);
1254 struct isl_set *isl_set_alloc(struct isl_ctx *ctx,
1255 unsigned nparam, unsigned dim, int n, unsigned flags)
1257 struct isl_set *set;
1259 set = isl_alloc(ctx, struct isl_set,
1260 sizeof(struct isl_set) +
1261 n * sizeof(struct isl_basic_set *));
1268 set->nparam = nparam;
1275 struct isl_set *isl_set_dup(struct isl_ctx *ctx, struct isl_set *set)
1278 struct isl_set *dup;
1280 dup = isl_set_alloc(ctx, set->nparam, set->dim, set->n, set->flags);
1283 for (i = 0; i < set->n; ++i)
1284 dup = isl_set_add(ctx, dup,
1285 isl_basic_set_dup(ctx, set->p[i]));
1289 struct isl_set *isl_set_from_basic_set(struct isl_ctx *ctx,
1290 struct isl_basic_set *bset)
1292 struct isl_set *set;
1294 set = isl_set_alloc(ctx, bset->nparam, bset->dim, 1, ISL_MAP_DISJOINT);
1296 isl_basic_set_free(ctx, bset);
1299 return isl_set_add(ctx, set, bset);
1302 struct isl_map *isl_map_from_basic_map(struct isl_ctx *ctx,
1303 struct isl_basic_map *bmap)
1305 struct isl_map *map;
1307 map = isl_map_alloc(ctx, bmap->nparam, bmap->n_in, bmap->n_out, 1,
1310 isl_basic_map_free(ctx, bmap);
1313 return isl_map_add(ctx, map, bmap);
1316 struct isl_set *isl_set_add(struct isl_ctx *ctx, struct isl_set *set,
1317 struct isl_basic_set *bset)
1321 isl_assert(ctx, set->nparam == bset->nparam, goto error);
1322 isl_assert(ctx, set->dim == bset->dim, goto error);
1323 isl_assert(ctx, set->n < set->size, goto error);
1324 set->p[set->n] = bset;
1329 isl_set_free(ctx, set);
1331 isl_basic_set_free(ctx, bset);
1335 void isl_set_free(struct isl_ctx *ctx, struct isl_set *set)
1345 for (i = 0; i < set->n; ++i)
1346 isl_basic_set_free(ctx, set->p[i]);
1350 void isl_set_dump(struct isl_ctx *ctx, struct isl_set *set, FILE *out,
1356 fprintf(out, "null set\n");
1360 fprintf(out, "%*s", indent, "");
1361 fprintf(out, "ref: %d, n: %d\n", set->ref, set->n);
1362 for (i = 0; i < set->n; ++i) {
1363 fprintf(out, "%*s", indent, "");
1364 fprintf(out, "basic set %d:\n", i);
1365 isl_basic_set_dump(ctx, set->p[i], out, indent+4);
1369 void isl_map_dump(struct isl_ctx *ctx, struct isl_map *map, FILE *out,
1375 fprintf(out, "null map\n");
1379 fprintf(out, "%*s", indent, "");
1380 fprintf(out, "ref: %d, n: %d, nparam: %d, in: %d, out: %d\n",
1381 map->ref, map->n, map->nparam, map->n_in, map->n_out);
1382 for (i = 0; i < map->n; ++i) {
1383 fprintf(out, "%*s", indent, "");
1384 fprintf(out, "basic map %d:\n", i);
1385 isl_basic_map_dump(ctx, map->p[i], out, indent+4);
1389 struct isl_basic_map *isl_basic_map_intersect_domain(
1390 struct isl_ctx *ctx, struct isl_basic_map *bmap,
1391 struct isl_basic_set *bset)
1393 struct isl_basic_map *bmap_domain;
1398 isl_assert(ctx, bset->dim == bmap->n_in, goto error);
1399 isl_assert(ctx, bset->nparam == bmap->nparam, goto error);
1401 bmap = isl_basic_map_extend(ctx, bmap,
1402 bset->nparam, bmap->n_in, bmap->n_out,
1403 bset->n_div, bset->n_eq, bset->n_ineq);
1406 bmap_domain = isl_basic_map_from_basic_set(ctx, bset,
1408 bmap = add_constraints(ctx, bmap, bmap_domain, 0, 0);
1410 bmap = isl_basic_map_simplify(ctx, bmap);
1411 return isl_basic_map_finalize(ctx, bmap);
1413 isl_basic_map_free(ctx, bmap);
1414 isl_basic_set_free(ctx, bset);
1418 struct isl_basic_map *isl_basic_map_intersect_range(
1419 struct isl_ctx *ctx, struct isl_basic_map *bmap,
1420 struct isl_basic_set *bset)
1422 struct isl_basic_map *bmap_range;
1427 isl_assert(ctx, bset->dim == bmap->n_out, goto error);
1428 isl_assert(ctx, bset->nparam == bmap->nparam, goto error);
1430 bmap = isl_basic_map_extend(ctx, bmap,
1431 bset->nparam, bmap->n_in, bmap->n_out,
1432 bset->n_div, bset->n_eq, bset->n_ineq);
1435 bmap_range = isl_basic_map_from_basic_set(ctx, bset,
1437 bmap = add_constraints(ctx, bmap, bmap_range, 0, 0);
1439 bmap = isl_basic_map_simplify(ctx, bmap);
1440 return isl_basic_map_finalize(ctx, bmap);
1442 isl_basic_map_free(ctx, bmap);
1443 isl_basic_set_free(ctx, bset);
1447 struct isl_basic_map *isl_basic_map_intersect(
1448 struct isl_ctx *ctx, struct isl_basic_map *bmap1,
1449 struct isl_basic_map *bmap2)
1451 if (!bmap1 || !bmap2)
1454 isl_assert(ctx, bmap1->nparam == bmap2->nparam, goto error);
1455 isl_assert(ctx, bmap1->n_in == bmap2->n_in, goto error);
1456 isl_assert(ctx, bmap1->n_out == bmap2->n_out, goto error);
1458 bmap1 = isl_basic_map_extend(ctx, bmap1,
1459 bmap1->nparam, bmap1->n_in, bmap1->n_out,
1460 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
1463 bmap1 = add_constraints(ctx, bmap1, bmap2, 0, 0);
1465 bmap1 = isl_basic_map_simplify(ctx, bmap1);
1466 return isl_basic_map_finalize(ctx, bmap1);
1468 isl_basic_map_free(ctx, bmap1);
1469 isl_basic_map_free(ctx, bmap2);
1473 struct isl_basic_set *isl_basic_set_intersect(
1474 struct isl_ctx *ctx, struct isl_basic_set *bset1,
1475 struct isl_basic_set *bset2)
1477 return (struct isl_basic_set *)
1478 isl_basic_map_intersect(ctx,
1479 (struct isl_basic_map *)bset1,
1480 (struct isl_basic_map *)bset2);
1483 struct isl_map *isl_map_intersect(struct isl_ctx *ctx, struct isl_map *map1,
1484 struct isl_map *map2)
1487 struct isl_map *result;
1493 if (F_ISSET(map1, ISL_MAP_DISJOINT) &&
1494 F_ISSET(map2, ISL_MAP_DISJOINT))
1495 FL_SET(flags, ISL_MAP_DISJOINT);
1497 result = isl_map_alloc(ctx, map1->nparam, map1->n_in, map1->n_out,
1498 map1->n * map2->n, flags);
1501 for (i = 0; i < map1->n; ++i)
1502 for (j = 0; j < map2->n; ++j) {
1503 struct isl_basic_map *part;
1504 part = isl_basic_map_intersect(ctx,
1505 isl_basic_map_copy(ctx, map1->p[i]),
1506 isl_basic_map_copy(ctx, map2->p[j]));
1507 if (isl_basic_map_is_empty(ctx, part))
1508 isl_basic_map_free(ctx, part);
1510 result = isl_map_add(ctx, result, part);
1514 isl_map_free(ctx, map1);
1515 isl_map_free(ctx, map2);
1518 isl_map_free(ctx, map1);
1519 isl_map_free(ctx, map2);
1523 struct isl_basic_map *isl_basic_map_reverse(struct isl_ctx *ctx,
1524 struct isl_basic_map *bmap)
1526 struct isl_basic_set *bset;
1531 bmap = isl_basic_map_cow(ctx, bmap);
1535 bset = isl_basic_set_from_basic_map(ctx, bmap);
1536 bset = isl_basic_set_swap_vars(ctx, bset, in);
1537 return isl_basic_map_from_basic_set(ctx, bset, bset->dim-in, in);
1540 /* Turn final n dimensions into existentially quantified variables.
1542 struct isl_basic_set *isl_basic_set_project_out(
1543 struct isl_ctx *ctx, struct isl_basic_set *bset,
1544 unsigned n, unsigned flags)
1554 isl_assert(ctx, n <= bset->dim, goto error);
1559 bset = isl_basic_set_cow(ctx, bset);
1561 row_size = 1 + bset->nparam + bset->dim + bset->extra;
1562 old = bset->block2.data;
1563 bset->block2 = isl_blk_extend(ctx, bset->block2,
1564 (bset->extra + n) * (1 + row_size));
1565 if (!bset->block2.data)
1567 new_div = isl_alloc_array(ctx, isl_int *, bset->extra + n);
1570 for (i = 0; i < n; ++i) {
1571 new_div[i] = bset->block2.data +
1572 (bset->extra + i) * (1 + row_size);
1573 isl_seq_clr(new_div[i], 1 + row_size);
1575 for (i = 0; i < bset->extra; ++i)
1576 new_div[n + i] = bset->block2.data + (bset->div[i] - old);
1578 bset->div = new_div;
1582 bset = isl_basic_set_simplify(ctx, bset);
1583 return isl_basic_set_finalize(ctx, bset);
1585 isl_basic_set_free(ctx, bset);
1589 struct isl_basic_map *isl_basic_map_apply_range(
1590 struct isl_ctx *ctx, struct isl_basic_map *bmap1,
1591 struct isl_basic_map *bmap2)
1593 struct isl_basic_set *bset;
1594 unsigned n_in, n_out;
1596 if (!bmap1 || !bmap2)
1599 isl_assert(ctx, bmap1->n_out == bmap2->n_in, goto error);
1600 isl_assert(ctx, bmap1->nparam == bmap2->nparam, goto error);
1603 n_out = bmap2->n_out;
1605 bmap2 = isl_basic_map_reverse(ctx, bmap2);
1608 bmap1 = isl_basic_map_extend(ctx, bmap1, bmap1->nparam,
1609 bmap1->n_in + bmap2->n_in, bmap1->n_out,
1610 bmap2->extra, bmap2->n_eq, bmap2->n_ineq);
1613 bmap1 = add_constraints(ctx, bmap1, bmap2, bmap1->n_in - bmap2->n_in, 0);
1614 bmap1 = isl_basic_map_simplify(ctx, bmap1);
1615 bset = isl_basic_set_from_basic_map(ctx, bmap1);
1616 bset = isl_basic_set_project_out(ctx, bset,
1617 bset->dim - (n_in + n_out), 0);
1618 return isl_basic_map_from_basic_set(ctx, bset, n_in, n_out);
1620 isl_basic_map_free(ctx, bmap1);
1621 isl_basic_map_free(ctx, bmap2);
1625 struct isl_basic_map *isl_basic_map_apply_domain(
1626 struct isl_ctx *ctx, struct isl_basic_map *bmap1,
1627 struct isl_basic_map *bmap2)
1629 if (!bmap1 || !bmap2)
1632 isl_assert(ctx, bmap1->n_in == bmap2->n_in, goto error);
1633 isl_assert(ctx, bmap1->nparam == bmap2->nparam, goto error);
1635 bmap1 = isl_basic_map_reverse(ctx, bmap1);
1636 bmap1 = isl_basic_map_apply_range(ctx, bmap1, bmap2);
1637 return isl_basic_map_reverse(ctx, bmap1);
1639 isl_basic_map_free(ctx, bmap1);
1640 isl_basic_map_free(ctx, bmap2);
1644 static struct isl_basic_map *var_equal(struct isl_ctx *ctx,
1645 struct isl_basic_map *bmap, unsigned pos)
1648 i = isl_basic_map_alloc_equality(ctx, bmap);
1651 isl_seq_clr(bmap->eq[i],
1652 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->extra);
1653 isl_int_set_si(bmap->eq[i][1+bmap->nparam+pos], -1);
1654 isl_int_set_si(bmap->eq[i][1+bmap->nparam+bmap->n_in+pos], 1);
1655 return isl_basic_map_finalize(ctx, bmap);
1657 isl_basic_map_free(ctx, bmap);
1661 static struct isl_basic_map *var_more(struct isl_ctx *ctx,
1662 struct isl_basic_map *bmap, unsigned pos)
1665 i = isl_basic_map_alloc_inequality(ctx, bmap);
1668 isl_seq_clr(bmap->ineq[i],
1669 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->extra);
1670 isl_int_set_si(bmap->ineq[i][0], -1);
1671 isl_int_set_si(bmap->ineq[i][1+bmap->nparam+pos], -1);
1672 isl_int_set_si(bmap->ineq[i][1+bmap->nparam+bmap->n_in+pos], 1);
1673 return isl_basic_map_finalize(ctx, bmap);
1675 isl_basic_map_free(ctx, bmap);
1679 static struct isl_basic_map *var_less(struct isl_ctx *ctx,
1680 struct isl_basic_map *bmap, unsigned pos)
1683 i = isl_basic_map_alloc_inequality(ctx, bmap);
1686 isl_seq_clr(bmap->ineq[i],
1687 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->extra);
1688 isl_int_set_si(bmap->ineq[i][0], -1);
1689 isl_int_set_si(bmap->ineq[i][1+bmap->nparam+pos], 1);
1690 isl_int_set_si(bmap->ineq[i][1+bmap->nparam+bmap->n_in+pos], -1);
1691 return isl_basic_map_finalize(ctx, bmap);
1693 isl_basic_map_free(ctx, bmap);
1697 struct isl_basic_map *isl_basic_map_equal(struct isl_ctx *ctx,
1698 unsigned nparam, unsigned in, unsigned out, unsigned n_equal)
1701 struct isl_basic_map *bmap;
1702 bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, n_equal, 0);
1705 for (i = 0; i < n_equal && bmap; ++i)
1706 bmap = var_equal(ctx, bmap, i);
1707 return isl_basic_map_finalize(ctx, bmap);
1710 struct isl_basic_map *isl_basic_map_less_at(struct isl_ctx *ctx,
1711 unsigned nparam, unsigned in, unsigned out, unsigned pos)
1714 struct isl_basic_map *bmap;
1715 bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, pos, 1);
1718 for (i = 0; i < pos && bmap; ++i)
1719 bmap = var_equal(ctx, bmap, i);
1721 bmap = var_less(ctx, bmap, pos);
1722 return isl_basic_map_finalize(ctx, bmap);
1725 struct isl_basic_map *isl_basic_map_more_at(struct isl_ctx *ctx,
1726 unsigned nparam, unsigned in, unsigned out, unsigned pos)
1729 struct isl_basic_map *bmap;
1730 bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, pos, 1);
1733 for (i = 0; i < pos && bmap; ++i)
1734 bmap = var_equal(ctx, bmap, i);
1736 bmap = var_more(ctx, bmap, pos);
1737 return isl_basic_map_finalize(ctx, bmap);
1740 struct isl_basic_map *isl_basic_map_from_basic_set(
1741 struct isl_ctx *ctx, struct isl_basic_set *bset,
1742 unsigned n_in, unsigned n_out)
1744 struct isl_basic_map *bmap;
1746 bset = isl_basic_set_cow(ctx, bset);
1750 isl_assert(ctx, bset->dim == n_in + n_out, goto error);
1751 bmap = (struct isl_basic_map *) bset;
1753 bmap->n_out = n_out;
1754 return isl_basic_map_finalize(ctx, bmap);
1756 isl_basic_set_free(ctx, bset);
1760 struct isl_basic_set *isl_basic_set_from_basic_map(
1761 struct isl_ctx *ctx, struct isl_basic_map *bmap)
1765 if (bmap->n_in == 0)
1766 return (struct isl_basic_set *)bmap;
1767 bmap = isl_basic_map_cow(ctx, bmap);
1770 bmap->n_out += bmap->n_in;
1772 bmap = isl_basic_map_finalize(ctx, bmap);
1773 return (struct isl_basic_set *)bmap;
1778 static struct isl_basic_set *isl_basic_map_underlying_set(
1779 struct isl_ctx *ctx, struct isl_basic_map *bmap)
1783 if (bmap->nparam == 0 && bmap->n_in == 0 && bmap->n_div == 0)
1784 return (struct isl_basic_set *)bmap;
1785 bmap = isl_basic_map_cow(ctx, bmap);
1788 bmap->n_out += bmap->nparam + bmap->n_in + bmap->n_div;
1792 bmap = isl_basic_map_finalize(ctx, bmap);
1793 return (struct isl_basic_set *)bmap;
1798 struct isl_basic_set *isl_basic_map_domain(struct isl_ctx *ctx,
1799 struct isl_basic_map *bmap)
1801 struct isl_basic_set *domain;
1805 n_out = bmap->n_out;
1806 domain = isl_basic_set_from_basic_map(ctx, bmap);
1807 return isl_basic_set_project_out(ctx, domain, n_out, 0);
1810 struct isl_basic_set *isl_basic_map_range(struct isl_ctx *ctx,
1811 struct isl_basic_map *bmap)
1813 return isl_basic_map_domain(ctx,
1814 isl_basic_map_reverse(ctx, bmap));
1817 struct isl_set *isl_map_range(struct isl_ctx *ctx, struct isl_map *map)
1820 struct isl_set *set;
1824 map = isl_map_cow(ctx, map);
1828 set = (struct isl_set *) map;
1830 for (i = 0; i < map->n; ++i) {
1831 set->p[i] = isl_basic_map_range(ctx, map->p[i]);
1835 F_CLR(set, ISL_MAP_DISJOINT);
1838 isl_map_free(ctx, map);
1842 struct isl_map *isl_map_from_set(
1843 struct isl_ctx *ctx, struct isl_set *set,
1844 unsigned n_in, unsigned n_out)
1847 struct isl_map *map = NULL;
1851 isl_assert(ctx, set->dim == n_in + n_out, goto error);
1852 set = isl_set_cow(ctx, set);
1855 map = (struct isl_map *)set;
1856 for (i = 0; i < set->n; ++i) {
1857 map->p[i] = isl_basic_map_from_basic_set(ctx,
1858 set->p[i], n_in, n_out);
1866 isl_set_free(ctx, set);
1870 struct isl_map *isl_map_alloc(struct isl_ctx *ctx,
1871 unsigned nparam, unsigned in, unsigned out, int n,
1874 struct isl_map *map;
1876 map = isl_alloc(ctx, struct isl_map,
1877 sizeof(struct isl_map) +
1878 n * sizeof(struct isl_basic_map *));
1885 map->nparam = nparam;
1892 struct isl_basic_map *isl_basic_map_empty(struct isl_ctx *ctx,
1893 unsigned nparam, unsigned in, unsigned out)
1895 struct isl_basic_map *bmap;
1896 bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, 1, 0);
1897 bmap = isl_basic_map_set_to_empty(ctx, bmap);
1901 struct isl_map *isl_map_empty(struct isl_ctx *ctx,
1902 unsigned nparam, unsigned in, unsigned out)
1904 return isl_map_alloc(ctx, nparam, in, out, 0, ISL_MAP_DISJOINT);
1907 struct isl_set *isl_set_empty(struct isl_ctx *ctx,
1908 unsigned nparam, unsigned dim)
1910 return isl_set_alloc(ctx, nparam, dim, 0, ISL_MAP_DISJOINT);
1913 struct isl_map *isl_map_dup(struct isl_ctx *ctx, struct isl_map *map)
1916 struct isl_map *dup;
1918 dup = isl_map_alloc(ctx, map->nparam, map->n_in, map->n_out, map->n,
1920 for (i = 0; i < map->n; ++i)
1921 dup = isl_map_add(ctx, dup,
1922 isl_basic_map_dup(ctx, map->p[i]));
1926 struct isl_map *isl_map_add(struct isl_ctx *ctx, struct isl_map *map,
1927 struct isl_basic_map *bmap)
1931 isl_assert(ctx, map->nparam == bmap->nparam, goto error);
1932 isl_assert(ctx, map->n_in == bmap->n_in, goto error);
1933 isl_assert(ctx, map->n_out == bmap->n_out, goto error);
1934 isl_assert(ctx, map->n < map->size, goto error);
1935 map->p[map->n] = bmap;
1940 isl_map_free(ctx, map);
1942 isl_basic_map_free(ctx, bmap);
1946 void isl_map_free(struct isl_ctx *ctx, struct isl_map *map)
1956 for (i = 0; i < map->n; ++i)
1957 isl_basic_map_free(ctx, map->p[i]);
1961 struct isl_map *isl_map_extend(struct isl_ctx *ctx, struct isl_map *base,
1962 unsigned nparam, unsigned n_in, unsigned n_out)
1966 base = isl_map_cow(ctx, base);
1970 isl_assert(ctx, base->nparam <= nparam, goto error);
1971 isl_assert(ctx, base->n_in <= n_in, goto error);
1972 isl_assert(ctx, base->n_out <= n_out, goto error);
1973 base->nparam = nparam;
1975 base->n_out = n_out;
1976 for (i = 0; i < base->n; ++i) {
1977 base->p[i] = isl_basic_map_extend(ctx, base->p[i],
1978 nparam, n_in, n_out, 0, 0, 0);
1984 isl_map_free(ctx, base);
1988 struct isl_basic_map *isl_basic_map_fix_input_si(struct isl_ctx *ctx,
1989 struct isl_basic_map *bmap,
1990 unsigned input, int value)
1994 bmap = isl_basic_map_cow(ctx, bmap);
1997 isl_assert(ctx, input < bmap->n_in, goto error);
1999 bmap = isl_basic_map_extend(ctx, bmap,
2000 bmap->nparam, bmap->n_in, bmap->n_out, 0, 1, 0);
2001 j = isl_basic_map_alloc_equality(ctx, bmap);
2004 isl_seq_clr(bmap->eq[j],
2005 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->extra);
2006 isl_int_set_si(bmap->eq[j][1+bmap->nparam+input], -1);
2007 isl_int_set_si(bmap->eq[j][0], value);
2008 bmap = isl_basic_map_simplify(ctx, bmap);
2009 return isl_basic_map_finalize(ctx, bmap);
2011 isl_basic_map_free(ctx, bmap);
2015 struct isl_map *isl_map_fix_input_si(struct isl_ctx *ctx, struct isl_map *map,
2016 unsigned input, int value)
2020 map = isl_map_cow(ctx, map);
2024 isl_assert(ctx, input < map->n_in, goto error);
2025 for (i = 0; i < map->n; ++i) {
2026 map->p[i] = isl_basic_map_fix_input_si(ctx, map->p[i],
2033 isl_map_free(ctx, map);
2037 struct isl_map *isl_map_reverse(struct isl_ctx *ctx, struct isl_map *map)
2042 map = isl_map_cow(ctx, map);
2047 map->n_in = map->n_out;
2049 for (i = 0; i < map->n; ++i) {
2050 map->p[i] = isl_basic_map_reverse(ctx, map->p[i]);
2056 isl_map_free(ctx, map);
2060 struct isl_map *isl_basic_map_lexmax(struct isl_ctx *ctx,
2061 struct isl_basic_map *bmap, struct isl_basic_set *dom,
2062 struct isl_set **empty)
2064 return isl_pip_basic_map_lexmax(ctx, bmap, dom, empty);
2067 struct isl_map *isl_basic_map_lexmin(struct isl_ctx *ctx,
2068 struct isl_basic_map *bmap, struct isl_basic_set *dom,
2069 struct isl_set **empty)
2071 return isl_pip_basic_map_lexmin(ctx, bmap, dom, empty);
2074 struct isl_set *isl_basic_set_lexmin(struct isl_ctx *ctx,
2075 struct isl_basic_set *bset)
2077 struct isl_basic_map *bmap = NULL;
2078 struct isl_basic_set *dom = NULL;
2079 struct isl_map *min;
2083 bmap = isl_basic_map_from_basic_set(ctx, bset, 0, bset->dim);
2086 dom = isl_basic_set_alloc(ctx, bmap->nparam, 0, 0, 0, 0);
2089 min = isl_basic_map_lexmin(ctx, bmap, dom, NULL);
2090 return isl_map_range(ctx, min);
2092 isl_basic_map_free(ctx, bmap);
2096 struct isl_map *isl_basic_map_compute_divs(struct isl_ctx *ctx,
2097 struct isl_basic_map *bmap)
2101 if (bmap->n_div == 0)
2102 return isl_map_from_basic_map(ctx, bmap);
2103 return isl_pip_basic_map_compute_divs(ctx, bmap);
2106 struct isl_map *isl_map_compute_divs(struct isl_ctx *ctx, struct isl_map *map)
2109 struct isl_map *res;
2115 res = isl_basic_map_compute_divs(ctx,
2116 isl_basic_map_copy(ctx, map->p[0]));
2117 for (i = 1 ; i < map->n; ++i) {
2119 r2 = isl_basic_map_compute_divs(ctx,
2120 isl_basic_map_copy(ctx, map->p[i]));
2121 if (F_ISSET(map, ISL_MAP_DISJOINT))
2122 res = isl_map_union_disjoint(ctx, res, r2);
2124 res = isl_map_union(ctx, res, r2);
2126 isl_map_free(ctx, map);
2131 struct isl_set *isl_basic_set_compute_divs(struct isl_ctx *ctx,
2132 struct isl_basic_set *bset)
2134 return (struct isl_set *)
2135 isl_basic_map_compute_divs(ctx,
2136 (struct isl_basic_map *)bset);
2139 struct isl_set *isl_map_domain(struct isl_ctx *ctx, struct isl_map *map)
2142 struct isl_set *set;
2147 map = isl_map_cow(ctx, map);
2151 set = (struct isl_set *)map;
2152 set->dim = map->n_in;
2154 for (i = 0; i < map->n; ++i) {
2155 set->p[i] = isl_basic_map_domain(ctx, map->p[i]);
2159 F_CLR(set, ISL_MAP_DISJOINT);
2162 isl_map_free(ctx, map);
2166 struct isl_map *isl_map_union_disjoint(struct isl_ctx *ctx,
2167 struct isl_map *map1, struct isl_map *map2)
2171 struct isl_map *map = NULL;
2177 isl_map_free(ctx, map1);
2181 isl_map_free(ctx, map2);
2185 isl_assert(ctx, map1->nparam == map2->nparam, goto error);
2186 isl_assert(ctx, map1->n_in == map2->n_in, goto error);
2187 isl_assert(ctx, map1->n_out == map2->n_out, goto error);
2189 if (F_ISSET(map1, ISL_MAP_DISJOINT) &&
2190 F_ISSET(map2, ISL_MAP_DISJOINT))
2191 FL_SET(flags, ISL_MAP_DISJOINT);
2193 map = isl_map_alloc(ctx, map1->nparam, map1->n_in, map1->n_out,
2194 map1->n + map2->n, flags);
2197 for (i = 0; i < map1->n; ++i) {
2198 map = isl_map_add(ctx, map,
2199 isl_basic_map_copy(ctx, map1->p[i]));
2203 for (i = 0; i < map2->n; ++i) {
2204 map = isl_map_add(ctx, map,
2205 isl_basic_map_copy(ctx, map2->p[i]));
2209 isl_map_free(ctx, map1);
2210 isl_map_free(ctx, map2);
2213 isl_map_free(ctx, map);
2214 isl_map_free(ctx, map1);
2215 isl_map_free(ctx, map2);
2219 struct isl_map *isl_map_union(struct isl_ctx *ctx,
2220 struct isl_map *map1, struct isl_map *map2)
2222 map1 = isl_map_union_disjoint(ctx, map1, map2);
2226 F_CLR(map1, ISL_MAP_DISJOINT);
2230 struct isl_set *isl_set_union_disjoint(struct isl_ctx *ctx,
2231 struct isl_set *set1, struct isl_set *set2)
2233 return (struct isl_set *)
2234 isl_map_union_disjoint(ctx,
2235 (struct isl_map *)set1, (struct isl_map *)set2);
2238 struct isl_set *isl_set_union(struct isl_ctx *ctx,
2239 struct isl_set *set1, struct isl_set *set2)
2241 return (struct isl_set *)
2243 (struct isl_map *)set1, (struct isl_map *)set2);
2246 struct isl_map *isl_map_intersect_range(
2247 struct isl_ctx *ctx, struct isl_map *map,
2248 struct isl_set *set)
2251 struct isl_map *result;
2257 if (F_ISSET(map, ISL_MAP_DISJOINT) &&
2258 F_ISSET(set, ISL_MAP_DISJOINT))
2259 FL_SET(flags, ISL_MAP_DISJOINT);
2261 result = isl_map_alloc(ctx, map->nparam, map->n_in, map->n_out,
2262 map->n * set->n, flags);
2265 for (i = 0; i < map->n; ++i)
2266 for (j = 0; j < set->n; ++j) {
2267 result = isl_map_add(ctx, result,
2268 isl_basic_map_intersect_range(ctx,
2269 isl_basic_map_copy(ctx, map->p[i]),
2270 isl_basic_set_copy(ctx, set->p[j])));
2274 isl_map_free(ctx, map);
2275 isl_set_free(ctx, set);
2278 isl_map_free(ctx, map);
2279 isl_set_free(ctx, set);
2283 struct isl_map *isl_map_intersect_domain(
2284 struct isl_ctx *ctx, struct isl_map *map,
2285 struct isl_set *set)
2287 return isl_map_reverse(ctx,
2288 isl_map_intersect_range(ctx, isl_map_reverse(ctx, map), set));
2291 struct isl_map *isl_map_apply_domain(
2292 struct isl_ctx *ctx, struct isl_map *map1,
2293 struct isl_map *map2)
2297 map1 = isl_map_reverse(ctx, map1);
2298 map1 = isl_map_apply_range(ctx, map1, map2);
2299 return isl_map_reverse(ctx, map1);
2301 isl_map_free(ctx, map1);
2302 isl_map_free(ctx, map2);
2306 struct isl_map *isl_map_apply_range(
2307 struct isl_ctx *ctx, struct isl_map *map1,
2308 struct isl_map *map2)
2310 struct isl_map *result;
2316 isl_assert(ctx, map1->nparam == map2->nparam, goto error);
2317 isl_assert(ctx, map1->n_out == map2->n_in, goto error);
2319 result = isl_map_alloc(ctx, map1->nparam, map1->n_in, map2->n_out,
2320 map1->n * map2->n, 0);
2323 for (i = 0; i < map1->n; ++i)
2324 for (j = 0; j < map2->n; ++j) {
2325 result = isl_map_add(ctx, result,
2326 isl_basic_map_apply_range(ctx,
2327 isl_basic_map_copy(ctx, map1->p[i]),
2328 isl_basic_map_copy(ctx, map2->p[j])));
2332 isl_map_free(ctx, map1);
2333 isl_map_free(ctx, map2);
2336 isl_map_free(ctx, map1);
2337 isl_map_free(ctx, map2);
2342 * returns range - domain
2344 struct isl_basic_set *isl_basic_map_deltas(struct isl_ctx *ctx,
2345 struct isl_basic_map *bmap)
2347 struct isl_basic_set *bset;
2353 isl_assert(ctx, bmap->n_in == bmap->n_out, goto error);
2355 bset = isl_basic_set_from_basic_map(ctx, bmap);
2356 bset = isl_basic_set_extend(ctx, bset, bset->nparam, 3*dim, 0,
2358 bset = isl_basic_set_swap_vars(ctx, bset, 2*dim);
2359 for (i = 0; i < dim; ++i) {
2360 int j = isl_basic_map_alloc_equality(ctx,
2361 (struct isl_basic_map *)bset);
2364 isl_seq_clr(bset->eq[j],
2365 1 + bset->nparam + bset->dim + bset->extra);
2366 isl_int_set_si(bset->eq[j][1+bset->nparam+i], 1);
2367 isl_int_set_si(bset->eq[j][1+bset->nparam+dim+i], 1);
2368 isl_int_set_si(bset->eq[j][1+bset->nparam+2*dim+i], -1);
2370 return isl_basic_set_project_out(ctx, bset, 2*dim, 0);
2372 isl_basic_map_free(ctx, bmap);
2376 /* If the only constraints a div d=floor(f/m)
2377 * appears in are its two defining constraints
2380 * -(f - (m - 1)) + m d >= 0
2382 * then it can safely be removed.
2384 static int div_is_redundant(struct isl_ctx *ctx, struct isl_basic_map *bmap,
2388 unsigned pos = 1 + bmap->nparam + bmap->n_in + bmap->n_out + div;
2390 for (i = 0; i < bmap->n_eq; ++i)
2391 if (!isl_int_is_zero(bmap->eq[i][pos]))
2394 for (i = 0; i < bmap->n_ineq; ++i) {
2395 if (isl_int_is_zero(bmap->ineq[i][pos]))
2397 if (isl_int_eq(bmap->ineq[i][pos], bmap->div[div][0])) {
2399 isl_int_sub(bmap->div[div][1],
2400 bmap->div[div][1], bmap->div[div][0]);
2401 isl_int_add_ui(bmap->div[div][1], bmap->div[div][1], 1);
2402 neg = isl_seq_is_neg(bmap->ineq[i], bmap->div[div]+1, pos);
2403 isl_int_sub_ui(bmap->div[div][1], bmap->div[div][1], 1);
2404 isl_int_add(bmap->div[div][1],
2405 bmap->div[div][1], bmap->div[div][0]);
2408 if (isl_seq_first_non_zero(bmap->ineq[i]+pos+1,
2409 bmap->n_div-div-1) != -1)
2411 } else if (isl_int_abs_eq(bmap->ineq[i][pos], bmap->div[div][0])) {
2412 if (!isl_seq_eq(bmap->ineq[i], bmap->div[div]+1, pos))
2414 if (isl_seq_first_non_zero(bmap->ineq[i]+pos+1,
2415 bmap->n_div-div-1) != -1)
2421 for (i = 0; i < bmap->n_div; ++i)
2422 if (!isl_int_is_zero(bmap->div[i][1+pos]))
2429 * Remove divs that don't occur in any of the constraints or other divs.
2430 * These can arise when dropping some of the variables in a quast
2431 * returned by piplib.
2433 static struct isl_basic_map *remove_redundant_divs(struct isl_ctx *ctx,
2434 struct isl_basic_map *bmap)
2438 for (i = bmap->n_div-1; i >= 0; --i) {
2439 if (!div_is_redundant(ctx, bmap, i))
2441 bmap = isl_basic_map_drop_div(ctx, bmap, i);
2446 struct isl_basic_map *isl_basic_map_finalize(struct isl_ctx *ctx,
2447 struct isl_basic_map *bmap)
2449 bmap = remove_redundant_divs(ctx, bmap);
2452 F_SET(bmap, ISL_BASIC_SET_FINAL);
2456 struct isl_basic_set *isl_basic_set_finalize(struct isl_ctx *ctx,
2457 struct isl_basic_set *bset)
2459 return (struct isl_basic_set *)
2460 isl_basic_map_finalize(ctx,
2461 (struct isl_basic_map *)bset);
2464 struct isl_set *isl_set_finalize(struct isl_ctx *ctx, struct isl_set *set)
2470 for (i = 0; i < set->n; ++i) {
2471 set->p[i] = isl_basic_set_finalize(ctx, set->p[i]);
2477 isl_set_free(ctx, set);
2481 struct isl_map *isl_map_finalize(struct isl_ctx *ctx, struct isl_map *map)
2487 for (i = 0; i < map->n; ++i) {
2488 map->p[i] = isl_basic_map_finalize(ctx, map->p[i]);
2494 isl_map_free(ctx, map);
2498 struct isl_basic_map *isl_basic_map_identity(struct isl_ctx *ctx,
2499 unsigned nparam, unsigned dim)
2501 struct isl_basic_map *bmap;
2504 bmap = isl_basic_map_alloc(ctx, nparam, dim, dim, 0, dim, 0);
2508 for (i = 0; i < dim; ++i) {
2509 int j = isl_basic_map_alloc_equality(ctx, bmap);
2512 isl_seq_clr(bmap->eq[j],
2513 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->extra);
2514 isl_int_set_si(bmap->eq[j][1+nparam+i], 1);
2515 isl_int_set_si(bmap->eq[j][1+nparam+dim+i], -1);
2517 return isl_basic_map_finalize(ctx, bmap);
2519 isl_basic_map_free(ctx, bmap);
2523 struct isl_map *isl_map_identity(struct isl_ctx *ctx,
2524 unsigned nparam, unsigned dim)
2526 struct isl_map *map = isl_map_alloc(ctx, nparam, dim, dim, 1,
2530 map = isl_map_add(ctx, map,
2531 isl_basic_map_identity(ctx, nparam, dim));
2534 isl_map_free(ctx, map);
2538 int isl_set_is_equal(struct isl_ctx *ctx,
2539 struct isl_set *set1, struct isl_set *set2)
2541 return isl_map_is_equal(ctx,
2542 (struct isl_map *)set1, (struct isl_map *)set2);
2545 int isl_set_is_subset(struct isl_ctx *ctx,
2546 struct isl_set *set1, struct isl_set *set2)
2548 return isl_map_is_subset(ctx,
2549 (struct isl_map *)set1, (struct isl_map *)set2);
2552 int isl_basic_map_is_subset(struct isl_ctx *ctx,
2553 struct isl_basic_map *bmap1,
2554 struct isl_basic_map *bmap2)
2557 struct isl_map *map1;
2558 struct isl_map *map2;
2560 if (!bmap1 || !bmap2)
2563 map1 = isl_map_from_basic_map(ctx,
2564 isl_basic_map_copy(ctx, bmap1));
2565 map2 = isl_map_from_basic_map(ctx,
2566 isl_basic_map_copy(ctx, bmap2));
2568 is_subset = isl_map_is_subset(ctx, map1, map2);
2570 isl_map_free(ctx, map1);
2571 isl_map_free(ctx, map2);
2576 int isl_map_is_empty(struct isl_ctx *ctx, struct isl_map *map)
2583 for (i = 0; i < map->n; ++i) {
2584 is_empty = isl_basic_map_is_empty(ctx, map->p[i]);
2593 int isl_set_is_empty(struct isl_ctx *ctx, struct isl_set *set)
2595 return isl_map_is_empty(ctx, (struct isl_map *)set);
2598 int isl_map_is_subset(struct isl_ctx *ctx, struct isl_map *map1,
2599 struct isl_map *map2)
2603 struct isl_map *diff;
2608 if (isl_map_is_empty(ctx, map1))
2611 if (isl_map_is_empty(ctx, map2))
2614 diff = isl_map_subtract(ctx, isl_map_copy(ctx, map1),
2615 isl_map_copy(ctx, map2));
2619 is_subset = isl_map_is_empty(ctx, diff);
2620 isl_map_free(ctx, diff);
2625 int isl_map_is_equal(struct isl_ctx *ctx,
2626 struct isl_map *map1, struct isl_map *map2)
2632 is_subset = isl_map_is_subset(ctx, map1, map2);
2635 is_subset = isl_map_is_subset(ctx, map2, map1);
2639 int isl_basic_map_is_strict_subset(struct isl_ctx *ctx,
2640 struct isl_basic_map *bmap1,
2641 struct isl_basic_map *bmap2)
2645 if (!bmap1 || !bmap2)
2647 is_subset = isl_basic_map_is_subset(ctx, bmap1, bmap2);
2650 is_subset = isl_basic_map_is_subset(ctx, bmap2, bmap1);
2651 if (is_subset == -1)
2656 static int basic_map_contains(struct isl_ctx *ctx, struct isl_basic_map *bmap,
2657 struct isl_vec *vec)
2663 total = 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
2664 if (total != vec->size)
2669 for (i = 0; i < bmap->n_eq; ++i) {
2670 isl_seq_inner_product(vec->block.data, bmap->eq[i], total, &s);
2671 if (!isl_int_is_zero(s)) {
2677 for (i = 0; i < bmap->n_ineq; ++i) {
2678 isl_seq_inner_product(vec->block.data, bmap->ineq[i], total, &s);
2679 if (isl_int_is_neg(s)) {
2690 int isl_basic_map_is_empty(struct isl_ctx *ctx,
2691 struct isl_basic_map *bmap)
2693 struct isl_basic_set *bset = NULL;
2694 struct isl_vec *sample = NULL;
2701 if (F_ISSET(bmap, ISL_BASIC_MAP_EMPTY))
2704 total = 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
2705 if (bmap->sample && bmap->sample->size == total) {
2706 int contains = basic_map_contains(ctx, bmap, bmap->sample);
2712 bset = isl_basic_map_underlying_set(ctx,
2713 isl_basic_map_copy(ctx, bmap));
2716 sample = isl_basic_set_sample(ctx, bset);
2719 empty = sample->size == 0;
2721 isl_vec_free(ctx, bmap->sample);
2722 bmap->sample = sample;
2727 struct isl_map *isl_basic_map_union(
2728 struct isl_ctx *ctx, struct isl_basic_map *bmap1,
2729 struct isl_basic_map *bmap2)
2731 struct isl_map *map;
2732 if (!bmap1 || !bmap2)
2735 isl_assert(ctx, bmap1->nparam == bmap2->nparam, goto error);
2736 isl_assert(ctx, bmap1->n_in == bmap2->n_in, goto error);
2737 isl_assert(ctx, bmap1->n_out == bmap2->n_out, goto error);
2739 map = isl_map_alloc(ctx, bmap1->nparam,
2740 bmap1->n_in, bmap1->n_out, 2, 0);
2743 map = isl_map_add(ctx, map, bmap1);
2744 map = isl_map_add(ctx, map, bmap2);
2747 isl_basic_map_free(ctx, bmap1);
2748 isl_basic_map_free(ctx, bmap2);
2752 struct isl_set *isl_basic_set_union(
2753 struct isl_ctx *ctx, struct isl_basic_set *bset1,
2754 struct isl_basic_set *bset2)
2756 return (struct isl_set *)isl_basic_map_union(ctx,
2757 (struct isl_basic_map *)bset1,
2758 (struct isl_basic_map *)bset2);
2761 /* Order divs such that any div only depends on previous divs */
2762 static struct isl_basic_map *order_divs(struct isl_ctx *ctx,
2763 struct isl_basic_map *bmap)
2766 unsigned off = bmap->nparam + bmap->n_in + bmap->n_out;
2768 for (i = 0; i < bmap->n_div; ++i) {
2770 pos = isl_seq_first_non_zero(bmap->div[i]+1+1+off+i,
2774 swap_div(bmap, i, pos);
2780 static int find_div(struct isl_basic_map *dst,
2781 struct isl_basic_map *src, unsigned div)
2785 unsigned total = src->nparam + src->n_in + src->n_out + src->n_div;
2787 for (i = 0; i < dst->n_div; ++i)
2788 if (isl_seq_eq(dst->div[i], src->div[div], 1+1+total) &&
2789 isl_seq_first_non_zero(dst->div[i]+1+1+total,
2790 dst->n_div - src->n_div) == -1)
2795 /* For a div d = floor(f/m), add the constraints
2798 * -(f-(n-1)) + m d >= 0
2800 * Note that the second constraint is the negation of
2804 static int add_div_constraints(struct isl_ctx *ctx,
2805 struct isl_basic_map *bmap, unsigned div)
2808 unsigned div_pos = 1 + bmap->nparam + bmap->n_in + bmap->n_out + div;
2809 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->extra;
2811 i = isl_basic_map_alloc_inequality(ctx, bmap);
2814 isl_seq_cpy(bmap->ineq[i], bmap->div[div]+1, 1+total);
2815 isl_int_neg(bmap->ineq[i][div_pos], bmap->div[div][0]);
2817 j = isl_basic_map_alloc_inequality(ctx, bmap);
2820 isl_seq_neg(bmap->ineq[j], bmap->ineq[i], 1 + total);
2821 isl_int_add(bmap->ineq[j][0], bmap->ineq[j][0], bmap->ineq[j][div_pos]);
2822 isl_int_sub_ui(bmap->ineq[j][0], bmap->ineq[j][0], 1);
2826 struct isl_basic_map *isl_basic_map_align_divs(struct isl_ctx *ctx,
2827 struct isl_basic_map *dst, struct isl_basic_map *src)
2830 unsigned total = src->nparam + src->n_in + src->n_out + src->n_div;
2832 if (src->n_div == 0)
2835 src = order_divs(ctx, src);
2836 dst = isl_basic_map_extend(ctx, dst, dst->nparam, dst->n_in,
2837 dst->n_out, src->n_div, 0, 2 * src->n_div);
2840 for (i = 0; i < src->n_div; ++i) {
2841 int j = find_div(dst, src, i);
2843 j = isl_basic_map_alloc_div(ctx, dst);
2846 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total);
2847 isl_seq_clr(dst->div[j]+1+1+total,
2848 dst->extra - src->n_div);
2849 if (add_div_constraints(ctx, dst, j) < 0)
2853 swap_div(dst, i, j);
2857 isl_basic_map_free(ctx, dst);
2861 static struct isl_map *add_cut_constraint(struct isl_ctx *ctx,
2862 struct isl_map *dst,
2863 struct isl_basic_map *src, isl_int *c,
2864 unsigned len, int oppose)
2866 struct isl_basic_map *copy = NULL;
2871 copy = isl_basic_map_copy(ctx, src);
2872 copy = isl_basic_map_cow(ctx, copy);
2875 copy = isl_basic_map_extend(ctx, copy,
2876 copy->nparam, copy->n_in, copy->n_out, 0, 0, 1);
2877 k = isl_basic_map_alloc_inequality(ctx, copy);
2881 isl_seq_neg(copy->ineq[k], c, len);
2883 isl_seq_cpy(copy->ineq[k], c, len);
2884 total = 1 + copy->nparam + copy->n_in + copy->n_out + copy->extra;
2885 isl_seq_clr(copy->ineq[k]+len, total - len);
2886 isl_inequality_negate(ctx, copy, k);
2887 copy = isl_basic_map_simplify(ctx, copy);
2888 copy = isl_basic_map_finalize(ctx, copy);
2889 is_empty = isl_basic_map_is_empty(ctx, copy);
2893 dst = isl_map_add(ctx, dst, copy);
2895 isl_basic_map_free(ctx, copy);
2898 isl_basic_map_free(ctx, copy);
2899 isl_map_free(ctx, dst);
2903 static struct isl_map *subtract(struct isl_ctx *ctx, struct isl_map *map,
2904 struct isl_basic_map *bmap)
2908 struct isl_map *rest = NULL;
2910 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
2917 if (F_ISSET(map, ISL_MAP_DISJOINT))
2918 FL_SET(flags, ISL_MAP_DISJOINT);
2920 max = map->n * (2 * bmap->n_eq + bmap->n_ineq);
2921 rest = isl_map_alloc(ctx, map->nparam, map->n_in, map->n_out,
2926 for (i = 0; i < map->n; ++i) {
2927 map->p[i] = isl_basic_map_align_divs(ctx, map->p[i], bmap);
2932 for (j = 0; j < map->n; ++j)
2933 map->p[j] = isl_basic_map_cow(ctx, map->p[j]);
2935 for (i = 0; i < bmap->n_eq; ++i) {
2936 for (j = 0; j < map->n; ++j) {
2937 rest = add_cut_constraint(ctx, rest,
2938 map->p[j], bmap->eq[i], 1+total, 0);
2942 rest = add_cut_constraint(ctx, rest,
2943 map->p[j], bmap->eq[i], 1+total, 1);
2947 map->p[j] = isl_basic_map_extend(ctx, map->p[j],
2948 map->p[j]->nparam, map->p[j]->n_in,
2949 map->p[j]->n_out, 0, 1, 0);
2952 k = isl_basic_map_alloc_equality(ctx, map->p[j]);
2955 isl_seq_cpy(map->p[j]->eq[k], bmap->eq[i], 1+total);
2956 isl_seq_clr(map->p[j]->eq[k]+1+total,
2957 map->p[j]->extra - bmap->n_div);
2961 for (i = 0; i < bmap->n_ineq; ++i) {
2962 for (j = 0; j < map->n; ++j) {
2963 rest = add_cut_constraint(ctx, rest,
2964 map->p[j], bmap->ineq[i], 1+total, 0);
2968 map->p[j] = isl_basic_map_extend(ctx, map->p[j],
2969 map->p[j]->nparam, map->p[j]->n_in,
2970 map->p[j]->n_out, 0, 0, 1);
2973 k = isl_basic_map_alloc_inequality(ctx, map->p[j]);
2976 isl_seq_cpy(map->p[j]->ineq[k], bmap->ineq[i], 1+total);
2977 isl_seq_clr(map->p[j]->ineq[k]+1+total,
2978 map->p[j]->extra - bmap->n_div);
2982 isl_map_free(ctx, map);
2985 isl_map_free(ctx, map);
2986 isl_map_free(ctx, rest);
2990 struct isl_map *isl_map_subtract(struct isl_ctx *ctx, struct isl_map *map1,
2991 struct isl_map *map2)
2997 isl_assert(ctx, map1->nparam == map2->nparam, goto error);
2998 isl_assert(ctx, map1->n_in == map2->n_in, goto error);
2999 isl_assert(ctx, map1->n_out == map2->n_out, goto error);
3001 if (isl_map_is_empty(ctx, map2)) {
3002 isl_map_free(ctx, map2);
3006 map1 = isl_map_compute_divs(ctx, map1);
3007 map2 = isl_map_compute_divs(ctx, map2);
3011 for (i = 0; map1 && i < map2->n; ++i)
3012 map1 = subtract(ctx, map1, map2->p[i]);
3014 isl_map_free(ctx, map2);
3017 isl_map_free(ctx, map1);
3018 isl_map_free(ctx, map2);
3022 struct isl_set *isl_set_subtract(struct isl_ctx *ctx, struct isl_set *set1,
3023 struct isl_set *set2)
3025 return (struct isl_set *)
3026 isl_map_subtract(ctx,
3027 (struct isl_map *)set1, (struct isl_map *)set2);
3030 struct isl_set *isl_set_apply(struct isl_ctx *ctx, struct isl_set *set,
3031 struct isl_map *map)
3033 isl_assert(ctx, set->dim == map->n_in, goto error);
3034 map = isl_map_intersect_domain(ctx, map, set);
3035 set = isl_map_range(ctx, map);
3038 isl_set_free(ctx, set);
3039 isl_map_free(ctx, map);