5 #include "isl_equalities.h"
11 #include "isl_map_private.h"
12 #include "isl_map_piplib.h"
13 #include "isl_sample.h"
16 static struct isl_basic_map *basic_map_init(struct isl_ctx *ctx,
17 struct isl_basic_map *bmap,
18 unsigned nparam, unsigned n_in, unsigned n_out, unsigned extra,
19 unsigned n_eq, unsigned n_ineq)
22 size_t row_size = 1 + nparam + n_in + n_out + extra;
24 bmap->block = isl_blk_alloc(ctx, (n_eq + n_ineq) * row_size);
25 if (isl_blk_is_error(bmap->block)) {
30 bmap->eq = isl_alloc_array(ctx, isl_int *, n_eq + n_ineq);
32 isl_blk_free(ctx, bmap->block);
38 bmap->block2 = isl_blk_empty();
41 bmap->block2 = isl_blk_alloc(ctx, extra * (1 + row_size));
42 if (isl_blk_is_error(bmap->block2)) {
44 isl_blk_free(ctx, bmap->block);
49 bmap->div = isl_alloc_array(ctx, isl_int *, extra);
51 isl_blk_free(ctx, bmap->block2);
53 isl_blk_free(ctx, bmap->block);
59 for (i = 0; i < n_eq + n_ineq; ++i)
60 bmap->eq[i] = bmap->block.data + i * row_size;
62 for (i = 0; i < extra; ++i)
63 bmap->div[i] = bmap->block2.data + i * (1 + row_size);
69 bmap->c_size = n_eq + n_ineq;
70 bmap->ineq = bmap->eq + n_eq;
71 bmap->nparam = nparam;
83 struct isl_basic_set *isl_basic_set_alloc(struct isl_ctx *ctx,
84 unsigned nparam, unsigned dim, unsigned extra,
85 unsigned n_eq, unsigned n_ineq)
87 struct isl_basic_map *bmap;
88 bmap = isl_basic_map_alloc(ctx, nparam, 0, dim, extra, n_eq, n_ineq);
89 return (struct isl_basic_set *)bmap;
92 struct isl_basic_map *isl_basic_map_alloc(struct isl_ctx *ctx,
93 unsigned nparam, unsigned in, unsigned out, unsigned extra,
94 unsigned n_eq, unsigned n_ineq)
96 struct isl_basic_map *bmap;
98 bmap = isl_alloc_type(ctx, struct isl_basic_map);
102 return basic_map_init(ctx, bmap,
103 nparam, in, out, extra, n_eq, n_ineq);
106 static void dup_constraints(
107 struct isl_basic_map *dst, struct isl_basic_map *src)
110 unsigned total = src->nparam + src->n_in + src->n_out + src->n_div;
112 for (i = 0; i < src->n_eq; ++i) {
113 int j = isl_basic_map_alloc_equality(dst);
114 isl_seq_cpy(dst->eq[j], src->eq[i], 1+total);
117 for (i = 0; i < src->n_ineq; ++i) {
118 int j = isl_basic_map_alloc_inequality(dst);
119 isl_seq_cpy(dst->ineq[j], src->ineq[i], 1+total);
122 for (i = 0; i < src->n_div; ++i) {
123 int j = isl_basic_map_alloc_div(dst);
124 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total);
126 F_SET(dst, ISL_BASIC_SET_FINAL);
129 struct isl_basic_map *isl_basic_map_dup(struct isl_basic_map *bmap)
131 struct isl_basic_map *dup;
135 dup = isl_basic_map_alloc(bmap->ctx, bmap->nparam,
136 bmap->n_in, bmap->n_out,
137 bmap->n_div, bmap->n_eq, bmap->n_ineq);
140 dup->flags = bmap->flags;
141 dup_constraints(dup, bmap);
142 dup->sample = isl_vec_copy(bmap->ctx, bmap->sample);
146 struct isl_basic_set *isl_basic_set_dup(struct isl_basic_set *bset)
148 struct isl_basic_map *dup;
150 dup = isl_basic_map_dup((struct isl_basic_map *)bset);
151 return (struct isl_basic_set *)dup;
154 struct isl_basic_set *isl_basic_set_copy(struct isl_basic_set *bset)
159 if (F_ISSET(bset, ISL_BASIC_SET_FINAL)) {
163 return isl_basic_set_dup(bset);
166 struct isl_set *isl_set_copy(struct isl_set *set)
175 struct isl_basic_map *isl_basic_map_copy(struct isl_basic_map *bmap)
180 if (F_ISSET(bmap, ISL_BASIC_SET_FINAL)) {
184 return isl_basic_map_dup(bmap);
187 struct isl_map *isl_map_copy(struct isl_map *map)
196 void isl_basic_map_free(struct isl_basic_map *bmap)
204 isl_ctx_deref(bmap->ctx);
206 isl_blk_free(bmap->ctx, bmap->block2);
208 isl_blk_free(bmap->ctx, bmap->block);
209 isl_vec_free(bmap->ctx, bmap->sample);
213 void isl_basic_set_free(struct isl_basic_set *bset)
215 isl_basic_map_free((struct isl_basic_map *)bset);
218 int isl_basic_map_alloc_equality(struct isl_basic_map *bmap)
224 isl_assert(ctx, bmap->n_eq + bmap->n_ineq < bmap->c_size, return -1);
225 isl_assert(ctx, bmap->eq + bmap->n_eq <= bmap->ineq, return -1);
226 if (bmap->eq + bmap->n_eq == bmap->ineq) {
228 int j = isl_basic_map_alloc_inequality(bmap);
232 bmap->ineq[0] = bmap->ineq[j];
237 isl_seq_clr(bmap->eq[bmap->n_eq] +
238 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div,
239 bmap->extra - bmap->n_div);
243 int isl_basic_set_alloc_equality(struct isl_basic_set *bset)
245 return isl_basic_map_alloc_equality((struct isl_basic_map *)bset);
248 int isl_basic_map_free_equality(struct isl_basic_map *bmap, unsigned n)
252 isl_assert(bmap->ctx, n <= bmap->n_eq, return -1);
257 int isl_basic_map_drop_equality(struct isl_basic_map *bmap, unsigned pos)
262 isl_assert(bmap->ctx, pos < bmap->n_eq, return -1);
264 if (pos != bmap->n_eq - 1) {
266 bmap->eq[pos] = bmap->eq[bmap->n_eq - 1];
267 bmap->eq[bmap->n_eq - 1] = t;
273 int isl_basic_set_drop_equality(struct isl_basic_set *bset, unsigned pos)
275 return isl_basic_map_drop_equality((struct isl_basic_map *)bset, pos);
278 void isl_basic_map_inequality_to_equality(
279 struct isl_basic_map *bmap, unsigned pos)
284 bmap->ineq[pos] = bmap->ineq[0];
285 bmap->ineq[0] = bmap->eq[bmap->n_eq];
286 bmap->eq[bmap->n_eq] = t;
290 F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
293 int isl_basic_map_alloc_inequality(struct isl_basic_map *bmap)
299 isl_assert(ctx, (bmap->ineq - bmap->eq) + bmap->n_ineq < bmap->c_size,
301 F_CLR(bmap, ISL_BASIC_MAP_NO_IMPLICIT);
302 F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
303 F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
304 isl_seq_clr(bmap->ineq[bmap->n_ineq] +
305 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div,
306 bmap->extra - bmap->n_div);
307 return bmap->n_ineq++;
310 int isl_basic_set_alloc_inequality(struct isl_basic_set *bset)
312 return isl_basic_map_alloc_inequality((struct isl_basic_map *)bset);
315 int isl_basic_map_free_inequality(struct isl_basic_map *bmap, unsigned n)
319 isl_assert(bmap->ctx, n <= bmap->n_ineq, return -1);
324 int isl_basic_set_free_inequality(struct isl_basic_set *bset, unsigned n)
326 return isl_basic_map_free_inequality((struct isl_basic_map *)bset, n);
329 int isl_basic_map_drop_inequality(struct isl_basic_map *bmap, unsigned pos)
334 isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
336 if (pos != bmap->n_ineq - 1) {
338 bmap->ineq[pos] = bmap->ineq[bmap->n_ineq - 1];
339 bmap->ineq[bmap->n_ineq - 1] = t;
340 F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
346 int isl_basic_set_drop_inequality(struct isl_basic_set *bset, unsigned pos)
348 return isl_basic_map_drop_inequality((struct isl_basic_map *)bset, pos);
351 int isl_basic_map_alloc_div(struct isl_basic_map *bmap)
355 isl_assert(bmap->ctx, bmap->n_div < bmap->extra, return -1);
356 isl_seq_clr(bmap->div[bmap->n_div] +
357 1 + 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div,
358 bmap->extra - bmap->n_div);
359 return bmap->n_div++;
362 int isl_basic_map_free_div(struct isl_basic_map *bmap, unsigned n)
366 isl_assert(bmap->ctx, n <= bmap->n_div, return -1);
371 /* Copy constraint from src to dst, putting the vars of src at offset
372 * dim_off in dst and the divs of src at offset div_off in dst.
373 * If both sets are actually map, then dim_off applies to the input
376 static void copy_constraint(struct isl_basic_map *dst_map, isl_int *dst,
377 struct isl_basic_map *src_map, isl_int *src,
378 unsigned in_off, unsigned out_off, unsigned div_off)
380 isl_int_set(dst[0], src[0]);
381 isl_seq_cpy(dst+1, src+1, isl_min(dst_map->nparam, src_map->nparam));
382 if (dst_map->nparam > src_map->nparam)
383 isl_seq_clr(dst+1+src_map->nparam,
384 dst_map->nparam - src_map->nparam);
385 isl_seq_clr(dst+1+dst_map->nparam, in_off);
386 isl_seq_cpy(dst+1+dst_map->nparam+in_off,
387 src+1+src_map->nparam,
388 isl_min(dst_map->n_in-in_off, src_map->n_in));
389 if (dst_map->n_in-in_off > src_map->n_in)
390 isl_seq_clr(dst+1+dst_map->nparam+in_off+src_map->n_in,
391 dst_map->n_in - in_off - src_map->n_in);
392 isl_seq_clr(dst+1+dst_map->nparam+dst_map->n_in, out_off);
393 isl_seq_cpy(dst+1+dst_map->nparam+dst_map->n_in+out_off,
394 src+1+src_map->nparam+src_map->n_in,
395 isl_min(dst_map->n_out-out_off, src_map->n_out));
396 if (dst_map->n_out-out_off > src_map->n_out)
397 isl_seq_clr(dst+1+dst_map->nparam+dst_map->n_in+out_off+src_map->n_out,
398 dst_map->n_out - out_off - src_map->n_out);
399 isl_seq_clr(dst+1+dst_map->nparam+dst_map->n_in+dst_map->n_out, div_off);
400 isl_seq_cpy(dst+1+dst_map->nparam+dst_map->n_in+dst_map->n_out+div_off,
401 src+1+src_map->nparam+src_map->n_in+src_map->n_out,
402 isl_min(dst_map->extra-div_off, src_map->n_div));
403 if (dst_map->n_div-div_off > src_map->n_div)
404 isl_seq_clr(dst+1+dst_map->nparam+dst_map->n_in+dst_map->n_out+
405 div_off+src_map->n_div,
406 dst_map->n_div - div_off - src_map->n_div);
409 static void copy_div(struct isl_basic_map *dst_map, isl_int *dst,
410 struct isl_basic_map *src_map, isl_int *src,
411 unsigned in_off, unsigned out_off, unsigned div_off)
413 isl_int_set(dst[0], src[0]);
414 copy_constraint(dst_map, dst+1, src_map, src+1, in_off, out_off, div_off);
417 static struct isl_basic_map *add_constraints(struct isl_basic_map *bmap1,
418 struct isl_basic_map *bmap2, unsigned i_pos, unsigned o_pos)
423 if (!bmap1 || !bmap2)
426 div_off = bmap1->n_div;
428 for (i = 0; i < bmap2->n_eq; ++i) {
429 int i1 = isl_basic_map_alloc_equality(bmap1);
432 copy_constraint(bmap1, bmap1->eq[i1], bmap2, bmap2->eq[i],
433 i_pos, o_pos, div_off);
436 for (i = 0; i < bmap2->n_ineq; ++i) {
437 int i1 = isl_basic_map_alloc_inequality(bmap1);
440 copy_constraint(bmap1, bmap1->ineq[i1], bmap2, bmap2->ineq[i],
441 i_pos, o_pos, div_off);
444 for (i = 0; i < bmap2->n_div; ++i) {
445 int i1 = isl_basic_map_alloc_div(bmap1);
448 copy_div(bmap1, bmap1->div[i1], bmap2, bmap2->div[i],
449 i_pos, o_pos, div_off);
452 isl_basic_map_free(bmap2);
457 isl_basic_map_free(bmap1);
458 isl_basic_map_free(bmap2);
462 static struct isl_basic_set *set_add_constraints(struct isl_basic_set *bset1,
463 struct isl_basic_set *bset2, unsigned pos)
465 return (struct isl_basic_set *)
466 add_constraints((struct isl_basic_map *)bset1,
467 (struct isl_basic_map *)bset2, 0, pos);
470 struct isl_basic_map *isl_basic_map_extend(struct isl_basic_map *base,
471 unsigned nparam, unsigned n_in, unsigned n_out, unsigned extra,
472 unsigned n_eq, unsigned n_ineq)
474 struct isl_basic_map *ext;
478 base = isl_basic_map_cow(base);
482 dims_ok = base && base->nparam == nparam &&
483 base->n_in == n_in && base->n_out == n_out &&
484 base->extra >= base->n_div + extra;
486 if (dims_ok && n_eq == 0 && n_ineq == 0)
489 isl_assert(base->ctx, base->nparam <= nparam, goto error);
490 isl_assert(base->ctx, base->n_in <= n_in, goto error);
491 isl_assert(base->ctx, base->n_out <= n_out, goto error);
492 extra += base->extra;
494 n_ineq += base->n_ineq;
496 ext = isl_basic_map_alloc(base->ctx, nparam, n_in, n_out,
497 extra, n_eq, n_ineq);
504 ext = add_constraints(ext, base, 0, 0);
507 F_CLR(ext, ISL_BASIC_SET_FINAL);
513 isl_basic_map_free(base);
517 struct isl_basic_set *isl_basic_set_extend(struct isl_basic_set *base,
518 unsigned nparam, unsigned dim, unsigned extra,
519 unsigned n_eq, unsigned n_ineq)
521 return (struct isl_basic_set *)
522 isl_basic_map_extend((struct isl_basic_map *)base,
523 nparam, 0, dim, extra, n_eq, n_ineq);
526 struct isl_basic_set *isl_basic_set_cow(struct isl_basic_set *bset)
528 return (struct isl_basic_set *)
529 isl_basic_map_cow((struct isl_basic_map *)bset);
532 struct isl_basic_map *isl_basic_map_cow(struct isl_basic_map *bmap)
539 bmap = isl_basic_map_dup(bmap);
541 F_CLR(bmap, ISL_BASIC_SET_FINAL);
545 struct isl_set *isl_set_cow(struct isl_set *set)
553 return isl_set_dup(set);
556 struct isl_map *isl_map_cow(struct isl_map *map)
564 return isl_map_dup(map);
567 static void swap_vars(struct isl_blk blk, isl_int *a,
568 unsigned a_len, unsigned b_len)
570 isl_seq_cpy(blk.data, a+a_len, b_len);
571 isl_seq_cpy(blk.data+b_len, a, a_len);
572 isl_seq_cpy(a, blk.data, b_len+a_len);
575 struct isl_basic_set *isl_basic_set_swap_vars(
576 struct isl_basic_set *bset, unsigned n)
584 isl_assert(bset->ctx, n <= bset->dim, goto error);
589 bset = isl_basic_set_cow(bset);
593 blk = isl_blk_alloc(bset->ctx, bset->dim);
594 if (isl_blk_is_error(blk))
597 for (i = 0; i < bset->n_eq; ++i)
599 bset->eq[i]+1+bset->nparam, n, bset->dim - n);
601 for (i = 0; i < bset->n_ineq; ++i)
603 bset->ineq[i]+1+bset->nparam, n, bset->dim - n);
605 for (i = 0; i < bset->n_div; ++i)
607 bset->div[i]+1+1+bset->nparam, n, bset->dim - n);
609 isl_blk_free(bset->ctx, blk);
611 F_CLR(bset, ISL_BASIC_SET_NORMALIZED);
615 isl_basic_set_free(bset);
619 struct isl_set *isl_set_swap_vars(struct isl_set *set, unsigned n)
622 set = isl_set_cow(set);
626 for (i = 0; i < set->n; ++i) {
627 set->p[i] = isl_basic_set_swap_vars(set->p[i], n);
633 F_CLR(set, ISL_SET_NORMALIZED);
637 static void constraint_drop_vars(isl_int *c, unsigned n, unsigned rem)
639 isl_seq_cpy(c, c + n, rem);
640 isl_seq_clr(c + rem, n);
643 struct isl_basic_set *isl_basic_set_drop_dims(
644 struct isl_basic_set *bset, unsigned first, unsigned n)
651 isl_assert(bset->ctx, first + n <= bset->dim, goto error);
656 bset = isl_basic_set_cow(bset);
660 for (i = 0; i < bset->n_eq; ++i)
661 constraint_drop_vars(bset->eq[i]+1+bset->nparam+first, n,
662 (bset->dim-first-n)+bset->extra);
664 for (i = 0; i < bset->n_ineq; ++i)
665 constraint_drop_vars(bset->ineq[i]+1+bset->nparam+first, n,
666 (bset->dim-first-n)+bset->extra);
668 for (i = 0; i < bset->n_div; ++i)
669 constraint_drop_vars(bset->div[i]+1+1+bset->nparam+first, n,
670 (bset->dim-first-n)+bset->extra);
675 F_CLR(bset, ISL_BASIC_SET_NORMALIZED);
676 bset = isl_basic_set_simplify(bset);
677 return isl_basic_set_finalize(bset);
679 isl_basic_set_free(bset);
683 static struct isl_set *isl_set_drop_dims(
684 struct isl_set *set, unsigned first, unsigned n)
691 isl_assert(set->ctx, first + n <= set->dim, goto error);
695 set = isl_set_cow(set);
699 for (i = 0; i < set->n; ++i) {
700 set->p[i] = isl_basic_set_drop_dims(set->p[i], first, n);
706 F_CLR(set, ISL_SET_NORMALIZED);
713 struct isl_basic_map *isl_basic_map_drop_inputs(
714 struct isl_basic_map *bmap, unsigned first, unsigned n)
721 isl_assert(bmap->ctx, first + n <= bmap->n_in, goto error);
726 bmap = isl_basic_map_cow(bmap);
730 for (i = 0; i < bmap->n_eq; ++i)
731 constraint_drop_vars(bmap->eq[i]+1+bmap->nparam+first, n,
732 (bmap->n_in-first-n)+bmap->n_out+bmap->extra);
734 for (i = 0; i < bmap->n_ineq; ++i)
735 constraint_drop_vars(bmap->ineq[i]+1+bmap->nparam+first, n,
736 (bmap->n_in-first-n)+bmap->n_out+bmap->extra);
738 for (i = 0; i < bmap->n_div; ++i)
739 constraint_drop_vars(bmap->div[i]+1+1+bmap->nparam+first, n,
740 (bmap->n_in-first-n)+bmap->n_out+bmap->extra);
745 F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
746 bmap = isl_basic_map_simplify(bmap);
747 return isl_basic_map_finalize(bmap);
749 isl_basic_map_free(bmap);
753 static struct isl_map *isl_map_drop_inputs(
754 struct isl_map *map, unsigned first, unsigned n)
761 isl_assert(map->ctx, first + n <= map->n_in, goto error);
765 map = isl_map_cow(map);
769 for (i = 0; i < map->n; ++i) {
770 map->p[i] = isl_basic_map_drop_inputs(map->p[i], first, n);
775 F_CLR(map, ISL_MAP_NORMALIZED);
784 * We don't cow, as the div is assumed to be redundant.
786 static struct isl_basic_map *isl_basic_map_drop_div(
787 struct isl_basic_map *bmap, unsigned div)
795 pos = 1 + bmap->nparam + bmap->n_in + bmap->n_out + div;
797 isl_assert(bmap->ctx, div < bmap->n_div, goto error);
799 for (i = 0; i < bmap->n_eq; ++i)
800 constraint_drop_vars(bmap->eq[i]+pos, 1, bmap->extra-div-1);
802 for (i = 0; i < bmap->n_ineq; ++i) {
803 if (!isl_int_is_zero(bmap->ineq[i][pos])) {
804 isl_basic_map_drop_inequality(bmap, i);
808 constraint_drop_vars(bmap->ineq[i]+pos, 1, bmap->extra-div-1);
811 for (i = 0; i < bmap->n_div; ++i)
812 constraint_drop_vars(bmap->div[i]+1+pos, 1, bmap->extra-div-1);
814 if (div != bmap->n_div - 1) {
816 isl_int *t = bmap->div[div];
818 for (j = div; j < bmap->n_div - 1; ++j)
819 bmap->div[j] = bmap->div[j+1];
821 bmap->div[bmap->n_div - 1] = t;
823 F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
824 isl_basic_map_free_div(bmap, 1);
828 isl_basic_map_free(bmap);
832 static void eliminate_div(struct isl_basic_map *bmap, isl_int *eq, unsigned div)
835 unsigned pos = 1 + bmap->nparam + bmap->n_in + bmap->n_out + div;
837 len = 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
839 for (i = 0; i < bmap->n_eq; ++i)
840 if (bmap->eq[i] != eq)
841 isl_seq_elim(bmap->eq[i], eq, pos, len, NULL);
843 for (i = 0; i < bmap->n_ineq; ++i)
844 isl_seq_elim(bmap->ineq[i], eq, pos, len, NULL);
846 /* We need to be careful about circular definitions,
847 * so for now we just remove the definitions of other divs that
848 * depend on this div and (possibly) recompute them later.
850 for (i = 0; i < bmap->n_div; ++i)
851 if (!isl_int_is_zero(bmap->div[i][0]) &&
852 !isl_int_is_zero(bmap->div[i][1 + pos]))
853 isl_seq_clr(bmap->div[i], 1 + len);
855 isl_basic_map_drop_div(bmap, div);
858 struct isl_basic_map *isl_basic_map_set_to_empty(struct isl_basic_map *bmap)
864 total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
865 isl_basic_map_free_div(bmap, bmap->n_div);
866 isl_basic_map_free_inequality(bmap, bmap->n_ineq);
868 isl_basic_map_free_equality(bmap, bmap->n_eq-1);
870 isl_basic_map_alloc_equality(bmap);
874 isl_int_set_si(bmap->eq[i][0], 1);
875 isl_seq_clr(bmap->eq[i]+1, total);
876 F_SET(bmap, ISL_BASIC_MAP_EMPTY);
877 return isl_basic_map_finalize(bmap);
879 isl_basic_map_free(bmap);
883 struct isl_basic_set *isl_basic_set_set_to_empty(struct isl_basic_set *bset)
885 return (struct isl_basic_set *)
886 isl_basic_map_set_to_empty((struct isl_basic_map *)bset);
889 static void swap_equality(struct isl_basic_map *bmap, int a, int b)
891 isl_int *t = bmap->eq[a];
892 bmap->eq[a] = bmap->eq[b];
896 static void swap_inequality(struct isl_basic_map *bmap, int a, int b)
899 isl_int *t = bmap->ineq[a];
900 bmap->ineq[a] = bmap->ineq[b];
905 static void set_swap_inequality(struct isl_basic_set *bset, int a, int b)
907 swap_inequality((struct isl_basic_map *)bset, a, b);
910 static void swap_div(struct isl_basic_map *bmap, int a, int b)
913 unsigned off = bmap->nparam + bmap->n_in + bmap->n_out;
914 isl_int *t = bmap->div[a];
915 bmap->div[a] = bmap->div[b];
918 for (i = 0; i < bmap->n_eq; ++i)
919 isl_int_swap(bmap->eq[i][1+off+a], bmap->eq[i][1+off+b]);
921 for (i = 0; i < bmap->n_ineq; ++i)
922 isl_int_swap(bmap->ineq[i][1+off+a], bmap->ineq[i][1+off+b]);
924 for (i = 0; i < bmap->n_div; ++i)
925 isl_int_swap(bmap->div[i][1+1+off+a], bmap->div[i][1+1+off+b]);
926 F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
929 static void eliminate_var_using_equality(struct isl_basic_map *bmap,
930 unsigned pos, isl_int *eq, int *progress)
935 total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
936 for (k = 0; k < bmap->n_eq; ++k) {
937 if (bmap->eq[k] == eq)
939 if (isl_int_is_zero(bmap->eq[k][1+pos]))
943 isl_seq_elim(bmap->eq[k], eq, 1+pos, 1+total, NULL);
946 for (k = 0; k < bmap->n_ineq; ++k) {
947 if (isl_int_is_zero(bmap->ineq[k][1+pos]))
951 isl_seq_elim(bmap->ineq[k], eq, 1+pos, 1+total, NULL);
952 F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
955 for (k = 0; k < bmap->n_div; ++k) {
956 if (isl_int_is_zero(bmap->div[k][0]))
958 if (isl_int_is_zero(bmap->div[k][1+1+pos]))
962 isl_seq_elim(bmap->div[k]+1, eq,
963 1+pos, 1+total, &bmap->div[k][0]);
964 F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
969 struct isl_basic_map *isl_basic_map_gauss(
970 struct isl_basic_map *bmap, int *progress)
981 total_var = bmap->nparam + bmap->n_in + bmap->n_out;
982 total = total_var + bmap->n_div;
984 last_var = total - 1;
985 for (done = 0; done < bmap->n_eq; ++done) {
986 for (; last_var >= 0; --last_var) {
987 for (k = done; k < bmap->n_eq; ++k)
988 if (!isl_int_is_zero(bmap->eq[k][1+last_var]))
996 swap_equality(bmap, k, done);
997 if (isl_int_is_neg(bmap->eq[done][1+last_var]))
998 isl_seq_neg(bmap->eq[done], bmap->eq[done], 1+total);
1000 eliminate_var_using_equality(bmap, last_var, bmap->eq[done],
1003 if (last_var >= total_var &&
1004 isl_int_is_zero(bmap->div[last_var - total_var][0])) {
1005 unsigned div = last_var - total_var;
1006 isl_seq_neg(bmap->div[div]+1, bmap->eq[done], 1+total);
1007 isl_int_set_si(bmap->div[div][1+1+last_var], 0);
1008 isl_int_set(bmap->div[div][0],
1009 bmap->eq[done][1+last_var]);
1010 F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1013 if (done == bmap->n_eq)
1015 for (k = done; k < bmap->n_eq; ++k) {
1016 if (isl_int_is_zero(bmap->eq[k][0]))
1018 return isl_basic_map_set_to_empty(bmap);
1020 isl_basic_map_free_equality(bmap, bmap->n_eq-done);
1024 struct isl_basic_set *isl_basic_set_gauss(
1025 struct isl_basic_set *bset, int *progress)
1027 return (struct isl_basic_set*)isl_basic_map_gauss(
1028 (struct isl_basic_map *)bset, progress);
1031 static unsigned int round_up(unsigned int v)
1042 static int hash_index(isl_int ***index, unsigned int size, int bits,
1043 struct isl_basic_map *bmap, int k)
1046 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
1047 uint32_t hash = isl_seq_get_hash_bits(bmap->ineq[k]+1, total, bits);
1048 for (h = hash; index[h]; h = (h+1) % size)
1049 if (&bmap->ineq[k] != index[h] &&
1050 isl_seq_eq(bmap->ineq[k]+1, index[h][0]+1, total))
1055 static int set_hash_index(isl_int ***index, unsigned int size, int bits,
1056 struct isl_basic_set *bset, int k)
1058 return hash_index(index, size, bits, (struct isl_basic_map *)bset, k);
1061 static struct isl_basic_map *remove_duplicate_constraints(
1062 struct isl_basic_map *bmap, int *progress)
1068 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
1071 if (bmap->n_ineq <= 1)
1074 size = round_up(4 * (bmap->n_ineq+1) / 3 - 1);
1075 bits = ffs(size) - 1;
1076 index = isl_calloc_array(ctx, isl_int **, size);
1080 index[isl_seq_get_hash_bits(bmap->ineq[0]+1, total, bits)] = &bmap->ineq[0];
1081 for (k = 1; k < bmap->n_ineq; ++k) {
1082 h = hash_index(index, size, bits, bmap, k);
1084 index[h] = &bmap->ineq[k];
1089 l = index[h] - &bmap->ineq[0];
1090 if (isl_int_lt(bmap->ineq[k][0], bmap->ineq[l][0]))
1091 swap_inequality(bmap, k, l);
1092 isl_basic_map_drop_inequality(bmap, k);
1096 for (k = 0; k < bmap->n_ineq-1; ++k) {
1097 isl_seq_neg(bmap->ineq[k]+1, bmap->ineq[k]+1, total);
1098 h = hash_index(index, size, bits, bmap, k);
1099 isl_seq_neg(bmap->ineq[k]+1, bmap->ineq[k]+1, total);
1102 l = index[h] - &bmap->ineq[0];
1103 isl_int_add(sum, bmap->ineq[k][0], bmap->ineq[l][0]);
1104 if (isl_int_is_pos(sum))
1106 if (isl_int_is_zero(sum)) {
1107 /* We need to break out of the loop after these
1108 * changes since the contents of the hash
1109 * will no longer be valid.
1110 * Plus, we probably we want to regauss first.
1112 isl_basic_map_drop_inequality(bmap, l);
1113 isl_basic_map_inequality_to_equality(bmap, k);
1115 bmap = isl_basic_map_set_to_empty(bmap);
1124 static void compute_elimination_index(struct isl_basic_map *bmap, int *elim)
1129 total = bmap->nparam + bmap->n_in + bmap->n_out;
1130 for (d = 0; d < total; ++d)
1132 for (d = total - 1, i = 0; d >= 0 && i < bmap->n_eq; ++i) {
1133 for (; d >= 0; --d) {
1134 if (isl_int_is_zero(bmap->eq[i][1+d]))
1142 static void set_compute_elimination_index(struct isl_basic_set *bset, int *elim)
1144 return compute_elimination_index((struct isl_basic_map *)bset, elim);
1147 static int reduced_using_equalities(isl_int *dst, isl_int *src,
1148 struct isl_basic_map *bmap, int *elim)
1154 total = bmap->nparam + bmap->n_in + bmap->n_out;
1155 for (d = total - 1; d >= 0; --d) {
1156 if (isl_int_is_zero(src[1+d]))
1161 isl_seq_cpy(dst, src, 1 + total);
1164 isl_seq_elim(dst, bmap->eq[elim[d]], 1 + d, 1 + total, NULL);
1169 static int set_reduced_using_equalities(isl_int *dst, isl_int *src,
1170 struct isl_basic_set *bset, int *elim)
1172 return reduced_using_equalities(dst, src,
1173 (struct isl_basic_map *)bset, elim);
1176 /* Quick check to see if two basic maps are disjoint.
1177 * In particular, we reduce the equalities and inequalities of
1178 * one basic map in the context of the equalities of the other
1179 * basic map and check if we get a contradiction.
1181 int isl_basic_map_fast_is_disjoint(struct isl_basic_map *bmap1,
1182 struct isl_basic_map *bmap2)
1184 struct isl_vec *v = NULL;
1189 if (!bmap1 || !bmap2)
1191 isl_assert(bmap1->ctx, bmap1->nparam == bmap2->nparam, return -1);
1192 isl_assert(bmap1->ctx, bmap1->n_in == bmap2->n_in, return -1);
1193 isl_assert(bmap1->ctx, bmap1->n_out == bmap2->n_out, return -1);
1194 if (bmap1->n_div || bmap2->n_div)
1196 if (!bmap1->n_eq && !bmap2->n_eq)
1199 total = bmap1->nparam + bmap1->n_in + bmap1->n_out;
1202 v = isl_vec_alloc(bmap1->ctx, 1 + total);
1205 elim = isl_alloc_array(bmap1->ctx, int, total);
1208 compute_elimination_index(bmap1, elim);
1209 for (i = 0; i < bmap2->n_eq; ++i) {
1211 reduced = reduced_using_equalities(v->block.data, bmap2->eq[i],
1213 if (reduced && !isl_int_is_zero(v->block.data[0]) &&
1214 isl_seq_first_non_zero(v->block.data + 1, total) == -1)
1217 for (i = 0; i < bmap2->n_ineq; ++i) {
1219 reduced = reduced_using_equalities(v->block.data,
1220 bmap2->ineq[i], bmap1, elim);
1221 if (reduced && isl_int_is_neg(v->block.data[0]) &&
1222 isl_seq_first_non_zero(v->block.data + 1, total) == -1)
1225 compute_elimination_index(bmap2, elim);
1226 for (i = 0; i < bmap1->n_ineq; ++i) {
1228 reduced = reduced_using_equalities(v->block.data,
1229 bmap1->ineq[i], bmap2, elim);
1230 if (reduced && isl_int_is_neg(v->block.data[0]) &&
1231 isl_seq_first_non_zero(v->block.data + 1, total) == -1)
1234 isl_vec_free(bmap1->ctx, v);
1238 isl_vec_free(bmap1->ctx, v);
1242 isl_vec_free(bmap1->ctx, v);
1247 int isl_basic_set_fast_is_disjoint(struct isl_basic_set *bset1,
1248 struct isl_basic_set *bset2)
1250 return isl_basic_map_fast_is_disjoint((struct isl_basic_map *)bset1,
1251 (struct isl_basic_map *)bset2);
1254 int isl_map_fast_is_disjoint(struct isl_map *map1, struct isl_map *map2)
1261 if (isl_map_fast_is_equal(map1, map2))
1264 for (i = 0; i < map1->n; ++i) {
1265 for (j = 0; j < map2->n; ++j) {
1266 int d = isl_basic_map_fast_is_disjoint(map1->p[i],
1275 int isl_set_fast_is_disjoint(struct isl_set *set1, struct isl_set *set2)
1277 return isl_map_fast_is_disjoint((struct isl_map *)set1,
1278 (struct isl_map *)set2);
1281 static struct isl_basic_map *remove_duplicate_divs(
1282 struct isl_basic_map *bmap, int *progress)
1289 unsigned total_var = bmap->nparam + bmap->n_in + bmap->n_out;
1290 unsigned total = total_var + bmap->n_div;
1291 struct isl_ctx *ctx;
1293 if (bmap->n_div <= 1)
1297 for (k = bmap->n_div - 1; k >= 0; --k)
1298 if (!isl_int_is_zero(bmap->div[k][0]))
1303 size = round_up(4 * bmap->n_div / 3 - 1);
1304 bits = ffs(size) - 1;
1305 index = isl_calloc_array(ctx, int, size);
1308 eq = isl_blk_alloc(ctx, 1+total);
1309 if (isl_blk_is_error(eq))
1312 isl_seq_clr(eq.data, 1+total);
1313 index[isl_seq_get_hash_bits(bmap->div[k], 2+total, bits)] = k + 1;
1314 for (--k; k >= 0; --k) {
1317 if (isl_int_is_zero(bmap->div[k][0]))
1320 hash = isl_seq_get_hash_bits(bmap->div[k], 2+total, bits);
1321 for (h = hash; index[h]; h = (h+1) % size)
1322 if (isl_seq_eq(bmap->div[k],
1323 bmap->div[index[h]-1], 2+total))
1328 isl_int_set_si(eq.data[1+total_var+k], -1);
1329 isl_int_set_si(eq.data[1+total_var+l], 1);
1330 eliminate_div(bmap, eq.data, l);
1331 isl_int_set_si(eq.data[1+total_var+k], 0);
1332 isl_int_set_si(eq.data[1+total_var+l], 0);
1337 isl_blk_free(ctx, eq);
1343 /* Elimininate divs based on equalities
1345 static struct isl_basic_map *eliminate_divs_eq(
1346 struct isl_basic_map *bmap, int *progress)
1356 off = 1 + bmap->nparam + bmap->n_in + bmap->n_out;
1358 for (d = bmap->n_div - 1; d >= 0 ; --d) {
1359 for (i = 0; i < bmap->n_eq; ++i) {
1360 if (!isl_int_is_one(bmap->eq[i][off + d]) &&
1361 !isl_int_is_negone(bmap->eq[i][off + d]))
1365 eliminate_div(bmap, bmap->eq[i], d);
1366 isl_basic_map_drop_equality(bmap, i);
1371 return eliminate_divs_eq(bmap, progress);
1375 static struct isl_basic_map *normalize_constraints(struct isl_basic_map *bmap)
1379 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
1382 for (i = bmap->n_eq - 1; i >= 0; --i) {
1383 isl_seq_gcd(bmap->eq[i]+1, total, &gcd);
1384 if (isl_int_is_zero(gcd)) {
1385 if (!isl_int_is_zero(bmap->eq[i][0])) {
1386 bmap = isl_basic_map_set_to_empty(bmap);
1389 isl_basic_map_drop_equality(bmap, i);
1392 if (F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL))
1393 isl_int_gcd(gcd, gcd, bmap->eq[i][0]);
1394 if (isl_int_is_one(gcd))
1396 if (!isl_int_is_divisible_by(bmap->eq[i][0], gcd)) {
1397 bmap = isl_basic_map_set_to_empty(bmap);
1400 isl_seq_scale_down(bmap->eq[i], bmap->eq[i], gcd, 1+total);
1403 for (i = bmap->n_ineq - 1; i >= 0; --i) {
1404 isl_seq_gcd(bmap->ineq[i]+1, total, &gcd);
1405 if (isl_int_is_zero(gcd)) {
1406 if (isl_int_is_neg(bmap->ineq[i][0])) {
1407 bmap = isl_basic_map_set_to_empty(bmap);
1410 isl_basic_map_drop_inequality(bmap, i);
1413 if (F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL))
1414 isl_int_gcd(gcd, gcd, bmap->ineq[i][0]);
1415 if (isl_int_is_one(gcd))
1417 isl_int_fdiv_q(bmap->ineq[i][0], bmap->ineq[i][0], gcd);
1418 isl_seq_scale_down(bmap->ineq[i]+1, bmap->ineq[i]+1, gcd, total);
1426 /* Eliminate the specified variables from the constraints using
1427 * Fourier-Motzkin. The variables themselves are not removed.
1429 struct isl_basic_map *isl_basic_map_eliminate_vars(
1430 struct isl_basic_map *bmap, int pos, unsigned n)
1440 total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
1442 bmap = isl_basic_map_cow(bmap);
1443 for (d = pos + n - 1; d >= pos; --d) {
1444 int n_lower, n_upper;
1447 for (i = 0; i < bmap->n_eq; ++i) {
1448 if (isl_int_is_zero(bmap->eq[i][1+d]))
1450 eliminate_var_using_equality(bmap, d, bmap->eq[i], NULL);
1451 isl_basic_map_drop_equality(bmap, i);
1458 for (i = 0; i < bmap->n_ineq; ++i) {
1459 if (isl_int_is_pos(bmap->ineq[i][1+d]))
1461 else if (isl_int_is_neg(bmap->ineq[i][1+d]))
1464 bmap = isl_basic_map_extend(bmap,
1465 bmap->nparam, bmap->n_in, bmap->n_out, 0,
1466 0, n_lower * n_upper);
1467 for (i = bmap->n_ineq - 1; i >= 0; --i) {
1469 if (isl_int_is_zero(bmap->ineq[i][1+d]))
1472 for (j = 0; j < i; ++j) {
1473 if (isl_int_is_zero(bmap->ineq[j][1+d]))
1476 if (isl_int_sgn(bmap->ineq[i][1+d]) ==
1477 isl_int_sgn(bmap->ineq[j][1+d]))
1479 k = isl_basic_map_alloc_inequality(bmap);
1482 isl_seq_cpy(bmap->ineq[k], bmap->ineq[i],
1484 isl_seq_elim(bmap->ineq[k], bmap->ineq[j],
1485 1+d, 1+total, NULL);
1487 isl_basic_map_drop_inequality(bmap, i);
1490 if (n_lower > 0 && n_upper > 0) {
1491 bmap = normalize_constraints(bmap);
1492 bmap = remove_duplicate_constraints(bmap, NULL);
1493 bmap = isl_basic_map_gauss(bmap, NULL);
1494 bmap = isl_basic_map_convex_hull(bmap);
1497 if (F_ISSET(bmap, ISL_BASIC_MAP_EMPTY))
1501 F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1504 isl_basic_map_free(bmap);
1508 struct isl_basic_set *isl_basic_set_eliminate_vars(
1509 struct isl_basic_set *bset, unsigned pos, unsigned n)
1511 return (struct isl_basic_set *)isl_basic_map_eliminate_vars(
1512 (struct isl_basic_map *)bset, pos, n);
1515 /* Eliminate the specified n dimensions starting at first from the
1516 * constraints using Fourier-Motzkin, The dimensions themselves
1519 struct isl_set *isl_set_eliminate_dims(struct isl_set *set,
1520 unsigned first, unsigned n)
1529 set = isl_set_cow(set);
1532 isl_assert(set->ctx, first+n <= set->dim, goto error);
1534 for (i = 0; i < set->n; ++i) {
1535 set->p[i] = isl_basic_set_eliminate_vars(set->p[i],
1536 set->nparam + first, n);
1546 /* Project out n dimensions starting at first using Fourier-Motzkin */
1547 struct isl_set *isl_set_remove_dims(struct isl_set *set,
1548 unsigned first, unsigned n)
1550 set = isl_set_eliminate_dims(set, first, n);
1551 set = isl_set_drop_dims(set, first, n);
1555 struct isl_basic_set *isl_basic_set_remove_divs(struct isl_basic_set *bset)
1557 bset = isl_basic_set_eliminate_vars(bset, bset->nparam + bset->dim,
1565 struct isl_set *isl_set_remove_divs(struct isl_set *set)
1574 set = isl_set_cow(set);
1578 for (i = 0; i < set->n; ++i) {
1579 set->p[i] = isl_basic_set_remove_divs(set->p[i]);
1589 /* Project out n inputs starting at first using Fourier-Motzkin */
1590 struct isl_map *isl_map_remove_inputs(struct isl_map *map,
1591 unsigned first, unsigned n)
1598 map = isl_map_cow(map);
1601 isl_assert(map->ctx, first+n <= map->n_in, goto error);
1603 for (i = 0; i < map->n; ++i) {
1604 map->p[i] = isl_basic_map_eliminate_vars(map->p[i],
1605 map->nparam + first, n);
1609 map = isl_map_drop_inputs(map, first, n);
1616 /* Project out n dimensions starting at first using Fourier-Motzkin */
1617 struct isl_basic_set *isl_basic_set_remove_dims(struct isl_basic_set *bset,
1618 unsigned first, unsigned n)
1620 bset = isl_basic_set_eliminate_vars(bset, bset->nparam + first, n);
1621 bset = isl_basic_set_drop_dims(bset, first, n);
1625 /* Elimininate divs based on inequalities
1627 static struct isl_basic_map *eliminate_divs_ineq(
1628 struct isl_basic_map *bmap, int *progress)
1633 struct isl_ctx *ctx;
1639 off = 1 + bmap->nparam + bmap->n_in + bmap->n_out;
1641 for (d = bmap->n_div - 1; d >= 0 ; --d) {
1642 for (i = 0; i < bmap->n_eq; ++i)
1643 if (!isl_int_is_zero(bmap->eq[i][off + d]))
1647 for (i = 0; i < bmap->n_ineq; ++i)
1648 if (isl_int_abs_gt(bmap->ineq[i][off + d], ctx->one))
1650 if (i < bmap->n_ineq)
1653 bmap = isl_basic_map_eliminate_vars(bmap, (off-1)+d, 1);
1654 if (F_ISSET(bmap, ISL_BASIC_MAP_EMPTY))
1656 bmap = isl_basic_map_drop_div(bmap, d);
1663 struct isl_basic_map *isl_basic_map_simplify(struct isl_basic_map *bmap)
1670 bmap = normalize_constraints(bmap);
1671 bmap = eliminate_divs_eq(bmap, &progress);
1672 bmap = eliminate_divs_ineq(bmap, &progress);
1673 bmap = isl_basic_map_gauss(bmap, &progress);
1674 bmap = remove_duplicate_divs(bmap, &progress);
1675 bmap = remove_duplicate_constraints(bmap, &progress);
1680 struct isl_basic_set *isl_basic_set_simplify(struct isl_basic_set *bset)
1682 return (struct isl_basic_set *)
1683 isl_basic_map_simplify((struct isl_basic_map *)bset);
1686 static void dump_term(struct isl_basic_map *bmap,
1687 isl_int c, int pos, FILE *out)
1689 unsigned in = bmap->n_in;
1690 unsigned dim = bmap->n_in + bmap->n_out;
1692 isl_int_print(out, c, 0);
1694 if (!isl_int_is_one(c))
1695 isl_int_print(out, c, 0);
1696 if (pos < 1 + bmap->nparam)
1697 fprintf(out, "p%d", pos - 1);
1698 else if (pos < 1 + bmap->nparam + in)
1699 fprintf(out, "i%d", pos - 1 - bmap->nparam);
1700 else if (pos < 1 + bmap->nparam + dim)
1701 fprintf(out, "o%d", pos - 1 - bmap->nparam - in);
1703 fprintf(out, "e%d", pos - 1 - bmap->nparam - dim);
1707 static void dump_constraint_sign(struct isl_basic_map *bmap, isl_int *c,
1708 int sign, FILE *out)
1712 unsigned len = 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
1716 for (i = 0, first = 1; i < len; ++i) {
1717 if (isl_int_sgn(c[i]) * sign <= 0)
1720 fprintf(out, " + ");
1722 isl_int_abs(v, c[i]);
1723 dump_term(bmap, v, i, out);
1730 static void dump_constraint(struct isl_basic_map *bmap, isl_int *c,
1731 const char *op, FILE *out, int indent)
1735 fprintf(out, "%*s", indent, "");
1737 dump_constraint_sign(bmap, c, 1, out);
1738 fprintf(out, " %s ", op);
1739 dump_constraint_sign(bmap, c, -1, out);
1743 for (i = bmap->n_div; i < bmap->extra; ++i) {
1744 if (isl_int_is_zero(c[1+bmap->nparam+bmap->n_in+bmap->n_out+i]))
1746 fprintf(out, "%*s", indent, "");
1747 fprintf(out, "ERROR: unused div coefficient not zero\n");
1751 static void dump_constraints(struct isl_basic_map *bmap,
1752 isl_int **c, unsigned n,
1753 const char *op, FILE *out, int indent)
1757 for (i = 0; i < n; ++i)
1758 dump_constraint(bmap, c[i], op, out, indent);
1761 static void dump_affine(struct isl_basic_map *bmap, isl_int *exp, FILE *out)
1765 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
1767 for (j = 0; j < 1 + total; ++j) {
1768 if (isl_int_is_zero(exp[j]))
1770 if (!first && isl_int_is_pos(exp[j]))
1772 dump_term(bmap, exp[j], j, out);
1777 static void dump(struct isl_basic_map *bmap, FILE *out, int indent)
1781 dump_constraints(bmap, bmap->eq, bmap->n_eq, "=", out, indent);
1782 dump_constraints(bmap, bmap->ineq, bmap->n_ineq, ">=", out, indent);
1784 for (i = 0; i < bmap->n_div; ++i) {
1785 fprintf(out, "%*s", indent, "");
1786 fprintf(out, "e%d = [(", i);
1787 dump_affine(bmap, bmap->div[i]+1, out);
1789 isl_int_print(out, bmap->div[i][0], 0);
1790 fprintf(out, "]\n");
1794 void isl_basic_set_dump(struct isl_basic_set *bset, FILE *out, int indent)
1797 fprintf(out, "null basic set\n");
1801 fprintf(out, "%*s", indent, "");
1802 fprintf(out, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n",
1803 bset->ref, bset->nparam, bset->dim, bset->extra,
1805 dump((struct isl_basic_map *)bset, out, indent);
1808 void isl_basic_map_dump(struct isl_basic_map *bmap, FILE *out, int indent)
1811 fprintf(out, "null basic map\n");
1815 fprintf(out, "%*s", indent, "");
1816 fprintf(out, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, flags: %x\n",
1818 bmap->nparam, bmap->n_in, bmap->n_out, bmap->extra, bmap->flags);
1819 dump(bmap, out, indent);
1822 int isl_inequality_negate(struct isl_basic_map *bmap, unsigned pos)
1824 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
1827 isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
1828 isl_seq_neg(bmap->ineq[pos], bmap->ineq[pos], 1 + total);
1829 isl_int_sub_ui(bmap->ineq[pos][0], bmap->ineq[pos][0], 1);
1830 F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1834 struct isl_set *isl_set_alloc(struct isl_ctx *ctx,
1835 unsigned nparam, unsigned dim, int n, unsigned flags)
1837 struct isl_set *set;
1839 isl_assert(ctx, n >= 0, return NULL);
1840 set = isl_alloc(ctx, struct isl_set,
1841 sizeof(struct isl_set) +
1842 n * sizeof(struct isl_basic_set *));
1851 set->nparam = nparam;
1858 struct isl_set *isl_set_dup(struct isl_set *set)
1861 struct isl_set *dup;
1866 dup = isl_set_alloc(set->ctx, set->nparam, set->dim, set->n, set->flags);
1869 for (i = 0; i < set->n; ++i)
1870 dup = isl_set_add(dup, isl_basic_set_copy(set->p[i]));
1874 struct isl_set *isl_set_from_basic_set(struct isl_basic_set *bset)
1876 struct isl_set *set;
1881 set = isl_set_alloc(bset->ctx, bset->nparam, bset->dim, 1, ISL_MAP_DISJOINT);
1883 isl_basic_set_free(bset);
1886 return isl_set_add(set, bset);
1889 struct isl_map *isl_map_from_basic_map(struct isl_basic_map *bmap)
1891 struct isl_map *map;
1896 map = isl_map_alloc(bmap->ctx, bmap->nparam, bmap->n_in, bmap->n_out, 1,
1899 isl_basic_map_free(bmap);
1902 return isl_map_add(map, bmap);
1905 struct isl_set *isl_set_add(struct isl_set *set, struct isl_basic_set *bset)
1909 isl_assert(set->ctx, set->nparam == bset->nparam, goto error);
1910 isl_assert(set->ctx, set->dim == bset->dim, goto error);
1911 isl_assert(set->ctx, set->n < set->size, goto error);
1912 set->p[set->n] = bset;
1919 isl_basic_set_free(bset);
1923 void isl_set_free(struct isl_set *set)
1933 isl_ctx_deref(set->ctx);
1934 for (i = 0; i < set->n; ++i)
1935 isl_basic_set_free(set->p[i]);
1939 void isl_set_dump(struct isl_set *set, FILE *out, int indent)
1944 fprintf(out, "null set\n");
1948 fprintf(out, "%*s", indent, "");
1949 fprintf(out, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
1950 set->ref, set->n, set->nparam, set->dim, set->flags);
1951 for (i = 0; i < set->n; ++i) {
1952 fprintf(out, "%*s", indent, "");
1953 fprintf(out, "basic set %d:\n", i);
1954 isl_basic_set_dump(set->p[i], out, indent+4);
1958 void isl_map_dump(struct isl_map *map, FILE *out, int indent)
1963 fprintf(out, "null map\n");
1967 fprintf(out, "%*s", indent, "");
1968 fprintf(out, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, flags: %x\n",
1969 map->ref, map->n, map->nparam, map->n_in, map->n_out,
1971 for (i = 0; i < map->n; ++i) {
1972 fprintf(out, "%*s", indent, "");
1973 fprintf(out, "basic map %d:\n", i);
1974 isl_basic_map_dump(map->p[i], out, indent+4);
1978 struct isl_basic_map *isl_basic_map_intersect_domain(
1979 struct isl_basic_map *bmap, struct isl_basic_set *bset)
1981 struct isl_basic_map *bmap_domain;
1986 isl_assert(bset->ctx, bset->dim == bmap->n_in, goto error);
1987 isl_assert(bset->ctx, bset->nparam == bmap->nparam, goto error);
1989 bmap = isl_basic_map_extend(bmap,
1990 bset->nparam, bmap->n_in, bmap->n_out,
1991 bset->n_div, bset->n_eq, bset->n_ineq);
1994 bmap_domain = isl_basic_map_from_basic_set(bset,
1996 bmap = add_constraints(bmap, bmap_domain, 0, 0);
1998 bmap = isl_basic_map_simplify(bmap);
1999 return isl_basic_map_finalize(bmap);
2001 isl_basic_map_free(bmap);
2002 isl_basic_set_free(bset);
2006 struct isl_basic_map *isl_basic_map_intersect_range(
2007 struct isl_basic_map *bmap, struct isl_basic_set *bset)
2009 struct isl_basic_map *bmap_range;
2014 isl_assert(bset->ctx, bset->dim == bmap->n_out, goto error);
2015 isl_assert(bset->ctx, bset->nparam == bmap->nparam, goto error);
2017 bmap = isl_basic_map_extend(bmap,
2018 bset->nparam, bmap->n_in, bmap->n_out,
2019 bset->n_div, bset->n_eq, bset->n_ineq);
2022 bmap_range = isl_basic_map_from_basic_set(bset,
2024 bmap = add_constraints(bmap, bmap_range, 0, 0);
2026 bmap = isl_basic_map_simplify(bmap);
2027 return isl_basic_map_finalize(bmap);
2029 isl_basic_map_free(bmap);
2030 isl_basic_set_free(bset);
2034 struct isl_basic_map *isl_basic_map_intersect(
2035 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2037 if (!bmap1 || !bmap2)
2040 isl_assert(bmap1->ctx, bmap1->nparam == bmap2->nparam, goto error);
2041 isl_assert(bmap1->ctx, bmap1->n_in == bmap2->n_in, goto error);
2042 isl_assert(bmap1->ctx, bmap1->n_out == bmap2->n_out, goto error);
2044 bmap1 = isl_basic_map_extend(bmap1,
2045 bmap1->nparam, bmap1->n_in, bmap1->n_out,
2046 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
2049 bmap1 = add_constraints(bmap1, bmap2, 0, 0);
2051 bmap1 = isl_basic_map_simplify(bmap1);
2052 return isl_basic_map_finalize(bmap1);
2054 isl_basic_map_free(bmap1);
2055 isl_basic_map_free(bmap2);
2059 struct isl_basic_set *isl_basic_set_intersect(
2060 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
2062 return (struct isl_basic_set *)
2063 isl_basic_map_intersect(
2064 (struct isl_basic_map *)bset1,
2065 (struct isl_basic_map *)bset2);
2068 struct isl_map *isl_map_intersect(struct isl_map *map1, struct isl_map *map2)
2071 struct isl_map *result;
2077 if (F_ISSET(map1, ISL_MAP_DISJOINT) &&
2078 F_ISSET(map2, ISL_MAP_DISJOINT))
2079 FL_SET(flags, ISL_MAP_DISJOINT);
2081 result = isl_map_alloc(map1->ctx, map1->nparam, map1->n_in, map1->n_out,
2082 map1->n * map2->n, flags);
2085 for (i = 0; i < map1->n; ++i)
2086 for (j = 0; j < map2->n; ++j) {
2087 struct isl_basic_map *part;
2088 part = isl_basic_map_intersect(
2089 isl_basic_map_copy(map1->p[i]),
2090 isl_basic_map_copy(map2->p[j]));
2091 if (isl_basic_map_is_empty(part))
2092 isl_basic_map_free(part);
2094 result = isl_map_add(result, part);
2107 struct isl_set *isl_set_intersect(struct isl_set *set1, struct isl_set *set2)
2109 return (struct isl_set *)
2110 isl_map_intersect((struct isl_map *)set1,
2111 (struct isl_map *)set2);
2114 struct isl_basic_map *isl_basic_map_reverse(struct isl_basic_map *bmap)
2116 struct isl_basic_set *bset;
2121 bmap = isl_basic_map_cow(bmap);
2125 bset = isl_basic_set_from_basic_map(bmap);
2126 bset = isl_basic_set_swap_vars(bset, in);
2127 return isl_basic_map_from_basic_set(bset, bset->dim-in, in);
2130 /* Turn final n dimensions into existentially quantified variables.
2132 struct isl_basic_set *isl_basic_set_project_out(
2133 struct isl_basic_set *bset, unsigned n, unsigned flags)
2143 isl_assert(bset->ctx, n <= bset->dim, goto error);
2148 bset = isl_basic_set_cow(bset);
2150 row_size = 1 + bset->nparam + bset->dim + bset->extra;
2151 old = bset->block2.data;
2152 bset->block2 = isl_blk_extend(bset->ctx, bset->block2,
2153 (bset->extra + n) * (1 + row_size));
2154 if (!bset->block2.data)
2156 new_div = isl_alloc_array(ctx, isl_int *, bset->extra + n);
2159 for (i = 0; i < n; ++i) {
2160 new_div[i] = bset->block2.data +
2161 (bset->extra + i) * (1 + row_size);
2162 isl_seq_clr(new_div[i], 1 + row_size);
2164 for (i = 0; i < bset->extra; ++i)
2165 new_div[n + i] = bset->block2.data + (bset->div[i] - old);
2167 bset->div = new_div;
2171 bset = isl_basic_set_simplify(bset);
2172 return isl_basic_set_finalize(bset);
2174 isl_basic_set_free(bset);
2178 struct isl_basic_map *isl_basic_map_apply_range(
2179 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2181 struct isl_basic_set *bset;
2182 unsigned n_in, n_out;
2184 if (!bmap1 || !bmap2)
2187 isl_assert(bmap->ctx, bmap1->n_out == bmap2->n_in, goto error);
2188 isl_assert(bmap->ctx, bmap1->nparam == bmap2->nparam, goto error);
2191 n_out = bmap2->n_out;
2193 bmap2 = isl_basic_map_reverse(bmap2);
2196 bmap1 = isl_basic_map_extend(bmap1, bmap1->nparam,
2197 bmap1->n_in + bmap2->n_in, bmap1->n_out,
2198 bmap2->extra, bmap2->n_eq, bmap2->n_ineq);
2201 bmap1 = add_constraints(bmap1, bmap2, bmap1->n_in - bmap2->n_in, 0);
2202 bmap1 = isl_basic_map_simplify(bmap1);
2203 bset = isl_basic_set_from_basic_map(bmap1);
2204 bset = isl_basic_set_project_out(bset,
2205 bset->dim - (n_in + n_out), 0);
2206 return isl_basic_map_from_basic_set(bset, n_in, n_out);
2208 isl_basic_map_free(bmap1);
2209 isl_basic_map_free(bmap2);
2213 struct isl_basic_set *isl_basic_set_apply(
2214 struct isl_basic_set *bset, struct isl_basic_map *bmap)
2219 isl_assert(bset->ctx, bset->dim == bmap->n_in, goto error);
2221 return (struct isl_basic_set *)
2222 isl_basic_map_apply_range((struct isl_basic_map *)bset, bmap);
2224 isl_basic_set_free(bset);
2225 isl_basic_map_free(bmap);
2229 struct isl_basic_map *isl_basic_map_apply_domain(
2230 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2232 if (!bmap1 || !bmap2)
2235 isl_assert(ctx, bmap1->n_in == bmap2->n_in, goto error);
2236 isl_assert(ctx, bmap1->nparam == bmap2->nparam, goto error);
2238 bmap1 = isl_basic_map_reverse(bmap1);
2239 bmap1 = isl_basic_map_apply_range(bmap1, bmap2);
2240 return isl_basic_map_reverse(bmap1);
2242 isl_basic_map_free(bmap1);
2243 isl_basic_map_free(bmap2);
2247 static struct isl_basic_map *var_equal(struct isl_ctx *ctx,
2248 struct isl_basic_map *bmap, unsigned pos)
2251 i = isl_basic_map_alloc_equality(bmap);
2254 isl_seq_clr(bmap->eq[i],
2255 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div);
2256 isl_int_set_si(bmap->eq[i][1+bmap->nparam+pos], -1);
2257 isl_int_set_si(bmap->eq[i][1+bmap->nparam+bmap->n_in+pos], 1);
2258 return isl_basic_map_finalize(bmap);
2260 isl_basic_map_free(bmap);
2264 static struct isl_basic_map *var_more(struct isl_ctx *ctx,
2265 struct isl_basic_map *bmap, unsigned pos)
2268 i = isl_basic_map_alloc_inequality(bmap);
2271 isl_seq_clr(bmap->ineq[i],
2272 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div);
2273 isl_int_set_si(bmap->ineq[i][0], -1);
2274 isl_int_set_si(bmap->ineq[i][1+bmap->nparam+pos], -1);
2275 isl_int_set_si(bmap->ineq[i][1+bmap->nparam+bmap->n_in+pos], 1);
2276 return isl_basic_map_finalize(bmap);
2278 isl_basic_map_free(bmap);
2282 static struct isl_basic_map *var_less(struct isl_ctx *ctx,
2283 struct isl_basic_map *bmap, unsigned pos)
2286 i = isl_basic_map_alloc_inequality(bmap);
2289 isl_seq_clr(bmap->ineq[i],
2290 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div);
2291 isl_int_set_si(bmap->ineq[i][0], -1);
2292 isl_int_set_si(bmap->ineq[i][1+bmap->nparam+pos], 1);
2293 isl_int_set_si(bmap->ineq[i][1+bmap->nparam+bmap->n_in+pos], -1);
2294 return isl_basic_map_finalize(bmap);
2296 isl_basic_map_free(bmap);
2300 struct isl_basic_map *isl_basic_map_equal(struct isl_ctx *ctx,
2301 unsigned nparam, unsigned in, unsigned out, unsigned n_equal)
2304 struct isl_basic_map *bmap;
2305 bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, n_equal, 0);
2308 for (i = 0; i < n_equal && bmap; ++i)
2309 bmap = var_equal(ctx, bmap, i);
2310 return isl_basic_map_finalize(bmap);
2313 struct isl_basic_map *isl_basic_map_less_at(struct isl_ctx *ctx,
2314 unsigned nparam, unsigned in, unsigned out, unsigned pos)
2317 struct isl_basic_map *bmap;
2318 bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, pos, 1);
2321 for (i = 0; i < pos && bmap; ++i)
2322 bmap = var_equal(ctx, bmap, i);
2324 bmap = var_less(ctx, bmap, pos);
2325 return isl_basic_map_finalize(bmap);
2328 struct isl_basic_map *isl_basic_map_more_at(struct isl_ctx *ctx,
2329 unsigned nparam, unsigned in, unsigned out, unsigned pos)
2332 struct isl_basic_map *bmap;
2333 bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, pos, 1);
2336 for (i = 0; i < pos && bmap; ++i)
2337 bmap = var_equal(ctx, bmap, i);
2339 bmap = var_more(ctx, bmap, pos);
2340 return isl_basic_map_finalize(bmap);
2343 struct isl_basic_map *isl_basic_map_from_basic_set(
2344 struct isl_basic_set *bset, unsigned n_in, unsigned n_out)
2346 struct isl_basic_map *bmap;
2348 bset = isl_basic_set_cow(bset);
2352 isl_assert(ctx, bset->dim == n_in + n_out, goto error);
2353 bmap = (struct isl_basic_map *) bset;
2355 bmap->n_out = n_out;
2356 return isl_basic_map_finalize(bmap);
2358 isl_basic_set_free(bset);
2362 struct isl_basic_set *isl_basic_set_from_basic_map(struct isl_basic_map *bmap)
2366 if (bmap->n_in == 0)
2367 return (struct isl_basic_set *)bmap;
2368 bmap = isl_basic_map_cow(bmap);
2371 bmap->n_out += bmap->n_in;
2373 bmap = isl_basic_map_finalize(bmap);
2374 return (struct isl_basic_set *)bmap;
2379 /* For a div d = floor(f/m), add the constraints
2382 * -(f-(n-1)) + m d >= 0
2384 * Note that the second constraint is the negation of
2388 static int add_div_constraints(struct isl_basic_map *bmap, unsigned div)
2391 unsigned div_pos = 1 + bmap->nparam + bmap->n_in + bmap->n_out + div;
2392 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
2394 i = isl_basic_map_alloc_inequality(bmap);
2397 isl_seq_cpy(bmap->ineq[i], bmap->div[div]+1, 1+total);
2398 isl_int_neg(bmap->ineq[i][div_pos], bmap->div[div][0]);
2400 j = isl_basic_map_alloc_inequality(bmap);
2403 isl_seq_neg(bmap->ineq[j], bmap->ineq[i], 1 + total);
2404 isl_int_add(bmap->ineq[j][0], bmap->ineq[j][0], bmap->ineq[j][div_pos]);
2405 isl_int_sub_ui(bmap->ineq[j][0], bmap->ineq[j][0], 1);
2409 struct isl_basic_set *isl_basic_map_underlying_set(
2410 struct isl_basic_map *bmap)
2414 if (bmap->nparam == 0 && bmap->n_in == 0 && bmap->n_div == 0)
2415 return (struct isl_basic_set *)bmap;
2416 bmap = isl_basic_map_cow(bmap);
2419 bmap->n_out += bmap->nparam + bmap->n_in + bmap->n_div;
2422 bmap->extra -= bmap->n_div;
2424 bmap = isl_basic_map_finalize(bmap);
2425 return (struct isl_basic_set *)bmap;
2430 struct isl_basic_map *isl_basic_map_overlying_set(
2431 struct isl_basic_set *bset, struct isl_basic_map *like)
2433 struct isl_basic_map *bmap;
2434 struct isl_ctx *ctx;
2441 isl_assert(ctx, bset->dim ==
2442 like->nparam + like->n_in + like->n_out + like->n_div,
2444 if (like->nparam == 0 && like->n_in == 0 && like->n_div == 0) {
2445 isl_basic_map_free(like);
2446 return (struct isl_basic_map *)bset;
2448 bset = isl_basic_set_cow(bset);
2451 total = bset->dim + bset->extra;
2452 bmap = (struct isl_basic_map *)bset;
2453 bmap->nparam = like->nparam;
2454 bmap->n_in = like->n_in;
2455 bmap->n_out = like->n_out;
2456 bmap->extra += like->n_div;
2459 ltotal = total - bmap->extra + like->extra;
2462 bmap->block2 = isl_blk_extend(ctx, bmap->block2,
2463 bmap->extra * (1 + 1 + total));
2464 if (isl_blk_is_error(bmap->block2))
2466 bmap->div = isl_realloc_array(ctx, bmap->div, isl_int *,
2470 bmap = isl_basic_map_extend(bmap, bmap->nparam,
2471 bmap->n_in, bmap->n_out, 0, 0, 2 * like->n_div);
2472 for (i = 0; i < like->n_div; ++i) {
2473 k = isl_basic_map_alloc_div(bmap);
2476 isl_seq_cpy(bmap->div[k], like->div[i], 1 + 1 + ltotal);
2477 isl_seq_clr(bmap->div[k]+1+1+ltotal, total - ltotal);
2478 if (add_div_constraints(bmap, k) < 0)
2482 isl_basic_map_free(like);
2483 bmap = isl_basic_map_finalize(bmap);
2486 isl_basic_map_free(like);
2487 isl_basic_set_free(bset);
2491 struct isl_basic_set *isl_basic_set_from_underlying_set(
2492 struct isl_basic_set *bset, struct isl_basic_set *like)
2494 return (struct isl_basic_set *)
2495 isl_basic_map_overlying_set(bset, (struct isl_basic_map *)like);
2498 struct isl_set *isl_set_from_underlying_set(
2499 struct isl_set *set, struct isl_basic_set *like)
2505 isl_assert(set->ctx, set->dim == like->nparam + like->dim + like->n_div,
2507 if (like->nparam == 0 && like->n_div == 0) {
2508 isl_basic_set_free(like);
2511 set = isl_set_cow(set);
2514 for (i = 0; i < set->n; ++i) {
2515 set->p[i] = isl_basic_set_from_underlying_set(set->p[i],
2516 isl_basic_set_copy(like));
2520 set->nparam = like->nparam;
2521 set->dim = like->dim;
2522 isl_basic_set_free(like);
2525 isl_basic_set_free(like);
2530 struct isl_set *isl_map_underlying_set(struct isl_map *map)
2534 map = isl_map_align_divs(map);
2535 map = isl_map_cow(map);
2539 for (i = 0; i < map->n; ++i) {
2540 map->p[i] = (struct isl_basic_map *)
2541 isl_basic_map_underlying_set(map->p[i]);
2546 map->n_out += map->nparam + map->n_in;
2548 map->n_out = map->p[0]->n_out;
2551 return (struct isl_set *)map;
2557 struct isl_set *isl_set_to_underlying_set(struct isl_set *set)
2559 return (struct isl_set *)isl_map_underlying_set((struct isl_map *)set);
2562 struct isl_basic_set *isl_basic_map_domain(struct isl_basic_map *bmap)
2564 struct isl_basic_set *domain;
2568 n_out = bmap->n_out;
2569 domain = isl_basic_set_from_basic_map(bmap);
2570 return isl_basic_set_project_out(domain, n_out, 0);
2573 struct isl_basic_set *isl_basic_map_range(struct isl_basic_map *bmap)
2575 return isl_basic_map_domain(isl_basic_map_reverse(bmap));
2578 struct isl_set *isl_map_range(struct isl_map *map)
2581 struct isl_set *set;
2585 map = isl_map_cow(map);
2589 set = (struct isl_set *) map;
2591 for (i = 0; i < map->n; ++i) {
2592 set->p[i] = isl_basic_map_range(map->p[i]);
2596 F_CLR(set, ISL_MAP_DISJOINT);
2597 F_CLR(set, ISL_SET_NORMALIZED);
2604 struct isl_map *isl_map_from_set(struct isl_set *set,
2605 unsigned n_in, unsigned n_out)
2608 struct isl_map *map = NULL;
2612 isl_assert(set->ctx, set->dim == n_in + n_out, goto error);
2613 set = isl_set_cow(set);
2616 map = (struct isl_map *)set;
2617 for (i = 0; i < set->n; ++i) {
2618 map->p[i] = isl_basic_map_from_basic_set(
2619 set->p[i], n_in, n_out);
2631 struct isl_set *isl_set_from_map(struct isl_map *map)
2634 struct isl_set *set = NULL;
2638 map = isl_map_cow(map);
2641 map->n_out += map->n_in;
2643 set = (struct isl_set *)map;
2644 for (i = 0; i < map->n; ++i) {
2645 set->p[i] = isl_basic_set_from_basic_map(map->p[i]);
2655 struct isl_map *isl_map_alloc(struct isl_ctx *ctx,
2656 unsigned nparam, unsigned in, unsigned out, int n,
2659 struct isl_map *map;
2661 map = isl_alloc(ctx, struct isl_map,
2662 sizeof(struct isl_map) +
2663 n * sizeof(struct isl_basic_map *));
2672 map->nparam = nparam;
2679 struct isl_basic_map *isl_basic_map_empty(struct isl_ctx *ctx,
2680 unsigned nparam, unsigned in, unsigned out)
2682 struct isl_basic_map *bmap;
2683 bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, 1, 0);
2684 bmap = isl_basic_map_set_to_empty(bmap);
2688 struct isl_basic_set *isl_basic_set_empty(struct isl_ctx *ctx,
2689 unsigned nparam, unsigned dim)
2691 struct isl_basic_set *bset;
2692 bset = isl_basic_set_alloc(ctx, nparam, dim, 0, 1, 0);
2693 bset = isl_basic_set_set_to_empty(bset);
2697 struct isl_basic_map *isl_basic_map_universe(struct isl_ctx *ctx,
2698 unsigned nparam, unsigned in, unsigned out)
2700 struct isl_basic_map *bmap;
2701 bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, 0, 0);
2705 struct isl_basic_set *isl_basic_set_universe(struct isl_ctx *ctx,
2706 unsigned nparam, unsigned dim)
2708 struct isl_basic_set *bset;
2709 bset = isl_basic_set_alloc(ctx, nparam, dim, 0, 0, 0);
2713 struct isl_map *isl_map_empty(struct isl_ctx *ctx,
2714 unsigned nparam, unsigned in, unsigned out)
2716 return isl_map_alloc(ctx, nparam, in, out, 0, ISL_MAP_DISJOINT);
2719 struct isl_set *isl_set_empty(struct isl_ctx *ctx,
2720 unsigned nparam, unsigned dim)
2722 return isl_set_alloc(ctx, nparam, dim, 0, ISL_MAP_DISJOINT);
2725 struct isl_map *isl_map_dup(struct isl_map *map)
2728 struct isl_map *dup;
2732 dup = isl_map_alloc(map->ctx, map->nparam, map->n_in, map->n_out, map->n,
2734 for (i = 0; i < map->n; ++i)
2735 dup = isl_map_add(dup, isl_basic_map_copy(map->p[i]));
2739 struct isl_map *isl_map_add(struct isl_map *map, struct isl_basic_map *bmap)
2743 isl_assert(map->ctx, map->nparam == bmap->nparam, goto error);
2744 isl_assert(map->ctx, map->n_in == bmap->n_in, goto error);
2745 isl_assert(map->ctx, map->n_out == bmap->n_out, goto error);
2746 isl_assert(map->ctx, map->n < map->size, goto error);
2747 map->p[map->n] = bmap;
2749 F_CLR(map, ISL_MAP_NORMALIZED);
2755 isl_basic_map_free(bmap);
2759 void isl_map_free(struct isl_map *map)
2769 isl_ctx_deref(map->ctx);
2770 for (i = 0; i < map->n; ++i)
2771 isl_basic_map_free(map->p[i]);
2775 struct isl_map *isl_map_extend(struct isl_map *base,
2776 unsigned nparam, unsigned n_in, unsigned n_out)
2780 base = isl_map_cow(base);
2784 isl_assert(base->ctx, base->nparam <= nparam, goto error);
2785 isl_assert(base->ctx, base->n_in <= n_in, goto error);
2786 isl_assert(base->ctx, base->n_out <= n_out, goto error);
2787 base->nparam = nparam;
2789 base->n_out = n_out;
2790 for (i = 0; i < base->n; ++i) {
2791 base->p[i] = isl_basic_map_extend(base->p[i],
2792 nparam, n_in, n_out, 0, 0, 0);
2802 struct isl_set *isl_set_extend(struct isl_set *base,
2803 unsigned nparam, unsigned dim)
2805 return (struct isl_set *)isl_map_extend((struct isl_map *)base,
2809 static struct isl_basic_map *isl_basic_map_fix_var(struct isl_basic_map *bmap,
2810 unsigned var, int value)
2814 bmap = isl_basic_map_cow(bmap);
2815 bmap = isl_basic_map_extend(bmap,
2816 bmap->nparam, bmap->n_in, bmap->n_out, 0, 1, 0);
2817 j = isl_basic_map_alloc_equality(bmap);
2820 isl_seq_clr(bmap->eq[j],
2821 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div);
2822 isl_int_set_si(bmap->eq[j][1 + var], -1);
2823 isl_int_set_si(bmap->eq[j][0], value);
2824 bmap = isl_basic_map_simplify(bmap);
2825 return isl_basic_map_finalize(bmap);
2827 isl_basic_map_free(bmap);
2831 struct isl_basic_map *isl_basic_map_fix_input_si(struct isl_basic_map *bmap,
2832 unsigned input, int value)
2836 isl_assert(bmap->ctx, input < bmap->n_in, goto error);
2837 return isl_basic_map_fix_var(bmap, bmap->nparam + input, value);
2839 isl_basic_map_free(bmap);
2843 struct isl_basic_set *isl_basic_set_fix_dim_si(struct isl_basic_set *bset,
2844 unsigned dim, int value)
2848 isl_assert(bset->ctx, dim < bset->dim, goto error);
2849 return (struct isl_basic_set *)
2850 isl_basic_map_fix_var((struct isl_basic_map *)bset,
2851 bset->nparam + dim, value);
2853 isl_basic_set_free(bset);
2857 struct isl_map *isl_map_fix_input_si(struct isl_map *map,
2858 unsigned input, int value)
2862 map = isl_map_cow(map);
2866 isl_assert(ctx, input < map->n_in, goto error);
2867 for (i = 0; i < map->n; ++i) {
2868 map->p[i] = isl_basic_map_fix_input_si(map->p[i], input, value);
2872 F_CLR(map, ISL_MAP_NORMALIZED);
2879 struct isl_set *isl_set_fix_dim_si(struct isl_set *set, unsigned dim, int value)
2883 set = isl_set_cow(set);
2887 isl_assert(set->ctx, dim < set->dim, goto error);
2888 for (i = 0; i < set->n; ++i) {
2889 set->p[i] = isl_basic_set_fix_dim_si(set->p[i], dim, value);
2899 struct isl_basic_set *isl_basic_set_lower_bound_dim(struct isl_basic_set *bset,
2900 unsigned dim, isl_int value)
2904 bset = isl_basic_set_cow(bset);
2905 bset = isl_basic_set_extend(bset, bset->nparam, bset->dim, 0, 0, 1);
2906 j = isl_basic_set_alloc_inequality(bset);
2909 isl_seq_clr(bset->ineq[j], 1 + bset->nparam + bset->dim + bset->n_div);
2910 isl_int_set_si(bset->ineq[j][1 + bset->nparam + dim], 1);
2911 isl_int_neg(bset->ineq[j][0], value);
2912 bset = isl_basic_set_simplify(bset);
2913 return isl_basic_set_finalize(bset);
2915 isl_basic_set_free(bset);
2919 struct isl_set *isl_set_lower_bound_dim(struct isl_set *set, unsigned dim,
2924 set = isl_set_cow(set);
2928 isl_assert(set->ctx, dim < set->dim, goto error);
2929 for (i = 0; i < set->n; ++i) {
2930 set->p[i] = isl_basic_set_lower_bound_dim(set->p[i], dim, value);
2940 struct isl_map *isl_map_reverse(struct isl_map *map)
2945 map = isl_map_cow(map);
2950 map->n_in = map->n_out;
2952 for (i = 0; i < map->n; ++i) {
2953 map->p[i] = isl_basic_map_reverse(map->p[i]);
2957 F_CLR(map, ISL_MAP_NORMALIZED);
2964 struct isl_map *isl_basic_map_lexmax(
2965 struct isl_basic_map *bmap, struct isl_basic_set *dom,
2966 struct isl_set **empty)
2968 return isl_pip_basic_map_lexmax(bmap, dom, empty);
2971 struct isl_map *isl_basic_map_lexmin(
2972 struct isl_basic_map *bmap, struct isl_basic_set *dom,
2973 struct isl_set **empty)
2975 return isl_pip_basic_map_lexmin(bmap, dom, empty);
2978 struct isl_set *isl_basic_set_lexmin(struct isl_basic_set *bset)
2980 struct isl_basic_map *bmap = NULL;
2981 struct isl_basic_set *dom = NULL;
2982 struct isl_map *min;
2986 bmap = isl_basic_map_from_basic_set(bset, 0, bset->dim);
2989 dom = isl_basic_set_alloc(bmap->ctx, bmap->nparam, 0, 0, 0, 0);
2992 min = isl_basic_map_lexmin(bmap, dom, NULL);
2993 return isl_map_range(min);
2995 isl_basic_map_free(bmap);
2999 struct isl_map *isl_basic_map_compute_divs(struct isl_basic_map *bmap)
3003 if (bmap->n_div == 0)
3004 return isl_map_from_basic_map(bmap);
3005 return isl_pip_basic_map_compute_divs(bmap);
3008 struct isl_map *isl_map_compute_divs(struct isl_map *map)
3011 struct isl_map *res;
3017 res = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[0]));
3018 for (i = 1 ; i < map->n; ++i) {
3020 r2 = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[i]));
3021 if (F_ISSET(map, ISL_MAP_DISJOINT))
3022 res = isl_map_union_disjoint(res, r2);
3024 res = isl_map_union(res, r2);
3031 struct isl_set *isl_basic_set_compute_divs(struct isl_basic_set *bset)
3033 return (struct isl_set *)
3034 isl_basic_map_compute_divs((struct isl_basic_map *)bset);
3037 struct isl_set *isl_set_compute_divs(struct isl_set *set)
3039 return (struct isl_set *)
3040 isl_map_compute_divs((struct isl_map *)set);
3043 struct isl_set *isl_map_domain(struct isl_map *map)
3046 struct isl_set *set;
3051 map = isl_map_cow(map);
3055 set = (struct isl_set *)map;
3056 set->dim = map->n_in;
3058 for (i = 0; i < map->n; ++i) {
3059 set->p[i] = isl_basic_map_domain(map->p[i]);
3063 F_CLR(set, ISL_MAP_DISJOINT);
3064 F_CLR(set, ISL_SET_NORMALIZED);
3071 struct isl_map *isl_map_union_disjoint(
3072 struct isl_map *map1, struct isl_map *map2)
3076 struct isl_map *map = NULL;
3090 isl_assert(map1->ctx, map1->nparam == map2->nparam, goto error);
3091 isl_assert(map1->ctx, map1->n_in == map2->n_in, goto error);
3092 isl_assert(map1->ctx, map1->n_out == map2->n_out, goto error);
3094 if (F_ISSET(map1, ISL_MAP_DISJOINT) &&
3095 F_ISSET(map2, ISL_MAP_DISJOINT))
3096 FL_SET(flags, ISL_MAP_DISJOINT);
3098 map = isl_map_alloc(map1->ctx, map1->nparam, map1->n_in, map1->n_out,
3099 map1->n + map2->n, flags);
3102 for (i = 0; i < map1->n; ++i) {
3103 map = isl_map_add(map,
3104 isl_basic_map_copy(map1->p[i]));
3108 for (i = 0; i < map2->n; ++i) {
3109 map = isl_map_add(map,
3110 isl_basic_map_copy(map2->p[i]));
3124 struct isl_map *isl_map_union(struct isl_map *map1, struct isl_map *map2)
3126 map1 = isl_map_union_disjoint(map1, map2);
3130 F_CLR(map1, ISL_MAP_DISJOINT);
3134 struct isl_set *isl_set_union_disjoint(
3135 struct isl_set *set1, struct isl_set *set2)
3137 return (struct isl_set *)
3138 isl_map_union_disjoint(
3139 (struct isl_map *)set1, (struct isl_map *)set2);
3142 struct isl_set *isl_set_union(struct isl_set *set1, struct isl_set *set2)
3144 return (struct isl_set *)
3145 isl_map_union((struct isl_map *)set1, (struct isl_map *)set2);
3148 struct isl_map *isl_map_intersect_range(
3149 struct isl_map *map, struct isl_set *set)
3152 struct isl_map *result;
3158 if (F_ISSET(map, ISL_MAP_DISJOINT) &&
3159 F_ISSET(set, ISL_MAP_DISJOINT))
3160 FL_SET(flags, ISL_MAP_DISJOINT);
3162 result = isl_map_alloc(map->ctx, map->nparam, map->n_in, map->n_out,
3163 map->n * set->n, flags);
3166 for (i = 0; i < map->n; ++i)
3167 for (j = 0; j < set->n; ++j) {
3168 result = isl_map_add(result,
3169 isl_basic_map_intersect_range(
3170 isl_basic_map_copy(map->p[i]),
3171 isl_basic_set_copy(set->p[j])));
3184 struct isl_map *isl_map_intersect_domain(
3185 struct isl_map *map, struct isl_set *set)
3187 return isl_map_reverse(
3188 isl_map_intersect_range(isl_map_reverse(map), set));
3191 struct isl_map *isl_map_apply_domain(
3192 struct isl_map *map1, struct isl_map *map2)
3196 map1 = isl_map_reverse(map1);
3197 map1 = isl_map_apply_range(map1, map2);
3198 return isl_map_reverse(map1);
3205 struct isl_map *isl_map_apply_range(
3206 struct isl_map *map1, struct isl_map *map2)
3208 struct isl_map *result;
3214 isl_assert(map1->ctx, map1->nparam == map2->nparam, goto error);
3215 isl_assert(map1->ctx, map1->n_out == map2->n_in, goto error);
3217 result = isl_map_alloc(map1->ctx, map1->nparam, map1->n_in, map2->n_out,
3218 map1->n * map2->n, 0);
3221 for (i = 0; i < map1->n; ++i)
3222 for (j = 0; j < map2->n; ++j) {
3223 result = isl_map_add(result,
3224 isl_basic_map_apply_range(
3225 isl_basic_map_copy(map1->p[i]),
3226 isl_basic_map_copy(map2->p[j])));
3232 if (result && result->n <= 1)
3233 F_SET(result, ISL_MAP_DISJOINT);
3242 * returns range - domain
3244 struct isl_basic_set *isl_basic_map_deltas(struct isl_basic_map *bmap)
3246 struct isl_basic_set *bset;
3252 isl_assert(bmap->ctx, bmap->n_in == bmap->n_out, goto error);
3254 bset = isl_basic_set_from_basic_map(bmap);
3255 bset = isl_basic_set_extend(bset, bset->nparam, 3*dim, 0,
3257 bset = isl_basic_set_swap_vars(bset, 2*dim);
3258 for (i = 0; i < dim; ++i) {
3259 int j = isl_basic_map_alloc_equality(
3260 (struct isl_basic_map *)bset);
3263 isl_seq_clr(bset->eq[j],
3264 1 + bset->nparam + bset->dim + bset->n_div);
3265 isl_int_set_si(bset->eq[j][1+bset->nparam+i], 1);
3266 isl_int_set_si(bset->eq[j][1+bset->nparam+dim+i], 1);
3267 isl_int_set_si(bset->eq[j][1+bset->nparam+2*dim+i], -1);
3269 return isl_basic_set_project_out(bset, 2*dim, 0);
3271 isl_basic_map_free(bmap);
3276 * returns range - domain
3278 struct isl_set *isl_map_deltas(struct isl_map *map)
3281 struct isl_set *result;
3286 isl_assert(map->ctx, map->n_in == map->n_out, goto error);
3287 result = isl_set_alloc(map->ctx, map->nparam, map->n_in, map->n, map->flags);
3290 for (i = 0; i < map->n; ++i)
3291 result = isl_set_add(result,
3292 isl_basic_map_deltas(isl_basic_map_copy(map->p[i])));
3300 /* If the only constraints a div d=floor(f/m)
3301 * appears in are its two defining constraints
3304 * -(f - (m - 1)) + m d >= 0
3306 * then it can safely be removed.
3308 static int div_is_redundant(struct isl_basic_map *bmap, int div)
3311 unsigned pos = 1 + bmap->nparam + bmap->n_in + bmap->n_out + div;
3313 for (i = 0; i < bmap->n_eq; ++i)
3314 if (!isl_int_is_zero(bmap->eq[i][pos]))
3317 for (i = 0; i < bmap->n_ineq; ++i) {
3318 if (isl_int_is_zero(bmap->ineq[i][pos]))
3320 if (isl_int_eq(bmap->ineq[i][pos], bmap->div[div][0])) {
3322 isl_int_sub(bmap->div[div][1],
3323 bmap->div[div][1], bmap->div[div][0]);
3324 isl_int_add_ui(bmap->div[div][1], bmap->div[div][1], 1);
3325 neg = isl_seq_is_neg(bmap->ineq[i], bmap->div[div]+1, pos);
3326 isl_int_sub_ui(bmap->div[div][1], bmap->div[div][1], 1);
3327 isl_int_add(bmap->div[div][1],
3328 bmap->div[div][1], bmap->div[div][0]);
3331 if (isl_seq_first_non_zero(bmap->ineq[i]+pos+1,
3332 bmap->n_div-div-1) != -1)
3334 } else if (isl_int_abs_eq(bmap->ineq[i][pos], bmap->div[div][0])) {
3335 if (!isl_seq_eq(bmap->ineq[i], bmap->div[div]+1, pos))
3337 if (isl_seq_first_non_zero(bmap->ineq[i]+pos+1,
3338 bmap->n_div-div-1) != -1)
3344 for (i = 0; i < bmap->n_div; ++i)
3345 if (!isl_int_is_zero(bmap->div[i][1+pos]))
3352 * Remove divs that don't occur in any of the constraints or other divs.
3353 * These can arise when dropping some of the variables in a quast
3354 * returned by piplib.
3356 static struct isl_basic_map *remove_redundant_divs(struct isl_basic_map *bmap)
3363 for (i = bmap->n_div-1; i >= 0; --i) {
3364 if (!div_is_redundant(bmap, i))
3366 bmap = isl_basic_map_drop_div(bmap, i);
3371 struct isl_basic_map *isl_basic_map_finalize(struct isl_basic_map *bmap)
3373 bmap = remove_redundant_divs(bmap);
3376 F_SET(bmap, ISL_BASIC_SET_FINAL);
3380 struct isl_basic_set *isl_basic_set_finalize(struct isl_basic_set *bset)
3382 return (struct isl_basic_set *)
3383 isl_basic_map_finalize((struct isl_basic_map *)bset);
3386 struct isl_set *isl_set_finalize(struct isl_set *set)
3392 for (i = 0; i < set->n; ++i) {
3393 set->p[i] = isl_basic_set_finalize(set->p[i]);
3403 struct isl_map *isl_map_finalize(struct isl_map *map)
3409 for (i = 0; i < map->n; ++i) {
3410 map->p[i] = isl_basic_map_finalize(map->p[i]);
3414 F_CLR(map, ISL_MAP_NORMALIZED);
3421 struct isl_basic_map *isl_basic_map_identity(struct isl_ctx *ctx,
3422 unsigned nparam, unsigned dim)
3424 struct isl_basic_map *bmap;
3427 bmap = isl_basic_map_alloc(ctx, nparam, dim, dim, 0, dim, 0);
3431 for (i = 0; i < dim; ++i) {
3432 int j = isl_basic_map_alloc_equality(bmap);
3435 isl_seq_clr(bmap->eq[j],
3436 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div);
3437 isl_int_set_si(bmap->eq[j][1+nparam+i], 1);
3438 isl_int_set_si(bmap->eq[j][1+nparam+dim+i], -1);
3440 return isl_basic_map_finalize(bmap);
3442 isl_basic_map_free(bmap);
3446 struct isl_map *isl_map_identity(struct isl_ctx *ctx,
3447 unsigned nparam, unsigned dim)
3449 struct isl_map *map = isl_map_alloc(ctx, nparam, dim, dim, 1,
3453 map = isl_map_add(map,
3454 isl_basic_map_identity(ctx, nparam, dim));
3461 int isl_set_is_equal(struct isl_set *set1, struct isl_set *set2)
3463 return isl_map_is_equal((struct isl_map *)set1, (struct isl_map *)set2);
3466 int isl_set_is_subset(struct isl_set *set1, struct isl_set *set2)
3468 return isl_map_is_subset(
3469 (struct isl_map *)set1, (struct isl_map *)set2);
3472 int isl_basic_map_is_subset(
3473 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3476 struct isl_map *map1;
3477 struct isl_map *map2;
3479 if (!bmap1 || !bmap2)
3482 map1 = isl_map_from_basic_map(isl_basic_map_copy(bmap1));
3483 map2 = isl_map_from_basic_map(isl_basic_map_copy(bmap2));
3485 is_subset = isl_map_is_subset(map1, map2);
3493 int isl_basic_map_is_equal(
3494 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3498 if (!bmap1 || !bmap2)
3500 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
3503 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
3507 int isl_basic_set_is_equal(
3508 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
3510 return isl_basic_map_is_equal(
3511 (struct isl_basic_map *)bset1, (struct isl_basic_map *)bset2);
3514 int isl_map_is_empty(struct isl_map *map)
3521 for (i = 0; i < map->n; ++i) {
3522 is_empty = isl_basic_map_is_empty(map->p[i]);
3531 int isl_set_is_empty(struct isl_set *set)
3533 return isl_map_is_empty((struct isl_map *)set);
3536 int isl_map_is_subset(struct isl_map *map1, struct isl_map *map2)
3540 struct isl_map *diff;
3545 if (isl_map_is_empty(map1))
3548 if (isl_map_is_empty(map2))
3551 diff = isl_map_subtract(isl_map_copy(map1), isl_map_copy(map2));
3555 is_subset = isl_map_is_empty(diff);
3561 int isl_map_is_equal(struct isl_map *map1, struct isl_map *map2)
3567 is_subset = isl_map_is_subset(map1, map2);
3570 is_subset = isl_map_is_subset(map2, map1);
3574 int isl_basic_map_is_strict_subset(
3575 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3579 if (!bmap1 || !bmap2)
3581 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
3584 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
3585 if (is_subset == -1)
3590 static int basic_map_contains(struct isl_basic_map *bmap, struct isl_vec *vec)
3596 total = 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
3597 if (total != vec->size)
3602 for (i = 0; i < bmap->n_eq; ++i) {
3603 isl_seq_inner_product(vec->block.data, bmap->eq[i], total, &s);
3604 if (!isl_int_is_zero(s)) {
3610 for (i = 0; i < bmap->n_ineq; ++i) {
3611 isl_seq_inner_product(vec->block.data, bmap->ineq[i], total, &s);
3612 if (isl_int_is_neg(s)) {
3623 int isl_basic_map_is_universe(struct isl_basic_map *bmap)
3627 return bmap->n_eq == 0 && bmap->n_ineq == 0;
3630 int isl_basic_map_is_empty(struct isl_basic_map *bmap)
3632 struct isl_basic_set *bset = NULL;
3633 struct isl_vec *sample = NULL;
3640 if (F_ISSET(bmap, ISL_BASIC_MAP_EMPTY))
3643 if (F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL)) {
3644 struct isl_basic_map *copy = isl_basic_map_copy(bmap);
3645 copy = isl_basic_map_convex_hull(copy);
3646 empty = F_ISSET(copy, ISL_BASIC_MAP_EMPTY);
3647 isl_basic_map_free(copy);
3651 total = 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
3652 if (bmap->sample && bmap->sample->size == total) {
3653 int contains = basic_map_contains(bmap, bmap->sample);
3659 bset = isl_basic_map_underlying_set(isl_basic_map_copy(bmap));
3662 sample = isl_basic_set_sample(bset);
3665 empty = sample->size == 0;
3667 isl_vec_free(bmap->ctx, bmap->sample);
3668 bmap->sample = sample;
3673 struct isl_map *isl_basic_map_union(
3674 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3676 struct isl_map *map;
3677 if (!bmap1 || !bmap2)
3680 isl_assert(bmap1->ctx, bmap1->nparam == bmap2->nparam, goto error);
3681 isl_assert(bmap1->ctx, bmap1->n_in == bmap2->n_in, goto error);
3682 isl_assert(bmap1->ctx, bmap1->n_out == bmap2->n_out, goto error);
3684 map = isl_map_alloc(bmap1->ctx, bmap1->nparam,
3685 bmap1->n_in, bmap1->n_out, 2, 0);
3688 map = isl_map_add(map, bmap1);
3689 map = isl_map_add(map, bmap2);
3692 isl_basic_map_free(bmap1);
3693 isl_basic_map_free(bmap2);
3697 struct isl_set *isl_basic_set_union(
3698 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
3700 return (struct isl_set *)isl_basic_map_union(
3701 (struct isl_basic_map *)bset1,
3702 (struct isl_basic_map *)bset2);
3705 /* Order divs such that any div only depends on previous divs */
3706 static struct isl_basic_map *order_divs(struct isl_basic_map *bmap)
3709 unsigned off = bmap->nparam + bmap->n_in + bmap->n_out;
3711 for (i = 0; i < bmap->n_div; ++i) {
3713 pos = isl_seq_first_non_zero(bmap->div[i]+1+1+off+i,
3717 swap_div(bmap, i, pos);
3723 static int find_div(struct isl_basic_map *dst,
3724 struct isl_basic_map *src, unsigned div)
3728 unsigned total = src->nparam + src->n_in + src->n_out + src->n_div;
3730 for (i = 0; i < dst->n_div; ++i)
3731 if (isl_seq_eq(dst->div[i], src->div[div], 1+1+total) &&
3732 isl_seq_first_non_zero(dst->div[i]+1+1+total,
3733 dst->n_div - src->n_div) == -1)
3738 struct isl_basic_map *isl_basic_map_align_divs(
3739 struct isl_basic_map *dst, struct isl_basic_map *src)
3742 unsigned total = src->nparam + src->n_in + src->n_out + src->n_div;
3747 if (src->n_div == 0)
3750 src = order_divs(src);
3751 dst = isl_basic_map_extend(dst, dst->nparam, dst->n_in,
3752 dst->n_out, src->n_div, 0, 2 * src->n_div);
3755 for (i = 0; i < src->n_div; ++i) {
3756 int j = find_div(dst, src, i);
3758 j = isl_basic_map_alloc_div(dst);
3761 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total);
3762 isl_seq_clr(dst->div[j]+1+1+total,
3763 dst->n_div - src->n_div);
3764 if (add_div_constraints(dst, j) < 0)
3768 swap_div(dst, i, j);
3772 isl_basic_map_free(dst);
3776 struct isl_basic_set *isl_basic_set_align_divs(
3777 struct isl_basic_set *dst, struct isl_basic_set *src)
3779 return (struct isl_basic_set *)isl_basic_map_align_divs(
3780 (struct isl_basic_map *)dst, (struct isl_basic_map *)src);
3783 struct isl_map *isl_map_align_divs(struct isl_map *map)
3787 map = isl_map_compute_divs(map);
3788 map = isl_map_cow(map);
3792 for (i = 1; i < map->n; ++i)
3793 map->p[0] = isl_basic_map_align_divs(map->p[0], map->p[i]);
3794 for (i = 1; i < map->n; ++i)
3795 map->p[i] = isl_basic_map_align_divs(map->p[i], map->p[0]);
3797 F_CLR(map, ISL_MAP_NORMALIZED);
3801 static struct isl_map *add_cut_constraint(struct isl_map *dst,
3802 struct isl_basic_map *src, isl_int *c,
3803 unsigned len, int oppose)
3805 struct isl_basic_map *copy = NULL;
3810 copy = isl_basic_map_copy(src);
3811 copy = isl_basic_map_cow(copy);
3814 copy = isl_basic_map_extend(copy,
3815 copy->nparam, copy->n_in, copy->n_out, 0, 0, 1);
3816 k = isl_basic_map_alloc_inequality(copy);
3820 isl_seq_neg(copy->ineq[k], c, len);
3822 isl_seq_cpy(copy->ineq[k], c, len);
3823 total = 1 + copy->nparam + copy->n_in + copy->n_out + copy->n_div;
3824 isl_seq_clr(copy->ineq[k]+len, total - len);
3825 isl_inequality_negate(copy, k);
3826 copy = isl_basic_map_simplify(copy);
3827 copy = isl_basic_map_finalize(copy);
3828 is_empty = isl_basic_map_is_empty(copy);
3832 dst = isl_map_add(dst, copy);
3834 isl_basic_map_free(copy);
3837 isl_basic_map_free(copy);
3842 static struct isl_map *subtract(struct isl_map *map, struct isl_basic_map *bmap)
3846 struct isl_map *rest = NULL;
3848 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
3855 if (F_ISSET(map, ISL_MAP_DISJOINT))
3856 FL_SET(flags, ISL_MAP_DISJOINT);
3858 max = map->n * (2 * bmap->n_eq + bmap->n_ineq);
3859 rest = isl_map_alloc(map->ctx, map->nparam, map->n_in, map->n_out,
3864 for (i = 0; i < map->n; ++i) {
3865 map->p[i] = isl_basic_map_align_divs(map->p[i], bmap);
3870 for (j = 0; j < map->n; ++j)
3871 map->p[j] = isl_basic_map_cow(map->p[j]);
3873 for (i = 0; i < bmap->n_eq; ++i) {
3874 for (j = 0; j < map->n; ++j) {
3875 rest = add_cut_constraint(rest,
3876 map->p[j], bmap->eq[i], 1+total, 0);
3880 rest = add_cut_constraint(rest,
3881 map->p[j], bmap->eq[i], 1+total, 1);
3885 map->p[j] = isl_basic_map_extend(map->p[j],
3886 map->p[j]->nparam, map->p[j]->n_in,
3887 map->p[j]->n_out, 0, 1, 0);
3890 k = isl_basic_map_alloc_equality(map->p[j]);
3893 isl_seq_cpy(map->p[j]->eq[k], bmap->eq[i], 1+total);
3894 isl_seq_clr(map->p[j]->eq[k]+1+total,
3895 map->p[j]->n_div - bmap->n_div);
3899 for (i = 0; i < bmap->n_ineq; ++i) {
3900 for (j = 0; j < map->n; ++j) {
3901 rest = add_cut_constraint(rest,
3902 map->p[j], bmap->ineq[i], 1+total, 0);
3906 map->p[j] = isl_basic_map_extend(map->p[j],
3907 map->p[j]->nparam, map->p[j]->n_in,
3908 map->p[j]->n_out, 0, 0, 1);
3911 k = isl_basic_map_alloc_inequality(map->p[j]);
3914 isl_seq_cpy(map->p[j]->ineq[k], bmap->ineq[i], 1+total);
3915 isl_seq_clr(map->p[j]->ineq[k]+1+total,
3916 map->p[j]->n_div - bmap->n_div);
3928 struct isl_map *isl_map_subtract(struct isl_map *map1, struct isl_map *map2)
3934 isl_assert(map1->ctx, map1->nparam == map2->nparam, goto error);
3935 isl_assert(map1->ctx, map1->n_in == map2->n_in, goto error);
3936 isl_assert(map1->ctx, map1->n_out == map2->n_out, goto error);
3938 if (isl_map_is_empty(map2)) {
3943 map1 = isl_map_compute_divs(map1);
3944 map2 = isl_map_compute_divs(map2);
3948 for (i = 0; map1 && i < map2->n; ++i)
3949 map1 = subtract(map1, map2->p[i]);
3959 struct isl_set *isl_set_subtract(struct isl_set *set1, struct isl_set *set2)
3961 return (struct isl_set *)
3963 (struct isl_map *)set1, (struct isl_map *)set2);
3966 struct isl_set *isl_set_apply(struct isl_set *set, struct isl_map *map)
3970 isl_assert(set->ctx, set->dim == map->n_in, goto error);
3971 map = isl_map_intersect_domain(map, set);
3972 set = isl_map_range(map);
3980 /* There is no need to cow as removing empty parts doesn't change
3981 * the meaning of the set.
3983 struct isl_map *isl_map_remove_empty_parts(struct isl_map *map)
3990 for (i = map->n-1; i >= 0; --i) {
3991 if (!F_ISSET(map->p[i], ISL_BASIC_MAP_EMPTY))
3993 isl_basic_map_free(map->p[i]);
3994 if (i != map->n-1) {
3995 F_CLR(map, ISL_MAP_NORMALIZED);
3996 map->p[i] = map->p[map->n-1];
4004 struct isl_set *isl_set_remove_empty_parts(struct isl_set *set)
4006 return (struct isl_set *)
4007 isl_map_remove_empty_parts((struct isl_map *)set);
4010 struct isl_basic_set *isl_set_copy_basic_set(struct isl_set *set)
4012 struct isl_basic_set *bset;
4013 if (!set || set->n == 0)
4015 bset = set->p[set->n-1];
4016 isl_assert(set->ctx, F_ISSET(bset, ISL_BASIC_SET_FINAL), return NULL);
4017 return isl_basic_set_copy(bset);
4020 struct isl_set *isl_set_drop_basic_set(struct isl_set *set,
4021 struct isl_basic_set *bset)
4027 for (i = set->n-1; i >= 0; --i) {
4028 if (set->p[i] != bset)
4030 set = isl_set_cow(set);
4033 isl_basic_set_free(set->p[i]);
4034 if (i != set->n-1) {
4035 F_CLR(set, ISL_SET_NORMALIZED);
4036 set->p[i] = set->p[set->n-1];
4041 isl_basic_set_free(bset);
4045 isl_basic_set_free(bset);
4049 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
4050 * for any common value of the parameters and dimensions preceding dim
4051 * in both basic sets, the values of dimension pos in bset1 are
4052 * smaller or larger than those in bset2.
4055 * 1 if bset1 follows bset2
4056 * -1 if bset1 precedes bset2
4057 * 0 if bset1 and bset2 are incomparable
4058 * -2 if some error occurred.
4060 int isl_basic_set_compare_at(struct isl_basic_set *bset1,
4061 struct isl_basic_set *bset2, int pos)
4063 struct isl_basic_map *bmap1 = NULL;
4064 struct isl_basic_map *bmap2 = NULL;
4065 struct isl_ctx *ctx;
4066 struct isl_vec *obj;
4069 enum isl_lp_result res;
4072 if (!bset1 || !bset2)
4075 bmap1 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset1),
4076 pos, bset1->dim - pos);
4077 bmap2 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset2),
4078 pos, bset2->dim - pos);
4079 if (!bmap1 || !bmap2)
4081 bmap1 = isl_basic_map_extend(bmap1, bmap1->nparam,
4082 bmap1->n_in, bmap1->n_out + bmap2->n_out,
4083 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
4086 total = bmap1->nparam + bmap1->n_in + bmap1->n_out + bmap1->n_div;
4088 obj = isl_vec_alloc(ctx, total);
4089 isl_seq_clr(obj->block.data, total);
4090 isl_int_set_si(obj->block.data[bmap1->nparam+bmap1->n_in], 1);
4091 isl_int_set_si(obj->block.data[bmap1->nparam+bmap1->n_in+
4092 bmap1->n_out-bmap2->n_out], -1);
4095 bmap1 = add_constraints(bmap1, bmap2, 0, bmap1->n_out - bmap2->n_out);
4098 res = isl_solve_lp(bmap1, 0, obj->block.data, ctx->one, &num, &den);
4099 if (res == isl_lp_empty)
4101 else if (res == isl_lp_ok && isl_int_is_pos(num))
4103 else if ((res == isl_lp_ok && isl_int_is_neg(num)) ||
4104 res == isl_lp_unbounded)
4110 isl_basic_map_free(bmap1);
4111 isl_vec_free(ctx, obj);
4114 isl_basic_map_free(bmap1);
4115 isl_basic_map_free(bmap2);
4119 static int isl_basic_map_fast_has_fixed_var(struct isl_basic_map *bmap,
4120 unsigned pos, isl_int *val)
4128 total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
4129 for (i = 0, d = total-1; i < bmap->n_eq && d+1 > pos; ++i) {
4130 for (; d+1 > pos; --d)
4131 if (!isl_int_is_zero(bmap->eq[i][1+d]))
4135 if (isl_seq_first_non_zero(bmap->eq[i]+1, d) != -1)
4137 if (isl_seq_first_non_zero(bmap->eq[i]+1+d+1, total-d-1) != -1)
4139 if (!isl_int_is_one(bmap->eq[i][1+d]))
4142 isl_int_neg(*val, bmap->eq[i][0]);
4148 static int isl_map_fast_has_fixed_var(struct isl_map *map,
4149 unsigned pos, isl_int *val)
4161 return isl_basic_map_fast_has_fixed_var(map->p[0], pos, val);
4164 fixed = isl_basic_map_fast_has_fixed_var(map->p[0], pos, &v);
4165 for (i = 1; fixed == 1 && i < map->n; ++i) {
4166 fixed = isl_basic_map_fast_has_fixed_var(map->p[i], pos, &tmp);
4167 if (fixed == 1 && isl_int_ne(tmp, v))
4171 isl_int_set(*val, v);
4177 static int isl_set_fast_has_fixed_var(struct isl_set *set, unsigned pos,
4180 return isl_map_fast_has_fixed_var((struct isl_map *)set, pos, val);
4183 /* Check if dimension dim has fixed value and if so and if val is not NULL,
4184 * then return this fixed value in *val.
4186 int isl_set_fast_dim_is_fixed(struct isl_set *set, unsigned dim, isl_int *val)
4188 return isl_set_fast_has_fixed_var(set, set->nparam + dim, val);
4191 /* Check if input variable in has fixed value and if so and if val is not NULL,
4192 * then return this fixed value in *val.
4194 int isl_map_fast_input_is_fixed(struct isl_map *map, unsigned in, isl_int *val)
4196 return isl_map_fast_has_fixed_var(map, map->nparam + in, val);
4199 /* Check if dimension dim has an (obvious) fixed lower bound and if so
4200 * and if val is not NULL, then return this lower bound in *val.
4202 int isl_basic_set_fast_dim_has_fixed_lower_bound(struct isl_basic_set *bset,
4203 unsigned dim, isl_int *val)
4205 int i, i_eq = -1, i_ineq = -1;
4211 total = bset->nparam + bset->dim + bset->n_div;
4212 for (i = 0; i < bset->n_eq; ++i) {
4213 if (isl_int_is_zero(bset->eq[i][1+bset->nparam+dim]))
4219 for (i = 0; i < bset->n_ineq; ++i) {
4220 if (!isl_int_is_pos(bset->ineq[i][1+bset->nparam+dim]))
4222 if (i_eq != -1 || i_ineq != -1)
4226 if (i_eq == -1 && i_ineq == -1)
4228 c = i_eq != -1 ? bset->eq[i_eq] : bset->ineq[i_ineq];
4229 /* The coefficient should always be one due to normalization. */
4230 if (!isl_int_is_one(c[1+bset->nparam+dim]))
4232 if (isl_seq_first_non_zero(c+1, bset->nparam+dim) != -1)
4234 if (isl_seq_first_non_zero(c+1+bset->nparam+dim+1,
4235 total - bset->nparam - dim - 1) != -1)
4238 isl_int_neg(*val, c[0]);
4242 int isl_set_fast_dim_has_fixed_lower_bound(struct isl_set *set,
4243 unsigned dim, isl_int *val)
4255 return isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[0],
4259 fixed = isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[0],
4261 for (i = 1; fixed == 1 && i < set->n; ++i) {
4262 fixed = isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[i],
4264 if (fixed == 1 && isl_int_ne(tmp, v))
4268 isl_int_set(*val, v);
4274 static struct isl_basic_set *isl_basic_set_reduce_using_equalities(
4275 struct isl_basic_set *bset, struct isl_basic_set *context)
4280 if (!bset || !context)
4283 bset = isl_basic_set_cow(bset);
4287 elim = isl_alloc_array(ctx, int, bset->dim);
4290 set_compute_elimination_index(context, elim);
4291 for (i = 0; i < bset->n_eq; ++i)
4292 set_reduced_using_equalities(bset->eq[i], bset->eq[i],
4294 for (i = 0; i < bset->n_ineq; ++i)
4295 set_reduced_using_equalities(bset->ineq[i], bset->ineq[i],
4297 isl_basic_set_free(context);
4299 bset = isl_basic_set_simplify(bset);
4300 bset = isl_basic_set_finalize(bset);
4303 isl_basic_set_free(bset);
4304 isl_basic_set_free(context);
4308 static struct isl_basic_set *remove_shifted_constraints(
4309 struct isl_basic_set *bset, struct isl_basic_set *context)
4319 size = round_up(4 * (context->n_ineq+1) / 3 - 1);
4320 bits = ffs(size) - 1;
4321 index = isl_calloc_array(ctx, isl_int **, size);
4325 for (k = 0; k < context->n_ineq; ++k) {
4326 h = set_hash_index(index, size, bits, context, k);
4327 index[h] = &context->ineq[k];
4329 for (k = 0; k < bset->n_ineq; ++k) {
4330 h = set_hash_index(index, size, bits, bset, k);
4333 l = index[h] - &context->ineq[0];
4334 if (isl_int_lt(bset->ineq[k][0], context->ineq[l][0]))
4336 bset = isl_basic_set_cow(bset);
4339 isl_basic_set_drop_inequality(bset, k);
4349 /* Remove all information from bset that is redundant in the context
4350 * of context. In particular, equalities that are linear combinations
4351 * of those in context are removed. Then the inequalities that are
4352 * redundant in the context of the equalities and inequalities of
4353 * context are removed.
4355 static struct isl_basic_set *uset_gist(struct isl_basic_set *bset,
4356 struct isl_basic_set *context)
4360 struct isl_basic_set *combined;
4361 struct isl_ctx *ctx;
4363 if (!bset || !context)
4366 if (context->n_eq > 0) {
4369 struct isl_ctx *ctx = context->ctx;
4370 struct isl_basic_set *reduced_context;
4371 reduced_context = isl_basic_set_remove_equalities(
4372 isl_basic_set_copy(context), &T, &T2);
4373 if (!reduced_context)
4375 bset = isl_basic_set_preimage(ctx, bset, T);
4376 bset = uset_gist(bset, reduced_context);
4377 bset = isl_basic_set_preimage(ctx, bset, T2);
4378 bset = isl_basic_set_reduce_using_equalities(bset, context);
4381 if (!context->n_ineq)
4383 bset = remove_shifted_constraints(bset, context);
4384 combined = isl_basic_set_extend(isl_basic_set_copy(bset),
4385 0, bset->dim, 0, context->n_eq, context->n_ineq);
4386 context = set_add_constraints(combined, context, 0);
4391 for (i = bset->n_ineq-1; i >= 0; --i) {
4393 set_swap_inequality(context, i, context->n_ineq-1);
4395 redundant = isl_basic_set_constraint_is_redundant(&context,
4396 context->ineq[context->n_ineq], &opt, NULL);
4397 if (redundant == -1) {
4401 if (F_ISSET(context, ISL_BASIC_MAP_EMPTY)) {
4402 bset = isl_basic_set_set_to_empty(bset);
4406 set_swap_inequality(context, i, context->n_ineq-1);
4408 isl_basic_set_drop_inequality(context, i);
4409 isl_basic_set_drop_inequality(bset, i);
4414 isl_basic_set_free(context);
4417 isl_basic_set_free(context);
4418 isl_basic_set_free(bset);
4422 struct isl_basic_map *isl_basic_map_gist(struct isl_basic_map *bmap,
4423 struct isl_basic_map *context)
4425 struct isl_basic_set *bset;
4427 if (!bmap || !context)
4430 context = isl_basic_map_align_divs(context, bmap);
4431 bmap = isl_basic_map_align_divs(bmap, context);
4433 bset = uset_gist(isl_basic_map_underlying_set(isl_basic_map_copy(bmap)),
4434 isl_basic_map_underlying_set(context));
4436 return isl_basic_map_overlying_set(bset, bmap);
4438 isl_basic_map_free(bmap);
4439 isl_basic_map_free(context);
4443 struct isl_map *isl_map_gist(struct isl_map *map, struct isl_basic_map *context)
4447 map = isl_map_cow(map);
4448 if (!map || !context)
4450 isl_assert(map->ctx, map->nparam == context->nparam, goto error);
4451 isl_assert(map->ctx, map->n_in == context->n_in, goto error);
4452 isl_assert(map->ctx, map->n_out == context->n_out, goto error);
4453 for (i = 0; i < map->n; ++i)
4454 context = isl_basic_map_align_divs(context, map->p[i]);
4455 for (i = 0; i < map->n; ++i) {
4456 map->p[i] = isl_basic_map_gist(map->p[i],
4457 isl_basic_map_copy(context));
4461 isl_basic_map_free(context);
4462 F_CLR(map, ISL_MAP_NORMALIZED);
4466 isl_basic_map_free(context);
4470 struct isl_basic_set *isl_basic_set_gist(struct isl_basic_set *bset,
4471 struct isl_basic_set *context)
4473 return (struct isl_basic_set *)isl_basic_map_gist(
4474 (struct isl_basic_map *)bset, (struct isl_basic_map *)context);
4477 struct isl_set *isl_set_gist(struct isl_set *set, struct isl_basic_set *context)
4479 return (struct isl_set *)isl_map_gist((struct isl_map *)set,
4480 (struct isl_basic_map *)context);
4488 static int qsort_constraint_cmp(const void *p1, const void *p2)
4490 const struct constraint *c1 = (const struct constraint *)p1;
4491 const struct constraint *c2 = (const struct constraint *)p2;
4492 unsigned size = isl_min(c1->size, c2->size);
4493 return isl_seq_cmp(c1->c, c2->c, size);
4496 static struct isl_basic_map *isl_basic_map_sort_constraints(
4497 struct isl_basic_map *bmap)
4500 struct constraint *c;
4505 total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
4506 c = isl_alloc_array(bmap->ctx, struct constraint, bmap->n_ineq);
4509 for (i = 0; i < bmap->n_ineq; ++i) {
4511 c[i].c = bmap->ineq[i];
4513 qsort(c, bmap->n_ineq, sizeof(struct constraint), qsort_constraint_cmp);
4514 for (i = 0; i < bmap->n_ineq; ++i)
4515 bmap->ineq[i] = c[i].c;
4519 isl_basic_map_free(bmap);
4523 struct isl_basic_map *isl_basic_map_normalize(struct isl_basic_map *bmap)
4527 if (F_ISSET(bmap, ISL_BASIC_MAP_NORMALIZED))
4529 bmap = isl_basic_map_convex_hull(bmap);
4530 bmap = isl_basic_map_sort_constraints(bmap);
4531 F_SET(bmap, ISL_BASIC_MAP_NORMALIZED);
4535 struct isl_basic_set *isl_basic_set_normalize(struct isl_basic_set *bset)
4537 return (struct isl_basic_set *)isl_basic_map_normalize(
4538 (struct isl_basic_map *)bset);
4541 static int isl_basic_map_fast_cmp(const struct isl_basic_map *bmap1,
4542 const struct isl_basic_map *bmap2)
4549 if (bmap1->nparam != bmap2->nparam)
4550 return bmap1->nparam - bmap2->nparam;
4551 if (bmap1->n_in != bmap2->n_in)
4552 return bmap1->n_in - bmap2->n_in;
4553 if (bmap1->n_out != bmap2->n_out)
4554 return bmap1->n_out - bmap2->n_out;
4555 if (F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY) &&
4556 F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
4558 if (F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY))
4560 if (F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
4562 if (bmap1->n_eq != bmap2->n_eq)
4563 return bmap1->n_eq - bmap2->n_eq;
4564 if (bmap1->n_ineq != bmap2->n_ineq)
4565 return bmap1->n_ineq - bmap2->n_ineq;
4566 if (bmap1->n_div != bmap2->n_div)
4567 return bmap1->n_div - bmap2->n_div;
4568 total = bmap1->nparam + bmap1->n_in + bmap1->n_out + bmap1->n_div;
4569 for (i = 0; i < bmap1->n_eq; ++i) {
4570 cmp = isl_seq_cmp(bmap1->eq[i], bmap2->eq[i], 1+total);
4574 for (i = 0; i < bmap1->n_ineq; ++i) {
4575 cmp = isl_seq_cmp(bmap1->ineq[i], bmap2->ineq[i], 1+total);
4579 for (i = 0; i < bmap1->n_div; ++i) {
4580 cmp = isl_seq_cmp(bmap1->div[i], bmap2->div[i], 1+1+total);
4587 static int isl_basic_map_fast_is_equal(struct isl_basic_map *bmap1,
4588 struct isl_basic_map *bmap2)
4590 return isl_basic_map_fast_cmp(bmap1, bmap2) == 0;
4593 static int qsort_bmap_cmp(const void *p1, const void *p2)
4595 const struct isl_basic_map *bmap1 = *(const struct isl_basic_map **)p1;
4596 const struct isl_basic_map *bmap2 = *(const struct isl_basic_map **)p2;
4598 return isl_basic_map_fast_cmp(bmap1, bmap2);
4601 /* We normalize in place, but if anything goes wrong we need
4602 * to return NULL, so we need to make sure we don't change the
4603 * meaning of any possible other copies of map.
4605 struct isl_map *isl_map_normalize(struct isl_map *map)
4608 struct isl_basic_map *bmap;
4612 if (F_ISSET(map, ISL_MAP_NORMALIZED))
4614 for (i = 0; i < map->n; ++i) {
4615 bmap = isl_basic_map_normalize(isl_basic_map_copy(map->p[i]));
4618 isl_basic_map_free(map->p[i]);
4621 qsort(map->p, map->n, sizeof(struct isl_basic_map *), qsort_bmap_cmp);
4622 F_SET(map, ISL_MAP_NORMALIZED);
4623 map = isl_map_remove_empty_parts(map);
4626 for (i = map->n - 1; i >= 1; --i) {
4627 if (!isl_basic_map_fast_is_equal(map->p[i-1], map->p[i]))
4629 isl_basic_map_free(map->p[i-1]);
4630 for (j = i; j < map->n; ++j)
4631 map->p[j-1] = map->p[j];
4641 struct isl_set *isl_set_normalize(struct isl_set *set)
4643 return (struct isl_set *)isl_map_normalize((struct isl_map *)set);
4646 int isl_map_fast_is_equal(struct isl_map *map1, struct isl_map *map2)
4656 if (map1->nparam != map2->nparam)
4658 if (map1->n_in != map2->n_in)
4660 if (map1->n_out != map2->n_out)
4663 map1 = isl_map_copy(map1);
4664 map2 = isl_map_copy(map2);
4665 map1 = isl_map_normalize(map1);
4666 map2 = isl_map_normalize(map2);
4669 equal = map1->n == map2->n;
4670 for (i = 0; equal && i < map1->n; ++i) {
4671 equal = isl_basic_map_fast_is_equal(map1->p[i], map2->p[i]);
4684 int isl_set_fast_is_equal(struct isl_set *set1, struct isl_set *set2)
4686 return isl_map_fast_is_equal((struct isl_map *)set1,
4687 (struct isl_map *)set2);
4690 /* Return an interval that ranges from min to max (inclusive)
4692 struct isl_basic_set *isl_basic_set_interval(struct isl_ctx *ctx,
4693 isl_int min, isl_int max)
4696 struct isl_basic_set *bset = NULL;
4698 bset = isl_basic_set_alloc(ctx, 0, 1, 0, 0, 2);
4702 k = isl_basic_set_alloc_inequality(bset);
4705 isl_int_set_si(bset->ineq[k][1], 1);
4706 isl_int_neg(bset->ineq[k][0], min);
4708 k = isl_basic_set_alloc_inequality(bset);
4711 isl_int_set_si(bset->ineq[k][1], -1);
4712 isl_int_set(bset->ineq[k][0], max);
4716 isl_basic_set_free(bset);
4720 /* Return the Cartesian product of the basic sets in list (in the given order).
4722 struct isl_basic_set *isl_basic_set_product(struct isl_basic_set_list *list)
4730 struct isl_basic_set *product = NULL;
4734 isl_assert(list->ctx, list->n > 0, goto error);
4735 isl_assert(list->ctx, list->p[0], goto error);
4736 nparam = list->p[0]->nparam;
4737 dim = list->p[0]->dim;
4738 extra = list->p[0]->n_div;
4739 n_eq = list->p[0]->n_eq;
4740 n_ineq = list->p[0]->n_ineq;
4741 for (i = 1; i < list->n; ++i) {
4742 isl_assert(list->ctx, list->p[i], goto error);
4743 isl_assert(list->ctx, nparam == list->p[i]->nparam, goto error);
4744 dim += list->p[i]->dim;
4745 extra += list->p[i]->n_div;
4746 n_eq += list->p[i]->n_eq;
4747 n_ineq += list->p[i]->n_ineq;
4749 product = isl_basic_set_alloc(list->ctx, nparam, dim, extra,
4754 for (i = 0; i < list->n; ++i) {
4755 set_add_constraints(product,
4756 isl_basic_set_copy(list->p[i]), dim);
4757 dim += list->p[i]->dim;
4759 isl_basic_set_list_free(list);
4762 isl_basic_set_free(product);
4763 isl_basic_set_list_free(list);
4767 uint32_t isl_basic_set_get_hash(struct isl_basic_set *bset)
4775 bset = isl_basic_set_copy(bset);
4776 bset = isl_basic_set_normalize(bset);
4779 total = bset->nparam + bset->dim + bset->n_div;
4780 isl_hash_byte(hash, bset->n_eq & 0xFF);
4781 for (i = 0; i < bset->n_eq; ++i) {
4783 c_hash = isl_seq_get_hash(bset->eq[i], 1 + total);
4784 isl_hash_hash(hash, c_hash);
4786 isl_hash_byte(hash, bset->n_ineq & 0xFF);
4787 for (i = 0; i < bset->n_ineq; ++i) {
4789 c_hash = isl_seq_get_hash(bset->ineq[i], 1 + total);
4790 isl_hash_hash(hash, c_hash);
4792 isl_hash_byte(hash, bset->n_div & 0xFF);
4793 for (i = 0; i < bset->n_div; ++i) {
4795 if (isl_int_is_zero(bset->div[i][0]))
4797 isl_hash_byte(hash, i & 0xFF);
4798 c_hash = isl_seq_get_hash(bset->div[i], 1 + 1 + total);
4799 isl_hash_hash(hash, c_hash);
4801 isl_basic_set_free(bset);
4805 uint32_t isl_set_get_hash(struct isl_set *set)
4812 set = isl_set_copy(set);
4813 set = isl_set_normalize(set);
4817 isl_hash_init(hash);
4818 for (i = 0; i < set->n; ++i) {
4820 bset_hash = isl_basic_set_get_hash(set->p[i]);
4821 isl_hash_hash(hash, bset_hash);
4829 /* Check if the value for dimension dim is completely determined
4830 * by the values of the other parameters and variables.
4831 * That is, check if dimension dim is involved in an equality.
4833 int isl_basic_set_dim_is_unique(struct isl_basic_set *bset, unsigned dim)
4839 for (i = 0; i < bset->n_eq; ++i)
4840 if (!isl_int_is_zero(bset->eq[i][1 + bset->nparam + dim]))
4845 /* Check if the value for dimension dim is completely determined
4846 * by the values of the other parameters and variables.
4847 * That is, check if dimension dim is involved in an equality
4848 * for each of the subsets.
4850 int isl_set_dim_is_unique(struct isl_set *set, unsigned dim)
4856 for (i = 0; i < set->n; ++i) {
4858 unique = isl_basic_set_dim_is_unique(set->p[i], dim);