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 struct isl_map *isl_map_remove(struct isl_map *map,
1123 enum isl_dim_type type, unsigned first, unsigned n)
1131 map = isl_map_cow(map);
1134 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
1136 for (i = 0; i < map->n; ++i) {
1137 map->p[i] = isl_basic_map_eliminate_vars(map->p[i],
1138 isl_basic_map_offset(map->p[i], type) - 1 + first, n);
1142 map = isl_map_drop(map, type, first, n);
1149 /* Project out n inputs starting at first using Fourier-Motzkin */
1150 struct isl_map *isl_map_remove_inputs(struct isl_map *map,
1151 unsigned first, unsigned n)
1153 return isl_map_remove(map, isl_dim_in, first, n);
1156 /* Project out n dimensions starting at first using Fourier-Motzkin */
1157 struct isl_basic_set *isl_basic_set_remove_dims(struct isl_basic_set *bset,
1158 unsigned first, unsigned n)
1160 unsigned nparam = isl_basic_set_n_param(bset);
1161 bset = isl_basic_set_eliminate_vars(bset, nparam + first, n);
1162 bset = isl_basic_set_drop_dims(bset, first, n);
1166 static void dump_term(struct isl_basic_map *bmap,
1167 isl_int c, int pos, FILE *out)
1170 unsigned in = isl_basic_map_n_in(bmap);
1171 unsigned dim = in + isl_basic_map_n_out(bmap);
1172 unsigned nparam = isl_basic_map_n_param(bmap);
1174 isl_int_print(out, c, 0);
1176 if (!isl_int_is_one(c))
1177 isl_int_print(out, c, 0);
1178 if (pos < 1 + nparam) {
1179 name = isl_dim_get_name(bmap->dim,
1180 isl_dim_param, pos - 1);
1182 fprintf(out, "%s", name);
1184 fprintf(out, "p%d", pos - 1);
1185 } else if (pos < 1 + nparam + in)
1186 fprintf(out, "i%d", pos - 1 - nparam);
1187 else if (pos < 1 + nparam + dim)
1188 fprintf(out, "o%d", pos - 1 - nparam - in);
1190 fprintf(out, "e%d", pos - 1 - nparam - dim);
1194 static void dump_constraint_sign(struct isl_basic_map *bmap, isl_int *c,
1195 int sign, FILE *out)
1199 unsigned len = 1 + isl_basic_map_total_dim(bmap);
1203 for (i = 0, first = 1; i < len; ++i) {
1204 if (isl_int_sgn(c[i]) * sign <= 0)
1207 fprintf(out, " + ");
1209 isl_int_abs(v, c[i]);
1210 dump_term(bmap, v, i, out);
1217 static void dump_constraint(struct isl_basic_map *bmap, isl_int *c,
1218 const char *op, FILE *out, int indent)
1222 fprintf(out, "%*s", indent, "");
1224 dump_constraint_sign(bmap, c, 1, out);
1225 fprintf(out, " %s ", op);
1226 dump_constraint_sign(bmap, c, -1, out);
1230 for (i = bmap->n_div; i < bmap->extra; ++i) {
1231 if (isl_int_is_zero(c[1+isl_dim_total(bmap->dim)+i]))
1233 fprintf(out, "%*s", indent, "");
1234 fprintf(out, "ERROR: unused div coefficient not zero\n");
1239 static void dump_constraints(struct isl_basic_map *bmap,
1240 isl_int **c, unsigned n,
1241 const char *op, FILE *out, int indent)
1245 for (i = 0; i < n; ++i)
1246 dump_constraint(bmap, c[i], op, out, indent);
1249 static void dump_affine(struct isl_basic_map *bmap, isl_int *exp, FILE *out)
1253 unsigned total = isl_basic_map_total_dim(bmap);
1255 for (j = 0; j < 1 + total; ++j) {
1256 if (isl_int_is_zero(exp[j]))
1258 if (!first && isl_int_is_pos(exp[j]))
1260 dump_term(bmap, exp[j], j, out);
1265 static void dump(struct isl_basic_map *bmap, FILE *out, int indent)
1269 dump_constraints(bmap, bmap->eq, bmap->n_eq, "=", out, indent);
1270 dump_constraints(bmap, bmap->ineq, bmap->n_ineq, ">=", out, indent);
1272 for (i = 0; i < bmap->n_div; ++i) {
1273 fprintf(out, "%*s", indent, "");
1274 fprintf(out, "e%d = [(", i);
1275 dump_affine(bmap, bmap->div[i]+1, out);
1277 isl_int_print(out, bmap->div[i][0], 0);
1278 fprintf(out, "]\n");
1282 void isl_basic_set_dump(struct isl_basic_set *bset, FILE *out, int indent)
1285 fprintf(out, "null basic set\n");
1289 fprintf(out, "%*s", indent, "");
1290 fprintf(out, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n",
1291 bset->ref, bset->dim->nparam, bset->dim->n_out,
1292 bset->extra, bset->flags);
1293 dump((struct isl_basic_map *)bset, out, indent);
1296 void isl_basic_map_dump(struct isl_basic_map *bmap, FILE *out, int indent)
1299 fprintf(out, "null basic map\n");
1303 fprintf(out, "%*s", indent, "");
1304 fprintf(out, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, "
1305 "flags: %x, n_name: %d\n",
1307 bmap->dim->nparam, bmap->dim->n_in, bmap->dim->n_out,
1308 bmap->extra, bmap->flags, bmap->dim->n_name);
1309 dump(bmap, out, indent);
1312 int isl_inequality_negate(struct isl_basic_map *bmap, unsigned pos)
1317 total = isl_basic_map_total_dim(bmap);
1318 isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
1319 isl_seq_neg(bmap->ineq[pos], bmap->ineq[pos], 1 + total);
1320 isl_int_sub_ui(bmap->ineq[pos][0], bmap->ineq[pos][0], 1);
1321 F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1325 struct isl_set *isl_set_alloc_dim(struct isl_dim *dim, int n, unsigned flags)
1327 struct isl_set *set;
1331 isl_assert(dim->ctx, dim->n_in == 0, return NULL);
1332 isl_assert(dim->ctx, n >= 0, return NULL);
1333 set = isl_alloc(dim->ctx, struct isl_set,
1334 sizeof(struct isl_set) +
1335 n * sizeof(struct isl_basic_set *));
1339 set->ctx = dim->ctx;
1340 isl_ctx_ref(set->ctx);
1352 struct isl_set *isl_set_alloc(struct isl_ctx *ctx,
1353 unsigned nparam, unsigned dim, int n, unsigned flags)
1355 struct isl_set *set;
1356 struct isl_dim *dims;
1358 dims = isl_dim_alloc(ctx, nparam, 0, dim);
1362 set = isl_set_alloc_dim(dims, n, flags);
1366 struct isl_set *isl_set_dup(struct isl_set *set)
1369 struct isl_set *dup;
1374 dup = isl_set_alloc_dim(isl_dim_copy(set->dim), set->n, set->flags);
1377 for (i = 0; i < set->n; ++i)
1378 dup = isl_set_add(dup, isl_basic_set_copy(set->p[i]));
1382 struct isl_set *isl_set_from_basic_set(struct isl_basic_set *bset)
1384 struct isl_set *set;
1389 set = isl_set_alloc_dim(isl_dim_copy(bset->dim), 1, ISL_MAP_DISJOINT);
1391 isl_basic_set_free(bset);
1394 return isl_set_add(set, bset);
1397 struct isl_map *isl_map_from_basic_map(struct isl_basic_map *bmap)
1399 struct isl_map *map;
1404 map = isl_map_alloc_dim(isl_dim_copy(bmap->dim), 1, ISL_MAP_DISJOINT);
1406 isl_basic_map_free(bmap);
1409 return isl_map_add(map, bmap);
1412 struct isl_set *isl_set_add(struct isl_set *set, struct isl_basic_set *bset)
1416 isl_assert(set->ctx, isl_dim_equal(set->dim, bset->dim), goto error);
1417 isl_assert(set->ctx, set->n < set->size, goto error);
1418 set->p[set->n] = bset;
1425 isl_basic_set_free(bset);
1429 void isl_set_free(struct isl_set *set)
1439 isl_ctx_deref(set->ctx);
1440 for (i = 0; i < set->n; ++i)
1441 isl_basic_set_free(set->p[i]);
1442 isl_dim_free(set->dim);
1446 void isl_set_dump(struct isl_set *set, FILE *out, int indent)
1451 fprintf(out, "null set\n");
1455 fprintf(out, "%*s", indent, "");
1456 fprintf(out, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
1457 set->ref, set->n, set->dim->nparam, set->dim->n_out,
1459 for (i = 0; i < set->n; ++i) {
1460 fprintf(out, "%*s", indent, "");
1461 fprintf(out, "basic set %d:\n", i);
1462 isl_basic_set_dump(set->p[i], out, indent+4);
1466 void isl_map_dump(struct isl_map *map, FILE *out, int indent)
1471 fprintf(out, "null map\n");
1475 fprintf(out, "%*s", indent, "");
1476 fprintf(out, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, "
1477 "flags: %x, n_name: %d\n",
1478 map->ref, map->n, map->dim->nparam, map->dim->n_in,
1479 map->dim->n_out, map->flags, map->dim->n_name);
1480 for (i = 0; i < map->n; ++i) {
1481 fprintf(out, "%*s", indent, "");
1482 fprintf(out, "basic map %d:\n", i);
1483 isl_basic_map_dump(map->p[i], out, indent+4);
1487 struct isl_basic_map *isl_basic_map_intersect_domain(
1488 struct isl_basic_map *bmap, struct isl_basic_set *bset)
1490 struct isl_basic_map *bmap_domain;
1491 struct isl_dim *dim;
1496 isl_assert(bset->ctx, isl_dim_match(bmap->dim, isl_dim_param,
1497 bset->dim, isl_dim_param), goto error);
1499 if (isl_dim_size(bset->dim, isl_dim_set) != 0)
1500 isl_assert(bset->ctx,
1501 isl_basic_map_compatible_domain(bmap, bset), goto error);
1503 bmap = isl_basic_map_extend_dim(bmap, isl_dim_copy(bmap->dim),
1504 bset->n_div, bset->n_eq, bset->n_ineq);
1507 dim = isl_dim_reverse(isl_dim_copy(bset->dim));
1508 bmap_domain = isl_basic_map_from_basic_set(bset, dim);
1509 bmap = add_constraints(bmap, bmap_domain, 0, 0);
1511 bmap = isl_basic_map_simplify(bmap);
1512 return isl_basic_map_finalize(bmap);
1514 isl_basic_map_free(bmap);
1515 isl_basic_set_free(bset);
1519 struct isl_basic_map *isl_basic_map_intersect_range(
1520 struct isl_basic_map *bmap, struct isl_basic_set *bset)
1522 struct isl_basic_map *bmap_range;
1527 isl_assert(bset->ctx, isl_dim_match(bmap->dim, isl_dim_param,
1528 bset->dim, isl_dim_param), goto error);
1530 if (isl_dim_size(bset->dim, isl_dim_set) != 0)
1531 isl_assert(bset->ctx,
1532 isl_basic_map_compatible_range(bmap, bset), goto error);
1534 bmap = isl_basic_map_extend_dim(bmap, isl_dim_copy(bmap->dim),
1535 bset->n_div, bset->n_eq, bset->n_ineq);
1538 bmap_range = isl_basic_map_from_basic_set(bset, isl_dim_copy(bset->dim));
1539 bmap = add_constraints(bmap, bmap_range, 0, 0);
1541 bmap = isl_basic_map_simplify(bmap);
1542 return isl_basic_map_finalize(bmap);
1544 isl_basic_map_free(bmap);
1545 isl_basic_set_free(bset);
1549 struct isl_basic_map *isl_basic_map_intersect(
1550 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
1552 if (!bmap1 || !bmap2)
1555 isl_assert(bmap1->ctx, isl_dim_match(bmap1->dim, isl_dim_param,
1556 bmap2->dim, isl_dim_param), goto error);
1557 if (isl_dim_total(bmap1->dim) ==
1558 isl_dim_size(bmap1->dim, isl_dim_param) &&
1559 isl_dim_total(bmap2->dim) !=
1560 isl_dim_size(bmap2->dim, isl_dim_param))
1561 return isl_basic_map_intersect(bmap2, bmap1);
1563 if (isl_dim_total(bmap2->dim) !=
1564 isl_dim_size(bmap2->dim, isl_dim_param))
1565 isl_assert(bmap1->ctx,
1566 isl_dim_equal(bmap1->dim, bmap2->dim), goto error);
1568 bmap1 = isl_basic_map_extend_dim(bmap1, isl_dim_copy(bmap1->dim),
1569 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
1572 bmap1 = add_constraints(bmap1, bmap2, 0, 0);
1574 bmap1 = isl_basic_map_simplify(bmap1);
1575 return isl_basic_map_finalize(bmap1);
1577 isl_basic_map_free(bmap1);
1578 isl_basic_map_free(bmap2);
1582 struct isl_basic_set *isl_basic_set_intersect(
1583 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
1585 return (struct isl_basic_set *)
1586 isl_basic_map_intersect(
1587 (struct isl_basic_map *)bset1,
1588 (struct isl_basic_map *)bset2);
1591 struct isl_map *isl_map_intersect(struct isl_map *map1, struct isl_map *map2)
1594 struct isl_map *result;
1600 isl_assert(map1->ctx, isl_dim_match(map1->dim, isl_dim_param,
1601 map2->dim, isl_dim_param), goto error);
1602 if (isl_dim_total(map1->dim) ==
1603 isl_dim_size(map1->dim, isl_dim_param) &&
1604 isl_dim_total(map2->dim) != isl_dim_size(map2->dim, isl_dim_param))
1605 return isl_map_intersect(map2, map1);
1607 if (isl_dim_total(map2->dim) != isl_dim_size(map2->dim, isl_dim_param))
1608 isl_assert(map1->ctx,
1609 isl_dim_equal(map1->dim, map2->dim), goto error);
1611 if (F_ISSET(map1, ISL_MAP_DISJOINT) &&
1612 F_ISSET(map2, ISL_MAP_DISJOINT))
1613 FL_SET(flags, ISL_MAP_DISJOINT);
1615 result = isl_map_alloc_dim(isl_dim_copy(map1->dim),
1616 map1->n * map2->n, flags);
1619 for (i = 0; i < map1->n; ++i)
1620 for (j = 0; j < map2->n; ++j) {
1621 struct isl_basic_map *part;
1622 part = isl_basic_map_intersect(
1623 isl_basic_map_copy(map1->p[i]),
1624 isl_basic_map_copy(map2->p[j]));
1625 if (isl_basic_map_is_empty(part))
1626 isl_basic_map_free(part);
1628 result = isl_map_add(result, part);
1641 struct isl_set *isl_set_intersect(struct isl_set *set1, struct isl_set *set2)
1643 return (struct isl_set *)
1644 isl_map_intersect((struct isl_map *)set1,
1645 (struct isl_map *)set2);
1648 struct isl_basic_map *isl_basic_map_reverse(struct isl_basic_map *bmap)
1650 struct isl_dim *dim;
1651 struct isl_basic_set *bset;
1656 bmap = isl_basic_map_cow(bmap);
1659 dim = isl_dim_reverse(isl_dim_copy(bmap->dim));
1660 in = isl_basic_map_n_in(bmap);
1661 bset = isl_basic_set_from_basic_map(bmap);
1662 bset = isl_basic_set_swap_vars(bset, in);
1663 return isl_basic_map_from_basic_set(bset, dim);
1666 /* Turn final n dimensions into existentially quantified variables.
1668 struct isl_basic_set *isl_basic_set_project_out(
1669 struct isl_basic_set *bset, unsigned n, unsigned flags)
1679 isl_assert(bset->ctx, n <= isl_basic_set_n_dim(bset), goto error);
1684 bset = isl_basic_set_cow(bset);
1686 row_size = 1 + isl_dim_total(bset->dim) + bset->extra;
1687 old = bset->block2.data;
1688 bset->block2 = isl_blk_extend(bset->ctx, bset->block2,
1689 (bset->extra + n) * (1 + row_size));
1690 if (!bset->block2.data)
1692 new_div = isl_alloc_array(ctx, isl_int *, bset->extra + n);
1695 for (i = 0; i < n; ++i) {
1696 new_div[i] = bset->block2.data +
1697 (bset->extra + i) * (1 + row_size);
1698 isl_seq_clr(new_div[i], 1 + row_size);
1700 for (i = 0; i < bset->extra; ++i)
1701 new_div[n + i] = bset->block2.data + (bset->div[i] - old);
1703 bset->div = new_div;
1706 bset->dim = isl_dim_drop_outputs(bset->dim,
1707 isl_basic_set_n_dim(bset) - n, n);
1710 bset = isl_basic_set_simplify(bset);
1711 return isl_basic_set_finalize(bset);
1713 isl_basic_set_free(bset);
1717 struct isl_basic_map *add_divs(struct isl_basic_map *bmap, unsigned n)
1721 for (i = 0; i < n; ++i) {
1722 j = isl_basic_map_alloc_div(bmap);
1725 isl_seq_clr(bmap->div[j], 1+1+isl_basic_map_total_dim(bmap));
1729 isl_basic_map_free(bmap);
1733 struct isl_basic_map *isl_basic_map_apply_range(
1734 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
1736 struct isl_dim *dim_result = NULL;
1737 struct isl_basic_map *bmap;
1738 unsigned n_in, n_out, n, nparam, total, pos;
1739 struct isl_dim_map *dim_map1, *dim_map2;
1741 if (!bmap1 || !bmap2)
1744 dim_result = isl_dim_join(isl_dim_copy(bmap1->dim),
1745 isl_dim_copy(bmap2->dim));
1747 n_in = isl_basic_map_n_in(bmap1);
1748 n_out = isl_basic_map_n_out(bmap2);
1749 n = isl_basic_map_n_out(bmap1);
1750 nparam = isl_basic_map_n_param(bmap1);
1752 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + n;
1753 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
1754 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
1755 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
1756 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
1757 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
1758 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_in);
1759 isl_dim_map_div(dim_map1, bmap1, pos += n_out);
1760 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
1761 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
1762 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
1764 bmap = isl_basic_map_alloc_dim(dim_result,
1765 bmap1->n_div + bmap2->n_div + n,
1766 bmap1->n_eq + bmap2->n_eq,
1767 bmap1->n_ineq + bmap2->n_ineq);
1768 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
1769 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
1770 bmap = add_divs(bmap, n);
1771 bmap = isl_basic_map_simplify(bmap);
1772 return isl_basic_map_finalize(bmap);
1774 isl_basic_map_free(bmap1);
1775 isl_basic_map_free(bmap2);
1779 struct isl_basic_set *isl_basic_set_apply(
1780 struct isl_basic_set *bset, struct isl_basic_map *bmap)
1785 isl_assert(set->ctx, isl_basic_map_compatible_domain(bmap, bset),
1788 return (struct isl_basic_set *)
1789 isl_basic_map_apply_range((struct isl_basic_map *)bset, bmap);
1791 isl_basic_set_free(bset);
1792 isl_basic_map_free(bmap);
1796 struct isl_basic_map *isl_basic_map_apply_domain(
1797 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
1799 if (!bmap1 || !bmap2)
1803 isl_basic_map_n_in(bmap1) == isl_basic_map_n_in(bmap2), goto error);
1805 isl_basic_map_n_param(bmap1) == isl_basic_map_n_param(bmap2),
1808 bmap1 = isl_basic_map_reverse(bmap1);
1809 bmap1 = isl_basic_map_apply_range(bmap1, bmap2);
1810 return isl_basic_map_reverse(bmap1);
1812 isl_basic_map_free(bmap1);
1813 isl_basic_map_free(bmap2);
1817 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
1818 * A \cap B -> f(A) + f(B)
1820 struct isl_basic_map *isl_basic_map_sum(
1821 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
1823 unsigned n_in, n_out, nparam, total, pos;
1824 struct isl_basic_map *bmap = NULL;
1825 struct isl_dim_map *dim_map1, *dim_map2;
1828 if (!bmap1 || !bmap2)
1831 isl_assert(bmap1->ctx, isl_dim_equal(bmap1->dim, bmap2->dim),
1834 nparam = isl_basic_map_n_param(bmap1);
1835 n_in = isl_basic_map_n_in(bmap1);
1836 n_out = isl_basic_map_n_out(bmap1);
1838 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + 2 * n_out;
1839 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
1840 dim_map2 = isl_dim_map_alloc(bmap2->ctx, total);
1841 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
1842 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos);
1843 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
1844 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
1845 isl_dim_map_div(dim_map1, bmap1, pos += n_in + n_out);
1846 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
1847 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
1848 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_out);
1850 bmap = isl_basic_map_alloc_dim(isl_dim_copy(bmap1->dim),
1851 bmap1->n_div + bmap2->n_div + 2 * n_out,
1852 bmap1->n_eq + bmap2->n_eq + n_out,
1853 bmap1->n_ineq + bmap2->n_ineq);
1854 for (i = 0; i < n_out; ++i) {
1855 int j = isl_basic_map_alloc_equality(bmap);
1858 isl_seq_clr(bmap->eq[j], 1+total);
1859 isl_int_set_si(bmap->eq[j][1+nparam+n_in+i], -1);
1860 isl_int_set_si(bmap->eq[j][1+pos+i], 1);
1861 isl_int_set_si(bmap->eq[j][1+pos-n_out+i], 1);
1863 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
1864 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
1865 bmap = add_divs(bmap, 2 * n_out);
1867 bmap = isl_basic_map_simplify(bmap);
1868 return isl_basic_map_finalize(bmap);
1870 isl_basic_map_free(bmap);
1871 isl_basic_map_free(bmap1);
1872 isl_basic_map_free(bmap2);
1876 /* Given a basic map A -> f(A), construct A -> -f(A).
1878 struct isl_basic_map *isl_basic_map_neg(struct isl_basic_map *bmap)
1883 bmap = isl_basic_map_cow(bmap);
1887 n = isl_basic_map_dim(bmap, isl_dim_out);
1888 off = isl_basic_map_offset(bmap, isl_dim_out);
1889 for (i = 0; i < bmap->n_eq; ++i)
1890 for (j = 0; j < n; ++j)
1891 isl_int_neg(bmap->eq[i][off+j], bmap->eq[i][off+j]);
1892 for (i = 0; i < bmap->n_ineq; ++i)
1893 for (j = 0; j < n; ++j)
1894 isl_int_neg(bmap->ineq[i][off+j], bmap->ineq[i][off+j]);
1895 for (i = 0; i < bmap->n_div; ++i)
1896 for (j = 0; j < n; ++j)
1897 isl_int_neg(bmap->div[i][1+off+j], bmap->div[i][1+off+j]);
1898 return isl_basic_map_finalize(bmap);
1901 /* Given a basic map A -> f(A) and an integer d, construct a basic map
1902 * A -> floor(f(A)/d).
1904 struct isl_basic_map *isl_basic_map_floordiv(struct isl_basic_map *bmap,
1907 unsigned n_in, n_out, nparam, total, pos;
1908 struct isl_basic_map *result = NULL;
1909 struct isl_dim_map *dim_map;
1915 nparam = isl_basic_map_n_param(bmap);
1916 n_in = isl_basic_map_n_in(bmap);
1917 n_out = isl_basic_map_n_out(bmap);
1919 total = nparam + n_in + n_out + bmap->n_div + n_out;
1920 dim_map = isl_dim_map_alloc(bmap->ctx, total);
1921 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_param, pos = 0);
1922 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_in, pos += nparam);
1923 isl_dim_map_div(dim_map, bmap, pos += n_in + n_out);
1924 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_out, pos += bmap->n_div);
1926 result = isl_basic_map_alloc_dim(isl_dim_copy(bmap->dim),
1927 bmap->n_div + n_out,
1928 bmap->n_eq, bmap->n_ineq + 2 * n_out);
1929 result = add_constraints_dim_map(result, bmap, dim_map);
1930 result = add_divs(result, n_out);
1931 for (i = 0; i < n_out; ++i) {
1933 j = isl_basic_map_alloc_inequality(result);
1936 isl_seq_clr(result->ineq[j], 1+total);
1937 isl_int_neg(result->ineq[j][1+nparam+n_in+i], d);
1938 isl_int_set_si(result->ineq[j][1+pos+i], 1);
1939 j = isl_basic_map_alloc_inequality(result);
1942 isl_seq_clr(result->ineq[j], 1+total);
1943 isl_int_set(result->ineq[j][1+nparam+n_in+i], d);
1944 isl_int_set_si(result->ineq[j][1+pos+i], -1);
1945 isl_int_sub_ui(result->ineq[j][0], d, 1);
1948 result = isl_basic_map_simplify(result);
1949 return isl_basic_map_finalize(result);
1951 isl_basic_map_free(result);
1955 static struct isl_basic_map *var_equal(struct isl_basic_map *bmap, unsigned pos)
1961 i = isl_basic_map_alloc_equality(bmap);
1964 nparam = isl_basic_map_n_param(bmap);
1965 n_in = isl_basic_map_n_in(bmap);
1966 isl_seq_clr(bmap->eq[i], 1 + isl_basic_map_total_dim(bmap));
1967 isl_int_set_si(bmap->eq[i][1+nparam+pos], -1);
1968 isl_int_set_si(bmap->eq[i][1+nparam+n_in+pos], 1);
1969 return isl_basic_map_finalize(bmap);
1971 isl_basic_map_free(bmap);
1975 static struct isl_basic_map *var_more(struct isl_basic_map *bmap, unsigned pos)
1981 i = isl_basic_map_alloc_inequality(bmap);
1984 nparam = isl_basic_map_n_param(bmap);
1985 n_in = isl_basic_map_n_in(bmap);
1986 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
1987 isl_int_set_si(bmap->ineq[i][0], -1);
1988 isl_int_set_si(bmap->ineq[i][1+nparam+pos], -1);
1989 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], 1);
1990 return isl_basic_map_finalize(bmap);
1992 isl_basic_map_free(bmap);
1996 static struct isl_basic_map *var_less(struct isl_basic_map *bmap, unsigned pos)
2002 i = isl_basic_map_alloc_inequality(bmap);
2005 nparam = isl_basic_map_n_param(bmap);
2006 n_in = isl_basic_map_n_in(bmap);
2007 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
2008 isl_int_set_si(bmap->ineq[i][0], -1);
2009 isl_int_set_si(bmap->ineq[i][1+nparam+pos], 1);
2010 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], -1);
2011 return isl_basic_map_finalize(bmap);
2013 isl_basic_map_free(bmap);
2017 struct isl_basic_map *isl_basic_map_equal(struct isl_dim *dim, unsigned n_equal)
2020 struct isl_basic_map *bmap;
2021 bmap = isl_basic_map_alloc_dim(dim, 0, n_equal, 0);
2024 for (i = 0; i < n_equal && bmap; ++i)
2025 bmap = var_equal(bmap, i);
2026 return isl_basic_map_finalize(bmap);
2029 struct isl_basic_map *isl_basic_map_less_at(struct isl_dim *dim, unsigned pos)
2032 struct isl_basic_map *bmap;
2033 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
2036 for (i = 0; i < pos && bmap; ++i)
2037 bmap = var_equal(bmap, i);
2039 bmap = var_less(bmap, pos);
2040 return isl_basic_map_finalize(bmap);
2043 struct isl_basic_map *isl_basic_map_more_at(struct isl_dim *dim, unsigned pos)
2046 struct isl_basic_map *bmap;
2047 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
2050 for (i = 0; i < pos && bmap; ++i)
2051 bmap = var_equal(bmap, i);
2053 bmap = var_more(bmap, pos);
2054 return isl_basic_map_finalize(bmap);
2057 struct isl_basic_map *isl_basic_map_from_basic_set(
2058 struct isl_basic_set *bset, struct isl_dim *dim)
2060 struct isl_basic_map *bmap;
2062 bset = isl_basic_set_cow(bset);
2066 isl_assert(bset->ctx, isl_dim_compatible(bset->dim, dim), goto error);
2067 isl_dim_free(bset->dim);
2068 bmap = (struct isl_basic_map *) bset;
2070 return isl_basic_map_finalize(bmap);
2072 isl_basic_set_free(bset);
2077 struct isl_basic_set *isl_basic_set_from_basic_map(struct isl_basic_map *bmap)
2081 if (bmap->dim->n_in == 0)
2082 return (struct isl_basic_set *)bmap;
2083 bmap = isl_basic_map_cow(bmap);
2086 bmap->dim = isl_dim_cow(bmap->dim);
2089 bmap->dim->n_out += bmap->dim->n_in;
2090 bmap->dim->n_in = 0;
2091 bmap = isl_basic_map_finalize(bmap);
2092 return (struct isl_basic_set *)bmap;
2094 isl_basic_map_free(bmap);
2098 /* For a div d = floor(f/m), add the constraints
2101 * -(f-(n-1)) + m d >= 0
2103 * Note that the second constraint is the negation of
2107 static int add_div_constraints(struct isl_basic_map *bmap, unsigned div)
2110 unsigned total = isl_basic_map_total_dim(bmap);
2111 unsigned div_pos = 1 + total - bmap->n_div + div;
2113 i = isl_basic_map_alloc_inequality(bmap);
2116 isl_seq_cpy(bmap->ineq[i], bmap->div[div]+1, 1+total);
2117 isl_int_neg(bmap->ineq[i][div_pos], bmap->div[div][0]);
2119 j = isl_basic_map_alloc_inequality(bmap);
2122 isl_seq_neg(bmap->ineq[j], bmap->ineq[i], 1 + total);
2123 isl_int_add(bmap->ineq[j][0], bmap->ineq[j][0], bmap->ineq[j][div_pos]);
2124 isl_int_sub_ui(bmap->ineq[j][0], bmap->ineq[j][0], 1);
2128 struct isl_basic_set *isl_basic_map_underlying_set(
2129 struct isl_basic_map *bmap)
2133 if (bmap->dim->nparam == 0 && bmap->dim->n_in == 0 && bmap->n_div == 0)
2134 return (struct isl_basic_set *)bmap;
2135 bmap = isl_basic_map_cow(bmap);
2138 bmap->dim = isl_dim_underlying(bmap->dim, bmap->n_div);
2141 bmap->extra -= bmap->n_div;
2143 bmap = isl_basic_map_finalize(bmap);
2144 return (struct isl_basic_set *)bmap;
2149 struct isl_basic_map *isl_basic_map_overlying_set(
2150 struct isl_basic_set *bset, struct isl_basic_map *like)
2152 struct isl_basic_map *bmap;
2153 struct isl_ctx *ctx;
2160 isl_assert(ctx, bset->n_div == 0, goto error);
2161 isl_assert(ctx, isl_basic_set_n_param(bset) == 0, goto error);
2162 isl_assert(ctx, bset->dim->n_out == isl_basic_map_total_dim(like),
2164 if (isl_dim_equal(bset->dim, like->dim) && like->n_div == 0) {
2165 isl_basic_map_free(like);
2166 return (struct isl_basic_map *)bset;
2168 bset = isl_basic_set_cow(bset);
2171 total = bset->dim->n_out + bset->extra;
2172 bmap = (struct isl_basic_map *)bset;
2173 isl_dim_free(bmap->dim);
2174 bmap->dim = isl_dim_copy(like->dim);
2177 bmap->n_div = like->n_div;
2178 bmap->extra += like->n_div;
2181 ltotal = total - bmap->extra + like->extra;
2184 bmap->block2 = isl_blk_extend(ctx, bmap->block2,
2185 bmap->extra * (1 + 1 + total));
2186 if (isl_blk_is_error(bmap->block2))
2188 bmap->div = isl_realloc_array(ctx, bmap->div, isl_int *,
2192 for (i = 0; i < bmap->extra; ++i)
2193 bmap->div[i] = bmap->block2.data + i * (1 + 1 + total);
2194 for (i = 0; i < like->n_div; ++i) {
2195 isl_seq_cpy(bmap->div[i], like->div[i], 1 + 1 + ltotal);
2196 isl_seq_clr(bmap->div[i]+1+1+ltotal, total - ltotal);
2198 bmap = isl_basic_map_extend_constraints(bmap,
2199 0, 2 * like->n_div);
2200 for (i = 0; i < like->n_div; ++i) {
2201 if (isl_int_is_zero(bmap->div[i][0]))
2203 if (add_div_constraints(bmap, i) < 0)
2207 isl_basic_map_free(like);
2208 bmap = isl_basic_map_simplify(bmap);
2209 bmap = isl_basic_map_finalize(bmap);
2212 isl_basic_map_free(like);
2213 isl_basic_set_free(bset);
2217 struct isl_basic_set *isl_basic_set_from_underlying_set(
2218 struct isl_basic_set *bset, struct isl_basic_set *like)
2220 return (struct isl_basic_set *)
2221 isl_basic_map_overlying_set(bset, (struct isl_basic_map *)like);
2224 struct isl_set *isl_set_from_underlying_set(
2225 struct isl_set *set, struct isl_basic_set *like)
2231 isl_assert(set->ctx, set->dim->n_out == isl_basic_set_total_dim(like),
2233 if (isl_dim_equal(set->dim, like->dim) && like->n_div == 0) {
2234 isl_basic_set_free(like);
2237 set = isl_set_cow(set);
2240 for (i = 0; i < set->n; ++i) {
2241 set->p[i] = isl_basic_set_from_underlying_set(set->p[i],
2242 isl_basic_set_copy(like));
2246 isl_dim_free(set->dim);
2247 set->dim = isl_dim_copy(like->dim);
2250 isl_basic_set_free(like);
2253 isl_basic_set_free(like);
2258 struct isl_set *isl_map_underlying_set(struct isl_map *map)
2262 map = isl_map_cow(map);
2265 map->dim = isl_dim_cow(map->dim);
2269 for (i = 1; i < map->n; ++i)
2270 isl_assert(map->ctx, map->p[0]->n_div == map->p[i]->n_div,
2272 for (i = 0; i < map->n; ++i) {
2273 map->p[i] = (struct isl_basic_map *)
2274 isl_basic_map_underlying_set(map->p[i]);
2279 map->dim = isl_dim_underlying(map->dim, 0);
2281 isl_dim_free(map->dim);
2282 map->dim = isl_dim_copy(map->p[0]->dim);
2286 return (struct isl_set *)map;
2292 struct isl_set *isl_set_to_underlying_set(struct isl_set *set)
2294 return (struct isl_set *)isl_map_underlying_set((struct isl_map *)set);
2297 struct isl_basic_set *isl_basic_map_domain(struct isl_basic_map *bmap)
2299 struct isl_basic_set *domain;
2303 n_out = isl_basic_map_n_out(bmap);
2304 domain = isl_basic_set_from_basic_map(bmap);
2305 return isl_basic_set_project_out(domain, n_out, 0);
2308 struct isl_basic_set *isl_basic_map_range(struct isl_basic_map *bmap)
2310 return isl_basic_map_domain(isl_basic_map_reverse(bmap));
2313 struct isl_set *isl_map_range(struct isl_map *map)
2316 struct isl_set *set;
2320 map = isl_map_cow(map);
2324 set = (struct isl_set *) map;
2325 if (set->dim->n_in != 0) {
2326 set->dim = isl_dim_drop_inputs(set->dim, 0, set->dim->n_in);
2330 for (i = 0; i < map->n; ++i) {
2331 set->p[i] = isl_basic_map_range(map->p[i]);
2335 F_CLR(set, ISL_MAP_DISJOINT);
2336 F_CLR(set, ISL_SET_NORMALIZED);
2343 struct isl_map *isl_map_from_set(struct isl_set *set, struct isl_dim *dim)
2346 struct isl_map *map = NULL;
2348 set = isl_set_cow(set);
2351 isl_assert(set->ctx, isl_dim_compatible(set->dim, dim), goto error);
2352 map = (struct isl_map *)set;
2353 for (i = 0; i < set->n; ++i) {
2354 map->p[i] = isl_basic_map_from_basic_set(
2355 set->p[i], isl_dim_copy(dim));
2359 isl_dim_free(map->dim);
2368 struct isl_map *isl_map_from_range(struct isl_set *set)
2370 return (struct isl_map *)set;
2373 struct isl_set *isl_set_from_map(struct isl_map *map)
2376 struct isl_set *set = NULL;
2380 map = isl_map_cow(map);
2383 map->dim = isl_dim_cow(map->dim);
2386 map->dim->n_out += map->dim->n_in;
2388 set = (struct isl_set *)map;
2389 for (i = 0; i < map->n; ++i) {
2390 set->p[i] = isl_basic_set_from_basic_map(map->p[i]);
2400 struct isl_map *isl_map_alloc_dim(struct isl_dim *dim, int n, unsigned flags)
2402 struct isl_map *map;
2406 isl_assert(dim->ctx, n >= 0, return NULL);
2407 map = isl_alloc(dim->ctx, struct isl_map,
2408 sizeof(struct isl_map) +
2409 n * sizeof(struct isl_basic_map *));
2413 map->ctx = dim->ctx;
2414 isl_ctx_ref(map->ctx);
2426 struct isl_map *isl_map_alloc(struct isl_ctx *ctx,
2427 unsigned nparam, unsigned in, unsigned out, int n,
2430 struct isl_map *map;
2431 struct isl_dim *dims;
2433 dims = isl_dim_alloc(ctx, nparam, in, out);
2437 map = isl_map_alloc_dim(dims, n, flags);
2441 struct isl_basic_map *isl_basic_map_empty(struct isl_ctx *ctx,
2442 unsigned nparam, unsigned in, unsigned out)
2444 struct isl_basic_map *bmap;
2445 bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, 1, 0);
2446 bmap = isl_basic_map_set_to_empty(bmap);
2450 struct isl_basic_set *isl_basic_set_empty(struct isl_dim *dim)
2452 struct isl_basic_set *bset;
2453 bset = isl_basic_set_alloc_dim(dim, 0, 1, 0);
2454 bset = isl_basic_set_set_to_empty(bset);
2458 struct isl_basic_map *isl_basic_map_empty_like(struct isl_basic_map *model)
2460 struct isl_basic_map *bmap;
2463 bmap = isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
2464 bmap = isl_basic_map_set_to_empty(bmap);
2468 struct isl_basic_map *isl_basic_map_empty_like_map(struct isl_map *model)
2470 struct isl_basic_map *bmap;
2473 bmap = isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
2474 bmap = isl_basic_map_set_to_empty(bmap);
2478 struct isl_basic_set *isl_basic_set_empty_like(struct isl_basic_set *model)
2480 struct isl_basic_set *bset;
2483 bset = isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
2484 bset = isl_basic_set_set_to_empty(bset);
2488 struct isl_basic_map *isl_basic_map_universe(struct isl_dim *dim)
2490 struct isl_basic_map *bmap;
2491 bmap = isl_basic_map_alloc_dim(dim, 0, 0, 0);
2495 struct isl_basic_set *isl_basic_set_universe(struct isl_dim *dim)
2497 struct isl_basic_set *bset;
2498 bset = isl_basic_set_alloc_dim(dim, 0, 0, 0);
2502 struct isl_basic_set *isl_basic_set_universe_like(struct isl_basic_set *model)
2506 return isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
2509 struct isl_map *isl_map_empty(struct isl_dim *dim)
2511 return isl_map_alloc_dim(dim, 0, ISL_MAP_DISJOINT);
2514 struct isl_map *isl_map_empty_like(struct isl_map *model)
2518 return isl_map_alloc_dim(isl_dim_copy(model->dim), 0, ISL_MAP_DISJOINT);
2521 struct isl_map *isl_map_empty_like_basic_map(struct isl_basic_map *model)
2525 return isl_map_alloc_dim(isl_dim_copy(model->dim), 0, ISL_MAP_DISJOINT);
2528 struct isl_set *isl_set_empty(struct isl_dim *dim)
2530 return isl_set_alloc_dim(dim, 0, ISL_MAP_DISJOINT);
2533 struct isl_set *isl_set_empty_like(struct isl_set *model)
2537 return isl_set_empty(isl_dim_copy(model->dim));
2540 struct isl_set *isl_set_universe(struct isl_dim *dim)
2542 struct isl_set *set;
2545 set = isl_set_alloc_dim(isl_dim_copy(dim), 1, ISL_MAP_DISJOINT);
2546 set = isl_set_add(set, isl_basic_set_universe(dim));
2550 struct isl_map *isl_map_dup(struct isl_map *map)
2553 struct isl_map *dup;
2557 dup = isl_map_alloc_dim(isl_dim_copy(map->dim), map->n, map->flags);
2558 for (i = 0; i < map->n; ++i)
2559 dup = isl_map_add(dup, isl_basic_map_copy(map->p[i]));
2563 struct isl_map *isl_map_add(struct isl_map *map, struct isl_basic_map *bmap)
2567 isl_assert(map->ctx, isl_dim_equal(map->dim, bmap->dim), goto error);
2568 isl_assert(map->ctx, map->n < map->size, goto error);
2569 map->p[map->n] = bmap;
2571 F_CLR(map, ISL_MAP_NORMALIZED);
2577 isl_basic_map_free(bmap);
2581 void isl_map_free(struct isl_map *map)
2591 isl_ctx_deref(map->ctx);
2592 for (i = 0; i < map->n; ++i)
2593 isl_basic_map_free(map->p[i]);
2594 isl_dim_free(map->dim);
2598 struct isl_map *isl_map_extend(struct isl_map *base,
2599 unsigned nparam, unsigned n_in, unsigned n_out)
2603 base = isl_map_cow(base);
2607 base->dim = isl_dim_extend(base->dim, nparam, n_in, n_out);
2610 for (i = 0; i < base->n; ++i) {
2611 base->p[i] = isl_basic_map_extend_dim(base->p[i],
2612 isl_dim_copy(base->dim), 0, 0, 0);
2622 struct isl_set *isl_set_extend(struct isl_set *base,
2623 unsigned nparam, unsigned dim)
2625 return (struct isl_set *)isl_map_extend((struct isl_map *)base,
2629 static struct isl_basic_map *isl_basic_map_fix_pos(struct isl_basic_map *bmap,
2630 unsigned pos, int value)
2634 bmap = isl_basic_map_cow(bmap);
2635 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
2636 j = isl_basic_map_alloc_equality(bmap);
2639 isl_seq_clr(bmap->eq[j], 1 + isl_basic_map_total_dim(bmap));
2640 isl_int_set_si(bmap->eq[j][pos], -1);
2641 isl_int_set_si(bmap->eq[j][0], value);
2642 bmap = isl_basic_map_simplify(bmap);
2643 return isl_basic_map_finalize(bmap);
2645 isl_basic_map_free(bmap);
2649 struct isl_basic_map *isl_basic_map_fix_si(struct isl_basic_map *bmap,
2650 enum isl_dim_type type, unsigned pos, int value)
2654 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
2655 return isl_basic_map_fix_pos(bmap, isl_basic_map_offset(bmap, type) + pos,
2658 isl_basic_map_free(bmap);
2662 struct isl_basic_set *isl_basic_set_fix_si(struct isl_basic_set *bset,
2663 enum isl_dim_type type, unsigned pos, int value)
2665 return (struct isl_basic_set *)
2666 isl_basic_map_fix_si((struct isl_basic_map *)bset,
2670 struct isl_basic_map *isl_basic_map_fix_input_si(struct isl_basic_map *bmap,
2671 unsigned input, int value)
2673 return isl_basic_map_fix_si(bmap, isl_dim_in, input, value);
2676 struct isl_basic_set *isl_basic_set_fix_dim_si(struct isl_basic_set *bset,
2677 unsigned dim, int value)
2679 return (struct isl_basic_set *)
2680 isl_basic_map_fix_si((struct isl_basic_map *)bset,
2681 isl_dim_set, dim, value);
2684 struct isl_map *isl_map_fix_si(struct isl_map *map,
2685 enum isl_dim_type type, unsigned pos, int value)
2689 map = isl_map_cow(map);
2693 isl_assert(ctx, pos < isl_map_dim(map, type), goto error);
2694 for (i = 0; i < map->n; ++i) {
2695 map->p[i] = isl_basic_map_fix_si(map->p[i], type, pos, value);
2699 F_CLR(map, ISL_MAP_NORMALIZED);
2706 struct isl_map *isl_map_fix_input_si(struct isl_map *map,
2707 unsigned input, int value)
2709 return isl_map_fix_si(map, isl_dim_in, input, value);
2712 struct isl_set *isl_set_fix_dim_si(struct isl_set *set, unsigned dim, int value)
2714 return (struct isl_set *)
2715 isl_map_fix_si((struct isl_map *)set, isl_dim_set, dim, value);
2718 struct isl_basic_set *isl_basic_set_lower_bound_dim(struct isl_basic_set *bset,
2719 unsigned dim, isl_int value)
2724 bset = isl_basic_set_cow(bset);
2725 bset = isl_basic_set_extend_constraints(bset, 0, 1);
2726 j = isl_basic_set_alloc_inequality(bset);
2729 isl_seq_clr(bset->ineq[j], 1 + isl_basic_set_total_dim(bset));
2730 isl_int_set_si(bset->ineq[j][1 + isl_basic_set_n_param(bset) + dim], 1);
2731 isl_int_neg(bset->ineq[j][0], value);
2732 bset = isl_basic_set_simplify(bset);
2733 return isl_basic_set_finalize(bset);
2735 isl_basic_set_free(bset);
2739 struct isl_set *isl_set_lower_bound_dim(struct isl_set *set, unsigned dim,
2744 set = isl_set_cow(set);
2748 isl_assert(set->ctx, dim < isl_set_n_dim(set), goto error);
2749 for (i = 0; i < set->n; ++i) {
2750 set->p[i] = isl_basic_set_lower_bound_dim(set->p[i], dim, value);
2760 struct isl_map *isl_map_reverse(struct isl_map *map)
2765 map = isl_map_cow(map);
2769 map->dim = isl_dim_reverse(map->dim);
2772 for (i = 0; i < map->n; ++i) {
2773 map->p[i] = isl_basic_map_reverse(map->p[i]);
2777 F_CLR(map, ISL_MAP_NORMALIZED);
2784 struct isl_map *isl_basic_map_lexmax(
2785 struct isl_basic_map *bmap, struct isl_basic_set *dom,
2786 struct isl_set **empty)
2788 return isl_pip_basic_map_lexmax(bmap, dom, empty);
2791 struct isl_map *isl_basic_map_lexmin(
2792 struct isl_basic_map *bmap, struct isl_basic_set *dom,
2793 struct isl_set **empty)
2795 return isl_pip_basic_map_lexmin(bmap, dom, empty);
2798 struct isl_set *isl_basic_set_lexmin(struct isl_basic_set *bset)
2800 struct isl_basic_map *bmap = NULL;
2801 struct isl_basic_set *dom = NULL;
2802 struct isl_map *min;
2803 struct isl_dim *param_dim;
2807 bmap = isl_basic_map_from_basic_set(bset, isl_dim_copy(bset->dim));
2810 param_dim = isl_dim_domain(isl_dim_copy(bmap->dim));
2811 dom = isl_basic_set_universe(param_dim);
2814 min = isl_basic_map_lexmin(bmap, dom, NULL);
2815 return isl_map_range(min);
2817 isl_basic_map_free(bmap);
2821 struct isl_map *isl_basic_map_compute_divs(struct isl_basic_map *bmap)
2828 off = isl_dim_total(bmap->dim);
2829 for (i = 0; i < bmap->n_div; ++i) {
2830 if (isl_int_is_zero(bmap->div[i][0]))
2831 return isl_pip_basic_map_compute_divs(bmap);
2832 isl_assert(bmap->ctx, isl_int_is_zero(bmap->div[i][1+1+off+i]),
2835 return isl_map_from_basic_map(bmap);
2837 isl_basic_map_free(bmap);
2841 struct isl_map *isl_map_compute_divs(struct isl_map *map)
2844 struct isl_map *res;
2850 res = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[0]));
2851 for (i = 1 ; i < map->n; ++i) {
2853 r2 = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[i]));
2854 if (F_ISSET(map, ISL_MAP_DISJOINT))
2855 res = isl_map_union_disjoint(res, r2);
2857 res = isl_map_union(res, r2);
2864 struct isl_set *isl_basic_set_compute_divs(struct isl_basic_set *bset)
2866 return (struct isl_set *)
2867 isl_basic_map_compute_divs((struct isl_basic_map *)bset);
2870 struct isl_set *isl_set_compute_divs(struct isl_set *set)
2872 return (struct isl_set *)
2873 isl_map_compute_divs((struct isl_map *)set);
2876 struct isl_set *isl_map_domain(struct isl_map *map)
2879 struct isl_set *set;
2884 map = isl_map_cow(map);
2888 set = (struct isl_set *)map;
2889 set->dim = isl_dim_domain(set->dim);
2892 for (i = 0; i < map->n; ++i) {
2893 set->p[i] = isl_basic_map_domain(map->p[i]);
2897 F_CLR(set, ISL_MAP_DISJOINT);
2898 F_CLR(set, ISL_SET_NORMALIZED);
2905 struct isl_map *isl_map_union_disjoint(
2906 struct isl_map *map1, struct isl_map *map2)
2910 struct isl_map *map = NULL;
2924 isl_assert(map1->ctx, isl_dim_equal(map1->dim, map2->dim), goto error);
2926 if (F_ISSET(map1, ISL_MAP_DISJOINT) &&
2927 F_ISSET(map2, ISL_MAP_DISJOINT))
2928 FL_SET(flags, ISL_MAP_DISJOINT);
2930 map = isl_map_alloc_dim(isl_dim_copy(map1->dim),
2931 map1->n + map2->n, flags);
2934 for (i = 0; i < map1->n; ++i) {
2935 map = isl_map_add(map,
2936 isl_basic_map_copy(map1->p[i]));
2940 for (i = 0; i < map2->n; ++i) {
2941 map = isl_map_add(map,
2942 isl_basic_map_copy(map2->p[i]));
2956 struct isl_map *isl_map_union(struct isl_map *map1, struct isl_map *map2)
2958 map1 = isl_map_union_disjoint(map1, map2);
2962 F_CLR(map1, ISL_MAP_DISJOINT);
2966 struct isl_set *isl_set_union_disjoint(
2967 struct isl_set *set1, struct isl_set *set2)
2969 return (struct isl_set *)
2970 isl_map_union_disjoint(
2971 (struct isl_map *)set1, (struct isl_map *)set2);
2974 struct isl_set *isl_set_union(struct isl_set *set1, struct isl_set *set2)
2976 return (struct isl_set *)
2977 isl_map_union((struct isl_map *)set1, (struct isl_map *)set2);
2980 struct isl_map *isl_map_intersect_range(
2981 struct isl_map *map, struct isl_set *set)
2984 struct isl_map *result;
2990 if (F_ISSET(map, ISL_MAP_DISJOINT) &&
2991 F_ISSET(set, ISL_MAP_DISJOINT))
2992 FL_SET(flags, ISL_MAP_DISJOINT);
2994 result = isl_map_alloc_dim(isl_dim_copy(map->dim),
2995 map->n * set->n, flags);
2998 for (i = 0; i < map->n; ++i)
2999 for (j = 0; j < set->n; ++j) {
3000 result = isl_map_add(result,
3001 isl_basic_map_intersect_range(
3002 isl_basic_map_copy(map->p[i]),
3003 isl_basic_set_copy(set->p[j])));
3016 struct isl_map *isl_map_intersect_domain(
3017 struct isl_map *map, struct isl_set *set)
3019 return isl_map_reverse(
3020 isl_map_intersect_range(isl_map_reverse(map), set));
3023 struct isl_map *isl_map_apply_domain(
3024 struct isl_map *map1, struct isl_map *map2)
3028 map1 = isl_map_reverse(map1);
3029 map1 = isl_map_apply_range(map1, map2);
3030 return isl_map_reverse(map1);
3037 struct isl_map *isl_map_apply_range(
3038 struct isl_map *map1, struct isl_map *map2)
3040 struct isl_dim *dim_result;
3041 struct isl_map *result;
3050 dim_result = isl_dim_join(isl_dim_copy(map1->dim),
3051 isl_dim_copy(map2->dim));
3053 result = isl_map_alloc_dim(dim_result, map1->n * map2->n, 0);
3056 for (i = 0; i < map1->n; ++i)
3057 for (j = 0; j < map2->n; ++j) {
3058 result = isl_map_add(result,
3059 isl_basic_map_apply_range(
3060 isl_basic_map_copy(map1->p[i]),
3061 isl_basic_map_copy(map2->p[j])));
3067 if (result && result->n <= 1)
3068 F_SET(result, ISL_MAP_DISJOINT);
3077 * returns range - domain
3079 struct isl_basic_set *isl_basic_map_deltas(struct isl_basic_map *bmap)
3081 struct isl_basic_set *bset;
3088 dim = isl_basic_map_n_in(bmap);
3089 nparam = isl_basic_map_n_param(bmap);
3090 isl_assert(bmap->ctx, dim == isl_basic_map_n_out(bmap), goto error);
3091 bset = isl_basic_set_from_basic_map(bmap);
3092 bset = isl_basic_set_extend(bset, nparam, 3*dim, 0, dim, 0);
3093 bset = isl_basic_set_swap_vars(bset, 2*dim);
3094 for (i = 0; i < dim; ++i) {
3095 int j = isl_basic_map_alloc_equality(
3096 (struct isl_basic_map *)bset);
3099 isl_seq_clr(bset->eq[j], 1 + isl_basic_set_total_dim(bset));
3100 isl_int_set_si(bset->eq[j][1+nparam+i], 1);
3101 isl_int_set_si(bset->eq[j][1+nparam+dim+i], 1);
3102 isl_int_set_si(bset->eq[j][1+nparam+2*dim+i], -1);
3104 return isl_basic_set_project_out(bset, 2*dim, 0);
3106 isl_basic_map_free(bmap);
3111 * returns range - domain
3113 struct isl_set *isl_map_deltas(struct isl_map *map)
3116 struct isl_set *result;
3121 isl_assert(map->ctx, isl_map_n_in(map) == isl_map_n_out(map), goto error);
3122 result = isl_set_alloc(map->ctx, isl_map_n_param(map),
3123 isl_map_n_in(map), map->n, map->flags);
3126 for (i = 0; i < map->n; ++i)
3127 result = isl_set_add(result,
3128 isl_basic_map_deltas(isl_basic_map_copy(map->p[i])));
3136 static struct isl_basic_map *basic_map_identity(struct isl_dim *dims)
3138 struct isl_basic_map *bmap;
3146 nparam = dims->nparam;
3148 bmap = isl_basic_map_alloc_dim(dims, 0, dim, 0);
3152 for (i = 0; i < dim; ++i) {
3153 int j = isl_basic_map_alloc_equality(bmap);
3156 isl_seq_clr(bmap->eq[j], 1 + isl_basic_map_total_dim(bmap));
3157 isl_int_set_si(bmap->eq[j][1+nparam+i], 1);
3158 isl_int_set_si(bmap->eq[j][1+nparam+dim+i], -1);
3160 return isl_basic_map_finalize(bmap);
3162 isl_basic_map_free(bmap);
3166 struct isl_basic_map *isl_basic_map_identity(struct isl_dim *set_dim)
3168 struct isl_dim *dim = isl_dim_map(set_dim);
3171 return basic_map_identity(dim);
3174 struct isl_basic_map *isl_basic_map_identity_like(struct isl_basic_map *model)
3176 if (!model || !model->dim)
3178 isl_assert(model->ctx,
3179 model->dim->n_in == model->dim->n_out, return NULL);
3180 return basic_map_identity(isl_dim_copy(model->dim));
3183 static struct isl_map *map_identity(struct isl_dim *dim)
3185 struct isl_map *map = isl_map_alloc_dim(dim, 1, ISL_MAP_DISJOINT);
3186 return isl_map_add(map, basic_map_identity(isl_dim_copy(dim)));
3189 struct isl_map *isl_map_identity(struct isl_dim *set_dim)
3191 struct isl_dim *dim = isl_dim_map(set_dim);
3194 return map_identity(dim);
3197 struct isl_map *isl_map_identity_like(struct isl_basic_map *model)
3199 if (!model || !model->dim)
3201 isl_assert(model->ctx,
3202 model->dim->n_in == model->dim->n_out, return NULL);
3203 return map_identity(isl_dim_copy(model->dim));
3206 int isl_set_is_equal(struct isl_set *set1, struct isl_set *set2)
3208 return isl_map_is_equal((struct isl_map *)set1, (struct isl_map *)set2);
3211 int isl_set_is_subset(struct isl_set *set1, struct isl_set *set2)
3213 return isl_map_is_subset(
3214 (struct isl_map *)set1, (struct isl_map *)set2);
3217 int isl_basic_map_is_subset(
3218 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3221 struct isl_map *map1;
3222 struct isl_map *map2;
3224 if (!bmap1 || !bmap2)
3227 map1 = isl_map_from_basic_map(isl_basic_map_copy(bmap1));
3228 map2 = isl_map_from_basic_map(isl_basic_map_copy(bmap2));
3230 is_subset = isl_map_is_subset(map1, map2);
3238 int isl_basic_map_is_equal(
3239 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3243 if (!bmap1 || !bmap2)
3245 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
3248 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
3252 int isl_basic_set_is_equal(
3253 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
3255 return isl_basic_map_is_equal(
3256 (struct isl_basic_map *)bset1, (struct isl_basic_map *)bset2);
3259 int isl_map_is_empty(struct isl_map *map)
3266 for (i = 0; i < map->n; ++i) {
3267 is_empty = isl_basic_map_is_empty(map->p[i]);
3276 int isl_map_fast_is_empty(struct isl_map *map)
3281 int isl_set_is_empty(struct isl_set *set)
3283 return isl_map_is_empty((struct isl_map *)set);
3286 int isl_map_is_subset(struct isl_map *map1, struct isl_map *map2)
3290 struct isl_map *diff;
3295 if (isl_map_is_empty(map1))
3298 if (isl_map_is_empty(map2))
3301 diff = isl_map_subtract(isl_map_copy(map1), isl_map_copy(map2));
3305 is_subset = isl_map_is_empty(diff);
3311 int isl_map_is_equal(struct isl_map *map1, struct isl_map *map2)
3317 is_subset = isl_map_is_subset(map1, map2);
3320 is_subset = isl_map_is_subset(map2, map1);
3324 int isl_basic_map_is_strict_subset(
3325 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3329 if (!bmap1 || !bmap2)
3331 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
3334 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
3335 if (is_subset == -1)
3340 static int basic_map_contains(struct isl_basic_map *bmap, struct isl_vec *vec)
3346 total = 1 + isl_basic_map_total_dim(bmap);
3347 if (total != vec->size)
3352 for (i = 0; i < bmap->n_eq; ++i) {
3353 isl_seq_inner_product(vec->block.data, bmap->eq[i], total, &s);
3354 if (!isl_int_is_zero(s)) {
3360 for (i = 0; i < bmap->n_ineq; ++i) {
3361 isl_seq_inner_product(vec->block.data, bmap->ineq[i], total, &s);
3362 if (isl_int_is_neg(s)) {
3373 int isl_basic_map_is_universe(struct isl_basic_map *bmap)
3377 return bmap->n_eq == 0 && bmap->n_ineq == 0;
3380 int isl_basic_map_is_empty(struct isl_basic_map *bmap)
3382 struct isl_basic_set *bset = NULL;
3383 struct isl_vec *sample = NULL;
3390 if (F_ISSET(bmap, ISL_BASIC_MAP_EMPTY))
3393 if (F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL)) {
3394 struct isl_basic_map *copy = isl_basic_map_copy(bmap);
3395 copy = isl_basic_map_convex_hull(copy);
3396 empty = F_ISSET(copy, ISL_BASIC_MAP_EMPTY);
3397 isl_basic_map_free(copy);
3401 total = 1 + isl_basic_map_total_dim(bmap);
3402 if (bmap->sample && bmap->sample->size == total) {
3403 int contains = basic_map_contains(bmap, bmap->sample);
3409 bset = isl_basic_map_underlying_set(isl_basic_map_copy(bmap));
3412 sample = isl_basic_set_sample(bset);
3415 empty = sample->size == 0;
3417 isl_vec_free(bmap->ctx, bmap->sample);
3418 bmap->sample = sample;
3423 int isl_basic_set_is_empty(struct isl_basic_set *bset)
3425 return isl_basic_map_is_empty((struct isl_basic_map *)bset);
3428 struct isl_map *isl_basic_map_union(
3429 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3431 struct isl_map *map;
3432 if (!bmap1 || !bmap2)
3435 isl_assert(map1->ctx, isl_dim_equal(bmap1->dim, bmap2->dim), goto error);
3437 map = isl_map_alloc_dim(isl_dim_copy(bmap1->dim), 2, 0);
3440 map = isl_map_add(map, bmap1);
3441 map = isl_map_add(map, bmap2);
3444 isl_basic_map_free(bmap1);
3445 isl_basic_map_free(bmap2);
3449 struct isl_set *isl_basic_set_union(
3450 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
3452 return (struct isl_set *)isl_basic_map_union(
3453 (struct isl_basic_map *)bset1,
3454 (struct isl_basic_map *)bset2);
3457 /* Order divs such that any div only depends on previous divs */
3458 static struct isl_basic_map *order_divs(struct isl_basic_map *bmap)
3461 unsigned off = isl_dim_total(bmap->dim);
3463 for (i = 0; i < bmap->n_div; ++i) {
3465 pos = isl_seq_first_non_zero(bmap->div[i]+1+1+off+i,
3469 swap_div(bmap, i, pos);
3475 /* Look for a div in dst that corresponds to the div "div" in src.
3476 * The divs before "div" in src and dst are assumed to be the same.
3478 * Returns -1 if no corresponding div was found and the position
3479 * of the corresponding div in dst otherwise.
3481 static int find_div(struct isl_basic_map *dst,
3482 struct isl_basic_map *src, unsigned div)
3486 unsigned total = isl_dim_total(src->dim);
3488 isl_assert(dst->ctx, div <= dst->n_div, return -1);
3489 for (i = div; i < dst->n_div; ++i)
3490 if (isl_seq_eq(dst->div[i], src->div[div], 1+1+total+div) &&
3491 isl_seq_first_non_zero(dst->div[i]+1+1+total+div,
3492 dst->n_div - div) == -1)
3497 struct isl_basic_map *isl_basic_map_align_divs(
3498 struct isl_basic_map *dst, struct isl_basic_map *src)
3501 unsigned total = isl_dim_total(src->dim);
3506 if (src->n_div == 0)
3509 for (i = 0; i < src->n_div; ++i)
3510 isl_assert(src->ctx, !isl_int_is_zero(src->div[i][0]), goto error);
3512 src = order_divs(src);
3513 dst = isl_basic_map_extend_dim(dst, isl_dim_copy(dst->dim),
3514 src->n_div, 0, 2 * src->n_div);
3517 for (i = 0; i < src->n_div; ++i) {
3518 int j = find_div(dst, src, i);
3520 j = isl_basic_map_alloc_div(dst);
3523 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total+i);
3524 isl_seq_clr(dst->div[j]+1+1+total+i, dst->n_div - i);
3525 if (add_div_constraints(dst, j) < 0)
3529 swap_div(dst, i, j);
3533 isl_basic_map_free(dst);
3537 struct isl_basic_set *isl_basic_set_align_divs(
3538 struct isl_basic_set *dst, struct isl_basic_set *src)
3540 return (struct isl_basic_set *)isl_basic_map_align_divs(
3541 (struct isl_basic_map *)dst, (struct isl_basic_map *)src);
3544 struct isl_map *isl_map_align_divs(struct isl_map *map)
3548 map = isl_map_compute_divs(map);
3549 map = isl_map_cow(map);
3553 for (i = 1; i < map->n; ++i)
3554 map->p[0] = isl_basic_map_align_divs(map->p[0], map->p[i]);
3555 for (i = 1; i < map->n; ++i)
3556 map->p[i] = isl_basic_map_align_divs(map->p[i], map->p[0]);
3558 F_CLR(map, ISL_MAP_NORMALIZED);
3562 static struct isl_map *add_cut_constraint(struct isl_map *dst,
3563 struct isl_basic_map *src, isl_int *c,
3564 unsigned len, int oppose)
3566 struct isl_basic_map *copy = NULL;
3571 copy = isl_basic_map_copy(src);
3572 copy = isl_basic_map_cow(copy);
3575 copy = isl_basic_map_extend_constraints(copy, 0, 1);
3576 k = isl_basic_map_alloc_inequality(copy);
3580 isl_seq_neg(copy->ineq[k], c, len);
3582 isl_seq_cpy(copy->ineq[k], c, len);
3583 total = 1 + isl_basic_map_total_dim(copy);
3584 isl_seq_clr(copy->ineq[k]+len, total - len);
3585 isl_inequality_negate(copy, k);
3586 copy = isl_basic_map_simplify(copy);
3587 copy = isl_basic_map_finalize(copy);
3588 is_empty = isl_basic_map_is_empty(copy);
3592 dst = isl_map_add(dst, copy);
3594 isl_basic_map_free(copy);
3597 isl_basic_map_free(copy);
3602 static struct isl_map *subtract(struct isl_map *map, struct isl_basic_map *bmap)
3606 struct isl_map *rest = NULL;
3608 unsigned total = isl_basic_map_total_dim(bmap);
3615 if (F_ISSET(map, ISL_MAP_DISJOINT))
3616 FL_SET(flags, ISL_MAP_DISJOINT);
3618 max = map->n * (2 * bmap->n_eq + bmap->n_ineq);
3619 rest = isl_map_alloc_dim(isl_dim_copy(map->dim), max, flags);
3623 for (i = 0; i < map->n; ++i) {
3624 map->p[i] = isl_basic_map_align_divs(map->p[i], bmap);
3629 for (j = 0; j < map->n; ++j)
3630 map->p[j] = isl_basic_map_cow(map->p[j]);
3632 for (i = 0; i < bmap->n_eq; ++i) {
3633 for (j = 0; j < map->n; ++j) {
3634 rest = add_cut_constraint(rest,
3635 map->p[j], bmap->eq[i], 1+total, 0);
3639 rest = add_cut_constraint(rest,
3640 map->p[j], bmap->eq[i], 1+total, 1);
3644 map->p[j] = isl_basic_map_extend_constraints(map->p[j],
3648 k = isl_basic_map_alloc_equality(map->p[j]);
3651 isl_seq_cpy(map->p[j]->eq[k], bmap->eq[i], 1+total);
3652 isl_seq_clr(map->p[j]->eq[k]+1+total,
3653 map->p[j]->n_div - bmap->n_div);
3657 for (i = 0; i < bmap->n_ineq; ++i) {
3658 for (j = 0; j < map->n; ++j) {
3659 rest = add_cut_constraint(rest,
3660 map->p[j], bmap->ineq[i], 1+total, 0);
3664 map->p[j] = isl_basic_map_extend_constraints(map->p[j],
3668 k = isl_basic_map_alloc_inequality(map->p[j]);
3671 isl_seq_cpy(map->p[j]->ineq[k], bmap->ineq[i], 1+total);
3672 isl_seq_clr(map->p[j]->ineq[k]+1+total,
3673 map->p[j]->n_div - bmap->n_div);
3685 struct isl_map *isl_map_subtract(struct isl_map *map1, struct isl_map *map2)
3691 isl_assert(map1->ctx, isl_dim_equal(map1->dim, map2->dim), goto error);
3693 if (isl_map_is_empty(map2)) {
3698 map1 = isl_map_compute_divs(map1);
3699 map2 = isl_map_compute_divs(map2);
3703 for (i = 0; map1 && i < map2->n; ++i)
3704 map1 = subtract(map1, map2->p[i]);
3714 struct isl_set *isl_set_subtract(struct isl_set *set1, struct isl_set *set2)
3716 return (struct isl_set *)
3718 (struct isl_map *)set1, (struct isl_map *)set2);
3721 struct isl_set *isl_set_apply(struct isl_set *set, struct isl_map *map)
3725 isl_assert(set->ctx, isl_map_compatible_domain(map, set), goto error);
3726 map = isl_map_intersect_domain(map, set);
3727 set = isl_map_range(map);
3735 /* There is no need to cow as removing empty parts doesn't change
3736 * the meaning of the set.
3738 struct isl_map *isl_map_remove_empty_parts(struct isl_map *map)
3745 for (i = map->n-1; i >= 0; --i) {
3746 if (!F_ISSET(map->p[i], ISL_BASIC_MAP_EMPTY))
3748 isl_basic_map_free(map->p[i]);
3749 if (i != map->n-1) {
3750 F_CLR(map, ISL_MAP_NORMALIZED);
3751 map->p[i] = map->p[map->n-1];
3759 struct isl_set *isl_set_remove_empty_parts(struct isl_set *set)
3761 return (struct isl_set *)
3762 isl_map_remove_empty_parts((struct isl_map *)set);
3765 struct isl_basic_map *isl_map_copy_basic_map(struct isl_map *map)
3767 struct isl_basic_map *bmap;
3768 if (!map || map->n == 0)
3770 bmap = map->p[map->n-1];
3771 isl_assert(map->ctx, F_ISSET(bmap, ISL_BASIC_SET_FINAL), return NULL);
3772 return isl_basic_map_copy(bmap);
3775 struct isl_basic_set *isl_set_copy_basic_set(struct isl_set *set)
3777 (struct isl_basic_set *)isl_map_copy_basic_map((struct isl_map *)set);
3780 struct isl_map *isl_map_drop_basic_map(struct isl_map *map,
3781 struct isl_basic_map *bmap)
3787 for (i = map->n-1; i >= 0; --i) {
3788 if (map->p[i] != bmap)
3790 map = isl_map_cow(map);
3793 isl_basic_map_free(map->p[i]);
3794 if (i != map->n-1) {
3795 F_CLR(map, ISL_SET_NORMALIZED);
3796 map->p[i] = map->p[map->n-1];
3801 isl_basic_map_free(bmap);
3805 isl_basic_map_free(bmap);
3809 struct isl_set *isl_set_drop_basic_set(struct isl_set *set,
3810 struct isl_basic_set *bset)
3812 (struct isl_set *)isl_map_drop_basic_map((struct isl_map *)set,
3813 (struct isl_basic_map *)bset);
3816 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
3817 * for any common value of the parameters and dimensions preceding dim
3818 * in both basic sets, the values of dimension pos in bset1 are
3819 * smaller or larger than those in bset2.
3822 * 1 if bset1 follows bset2
3823 * -1 if bset1 precedes bset2
3824 * 0 if bset1 and bset2 are incomparable
3825 * -2 if some error occurred.
3827 int isl_basic_set_compare_at(struct isl_basic_set *bset1,
3828 struct isl_basic_set *bset2, int pos)
3830 struct isl_dim *dims;
3831 struct isl_basic_map *bmap1 = NULL;
3832 struct isl_basic_map *bmap2 = NULL;
3833 struct isl_ctx *ctx;
3834 struct isl_vec *obj;
3837 unsigned dim1, dim2;
3839 enum isl_lp_result res;
3842 if (!bset1 || !bset2)
3845 nparam = isl_basic_set_n_param(bset1);
3846 dim1 = isl_basic_set_n_dim(bset1);
3847 dim2 = isl_basic_set_n_dim(bset2);
3848 dims = isl_dim_alloc(bset1->ctx, nparam, pos, dim1 - pos);
3849 bmap1 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset1), dims);
3850 dims = isl_dim_alloc(bset2->ctx, nparam, pos, dim2 - pos);
3851 bmap2 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset2), dims);
3852 if (!bmap1 || !bmap2)
3854 bmap1 = isl_basic_map_extend(bmap1, nparam,
3855 pos, (dim1 - pos) + (dim2 - pos),
3856 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
3857 bmap1 = add_constraints(bmap1, bmap2, 0, dim1 - pos);
3860 total = isl_basic_map_total_dim(bmap1);
3862 obj = isl_vec_alloc(ctx, total);
3863 isl_seq_clr(obj->block.data, total);
3864 isl_int_set_si(obj->block.data[nparam+pos], 1);
3865 isl_int_set_si(obj->block.data[nparam+pos+(dim1-pos)], -1);
3870 res = isl_solve_lp(bmap1, 0, obj->block.data, ctx->one, &num, &den);
3871 if (res == isl_lp_empty)
3873 else if (res == isl_lp_ok && isl_int_is_pos(num))
3875 else if ((res == isl_lp_ok && isl_int_is_neg(num)) ||
3876 res == isl_lp_unbounded)
3882 isl_basic_map_free(bmap1);
3883 isl_vec_free(ctx, obj);
3886 isl_basic_map_free(bmap1);
3887 isl_basic_map_free(bmap2);
3891 static int isl_basic_map_fast_has_fixed_var(struct isl_basic_map *bmap,
3892 unsigned pos, isl_int *val)
3900 total = isl_basic_map_total_dim(bmap);
3901 for (i = 0, d = total-1; i < bmap->n_eq && d+1 > pos; ++i) {
3902 for (; d+1 > pos; --d)
3903 if (!isl_int_is_zero(bmap->eq[i][1+d]))
3907 if (isl_seq_first_non_zero(bmap->eq[i]+1, d) != -1)
3909 if (isl_seq_first_non_zero(bmap->eq[i]+1+d+1, total-d-1) != -1)
3911 if (!isl_int_is_one(bmap->eq[i][1+d]))
3914 isl_int_neg(*val, bmap->eq[i][0]);
3920 static int isl_map_fast_has_fixed_var(struct isl_map *map,
3921 unsigned pos, isl_int *val)
3933 return isl_basic_map_fast_has_fixed_var(map->p[0], pos, val);
3936 fixed = isl_basic_map_fast_has_fixed_var(map->p[0], pos, &v);
3937 for (i = 1; fixed == 1 && i < map->n; ++i) {
3938 fixed = isl_basic_map_fast_has_fixed_var(map->p[i], pos, &tmp);
3939 if (fixed == 1 && isl_int_ne(tmp, v))
3943 isl_int_set(*val, v);
3949 static int isl_set_fast_has_fixed_var(struct isl_set *set, unsigned pos,
3952 return isl_map_fast_has_fixed_var((struct isl_map *)set, pos, val);
3955 int isl_basic_map_fast_is_fixed(struct isl_basic_map *bmap,
3956 enum isl_dim_type type, unsigned pos, isl_int *val)
3958 if (pos >= isl_basic_map_dim(bmap, type))
3960 return isl_basic_map_fast_has_fixed_var(bmap,
3961 isl_basic_map_offset(bmap, type) - 1 + pos, val);
3964 /* Check if dimension dim has fixed value and if so and if val is not NULL,
3965 * then return this fixed value in *val.
3967 int isl_set_fast_dim_is_fixed(struct isl_set *set, unsigned dim, isl_int *val)
3969 return isl_set_fast_has_fixed_var(set, isl_set_n_param(set) + dim, val);
3972 /* Check if input variable in has fixed value and if so and if val is not NULL,
3973 * then return this fixed value in *val.
3975 int isl_map_fast_input_is_fixed(struct isl_map *map, unsigned in, isl_int *val)
3977 return isl_map_fast_has_fixed_var(map, isl_map_n_param(map) + in, val);
3980 /* Check if dimension dim has an (obvious) fixed lower bound and if so
3981 * and if val is not NULL, then return this lower bound in *val.
3983 int isl_basic_set_fast_dim_has_fixed_lower_bound(struct isl_basic_set *bset,
3984 unsigned dim, isl_int *val)
3986 int i, i_eq = -1, i_ineq = -1;
3993 total = isl_basic_set_total_dim(bset);
3994 nparam = isl_basic_set_n_param(bset);
3995 for (i = 0; i < bset->n_eq; ++i) {
3996 if (isl_int_is_zero(bset->eq[i][1+nparam+dim]))
4002 for (i = 0; i < bset->n_ineq; ++i) {
4003 if (!isl_int_is_pos(bset->ineq[i][1+nparam+dim]))
4005 if (i_eq != -1 || i_ineq != -1)
4009 if (i_eq == -1 && i_ineq == -1)
4011 c = i_eq != -1 ? bset->eq[i_eq] : bset->ineq[i_ineq];
4012 /* The coefficient should always be one due to normalization. */
4013 if (!isl_int_is_one(c[1+nparam+dim]))
4015 if (isl_seq_first_non_zero(c+1, nparam+dim) != -1)
4017 if (isl_seq_first_non_zero(c+1+nparam+dim+1,
4018 total - nparam - dim - 1) != -1)
4021 isl_int_neg(*val, c[0]);
4025 int isl_set_fast_dim_has_fixed_lower_bound(struct isl_set *set,
4026 unsigned dim, isl_int *val)
4038 return isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[0],
4042 fixed = isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[0],
4044 for (i = 1; fixed == 1 && i < set->n; ++i) {
4045 fixed = isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[i],
4047 if (fixed == 1 && isl_int_ne(tmp, v))
4051 isl_int_set(*val, v);
4062 static int qsort_constraint_cmp(const void *p1, const void *p2)
4064 const struct constraint *c1 = (const struct constraint *)p1;
4065 const struct constraint *c2 = (const struct constraint *)p2;
4066 unsigned size = isl_min(c1->size, c2->size);
4067 return isl_seq_cmp(c1->c, c2->c, size);
4070 static struct isl_basic_map *isl_basic_map_sort_constraints(
4071 struct isl_basic_map *bmap)
4074 struct constraint *c;
4079 total = isl_basic_map_total_dim(bmap);
4080 c = isl_alloc_array(bmap->ctx, struct constraint, bmap->n_ineq);
4083 for (i = 0; i < bmap->n_ineq; ++i) {
4085 c[i].c = bmap->ineq[i];
4087 qsort(c, bmap->n_ineq, sizeof(struct constraint), qsort_constraint_cmp);
4088 for (i = 0; i < bmap->n_ineq; ++i)
4089 bmap->ineq[i] = c[i].c;
4093 isl_basic_map_free(bmap);
4097 struct isl_basic_map *isl_basic_map_normalize(struct isl_basic_map *bmap)
4101 if (F_ISSET(bmap, ISL_BASIC_MAP_NORMALIZED))
4103 bmap = isl_basic_map_convex_hull(bmap);
4104 bmap = isl_basic_map_sort_constraints(bmap);
4105 F_SET(bmap, ISL_BASIC_MAP_NORMALIZED);
4109 struct isl_basic_set *isl_basic_set_normalize(struct isl_basic_set *bset)
4111 return (struct isl_basic_set *)isl_basic_map_normalize(
4112 (struct isl_basic_map *)bset);
4115 static int isl_basic_map_fast_cmp(const struct isl_basic_map *bmap1,
4116 const struct isl_basic_map *bmap2)
4123 if (isl_basic_map_n_param(bmap1) != isl_basic_map_n_param(bmap2))
4124 return isl_basic_map_n_param(bmap1) - isl_basic_map_n_param(bmap2);
4125 if (isl_basic_map_n_in(bmap1) != isl_basic_map_n_in(bmap2))
4126 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
4127 if (isl_basic_map_n_out(bmap1) != isl_basic_map_n_out(bmap2))
4128 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
4129 if (F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY) &&
4130 F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
4132 if (F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY))
4134 if (F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
4136 if (bmap1->n_eq != bmap2->n_eq)
4137 return bmap1->n_eq - bmap2->n_eq;
4138 if (bmap1->n_ineq != bmap2->n_ineq)
4139 return bmap1->n_ineq - bmap2->n_ineq;
4140 if (bmap1->n_div != bmap2->n_div)
4141 return bmap1->n_div - bmap2->n_div;
4142 total = isl_basic_map_total_dim(bmap1);
4143 for (i = 0; i < bmap1->n_eq; ++i) {
4144 cmp = isl_seq_cmp(bmap1->eq[i], bmap2->eq[i], 1+total);
4148 for (i = 0; i < bmap1->n_ineq; ++i) {
4149 cmp = isl_seq_cmp(bmap1->ineq[i], bmap2->ineq[i], 1+total);
4153 for (i = 0; i < bmap1->n_div; ++i) {
4154 cmp = isl_seq_cmp(bmap1->div[i], bmap2->div[i], 1+1+total);
4161 static int isl_basic_map_fast_is_equal(struct isl_basic_map *bmap1,
4162 struct isl_basic_map *bmap2)
4164 return isl_basic_map_fast_cmp(bmap1, bmap2) == 0;
4167 static int qsort_bmap_cmp(const void *p1, const void *p2)
4169 const struct isl_basic_map *bmap1 = *(const struct isl_basic_map **)p1;
4170 const struct isl_basic_map *bmap2 = *(const struct isl_basic_map **)p2;
4172 return isl_basic_map_fast_cmp(bmap1, bmap2);
4175 /* We normalize in place, but if anything goes wrong we need
4176 * to return NULL, so we need to make sure we don't change the
4177 * meaning of any possible other copies of map.
4179 struct isl_map *isl_map_normalize(struct isl_map *map)
4182 struct isl_basic_map *bmap;
4186 if (F_ISSET(map, ISL_MAP_NORMALIZED))
4188 for (i = 0; i < map->n; ++i) {
4189 bmap = isl_basic_map_normalize(isl_basic_map_copy(map->p[i]));
4192 isl_basic_map_free(map->p[i]);
4195 qsort(map->p, map->n, sizeof(struct isl_basic_map *), qsort_bmap_cmp);
4196 F_SET(map, ISL_MAP_NORMALIZED);
4197 map = isl_map_remove_empty_parts(map);
4200 for (i = map->n - 1; i >= 1; --i) {
4201 if (!isl_basic_map_fast_is_equal(map->p[i-1], map->p[i]))
4203 isl_basic_map_free(map->p[i-1]);
4204 for (j = i; j < map->n; ++j)
4205 map->p[j-1] = map->p[j];
4215 struct isl_set *isl_set_normalize(struct isl_set *set)
4217 return (struct isl_set *)isl_map_normalize((struct isl_map *)set);
4220 int isl_map_fast_is_equal(struct isl_map *map1, struct isl_map *map2)
4230 if (!isl_dim_equal(map1->dim, map2->dim))
4233 map1 = isl_map_copy(map1);
4234 map2 = isl_map_copy(map2);
4235 map1 = isl_map_normalize(map1);
4236 map2 = isl_map_normalize(map2);
4239 equal = map1->n == map2->n;
4240 for (i = 0; equal && i < map1->n; ++i) {
4241 equal = isl_basic_map_fast_is_equal(map1->p[i], map2->p[i]);
4254 int isl_set_fast_is_equal(struct isl_set *set1, struct isl_set *set2)
4256 return isl_map_fast_is_equal((struct isl_map *)set1,
4257 (struct isl_map *)set2);
4260 /* Return an interval that ranges from min to max (inclusive)
4262 struct isl_basic_set *isl_basic_set_interval(struct isl_ctx *ctx,
4263 isl_int min, isl_int max)
4266 struct isl_basic_set *bset = NULL;
4268 bset = isl_basic_set_alloc(ctx, 0, 1, 0, 0, 2);
4272 k = isl_basic_set_alloc_inequality(bset);
4275 isl_int_set_si(bset->ineq[k][1], 1);
4276 isl_int_neg(bset->ineq[k][0], min);
4278 k = isl_basic_set_alloc_inequality(bset);
4281 isl_int_set_si(bset->ineq[k][1], -1);
4282 isl_int_set(bset->ineq[k][0], max);
4286 isl_basic_set_free(bset);
4290 /* Return the Cartesian product of the basic sets in list (in the given order).
4292 struct isl_basic_set *isl_basic_set_product(struct isl_basic_set_list *list)
4300 struct isl_basic_set *product = NULL;
4304 isl_assert(list->ctx, list->n > 0, goto error);
4305 isl_assert(list->ctx, list->p[0], goto error);
4306 nparam = isl_basic_set_n_param(list->p[0]);
4307 dim = isl_basic_set_n_dim(list->p[0]);
4308 extra = list->p[0]->n_div;
4309 n_eq = list->p[0]->n_eq;
4310 n_ineq = list->p[0]->n_ineq;
4311 for (i = 1; i < list->n; ++i) {
4312 isl_assert(list->ctx, list->p[i], goto error);
4313 isl_assert(list->ctx,
4314 nparam == isl_basic_set_n_param(list->p[i]), goto error);
4315 dim += isl_basic_set_n_dim(list->p[i]);
4316 extra += list->p[i]->n_div;
4317 n_eq += list->p[i]->n_eq;
4318 n_ineq += list->p[i]->n_ineq;
4320 product = isl_basic_set_alloc(list->ctx, nparam, dim, extra,
4325 for (i = 0; i < list->n; ++i) {
4326 isl_basic_set_add_constraints(product,
4327 isl_basic_set_copy(list->p[i]), dim);
4328 dim += isl_basic_set_n_dim(list->p[i]);
4330 isl_basic_set_list_free(list);
4333 isl_basic_set_free(product);
4334 isl_basic_set_list_free(list);
4338 struct isl_basic_map *isl_basic_map_product(
4339 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
4341 struct isl_dim *dim_result = NULL;
4342 struct isl_basic_map *bmap;
4343 unsigned in1, in2, out1, out2, nparam, total, pos;
4344 struct isl_dim_map *dim_map1, *dim_map2;
4346 if (!bmap1 || !bmap2)
4349 isl_assert(map1->ctx, isl_dim_match(bmap1->dim, isl_dim_param,
4350 bmap2->dim, isl_dim_param), goto error);
4351 dim_result = isl_dim_product(isl_dim_copy(bmap1->dim),
4352 isl_dim_copy(bmap2->dim));
4354 in1 = isl_basic_map_n_in(bmap1);
4355 in2 = isl_basic_map_n_in(bmap2);
4356 out1 = isl_basic_map_n_out(bmap1);
4357 out2 = isl_basic_map_n_out(bmap2);
4358 nparam = isl_basic_map_n_param(bmap1);
4360 total = nparam + in1 + in2 + out1 + out2 + bmap1->n_div + bmap2->n_div;
4361 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
4362 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
4363 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
4364 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
4365 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
4366 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos += in1);
4367 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += in2);
4368 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += out1);
4369 isl_dim_map_div(dim_map1, bmap1, pos += out2);
4370 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
4372 bmap = isl_basic_map_alloc_dim(dim_result,
4373 bmap1->n_div + bmap2->n_div,
4374 bmap1->n_eq + bmap2->n_eq,
4375 bmap1->n_ineq + bmap2->n_ineq);
4376 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
4377 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
4378 bmap = isl_basic_map_simplify(bmap);
4379 return isl_basic_map_finalize(bmap);
4381 isl_basic_map_free(bmap1);
4382 isl_basic_map_free(bmap2);
4386 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
4388 struct isl_map *isl_map_product(struct isl_map *map1, struct isl_map *map2)
4391 struct isl_map *result;
4397 isl_assert(map1->ctx, isl_dim_match(map1->dim, isl_dim_param,
4398 map2->dim, isl_dim_param), goto error);
4400 if (F_ISSET(map1, ISL_MAP_DISJOINT) &&
4401 F_ISSET(map2, ISL_MAP_DISJOINT))
4402 FL_SET(flags, ISL_MAP_DISJOINT);
4404 result = isl_map_alloc_dim(isl_dim_product(isl_dim_copy(map1->dim),
4405 isl_dim_copy(map2->dim)),
4406 map1->n * map2->n, flags);
4409 for (i = 0; i < map1->n; ++i)
4410 for (j = 0; j < map2->n; ++j) {
4411 struct isl_basic_map *part;
4412 part = isl_basic_map_product(
4413 isl_basic_map_copy(map1->p[i]),
4414 isl_basic_map_copy(map2->p[j]));
4415 if (isl_basic_map_is_empty(part))
4416 isl_basic_map_free(part);
4418 result = isl_map_add(result, part);
4431 uint32_t isl_basic_set_get_hash(struct isl_basic_set *bset)
4439 bset = isl_basic_set_copy(bset);
4440 bset = isl_basic_set_normalize(bset);
4443 total = isl_basic_set_total_dim(bset);
4444 isl_hash_byte(hash, bset->n_eq & 0xFF);
4445 for (i = 0; i < bset->n_eq; ++i) {
4447 c_hash = isl_seq_get_hash(bset->eq[i], 1 + total);
4448 isl_hash_hash(hash, c_hash);
4450 isl_hash_byte(hash, bset->n_ineq & 0xFF);
4451 for (i = 0; i < bset->n_ineq; ++i) {
4453 c_hash = isl_seq_get_hash(bset->ineq[i], 1 + total);
4454 isl_hash_hash(hash, c_hash);
4456 isl_hash_byte(hash, bset->n_div & 0xFF);
4457 for (i = 0; i < bset->n_div; ++i) {
4459 if (isl_int_is_zero(bset->div[i][0]))
4461 isl_hash_byte(hash, i & 0xFF);
4462 c_hash = isl_seq_get_hash(bset->div[i], 1 + 1 + total);
4463 isl_hash_hash(hash, c_hash);
4465 isl_basic_set_free(bset);
4469 uint32_t isl_set_get_hash(struct isl_set *set)
4476 set = isl_set_copy(set);
4477 set = isl_set_normalize(set);
4481 hash = isl_hash_init();
4482 for (i = 0; i < set->n; ++i) {
4484 bset_hash = isl_basic_set_get_hash(set->p[i]);
4485 isl_hash_hash(hash, bset_hash);
4493 /* Check if the value for dimension dim is completely determined
4494 * by the values of the other parameters and variables.
4495 * That is, check if dimension dim is involved in an equality.
4497 int isl_basic_set_dim_is_unique(struct isl_basic_set *bset, unsigned dim)
4504 nparam = isl_basic_set_n_param(bset);
4505 for (i = 0; i < bset->n_eq; ++i)
4506 if (!isl_int_is_zero(bset->eq[i][1 + nparam + dim]))
4511 /* Check if the value for dimension dim is completely determined
4512 * by the values of the other parameters and variables.
4513 * That is, check if dimension dim is involved in an equality
4514 * for each of the subsets.
4516 int isl_set_dim_is_unique(struct isl_set *set, unsigned dim)
4522 for (i = 0; i < set->n; ++i) {
4524 unique = isl_basic_set_dim_is_unique(set->p[i], dim);