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(isl_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 (&bmap->ineq[k] != index[h] &&
1041 isl_seq_eq(bmap->ineq[k]+1, index[h][0]+1, total))
1046 static int set_hash_index(isl_int ***index, unsigned int size, int bits,
1047 struct isl_basic_set *bset, int k)
1049 return hash_index(index, size, bits, (struct isl_basic_map *)bset, k);
1052 static struct isl_basic_map *remove_duplicate_constraints(
1053 struct isl_basic_map *bmap, int *progress)
1059 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
1062 if (bmap->n_ineq <= 1)
1065 size = round_up(4 * (bmap->n_ineq+1) / 3 - 1);
1066 bits = ffs(size) - 1;
1067 index = isl_alloc_array(ctx, isl_int **, size);
1068 memset(index, 0, size * sizeof(isl_int **));
1072 index[isl_seq_hash(bmap->ineq[0]+1, total, bits)] = &bmap->ineq[0];
1073 for (k = 1; k < bmap->n_ineq; ++k) {
1074 h = hash_index(index, size, bits, bmap, k);
1076 index[h] = &bmap->ineq[k];
1081 l = index[h] - &bmap->ineq[0];
1082 if (isl_int_lt(bmap->ineq[k][0], bmap->ineq[l][0]))
1083 swap_inequality(bmap, k, l);
1084 isl_basic_map_drop_inequality(bmap, k);
1088 for (k = 0; k < bmap->n_ineq-1; ++k) {
1089 isl_seq_neg(bmap->ineq[k]+1, bmap->ineq[k]+1, total);
1090 h = hash_index(index, size, bits, bmap, k);
1091 isl_seq_neg(bmap->ineq[k]+1, bmap->ineq[k]+1, total);
1094 l = index[h] - &bmap->ineq[0];
1095 isl_int_add(sum, bmap->ineq[k][0], bmap->ineq[l][0]);
1096 if (isl_int_is_pos(sum))
1098 if (isl_int_is_zero(sum)) {
1099 /* We need to break out of the loop after these
1100 * changes since the contents of the hash
1101 * will no longer be valid.
1102 * Plus, we probably we want to regauss first.
1104 isl_basic_map_drop_inequality(bmap, l);
1105 isl_basic_map_inequality_to_equality(bmap, k);
1107 bmap = isl_basic_map_set_to_empty(bmap);
1116 static void compute_elimination_index(struct isl_basic_map *bmap, int *elim)
1121 total = bmap->nparam + bmap->n_in + bmap->n_out;
1122 for (d = 0; d < total; ++d)
1124 for (d = total - 1, i = 0; d >= 0 && i < bmap->n_eq; ++i) {
1125 for (; d >= 0; --d) {
1126 if (isl_int_is_zero(bmap->eq[i][1+d]))
1134 static void set_compute_elimination_index(struct isl_basic_set *bset, int *elim)
1136 return compute_elimination_index((struct isl_basic_map *)bset, elim);
1139 static int reduced_using_equalities(isl_int *dst, isl_int *src,
1140 struct isl_basic_map *bmap, int *elim)
1146 total = bmap->nparam + bmap->n_in + bmap->n_out;
1147 for (d = total - 1; d >= 0; --d) {
1148 if (isl_int_is_zero(src[1+d]))
1153 isl_seq_cpy(dst, src, 1 + total);
1156 isl_seq_elim(dst, bmap->eq[elim[d]], 1 + d, 1 + total, NULL);
1161 static int set_reduced_using_equalities(isl_int *dst, isl_int *src,
1162 struct isl_basic_set *bset, int *elim)
1164 return reduced_using_equalities(dst, src,
1165 (struct isl_basic_map *)bset, elim);
1168 /* Quick check to see if two basic maps are disjoint.
1169 * In particular, we reduce the equalities and inequalities of
1170 * one basic map in the context of the equalities of the other
1171 * basic map and check if we get a contradiction.
1173 int isl_basic_map_fast_is_disjoint(struct isl_basic_map *bmap1,
1174 struct isl_basic_map *bmap2)
1176 struct isl_vec *v = NULL;
1181 if (!bmap1 || !bmap2)
1183 isl_assert(bmap1->ctx, bmap1->nparam == bmap2->nparam, return -1);
1184 isl_assert(bmap1->ctx, bmap1->n_in == bmap2->n_in, return -1);
1185 isl_assert(bmap1->ctx, bmap1->n_out == bmap2->n_out, return -1);
1186 if (bmap1->n_div || bmap2->n_div)
1188 if (!bmap1->n_eq && !bmap2->n_eq)
1191 total = bmap1->nparam + bmap1->n_in + bmap1->n_out;
1194 v = isl_vec_alloc(bmap1->ctx, 1 + total);
1197 elim = isl_alloc_array(bmap1->ctx, int, total);
1200 compute_elimination_index(bmap1, elim);
1201 for (i = 0; i < bmap2->n_eq; ++i) {
1203 reduced = reduced_using_equalities(v->block.data, bmap2->eq[i],
1205 if (reduced && !isl_int_is_zero(v->block.data[0]) &&
1206 isl_seq_first_non_zero(v->block.data + 1, total) == -1)
1209 for (i = 0; i < bmap2->n_ineq; ++i) {
1211 reduced = reduced_using_equalities(v->block.data,
1212 bmap2->ineq[i], bmap1, elim);
1213 if (reduced && isl_int_is_neg(v->block.data[0]) &&
1214 isl_seq_first_non_zero(v->block.data + 1, total) == -1)
1217 compute_elimination_index(bmap2, elim);
1218 for (i = 0; i < bmap1->n_ineq; ++i) {
1220 reduced = reduced_using_equalities(v->block.data,
1221 bmap1->ineq[i], bmap2, elim);
1222 if (reduced && isl_int_is_neg(v->block.data[0]) &&
1223 isl_seq_first_non_zero(v->block.data + 1, total) == -1)
1226 isl_vec_free(bmap1->ctx, v);
1230 isl_vec_free(bmap1->ctx, v);
1234 isl_vec_free(bmap1->ctx, v);
1239 int isl_basic_set_fast_is_disjoint(struct isl_basic_set *bset1,
1240 struct isl_basic_set *bset2)
1242 return isl_basic_map_fast_is_disjoint((struct isl_basic_map *)bset1,
1243 (struct isl_basic_map *)bset2);
1246 int isl_map_fast_is_disjoint(struct isl_map *map1, struct isl_map *map2)
1253 if (isl_map_fast_is_equal(map1, map2))
1256 for (i = 0; i < map1->n; ++i) {
1257 for (j = 0; j < map2->n; ++j) {
1258 int d = isl_basic_map_fast_is_disjoint(map1->p[i],
1267 int isl_set_fast_is_disjoint(struct isl_set *set1, struct isl_set *set2)
1269 return isl_map_fast_is_disjoint((struct isl_map *)set1,
1270 (struct isl_map *)set2);
1273 static struct isl_basic_map *remove_duplicate_divs(
1274 struct isl_basic_map *bmap, int *progress)
1281 unsigned total_var = bmap->nparam + bmap->n_in + bmap->n_out;
1282 unsigned total = total_var + bmap->n_div;
1283 struct isl_ctx *ctx;
1285 if (bmap->n_div <= 1)
1289 for (k = bmap->n_div - 1; k >= 0; --k)
1290 if (!isl_int_is_zero(bmap->div[k][0]))
1295 size = round_up(4 * bmap->n_div / 3 - 1);
1296 bits = ffs(size) - 1;
1297 index = isl_alloc_array(ctx, int, size);
1298 memset(index, 0, size * sizeof(int));
1301 eq = isl_blk_alloc(ctx, 1+total);
1302 if (isl_blk_is_error(eq))
1305 isl_seq_clr(eq.data, 1+total);
1306 index[isl_seq_hash(bmap->div[k], 2+total, bits)] = k + 1;
1307 for (--k; k >= 0; --k) {
1310 if (isl_int_is_zero(bmap->div[k][0]))
1313 hash = isl_seq_hash(bmap->div[k], 2+total, bits);
1314 for (h = hash; index[h]; h = (h+1) % size)
1315 if (isl_seq_eq(bmap->div[k],
1316 bmap->div[index[h]-1], 2+total))
1321 isl_int_set_si(eq.data[1+total_var+k], -1);
1322 isl_int_set_si(eq.data[1+total_var+l], 1);
1323 eliminate_div(bmap, eq.data, l);
1324 isl_int_set_si(eq.data[1+total_var+k], 0);
1325 isl_int_set_si(eq.data[1+total_var+l], 0);
1330 isl_blk_free(ctx, eq);
1336 /* Elimininate divs based on equalities
1338 static struct isl_basic_map *eliminate_divs_eq(
1339 struct isl_basic_map *bmap, int *progress)
1349 off = 1 + bmap->nparam + bmap->n_in + bmap->n_out;
1351 for (d = bmap->n_div - 1; d >= 0 ; --d) {
1352 for (i = 0; i < bmap->n_eq; ++i) {
1353 if (!isl_int_is_one(bmap->eq[i][off + d]) &&
1354 !isl_int_is_negone(bmap->eq[i][off + d]))
1358 eliminate_div(bmap, bmap->eq[i], d);
1359 isl_basic_map_drop_equality(bmap, i);
1364 return eliminate_divs_eq(bmap, progress);
1368 static struct isl_basic_map *normalize_constraints(struct isl_basic_map *bmap)
1372 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
1375 for (i = bmap->n_eq - 1; i >= 0; --i) {
1376 isl_seq_gcd(bmap->eq[i]+1, total, &gcd);
1377 if (isl_int_is_zero(gcd)) {
1378 if (!isl_int_is_zero(bmap->eq[i][0])) {
1379 bmap = isl_basic_map_set_to_empty(bmap);
1382 isl_basic_map_drop_equality(bmap, i);
1385 if (F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL))
1386 isl_int_gcd(gcd, gcd, bmap->eq[i][0]);
1387 if (isl_int_is_one(gcd))
1389 if (!isl_int_is_divisible_by(bmap->eq[i][0], gcd)) {
1390 bmap = isl_basic_map_set_to_empty(bmap);
1393 isl_seq_scale_down(bmap->eq[i], bmap->eq[i], gcd, 1+total);
1396 for (i = bmap->n_ineq - 1; i >= 0; --i) {
1397 isl_seq_gcd(bmap->ineq[i]+1, total, &gcd);
1398 if (isl_int_is_zero(gcd)) {
1399 if (isl_int_is_neg(bmap->ineq[i][0])) {
1400 bmap = isl_basic_map_set_to_empty(bmap);
1403 isl_basic_map_drop_inequality(bmap, i);
1406 if (F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL))
1407 isl_int_gcd(gcd, gcd, bmap->ineq[i][0]);
1408 if (isl_int_is_one(gcd))
1410 isl_int_fdiv_q(bmap->ineq[i][0], bmap->ineq[i][0], gcd);
1411 isl_seq_scale_down(bmap->ineq[i]+1, bmap->ineq[i]+1, gcd, total);
1419 /* Eliminate the specified variables from the constraints using
1420 * Fourier-Motzkin. The variables themselves are not removed.
1422 struct isl_basic_map *isl_basic_map_eliminate_vars(
1423 struct isl_basic_map *bmap, int pos, unsigned n)
1432 total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
1433 extra = bmap->extra - bmap->n_div;
1435 bmap = isl_basic_map_cow(bmap);
1436 for (d = pos + n - 1; d >= pos; --d) {
1437 int n_lower, n_upper;
1440 for (i = 0; i < bmap->n_eq; ++i) {
1441 if (isl_int_is_zero(bmap->eq[i][1+d]))
1443 eliminate_var_using_equality(bmap, d, bmap->eq[i], NULL);
1444 isl_basic_map_drop_equality(bmap, i);
1451 for (i = 0; i < bmap->n_ineq; ++i) {
1452 if (isl_int_is_pos(bmap->ineq[i][1+d]))
1454 else if (isl_int_is_neg(bmap->ineq[i][1+d]))
1457 bmap = isl_basic_map_extend(bmap,
1458 bmap->nparam, bmap->n_in, bmap->n_out, 0,
1459 0, n_lower * n_upper);
1460 for (i = bmap->n_ineq - 1; i >= 0; --i) {
1462 if (isl_int_is_zero(bmap->ineq[i][1+d]))
1465 for (j = 0; j < i; ++j) {
1466 if (isl_int_is_zero(bmap->ineq[j][1+d]))
1469 if (isl_int_sgn(bmap->ineq[i][1+d]) ==
1470 isl_int_sgn(bmap->ineq[j][1+d]))
1472 k = isl_basic_map_alloc_inequality(bmap);
1475 isl_seq_cpy(bmap->ineq[k], bmap->ineq[i],
1477 isl_seq_clr(bmap->ineq[k]+1+total, extra);
1478 isl_seq_elim(bmap->ineq[k], bmap->ineq[j],
1479 1+d, 1+total, NULL);
1481 isl_basic_map_drop_inequality(bmap, i);
1484 if (n_lower > 0 && n_upper > 0) {
1485 bmap = normalize_constraints(bmap);
1486 bmap = remove_duplicate_constraints(bmap, NULL);
1487 bmap = isl_basic_map_gauss(bmap, NULL);
1488 bmap = isl_basic_map_convex_hull(bmap);
1491 if (F_ISSET(bmap, ISL_BASIC_MAP_EMPTY))
1495 F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1498 isl_basic_map_free(bmap);
1502 struct isl_basic_set *isl_basic_set_eliminate_vars(
1503 struct isl_basic_set *bset, unsigned pos, unsigned n)
1505 return (struct isl_basic_set *)isl_basic_map_eliminate_vars(
1506 (struct isl_basic_map *)bset, pos, n);
1509 /* Eliminate the specified n dimensions starting at first from the
1510 * constraints using Fourier-Motzkin, The dimensions themselves
1513 struct isl_set *isl_set_eliminate_dims(struct isl_set *set,
1514 unsigned first, unsigned n)
1521 set = isl_set_cow(set);
1524 isl_assert(set->ctx, first+n <= set->dim, goto error);
1526 for (i = 0; i < set->n; ++i) {
1527 set->p[i] = isl_basic_set_eliminate_vars(set->p[i],
1528 set->nparam + first, n);
1538 /* Project out n dimensions starting at first using Fourier-Motzkin */
1539 struct isl_set *isl_set_remove_dims(struct isl_set *set,
1540 unsigned first, unsigned n)
1542 set = isl_set_eliminate_dims(set, first, n);
1543 set = isl_set_drop_dims(set, first, n);
1547 /* Project out n inputs starting at first using Fourier-Motzkin */
1548 struct isl_map *isl_map_remove_inputs(struct isl_map *map,
1549 unsigned first, unsigned n)
1556 map = isl_map_cow(map);
1559 isl_assert(map->ctx, first+n <= map->n_in, goto error);
1561 for (i = 0; i < map->n; ++i) {
1562 map->p[i] = isl_basic_map_eliminate_vars(map->p[i],
1563 map->nparam + first, n);
1567 map = isl_map_drop_inputs(map, first, n);
1574 /* Project out n dimensions starting at first using Fourier-Motzkin */
1575 struct isl_basic_set *isl_basic_set_remove_dims(struct isl_basic_set *bset,
1576 unsigned first, unsigned n)
1578 bset = isl_basic_set_eliminate_vars(bset, bset->nparam + first, n);
1579 bset = isl_basic_set_drop_dims(bset, first, n);
1583 /* Elimininate divs based on inequalities
1585 static struct isl_basic_map *eliminate_divs_ineq(
1586 struct isl_basic_map *bmap, int *progress)
1591 struct isl_ctx *ctx;
1597 off = 1 + bmap->nparam + bmap->n_in + bmap->n_out;
1599 for (d = bmap->n_div - 1; d >= 0 ; --d) {
1600 for (i = 0; i < bmap->n_eq; ++i)
1601 if (!isl_int_is_zero(bmap->eq[i][off + d]))
1605 for (i = 0; i < bmap->n_ineq; ++i)
1606 if (isl_int_abs_gt(bmap->ineq[i][off + d], ctx->one))
1608 if (i < bmap->n_ineq)
1611 bmap = isl_basic_map_eliminate_vars(bmap, (off-1)+d, 1);
1612 if (F_ISSET(bmap, ISL_BASIC_MAP_EMPTY))
1614 bmap = isl_basic_map_drop_div(bmap, d);
1621 struct isl_basic_map *isl_basic_map_simplify(struct isl_basic_map *bmap)
1628 bmap = normalize_constraints(bmap);
1629 bmap = eliminate_divs_eq(bmap, &progress);
1630 bmap = eliminate_divs_ineq(bmap, &progress);
1631 bmap = isl_basic_map_gauss(bmap, &progress);
1632 bmap = remove_duplicate_divs(bmap, &progress);
1633 bmap = remove_duplicate_constraints(bmap, &progress);
1638 struct isl_basic_set *isl_basic_set_simplify(struct isl_basic_set *bset)
1640 return (struct isl_basic_set *)
1641 isl_basic_map_simplify((struct isl_basic_map *)bset);
1644 static void dump_term(struct isl_basic_map *bmap,
1645 isl_int c, int pos, FILE *out)
1647 unsigned in = bmap->n_in;
1648 unsigned dim = bmap->n_in + bmap->n_out;
1650 isl_int_print(out, c, 0);
1652 if (!isl_int_is_one(c))
1653 isl_int_print(out, c, 0);
1654 if (pos < 1 + bmap->nparam)
1655 fprintf(out, "p%d", pos - 1);
1656 else if (pos < 1 + bmap->nparam + in)
1657 fprintf(out, "i%d", pos - 1 - bmap->nparam);
1658 else if (pos < 1 + bmap->nparam + dim)
1659 fprintf(out, "o%d", pos - 1 - bmap->nparam - in);
1661 fprintf(out, "e%d", pos - 1 - bmap->nparam - dim);
1665 static void dump_constraint_sign(struct isl_basic_map *bmap, isl_int *c,
1666 int sign, FILE *out)
1670 unsigned len = 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
1674 for (i = 0, first = 1; i < len; ++i) {
1675 if (isl_int_sgn(c[i]) * sign <= 0)
1678 fprintf(out, " + ");
1680 isl_int_abs(v, c[i]);
1681 dump_term(bmap, v, i, out);
1688 static void dump_constraint(struct isl_basic_map *bmap, isl_int *c,
1689 const char *op, FILE *out, int indent)
1693 fprintf(out, "%*s", indent, "");
1695 dump_constraint_sign(bmap, c, 1, out);
1696 fprintf(out, " %s ", op);
1697 dump_constraint_sign(bmap, c, -1, out);
1701 for (i = bmap->n_div; i < bmap->extra; ++i) {
1702 if (isl_int_is_zero(c[1+bmap->nparam+bmap->n_in+bmap->n_out+i]))
1704 fprintf(out, "%*s", indent, "");
1705 fprintf(out, "ERROR: unused div coefficient not zero\n");
1709 static void dump_constraints(struct isl_basic_map *bmap,
1710 isl_int **c, unsigned n,
1711 const char *op, FILE *out, int indent)
1715 for (i = 0; i < n; ++i)
1716 dump_constraint(bmap, c[i], op, out, indent);
1719 static void dump_affine(struct isl_basic_map *bmap, isl_int *exp, FILE *out)
1723 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
1725 for (j = 0; j < 1 + total; ++j) {
1726 if (isl_int_is_zero(exp[j]))
1728 if (!first && isl_int_is_pos(exp[j]))
1730 dump_term(bmap, exp[j], j, out);
1735 static void dump(struct isl_basic_map *bmap, FILE *out, int indent)
1739 dump_constraints(bmap, bmap->eq, bmap->n_eq, "=", out, indent);
1740 dump_constraints(bmap, bmap->ineq, bmap->n_ineq, ">=", out, indent);
1742 for (i = 0; i < bmap->n_div; ++i) {
1743 fprintf(out, "%*s", indent, "");
1744 fprintf(out, "e%d = [(", i);
1745 dump_affine(bmap, bmap->div[i]+1, out);
1747 isl_int_print(out, bmap->div[i][0], 0);
1748 fprintf(out, "]\n");
1752 void isl_basic_set_dump(struct isl_basic_set *bset, FILE *out, int indent)
1755 fprintf(out, "null basic set\n");
1759 fprintf(out, "%*s", indent, "");
1760 fprintf(out, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n",
1761 bset->ref, bset->nparam, bset->dim, bset->extra,
1763 dump((struct isl_basic_map *)bset, out, indent);
1766 void isl_basic_map_dump(struct isl_basic_map *bmap, FILE *out, int indent)
1769 fprintf(out, "null basic map\n");
1773 fprintf(out, "%*s", indent, "");
1774 fprintf(out, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, flags: %x\n",
1776 bmap->nparam, bmap->n_in, bmap->n_out, bmap->extra, bmap->flags);
1777 dump(bmap, out, indent);
1780 int isl_inequality_negate(struct isl_basic_map *bmap, unsigned pos)
1782 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
1785 isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
1786 isl_seq_neg(bmap->ineq[pos], bmap->ineq[pos], 1 + total);
1787 isl_int_sub_ui(bmap->ineq[pos][0], bmap->ineq[pos][0], 1);
1788 F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1792 struct isl_set *isl_set_alloc(struct isl_ctx *ctx,
1793 unsigned nparam, unsigned dim, int n, unsigned flags)
1795 struct isl_set *set;
1797 isl_assert(ctx, n >= 0, return NULL);
1798 set = isl_alloc(ctx, struct isl_set,
1799 sizeof(struct isl_set) +
1800 n * sizeof(struct isl_basic_set *));
1809 set->nparam = nparam;
1816 struct isl_set *isl_set_dup(struct isl_set *set)
1819 struct isl_set *dup;
1824 dup = isl_set_alloc(set->ctx, set->nparam, set->dim, set->n, set->flags);
1827 for (i = 0; i < set->n; ++i)
1828 dup = isl_set_add(dup,
1829 isl_basic_set_dup(set->p[i]));
1833 struct isl_set *isl_set_from_basic_set(struct isl_basic_set *bset)
1835 struct isl_set *set;
1840 set = isl_set_alloc(bset->ctx, bset->nparam, bset->dim, 1, ISL_MAP_DISJOINT);
1842 isl_basic_set_free(bset);
1845 return isl_set_add(set, bset);
1848 struct isl_map *isl_map_from_basic_map(struct isl_basic_map *bmap)
1850 struct isl_map *map;
1855 map = isl_map_alloc(bmap->ctx, bmap->nparam, bmap->n_in, bmap->n_out, 1,
1858 isl_basic_map_free(bmap);
1861 return isl_map_add(map, bmap);
1864 struct isl_set *isl_set_add(struct isl_set *set, struct isl_basic_set *bset)
1868 isl_assert(set->ctx, set->nparam == bset->nparam, goto error);
1869 isl_assert(set->ctx, set->dim == bset->dim, goto error);
1870 isl_assert(set->ctx, set->n < set->size, goto error);
1871 set->p[set->n] = bset;
1878 isl_basic_set_free(bset);
1882 void isl_set_free(struct isl_set *set)
1892 isl_ctx_deref(set->ctx);
1893 for (i = 0; i < set->n; ++i)
1894 isl_basic_set_free(set->p[i]);
1898 void isl_set_dump(struct isl_set *set, FILE *out, int indent)
1903 fprintf(out, "null set\n");
1907 fprintf(out, "%*s", indent, "");
1908 fprintf(out, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
1909 set->ref, set->n, set->nparam, set->dim, set->flags);
1910 for (i = 0; i < set->n; ++i) {
1911 fprintf(out, "%*s", indent, "");
1912 fprintf(out, "basic set %d:\n", i);
1913 isl_basic_set_dump(set->p[i], out, indent+4);
1917 void isl_map_dump(struct isl_map *map, FILE *out, int indent)
1922 fprintf(out, "null map\n");
1926 fprintf(out, "%*s", indent, "");
1927 fprintf(out, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, flags: %x\n",
1928 map->ref, map->n, map->nparam, map->n_in, map->n_out,
1930 for (i = 0; i < map->n; ++i) {
1931 fprintf(out, "%*s", indent, "");
1932 fprintf(out, "basic map %d:\n", i);
1933 isl_basic_map_dump(map->p[i], out, indent+4);
1937 struct isl_basic_map *isl_basic_map_intersect_domain(
1938 struct isl_basic_map *bmap, struct isl_basic_set *bset)
1940 struct isl_basic_map *bmap_domain;
1945 isl_assert(bset->ctx, bset->dim == bmap->n_in, goto error);
1946 isl_assert(bset->ctx, bset->nparam == bmap->nparam, goto error);
1948 bmap = isl_basic_map_extend(bmap,
1949 bset->nparam, bmap->n_in, bmap->n_out,
1950 bset->n_div, bset->n_eq, bset->n_ineq);
1953 bmap_domain = isl_basic_map_from_basic_set(bset,
1955 bmap = add_constraints(bmap, bmap_domain, 0, 0);
1957 bmap = isl_basic_map_simplify(bmap);
1958 return isl_basic_map_finalize(bmap);
1960 isl_basic_map_free(bmap);
1961 isl_basic_set_free(bset);
1965 struct isl_basic_map *isl_basic_map_intersect_range(
1966 struct isl_basic_map *bmap, struct isl_basic_set *bset)
1968 struct isl_basic_map *bmap_range;
1973 isl_assert(bset->ctx, bset->dim == bmap->n_out, goto error);
1974 isl_assert(bset->ctx, bset->nparam == bmap->nparam, goto error);
1976 bmap = isl_basic_map_extend(bmap,
1977 bset->nparam, bmap->n_in, bmap->n_out,
1978 bset->n_div, bset->n_eq, bset->n_ineq);
1981 bmap_range = isl_basic_map_from_basic_set(bset,
1983 bmap = add_constraints(bmap, bmap_range, 0, 0);
1985 bmap = isl_basic_map_simplify(bmap);
1986 return isl_basic_map_finalize(bmap);
1988 isl_basic_map_free(bmap);
1989 isl_basic_set_free(bset);
1993 struct isl_basic_map *isl_basic_map_intersect(
1994 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
1996 if (!bmap1 || !bmap2)
1999 isl_assert(bmap1->ctx, bmap1->nparam == bmap2->nparam, goto error);
2000 isl_assert(bmap1->ctx, bmap1->n_in == bmap2->n_in, goto error);
2001 isl_assert(bmap1->ctx, bmap1->n_out == bmap2->n_out, goto error);
2003 bmap1 = isl_basic_map_extend(bmap1,
2004 bmap1->nparam, bmap1->n_in, bmap1->n_out,
2005 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
2008 bmap1 = add_constraints(bmap1, bmap2, 0, 0);
2010 bmap1 = isl_basic_map_simplify(bmap1);
2011 return isl_basic_map_finalize(bmap1);
2013 isl_basic_map_free(bmap1);
2014 isl_basic_map_free(bmap2);
2018 struct isl_basic_set *isl_basic_set_intersect(
2019 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
2021 return (struct isl_basic_set *)
2022 isl_basic_map_intersect(
2023 (struct isl_basic_map *)bset1,
2024 (struct isl_basic_map *)bset2);
2027 struct isl_map *isl_map_intersect(struct isl_map *map1, struct isl_map *map2)
2030 struct isl_map *result;
2036 if (F_ISSET(map1, ISL_MAP_DISJOINT) &&
2037 F_ISSET(map2, ISL_MAP_DISJOINT))
2038 FL_SET(flags, ISL_MAP_DISJOINT);
2040 result = isl_map_alloc(map1->ctx, map1->nparam, map1->n_in, map1->n_out,
2041 map1->n * map2->n, flags);
2044 for (i = 0; i < map1->n; ++i)
2045 for (j = 0; j < map2->n; ++j) {
2046 struct isl_basic_map *part;
2047 part = isl_basic_map_intersect(
2048 isl_basic_map_copy(map1->p[i]),
2049 isl_basic_map_copy(map2->p[j]));
2050 if (isl_basic_map_is_empty(part))
2051 isl_basic_map_free(part);
2053 result = isl_map_add(result, part);
2066 struct isl_set *isl_set_intersect(struct isl_set *set1, struct isl_set *set2)
2068 return (struct isl_set *)
2069 isl_map_intersect((struct isl_map *)set1,
2070 (struct isl_map *)set2);
2073 struct isl_basic_map *isl_basic_map_reverse(struct isl_basic_map *bmap)
2075 struct isl_basic_set *bset;
2080 bmap = isl_basic_map_cow(bmap);
2084 bset = isl_basic_set_from_basic_map(bmap);
2085 bset = isl_basic_set_swap_vars(bset, in);
2086 return isl_basic_map_from_basic_set(bset, bset->dim-in, in);
2089 /* Turn final n dimensions into existentially quantified variables.
2091 struct isl_basic_set *isl_basic_set_project_out(
2092 struct isl_basic_set *bset, unsigned n, unsigned flags)
2102 isl_assert(bset->ctx, n <= bset->dim, goto error);
2107 bset = isl_basic_set_cow(bset);
2109 row_size = 1 + bset->nparam + bset->dim + bset->extra;
2110 old = bset->block2.data;
2111 bset->block2 = isl_blk_extend(bset->ctx, bset->block2,
2112 (bset->extra + n) * (1 + row_size));
2113 if (!bset->block2.data)
2115 new_div = isl_alloc_array(ctx, isl_int *, bset->extra + n);
2118 for (i = 0; i < n; ++i) {
2119 new_div[i] = bset->block2.data +
2120 (bset->extra + i) * (1 + row_size);
2121 isl_seq_clr(new_div[i], 1 + row_size);
2123 for (i = 0; i < bset->extra; ++i)
2124 new_div[n + i] = bset->block2.data + (bset->div[i] - old);
2126 bset->div = new_div;
2130 bset = isl_basic_set_simplify(bset);
2131 return isl_basic_set_finalize(bset);
2133 isl_basic_set_free(bset);
2137 struct isl_basic_map *isl_basic_map_apply_range(
2138 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2140 struct isl_basic_set *bset;
2141 unsigned n_in, n_out;
2143 if (!bmap1 || !bmap2)
2146 isl_assert(bmap->ctx, bmap1->n_out == bmap2->n_in, goto error);
2147 isl_assert(bmap->ctx, bmap1->nparam == bmap2->nparam, goto error);
2150 n_out = bmap2->n_out;
2152 bmap2 = isl_basic_map_reverse(bmap2);
2155 bmap1 = isl_basic_map_extend(bmap1, bmap1->nparam,
2156 bmap1->n_in + bmap2->n_in, bmap1->n_out,
2157 bmap2->extra, bmap2->n_eq, bmap2->n_ineq);
2160 bmap1 = add_constraints(bmap1, bmap2, bmap1->n_in - bmap2->n_in, 0);
2161 bmap1 = isl_basic_map_simplify(bmap1);
2162 bset = isl_basic_set_from_basic_map(bmap1);
2163 bset = isl_basic_set_project_out(bset,
2164 bset->dim - (n_in + n_out), 0);
2165 return isl_basic_map_from_basic_set(bset, n_in, n_out);
2167 isl_basic_map_free(bmap1);
2168 isl_basic_map_free(bmap2);
2172 struct isl_basic_set *isl_basic_set_apply(
2173 struct isl_basic_set *bset, struct isl_basic_map *bmap)
2178 isl_assert(bset->ctx, bset->dim == bmap->n_in, goto error);
2180 return (struct isl_basic_set *)
2181 isl_basic_map_apply_range((struct isl_basic_map *)bset, bmap);
2183 isl_basic_set_free(bset);
2184 isl_basic_map_free(bmap);
2188 struct isl_basic_map *isl_basic_map_apply_domain(
2189 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2191 if (!bmap1 || !bmap2)
2194 isl_assert(ctx, bmap1->n_in == bmap2->n_in, goto error);
2195 isl_assert(ctx, bmap1->nparam == bmap2->nparam, goto error);
2197 bmap1 = isl_basic_map_reverse(bmap1);
2198 bmap1 = isl_basic_map_apply_range(bmap1, bmap2);
2199 return isl_basic_map_reverse(bmap1);
2201 isl_basic_map_free(bmap1);
2202 isl_basic_map_free(bmap2);
2206 static struct isl_basic_map *var_equal(struct isl_ctx *ctx,
2207 struct isl_basic_map *bmap, unsigned pos)
2210 i = isl_basic_map_alloc_equality(bmap);
2213 isl_seq_clr(bmap->eq[i],
2214 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->extra);
2215 isl_int_set_si(bmap->eq[i][1+bmap->nparam+pos], -1);
2216 isl_int_set_si(bmap->eq[i][1+bmap->nparam+bmap->n_in+pos], 1);
2217 return isl_basic_map_finalize(bmap);
2219 isl_basic_map_free(bmap);
2223 static struct isl_basic_map *var_more(struct isl_ctx *ctx,
2224 struct isl_basic_map *bmap, unsigned pos)
2227 i = isl_basic_map_alloc_inequality(bmap);
2230 isl_seq_clr(bmap->ineq[i],
2231 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->extra);
2232 isl_int_set_si(bmap->ineq[i][0], -1);
2233 isl_int_set_si(bmap->ineq[i][1+bmap->nparam+pos], -1);
2234 isl_int_set_si(bmap->ineq[i][1+bmap->nparam+bmap->n_in+pos], 1);
2235 return isl_basic_map_finalize(bmap);
2237 isl_basic_map_free(bmap);
2241 static struct isl_basic_map *var_less(struct isl_ctx *ctx,
2242 struct isl_basic_map *bmap, unsigned pos)
2245 i = isl_basic_map_alloc_inequality(bmap);
2248 isl_seq_clr(bmap->ineq[i],
2249 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->extra);
2250 isl_int_set_si(bmap->ineq[i][0], -1);
2251 isl_int_set_si(bmap->ineq[i][1+bmap->nparam+pos], 1);
2252 isl_int_set_si(bmap->ineq[i][1+bmap->nparam+bmap->n_in+pos], -1);
2253 return isl_basic_map_finalize(bmap);
2255 isl_basic_map_free(bmap);
2259 struct isl_basic_map *isl_basic_map_equal(struct isl_ctx *ctx,
2260 unsigned nparam, unsigned in, unsigned out, unsigned n_equal)
2263 struct isl_basic_map *bmap;
2264 bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, n_equal, 0);
2267 for (i = 0; i < n_equal && bmap; ++i)
2268 bmap = var_equal(ctx, bmap, i);
2269 return isl_basic_map_finalize(bmap);
2272 struct isl_basic_map *isl_basic_map_less_at(struct isl_ctx *ctx,
2273 unsigned nparam, unsigned in, unsigned out, unsigned pos)
2276 struct isl_basic_map *bmap;
2277 bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, pos, 1);
2280 for (i = 0; i < pos && bmap; ++i)
2281 bmap = var_equal(ctx, bmap, i);
2283 bmap = var_less(ctx, bmap, pos);
2284 return isl_basic_map_finalize(bmap);
2287 struct isl_basic_map *isl_basic_map_more_at(struct isl_ctx *ctx,
2288 unsigned nparam, unsigned in, unsigned out, unsigned pos)
2291 struct isl_basic_map *bmap;
2292 bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, pos, 1);
2295 for (i = 0; i < pos && bmap; ++i)
2296 bmap = var_equal(ctx, bmap, i);
2298 bmap = var_more(ctx, bmap, pos);
2299 return isl_basic_map_finalize(bmap);
2302 struct isl_basic_map *isl_basic_map_from_basic_set(
2303 struct isl_basic_set *bset, unsigned n_in, unsigned n_out)
2305 struct isl_basic_map *bmap;
2307 bset = isl_basic_set_cow(bset);
2311 isl_assert(ctx, bset->dim == n_in + n_out, goto error);
2312 bmap = (struct isl_basic_map *) bset;
2314 bmap->n_out = n_out;
2315 return isl_basic_map_finalize(bmap);
2317 isl_basic_set_free(bset);
2321 struct isl_basic_set *isl_basic_set_from_basic_map(struct isl_basic_map *bmap)
2325 if (bmap->n_in == 0)
2326 return (struct isl_basic_set *)bmap;
2327 bmap = isl_basic_map_cow(bmap);
2330 bmap->n_out += bmap->n_in;
2332 bmap = isl_basic_map_finalize(bmap);
2333 return (struct isl_basic_set *)bmap;
2338 /* For a div d = floor(f/m), add the constraints
2341 * -(f-(n-1)) + m d >= 0
2343 * Note that the second constraint is the negation of
2347 static int add_div_constraints(struct isl_basic_map *bmap, unsigned div)
2350 unsigned div_pos = 1 + bmap->nparam + bmap->n_in + bmap->n_out + div;
2351 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->extra;
2353 i = isl_basic_map_alloc_inequality(bmap);
2356 isl_seq_cpy(bmap->ineq[i], bmap->div[div]+1, 1+total);
2357 isl_int_neg(bmap->ineq[i][div_pos], bmap->div[div][0]);
2359 j = isl_basic_map_alloc_inequality(bmap);
2362 isl_seq_neg(bmap->ineq[j], bmap->ineq[i], 1 + total);
2363 isl_int_add(bmap->ineq[j][0], bmap->ineq[j][0], bmap->ineq[j][div_pos]);
2364 isl_int_sub_ui(bmap->ineq[j][0], bmap->ineq[j][0], 1);
2368 struct isl_basic_set *isl_basic_map_underlying_set(
2369 struct isl_basic_map *bmap)
2373 if (bmap->nparam == 0 && bmap->n_in == 0 && bmap->n_div == 0)
2374 return (struct isl_basic_set *)bmap;
2375 bmap = isl_basic_map_cow(bmap);
2378 bmap->n_out += bmap->nparam + bmap->n_in + bmap->n_div;
2381 bmap->extra -= bmap->n_div;
2383 bmap = isl_basic_map_finalize(bmap);
2384 return (struct isl_basic_set *)bmap;
2389 struct isl_basic_map *isl_basic_map_overlying_set(
2390 struct isl_basic_set *bset, struct isl_basic_map *like)
2392 struct isl_basic_map *bmap;
2393 struct isl_ctx *ctx;
2400 isl_assert(ctx, bset->dim ==
2401 like->nparam + like->n_in + like->n_out + like->n_div,
2403 if (like->nparam == 0 && like->n_in == 0 && like->n_div == 0) {
2404 isl_basic_map_free(like);
2405 return (struct isl_basic_map *)bset;
2407 bset = isl_basic_set_cow(bset);
2410 total = bset->dim + bset->extra;
2411 bmap = (struct isl_basic_map *)bset;
2412 bmap->nparam = like->nparam;
2413 bmap->n_in = like->n_in;
2414 bmap->n_out = like->n_out;
2415 bmap->extra += like->n_div;
2418 ltotal = total - bmap->extra + like->extra;
2421 bmap->block2 = isl_blk_extend(ctx, bmap->block2,
2422 bmap->extra * (1 + 1 + total));
2423 if (isl_blk_is_error(bmap->block2))
2425 bmap->div = isl_realloc_array(ctx, bmap->div, isl_int *,
2429 bmap = isl_basic_map_extend(bmap, bmap->nparam,
2430 bmap->n_in, bmap->n_out, 0, 0, 2 * like->n_div);
2431 for (i = 0; i < like->n_div; ++i) {
2432 k = isl_basic_map_alloc_div(bmap);
2435 isl_seq_cpy(bmap->div[k], like->div[i], 1 + 1 + ltotal);
2436 isl_seq_clr(bmap->div[k]+1+1+ltotal, total - ltotal);
2437 if (add_div_constraints(bmap, k) < 0)
2441 isl_basic_map_free(like);
2442 bmap = isl_basic_map_finalize(bmap);
2445 isl_basic_map_free(like);
2446 isl_basic_set_free(bset);
2450 struct isl_basic_set *isl_basic_set_from_underlying_set(
2451 struct isl_basic_set *bset, struct isl_basic_set *like)
2453 return (struct isl_basic_set *)
2454 isl_basic_map_overlying_set(bset, (struct isl_basic_map *)like);
2457 struct isl_set *isl_set_from_underlying_set(
2458 struct isl_set *set, struct isl_basic_set *like)
2464 isl_assert(set->ctx, set->dim == like->nparam + like->dim + like->n_div,
2466 if (like->nparam == 0 && like->n_div == 0) {
2467 isl_basic_set_free(like);
2470 set = isl_set_cow(set);
2473 for (i = 0; i < set->n; ++i) {
2474 set->p[i] = isl_basic_set_from_underlying_set(set->p[i],
2475 isl_basic_set_copy(like));
2479 set->nparam = like->nparam;
2480 set->dim = like->dim;
2481 isl_basic_set_free(like);
2484 isl_basic_set_free(like);
2489 struct isl_set *isl_map_underlying_set(struct isl_map *map)
2493 map = isl_map_align_divs(map);
2494 map = isl_map_cow(map);
2498 for (i = 0; i < map->n; ++i) {
2499 map->p[i] = (struct isl_basic_map *)
2500 isl_basic_map_underlying_set(map->p[i]);
2505 map->n_out += map->nparam + map->n_in;
2507 map->n_out = map->p[0]->n_out;
2510 return (struct isl_set *)map;
2516 struct isl_set *isl_set_to_underlying_set(struct isl_set *set)
2518 return (struct isl_set *)isl_map_underlying_set((struct isl_map *)set);
2521 struct isl_basic_set *isl_basic_map_domain(struct isl_basic_map *bmap)
2523 struct isl_basic_set *domain;
2527 n_out = bmap->n_out;
2528 domain = isl_basic_set_from_basic_map(bmap);
2529 return isl_basic_set_project_out(domain, n_out, 0);
2532 struct isl_basic_set *isl_basic_map_range(struct isl_basic_map *bmap)
2534 return isl_basic_map_domain(isl_basic_map_reverse(bmap));
2537 struct isl_set *isl_map_range(struct isl_map *map)
2540 struct isl_set *set;
2544 map = isl_map_cow(map);
2548 set = (struct isl_set *) map;
2550 for (i = 0; i < map->n; ++i) {
2551 set->p[i] = isl_basic_map_range(map->p[i]);
2555 F_CLR(set, ISL_MAP_DISJOINT);
2556 F_CLR(set, ISL_SET_NORMALIZED);
2563 struct isl_map *isl_map_from_set(struct isl_set *set,
2564 unsigned n_in, unsigned n_out)
2567 struct isl_map *map = NULL;
2571 isl_assert(set->ctx, set->dim == n_in + n_out, goto error);
2572 set = isl_set_cow(set);
2575 map = (struct isl_map *)set;
2576 for (i = 0; i < set->n; ++i) {
2577 map->p[i] = isl_basic_map_from_basic_set(
2578 set->p[i], n_in, n_out);
2590 struct isl_set *isl_set_from_map(struct isl_map *map)
2593 struct isl_set *set = NULL;
2597 map = isl_map_cow(map);
2600 map->n_out += map->n_in;
2602 set = (struct isl_set *)map;
2603 for (i = 0; i < map->n; ++i) {
2604 set->p[i] = isl_basic_set_from_basic_map(map->p[i]);
2614 struct isl_map *isl_map_alloc(struct isl_ctx *ctx,
2615 unsigned nparam, unsigned in, unsigned out, int n,
2618 struct isl_map *map;
2620 map = isl_alloc(ctx, struct isl_map,
2621 sizeof(struct isl_map) +
2622 n * sizeof(struct isl_basic_map *));
2631 map->nparam = nparam;
2638 struct isl_basic_map *isl_basic_map_empty(struct isl_ctx *ctx,
2639 unsigned nparam, unsigned in, unsigned out)
2641 struct isl_basic_map *bmap;
2642 bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, 1, 0);
2643 bmap = isl_basic_map_set_to_empty(bmap);
2647 struct isl_basic_set *isl_basic_set_empty(struct isl_ctx *ctx,
2648 unsigned nparam, unsigned dim)
2650 struct isl_basic_set *bset;
2651 bset = isl_basic_set_alloc(ctx, nparam, dim, 0, 1, 0);
2652 bset = isl_basic_set_set_to_empty(bset);
2656 struct isl_basic_map *isl_basic_map_universe(struct isl_ctx *ctx,
2657 unsigned nparam, unsigned in, unsigned out)
2659 struct isl_basic_map *bmap;
2660 bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, 0, 0);
2664 struct isl_basic_set *isl_basic_set_universe(struct isl_ctx *ctx,
2665 unsigned nparam, unsigned dim)
2667 struct isl_basic_set *bset;
2668 bset = isl_basic_set_alloc(ctx, nparam, dim, 0, 0, 0);
2672 struct isl_map *isl_map_empty(struct isl_ctx *ctx,
2673 unsigned nparam, unsigned in, unsigned out)
2675 return isl_map_alloc(ctx, nparam, in, out, 0, ISL_MAP_DISJOINT);
2678 struct isl_set *isl_set_empty(struct isl_ctx *ctx,
2679 unsigned nparam, unsigned dim)
2681 return isl_set_alloc(ctx, nparam, dim, 0, ISL_MAP_DISJOINT);
2684 struct isl_map *isl_map_dup(struct isl_map *map)
2687 struct isl_map *dup;
2691 dup = isl_map_alloc(map->ctx, map->nparam, map->n_in, map->n_out, map->n,
2693 for (i = 0; i < map->n; ++i)
2694 dup = isl_map_add(dup,
2695 isl_basic_map_dup(map->p[i]));
2699 struct isl_map *isl_map_add(struct isl_map *map, struct isl_basic_map *bmap)
2703 isl_assert(map->ctx, map->nparam == bmap->nparam, goto error);
2704 isl_assert(map->ctx, map->n_in == bmap->n_in, goto error);
2705 isl_assert(map->ctx, map->n_out == bmap->n_out, goto error);
2706 isl_assert(map->ctx, map->n < map->size, goto error);
2707 map->p[map->n] = bmap;
2709 F_CLR(map, ISL_MAP_NORMALIZED);
2715 isl_basic_map_free(bmap);
2719 void isl_map_free(struct isl_map *map)
2729 isl_ctx_deref(map->ctx);
2730 for (i = 0; i < map->n; ++i)
2731 isl_basic_map_free(map->p[i]);
2735 struct isl_map *isl_map_extend(struct isl_map *base,
2736 unsigned nparam, unsigned n_in, unsigned n_out)
2740 base = isl_map_cow(base);
2744 isl_assert(base->ctx, base->nparam <= nparam, goto error);
2745 isl_assert(base->ctx, base->n_in <= n_in, goto error);
2746 isl_assert(base->ctx, base->n_out <= n_out, goto error);
2747 base->nparam = nparam;
2749 base->n_out = n_out;
2750 for (i = 0; i < base->n; ++i) {
2751 base->p[i] = isl_basic_map_extend(base->p[i],
2752 nparam, n_in, n_out, 0, 0, 0);
2762 struct isl_set *isl_set_extend(struct isl_set *base,
2763 unsigned nparam, unsigned dim)
2765 return (struct isl_set *)isl_map_extend((struct isl_map *)base,
2769 static struct isl_basic_map *isl_basic_map_fix_var(struct isl_basic_map *bmap,
2770 unsigned var, int value)
2774 bmap = isl_basic_map_cow(bmap);
2775 bmap = isl_basic_map_extend(bmap,
2776 bmap->nparam, bmap->n_in, bmap->n_out, 0, 1, 0);
2777 j = isl_basic_map_alloc_equality(bmap);
2780 isl_seq_clr(bmap->eq[j],
2781 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->extra);
2782 isl_int_set_si(bmap->eq[j][1 + var], -1);
2783 isl_int_set_si(bmap->eq[j][0], value);
2784 bmap = isl_basic_map_simplify(bmap);
2785 return isl_basic_map_finalize(bmap);
2787 isl_basic_map_free(bmap);
2791 struct isl_basic_map *isl_basic_map_fix_input_si(struct isl_basic_map *bmap,
2792 unsigned input, int value)
2796 isl_assert(bmap->ctx, input < bmap->n_in, goto error);
2797 return isl_basic_map_fix_var(bmap, bmap->nparam + input, value);
2799 isl_basic_map_free(bmap);
2803 struct isl_basic_set *isl_basic_set_fix_dim_si(struct isl_basic_set *bset,
2804 unsigned dim, int value)
2808 isl_assert(bset->ctx, dim < bset->dim, goto error);
2809 return (struct isl_basic_set *)
2810 isl_basic_map_fix_var((struct isl_basic_map *)bset,
2811 bset->nparam + dim, value);
2813 isl_basic_set_free(bset);
2817 struct isl_map *isl_map_fix_input_si(struct isl_map *map,
2818 unsigned input, int value)
2822 map = isl_map_cow(map);
2826 isl_assert(ctx, input < map->n_in, goto error);
2827 for (i = 0; i < map->n; ++i) {
2828 map->p[i] = isl_basic_map_fix_input_si(map->p[i], input, value);
2832 F_CLR(map, ISL_MAP_NORMALIZED);
2839 struct isl_set *isl_set_fix_dim_si(struct isl_set *set, unsigned dim, int value)
2843 set = isl_set_cow(set);
2847 isl_assert(set->ctx, dim < set->dim, goto error);
2848 for (i = 0; i < set->n; ++i) {
2849 set->p[i] = isl_basic_set_fix_dim_si(set->p[i], dim, value);
2859 struct isl_basic_set *isl_basic_set_lower_bound_dim(struct isl_basic_set *bset,
2860 unsigned dim, isl_int value)
2864 bset = isl_basic_set_cow(bset);
2865 bset = isl_basic_set_extend(bset, bset->nparam, bset->dim, 0, 0, 1);
2866 j = isl_basic_set_alloc_inequality(bset);
2869 isl_seq_clr(bset->ineq[j], 1 + bset->nparam + bset->dim + bset->extra);
2870 isl_int_set_si(bset->ineq[j][1 + bset->nparam + dim], 1);
2871 isl_int_neg(bset->ineq[j][0], value);
2872 bset = isl_basic_set_simplify(bset);
2873 return isl_basic_set_finalize(bset);
2875 isl_basic_set_free(bset);
2879 struct isl_set *isl_set_lower_bound_dim(struct isl_set *set, unsigned dim,
2884 set = isl_set_cow(set);
2888 isl_assert(set->ctx, dim < set->dim, goto error);
2889 for (i = 0; i < set->n; ++i) {
2890 set->p[i] = isl_basic_set_lower_bound_dim(set->p[i], dim, value);
2900 struct isl_map *isl_map_reverse(struct isl_map *map)
2905 map = isl_map_cow(map);
2910 map->n_in = map->n_out;
2912 for (i = 0; i < map->n; ++i) {
2913 map->p[i] = isl_basic_map_reverse(map->p[i]);
2917 F_CLR(map, ISL_MAP_NORMALIZED);
2924 struct isl_map *isl_basic_map_lexmax(
2925 struct isl_basic_map *bmap, struct isl_basic_set *dom,
2926 struct isl_set **empty)
2928 return isl_pip_basic_map_lexmax(bmap, dom, empty);
2931 struct isl_map *isl_basic_map_lexmin(
2932 struct isl_basic_map *bmap, struct isl_basic_set *dom,
2933 struct isl_set **empty)
2935 return isl_pip_basic_map_lexmin(bmap, dom, empty);
2938 struct isl_set *isl_basic_set_lexmin(struct isl_basic_set *bset)
2940 struct isl_basic_map *bmap = NULL;
2941 struct isl_basic_set *dom = NULL;
2942 struct isl_map *min;
2946 bmap = isl_basic_map_from_basic_set(bset, 0, bset->dim);
2949 dom = isl_basic_set_alloc(bmap->ctx, bmap->nparam, 0, 0, 0, 0);
2952 min = isl_basic_map_lexmin(bmap, dom, NULL);
2953 return isl_map_range(min);
2955 isl_basic_map_free(bmap);
2959 struct isl_map *isl_basic_map_compute_divs(struct isl_basic_map *bmap)
2963 if (bmap->n_div == 0)
2964 return isl_map_from_basic_map(bmap);
2965 return isl_pip_basic_map_compute_divs(bmap);
2968 struct isl_map *isl_map_compute_divs(struct isl_map *map)
2971 struct isl_map *res;
2977 res = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[0]));
2978 for (i = 1 ; i < map->n; ++i) {
2980 r2 = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[i]));
2981 if (F_ISSET(map, ISL_MAP_DISJOINT))
2982 res = isl_map_union_disjoint(res, r2);
2984 res = isl_map_union(res, r2);
2991 struct isl_set *isl_basic_set_compute_divs(struct isl_basic_set *bset)
2993 return (struct isl_set *)
2994 isl_basic_map_compute_divs((struct isl_basic_map *)bset);
2997 struct isl_set *isl_set_compute_divs(struct isl_set *set)
2999 return (struct isl_set *)
3000 isl_map_compute_divs((struct isl_map *)set);
3003 struct isl_set *isl_map_domain(struct isl_map *map)
3006 struct isl_set *set;
3011 map = isl_map_cow(map);
3015 set = (struct isl_set *)map;
3016 set->dim = map->n_in;
3018 for (i = 0; i < map->n; ++i) {
3019 set->p[i] = isl_basic_map_domain(map->p[i]);
3023 F_CLR(set, ISL_MAP_DISJOINT);
3024 F_CLR(set, ISL_SET_NORMALIZED);
3031 struct isl_map *isl_map_union_disjoint(
3032 struct isl_map *map1, struct isl_map *map2)
3036 struct isl_map *map = NULL;
3050 isl_assert(map1->ctx, map1->nparam == map2->nparam, goto error);
3051 isl_assert(map1->ctx, map1->n_in == map2->n_in, goto error);
3052 isl_assert(map1->ctx, map1->n_out == map2->n_out, goto error);
3054 if (F_ISSET(map1, ISL_MAP_DISJOINT) &&
3055 F_ISSET(map2, ISL_MAP_DISJOINT))
3056 FL_SET(flags, ISL_MAP_DISJOINT);
3058 map = isl_map_alloc(map1->ctx, map1->nparam, map1->n_in, map1->n_out,
3059 map1->n + map2->n, flags);
3062 for (i = 0; i < map1->n; ++i) {
3063 map = isl_map_add(map,
3064 isl_basic_map_copy(map1->p[i]));
3068 for (i = 0; i < map2->n; ++i) {
3069 map = isl_map_add(map,
3070 isl_basic_map_copy(map2->p[i]));
3084 struct isl_map *isl_map_union(struct isl_map *map1, struct isl_map *map2)
3086 map1 = isl_map_union_disjoint(map1, map2);
3090 F_CLR(map1, ISL_MAP_DISJOINT);
3094 struct isl_set *isl_set_union_disjoint(
3095 struct isl_set *set1, struct isl_set *set2)
3097 return (struct isl_set *)
3098 isl_map_union_disjoint(
3099 (struct isl_map *)set1, (struct isl_map *)set2);
3102 struct isl_set *isl_set_union(struct isl_set *set1, struct isl_set *set2)
3104 return (struct isl_set *)
3105 isl_map_union((struct isl_map *)set1, (struct isl_map *)set2);
3108 struct isl_map *isl_map_intersect_range(
3109 struct isl_map *map, struct isl_set *set)
3112 struct isl_map *result;
3118 if (F_ISSET(map, ISL_MAP_DISJOINT) &&
3119 F_ISSET(set, ISL_MAP_DISJOINT))
3120 FL_SET(flags, ISL_MAP_DISJOINT);
3122 result = isl_map_alloc(map->ctx, map->nparam, map->n_in, map->n_out,
3123 map->n * set->n, flags);
3126 for (i = 0; i < map->n; ++i)
3127 for (j = 0; j < set->n; ++j) {
3128 result = isl_map_add(result,
3129 isl_basic_map_intersect_range(
3130 isl_basic_map_copy(map->p[i]),
3131 isl_basic_set_copy(set->p[j])));
3144 struct isl_map *isl_map_intersect_domain(
3145 struct isl_map *map, struct isl_set *set)
3147 return isl_map_reverse(
3148 isl_map_intersect_range(isl_map_reverse(map), set));
3151 struct isl_map *isl_map_apply_domain(
3152 struct isl_map *map1, struct isl_map *map2)
3156 map1 = isl_map_reverse(map1);
3157 map1 = isl_map_apply_range(map1, map2);
3158 return isl_map_reverse(map1);
3165 struct isl_map *isl_map_apply_range(
3166 struct isl_map *map1, struct isl_map *map2)
3168 struct isl_map *result;
3174 isl_assert(map1->ctx, map1->nparam == map2->nparam, goto error);
3175 isl_assert(map1->ctx, map1->n_out == map2->n_in, goto error);
3177 result = isl_map_alloc(map1->ctx, map1->nparam, map1->n_in, map2->n_out,
3178 map1->n * map2->n, 0);
3181 for (i = 0; i < map1->n; ++i)
3182 for (j = 0; j < map2->n; ++j) {
3183 result = isl_map_add(result,
3184 isl_basic_map_apply_range(
3185 isl_basic_map_copy(map1->p[i]),
3186 isl_basic_map_copy(map2->p[j])));
3192 if (result && result->n <= 1)
3193 F_SET(result, ISL_MAP_DISJOINT);
3202 * returns range - domain
3204 struct isl_basic_set *isl_basic_map_deltas(struct isl_basic_map *bmap)
3206 struct isl_basic_set *bset;
3212 isl_assert(bmap->ctx, bmap->n_in == bmap->n_out, goto error);
3214 bset = isl_basic_set_from_basic_map(bmap);
3215 bset = isl_basic_set_extend(bset, bset->nparam, 3*dim, 0,
3217 bset = isl_basic_set_swap_vars(bset, 2*dim);
3218 for (i = 0; i < dim; ++i) {
3219 int j = isl_basic_map_alloc_equality(
3220 (struct isl_basic_map *)bset);
3223 isl_seq_clr(bset->eq[j],
3224 1 + bset->nparam + bset->dim + bset->extra);
3225 isl_int_set_si(bset->eq[j][1+bset->nparam+i], 1);
3226 isl_int_set_si(bset->eq[j][1+bset->nparam+dim+i], 1);
3227 isl_int_set_si(bset->eq[j][1+bset->nparam+2*dim+i], -1);
3229 return isl_basic_set_project_out(bset, 2*dim, 0);
3231 isl_basic_map_free(bmap);
3236 * returns range - domain
3238 struct isl_set *isl_map_deltas(struct isl_map *map)
3241 struct isl_set *result;
3246 isl_assert(map->ctx, map->n_in == map->n_out, goto error);
3247 result = isl_set_alloc(map->ctx, map->nparam, map->n_in, map->n, map->flags);
3250 for (i = 0; i < map->n; ++i)
3251 result = isl_set_add(result,
3252 isl_basic_map_deltas(isl_basic_map_copy(map->p[i])));
3260 /* If the only constraints a div d=floor(f/m)
3261 * appears in are its two defining constraints
3264 * -(f - (m - 1)) + m d >= 0
3266 * then it can safely be removed.
3268 static int div_is_redundant(struct isl_basic_map *bmap, int div)
3271 unsigned pos = 1 + bmap->nparam + bmap->n_in + bmap->n_out + div;
3273 for (i = 0; i < bmap->n_eq; ++i)
3274 if (!isl_int_is_zero(bmap->eq[i][pos]))
3277 for (i = 0; i < bmap->n_ineq; ++i) {
3278 if (isl_int_is_zero(bmap->ineq[i][pos]))
3280 if (isl_int_eq(bmap->ineq[i][pos], bmap->div[div][0])) {
3282 isl_int_sub(bmap->div[div][1],
3283 bmap->div[div][1], bmap->div[div][0]);
3284 isl_int_add_ui(bmap->div[div][1], bmap->div[div][1], 1);
3285 neg = isl_seq_is_neg(bmap->ineq[i], bmap->div[div]+1, pos);
3286 isl_int_sub_ui(bmap->div[div][1], bmap->div[div][1], 1);
3287 isl_int_add(bmap->div[div][1],
3288 bmap->div[div][1], bmap->div[div][0]);
3291 if (isl_seq_first_non_zero(bmap->ineq[i]+pos+1,
3292 bmap->n_div-div-1) != -1)
3294 } else if (isl_int_abs_eq(bmap->ineq[i][pos], bmap->div[div][0])) {
3295 if (!isl_seq_eq(bmap->ineq[i], bmap->div[div]+1, pos))
3297 if (isl_seq_first_non_zero(bmap->ineq[i]+pos+1,
3298 bmap->n_div-div-1) != -1)
3304 for (i = 0; i < bmap->n_div; ++i)
3305 if (!isl_int_is_zero(bmap->div[i][1+pos]))
3312 * Remove divs that don't occur in any of the constraints or other divs.
3313 * These can arise when dropping some of the variables in a quast
3314 * returned by piplib.
3316 static struct isl_basic_map *remove_redundant_divs(struct isl_basic_map *bmap)
3323 for (i = bmap->n_div-1; i >= 0; --i) {
3324 if (!div_is_redundant(bmap, i))
3326 bmap = isl_basic_map_drop_div(bmap, i);
3331 struct isl_basic_map *isl_basic_map_finalize(struct isl_basic_map *bmap)
3333 bmap = remove_redundant_divs(bmap);
3336 F_SET(bmap, ISL_BASIC_SET_FINAL);
3340 struct isl_basic_set *isl_basic_set_finalize(struct isl_basic_set *bset)
3342 return (struct isl_basic_set *)
3343 isl_basic_map_finalize((struct isl_basic_map *)bset);
3346 struct isl_set *isl_set_finalize(struct isl_set *set)
3352 for (i = 0; i < set->n; ++i) {
3353 set->p[i] = isl_basic_set_finalize(set->p[i]);
3363 struct isl_map *isl_map_finalize(struct isl_map *map)
3369 for (i = 0; i < map->n; ++i) {
3370 map->p[i] = isl_basic_map_finalize(map->p[i]);
3374 F_CLR(map, ISL_MAP_NORMALIZED);
3381 struct isl_basic_map *isl_basic_map_identity(struct isl_ctx *ctx,
3382 unsigned nparam, unsigned dim)
3384 struct isl_basic_map *bmap;
3387 bmap = isl_basic_map_alloc(ctx, nparam, dim, dim, 0, dim, 0);
3391 for (i = 0; i < dim; ++i) {
3392 int j = isl_basic_map_alloc_equality(bmap);
3395 isl_seq_clr(bmap->eq[j],
3396 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->extra);
3397 isl_int_set_si(bmap->eq[j][1+nparam+i], 1);
3398 isl_int_set_si(bmap->eq[j][1+nparam+dim+i], -1);
3400 return isl_basic_map_finalize(bmap);
3402 isl_basic_map_free(bmap);
3406 struct isl_map *isl_map_identity(struct isl_ctx *ctx,
3407 unsigned nparam, unsigned dim)
3409 struct isl_map *map = isl_map_alloc(ctx, nparam, dim, dim, 1,
3413 map = isl_map_add(map,
3414 isl_basic_map_identity(ctx, nparam, dim));
3421 int isl_set_is_equal(struct isl_set *set1, struct isl_set *set2)
3423 return isl_map_is_equal((struct isl_map *)set1, (struct isl_map *)set2);
3426 int isl_set_is_subset(struct isl_set *set1, struct isl_set *set2)
3428 return isl_map_is_subset(
3429 (struct isl_map *)set1, (struct isl_map *)set2);
3432 int isl_basic_map_is_subset(
3433 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3436 struct isl_map *map1;
3437 struct isl_map *map2;
3439 if (!bmap1 || !bmap2)
3442 map1 = isl_map_from_basic_map(isl_basic_map_copy(bmap1));
3443 map2 = isl_map_from_basic_map(isl_basic_map_copy(bmap2));
3445 is_subset = isl_map_is_subset(map1, map2);
3453 int isl_basic_map_is_equal(
3454 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3458 if (!bmap1 || !bmap2)
3460 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
3463 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
3467 int isl_basic_set_is_equal(
3468 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
3470 return isl_basic_map_is_equal(
3471 (struct isl_basic_map *)bset1, (struct isl_basic_map *)bset2);
3474 int isl_map_is_empty(struct isl_map *map)
3481 for (i = 0; i < map->n; ++i) {
3482 is_empty = isl_basic_map_is_empty(map->p[i]);
3491 int isl_set_is_empty(struct isl_set *set)
3493 return isl_map_is_empty((struct isl_map *)set);
3496 int isl_map_is_subset(struct isl_map *map1, struct isl_map *map2)
3500 struct isl_map *diff;
3505 if (isl_map_is_empty(map1))
3508 if (isl_map_is_empty(map2))
3511 diff = isl_map_subtract(isl_map_copy(map1), isl_map_copy(map2));
3515 is_subset = isl_map_is_empty(diff);
3521 int isl_map_is_equal(struct isl_map *map1, struct isl_map *map2)
3527 is_subset = isl_map_is_subset(map1, map2);
3530 is_subset = isl_map_is_subset(map2, map1);
3534 int isl_basic_map_is_strict_subset(
3535 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3539 if (!bmap1 || !bmap2)
3541 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
3544 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
3545 if (is_subset == -1)
3550 static int basic_map_contains(struct isl_basic_map *bmap, struct isl_vec *vec)
3556 total = 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
3557 if (total != vec->size)
3562 for (i = 0; i < bmap->n_eq; ++i) {
3563 isl_seq_inner_product(vec->block.data, bmap->eq[i], total, &s);
3564 if (!isl_int_is_zero(s)) {
3570 for (i = 0; i < bmap->n_ineq; ++i) {
3571 isl_seq_inner_product(vec->block.data, bmap->ineq[i], total, &s);
3572 if (isl_int_is_neg(s)) {
3583 int isl_basic_map_is_universe(struct isl_basic_map *bmap)
3587 return bmap->n_eq == 0 && bmap->n_ineq == 0;
3590 int isl_basic_map_is_empty(struct isl_basic_map *bmap)
3592 struct isl_basic_set *bset = NULL;
3593 struct isl_vec *sample = NULL;
3600 if (F_ISSET(bmap, ISL_BASIC_MAP_EMPTY))
3603 if (F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL)) {
3604 struct isl_basic_map *copy = isl_basic_map_copy(bmap);
3605 copy = isl_basic_map_convex_hull(copy);
3606 empty = F_ISSET(copy, ISL_BASIC_MAP_EMPTY);
3607 isl_basic_map_free(copy);
3611 total = 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
3612 if (bmap->sample && bmap->sample->size == total) {
3613 int contains = basic_map_contains(bmap, bmap->sample);
3619 bset = isl_basic_map_underlying_set(isl_basic_map_copy(bmap));
3622 sample = isl_basic_set_sample(bset);
3625 empty = sample->size == 0;
3627 isl_vec_free(bmap->ctx, bmap->sample);
3628 bmap->sample = sample;
3633 struct isl_map *isl_basic_map_union(
3634 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3636 struct isl_map *map;
3637 if (!bmap1 || !bmap2)
3640 isl_assert(bmap1->ctx, bmap1->nparam == bmap2->nparam, goto error);
3641 isl_assert(bmap1->ctx, bmap1->n_in == bmap2->n_in, goto error);
3642 isl_assert(bmap1->ctx, bmap1->n_out == bmap2->n_out, goto error);
3644 map = isl_map_alloc(bmap1->ctx, bmap1->nparam,
3645 bmap1->n_in, bmap1->n_out, 2, 0);
3648 map = isl_map_add(map, bmap1);
3649 map = isl_map_add(map, bmap2);
3652 isl_basic_map_free(bmap1);
3653 isl_basic_map_free(bmap2);
3657 struct isl_set *isl_basic_set_union(
3658 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
3660 return (struct isl_set *)isl_basic_map_union(
3661 (struct isl_basic_map *)bset1,
3662 (struct isl_basic_map *)bset2);
3665 /* Order divs such that any div only depends on previous divs */
3666 static struct isl_basic_map *order_divs(struct isl_basic_map *bmap)
3669 unsigned off = bmap->nparam + bmap->n_in + bmap->n_out;
3671 for (i = 0; i < bmap->n_div; ++i) {
3673 pos = isl_seq_first_non_zero(bmap->div[i]+1+1+off+i,
3677 swap_div(bmap, i, pos);
3683 static int find_div(struct isl_basic_map *dst,
3684 struct isl_basic_map *src, unsigned div)
3688 unsigned total = src->nparam + src->n_in + src->n_out + src->n_div;
3690 for (i = 0; i < dst->n_div; ++i)
3691 if (isl_seq_eq(dst->div[i], src->div[div], 1+1+total) &&
3692 isl_seq_first_non_zero(dst->div[i]+1+1+total,
3693 dst->n_div - src->n_div) == -1)
3698 struct isl_basic_map *isl_basic_map_align_divs(
3699 struct isl_basic_map *dst, struct isl_basic_map *src)
3702 unsigned total = src->nparam + src->n_in + src->n_out + src->n_div;
3707 if (src->n_div == 0)
3710 src = order_divs(src);
3711 dst = isl_basic_map_extend(dst, dst->nparam, dst->n_in,
3712 dst->n_out, src->n_div, 0, 2 * src->n_div);
3715 for (i = 0; i < src->n_div; ++i) {
3716 int j = find_div(dst, src, i);
3718 j = isl_basic_map_alloc_div(dst);
3721 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total);
3722 isl_seq_clr(dst->div[j]+1+1+total,
3723 dst->extra - src->n_div);
3724 if (add_div_constraints(dst, j) < 0)
3728 swap_div(dst, i, j);
3732 isl_basic_map_free(dst);
3736 struct isl_basic_set *isl_basic_set_align_divs(
3737 struct isl_basic_set *dst, struct isl_basic_set *src)
3739 return (struct isl_basic_set *)isl_basic_map_align_divs(
3740 (struct isl_basic_map *)dst, (struct isl_basic_map *)src);
3743 struct isl_map *isl_map_align_divs(struct isl_map *map)
3747 map = isl_map_compute_divs(map);
3748 map = isl_map_cow(map);
3752 for (i = 1; i < map->n; ++i)
3753 map->p[0] = isl_basic_map_align_divs(map->p[0], map->p[i]);
3754 for (i = 1; i < map->n; ++i)
3755 map->p[i] = isl_basic_map_align_divs(map->p[i], map->p[0]);
3757 F_CLR(map, ISL_MAP_NORMALIZED);
3761 static struct isl_map *add_cut_constraint(struct isl_map *dst,
3762 struct isl_basic_map *src, isl_int *c,
3763 unsigned len, int oppose)
3765 struct isl_basic_map *copy = NULL;
3770 copy = isl_basic_map_copy(src);
3771 copy = isl_basic_map_cow(copy);
3774 copy = isl_basic_map_extend(copy,
3775 copy->nparam, copy->n_in, copy->n_out, 0, 0, 1);
3776 k = isl_basic_map_alloc_inequality(copy);
3780 isl_seq_neg(copy->ineq[k], c, len);
3782 isl_seq_cpy(copy->ineq[k], c, len);
3783 total = 1 + copy->nparam + copy->n_in + copy->n_out + copy->extra;
3784 isl_seq_clr(copy->ineq[k]+len, total - len);
3785 isl_inequality_negate(copy, k);
3786 copy = isl_basic_map_simplify(copy);
3787 copy = isl_basic_map_finalize(copy);
3788 is_empty = isl_basic_map_is_empty(copy);
3792 dst = isl_map_add(dst, copy);
3794 isl_basic_map_free(copy);
3797 isl_basic_map_free(copy);
3802 static struct isl_map *subtract(struct isl_map *map, struct isl_basic_map *bmap)
3806 struct isl_map *rest = NULL;
3808 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
3815 if (F_ISSET(map, ISL_MAP_DISJOINT))
3816 FL_SET(flags, ISL_MAP_DISJOINT);
3818 max = map->n * (2 * bmap->n_eq + bmap->n_ineq);
3819 rest = isl_map_alloc(map->ctx, map->nparam, map->n_in, map->n_out,
3824 for (i = 0; i < map->n; ++i) {
3825 map->p[i] = isl_basic_map_align_divs(map->p[i], bmap);
3830 for (j = 0; j < map->n; ++j)
3831 map->p[j] = isl_basic_map_cow(map->p[j]);
3833 for (i = 0; i < bmap->n_eq; ++i) {
3834 for (j = 0; j < map->n; ++j) {
3835 rest = add_cut_constraint(rest,
3836 map->p[j], bmap->eq[i], 1+total, 0);
3840 rest = add_cut_constraint(rest,
3841 map->p[j], bmap->eq[i], 1+total, 1);
3845 map->p[j] = isl_basic_map_extend(map->p[j],
3846 map->p[j]->nparam, map->p[j]->n_in,
3847 map->p[j]->n_out, 0, 1, 0);
3850 k = isl_basic_map_alloc_equality(map->p[j]);
3853 isl_seq_cpy(map->p[j]->eq[k], bmap->eq[i], 1+total);
3854 isl_seq_clr(map->p[j]->eq[k]+1+total,
3855 map->p[j]->extra - bmap->n_div);
3859 for (i = 0; i < bmap->n_ineq; ++i) {
3860 for (j = 0; j < map->n; ++j) {
3861 rest = add_cut_constraint(rest,
3862 map->p[j], bmap->ineq[i], 1+total, 0);
3866 map->p[j] = isl_basic_map_extend(map->p[j],
3867 map->p[j]->nparam, map->p[j]->n_in,
3868 map->p[j]->n_out, 0, 0, 1);
3871 k = isl_basic_map_alloc_inequality(map->p[j]);
3874 isl_seq_cpy(map->p[j]->ineq[k], bmap->ineq[i], 1+total);
3875 isl_seq_clr(map->p[j]->ineq[k]+1+total,
3876 map->p[j]->extra - bmap->n_div);
3888 struct isl_map *isl_map_subtract(struct isl_map *map1, struct isl_map *map2)
3894 isl_assert(map1->ctx, map1->nparam == map2->nparam, goto error);
3895 isl_assert(map1->ctx, map1->n_in == map2->n_in, goto error);
3896 isl_assert(map1->ctx, map1->n_out == map2->n_out, goto error);
3898 if (isl_map_is_empty(map2)) {
3903 map1 = isl_map_compute_divs(map1);
3904 map2 = isl_map_compute_divs(map2);
3908 for (i = 0; map1 && i < map2->n; ++i)
3909 map1 = subtract(map1, map2->p[i]);
3919 struct isl_set *isl_set_subtract(struct isl_set *set1, struct isl_set *set2)
3921 return (struct isl_set *)
3923 (struct isl_map *)set1, (struct isl_map *)set2);
3926 struct isl_set *isl_set_apply(struct isl_set *set, struct isl_map *map)
3930 isl_assert(set->ctx, set->dim == map->n_in, goto error);
3931 map = isl_map_intersect_domain(map, set);
3932 set = isl_map_range(map);
3940 /* There is no need to cow as removing empty parts doesn't change
3941 * the meaning of the set.
3943 struct isl_map *isl_map_remove_empty_parts(struct isl_map *map)
3950 for (i = map->n-1; i >= 0; --i) {
3951 if (!F_ISSET(map->p[i], ISL_BASIC_MAP_EMPTY))
3953 isl_basic_map_free(map->p[i]);
3954 if (i != map->n-1) {
3955 F_CLR(map, ISL_MAP_NORMALIZED);
3956 map->p[i] = map->p[map->n-1];
3964 struct isl_set *isl_set_remove_empty_parts(struct isl_set *set)
3966 return (struct isl_set *)
3967 isl_map_remove_empty_parts((struct isl_map *)set);
3970 struct isl_basic_set *isl_set_copy_basic_set(struct isl_set *set)
3972 struct isl_basic_set *bset;
3973 if (!set || set->n == 0)
3975 bset = set->p[set->n-1];
3976 isl_assert(set->ctx, F_ISSET(bset, ISL_BASIC_SET_FINAL), return NULL);
3977 return isl_basic_set_copy(bset);
3980 struct isl_set *isl_set_drop_basic_set(struct isl_set *set,
3981 struct isl_basic_set *bset)
3987 for (i = set->n-1; i >= 0; --i) {
3988 if (set->p[i] != bset)
3990 set = isl_set_cow(set);
3993 isl_basic_set_free(set->p[i]);
3994 if (i != set->n-1) {
3995 F_CLR(set, ISL_SET_NORMALIZED);
3996 set->p[i] = set->p[set->n-1];
4001 isl_basic_set_free(bset);
4005 isl_basic_set_free(bset);
4009 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
4010 * for any common value of the parameters and dimensions preceding dim
4011 * in both basic sets, the values of dimension pos in bset1 are
4012 * smaller or larger then those in bset2.
4015 * 1 if bset1 follows bset2
4016 * -1 if bset1 precedes bset2
4017 * 0 if bset1 and bset2 are incomparable
4018 * -2 if some error occurred.
4020 int isl_basic_set_compare_at(struct isl_basic_set *bset1,
4021 struct isl_basic_set *bset2, int pos)
4023 struct isl_basic_map *bmap1 = NULL;
4024 struct isl_basic_map *bmap2 = NULL;
4025 struct isl_ctx *ctx;
4026 struct isl_vec *obj;
4029 enum isl_lp_result res;
4032 if (!bset1 || !bset2)
4035 bmap1 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset1),
4036 pos, bset1->dim - pos);
4037 bmap2 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset2),
4038 pos, bset2->dim - pos);
4039 if (!bmap1 || !bmap2)
4041 bmap1 = isl_basic_map_extend(bmap1, bmap1->nparam,
4042 bmap1->n_in, bmap1->n_out + bmap2->n_out,
4043 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
4046 total = bmap1->nparam + bmap1->n_in + bmap1->n_out + bmap1->n_div;
4048 obj = isl_vec_alloc(ctx, total);
4049 isl_seq_clr(obj->block.data, total);
4050 isl_int_set_si(obj->block.data[bmap1->nparam+bmap1->n_in], 1);
4051 isl_int_set_si(obj->block.data[bmap1->nparam+bmap1->n_in+
4052 bmap1->n_out-bmap2->n_out], -1);
4055 bmap1 = add_constraints(bmap1, bmap2, 0, bmap1->n_out - bmap2->n_out);
4058 res = isl_solve_lp(bmap1, 0, obj->block.data, ctx->one, &num, &den);
4059 if (res == isl_lp_empty)
4061 else if (res == isl_lp_ok && isl_int_is_pos(num))
4063 else if ((res == isl_lp_ok && isl_int_is_neg(num)) ||
4064 res == isl_lp_unbounded)
4070 isl_basic_map_free(bmap1);
4071 isl_vec_free(ctx, obj);
4074 isl_basic_map_free(bmap1);
4075 isl_basic_map_free(bmap2);
4079 static int isl_basic_map_fast_has_fixed_var(struct isl_basic_map *bmap,
4080 unsigned pos, isl_int *val)
4088 total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
4089 for (i = 0, d = total-1; i < bmap->n_eq && d+1 > pos; ++i) {
4090 for (; d+1 > pos; --d)
4091 if (!isl_int_is_zero(bmap->eq[i][1+d]))
4095 if (isl_seq_first_non_zero(bmap->eq[i]+1, d) != -1)
4097 if (isl_seq_first_non_zero(bmap->eq[i]+1+d+1, total-d-1) != -1)
4099 if (!isl_int_is_one(bmap->eq[i][1+d]))
4102 isl_int_neg(*val, bmap->eq[i][0]);
4108 static int isl_map_fast_has_fixed_var(struct isl_map *map,
4109 unsigned pos, isl_int *val)
4121 return isl_basic_map_fast_has_fixed_var(map->p[0], pos, val);
4124 fixed = isl_basic_map_fast_has_fixed_var(map->p[0], pos, &v);
4125 for (i = 1; fixed == 1 && i < map->n; ++i) {
4126 fixed = isl_basic_map_fast_has_fixed_var(map->p[i], pos, &tmp);
4127 if (fixed == 1 && isl_int_ne(tmp, v))
4131 isl_int_set(*val, v);
4137 static int isl_set_fast_has_fixed_var(struct isl_set *set, unsigned pos,
4140 return isl_map_fast_has_fixed_var((struct isl_map *)set, pos, val);
4143 /* Check if dimension dim has fixed value and if so and if val is not NULL,
4144 * then return this fixed value in *val.
4146 int isl_set_fast_dim_is_fixed(struct isl_set *set, unsigned dim, isl_int *val)
4148 return isl_set_fast_has_fixed_var(set, set->nparam + dim, val);
4151 /* Check if input variable in has fixed value and if so and if val is not NULL,
4152 * then return this fixed value in *val.
4154 int isl_map_fast_input_is_fixed(struct isl_map *map, unsigned in, isl_int *val)
4156 return isl_map_fast_has_fixed_var(map, map->nparam + in, val);
4159 /* Check if dimension dim has an (obvious) fixed lower bound and if so
4160 * and if val is not NULL, then return this lower bound in *val.
4162 int isl_basic_set_fast_dim_has_fixed_lower_bound(struct isl_basic_set *bset,
4163 unsigned dim, isl_int *val)
4165 int i, i_eq = -1, i_ineq = -1;
4171 total = bset->nparam + bset->dim + bset->n_div;
4172 for (i = 0; i < bset->n_eq; ++i) {
4173 if (isl_int_is_zero(bset->eq[i][1+bset->nparam+dim]))
4179 for (i = 0; i < bset->n_ineq; ++i) {
4180 if (!isl_int_is_pos(bset->ineq[i][1+bset->nparam+dim]))
4182 if (i_eq != -1 || i_ineq != -1)
4186 if (i_eq == -1 && i_ineq == -1)
4188 c = i_eq != -1 ? bset->eq[i_eq] : bset->ineq[i_ineq];
4189 /* The coefficient should always be one due to normalization. */
4190 if (!isl_int_is_one(c[1+bset->nparam+dim]))
4192 if (isl_seq_first_non_zero(c+1, bset->nparam+dim) != -1)
4194 if (isl_seq_first_non_zero(c+1+bset->nparam+dim+1,
4195 total - bset->nparam - dim - 1) != -1)
4198 isl_int_neg(*val, c[0]);
4202 int isl_set_fast_dim_has_fixed_lower_bound(struct isl_set *set,
4203 unsigned dim, isl_int *val)
4215 return isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[0],
4219 fixed = isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[0],
4221 for (i = 1; fixed == 1 && i < set->n; ++i) {
4222 fixed = isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[i],
4224 if (fixed == 1 && isl_int_ne(tmp, v))
4228 isl_int_set(*val, v);
4234 static struct isl_basic_set *isl_basic_set_reduce_using_equalities(
4235 struct isl_basic_set *bset, struct isl_basic_set *context)
4240 if (!bset || !context)
4243 bset = isl_basic_set_cow(bset);
4247 elim = isl_alloc_array(ctx, int, bset->dim);
4250 set_compute_elimination_index(context, elim);
4251 for (i = 0; i < bset->n_eq; ++i)
4252 set_reduced_using_equalities(bset->eq[i], bset->eq[i],
4254 for (i = 0; i < bset->n_ineq; ++i)
4255 set_reduced_using_equalities(bset->ineq[i], bset->ineq[i],
4257 isl_basic_set_free(context);
4259 bset = isl_basic_set_simplify(bset);
4260 bset = isl_basic_set_finalize(bset);
4263 isl_basic_set_free(bset);
4264 isl_basic_set_free(context);
4268 static struct isl_basic_set *remove_shifted_constraints(
4269 struct isl_basic_set *bset, struct isl_basic_set *context)
4279 size = round_up(4 * (context->n_ineq+1) / 3 - 1);
4280 bits = ffs(size) - 1;
4281 index = isl_alloc_array(ctx, isl_int **, size);
4282 memset(index, 0, size * sizeof(isl_int **));
4286 for (k = 0; k < context->n_ineq; ++k) {
4287 h = set_hash_index(index, size, bits, context, k);
4288 index[h] = &context->ineq[k];
4290 for (k = 0; k < bset->n_ineq; ++k) {
4291 h = set_hash_index(index, size, bits, bset, k);
4294 l = index[h] - &context->ineq[0];
4295 if (isl_int_lt(bset->ineq[k][0], context->ineq[l][0]))
4297 bset = isl_basic_set_cow(bset);
4300 isl_basic_set_drop_inequality(bset, k);
4310 /* Remove all information from bset that is redundant in the context
4311 * of context. In particular, equalities that are linear combinations
4312 * of those in context are remobed. Then the inequalities that are
4313 * redundant in the context of the equalities and inequalities of
4314 * context are removed.
4316 static struct isl_basic_set *uset_gist(struct isl_basic_set *bset,
4317 struct isl_basic_set *context)
4321 struct isl_basic_set *combined;
4322 struct isl_ctx *ctx;
4323 enum isl_lp_result res = isl_lp_ok;
4325 if (!bset || !context)
4328 if (context->n_eq > 0) {
4331 struct isl_ctx *ctx = context->ctx;
4332 struct isl_basic_set *reduced_context;
4333 reduced_context = isl_basic_set_remove_equalities(
4334 isl_basic_set_copy(context), &T, &T2);
4335 if (!reduced_context)
4337 bset = isl_basic_set_preimage(ctx, bset, T);
4338 bset = uset_gist(bset, reduced_context);
4339 bset = isl_basic_set_preimage(ctx, bset, T2);
4340 bset = isl_basic_set_reduce_using_equalities(bset, context);
4343 if (!context->n_ineq)
4345 bset = remove_shifted_constraints(bset, context);
4346 combined = isl_basic_set_extend(isl_basic_set_copy(bset),
4347 0, bset->dim, 0, context->n_eq, context->n_ineq);
4348 context = set_add_constraints(combined, context, 0);
4353 for (i = bset->n_ineq-1; i >= 0; --i) {
4354 set_swap_inequality(context, i, context->n_ineq-1);
4356 res = isl_solve_lp((struct isl_basic_map *)context, 0,
4357 context->ineq[context->n_ineq]+1, ctx->one, &opt, NULL);
4359 set_swap_inequality(context, i, context->n_ineq-1);
4360 if (res == isl_lp_unbounded)
4362 if (res == isl_lp_error)
4364 if (res == isl_lp_empty) {
4365 bset = isl_basic_set_set_to_empty(bset);
4368 isl_int_add(opt, opt, context->ineq[i][0]);
4369 if (!isl_int_is_neg(opt)) {
4370 isl_basic_set_drop_inequality(context, i);
4371 isl_basic_set_drop_inequality(bset, i);
4375 if (res == isl_lp_error)
4378 isl_basic_set_free(context);
4381 isl_basic_set_free(context);
4382 isl_basic_set_free(bset);
4386 struct isl_basic_map *isl_basic_map_gist(struct isl_basic_map *bmap,
4387 struct isl_basic_map *context)
4389 struct isl_basic_set *bset;
4391 if (!bmap || !context)
4394 context = isl_basic_map_align_divs(context, bmap);
4395 bmap = isl_basic_map_align_divs(bmap, context);
4397 bset = uset_gist(isl_basic_map_underlying_set(isl_basic_map_copy(bmap)),
4398 isl_basic_map_underlying_set(context));
4400 return isl_basic_map_overlying_set(bset, bmap);
4402 isl_basic_map_free(bmap);
4403 isl_basic_map_free(context);
4407 struct isl_map *isl_map_gist(struct isl_map *map, struct isl_basic_map *context)
4411 map = isl_map_cow(map);
4412 if (!map || !context)
4414 isl_assert(map->ctx, map->nparam == context->nparam, goto error);
4415 isl_assert(map->ctx, map->n_in == context->n_in, goto error);
4416 isl_assert(map->ctx, map->n_out == context->n_out, goto error);
4417 for (i = 0; i < map->n; ++i)
4418 context = isl_basic_map_align_divs(context, map->p[i]);
4419 for (i = 0; i < map->n; ++i) {
4420 map->p[i] = isl_basic_map_gist(map->p[i],
4421 isl_basic_map_copy(context));
4425 isl_basic_map_free(context);
4426 F_CLR(map, ISL_MAP_NORMALIZED);
4430 isl_basic_map_free(context);
4434 struct isl_set *isl_set_gist(struct isl_set *set, struct isl_basic_set *context)
4436 return (struct isl_set *)isl_map_gist((struct isl_map *)set,
4437 (struct isl_basic_map *)context);
4445 static int qsort_constraint_cmp(const void *p1, const void *p2)
4447 const struct constraint *c1 = (const struct constraint *)p1;
4448 const struct constraint *c2 = (const struct constraint *)p2;
4449 unsigned size = isl_min(c1->size, c2->size);
4450 return isl_seq_cmp(c1->c, c2->c, size);
4453 static struct isl_basic_map *isl_basic_map_sort_constraints(
4454 struct isl_basic_map *bmap)
4457 struct constraint *c;
4462 total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
4463 c = isl_alloc_array(bmap->ctx, struct constraint, bmap->n_ineq);
4466 for (i = 0; i < bmap->n_ineq; ++i) {
4468 c[i].c = bmap->ineq[i];
4470 qsort(c, bmap->n_ineq, sizeof(struct constraint), qsort_constraint_cmp);
4471 for (i = 0; i < bmap->n_ineq; ++i)
4472 bmap->ineq[i] = c[i].c;
4476 isl_basic_map_free(bmap);
4480 struct isl_basic_map *isl_basic_map_normalize(struct isl_basic_map *bmap)
4484 if (F_ISSET(bmap, ISL_BASIC_MAP_NORMALIZED))
4486 bmap = isl_basic_map_convex_hull(bmap);
4487 bmap = isl_basic_map_sort_constraints(bmap);
4488 F_SET(bmap, ISL_BASIC_MAP_NORMALIZED);
4492 static int isl_basic_map_fast_cmp(const struct isl_basic_map *bmap1,
4493 const struct isl_basic_map *bmap2)
4500 if (bmap1->nparam != bmap2->nparam)
4501 return bmap1->nparam - bmap2->nparam;
4502 if (bmap1->n_in != bmap2->n_in)
4503 return bmap1->n_in - bmap2->n_in;
4504 if (bmap1->n_out != bmap2->n_out)
4505 return bmap1->n_out - bmap2->n_out;
4506 if (F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY) &&
4507 F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
4509 if (F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY))
4511 if (F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
4513 if (bmap1->n_eq != bmap2->n_eq)
4514 return bmap1->n_eq - bmap2->n_eq;
4515 if (bmap1->n_ineq != bmap2->n_ineq)
4516 return bmap1->n_ineq - bmap2->n_ineq;
4517 if (bmap1->n_div != bmap2->n_div)
4518 return bmap1->n_div - bmap2->n_div;
4519 total = bmap1->nparam + bmap1->n_in + bmap1->n_out + bmap1->n_div;
4520 for (i = 0; i < bmap1->n_eq; ++i) {
4521 cmp = isl_seq_cmp(bmap1->eq[i], bmap2->eq[i], 1+total);
4525 for (i = 0; i < bmap1->n_ineq; ++i) {
4526 cmp = isl_seq_cmp(bmap1->ineq[i], bmap2->ineq[i], 1+total);
4530 for (i = 0; i < bmap1->n_div; ++i) {
4531 cmp = isl_seq_cmp(bmap1->div[i], bmap2->div[i], 1+1+total);
4538 static int isl_basic_map_fast_is_equal(struct isl_basic_map *bmap1,
4539 struct isl_basic_map *bmap2)
4541 return isl_basic_map_fast_cmp(bmap1, bmap2) == 0;
4544 static int qsort_bmap_cmp(const void *p1, const void *p2)
4546 const struct isl_basic_map *bmap1 = *(const struct isl_basic_map **)p1;
4547 const struct isl_basic_map *bmap2 = *(const struct isl_basic_map **)p2;
4549 return isl_basic_map_fast_cmp(bmap1, bmap2);
4552 /* We normalize in place, but if anything goes wrong we need
4553 * to return NULL, so we need to make sure we don't change the
4554 * meaning of any possible other copies of map.
4556 struct isl_map *isl_map_normalize(struct isl_map *map)
4559 struct isl_basic_map *bmap;
4563 if (F_ISSET(map, ISL_MAP_NORMALIZED))
4565 for (i = 0; i < map->n; ++i) {
4566 bmap = isl_basic_map_normalize(isl_basic_map_copy(map->p[i]));
4569 isl_basic_map_free(map->p[i]);
4572 qsort(map->p, map->n, sizeof(struct isl_basic_map *), qsort_bmap_cmp);
4573 F_SET(map, ISL_MAP_NORMALIZED);
4574 map = isl_map_remove_empty_parts(map);
4577 for (i = map->n - 1; i >= 1; --i) {
4578 if (!isl_basic_map_fast_is_equal(map->p[i-1], map->p[i]))
4580 isl_basic_map_free(map->p[i-1]);
4581 for (j = i; j < map->n; ++j)
4582 map->p[j-1] = map->p[j];
4592 struct isl_set *isl_set_normalize(struct isl_set *set)
4594 return (struct isl_set *)isl_map_normalize((struct isl_map *)set);
4597 int isl_map_fast_is_equal(struct isl_map *map1, struct isl_map *map2)
4607 if (map1->nparam != map2->nparam)
4609 if (map1->n_in != map2->n_in)
4611 if (map1->n_out != map2->n_out)
4614 map1 = isl_map_copy(map1);
4615 map2 = isl_map_copy(map2);
4616 map1 = isl_map_normalize(map1);
4617 map2 = isl_map_normalize(map2);
4620 equal = map1->n == map2->n;
4621 for (i = 0; equal && i < map1->n; ++i) {
4622 equal = isl_basic_map_fast_is_equal(map1->p[i], map2->p[i]);
4635 int isl_set_fast_is_equal(struct isl_set *set1, struct isl_set *set2)
4637 return isl_map_fast_is_equal((struct isl_map *)set1,
4638 (struct isl_map *)set2);
4641 /* Return an interval that ranges from min to max (inclusive)
4643 struct isl_basic_set *isl_basic_set_interval(struct isl_ctx *ctx,
4644 isl_int min, isl_int max)
4647 struct isl_basic_set *bset = NULL;
4649 bset = isl_basic_set_alloc(ctx, 0, 1, 0, 0, 2);
4653 k = isl_basic_set_alloc_inequality(bset);
4656 isl_int_set_si(bset->ineq[k][1], 1);
4657 isl_int_neg(bset->ineq[k][0], min);
4659 k = isl_basic_set_alloc_inequality(bset);
4662 isl_int_set_si(bset->ineq[k][1], -1);
4663 isl_int_set(bset->ineq[k][0], max);
4667 isl_basic_set_free(bset);
4671 /* Return the Cartesian product of the basic sets in list (in the given order).
4673 struct isl_basic_set *isl_basic_set_product(struct isl_basic_set_list *list)
4681 struct isl_basic_set *product = NULL;
4685 isl_assert(list->ctx, list->n > 0, goto error);
4686 isl_assert(list->ctx, list->p[0], goto error);
4687 nparam = list->p[0]->nparam;
4688 dim = list->p[0]->dim;
4689 extra = list->p[0]->n_div;
4690 n_eq = list->p[0]->n_eq;
4691 n_ineq = list->p[0]->n_ineq;
4692 for (i = 1; i < list->n; ++i) {
4693 isl_assert(list->ctx, list->p[i], goto error);
4694 isl_assert(list->ctx, nparam == list->p[i]->nparam, goto error);
4695 dim += list->p[i]->dim;
4696 extra += list->p[i]->n_div;
4697 n_eq += list->p[i]->n_eq;
4698 n_ineq += list->p[i]->n_ineq;
4700 product = isl_basic_set_alloc(list->ctx, nparam, dim, extra,
4705 for (i = 0; i < list->n; ++i) {
4706 set_add_constraints(product,
4707 isl_basic_set_copy(list->p[i]), dim);
4708 dim += list->p[i]->dim;
4710 isl_basic_set_list_free(list);
4713 isl_basic_set_free(product);
4714 isl_basic_set_list_free(list);