11 #include "isl_map_private.h"
12 #include "isl_map_piplib.h"
13 #include "isl_sample.h"
16 /* Maps dst positions to src positions */
22 static struct isl_dim_map *isl_dim_map_alloc(struct isl_ctx *ctx, unsigned len)
25 struct isl_dim_map *dim_map;
26 dim_map = isl_alloc(ctx, struct isl_dim_map,
27 sizeof(struct isl_dim_map) + len * sizeof(int));
30 dim_map->len = 1 + len;
32 for (i = 0; i < len; ++i)
33 dim_map->pos[1 + i] = -1;
37 static unsigned n(struct isl_dim *dim, enum isl_dim_type type)
40 case isl_dim_param: return dim->nparam;
41 case isl_dim_in: return dim->n_in;
42 case isl_dim_out: return dim->n_out;
46 static unsigned pos(struct isl_dim *dim, enum isl_dim_type type)
49 case isl_dim_param: return 1;
50 case isl_dim_in: return 1 + dim->nparam;
51 case isl_dim_out: return 1 + dim->nparam + dim->n_in;
55 static void isl_dim_map_dim(struct isl_dim_map *dim_map, struct isl_dim *dim,
56 enum isl_dim_type type, unsigned dst_pos)
64 src_pos = pos(dim, type);
65 for (i = 0; i < n(dim, type); ++i)
66 dim_map->pos[1 + dst_pos + i] = src_pos + i;
69 static void isl_dim_map_div(struct isl_dim_map *dim_map,
70 struct isl_basic_map *bmap, unsigned dst_pos)
75 if (!dim_map || !bmap)
78 src_pos = 1 + isl_dim_total(bmap->dim);
79 for (i = 0; i < bmap->n_div; ++i)
80 dim_map->pos[1 + dst_pos + i] = src_pos + i;
83 static void isl_dim_map_dump(struct isl_dim_map *dim_map)
87 for (i = 0; i < dim_map->len; ++i)
88 fprintf(stderr, "%d -> %d; ", i, dim_map->pos[i]);
89 fprintf(stderr, "\n");
92 unsigned isl_basic_map_dim(const struct isl_basic_map *bmap,
93 enum isl_dim_type type)
95 struct isl_dim *dim = bmap->dim;
99 case isl_dim_out: return isl_dim_size(bmap->dim, type);
100 case isl_dim_div: return bmap->n_div;
101 case isl_dim_all: return isl_basic_map_total_dim(bmap);
105 unsigned isl_map_dim(const struct isl_map *map, enum isl_dim_type type)
107 return n(map->dim, type);
110 unsigned isl_basic_map_offset(struct isl_basic_map *bmap,
111 enum isl_dim_type type)
113 struct isl_dim *dim = bmap->dim;
115 case isl_dim_param: return 1;
116 case isl_dim_in: return 1 + dim->nparam;
117 case isl_dim_out: return 1 + dim->nparam + dim->n_in;
118 case isl_dim_div: return 1 + dim->nparam + dim->n_in + dim->n_out;
122 static unsigned map_offset(struct isl_map *map, enum isl_dim_type type)
124 return pos(map->dim, type);
127 unsigned isl_basic_set_dim(const struct isl_basic_set *bset,
128 enum isl_dim_type type)
130 return isl_basic_map_dim((const struct isl_basic_map*)bset, type);
133 unsigned isl_basic_set_n_dim(const struct isl_basic_set *bset)
135 return bset->dim->n_out;
138 unsigned isl_basic_set_n_param(const struct isl_basic_set *bset)
140 return bset->dim->nparam;
143 unsigned isl_basic_set_total_dim(const struct isl_basic_set *bset)
145 return isl_dim_total(bset->dim) + bset->n_div;
148 unsigned isl_set_n_dim(const struct isl_set *set)
150 return set->dim->n_out;
153 unsigned isl_set_n_param(const struct isl_set *set)
155 return set->dim->nparam;
158 unsigned isl_basic_map_n_in(const struct isl_basic_map *bmap)
160 return bmap->dim->n_in;
163 unsigned isl_basic_map_n_out(const struct isl_basic_map *bmap)
165 return bmap->dim->n_out;
168 unsigned isl_basic_map_n_param(const struct isl_basic_map *bmap)
170 return bmap->dim->nparam;
173 unsigned isl_basic_map_n_div(const struct isl_basic_map *bmap)
178 unsigned isl_basic_map_total_dim(const struct isl_basic_map *bmap)
180 return isl_dim_total(bmap->dim) + bmap->n_div;
183 unsigned isl_map_n_in(const struct isl_map *map)
185 return map->dim->n_in;
188 unsigned isl_map_n_out(const struct isl_map *map)
190 return map->dim->n_out;
193 unsigned isl_map_n_param(const struct isl_map *map)
195 return map->dim->nparam;
198 int isl_map_compatible_domain(struct isl_map *map, struct isl_set *set)
200 return map->dim->n_in == set->dim->n_out &&
201 map->dim->nparam == set->dim->nparam;
204 int isl_basic_map_compatible_domain(struct isl_basic_map *bmap,
205 struct isl_basic_set *bset)
207 return bmap->dim->n_in == bset->dim->n_out &&
208 bmap->dim->nparam == bset->dim->nparam;
211 int isl_basic_map_compatible_range(struct isl_basic_map *bmap,
212 struct isl_basic_set *bset)
214 return bmap->dim->n_out == bset->dim->n_out &&
215 bmap->dim->nparam == bset->dim->nparam;
218 static struct isl_basic_map *basic_map_init(struct isl_ctx *ctx,
219 struct isl_basic_map *bmap, unsigned extra,
220 unsigned n_eq, unsigned n_ineq)
223 size_t row_size = 1 + isl_dim_total(bmap->dim) + extra;
225 bmap->block = isl_blk_alloc(ctx, (n_eq + n_ineq) * row_size);
226 if (isl_blk_is_error(bmap->block)) {
231 bmap->eq = isl_alloc_array(ctx, isl_int *, n_eq + n_ineq);
233 isl_blk_free(ctx, bmap->block);
239 bmap->block2 = isl_blk_empty();
242 bmap->block2 = isl_blk_alloc(ctx, extra * (1 + row_size));
243 if (isl_blk_is_error(bmap->block2)) {
245 isl_blk_free(ctx, bmap->block);
250 bmap->div = isl_alloc_array(ctx, isl_int *, extra);
252 isl_blk_free(ctx, bmap->block2);
254 isl_blk_free(ctx, bmap->block);
260 for (i = 0; i < n_eq + n_ineq; ++i)
261 bmap->eq[i] = bmap->block.data + i * row_size;
263 for (i = 0; i < extra; ++i)
264 bmap->div[i] = bmap->block2.data + i * (1 + row_size);
270 bmap->c_size = n_eq + n_ineq;
271 bmap->ineq = bmap->eq + n_eq;
280 isl_basic_map_free(bmap);
284 struct isl_basic_set *isl_basic_set_alloc(struct isl_ctx *ctx,
285 unsigned nparam, unsigned dim, unsigned extra,
286 unsigned n_eq, unsigned n_ineq)
288 struct isl_basic_map *bmap;
289 bmap = isl_basic_map_alloc(ctx, nparam, 0, dim, extra, n_eq, n_ineq);
290 return (struct isl_basic_set *)bmap;
293 struct isl_basic_set *isl_basic_set_alloc_dim(struct isl_dim *dim,
294 unsigned extra, unsigned n_eq, unsigned n_ineq)
296 struct isl_basic_map *bmap;
299 isl_assert(dim->ctx, dim->n_in == 0, return NULL);
300 bmap = isl_basic_map_alloc_dim(dim, extra, n_eq, n_ineq);
301 return (struct isl_basic_set *)bmap;
304 struct isl_basic_map *isl_basic_map_alloc_dim(struct isl_dim *dim,
305 unsigned extra, unsigned n_eq, unsigned n_ineq)
307 struct isl_basic_map *bmap;
311 bmap = isl_alloc_type(dim->ctx, struct isl_basic_map);
316 return basic_map_init(dim->ctx, bmap, extra, n_eq, n_ineq);
322 struct isl_basic_map *isl_basic_map_alloc(struct isl_ctx *ctx,
323 unsigned nparam, unsigned in, unsigned out, unsigned extra,
324 unsigned n_eq, unsigned n_ineq)
326 struct isl_basic_map *bmap;
329 dim = isl_dim_alloc(ctx, nparam, in, out);
333 bmap = isl_basic_map_alloc_dim(dim, extra, n_eq, n_ineq);
337 static void dup_constraints(
338 struct isl_basic_map *dst, struct isl_basic_map *src)
341 unsigned total = isl_basic_map_total_dim(src);
343 for (i = 0; i < src->n_eq; ++i) {
344 int j = isl_basic_map_alloc_equality(dst);
345 isl_seq_cpy(dst->eq[j], src->eq[i], 1+total);
348 for (i = 0; i < src->n_ineq; ++i) {
349 int j = isl_basic_map_alloc_inequality(dst);
350 isl_seq_cpy(dst->ineq[j], src->ineq[i], 1+total);
353 for (i = 0; i < src->n_div; ++i) {
354 int j = isl_basic_map_alloc_div(dst);
355 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total);
357 F_SET(dst, ISL_BASIC_SET_FINAL);
360 struct isl_basic_map *isl_basic_map_dup(struct isl_basic_map *bmap)
362 struct isl_basic_map *dup;
366 dup = isl_basic_map_alloc_dim(isl_dim_copy(bmap->dim),
367 bmap->n_div, bmap->n_eq, bmap->n_ineq);
370 dup->flags = bmap->flags;
371 dup_constraints(dup, bmap);
372 dup->sample = isl_vec_copy(bmap->ctx, bmap->sample);
376 struct isl_basic_set *isl_basic_set_dup(struct isl_basic_set *bset)
378 struct isl_basic_map *dup;
380 dup = isl_basic_map_dup((struct isl_basic_map *)bset);
381 return (struct isl_basic_set *)dup;
384 struct isl_basic_set *isl_basic_set_copy(struct isl_basic_set *bset)
389 if (F_ISSET(bset, ISL_BASIC_SET_FINAL)) {
393 return isl_basic_set_dup(bset);
396 struct isl_set *isl_set_copy(struct isl_set *set)
405 struct isl_basic_map *isl_basic_map_copy(struct isl_basic_map *bmap)
410 if (F_ISSET(bmap, ISL_BASIC_SET_FINAL)) {
414 return isl_basic_map_dup(bmap);
417 struct isl_map *isl_map_copy(struct isl_map *map)
426 void isl_basic_map_free(struct isl_basic_map *bmap)
434 isl_ctx_deref(bmap->ctx);
436 isl_blk_free(bmap->ctx, bmap->block2);
438 isl_blk_free(bmap->ctx, bmap->block);
439 isl_vec_free(bmap->ctx, bmap->sample);
440 isl_dim_free(bmap->dim);
444 void isl_basic_set_free(struct isl_basic_set *bset)
446 isl_basic_map_free((struct isl_basic_map *)bset);
449 int isl_basic_map_alloc_equality(struct isl_basic_map *bmap)
455 isl_assert(ctx, bmap->n_eq + bmap->n_ineq < bmap->c_size, return -1);
456 isl_assert(ctx, bmap->eq + bmap->n_eq <= bmap->ineq, return -1);
457 if (bmap->eq + bmap->n_eq == bmap->ineq) {
459 int j = isl_basic_map_alloc_inequality(bmap);
463 bmap->ineq[0] = bmap->ineq[j];
468 isl_seq_clr(bmap->eq[bmap->n_eq] +
469 1 + isl_basic_map_total_dim(bmap),
470 bmap->extra - bmap->n_div);
471 F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
475 int isl_basic_set_alloc_equality(struct isl_basic_set *bset)
477 return isl_basic_map_alloc_equality((struct isl_basic_map *)bset);
480 int isl_basic_map_free_equality(struct isl_basic_map *bmap, unsigned n)
484 isl_assert(bmap->ctx, n <= bmap->n_eq, return -1);
489 int isl_basic_map_drop_equality(struct isl_basic_map *bmap, unsigned pos)
494 isl_assert(bmap->ctx, pos < bmap->n_eq, return -1);
496 if (pos != bmap->n_eq - 1) {
498 bmap->eq[pos] = bmap->eq[bmap->n_eq - 1];
499 bmap->eq[bmap->n_eq - 1] = t;
505 int isl_basic_set_drop_equality(struct isl_basic_set *bset, unsigned pos)
507 return isl_basic_map_drop_equality((struct isl_basic_map *)bset, pos);
510 void isl_basic_map_inequality_to_equality(
511 struct isl_basic_map *bmap, unsigned pos)
516 bmap->ineq[pos] = bmap->ineq[0];
517 bmap->ineq[0] = bmap->eq[bmap->n_eq];
518 bmap->eq[bmap->n_eq] = t;
522 F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
523 F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
526 int isl_basic_map_alloc_inequality(struct isl_basic_map *bmap)
532 isl_assert(ctx, (bmap->ineq - bmap->eq) + bmap->n_ineq < bmap->c_size,
534 F_CLR(bmap, ISL_BASIC_MAP_NO_IMPLICIT);
535 F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
536 F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
537 isl_seq_clr(bmap->ineq[bmap->n_ineq] +
538 1 + isl_basic_map_total_dim(bmap),
539 bmap->extra - bmap->n_div);
540 return bmap->n_ineq++;
543 int isl_basic_set_alloc_inequality(struct isl_basic_set *bset)
545 return isl_basic_map_alloc_inequality((struct isl_basic_map *)bset);
548 int isl_basic_map_free_inequality(struct isl_basic_map *bmap, unsigned n)
552 isl_assert(bmap->ctx, n <= bmap->n_ineq, return -1);
557 int isl_basic_set_free_inequality(struct isl_basic_set *bset, unsigned n)
559 return isl_basic_map_free_inequality((struct isl_basic_map *)bset, n);
562 int isl_basic_map_drop_inequality(struct isl_basic_map *bmap, unsigned pos)
567 isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
569 if (pos != bmap->n_ineq - 1) {
571 bmap->ineq[pos] = bmap->ineq[bmap->n_ineq - 1];
572 bmap->ineq[bmap->n_ineq - 1] = t;
573 F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
579 int isl_basic_set_drop_inequality(struct isl_basic_set *bset, unsigned pos)
581 return isl_basic_map_drop_inequality((struct isl_basic_map *)bset, pos);
584 int isl_basic_map_alloc_div(struct isl_basic_map *bmap)
588 isl_assert(bmap->ctx, bmap->n_div < bmap->extra, return -1);
589 isl_seq_clr(bmap->div[bmap->n_div] +
590 1 + 1 + isl_basic_map_total_dim(bmap),
591 bmap->extra - bmap->n_div);
592 F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
593 return bmap->n_div++;
596 int isl_basic_map_free_div(struct isl_basic_map *bmap, unsigned n)
600 isl_assert(bmap->ctx, n <= bmap->n_div, return -1);
605 /* Copy constraint from src to dst, putting the vars of src at offset
606 * dim_off in dst and the divs of src at offset div_off in dst.
607 * If both sets are actually map, then dim_off applies to the input
610 static void copy_constraint(struct isl_basic_map *dst_map, isl_int *dst,
611 struct isl_basic_map *src_map, isl_int *src,
612 unsigned in_off, unsigned out_off, unsigned div_off)
614 unsigned src_nparam = isl_basic_map_n_param(src_map);
615 unsigned dst_nparam = isl_basic_map_n_param(dst_map);
616 unsigned src_in = isl_basic_map_n_in(src_map);
617 unsigned dst_in = isl_basic_map_n_in(dst_map);
618 unsigned src_out = isl_basic_map_n_out(src_map);
619 unsigned dst_out = isl_basic_map_n_out(dst_map);
620 isl_int_set(dst[0], src[0]);
621 isl_seq_cpy(dst+1, src+1, isl_min(dst_nparam, src_nparam));
622 if (dst_nparam > src_nparam)
623 isl_seq_clr(dst+1+src_nparam,
624 dst_nparam - src_nparam);
625 isl_seq_clr(dst+1+dst_nparam, in_off);
626 isl_seq_cpy(dst+1+dst_nparam+in_off,
628 isl_min(dst_in-in_off, src_in));
629 if (dst_in-in_off > src_in)
630 isl_seq_clr(dst+1+dst_nparam+in_off+src_in,
631 dst_in - in_off - src_in);
632 isl_seq_clr(dst+1+dst_nparam+dst_in, out_off);
633 isl_seq_cpy(dst+1+dst_nparam+dst_in+out_off,
634 src+1+src_nparam+src_in,
635 isl_min(dst_out-out_off, src_out));
636 if (dst_out-out_off > src_out)
637 isl_seq_clr(dst+1+dst_nparam+dst_in+out_off+src_out,
638 dst_out - out_off - src_out);
639 isl_seq_clr(dst+1+dst_nparam+dst_in+dst_out, div_off);
640 isl_seq_cpy(dst+1+dst_nparam+dst_in+dst_out+div_off,
641 src+1+src_nparam+src_in+src_out,
642 isl_min(dst_map->extra-div_off, src_map->n_div));
643 if (dst_map->n_div-div_off > src_map->n_div)
644 isl_seq_clr(dst+1+dst_nparam+dst_in+dst_out+
645 div_off+src_map->n_div,
646 dst_map->n_div - div_off - src_map->n_div);
649 static void copy_div(struct isl_basic_map *dst_map, isl_int *dst,
650 struct isl_basic_map *src_map, isl_int *src,
651 unsigned in_off, unsigned out_off, unsigned div_off)
653 isl_int_set(dst[0], src[0]);
654 copy_constraint(dst_map, dst+1, src_map, src+1, in_off, out_off, div_off);
657 static struct isl_basic_map *add_constraints(struct isl_basic_map *bmap1,
658 struct isl_basic_map *bmap2, unsigned i_pos, unsigned o_pos)
663 if (!bmap1 || !bmap2)
666 div_off = bmap1->n_div;
668 for (i = 0; i < bmap2->n_eq; ++i) {
669 int i1 = isl_basic_map_alloc_equality(bmap1);
672 copy_constraint(bmap1, bmap1->eq[i1], bmap2, bmap2->eq[i],
673 i_pos, o_pos, div_off);
676 for (i = 0; i < bmap2->n_ineq; ++i) {
677 int i1 = isl_basic_map_alloc_inequality(bmap1);
680 copy_constraint(bmap1, bmap1->ineq[i1], bmap2, bmap2->ineq[i],
681 i_pos, o_pos, div_off);
684 for (i = 0; i < bmap2->n_div; ++i) {
685 int i1 = isl_basic_map_alloc_div(bmap1);
688 copy_div(bmap1, bmap1->div[i1], bmap2, bmap2->div[i],
689 i_pos, o_pos, div_off);
692 isl_basic_map_free(bmap2);
697 isl_basic_map_free(bmap1);
698 isl_basic_map_free(bmap2);
702 static void copy_constraint_dim_map(isl_int *dst, isl_int *src,
703 struct isl_dim_map *dim_map)
707 for (i = 0; i < dim_map->len; ++i) {
708 if (dim_map->pos[i] < 0)
709 isl_int_set_si(dst[i], 0);
711 isl_int_set(dst[i], src[dim_map->pos[i]]);
715 static void copy_div_dim_map(isl_int *dst, isl_int *src,
716 struct isl_dim_map *dim_map)
718 isl_int_set(dst[0], src[0]);
719 copy_constraint_dim_map(dst+1, src+1, dim_map);
722 static struct isl_basic_map *add_constraints_dim_map(struct isl_basic_map *dst,
723 struct isl_basic_map *src, struct isl_dim_map *dim_map)
727 if (!src || !dst || !dim_map)
730 for (i = 0; i < src->n_eq; ++i) {
731 int i1 = isl_basic_map_alloc_equality(dst);
734 copy_constraint_dim_map(dst->eq[i1], src->eq[i], dim_map);
737 for (i = 0; i < src->n_ineq; ++i) {
738 int i1 = isl_basic_map_alloc_inequality(dst);
741 copy_constraint_dim_map(dst->ineq[i1], src->ineq[i], dim_map);
744 for (i = 0; i < src->n_div; ++i) {
745 int i1 = isl_basic_map_alloc_div(dst);
748 copy_div_dim_map(dst->div[i1], src->div[i], dim_map);
752 isl_basic_map_free(src);
757 isl_basic_map_free(src);
758 isl_basic_map_free(dst);
762 struct isl_basic_set *isl_basic_set_add_constraints(struct isl_basic_set *bset1,
763 struct isl_basic_set *bset2, unsigned pos)
765 return (struct isl_basic_set *)
766 add_constraints((struct isl_basic_map *)bset1,
767 (struct isl_basic_map *)bset2, 0, pos);
770 struct isl_basic_map *isl_basic_map_extend_dim(struct isl_basic_map *base,
771 struct isl_dim *dim, unsigned extra,
772 unsigned n_eq, unsigned n_ineq)
774 struct isl_basic_map *ext;
781 base = isl_basic_map_cow(base);
785 dims_ok = isl_dim_equal(base->dim, dim) &&
786 base->extra >= base->n_div + extra;
788 if (dims_ok && n_eq == 0 && n_ineq == 0) {
793 isl_assert(base->ctx, base->dim->nparam <= dim->nparam, goto error);
794 isl_assert(base->ctx, base->dim->n_in <= dim->n_in, goto error);
795 isl_assert(base->ctx, base->dim->n_out <= dim->n_out, goto error);
796 extra += base->extra;
798 n_ineq += base->n_ineq;
800 ext = isl_basic_map_alloc_dim(dim, extra, n_eq, n_ineq);
806 ext = add_constraints(ext, base, 0, 0);
809 F_CLR(ext, ISL_BASIC_SET_FINAL);
816 isl_basic_map_free(base);
820 struct isl_basic_map *isl_basic_map_extend_constraints(
821 struct isl_basic_map *base, unsigned n_eq, unsigned n_ineq)
825 return isl_basic_map_extend_dim(base, isl_dim_copy(base->dim),
829 struct isl_basic_map *isl_basic_map_extend(struct isl_basic_map *base,
830 unsigned nparam, unsigned n_in, unsigned n_out, unsigned extra,
831 unsigned n_eq, unsigned n_ineq)
833 struct isl_basic_map *bmap;
838 dim = isl_dim_alloc(base->ctx, nparam, n_in, n_out);
842 bmap = isl_basic_map_extend_dim(base, dim, extra, n_eq, n_ineq);
846 struct isl_basic_set *isl_basic_set_extend(struct isl_basic_set *base,
847 unsigned nparam, unsigned dim, unsigned extra,
848 unsigned n_eq, unsigned n_ineq)
850 return (struct isl_basic_set *)
851 isl_basic_map_extend((struct isl_basic_map *)base,
852 nparam, 0, dim, extra, n_eq, n_ineq);
855 struct isl_basic_set *isl_basic_set_extend_constraints(
856 struct isl_basic_set *base, unsigned n_eq, unsigned n_ineq)
858 return (struct isl_basic_set *)
859 isl_basic_map_extend_constraints((struct isl_basic_map *)base,
863 struct isl_basic_set *isl_basic_set_cow(struct isl_basic_set *bset)
865 return (struct isl_basic_set *)
866 isl_basic_map_cow((struct isl_basic_map *)bset);
869 struct isl_basic_map *isl_basic_map_cow(struct isl_basic_map *bmap)
876 bmap = isl_basic_map_dup(bmap);
878 F_CLR(bmap, ISL_BASIC_SET_FINAL);
882 struct isl_set *isl_set_cow(struct isl_set *set)
890 return isl_set_dup(set);
893 struct isl_map *isl_map_cow(struct isl_map *map)
901 return isl_map_dup(map);
904 static void swap_vars(struct isl_blk blk, isl_int *a,
905 unsigned a_len, unsigned b_len)
907 isl_seq_cpy(blk.data, a+a_len, b_len);
908 isl_seq_cpy(blk.data+b_len, a, a_len);
909 isl_seq_cpy(a, blk.data, b_len+a_len);
912 struct isl_basic_set *isl_basic_set_swap_vars(
913 struct isl_basic_set *bset, unsigned n)
923 nparam = isl_basic_set_n_param(bset);
924 dim = isl_basic_set_n_dim(bset);
925 isl_assert(bset->ctx, n <= dim, goto error);
930 bset = isl_basic_set_cow(bset);
934 blk = isl_blk_alloc(bset->ctx, dim);
935 if (isl_blk_is_error(blk))
938 for (i = 0; i < bset->n_eq; ++i)
940 bset->eq[i]+1+nparam, n, dim - n);
942 for (i = 0; i < bset->n_ineq; ++i)
944 bset->ineq[i]+1+nparam, n, dim - n);
946 for (i = 0; i < bset->n_div; ++i)
948 bset->div[i]+1+1+nparam, n, dim - n);
950 isl_blk_free(bset->ctx, blk);
952 F_CLR(bset, ISL_BASIC_SET_NORMALIZED);
956 isl_basic_set_free(bset);
960 struct isl_set *isl_set_swap_vars(struct isl_set *set, unsigned n)
963 set = isl_set_cow(set);
967 for (i = 0; i < set->n; ++i) {
968 set->p[i] = isl_basic_set_swap_vars(set->p[i], n);
974 F_CLR(set, ISL_SET_NORMALIZED);
978 struct isl_basic_map *isl_basic_map_set_to_empty(struct isl_basic_map *bmap)
984 total = isl_basic_map_total_dim(bmap);
985 isl_basic_map_free_div(bmap, bmap->n_div);
986 isl_basic_map_free_inequality(bmap, bmap->n_ineq);
988 isl_basic_map_free_equality(bmap, bmap->n_eq-1);
990 isl_basic_map_alloc_equality(bmap);
994 isl_int_set_si(bmap->eq[i][0], 1);
995 isl_seq_clr(bmap->eq[i]+1, total);
996 F_SET(bmap, ISL_BASIC_MAP_EMPTY);
997 return isl_basic_map_finalize(bmap);
999 isl_basic_map_free(bmap);
1003 struct isl_basic_set *isl_basic_set_set_to_empty(struct isl_basic_set *bset)
1005 return (struct isl_basic_set *)
1006 isl_basic_map_set_to_empty((struct isl_basic_map *)bset);
1009 static void swap_div(struct isl_basic_map *bmap, int a, int b)
1012 unsigned off = isl_dim_total(bmap->dim);
1013 isl_int *t = bmap->div[a];
1014 bmap->div[a] = bmap->div[b];
1017 for (i = 0; i < bmap->n_eq; ++i)
1018 isl_int_swap(bmap->eq[i][1+off+a], bmap->eq[i][1+off+b]);
1020 for (i = 0; i < bmap->n_ineq; ++i)
1021 isl_int_swap(bmap->ineq[i][1+off+a], bmap->ineq[i][1+off+b]);
1023 for (i = 0; i < bmap->n_div; ++i)
1024 isl_int_swap(bmap->div[i][1+1+off+a], bmap->div[i][1+1+off+b]);
1025 F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1028 /* Eliminate the specified n dimensions starting at first from the
1029 * constraints using Fourier-Motzkin, The dimensions themselves
1032 struct isl_set *isl_set_eliminate_dims(struct isl_set *set,
1033 unsigned first, unsigned n)
1043 set = isl_set_cow(set);
1046 isl_assert(set->ctx, first+n <= isl_set_n_dim(set), goto error);
1047 nparam = isl_set_n_param(set);
1049 for (i = 0; i < set->n; ++i) {
1050 set->p[i] = isl_basic_set_eliminate_vars(set->p[i],
1061 /* Project out n dimensions starting at first using Fourier-Motzkin */
1062 struct isl_set *isl_set_remove_dims(struct isl_set *set,
1063 unsigned first, unsigned n)
1065 set = isl_set_eliminate_dims(set, first, n);
1066 set = isl_set_drop_dims(set, first, n);
1070 struct isl_basic_set *isl_basic_set_remove_divs(struct isl_basic_set *bset)
1072 bset = isl_basic_set_eliminate_vars(bset, isl_dim_total(bset->dim),
1080 struct isl_set *isl_set_remove_divs(struct isl_set *set)
1089 set = isl_set_cow(set);
1093 for (i = 0; i < set->n; ++i) {
1094 set->p[i] = isl_basic_set_remove_divs(set->p[i]);
1104 struct isl_basic_map *isl_basic_map_remove(struct isl_basic_map *bmap,
1105 enum isl_dim_type type, unsigned first, unsigned n)
1109 isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
1113 bmap = isl_basic_map_eliminate_vars(bmap,
1114 isl_basic_map_offset(bmap, type) - 1 + first, n);
1115 bmap = isl_basic_map_drop(bmap, type, first, n);
1118 isl_basic_map_free(bmap);
1122 /* Project out n inputs starting at first using Fourier-Motzkin */
1123 struct isl_map *isl_map_remove_inputs(struct isl_map *map,
1124 unsigned first, unsigned n)
1132 map = isl_map_cow(map);
1135 nparam = isl_map_n_param(map);
1136 isl_assert(map->ctx, first+n <= isl_map_n_in(map), goto error);
1138 for (i = 0; i < map->n; ++i) {
1139 map->p[i] = isl_basic_map_eliminate_vars(map->p[i],
1144 map = isl_map_drop_inputs(map, first, n);
1151 /* Project out n dimensions starting at first using Fourier-Motzkin */
1152 struct isl_basic_set *isl_basic_set_remove_dims(struct isl_basic_set *bset,
1153 unsigned first, unsigned n)
1155 unsigned nparam = isl_basic_set_n_param(bset);
1156 bset = isl_basic_set_eliminate_vars(bset, nparam + first, n);
1157 bset = isl_basic_set_drop_dims(bset, first, n);
1161 static void dump_term(struct isl_basic_map *bmap,
1162 isl_int c, int pos, FILE *out)
1165 unsigned in = isl_basic_map_n_in(bmap);
1166 unsigned dim = in + isl_basic_map_n_out(bmap);
1167 unsigned nparam = isl_basic_map_n_param(bmap);
1169 isl_int_print(out, c, 0);
1171 if (!isl_int_is_one(c))
1172 isl_int_print(out, c, 0);
1173 if (pos < 1 + nparam) {
1174 name = isl_dim_get_name(bmap->dim,
1175 isl_dim_param, pos - 1);
1177 fprintf(out, "%s", name);
1179 fprintf(out, "p%d", pos - 1);
1180 } else if (pos < 1 + nparam + in)
1181 fprintf(out, "i%d", pos - 1 - nparam);
1182 else if (pos < 1 + nparam + dim)
1183 fprintf(out, "o%d", pos - 1 - nparam - in);
1185 fprintf(out, "e%d", pos - 1 - nparam - dim);
1189 static void dump_constraint_sign(struct isl_basic_map *bmap, isl_int *c,
1190 int sign, FILE *out)
1194 unsigned len = 1 + isl_basic_map_total_dim(bmap);
1198 for (i = 0, first = 1; i < len; ++i) {
1199 if (isl_int_sgn(c[i]) * sign <= 0)
1202 fprintf(out, " + ");
1204 isl_int_abs(v, c[i]);
1205 dump_term(bmap, v, i, out);
1212 static void dump_constraint(struct isl_basic_map *bmap, isl_int *c,
1213 const char *op, FILE *out, int indent)
1217 fprintf(out, "%*s", indent, "");
1219 dump_constraint_sign(bmap, c, 1, out);
1220 fprintf(out, " %s ", op);
1221 dump_constraint_sign(bmap, c, -1, out);
1225 for (i = bmap->n_div; i < bmap->extra; ++i) {
1226 if (isl_int_is_zero(c[1+isl_dim_total(bmap->dim)+i]))
1228 fprintf(out, "%*s", indent, "");
1229 fprintf(out, "ERROR: unused div coefficient not zero\n");
1234 static void dump_constraints(struct isl_basic_map *bmap,
1235 isl_int **c, unsigned n,
1236 const char *op, FILE *out, int indent)
1240 for (i = 0; i < n; ++i)
1241 dump_constraint(bmap, c[i], op, out, indent);
1244 static void dump_affine(struct isl_basic_map *bmap, isl_int *exp, FILE *out)
1248 unsigned total = isl_basic_map_total_dim(bmap);
1250 for (j = 0; j < 1 + total; ++j) {
1251 if (isl_int_is_zero(exp[j]))
1253 if (!first && isl_int_is_pos(exp[j]))
1255 dump_term(bmap, exp[j], j, out);
1260 static void dump(struct isl_basic_map *bmap, FILE *out, int indent)
1264 dump_constraints(bmap, bmap->eq, bmap->n_eq, "=", out, indent);
1265 dump_constraints(bmap, bmap->ineq, bmap->n_ineq, ">=", out, indent);
1267 for (i = 0; i < bmap->n_div; ++i) {
1268 fprintf(out, "%*s", indent, "");
1269 fprintf(out, "e%d = [(", i);
1270 dump_affine(bmap, bmap->div[i]+1, out);
1272 isl_int_print(out, bmap->div[i][0], 0);
1273 fprintf(out, "]\n");
1277 void isl_basic_set_dump(struct isl_basic_set *bset, FILE *out, int indent)
1280 fprintf(out, "null basic set\n");
1284 fprintf(out, "%*s", indent, "");
1285 fprintf(out, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n",
1286 bset->ref, bset->dim->nparam, bset->dim->n_out,
1287 bset->extra, bset->flags);
1288 dump((struct isl_basic_map *)bset, out, indent);
1291 void isl_basic_map_dump(struct isl_basic_map *bmap, FILE *out, int indent)
1294 fprintf(out, "null basic map\n");
1298 fprintf(out, "%*s", indent, "");
1299 fprintf(out, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, "
1300 "flags: %x, n_name: %d\n",
1302 bmap->dim->nparam, bmap->dim->n_in, bmap->dim->n_out,
1303 bmap->extra, bmap->flags, bmap->dim->n_name);
1304 dump(bmap, out, indent);
1307 int isl_inequality_negate(struct isl_basic_map *bmap, unsigned pos)
1312 total = isl_basic_map_total_dim(bmap);
1313 isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
1314 isl_seq_neg(bmap->ineq[pos], bmap->ineq[pos], 1 + total);
1315 isl_int_sub_ui(bmap->ineq[pos][0], bmap->ineq[pos][0], 1);
1316 F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1320 struct isl_set *isl_set_alloc_dim(struct isl_dim *dim, int n, unsigned flags)
1322 struct isl_set *set;
1326 isl_assert(dim->ctx, dim->n_in == 0, return NULL);
1327 isl_assert(dim->ctx, n >= 0, return NULL);
1328 set = isl_alloc(dim->ctx, struct isl_set,
1329 sizeof(struct isl_set) +
1330 n * sizeof(struct isl_basic_set *));
1334 set->ctx = dim->ctx;
1335 isl_ctx_ref(set->ctx);
1347 struct isl_set *isl_set_alloc(struct isl_ctx *ctx,
1348 unsigned nparam, unsigned dim, int n, unsigned flags)
1350 struct isl_set *set;
1351 struct isl_dim *dims;
1353 dims = isl_dim_alloc(ctx, nparam, 0, dim);
1357 set = isl_set_alloc_dim(dims, n, flags);
1361 struct isl_set *isl_set_dup(struct isl_set *set)
1364 struct isl_set *dup;
1369 dup = isl_set_alloc_dim(isl_dim_copy(set->dim), set->n, set->flags);
1372 for (i = 0; i < set->n; ++i)
1373 dup = isl_set_add(dup, isl_basic_set_copy(set->p[i]));
1377 struct isl_set *isl_set_from_basic_set(struct isl_basic_set *bset)
1379 struct isl_set *set;
1384 set = isl_set_alloc_dim(isl_dim_copy(bset->dim), 1, ISL_MAP_DISJOINT);
1386 isl_basic_set_free(bset);
1389 return isl_set_add(set, bset);
1392 struct isl_map *isl_map_from_basic_map(struct isl_basic_map *bmap)
1394 struct isl_map *map;
1399 map = isl_map_alloc_dim(isl_dim_copy(bmap->dim), 1, ISL_MAP_DISJOINT);
1401 isl_basic_map_free(bmap);
1404 return isl_map_add(map, bmap);
1407 struct isl_set *isl_set_add(struct isl_set *set, struct isl_basic_set *bset)
1411 isl_assert(set->ctx, isl_dim_equal(set->dim, bset->dim), goto error);
1412 isl_assert(set->ctx, set->n < set->size, goto error);
1413 set->p[set->n] = bset;
1420 isl_basic_set_free(bset);
1424 void isl_set_free(struct isl_set *set)
1434 isl_ctx_deref(set->ctx);
1435 for (i = 0; i < set->n; ++i)
1436 isl_basic_set_free(set->p[i]);
1437 isl_dim_free(set->dim);
1441 void isl_set_dump(struct isl_set *set, FILE *out, int indent)
1446 fprintf(out, "null set\n");
1450 fprintf(out, "%*s", indent, "");
1451 fprintf(out, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
1452 set->ref, set->n, set->dim->nparam, set->dim->n_out,
1454 for (i = 0; i < set->n; ++i) {
1455 fprintf(out, "%*s", indent, "");
1456 fprintf(out, "basic set %d:\n", i);
1457 isl_basic_set_dump(set->p[i], out, indent+4);
1461 void isl_map_dump(struct isl_map *map, FILE *out, int indent)
1466 fprintf(out, "null map\n");
1470 fprintf(out, "%*s", indent, "");
1471 fprintf(out, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, "
1472 "flags: %x, n_name: %d\n",
1473 map->ref, map->n, map->dim->nparam, map->dim->n_in,
1474 map->dim->n_out, map->flags, map->dim->n_name);
1475 for (i = 0; i < map->n; ++i) {
1476 fprintf(out, "%*s", indent, "");
1477 fprintf(out, "basic map %d:\n", i);
1478 isl_basic_map_dump(map->p[i], out, indent+4);
1482 struct isl_basic_map *isl_basic_map_intersect_domain(
1483 struct isl_basic_map *bmap, struct isl_basic_set *bset)
1485 struct isl_basic_map *bmap_domain;
1486 struct isl_dim *dim;
1491 isl_assert(bset->ctx, isl_dim_match(bmap->dim, isl_dim_param,
1492 bset->dim, isl_dim_param), goto error);
1494 if (isl_dim_size(bset->dim, isl_dim_set) != 0)
1495 isl_assert(bset->ctx,
1496 isl_basic_map_compatible_domain(bmap, bset), goto error);
1498 bmap = isl_basic_map_extend_dim(bmap, isl_dim_copy(bmap->dim),
1499 bset->n_div, bset->n_eq, bset->n_ineq);
1502 dim = isl_dim_reverse(isl_dim_copy(bset->dim));
1503 bmap_domain = isl_basic_map_from_basic_set(bset, dim);
1504 bmap = add_constraints(bmap, bmap_domain, 0, 0);
1506 bmap = isl_basic_map_simplify(bmap);
1507 return isl_basic_map_finalize(bmap);
1509 isl_basic_map_free(bmap);
1510 isl_basic_set_free(bset);
1514 struct isl_basic_map *isl_basic_map_intersect_range(
1515 struct isl_basic_map *bmap, struct isl_basic_set *bset)
1517 struct isl_basic_map *bmap_range;
1522 isl_assert(bset->ctx, isl_dim_match(bmap->dim, isl_dim_param,
1523 bset->dim, isl_dim_param), goto error);
1525 if (isl_dim_size(bset->dim, isl_dim_set) != 0)
1526 isl_assert(bset->ctx,
1527 isl_basic_map_compatible_range(bmap, bset), goto error);
1529 bmap = isl_basic_map_extend_dim(bmap, isl_dim_copy(bmap->dim),
1530 bset->n_div, bset->n_eq, bset->n_ineq);
1533 bmap_range = isl_basic_map_from_basic_set(bset, isl_dim_copy(bset->dim));
1534 bmap = add_constraints(bmap, bmap_range, 0, 0);
1536 bmap = isl_basic_map_simplify(bmap);
1537 return isl_basic_map_finalize(bmap);
1539 isl_basic_map_free(bmap);
1540 isl_basic_set_free(bset);
1544 struct isl_basic_map *isl_basic_map_intersect(
1545 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
1547 if (!bmap1 || !bmap2)
1550 isl_assert(bmap1->ctx, isl_dim_match(bmap1->dim, isl_dim_param,
1551 bmap2->dim, isl_dim_param), goto error);
1552 if (isl_dim_total(bmap1->dim) ==
1553 isl_dim_size(bmap1->dim, isl_dim_param) &&
1554 isl_dim_total(bmap2->dim) !=
1555 isl_dim_size(bmap2->dim, isl_dim_param))
1556 return isl_basic_map_intersect(bmap2, bmap1);
1558 if (isl_dim_total(bmap2->dim) !=
1559 isl_dim_size(bmap2->dim, isl_dim_param))
1560 isl_assert(bmap1->ctx,
1561 isl_dim_equal(bmap1->dim, bmap2->dim), goto error);
1563 bmap1 = isl_basic_map_extend_dim(bmap1, isl_dim_copy(bmap1->dim),
1564 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
1567 bmap1 = add_constraints(bmap1, bmap2, 0, 0);
1569 bmap1 = isl_basic_map_simplify(bmap1);
1570 return isl_basic_map_finalize(bmap1);
1572 isl_basic_map_free(bmap1);
1573 isl_basic_map_free(bmap2);
1577 struct isl_basic_set *isl_basic_set_intersect(
1578 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
1580 return (struct isl_basic_set *)
1581 isl_basic_map_intersect(
1582 (struct isl_basic_map *)bset1,
1583 (struct isl_basic_map *)bset2);
1586 struct isl_map *isl_map_intersect(struct isl_map *map1, struct isl_map *map2)
1589 struct isl_map *result;
1595 isl_assert(map1->ctx, isl_dim_match(map1->dim, isl_dim_param,
1596 map2->dim, isl_dim_param), goto error);
1597 if (isl_dim_total(map1->dim) ==
1598 isl_dim_size(map1->dim, isl_dim_param) &&
1599 isl_dim_total(map2->dim) != isl_dim_size(map2->dim, isl_dim_param))
1600 return isl_map_intersect(map2, map1);
1602 if (isl_dim_total(map2->dim) != isl_dim_size(map2->dim, isl_dim_param))
1603 isl_assert(map1->ctx,
1604 isl_dim_equal(map1->dim, map2->dim), goto error);
1606 if (F_ISSET(map1, ISL_MAP_DISJOINT) &&
1607 F_ISSET(map2, ISL_MAP_DISJOINT))
1608 FL_SET(flags, ISL_MAP_DISJOINT);
1610 result = isl_map_alloc_dim(isl_dim_copy(map1->dim),
1611 map1->n * map2->n, flags);
1614 for (i = 0; i < map1->n; ++i)
1615 for (j = 0; j < map2->n; ++j) {
1616 struct isl_basic_map *part;
1617 part = isl_basic_map_intersect(
1618 isl_basic_map_copy(map1->p[i]),
1619 isl_basic_map_copy(map2->p[j]));
1620 if (isl_basic_map_is_empty(part))
1621 isl_basic_map_free(part);
1623 result = isl_map_add(result, part);
1636 struct isl_set *isl_set_intersect(struct isl_set *set1, struct isl_set *set2)
1638 return (struct isl_set *)
1639 isl_map_intersect((struct isl_map *)set1,
1640 (struct isl_map *)set2);
1643 struct isl_basic_map *isl_basic_map_reverse(struct isl_basic_map *bmap)
1645 struct isl_dim *dim;
1646 struct isl_basic_set *bset;
1651 bmap = isl_basic_map_cow(bmap);
1654 dim = isl_dim_reverse(isl_dim_copy(bmap->dim));
1655 in = isl_basic_map_n_in(bmap);
1656 bset = isl_basic_set_from_basic_map(bmap);
1657 bset = isl_basic_set_swap_vars(bset, in);
1658 return isl_basic_map_from_basic_set(bset, dim);
1661 /* Turn final n dimensions into existentially quantified variables.
1663 struct isl_basic_set *isl_basic_set_project_out(
1664 struct isl_basic_set *bset, unsigned n, unsigned flags)
1674 isl_assert(bset->ctx, n <= isl_basic_set_n_dim(bset), goto error);
1679 bset = isl_basic_set_cow(bset);
1681 row_size = 1 + isl_dim_total(bset->dim) + bset->extra;
1682 old = bset->block2.data;
1683 bset->block2 = isl_blk_extend(bset->ctx, bset->block2,
1684 (bset->extra + n) * (1 + row_size));
1685 if (!bset->block2.data)
1687 new_div = isl_alloc_array(ctx, isl_int *, bset->extra + n);
1690 for (i = 0; i < n; ++i) {
1691 new_div[i] = bset->block2.data +
1692 (bset->extra + i) * (1 + row_size);
1693 isl_seq_clr(new_div[i], 1 + row_size);
1695 for (i = 0; i < bset->extra; ++i)
1696 new_div[n + i] = bset->block2.data + (bset->div[i] - old);
1698 bset->div = new_div;
1701 bset->dim = isl_dim_drop_outputs(bset->dim,
1702 isl_basic_set_n_dim(bset) - n, n);
1705 bset = isl_basic_set_simplify(bset);
1706 return isl_basic_set_finalize(bset);
1708 isl_basic_set_free(bset);
1712 struct isl_basic_map *add_divs(struct isl_basic_map *bmap, unsigned n)
1716 for (i = 0; i < n; ++i) {
1717 j = isl_basic_map_alloc_div(bmap);
1720 isl_seq_clr(bmap->div[j], 1+1+isl_basic_map_total_dim(bmap));
1724 isl_basic_map_free(bmap);
1728 struct isl_basic_map *isl_basic_map_apply_range(
1729 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
1731 struct isl_dim *dim_result = NULL;
1732 struct isl_basic_map *bmap;
1733 unsigned n_in, n_out, n, nparam, total, pos;
1734 struct isl_dim_map *dim_map1, *dim_map2;
1736 if (!bmap1 || !bmap2)
1739 dim_result = isl_dim_join(isl_dim_copy(bmap1->dim),
1740 isl_dim_copy(bmap2->dim));
1742 n_in = isl_basic_map_n_in(bmap1);
1743 n_out = isl_basic_map_n_out(bmap2);
1744 n = isl_basic_map_n_out(bmap1);
1745 nparam = isl_basic_map_n_param(bmap1);
1747 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + n;
1748 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
1749 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
1750 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
1751 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
1752 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
1753 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_in);
1754 isl_dim_map_div(dim_map1, bmap1, pos += n_out);
1755 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
1756 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
1757 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
1759 bmap = isl_basic_map_alloc_dim(dim_result,
1760 bmap1->n_div + bmap2->n_div + n,
1761 bmap1->n_eq + bmap2->n_eq,
1762 bmap1->n_ineq + bmap2->n_ineq);
1763 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
1764 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
1765 bmap = add_divs(bmap, n);
1766 bmap = isl_basic_map_simplify(bmap);
1767 return isl_basic_map_finalize(bmap);
1769 isl_basic_map_free(bmap1);
1770 isl_basic_map_free(bmap2);
1774 struct isl_basic_set *isl_basic_set_apply(
1775 struct isl_basic_set *bset, struct isl_basic_map *bmap)
1780 isl_assert(set->ctx, isl_basic_map_compatible_domain(bmap, bset),
1783 return (struct isl_basic_set *)
1784 isl_basic_map_apply_range((struct isl_basic_map *)bset, bmap);
1786 isl_basic_set_free(bset);
1787 isl_basic_map_free(bmap);
1791 struct isl_basic_map *isl_basic_map_apply_domain(
1792 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
1794 if (!bmap1 || !bmap2)
1798 isl_basic_map_n_in(bmap1) == isl_basic_map_n_in(bmap2), goto error);
1800 isl_basic_map_n_param(bmap1) == isl_basic_map_n_param(bmap2),
1803 bmap1 = isl_basic_map_reverse(bmap1);
1804 bmap1 = isl_basic_map_apply_range(bmap1, bmap2);
1805 return isl_basic_map_reverse(bmap1);
1807 isl_basic_map_free(bmap1);
1808 isl_basic_map_free(bmap2);
1812 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
1813 * A \cap B -> f(A) + f(B)
1815 struct isl_basic_map *isl_basic_map_sum(
1816 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
1818 unsigned n_in, n_out, nparam, total, pos;
1819 struct isl_basic_map *bmap = NULL;
1820 struct isl_dim_map *dim_map1, *dim_map2;
1823 if (!bmap1 || !bmap2)
1826 isl_assert(bmap1->ctx, isl_dim_equal(bmap1->dim, bmap2->dim),
1829 nparam = isl_basic_map_n_param(bmap1);
1830 n_in = isl_basic_map_n_in(bmap1);
1831 n_out = isl_basic_map_n_out(bmap1);
1833 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + 2 * n_out;
1834 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
1835 dim_map2 = isl_dim_map_alloc(bmap2->ctx, total);
1836 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
1837 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos);
1838 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
1839 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
1840 isl_dim_map_div(dim_map1, bmap1, pos += n_in + n_out);
1841 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
1842 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
1843 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_out);
1845 bmap = isl_basic_map_alloc_dim(isl_dim_copy(bmap1->dim),
1846 bmap1->n_div + bmap2->n_div + 2 * n_out,
1847 bmap1->n_eq + bmap2->n_eq + n_out,
1848 bmap1->n_ineq + bmap2->n_ineq);
1849 for (i = 0; i < n_out; ++i) {
1850 int j = isl_basic_map_alloc_equality(bmap);
1853 isl_seq_clr(bmap->eq[j], 1+total);
1854 isl_int_set_si(bmap->eq[j][1+nparam+n_in+i], -1);
1855 isl_int_set_si(bmap->eq[j][1+pos+i], 1);
1856 isl_int_set_si(bmap->eq[j][1+pos-n_out+i], 1);
1858 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
1859 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
1860 bmap = add_divs(bmap, 2 * n_out);
1862 bmap = isl_basic_map_simplify(bmap);
1863 return isl_basic_map_finalize(bmap);
1865 isl_basic_map_free(bmap);
1866 isl_basic_map_free(bmap1);
1867 isl_basic_map_free(bmap2);
1871 /* Given a basic map A -> f(A), construct A -> -f(A).
1873 struct isl_basic_map *isl_basic_map_neg(struct isl_basic_map *bmap)
1878 bmap = isl_basic_map_cow(bmap);
1882 n = isl_basic_map_dim(bmap, isl_dim_out);
1883 off = isl_basic_map_offset(bmap, isl_dim_out);
1884 for (i = 0; i < bmap->n_eq; ++i)
1885 for (j = 0; j < n; ++j)
1886 isl_int_neg(bmap->eq[i][off+j], bmap->eq[i][off+j]);
1887 for (i = 0; i < bmap->n_ineq; ++i)
1888 for (j = 0; j < n; ++j)
1889 isl_int_neg(bmap->ineq[i][off+j], bmap->ineq[i][off+j]);
1890 for (i = 0; i < bmap->n_div; ++i)
1891 for (j = 0; j < n; ++j)
1892 isl_int_neg(bmap->div[i][1+off+j], bmap->div[i][1+off+j]);
1893 return isl_basic_map_finalize(bmap);
1896 /* Given a basic map A -> f(A) and an integer d, construct a basic map
1897 * A -> floor(f(A)/d).
1899 struct isl_basic_map *isl_basic_map_floordiv(struct isl_basic_map *bmap,
1902 unsigned n_in, n_out, nparam, total, pos;
1903 struct isl_basic_map *result = NULL;
1904 struct isl_dim_map *dim_map;
1910 nparam = isl_basic_map_n_param(bmap);
1911 n_in = isl_basic_map_n_in(bmap);
1912 n_out = isl_basic_map_n_out(bmap);
1914 total = nparam + n_in + n_out + bmap->n_div + n_out;
1915 dim_map = isl_dim_map_alloc(bmap->ctx, total);
1916 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_param, pos = 0);
1917 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_in, pos += nparam);
1918 isl_dim_map_div(dim_map, bmap, pos += n_in + n_out);
1919 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_out, pos += bmap->n_div);
1921 result = isl_basic_map_alloc_dim(isl_dim_copy(bmap->dim),
1922 bmap->n_div + n_out,
1923 bmap->n_eq, bmap->n_ineq + 2 * n_out);
1924 result = add_constraints_dim_map(result, bmap, dim_map);
1925 result = add_divs(result, n_out);
1926 for (i = 0; i < n_out; ++i) {
1928 j = isl_basic_map_alloc_inequality(result);
1931 isl_seq_clr(result->ineq[j], 1+total);
1932 isl_int_neg(result->ineq[j][1+nparam+n_in+i], d);
1933 isl_int_set_si(result->ineq[j][1+pos+i], 1);
1934 j = isl_basic_map_alloc_inequality(result);
1937 isl_seq_clr(result->ineq[j], 1+total);
1938 isl_int_set(result->ineq[j][1+nparam+n_in+i], d);
1939 isl_int_set_si(result->ineq[j][1+pos+i], -1);
1940 isl_int_sub_ui(result->ineq[j][0], d, 1);
1943 result = isl_basic_map_simplify(result);
1944 return isl_basic_map_finalize(result);
1946 isl_basic_map_free(result);
1950 static struct isl_basic_map *var_equal(struct isl_basic_map *bmap, unsigned pos)
1956 i = isl_basic_map_alloc_equality(bmap);
1959 nparam = isl_basic_map_n_param(bmap);
1960 n_in = isl_basic_map_n_in(bmap);
1961 isl_seq_clr(bmap->eq[i], 1 + isl_basic_map_total_dim(bmap));
1962 isl_int_set_si(bmap->eq[i][1+nparam+pos], -1);
1963 isl_int_set_si(bmap->eq[i][1+nparam+n_in+pos], 1);
1964 return isl_basic_map_finalize(bmap);
1966 isl_basic_map_free(bmap);
1970 static struct isl_basic_map *var_more(struct isl_basic_map *bmap, unsigned pos)
1976 i = isl_basic_map_alloc_inequality(bmap);
1979 nparam = isl_basic_map_n_param(bmap);
1980 n_in = isl_basic_map_n_in(bmap);
1981 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
1982 isl_int_set_si(bmap->ineq[i][0], -1);
1983 isl_int_set_si(bmap->ineq[i][1+nparam+pos], -1);
1984 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], 1);
1985 return isl_basic_map_finalize(bmap);
1987 isl_basic_map_free(bmap);
1991 static struct isl_basic_map *var_less(struct isl_basic_map *bmap, unsigned pos)
1997 i = isl_basic_map_alloc_inequality(bmap);
2000 nparam = isl_basic_map_n_param(bmap);
2001 n_in = isl_basic_map_n_in(bmap);
2002 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
2003 isl_int_set_si(bmap->ineq[i][0], -1);
2004 isl_int_set_si(bmap->ineq[i][1+nparam+pos], 1);
2005 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], -1);
2006 return isl_basic_map_finalize(bmap);
2008 isl_basic_map_free(bmap);
2012 struct isl_basic_map *isl_basic_map_equal(struct isl_dim *dim, unsigned n_equal)
2015 struct isl_basic_map *bmap;
2016 bmap = isl_basic_map_alloc_dim(dim, 0, n_equal, 0);
2019 for (i = 0; i < n_equal && bmap; ++i)
2020 bmap = var_equal(bmap, i);
2021 return isl_basic_map_finalize(bmap);
2024 struct isl_basic_map *isl_basic_map_less_at(struct isl_dim *dim, unsigned pos)
2027 struct isl_basic_map *bmap;
2028 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
2031 for (i = 0; i < pos && bmap; ++i)
2032 bmap = var_equal(bmap, i);
2034 bmap = var_less(bmap, pos);
2035 return isl_basic_map_finalize(bmap);
2038 struct isl_basic_map *isl_basic_map_more_at(struct isl_dim *dim, unsigned pos)
2041 struct isl_basic_map *bmap;
2042 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
2045 for (i = 0; i < pos && bmap; ++i)
2046 bmap = var_equal(bmap, i);
2048 bmap = var_more(bmap, pos);
2049 return isl_basic_map_finalize(bmap);
2052 struct isl_basic_map *isl_basic_map_from_basic_set(
2053 struct isl_basic_set *bset, struct isl_dim *dim)
2055 struct isl_basic_map *bmap;
2057 bset = isl_basic_set_cow(bset);
2061 isl_assert(bset->ctx, isl_dim_compatible(bset->dim, dim), goto error);
2062 isl_dim_free(bset->dim);
2063 bmap = (struct isl_basic_map *) bset;
2065 return isl_basic_map_finalize(bmap);
2067 isl_basic_set_free(bset);
2072 struct isl_basic_set *isl_basic_set_from_basic_map(struct isl_basic_map *bmap)
2076 if (bmap->dim->n_in == 0)
2077 return (struct isl_basic_set *)bmap;
2078 bmap = isl_basic_map_cow(bmap);
2081 bmap->dim = isl_dim_cow(bmap->dim);
2084 bmap->dim->n_out += bmap->dim->n_in;
2085 bmap->dim->n_in = 0;
2086 bmap = isl_basic_map_finalize(bmap);
2087 return (struct isl_basic_set *)bmap;
2089 isl_basic_map_free(bmap);
2093 /* For a div d = floor(f/m), add the constraints
2096 * -(f-(n-1)) + m d >= 0
2098 * Note that the second constraint is the negation of
2102 static int add_div_constraints(struct isl_basic_map *bmap, unsigned div)
2105 unsigned total = isl_basic_map_total_dim(bmap);
2106 unsigned div_pos = 1 + total - bmap->n_div + div;
2108 i = isl_basic_map_alloc_inequality(bmap);
2111 isl_seq_cpy(bmap->ineq[i], bmap->div[div]+1, 1+total);
2112 isl_int_neg(bmap->ineq[i][div_pos], bmap->div[div][0]);
2114 j = isl_basic_map_alloc_inequality(bmap);
2117 isl_seq_neg(bmap->ineq[j], bmap->ineq[i], 1 + total);
2118 isl_int_add(bmap->ineq[j][0], bmap->ineq[j][0], bmap->ineq[j][div_pos]);
2119 isl_int_sub_ui(bmap->ineq[j][0], bmap->ineq[j][0], 1);
2123 struct isl_basic_set *isl_basic_map_underlying_set(
2124 struct isl_basic_map *bmap)
2128 if (bmap->dim->nparam == 0 && bmap->dim->n_in == 0 && bmap->n_div == 0)
2129 return (struct isl_basic_set *)bmap;
2130 bmap = isl_basic_map_cow(bmap);
2133 bmap->dim = isl_dim_underlying(bmap->dim, bmap->n_div);
2136 bmap->extra -= bmap->n_div;
2138 bmap = isl_basic_map_finalize(bmap);
2139 return (struct isl_basic_set *)bmap;
2144 struct isl_basic_map *isl_basic_map_overlying_set(
2145 struct isl_basic_set *bset, struct isl_basic_map *like)
2147 struct isl_basic_map *bmap;
2148 struct isl_ctx *ctx;
2155 isl_assert(ctx, bset->n_div == 0, goto error);
2156 isl_assert(ctx, isl_basic_set_n_param(bset) == 0, goto error);
2157 isl_assert(ctx, bset->dim->n_out == isl_basic_map_total_dim(like),
2159 if (isl_dim_equal(bset->dim, like->dim) && like->n_div == 0) {
2160 isl_basic_map_free(like);
2161 return (struct isl_basic_map *)bset;
2163 bset = isl_basic_set_cow(bset);
2166 total = bset->dim->n_out + bset->extra;
2167 bmap = (struct isl_basic_map *)bset;
2168 isl_dim_free(bmap->dim);
2169 bmap->dim = isl_dim_copy(like->dim);
2172 bmap->n_div = like->n_div;
2173 bmap->extra += like->n_div;
2176 ltotal = total - bmap->extra + like->extra;
2179 bmap->block2 = isl_blk_extend(ctx, bmap->block2,
2180 bmap->extra * (1 + 1 + total));
2181 if (isl_blk_is_error(bmap->block2))
2183 bmap->div = isl_realloc_array(ctx, bmap->div, isl_int *,
2187 for (i = 0; i < bmap->extra; ++i)
2188 bmap->div[i] = bmap->block2.data + i * (1 + 1 + total);
2189 for (i = 0; i < like->n_div; ++i) {
2190 isl_seq_cpy(bmap->div[i], like->div[i], 1 + 1 + ltotal);
2191 isl_seq_clr(bmap->div[i]+1+1+ltotal, total - ltotal);
2193 bmap = isl_basic_map_extend_constraints(bmap,
2194 0, 2 * like->n_div);
2195 for (i = 0; i < like->n_div; ++i) {
2196 if (isl_int_is_zero(bmap->div[i][0]))
2198 if (add_div_constraints(bmap, i) < 0)
2202 isl_basic_map_free(like);
2203 bmap = isl_basic_map_simplify(bmap);
2204 bmap = isl_basic_map_finalize(bmap);
2207 isl_basic_map_free(like);
2208 isl_basic_set_free(bset);
2212 struct isl_basic_set *isl_basic_set_from_underlying_set(
2213 struct isl_basic_set *bset, struct isl_basic_set *like)
2215 return (struct isl_basic_set *)
2216 isl_basic_map_overlying_set(bset, (struct isl_basic_map *)like);
2219 struct isl_set *isl_set_from_underlying_set(
2220 struct isl_set *set, struct isl_basic_set *like)
2226 isl_assert(set->ctx, set->dim->n_out == isl_basic_set_total_dim(like),
2228 if (isl_dim_equal(set->dim, like->dim) && like->n_div == 0) {
2229 isl_basic_set_free(like);
2232 set = isl_set_cow(set);
2235 for (i = 0; i < set->n; ++i) {
2236 set->p[i] = isl_basic_set_from_underlying_set(set->p[i],
2237 isl_basic_set_copy(like));
2241 isl_dim_free(set->dim);
2242 set->dim = isl_dim_copy(like->dim);
2245 isl_basic_set_free(like);
2248 isl_basic_set_free(like);
2253 struct isl_set *isl_map_underlying_set(struct isl_map *map)
2257 map = isl_map_cow(map);
2260 map->dim = isl_dim_cow(map->dim);
2264 for (i = 1; i < map->n; ++i)
2265 isl_assert(map->ctx, map->p[0]->n_div == map->p[i]->n_div,
2267 for (i = 0; i < map->n; ++i) {
2268 map->p[i] = (struct isl_basic_map *)
2269 isl_basic_map_underlying_set(map->p[i]);
2274 map->dim = isl_dim_underlying(map->dim, 0);
2276 isl_dim_free(map->dim);
2277 map->dim = isl_dim_copy(map->p[0]->dim);
2281 return (struct isl_set *)map;
2287 struct isl_set *isl_set_to_underlying_set(struct isl_set *set)
2289 return (struct isl_set *)isl_map_underlying_set((struct isl_map *)set);
2292 struct isl_basic_set *isl_basic_map_domain(struct isl_basic_map *bmap)
2294 struct isl_basic_set *domain;
2298 n_out = isl_basic_map_n_out(bmap);
2299 domain = isl_basic_set_from_basic_map(bmap);
2300 return isl_basic_set_project_out(domain, n_out, 0);
2303 struct isl_basic_set *isl_basic_map_range(struct isl_basic_map *bmap)
2305 return isl_basic_map_domain(isl_basic_map_reverse(bmap));
2308 struct isl_set *isl_map_range(struct isl_map *map)
2311 struct isl_set *set;
2315 map = isl_map_cow(map);
2319 set = (struct isl_set *) map;
2320 if (set->dim->n_in != 0) {
2321 set->dim = isl_dim_drop_inputs(set->dim, 0, set->dim->n_in);
2325 for (i = 0; i < map->n; ++i) {
2326 set->p[i] = isl_basic_map_range(map->p[i]);
2330 F_CLR(set, ISL_MAP_DISJOINT);
2331 F_CLR(set, ISL_SET_NORMALIZED);
2338 struct isl_map *isl_map_from_set(struct isl_set *set, struct isl_dim *dim)
2341 struct isl_map *map = NULL;
2343 set = isl_set_cow(set);
2346 isl_assert(set->ctx, isl_dim_compatible(set->dim, dim), goto error);
2347 map = (struct isl_map *)set;
2348 for (i = 0; i < set->n; ++i) {
2349 map->p[i] = isl_basic_map_from_basic_set(
2350 set->p[i], isl_dim_copy(dim));
2354 isl_dim_free(map->dim);
2363 struct isl_map *isl_map_from_range(struct isl_set *set)
2365 return (struct isl_map *)set;
2368 struct isl_set *isl_set_from_map(struct isl_map *map)
2371 struct isl_set *set = NULL;
2375 map = isl_map_cow(map);
2378 map->dim = isl_dim_cow(map->dim);
2381 map->dim->n_out += map->dim->n_in;
2383 set = (struct isl_set *)map;
2384 for (i = 0; i < map->n; ++i) {
2385 set->p[i] = isl_basic_set_from_basic_map(map->p[i]);
2395 struct isl_map *isl_map_alloc_dim(struct isl_dim *dim, int n, unsigned flags)
2397 struct isl_map *map;
2401 isl_assert(dim->ctx, n >= 0, return NULL);
2402 map = isl_alloc(dim->ctx, struct isl_map,
2403 sizeof(struct isl_map) +
2404 n * sizeof(struct isl_basic_map *));
2408 map->ctx = dim->ctx;
2409 isl_ctx_ref(map->ctx);
2421 struct isl_map *isl_map_alloc(struct isl_ctx *ctx,
2422 unsigned nparam, unsigned in, unsigned out, int n,
2425 struct isl_map *map;
2426 struct isl_dim *dims;
2428 dims = isl_dim_alloc(ctx, nparam, in, out);
2432 map = isl_map_alloc_dim(dims, n, flags);
2436 struct isl_basic_map *isl_basic_map_empty(struct isl_ctx *ctx,
2437 unsigned nparam, unsigned in, unsigned out)
2439 struct isl_basic_map *bmap;
2440 bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, 1, 0);
2441 bmap = isl_basic_map_set_to_empty(bmap);
2445 struct isl_basic_set *isl_basic_set_empty(struct isl_dim *dim)
2447 struct isl_basic_set *bset;
2448 bset = isl_basic_set_alloc_dim(dim, 0, 1, 0);
2449 bset = isl_basic_set_set_to_empty(bset);
2453 struct isl_basic_map *isl_basic_map_empty_like(struct isl_basic_map *model)
2455 struct isl_basic_map *bmap;
2458 bmap = isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
2459 bmap = isl_basic_map_set_to_empty(bmap);
2463 struct isl_basic_map *isl_basic_map_empty_like_map(struct isl_map *model)
2465 struct isl_basic_map *bmap;
2468 bmap = isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
2469 bmap = isl_basic_map_set_to_empty(bmap);
2473 struct isl_basic_set *isl_basic_set_empty_like(struct isl_basic_set *model)
2475 struct isl_basic_set *bset;
2478 bset = isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
2479 bset = isl_basic_set_set_to_empty(bset);
2483 struct isl_basic_map *isl_basic_map_universe(struct isl_dim *dim)
2485 struct isl_basic_map *bmap;
2486 bmap = isl_basic_map_alloc_dim(dim, 0, 0, 0);
2490 struct isl_basic_set *isl_basic_set_universe(struct isl_dim *dim)
2492 struct isl_basic_set *bset;
2493 bset = isl_basic_set_alloc_dim(dim, 0, 0, 0);
2497 struct isl_basic_set *isl_basic_set_universe_like(struct isl_basic_set *model)
2501 return isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
2504 struct isl_map *isl_map_empty(struct isl_dim *dim)
2506 return isl_map_alloc_dim(dim, 0, ISL_MAP_DISJOINT);
2509 struct isl_map *isl_map_empty_like(struct isl_map *model)
2513 return isl_map_alloc_dim(isl_dim_copy(model->dim), 0, ISL_MAP_DISJOINT);
2516 struct isl_map *isl_map_empty_like_basic_map(struct isl_basic_map *model)
2520 return isl_map_alloc_dim(isl_dim_copy(model->dim), 0, ISL_MAP_DISJOINT);
2523 struct isl_set *isl_set_empty(struct isl_dim *dim)
2525 return isl_set_alloc_dim(dim, 0, ISL_MAP_DISJOINT);
2528 struct isl_set *isl_set_empty_like(struct isl_set *model)
2532 return isl_set_empty(isl_dim_copy(model->dim));
2535 struct isl_set *isl_set_universe(struct isl_dim *dim)
2537 struct isl_set *set;
2540 set = isl_set_alloc_dim(isl_dim_copy(dim), 1, ISL_MAP_DISJOINT);
2541 set = isl_set_add(set, isl_basic_set_universe(dim));
2545 struct isl_map *isl_map_dup(struct isl_map *map)
2548 struct isl_map *dup;
2552 dup = isl_map_alloc_dim(isl_dim_copy(map->dim), map->n, map->flags);
2553 for (i = 0; i < map->n; ++i)
2554 dup = isl_map_add(dup, isl_basic_map_copy(map->p[i]));
2558 struct isl_map *isl_map_add(struct isl_map *map, struct isl_basic_map *bmap)
2562 isl_assert(map->ctx, isl_dim_equal(map->dim, bmap->dim), goto error);
2563 isl_assert(map->ctx, map->n < map->size, goto error);
2564 map->p[map->n] = bmap;
2566 F_CLR(map, ISL_MAP_NORMALIZED);
2572 isl_basic_map_free(bmap);
2576 void isl_map_free(struct isl_map *map)
2586 isl_ctx_deref(map->ctx);
2587 for (i = 0; i < map->n; ++i)
2588 isl_basic_map_free(map->p[i]);
2589 isl_dim_free(map->dim);
2593 struct isl_map *isl_map_extend(struct isl_map *base,
2594 unsigned nparam, unsigned n_in, unsigned n_out)
2598 base = isl_map_cow(base);
2602 base->dim = isl_dim_extend(base->dim, nparam, n_in, n_out);
2605 for (i = 0; i < base->n; ++i) {
2606 base->p[i] = isl_basic_map_extend_dim(base->p[i],
2607 isl_dim_copy(base->dim), 0, 0, 0);
2617 struct isl_set *isl_set_extend(struct isl_set *base,
2618 unsigned nparam, unsigned dim)
2620 return (struct isl_set *)isl_map_extend((struct isl_map *)base,
2624 static struct isl_basic_map *isl_basic_map_fix_pos(struct isl_basic_map *bmap,
2625 unsigned pos, int value)
2629 bmap = isl_basic_map_cow(bmap);
2630 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
2631 j = isl_basic_map_alloc_equality(bmap);
2634 isl_seq_clr(bmap->eq[j], 1 + isl_basic_map_total_dim(bmap));
2635 isl_int_set_si(bmap->eq[j][pos], -1);
2636 isl_int_set_si(bmap->eq[j][0], value);
2637 bmap = isl_basic_map_simplify(bmap);
2638 return isl_basic_map_finalize(bmap);
2640 isl_basic_map_free(bmap);
2644 struct isl_basic_map *isl_basic_map_fix_si(struct isl_basic_map *bmap,
2645 enum isl_dim_type type, unsigned pos, int value)
2649 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
2650 return isl_basic_map_fix_pos(bmap, isl_basic_map_offset(bmap, type) + pos,
2653 isl_basic_map_free(bmap);
2657 struct isl_basic_set *isl_basic_set_fix_si(struct isl_basic_set *bset,
2658 enum isl_dim_type type, unsigned pos, int value)
2660 return (struct isl_basic_set *)
2661 isl_basic_map_fix_si((struct isl_basic_map *)bset,
2665 struct isl_basic_map *isl_basic_map_fix_input_si(struct isl_basic_map *bmap,
2666 unsigned input, int value)
2668 return isl_basic_map_fix_si(bmap, isl_dim_in, input, value);
2671 struct isl_basic_set *isl_basic_set_fix_dim_si(struct isl_basic_set *bset,
2672 unsigned dim, int value)
2674 return (struct isl_basic_set *)
2675 isl_basic_map_fix_si((struct isl_basic_map *)bset,
2676 isl_dim_set, dim, value);
2679 struct isl_map *isl_map_fix_si(struct isl_map *map,
2680 enum isl_dim_type type, unsigned pos, int value)
2684 map = isl_map_cow(map);
2688 isl_assert(ctx, pos < isl_map_dim(map, type), goto error);
2689 for (i = 0; i < map->n; ++i) {
2690 map->p[i] = isl_basic_map_fix_si(map->p[i], type, pos, value);
2694 F_CLR(map, ISL_MAP_NORMALIZED);
2701 struct isl_map *isl_map_fix_input_si(struct isl_map *map,
2702 unsigned input, int value)
2704 return isl_map_fix_si(map, isl_dim_in, input, value);
2707 struct isl_set *isl_set_fix_dim_si(struct isl_set *set, unsigned dim, int value)
2709 return (struct isl_set *)
2710 isl_map_fix_si((struct isl_map *)set, isl_dim_set, dim, value);
2713 struct isl_basic_set *isl_basic_set_lower_bound_dim(struct isl_basic_set *bset,
2714 unsigned dim, isl_int value)
2719 bset = isl_basic_set_cow(bset);
2720 bset = isl_basic_set_extend_constraints(bset, 0, 1);
2721 j = isl_basic_set_alloc_inequality(bset);
2724 isl_seq_clr(bset->ineq[j], 1 + isl_basic_set_total_dim(bset));
2725 isl_int_set_si(bset->ineq[j][1 + isl_basic_set_n_param(bset) + dim], 1);
2726 isl_int_neg(bset->ineq[j][0], value);
2727 bset = isl_basic_set_simplify(bset);
2728 return isl_basic_set_finalize(bset);
2730 isl_basic_set_free(bset);
2734 struct isl_set *isl_set_lower_bound_dim(struct isl_set *set, unsigned dim,
2739 set = isl_set_cow(set);
2743 isl_assert(set->ctx, dim < isl_set_n_dim(set), goto error);
2744 for (i = 0; i < set->n; ++i) {
2745 set->p[i] = isl_basic_set_lower_bound_dim(set->p[i], dim, value);
2755 struct isl_map *isl_map_reverse(struct isl_map *map)
2760 map = isl_map_cow(map);
2764 map->dim = isl_dim_reverse(map->dim);
2767 for (i = 0; i < map->n; ++i) {
2768 map->p[i] = isl_basic_map_reverse(map->p[i]);
2772 F_CLR(map, ISL_MAP_NORMALIZED);
2779 struct isl_map *isl_basic_map_lexmax(
2780 struct isl_basic_map *bmap, struct isl_basic_set *dom,
2781 struct isl_set **empty)
2783 return isl_pip_basic_map_lexmax(bmap, dom, empty);
2786 struct isl_map *isl_basic_map_lexmin(
2787 struct isl_basic_map *bmap, struct isl_basic_set *dom,
2788 struct isl_set **empty)
2790 return isl_pip_basic_map_lexmin(bmap, dom, empty);
2793 struct isl_set *isl_basic_set_lexmin(struct isl_basic_set *bset)
2795 struct isl_basic_map *bmap = NULL;
2796 struct isl_basic_set *dom = NULL;
2797 struct isl_map *min;
2798 struct isl_dim *param_dim;
2802 bmap = isl_basic_map_from_basic_set(bset, isl_dim_copy(bset->dim));
2805 param_dim = isl_dim_domain(isl_dim_copy(bmap->dim));
2806 dom = isl_basic_set_universe(param_dim);
2809 min = isl_basic_map_lexmin(bmap, dom, NULL);
2810 return isl_map_range(min);
2812 isl_basic_map_free(bmap);
2816 struct isl_map *isl_basic_map_compute_divs(struct isl_basic_map *bmap)
2823 off = isl_dim_total(bmap->dim);
2824 for (i = 0; i < bmap->n_div; ++i) {
2825 if (isl_int_is_zero(bmap->div[i][0]))
2826 return isl_pip_basic_map_compute_divs(bmap);
2827 isl_assert(bmap->ctx, isl_int_is_zero(bmap->div[i][1+1+off+i]),
2830 return isl_map_from_basic_map(bmap);
2832 isl_basic_map_free(bmap);
2836 struct isl_map *isl_map_compute_divs(struct isl_map *map)
2839 struct isl_map *res;
2845 res = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[0]));
2846 for (i = 1 ; i < map->n; ++i) {
2848 r2 = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[i]));
2849 if (F_ISSET(map, ISL_MAP_DISJOINT))
2850 res = isl_map_union_disjoint(res, r2);
2852 res = isl_map_union(res, r2);
2859 struct isl_set *isl_basic_set_compute_divs(struct isl_basic_set *bset)
2861 return (struct isl_set *)
2862 isl_basic_map_compute_divs((struct isl_basic_map *)bset);
2865 struct isl_set *isl_set_compute_divs(struct isl_set *set)
2867 return (struct isl_set *)
2868 isl_map_compute_divs((struct isl_map *)set);
2871 struct isl_set *isl_map_domain(struct isl_map *map)
2874 struct isl_set *set;
2879 map = isl_map_cow(map);
2883 set = (struct isl_set *)map;
2884 set->dim = isl_dim_domain(set->dim);
2887 for (i = 0; i < map->n; ++i) {
2888 set->p[i] = isl_basic_map_domain(map->p[i]);
2892 F_CLR(set, ISL_MAP_DISJOINT);
2893 F_CLR(set, ISL_SET_NORMALIZED);
2900 struct isl_map *isl_map_union_disjoint(
2901 struct isl_map *map1, struct isl_map *map2)
2905 struct isl_map *map = NULL;
2919 isl_assert(map1->ctx, isl_dim_equal(map1->dim, map2->dim), goto error);
2921 if (F_ISSET(map1, ISL_MAP_DISJOINT) &&
2922 F_ISSET(map2, ISL_MAP_DISJOINT))
2923 FL_SET(flags, ISL_MAP_DISJOINT);
2925 map = isl_map_alloc_dim(isl_dim_copy(map1->dim),
2926 map1->n + map2->n, flags);
2929 for (i = 0; i < map1->n; ++i) {
2930 map = isl_map_add(map,
2931 isl_basic_map_copy(map1->p[i]));
2935 for (i = 0; i < map2->n; ++i) {
2936 map = isl_map_add(map,
2937 isl_basic_map_copy(map2->p[i]));
2951 struct isl_map *isl_map_union(struct isl_map *map1, struct isl_map *map2)
2953 map1 = isl_map_union_disjoint(map1, map2);
2957 F_CLR(map1, ISL_MAP_DISJOINT);
2961 struct isl_set *isl_set_union_disjoint(
2962 struct isl_set *set1, struct isl_set *set2)
2964 return (struct isl_set *)
2965 isl_map_union_disjoint(
2966 (struct isl_map *)set1, (struct isl_map *)set2);
2969 struct isl_set *isl_set_union(struct isl_set *set1, struct isl_set *set2)
2971 return (struct isl_set *)
2972 isl_map_union((struct isl_map *)set1, (struct isl_map *)set2);
2975 struct isl_map *isl_map_intersect_range(
2976 struct isl_map *map, struct isl_set *set)
2979 struct isl_map *result;
2985 if (F_ISSET(map, ISL_MAP_DISJOINT) &&
2986 F_ISSET(set, ISL_MAP_DISJOINT))
2987 FL_SET(flags, ISL_MAP_DISJOINT);
2989 result = isl_map_alloc_dim(isl_dim_copy(map->dim),
2990 map->n * set->n, flags);
2993 for (i = 0; i < map->n; ++i)
2994 for (j = 0; j < set->n; ++j) {
2995 result = isl_map_add(result,
2996 isl_basic_map_intersect_range(
2997 isl_basic_map_copy(map->p[i]),
2998 isl_basic_set_copy(set->p[j])));
3011 struct isl_map *isl_map_intersect_domain(
3012 struct isl_map *map, struct isl_set *set)
3014 return isl_map_reverse(
3015 isl_map_intersect_range(isl_map_reverse(map), set));
3018 struct isl_map *isl_map_apply_domain(
3019 struct isl_map *map1, struct isl_map *map2)
3023 map1 = isl_map_reverse(map1);
3024 map1 = isl_map_apply_range(map1, map2);
3025 return isl_map_reverse(map1);
3032 struct isl_map *isl_map_apply_range(
3033 struct isl_map *map1, struct isl_map *map2)
3035 struct isl_dim *dim_result;
3036 struct isl_map *result;
3045 dim_result = isl_dim_join(isl_dim_copy(map1->dim),
3046 isl_dim_copy(map2->dim));
3048 result = isl_map_alloc_dim(dim_result, map1->n * map2->n, 0);
3051 for (i = 0; i < map1->n; ++i)
3052 for (j = 0; j < map2->n; ++j) {
3053 result = isl_map_add(result,
3054 isl_basic_map_apply_range(
3055 isl_basic_map_copy(map1->p[i]),
3056 isl_basic_map_copy(map2->p[j])));
3062 if (result && result->n <= 1)
3063 F_SET(result, ISL_MAP_DISJOINT);
3072 * returns range - domain
3074 struct isl_basic_set *isl_basic_map_deltas(struct isl_basic_map *bmap)
3076 struct isl_basic_set *bset;
3083 dim = isl_basic_map_n_in(bmap);
3084 nparam = isl_basic_map_n_param(bmap);
3085 isl_assert(bmap->ctx, dim == isl_basic_map_n_out(bmap), goto error);
3086 bset = isl_basic_set_from_basic_map(bmap);
3087 bset = isl_basic_set_extend(bset, nparam, 3*dim, 0, dim, 0);
3088 bset = isl_basic_set_swap_vars(bset, 2*dim);
3089 for (i = 0; i < dim; ++i) {
3090 int j = isl_basic_map_alloc_equality(
3091 (struct isl_basic_map *)bset);
3094 isl_seq_clr(bset->eq[j], 1 + isl_basic_set_total_dim(bset));
3095 isl_int_set_si(bset->eq[j][1+nparam+i], 1);
3096 isl_int_set_si(bset->eq[j][1+nparam+dim+i], 1);
3097 isl_int_set_si(bset->eq[j][1+nparam+2*dim+i], -1);
3099 return isl_basic_set_project_out(bset, 2*dim, 0);
3101 isl_basic_map_free(bmap);
3106 * returns range - domain
3108 struct isl_set *isl_map_deltas(struct isl_map *map)
3111 struct isl_set *result;
3116 isl_assert(map->ctx, isl_map_n_in(map) == isl_map_n_out(map), goto error);
3117 result = isl_set_alloc(map->ctx, isl_map_n_param(map),
3118 isl_map_n_in(map), map->n, map->flags);
3121 for (i = 0; i < map->n; ++i)
3122 result = isl_set_add(result,
3123 isl_basic_map_deltas(isl_basic_map_copy(map->p[i])));
3131 static struct isl_basic_map *basic_map_identity(struct isl_dim *dims)
3133 struct isl_basic_map *bmap;
3141 nparam = dims->nparam;
3143 bmap = isl_basic_map_alloc_dim(dims, 0, dim, 0);
3147 for (i = 0; i < dim; ++i) {
3148 int j = isl_basic_map_alloc_equality(bmap);
3151 isl_seq_clr(bmap->eq[j], 1 + isl_basic_map_total_dim(bmap));
3152 isl_int_set_si(bmap->eq[j][1+nparam+i], 1);
3153 isl_int_set_si(bmap->eq[j][1+nparam+dim+i], -1);
3155 return isl_basic_map_finalize(bmap);
3157 isl_basic_map_free(bmap);
3161 struct isl_basic_map *isl_basic_map_identity(struct isl_dim *set_dim)
3163 struct isl_dim *dim = isl_dim_map(set_dim);
3166 return basic_map_identity(dim);
3169 struct isl_basic_map *isl_basic_map_identity_like(struct isl_basic_map *model)
3171 if (!model || !model->dim)
3173 isl_assert(model->ctx,
3174 model->dim->n_in == model->dim->n_out, return NULL);
3175 return basic_map_identity(isl_dim_copy(model->dim));
3178 static struct isl_map *map_identity(struct isl_dim *dim)
3180 struct isl_map *map = isl_map_alloc_dim(dim, 1, ISL_MAP_DISJOINT);
3181 return isl_map_add(map, basic_map_identity(isl_dim_copy(dim)));
3184 struct isl_map *isl_map_identity(struct isl_dim *set_dim)
3186 struct isl_dim *dim = isl_dim_map(set_dim);
3189 return map_identity(dim);
3192 struct isl_map *isl_map_identity_like(struct isl_basic_map *model)
3194 if (!model || !model->dim)
3196 isl_assert(model->ctx,
3197 model->dim->n_in == model->dim->n_out, return NULL);
3198 return map_identity(isl_dim_copy(model->dim));
3201 int isl_set_is_equal(struct isl_set *set1, struct isl_set *set2)
3203 return isl_map_is_equal((struct isl_map *)set1, (struct isl_map *)set2);
3206 int isl_set_is_subset(struct isl_set *set1, struct isl_set *set2)
3208 return isl_map_is_subset(
3209 (struct isl_map *)set1, (struct isl_map *)set2);
3212 int isl_basic_map_is_subset(
3213 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3216 struct isl_map *map1;
3217 struct isl_map *map2;
3219 if (!bmap1 || !bmap2)
3222 map1 = isl_map_from_basic_map(isl_basic_map_copy(bmap1));
3223 map2 = isl_map_from_basic_map(isl_basic_map_copy(bmap2));
3225 is_subset = isl_map_is_subset(map1, map2);
3233 int isl_basic_map_is_equal(
3234 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3238 if (!bmap1 || !bmap2)
3240 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
3243 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
3247 int isl_basic_set_is_equal(
3248 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
3250 return isl_basic_map_is_equal(
3251 (struct isl_basic_map *)bset1, (struct isl_basic_map *)bset2);
3254 int isl_map_is_empty(struct isl_map *map)
3261 for (i = 0; i < map->n; ++i) {
3262 is_empty = isl_basic_map_is_empty(map->p[i]);
3271 int isl_map_fast_is_empty(struct isl_map *map)
3276 int isl_set_is_empty(struct isl_set *set)
3278 return isl_map_is_empty((struct isl_map *)set);
3281 int isl_map_is_subset(struct isl_map *map1, struct isl_map *map2)
3285 struct isl_map *diff;
3290 if (isl_map_is_empty(map1))
3293 if (isl_map_is_empty(map2))
3296 diff = isl_map_subtract(isl_map_copy(map1), isl_map_copy(map2));
3300 is_subset = isl_map_is_empty(diff);
3306 int isl_map_is_equal(struct isl_map *map1, struct isl_map *map2)
3312 is_subset = isl_map_is_subset(map1, map2);
3315 is_subset = isl_map_is_subset(map2, map1);
3319 int isl_basic_map_is_strict_subset(
3320 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3324 if (!bmap1 || !bmap2)
3326 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
3329 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
3330 if (is_subset == -1)
3335 static int basic_map_contains(struct isl_basic_map *bmap, struct isl_vec *vec)
3341 total = 1 + isl_basic_map_total_dim(bmap);
3342 if (total != vec->size)
3347 for (i = 0; i < bmap->n_eq; ++i) {
3348 isl_seq_inner_product(vec->block.data, bmap->eq[i], total, &s);
3349 if (!isl_int_is_zero(s)) {
3355 for (i = 0; i < bmap->n_ineq; ++i) {
3356 isl_seq_inner_product(vec->block.data, bmap->ineq[i], total, &s);
3357 if (isl_int_is_neg(s)) {
3368 int isl_basic_map_is_universe(struct isl_basic_map *bmap)
3372 return bmap->n_eq == 0 && bmap->n_ineq == 0;
3375 int isl_basic_map_is_empty(struct isl_basic_map *bmap)
3377 struct isl_basic_set *bset = NULL;
3378 struct isl_vec *sample = NULL;
3385 if (F_ISSET(bmap, ISL_BASIC_MAP_EMPTY))
3388 if (F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL)) {
3389 struct isl_basic_map *copy = isl_basic_map_copy(bmap);
3390 copy = isl_basic_map_convex_hull(copy);
3391 empty = F_ISSET(copy, ISL_BASIC_MAP_EMPTY);
3392 isl_basic_map_free(copy);
3396 total = 1 + isl_basic_map_total_dim(bmap);
3397 if (bmap->sample && bmap->sample->size == total) {
3398 int contains = basic_map_contains(bmap, bmap->sample);
3404 bset = isl_basic_map_underlying_set(isl_basic_map_copy(bmap));
3407 sample = isl_basic_set_sample(bset);
3410 empty = sample->size == 0;
3412 isl_vec_free(bmap->ctx, bmap->sample);
3413 bmap->sample = sample;
3418 int isl_basic_set_is_empty(struct isl_basic_set *bset)
3420 return isl_basic_map_is_empty((struct isl_basic_map *)bset);
3423 struct isl_map *isl_basic_map_union(
3424 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3426 struct isl_map *map;
3427 if (!bmap1 || !bmap2)
3430 isl_assert(map1->ctx, isl_dim_equal(bmap1->dim, bmap2->dim), goto error);
3432 map = isl_map_alloc_dim(isl_dim_copy(bmap1->dim), 2, 0);
3435 map = isl_map_add(map, bmap1);
3436 map = isl_map_add(map, bmap2);
3439 isl_basic_map_free(bmap1);
3440 isl_basic_map_free(bmap2);
3444 struct isl_set *isl_basic_set_union(
3445 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
3447 return (struct isl_set *)isl_basic_map_union(
3448 (struct isl_basic_map *)bset1,
3449 (struct isl_basic_map *)bset2);
3452 /* Order divs such that any div only depends on previous divs */
3453 static struct isl_basic_map *order_divs(struct isl_basic_map *bmap)
3456 unsigned off = isl_dim_total(bmap->dim);
3458 for (i = 0; i < bmap->n_div; ++i) {
3460 pos = isl_seq_first_non_zero(bmap->div[i]+1+1+off+i,
3464 swap_div(bmap, i, pos);
3470 /* Look for a div in dst that corresponds to the div "div" in src.
3471 * The divs before "div" in src and dst are assumed to be the same.
3473 * Returns -1 if no corresponding div was found and the position
3474 * of the corresponding div in dst otherwise.
3476 static int find_div(struct isl_basic_map *dst,
3477 struct isl_basic_map *src, unsigned div)
3481 unsigned total = isl_dim_total(src->dim);
3483 isl_assert(dst->ctx, div <= dst->n_div, return -1);
3484 for (i = div; i < dst->n_div; ++i)
3485 if (isl_seq_eq(dst->div[i], src->div[div], 1+1+total+div) &&
3486 isl_seq_first_non_zero(dst->div[i]+1+1+total+div,
3487 dst->n_div - div) == -1)
3492 struct isl_basic_map *isl_basic_map_align_divs(
3493 struct isl_basic_map *dst, struct isl_basic_map *src)
3496 unsigned total = isl_dim_total(src->dim);
3501 if (src->n_div == 0)
3504 for (i = 0; i < src->n_div; ++i)
3505 isl_assert(src->ctx, !isl_int_is_zero(src->div[i][0]), goto error);
3507 src = order_divs(src);
3508 dst = isl_basic_map_extend_dim(dst, isl_dim_copy(dst->dim),
3509 src->n_div, 0, 2 * src->n_div);
3512 for (i = 0; i < src->n_div; ++i) {
3513 int j = find_div(dst, src, i);
3515 j = isl_basic_map_alloc_div(dst);
3518 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total+i);
3519 isl_seq_clr(dst->div[j]+1+1+total+i, dst->n_div - i);
3520 if (add_div_constraints(dst, j) < 0)
3524 swap_div(dst, i, j);
3528 isl_basic_map_free(dst);
3532 struct isl_basic_set *isl_basic_set_align_divs(
3533 struct isl_basic_set *dst, struct isl_basic_set *src)
3535 return (struct isl_basic_set *)isl_basic_map_align_divs(
3536 (struct isl_basic_map *)dst, (struct isl_basic_map *)src);
3539 struct isl_map *isl_map_align_divs(struct isl_map *map)
3543 map = isl_map_compute_divs(map);
3544 map = isl_map_cow(map);
3548 for (i = 1; i < map->n; ++i)
3549 map->p[0] = isl_basic_map_align_divs(map->p[0], map->p[i]);
3550 for (i = 1; i < map->n; ++i)
3551 map->p[i] = isl_basic_map_align_divs(map->p[i], map->p[0]);
3553 F_CLR(map, ISL_MAP_NORMALIZED);
3557 static struct isl_map *add_cut_constraint(struct isl_map *dst,
3558 struct isl_basic_map *src, isl_int *c,
3559 unsigned len, int oppose)
3561 struct isl_basic_map *copy = NULL;
3566 copy = isl_basic_map_copy(src);
3567 copy = isl_basic_map_cow(copy);
3570 copy = isl_basic_map_extend_constraints(copy, 0, 1);
3571 k = isl_basic_map_alloc_inequality(copy);
3575 isl_seq_neg(copy->ineq[k], c, len);
3577 isl_seq_cpy(copy->ineq[k], c, len);
3578 total = 1 + isl_basic_map_total_dim(copy);
3579 isl_seq_clr(copy->ineq[k]+len, total - len);
3580 isl_inequality_negate(copy, k);
3581 copy = isl_basic_map_simplify(copy);
3582 copy = isl_basic_map_finalize(copy);
3583 is_empty = isl_basic_map_is_empty(copy);
3587 dst = isl_map_add(dst, copy);
3589 isl_basic_map_free(copy);
3592 isl_basic_map_free(copy);
3597 static struct isl_map *subtract(struct isl_map *map, struct isl_basic_map *bmap)
3601 struct isl_map *rest = NULL;
3603 unsigned total = isl_basic_map_total_dim(bmap);
3610 if (F_ISSET(map, ISL_MAP_DISJOINT))
3611 FL_SET(flags, ISL_MAP_DISJOINT);
3613 max = map->n * (2 * bmap->n_eq + bmap->n_ineq);
3614 rest = isl_map_alloc_dim(isl_dim_copy(map->dim), max, flags);
3618 for (i = 0; i < map->n; ++i) {
3619 map->p[i] = isl_basic_map_align_divs(map->p[i], bmap);
3624 for (j = 0; j < map->n; ++j)
3625 map->p[j] = isl_basic_map_cow(map->p[j]);
3627 for (i = 0; i < bmap->n_eq; ++i) {
3628 for (j = 0; j < map->n; ++j) {
3629 rest = add_cut_constraint(rest,
3630 map->p[j], bmap->eq[i], 1+total, 0);
3634 rest = add_cut_constraint(rest,
3635 map->p[j], bmap->eq[i], 1+total, 1);
3639 map->p[j] = isl_basic_map_extend_constraints(map->p[j],
3643 k = isl_basic_map_alloc_equality(map->p[j]);
3646 isl_seq_cpy(map->p[j]->eq[k], bmap->eq[i], 1+total);
3647 isl_seq_clr(map->p[j]->eq[k]+1+total,
3648 map->p[j]->n_div - bmap->n_div);
3652 for (i = 0; i < bmap->n_ineq; ++i) {
3653 for (j = 0; j < map->n; ++j) {
3654 rest = add_cut_constraint(rest,
3655 map->p[j], bmap->ineq[i], 1+total, 0);
3659 map->p[j] = isl_basic_map_extend_constraints(map->p[j],
3663 k = isl_basic_map_alloc_inequality(map->p[j]);
3666 isl_seq_cpy(map->p[j]->ineq[k], bmap->ineq[i], 1+total);
3667 isl_seq_clr(map->p[j]->ineq[k]+1+total,
3668 map->p[j]->n_div - bmap->n_div);
3680 struct isl_map *isl_map_subtract(struct isl_map *map1, struct isl_map *map2)
3686 isl_assert(map1->ctx, isl_dim_equal(map1->dim, map2->dim), goto error);
3688 if (isl_map_is_empty(map2)) {
3693 map1 = isl_map_compute_divs(map1);
3694 map2 = isl_map_compute_divs(map2);
3698 for (i = 0; map1 && i < map2->n; ++i)
3699 map1 = subtract(map1, map2->p[i]);
3709 struct isl_set *isl_set_subtract(struct isl_set *set1, struct isl_set *set2)
3711 return (struct isl_set *)
3713 (struct isl_map *)set1, (struct isl_map *)set2);
3716 struct isl_set *isl_set_apply(struct isl_set *set, struct isl_map *map)
3720 isl_assert(set->ctx, isl_map_compatible_domain(map, set), goto error);
3721 map = isl_map_intersect_domain(map, set);
3722 set = isl_map_range(map);
3730 /* There is no need to cow as removing empty parts doesn't change
3731 * the meaning of the set.
3733 struct isl_map *isl_map_remove_empty_parts(struct isl_map *map)
3740 for (i = map->n-1; i >= 0; --i) {
3741 if (!F_ISSET(map->p[i], ISL_BASIC_MAP_EMPTY))
3743 isl_basic_map_free(map->p[i]);
3744 if (i != map->n-1) {
3745 F_CLR(map, ISL_MAP_NORMALIZED);
3746 map->p[i] = map->p[map->n-1];
3754 struct isl_set *isl_set_remove_empty_parts(struct isl_set *set)
3756 return (struct isl_set *)
3757 isl_map_remove_empty_parts((struct isl_map *)set);
3760 struct isl_basic_map *isl_map_copy_basic_map(struct isl_map *map)
3762 struct isl_basic_map *bmap;
3763 if (!map || map->n == 0)
3765 bmap = map->p[map->n-1];
3766 isl_assert(map->ctx, F_ISSET(bmap, ISL_BASIC_SET_FINAL), return NULL);
3767 return isl_basic_map_copy(bmap);
3770 struct isl_basic_set *isl_set_copy_basic_set(struct isl_set *set)
3772 (struct isl_basic_set *)isl_map_copy_basic_map((struct isl_map *)set);
3775 struct isl_map *isl_map_drop_basic_map(struct isl_map *map,
3776 struct isl_basic_map *bmap)
3782 for (i = map->n-1; i >= 0; --i) {
3783 if (map->p[i] != bmap)
3785 map = isl_map_cow(map);
3788 isl_basic_map_free(map->p[i]);
3789 if (i != map->n-1) {
3790 F_CLR(map, ISL_SET_NORMALIZED);
3791 map->p[i] = map->p[map->n-1];
3796 isl_basic_map_free(bmap);
3800 isl_basic_map_free(bmap);
3804 struct isl_set *isl_set_drop_basic_set(struct isl_set *set,
3805 struct isl_basic_set *bset)
3807 (struct isl_set *)isl_map_drop_basic_map((struct isl_map *)set,
3808 (struct isl_basic_map *)bset);
3811 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
3812 * for any common value of the parameters and dimensions preceding dim
3813 * in both basic sets, the values of dimension pos in bset1 are
3814 * smaller or larger than those in bset2.
3817 * 1 if bset1 follows bset2
3818 * -1 if bset1 precedes bset2
3819 * 0 if bset1 and bset2 are incomparable
3820 * -2 if some error occurred.
3822 int isl_basic_set_compare_at(struct isl_basic_set *bset1,
3823 struct isl_basic_set *bset2, int pos)
3825 struct isl_dim *dims;
3826 struct isl_basic_map *bmap1 = NULL;
3827 struct isl_basic_map *bmap2 = NULL;
3828 struct isl_ctx *ctx;
3829 struct isl_vec *obj;
3832 unsigned dim1, dim2;
3834 enum isl_lp_result res;
3837 if (!bset1 || !bset2)
3840 nparam = isl_basic_set_n_param(bset1);
3841 dim1 = isl_basic_set_n_dim(bset1);
3842 dim2 = isl_basic_set_n_dim(bset2);
3843 dims = isl_dim_alloc(bset1->ctx, nparam, pos, dim1 - pos);
3844 bmap1 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset1), dims);
3845 dims = isl_dim_alloc(bset2->ctx, nparam, pos, dim2 - pos);
3846 bmap2 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset2), dims);
3847 if (!bmap1 || !bmap2)
3849 bmap1 = isl_basic_map_extend(bmap1, nparam,
3850 pos, (dim1 - pos) + (dim2 - pos),
3851 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
3852 bmap1 = add_constraints(bmap1, bmap2, 0, dim1 - pos);
3855 total = isl_basic_map_total_dim(bmap1);
3857 obj = isl_vec_alloc(ctx, total);
3858 isl_seq_clr(obj->block.data, total);
3859 isl_int_set_si(obj->block.data[nparam+pos], 1);
3860 isl_int_set_si(obj->block.data[nparam+pos+(dim1-pos)], -1);
3865 res = isl_solve_lp(bmap1, 0, obj->block.data, ctx->one, &num, &den);
3866 if (res == isl_lp_empty)
3868 else if (res == isl_lp_ok && isl_int_is_pos(num))
3870 else if ((res == isl_lp_ok && isl_int_is_neg(num)) ||
3871 res == isl_lp_unbounded)
3877 isl_basic_map_free(bmap1);
3878 isl_vec_free(ctx, obj);
3881 isl_basic_map_free(bmap1);
3882 isl_basic_map_free(bmap2);
3886 static int isl_basic_map_fast_has_fixed_var(struct isl_basic_map *bmap,
3887 unsigned pos, isl_int *val)
3895 total = isl_basic_map_total_dim(bmap);
3896 for (i = 0, d = total-1; i < bmap->n_eq && d+1 > pos; ++i) {
3897 for (; d+1 > pos; --d)
3898 if (!isl_int_is_zero(bmap->eq[i][1+d]))
3902 if (isl_seq_first_non_zero(bmap->eq[i]+1, d) != -1)
3904 if (isl_seq_first_non_zero(bmap->eq[i]+1+d+1, total-d-1) != -1)
3906 if (!isl_int_is_one(bmap->eq[i][1+d]))
3909 isl_int_neg(*val, bmap->eq[i][0]);
3915 static int isl_map_fast_has_fixed_var(struct isl_map *map,
3916 unsigned pos, isl_int *val)
3928 return isl_basic_map_fast_has_fixed_var(map->p[0], pos, val);
3931 fixed = isl_basic_map_fast_has_fixed_var(map->p[0], pos, &v);
3932 for (i = 1; fixed == 1 && i < map->n; ++i) {
3933 fixed = isl_basic_map_fast_has_fixed_var(map->p[i], pos, &tmp);
3934 if (fixed == 1 && isl_int_ne(tmp, v))
3938 isl_int_set(*val, v);
3944 static int isl_set_fast_has_fixed_var(struct isl_set *set, unsigned pos,
3947 return isl_map_fast_has_fixed_var((struct isl_map *)set, pos, val);
3950 int isl_basic_map_fast_is_fixed(struct isl_basic_map *bmap,
3951 enum isl_dim_type type, unsigned pos, isl_int *val)
3953 if (pos >= isl_basic_map_dim(bmap, type))
3955 return isl_basic_map_fast_has_fixed_var(bmap,
3956 isl_basic_map_offset(bmap, type) - 1 + pos, val);
3959 /* Check if dimension dim has fixed value and if so and if val is not NULL,
3960 * then return this fixed value in *val.
3962 int isl_set_fast_dim_is_fixed(struct isl_set *set, unsigned dim, isl_int *val)
3964 return isl_set_fast_has_fixed_var(set, isl_set_n_param(set) + dim, val);
3967 /* Check if input variable in has fixed value and if so and if val is not NULL,
3968 * then return this fixed value in *val.
3970 int isl_map_fast_input_is_fixed(struct isl_map *map, unsigned in, isl_int *val)
3972 return isl_map_fast_has_fixed_var(map, isl_map_n_param(map) + in, val);
3975 /* Check if dimension dim has an (obvious) fixed lower bound and if so
3976 * and if val is not NULL, then return this lower bound in *val.
3978 int isl_basic_set_fast_dim_has_fixed_lower_bound(struct isl_basic_set *bset,
3979 unsigned dim, isl_int *val)
3981 int i, i_eq = -1, i_ineq = -1;
3988 total = isl_basic_set_total_dim(bset);
3989 nparam = isl_basic_set_n_param(bset);
3990 for (i = 0; i < bset->n_eq; ++i) {
3991 if (isl_int_is_zero(bset->eq[i][1+nparam+dim]))
3997 for (i = 0; i < bset->n_ineq; ++i) {
3998 if (!isl_int_is_pos(bset->ineq[i][1+nparam+dim]))
4000 if (i_eq != -1 || i_ineq != -1)
4004 if (i_eq == -1 && i_ineq == -1)
4006 c = i_eq != -1 ? bset->eq[i_eq] : bset->ineq[i_ineq];
4007 /* The coefficient should always be one due to normalization. */
4008 if (!isl_int_is_one(c[1+nparam+dim]))
4010 if (isl_seq_first_non_zero(c+1, nparam+dim) != -1)
4012 if (isl_seq_first_non_zero(c+1+nparam+dim+1,
4013 total - nparam - dim - 1) != -1)
4016 isl_int_neg(*val, c[0]);
4020 int isl_set_fast_dim_has_fixed_lower_bound(struct isl_set *set,
4021 unsigned dim, isl_int *val)
4033 return isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[0],
4037 fixed = isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[0],
4039 for (i = 1; fixed == 1 && i < set->n; ++i) {
4040 fixed = isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[i],
4042 if (fixed == 1 && isl_int_ne(tmp, v))
4046 isl_int_set(*val, v);
4057 static int qsort_constraint_cmp(const void *p1, const void *p2)
4059 const struct constraint *c1 = (const struct constraint *)p1;
4060 const struct constraint *c2 = (const struct constraint *)p2;
4061 unsigned size = isl_min(c1->size, c2->size);
4062 return isl_seq_cmp(c1->c, c2->c, size);
4065 static struct isl_basic_map *isl_basic_map_sort_constraints(
4066 struct isl_basic_map *bmap)
4069 struct constraint *c;
4074 total = isl_basic_map_total_dim(bmap);
4075 c = isl_alloc_array(bmap->ctx, struct constraint, bmap->n_ineq);
4078 for (i = 0; i < bmap->n_ineq; ++i) {
4080 c[i].c = bmap->ineq[i];
4082 qsort(c, bmap->n_ineq, sizeof(struct constraint), qsort_constraint_cmp);
4083 for (i = 0; i < bmap->n_ineq; ++i)
4084 bmap->ineq[i] = c[i].c;
4088 isl_basic_map_free(bmap);
4092 struct isl_basic_map *isl_basic_map_normalize(struct isl_basic_map *bmap)
4096 if (F_ISSET(bmap, ISL_BASIC_MAP_NORMALIZED))
4098 bmap = isl_basic_map_convex_hull(bmap);
4099 bmap = isl_basic_map_sort_constraints(bmap);
4100 F_SET(bmap, ISL_BASIC_MAP_NORMALIZED);
4104 struct isl_basic_set *isl_basic_set_normalize(struct isl_basic_set *bset)
4106 return (struct isl_basic_set *)isl_basic_map_normalize(
4107 (struct isl_basic_map *)bset);
4110 static int isl_basic_map_fast_cmp(const struct isl_basic_map *bmap1,
4111 const struct isl_basic_map *bmap2)
4118 if (isl_basic_map_n_param(bmap1) != isl_basic_map_n_param(bmap2))
4119 return isl_basic_map_n_param(bmap1) - isl_basic_map_n_param(bmap2);
4120 if (isl_basic_map_n_in(bmap1) != isl_basic_map_n_in(bmap2))
4121 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
4122 if (isl_basic_map_n_out(bmap1) != isl_basic_map_n_out(bmap2))
4123 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
4124 if (F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY) &&
4125 F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
4127 if (F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY))
4129 if (F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
4131 if (bmap1->n_eq != bmap2->n_eq)
4132 return bmap1->n_eq - bmap2->n_eq;
4133 if (bmap1->n_ineq != bmap2->n_ineq)
4134 return bmap1->n_ineq - bmap2->n_ineq;
4135 if (bmap1->n_div != bmap2->n_div)
4136 return bmap1->n_div - bmap2->n_div;
4137 total = isl_basic_map_total_dim(bmap1);
4138 for (i = 0; i < bmap1->n_eq; ++i) {
4139 cmp = isl_seq_cmp(bmap1->eq[i], bmap2->eq[i], 1+total);
4143 for (i = 0; i < bmap1->n_ineq; ++i) {
4144 cmp = isl_seq_cmp(bmap1->ineq[i], bmap2->ineq[i], 1+total);
4148 for (i = 0; i < bmap1->n_div; ++i) {
4149 cmp = isl_seq_cmp(bmap1->div[i], bmap2->div[i], 1+1+total);
4156 static int isl_basic_map_fast_is_equal(struct isl_basic_map *bmap1,
4157 struct isl_basic_map *bmap2)
4159 return isl_basic_map_fast_cmp(bmap1, bmap2) == 0;
4162 static int qsort_bmap_cmp(const void *p1, const void *p2)
4164 const struct isl_basic_map *bmap1 = *(const struct isl_basic_map **)p1;
4165 const struct isl_basic_map *bmap2 = *(const struct isl_basic_map **)p2;
4167 return isl_basic_map_fast_cmp(bmap1, bmap2);
4170 /* We normalize in place, but if anything goes wrong we need
4171 * to return NULL, so we need to make sure we don't change the
4172 * meaning of any possible other copies of map.
4174 struct isl_map *isl_map_normalize(struct isl_map *map)
4177 struct isl_basic_map *bmap;
4181 if (F_ISSET(map, ISL_MAP_NORMALIZED))
4183 for (i = 0; i < map->n; ++i) {
4184 bmap = isl_basic_map_normalize(isl_basic_map_copy(map->p[i]));
4187 isl_basic_map_free(map->p[i]);
4190 qsort(map->p, map->n, sizeof(struct isl_basic_map *), qsort_bmap_cmp);
4191 F_SET(map, ISL_MAP_NORMALIZED);
4192 map = isl_map_remove_empty_parts(map);
4195 for (i = map->n - 1; i >= 1; --i) {
4196 if (!isl_basic_map_fast_is_equal(map->p[i-1], map->p[i]))
4198 isl_basic_map_free(map->p[i-1]);
4199 for (j = i; j < map->n; ++j)
4200 map->p[j-1] = map->p[j];
4210 struct isl_set *isl_set_normalize(struct isl_set *set)
4212 return (struct isl_set *)isl_map_normalize((struct isl_map *)set);
4215 int isl_map_fast_is_equal(struct isl_map *map1, struct isl_map *map2)
4225 if (!isl_dim_equal(map1->dim, map2->dim))
4228 map1 = isl_map_copy(map1);
4229 map2 = isl_map_copy(map2);
4230 map1 = isl_map_normalize(map1);
4231 map2 = isl_map_normalize(map2);
4234 equal = map1->n == map2->n;
4235 for (i = 0; equal && i < map1->n; ++i) {
4236 equal = isl_basic_map_fast_is_equal(map1->p[i], map2->p[i]);
4249 int isl_set_fast_is_equal(struct isl_set *set1, struct isl_set *set2)
4251 return isl_map_fast_is_equal((struct isl_map *)set1,
4252 (struct isl_map *)set2);
4255 /* Return an interval that ranges from min to max (inclusive)
4257 struct isl_basic_set *isl_basic_set_interval(struct isl_ctx *ctx,
4258 isl_int min, isl_int max)
4261 struct isl_basic_set *bset = NULL;
4263 bset = isl_basic_set_alloc(ctx, 0, 1, 0, 0, 2);
4267 k = isl_basic_set_alloc_inequality(bset);
4270 isl_int_set_si(bset->ineq[k][1], 1);
4271 isl_int_neg(bset->ineq[k][0], min);
4273 k = isl_basic_set_alloc_inequality(bset);
4276 isl_int_set_si(bset->ineq[k][1], -1);
4277 isl_int_set(bset->ineq[k][0], max);
4281 isl_basic_set_free(bset);
4285 /* Return the Cartesian product of the basic sets in list (in the given order).
4287 struct isl_basic_set *isl_basic_set_product(struct isl_basic_set_list *list)
4295 struct isl_basic_set *product = NULL;
4299 isl_assert(list->ctx, list->n > 0, goto error);
4300 isl_assert(list->ctx, list->p[0], goto error);
4301 nparam = isl_basic_set_n_param(list->p[0]);
4302 dim = isl_basic_set_n_dim(list->p[0]);
4303 extra = list->p[0]->n_div;
4304 n_eq = list->p[0]->n_eq;
4305 n_ineq = list->p[0]->n_ineq;
4306 for (i = 1; i < list->n; ++i) {
4307 isl_assert(list->ctx, list->p[i], goto error);
4308 isl_assert(list->ctx,
4309 nparam == isl_basic_set_n_param(list->p[i]), goto error);
4310 dim += isl_basic_set_n_dim(list->p[i]);
4311 extra += list->p[i]->n_div;
4312 n_eq += list->p[i]->n_eq;
4313 n_ineq += list->p[i]->n_ineq;
4315 product = isl_basic_set_alloc(list->ctx, nparam, dim, extra,
4320 for (i = 0; i < list->n; ++i) {
4321 isl_basic_set_add_constraints(product,
4322 isl_basic_set_copy(list->p[i]), dim);
4323 dim += isl_basic_set_n_dim(list->p[i]);
4325 isl_basic_set_list_free(list);
4328 isl_basic_set_free(product);
4329 isl_basic_set_list_free(list);
4333 struct isl_basic_map *isl_basic_map_product(
4334 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
4336 struct isl_dim *dim_result = NULL;
4337 struct isl_basic_map *bmap;
4338 unsigned in1, in2, out1, out2, nparam, total, pos;
4339 struct isl_dim_map *dim_map1, *dim_map2;
4341 if (!bmap1 || !bmap2)
4344 isl_assert(map1->ctx, isl_dim_match(bmap1->dim, isl_dim_param,
4345 bmap2->dim, isl_dim_param), goto error);
4346 dim_result = isl_dim_product(isl_dim_copy(bmap1->dim),
4347 isl_dim_copy(bmap2->dim));
4349 in1 = isl_basic_map_n_in(bmap1);
4350 in2 = isl_basic_map_n_in(bmap2);
4351 out1 = isl_basic_map_n_out(bmap1);
4352 out2 = isl_basic_map_n_out(bmap2);
4353 nparam = isl_basic_map_n_param(bmap1);
4355 total = nparam + in1 + in2 + out1 + out2 + bmap1->n_div + bmap2->n_div;
4356 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
4357 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
4358 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
4359 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
4360 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
4361 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos += in1);
4362 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += in2);
4363 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += out1);
4364 isl_dim_map_div(dim_map1, bmap1, pos += out2);
4365 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
4367 bmap = isl_basic_map_alloc_dim(dim_result,
4368 bmap1->n_div + bmap2->n_div,
4369 bmap1->n_eq + bmap2->n_eq,
4370 bmap1->n_ineq + bmap2->n_ineq);
4371 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
4372 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
4373 bmap = isl_basic_map_simplify(bmap);
4374 return isl_basic_map_finalize(bmap);
4376 isl_basic_map_free(bmap1);
4377 isl_basic_map_free(bmap2);
4381 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
4383 struct isl_map *isl_map_product(struct isl_map *map1, struct isl_map *map2)
4386 struct isl_map *result;
4392 isl_assert(map1->ctx, isl_dim_match(map1->dim, isl_dim_param,
4393 map2->dim, isl_dim_param), goto error);
4395 if (F_ISSET(map1, ISL_MAP_DISJOINT) &&
4396 F_ISSET(map2, ISL_MAP_DISJOINT))
4397 FL_SET(flags, ISL_MAP_DISJOINT);
4399 result = isl_map_alloc_dim(isl_dim_product(isl_dim_copy(map1->dim),
4400 isl_dim_copy(map2->dim)),
4401 map1->n * map2->n, flags);
4404 for (i = 0; i < map1->n; ++i)
4405 for (j = 0; j < map2->n; ++j) {
4406 struct isl_basic_map *part;
4407 part = isl_basic_map_product(
4408 isl_basic_map_copy(map1->p[i]),
4409 isl_basic_map_copy(map2->p[j]));
4410 if (isl_basic_map_is_empty(part))
4411 isl_basic_map_free(part);
4413 result = isl_map_add(result, part);
4426 uint32_t isl_basic_set_get_hash(struct isl_basic_set *bset)
4434 bset = isl_basic_set_copy(bset);
4435 bset = isl_basic_set_normalize(bset);
4438 total = isl_basic_set_total_dim(bset);
4439 isl_hash_byte(hash, bset->n_eq & 0xFF);
4440 for (i = 0; i < bset->n_eq; ++i) {
4442 c_hash = isl_seq_get_hash(bset->eq[i], 1 + total);
4443 isl_hash_hash(hash, c_hash);
4445 isl_hash_byte(hash, bset->n_ineq & 0xFF);
4446 for (i = 0; i < bset->n_ineq; ++i) {
4448 c_hash = isl_seq_get_hash(bset->ineq[i], 1 + total);
4449 isl_hash_hash(hash, c_hash);
4451 isl_hash_byte(hash, bset->n_div & 0xFF);
4452 for (i = 0; i < bset->n_div; ++i) {
4454 if (isl_int_is_zero(bset->div[i][0]))
4456 isl_hash_byte(hash, i & 0xFF);
4457 c_hash = isl_seq_get_hash(bset->div[i], 1 + 1 + total);
4458 isl_hash_hash(hash, c_hash);
4460 isl_basic_set_free(bset);
4464 uint32_t isl_set_get_hash(struct isl_set *set)
4471 set = isl_set_copy(set);
4472 set = isl_set_normalize(set);
4476 hash = isl_hash_init();
4477 for (i = 0; i < set->n; ++i) {
4479 bset_hash = isl_basic_set_get_hash(set->p[i]);
4480 isl_hash_hash(hash, bset_hash);
4488 /* Check if the value for dimension dim is completely determined
4489 * by the values of the other parameters and variables.
4490 * That is, check if dimension dim is involved in an equality.
4492 int isl_basic_set_dim_is_unique(struct isl_basic_set *bset, unsigned dim)
4499 nparam = isl_basic_set_n_param(bset);
4500 for (i = 0; i < bset->n_eq; ++i)
4501 if (!isl_int_is_zero(bset->eq[i][1 + nparam + dim]))
4506 /* Check if the value for dimension dim is completely determined
4507 * by the values of the other parameters and variables.
4508 * That is, check if dimension dim is involved in an equality
4509 * for each of the subsets.
4511 int isl_set_dim_is_unique(struct isl_set *set, unsigned dim)
4517 for (i = 0; i < set->n; ++i) {
4519 unique = isl_basic_set_dim_is_unique(set->p[i], dim);