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 return bmap->n_div++;
359 int isl_basic_map_free_div(struct isl_basic_map *bmap, unsigned n)
363 isl_assert(bmap->ctx, n <= bmap->n_div, return -1);
368 /* Copy constraint from src to dst, putting the vars of src at offset
369 * dim_off in dst and the divs of src at offset div_off in dst.
370 * If both sets are actually map, then dim_off applies to the input
373 static void copy_constraint(struct isl_basic_map *dst_map, isl_int *dst,
374 struct isl_basic_map *src_map, isl_int *src,
375 unsigned in_off, unsigned out_off, unsigned div_off)
377 isl_int_set(dst[0], src[0]);
378 isl_seq_cpy(dst+1, src+1, isl_min(dst_map->nparam, src_map->nparam));
379 if (dst_map->nparam > src_map->nparam)
380 isl_seq_clr(dst+1+src_map->nparam,
381 dst_map->nparam - src_map->nparam);
382 isl_seq_clr(dst+1+dst_map->nparam, in_off);
383 isl_seq_cpy(dst+1+dst_map->nparam+in_off,
384 src+1+src_map->nparam,
385 isl_min(dst_map->n_in-in_off, src_map->n_in));
386 if (dst_map->n_in-in_off > src_map->n_in)
387 isl_seq_clr(dst+1+dst_map->nparam+in_off+src_map->n_in,
388 dst_map->n_in - in_off - src_map->n_in);
389 isl_seq_clr(dst+1+dst_map->nparam+dst_map->n_in, out_off);
390 isl_seq_cpy(dst+1+dst_map->nparam+dst_map->n_in+out_off,
391 src+1+src_map->nparam+src_map->n_in,
392 isl_min(dst_map->n_out-out_off, src_map->n_out));
393 if (dst_map->n_out-out_off > src_map->n_out)
394 isl_seq_clr(dst+1+dst_map->nparam+dst_map->n_in+out_off+src_map->n_out,
395 dst_map->n_out - out_off - src_map->n_out);
396 isl_seq_clr(dst+1+dst_map->nparam+dst_map->n_in+dst_map->n_out, div_off);
397 isl_seq_cpy(dst+1+dst_map->nparam+dst_map->n_in+dst_map->n_out+div_off,
398 src+1+src_map->nparam+src_map->n_in+src_map->n_out,
399 isl_min(dst_map->extra-div_off, src_map->n_div));
400 if (dst_map->n_div-div_off > src_map->n_div)
401 isl_seq_clr(dst+1+dst_map->nparam+dst_map->n_in+dst_map->n_out+
402 div_off+src_map->n_div,
403 dst_map->n_div - div_off - src_map->n_div);
406 static void copy_div(struct isl_basic_map *dst_map, isl_int *dst,
407 struct isl_basic_map *src_map, isl_int *src,
408 unsigned in_off, unsigned out_off, unsigned div_off)
410 isl_int_set(dst[0], src[0]);
411 copy_constraint(dst_map, dst+1, src_map, src+1, in_off, out_off, div_off);
414 static struct isl_basic_map *add_constraints(struct isl_basic_map *bmap1,
415 struct isl_basic_map *bmap2, unsigned i_pos, unsigned o_pos)
420 if (!bmap1 || !bmap2)
423 div_off = bmap1->n_div;
425 for (i = 0; i < bmap2->n_eq; ++i) {
426 int i1 = isl_basic_map_alloc_equality(bmap1);
429 copy_constraint(bmap1, bmap1->eq[i1], bmap2, bmap2->eq[i],
430 i_pos, o_pos, div_off);
433 for (i = 0; i < bmap2->n_ineq; ++i) {
434 int i1 = isl_basic_map_alloc_inequality(bmap1);
437 copy_constraint(bmap1, bmap1->ineq[i1], bmap2, bmap2->ineq[i],
438 i_pos, o_pos, div_off);
441 for (i = 0; i < bmap2->n_div; ++i) {
442 int i1 = isl_basic_map_alloc_div(bmap1);
445 copy_div(bmap1, bmap1->div[i1], bmap2, bmap2->div[i],
446 i_pos, o_pos, div_off);
449 isl_basic_map_free(bmap2);
454 isl_basic_map_free(bmap1);
455 isl_basic_map_free(bmap2);
459 static struct isl_basic_set *set_add_constraints(struct isl_basic_set *bset1,
460 struct isl_basic_set *bset2, unsigned pos)
462 return (struct isl_basic_set *)
463 add_constraints((struct isl_basic_map *)bset1,
464 (struct isl_basic_map *)bset2, 0, pos);
467 struct isl_basic_map *isl_basic_map_extend(struct isl_basic_map *base,
468 unsigned nparam, unsigned n_in, unsigned n_out, unsigned extra,
469 unsigned n_eq, unsigned n_ineq)
471 struct isl_basic_map *ext;
475 base = isl_basic_map_cow(base);
479 dims_ok = base && base->nparam == nparam &&
480 base->n_in == n_in && base->n_out == n_out &&
481 base->extra >= base->n_div + extra;
483 if (dims_ok && n_eq == 0 && n_ineq == 0)
486 isl_assert(base->ctx, base->nparam <= nparam, goto error);
487 isl_assert(base->ctx, base->n_in <= n_in, goto error);
488 isl_assert(base->ctx, base->n_out <= n_out, goto error);
489 extra += base->extra;
491 n_ineq += base->n_ineq;
493 ext = isl_basic_map_alloc(base->ctx, nparam, n_in, n_out,
494 extra, n_eq, n_ineq);
501 ext = add_constraints(ext, base, 0, 0);
504 F_CLR(ext, ISL_BASIC_SET_FINAL);
510 isl_basic_map_free(base);
514 struct isl_basic_set *isl_basic_set_extend(struct isl_basic_set *base,
515 unsigned nparam, unsigned dim, unsigned extra,
516 unsigned n_eq, unsigned n_ineq)
518 return (struct isl_basic_set *)
519 isl_basic_map_extend((struct isl_basic_map *)base,
520 nparam, 0, dim, extra, n_eq, n_ineq);
523 struct isl_basic_set *isl_basic_set_cow(struct isl_basic_set *bset)
525 return (struct isl_basic_set *)
526 isl_basic_map_cow((struct isl_basic_map *)bset);
529 struct isl_basic_map *isl_basic_map_cow(struct isl_basic_map *bmap)
536 bmap = isl_basic_map_dup(bmap);
538 F_CLR(bmap, ISL_BASIC_SET_FINAL);
542 struct isl_set *isl_set_cow(struct isl_set *set)
550 return isl_set_dup(set);
553 struct isl_map *isl_map_cow(struct isl_map *map)
561 return isl_map_dup(map);
564 static void swap_vars(struct isl_blk blk, isl_int *a,
565 unsigned a_len, unsigned b_len)
567 isl_seq_cpy(blk.data, a+a_len, b_len);
568 isl_seq_cpy(blk.data+b_len, a, a_len);
569 isl_seq_cpy(a, blk.data, b_len+a_len);
572 struct isl_basic_set *isl_basic_set_swap_vars(
573 struct isl_basic_set *bset, unsigned n)
581 isl_assert(bset->ctx, n <= bset->dim, goto error);
586 bset = isl_basic_set_cow(bset);
590 blk = isl_blk_alloc(bset->ctx, bset->dim);
591 if (isl_blk_is_error(blk))
594 for (i = 0; i < bset->n_eq; ++i)
596 bset->eq[i]+1+bset->nparam, n, bset->dim - n);
598 for (i = 0; i < bset->n_ineq; ++i)
600 bset->ineq[i]+1+bset->nparam, n, bset->dim - n);
602 for (i = 0; i < bset->n_div; ++i)
604 bset->div[i]+1+1+bset->nparam, n, bset->dim - n);
606 isl_blk_free(bset->ctx, blk);
608 F_CLR(bset, ISL_BASIC_SET_NORMALIZED);
612 isl_basic_set_free(bset);
616 struct isl_set *isl_set_swap_vars(struct isl_set *set, unsigned n)
619 set = isl_set_cow(set);
623 for (i = 0; i < set->n; ++i) {
624 set->p[i] = isl_basic_set_swap_vars(set->p[i], n);
630 F_CLR(set, ISL_SET_NORMALIZED);
634 static void constraint_drop_vars(isl_int *c, unsigned n, unsigned rem)
636 isl_seq_cpy(c, c + n, rem);
637 isl_seq_clr(c + rem, n);
640 struct isl_basic_set *isl_basic_set_drop_dims(
641 struct isl_basic_set *bset, unsigned first, unsigned n)
648 isl_assert(bset->ctx, first + n <= bset->dim, goto error);
653 bset = isl_basic_set_cow(bset);
657 for (i = 0; i < bset->n_eq; ++i)
658 constraint_drop_vars(bset->eq[i]+1+bset->nparam+first, n,
659 (bset->dim-first-n)+bset->extra);
661 for (i = 0; i < bset->n_ineq; ++i)
662 constraint_drop_vars(bset->ineq[i]+1+bset->nparam+first, n,
663 (bset->dim-first-n)+bset->extra);
665 for (i = 0; i < bset->n_div; ++i)
666 constraint_drop_vars(bset->div[i]+1+1+bset->nparam+first, n,
667 (bset->dim-first-n)+bset->extra);
672 F_CLR(bset, ISL_BASIC_SET_NORMALIZED);
673 bset = isl_basic_set_simplify(bset);
674 return isl_basic_set_finalize(bset);
676 isl_basic_set_free(bset);
680 static struct isl_set *isl_set_drop_dims(
681 struct isl_set *set, unsigned first, unsigned n)
688 isl_assert(set->ctx, first + n <= set->dim, goto error);
692 set = isl_set_cow(set);
696 for (i = 0; i < set->n; ++i) {
697 set->p[i] = isl_basic_set_drop_dims(set->p[i], first, n);
703 F_CLR(set, ISL_SET_NORMALIZED);
710 struct isl_basic_map *isl_basic_map_drop_inputs(
711 struct isl_basic_map *bmap, unsigned first, unsigned n)
718 isl_assert(bmap->ctx, first + n <= bmap->n_in, goto error);
723 bmap = isl_basic_map_cow(bmap);
727 for (i = 0; i < bmap->n_eq; ++i)
728 constraint_drop_vars(bmap->eq[i]+1+bmap->nparam+first, n,
729 (bmap->n_in-first-n)+bmap->n_out+bmap->extra);
731 for (i = 0; i < bmap->n_ineq; ++i)
732 constraint_drop_vars(bmap->ineq[i]+1+bmap->nparam+first, n,
733 (bmap->n_in-first-n)+bmap->n_out+bmap->extra);
735 for (i = 0; i < bmap->n_div; ++i)
736 constraint_drop_vars(bmap->div[i]+1+1+bmap->nparam+first, n,
737 (bmap->n_in-first-n)+bmap->n_out+bmap->extra);
742 F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
743 bmap = isl_basic_map_simplify(bmap);
744 return isl_basic_map_finalize(bmap);
746 isl_basic_map_free(bmap);
750 static struct isl_map *isl_map_drop_inputs(
751 struct isl_map *map, unsigned first, unsigned n)
758 isl_assert(map->ctx, first + n <= map->n_in, goto error);
762 map = isl_map_cow(map);
766 for (i = 0; i < map->n; ++i) {
767 map->p[i] = isl_basic_map_drop_inputs(map->p[i], first, n);
772 F_CLR(map, ISL_MAP_NORMALIZED);
781 * We don't cow, as the div is assumed to be redundant.
783 static struct isl_basic_map *isl_basic_map_drop_div(
784 struct isl_basic_map *bmap, unsigned div)
792 pos = 1 + bmap->nparam + bmap->n_in + bmap->n_out + div;
794 isl_assert(bmap->ctx, div < bmap->n_div, goto error);
796 for (i = 0; i < bmap->n_eq; ++i)
797 constraint_drop_vars(bmap->eq[i]+pos, 1, bmap->extra-div-1);
799 for (i = 0; i < bmap->n_ineq; ++i) {
800 if (!isl_int_is_zero(bmap->ineq[i][pos])) {
801 isl_basic_map_drop_inequality(bmap, i);
805 constraint_drop_vars(bmap->ineq[i]+pos, 1, bmap->extra-div-1);
808 for (i = 0; i < bmap->n_div; ++i)
809 constraint_drop_vars(bmap->div[i]+1+pos, 1, bmap->extra-div-1);
811 if (div != bmap->n_div - 1) {
813 isl_int *t = bmap->div[div];
815 for (j = div; j < bmap->n_div - 1; ++j)
816 bmap->div[j] = bmap->div[j+1];
818 bmap->div[bmap->n_div - 1] = t;
820 F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
821 isl_basic_map_free_div(bmap, 1);
825 isl_basic_map_free(bmap);
829 static void eliminate_div(struct isl_basic_map *bmap, isl_int *eq, unsigned div)
832 unsigned pos = 1 + bmap->nparam + bmap->n_in + bmap->n_out + div;
834 len = 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
836 for (i = 0; i < bmap->n_eq; ++i)
837 if (bmap->eq[i] != eq)
838 isl_seq_elim(bmap->eq[i], eq, pos, len, NULL);
840 for (i = 0; i < bmap->n_ineq; ++i)
841 isl_seq_elim(bmap->ineq[i], eq, pos, len, NULL);
843 /* We need to be careful about circular definitions,
844 * so for now we just remove the definitions of other divs that
845 * depend on this div and (possibly) recompute them later.
847 for (i = 0; i < bmap->n_div; ++i)
848 if (!isl_int_is_zero(bmap->div[i][0]) &&
849 !isl_int_is_zero(bmap->div[i][1 + pos]))
850 isl_seq_clr(bmap->div[i], 1 + len);
852 isl_basic_map_drop_div(bmap, div);
855 struct isl_basic_map *isl_basic_map_set_to_empty(struct isl_basic_map *bmap)
861 total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
862 isl_basic_map_free_div(bmap, bmap->n_div);
863 isl_basic_map_free_inequality(bmap, bmap->n_ineq);
865 isl_basic_map_free_equality(bmap, bmap->n_eq-1);
867 isl_basic_map_alloc_equality(bmap);
871 isl_int_set_si(bmap->eq[i][0], 1);
872 isl_seq_clr(bmap->eq[i]+1, total);
873 F_SET(bmap, ISL_BASIC_MAP_EMPTY);
874 return isl_basic_map_finalize(bmap);
876 isl_basic_map_free(bmap);
880 struct isl_basic_set *isl_basic_set_set_to_empty(struct isl_basic_set *bset)
882 return (struct isl_basic_set *)
883 isl_basic_map_set_to_empty((struct isl_basic_map *)bset);
886 static void swap_equality(struct isl_basic_map *bmap, int a, int b)
888 isl_int *t = bmap->eq[a];
889 bmap->eq[a] = bmap->eq[b];
893 static void swap_inequality(struct isl_basic_map *bmap, int a, int b)
896 isl_int *t = bmap->ineq[a];
897 bmap->ineq[a] = bmap->ineq[b];
902 static void set_swap_inequality(struct isl_basic_set *bset, int a, int b)
904 swap_inequality((struct isl_basic_map *)bset, a, b);
907 static void swap_div(struct isl_basic_map *bmap, int a, int b)
910 unsigned off = bmap->nparam + bmap->n_in + bmap->n_out;
911 isl_int *t = bmap->div[a];
912 bmap->div[a] = bmap->div[b];
915 for (i = 0; i < bmap->n_eq; ++i)
916 isl_int_swap(bmap->eq[i][1+off+a], bmap->eq[i][1+off+b]);
918 for (i = 0; i < bmap->n_ineq; ++i)
919 isl_int_swap(bmap->ineq[i][1+off+a], bmap->ineq[i][1+off+b]);
921 for (i = 0; i < bmap->n_div; ++i)
922 isl_int_swap(bmap->div[i][1+1+off+a], bmap->div[i][1+1+off+b]);
923 F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
926 static void eliminate_var_using_equality(struct isl_basic_map *bmap,
927 unsigned pos, isl_int *eq, int *progress)
932 total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
933 for (k = 0; k < bmap->n_eq; ++k) {
934 if (bmap->eq[k] == eq)
936 if (isl_int_is_zero(bmap->eq[k][1+pos]))
940 isl_seq_elim(bmap->eq[k], eq, 1+pos, 1+total, NULL);
943 for (k = 0; k < bmap->n_ineq; ++k) {
944 if (isl_int_is_zero(bmap->ineq[k][1+pos]))
948 isl_seq_elim(bmap->ineq[k], eq, 1+pos, 1+total, NULL);
949 F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
952 for (k = 0; k < bmap->n_div; ++k) {
953 if (isl_int_is_zero(bmap->div[k][0]))
955 if (isl_int_is_zero(bmap->div[k][1+1+pos]))
959 isl_seq_elim(bmap->div[k]+1, eq,
960 1+pos, 1+total, &bmap->div[k][0]);
961 F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
966 struct isl_basic_map *isl_basic_map_gauss(
967 struct isl_basic_map *bmap, int *progress)
978 total_var = bmap->nparam + bmap->n_in + bmap->n_out;
979 total = total_var + bmap->n_div;
981 last_var = total - 1;
982 for (done = 0; done < bmap->n_eq; ++done) {
983 for (; last_var >= 0; --last_var) {
984 for (k = done; k < bmap->n_eq; ++k)
985 if (!isl_int_is_zero(bmap->eq[k][1+last_var]))
993 swap_equality(bmap, k, done);
994 if (isl_int_is_neg(bmap->eq[done][1+last_var]))
995 isl_seq_neg(bmap->eq[done], bmap->eq[done], 1+total);
997 eliminate_var_using_equality(bmap, last_var, bmap->eq[done],
1000 if (last_var >= total_var &&
1001 isl_int_is_zero(bmap->div[last_var - total_var][0])) {
1002 unsigned div = last_var - total_var;
1003 isl_seq_neg(bmap->div[div]+1, bmap->eq[done], 1+total);
1004 isl_int_set_si(bmap->div[div][1+1+last_var], 0);
1005 isl_int_set(bmap->div[div][0],
1006 bmap->eq[done][1+last_var]);
1007 F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1010 if (done == bmap->n_eq)
1012 for (k = done; k < bmap->n_eq; ++k) {
1013 if (isl_int_is_zero(bmap->eq[k][0]))
1015 return isl_basic_map_set_to_empty(bmap);
1017 isl_basic_map_free_equality(bmap, bmap->n_eq-done);
1021 struct isl_basic_set *isl_basic_set_gauss(
1022 struct isl_basic_set *bset, int *progress)
1024 return (struct isl_basic_set*)isl_basic_map_gauss(
1025 (struct isl_basic_map *)bset, progress);
1028 static unsigned int round_up(unsigned int v)
1039 static int hash_index(isl_int ***index, unsigned int size, int bits,
1040 struct isl_basic_map *bmap, int k)
1043 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
1044 u_int32_t hash = isl_seq_hash(bmap->ineq[k]+1, total, bits);
1045 for (h = hash; index[h]; h = (h+1) % size)
1046 if (&bmap->ineq[k] != index[h] &&
1047 isl_seq_eq(bmap->ineq[k]+1, index[h][0]+1, total))
1052 static int set_hash_index(isl_int ***index, unsigned int size, int bits,
1053 struct isl_basic_set *bset, int k)
1055 return hash_index(index, size, bits, (struct isl_basic_map *)bset, k);
1058 static struct isl_basic_map *remove_duplicate_constraints(
1059 struct isl_basic_map *bmap, int *progress)
1065 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
1068 if (bmap->n_ineq <= 1)
1071 size = round_up(4 * (bmap->n_ineq+1) / 3 - 1);
1072 bits = ffs(size) - 1;
1073 index = isl_alloc_array(ctx, isl_int **, size);
1074 memset(index, 0, size * sizeof(isl_int **));
1078 index[isl_seq_hash(bmap->ineq[0]+1, total, bits)] = &bmap->ineq[0];
1079 for (k = 1; k < bmap->n_ineq; ++k) {
1080 h = hash_index(index, size, bits, bmap, k);
1082 index[h] = &bmap->ineq[k];
1087 l = index[h] - &bmap->ineq[0];
1088 if (isl_int_lt(bmap->ineq[k][0], bmap->ineq[l][0]))
1089 swap_inequality(bmap, k, l);
1090 isl_basic_map_drop_inequality(bmap, k);
1094 for (k = 0; k < bmap->n_ineq-1; ++k) {
1095 isl_seq_neg(bmap->ineq[k]+1, bmap->ineq[k]+1, total);
1096 h = hash_index(index, size, bits, bmap, k);
1097 isl_seq_neg(bmap->ineq[k]+1, bmap->ineq[k]+1, total);
1100 l = index[h] - &bmap->ineq[0];
1101 isl_int_add(sum, bmap->ineq[k][0], bmap->ineq[l][0]);
1102 if (isl_int_is_pos(sum))
1104 if (isl_int_is_zero(sum)) {
1105 /* We need to break out of the loop after these
1106 * changes since the contents of the hash
1107 * will no longer be valid.
1108 * Plus, we probably we want to regauss first.
1110 isl_basic_map_drop_inequality(bmap, l);
1111 isl_basic_map_inequality_to_equality(bmap, k);
1113 bmap = isl_basic_map_set_to_empty(bmap);
1122 static void compute_elimination_index(struct isl_basic_map *bmap, int *elim)
1127 total = bmap->nparam + bmap->n_in + bmap->n_out;
1128 for (d = 0; d < total; ++d)
1130 for (d = total - 1, i = 0; d >= 0 && i < bmap->n_eq; ++i) {
1131 for (; d >= 0; --d) {
1132 if (isl_int_is_zero(bmap->eq[i][1+d]))
1140 static void set_compute_elimination_index(struct isl_basic_set *bset, int *elim)
1142 return compute_elimination_index((struct isl_basic_map *)bset, elim);
1145 static int reduced_using_equalities(isl_int *dst, isl_int *src,
1146 struct isl_basic_map *bmap, int *elim)
1152 total = bmap->nparam + bmap->n_in + bmap->n_out;
1153 for (d = total - 1; d >= 0; --d) {
1154 if (isl_int_is_zero(src[1+d]))
1159 isl_seq_cpy(dst, src, 1 + total);
1162 isl_seq_elim(dst, bmap->eq[elim[d]], 1 + d, 1 + total, NULL);
1167 static int set_reduced_using_equalities(isl_int *dst, isl_int *src,
1168 struct isl_basic_set *bset, int *elim)
1170 return reduced_using_equalities(dst, src,
1171 (struct isl_basic_map *)bset, elim);
1174 /* Quick check to see if two basic maps are disjoint.
1175 * In particular, we reduce the equalities and inequalities of
1176 * one basic map in the context of the equalities of the other
1177 * basic map and check if we get a contradiction.
1179 int isl_basic_map_fast_is_disjoint(struct isl_basic_map *bmap1,
1180 struct isl_basic_map *bmap2)
1182 struct isl_vec *v = NULL;
1187 if (!bmap1 || !bmap2)
1189 isl_assert(bmap1->ctx, bmap1->nparam == bmap2->nparam, return -1);
1190 isl_assert(bmap1->ctx, bmap1->n_in == bmap2->n_in, return -1);
1191 isl_assert(bmap1->ctx, bmap1->n_out == bmap2->n_out, return -1);
1192 if (bmap1->n_div || bmap2->n_div)
1194 if (!bmap1->n_eq && !bmap2->n_eq)
1197 total = bmap1->nparam + bmap1->n_in + bmap1->n_out;
1200 v = isl_vec_alloc(bmap1->ctx, 1 + total);
1203 elim = isl_alloc_array(bmap1->ctx, int, total);
1206 compute_elimination_index(bmap1, elim);
1207 for (i = 0; i < bmap2->n_eq; ++i) {
1209 reduced = reduced_using_equalities(v->block.data, bmap2->eq[i],
1211 if (reduced && !isl_int_is_zero(v->block.data[0]) &&
1212 isl_seq_first_non_zero(v->block.data + 1, total) == -1)
1215 for (i = 0; i < bmap2->n_ineq; ++i) {
1217 reduced = reduced_using_equalities(v->block.data,
1218 bmap2->ineq[i], bmap1, elim);
1219 if (reduced && isl_int_is_neg(v->block.data[0]) &&
1220 isl_seq_first_non_zero(v->block.data + 1, total) == -1)
1223 compute_elimination_index(bmap2, elim);
1224 for (i = 0; i < bmap1->n_ineq; ++i) {
1226 reduced = reduced_using_equalities(v->block.data,
1227 bmap1->ineq[i], bmap2, elim);
1228 if (reduced && isl_int_is_neg(v->block.data[0]) &&
1229 isl_seq_first_non_zero(v->block.data + 1, total) == -1)
1232 isl_vec_free(bmap1->ctx, v);
1236 isl_vec_free(bmap1->ctx, v);
1240 isl_vec_free(bmap1->ctx, v);
1245 int isl_basic_set_fast_is_disjoint(struct isl_basic_set *bset1,
1246 struct isl_basic_set *bset2)
1248 return isl_basic_map_fast_is_disjoint((struct isl_basic_map *)bset1,
1249 (struct isl_basic_map *)bset2);
1252 int isl_map_fast_is_disjoint(struct isl_map *map1, struct isl_map *map2)
1259 if (isl_map_fast_is_equal(map1, map2))
1262 for (i = 0; i < map1->n; ++i) {
1263 for (j = 0; j < map2->n; ++j) {
1264 int d = isl_basic_map_fast_is_disjoint(map1->p[i],
1273 int isl_set_fast_is_disjoint(struct isl_set *set1, struct isl_set *set2)
1275 return isl_map_fast_is_disjoint((struct isl_map *)set1,
1276 (struct isl_map *)set2);
1279 static struct isl_basic_map *remove_duplicate_divs(
1280 struct isl_basic_map *bmap, int *progress)
1287 unsigned total_var = bmap->nparam + bmap->n_in + bmap->n_out;
1288 unsigned total = total_var + bmap->n_div;
1289 struct isl_ctx *ctx;
1291 if (bmap->n_div <= 1)
1295 for (k = bmap->n_div - 1; k >= 0; --k)
1296 if (!isl_int_is_zero(bmap->div[k][0]))
1301 size = round_up(4 * bmap->n_div / 3 - 1);
1302 bits = ffs(size) - 1;
1303 index = isl_alloc_array(ctx, int, size);
1304 memset(index, 0, size * sizeof(int));
1307 eq = isl_blk_alloc(ctx, 1+total);
1308 if (isl_blk_is_error(eq))
1311 isl_seq_clr(eq.data, 1+total);
1312 index[isl_seq_hash(bmap->div[k], 2+total, bits)] = k + 1;
1313 for (--k; k >= 0; --k) {
1316 if (isl_int_is_zero(bmap->div[k][0]))
1319 hash = isl_seq_hash(bmap->div[k], 2+total, bits);
1320 for (h = hash; index[h]; h = (h+1) % size)
1321 if (isl_seq_eq(bmap->div[k],
1322 bmap->div[index[h]-1], 2+total))
1327 isl_int_set_si(eq.data[1+total_var+k], -1);
1328 isl_int_set_si(eq.data[1+total_var+l], 1);
1329 eliminate_div(bmap, eq.data, l);
1330 isl_int_set_si(eq.data[1+total_var+k], 0);
1331 isl_int_set_si(eq.data[1+total_var+l], 0);
1336 isl_blk_free(ctx, eq);
1342 /* Elimininate divs based on equalities
1344 static struct isl_basic_map *eliminate_divs_eq(
1345 struct isl_basic_map *bmap, int *progress)
1355 off = 1 + bmap->nparam + bmap->n_in + bmap->n_out;
1357 for (d = bmap->n_div - 1; d >= 0 ; --d) {
1358 for (i = 0; i < bmap->n_eq; ++i) {
1359 if (!isl_int_is_one(bmap->eq[i][off + d]) &&
1360 !isl_int_is_negone(bmap->eq[i][off + d]))
1364 eliminate_div(bmap, bmap->eq[i], d);
1365 isl_basic_map_drop_equality(bmap, i);
1370 return eliminate_divs_eq(bmap, progress);
1374 static struct isl_basic_map *normalize_constraints(struct isl_basic_map *bmap)
1378 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
1381 for (i = bmap->n_eq - 1; i >= 0; --i) {
1382 isl_seq_gcd(bmap->eq[i]+1, total, &gcd);
1383 if (isl_int_is_zero(gcd)) {
1384 if (!isl_int_is_zero(bmap->eq[i][0])) {
1385 bmap = isl_basic_map_set_to_empty(bmap);
1388 isl_basic_map_drop_equality(bmap, i);
1391 if (F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL))
1392 isl_int_gcd(gcd, gcd, bmap->eq[i][0]);
1393 if (isl_int_is_one(gcd))
1395 if (!isl_int_is_divisible_by(bmap->eq[i][0], gcd)) {
1396 bmap = isl_basic_map_set_to_empty(bmap);
1399 isl_seq_scale_down(bmap->eq[i], bmap->eq[i], gcd, 1+total);
1402 for (i = bmap->n_ineq - 1; i >= 0; --i) {
1403 isl_seq_gcd(bmap->ineq[i]+1, total, &gcd);
1404 if (isl_int_is_zero(gcd)) {
1405 if (isl_int_is_neg(bmap->ineq[i][0])) {
1406 bmap = isl_basic_map_set_to_empty(bmap);
1409 isl_basic_map_drop_inequality(bmap, i);
1412 if (F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL))
1413 isl_int_gcd(gcd, gcd, bmap->ineq[i][0]);
1414 if (isl_int_is_one(gcd))
1416 isl_int_fdiv_q(bmap->ineq[i][0], bmap->ineq[i][0], gcd);
1417 isl_seq_scale_down(bmap->ineq[i]+1, bmap->ineq[i]+1, gcd, total);
1425 /* Eliminate the specified variables from the constraints using
1426 * Fourier-Motzkin. The variables themselves are not removed.
1428 struct isl_basic_map *isl_basic_map_eliminate_vars(
1429 struct isl_basic_map *bmap, int pos, unsigned n)
1437 total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
1439 bmap = isl_basic_map_cow(bmap);
1440 for (d = pos + n - 1; d >= pos; --d) {
1441 int n_lower, n_upper;
1444 for (i = 0; i < bmap->n_eq; ++i) {
1445 if (isl_int_is_zero(bmap->eq[i][1+d]))
1447 eliminate_var_using_equality(bmap, d, bmap->eq[i], NULL);
1448 isl_basic_map_drop_equality(bmap, i);
1455 for (i = 0; i < bmap->n_ineq; ++i) {
1456 if (isl_int_is_pos(bmap->ineq[i][1+d]))
1458 else if (isl_int_is_neg(bmap->ineq[i][1+d]))
1461 bmap = isl_basic_map_extend(bmap,
1462 bmap->nparam, bmap->n_in, bmap->n_out, 0,
1463 0, n_lower * n_upper);
1464 for (i = bmap->n_ineq - 1; i >= 0; --i) {
1466 if (isl_int_is_zero(bmap->ineq[i][1+d]))
1469 for (j = 0; j < i; ++j) {
1470 if (isl_int_is_zero(bmap->ineq[j][1+d]))
1473 if (isl_int_sgn(bmap->ineq[i][1+d]) ==
1474 isl_int_sgn(bmap->ineq[j][1+d]))
1476 k = isl_basic_map_alloc_inequality(bmap);
1479 isl_seq_cpy(bmap->ineq[k], bmap->ineq[i],
1481 isl_seq_elim(bmap->ineq[k], bmap->ineq[j],
1482 1+d, 1+total, NULL);
1484 isl_basic_map_drop_inequality(bmap, i);
1487 if (n_lower > 0 && n_upper > 0) {
1488 bmap = normalize_constraints(bmap);
1489 bmap = remove_duplicate_constraints(bmap, NULL);
1490 bmap = isl_basic_map_gauss(bmap, NULL);
1491 bmap = isl_basic_map_convex_hull(bmap);
1494 if (F_ISSET(bmap, ISL_BASIC_MAP_EMPTY))
1498 F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1501 isl_basic_map_free(bmap);
1505 struct isl_basic_set *isl_basic_set_eliminate_vars(
1506 struct isl_basic_set *bset, unsigned pos, unsigned n)
1508 return (struct isl_basic_set *)isl_basic_map_eliminate_vars(
1509 (struct isl_basic_map *)bset, pos, n);
1512 /* Eliminate the specified n dimensions starting at first from the
1513 * constraints using Fourier-Motzkin, The dimensions themselves
1516 struct isl_set *isl_set_eliminate_dims(struct isl_set *set,
1517 unsigned first, unsigned n)
1524 set = isl_set_cow(set);
1527 isl_assert(set->ctx, first+n <= set->dim, goto error);
1529 for (i = 0; i < set->n; ++i) {
1530 set->p[i] = isl_basic_set_eliminate_vars(set->p[i],
1531 set->nparam + first, n);
1541 /* Project out n dimensions starting at first using Fourier-Motzkin */
1542 struct isl_set *isl_set_remove_dims(struct isl_set *set,
1543 unsigned first, unsigned n)
1545 set = isl_set_eliminate_dims(set, first, n);
1546 set = isl_set_drop_dims(set, first, n);
1550 /* Project out n inputs starting at first using Fourier-Motzkin */
1551 struct isl_map *isl_map_remove_inputs(struct isl_map *map,
1552 unsigned first, unsigned n)
1559 map = isl_map_cow(map);
1562 isl_assert(map->ctx, first+n <= map->n_in, goto error);
1564 for (i = 0; i < map->n; ++i) {
1565 map->p[i] = isl_basic_map_eliminate_vars(map->p[i],
1566 map->nparam + first, n);
1570 map = isl_map_drop_inputs(map, first, n);
1577 /* Project out n dimensions starting at first using Fourier-Motzkin */
1578 struct isl_basic_set *isl_basic_set_remove_dims(struct isl_basic_set *bset,
1579 unsigned first, unsigned n)
1581 bset = isl_basic_set_eliminate_vars(bset, bset->nparam + first, n);
1582 bset = isl_basic_set_drop_dims(bset, first, n);
1586 /* Elimininate divs based on inequalities
1588 static struct isl_basic_map *eliminate_divs_ineq(
1589 struct isl_basic_map *bmap, int *progress)
1594 struct isl_ctx *ctx;
1600 off = 1 + bmap->nparam + bmap->n_in + bmap->n_out;
1602 for (d = bmap->n_div - 1; d >= 0 ; --d) {
1603 for (i = 0; i < bmap->n_eq; ++i)
1604 if (!isl_int_is_zero(bmap->eq[i][off + d]))
1608 for (i = 0; i < bmap->n_ineq; ++i)
1609 if (isl_int_abs_gt(bmap->ineq[i][off + d], ctx->one))
1611 if (i < bmap->n_ineq)
1614 bmap = isl_basic_map_eliminate_vars(bmap, (off-1)+d, 1);
1615 if (F_ISSET(bmap, ISL_BASIC_MAP_EMPTY))
1617 bmap = isl_basic_map_drop_div(bmap, d);
1624 struct isl_basic_map *isl_basic_map_simplify(struct isl_basic_map *bmap)
1631 bmap = normalize_constraints(bmap);
1632 bmap = eliminate_divs_eq(bmap, &progress);
1633 bmap = eliminate_divs_ineq(bmap, &progress);
1634 bmap = isl_basic_map_gauss(bmap, &progress);
1635 bmap = remove_duplicate_divs(bmap, &progress);
1636 bmap = remove_duplicate_constraints(bmap, &progress);
1641 struct isl_basic_set *isl_basic_set_simplify(struct isl_basic_set *bset)
1643 return (struct isl_basic_set *)
1644 isl_basic_map_simplify((struct isl_basic_map *)bset);
1647 static void dump_term(struct isl_basic_map *bmap,
1648 isl_int c, int pos, FILE *out)
1650 unsigned in = bmap->n_in;
1651 unsigned dim = bmap->n_in + bmap->n_out;
1653 isl_int_print(out, c, 0);
1655 if (!isl_int_is_one(c))
1656 isl_int_print(out, c, 0);
1657 if (pos < 1 + bmap->nparam)
1658 fprintf(out, "p%d", pos - 1);
1659 else if (pos < 1 + bmap->nparam + in)
1660 fprintf(out, "i%d", pos - 1 - bmap->nparam);
1661 else if (pos < 1 + bmap->nparam + dim)
1662 fprintf(out, "o%d", pos - 1 - bmap->nparam - in);
1664 fprintf(out, "e%d", pos - 1 - bmap->nparam - dim);
1668 static void dump_constraint_sign(struct isl_basic_map *bmap, isl_int *c,
1669 int sign, FILE *out)
1673 unsigned len = 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
1677 for (i = 0, first = 1; i < len; ++i) {
1678 if (isl_int_sgn(c[i]) * sign <= 0)
1681 fprintf(out, " + ");
1683 isl_int_abs(v, c[i]);
1684 dump_term(bmap, v, i, out);
1691 static void dump_constraint(struct isl_basic_map *bmap, isl_int *c,
1692 const char *op, FILE *out, int indent)
1696 fprintf(out, "%*s", indent, "");
1698 dump_constraint_sign(bmap, c, 1, out);
1699 fprintf(out, " %s ", op);
1700 dump_constraint_sign(bmap, c, -1, out);
1704 for (i = bmap->n_div; i < bmap->extra; ++i) {
1705 if (isl_int_is_zero(c[1+bmap->nparam+bmap->n_in+bmap->n_out+i]))
1707 fprintf(out, "%*s", indent, "");
1708 fprintf(out, "ERROR: unused div coefficient not zero\n");
1712 static void dump_constraints(struct isl_basic_map *bmap,
1713 isl_int **c, unsigned n,
1714 const char *op, FILE *out, int indent)
1718 for (i = 0; i < n; ++i)
1719 dump_constraint(bmap, c[i], op, out, indent);
1722 static void dump_affine(struct isl_basic_map *bmap, isl_int *exp, FILE *out)
1726 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
1728 for (j = 0; j < 1 + total; ++j) {
1729 if (isl_int_is_zero(exp[j]))
1731 if (!first && isl_int_is_pos(exp[j]))
1733 dump_term(bmap, exp[j], j, out);
1738 static void dump(struct isl_basic_map *bmap, FILE *out, int indent)
1742 dump_constraints(bmap, bmap->eq, bmap->n_eq, "=", out, indent);
1743 dump_constraints(bmap, bmap->ineq, bmap->n_ineq, ">=", out, indent);
1745 for (i = 0; i < bmap->n_div; ++i) {
1746 fprintf(out, "%*s", indent, "");
1747 fprintf(out, "e%d = [(", i);
1748 dump_affine(bmap, bmap->div[i]+1, out);
1750 isl_int_print(out, bmap->div[i][0], 0);
1751 fprintf(out, "]\n");
1755 void isl_basic_set_dump(struct isl_basic_set *bset, FILE *out, int indent)
1758 fprintf(out, "null basic set\n");
1762 fprintf(out, "%*s", indent, "");
1763 fprintf(out, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n",
1764 bset->ref, bset->nparam, bset->dim, bset->extra,
1766 dump((struct isl_basic_map *)bset, out, indent);
1769 void isl_basic_map_dump(struct isl_basic_map *bmap, FILE *out, int indent)
1772 fprintf(out, "null basic map\n");
1776 fprintf(out, "%*s", indent, "");
1777 fprintf(out, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, flags: %x\n",
1779 bmap->nparam, bmap->n_in, bmap->n_out, bmap->extra, bmap->flags);
1780 dump(bmap, out, indent);
1783 int isl_inequality_negate(struct isl_basic_map *bmap, unsigned pos)
1785 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
1788 isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
1789 isl_seq_neg(bmap->ineq[pos], bmap->ineq[pos], 1 + total);
1790 isl_int_sub_ui(bmap->ineq[pos][0], bmap->ineq[pos][0], 1);
1791 F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1795 struct isl_set *isl_set_alloc(struct isl_ctx *ctx,
1796 unsigned nparam, unsigned dim, int n, unsigned flags)
1798 struct isl_set *set;
1800 isl_assert(ctx, n >= 0, return NULL);
1801 set = isl_alloc(ctx, struct isl_set,
1802 sizeof(struct isl_set) +
1803 n * sizeof(struct isl_basic_set *));
1812 set->nparam = nparam;
1819 struct isl_set *isl_set_dup(struct isl_set *set)
1822 struct isl_set *dup;
1827 dup = isl_set_alloc(set->ctx, set->nparam, set->dim, set->n, set->flags);
1830 for (i = 0; i < set->n; ++i)
1831 dup = isl_set_add(dup, isl_basic_set_copy(set->p[i]));
1835 struct isl_set *isl_set_from_basic_set(struct isl_basic_set *bset)
1837 struct isl_set *set;
1842 set = isl_set_alloc(bset->ctx, bset->nparam, bset->dim, 1, ISL_MAP_DISJOINT);
1844 isl_basic_set_free(bset);
1847 return isl_set_add(set, bset);
1850 struct isl_map *isl_map_from_basic_map(struct isl_basic_map *bmap)
1852 struct isl_map *map;
1857 map = isl_map_alloc(bmap->ctx, bmap->nparam, bmap->n_in, bmap->n_out, 1,
1860 isl_basic_map_free(bmap);
1863 return isl_map_add(map, bmap);
1866 struct isl_set *isl_set_add(struct isl_set *set, struct isl_basic_set *bset)
1870 isl_assert(set->ctx, set->nparam == bset->nparam, goto error);
1871 isl_assert(set->ctx, set->dim == bset->dim, goto error);
1872 isl_assert(set->ctx, set->n < set->size, goto error);
1873 set->p[set->n] = bset;
1880 isl_basic_set_free(bset);
1884 void isl_set_free(struct isl_set *set)
1894 isl_ctx_deref(set->ctx);
1895 for (i = 0; i < set->n; ++i)
1896 isl_basic_set_free(set->p[i]);
1900 void isl_set_dump(struct isl_set *set, FILE *out, int indent)
1905 fprintf(out, "null set\n");
1909 fprintf(out, "%*s", indent, "");
1910 fprintf(out, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
1911 set->ref, set->n, set->nparam, set->dim, set->flags);
1912 for (i = 0; i < set->n; ++i) {
1913 fprintf(out, "%*s", indent, "");
1914 fprintf(out, "basic set %d:\n", i);
1915 isl_basic_set_dump(set->p[i], out, indent+4);
1919 void isl_map_dump(struct isl_map *map, FILE *out, int indent)
1924 fprintf(out, "null map\n");
1928 fprintf(out, "%*s", indent, "");
1929 fprintf(out, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, flags: %x\n",
1930 map->ref, map->n, map->nparam, map->n_in, map->n_out,
1932 for (i = 0; i < map->n; ++i) {
1933 fprintf(out, "%*s", indent, "");
1934 fprintf(out, "basic map %d:\n", i);
1935 isl_basic_map_dump(map->p[i], out, indent+4);
1939 struct isl_basic_map *isl_basic_map_intersect_domain(
1940 struct isl_basic_map *bmap, struct isl_basic_set *bset)
1942 struct isl_basic_map *bmap_domain;
1947 isl_assert(bset->ctx, bset->dim == bmap->n_in, goto error);
1948 isl_assert(bset->ctx, bset->nparam == bmap->nparam, goto error);
1950 bmap = isl_basic_map_extend(bmap,
1951 bset->nparam, bmap->n_in, bmap->n_out,
1952 bset->n_div, bset->n_eq, bset->n_ineq);
1955 bmap_domain = isl_basic_map_from_basic_set(bset,
1957 bmap = add_constraints(bmap, bmap_domain, 0, 0);
1959 bmap = isl_basic_map_simplify(bmap);
1960 return isl_basic_map_finalize(bmap);
1962 isl_basic_map_free(bmap);
1963 isl_basic_set_free(bset);
1967 struct isl_basic_map *isl_basic_map_intersect_range(
1968 struct isl_basic_map *bmap, struct isl_basic_set *bset)
1970 struct isl_basic_map *bmap_range;
1975 isl_assert(bset->ctx, bset->dim == bmap->n_out, goto error);
1976 isl_assert(bset->ctx, bset->nparam == bmap->nparam, goto error);
1978 bmap = isl_basic_map_extend(bmap,
1979 bset->nparam, bmap->n_in, bmap->n_out,
1980 bset->n_div, bset->n_eq, bset->n_ineq);
1983 bmap_range = isl_basic_map_from_basic_set(bset,
1985 bmap = add_constraints(bmap, bmap_range, 0, 0);
1987 bmap = isl_basic_map_simplify(bmap);
1988 return isl_basic_map_finalize(bmap);
1990 isl_basic_map_free(bmap);
1991 isl_basic_set_free(bset);
1995 struct isl_basic_map *isl_basic_map_intersect(
1996 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
1998 if (!bmap1 || !bmap2)
2001 isl_assert(bmap1->ctx, bmap1->nparam == bmap2->nparam, goto error);
2002 isl_assert(bmap1->ctx, bmap1->n_in == bmap2->n_in, goto error);
2003 isl_assert(bmap1->ctx, bmap1->n_out == bmap2->n_out, goto error);
2005 bmap1 = isl_basic_map_extend(bmap1,
2006 bmap1->nparam, bmap1->n_in, bmap1->n_out,
2007 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
2010 bmap1 = add_constraints(bmap1, bmap2, 0, 0);
2012 bmap1 = isl_basic_map_simplify(bmap1);
2013 return isl_basic_map_finalize(bmap1);
2015 isl_basic_map_free(bmap1);
2016 isl_basic_map_free(bmap2);
2020 struct isl_basic_set *isl_basic_set_intersect(
2021 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
2023 return (struct isl_basic_set *)
2024 isl_basic_map_intersect(
2025 (struct isl_basic_map *)bset1,
2026 (struct isl_basic_map *)bset2);
2029 struct isl_map *isl_map_intersect(struct isl_map *map1, struct isl_map *map2)
2032 struct isl_map *result;
2038 if (F_ISSET(map1, ISL_MAP_DISJOINT) &&
2039 F_ISSET(map2, ISL_MAP_DISJOINT))
2040 FL_SET(flags, ISL_MAP_DISJOINT);
2042 result = isl_map_alloc(map1->ctx, map1->nparam, map1->n_in, map1->n_out,
2043 map1->n * map2->n, flags);
2046 for (i = 0; i < map1->n; ++i)
2047 for (j = 0; j < map2->n; ++j) {
2048 struct isl_basic_map *part;
2049 part = isl_basic_map_intersect(
2050 isl_basic_map_copy(map1->p[i]),
2051 isl_basic_map_copy(map2->p[j]));
2052 if (isl_basic_map_is_empty(part))
2053 isl_basic_map_free(part);
2055 result = isl_map_add(result, part);
2068 struct isl_set *isl_set_intersect(struct isl_set *set1, struct isl_set *set2)
2070 return (struct isl_set *)
2071 isl_map_intersect((struct isl_map *)set1,
2072 (struct isl_map *)set2);
2075 struct isl_basic_map *isl_basic_map_reverse(struct isl_basic_map *bmap)
2077 struct isl_basic_set *bset;
2082 bmap = isl_basic_map_cow(bmap);
2086 bset = isl_basic_set_from_basic_map(bmap);
2087 bset = isl_basic_set_swap_vars(bset, in);
2088 return isl_basic_map_from_basic_set(bset, bset->dim-in, in);
2091 /* Turn final n dimensions into existentially quantified variables.
2093 struct isl_basic_set *isl_basic_set_project_out(
2094 struct isl_basic_set *bset, unsigned n, unsigned flags)
2104 isl_assert(bset->ctx, n <= bset->dim, goto error);
2109 bset = isl_basic_set_cow(bset);
2111 row_size = 1 + bset->nparam + bset->dim + bset->extra;
2112 old = bset->block2.data;
2113 bset->block2 = isl_blk_extend(bset->ctx, bset->block2,
2114 (bset->extra + n) * (1 + row_size));
2115 if (!bset->block2.data)
2117 new_div = isl_alloc_array(ctx, isl_int *, bset->extra + n);
2120 for (i = 0; i < n; ++i) {
2121 new_div[i] = bset->block2.data +
2122 (bset->extra + i) * (1 + row_size);
2123 isl_seq_clr(new_div[i], 1 + row_size);
2125 for (i = 0; i < bset->extra; ++i)
2126 new_div[n + i] = bset->block2.data + (bset->div[i] - old);
2128 bset->div = new_div;
2132 bset = isl_basic_set_simplify(bset);
2133 return isl_basic_set_finalize(bset);
2135 isl_basic_set_free(bset);
2139 struct isl_basic_map *isl_basic_map_apply_range(
2140 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2142 struct isl_basic_set *bset;
2143 unsigned n_in, n_out;
2145 if (!bmap1 || !bmap2)
2148 isl_assert(bmap->ctx, bmap1->n_out == bmap2->n_in, goto error);
2149 isl_assert(bmap->ctx, bmap1->nparam == bmap2->nparam, goto error);
2152 n_out = bmap2->n_out;
2154 bmap2 = isl_basic_map_reverse(bmap2);
2157 bmap1 = isl_basic_map_extend(bmap1, bmap1->nparam,
2158 bmap1->n_in + bmap2->n_in, bmap1->n_out,
2159 bmap2->extra, bmap2->n_eq, bmap2->n_ineq);
2162 bmap1 = add_constraints(bmap1, bmap2, bmap1->n_in - bmap2->n_in, 0);
2163 bmap1 = isl_basic_map_simplify(bmap1);
2164 bset = isl_basic_set_from_basic_map(bmap1);
2165 bset = isl_basic_set_project_out(bset,
2166 bset->dim - (n_in + n_out), 0);
2167 return isl_basic_map_from_basic_set(bset, n_in, n_out);
2169 isl_basic_map_free(bmap1);
2170 isl_basic_map_free(bmap2);
2174 struct isl_basic_set *isl_basic_set_apply(
2175 struct isl_basic_set *bset, struct isl_basic_map *bmap)
2180 isl_assert(bset->ctx, bset->dim == bmap->n_in, goto error);
2182 return (struct isl_basic_set *)
2183 isl_basic_map_apply_range((struct isl_basic_map *)bset, bmap);
2185 isl_basic_set_free(bset);
2186 isl_basic_map_free(bmap);
2190 struct isl_basic_map *isl_basic_map_apply_domain(
2191 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2193 if (!bmap1 || !bmap2)
2196 isl_assert(ctx, bmap1->n_in == bmap2->n_in, goto error);
2197 isl_assert(ctx, bmap1->nparam == bmap2->nparam, goto error);
2199 bmap1 = isl_basic_map_reverse(bmap1);
2200 bmap1 = isl_basic_map_apply_range(bmap1, bmap2);
2201 return isl_basic_map_reverse(bmap1);
2203 isl_basic_map_free(bmap1);
2204 isl_basic_map_free(bmap2);
2208 static struct isl_basic_map *var_equal(struct isl_ctx *ctx,
2209 struct isl_basic_map *bmap, unsigned pos)
2212 i = isl_basic_map_alloc_equality(bmap);
2215 isl_seq_clr(bmap->eq[i],
2216 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div);
2217 isl_int_set_si(bmap->eq[i][1+bmap->nparam+pos], -1);
2218 isl_int_set_si(bmap->eq[i][1+bmap->nparam+bmap->n_in+pos], 1);
2219 return isl_basic_map_finalize(bmap);
2221 isl_basic_map_free(bmap);
2225 static struct isl_basic_map *var_more(struct isl_ctx *ctx,
2226 struct isl_basic_map *bmap, unsigned pos)
2229 i = isl_basic_map_alloc_inequality(bmap);
2232 isl_seq_clr(bmap->ineq[i],
2233 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div);
2234 isl_int_set_si(bmap->ineq[i][0], -1);
2235 isl_int_set_si(bmap->ineq[i][1+bmap->nparam+pos], -1);
2236 isl_int_set_si(bmap->ineq[i][1+bmap->nparam+bmap->n_in+pos], 1);
2237 return isl_basic_map_finalize(bmap);
2239 isl_basic_map_free(bmap);
2243 static struct isl_basic_map *var_less(struct isl_ctx *ctx,
2244 struct isl_basic_map *bmap, unsigned pos)
2247 i = isl_basic_map_alloc_inequality(bmap);
2250 isl_seq_clr(bmap->ineq[i],
2251 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div);
2252 isl_int_set_si(bmap->ineq[i][0], -1);
2253 isl_int_set_si(bmap->ineq[i][1+bmap->nparam+pos], 1);
2254 isl_int_set_si(bmap->ineq[i][1+bmap->nparam+bmap->n_in+pos], -1);
2255 return isl_basic_map_finalize(bmap);
2257 isl_basic_map_free(bmap);
2261 struct isl_basic_map *isl_basic_map_equal(struct isl_ctx *ctx,
2262 unsigned nparam, unsigned in, unsigned out, unsigned n_equal)
2265 struct isl_basic_map *bmap;
2266 bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, n_equal, 0);
2269 for (i = 0; i < n_equal && bmap; ++i)
2270 bmap = var_equal(ctx, bmap, i);
2271 return isl_basic_map_finalize(bmap);
2274 struct isl_basic_map *isl_basic_map_less_at(struct isl_ctx *ctx,
2275 unsigned nparam, unsigned in, unsigned out, unsigned pos)
2278 struct isl_basic_map *bmap;
2279 bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, pos, 1);
2282 for (i = 0; i < pos && bmap; ++i)
2283 bmap = var_equal(ctx, bmap, i);
2285 bmap = var_less(ctx, bmap, pos);
2286 return isl_basic_map_finalize(bmap);
2289 struct isl_basic_map *isl_basic_map_more_at(struct isl_ctx *ctx,
2290 unsigned nparam, unsigned in, unsigned out, unsigned pos)
2293 struct isl_basic_map *bmap;
2294 bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, pos, 1);
2297 for (i = 0; i < pos && bmap; ++i)
2298 bmap = var_equal(ctx, bmap, i);
2300 bmap = var_more(ctx, bmap, pos);
2301 return isl_basic_map_finalize(bmap);
2304 struct isl_basic_map *isl_basic_map_from_basic_set(
2305 struct isl_basic_set *bset, unsigned n_in, unsigned n_out)
2307 struct isl_basic_map *bmap;
2309 bset = isl_basic_set_cow(bset);
2313 isl_assert(ctx, bset->dim == n_in + n_out, goto error);
2314 bmap = (struct isl_basic_map *) bset;
2316 bmap->n_out = n_out;
2317 return isl_basic_map_finalize(bmap);
2319 isl_basic_set_free(bset);
2323 struct isl_basic_set *isl_basic_set_from_basic_map(struct isl_basic_map *bmap)
2327 if (bmap->n_in == 0)
2328 return (struct isl_basic_set *)bmap;
2329 bmap = isl_basic_map_cow(bmap);
2332 bmap->n_out += bmap->n_in;
2334 bmap = isl_basic_map_finalize(bmap);
2335 return (struct isl_basic_set *)bmap;
2340 /* For a div d = floor(f/m), add the constraints
2343 * -(f-(n-1)) + m d >= 0
2345 * Note that the second constraint is the negation of
2349 static int add_div_constraints(struct isl_basic_map *bmap, unsigned div)
2352 unsigned div_pos = 1 + bmap->nparam + bmap->n_in + bmap->n_out + div;
2353 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
2355 i = isl_basic_map_alloc_inequality(bmap);
2358 isl_seq_cpy(bmap->ineq[i], bmap->div[div]+1, 1+total);
2359 isl_int_neg(bmap->ineq[i][div_pos], bmap->div[div][0]);
2361 j = isl_basic_map_alloc_inequality(bmap);
2364 isl_seq_neg(bmap->ineq[j], bmap->ineq[i], 1 + total);
2365 isl_int_add(bmap->ineq[j][0], bmap->ineq[j][0], bmap->ineq[j][div_pos]);
2366 isl_int_sub_ui(bmap->ineq[j][0], bmap->ineq[j][0], 1);
2370 struct isl_basic_set *isl_basic_map_underlying_set(
2371 struct isl_basic_map *bmap)
2375 if (bmap->nparam == 0 && bmap->n_in == 0 && bmap->n_div == 0)
2376 return (struct isl_basic_set *)bmap;
2377 bmap = isl_basic_map_cow(bmap);
2380 bmap->n_out += bmap->nparam + bmap->n_in + bmap->n_div;
2383 bmap->extra -= bmap->n_div;
2385 bmap = isl_basic_map_finalize(bmap);
2386 return (struct isl_basic_set *)bmap;
2391 struct isl_basic_map *isl_basic_map_overlying_set(
2392 struct isl_basic_set *bset, struct isl_basic_map *like)
2394 struct isl_basic_map *bmap;
2395 struct isl_ctx *ctx;
2402 isl_assert(ctx, bset->dim ==
2403 like->nparam + like->n_in + like->n_out + like->n_div,
2405 if (like->nparam == 0 && like->n_in == 0 && like->n_div == 0) {
2406 isl_basic_map_free(like);
2407 return (struct isl_basic_map *)bset;
2409 bset = isl_basic_set_cow(bset);
2412 total = bset->dim + bset->extra;
2413 bmap = (struct isl_basic_map *)bset;
2414 bmap->nparam = like->nparam;
2415 bmap->n_in = like->n_in;
2416 bmap->n_out = like->n_out;
2417 bmap->extra += like->n_div;
2420 ltotal = total - bmap->extra + like->extra;
2423 bmap->block2 = isl_blk_extend(ctx, bmap->block2,
2424 bmap->extra * (1 + 1 + total));
2425 if (isl_blk_is_error(bmap->block2))
2427 bmap->div = isl_realloc_array(ctx, bmap->div, isl_int *,
2431 bmap = isl_basic_map_extend(bmap, bmap->nparam,
2432 bmap->n_in, bmap->n_out, 0, 0, 2 * like->n_div);
2433 for (i = 0; i < like->n_div; ++i) {
2434 k = isl_basic_map_alloc_div(bmap);
2437 isl_seq_cpy(bmap->div[k], like->div[i], 1 + 1 + ltotal);
2438 isl_seq_clr(bmap->div[k]+1+1+ltotal, total - ltotal);
2439 if (add_div_constraints(bmap, k) < 0)
2443 isl_basic_map_free(like);
2444 bmap = isl_basic_map_finalize(bmap);
2447 isl_basic_map_free(like);
2448 isl_basic_set_free(bset);
2452 struct isl_basic_set *isl_basic_set_from_underlying_set(
2453 struct isl_basic_set *bset, struct isl_basic_set *like)
2455 return (struct isl_basic_set *)
2456 isl_basic_map_overlying_set(bset, (struct isl_basic_map *)like);
2459 struct isl_set *isl_set_from_underlying_set(
2460 struct isl_set *set, struct isl_basic_set *like)
2466 isl_assert(set->ctx, set->dim == like->nparam + like->dim + like->n_div,
2468 if (like->nparam == 0 && like->n_div == 0) {
2469 isl_basic_set_free(like);
2472 set = isl_set_cow(set);
2475 for (i = 0; i < set->n; ++i) {
2476 set->p[i] = isl_basic_set_from_underlying_set(set->p[i],
2477 isl_basic_set_copy(like));
2481 set->nparam = like->nparam;
2482 set->dim = like->dim;
2483 isl_basic_set_free(like);
2486 isl_basic_set_free(like);
2491 struct isl_set *isl_map_underlying_set(struct isl_map *map)
2495 map = isl_map_align_divs(map);
2496 map = isl_map_cow(map);
2500 for (i = 0; i < map->n; ++i) {
2501 map->p[i] = (struct isl_basic_map *)
2502 isl_basic_map_underlying_set(map->p[i]);
2507 map->n_out += map->nparam + map->n_in;
2509 map->n_out = map->p[0]->n_out;
2512 return (struct isl_set *)map;
2518 struct isl_set *isl_set_to_underlying_set(struct isl_set *set)
2520 return (struct isl_set *)isl_map_underlying_set((struct isl_map *)set);
2523 struct isl_basic_set *isl_basic_map_domain(struct isl_basic_map *bmap)
2525 struct isl_basic_set *domain;
2529 n_out = bmap->n_out;
2530 domain = isl_basic_set_from_basic_map(bmap);
2531 return isl_basic_set_project_out(domain, n_out, 0);
2534 struct isl_basic_set *isl_basic_map_range(struct isl_basic_map *bmap)
2536 return isl_basic_map_domain(isl_basic_map_reverse(bmap));
2539 struct isl_set *isl_map_range(struct isl_map *map)
2542 struct isl_set *set;
2546 map = isl_map_cow(map);
2550 set = (struct isl_set *) map;
2552 for (i = 0; i < map->n; ++i) {
2553 set->p[i] = isl_basic_map_range(map->p[i]);
2557 F_CLR(set, ISL_MAP_DISJOINT);
2558 F_CLR(set, ISL_SET_NORMALIZED);
2565 struct isl_map *isl_map_from_set(struct isl_set *set,
2566 unsigned n_in, unsigned n_out)
2569 struct isl_map *map = NULL;
2573 isl_assert(set->ctx, set->dim == n_in + n_out, goto error);
2574 set = isl_set_cow(set);
2577 map = (struct isl_map *)set;
2578 for (i = 0; i < set->n; ++i) {
2579 map->p[i] = isl_basic_map_from_basic_set(
2580 set->p[i], n_in, n_out);
2592 struct isl_set *isl_set_from_map(struct isl_map *map)
2595 struct isl_set *set = NULL;
2599 map = isl_map_cow(map);
2602 map->n_out += map->n_in;
2604 set = (struct isl_set *)map;
2605 for (i = 0; i < map->n; ++i) {
2606 set->p[i] = isl_basic_set_from_basic_map(map->p[i]);
2616 struct isl_map *isl_map_alloc(struct isl_ctx *ctx,
2617 unsigned nparam, unsigned in, unsigned out, int n,
2620 struct isl_map *map;
2622 map = isl_alloc(ctx, struct isl_map,
2623 sizeof(struct isl_map) +
2624 n * sizeof(struct isl_basic_map *));
2633 map->nparam = nparam;
2640 struct isl_basic_map *isl_basic_map_empty(struct isl_ctx *ctx,
2641 unsigned nparam, unsigned in, unsigned out)
2643 struct isl_basic_map *bmap;
2644 bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, 1, 0);
2645 bmap = isl_basic_map_set_to_empty(bmap);
2649 struct isl_basic_set *isl_basic_set_empty(struct isl_ctx *ctx,
2650 unsigned nparam, unsigned dim)
2652 struct isl_basic_set *bset;
2653 bset = isl_basic_set_alloc(ctx, nparam, dim, 0, 1, 0);
2654 bset = isl_basic_set_set_to_empty(bset);
2658 struct isl_basic_map *isl_basic_map_universe(struct isl_ctx *ctx,
2659 unsigned nparam, unsigned in, unsigned out)
2661 struct isl_basic_map *bmap;
2662 bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, 0, 0);
2666 struct isl_basic_set *isl_basic_set_universe(struct isl_ctx *ctx,
2667 unsigned nparam, unsigned dim)
2669 struct isl_basic_set *bset;
2670 bset = isl_basic_set_alloc(ctx, nparam, dim, 0, 0, 0);
2674 struct isl_map *isl_map_empty(struct isl_ctx *ctx,
2675 unsigned nparam, unsigned in, unsigned out)
2677 return isl_map_alloc(ctx, nparam, in, out, 0, ISL_MAP_DISJOINT);
2680 struct isl_set *isl_set_empty(struct isl_ctx *ctx,
2681 unsigned nparam, unsigned dim)
2683 return isl_set_alloc(ctx, nparam, dim, 0, ISL_MAP_DISJOINT);
2686 struct isl_map *isl_map_dup(struct isl_map *map)
2689 struct isl_map *dup;
2693 dup = isl_map_alloc(map->ctx, map->nparam, map->n_in, map->n_out, map->n,
2695 for (i = 0; i < map->n; ++i)
2696 dup = isl_map_add(dup, isl_basic_map_copy(map->p[i]));
2700 struct isl_map *isl_map_add(struct isl_map *map, struct isl_basic_map *bmap)
2704 isl_assert(map->ctx, map->nparam == bmap->nparam, goto error);
2705 isl_assert(map->ctx, map->n_in == bmap->n_in, goto error);
2706 isl_assert(map->ctx, map->n_out == bmap->n_out, goto error);
2707 isl_assert(map->ctx, map->n < map->size, goto error);
2708 map->p[map->n] = bmap;
2710 F_CLR(map, ISL_MAP_NORMALIZED);
2716 isl_basic_map_free(bmap);
2720 void isl_map_free(struct isl_map *map)
2730 isl_ctx_deref(map->ctx);
2731 for (i = 0; i < map->n; ++i)
2732 isl_basic_map_free(map->p[i]);
2736 struct isl_map *isl_map_extend(struct isl_map *base,
2737 unsigned nparam, unsigned n_in, unsigned n_out)
2741 base = isl_map_cow(base);
2745 isl_assert(base->ctx, base->nparam <= nparam, goto error);
2746 isl_assert(base->ctx, base->n_in <= n_in, goto error);
2747 isl_assert(base->ctx, base->n_out <= n_out, goto error);
2748 base->nparam = nparam;
2750 base->n_out = n_out;
2751 for (i = 0; i < base->n; ++i) {
2752 base->p[i] = isl_basic_map_extend(base->p[i],
2753 nparam, n_in, n_out, 0, 0, 0);
2763 struct isl_set *isl_set_extend(struct isl_set *base,
2764 unsigned nparam, unsigned dim)
2766 return (struct isl_set *)isl_map_extend((struct isl_map *)base,
2770 static struct isl_basic_map *isl_basic_map_fix_var(struct isl_basic_map *bmap,
2771 unsigned var, int value)
2775 bmap = isl_basic_map_cow(bmap);
2776 bmap = isl_basic_map_extend(bmap,
2777 bmap->nparam, bmap->n_in, bmap->n_out, 0, 1, 0);
2778 j = isl_basic_map_alloc_equality(bmap);
2781 isl_seq_clr(bmap->eq[j],
2782 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div);
2783 isl_int_set_si(bmap->eq[j][1 + var], -1);
2784 isl_int_set_si(bmap->eq[j][0], value);
2785 bmap = isl_basic_map_simplify(bmap);
2786 return isl_basic_map_finalize(bmap);
2788 isl_basic_map_free(bmap);
2792 struct isl_basic_map *isl_basic_map_fix_input_si(struct isl_basic_map *bmap,
2793 unsigned input, int value)
2797 isl_assert(bmap->ctx, input < bmap->n_in, goto error);
2798 return isl_basic_map_fix_var(bmap, bmap->nparam + input, value);
2800 isl_basic_map_free(bmap);
2804 struct isl_basic_set *isl_basic_set_fix_dim_si(struct isl_basic_set *bset,
2805 unsigned dim, int value)
2809 isl_assert(bset->ctx, dim < bset->dim, goto error);
2810 return (struct isl_basic_set *)
2811 isl_basic_map_fix_var((struct isl_basic_map *)bset,
2812 bset->nparam + dim, value);
2814 isl_basic_set_free(bset);
2818 struct isl_map *isl_map_fix_input_si(struct isl_map *map,
2819 unsigned input, int value)
2823 map = isl_map_cow(map);
2827 isl_assert(ctx, input < map->n_in, goto error);
2828 for (i = 0; i < map->n; ++i) {
2829 map->p[i] = isl_basic_map_fix_input_si(map->p[i], input, value);
2833 F_CLR(map, ISL_MAP_NORMALIZED);
2840 struct isl_set *isl_set_fix_dim_si(struct isl_set *set, unsigned dim, int value)
2844 set = isl_set_cow(set);
2848 isl_assert(set->ctx, dim < set->dim, goto error);
2849 for (i = 0; i < set->n; ++i) {
2850 set->p[i] = isl_basic_set_fix_dim_si(set->p[i], dim, value);
2860 struct isl_basic_set *isl_basic_set_lower_bound_dim(struct isl_basic_set *bset,
2861 unsigned dim, isl_int value)
2865 bset = isl_basic_set_cow(bset);
2866 bset = isl_basic_set_extend(bset, bset->nparam, bset->dim, 0, 0, 1);
2867 j = isl_basic_set_alloc_inequality(bset);
2870 isl_seq_clr(bset->ineq[j], 1 + bset->nparam + bset->dim + bset->n_div);
2871 isl_int_set_si(bset->ineq[j][1 + bset->nparam + dim], 1);
2872 isl_int_neg(bset->ineq[j][0], value);
2873 bset = isl_basic_set_simplify(bset);
2874 return isl_basic_set_finalize(bset);
2876 isl_basic_set_free(bset);
2880 struct isl_set *isl_set_lower_bound_dim(struct isl_set *set, unsigned dim,
2885 set = isl_set_cow(set);
2889 isl_assert(set->ctx, dim < set->dim, goto error);
2890 for (i = 0; i < set->n; ++i) {
2891 set->p[i] = isl_basic_set_lower_bound_dim(set->p[i], dim, value);
2901 struct isl_map *isl_map_reverse(struct isl_map *map)
2906 map = isl_map_cow(map);
2911 map->n_in = map->n_out;
2913 for (i = 0; i < map->n; ++i) {
2914 map->p[i] = isl_basic_map_reverse(map->p[i]);
2918 F_CLR(map, ISL_MAP_NORMALIZED);
2925 struct isl_map *isl_basic_map_lexmax(
2926 struct isl_basic_map *bmap, struct isl_basic_set *dom,
2927 struct isl_set **empty)
2929 return isl_pip_basic_map_lexmax(bmap, dom, empty);
2932 struct isl_map *isl_basic_map_lexmin(
2933 struct isl_basic_map *bmap, struct isl_basic_set *dom,
2934 struct isl_set **empty)
2936 return isl_pip_basic_map_lexmin(bmap, dom, empty);
2939 struct isl_set *isl_basic_set_lexmin(struct isl_basic_set *bset)
2941 struct isl_basic_map *bmap = NULL;
2942 struct isl_basic_set *dom = NULL;
2943 struct isl_map *min;
2947 bmap = isl_basic_map_from_basic_set(bset, 0, bset->dim);
2950 dom = isl_basic_set_alloc(bmap->ctx, bmap->nparam, 0, 0, 0, 0);
2953 min = isl_basic_map_lexmin(bmap, dom, NULL);
2954 return isl_map_range(min);
2956 isl_basic_map_free(bmap);
2960 struct isl_map *isl_basic_map_compute_divs(struct isl_basic_map *bmap)
2964 if (bmap->n_div == 0)
2965 return isl_map_from_basic_map(bmap);
2966 return isl_pip_basic_map_compute_divs(bmap);
2969 struct isl_map *isl_map_compute_divs(struct isl_map *map)
2972 struct isl_map *res;
2978 res = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[0]));
2979 for (i = 1 ; i < map->n; ++i) {
2981 r2 = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[i]));
2982 if (F_ISSET(map, ISL_MAP_DISJOINT))
2983 res = isl_map_union_disjoint(res, r2);
2985 res = isl_map_union(res, r2);
2992 struct isl_set *isl_basic_set_compute_divs(struct isl_basic_set *bset)
2994 return (struct isl_set *)
2995 isl_basic_map_compute_divs((struct isl_basic_map *)bset);
2998 struct isl_set *isl_set_compute_divs(struct isl_set *set)
3000 return (struct isl_set *)
3001 isl_map_compute_divs((struct isl_map *)set);
3004 struct isl_set *isl_map_domain(struct isl_map *map)
3007 struct isl_set *set;
3012 map = isl_map_cow(map);
3016 set = (struct isl_set *)map;
3017 set->dim = map->n_in;
3019 for (i = 0; i < map->n; ++i) {
3020 set->p[i] = isl_basic_map_domain(map->p[i]);
3024 F_CLR(set, ISL_MAP_DISJOINT);
3025 F_CLR(set, ISL_SET_NORMALIZED);
3032 struct isl_map *isl_map_union_disjoint(
3033 struct isl_map *map1, struct isl_map *map2)
3037 struct isl_map *map = NULL;
3051 isl_assert(map1->ctx, map1->nparam == map2->nparam, goto error);
3052 isl_assert(map1->ctx, map1->n_in == map2->n_in, goto error);
3053 isl_assert(map1->ctx, map1->n_out == map2->n_out, goto error);
3055 if (F_ISSET(map1, ISL_MAP_DISJOINT) &&
3056 F_ISSET(map2, ISL_MAP_DISJOINT))
3057 FL_SET(flags, ISL_MAP_DISJOINT);
3059 map = isl_map_alloc(map1->ctx, map1->nparam, map1->n_in, map1->n_out,
3060 map1->n + map2->n, flags);
3063 for (i = 0; i < map1->n; ++i) {
3064 map = isl_map_add(map,
3065 isl_basic_map_copy(map1->p[i]));
3069 for (i = 0; i < map2->n; ++i) {
3070 map = isl_map_add(map,
3071 isl_basic_map_copy(map2->p[i]));
3085 struct isl_map *isl_map_union(struct isl_map *map1, struct isl_map *map2)
3087 map1 = isl_map_union_disjoint(map1, map2);
3091 F_CLR(map1, ISL_MAP_DISJOINT);
3095 struct isl_set *isl_set_union_disjoint(
3096 struct isl_set *set1, struct isl_set *set2)
3098 return (struct isl_set *)
3099 isl_map_union_disjoint(
3100 (struct isl_map *)set1, (struct isl_map *)set2);
3103 struct isl_set *isl_set_union(struct isl_set *set1, struct isl_set *set2)
3105 return (struct isl_set *)
3106 isl_map_union((struct isl_map *)set1, (struct isl_map *)set2);
3109 struct isl_map *isl_map_intersect_range(
3110 struct isl_map *map, struct isl_set *set)
3113 struct isl_map *result;
3119 if (F_ISSET(map, ISL_MAP_DISJOINT) &&
3120 F_ISSET(set, ISL_MAP_DISJOINT))
3121 FL_SET(flags, ISL_MAP_DISJOINT);
3123 result = isl_map_alloc(map->ctx, map->nparam, map->n_in, map->n_out,
3124 map->n * set->n, flags);
3127 for (i = 0; i < map->n; ++i)
3128 for (j = 0; j < set->n; ++j) {
3129 result = isl_map_add(result,
3130 isl_basic_map_intersect_range(
3131 isl_basic_map_copy(map->p[i]),
3132 isl_basic_set_copy(set->p[j])));
3145 struct isl_map *isl_map_intersect_domain(
3146 struct isl_map *map, struct isl_set *set)
3148 return isl_map_reverse(
3149 isl_map_intersect_range(isl_map_reverse(map), set));
3152 struct isl_map *isl_map_apply_domain(
3153 struct isl_map *map1, struct isl_map *map2)
3157 map1 = isl_map_reverse(map1);
3158 map1 = isl_map_apply_range(map1, map2);
3159 return isl_map_reverse(map1);
3166 struct isl_map *isl_map_apply_range(
3167 struct isl_map *map1, struct isl_map *map2)
3169 struct isl_map *result;
3175 isl_assert(map1->ctx, map1->nparam == map2->nparam, goto error);
3176 isl_assert(map1->ctx, map1->n_out == map2->n_in, goto error);
3178 result = isl_map_alloc(map1->ctx, map1->nparam, map1->n_in, map2->n_out,
3179 map1->n * map2->n, 0);
3182 for (i = 0; i < map1->n; ++i)
3183 for (j = 0; j < map2->n; ++j) {
3184 result = isl_map_add(result,
3185 isl_basic_map_apply_range(
3186 isl_basic_map_copy(map1->p[i]),
3187 isl_basic_map_copy(map2->p[j])));
3193 if (result && result->n <= 1)
3194 F_SET(result, ISL_MAP_DISJOINT);
3203 * returns range - domain
3205 struct isl_basic_set *isl_basic_map_deltas(struct isl_basic_map *bmap)
3207 struct isl_basic_set *bset;
3213 isl_assert(bmap->ctx, bmap->n_in == bmap->n_out, goto error);
3215 bset = isl_basic_set_from_basic_map(bmap);
3216 bset = isl_basic_set_extend(bset, bset->nparam, 3*dim, 0,
3218 bset = isl_basic_set_swap_vars(bset, 2*dim);
3219 for (i = 0; i < dim; ++i) {
3220 int j = isl_basic_map_alloc_equality(
3221 (struct isl_basic_map *)bset);
3224 isl_seq_clr(bset->eq[j],
3225 1 + bset->nparam + bset->dim + bset->n_div);
3226 isl_int_set_si(bset->eq[j][1+bset->nparam+i], 1);
3227 isl_int_set_si(bset->eq[j][1+bset->nparam+dim+i], 1);
3228 isl_int_set_si(bset->eq[j][1+bset->nparam+2*dim+i], -1);
3230 return isl_basic_set_project_out(bset, 2*dim, 0);
3232 isl_basic_map_free(bmap);
3237 * returns range - domain
3239 struct isl_set *isl_map_deltas(struct isl_map *map)
3242 struct isl_set *result;
3247 isl_assert(map->ctx, map->n_in == map->n_out, goto error);
3248 result = isl_set_alloc(map->ctx, map->nparam, map->n_in, map->n, map->flags);
3251 for (i = 0; i < map->n; ++i)
3252 result = isl_set_add(result,
3253 isl_basic_map_deltas(isl_basic_map_copy(map->p[i])));
3261 /* If the only constraints a div d=floor(f/m)
3262 * appears in are its two defining constraints
3265 * -(f - (m - 1)) + m d >= 0
3267 * then it can safely be removed.
3269 static int div_is_redundant(struct isl_basic_map *bmap, int div)
3272 unsigned pos = 1 + bmap->nparam + bmap->n_in + bmap->n_out + div;
3274 for (i = 0; i < bmap->n_eq; ++i)
3275 if (!isl_int_is_zero(bmap->eq[i][pos]))
3278 for (i = 0; i < bmap->n_ineq; ++i) {
3279 if (isl_int_is_zero(bmap->ineq[i][pos]))
3281 if (isl_int_eq(bmap->ineq[i][pos], bmap->div[div][0])) {
3283 isl_int_sub(bmap->div[div][1],
3284 bmap->div[div][1], bmap->div[div][0]);
3285 isl_int_add_ui(bmap->div[div][1], bmap->div[div][1], 1);
3286 neg = isl_seq_is_neg(bmap->ineq[i], bmap->div[div]+1, pos);
3287 isl_int_sub_ui(bmap->div[div][1], bmap->div[div][1], 1);
3288 isl_int_add(bmap->div[div][1],
3289 bmap->div[div][1], bmap->div[div][0]);
3292 if (isl_seq_first_non_zero(bmap->ineq[i]+pos+1,
3293 bmap->n_div-div-1) != -1)
3295 } else if (isl_int_abs_eq(bmap->ineq[i][pos], bmap->div[div][0])) {
3296 if (!isl_seq_eq(bmap->ineq[i], bmap->div[div]+1, pos))
3298 if (isl_seq_first_non_zero(bmap->ineq[i]+pos+1,
3299 bmap->n_div-div-1) != -1)
3305 for (i = 0; i < bmap->n_div; ++i)
3306 if (!isl_int_is_zero(bmap->div[i][1+pos]))
3313 * Remove divs that don't occur in any of the constraints or other divs.
3314 * These can arise when dropping some of the variables in a quast
3315 * returned by piplib.
3317 static struct isl_basic_map *remove_redundant_divs(struct isl_basic_map *bmap)
3324 for (i = bmap->n_div-1; i >= 0; --i) {
3325 if (!div_is_redundant(bmap, i))
3327 bmap = isl_basic_map_drop_div(bmap, i);
3332 struct isl_basic_map *isl_basic_map_finalize(struct isl_basic_map *bmap)
3334 bmap = remove_redundant_divs(bmap);
3337 F_SET(bmap, ISL_BASIC_SET_FINAL);
3341 struct isl_basic_set *isl_basic_set_finalize(struct isl_basic_set *bset)
3343 return (struct isl_basic_set *)
3344 isl_basic_map_finalize((struct isl_basic_map *)bset);
3347 struct isl_set *isl_set_finalize(struct isl_set *set)
3353 for (i = 0; i < set->n; ++i) {
3354 set->p[i] = isl_basic_set_finalize(set->p[i]);
3364 struct isl_map *isl_map_finalize(struct isl_map *map)
3370 for (i = 0; i < map->n; ++i) {
3371 map->p[i] = isl_basic_map_finalize(map->p[i]);
3375 F_CLR(map, ISL_MAP_NORMALIZED);
3382 struct isl_basic_map *isl_basic_map_identity(struct isl_ctx *ctx,
3383 unsigned nparam, unsigned dim)
3385 struct isl_basic_map *bmap;
3388 bmap = isl_basic_map_alloc(ctx, nparam, dim, dim, 0, dim, 0);
3392 for (i = 0; i < dim; ++i) {
3393 int j = isl_basic_map_alloc_equality(bmap);
3396 isl_seq_clr(bmap->eq[j],
3397 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div);
3398 isl_int_set_si(bmap->eq[j][1+nparam+i], 1);
3399 isl_int_set_si(bmap->eq[j][1+nparam+dim+i], -1);
3401 return isl_basic_map_finalize(bmap);
3403 isl_basic_map_free(bmap);
3407 struct isl_map *isl_map_identity(struct isl_ctx *ctx,
3408 unsigned nparam, unsigned dim)
3410 struct isl_map *map = isl_map_alloc(ctx, nparam, dim, dim, 1,
3414 map = isl_map_add(map,
3415 isl_basic_map_identity(ctx, nparam, dim));
3422 int isl_set_is_equal(struct isl_set *set1, struct isl_set *set2)
3424 return isl_map_is_equal((struct isl_map *)set1, (struct isl_map *)set2);
3427 int isl_set_is_subset(struct isl_set *set1, struct isl_set *set2)
3429 return isl_map_is_subset(
3430 (struct isl_map *)set1, (struct isl_map *)set2);
3433 int isl_basic_map_is_subset(
3434 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3437 struct isl_map *map1;
3438 struct isl_map *map2;
3440 if (!bmap1 || !bmap2)
3443 map1 = isl_map_from_basic_map(isl_basic_map_copy(bmap1));
3444 map2 = isl_map_from_basic_map(isl_basic_map_copy(bmap2));
3446 is_subset = isl_map_is_subset(map1, map2);
3454 int isl_basic_map_is_equal(
3455 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3459 if (!bmap1 || !bmap2)
3461 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
3464 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
3468 int isl_basic_set_is_equal(
3469 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
3471 return isl_basic_map_is_equal(
3472 (struct isl_basic_map *)bset1, (struct isl_basic_map *)bset2);
3475 int isl_map_is_empty(struct isl_map *map)
3482 for (i = 0; i < map->n; ++i) {
3483 is_empty = isl_basic_map_is_empty(map->p[i]);
3492 int isl_set_is_empty(struct isl_set *set)
3494 return isl_map_is_empty((struct isl_map *)set);
3497 int isl_map_is_subset(struct isl_map *map1, struct isl_map *map2)
3501 struct isl_map *diff;
3506 if (isl_map_is_empty(map1))
3509 if (isl_map_is_empty(map2))
3512 diff = isl_map_subtract(isl_map_copy(map1), isl_map_copy(map2));
3516 is_subset = isl_map_is_empty(diff);
3522 int isl_map_is_equal(struct isl_map *map1, struct isl_map *map2)
3528 is_subset = isl_map_is_subset(map1, map2);
3531 is_subset = isl_map_is_subset(map2, map1);
3535 int isl_basic_map_is_strict_subset(
3536 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3540 if (!bmap1 || !bmap2)
3542 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
3545 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
3546 if (is_subset == -1)
3551 static int basic_map_contains(struct isl_basic_map *bmap, struct isl_vec *vec)
3557 total = 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
3558 if (total != vec->size)
3563 for (i = 0; i < bmap->n_eq; ++i) {
3564 isl_seq_inner_product(vec->block.data, bmap->eq[i], total, &s);
3565 if (!isl_int_is_zero(s)) {
3571 for (i = 0; i < bmap->n_ineq; ++i) {
3572 isl_seq_inner_product(vec->block.data, bmap->ineq[i], total, &s);
3573 if (isl_int_is_neg(s)) {
3584 int isl_basic_map_is_universe(struct isl_basic_map *bmap)
3588 return bmap->n_eq == 0 && bmap->n_ineq == 0;
3591 int isl_basic_map_is_empty(struct isl_basic_map *bmap)
3593 struct isl_basic_set *bset = NULL;
3594 struct isl_vec *sample = NULL;
3601 if (F_ISSET(bmap, ISL_BASIC_MAP_EMPTY))
3604 if (F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL)) {
3605 struct isl_basic_map *copy = isl_basic_map_copy(bmap);
3606 copy = isl_basic_map_convex_hull(copy);
3607 empty = F_ISSET(copy, ISL_BASIC_MAP_EMPTY);
3608 isl_basic_map_free(copy);
3612 total = 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
3613 if (bmap->sample && bmap->sample->size == total) {
3614 int contains = basic_map_contains(bmap, bmap->sample);
3620 bset = isl_basic_map_underlying_set(isl_basic_map_copy(bmap));
3623 sample = isl_basic_set_sample(bset);
3626 empty = sample->size == 0;
3628 isl_vec_free(bmap->ctx, bmap->sample);
3629 bmap->sample = sample;
3634 struct isl_map *isl_basic_map_union(
3635 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3637 struct isl_map *map;
3638 if (!bmap1 || !bmap2)
3641 isl_assert(bmap1->ctx, bmap1->nparam == bmap2->nparam, goto error);
3642 isl_assert(bmap1->ctx, bmap1->n_in == bmap2->n_in, goto error);
3643 isl_assert(bmap1->ctx, bmap1->n_out == bmap2->n_out, goto error);
3645 map = isl_map_alloc(bmap1->ctx, bmap1->nparam,
3646 bmap1->n_in, bmap1->n_out, 2, 0);
3649 map = isl_map_add(map, bmap1);
3650 map = isl_map_add(map, bmap2);
3653 isl_basic_map_free(bmap1);
3654 isl_basic_map_free(bmap2);
3658 struct isl_set *isl_basic_set_union(
3659 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
3661 return (struct isl_set *)isl_basic_map_union(
3662 (struct isl_basic_map *)bset1,
3663 (struct isl_basic_map *)bset2);
3666 /* Order divs such that any div only depends on previous divs */
3667 static struct isl_basic_map *order_divs(struct isl_basic_map *bmap)
3670 unsigned off = bmap->nparam + bmap->n_in + bmap->n_out;
3672 for (i = 0; i < bmap->n_div; ++i) {
3674 pos = isl_seq_first_non_zero(bmap->div[i]+1+1+off+i,
3678 swap_div(bmap, i, pos);
3684 static int find_div(struct isl_basic_map *dst,
3685 struct isl_basic_map *src, unsigned div)
3689 unsigned total = src->nparam + src->n_in + src->n_out + src->n_div;
3691 for (i = 0; i < dst->n_div; ++i)
3692 if (isl_seq_eq(dst->div[i], src->div[div], 1+1+total) &&
3693 isl_seq_first_non_zero(dst->div[i]+1+1+total,
3694 dst->n_div - src->n_div) == -1)
3699 struct isl_basic_map *isl_basic_map_align_divs(
3700 struct isl_basic_map *dst, struct isl_basic_map *src)
3703 unsigned total = src->nparam + src->n_in + src->n_out + src->n_div;
3708 if (src->n_div == 0)
3711 src = order_divs(src);
3712 dst = isl_basic_map_extend(dst, dst->nparam, dst->n_in,
3713 dst->n_out, src->n_div, 0, 2 * src->n_div);
3716 for (i = 0; i < src->n_div; ++i) {
3717 int j = find_div(dst, src, i);
3719 j = isl_basic_map_alloc_div(dst);
3722 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total);
3723 isl_seq_clr(dst->div[j]+1+1+total,
3724 dst->n_div - src->n_div);
3725 if (add_div_constraints(dst, j) < 0)
3729 swap_div(dst, i, j);
3733 isl_basic_map_free(dst);
3737 struct isl_basic_set *isl_basic_set_align_divs(
3738 struct isl_basic_set *dst, struct isl_basic_set *src)
3740 return (struct isl_basic_set *)isl_basic_map_align_divs(
3741 (struct isl_basic_map *)dst, (struct isl_basic_map *)src);
3744 struct isl_map *isl_map_align_divs(struct isl_map *map)
3748 map = isl_map_compute_divs(map);
3749 map = isl_map_cow(map);
3753 for (i = 1; i < map->n; ++i)
3754 map->p[0] = isl_basic_map_align_divs(map->p[0], map->p[i]);
3755 for (i = 1; i < map->n; ++i)
3756 map->p[i] = isl_basic_map_align_divs(map->p[i], map->p[0]);
3758 F_CLR(map, ISL_MAP_NORMALIZED);
3762 static struct isl_map *add_cut_constraint(struct isl_map *dst,
3763 struct isl_basic_map *src, isl_int *c,
3764 unsigned len, int oppose)
3766 struct isl_basic_map *copy = NULL;
3771 copy = isl_basic_map_copy(src);
3772 copy = isl_basic_map_cow(copy);
3775 copy = isl_basic_map_extend(copy,
3776 copy->nparam, copy->n_in, copy->n_out, 0, 0, 1);
3777 k = isl_basic_map_alloc_inequality(copy);
3781 isl_seq_neg(copy->ineq[k], c, len);
3783 isl_seq_cpy(copy->ineq[k], c, len);
3784 total = 1 + copy->nparam + copy->n_in + copy->n_out + copy->n_div;
3785 isl_seq_clr(copy->ineq[k]+len, total - len);
3786 isl_inequality_negate(copy, k);
3787 copy = isl_basic_map_simplify(copy);
3788 copy = isl_basic_map_finalize(copy);
3789 is_empty = isl_basic_map_is_empty(copy);
3793 dst = isl_map_add(dst, copy);
3795 isl_basic_map_free(copy);
3798 isl_basic_map_free(copy);
3803 static struct isl_map *subtract(struct isl_map *map, struct isl_basic_map *bmap)
3807 struct isl_map *rest = NULL;
3809 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
3816 if (F_ISSET(map, ISL_MAP_DISJOINT))
3817 FL_SET(flags, ISL_MAP_DISJOINT);
3819 max = map->n * (2 * bmap->n_eq + bmap->n_ineq);
3820 rest = isl_map_alloc(map->ctx, map->nparam, map->n_in, map->n_out,
3825 for (i = 0; i < map->n; ++i) {
3826 map->p[i] = isl_basic_map_align_divs(map->p[i], bmap);
3831 for (j = 0; j < map->n; ++j)
3832 map->p[j] = isl_basic_map_cow(map->p[j]);
3834 for (i = 0; i < bmap->n_eq; ++i) {
3835 for (j = 0; j < map->n; ++j) {
3836 rest = add_cut_constraint(rest,
3837 map->p[j], bmap->eq[i], 1+total, 0);
3841 rest = add_cut_constraint(rest,
3842 map->p[j], bmap->eq[i], 1+total, 1);
3846 map->p[j] = isl_basic_map_extend(map->p[j],
3847 map->p[j]->nparam, map->p[j]->n_in,
3848 map->p[j]->n_out, 0, 1, 0);
3851 k = isl_basic_map_alloc_equality(map->p[j]);
3854 isl_seq_cpy(map->p[j]->eq[k], bmap->eq[i], 1+total);
3855 isl_seq_clr(map->p[j]->eq[k]+1+total,
3856 map->p[j]->n_div - bmap->n_div);
3860 for (i = 0; i < bmap->n_ineq; ++i) {
3861 for (j = 0; j < map->n; ++j) {
3862 rest = add_cut_constraint(rest,
3863 map->p[j], bmap->ineq[i], 1+total, 0);
3867 map->p[j] = isl_basic_map_extend(map->p[j],
3868 map->p[j]->nparam, map->p[j]->n_in,
3869 map->p[j]->n_out, 0, 0, 1);
3872 k = isl_basic_map_alloc_inequality(map->p[j]);
3875 isl_seq_cpy(map->p[j]->ineq[k], bmap->ineq[i], 1+total);
3876 isl_seq_clr(map->p[j]->ineq[k]+1+total,
3877 map->p[j]->n_div - bmap->n_div);
3889 struct isl_map *isl_map_subtract(struct isl_map *map1, struct isl_map *map2)
3895 isl_assert(map1->ctx, map1->nparam == map2->nparam, goto error);
3896 isl_assert(map1->ctx, map1->n_in == map2->n_in, goto error);
3897 isl_assert(map1->ctx, map1->n_out == map2->n_out, goto error);
3899 if (isl_map_is_empty(map2)) {
3904 map1 = isl_map_compute_divs(map1);
3905 map2 = isl_map_compute_divs(map2);
3909 for (i = 0; map1 && i < map2->n; ++i)
3910 map1 = subtract(map1, map2->p[i]);
3920 struct isl_set *isl_set_subtract(struct isl_set *set1, struct isl_set *set2)
3922 return (struct isl_set *)
3924 (struct isl_map *)set1, (struct isl_map *)set2);
3927 struct isl_set *isl_set_apply(struct isl_set *set, struct isl_map *map)
3931 isl_assert(set->ctx, set->dim == map->n_in, goto error);
3932 map = isl_map_intersect_domain(map, set);
3933 set = isl_map_range(map);
3941 /* There is no need to cow as removing empty parts doesn't change
3942 * the meaning of the set.
3944 struct isl_map *isl_map_remove_empty_parts(struct isl_map *map)
3951 for (i = map->n-1; i >= 0; --i) {
3952 if (!F_ISSET(map->p[i], ISL_BASIC_MAP_EMPTY))
3954 isl_basic_map_free(map->p[i]);
3955 if (i != map->n-1) {
3956 F_CLR(map, ISL_MAP_NORMALIZED);
3957 map->p[i] = map->p[map->n-1];
3965 struct isl_set *isl_set_remove_empty_parts(struct isl_set *set)
3967 return (struct isl_set *)
3968 isl_map_remove_empty_parts((struct isl_map *)set);
3971 struct isl_basic_set *isl_set_copy_basic_set(struct isl_set *set)
3973 struct isl_basic_set *bset;
3974 if (!set || set->n == 0)
3976 bset = set->p[set->n-1];
3977 isl_assert(set->ctx, F_ISSET(bset, ISL_BASIC_SET_FINAL), return NULL);
3978 return isl_basic_set_copy(bset);
3981 struct isl_set *isl_set_drop_basic_set(struct isl_set *set,
3982 struct isl_basic_set *bset)
3988 for (i = set->n-1; i >= 0; --i) {
3989 if (set->p[i] != bset)
3991 set = isl_set_cow(set);
3994 isl_basic_set_free(set->p[i]);
3995 if (i != set->n-1) {
3996 F_CLR(set, ISL_SET_NORMALIZED);
3997 set->p[i] = set->p[set->n-1];
4002 isl_basic_set_free(bset);
4006 isl_basic_set_free(bset);
4010 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
4011 * for any common value of the parameters and dimensions preceding dim
4012 * in both basic sets, the values of dimension pos in bset1 are
4013 * smaller or larger then those in bset2.
4016 * 1 if bset1 follows bset2
4017 * -1 if bset1 precedes bset2
4018 * 0 if bset1 and bset2 are incomparable
4019 * -2 if some error occurred.
4021 int isl_basic_set_compare_at(struct isl_basic_set *bset1,
4022 struct isl_basic_set *bset2, int pos)
4024 struct isl_basic_map *bmap1 = NULL;
4025 struct isl_basic_map *bmap2 = NULL;
4026 struct isl_ctx *ctx;
4027 struct isl_vec *obj;
4030 enum isl_lp_result res;
4033 if (!bset1 || !bset2)
4036 bmap1 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset1),
4037 pos, bset1->dim - pos);
4038 bmap2 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset2),
4039 pos, bset2->dim - pos);
4040 if (!bmap1 || !bmap2)
4042 bmap1 = isl_basic_map_extend(bmap1, bmap1->nparam,
4043 bmap1->n_in, bmap1->n_out + bmap2->n_out,
4044 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
4047 total = bmap1->nparam + bmap1->n_in + bmap1->n_out + bmap1->n_div;
4049 obj = isl_vec_alloc(ctx, total);
4050 isl_seq_clr(obj->block.data, total);
4051 isl_int_set_si(obj->block.data[bmap1->nparam+bmap1->n_in], 1);
4052 isl_int_set_si(obj->block.data[bmap1->nparam+bmap1->n_in+
4053 bmap1->n_out-bmap2->n_out], -1);
4056 bmap1 = add_constraints(bmap1, bmap2, 0, bmap1->n_out - bmap2->n_out);
4059 res = isl_solve_lp(bmap1, 0, obj->block.data, ctx->one, &num, &den);
4060 if (res == isl_lp_empty)
4062 else if (res == isl_lp_ok && isl_int_is_pos(num))
4064 else if ((res == isl_lp_ok && isl_int_is_neg(num)) ||
4065 res == isl_lp_unbounded)
4071 isl_basic_map_free(bmap1);
4072 isl_vec_free(ctx, obj);
4075 isl_basic_map_free(bmap1);
4076 isl_basic_map_free(bmap2);
4080 static int isl_basic_map_fast_has_fixed_var(struct isl_basic_map *bmap,
4081 unsigned pos, isl_int *val)
4089 total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
4090 for (i = 0, d = total-1; i < bmap->n_eq && d+1 > pos; ++i) {
4091 for (; d+1 > pos; --d)
4092 if (!isl_int_is_zero(bmap->eq[i][1+d]))
4096 if (isl_seq_first_non_zero(bmap->eq[i]+1, d) != -1)
4098 if (isl_seq_first_non_zero(bmap->eq[i]+1+d+1, total-d-1) != -1)
4100 if (!isl_int_is_one(bmap->eq[i][1+d]))
4103 isl_int_neg(*val, bmap->eq[i][0]);
4109 static int isl_map_fast_has_fixed_var(struct isl_map *map,
4110 unsigned pos, isl_int *val)
4122 return isl_basic_map_fast_has_fixed_var(map->p[0], pos, val);
4125 fixed = isl_basic_map_fast_has_fixed_var(map->p[0], pos, &v);
4126 for (i = 1; fixed == 1 && i < map->n; ++i) {
4127 fixed = isl_basic_map_fast_has_fixed_var(map->p[i], pos, &tmp);
4128 if (fixed == 1 && isl_int_ne(tmp, v))
4132 isl_int_set(*val, v);
4138 static int isl_set_fast_has_fixed_var(struct isl_set *set, unsigned pos,
4141 return isl_map_fast_has_fixed_var((struct isl_map *)set, pos, val);
4144 /* Check if dimension dim has fixed value and if so and if val is not NULL,
4145 * then return this fixed value in *val.
4147 int isl_set_fast_dim_is_fixed(struct isl_set *set, unsigned dim, isl_int *val)
4149 return isl_set_fast_has_fixed_var(set, set->nparam + dim, val);
4152 /* Check if input variable in has fixed value and if so and if val is not NULL,
4153 * then return this fixed value in *val.
4155 int isl_map_fast_input_is_fixed(struct isl_map *map, unsigned in, isl_int *val)
4157 return isl_map_fast_has_fixed_var(map, map->nparam + in, val);
4160 /* Check if dimension dim has an (obvious) fixed lower bound and if so
4161 * and if val is not NULL, then return this lower bound in *val.
4163 int isl_basic_set_fast_dim_has_fixed_lower_bound(struct isl_basic_set *bset,
4164 unsigned dim, isl_int *val)
4166 int i, i_eq = -1, i_ineq = -1;
4172 total = bset->nparam + bset->dim + bset->n_div;
4173 for (i = 0; i < bset->n_eq; ++i) {
4174 if (isl_int_is_zero(bset->eq[i][1+bset->nparam+dim]))
4180 for (i = 0; i < bset->n_ineq; ++i) {
4181 if (!isl_int_is_pos(bset->ineq[i][1+bset->nparam+dim]))
4183 if (i_eq != -1 || i_ineq != -1)
4187 if (i_eq == -1 && i_ineq == -1)
4189 c = i_eq != -1 ? bset->eq[i_eq] : bset->ineq[i_ineq];
4190 /* The coefficient should always be one due to normalization. */
4191 if (!isl_int_is_one(c[1+bset->nparam+dim]))
4193 if (isl_seq_first_non_zero(c+1, bset->nparam+dim) != -1)
4195 if (isl_seq_first_non_zero(c+1+bset->nparam+dim+1,
4196 total - bset->nparam - dim - 1) != -1)
4199 isl_int_neg(*val, c[0]);
4203 int isl_set_fast_dim_has_fixed_lower_bound(struct isl_set *set,
4204 unsigned dim, isl_int *val)
4216 return isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[0],
4220 fixed = isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[0],
4222 for (i = 1; fixed == 1 && i < set->n; ++i) {
4223 fixed = isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[i],
4225 if (fixed == 1 && isl_int_ne(tmp, v))
4229 isl_int_set(*val, v);
4235 static struct isl_basic_set *isl_basic_set_reduce_using_equalities(
4236 struct isl_basic_set *bset, struct isl_basic_set *context)
4241 if (!bset || !context)
4244 bset = isl_basic_set_cow(bset);
4248 elim = isl_alloc_array(ctx, int, bset->dim);
4251 set_compute_elimination_index(context, elim);
4252 for (i = 0; i < bset->n_eq; ++i)
4253 set_reduced_using_equalities(bset->eq[i], bset->eq[i],
4255 for (i = 0; i < bset->n_ineq; ++i)
4256 set_reduced_using_equalities(bset->ineq[i], bset->ineq[i],
4258 isl_basic_set_free(context);
4260 bset = isl_basic_set_simplify(bset);
4261 bset = isl_basic_set_finalize(bset);
4264 isl_basic_set_free(bset);
4265 isl_basic_set_free(context);
4269 static struct isl_basic_set *remove_shifted_constraints(
4270 struct isl_basic_set *bset, struct isl_basic_set *context)
4280 size = round_up(4 * (context->n_ineq+1) / 3 - 1);
4281 bits = ffs(size) - 1;
4282 index = isl_alloc_array(ctx, isl_int **, size);
4283 memset(index, 0, size * sizeof(isl_int **));
4287 for (k = 0; k < context->n_ineq; ++k) {
4288 h = set_hash_index(index, size, bits, context, k);
4289 index[h] = &context->ineq[k];
4291 for (k = 0; k < bset->n_ineq; ++k) {
4292 h = set_hash_index(index, size, bits, bset, k);
4295 l = index[h] - &context->ineq[0];
4296 if (isl_int_lt(bset->ineq[k][0], context->ineq[l][0]))
4298 bset = isl_basic_set_cow(bset);
4301 isl_basic_set_drop_inequality(bset, k);
4311 /* Remove all information from bset that is redundant in the context
4312 * of context. In particular, equalities that are linear combinations
4313 * of those in context are remobed. Then the inequalities that are
4314 * redundant in the context of the equalities and inequalities of
4315 * context are removed.
4317 static struct isl_basic_set *uset_gist(struct isl_basic_set *bset,
4318 struct isl_basic_set *context)
4322 struct isl_basic_set *combined;
4323 struct isl_ctx *ctx;
4325 if (!bset || !context)
4328 if (context->n_eq > 0) {
4331 struct isl_ctx *ctx = context->ctx;
4332 struct isl_basic_set *reduced_context;
4333 reduced_context = isl_basic_set_remove_equalities(
4334 isl_basic_set_copy(context), &T, &T2);
4335 if (!reduced_context)
4337 bset = isl_basic_set_preimage(ctx, bset, T);
4338 bset = uset_gist(bset, reduced_context);
4339 bset = isl_basic_set_preimage(ctx, bset, T2);
4340 bset = isl_basic_set_reduce_using_equalities(bset, context);
4343 if (!context->n_ineq)
4345 bset = remove_shifted_constraints(bset, context);
4346 combined = isl_basic_set_extend(isl_basic_set_copy(bset),
4347 0, bset->dim, 0, context->n_eq, context->n_ineq);
4348 context = set_add_constraints(combined, context, 0);
4353 for (i = bset->n_ineq-1; i >= 0; --i) {
4355 set_swap_inequality(context, i, context->n_ineq-1);
4357 redundant = isl_basic_set_constraint_is_redundant(&context,
4358 context->ineq[context->n_ineq], &opt, NULL);
4359 if (redundant == -1) {
4363 if (F_ISSET(context, ISL_BASIC_MAP_EMPTY)) {
4364 bset = isl_basic_set_set_to_empty(bset);
4368 set_swap_inequality(context, i, context->n_ineq-1);
4370 isl_basic_set_drop_inequality(context, i);
4371 isl_basic_set_drop_inequality(bset, i);
4376 isl_basic_set_free(context);
4379 isl_basic_set_free(context);
4380 isl_basic_set_free(bset);
4384 struct isl_basic_map *isl_basic_map_gist(struct isl_basic_map *bmap,
4385 struct isl_basic_map *context)
4387 struct isl_basic_set *bset;
4389 if (!bmap || !context)
4392 context = isl_basic_map_align_divs(context, bmap);
4393 bmap = isl_basic_map_align_divs(bmap, context);
4395 bset = uset_gist(isl_basic_map_underlying_set(isl_basic_map_copy(bmap)),
4396 isl_basic_map_underlying_set(context));
4398 return isl_basic_map_overlying_set(bset, bmap);
4400 isl_basic_map_free(bmap);
4401 isl_basic_map_free(context);
4405 struct isl_map *isl_map_gist(struct isl_map *map, struct isl_basic_map *context)
4409 map = isl_map_cow(map);
4410 if (!map || !context)
4412 isl_assert(map->ctx, map->nparam == context->nparam, goto error);
4413 isl_assert(map->ctx, map->n_in == context->n_in, goto error);
4414 isl_assert(map->ctx, map->n_out == context->n_out, goto error);
4415 for (i = 0; i < map->n; ++i)
4416 context = isl_basic_map_align_divs(context, map->p[i]);
4417 for (i = 0; i < map->n; ++i) {
4418 map->p[i] = isl_basic_map_gist(map->p[i],
4419 isl_basic_map_copy(context));
4423 isl_basic_map_free(context);
4424 F_CLR(map, ISL_MAP_NORMALIZED);
4428 isl_basic_map_free(context);
4432 struct isl_set *isl_set_gist(struct isl_set *set, struct isl_basic_set *context)
4434 return (struct isl_set *)isl_map_gist((struct isl_map *)set,
4435 (struct isl_basic_map *)context);
4443 static int qsort_constraint_cmp(const void *p1, const void *p2)
4445 const struct constraint *c1 = (const struct constraint *)p1;
4446 const struct constraint *c2 = (const struct constraint *)p2;
4447 unsigned size = isl_min(c1->size, c2->size);
4448 return isl_seq_cmp(c1->c, c2->c, size);
4451 static struct isl_basic_map *isl_basic_map_sort_constraints(
4452 struct isl_basic_map *bmap)
4455 struct constraint *c;
4460 total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
4461 c = isl_alloc_array(bmap->ctx, struct constraint, bmap->n_ineq);
4464 for (i = 0; i < bmap->n_ineq; ++i) {
4466 c[i].c = bmap->ineq[i];
4468 qsort(c, bmap->n_ineq, sizeof(struct constraint), qsort_constraint_cmp);
4469 for (i = 0; i < bmap->n_ineq; ++i)
4470 bmap->ineq[i] = c[i].c;
4474 isl_basic_map_free(bmap);
4478 struct isl_basic_map *isl_basic_map_normalize(struct isl_basic_map *bmap)
4482 if (F_ISSET(bmap, ISL_BASIC_MAP_NORMALIZED))
4484 bmap = isl_basic_map_convex_hull(bmap);
4485 bmap = isl_basic_map_sort_constraints(bmap);
4486 F_SET(bmap, ISL_BASIC_MAP_NORMALIZED);
4490 static int isl_basic_map_fast_cmp(const struct isl_basic_map *bmap1,
4491 const struct isl_basic_map *bmap2)
4498 if (bmap1->nparam != bmap2->nparam)
4499 return bmap1->nparam - bmap2->nparam;
4500 if (bmap1->n_in != bmap2->n_in)
4501 return bmap1->n_in - bmap2->n_in;
4502 if (bmap1->n_out != bmap2->n_out)
4503 return bmap1->n_out - bmap2->n_out;
4504 if (F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY) &&
4505 F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
4507 if (F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY))
4509 if (F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
4511 if (bmap1->n_eq != bmap2->n_eq)
4512 return bmap1->n_eq - bmap2->n_eq;
4513 if (bmap1->n_ineq != bmap2->n_ineq)
4514 return bmap1->n_ineq - bmap2->n_ineq;
4515 if (bmap1->n_div != bmap2->n_div)
4516 return bmap1->n_div - bmap2->n_div;
4517 total = bmap1->nparam + bmap1->n_in + bmap1->n_out + bmap1->n_div;
4518 for (i = 0; i < bmap1->n_eq; ++i) {
4519 cmp = isl_seq_cmp(bmap1->eq[i], bmap2->eq[i], 1+total);
4523 for (i = 0; i < bmap1->n_ineq; ++i) {
4524 cmp = isl_seq_cmp(bmap1->ineq[i], bmap2->ineq[i], 1+total);
4528 for (i = 0; i < bmap1->n_div; ++i) {
4529 cmp = isl_seq_cmp(bmap1->div[i], bmap2->div[i], 1+1+total);
4536 static int isl_basic_map_fast_is_equal(struct isl_basic_map *bmap1,
4537 struct isl_basic_map *bmap2)
4539 return isl_basic_map_fast_cmp(bmap1, bmap2) == 0;
4542 static int qsort_bmap_cmp(const void *p1, const void *p2)
4544 const struct isl_basic_map *bmap1 = *(const struct isl_basic_map **)p1;
4545 const struct isl_basic_map *bmap2 = *(const struct isl_basic_map **)p2;
4547 return isl_basic_map_fast_cmp(bmap1, bmap2);
4550 /* We normalize in place, but if anything goes wrong we need
4551 * to return NULL, so we need to make sure we don't change the
4552 * meaning of any possible other copies of map.
4554 struct isl_map *isl_map_normalize(struct isl_map *map)
4557 struct isl_basic_map *bmap;
4561 if (F_ISSET(map, ISL_MAP_NORMALIZED))
4563 for (i = 0; i < map->n; ++i) {
4564 bmap = isl_basic_map_normalize(isl_basic_map_copy(map->p[i]));
4567 isl_basic_map_free(map->p[i]);
4570 qsort(map->p, map->n, sizeof(struct isl_basic_map *), qsort_bmap_cmp);
4571 F_SET(map, ISL_MAP_NORMALIZED);
4572 map = isl_map_remove_empty_parts(map);
4575 for (i = map->n - 1; i >= 1; --i) {
4576 if (!isl_basic_map_fast_is_equal(map->p[i-1], map->p[i]))
4578 isl_basic_map_free(map->p[i-1]);
4579 for (j = i; j < map->n; ++j)
4580 map->p[j-1] = map->p[j];
4590 struct isl_set *isl_set_normalize(struct isl_set *set)
4592 return (struct isl_set *)isl_map_normalize((struct isl_map *)set);
4595 int isl_map_fast_is_equal(struct isl_map *map1, struct isl_map *map2)
4605 if (map1->nparam != map2->nparam)
4607 if (map1->n_in != map2->n_in)
4609 if (map1->n_out != map2->n_out)
4612 map1 = isl_map_copy(map1);
4613 map2 = isl_map_copy(map2);
4614 map1 = isl_map_normalize(map1);
4615 map2 = isl_map_normalize(map2);
4618 equal = map1->n == map2->n;
4619 for (i = 0; equal && i < map1->n; ++i) {
4620 equal = isl_basic_map_fast_is_equal(map1->p[i], map2->p[i]);
4633 int isl_set_fast_is_equal(struct isl_set *set1, struct isl_set *set2)
4635 return isl_map_fast_is_equal((struct isl_map *)set1,
4636 (struct isl_map *)set2);
4639 /* Return an interval that ranges from min to max (inclusive)
4641 struct isl_basic_set *isl_basic_set_interval(struct isl_ctx *ctx,
4642 isl_int min, isl_int max)
4645 struct isl_basic_set *bset = NULL;
4647 bset = isl_basic_set_alloc(ctx, 0, 1, 0, 0, 2);
4651 k = isl_basic_set_alloc_inequality(bset);
4654 isl_int_set_si(bset->ineq[k][1], 1);
4655 isl_int_neg(bset->ineq[k][0], min);
4657 k = isl_basic_set_alloc_inequality(bset);
4660 isl_int_set_si(bset->ineq[k][1], -1);
4661 isl_int_set(bset->ineq[k][0], max);
4665 isl_basic_set_free(bset);
4669 /* Return the Cartesian product of the basic sets in list (in the given order).
4671 struct isl_basic_set *isl_basic_set_product(struct isl_basic_set_list *list)
4679 struct isl_basic_set *product = NULL;
4683 isl_assert(list->ctx, list->n > 0, goto error);
4684 isl_assert(list->ctx, list->p[0], goto error);
4685 nparam = list->p[0]->nparam;
4686 dim = list->p[0]->dim;
4687 extra = list->p[0]->n_div;
4688 n_eq = list->p[0]->n_eq;
4689 n_ineq = list->p[0]->n_ineq;
4690 for (i = 1; i < list->n; ++i) {
4691 isl_assert(list->ctx, list->p[i], goto error);
4692 isl_assert(list->ctx, nparam == list->p[i]->nparam, goto error);
4693 dim += list->p[i]->dim;
4694 extra += list->p[i]->n_div;
4695 n_eq += list->p[i]->n_eq;
4696 n_ineq += list->p[i]->n_ineq;
4698 product = isl_basic_set_alloc(list->ctx, nparam, dim, extra,
4703 for (i = 0; i < list->n; ++i) {
4704 set_add_constraints(product,
4705 isl_basic_set_copy(list->p[i]), dim);
4706 dim += list->p[i]->dim;
4708 isl_basic_set_list_free(list);
4711 isl_basic_set_free(product);
4712 isl_basic_set_list_free(list);