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];
240 int isl_basic_set_alloc_equality(struct isl_basic_set *bset)
242 return isl_basic_map_alloc_equality((struct isl_basic_map *)bset);
245 int isl_basic_map_free_equality(struct isl_basic_map *bmap, unsigned n)
249 isl_assert(bmap->ctx, n <= bmap->n_eq, return -1);
254 int isl_basic_map_drop_equality(struct isl_basic_map *bmap, unsigned pos)
259 isl_assert(bmap->ctx, pos < bmap->n_eq, return -1);
261 if (pos != bmap->n_eq - 1) {
263 bmap->eq[pos] = bmap->eq[bmap->n_eq - 1];
264 bmap->eq[bmap->n_eq - 1] = t;
270 int isl_basic_set_drop_equality(struct isl_basic_set *bset, unsigned pos)
272 return isl_basic_map_drop_equality((struct isl_basic_map *)bset, pos);
275 void isl_basic_map_inequality_to_equality(
276 struct isl_basic_map *bmap, unsigned pos)
281 bmap->ineq[pos] = bmap->ineq[0];
282 bmap->ineq[0] = bmap->eq[bmap->n_eq];
283 bmap->eq[bmap->n_eq] = t;
287 F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
290 int isl_basic_map_alloc_inequality(struct isl_basic_map *bmap)
296 isl_assert(ctx, (bmap->ineq - bmap->eq) + bmap->n_ineq < bmap->c_size,
298 F_CLR(bmap, ISL_BASIC_MAP_NO_IMPLICIT);
299 F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
300 F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
301 return bmap->n_ineq++;
304 int isl_basic_set_alloc_inequality(struct isl_basic_set *bset)
306 return isl_basic_map_alloc_inequality((struct isl_basic_map *)bset);
309 int isl_basic_map_free_inequality(struct isl_basic_map *bmap, unsigned n)
313 isl_assert(bmap->ctx, n <= bmap->n_ineq, return -1);
318 int isl_basic_set_free_inequality(struct isl_basic_set *bset, unsigned n)
320 return isl_basic_map_free_inequality((struct isl_basic_map *)bset, n);
323 int isl_basic_map_drop_inequality(struct isl_basic_map *bmap, unsigned pos)
328 isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
330 if (pos != bmap->n_ineq - 1) {
332 bmap->ineq[pos] = bmap->ineq[bmap->n_ineq - 1];
333 bmap->ineq[bmap->n_ineq - 1] = t;
334 F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
340 int isl_basic_set_drop_inequality(struct isl_basic_set *bset, unsigned pos)
342 return isl_basic_map_drop_inequality((struct isl_basic_map *)bset, pos);
345 int isl_basic_map_alloc_div(struct isl_basic_map *bmap)
349 isl_assert(bmap->ctx, bmap->n_div < bmap->extra, return -1);
350 return bmap->n_div++;
353 int isl_basic_map_free_div(struct isl_basic_map *bmap, unsigned n)
357 isl_assert(bmap->ctx, n <= bmap->n_div, return -1);
362 /* Copy constraint from src to dst, putting the vars of src at offset
363 * dim_off in dst and the divs of src at offset div_off in dst.
364 * If both sets are actually map, then dim_off applies to the input
367 static void copy_constraint(struct isl_basic_map *dst_map, isl_int *dst,
368 struct isl_basic_map *src_map, isl_int *src,
369 unsigned in_off, unsigned out_off, unsigned div_off)
371 isl_int_set(dst[0], src[0]);
372 isl_seq_cpy(dst+1, src+1, isl_min(dst_map->nparam, src_map->nparam));
373 if (dst_map->nparam > src_map->nparam)
374 isl_seq_clr(dst+1+src_map->nparam,
375 dst_map->nparam - src_map->nparam);
376 isl_seq_clr(dst+1+dst_map->nparam, in_off);
377 isl_seq_cpy(dst+1+dst_map->nparam+in_off,
378 src+1+src_map->nparam,
379 isl_min(dst_map->n_in-in_off, src_map->n_in));
380 if (dst_map->n_in-in_off > src_map->n_in)
381 isl_seq_clr(dst+1+dst_map->nparam+in_off+src_map->n_in,
382 dst_map->n_in - in_off - src_map->n_in);
383 isl_seq_clr(dst+1+dst_map->nparam+dst_map->n_in, out_off);
384 isl_seq_cpy(dst+1+dst_map->nparam+dst_map->n_in+out_off,
385 src+1+src_map->nparam+src_map->n_in,
386 isl_min(dst_map->n_out-out_off, src_map->n_out));
387 if (dst_map->n_out-out_off > src_map->n_out)
388 isl_seq_clr(dst+1+dst_map->nparam+dst_map->n_in+out_off+src_map->n_out,
389 dst_map->n_out - out_off - src_map->n_out);
390 isl_seq_clr(dst+1+dst_map->nparam+dst_map->n_in+dst_map->n_out, div_off);
391 isl_seq_cpy(dst+1+dst_map->nparam+dst_map->n_in+dst_map->n_out+div_off,
392 src+1+src_map->nparam+src_map->n_in+src_map->n_out,
393 isl_min(dst_map->extra-div_off, src_map->extra));
394 if (dst_map->extra-div_off > src_map->extra)
395 isl_seq_clr(dst+1+dst_map->nparam+dst_map->n_in+dst_map->n_out+
396 div_off+src_map->extra,
397 dst_map->extra - div_off - src_map->extra);
400 static void copy_div(struct isl_basic_map *dst_map, isl_int *dst,
401 struct isl_basic_map *src_map, isl_int *src,
402 unsigned in_off, unsigned out_off, unsigned div_off)
404 isl_int_set(dst[0], src[0]);
405 copy_constraint(dst_map, dst+1, src_map, src+1, in_off, out_off, div_off);
408 static struct isl_basic_map *add_constraints(struct isl_basic_map *bmap1,
409 struct isl_basic_map *bmap2, unsigned i_pos, unsigned o_pos)
414 if (!bmap1 || !bmap2)
417 div_off = bmap1->n_div;
419 for (i = 0; i < bmap2->n_eq; ++i) {
420 int i1 = isl_basic_map_alloc_equality(bmap1);
423 copy_constraint(bmap1, bmap1->eq[i1], bmap2, bmap2->eq[i],
424 i_pos, o_pos, div_off);
427 for (i = 0; i < bmap2->n_ineq; ++i) {
428 int i1 = isl_basic_map_alloc_inequality(bmap1);
431 copy_constraint(bmap1, bmap1->ineq[i1], bmap2, bmap2->ineq[i],
432 i_pos, o_pos, div_off);
435 for (i = 0; i < bmap2->n_div; ++i) {
436 int i1 = isl_basic_map_alloc_div(bmap1);
439 copy_div(bmap1, bmap1->div[i1], bmap2, bmap2->div[i],
440 i_pos, o_pos, div_off);
443 isl_basic_map_free(bmap2);
448 isl_basic_map_free(bmap1);
449 isl_basic_map_free(bmap2);
453 static struct isl_basic_set *set_add_constraints(struct isl_basic_set *bset1,
454 struct isl_basic_set *bset2, unsigned pos)
456 return (struct isl_basic_set *)
457 add_constraints((struct isl_basic_map *)bset1,
458 (struct isl_basic_map *)bset2, 0, pos);
461 struct isl_basic_map *isl_basic_map_extend(struct isl_basic_map *base,
462 unsigned nparam, unsigned n_in, unsigned n_out, unsigned extra,
463 unsigned n_eq, unsigned n_ineq)
465 struct isl_basic_map *ext;
469 base = isl_basic_map_cow(base);
473 dims_ok = base && base->nparam == nparam &&
474 base->n_in == n_in && base->n_out == n_out &&
475 base->extra >= base->n_div + extra;
477 if (dims_ok && n_eq == 0 && n_ineq == 0)
480 isl_assert(base->ctx, base->nparam <= nparam, goto error);
481 isl_assert(base->ctx, base->n_in <= n_in, goto error);
482 isl_assert(base->ctx, base->n_out <= n_out, goto error);
483 extra += base->extra;
485 n_ineq += base->n_ineq;
487 ext = isl_basic_map_alloc(base->ctx, nparam, n_in, n_out,
488 extra, n_eq, n_ineq);
495 ext = add_constraints(ext, base, 0, 0);
498 F_CLR(ext, ISL_BASIC_SET_FINAL);
504 isl_basic_map_free(base);
508 struct isl_basic_set *isl_basic_set_extend(struct isl_basic_set *base,
509 unsigned nparam, unsigned dim, unsigned extra,
510 unsigned n_eq, unsigned n_ineq)
512 return (struct isl_basic_set *)
513 isl_basic_map_extend((struct isl_basic_map *)base,
514 nparam, 0, dim, extra, n_eq, n_ineq);
517 struct isl_basic_set *isl_basic_set_cow(struct isl_basic_set *bset)
519 return (struct isl_basic_set *)
520 isl_basic_map_cow((struct isl_basic_map *)bset);
523 struct isl_basic_map *isl_basic_map_cow(struct isl_basic_map *bmap)
530 bmap = isl_basic_map_dup(bmap);
532 F_CLR(bmap, ISL_BASIC_SET_FINAL);
536 struct isl_set *isl_set_cow(struct isl_set *set)
544 return isl_set_dup(set);
547 struct isl_map *isl_map_cow(struct isl_map *map)
555 return isl_map_dup(map);
558 static void swap_vars(struct isl_blk blk, isl_int *a,
559 unsigned a_len, unsigned b_len)
561 isl_seq_cpy(blk.data, a+a_len, b_len);
562 isl_seq_cpy(blk.data+b_len, a, a_len);
563 isl_seq_cpy(a, blk.data, b_len+a_len);
566 struct isl_basic_set *isl_basic_set_swap_vars(
567 struct isl_basic_set *bset, unsigned n)
575 isl_assert(bset->ctx, n <= bset->dim, goto error);
580 bset = isl_basic_set_cow(bset);
584 blk = isl_blk_alloc(bset->ctx, bset->dim);
585 if (isl_blk_is_error(blk))
588 for (i = 0; i < bset->n_eq; ++i)
590 bset->eq[i]+1+bset->nparam, n, bset->dim - n);
592 for (i = 0; i < bset->n_ineq; ++i)
594 bset->ineq[i]+1+bset->nparam, n, bset->dim - n);
596 for (i = 0; i < bset->n_div; ++i)
598 bset->div[i]+1+1+bset->nparam, n, bset->dim - n);
600 isl_blk_free(bset->ctx, blk);
602 F_CLR(bset, ISL_BASIC_SET_NORMALIZED);
606 isl_basic_set_free(bset);
610 struct isl_set *isl_set_swap_vars(struct isl_set *set, unsigned n)
613 set = isl_set_cow(set);
617 for (i = 0; i < set->n; ++i) {
618 set->p[i] = isl_basic_set_swap_vars(set->p[i], n);
624 F_CLR(set, ISL_SET_NORMALIZED);
628 static void constraint_drop_vars(isl_int *c, unsigned n, unsigned rem)
630 isl_seq_cpy(c, c + n, rem);
631 isl_seq_clr(c + rem, n);
634 struct isl_basic_set *isl_basic_set_drop_dims(
635 struct isl_basic_set *bset, unsigned first, unsigned n)
642 isl_assert(bset->ctx, first + n <= bset->dim, goto error);
647 bset = isl_basic_set_cow(bset);
651 for (i = 0; i < bset->n_eq; ++i)
652 constraint_drop_vars(bset->eq[i]+1+bset->nparam+first, n,
653 (bset->dim-first-n)+bset->extra);
655 for (i = 0; i < bset->n_ineq; ++i)
656 constraint_drop_vars(bset->ineq[i]+1+bset->nparam+first, n,
657 (bset->dim-first-n)+bset->extra);
659 for (i = 0; i < bset->n_div; ++i)
660 constraint_drop_vars(bset->div[i]+1+1+bset->nparam+first, n,
661 (bset->dim-first-n)+bset->extra);
666 F_CLR(bset, ISL_BASIC_SET_NORMALIZED);
667 bset = isl_basic_set_simplify(bset);
668 return isl_basic_set_finalize(bset);
670 isl_basic_set_free(bset);
674 static struct isl_set *isl_set_drop_dims(
675 struct isl_set *set, unsigned first, unsigned n)
682 isl_assert(set->ctx, first + n <= set->dim, goto error);
686 set = isl_set_cow(set);
690 for (i = 0; i < set->n; ++i) {
691 set->p[i] = isl_basic_set_drop_dims(set->p[i], first, n);
697 F_CLR(set, ISL_SET_NORMALIZED);
704 struct isl_basic_map *isl_basic_map_drop_inputs(
705 struct isl_basic_map *bmap, unsigned first, unsigned n)
712 isl_assert(bmap->ctx, first + n <= bmap->n_in, goto error);
717 bmap = isl_basic_map_cow(bmap);
721 for (i = 0; i < bmap->n_eq; ++i)
722 constraint_drop_vars(bmap->eq[i]+1+bmap->nparam+first, n,
723 (bmap->n_in-first-n)+bmap->n_out+bmap->extra);
725 for (i = 0; i < bmap->n_ineq; ++i)
726 constraint_drop_vars(bmap->ineq[i]+1+bmap->nparam+first, n,
727 (bmap->n_in-first-n)+bmap->n_out+bmap->extra);
729 for (i = 0; i < bmap->n_div; ++i)
730 constraint_drop_vars(bmap->div[i]+1+1+bmap->nparam+first, n,
731 (bmap->n_in-first-n)+bmap->n_out+bmap->extra);
736 F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
737 bmap = isl_basic_map_simplify(bmap);
738 return isl_basic_map_finalize(bmap);
740 isl_basic_map_free(bmap);
744 static struct isl_map *isl_map_drop_inputs(
745 struct isl_map *map, unsigned first, unsigned n)
752 isl_assert(map->ctx, first + n <= map->n_in, goto error);
756 map = isl_map_cow(map);
760 for (i = 0; i < map->n; ++i) {
761 map->p[i] = isl_basic_map_drop_inputs(map->p[i], first, n);
766 F_CLR(map, ISL_MAP_NORMALIZED);
775 * We don't cow, as the div is assumed to be redundant.
777 static struct isl_basic_map *isl_basic_map_drop_div(
778 struct isl_basic_map *bmap, unsigned div)
786 pos = 1 + bmap->nparam + bmap->n_in + bmap->n_out + div;
788 isl_assert(bmap->ctx, div < bmap->n_div, goto error);
790 for (i = 0; i < bmap->n_eq; ++i)
791 constraint_drop_vars(bmap->eq[i]+pos, 1, bmap->extra-div-1);
793 for (i = 0; i < bmap->n_ineq; ++i) {
794 if (!isl_int_is_zero(bmap->ineq[i][pos])) {
795 isl_basic_map_drop_inequality(bmap, i);
799 constraint_drop_vars(bmap->ineq[i]+pos, 1, bmap->extra-div-1);
802 for (i = 0; i < bmap->n_div; ++i)
803 constraint_drop_vars(bmap->div[i]+1+pos, 1, bmap->extra-div-1);
805 if (div != bmap->n_div - 1) {
807 isl_int *t = bmap->div[div];
809 for (j = div; j < bmap->n_div - 1; ++j)
810 bmap->div[j] = bmap->div[j+1];
812 bmap->div[bmap->n_div - 1] = t;
814 F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
815 isl_basic_map_free_div(bmap, 1);
819 isl_basic_map_free(bmap);
823 static void eliminate_div(struct isl_basic_map *bmap, isl_int *eq, unsigned div)
826 unsigned pos = 1 + bmap->nparam + bmap->n_in + bmap->n_out + div;
828 len = 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
830 for (i = 0; i < bmap->n_eq; ++i)
831 if (bmap->eq[i] != eq)
832 isl_seq_elim(bmap->eq[i], eq, pos, len, NULL);
834 for (i = 0; i < bmap->n_ineq; ++i)
835 isl_seq_elim(bmap->ineq[i], eq, pos, len, NULL);
837 /* We need to be careful about circular definitions,
838 * so for now we just remove the definitions of other divs that
839 * depend on this div and (possibly) recompute them later.
841 for (i = 0; i < bmap->n_div; ++i)
842 if (!isl_int_is_zero(bmap->div[i][0]) &&
843 !isl_int_is_zero(bmap->div[i][1 + pos]))
844 isl_seq_clr(bmap->div[i], 1 + len);
846 isl_basic_map_drop_div(bmap, div);
849 struct isl_basic_map *isl_basic_map_set_to_empty(struct isl_basic_map *bmap)
855 total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->extra;
856 isl_basic_map_free_div(bmap, bmap->n_div);
857 isl_basic_map_free_inequality(bmap, bmap->n_ineq);
859 isl_basic_map_free_equality(bmap, bmap->n_eq-1);
861 isl_basic_map_alloc_equality(bmap);
865 isl_int_set_si(bmap->eq[i][0], 1);
866 isl_seq_clr(bmap->eq[i]+1, total);
867 F_SET(bmap, ISL_BASIC_MAP_EMPTY);
868 return isl_basic_map_finalize(bmap);
870 isl_basic_map_free(bmap);
874 struct isl_basic_set *isl_basic_set_set_to_empty(struct isl_basic_set *bset)
876 return (struct isl_basic_set *)
877 isl_basic_map_set_to_empty((struct isl_basic_map *)bset);
880 static void swap_equality(struct isl_basic_map *bmap, int a, int b)
882 isl_int *t = bmap->eq[a];
883 bmap->eq[a] = bmap->eq[b];
887 static void swap_inequality(struct isl_basic_map *bmap, int a, int b)
890 isl_int *t = bmap->ineq[a];
891 bmap->ineq[a] = bmap->ineq[b];
896 static void set_swap_inequality(struct isl_basic_set *bset, int a, int b)
898 swap_inequality((struct isl_basic_map *)bset, a, b);
901 static void swap_div(struct isl_basic_map *bmap, int a, int b)
904 unsigned off = bmap->nparam + bmap->n_in + bmap->n_out;
905 isl_int *t = bmap->div[a];
906 bmap->div[a] = bmap->div[b];
909 for (i = 0; i < bmap->n_eq; ++i)
910 isl_int_swap(bmap->eq[i][1+off+a], bmap->eq[i][1+off+b]);
912 for (i = 0; i < bmap->n_ineq; ++i)
913 isl_int_swap(bmap->ineq[i][1+off+a], bmap->ineq[i][1+off+b]);
915 for (i = 0; i < bmap->n_div; ++i)
916 isl_int_swap(bmap->div[i][1+1+off+a], bmap->div[i][1+1+off+b]);
917 F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
920 static void eliminate_var_using_equality(struct isl_basic_map *bmap,
921 unsigned pos, isl_int *eq, int *progress)
926 total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
927 for (k = 0; k < bmap->n_eq; ++k) {
928 if (bmap->eq[k] == eq)
930 if (isl_int_is_zero(bmap->eq[k][1+pos]))
934 isl_seq_elim(bmap->eq[k], eq, 1+pos, 1+total, NULL);
937 for (k = 0; k < bmap->n_ineq; ++k) {
938 if (isl_int_is_zero(bmap->ineq[k][1+pos]))
942 isl_seq_elim(bmap->ineq[k], eq, 1+pos, 1+total, NULL);
943 F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
946 for (k = 0; k < bmap->n_div; ++k) {
947 if (isl_int_is_zero(bmap->div[k][0]))
949 if (isl_int_is_zero(bmap->div[k][1+1+pos]))
953 isl_seq_elim(bmap->div[k]+1, eq,
954 1+pos, 1+total, &bmap->div[k][0]);
955 F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
960 struct isl_basic_map *isl_basic_map_gauss(
961 struct isl_basic_map *bmap, int *progress)
972 total_var = bmap->nparam + bmap->n_in + bmap->n_out;
973 total = total_var + bmap->n_div;
975 last_var = total - 1;
976 for (done = 0; done < bmap->n_eq; ++done) {
977 for (; last_var >= 0; --last_var) {
978 for (k = done; k < bmap->n_eq; ++k)
979 if (!isl_int_is_zero(bmap->eq[k][1+last_var]))
987 swap_equality(bmap, k, done);
988 if (isl_int_is_neg(bmap->eq[done][1+last_var]))
989 isl_seq_neg(bmap->eq[done], bmap->eq[done], 1+total);
991 eliminate_var_using_equality(bmap, last_var, bmap->eq[done],
994 if (last_var >= total_var &&
995 isl_int_is_zero(bmap->div[last_var - total_var][0])) {
996 unsigned div = last_var - total_var;
997 isl_seq_neg(bmap->div[div]+1, bmap->eq[done], 1+total);
998 isl_int_set_si(bmap->div[div][1+1+last_var], 0);
999 isl_int_set(bmap->div[div][0],
1000 bmap->eq[done][1+last_var]);
1001 F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1004 if (done == bmap->n_eq)
1006 for (k = done; k < bmap->n_eq; ++k) {
1007 if (isl_int_is_zero(bmap->eq[k][0]))
1009 return isl_basic_map_set_to_empty(bmap);
1011 isl_basic_map_free_equality(bmap, bmap->n_eq-done);
1015 struct isl_basic_set *isl_basic_set_gauss(
1016 struct isl_basic_set *bset, int *progress)
1018 return (struct isl_basic_set*)isl_basic_map_gauss(
1019 (struct isl_basic_map *)bset, progress);
1022 static unsigned int round_up(unsigned int v)
1033 static int hash_index(int *index, unsigned int size, int bits,
1034 struct isl_basic_map *bmap, int k)
1037 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
1038 u_int32_t hash = isl_seq_hash(bmap->ineq[k]+1, total, bits);
1039 for (h = hash; index[h]; h = (h+1) % size)
1040 if (k != index[h]-1 &&
1041 isl_seq_eq(bmap->ineq[k]+1,
1042 bmap->ineq[index[h]-1]+1, total))
1047 static struct isl_basic_map *remove_duplicate_constraints(
1048 struct isl_basic_map *bmap, int *progress)
1054 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
1057 if (bmap->n_ineq <= 1)
1060 size = round_up(4 * (bmap->n_ineq+1) / 3 - 1);
1061 bits = ffs(size) - 1;
1062 index = isl_alloc_array(ctx, int, size);
1063 memset(index, 0, size * sizeof(int));
1067 index[isl_seq_hash(bmap->ineq[0]+1, total, bits)] = 1;
1068 for (k = 1; k < bmap->n_ineq; ++k) {
1069 h = hash_index(index, size, bits, bmap, k);
1077 if (isl_int_lt(bmap->ineq[k][0], bmap->ineq[l][0]))
1078 swap_inequality(bmap, k, l);
1079 isl_basic_map_drop_inequality(bmap, k);
1083 for (k = 0; k < bmap->n_ineq-1; ++k) {
1084 isl_seq_neg(bmap->ineq[k]+1, bmap->ineq[k]+1, total);
1085 h = hash_index(index, size, bits, bmap, k);
1086 isl_seq_neg(bmap->ineq[k]+1, bmap->ineq[k]+1, total);
1090 isl_int_add(sum, bmap->ineq[k][0], bmap->ineq[l][0]);
1091 if (isl_int_is_pos(sum))
1093 if (isl_int_is_zero(sum)) {
1094 /* We need to break out of the loop after these
1095 * changes since the contents of the hash
1096 * will no longer be valid.
1097 * Plus, we probably we want to regauss first.
1099 isl_basic_map_drop_inequality(bmap, l);
1100 isl_basic_map_inequality_to_equality(bmap, k);
1102 bmap = isl_basic_map_set_to_empty(bmap);
1111 static void compute_elimination_index(struct isl_basic_map *bmap, int *elim)
1116 total = bmap->nparam + bmap->n_in + bmap->n_out;
1117 for (d = 0; d < total; ++d)
1119 for (d = total - 1, i = 0; d >= 0 && i < bmap->n_eq; ++i) {
1120 for (; d >= 0; --d) {
1121 if (isl_int_is_zero(bmap->eq[i][1+d]))
1129 static void set_compute_elimination_index(struct isl_basic_set *bset, int *elim)
1131 return compute_elimination_index((struct isl_basic_map *)bset, elim);
1134 static int reduced_using_equalities(isl_int *dst, isl_int *src,
1135 struct isl_basic_map *bmap, int *elim)
1141 total = bmap->nparam + bmap->n_in + bmap->n_out;
1142 for (d = total - 1; d >= 0; --d) {
1143 if (isl_int_is_zero(src[1+d]))
1148 isl_seq_cpy(dst, src, 1 + total);
1151 isl_seq_elim(dst, bmap->eq[elim[d]], 1 + d, 1 + total, NULL);
1156 static int set_reduced_using_equalities(isl_int *dst, isl_int *src,
1157 struct isl_basic_set *bset, int *elim)
1159 return reduced_using_equalities(dst, src,
1160 (struct isl_basic_map *)bset, elim);
1163 /* Quick check to see if two basic maps are disjoint.
1164 * In particular, we reduce the equalities and inequalities of
1165 * one basic map in the context of the equalities of the other
1166 * basic map and check if we get a contradiction.
1168 int isl_basic_map_fast_is_disjoint(struct isl_basic_map *bmap1,
1169 struct isl_basic_map *bmap2)
1171 struct isl_vec *v = NULL;
1176 if (!bmap1 || !bmap2)
1178 isl_assert(bmap1->ctx, bmap1->nparam == bmap2->nparam, return -1);
1179 isl_assert(bmap1->ctx, bmap1->n_in == bmap2->n_in, return -1);
1180 isl_assert(bmap1->ctx, bmap1->n_out == bmap2->n_out, return -1);
1181 if (bmap1->n_div || bmap2->n_div)
1183 if (!bmap1->n_eq && !bmap2->n_eq)
1186 total = bmap1->nparam + bmap1->n_in + bmap1->n_out;
1189 v = isl_vec_alloc(bmap1->ctx, 1 + total);
1192 elim = isl_alloc_array(bmap1->ctx, int, total);
1195 compute_elimination_index(bmap1, elim);
1196 for (i = 0; i < bmap2->n_eq; ++i) {
1198 reduced = reduced_using_equalities(v->block.data, bmap2->eq[i],
1200 if (reduced && !isl_int_is_zero(v->block.data[0]) &&
1201 isl_seq_first_non_zero(v->block.data + 1, total) == -1)
1204 for (i = 0; i < bmap2->n_ineq; ++i) {
1206 reduced = reduced_using_equalities(v->block.data,
1207 bmap2->ineq[i], bmap1, elim);
1208 if (reduced && isl_int_is_neg(v->block.data[0]) &&
1209 isl_seq_first_non_zero(v->block.data + 1, total) == -1)
1212 compute_elimination_index(bmap2, elim);
1213 for (i = 0; i < bmap1->n_ineq; ++i) {
1215 reduced = reduced_using_equalities(v->block.data,
1216 bmap1->ineq[i], bmap2, elim);
1217 if (reduced && isl_int_is_neg(v->block.data[0]) &&
1218 isl_seq_first_non_zero(v->block.data + 1, total) == -1)
1221 isl_vec_free(bmap1->ctx, v);
1225 isl_vec_free(bmap1->ctx, v);
1229 isl_vec_free(bmap1->ctx, v);
1234 int isl_basic_set_fast_is_disjoint(struct isl_basic_set *bset1,
1235 struct isl_basic_set *bset2)
1237 return isl_basic_map_fast_is_disjoint((struct isl_basic_map *)bset1,
1238 (struct isl_basic_map *)bset2);
1241 int isl_map_fast_is_disjoint(struct isl_map *map1, struct isl_map *map2)
1248 if (isl_map_fast_is_equal(map1, map2))
1251 for (i = 0; i < map1->n; ++i) {
1252 for (j = 0; j < map2->n; ++j) {
1253 int d = isl_basic_map_fast_is_disjoint(map1->p[i],
1262 int isl_set_fast_is_disjoint(struct isl_set *set1, struct isl_set *set2)
1264 return isl_map_fast_is_disjoint((struct isl_map *)set1,
1265 (struct isl_map *)set2);
1268 static struct isl_basic_map *remove_duplicate_divs(
1269 struct isl_basic_map *bmap, int *progress)
1276 unsigned total_var = bmap->nparam + bmap->n_in + bmap->n_out;
1277 unsigned total = total_var + bmap->n_div;
1278 struct isl_ctx *ctx;
1280 if (bmap->n_div <= 1)
1284 for (k = bmap->n_div - 1; k >= 0; --k)
1285 if (!isl_int_is_zero(bmap->div[k][0]))
1290 size = round_up(4 * bmap->n_div / 3 - 1);
1291 bits = ffs(size) - 1;
1292 index = isl_alloc_array(ctx, int, size);
1293 memset(index, 0, size * sizeof(int));
1296 eq = isl_blk_alloc(ctx, 1+total);
1297 if (isl_blk_is_error(eq))
1300 isl_seq_clr(eq.data, 1+total);
1301 index[isl_seq_hash(bmap->div[k], 2+total, bits)] = k + 1;
1302 for (--k; k >= 0; --k) {
1305 if (isl_int_is_zero(bmap->div[k][0]))
1308 hash = isl_seq_hash(bmap->div[k], 2+total, bits);
1309 for (h = hash; index[h]; h = (h+1) % size)
1310 if (isl_seq_eq(bmap->div[k],
1311 bmap->div[index[h]-1], 2+total))
1316 isl_int_set_si(eq.data[1+total_var+k], -1);
1317 isl_int_set_si(eq.data[1+total_var+l], 1);
1318 eliminate_div(bmap, eq.data, l);
1319 isl_int_set_si(eq.data[1+total_var+k], 0);
1320 isl_int_set_si(eq.data[1+total_var+l], 0);
1325 isl_blk_free(ctx, eq);
1331 /* Elimininate divs based on equalities
1333 static struct isl_basic_map *eliminate_divs_eq(
1334 struct isl_basic_map *bmap, int *progress)
1344 off = 1 + bmap->nparam + bmap->n_in + bmap->n_out;
1346 for (d = bmap->n_div - 1; d >= 0 ; --d) {
1347 for (i = 0; i < bmap->n_eq; ++i) {
1348 if (!isl_int_is_one(bmap->eq[i][off + d]) &&
1349 !isl_int_is_negone(bmap->eq[i][off + d]))
1353 eliminate_div(bmap, bmap->eq[i], d);
1354 isl_basic_map_drop_equality(bmap, i);
1359 return eliminate_divs_eq(bmap, progress);
1363 static struct isl_basic_map *normalize_constraints(struct isl_basic_map *bmap)
1367 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
1370 for (i = bmap->n_eq - 1; i >= 0; --i) {
1371 isl_seq_gcd(bmap->eq[i]+1, total, &gcd);
1372 if (isl_int_is_zero(gcd)) {
1373 if (!isl_int_is_zero(bmap->eq[i][0])) {
1374 bmap = isl_basic_map_set_to_empty(bmap);
1377 isl_basic_map_drop_equality(bmap, i);
1380 if (F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL))
1381 isl_int_gcd(gcd, gcd, bmap->eq[i][0]);
1382 if (isl_int_is_one(gcd))
1384 if (!isl_int_is_divisible_by(bmap->eq[i][0], gcd)) {
1385 bmap = isl_basic_map_set_to_empty(bmap);
1388 isl_seq_scale_down(bmap->eq[i], bmap->eq[i], gcd, 1+total);
1391 for (i = bmap->n_ineq - 1; i >= 0; --i) {
1392 isl_seq_gcd(bmap->ineq[i]+1, total, &gcd);
1393 if (isl_int_is_zero(gcd)) {
1394 if (isl_int_is_neg(bmap->ineq[i][0])) {
1395 bmap = isl_basic_map_set_to_empty(bmap);
1398 isl_basic_map_drop_inequality(bmap, i);
1401 if (F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL))
1402 isl_int_gcd(gcd, gcd, bmap->ineq[i][0]);
1403 if (isl_int_is_one(gcd))
1405 isl_int_fdiv_q(bmap->ineq[i][0], bmap->ineq[i][0], gcd);
1406 isl_seq_scale_down(bmap->ineq[i]+1, bmap->ineq[i]+1, gcd, total);
1414 /* Eliminate the specified variables from the constraints using
1415 * Fourier-Motzkin. The variables themselves are not removed.
1417 struct isl_basic_map *isl_basic_map_eliminate_vars(
1418 struct isl_basic_map *bmap, int pos, unsigned n)
1427 total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
1428 extra = bmap->extra - bmap->n_div;
1430 bmap = isl_basic_map_cow(bmap);
1431 for (d = pos + n - 1; d >= pos; --d) {
1432 int n_lower, n_upper;
1435 for (i = 0; i < bmap->n_eq; ++i) {
1436 if (isl_int_is_zero(bmap->eq[i][1+d]))
1438 eliminate_var_using_equality(bmap, d, bmap->eq[i], NULL);
1439 isl_basic_map_drop_equality(bmap, i);
1446 for (i = 0; i < bmap->n_ineq; ++i) {
1447 if (isl_int_is_pos(bmap->ineq[i][1+d]))
1449 else if (isl_int_is_neg(bmap->ineq[i][1+d]))
1452 bmap = isl_basic_map_extend(bmap,
1453 bmap->nparam, bmap->n_in, bmap->n_out, 0,
1454 0, n_lower * n_upper);
1455 for (i = bmap->n_ineq - 1; i >= 0; --i) {
1457 if (isl_int_is_zero(bmap->ineq[i][1+d]))
1460 for (j = 0; j < i; ++j) {
1461 if (isl_int_is_zero(bmap->ineq[j][1+d]))
1464 if (isl_int_sgn(bmap->ineq[i][1+d]) ==
1465 isl_int_sgn(bmap->ineq[j][1+d]))
1467 k = isl_basic_map_alloc_inequality(bmap);
1470 isl_seq_cpy(bmap->ineq[k], bmap->ineq[i],
1472 isl_seq_clr(bmap->ineq[k]+1+total, extra);
1473 isl_seq_elim(bmap->ineq[k], bmap->ineq[j],
1474 1+d, 1+total, NULL);
1476 isl_basic_map_drop_inequality(bmap, i);
1479 if (n_lower > 0 && n_upper > 0) {
1480 bmap = normalize_constraints(bmap);
1481 bmap = remove_duplicate_constraints(bmap, NULL);
1482 bmap = isl_basic_map_gauss(bmap, NULL);
1483 bmap = isl_basic_map_convex_hull(bmap);
1486 if (F_ISSET(bmap, ISL_BASIC_MAP_EMPTY))
1490 F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1493 isl_basic_map_free(bmap);
1497 struct isl_basic_set *isl_basic_set_eliminate_vars(
1498 struct isl_basic_set *bset, unsigned pos, unsigned n)
1500 return (struct isl_basic_set *)isl_basic_map_eliminate_vars(
1501 (struct isl_basic_map *)bset, pos, n);
1504 /* Eliminate the specified n dimensions starting at first from the
1505 * constraints using Fourier-Motzkin, The dimensions themselves
1508 struct isl_set *isl_set_eliminate_dims(struct isl_set *set,
1509 unsigned first, unsigned n)
1516 set = isl_set_cow(set);
1519 isl_assert(set->ctx, first+n <= set->dim, goto error);
1521 for (i = 0; i < set->n; ++i) {
1522 set->p[i] = isl_basic_set_eliminate_vars(set->p[i],
1523 set->nparam + first, n);
1533 /* Project out n dimensions starting at first using Fourier-Motzkin */
1534 struct isl_set *isl_set_remove_dims(struct isl_set *set,
1535 unsigned first, unsigned n)
1537 set = isl_set_eliminate_dims(set, first, n);
1538 set = isl_set_drop_dims(set, first, n);
1542 /* Project out n inputs starting at first using Fourier-Motzkin */
1543 struct isl_map *isl_map_remove_inputs(struct isl_map *map,
1544 unsigned first, unsigned n)
1551 map = isl_map_cow(map);
1554 isl_assert(map->ctx, first+n <= map->n_in, goto error);
1556 for (i = 0; i < map->n; ++i) {
1557 map->p[i] = isl_basic_map_eliminate_vars(map->p[i],
1558 map->nparam + first, n);
1562 map = isl_map_drop_inputs(map, first, n);
1569 /* Project out n dimensions starting at first using Fourier-Motzkin */
1570 struct isl_basic_set *isl_basic_set_remove_dims(struct isl_basic_set *bset,
1571 unsigned first, unsigned n)
1573 bset = isl_basic_set_eliminate_vars(bset, bset->nparam + first, n);
1574 bset = isl_basic_set_drop_dims(bset, first, n);
1578 /* Elimininate divs based on inequalities
1580 static struct isl_basic_map *eliminate_divs_ineq(
1581 struct isl_basic_map *bmap, int *progress)
1586 struct isl_ctx *ctx;
1592 off = 1 + bmap->nparam + bmap->n_in + bmap->n_out;
1594 for (d = bmap->n_div - 1; d >= 0 ; --d) {
1595 for (i = 0; i < bmap->n_eq; ++i)
1596 if (!isl_int_is_zero(bmap->eq[i][off + d]))
1600 for (i = 0; i < bmap->n_ineq; ++i)
1601 if (isl_int_abs_gt(bmap->ineq[i][off + d], ctx->one))
1603 if (i < bmap->n_ineq)
1606 bmap = isl_basic_map_eliminate_vars(bmap, (off-1)+d, 1);
1607 if (F_ISSET(bmap, ISL_BASIC_MAP_EMPTY))
1609 bmap = isl_basic_map_drop_div(bmap, d);
1616 struct isl_basic_map *isl_basic_map_simplify(struct isl_basic_map *bmap)
1623 bmap = normalize_constraints(bmap);
1624 bmap = eliminate_divs_eq(bmap, &progress);
1625 bmap = eliminate_divs_ineq(bmap, &progress);
1626 bmap = isl_basic_map_gauss(bmap, &progress);
1627 bmap = remove_duplicate_divs(bmap, &progress);
1628 bmap = remove_duplicate_constraints(bmap, &progress);
1633 struct isl_basic_set *isl_basic_set_simplify(struct isl_basic_set *bset)
1635 return (struct isl_basic_set *)
1636 isl_basic_map_simplify((struct isl_basic_map *)bset);
1639 static void dump_term(struct isl_basic_map *bmap,
1640 isl_int c, int pos, FILE *out)
1642 unsigned in = bmap->n_in;
1643 unsigned dim = bmap->n_in + bmap->n_out;
1645 isl_int_print(out, c, 0);
1647 if (!isl_int_is_one(c))
1648 isl_int_print(out, c, 0);
1649 if (pos < 1 + bmap->nparam)
1650 fprintf(out, "p%d", pos - 1);
1651 else if (pos < 1 + bmap->nparam + in)
1652 fprintf(out, "i%d", pos - 1 - bmap->nparam);
1653 else if (pos < 1 + bmap->nparam + dim)
1654 fprintf(out, "o%d", pos - 1 - bmap->nparam - in);
1656 fprintf(out, "e%d", pos - 1 - bmap->nparam - dim);
1660 static void dump_constraint_sign(struct isl_basic_map *bmap, isl_int *c,
1661 int sign, FILE *out)
1665 unsigned len = 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
1669 for (i = 0, first = 1; i < len; ++i) {
1670 if (isl_int_sgn(c[i]) * sign <= 0)
1673 fprintf(out, " + ");
1675 isl_int_abs(v, c[i]);
1676 dump_term(bmap, v, i, out);
1683 static void dump_constraint(struct isl_basic_map *bmap, isl_int *c,
1684 const char *op, FILE *out, int indent)
1688 fprintf(out, "%*s", indent, "");
1690 dump_constraint_sign(bmap, c, 1, out);
1691 fprintf(out, " %s ", op);
1692 dump_constraint_sign(bmap, c, -1, out);
1696 for (i = bmap->n_div; i < bmap->extra; ++i) {
1697 if (isl_int_is_zero(c[1+bmap->nparam+bmap->n_in+bmap->n_out+i]))
1699 fprintf(out, "%*s", indent, "");
1700 fprintf(out, "ERROR: unused div coefficient not zero\n");
1704 static void dump_constraints(struct isl_basic_map *bmap,
1705 isl_int **c, unsigned n,
1706 const char *op, FILE *out, int indent)
1710 for (i = 0; i < n; ++i)
1711 dump_constraint(bmap, c[i], op, out, indent);
1714 static void dump_affine(struct isl_basic_map *bmap, isl_int *exp, FILE *out)
1718 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
1720 for (j = 0; j < 1 + total; ++j) {
1721 if (isl_int_is_zero(exp[j]))
1723 if (!first && isl_int_is_pos(exp[j]))
1725 dump_term(bmap, exp[j], j, out);
1730 static void dump(struct isl_basic_map *bmap, FILE *out, int indent)
1734 dump_constraints(bmap, bmap->eq, bmap->n_eq, "=", out, indent);
1735 dump_constraints(bmap, bmap->ineq, bmap->n_ineq, ">=", out, indent);
1737 for (i = 0; i < bmap->n_div; ++i) {
1738 fprintf(out, "%*s", indent, "");
1739 fprintf(out, "e%d = [(", i);
1740 dump_affine(bmap, bmap->div[i]+1, out);
1742 isl_int_print(out, bmap->div[i][0], 0);
1743 fprintf(out, "]\n");
1747 void isl_basic_set_dump(struct isl_basic_set *bset, FILE *out, int indent)
1750 fprintf(out, "null basic set\n");
1754 fprintf(out, "%*s", indent, "");
1755 fprintf(out, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n",
1756 bset->ref, bset->nparam, bset->dim, bset->extra,
1758 dump((struct isl_basic_map *)bset, out, indent);
1761 void isl_basic_map_dump(struct isl_basic_map *bmap, FILE *out, int indent)
1764 fprintf(out, "null basic map\n");
1768 fprintf(out, "%*s", indent, "");
1769 fprintf(out, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, flags: %x\n",
1771 bmap->nparam, bmap->n_in, bmap->n_out, bmap->extra, bmap->flags);
1772 dump(bmap, out, indent);
1775 int isl_inequality_negate(struct isl_basic_map *bmap, unsigned pos)
1777 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
1780 isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
1781 isl_seq_neg(bmap->ineq[pos], bmap->ineq[pos], 1 + total);
1782 isl_int_sub_ui(bmap->ineq[pos][0], bmap->ineq[pos][0], 1);
1783 F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1787 struct isl_set *isl_set_alloc(struct isl_ctx *ctx,
1788 unsigned nparam, unsigned dim, int n, unsigned flags)
1790 struct isl_set *set;
1792 isl_assert(ctx, n >= 0, return NULL);
1793 set = isl_alloc(ctx, struct isl_set,
1794 sizeof(struct isl_set) +
1795 n * sizeof(struct isl_basic_set *));
1804 set->nparam = nparam;
1811 struct isl_set *isl_set_dup(struct isl_set *set)
1814 struct isl_set *dup;
1819 dup = isl_set_alloc(set->ctx, set->nparam, set->dim, set->n, set->flags);
1822 for (i = 0; i < set->n; ++i)
1823 dup = isl_set_add(dup,
1824 isl_basic_set_dup(set->p[i]));
1828 struct isl_set *isl_set_from_basic_set(struct isl_basic_set *bset)
1830 struct isl_set *set;
1835 set = isl_set_alloc(bset->ctx, bset->nparam, bset->dim, 1, ISL_MAP_DISJOINT);
1837 isl_basic_set_free(bset);
1840 return isl_set_add(set, bset);
1843 struct isl_map *isl_map_from_basic_map(struct isl_basic_map *bmap)
1845 struct isl_map *map;
1850 map = isl_map_alloc(bmap->ctx, bmap->nparam, bmap->n_in, bmap->n_out, 1,
1853 isl_basic_map_free(bmap);
1856 return isl_map_add(map, bmap);
1859 struct isl_set *isl_set_add(struct isl_set *set, struct isl_basic_set *bset)
1863 isl_assert(set->ctx, set->nparam == bset->nparam, goto error);
1864 isl_assert(set->ctx, set->dim == bset->dim, goto error);
1865 isl_assert(set->ctx, set->n < set->size, goto error);
1866 set->p[set->n] = bset;
1873 isl_basic_set_free(bset);
1877 void isl_set_free(struct isl_set *set)
1887 isl_ctx_deref(set->ctx);
1888 for (i = 0; i < set->n; ++i)
1889 isl_basic_set_free(set->p[i]);
1893 void isl_set_dump(struct isl_set *set, FILE *out, int indent)
1898 fprintf(out, "null set\n");
1902 fprintf(out, "%*s", indent, "");
1903 fprintf(out, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
1904 set->ref, set->n, set->nparam, set->dim, set->flags);
1905 for (i = 0; i < set->n; ++i) {
1906 fprintf(out, "%*s", indent, "");
1907 fprintf(out, "basic set %d:\n", i);
1908 isl_basic_set_dump(set->p[i], out, indent+4);
1912 void isl_map_dump(struct isl_map *map, FILE *out, int indent)
1917 fprintf(out, "null map\n");
1921 fprintf(out, "%*s", indent, "");
1922 fprintf(out, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, flags: %x\n",
1923 map->ref, map->n, map->nparam, map->n_in, map->n_out,
1925 for (i = 0; i < map->n; ++i) {
1926 fprintf(out, "%*s", indent, "");
1927 fprintf(out, "basic map %d:\n", i);
1928 isl_basic_map_dump(map->p[i], out, indent+4);
1932 struct isl_basic_map *isl_basic_map_intersect_domain(
1933 struct isl_basic_map *bmap, struct isl_basic_set *bset)
1935 struct isl_basic_map *bmap_domain;
1940 isl_assert(bset->ctx, bset->dim == bmap->n_in, goto error);
1941 isl_assert(bset->ctx, bset->nparam == bmap->nparam, goto error);
1943 bmap = isl_basic_map_extend(bmap,
1944 bset->nparam, bmap->n_in, bmap->n_out,
1945 bset->n_div, bset->n_eq, bset->n_ineq);
1948 bmap_domain = isl_basic_map_from_basic_set(bset,
1950 bmap = add_constraints(bmap, bmap_domain, 0, 0);
1952 bmap = isl_basic_map_simplify(bmap);
1953 return isl_basic_map_finalize(bmap);
1955 isl_basic_map_free(bmap);
1956 isl_basic_set_free(bset);
1960 struct isl_basic_map *isl_basic_map_intersect_range(
1961 struct isl_basic_map *bmap, struct isl_basic_set *bset)
1963 struct isl_basic_map *bmap_range;
1968 isl_assert(bset->ctx, bset->dim == bmap->n_out, goto error);
1969 isl_assert(bset->ctx, bset->nparam == bmap->nparam, goto error);
1971 bmap = isl_basic_map_extend(bmap,
1972 bset->nparam, bmap->n_in, bmap->n_out,
1973 bset->n_div, bset->n_eq, bset->n_ineq);
1976 bmap_range = isl_basic_map_from_basic_set(bset,
1978 bmap = add_constraints(bmap, bmap_range, 0, 0);
1980 bmap = isl_basic_map_simplify(bmap);
1981 return isl_basic_map_finalize(bmap);
1983 isl_basic_map_free(bmap);
1984 isl_basic_set_free(bset);
1988 struct isl_basic_map *isl_basic_map_intersect(
1989 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
1991 if (!bmap1 || !bmap2)
1994 isl_assert(bmap1->ctx, bmap1->nparam == bmap2->nparam, goto error);
1995 isl_assert(bmap1->ctx, bmap1->n_in == bmap2->n_in, goto error);
1996 isl_assert(bmap1->ctx, bmap1->n_out == bmap2->n_out, goto error);
1998 bmap1 = isl_basic_map_extend(bmap1,
1999 bmap1->nparam, bmap1->n_in, bmap1->n_out,
2000 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
2003 bmap1 = add_constraints(bmap1, bmap2, 0, 0);
2005 bmap1 = isl_basic_map_simplify(bmap1);
2006 return isl_basic_map_finalize(bmap1);
2008 isl_basic_map_free(bmap1);
2009 isl_basic_map_free(bmap2);
2013 struct isl_basic_set *isl_basic_set_intersect(
2014 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
2016 return (struct isl_basic_set *)
2017 isl_basic_map_intersect(
2018 (struct isl_basic_map *)bset1,
2019 (struct isl_basic_map *)bset2);
2022 struct isl_map *isl_map_intersect(struct isl_map *map1, struct isl_map *map2)
2025 struct isl_map *result;
2031 if (F_ISSET(map1, ISL_MAP_DISJOINT) &&
2032 F_ISSET(map2, ISL_MAP_DISJOINT))
2033 FL_SET(flags, ISL_MAP_DISJOINT);
2035 result = isl_map_alloc(map1->ctx, map1->nparam, map1->n_in, map1->n_out,
2036 map1->n * map2->n, flags);
2039 for (i = 0; i < map1->n; ++i)
2040 for (j = 0; j < map2->n; ++j) {
2041 struct isl_basic_map *part;
2042 part = isl_basic_map_intersect(
2043 isl_basic_map_copy(map1->p[i]),
2044 isl_basic_map_copy(map2->p[j]));
2045 if (isl_basic_map_is_empty(part))
2046 isl_basic_map_free(part);
2048 result = isl_map_add(result, part);
2061 struct isl_set *isl_set_intersect(struct isl_set *set1, struct isl_set *set2)
2063 return (struct isl_set *)
2064 isl_map_intersect((struct isl_map *)set1,
2065 (struct isl_map *)set2);
2068 struct isl_basic_map *isl_basic_map_reverse(struct isl_basic_map *bmap)
2070 struct isl_basic_set *bset;
2075 bmap = isl_basic_map_cow(bmap);
2079 bset = isl_basic_set_from_basic_map(bmap);
2080 bset = isl_basic_set_swap_vars(bset, in);
2081 return isl_basic_map_from_basic_set(bset, bset->dim-in, in);
2084 /* Turn final n dimensions into existentially quantified variables.
2086 struct isl_basic_set *isl_basic_set_project_out(
2087 struct isl_basic_set *bset, unsigned n, unsigned flags)
2097 isl_assert(bset->ctx, n <= bset->dim, goto error);
2102 bset = isl_basic_set_cow(bset);
2104 row_size = 1 + bset->nparam + bset->dim + bset->extra;
2105 old = bset->block2.data;
2106 bset->block2 = isl_blk_extend(bset->ctx, bset->block2,
2107 (bset->extra + n) * (1 + row_size));
2108 if (!bset->block2.data)
2110 new_div = isl_alloc_array(ctx, isl_int *, bset->extra + n);
2113 for (i = 0; i < n; ++i) {
2114 new_div[i] = bset->block2.data +
2115 (bset->extra + i) * (1 + row_size);
2116 isl_seq_clr(new_div[i], 1 + row_size);
2118 for (i = 0; i < bset->extra; ++i)
2119 new_div[n + i] = bset->block2.data + (bset->div[i] - old);
2121 bset->div = new_div;
2125 bset = isl_basic_set_simplify(bset);
2126 return isl_basic_set_finalize(bset);
2128 isl_basic_set_free(bset);
2132 struct isl_basic_map *isl_basic_map_apply_range(
2133 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2135 struct isl_basic_set *bset;
2136 unsigned n_in, n_out;
2138 if (!bmap1 || !bmap2)
2141 isl_assert(bmap->ctx, bmap1->n_out == bmap2->n_in, goto error);
2142 isl_assert(bmap->ctx, bmap1->nparam == bmap2->nparam, goto error);
2145 n_out = bmap2->n_out;
2147 bmap2 = isl_basic_map_reverse(bmap2);
2150 bmap1 = isl_basic_map_extend(bmap1, bmap1->nparam,
2151 bmap1->n_in + bmap2->n_in, bmap1->n_out,
2152 bmap2->extra, bmap2->n_eq, bmap2->n_ineq);
2155 bmap1 = add_constraints(bmap1, bmap2, bmap1->n_in - bmap2->n_in, 0);
2156 bmap1 = isl_basic_map_simplify(bmap1);
2157 bset = isl_basic_set_from_basic_map(bmap1);
2158 bset = isl_basic_set_project_out(bset,
2159 bset->dim - (n_in + n_out), 0);
2160 return isl_basic_map_from_basic_set(bset, n_in, n_out);
2162 isl_basic_map_free(bmap1);
2163 isl_basic_map_free(bmap2);
2167 struct isl_basic_set *isl_basic_set_apply(
2168 struct isl_basic_set *bset, struct isl_basic_map *bmap)
2173 isl_assert(bset->ctx, bset->dim == bmap->n_in, goto error);
2175 return (struct isl_basic_set *)
2176 isl_basic_map_apply_range((struct isl_basic_map *)bset, bmap);
2178 isl_basic_set_free(bset);
2179 isl_basic_map_free(bmap);
2183 struct isl_basic_map *isl_basic_map_apply_domain(
2184 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2186 if (!bmap1 || !bmap2)
2189 isl_assert(ctx, bmap1->n_in == bmap2->n_in, goto error);
2190 isl_assert(ctx, bmap1->nparam == bmap2->nparam, goto error);
2192 bmap1 = isl_basic_map_reverse(bmap1);
2193 bmap1 = isl_basic_map_apply_range(bmap1, bmap2);
2194 return isl_basic_map_reverse(bmap1);
2196 isl_basic_map_free(bmap1);
2197 isl_basic_map_free(bmap2);
2201 static struct isl_basic_map *var_equal(struct isl_ctx *ctx,
2202 struct isl_basic_map *bmap, unsigned pos)
2205 i = isl_basic_map_alloc_equality(bmap);
2208 isl_seq_clr(bmap->eq[i],
2209 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->extra);
2210 isl_int_set_si(bmap->eq[i][1+bmap->nparam+pos], -1);
2211 isl_int_set_si(bmap->eq[i][1+bmap->nparam+bmap->n_in+pos], 1);
2212 return isl_basic_map_finalize(bmap);
2214 isl_basic_map_free(bmap);
2218 static struct isl_basic_map *var_more(struct isl_ctx *ctx,
2219 struct isl_basic_map *bmap, unsigned pos)
2222 i = isl_basic_map_alloc_inequality(bmap);
2225 isl_seq_clr(bmap->ineq[i],
2226 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->extra);
2227 isl_int_set_si(bmap->ineq[i][0], -1);
2228 isl_int_set_si(bmap->ineq[i][1+bmap->nparam+pos], -1);
2229 isl_int_set_si(bmap->ineq[i][1+bmap->nparam+bmap->n_in+pos], 1);
2230 return isl_basic_map_finalize(bmap);
2232 isl_basic_map_free(bmap);
2236 static struct isl_basic_map *var_less(struct isl_ctx *ctx,
2237 struct isl_basic_map *bmap, unsigned pos)
2240 i = isl_basic_map_alloc_inequality(bmap);
2243 isl_seq_clr(bmap->ineq[i],
2244 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->extra);
2245 isl_int_set_si(bmap->ineq[i][0], -1);
2246 isl_int_set_si(bmap->ineq[i][1+bmap->nparam+pos], 1);
2247 isl_int_set_si(bmap->ineq[i][1+bmap->nparam+bmap->n_in+pos], -1);
2248 return isl_basic_map_finalize(bmap);
2250 isl_basic_map_free(bmap);
2254 struct isl_basic_map *isl_basic_map_equal(struct isl_ctx *ctx,
2255 unsigned nparam, unsigned in, unsigned out, unsigned n_equal)
2258 struct isl_basic_map *bmap;
2259 bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, n_equal, 0);
2262 for (i = 0; i < n_equal && bmap; ++i)
2263 bmap = var_equal(ctx, bmap, i);
2264 return isl_basic_map_finalize(bmap);
2267 struct isl_basic_map *isl_basic_map_less_at(struct isl_ctx *ctx,
2268 unsigned nparam, unsigned in, unsigned out, unsigned pos)
2271 struct isl_basic_map *bmap;
2272 bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, pos, 1);
2275 for (i = 0; i < pos && bmap; ++i)
2276 bmap = var_equal(ctx, bmap, i);
2278 bmap = var_less(ctx, bmap, pos);
2279 return isl_basic_map_finalize(bmap);
2282 struct isl_basic_map *isl_basic_map_more_at(struct isl_ctx *ctx,
2283 unsigned nparam, unsigned in, unsigned out, unsigned pos)
2286 struct isl_basic_map *bmap;
2287 bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, pos, 1);
2290 for (i = 0; i < pos && bmap; ++i)
2291 bmap = var_equal(ctx, bmap, i);
2293 bmap = var_more(ctx, bmap, pos);
2294 return isl_basic_map_finalize(bmap);
2297 struct isl_basic_map *isl_basic_map_from_basic_set(
2298 struct isl_basic_set *bset, unsigned n_in, unsigned n_out)
2300 struct isl_basic_map *bmap;
2302 bset = isl_basic_set_cow(bset);
2306 isl_assert(ctx, bset->dim == n_in + n_out, goto error);
2307 bmap = (struct isl_basic_map *) bset;
2309 bmap->n_out = n_out;
2310 return isl_basic_map_finalize(bmap);
2312 isl_basic_set_free(bset);
2316 struct isl_basic_set *isl_basic_set_from_basic_map(struct isl_basic_map *bmap)
2320 if (bmap->n_in == 0)
2321 return (struct isl_basic_set *)bmap;
2322 bmap = isl_basic_map_cow(bmap);
2325 bmap->n_out += bmap->n_in;
2327 bmap = isl_basic_map_finalize(bmap);
2328 return (struct isl_basic_set *)bmap;
2333 /* For a div d = floor(f/m), add the constraints
2336 * -(f-(n-1)) + m d >= 0
2338 * Note that the second constraint is the negation of
2342 static int add_div_constraints(struct isl_basic_map *bmap, unsigned div)
2345 unsigned div_pos = 1 + bmap->nparam + bmap->n_in + bmap->n_out + div;
2346 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->extra;
2348 i = isl_basic_map_alloc_inequality(bmap);
2351 isl_seq_cpy(bmap->ineq[i], bmap->div[div]+1, 1+total);
2352 isl_int_neg(bmap->ineq[i][div_pos], bmap->div[div][0]);
2354 j = isl_basic_map_alloc_inequality(bmap);
2357 isl_seq_neg(bmap->ineq[j], bmap->ineq[i], 1 + total);
2358 isl_int_add(bmap->ineq[j][0], bmap->ineq[j][0], bmap->ineq[j][div_pos]);
2359 isl_int_sub_ui(bmap->ineq[j][0], bmap->ineq[j][0], 1);
2363 struct isl_basic_set *isl_basic_map_underlying_set(
2364 struct isl_basic_map *bmap)
2368 if (bmap->nparam == 0 && bmap->n_in == 0 && bmap->n_div == 0)
2369 return (struct isl_basic_set *)bmap;
2370 bmap = isl_basic_map_cow(bmap);
2373 bmap->n_out += bmap->nparam + bmap->n_in + bmap->n_div;
2376 bmap->extra -= bmap->n_div;
2378 bmap = isl_basic_map_finalize(bmap);
2379 return (struct isl_basic_set *)bmap;
2384 struct isl_basic_map *isl_basic_map_overlying_set(
2385 struct isl_basic_set *bset, struct isl_basic_map *like)
2387 struct isl_basic_map *bmap;
2388 struct isl_ctx *ctx;
2395 isl_assert(ctx, bset->dim ==
2396 like->nparam + like->n_in + like->n_out + like->n_div,
2398 if (like->nparam == 0 && like->n_in == 0 && like->n_div == 0) {
2399 isl_basic_map_free(like);
2400 return (struct isl_basic_map *)bset;
2402 bset = isl_basic_set_cow(bset);
2405 total = bset->dim + bset->extra;
2406 bmap = (struct isl_basic_map *)bset;
2407 bmap->nparam = like->nparam;
2408 bmap->n_in = like->n_in;
2409 bmap->n_out = like->n_out;
2410 bmap->extra += like->n_div;
2413 ltotal = total - bmap->extra + like->extra;
2416 bmap->block2 = isl_blk_extend(ctx, bmap->block2,
2417 bmap->extra * (1 + 1 + total));
2418 if (isl_blk_is_error(bmap->block2))
2420 bmap->div = isl_realloc_array(ctx, bmap->div, isl_int *,
2424 bmap = isl_basic_map_extend(bmap, bmap->nparam,
2425 bmap->n_in, bmap->n_out, 0, 0, 2 * like->n_div);
2426 for (i = 0; i < like->n_div; ++i) {
2427 k = isl_basic_map_alloc_div(bmap);
2430 isl_seq_cpy(bmap->div[k], like->div[i], 1 + 1 + ltotal);
2431 isl_seq_clr(bmap->div[k]+1+1+ltotal, total - ltotal);
2432 if (add_div_constraints(bmap, k) < 0)
2436 isl_basic_map_free(like);
2437 bmap = isl_basic_map_finalize(bmap);
2440 isl_basic_map_free(like);
2441 isl_basic_set_free(bset);
2445 struct isl_basic_set *isl_basic_set_from_underlying_set(
2446 struct isl_basic_set *bset, struct isl_basic_set *like)
2448 return (struct isl_basic_set *)
2449 isl_basic_map_overlying_set(bset, (struct isl_basic_map *)like);
2452 struct isl_set *isl_set_from_underlying_set(
2453 struct isl_set *set, struct isl_basic_set *like)
2459 isl_assert(set->ctx, set->dim == like->nparam + like->dim + like->n_div,
2461 if (like->nparam == 0 && like->n_div == 0) {
2462 isl_basic_set_free(like);
2465 set = isl_set_cow(set);
2468 for (i = 0; i < set->n; ++i) {
2469 set->p[i] = isl_basic_set_from_underlying_set(set->p[i],
2470 isl_basic_set_copy(like));
2474 set->nparam = like->nparam;
2475 set->dim = like->dim;
2476 isl_basic_set_free(like);
2479 isl_basic_set_free(like);
2484 struct isl_set *isl_map_underlying_set(struct isl_map *map)
2488 map = isl_map_align_divs(map);
2489 map = isl_map_cow(map);
2493 for (i = 0; i < map->n; ++i) {
2494 map->p[i] = (struct isl_basic_map *)
2495 isl_basic_map_underlying_set(map->p[i]);
2500 map->n_out += map->nparam + map->n_in;
2502 map->n_out = map->p[0]->n_out;
2505 return (struct isl_set *)map;
2511 struct isl_set *isl_set_to_underlying_set(struct isl_set *set)
2513 return (struct isl_set *)isl_map_underlying_set((struct isl_map *)set);
2516 struct isl_basic_set *isl_basic_map_domain(struct isl_basic_map *bmap)
2518 struct isl_basic_set *domain;
2522 n_out = bmap->n_out;
2523 domain = isl_basic_set_from_basic_map(bmap);
2524 return isl_basic_set_project_out(domain, n_out, 0);
2527 struct isl_basic_set *isl_basic_map_range(struct isl_basic_map *bmap)
2529 return isl_basic_map_domain(isl_basic_map_reverse(bmap));
2532 struct isl_set *isl_map_range(struct isl_map *map)
2535 struct isl_set *set;
2539 map = isl_map_cow(map);
2543 set = (struct isl_set *) map;
2545 for (i = 0; i < map->n; ++i) {
2546 set->p[i] = isl_basic_map_range(map->p[i]);
2550 F_CLR(set, ISL_MAP_DISJOINT);
2551 F_CLR(set, ISL_SET_NORMALIZED);
2558 struct isl_map *isl_map_from_set(struct isl_set *set,
2559 unsigned n_in, unsigned n_out)
2562 struct isl_map *map = NULL;
2566 isl_assert(set->ctx, set->dim == n_in + n_out, goto error);
2567 set = isl_set_cow(set);
2570 map = (struct isl_map *)set;
2571 for (i = 0; i < set->n; ++i) {
2572 map->p[i] = isl_basic_map_from_basic_set(
2573 set->p[i], n_in, n_out);
2585 struct isl_set *isl_set_from_map(struct isl_map *map)
2588 struct isl_set *set = NULL;
2592 map = isl_map_cow(map);
2595 map->n_out += map->n_in;
2597 set = (struct isl_set *)map;
2598 for (i = 0; i < map->n; ++i) {
2599 set->p[i] = isl_basic_set_from_basic_map(map->p[i]);
2609 struct isl_map *isl_map_alloc(struct isl_ctx *ctx,
2610 unsigned nparam, unsigned in, unsigned out, int n,
2613 struct isl_map *map;
2615 map = isl_alloc(ctx, struct isl_map,
2616 sizeof(struct isl_map) +
2617 n * sizeof(struct isl_basic_map *));
2626 map->nparam = nparam;
2633 struct isl_basic_map *isl_basic_map_empty(struct isl_ctx *ctx,
2634 unsigned nparam, unsigned in, unsigned out)
2636 struct isl_basic_map *bmap;
2637 bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, 1, 0);
2638 bmap = isl_basic_map_set_to_empty(bmap);
2642 struct isl_basic_set *isl_basic_set_empty(struct isl_ctx *ctx,
2643 unsigned nparam, unsigned dim)
2645 struct isl_basic_set *bset;
2646 bset = isl_basic_set_alloc(ctx, nparam, dim, 0, 1, 0);
2647 bset = isl_basic_set_set_to_empty(bset);
2651 struct isl_basic_map *isl_basic_map_universe(struct isl_ctx *ctx,
2652 unsigned nparam, unsigned in, unsigned out)
2654 struct isl_basic_map *bmap;
2655 bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, 0, 0);
2659 struct isl_basic_set *isl_basic_set_universe(struct isl_ctx *ctx,
2660 unsigned nparam, unsigned dim)
2662 struct isl_basic_set *bset;
2663 bset = isl_basic_set_alloc(ctx, nparam, dim, 0, 0, 0);
2667 struct isl_map *isl_map_empty(struct isl_ctx *ctx,
2668 unsigned nparam, unsigned in, unsigned out)
2670 return isl_map_alloc(ctx, nparam, in, out, 0, ISL_MAP_DISJOINT);
2673 struct isl_set *isl_set_empty(struct isl_ctx *ctx,
2674 unsigned nparam, unsigned dim)
2676 return isl_set_alloc(ctx, nparam, dim, 0, ISL_MAP_DISJOINT);
2679 struct isl_map *isl_map_dup(struct isl_map *map)
2682 struct isl_map *dup;
2686 dup = isl_map_alloc(map->ctx, map->nparam, map->n_in, map->n_out, map->n,
2688 for (i = 0; i < map->n; ++i)
2689 dup = isl_map_add(dup,
2690 isl_basic_map_dup(map->p[i]));
2694 struct isl_map *isl_map_add(struct isl_map *map, struct isl_basic_map *bmap)
2698 isl_assert(map->ctx, map->nparam == bmap->nparam, goto error);
2699 isl_assert(map->ctx, map->n_in == bmap->n_in, goto error);
2700 isl_assert(map->ctx, map->n_out == bmap->n_out, goto error);
2701 isl_assert(map->ctx, map->n < map->size, goto error);
2702 map->p[map->n] = bmap;
2704 F_CLR(map, ISL_MAP_NORMALIZED);
2710 isl_basic_map_free(bmap);
2714 void isl_map_free(struct isl_map *map)
2724 isl_ctx_deref(map->ctx);
2725 for (i = 0; i < map->n; ++i)
2726 isl_basic_map_free(map->p[i]);
2730 struct isl_map *isl_map_extend(struct isl_map *base,
2731 unsigned nparam, unsigned n_in, unsigned n_out)
2735 base = isl_map_cow(base);
2739 isl_assert(base->ctx, base->nparam <= nparam, goto error);
2740 isl_assert(base->ctx, base->n_in <= n_in, goto error);
2741 isl_assert(base->ctx, base->n_out <= n_out, goto error);
2742 base->nparam = nparam;
2744 base->n_out = n_out;
2745 for (i = 0; i < base->n; ++i) {
2746 base->p[i] = isl_basic_map_extend(base->p[i],
2747 nparam, n_in, n_out, 0, 0, 0);
2757 struct isl_set *isl_set_extend(struct isl_set *base,
2758 unsigned nparam, unsigned dim)
2760 return (struct isl_set *)isl_map_extend((struct isl_map *)base,
2764 static struct isl_basic_map *isl_basic_map_fix_var(struct isl_basic_map *bmap,
2765 unsigned var, int value)
2769 bmap = isl_basic_map_cow(bmap);
2770 bmap = isl_basic_map_extend(bmap,
2771 bmap->nparam, bmap->n_in, bmap->n_out, 0, 1, 0);
2772 j = isl_basic_map_alloc_equality(bmap);
2775 isl_seq_clr(bmap->eq[j],
2776 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->extra);
2777 isl_int_set_si(bmap->eq[j][1 + var], -1);
2778 isl_int_set_si(bmap->eq[j][0], value);
2779 bmap = isl_basic_map_simplify(bmap);
2780 return isl_basic_map_finalize(bmap);
2782 isl_basic_map_free(bmap);
2786 struct isl_basic_map *isl_basic_map_fix_input_si(struct isl_basic_map *bmap,
2787 unsigned input, int value)
2791 isl_assert(bmap->ctx, input < bmap->n_in, goto error);
2792 return isl_basic_map_fix_var(bmap, bmap->nparam + input, value);
2794 isl_basic_map_free(bmap);
2798 struct isl_basic_set *isl_basic_set_fix_dim_si(struct isl_basic_set *bset,
2799 unsigned dim, int value)
2803 isl_assert(bset->ctx, dim < bset->dim, goto error);
2804 return (struct isl_basic_set *)
2805 isl_basic_map_fix_var((struct isl_basic_map *)bset,
2806 bset->nparam + dim, value);
2808 isl_basic_set_free(bset);
2812 struct isl_map *isl_map_fix_input_si(struct isl_map *map,
2813 unsigned input, int value)
2817 map = isl_map_cow(map);
2821 isl_assert(ctx, input < map->n_in, goto error);
2822 for (i = 0; i < map->n; ++i) {
2823 map->p[i] = isl_basic_map_fix_input_si(map->p[i], input, value);
2827 F_CLR(map, ISL_MAP_NORMALIZED);
2834 struct isl_set *isl_set_fix_dim_si(struct isl_set *set, unsigned dim, int value)
2838 set = isl_set_cow(set);
2842 isl_assert(set->ctx, dim < set->dim, goto error);
2843 for (i = 0; i < set->n; ++i) {
2844 set->p[i] = isl_basic_set_fix_dim_si(set->p[i], dim, value);
2854 struct isl_basic_set *isl_basic_set_lower_bound_dim(struct isl_basic_set *bset,
2855 unsigned dim, isl_int value)
2859 bset = isl_basic_set_cow(bset);
2860 bset = isl_basic_set_extend(bset, bset->nparam, bset->dim, 0, 0, 1);
2861 j = isl_basic_set_alloc_inequality(bset);
2864 isl_seq_clr(bset->ineq[j], 1 + bset->nparam + bset->dim + bset->extra);
2865 isl_int_set_si(bset->ineq[j][1 + bset->nparam + dim], 1);
2866 isl_int_neg(bset->ineq[j][0], value);
2867 bset = isl_basic_set_simplify(bset);
2868 return isl_basic_set_finalize(bset);
2870 isl_basic_set_free(bset);
2874 struct isl_set *isl_set_lower_bound_dim(struct isl_set *set, unsigned dim,
2879 set = isl_set_cow(set);
2883 isl_assert(set->ctx, dim < set->dim, goto error);
2884 for (i = 0; i < set->n; ++i) {
2885 set->p[i] = isl_basic_set_lower_bound_dim(set->p[i], dim, value);
2895 struct isl_map *isl_map_reverse(struct isl_map *map)
2900 map = isl_map_cow(map);
2905 map->n_in = map->n_out;
2907 for (i = 0; i < map->n; ++i) {
2908 map->p[i] = isl_basic_map_reverse(map->p[i]);
2912 F_CLR(map, ISL_MAP_NORMALIZED);
2919 struct isl_map *isl_basic_map_lexmax(
2920 struct isl_basic_map *bmap, struct isl_basic_set *dom,
2921 struct isl_set **empty)
2923 return isl_pip_basic_map_lexmax(bmap, dom, empty);
2926 struct isl_map *isl_basic_map_lexmin(
2927 struct isl_basic_map *bmap, struct isl_basic_set *dom,
2928 struct isl_set **empty)
2930 return isl_pip_basic_map_lexmin(bmap, dom, empty);
2933 struct isl_set *isl_basic_set_lexmin(struct isl_basic_set *bset)
2935 struct isl_basic_map *bmap = NULL;
2936 struct isl_basic_set *dom = NULL;
2937 struct isl_map *min;
2941 bmap = isl_basic_map_from_basic_set(bset, 0, bset->dim);
2944 dom = isl_basic_set_alloc(bmap->ctx, bmap->nparam, 0, 0, 0, 0);
2947 min = isl_basic_map_lexmin(bmap, dom, NULL);
2948 return isl_map_range(min);
2950 isl_basic_map_free(bmap);
2954 struct isl_map *isl_basic_map_compute_divs(struct isl_basic_map *bmap)
2958 if (bmap->n_div == 0)
2959 return isl_map_from_basic_map(bmap);
2960 return isl_pip_basic_map_compute_divs(bmap);
2963 struct isl_map *isl_map_compute_divs(struct isl_map *map)
2966 struct isl_map *res;
2972 res = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[0]));
2973 for (i = 1 ; i < map->n; ++i) {
2975 r2 = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[i]));
2976 if (F_ISSET(map, ISL_MAP_DISJOINT))
2977 res = isl_map_union_disjoint(res, r2);
2979 res = isl_map_union(res, r2);
2986 struct isl_set *isl_basic_set_compute_divs(struct isl_basic_set *bset)
2988 return (struct isl_set *)
2989 isl_basic_map_compute_divs((struct isl_basic_map *)bset);
2992 struct isl_set *isl_set_compute_divs(struct isl_set *set)
2994 return (struct isl_set *)
2995 isl_map_compute_divs((struct isl_map *)set);
2998 struct isl_set *isl_map_domain(struct isl_map *map)
3001 struct isl_set *set;
3006 map = isl_map_cow(map);
3010 set = (struct isl_set *)map;
3011 set->dim = map->n_in;
3013 for (i = 0; i < map->n; ++i) {
3014 set->p[i] = isl_basic_map_domain(map->p[i]);
3018 F_CLR(set, ISL_MAP_DISJOINT);
3019 F_CLR(set, ISL_SET_NORMALIZED);
3026 struct isl_map *isl_map_union_disjoint(
3027 struct isl_map *map1, struct isl_map *map2)
3031 struct isl_map *map = NULL;
3045 isl_assert(map1->ctx, map1->nparam == map2->nparam, goto error);
3046 isl_assert(map1->ctx, map1->n_in == map2->n_in, goto error);
3047 isl_assert(map1->ctx, map1->n_out == map2->n_out, goto error);
3049 if (F_ISSET(map1, ISL_MAP_DISJOINT) &&
3050 F_ISSET(map2, ISL_MAP_DISJOINT))
3051 FL_SET(flags, ISL_MAP_DISJOINT);
3053 map = isl_map_alloc(map1->ctx, map1->nparam, map1->n_in, map1->n_out,
3054 map1->n + map2->n, flags);
3057 for (i = 0; i < map1->n; ++i) {
3058 map = isl_map_add(map,
3059 isl_basic_map_copy(map1->p[i]));
3063 for (i = 0; i < map2->n; ++i) {
3064 map = isl_map_add(map,
3065 isl_basic_map_copy(map2->p[i]));
3079 struct isl_map *isl_map_union(struct isl_map *map1, struct isl_map *map2)
3081 map1 = isl_map_union_disjoint(map1, map2);
3085 F_CLR(map1, ISL_MAP_DISJOINT);
3089 struct isl_set *isl_set_union_disjoint(
3090 struct isl_set *set1, struct isl_set *set2)
3092 return (struct isl_set *)
3093 isl_map_union_disjoint(
3094 (struct isl_map *)set1, (struct isl_map *)set2);
3097 struct isl_set *isl_set_union(struct isl_set *set1, struct isl_set *set2)
3099 return (struct isl_set *)
3100 isl_map_union((struct isl_map *)set1, (struct isl_map *)set2);
3103 struct isl_map *isl_map_intersect_range(
3104 struct isl_map *map, struct isl_set *set)
3107 struct isl_map *result;
3113 if (F_ISSET(map, ISL_MAP_DISJOINT) &&
3114 F_ISSET(set, ISL_MAP_DISJOINT))
3115 FL_SET(flags, ISL_MAP_DISJOINT);
3117 result = isl_map_alloc(map->ctx, map->nparam, map->n_in, map->n_out,
3118 map->n * set->n, flags);
3121 for (i = 0; i < map->n; ++i)
3122 for (j = 0; j < set->n; ++j) {
3123 result = isl_map_add(result,
3124 isl_basic_map_intersect_range(
3125 isl_basic_map_copy(map->p[i]),
3126 isl_basic_set_copy(set->p[j])));
3139 struct isl_map *isl_map_intersect_domain(
3140 struct isl_map *map, struct isl_set *set)
3142 return isl_map_reverse(
3143 isl_map_intersect_range(isl_map_reverse(map), set));
3146 struct isl_map *isl_map_apply_domain(
3147 struct isl_map *map1, struct isl_map *map2)
3151 map1 = isl_map_reverse(map1);
3152 map1 = isl_map_apply_range(map1, map2);
3153 return isl_map_reverse(map1);
3160 struct isl_map *isl_map_apply_range(
3161 struct isl_map *map1, struct isl_map *map2)
3163 struct isl_map *result;
3169 isl_assert(map1->ctx, map1->nparam == map2->nparam, goto error);
3170 isl_assert(map1->ctx, map1->n_out == map2->n_in, goto error);
3172 result = isl_map_alloc(map1->ctx, map1->nparam, map1->n_in, map2->n_out,
3173 map1->n * map2->n, 0);
3176 for (i = 0; i < map1->n; ++i)
3177 for (j = 0; j < map2->n; ++j) {
3178 result = isl_map_add(result,
3179 isl_basic_map_apply_range(
3180 isl_basic_map_copy(map1->p[i]),
3181 isl_basic_map_copy(map2->p[j])));
3187 if (result && result->n <= 1)
3188 F_SET(result, ISL_MAP_DISJOINT);
3197 * returns range - domain
3199 struct isl_basic_set *isl_basic_map_deltas(struct isl_basic_map *bmap)
3201 struct isl_basic_set *bset;
3207 isl_assert(bmap->ctx, bmap->n_in == bmap->n_out, goto error);
3209 bset = isl_basic_set_from_basic_map(bmap);
3210 bset = isl_basic_set_extend(bset, bset->nparam, 3*dim, 0,
3212 bset = isl_basic_set_swap_vars(bset, 2*dim);
3213 for (i = 0; i < dim; ++i) {
3214 int j = isl_basic_map_alloc_equality(
3215 (struct isl_basic_map *)bset);
3218 isl_seq_clr(bset->eq[j],
3219 1 + bset->nparam + bset->dim + bset->extra);
3220 isl_int_set_si(bset->eq[j][1+bset->nparam+i], 1);
3221 isl_int_set_si(bset->eq[j][1+bset->nparam+dim+i], 1);
3222 isl_int_set_si(bset->eq[j][1+bset->nparam+2*dim+i], -1);
3224 return isl_basic_set_project_out(bset, 2*dim, 0);
3226 isl_basic_map_free(bmap);
3231 * returns range - domain
3233 struct isl_set *isl_map_deltas(struct isl_map *map)
3236 struct isl_set *result;
3241 isl_assert(map->ctx, map->n_in == map->n_out, goto error);
3242 result = isl_set_alloc(map->ctx, map->nparam, map->n_in, map->n, map->flags);
3245 for (i = 0; i < map->n; ++i)
3246 result = isl_set_add(result,
3247 isl_basic_map_deltas(isl_basic_map_copy(map->p[i])));
3255 /* If the only constraints a div d=floor(f/m)
3256 * appears in are its two defining constraints
3259 * -(f - (m - 1)) + m d >= 0
3261 * then it can safely be removed.
3263 static int div_is_redundant(struct isl_basic_map *bmap, int div)
3266 unsigned pos = 1 + bmap->nparam + bmap->n_in + bmap->n_out + div;
3268 for (i = 0; i < bmap->n_eq; ++i)
3269 if (!isl_int_is_zero(bmap->eq[i][pos]))
3272 for (i = 0; i < bmap->n_ineq; ++i) {
3273 if (isl_int_is_zero(bmap->ineq[i][pos]))
3275 if (isl_int_eq(bmap->ineq[i][pos], bmap->div[div][0])) {
3277 isl_int_sub(bmap->div[div][1],
3278 bmap->div[div][1], bmap->div[div][0]);
3279 isl_int_add_ui(bmap->div[div][1], bmap->div[div][1], 1);
3280 neg = isl_seq_is_neg(bmap->ineq[i], bmap->div[div]+1, pos);
3281 isl_int_sub_ui(bmap->div[div][1], bmap->div[div][1], 1);
3282 isl_int_add(bmap->div[div][1],
3283 bmap->div[div][1], bmap->div[div][0]);
3286 if (isl_seq_first_non_zero(bmap->ineq[i]+pos+1,
3287 bmap->n_div-div-1) != -1)
3289 } else if (isl_int_abs_eq(bmap->ineq[i][pos], bmap->div[div][0])) {
3290 if (!isl_seq_eq(bmap->ineq[i], bmap->div[div]+1, pos))
3292 if (isl_seq_first_non_zero(bmap->ineq[i]+pos+1,
3293 bmap->n_div-div-1) != -1)
3299 for (i = 0; i < bmap->n_div; ++i)
3300 if (!isl_int_is_zero(bmap->div[i][1+pos]))
3307 * Remove divs that don't occur in any of the constraints or other divs.
3308 * These can arise when dropping some of the variables in a quast
3309 * returned by piplib.
3311 static struct isl_basic_map *remove_redundant_divs(struct isl_basic_map *bmap)
3318 for (i = bmap->n_div-1; i >= 0; --i) {
3319 if (!div_is_redundant(bmap, i))
3321 bmap = isl_basic_map_drop_div(bmap, i);
3326 struct isl_basic_map *isl_basic_map_finalize(struct isl_basic_map *bmap)
3328 bmap = remove_redundant_divs(bmap);
3331 F_SET(bmap, ISL_BASIC_SET_FINAL);
3335 struct isl_basic_set *isl_basic_set_finalize(struct isl_basic_set *bset)
3337 return (struct isl_basic_set *)
3338 isl_basic_map_finalize((struct isl_basic_map *)bset);
3341 struct isl_set *isl_set_finalize(struct isl_set *set)
3347 for (i = 0; i < set->n; ++i) {
3348 set->p[i] = isl_basic_set_finalize(set->p[i]);
3358 struct isl_map *isl_map_finalize(struct isl_map *map)
3364 for (i = 0; i < map->n; ++i) {
3365 map->p[i] = isl_basic_map_finalize(map->p[i]);
3369 F_CLR(map, ISL_MAP_NORMALIZED);
3376 struct isl_basic_map *isl_basic_map_identity(struct isl_ctx *ctx,
3377 unsigned nparam, unsigned dim)
3379 struct isl_basic_map *bmap;
3382 bmap = isl_basic_map_alloc(ctx, nparam, dim, dim, 0, dim, 0);
3386 for (i = 0; i < dim; ++i) {
3387 int j = isl_basic_map_alloc_equality(bmap);
3390 isl_seq_clr(bmap->eq[j],
3391 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->extra);
3392 isl_int_set_si(bmap->eq[j][1+nparam+i], 1);
3393 isl_int_set_si(bmap->eq[j][1+nparam+dim+i], -1);
3395 return isl_basic_map_finalize(bmap);
3397 isl_basic_map_free(bmap);
3401 struct isl_map *isl_map_identity(struct isl_ctx *ctx,
3402 unsigned nparam, unsigned dim)
3404 struct isl_map *map = isl_map_alloc(ctx, nparam, dim, dim, 1,
3408 map = isl_map_add(map,
3409 isl_basic_map_identity(ctx, nparam, dim));
3416 int isl_set_is_equal(struct isl_set *set1, struct isl_set *set2)
3418 return isl_map_is_equal((struct isl_map *)set1, (struct isl_map *)set2);
3421 int isl_set_is_subset(struct isl_set *set1, struct isl_set *set2)
3423 return isl_map_is_subset(
3424 (struct isl_map *)set1, (struct isl_map *)set2);
3427 int isl_basic_map_is_subset(
3428 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3431 struct isl_map *map1;
3432 struct isl_map *map2;
3434 if (!bmap1 || !bmap2)
3437 map1 = isl_map_from_basic_map(isl_basic_map_copy(bmap1));
3438 map2 = isl_map_from_basic_map(isl_basic_map_copy(bmap2));
3440 is_subset = isl_map_is_subset(map1, map2);
3448 int isl_basic_map_is_equal(
3449 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3453 if (!bmap1 || !bmap2)
3455 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
3458 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
3462 int isl_basic_set_is_equal(
3463 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
3465 return isl_basic_map_is_equal(
3466 (struct isl_basic_map *)bset1, (struct isl_basic_map *)bset2);
3469 int isl_map_is_empty(struct isl_map *map)
3476 for (i = 0; i < map->n; ++i) {
3477 is_empty = isl_basic_map_is_empty(map->p[i]);
3486 int isl_set_is_empty(struct isl_set *set)
3488 return isl_map_is_empty((struct isl_map *)set);
3491 int isl_map_is_subset(struct isl_map *map1, struct isl_map *map2)
3495 struct isl_map *diff;
3500 if (isl_map_is_empty(map1))
3503 if (isl_map_is_empty(map2))
3506 diff = isl_map_subtract(isl_map_copy(map1), isl_map_copy(map2));
3510 is_subset = isl_map_is_empty(diff);
3516 int isl_map_is_equal(struct isl_map *map1, struct isl_map *map2)
3522 is_subset = isl_map_is_subset(map1, map2);
3525 is_subset = isl_map_is_subset(map2, map1);
3529 int isl_basic_map_is_strict_subset(
3530 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3534 if (!bmap1 || !bmap2)
3536 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
3539 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
3540 if (is_subset == -1)
3545 static int basic_map_contains(struct isl_basic_map *bmap, struct isl_vec *vec)
3551 total = 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
3552 if (total != vec->size)
3557 for (i = 0; i < bmap->n_eq; ++i) {
3558 isl_seq_inner_product(vec->block.data, bmap->eq[i], total, &s);
3559 if (!isl_int_is_zero(s)) {
3565 for (i = 0; i < bmap->n_ineq; ++i) {
3566 isl_seq_inner_product(vec->block.data, bmap->ineq[i], total, &s);
3567 if (isl_int_is_neg(s)) {
3578 int isl_basic_map_is_universe(struct isl_basic_map *bmap)
3582 return bmap->n_eq == 0 && bmap->n_ineq == 0;
3585 int isl_basic_map_is_empty(struct isl_basic_map *bmap)
3587 struct isl_basic_set *bset = NULL;
3588 struct isl_vec *sample = NULL;
3595 if (F_ISSET(bmap, ISL_BASIC_MAP_EMPTY))
3598 if (F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL)) {
3599 struct isl_basic_map *copy = isl_basic_map_copy(bmap);
3600 copy = isl_basic_map_convex_hull(copy);
3601 empty = F_ISSET(copy, ISL_BASIC_MAP_EMPTY);
3602 isl_basic_map_free(copy);
3606 total = 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
3607 if (bmap->sample && bmap->sample->size == total) {
3608 int contains = basic_map_contains(bmap, bmap->sample);
3614 bset = isl_basic_map_underlying_set(isl_basic_map_copy(bmap));
3617 sample = isl_basic_set_sample(bset);
3620 empty = sample->size == 0;
3622 isl_vec_free(bmap->ctx, bmap->sample);
3623 bmap->sample = sample;
3628 struct isl_map *isl_basic_map_union(
3629 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3631 struct isl_map *map;
3632 if (!bmap1 || !bmap2)
3635 isl_assert(bmap1->ctx, bmap1->nparam == bmap2->nparam, goto error);
3636 isl_assert(bmap1->ctx, bmap1->n_in == bmap2->n_in, goto error);
3637 isl_assert(bmap1->ctx, bmap1->n_out == bmap2->n_out, goto error);
3639 map = isl_map_alloc(bmap1->ctx, bmap1->nparam,
3640 bmap1->n_in, bmap1->n_out, 2, 0);
3643 map = isl_map_add(map, bmap1);
3644 map = isl_map_add(map, bmap2);
3647 isl_basic_map_free(bmap1);
3648 isl_basic_map_free(bmap2);
3652 struct isl_set *isl_basic_set_union(
3653 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
3655 return (struct isl_set *)isl_basic_map_union(
3656 (struct isl_basic_map *)bset1,
3657 (struct isl_basic_map *)bset2);
3660 /* Order divs such that any div only depends on previous divs */
3661 static struct isl_basic_map *order_divs(struct isl_basic_map *bmap)
3664 unsigned off = bmap->nparam + bmap->n_in + bmap->n_out;
3666 for (i = 0; i < bmap->n_div; ++i) {
3668 pos = isl_seq_first_non_zero(bmap->div[i]+1+1+off+i,
3672 swap_div(bmap, i, pos);
3678 static int find_div(struct isl_basic_map *dst,
3679 struct isl_basic_map *src, unsigned div)
3683 unsigned total = src->nparam + src->n_in + src->n_out + src->n_div;
3685 for (i = 0; i < dst->n_div; ++i)
3686 if (isl_seq_eq(dst->div[i], src->div[div], 1+1+total) &&
3687 isl_seq_first_non_zero(dst->div[i]+1+1+total,
3688 dst->n_div - src->n_div) == -1)
3693 struct isl_basic_map *isl_basic_map_align_divs(
3694 struct isl_basic_map *dst, struct isl_basic_map *src)
3697 unsigned total = src->nparam + src->n_in + src->n_out + src->n_div;
3699 if (src->n_div == 0)
3702 src = order_divs(src);
3703 dst = isl_basic_map_extend(dst, dst->nparam, dst->n_in,
3704 dst->n_out, src->n_div, 0, 2 * src->n_div);
3707 for (i = 0; i < src->n_div; ++i) {
3708 int j = find_div(dst, src, i);
3710 j = isl_basic_map_alloc_div(dst);
3713 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total);
3714 isl_seq_clr(dst->div[j]+1+1+total,
3715 dst->extra - src->n_div);
3716 if (add_div_constraints(dst, j) < 0)
3720 swap_div(dst, i, j);
3724 isl_basic_map_free(dst);
3728 struct isl_map *isl_map_align_divs(struct isl_map *map)
3732 map = isl_map_compute_divs(map);
3733 map = isl_map_cow(map);
3737 for (i = 1; i < map->n; ++i)
3738 map->p[0] = isl_basic_map_align_divs(map->p[0], map->p[i]);
3739 for (i = 1; i < map->n; ++i)
3740 map->p[i] = isl_basic_map_align_divs(map->p[i], map->p[0]);
3742 F_CLR(map, ISL_MAP_NORMALIZED);
3746 static struct isl_map *add_cut_constraint(struct isl_map *dst,
3747 struct isl_basic_map *src, isl_int *c,
3748 unsigned len, int oppose)
3750 struct isl_basic_map *copy = NULL;
3755 copy = isl_basic_map_copy(src);
3756 copy = isl_basic_map_cow(copy);
3759 copy = isl_basic_map_extend(copy,
3760 copy->nparam, copy->n_in, copy->n_out, 0, 0, 1);
3761 k = isl_basic_map_alloc_inequality(copy);
3765 isl_seq_neg(copy->ineq[k], c, len);
3767 isl_seq_cpy(copy->ineq[k], c, len);
3768 total = 1 + copy->nparam + copy->n_in + copy->n_out + copy->extra;
3769 isl_seq_clr(copy->ineq[k]+len, total - len);
3770 isl_inequality_negate(copy, k);
3771 copy = isl_basic_map_simplify(copy);
3772 copy = isl_basic_map_finalize(copy);
3773 is_empty = isl_basic_map_is_empty(copy);
3777 dst = isl_map_add(dst, copy);
3779 isl_basic_map_free(copy);
3782 isl_basic_map_free(copy);
3787 static struct isl_map *subtract(struct isl_map *map, struct isl_basic_map *bmap)
3791 struct isl_map *rest = NULL;
3793 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
3800 if (F_ISSET(map, ISL_MAP_DISJOINT))
3801 FL_SET(flags, ISL_MAP_DISJOINT);
3803 max = map->n * (2 * bmap->n_eq + bmap->n_ineq);
3804 rest = isl_map_alloc(map->ctx, map->nparam, map->n_in, map->n_out,
3809 for (i = 0; i < map->n; ++i) {
3810 map->p[i] = isl_basic_map_align_divs(map->p[i], bmap);
3815 for (j = 0; j < map->n; ++j)
3816 map->p[j] = isl_basic_map_cow(map->p[j]);
3818 for (i = 0; i < bmap->n_eq; ++i) {
3819 for (j = 0; j < map->n; ++j) {
3820 rest = add_cut_constraint(rest,
3821 map->p[j], bmap->eq[i], 1+total, 0);
3825 rest = add_cut_constraint(rest,
3826 map->p[j], bmap->eq[i], 1+total, 1);
3830 map->p[j] = isl_basic_map_extend(map->p[j],
3831 map->p[j]->nparam, map->p[j]->n_in,
3832 map->p[j]->n_out, 0, 1, 0);
3835 k = isl_basic_map_alloc_equality(map->p[j]);
3838 isl_seq_cpy(map->p[j]->eq[k], bmap->eq[i], 1+total);
3839 isl_seq_clr(map->p[j]->eq[k]+1+total,
3840 map->p[j]->extra - bmap->n_div);
3844 for (i = 0; i < bmap->n_ineq; ++i) {
3845 for (j = 0; j < map->n; ++j) {
3846 rest = add_cut_constraint(rest,
3847 map->p[j], bmap->ineq[i], 1+total, 0);
3851 map->p[j] = isl_basic_map_extend(map->p[j],
3852 map->p[j]->nparam, map->p[j]->n_in,
3853 map->p[j]->n_out, 0, 0, 1);
3856 k = isl_basic_map_alloc_inequality(map->p[j]);
3859 isl_seq_cpy(map->p[j]->ineq[k], bmap->ineq[i], 1+total);
3860 isl_seq_clr(map->p[j]->ineq[k]+1+total,
3861 map->p[j]->extra - bmap->n_div);
3873 struct isl_map *isl_map_subtract(struct isl_map *map1, struct isl_map *map2)
3879 isl_assert(map1->ctx, map1->nparam == map2->nparam, goto error);
3880 isl_assert(map1->ctx, map1->n_in == map2->n_in, goto error);
3881 isl_assert(map1->ctx, map1->n_out == map2->n_out, goto error);
3883 if (isl_map_is_empty(map2)) {
3888 map1 = isl_map_compute_divs(map1);
3889 map2 = isl_map_compute_divs(map2);
3893 for (i = 0; map1 && i < map2->n; ++i)
3894 map1 = subtract(map1, map2->p[i]);
3904 struct isl_set *isl_set_subtract(struct isl_set *set1, struct isl_set *set2)
3906 return (struct isl_set *)
3908 (struct isl_map *)set1, (struct isl_map *)set2);
3911 struct isl_set *isl_set_apply(struct isl_set *set, struct isl_map *map)
3915 isl_assert(set->ctx, set->dim == map->n_in, goto error);
3916 map = isl_map_intersect_domain(map, set);
3917 set = isl_map_range(map);
3925 /* There is no need to cow as removing empty parts doesn't change
3926 * the meaning of the set.
3928 struct isl_map *isl_map_remove_empty_parts(struct isl_map *map)
3935 for (i = map->n-1; i >= 0; --i) {
3936 if (!F_ISSET(map->p[i], ISL_BASIC_MAP_EMPTY))
3938 isl_basic_map_free(map->p[i]);
3939 if (i != map->n-1) {
3940 F_CLR(map, ISL_MAP_NORMALIZED);
3941 map->p[i] = map->p[map->n-1];
3949 struct isl_set *isl_set_remove_empty_parts(struct isl_set *set)
3951 return (struct isl_set *)
3952 isl_map_remove_empty_parts((struct isl_map *)set);
3955 struct isl_basic_set *isl_set_copy_basic_set(struct isl_set *set)
3957 struct isl_basic_set *bset;
3958 if (!set || set->n == 0)
3960 bset = set->p[set->n-1];
3961 isl_assert(set->ctx, F_ISSET(bset, ISL_BASIC_SET_FINAL), return NULL);
3962 return isl_basic_set_copy(bset);
3965 struct isl_set *isl_set_drop_basic_set(struct isl_set *set,
3966 struct isl_basic_set *bset)
3972 for (i = set->n-1; i >= 0; --i) {
3973 if (set->p[i] != bset)
3975 set = isl_set_cow(set);
3978 isl_basic_set_free(set->p[i]);
3979 if (i != set->n-1) {
3980 F_CLR(set, ISL_SET_NORMALIZED);
3981 set->p[i] = set->p[set->n-1];
3986 isl_basic_set_free(bset);
3990 isl_basic_set_free(bset);
3994 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
3995 * for any common value of the parameters and dimensions preceding dim
3996 * in both basic sets, the values of dimension pos in bset1 are
3997 * smaller or larger then those in bset2.
4000 * 1 if bset1 follows bset2
4001 * -1 if bset1 precedes bset2
4002 * 0 if bset1 and bset2 are incomparable
4003 * -2 if some error occurred.
4005 int isl_basic_set_compare_at(struct isl_basic_set *bset1,
4006 struct isl_basic_set *bset2, int pos)
4008 struct isl_basic_map *bmap1 = NULL;
4009 struct isl_basic_map *bmap2 = NULL;
4010 struct isl_ctx *ctx;
4011 struct isl_vec *obj;
4014 enum isl_lp_result res;
4017 if (!bset1 || !bset2)
4020 bmap1 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset1),
4021 pos, bset1->dim - pos);
4022 bmap2 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset2),
4023 pos, bset2->dim - pos);
4024 if (!bmap1 || !bmap2)
4026 bmap1 = isl_basic_map_extend(bmap1, bmap1->nparam,
4027 bmap1->n_in, bmap1->n_out + bmap2->n_out,
4028 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
4031 total = bmap1->nparam + bmap1->n_in + bmap1->n_out + bmap1->n_div;
4033 obj = isl_vec_alloc(ctx, total);
4034 isl_seq_clr(obj->block.data, total);
4035 isl_int_set_si(obj->block.data[bmap1->nparam+bmap1->n_in], 1);
4036 isl_int_set_si(obj->block.data[bmap1->nparam+bmap1->n_in+
4037 bmap1->n_out-bmap2->n_out], -1);
4040 bmap1 = add_constraints(bmap1, bmap2, 0, bmap1->n_out - bmap2->n_out);
4043 res = isl_solve_lp(bmap1, 0, obj->block.data, ctx->one, &num, &den);
4044 if (res == isl_lp_empty)
4046 else if (res == isl_lp_ok && isl_int_is_pos(num))
4048 else if ((res == isl_lp_ok && isl_int_is_neg(num)) ||
4049 res == isl_lp_unbounded)
4055 isl_basic_map_free(bmap1);
4056 isl_vec_free(ctx, obj);
4059 isl_basic_map_free(bmap1);
4060 isl_basic_map_free(bmap2);
4064 static int isl_basic_map_fast_has_fixed_var(struct isl_basic_map *bmap,
4065 unsigned pos, isl_int *val)
4073 total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
4074 for (i = 0, d = total-1; i < bmap->n_eq && d+1 > pos; ++i) {
4075 for (; d+1 > pos; --d)
4076 if (!isl_int_is_zero(bmap->eq[i][1+d]))
4080 if (isl_seq_first_non_zero(bmap->eq[i]+1, d) != -1)
4082 if (isl_seq_first_non_zero(bmap->eq[i]+1+d+1, total-d-1) != -1)
4084 if (!isl_int_is_one(bmap->eq[i][1+d]))
4087 isl_int_neg(*val, bmap->eq[i][0]);
4093 static int isl_map_fast_has_fixed_var(struct isl_map *map,
4094 unsigned pos, isl_int *val)
4106 return isl_basic_map_fast_has_fixed_var(map->p[0], pos, val);
4109 fixed = isl_basic_map_fast_has_fixed_var(map->p[0], pos, &v);
4110 for (i = 1; fixed == 1 && i < map->n; ++i) {
4111 fixed = isl_basic_map_fast_has_fixed_var(map->p[i], pos, &tmp);
4112 if (fixed == 1 && isl_int_ne(tmp, v))
4116 isl_int_set(*val, v);
4122 static int isl_set_fast_has_fixed_var(struct isl_set *set, unsigned pos,
4125 return isl_map_fast_has_fixed_var((struct isl_map *)set, pos, val);
4128 /* Check if dimension dim has fixed value and if so and if val is not NULL,
4129 * then return this fixed value in *val.
4131 int isl_set_fast_dim_is_fixed(struct isl_set *set, unsigned dim, isl_int *val)
4133 return isl_set_fast_has_fixed_var(set, set->nparam + dim, val);
4136 /* Check if input variable in has fixed value and if so and if val is not NULL,
4137 * then return this fixed value in *val.
4139 int isl_map_fast_input_is_fixed(struct isl_map *map, unsigned in, isl_int *val)
4141 return isl_map_fast_has_fixed_var(map, map->nparam + in, val);
4144 /* Check if dimension dim has an (obvious) fixed lower bound and if so
4145 * and if val is not NULL, then return this lower bound in *val.
4147 int isl_basic_set_fast_dim_has_fixed_lower_bound(struct isl_basic_set *bset,
4148 unsigned dim, isl_int *val)
4150 int i, i_eq = -1, i_ineq = -1;
4156 total = bset->nparam + bset->dim + bset->n_div;
4157 for (i = 0; i < bset->n_eq; ++i) {
4158 if (isl_int_is_zero(bset->eq[i][1+bset->nparam+dim]))
4164 for (i = 0; i < bset->n_ineq; ++i) {
4165 if (!isl_int_is_pos(bset->ineq[i][1+bset->nparam+dim]))
4167 if (i_eq != -1 || i_ineq != -1)
4171 if (i_eq == -1 && i_ineq == -1)
4173 c = i_eq != -1 ? bset->eq[i_eq] : bset->ineq[i_ineq];
4174 /* The coefficient should always be one due to normalization. */
4175 if (!isl_int_is_one(c[1+bset->nparam+dim]))
4177 if (isl_seq_first_non_zero(c+1, bset->nparam+dim) != -1)
4179 if (isl_seq_first_non_zero(c+1+bset->nparam+dim+1,
4180 total - bset->nparam - dim - 1) != -1)
4183 isl_int_neg(*val, c[0]);
4187 int isl_set_fast_dim_has_fixed_lower_bound(struct isl_set *set,
4188 unsigned dim, isl_int *val)
4200 return isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[0],
4204 fixed = isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[0],
4206 for (i = 1; fixed == 1 && i < set->n; ++i) {
4207 fixed = isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[i],
4209 if (fixed == 1 && isl_int_ne(tmp, v))
4213 isl_int_set(*val, v);
4219 static struct isl_basic_set *isl_basic_set_reduce_using_equalities(
4220 struct isl_basic_set *bset, struct isl_basic_set *context)
4225 if (!bset || !context)
4228 bset = isl_basic_set_cow(bset);
4232 elim = isl_alloc_array(ctx, int, bset->dim);
4235 set_compute_elimination_index(context, elim);
4236 for (i = 0; i < bset->n_eq; ++i)
4237 set_reduced_using_equalities(bset->eq[i], bset->eq[i],
4239 for (i = 0; i < bset->n_ineq; ++i)
4240 set_reduced_using_equalities(bset->ineq[i], bset->ineq[i],
4242 isl_basic_set_free(context);
4244 bset = isl_basic_set_simplify(bset);
4245 bset = isl_basic_set_finalize(bset);
4248 isl_basic_set_free(bset);
4249 isl_basic_set_free(context);
4253 /* Remove all information from bset that is redundant in the context
4254 * of context. In particular, equalities that are linear combinations
4255 * of those in context are remobed. Then the inequalities that are
4256 * redundant in the context of the equalities and inequalities of
4257 * context are removed.
4259 static struct isl_basic_set *uset_gist(struct isl_basic_set *bset,
4260 struct isl_basic_set *context)
4264 struct isl_basic_set *combined;
4265 struct isl_ctx *ctx;
4266 enum isl_lp_result res = isl_lp_ok;
4268 if (!bset || !context)
4271 if (context->n_eq > 0) {
4274 struct isl_ctx *ctx = context->ctx;
4275 struct isl_basic_set *reduced_context;
4276 reduced_context = isl_basic_set_remove_equalities(
4277 isl_basic_set_copy(context), &T, &T2);
4278 if (!reduced_context)
4280 bset = isl_basic_set_preimage(ctx, bset, T);
4281 bset = uset_gist(bset, reduced_context);
4282 bset = isl_basic_set_preimage(ctx, bset, T2);
4283 bset = isl_basic_set_reduce_using_equalities(bset, context);
4286 combined = isl_basic_set_extend(isl_basic_set_copy(bset),
4287 0, bset->dim, 0, context->n_eq, context->n_ineq);
4288 context = set_add_constraints(combined, context, 0);
4293 for (i = bset->n_ineq-1; i >= 0; --i) {
4294 set_swap_inequality(context, i, context->n_ineq-1);
4296 res = isl_solve_lp((struct isl_basic_map *)context, 0,
4297 context->ineq[context->n_ineq]+1, ctx->one, &opt, NULL);
4299 set_swap_inequality(context, i, context->n_ineq-1);
4300 if (res == isl_lp_unbounded)
4302 if (res == isl_lp_error)
4304 if (res == isl_lp_empty) {
4305 bset = isl_basic_set_set_to_empty(bset);
4308 isl_int_add(opt, opt, context->ineq[i][0]);
4309 if (!isl_int_is_neg(opt)) {
4310 isl_basic_set_drop_inequality(context, i);
4311 isl_basic_set_drop_inequality(bset, i);
4315 if (res == isl_lp_error)
4317 isl_basic_set_free(context);
4320 isl_basic_set_free(context);
4321 isl_basic_set_free(bset);
4325 struct isl_basic_map *isl_basic_map_gist(struct isl_basic_map *bmap,
4326 struct isl_basic_map *context)
4328 struct isl_basic_set *bset;
4330 if (!bmap || !context)
4333 context = isl_basic_map_align_divs(context, bmap);
4334 bmap = isl_basic_map_align_divs(bmap, context);
4336 bset = uset_gist(isl_basic_map_underlying_set(isl_basic_map_copy(bmap)),
4337 isl_basic_map_underlying_set(context));
4339 return isl_basic_map_overlying_set(bset, bmap);
4341 isl_basic_map_free(bmap);
4342 isl_basic_map_free(context);
4346 struct isl_map *isl_map_gist(struct isl_map *map, struct isl_basic_map *context)
4350 map = isl_map_cow(map);
4351 if (!map || !context)
4353 isl_assert(map->ctx, map->nparam == context->nparam, goto error);
4354 isl_assert(map->ctx, map->n_in == context->n_in, goto error);
4355 isl_assert(map->ctx, map->n_out == context->n_out, goto error);
4356 for (i = 0; i < map->n; ++i)
4357 context = isl_basic_map_align_divs(context, map->p[i]);
4358 for (i = 0; i < map->n; ++i) {
4359 map->p[i] = isl_basic_map_gist(map->p[i],
4360 isl_basic_map_copy(context));
4364 isl_basic_map_free(context);
4365 F_CLR(map, ISL_MAP_NORMALIZED);
4369 isl_basic_map_free(context);
4373 struct isl_set *isl_set_gist(struct isl_set *set, struct isl_basic_set *context)
4375 return (struct isl_set *)isl_map_gist((struct isl_map *)set,
4376 (struct isl_basic_map *)context);
4384 static int qsort_constraint_cmp(const void *p1, const void *p2)
4386 const struct constraint *c1 = (const struct constraint *)p1;
4387 const struct constraint *c2 = (const struct constraint *)p2;
4388 unsigned size = isl_min(c1->size, c2->size);
4389 return isl_seq_cmp(c1->c, c2->c, size);
4392 static struct isl_basic_map *isl_basic_map_sort_constraints(
4393 struct isl_basic_map *bmap)
4396 struct constraint *c;
4401 total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
4402 c = isl_alloc_array(bmap->ctx, struct constraint, bmap->n_ineq);
4405 for (i = 0; i < bmap->n_ineq; ++i) {
4407 c[i].c = bmap->ineq[i];
4409 qsort(c, bmap->n_ineq, sizeof(struct constraint), qsort_constraint_cmp);
4410 for (i = 0; i < bmap->n_ineq; ++i)
4411 bmap->ineq[i] = c[i].c;
4415 isl_basic_map_free(bmap);
4419 struct isl_basic_map *isl_basic_map_normalize(struct isl_basic_map *bmap)
4423 if (F_ISSET(bmap, ISL_BASIC_MAP_NORMALIZED))
4425 bmap = isl_basic_map_convex_hull(bmap);
4426 bmap = isl_basic_map_sort_constraints(bmap);
4427 F_SET(bmap, ISL_BASIC_MAP_NORMALIZED);
4431 static int isl_basic_map_fast_cmp(const struct isl_basic_map *bmap1,
4432 const struct isl_basic_map *bmap2)
4439 if (bmap1->nparam != bmap2->nparam)
4440 return bmap1->nparam - bmap2->nparam;
4441 if (bmap1->n_in != bmap2->n_in)
4442 return bmap1->n_in - bmap2->n_in;
4443 if (bmap1->n_out != bmap2->n_out)
4444 return bmap1->n_out - bmap2->n_out;
4445 if (F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY) &&
4446 F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
4448 if (F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY))
4450 if (F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
4452 if (bmap1->n_eq != bmap2->n_eq)
4453 return bmap1->n_eq - bmap2->n_eq;
4454 if (bmap1->n_ineq != bmap2->n_ineq)
4455 return bmap1->n_ineq - bmap2->n_ineq;
4456 if (bmap1->n_div != bmap2->n_div)
4457 return bmap1->n_div - bmap2->n_div;
4458 total = bmap1->nparam + bmap1->n_in + bmap1->n_out + bmap1->n_div;
4459 for (i = 0; i < bmap1->n_eq; ++i) {
4460 cmp = isl_seq_cmp(bmap1->eq[i], bmap2->eq[i], 1+total);
4464 for (i = 0; i < bmap1->n_ineq; ++i) {
4465 cmp = isl_seq_cmp(bmap1->ineq[i], bmap2->ineq[i], 1+total);
4469 for (i = 0; i < bmap1->n_div; ++i) {
4470 cmp = isl_seq_cmp(bmap1->div[i], bmap2->div[i], 1+1+total);
4477 static int isl_basic_map_fast_is_equal(struct isl_basic_map *bmap1,
4478 struct isl_basic_map *bmap2)
4480 return isl_basic_map_fast_cmp(bmap1, bmap2) == 0;
4483 static int qsort_bmap_cmp(const void *p1, const void *p2)
4485 const struct isl_basic_map *bmap1 = *(const struct isl_basic_map **)p1;
4486 const struct isl_basic_map *bmap2 = *(const struct isl_basic_map **)p2;
4488 return isl_basic_map_fast_cmp(bmap1, bmap2);
4491 /* We normalize in place, but if anything goes wrong we need
4492 * to return NULL, so we need to make sure we don't change the
4493 * meaning of any possible other copies of map.
4495 struct isl_map *isl_map_normalize(struct isl_map *map)
4498 struct isl_basic_map *bmap;
4502 if (F_ISSET(map, ISL_MAP_NORMALIZED))
4504 for (i = 0; i < map->n; ++i) {
4505 bmap = isl_basic_map_normalize(isl_basic_map_copy(map->p[i]));
4508 isl_basic_map_free(map->p[i]);
4511 qsort(map->p, map->n, sizeof(struct isl_basic_map *), qsort_bmap_cmp);
4512 F_SET(map, ISL_MAP_NORMALIZED);
4513 map = isl_map_remove_empty_parts(map);
4516 for (i = map->n - 1; i >= 1; --i) {
4517 if (!isl_basic_map_fast_is_equal(map->p[i-1], map->p[i]))
4519 isl_basic_map_free(map->p[i-1]);
4520 for (j = i; j < map->n; ++j)
4521 map->p[j-1] = map->p[j];
4531 struct isl_set *isl_set_normalize(struct isl_set *set)
4533 return (struct isl_set *)isl_map_normalize((struct isl_map *)set);
4536 int isl_map_fast_is_equal(struct isl_map *map1, struct isl_map *map2)
4546 if (map1->nparam != map2->nparam)
4548 if (map1->n_in != map2->n_in)
4550 if (map1->n_out != map2->n_out)
4553 map1 = isl_map_copy(map1);
4554 map2 = isl_map_copy(map2);
4555 map1 = isl_map_normalize(map1);
4556 map2 = isl_map_normalize(map2);
4559 equal = map1->n == map2->n;
4560 for (i = 0; equal && i < map1->n; ++i) {
4561 equal = isl_basic_map_fast_is_equal(map1->p[i], map2->p[i]);
4574 int isl_set_fast_is_equal(struct isl_set *set1, struct isl_set *set2)
4576 return isl_map_fast_is_equal((struct isl_map *)set1,
4577 (struct isl_map *)set2);
4580 /* Return an interval that ranges from min to max (inclusive)
4582 struct isl_basic_set *isl_basic_set_interval(struct isl_ctx *ctx,
4583 isl_int min, isl_int max)
4586 struct isl_basic_set *bset = NULL;
4588 bset = isl_basic_set_alloc(ctx, 0, 1, 0, 0, 2);
4592 k = isl_basic_set_alloc_inequality(bset);
4595 isl_int_set_si(bset->ineq[k][1], 1);
4596 isl_int_neg(bset->ineq[k][0], min);
4598 k = isl_basic_set_alloc_inequality(bset);
4601 isl_int_set_si(bset->ineq[k][1], -1);
4602 isl_int_set(bset->ineq[k][0], max);
4606 isl_basic_set_free(bset);
4610 /* Return the Cartesian product of the basic sets in list (in the given order).
4612 struct isl_basic_set *isl_basic_set_product(struct isl_basic_set_list *list)
4620 struct isl_basic_set *product = NULL;
4624 isl_assert(list->ctx, list->n > 0, goto error);
4625 isl_assert(list->ctx, list->p[0], goto error);
4626 nparam = list->p[0]->nparam;
4627 dim = list->p[0]->dim;
4628 extra = list->p[0]->n_div;
4629 n_eq = list->p[0]->n_eq;
4630 n_ineq = list->p[0]->n_ineq;
4631 for (i = 1; i < list->n; ++i) {
4632 isl_assert(list->ctx, list->p[i], goto error);
4633 isl_assert(list->ctx, nparam == list->p[i]->nparam, goto error);
4634 dim += list->p[i]->dim;
4635 extra += list->p[i]->n_div;
4636 n_eq += list->p[i]->n_eq;
4637 n_ineq += list->p[i]->n_ineq;
4639 product = isl_basic_set_alloc(list->ctx, nparam, dim, extra,
4644 for (i = 0; i < list->n; ++i) {
4645 set_add_constraints(product,
4646 isl_basic_set_copy(list->p[i]), dim);
4647 dim += list->p[i]->dim;
4649 isl_basic_set_list_free(list);
4652 isl_basic_set_free(product);
4653 isl_basic_set_list_free(list);