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_set_dim(const struct isl_set *set, enum isl_dim_type type)
112 return n(set->dim, type);
115 unsigned isl_basic_map_offset(struct isl_basic_map *bmap,
116 enum isl_dim_type type)
118 struct isl_dim *dim = bmap->dim;
120 case isl_dim_param: return 1;
121 case isl_dim_in: return 1 + dim->nparam;
122 case isl_dim_out: return 1 + dim->nparam + dim->n_in;
123 case isl_dim_div: return 1 + dim->nparam + dim->n_in + dim->n_out;
127 static unsigned map_offset(struct isl_map *map, enum isl_dim_type type)
129 return pos(map->dim, type);
132 unsigned isl_basic_set_dim(const struct isl_basic_set *bset,
133 enum isl_dim_type type)
135 return isl_basic_map_dim((const struct isl_basic_map*)bset, type);
138 unsigned isl_basic_set_n_dim(const struct isl_basic_set *bset)
140 return bset->dim->n_out;
143 unsigned isl_basic_set_n_param(const struct isl_basic_set *bset)
145 return bset->dim->nparam;
148 unsigned isl_basic_set_total_dim(const struct isl_basic_set *bset)
150 return isl_dim_total(bset->dim) + bset->n_div;
153 unsigned isl_set_n_dim(const struct isl_set *set)
155 return set->dim->n_out;
158 unsigned isl_set_n_param(const struct isl_set *set)
160 return set->dim->nparam;
163 unsigned isl_basic_map_n_in(const struct isl_basic_map *bmap)
165 return bmap->dim->n_in;
168 unsigned isl_basic_map_n_out(const struct isl_basic_map *bmap)
170 return bmap->dim->n_out;
173 unsigned isl_basic_map_n_param(const struct isl_basic_map *bmap)
175 return bmap->dim->nparam;
178 unsigned isl_basic_map_n_div(const struct isl_basic_map *bmap)
183 unsigned isl_basic_map_total_dim(const struct isl_basic_map *bmap)
185 return isl_dim_total(bmap->dim) + bmap->n_div;
188 unsigned isl_map_n_in(const struct isl_map *map)
190 return map->dim->n_in;
193 unsigned isl_map_n_out(const struct isl_map *map)
195 return map->dim->n_out;
198 unsigned isl_map_n_param(const struct isl_map *map)
200 return map->dim->nparam;
203 int isl_map_compatible_domain(struct isl_map *map, struct isl_set *set)
205 return map->dim->n_in == set->dim->n_out &&
206 map->dim->nparam == set->dim->nparam;
209 int isl_basic_map_compatible_domain(struct isl_basic_map *bmap,
210 struct isl_basic_set *bset)
212 return bmap->dim->n_in == bset->dim->n_out &&
213 bmap->dim->nparam == bset->dim->nparam;
216 int isl_basic_map_compatible_range(struct isl_basic_map *bmap,
217 struct isl_basic_set *bset)
219 return bmap->dim->n_out == bset->dim->n_out &&
220 bmap->dim->nparam == bset->dim->nparam;
223 static struct isl_basic_map *basic_map_init(struct isl_ctx *ctx,
224 struct isl_basic_map *bmap, unsigned extra,
225 unsigned n_eq, unsigned n_ineq)
228 size_t row_size = 1 + isl_dim_total(bmap->dim) + extra;
230 bmap->block = isl_blk_alloc(ctx, (n_ineq + n_eq) * row_size);
231 if (isl_blk_is_error(bmap->block)) {
236 bmap->ineq = isl_alloc_array(ctx, isl_int *, n_ineq + n_eq);
238 isl_blk_free(ctx, bmap->block);
244 bmap->block2 = isl_blk_empty();
247 bmap->block2 = isl_blk_alloc(ctx, extra * (1 + row_size));
248 if (isl_blk_is_error(bmap->block2)) {
250 isl_blk_free(ctx, bmap->block);
255 bmap->div = isl_alloc_array(ctx, isl_int *, extra);
257 isl_blk_free(ctx, bmap->block2);
259 isl_blk_free(ctx, bmap->block);
265 for (i = 0; i < n_ineq + n_eq; ++i)
266 bmap->ineq[i] = bmap->block.data + i * row_size;
268 for (i = 0; i < extra; ++i)
269 bmap->div[i] = bmap->block2.data + i * (1 + row_size);
275 bmap->c_size = n_eq + n_ineq;
276 bmap->eq = bmap->ineq + n_ineq;
285 isl_basic_map_free(bmap);
289 struct isl_basic_set *isl_basic_set_alloc(struct isl_ctx *ctx,
290 unsigned nparam, unsigned dim, unsigned extra,
291 unsigned n_eq, unsigned n_ineq)
293 struct isl_basic_map *bmap;
294 bmap = isl_basic_map_alloc(ctx, nparam, 0, dim, extra, n_eq, n_ineq);
295 return (struct isl_basic_set *)bmap;
298 struct isl_basic_set *isl_basic_set_alloc_dim(struct isl_dim *dim,
299 unsigned extra, unsigned n_eq, unsigned n_ineq)
301 struct isl_basic_map *bmap;
304 isl_assert(dim->ctx, dim->n_in == 0, return NULL);
305 bmap = isl_basic_map_alloc_dim(dim, extra, n_eq, n_ineq);
306 return (struct isl_basic_set *)bmap;
309 struct isl_basic_map *isl_basic_map_alloc_dim(struct isl_dim *dim,
310 unsigned extra, unsigned n_eq, unsigned n_ineq)
312 struct isl_basic_map *bmap;
316 bmap = isl_alloc_type(dim->ctx, struct isl_basic_map);
321 return basic_map_init(dim->ctx, bmap, extra, n_eq, n_ineq);
327 struct isl_basic_map *isl_basic_map_alloc(struct isl_ctx *ctx,
328 unsigned nparam, unsigned in, unsigned out, unsigned extra,
329 unsigned n_eq, unsigned n_ineq)
331 struct isl_basic_map *bmap;
334 dim = isl_dim_alloc(ctx, nparam, in, out);
338 bmap = isl_basic_map_alloc_dim(dim, extra, n_eq, n_ineq);
342 static void dup_constraints(
343 struct isl_basic_map *dst, struct isl_basic_map *src)
346 unsigned total = isl_basic_map_total_dim(src);
348 for (i = 0; i < src->n_eq; ++i) {
349 int j = isl_basic_map_alloc_equality(dst);
350 isl_seq_cpy(dst->eq[j], src->eq[i], 1+total);
353 for (i = 0; i < src->n_ineq; ++i) {
354 int j = isl_basic_map_alloc_inequality(dst);
355 isl_seq_cpy(dst->ineq[j], src->ineq[i], 1+total);
358 for (i = 0; i < src->n_div; ++i) {
359 int j = isl_basic_map_alloc_div(dst);
360 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total);
362 ISL_F_SET(dst, ISL_BASIC_SET_FINAL);
365 struct isl_basic_map *isl_basic_map_dup(struct isl_basic_map *bmap)
367 struct isl_basic_map *dup;
371 dup = isl_basic_map_alloc_dim(isl_dim_copy(bmap->dim),
372 bmap->n_div, bmap->n_eq, bmap->n_ineq);
375 dup->flags = bmap->flags;
376 dup_constraints(dup, bmap);
377 dup->sample = isl_vec_copy(bmap->ctx, bmap->sample);
381 struct isl_basic_set *isl_basic_set_dup(struct isl_basic_set *bset)
383 struct isl_basic_map *dup;
385 dup = isl_basic_map_dup((struct isl_basic_map *)bset);
386 return (struct isl_basic_set *)dup;
389 struct isl_basic_set *isl_basic_set_copy(struct isl_basic_set *bset)
394 if (ISL_F_ISSET(bset, ISL_BASIC_SET_FINAL)) {
398 return isl_basic_set_dup(bset);
401 struct isl_set *isl_set_copy(struct isl_set *set)
410 struct isl_basic_map *isl_basic_map_copy(struct isl_basic_map *bmap)
415 if (ISL_F_ISSET(bmap, ISL_BASIC_SET_FINAL)) {
419 return isl_basic_map_dup(bmap);
422 struct isl_map *isl_map_copy(struct isl_map *map)
431 void isl_basic_map_free(struct isl_basic_map *bmap)
439 isl_ctx_deref(bmap->ctx);
441 isl_blk_free(bmap->ctx, bmap->block2);
443 isl_blk_free(bmap->ctx, bmap->block);
444 isl_vec_free(bmap->ctx, bmap->sample);
445 isl_dim_free(bmap->dim);
449 void isl_basic_set_free(struct isl_basic_set *bset)
451 isl_basic_map_free((struct isl_basic_map *)bset);
454 static int room_for_con(struct isl_basic_map *bmap, unsigned n)
456 return bmap->n_eq + bmap->n_ineq + n <= bmap->c_size;
459 int isl_basic_map_alloc_equality(struct isl_basic_map *bmap)
465 isl_assert(ctx, room_for_con(bmap, 1), return -1);
466 isl_assert(ctx, (bmap->eq - bmap->ineq) + bmap->n_eq <= bmap->c_size,
468 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
469 if ((bmap->eq - bmap->ineq) + bmap->n_eq == bmap->c_size) {
471 int j = isl_basic_map_alloc_inequality(bmap);
475 bmap->ineq[j] = bmap->ineq[bmap->n_ineq - 1];
476 bmap->ineq[bmap->n_ineq - 1] = bmap->eq[-1];
483 isl_seq_clr(bmap->eq[bmap->n_eq] + 1 + isl_basic_map_total_dim(bmap),
484 bmap->extra - bmap->n_div);
488 int isl_basic_set_alloc_equality(struct isl_basic_set *bset)
490 return isl_basic_map_alloc_equality((struct isl_basic_map *)bset);
493 int isl_basic_map_free_equality(struct isl_basic_map *bmap, unsigned n)
497 isl_assert(bmap->ctx, n <= bmap->n_eq, return -1);
502 int isl_basic_map_drop_equality(struct isl_basic_map *bmap, unsigned pos)
507 isl_assert(bmap->ctx, pos < bmap->n_eq, return -1);
509 if (pos != bmap->n_eq - 1) {
511 bmap->eq[pos] = bmap->eq[bmap->n_eq - 1];
512 bmap->eq[bmap->n_eq - 1] = t;
518 int isl_basic_set_drop_equality(struct isl_basic_set *bset, unsigned pos)
520 return isl_basic_map_drop_equality((struct isl_basic_map *)bset, pos);
523 void isl_basic_map_inequality_to_equality(
524 struct isl_basic_map *bmap, unsigned pos)
529 bmap->ineq[pos] = bmap->ineq[bmap->n_ineq - 1];
530 bmap->ineq[bmap->n_ineq - 1] = bmap->eq[-1];
535 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
536 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
537 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
540 static int room_for_ineq(struct isl_basic_map *bmap, unsigned n)
542 return bmap->n_ineq + n <= bmap->eq - bmap->ineq;
545 int isl_basic_map_alloc_inequality(struct isl_basic_map *bmap)
551 isl_assert(ctx, room_for_ineq(bmap, 1), return -1);
552 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_IMPLICIT);
553 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
554 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
555 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
556 isl_seq_clr(bmap->ineq[bmap->n_ineq] +
557 1 + isl_basic_map_total_dim(bmap),
558 bmap->extra - bmap->n_div);
559 return bmap->n_ineq++;
562 int isl_basic_set_alloc_inequality(struct isl_basic_set *bset)
564 return isl_basic_map_alloc_inequality((struct isl_basic_map *)bset);
567 int isl_basic_map_free_inequality(struct isl_basic_map *bmap, unsigned n)
571 isl_assert(bmap->ctx, n <= bmap->n_ineq, return -1);
576 int isl_basic_set_free_inequality(struct isl_basic_set *bset, unsigned n)
578 return isl_basic_map_free_inequality((struct isl_basic_map *)bset, n);
581 int isl_basic_map_drop_inequality(struct isl_basic_map *bmap, unsigned pos)
586 isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
588 if (pos != bmap->n_ineq - 1) {
590 bmap->ineq[pos] = bmap->ineq[bmap->n_ineq - 1];
591 bmap->ineq[bmap->n_ineq - 1] = t;
592 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
598 int isl_basic_set_drop_inequality(struct isl_basic_set *bset, unsigned pos)
600 return isl_basic_map_drop_inequality((struct isl_basic_map *)bset, pos);
603 int isl_basic_map_alloc_div(struct isl_basic_map *bmap)
607 isl_assert(bmap->ctx, bmap->n_div < bmap->extra, return -1);
608 isl_seq_clr(bmap->div[bmap->n_div] +
609 1 + 1 + isl_basic_map_total_dim(bmap),
610 bmap->extra - bmap->n_div);
611 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
612 return bmap->n_div++;
615 int isl_basic_map_free_div(struct isl_basic_map *bmap, unsigned n)
619 isl_assert(bmap->ctx, n <= bmap->n_div, return -1);
624 /* Copy constraint from src to dst, putting the vars of src at offset
625 * dim_off in dst and the divs of src at offset div_off in dst.
626 * If both sets are actually map, then dim_off applies to the input
629 static void copy_constraint(struct isl_basic_map *dst_map, isl_int *dst,
630 struct isl_basic_map *src_map, isl_int *src,
631 unsigned in_off, unsigned out_off, unsigned div_off)
633 unsigned src_nparam = isl_basic_map_n_param(src_map);
634 unsigned dst_nparam = isl_basic_map_n_param(dst_map);
635 unsigned src_in = isl_basic_map_n_in(src_map);
636 unsigned dst_in = isl_basic_map_n_in(dst_map);
637 unsigned src_out = isl_basic_map_n_out(src_map);
638 unsigned dst_out = isl_basic_map_n_out(dst_map);
639 isl_int_set(dst[0], src[0]);
640 isl_seq_cpy(dst+1, src+1, isl_min(dst_nparam, src_nparam));
641 if (dst_nparam > src_nparam)
642 isl_seq_clr(dst+1+src_nparam,
643 dst_nparam - src_nparam);
644 isl_seq_clr(dst+1+dst_nparam, in_off);
645 isl_seq_cpy(dst+1+dst_nparam+in_off,
647 isl_min(dst_in-in_off, src_in));
648 if (dst_in-in_off > src_in)
649 isl_seq_clr(dst+1+dst_nparam+in_off+src_in,
650 dst_in - in_off - src_in);
651 isl_seq_clr(dst+1+dst_nparam+dst_in, out_off);
652 isl_seq_cpy(dst+1+dst_nparam+dst_in+out_off,
653 src+1+src_nparam+src_in,
654 isl_min(dst_out-out_off, src_out));
655 if (dst_out-out_off > src_out)
656 isl_seq_clr(dst+1+dst_nparam+dst_in+out_off+src_out,
657 dst_out - out_off - src_out);
658 isl_seq_clr(dst+1+dst_nparam+dst_in+dst_out, div_off);
659 isl_seq_cpy(dst+1+dst_nparam+dst_in+dst_out+div_off,
660 src+1+src_nparam+src_in+src_out,
661 isl_min(dst_map->extra-div_off, src_map->n_div));
662 if (dst_map->n_div-div_off > src_map->n_div)
663 isl_seq_clr(dst+1+dst_nparam+dst_in+dst_out+
664 div_off+src_map->n_div,
665 dst_map->n_div - div_off - src_map->n_div);
668 static void copy_div(struct isl_basic_map *dst_map, isl_int *dst,
669 struct isl_basic_map *src_map, isl_int *src,
670 unsigned in_off, unsigned out_off, unsigned div_off)
672 isl_int_set(dst[0], src[0]);
673 copy_constraint(dst_map, dst+1, src_map, src+1, in_off, out_off, div_off);
676 static struct isl_basic_map *add_constraints(struct isl_basic_map *bmap1,
677 struct isl_basic_map *bmap2, unsigned i_pos, unsigned o_pos)
682 if (!bmap1 || !bmap2)
685 div_off = bmap1->n_div;
687 for (i = 0; i < bmap2->n_eq; ++i) {
688 int i1 = isl_basic_map_alloc_equality(bmap1);
691 copy_constraint(bmap1, bmap1->eq[i1], bmap2, bmap2->eq[i],
692 i_pos, o_pos, div_off);
695 for (i = 0; i < bmap2->n_ineq; ++i) {
696 int i1 = isl_basic_map_alloc_inequality(bmap1);
699 copy_constraint(bmap1, bmap1->ineq[i1], bmap2, bmap2->ineq[i],
700 i_pos, o_pos, div_off);
703 for (i = 0; i < bmap2->n_div; ++i) {
704 int i1 = isl_basic_map_alloc_div(bmap1);
707 copy_div(bmap1, bmap1->div[i1], bmap2, bmap2->div[i],
708 i_pos, o_pos, div_off);
711 isl_basic_map_free(bmap2);
716 isl_basic_map_free(bmap1);
717 isl_basic_map_free(bmap2);
721 static void copy_constraint_dim_map(isl_int *dst, isl_int *src,
722 struct isl_dim_map *dim_map)
726 for (i = 0; i < dim_map->len; ++i) {
727 if (dim_map->pos[i] < 0)
728 isl_int_set_si(dst[i], 0);
730 isl_int_set(dst[i], src[dim_map->pos[i]]);
734 static void copy_div_dim_map(isl_int *dst, isl_int *src,
735 struct isl_dim_map *dim_map)
737 isl_int_set(dst[0], src[0]);
738 copy_constraint_dim_map(dst+1, src+1, dim_map);
741 static struct isl_basic_map *add_constraints_dim_map(struct isl_basic_map *dst,
742 struct isl_basic_map *src, struct isl_dim_map *dim_map)
746 if (!src || !dst || !dim_map)
749 for (i = 0; i < src->n_eq; ++i) {
750 int i1 = isl_basic_map_alloc_equality(dst);
753 copy_constraint_dim_map(dst->eq[i1], src->eq[i], dim_map);
756 for (i = 0; i < src->n_ineq; ++i) {
757 int i1 = isl_basic_map_alloc_inequality(dst);
760 copy_constraint_dim_map(dst->ineq[i1], src->ineq[i], dim_map);
763 for (i = 0; i < src->n_div; ++i) {
764 int i1 = isl_basic_map_alloc_div(dst);
767 copy_div_dim_map(dst->div[i1], src->div[i], dim_map);
771 isl_basic_map_free(src);
776 isl_basic_map_free(src);
777 isl_basic_map_free(dst);
781 struct isl_basic_set *isl_basic_set_add_constraints(struct isl_basic_set *bset1,
782 struct isl_basic_set *bset2, unsigned pos)
784 return (struct isl_basic_set *)
785 add_constraints((struct isl_basic_map *)bset1,
786 (struct isl_basic_map *)bset2, 0, pos);
789 struct isl_basic_map *isl_basic_map_extend_dim(struct isl_basic_map *base,
790 struct isl_dim *dim, unsigned extra,
791 unsigned n_eq, unsigned n_ineq)
793 struct isl_basic_map *ext;
803 dims_ok = isl_dim_equal(base->dim, dim) &&
804 base->extra >= base->n_div + extra;
806 if (dims_ok && room_for_con(base, n_eq + n_ineq) &&
807 room_for_ineq(base, n_ineq)) {
812 isl_assert(base->ctx, base->dim->nparam <= dim->nparam, goto error);
813 isl_assert(base->ctx, base->dim->n_in <= dim->n_in, goto error);
814 isl_assert(base->ctx, base->dim->n_out <= dim->n_out, goto error);
815 extra += base->extra;
817 n_ineq += base->n_ineq;
819 ext = isl_basic_map_alloc_dim(dim, extra, n_eq, n_ineq);
825 ext = add_constraints(ext, base, 0, 0);
828 ISL_F_CLR(ext, ISL_BASIC_SET_FINAL);
835 isl_basic_map_free(base);
839 struct isl_basic_set *isl_basic_set_extend_dim(struct isl_basic_set *base,
840 struct isl_dim *dim, unsigned extra,
841 unsigned n_eq, unsigned n_ineq)
843 return (struct isl_basic_set *)
844 isl_basic_map_extend_dim((struct isl_basic_map *)base, dim,
845 extra, n_eq, n_ineq);
848 struct isl_basic_map *isl_basic_map_extend_constraints(
849 struct isl_basic_map *base, unsigned n_eq, unsigned n_ineq)
853 return isl_basic_map_extend_dim(base, isl_dim_copy(base->dim),
857 struct isl_basic_map *isl_basic_map_extend(struct isl_basic_map *base,
858 unsigned nparam, unsigned n_in, unsigned n_out, unsigned extra,
859 unsigned n_eq, unsigned n_ineq)
861 struct isl_basic_map *bmap;
866 dim = isl_dim_alloc(base->ctx, nparam, n_in, n_out);
870 bmap = isl_basic_map_extend_dim(base, dim, extra, n_eq, n_ineq);
874 struct isl_basic_set *isl_basic_set_extend(struct isl_basic_set *base,
875 unsigned nparam, unsigned dim, unsigned extra,
876 unsigned n_eq, unsigned n_ineq)
878 return (struct isl_basic_set *)
879 isl_basic_map_extend((struct isl_basic_map *)base,
880 nparam, 0, dim, extra, n_eq, n_ineq);
883 struct isl_basic_set *isl_basic_set_extend_constraints(
884 struct isl_basic_set *base, unsigned n_eq, unsigned n_ineq)
886 return (struct isl_basic_set *)
887 isl_basic_map_extend_constraints((struct isl_basic_map *)base,
891 struct isl_basic_set *isl_basic_set_cow(struct isl_basic_set *bset)
893 return (struct isl_basic_set *)
894 isl_basic_map_cow((struct isl_basic_map *)bset);
897 struct isl_basic_map *isl_basic_map_cow(struct isl_basic_map *bmap)
904 bmap = isl_basic_map_dup(bmap);
906 ISL_F_CLR(bmap, ISL_BASIC_SET_FINAL);
910 struct isl_set *isl_set_cow(struct isl_set *set)
918 return isl_set_dup(set);
921 struct isl_map *isl_map_cow(struct isl_map *map)
929 return isl_map_dup(map);
932 static void swap_vars(struct isl_blk blk, isl_int *a,
933 unsigned a_len, unsigned b_len)
935 isl_seq_cpy(blk.data, a+a_len, b_len);
936 isl_seq_cpy(blk.data+b_len, a, a_len);
937 isl_seq_cpy(a, blk.data, b_len+a_len);
940 struct isl_basic_set *isl_basic_set_swap_vars(
941 struct isl_basic_set *bset, unsigned n)
951 nparam = isl_basic_set_n_param(bset);
952 dim = isl_basic_set_n_dim(bset);
953 isl_assert(bset->ctx, n <= dim, goto error);
958 bset = isl_basic_set_cow(bset);
962 blk = isl_blk_alloc(bset->ctx, dim);
963 if (isl_blk_is_error(blk))
966 for (i = 0; i < bset->n_eq; ++i)
968 bset->eq[i]+1+nparam, n, dim - n);
970 for (i = 0; i < bset->n_ineq; ++i)
972 bset->ineq[i]+1+nparam, n, dim - n);
974 for (i = 0; i < bset->n_div; ++i)
976 bset->div[i]+1+1+nparam, n, dim - n);
978 isl_blk_free(bset->ctx, blk);
980 ISL_F_CLR(bset, ISL_BASIC_SET_NORMALIZED);
984 isl_basic_set_free(bset);
988 struct isl_set *isl_set_swap_vars(struct isl_set *set, unsigned n)
991 set = isl_set_cow(set);
995 for (i = 0; i < set->n; ++i) {
996 set->p[i] = isl_basic_set_swap_vars(set->p[i], n);
1002 ISL_F_CLR(set, ISL_SET_NORMALIZED);
1006 struct isl_basic_map *isl_basic_map_set_to_empty(struct isl_basic_map *bmap)
1012 total = isl_basic_map_total_dim(bmap);
1013 isl_basic_map_free_div(bmap, bmap->n_div);
1014 isl_basic_map_free_inequality(bmap, bmap->n_ineq);
1016 isl_basic_map_free_equality(bmap, bmap->n_eq-1);
1018 isl_basic_map_alloc_equality(bmap);
1022 isl_int_set_si(bmap->eq[i][0], 1);
1023 isl_seq_clr(bmap->eq[i]+1, total);
1024 ISL_F_SET(bmap, ISL_BASIC_MAP_EMPTY);
1025 return isl_basic_map_finalize(bmap);
1027 isl_basic_map_free(bmap);
1031 struct isl_basic_set *isl_basic_set_set_to_empty(struct isl_basic_set *bset)
1033 return (struct isl_basic_set *)
1034 isl_basic_map_set_to_empty((struct isl_basic_map *)bset);
1037 static void swap_div(struct isl_basic_map *bmap, int a, int b)
1040 unsigned off = isl_dim_total(bmap->dim);
1041 isl_int *t = bmap->div[a];
1042 bmap->div[a] = bmap->div[b];
1045 for (i = 0; i < bmap->n_eq; ++i)
1046 isl_int_swap(bmap->eq[i][1+off+a], bmap->eq[i][1+off+b]);
1048 for (i = 0; i < bmap->n_ineq; ++i)
1049 isl_int_swap(bmap->ineq[i][1+off+a], bmap->ineq[i][1+off+b]);
1051 for (i = 0; i < bmap->n_div; ++i)
1052 isl_int_swap(bmap->div[i][1+1+off+a], bmap->div[i][1+1+off+b]);
1053 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1056 /* Eliminate the specified n dimensions starting at first from the
1057 * constraints using Fourier-Motzkin, The dimensions themselves
1060 struct isl_set *isl_set_eliminate_dims(struct isl_set *set,
1061 unsigned first, unsigned n)
1071 set = isl_set_cow(set);
1074 isl_assert(set->ctx, first+n <= isl_set_n_dim(set), goto error);
1075 nparam = isl_set_n_param(set);
1077 for (i = 0; i < set->n; ++i) {
1078 set->p[i] = isl_basic_set_eliminate_vars(set->p[i],
1089 /* Project out n dimensions starting at first using Fourier-Motzkin */
1090 struct isl_set *isl_set_remove_dims(struct isl_set *set,
1091 unsigned first, unsigned n)
1093 set = isl_set_eliminate_dims(set, first, n);
1094 set = isl_set_drop_dims(set, first, n);
1098 struct isl_basic_set *isl_basic_set_remove_divs(struct isl_basic_set *bset)
1100 bset = isl_basic_set_eliminate_vars(bset, isl_dim_total(bset->dim),
1108 struct isl_set *isl_set_remove_divs(struct isl_set *set)
1117 set = isl_set_cow(set);
1121 for (i = 0; i < set->n; ++i) {
1122 set->p[i] = isl_basic_set_remove_divs(set->p[i]);
1132 struct isl_basic_map *isl_basic_map_remove(struct isl_basic_map *bmap,
1133 enum isl_dim_type type, unsigned first, unsigned n)
1137 isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
1141 bmap = isl_basic_map_eliminate_vars(bmap,
1142 isl_basic_map_offset(bmap, type) - 1 + first, n);
1143 bmap = isl_basic_map_drop(bmap, type, first, n);
1146 isl_basic_map_free(bmap);
1150 struct isl_map *isl_map_remove(struct isl_map *map,
1151 enum isl_dim_type type, unsigned first, unsigned n)
1159 map = isl_map_cow(map);
1162 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
1164 for (i = 0; i < map->n; ++i) {
1165 map->p[i] = isl_basic_map_eliminate_vars(map->p[i],
1166 isl_basic_map_offset(map->p[i], type) - 1 + first, n);
1170 map = isl_map_drop(map, type, first, n);
1177 /* Project out n inputs starting at first using Fourier-Motzkin */
1178 struct isl_map *isl_map_remove_inputs(struct isl_map *map,
1179 unsigned first, unsigned n)
1181 return isl_map_remove(map, isl_dim_in, first, n);
1184 /* Project out n dimensions starting at first using Fourier-Motzkin */
1185 struct isl_basic_set *isl_basic_set_remove_dims(struct isl_basic_set *bset,
1186 unsigned first, unsigned n)
1188 unsigned nparam = isl_basic_set_n_param(bset);
1189 bset = isl_basic_set_eliminate_vars(bset, nparam + first, n);
1190 bset = isl_basic_set_drop_dims(bset, first, n);
1194 static void dump_term(struct isl_basic_map *bmap,
1195 isl_int c, int pos, FILE *out)
1198 unsigned in = isl_basic_map_n_in(bmap);
1199 unsigned dim = in + isl_basic_map_n_out(bmap);
1200 unsigned nparam = isl_basic_map_n_param(bmap);
1202 isl_int_print(out, c, 0);
1204 if (!isl_int_is_one(c))
1205 isl_int_print(out, c, 0);
1206 if (pos < 1 + nparam) {
1207 name = isl_dim_get_name(bmap->dim,
1208 isl_dim_param, pos - 1);
1210 fprintf(out, "%s", name);
1212 fprintf(out, "p%d", pos - 1);
1213 } else if (pos < 1 + nparam + in)
1214 fprintf(out, "i%d", pos - 1 - nparam);
1215 else if (pos < 1 + nparam + dim)
1216 fprintf(out, "o%d", pos - 1 - nparam - in);
1218 fprintf(out, "e%d", pos - 1 - nparam - dim);
1222 static void dump_constraint_sign(struct isl_basic_map *bmap, isl_int *c,
1223 int sign, FILE *out)
1227 unsigned len = 1 + isl_basic_map_total_dim(bmap);
1231 for (i = 0, first = 1; i < len; ++i) {
1232 if (isl_int_sgn(c[i]) * sign <= 0)
1235 fprintf(out, " + ");
1237 isl_int_abs(v, c[i]);
1238 dump_term(bmap, v, i, out);
1245 static void dump_constraint(struct isl_basic_map *bmap, isl_int *c,
1246 const char *op, FILE *out, int indent)
1250 fprintf(out, "%*s", indent, "");
1252 dump_constraint_sign(bmap, c, 1, out);
1253 fprintf(out, " %s ", op);
1254 dump_constraint_sign(bmap, c, -1, out);
1258 for (i = bmap->n_div; i < bmap->extra; ++i) {
1259 if (isl_int_is_zero(c[1+isl_dim_total(bmap->dim)+i]))
1261 fprintf(out, "%*s", indent, "");
1262 fprintf(out, "ERROR: unused div coefficient not zero\n");
1267 static void dump_constraints(struct isl_basic_map *bmap,
1268 isl_int **c, unsigned n,
1269 const char *op, FILE *out, int indent)
1273 for (i = 0; i < n; ++i)
1274 dump_constraint(bmap, c[i], op, out, indent);
1277 static void dump_affine(struct isl_basic_map *bmap, isl_int *exp, FILE *out)
1281 unsigned total = isl_basic_map_total_dim(bmap);
1283 for (j = 0; j < 1 + total; ++j) {
1284 if (isl_int_is_zero(exp[j]))
1286 if (!first && isl_int_is_pos(exp[j]))
1288 dump_term(bmap, exp[j], j, out);
1293 static void dump(struct isl_basic_map *bmap, FILE *out, int indent)
1297 dump_constraints(bmap, bmap->eq, bmap->n_eq, "=", out, indent);
1298 dump_constraints(bmap, bmap->ineq, bmap->n_ineq, ">=", out, indent);
1300 for (i = 0; i < bmap->n_div; ++i) {
1301 fprintf(out, "%*s", indent, "");
1302 fprintf(out, "e%d = [(", i);
1303 dump_affine(bmap, bmap->div[i]+1, out);
1305 isl_int_print(out, bmap->div[i][0], 0);
1306 fprintf(out, "]\n");
1310 void isl_basic_set_dump(struct isl_basic_set *bset, FILE *out, int indent)
1313 fprintf(out, "null basic set\n");
1317 fprintf(out, "%*s", indent, "");
1318 fprintf(out, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n",
1319 bset->ref, bset->dim->nparam, bset->dim->n_out,
1320 bset->extra, bset->flags);
1321 dump((struct isl_basic_map *)bset, out, indent);
1324 void isl_basic_map_dump(struct isl_basic_map *bmap, FILE *out, int indent)
1327 fprintf(out, "null basic map\n");
1331 fprintf(out, "%*s", indent, "");
1332 fprintf(out, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, "
1333 "flags: %x, n_name: %d\n",
1335 bmap->dim->nparam, bmap->dim->n_in, bmap->dim->n_out,
1336 bmap->extra, bmap->flags, bmap->dim->n_name);
1337 dump(bmap, out, indent);
1340 int isl_inequality_negate(struct isl_basic_map *bmap, unsigned pos)
1345 total = isl_basic_map_total_dim(bmap);
1346 isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
1347 isl_seq_neg(bmap->ineq[pos], bmap->ineq[pos], 1 + total);
1348 isl_int_sub_ui(bmap->ineq[pos][0], bmap->ineq[pos][0], 1);
1349 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1353 struct isl_set *isl_set_alloc_dim(struct isl_dim *dim, int n, unsigned flags)
1355 struct isl_set *set;
1359 isl_assert(dim->ctx, dim->n_in == 0, return NULL);
1360 isl_assert(dim->ctx, n >= 0, return NULL);
1361 set = isl_alloc(dim->ctx, struct isl_set,
1362 sizeof(struct isl_set) +
1363 n * sizeof(struct isl_basic_set *));
1367 set->ctx = dim->ctx;
1368 isl_ctx_ref(set->ctx);
1380 struct isl_set *isl_set_alloc(struct isl_ctx *ctx,
1381 unsigned nparam, unsigned dim, int n, unsigned flags)
1383 struct isl_set *set;
1384 struct isl_dim *dims;
1386 dims = isl_dim_alloc(ctx, nparam, 0, dim);
1390 set = isl_set_alloc_dim(dims, n, flags);
1394 struct isl_set *isl_set_dup(struct isl_set *set)
1397 struct isl_set *dup;
1402 dup = isl_set_alloc_dim(isl_dim_copy(set->dim), set->n, set->flags);
1405 for (i = 0; i < set->n; ++i)
1406 dup = isl_set_add(dup, isl_basic_set_copy(set->p[i]));
1410 struct isl_set *isl_set_from_basic_set(struct isl_basic_set *bset)
1412 struct isl_set *set;
1417 set = isl_set_alloc_dim(isl_dim_copy(bset->dim), 1, ISL_MAP_DISJOINT);
1419 isl_basic_set_free(bset);
1422 return isl_set_add(set, bset);
1425 struct isl_map *isl_map_from_basic_map(struct isl_basic_map *bmap)
1427 struct isl_map *map;
1432 map = isl_map_alloc_dim(isl_dim_copy(bmap->dim), 1, ISL_MAP_DISJOINT);
1434 isl_basic_map_free(bmap);
1437 return isl_map_add(map, bmap);
1440 struct isl_set *isl_set_add(struct isl_set *set, struct isl_basic_set *bset)
1444 isl_assert(set->ctx, isl_dim_equal(set->dim, bset->dim), goto error);
1445 isl_assert(set->ctx, set->n < set->size, goto error);
1446 set->p[set->n] = bset;
1453 isl_basic_set_free(bset);
1457 void isl_set_free(struct isl_set *set)
1467 isl_ctx_deref(set->ctx);
1468 for (i = 0; i < set->n; ++i)
1469 isl_basic_set_free(set->p[i]);
1470 isl_dim_free(set->dim);
1474 void isl_set_dump(struct isl_set *set, FILE *out, int indent)
1479 fprintf(out, "null set\n");
1483 fprintf(out, "%*s", indent, "");
1484 fprintf(out, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
1485 set->ref, set->n, set->dim->nparam, set->dim->n_out,
1487 for (i = 0; i < set->n; ++i) {
1488 fprintf(out, "%*s", indent, "");
1489 fprintf(out, "basic set %d:\n", i);
1490 isl_basic_set_dump(set->p[i], out, indent+4);
1494 void isl_map_dump(struct isl_map *map, FILE *out, int indent)
1499 fprintf(out, "null map\n");
1503 fprintf(out, "%*s", indent, "");
1504 fprintf(out, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, "
1505 "flags: %x, n_name: %d\n",
1506 map->ref, map->n, map->dim->nparam, map->dim->n_in,
1507 map->dim->n_out, map->flags, map->dim->n_name);
1508 for (i = 0; i < map->n; ++i) {
1509 fprintf(out, "%*s", indent, "");
1510 fprintf(out, "basic map %d:\n", i);
1511 isl_basic_map_dump(map->p[i], out, indent+4);
1515 struct isl_basic_map *isl_basic_map_intersect_domain(
1516 struct isl_basic_map *bmap, struct isl_basic_set *bset)
1518 struct isl_basic_map *bmap_domain;
1519 struct isl_dim *dim;
1524 isl_assert(bset->ctx, isl_dim_match(bmap->dim, isl_dim_param,
1525 bset->dim, isl_dim_param), goto error);
1527 if (isl_dim_size(bset->dim, isl_dim_set) != 0)
1528 isl_assert(bset->ctx,
1529 isl_basic_map_compatible_domain(bmap, bset), goto error);
1531 bmap = isl_basic_map_cow(bmap);
1532 bmap = isl_basic_map_extend_dim(bmap, isl_dim_copy(bmap->dim),
1533 bset->n_div, bset->n_eq, bset->n_ineq);
1536 dim = isl_dim_reverse(isl_dim_copy(bset->dim));
1537 bmap_domain = isl_basic_map_from_basic_set(bset, dim);
1538 bmap = add_constraints(bmap, bmap_domain, 0, 0);
1540 bmap = isl_basic_map_simplify(bmap);
1541 return isl_basic_map_finalize(bmap);
1543 isl_basic_map_free(bmap);
1544 isl_basic_set_free(bset);
1548 struct isl_basic_map *isl_basic_map_intersect_range(
1549 struct isl_basic_map *bmap, struct isl_basic_set *bset)
1551 struct isl_basic_map *bmap_range;
1556 isl_assert(bset->ctx, isl_dim_match(bmap->dim, isl_dim_param,
1557 bset->dim, isl_dim_param), goto error);
1559 if (isl_dim_size(bset->dim, isl_dim_set) != 0)
1560 isl_assert(bset->ctx,
1561 isl_basic_map_compatible_range(bmap, bset), goto error);
1563 bmap = isl_basic_map_cow(bmap);
1564 bmap = isl_basic_map_extend_dim(bmap, isl_dim_copy(bmap->dim),
1565 bset->n_div, bset->n_eq, bset->n_ineq);
1568 bmap_range = isl_basic_map_from_basic_set(bset, isl_dim_copy(bset->dim));
1569 bmap = add_constraints(bmap, bmap_range, 0, 0);
1571 bmap = isl_basic_map_simplify(bmap);
1572 return isl_basic_map_finalize(bmap);
1574 isl_basic_map_free(bmap);
1575 isl_basic_set_free(bset);
1579 static int basic_map_contains(struct isl_basic_map *bmap, struct isl_vec *vec)
1585 total = 1 + isl_basic_map_total_dim(bmap);
1586 if (total != vec->size)
1591 for (i = 0; i < bmap->n_eq; ++i) {
1592 isl_seq_inner_product(vec->block.data, bmap->eq[i], total, &s);
1593 if (!isl_int_is_zero(s)) {
1599 for (i = 0; i < bmap->n_ineq; ++i) {
1600 isl_seq_inner_product(vec->block.data, bmap->ineq[i], total, &s);
1601 if (isl_int_is_neg(s)) {
1612 struct isl_basic_map *isl_basic_map_intersect(
1613 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
1615 struct isl_vec *sample = NULL;
1617 if (!bmap1 || !bmap2)
1620 isl_assert(bmap1->ctx, isl_dim_match(bmap1->dim, isl_dim_param,
1621 bmap2->dim, isl_dim_param), goto error);
1622 if (isl_dim_total(bmap1->dim) ==
1623 isl_dim_size(bmap1->dim, isl_dim_param) &&
1624 isl_dim_total(bmap2->dim) !=
1625 isl_dim_size(bmap2->dim, isl_dim_param))
1626 return isl_basic_map_intersect(bmap2, bmap1);
1628 if (isl_dim_total(bmap2->dim) !=
1629 isl_dim_size(bmap2->dim, isl_dim_param))
1630 isl_assert(bmap1->ctx,
1631 isl_dim_equal(bmap1->dim, bmap2->dim), goto error);
1633 if (bmap1->sample &&
1634 basic_map_contains(bmap1, bmap1->sample) > 0 &&
1635 basic_map_contains(bmap2, bmap1->sample) > 0)
1636 sample = isl_vec_copy(bmap1->ctx, bmap1->sample);
1637 else if (bmap2->sample &&
1638 basic_map_contains(bmap1, bmap2->sample) > 0 &&
1639 basic_map_contains(bmap2, bmap2->sample) > 0)
1640 sample = isl_vec_copy(bmap2->ctx, bmap2->sample);
1642 bmap1 = isl_basic_map_cow(bmap1);
1643 bmap1 = isl_basic_map_extend_dim(bmap1, isl_dim_copy(bmap1->dim),
1644 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
1647 bmap1 = add_constraints(bmap1, bmap2, 0, 0);
1650 isl_vec_free(bmap1->ctx, bmap1->sample);
1651 bmap1->sample = sample;
1654 bmap1 = isl_basic_map_simplify(bmap1);
1655 return isl_basic_map_finalize(bmap1);
1658 isl_vec_free(bmap1->ctx, sample);
1659 isl_basic_map_free(bmap1);
1660 isl_basic_map_free(bmap2);
1664 struct isl_basic_set *isl_basic_set_intersect(
1665 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
1667 return (struct isl_basic_set *)
1668 isl_basic_map_intersect(
1669 (struct isl_basic_map *)bset1,
1670 (struct isl_basic_map *)bset2);
1673 struct isl_map *isl_map_intersect(struct isl_map *map1, struct isl_map *map2)
1676 struct isl_map *result;
1682 isl_assert(map1->ctx, isl_dim_match(map1->dim, isl_dim_param,
1683 map2->dim, isl_dim_param), goto error);
1684 if (isl_dim_total(map1->dim) ==
1685 isl_dim_size(map1->dim, isl_dim_param) &&
1686 isl_dim_total(map2->dim) != isl_dim_size(map2->dim, isl_dim_param))
1687 return isl_map_intersect(map2, map1);
1689 if (isl_dim_total(map2->dim) != isl_dim_size(map2->dim, isl_dim_param))
1690 isl_assert(map1->ctx,
1691 isl_dim_equal(map1->dim, map2->dim), goto error);
1693 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
1694 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
1695 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
1697 result = isl_map_alloc_dim(isl_dim_copy(map1->dim),
1698 map1->n * map2->n, flags);
1701 for (i = 0; i < map1->n; ++i)
1702 for (j = 0; j < map2->n; ++j) {
1703 struct isl_basic_map *part;
1704 part = isl_basic_map_intersect(
1705 isl_basic_map_copy(map1->p[i]),
1706 isl_basic_map_copy(map2->p[j]));
1707 if (isl_basic_map_is_empty(part))
1708 isl_basic_map_free(part);
1710 result = isl_map_add(result, part);
1723 struct isl_set *isl_set_intersect(struct isl_set *set1, struct isl_set *set2)
1725 return (struct isl_set *)
1726 isl_map_intersect((struct isl_map *)set1,
1727 (struct isl_map *)set2);
1730 struct isl_basic_map *isl_basic_map_reverse(struct isl_basic_map *bmap)
1732 struct isl_dim *dim;
1733 struct isl_basic_set *bset;
1738 bmap = isl_basic_map_cow(bmap);
1741 dim = isl_dim_reverse(isl_dim_copy(bmap->dim));
1742 in = isl_basic_map_n_in(bmap);
1743 bset = isl_basic_set_from_basic_map(bmap);
1744 bset = isl_basic_set_swap_vars(bset, in);
1745 return isl_basic_map_from_basic_set(bset, dim);
1748 /* Turn final n dimensions into existentially quantified variables.
1750 struct isl_basic_set *isl_basic_set_project_out(
1751 struct isl_basic_set *bset, unsigned n, unsigned flags)
1761 isl_assert(bset->ctx, n <= isl_basic_set_n_dim(bset), goto error);
1766 bset = isl_basic_set_cow(bset);
1768 row_size = 1 + isl_dim_total(bset->dim) + bset->extra;
1769 old = bset->block2.data;
1770 bset->block2 = isl_blk_extend(bset->ctx, bset->block2,
1771 (bset->extra + n) * (1 + row_size));
1772 if (!bset->block2.data)
1774 new_div = isl_alloc_array(ctx, isl_int *, bset->extra + n);
1777 for (i = 0; i < n; ++i) {
1778 new_div[i] = bset->block2.data +
1779 (bset->extra + i) * (1 + row_size);
1780 isl_seq_clr(new_div[i], 1 + row_size);
1782 for (i = 0; i < bset->extra; ++i)
1783 new_div[n + i] = bset->block2.data + (bset->div[i] - old);
1785 bset->div = new_div;
1788 bset->dim = isl_dim_drop_outputs(bset->dim,
1789 isl_basic_set_n_dim(bset) - n, n);
1792 bset = isl_basic_set_simplify(bset);
1793 return isl_basic_set_finalize(bset);
1795 isl_basic_set_free(bset);
1799 struct isl_basic_map *add_divs(struct isl_basic_map *bmap, unsigned n)
1803 for (i = 0; i < n; ++i) {
1804 j = isl_basic_map_alloc_div(bmap);
1807 isl_seq_clr(bmap->div[j], 1+1+isl_basic_map_total_dim(bmap));
1811 isl_basic_map_free(bmap);
1815 struct isl_basic_map *isl_basic_map_apply_range(
1816 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
1818 struct isl_dim *dim_result = NULL;
1819 struct isl_basic_map *bmap;
1820 unsigned n_in, n_out, n, nparam, total, pos;
1821 struct isl_dim_map *dim_map1, *dim_map2;
1823 if (!bmap1 || !bmap2)
1826 dim_result = isl_dim_join(isl_dim_copy(bmap1->dim),
1827 isl_dim_copy(bmap2->dim));
1829 n_in = isl_basic_map_n_in(bmap1);
1830 n_out = isl_basic_map_n_out(bmap2);
1831 n = isl_basic_map_n_out(bmap1);
1832 nparam = isl_basic_map_n_param(bmap1);
1834 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + n;
1835 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
1836 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
1837 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
1838 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
1839 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
1840 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_in);
1841 isl_dim_map_div(dim_map1, bmap1, pos += n_out);
1842 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
1843 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
1844 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
1846 bmap = isl_basic_map_alloc_dim(dim_result,
1847 bmap1->n_div + bmap2->n_div + n,
1848 bmap1->n_eq + bmap2->n_eq,
1849 bmap1->n_ineq + bmap2->n_ineq);
1850 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
1851 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
1852 bmap = add_divs(bmap, n);
1853 bmap = isl_basic_map_simplify(bmap);
1854 return isl_basic_map_finalize(bmap);
1856 isl_basic_map_free(bmap1);
1857 isl_basic_map_free(bmap2);
1861 struct isl_basic_set *isl_basic_set_apply(
1862 struct isl_basic_set *bset, struct isl_basic_map *bmap)
1867 isl_assert(set->ctx, isl_basic_map_compatible_domain(bmap, bset),
1870 return (struct isl_basic_set *)
1871 isl_basic_map_apply_range((struct isl_basic_map *)bset, bmap);
1873 isl_basic_set_free(bset);
1874 isl_basic_map_free(bmap);
1878 struct isl_basic_map *isl_basic_map_apply_domain(
1879 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
1881 if (!bmap1 || !bmap2)
1885 isl_basic_map_n_in(bmap1) == isl_basic_map_n_in(bmap2), goto error);
1887 isl_basic_map_n_param(bmap1) == isl_basic_map_n_param(bmap2),
1890 bmap1 = isl_basic_map_reverse(bmap1);
1891 bmap1 = isl_basic_map_apply_range(bmap1, bmap2);
1892 return isl_basic_map_reverse(bmap1);
1894 isl_basic_map_free(bmap1);
1895 isl_basic_map_free(bmap2);
1899 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
1900 * A \cap B -> f(A) + f(B)
1902 struct isl_basic_map *isl_basic_map_sum(
1903 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
1905 unsigned n_in, n_out, nparam, total, pos;
1906 struct isl_basic_map *bmap = NULL;
1907 struct isl_dim_map *dim_map1, *dim_map2;
1910 if (!bmap1 || !bmap2)
1913 isl_assert(bmap1->ctx, isl_dim_equal(bmap1->dim, bmap2->dim),
1916 nparam = isl_basic_map_n_param(bmap1);
1917 n_in = isl_basic_map_n_in(bmap1);
1918 n_out = isl_basic_map_n_out(bmap1);
1920 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + 2 * n_out;
1921 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
1922 dim_map2 = isl_dim_map_alloc(bmap2->ctx, total);
1923 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
1924 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos);
1925 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
1926 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
1927 isl_dim_map_div(dim_map1, bmap1, pos += n_in + n_out);
1928 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
1929 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
1930 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_out);
1932 bmap = isl_basic_map_alloc_dim(isl_dim_copy(bmap1->dim),
1933 bmap1->n_div + bmap2->n_div + 2 * n_out,
1934 bmap1->n_eq + bmap2->n_eq + n_out,
1935 bmap1->n_ineq + bmap2->n_ineq);
1936 for (i = 0; i < n_out; ++i) {
1937 int j = isl_basic_map_alloc_equality(bmap);
1940 isl_seq_clr(bmap->eq[j], 1+total);
1941 isl_int_set_si(bmap->eq[j][1+nparam+n_in+i], -1);
1942 isl_int_set_si(bmap->eq[j][1+pos+i], 1);
1943 isl_int_set_si(bmap->eq[j][1+pos-n_out+i], 1);
1945 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
1946 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
1947 bmap = add_divs(bmap, 2 * n_out);
1949 bmap = isl_basic_map_simplify(bmap);
1950 return isl_basic_map_finalize(bmap);
1952 isl_basic_map_free(bmap);
1953 isl_basic_map_free(bmap1);
1954 isl_basic_map_free(bmap2);
1958 /* Given a basic map A -> f(A), construct A -> -f(A).
1960 struct isl_basic_map *isl_basic_map_neg(struct isl_basic_map *bmap)
1965 bmap = isl_basic_map_cow(bmap);
1969 n = isl_basic_map_dim(bmap, isl_dim_out);
1970 off = isl_basic_map_offset(bmap, isl_dim_out);
1971 for (i = 0; i < bmap->n_eq; ++i)
1972 for (j = 0; j < n; ++j)
1973 isl_int_neg(bmap->eq[i][off+j], bmap->eq[i][off+j]);
1974 for (i = 0; i < bmap->n_ineq; ++i)
1975 for (j = 0; j < n; ++j)
1976 isl_int_neg(bmap->ineq[i][off+j], bmap->ineq[i][off+j]);
1977 for (i = 0; i < bmap->n_div; ++i)
1978 for (j = 0; j < n; ++j)
1979 isl_int_neg(bmap->div[i][1+off+j], bmap->div[i][1+off+j]);
1980 return isl_basic_map_finalize(bmap);
1983 /* Given a basic map A -> f(A) and an integer d, construct a basic map
1984 * A -> floor(f(A)/d).
1986 struct isl_basic_map *isl_basic_map_floordiv(struct isl_basic_map *bmap,
1989 unsigned n_in, n_out, nparam, total, pos;
1990 struct isl_basic_map *result = NULL;
1991 struct isl_dim_map *dim_map;
1997 nparam = isl_basic_map_n_param(bmap);
1998 n_in = isl_basic_map_n_in(bmap);
1999 n_out = isl_basic_map_n_out(bmap);
2001 total = nparam + n_in + n_out + bmap->n_div + n_out;
2002 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2003 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_param, pos = 0);
2004 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_in, pos += nparam);
2005 isl_dim_map_div(dim_map, bmap, pos += n_in + n_out);
2006 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_out, pos += bmap->n_div);
2008 result = isl_basic_map_alloc_dim(isl_dim_copy(bmap->dim),
2009 bmap->n_div + n_out,
2010 bmap->n_eq, bmap->n_ineq + 2 * n_out);
2011 result = add_constraints_dim_map(result, bmap, dim_map);
2012 result = add_divs(result, n_out);
2013 for (i = 0; i < n_out; ++i) {
2015 j = isl_basic_map_alloc_inequality(result);
2018 isl_seq_clr(result->ineq[j], 1+total);
2019 isl_int_neg(result->ineq[j][1+nparam+n_in+i], d);
2020 isl_int_set_si(result->ineq[j][1+pos+i], 1);
2021 j = isl_basic_map_alloc_inequality(result);
2024 isl_seq_clr(result->ineq[j], 1+total);
2025 isl_int_set(result->ineq[j][1+nparam+n_in+i], d);
2026 isl_int_set_si(result->ineq[j][1+pos+i], -1);
2027 isl_int_sub_ui(result->ineq[j][0], d, 1);
2030 result = isl_basic_map_simplify(result);
2031 return isl_basic_map_finalize(result);
2033 isl_basic_map_free(result);
2037 static struct isl_basic_map *var_equal(struct isl_basic_map *bmap, unsigned pos)
2043 i = isl_basic_map_alloc_equality(bmap);
2046 nparam = isl_basic_map_n_param(bmap);
2047 n_in = isl_basic_map_n_in(bmap);
2048 isl_seq_clr(bmap->eq[i], 1 + isl_basic_map_total_dim(bmap));
2049 isl_int_set_si(bmap->eq[i][1+nparam+pos], -1);
2050 isl_int_set_si(bmap->eq[i][1+nparam+n_in+pos], 1);
2051 return isl_basic_map_finalize(bmap);
2053 isl_basic_map_free(bmap);
2057 static struct isl_basic_map *var_more(struct isl_basic_map *bmap, unsigned pos)
2063 i = isl_basic_map_alloc_inequality(bmap);
2066 nparam = isl_basic_map_n_param(bmap);
2067 n_in = isl_basic_map_n_in(bmap);
2068 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
2069 isl_int_set_si(bmap->ineq[i][0], -1);
2070 isl_int_set_si(bmap->ineq[i][1+nparam+pos], -1);
2071 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], 1);
2072 return isl_basic_map_finalize(bmap);
2074 isl_basic_map_free(bmap);
2078 static struct isl_basic_map *var_less(struct isl_basic_map *bmap, unsigned pos)
2084 i = isl_basic_map_alloc_inequality(bmap);
2087 nparam = isl_basic_map_n_param(bmap);
2088 n_in = isl_basic_map_n_in(bmap);
2089 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
2090 isl_int_set_si(bmap->ineq[i][0], -1);
2091 isl_int_set_si(bmap->ineq[i][1+nparam+pos], 1);
2092 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], -1);
2093 return isl_basic_map_finalize(bmap);
2095 isl_basic_map_free(bmap);
2099 struct isl_basic_map *isl_basic_map_equal(struct isl_dim *dim, unsigned n_equal)
2102 struct isl_basic_map *bmap;
2103 bmap = isl_basic_map_alloc_dim(dim, 0, n_equal, 0);
2106 for (i = 0; i < n_equal && bmap; ++i)
2107 bmap = var_equal(bmap, i);
2108 return isl_basic_map_finalize(bmap);
2111 struct isl_basic_map *isl_basic_map_less_at(struct isl_dim *dim, unsigned pos)
2114 struct isl_basic_map *bmap;
2115 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
2118 for (i = 0; i < pos && bmap; ++i)
2119 bmap = var_equal(bmap, i);
2121 bmap = var_less(bmap, pos);
2122 return isl_basic_map_finalize(bmap);
2125 struct isl_basic_map *isl_basic_map_more_at(struct isl_dim *dim, unsigned pos)
2128 struct isl_basic_map *bmap;
2129 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
2132 for (i = 0; i < pos && bmap; ++i)
2133 bmap = var_equal(bmap, i);
2135 bmap = var_more(bmap, pos);
2136 return isl_basic_map_finalize(bmap);
2139 struct isl_basic_map *isl_basic_map_from_basic_set(
2140 struct isl_basic_set *bset, struct isl_dim *dim)
2142 struct isl_basic_map *bmap;
2144 bset = isl_basic_set_cow(bset);
2148 isl_assert(bset->ctx, isl_dim_compatible(bset->dim, dim), goto error);
2149 isl_dim_free(bset->dim);
2150 bmap = (struct isl_basic_map *) bset;
2152 return isl_basic_map_finalize(bmap);
2154 isl_basic_set_free(bset);
2159 struct isl_basic_set *isl_basic_set_from_basic_map(struct isl_basic_map *bmap)
2163 if (bmap->dim->n_in == 0)
2164 return (struct isl_basic_set *)bmap;
2165 bmap = isl_basic_map_cow(bmap);
2168 bmap->dim = isl_dim_cow(bmap->dim);
2171 bmap->dim->n_out += bmap->dim->n_in;
2172 bmap->dim->n_in = 0;
2173 bmap = isl_basic_map_finalize(bmap);
2174 return (struct isl_basic_set *)bmap;
2176 isl_basic_map_free(bmap);
2180 /* For a div d = floor(f/m), add the constraints
2183 * -(f-(n-1)) + m d >= 0
2185 * Note that the second constraint is the negation of
2189 static int add_div_constraints(struct isl_basic_map *bmap, unsigned div)
2192 unsigned total = isl_basic_map_total_dim(bmap);
2193 unsigned div_pos = 1 + total - bmap->n_div + div;
2195 i = isl_basic_map_alloc_inequality(bmap);
2198 isl_seq_cpy(bmap->ineq[i], bmap->div[div]+1, 1+total);
2199 isl_int_neg(bmap->ineq[i][div_pos], bmap->div[div][0]);
2201 j = isl_basic_map_alloc_inequality(bmap);
2204 isl_seq_neg(bmap->ineq[j], bmap->ineq[i], 1 + total);
2205 isl_int_add(bmap->ineq[j][0], bmap->ineq[j][0], bmap->ineq[j][div_pos]);
2206 isl_int_sub_ui(bmap->ineq[j][0], bmap->ineq[j][0], 1);
2210 struct isl_basic_set *isl_basic_map_underlying_set(
2211 struct isl_basic_map *bmap)
2215 if (bmap->dim->nparam == 0 && bmap->dim->n_in == 0 && bmap->n_div == 0)
2216 return (struct isl_basic_set *)bmap;
2217 bmap = isl_basic_map_cow(bmap);
2220 bmap->dim = isl_dim_underlying(bmap->dim, bmap->n_div);
2223 bmap->extra -= bmap->n_div;
2225 bmap = isl_basic_map_finalize(bmap);
2226 return (struct isl_basic_set *)bmap;
2231 struct isl_basic_map *isl_basic_map_overlying_set(
2232 struct isl_basic_set *bset, struct isl_basic_map *like)
2234 struct isl_basic_map *bmap;
2235 struct isl_ctx *ctx;
2242 isl_assert(ctx, bset->n_div == 0, goto error);
2243 isl_assert(ctx, isl_basic_set_n_param(bset) == 0, goto error);
2244 isl_assert(ctx, bset->dim->n_out == isl_basic_map_total_dim(like),
2246 if (isl_dim_equal(bset->dim, like->dim) && like->n_div == 0) {
2247 isl_basic_map_free(like);
2248 return (struct isl_basic_map *)bset;
2250 bset = isl_basic_set_cow(bset);
2253 total = bset->dim->n_out + bset->extra;
2254 bmap = (struct isl_basic_map *)bset;
2255 isl_dim_free(bmap->dim);
2256 bmap->dim = isl_dim_copy(like->dim);
2259 bmap->n_div = like->n_div;
2260 bmap->extra += like->n_div;
2263 ltotal = total - bmap->extra + like->extra;
2266 bmap->block2 = isl_blk_extend(ctx, bmap->block2,
2267 bmap->extra * (1 + 1 + total));
2268 if (isl_blk_is_error(bmap->block2))
2270 bmap->div = isl_realloc_array(ctx, bmap->div, isl_int *,
2274 for (i = 0; i < bmap->extra; ++i)
2275 bmap->div[i] = bmap->block2.data + i * (1 + 1 + total);
2276 for (i = 0; i < like->n_div; ++i) {
2277 isl_seq_cpy(bmap->div[i], like->div[i], 1 + 1 + ltotal);
2278 isl_seq_clr(bmap->div[i]+1+1+ltotal, total - ltotal);
2280 bmap = isl_basic_map_extend_constraints(bmap,
2281 0, 2 * like->n_div);
2282 for (i = 0; i < like->n_div; ++i) {
2283 if (isl_int_is_zero(bmap->div[i][0]))
2285 if (add_div_constraints(bmap, i) < 0)
2289 isl_basic_map_free(like);
2290 bmap = isl_basic_map_simplify(bmap);
2291 bmap = isl_basic_map_finalize(bmap);
2294 isl_basic_map_free(like);
2295 isl_basic_set_free(bset);
2299 struct isl_basic_set *isl_basic_set_from_underlying_set(
2300 struct isl_basic_set *bset, struct isl_basic_set *like)
2302 return (struct isl_basic_set *)
2303 isl_basic_map_overlying_set(bset, (struct isl_basic_map *)like);
2306 struct isl_set *isl_set_from_underlying_set(
2307 struct isl_set *set, struct isl_basic_set *like)
2313 isl_assert(set->ctx, set->dim->n_out == isl_basic_set_total_dim(like),
2315 if (isl_dim_equal(set->dim, like->dim) && like->n_div == 0) {
2316 isl_basic_set_free(like);
2319 set = isl_set_cow(set);
2322 for (i = 0; i < set->n; ++i) {
2323 set->p[i] = isl_basic_set_from_underlying_set(set->p[i],
2324 isl_basic_set_copy(like));
2328 isl_dim_free(set->dim);
2329 set->dim = isl_dim_copy(like->dim);
2332 isl_basic_set_free(like);
2335 isl_basic_set_free(like);
2340 struct isl_set *isl_map_underlying_set(struct isl_map *map)
2344 map = isl_map_cow(map);
2347 map->dim = isl_dim_cow(map->dim);
2351 for (i = 1; i < map->n; ++i)
2352 isl_assert(map->ctx, map->p[0]->n_div == map->p[i]->n_div,
2354 for (i = 0; i < map->n; ++i) {
2355 map->p[i] = (struct isl_basic_map *)
2356 isl_basic_map_underlying_set(map->p[i]);
2361 map->dim = isl_dim_underlying(map->dim, 0);
2363 isl_dim_free(map->dim);
2364 map->dim = isl_dim_copy(map->p[0]->dim);
2368 return (struct isl_set *)map;
2374 struct isl_set *isl_set_to_underlying_set(struct isl_set *set)
2376 return (struct isl_set *)isl_map_underlying_set((struct isl_map *)set);
2379 struct isl_basic_set *isl_basic_map_domain(struct isl_basic_map *bmap)
2381 struct isl_basic_set *domain;
2385 n_out = isl_basic_map_n_out(bmap);
2386 domain = isl_basic_set_from_basic_map(bmap);
2387 return isl_basic_set_project_out(domain, n_out, 0);
2390 struct isl_basic_set *isl_basic_map_range(struct isl_basic_map *bmap)
2392 return isl_basic_map_domain(isl_basic_map_reverse(bmap));
2395 struct isl_set *isl_map_range(struct isl_map *map)
2398 struct isl_set *set;
2402 map = isl_map_cow(map);
2406 set = (struct isl_set *) map;
2407 if (set->dim->n_in != 0) {
2408 set->dim = isl_dim_drop_inputs(set->dim, 0, set->dim->n_in);
2412 for (i = 0; i < map->n; ++i) {
2413 set->p[i] = isl_basic_map_range(map->p[i]);
2417 ISL_F_CLR(set, ISL_MAP_DISJOINT);
2418 ISL_F_CLR(set, ISL_SET_NORMALIZED);
2425 struct isl_map *isl_map_from_set(struct isl_set *set, struct isl_dim *dim)
2428 struct isl_map *map = NULL;
2430 set = isl_set_cow(set);
2433 isl_assert(set->ctx, isl_dim_compatible(set->dim, dim), goto error);
2434 map = (struct isl_map *)set;
2435 for (i = 0; i < set->n; ++i) {
2436 map->p[i] = isl_basic_map_from_basic_set(
2437 set->p[i], isl_dim_copy(dim));
2441 isl_dim_free(map->dim);
2450 struct isl_map *isl_map_from_range(struct isl_set *set)
2452 return (struct isl_map *)set;
2455 struct isl_set *isl_set_from_map(struct isl_map *map)
2458 struct isl_set *set = NULL;
2462 map = isl_map_cow(map);
2465 map->dim = isl_dim_cow(map->dim);
2468 map->dim->n_out += map->dim->n_in;
2470 set = (struct isl_set *)map;
2471 for (i = 0; i < map->n; ++i) {
2472 set->p[i] = isl_basic_set_from_basic_map(map->p[i]);
2482 struct isl_map *isl_map_alloc_dim(struct isl_dim *dim, int n, unsigned flags)
2484 struct isl_map *map;
2488 isl_assert(dim->ctx, n >= 0, return NULL);
2489 map = isl_alloc(dim->ctx, struct isl_map,
2490 sizeof(struct isl_map) +
2491 n * sizeof(struct isl_basic_map *));
2495 map->ctx = dim->ctx;
2496 isl_ctx_ref(map->ctx);
2508 struct isl_map *isl_map_alloc(struct isl_ctx *ctx,
2509 unsigned nparam, unsigned in, unsigned out, int n,
2512 struct isl_map *map;
2513 struct isl_dim *dims;
2515 dims = isl_dim_alloc(ctx, nparam, in, out);
2519 map = isl_map_alloc_dim(dims, n, flags);
2523 struct isl_basic_map *isl_basic_map_empty(struct isl_ctx *ctx,
2524 unsigned nparam, unsigned in, unsigned out)
2526 struct isl_basic_map *bmap;
2527 bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, 1, 0);
2528 bmap = isl_basic_map_set_to_empty(bmap);
2532 struct isl_basic_set *isl_basic_set_empty(struct isl_dim *dim)
2534 struct isl_basic_set *bset;
2535 bset = isl_basic_set_alloc_dim(dim, 0, 1, 0);
2536 bset = isl_basic_set_set_to_empty(bset);
2540 struct isl_basic_map *isl_basic_map_empty_like(struct isl_basic_map *model)
2542 struct isl_basic_map *bmap;
2545 bmap = isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
2546 bmap = isl_basic_map_set_to_empty(bmap);
2550 struct isl_basic_map *isl_basic_map_empty_like_map(struct isl_map *model)
2552 struct isl_basic_map *bmap;
2555 bmap = isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
2556 bmap = isl_basic_map_set_to_empty(bmap);
2560 struct isl_basic_set *isl_basic_set_empty_like(struct isl_basic_set *model)
2562 struct isl_basic_set *bset;
2565 bset = isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
2566 bset = isl_basic_set_set_to_empty(bset);
2570 struct isl_basic_map *isl_basic_map_universe(struct isl_dim *dim)
2572 struct isl_basic_map *bmap;
2573 bmap = isl_basic_map_alloc_dim(dim, 0, 0, 0);
2577 struct isl_basic_set *isl_basic_set_universe(struct isl_dim *dim)
2579 struct isl_basic_set *bset;
2580 bset = isl_basic_set_alloc_dim(dim, 0, 0, 0);
2584 struct isl_basic_set *isl_basic_set_universe_like(struct isl_basic_set *model)
2588 return isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
2591 struct isl_map *isl_map_empty(struct isl_dim *dim)
2593 return isl_map_alloc_dim(dim, 0, ISL_MAP_DISJOINT);
2596 struct isl_map *isl_map_empty_like(struct isl_map *model)
2600 return isl_map_alloc_dim(isl_dim_copy(model->dim), 0, ISL_MAP_DISJOINT);
2603 struct isl_map *isl_map_empty_like_basic_map(struct isl_basic_map *model)
2607 return isl_map_alloc_dim(isl_dim_copy(model->dim), 0, ISL_MAP_DISJOINT);
2610 struct isl_set *isl_set_empty(struct isl_dim *dim)
2612 return isl_set_alloc_dim(dim, 0, ISL_MAP_DISJOINT);
2615 struct isl_set *isl_set_empty_like(struct isl_set *model)
2619 return isl_set_empty(isl_dim_copy(model->dim));
2622 struct isl_set *isl_set_universe(struct isl_dim *dim)
2624 struct isl_set *set;
2627 set = isl_set_alloc_dim(isl_dim_copy(dim), 1, ISL_MAP_DISJOINT);
2628 set = isl_set_add(set, isl_basic_set_universe(dim));
2632 struct isl_map *isl_map_dup(struct isl_map *map)
2635 struct isl_map *dup;
2639 dup = isl_map_alloc_dim(isl_dim_copy(map->dim), map->n, map->flags);
2640 for (i = 0; i < map->n; ++i)
2641 dup = isl_map_add(dup, isl_basic_map_copy(map->p[i]));
2645 struct isl_map *isl_map_add(struct isl_map *map, struct isl_basic_map *bmap)
2649 isl_assert(map->ctx, isl_dim_equal(map->dim, bmap->dim), goto error);
2650 isl_assert(map->ctx, map->n < map->size, goto error);
2651 map->p[map->n] = bmap;
2653 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
2659 isl_basic_map_free(bmap);
2663 void isl_map_free(struct isl_map *map)
2673 isl_ctx_deref(map->ctx);
2674 for (i = 0; i < map->n; ++i)
2675 isl_basic_map_free(map->p[i]);
2676 isl_dim_free(map->dim);
2680 struct isl_map *isl_map_extend(struct isl_map *base,
2681 unsigned nparam, unsigned n_in, unsigned n_out)
2685 base = isl_map_cow(base);
2689 base->dim = isl_dim_extend(base->dim, nparam, n_in, n_out);
2692 for (i = 0; i < base->n; ++i) {
2693 base->p[i] = isl_basic_map_extend_dim(base->p[i],
2694 isl_dim_copy(base->dim), 0, 0, 0);
2704 struct isl_set *isl_set_extend(struct isl_set *base,
2705 unsigned nparam, unsigned dim)
2707 return (struct isl_set *)isl_map_extend((struct isl_map *)base,
2711 static struct isl_basic_map *isl_basic_map_fix_pos(struct isl_basic_map *bmap,
2712 unsigned pos, int value)
2716 bmap = isl_basic_map_cow(bmap);
2717 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
2718 j = isl_basic_map_alloc_equality(bmap);
2721 isl_seq_clr(bmap->eq[j], 1 + isl_basic_map_total_dim(bmap));
2722 isl_int_set_si(bmap->eq[j][pos], -1);
2723 isl_int_set_si(bmap->eq[j][0], value);
2724 bmap = isl_basic_map_simplify(bmap);
2725 return isl_basic_map_finalize(bmap);
2727 isl_basic_map_free(bmap);
2731 struct isl_basic_map *isl_basic_map_fix_si(struct isl_basic_map *bmap,
2732 enum isl_dim_type type, unsigned pos, int value)
2736 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
2737 return isl_basic_map_fix_pos(bmap, isl_basic_map_offset(bmap, type) + pos,
2740 isl_basic_map_free(bmap);
2744 struct isl_basic_set *isl_basic_set_fix_si(struct isl_basic_set *bset,
2745 enum isl_dim_type type, unsigned pos, int value)
2747 return (struct isl_basic_set *)
2748 isl_basic_map_fix_si((struct isl_basic_map *)bset,
2752 struct isl_basic_map *isl_basic_map_fix_input_si(struct isl_basic_map *bmap,
2753 unsigned input, int value)
2755 return isl_basic_map_fix_si(bmap, isl_dim_in, input, value);
2758 struct isl_basic_set *isl_basic_set_fix_dim_si(struct isl_basic_set *bset,
2759 unsigned dim, int value)
2761 return (struct isl_basic_set *)
2762 isl_basic_map_fix_si((struct isl_basic_map *)bset,
2763 isl_dim_set, dim, value);
2766 struct isl_map *isl_map_fix_si(struct isl_map *map,
2767 enum isl_dim_type type, unsigned pos, int value)
2771 map = isl_map_cow(map);
2775 isl_assert(ctx, pos < isl_map_dim(map, type), goto error);
2776 for (i = 0; i < map->n; ++i) {
2777 map->p[i] = isl_basic_map_fix_si(map->p[i], type, pos, value);
2781 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
2788 struct isl_map *isl_map_fix_input_si(struct isl_map *map,
2789 unsigned input, int value)
2791 return isl_map_fix_si(map, isl_dim_in, input, value);
2794 struct isl_set *isl_set_fix_dim_si(struct isl_set *set, unsigned dim, int value)
2796 return (struct isl_set *)
2797 isl_map_fix_si((struct isl_map *)set, isl_dim_set, dim, value);
2800 struct isl_basic_set *isl_basic_set_lower_bound_dim(struct isl_basic_set *bset,
2801 unsigned dim, isl_int value)
2806 bset = isl_basic_set_cow(bset);
2807 bset = isl_basic_set_extend_constraints(bset, 0, 1);
2808 j = isl_basic_set_alloc_inequality(bset);
2811 isl_seq_clr(bset->ineq[j], 1 + isl_basic_set_total_dim(bset));
2812 isl_int_set_si(bset->ineq[j][1 + isl_basic_set_n_param(bset) + dim], 1);
2813 isl_int_neg(bset->ineq[j][0], value);
2814 bset = isl_basic_set_simplify(bset);
2815 return isl_basic_set_finalize(bset);
2817 isl_basic_set_free(bset);
2821 struct isl_set *isl_set_lower_bound_dim(struct isl_set *set, unsigned dim,
2826 set = isl_set_cow(set);
2830 isl_assert(set->ctx, dim < isl_set_n_dim(set), goto error);
2831 for (i = 0; i < set->n; ++i) {
2832 set->p[i] = isl_basic_set_lower_bound_dim(set->p[i], dim, value);
2842 struct isl_map *isl_map_reverse(struct isl_map *map)
2847 map = isl_map_cow(map);
2851 map->dim = isl_dim_reverse(map->dim);
2854 for (i = 0; i < map->n; ++i) {
2855 map->p[i] = isl_basic_map_reverse(map->p[i]);
2859 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
2866 struct isl_map *isl_basic_map_lexmax(
2867 struct isl_basic_map *bmap, struct isl_basic_set *dom,
2868 struct isl_set **empty)
2870 return isl_pip_basic_map_lexmax(bmap, dom, empty);
2873 struct isl_map *isl_basic_map_lexmin(
2874 struct isl_basic_map *bmap, struct isl_basic_set *dom,
2875 struct isl_set **empty)
2877 return isl_pip_basic_map_lexmin(bmap, dom, empty);
2880 struct isl_set *isl_basic_set_lexmin(struct isl_basic_set *bset)
2882 struct isl_basic_map *bmap = NULL;
2883 struct isl_basic_set *dom = NULL;
2884 struct isl_map *min;
2885 struct isl_dim *param_dim;
2889 bmap = isl_basic_map_from_basic_set(bset, isl_dim_copy(bset->dim));
2892 param_dim = isl_dim_domain(isl_dim_copy(bmap->dim));
2893 dom = isl_basic_set_universe(param_dim);
2896 min = isl_basic_map_lexmin(bmap, dom, NULL);
2897 return isl_map_range(min);
2899 isl_basic_map_free(bmap);
2903 struct isl_map *isl_basic_map_compute_divs(struct isl_basic_map *bmap)
2910 off = isl_dim_total(bmap->dim);
2911 for (i = 0; i < bmap->n_div; ++i) {
2912 if (isl_int_is_zero(bmap->div[i][0]))
2913 return isl_pip_basic_map_compute_divs(bmap);
2914 isl_assert(bmap->ctx, isl_int_is_zero(bmap->div[i][1+1+off+i]),
2917 return isl_map_from_basic_map(bmap);
2919 isl_basic_map_free(bmap);
2923 struct isl_map *isl_map_compute_divs(struct isl_map *map)
2926 struct isl_map *res;
2932 res = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[0]));
2933 for (i = 1 ; i < map->n; ++i) {
2935 r2 = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[i]));
2936 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT))
2937 res = isl_map_union_disjoint(res, r2);
2939 res = isl_map_union(res, r2);
2946 struct isl_set *isl_basic_set_compute_divs(struct isl_basic_set *bset)
2948 return (struct isl_set *)
2949 isl_basic_map_compute_divs((struct isl_basic_map *)bset);
2952 struct isl_set *isl_set_compute_divs(struct isl_set *set)
2954 return (struct isl_set *)
2955 isl_map_compute_divs((struct isl_map *)set);
2958 struct isl_set *isl_map_domain(struct isl_map *map)
2961 struct isl_set *set;
2966 map = isl_map_cow(map);
2970 set = (struct isl_set *)map;
2971 set->dim = isl_dim_domain(set->dim);
2974 for (i = 0; i < map->n; ++i) {
2975 set->p[i] = isl_basic_map_domain(map->p[i]);
2979 ISL_F_CLR(set, ISL_MAP_DISJOINT);
2980 ISL_F_CLR(set, ISL_SET_NORMALIZED);
2987 struct isl_map *isl_map_union_disjoint(
2988 struct isl_map *map1, struct isl_map *map2)
2992 struct isl_map *map = NULL;
3006 isl_assert(map1->ctx, isl_dim_equal(map1->dim, map2->dim), goto error);
3008 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
3009 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
3010 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
3012 map = isl_map_alloc_dim(isl_dim_copy(map1->dim),
3013 map1->n + map2->n, flags);
3016 for (i = 0; i < map1->n; ++i) {
3017 map = isl_map_add(map,
3018 isl_basic_map_copy(map1->p[i]));
3022 for (i = 0; i < map2->n; ++i) {
3023 map = isl_map_add(map,
3024 isl_basic_map_copy(map2->p[i]));
3038 struct isl_map *isl_map_union(struct isl_map *map1, struct isl_map *map2)
3040 map1 = isl_map_union_disjoint(map1, map2);
3044 ISL_F_CLR(map1, ISL_MAP_DISJOINT);
3048 struct isl_set *isl_set_union_disjoint(
3049 struct isl_set *set1, struct isl_set *set2)
3051 return (struct isl_set *)
3052 isl_map_union_disjoint(
3053 (struct isl_map *)set1, (struct isl_map *)set2);
3056 struct isl_set *isl_set_union(struct isl_set *set1, struct isl_set *set2)
3058 return (struct isl_set *)
3059 isl_map_union((struct isl_map *)set1, (struct isl_map *)set2);
3062 struct isl_map *isl_map_intersect_range(
3063 struct isl_map *map, struct isl_set *set)
3066 struct isl_map *result;
3072 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT) &&
3073 ISL_F_ISSET(set, ISL_MAP_DISJOINT))
3074 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
3076 result = isl_map_alloc_dim(isl_dim_copy(map->dim),
3077 map->n * set->n, flags);
3080 for (i = 0; i < map->n; ++i)
3081 for (j = 0; j < set->n; ++j) {
3082 result = isl_map_add(result,
3083 isl_basic_map_intersect_range(
3084 isl_basic_map_copy(map->p[i]),
3085 isl_basic_set_copy(set->p[j])));
3098 struct isl_map *isl_map_intersect_domain(
3099 struct isl_map *map, struct isl_set *set)
3101 return isl_map_reverse(
3102 isl_map_intersect_range(isl_map_reverse(map), set));
3105 struct isl_map *isl_map_apply_domain(
3106 struct isl_map *map1, struct isl_map *map2)
3110 map1 = isl_map_reverse(map1);
3111 map1 = isl_map_apply_range(map1, map2);
3112 return isl_map_reverse(map1);
3119 struct isl_map *isl_map_apply_range(
3120 struct isl_map *map1, struct isl_map *map2)
3122 struct isl_dim *dim_result;
3123 struct isl_map *result;
3132 dim_result = isl_dim_join(isl_dim_copy(map1->dim),
3133 isl_dim_copy(map2->dim));
3135 result = isl_map_alloc_dim(dim_result, map1->n * map2->n, 0);
3138 for (i = 0; i < map1->n; ++i)
3139 for (j = 0; j < map2->n; ++j) {
3140 result = isl_map_add(result,
3141 isl_basic_map_apply_range(
3142 isl_basic_map_copy(map1->p[i]),
3143 isl_basic_map_copy(map2->p[j])));
3149 if (result && result->n <= 1)
3150 ISL_F_SET(result, ISL_MAP_DISJOINT);
3159 * returns range - domain
3161 struct isl_basic_set *isl_basic_map_deltas(struct isl_basic_map *bmap)
3163 struct isl_basic_set *bset;
3170 dim = isl_basic_map_n_in(bmap);
3171 nparam = isl_basic_map_n_param(bmap);
3172 isl_assert(bmap->ctx, dim == isl_basic_map_n_out(bmap), goto error);
3173 bset = isl_basic_set_from_basic_map(bmap);
3174 bset = isl_basic_set_cow(bset);
3175 bset = isl_basic_set_extend(bset, nparam, 3*dim, 0, dim, 0);
3176 bset = isl_basic_set_swap_vars(bset, 2*dim);
3177 for (i = 0; i < dim; ++i) {
3178 int j = isl_basic_map_alloc_equality(
3179 (struct isl_basic_map *)bset);
3182 isl_seq_clr(bset->eq[j], 1 + isl_basic_set_total_dim(bset));
3183 isl_int_set_si(bset->eq[j][1+nparam+i], 1);
3184 isl_int_set_si(bset->eq[j][1+nparam+dim+i], 1);
3185 isl_int_set_si(bset->eq[j][1+nparam+2*dim+i], -1);
3187 return isl_basic_set_project_out(bset, 2*dim, 0);
3189 isl_basic_map_free(bmap);
3194 * returns range - domain
3196 struct isl_set *isl_map_deltas(struct isl_map *map)
3199 struct isl_set *result;
3204 isl_assert(map->ctx, isl_map_n_in(map) == isl_map_n_out(map), goto error);
3205 result = isl_set_alloc(map->ctx, isl_map_n_param(map),
3206 isl_map_n_in(map), map->n, map->flags);
3209 for (i = 0; i < map->n; ++i)
3210 result = isl_set_add(result,
3211 isl_basic_map_deltas(isl_basic_map_copy(map->p[i])));
3219 static struct isl_basic_map *basic_map_identity(struct isl_dim *dims)
3221 struct isl_basic_map *bmap;
3229 nparam = dims->nparam;
3231 bmap = isl_basic_map_alloc_dim(dims, 0, dim, 0);
3235 for (i = 0; i < dim; ++i) {
3236 int j = isl_basic_map_alloc_equality(bmap);
3239 isl_seq_clr(bmap->eq[j], 1 + isl_basic_map_total_dim(bmap));
3240 isl_int_set_si(bmap->eq[j][1+nparam+i], 1);
3241 isl_int_set_si(bmap->eq[j][1+nparam+dim+i], -1);
3243 return isl_basic_map_finalize(bmap);
3245 isl_basic_map_free(bmap);
3249 struct isl_basic_map *isl_basic_map_identity(struct isl_dim *set_dim)
3251 struct isl_dim *dim = isl_dim_map(set_dim);
3254 return basic_map_identity(dim);
3257 struct isl_basic_map *isl_basic_map_identity_like(struct isl_basic_map *model)
3259 if (!model || !model->dim)
3261 isl_assert(model->ctx,
3262 model->dim->n_in == model->dim->n_out, return NULL);
3263 return basic_map_identity(isl_dim_copy(model->dim));
3266 static struct isl_map *map_identity(struct isl_dim *dim)
3268 struct isl_map *map = isl_map_alloc_dim(dim, 1, ISL_MAP_DISJOINT);
3269 return isl_map_add(map, basic_map_identity(isl_dim_copy(dim)));
3272 struct isl_map *isl_map_identity(struct isl_dim *set_dim)
3274 struct isl_dim *dim = isl_dim_map(set_dim);
3277 return map_identity(dim);
3280 struct isl_map *isl_map_identity_like(struct isl_basic_map *model)
3282 if (!model || !model->dim)
3284 isl_assert(model->ctx,
3285 model->dim->n_in == model->dim->n_out, return NULL);
3286 return map_identity(isl_dim_copy(model->dim));
3289 int isl_set_is_equal(struct isl_set *set1, struct isl_set *set2)
3291 return isl_map_is_equal((struct isl_map *)set1, (struct isl_map *)set2);
3294 int isl_set_is_subset(struct isl_set *set1, struct isl_set *set2)
3296 return isl_map_is_subset(
3297 (struct isl_map *)set1, (struct isl_map *)set2);
3300 int isl_basic_map_is_subset(
3301 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3304 struct isl_map *map1;
3305 struct isl_map *map2;
3307 if (!bmap1 || !bmap2)
3310 map1 = isl_map_from_basic_map(isl_basic_map_copy(bmap1));
3311 map2 = isl_map_from_basic_map(isl_basic_map_copy(bmap2));
3313 is_subset = isl_map_is_subset(map1, map2);
3321 int isl_basic_map_is_equal(
3322 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3326 if (!bmap1 || !bmap2)
3328 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
3331 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
3335 int isl_basic_set_is_equal(
3336 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
3338 return isl_basic_map_is_equal(
3339 (struct isl_basic_map *)bset1, (struct isl_basic_map *)bset2);
3342 int isl_map_is_empty(struct isl_map *map)
3349 for (i = 0; i < map->n; ++i) {
3350 is_empty = isl_basic_map_is_empty(map->p[i]);
3359 int isl_map_fast_is_empty(struct isl_map *map)
3364 int isl_set_is_empty(struct isl_set *set)
3366 return isl_map_is_empty((struct isl_map *)set);
3369 int isl_map_is_subset(struct isl_map *map1, struct isl_map *map2)
3373 struct isl_map *diff;
3378 if (isl_map_is_empty(map1))
3381 if (isl_map_is_empty(map2))
3384 diff = isl_map_subtract(isl_map_copy(map1), isl_map_copy(map2));
3388 is_subset = isl_map_is_empty(diff);
3394 int isl_map_is_equal(struct isl_map *map1, struct isl_map *map2)
3400 is_subset = isl_map_is_subset(map1, map2);
3403 is_subset = isl_map_is_subset(map2, map1);
3407 int isl_basic_map_is_strict_subset(
3408 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3412 if (!bmap1 || !bmap2)
3414 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
3417 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
3418 if (is_subset == -1)
3423 int isl_basic_map_is_universe(struct isl_basic_map *bmap)
3427 return bmap->n_eq == 0 && bmap->n_ineq == 0;
3430 int isl_basic_map_is_empty(struct isl_basic_map *bmap)
3432 struct isl_basic_set *bset = NULL;
3433 struct isl_vec *sample = NULL;
3440 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY))
3443 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL)) {
3444 struct isl_basic_map *copy = isl_basic_map_copy(bmap);
3445 copy = isl_basic_map_convex_hull(copy);
3446 empty = ISL_F_ISSET(copy, ISL_BASIC_MAP_EMPTY);
3447 isl_basic_map_free(copy);
3451 total = 1 + isl_basic_map_total_dim(bmap);
3452 if (bmap->sample && bmap->sample->size == total) {
3453 int contains = basic_map_contains(bmap, bmap->sample);
3459 bset = isl_basic_map_underlying_set(isl_basic_map_copy(bmap));
3462 sample = isl_basic_set_sample(bset);
3465 empty = sample->size == 0;
3467 isl_vec_free(bmap->ctx, bmap->sample);
3468 bmap->sample = sample;
3473 int isl_basic_set_is_empty(struct isl_basic_set *bset)
3475 return isl_basic_map_is_empty((struct isl_basic_map *)bset);
3478 struct isl_map *isl_basic_map_union(
3479 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3481 struct isl_map *map;
3482 if (!bmap1 || !bmap2)
3485 isl_assert(map1->ctx, isl_dim_equal(bmap1->dim, bmap2->dim), goto error);
3487 map = isl_map_alloc_dim(isl_dim_copy(bmap1->dim), 2, 0);
3490 map = isl_map_add(map, bmap1);
3491 map = isl_map_add(map, bmap2);
3494 isl_basic_map_free(bmap1);
3495 isl_basic_map_free(bmap2);
3499 struct isl_set *isl_basic_set_union(
3500 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
3502 return (struct isl_set *)isl_basic_map_union(
3503 (struct isl_basic_map *)bset1,
3504 (struct isl_basic_map *)bset2);
3507 /* Order divs such that any div only depends on previous divs */
3508 static struct isl_basic_map *order_divs(struct isl_basic_map *bmap)
3511 unsigned off = isl_dim_total(bmap->dim);
3513 for (i = 0; i < bmap->n_div; ++i) {
3515 pos = isl_seq_first_non_zero(bmap->div[i]+1+1+off+i,
3519 swap_div(bmap, i, pos);
3525 /* Look for a div in dst that corresponds to the div "div" in src.
3526 * The divs before "div" in src and dst are assumed to be the same.
3528 * Returns -1 if no corresponding div was found and the position
3529 * of the corresponding div in dst otherwise.
3531 static int find_div(struct isl_basic_map *dst,
3532 struct isl_basic_map *src, unsigned div)
3536 unsigned total = isl_dim_total(src->dim);
3538 isl_assert(dst->ctx, div <= dst->n_div, return -1);
3539 for (i = div; i < dst->n_div; ++i)
3540 if (isl_seq_eq(dst->div[i], src->div[div], 1+1+total+div) &&
3541 isl_seq_first_non_zero(dst->div[i]+1+1+total+div,
3542 dst->n_div - div) == -1)
3547 struct isl_basic_map *isl_basic_map_align_divs(
3548 struct isl_basic_map *dst, struct isl_basic_map *src)
3551 unsigned total = isl_dim_total(src->dim);
3556 if (src->n_div == 0)
3559 for (i = 0; i < src->n_div; ++i)
3560 isl_assert(src->ctx, !isl_int_is_zero(src->div[i][0]), goto error);
3562 src = order_divs(src);
3563 dst = isl_basic_map_cow(dst);
3564 dst = isl_basic_map_extend_dim(dst, isl_dim_copy(dst->dim),
3565 src->n_div, 0, 2 * src->n_div);
3568 for (i = 0; i < src->n_div; ++i) {
3569 int j = find_div(dst, src, i);
3571 j = isl_basic_map_alloc_div(dst);
3574 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total+i);
3575 isl_seq_clr(dst->div[j]+1+1+total+i, dst->n_div - i);
3576 if (add_div_constraints(dst, j) < 0)
3580 swap_div(dst, i, j);
3584 isl_basic_map_free(dst);
3588 struct isl_basic_set *isl_basic_set_align_divs(
3589 struct isl_basic_set *dst, struct isl_basic_set *src)
3591 return (struct isl_basic_set *)isl_basic_map_align_divs(
3592 (struct isl_basic_map *)dst, (struct isl_basic_map *)src);
3595 struct isl_map *isl_map_align_divs(struct isl_map *map)
3599 map = isl_map_compute_divs(map);
3600 map = isl_map_cow(map);
3604 for (i = 1; i < map->n; ++i)
3605 map->p[0] = isl_basic_map_align_divs(map->p[0], map->p[i]);
3606 for (i = 1; i < map->n; ++i)
3607 map->p[i] = isl_basic_map_align_divs(map->p[i], map->p[0]);
3609 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3613 static struct isl_map *add_cut_constraint(struct isl_map *dst,
3614 struct isl_basic_map *src, isl_int *c,
3615 unsigned len, int oppose)
3617 struct isl_basic_map *copy = NULL;
3622 copy = isl_basic_map_copy(src);
3623 copy = isl_basic_map_cow(copy);
3626 copy = isl_basic_map_extend_constraints(copy, 0, 1);
3627 k = isl_basic_map_alloc_inequality(copy);
3631 isl_seq_neg(copy->ineq[k], c, len);
3633 isl_seq_cpy(copy->ineq[k], c, len);
3634 total = 1 + isl_basic_map_total_dim(copy);
3635 isl_seq_clr(copy->ineq[k]+len, total - len);
3636 isl_inequality_negate(copy, k);
3637 copy = isl_basic_map_simplify(copy);
3638 copy = isl_basic_map_finalize(copy);
3639 is_empty = isl_basic_map_is_empty(copy);
3643 dst = isl_map_add(dst, copy);
3645 isl_basic_map_free(copy);
3648 isl_basic_map_free(copy);
3653 static struct isl_map *subtract(struct isl_map *map, struct isl_basic_map *bmap)
3657 struct isl_map *rest = NULL;
3659 unsigned total = isl_basic_map_total_dim(bmap);
3666 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT))
3667 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
3669 max = map->n * (2 * bmap->n_eq + bmap->n_ineq);
3670 rest = isl_map_alloc_dim(isl_dim_copy(map->dim), max, flags);
3674 for (i = 0; i < map->n; ++i) {
3675 map->p[i] = isl_basic_map_align_divs(map->p[i], bmap);
3680 for (j = 0; j < map->n; ++j)
3681 map->p[j] = isl_basic_map_cow(map->p[j]);
3683 for (i = 0; i < bmap->n_eq; ++i) {
3684 for (j = 0; j < map->n; ++j) {
3685 rest = add_cut_constraint(rest,
3686 map->p[j], bmap->eq[i], 1+total, 0);
3690 rest = add_cut_constraint(rest,
3691 map->p[j], bmap->eq[i], 1+total, 1);
3695 map->p[j] = isl_basic_map_extend_constraints(map->p[j],
3699 k = isl_basic_map_alloc_equality(map->p[j]);
3702 isl_seq_cpy(map->p[j]->eq[k], bmap->eq[i], 1+total);
3703 isl_seq_clr(map->p[j]->eq[k]+1+total,
3704 map->p[j]->n_div - bmap->n_div);
3708 for (i = 0; i < bmap->n_ineq; ++i) {
3709 for (j = 0; j < map->n; ++j) {
3710 rest = add_cut_constraint(rest,
3711 map->p[j], bmap->ineq[i], 1+total, 0);
3715 map->p[j] = isl_basic_map_extend_constraints(map->p[j],
3719 k = isl_basic_map_alloc_inequality(map->p[j]);
3722 isl_seq_cpy(map->p[j]->ineq[k], bmap->ineq[i], 1+total);
3723 isl_seq_clr(map->p[j]->ineq[k]+1+total,
3724 map->p[j]->n_div - bmap->n_div);
3736 struct isl_map *isl_map_subtract(struct isl_map *map1, struct isl_map *map2)
3742 isl_assert(map1->ctx, isl_dim_equal(map1->dim, map2->dim), goto error);
3744 if (isl_map_is_empty(map2)) {
3749 map1 = isl_map_compute_divs(map1);
3750 map2 = isl_map_compute_divs(map2);
3754 for (i = 0; map1 && i < map2->n; ++i)
3755 map1 = subtract(map1, map2->p[i]);
3765 struct isl_set *isl_set_subtract(struct isl_set *set1, struct isl_set *set2)
3767 return (struct isl_set *)
3769 (struct isl_map *)set1, (struct isl_map *)set2);
3772 struct isl_set *isl_set_apply(struct isl_set *set, struct isl_map *map)
3776 isl_assert(set->ctx, isl_map_compatible_domain(map, set), goto error);
3777 map = isl_map_intersect_domain(map, set);
3778 set = isl_map_range(map);
3786 /* There is no need to cow as removing empty parts doesn't change
3787 * the meaning of the set.
3789 struct isl_map *isl_map_remove_empty_parts(struct isl_map *map)
3796 for (i = map->n-1; i >= 0; --i) {
3797 if (!ISL_F_ISSET(map->p[i], ISL_BASIC_MAP_EMPTY))
3799 isl_basic_map_free(map->p[i]);
3800 if (i != map->n-1) {
3801 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3802 map->p[i] = map->p[map->n-1];
3810 struct isl_set *isl_set_remove_empty_parts(struct isl_set *set)
3812 return (struct isl_set *)
3813 isl_map_remove_empty_parts((struct isl_map *)set);
3816 struct isl_basic_map *isl_map_copy_basic_map(struct isl_map *map)
3818 struct isl_basic_map *bmap;
3819 if (!map || map->n == 0)
3821 bmap = map->p[map->n-1];
3822 isl_assert(map->ctx, ISL_F_ISSET(bmap, ISL_BASIC_SET_FINAL), return NULL);
3823 return isl_basic_map_copy(bmap);
3826 struct isl_basic_set *isl_set_copy_basic_set(struct isl_set *set)
3828 (struct isl_basic_set *)isl_map_copy_basic_map((struct isl_map *)set);
3831 struct isl_map *isl_map_drop_basic_map(struct isl_map *map,
3832 struct isl_basic_map *bmap)
3838 for (i = map->n-1; i >= 0; --i) {
3839 if (map->p[i] != bmap)
3841 map = isl_map_cow(map);
3844 isl_basic_map_free(map->p[i]);
3845 if (i != map->n-1) {
3846 ISL_F_CLR(map, ISL_SET_NORMALIZED);
3847 map->p[i] = map->p[map->n-1];
3852 isl_basic_map_free(bmap);
3856 isl_basic_map_free(bmap);
3860 struct isl_set *isl_set_drop_basic_set(struct isl_set *set,
3861 struct isl_basic_set *bset)
3863 (struct isl_set *)isl_map_drop_basic_map((struct isl_map *)set,
3864 (struct isl_basic_map *)bset);
3867 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
3868 * for any common value of the parameters and dimensions preceding dim
3869 * in both basic sets, the values of dimension pos in bset1 are
3870 * smaller or larger than those in bset2.
3873 * 1 if bset1 follows bset2
3874 * -1 if bset1 precedes bset2
3875 * 0 if bset1 and bset2 are incomparable
3876 * -2 if some error occurred.
3878 int isl_basic_set_compare_at(struct isl_basic_set *bset1,
3879 struct isl_basic_set *bset2, int pos)
3881 struct isl_dim *dims;
3882 struct isl_basic_map *bmap1 = NULL;
3883 struct isl_basic_map *bmap2 = NULL;
3884 struct isl_ctx *ctx;
3885 struct isl_vec *obj;
3888 unsigned dim1, dim2;
3890 enum isl_lp_result res;
3893 if (!bset1 || !bset2)
3896 nparam = isl_basic_set_n_param(bset1);
3897 dim1 = isl_basic_set_n_dim(bset1);
3898 dim2 = isl_basic_set_n_dim(bset2);
3899 dims = isl_dim_alloc(bset1->ctx, nparam, pos, dim1 - pos);
3900 bmap1 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset1), dims);
3901 dims = isl_dim_alloc(bset2->ctx, nparam, pos, dim2 - pos);
3902 bmap2 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset2), dims);
3903 if (!bmap1 || !bmap2)
3905 bmap1 = isl_basic_map_cow(bmap1);
3906 bmap1 = isl_basic_map_extend(bmap1, nparam,
3907 pos, (dim1 - pos) + (dim2 - pos),
3908 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
3909 bmap1 = add_constraints(bmap1, bmap2, 0, dim1 - pos);
3912 total = isl_basic_map_total_dim(bmap1);
3914 obj = isl_vec_alloc(ctx, 1 + total);
3915 isl_seq_clr(obj->block.data, 1 + total);
3916 isl_int_set_si(obj->block.data[1+nparam+pos], 1);
3917 isl_int_set_si(obj->block.data[1+nparam+pos+(dim1-pos)], -1);
3922 res = isl_solve_lp(bmap1, 0, obj->block.data, ctx->one, &num, &den);
3923 if (res == isl_lp_empty)
3925 else if (res == isl_lp_ok && isl_int_is_pos(num))
3927 else if ((res == isl_lp_ok && isl_int_is_neg(num)) ||
3928 res == isl_lp_unbounded)
3934 isl_basic_map_free(bmap1);
3935 isl_vec_free(ctx, obj);
3938 isl_basic_map_free(bmap1);
3939 isl_basic_map_free(bmap2);
3943 static int isl_basic_map_fast_has_fixed_var(struct isl_basic_map *bmap,
3944 unsigned pos, isl_int *val)
3952 total = isl_basic_map_total_dim(bmap);
3953 for (i = 0, d = total-1; i < bmap->n_eq && d+1 > pos; ++i) {
3954 for (; d+1 > pos; --d)
3955 if (!isl_int_is_zero(bmap->eq[i][1+d]))
3959 if (isl_seq_first_non_zero(bmap->eq[i]+1, d) != -1)
3961 if (isl_seq_first_non_zero(bmap->eq[i]+1+d+1, total-d-1) != -1)
3963 if (!isl_int_is_one(bmap->eq[i][1+d]))
3966 isl_int_neg(*val, bmap->eq[i][0]);
3972 static int isl_map_fast_has_fixed_var(struct isl_map *map,
3973 unsigned pos, isl_int *val)
3985 return isl_basic_map_fast_has_fixed_var(map->p[0], pos, val);
3988 fixed = isl_basic_map_fast_has_fixed_var(map->p[0], pos, &v);
3989 for (i = 1; fixed == 1 && i < map->n; ++i) {
3990 fixed = isl_basic_map_fast_has_fixed_var(map->p[i], pos, &tmp);
3991 if (fixed == 1 && isl_int_ne(tmp, v))
3995 isl_int_set(*val, v);
4001 static int isl_set_fast_has_fixed_var(struct isl_set *set, unsigned pos,
4004 return isl_map_fast_has_fixed_var((struct isl_map *)set, pos, val);
4007 int isl_basic_map_fast_is_fixed(struct isl_basic_map *bmap,
4008 enum isl_dim_type type, unsigned pos, isl_int *val)
4010 if (pos >= isl_basic_map_dim(bmap, type))
4012 return isl_basic_map_fast_has_fixed_var(bmap,
4013 isl_basic_map_offset(bmap, type) - 1 + pos, val);
4016 /* Check if dimension dim has fixed value and if so and if val is not NULL,
4017 * then return this fixed value in *val.
4019 int isl_set_fast_dim_is_fixed(struct isl_set *set, unsigned dim, isl_int *val)
4021 return isl_set_fast_has_fixed_var(set, isl_set_n_param(set) + dim, val);
4024 /* Check if input variable in has fixed value and if so and if val is not NULL,
4025 * then return this fixed value in *val.
4027 int isl_map_fast_input_is_fixed(struct isl_map *map, unsigned in, isl_int *val)
4029 return isl_map_fast_has_fixed_var(map, isl_map_n_param(map) + in, val);
4032 /* Check if dimension dim has an (obvious) fixed lower bound and if so
4033 * and if val is not NULL, then return this lower bound in *val.
4035 int isl_basic_set_fast_dim_has_fixed_lower_bound(struct isl_basic_set *bset,
4036 unsigned dim, isl_int *val)
4038 int i, i_eq = -1, i_ineq = -1;
4045 total = isl_basic_set_total_dim(bset);
4046 nparam = isl_basic_set_n_param(bset);
4047 for (i = 0; i < bset->n_eq; ++i) {
4048 if (isl_int_is_zero(bset->eq[i][1+nparam+dim]))
4054 for (i = 0; i < bset->n_ineq; ++i) {
4055 if (!isl_int_is_pos(bset->ineq[i][1+nparam+dim]))
4057 if (i_eq != -1 || i_ineq != -1)
4061 if (i_eq == -1 && i_ineq == -1)
4063 c = i_eq != -1 ? bset->eq[i_eq] : bset->ineq[i_ineq];
4064 /* The coefficient should always be one due to normalization. */
4065 if (!isl_int_is_one(c[1+nparam+dim]))
4067 if (isl_seq_first_non_zero(c+1, nparam+dim) != -1)
4069 if (isl_seq_first_non_zero(c+1+nparam+dim+1,
4070 total - nparam - dim - 1) != -1)
4073 isl_int_neg(*val, c[0]);
4077 int isl_set_fast_dim_has_fixed_lower_bound(struct isl_set *set,
4078 unsigned dim, isl_int *val)
4090 return isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[0],
4094 fixed = isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[0],
4096 for (i = 1; fixed == 1 && i < set->n; ++i) {
4097 fixed = isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[i],
4099 if (fixed == 1 && isl_int_ne(tmp, v))
4103 isl_int_set(*val, v);
4114 static int qsort_constraint_cmp(const void *p1, const void *p2)
4116 const struct constraint *c1 = (const struct constraint *)p1;
4117 const struct constraint *c2 = (const struct constraint *)p2;
4118 unsigned size = isl_min(c1->size, c2->size);
4119 return isl_seq_cmp(c1->c, c2->c, size);
4122 static struct isl_basic_map *isl_basic_map_sort_constraints(
4123 struct isl_basic_map *bmap)
4126 struct constraint *c;
4131 total = isl_basic_map_total_dim(bmap);
4132 c = isl_alloc_array(bmap->ctx, struct constraint, bmap->n_ineq);
4135 for (i = 0; i < bmap->n_ineq; ++i) {
4137 c[i].c = bmap->ineq[i];
4139 qsort(c, bmap->n_ineq, sizeof(struct constraint), qsort_constraint_cmp);
4140 for (i = 0; i < bmap->n_ineq; ++i)
4141 bmap->ineq[i] = c[i].c;
4145 isl_basic_map_free(bmap);
4149 struct isl_basic_map *isl_basic_map_normalize(struct isl_basic_map *bmap)
4153 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_NORMALIZED))
4155 bmap = isl_basic_map_convex_hull(bmap);
4156 bmap = isl_basic_map_sort_constraints(bmap);
4157 ISL_F_SET(bmap, ISL_BASIC_MAP_NORMALIZED);
4161 struct isl_basic_set *isl_basic_set_normalize(struct isl_basic_set *bset)
4163 return (struct isl_basic_set *)isl_basic_map_normalize(
4164 (struct isl_basic_map *)bset);
4167 static int isl_basic_map_fast_cmp(const struct isl_basic_map *bmap1,
4168 const struct isl_basic_map *bmap2)
4175 if (isl_basic_map_n_param(bmap1) != isl_basic_map_n_param(bmap2))
4176 return isl_basic_map_n_param(bmap1) - isl_basic_map_n_param(bmap2);
4177 if (isl_basic_map_n_in(bmap1) != isl_basic_map_n_in(bmap2))
4178 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
4179 if (isl_basic_map_n_out(bmap1) != isl_basic_map_n_out(bmap2))
4180 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
4181 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY) &&
4182 ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
4184 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY))
4186 if (ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
4188 if (bmap1->n_eq != bmap2->n_eq)
4189 return bmap1->n_eq - bmap2->n_eq;
4190 if (bmap1->n_ineq != bmap2->n_ineq)
4191 return bmap1->n_ineq - bmap2->n_ineq;
4192 if (bmap1->n_div != bmap2->n_div)
4193 return bmap1->n_div - bmap2->n_div;
4194 total = isl_basic_map_total_dim(bmap1);
4195 for (i = 0; i < bmap1->n_eq; ++i) {
4196 cmp = isl_seq_cmp(bmap1->eq[i], bmap2->eq[i], 1+total);
4200 for (i = 0; i < bmap1->n_ineq; ++i) {
4201 cmp = isl_seq_cmp(bmap1->ineq[i], bmap2->ineq[i], 1+total);
4205 for (i = 0; i < bmap1->n_div; ++i) {
4206 cmp = isl_seq_cmp(bmap1->div[i], bmap2->div[i], 1+1+total);
4213 static int isl_basic_map_fast_is_equal(struct isl_basic_map *bmap1,
4214 struct isl_basic_map *bmap2)
4216 return isl_basic_map_fast_cmp(bmap1, bmap2) == 0;
4219 static int qsort_bmap_cmp(const void *p1, const void *p2)
4221 const struct isl_basic_map *bmap1 = *(const struct isl_basic_map **)p1;
4222 const struct isl_basic_map *bmap2 = *(const struct isl_basic_map **)p2;
4224 return isl_basic_map_fast_cmp(bmap1, bmap2);
4227 /* We normalize in place, but if anything goes wrong we need
4228 * to return NULL, so we need to make sure we don't change the
4229 * meaning of any possible other copies of map.
4231 struct isl_map *isl_map_normalize(struct isl_map *map)
4234 struct isl_basic_map *bmap;
4238 if (ISL_F_ISSET(map, ISL_MAP_NORMALIZED))
4240 for (i = 0; i < map->n; ++i) {
4241 bmap = isl_basic_map_normalize(isl_basic_map_copy(map->p[i]));
4244 isl_basic_map_free(map->p[i]);
4247 qsort(map->p, map->n, sizeof(struct isl_basic_map *), qsort_bmap_cmp);
4248 ISL_F_SET(map, ISL_MAP_NORMALIZED);
4249 map = isl_map_remove_empty_parts(map);
4252 for (i = map->n - 1; i >= 1; --i) {
4253 if (!isl_basic_map_fast_is_equal(map->p[i-1], map->p[i]))
4255 isl_basic_map_free(map->p[i-1]);
4256 for (j = i; j < map->n; ++j)
4257 map->p[j-1] = map->p[j];
4267 struct isl_set *isl_set_normalize(struct isl_set *set)
4269 return (struct isl_set *)isl_map_normalize((struct isl_map *)set);
4272 int isl_map_fast_is_equal(struct isl_map *map1, struct isl_map *map2)
4282 if (!isl_dim_equal(map1->dim, map2->dim))
4285 map1 = isl_map_copy(map1);
4286 map2 = isl_map_copy(map2);
4287 map1 = isl_map_normalize(map1);
4288 map2 = isl_map_normalize(map2);
4291 equal = map1->n == map2->n;
4292 for (i = 0; equal && i < map1->n; ++i) {
4293 equal = isl_basic_map_fast_is_equal(map1->p[i], map2->p[i]);
4306 int isl_set_fast_is_equal(struct isl_set *set1, struct isl_set *set2)
4308 return isl_map_fast_is_equal((struct isl_map *)set1,
4309 (struct isl_map *)set2);
4312 /* Return an interval that ranges from min to max (inclusive)
4314 struct isl_basic_set *isl_basic_set_interval(struct isl_ctx *ctx,
4315 isl_int min, isl_int max)
4318 struct isl_basic_set *bset = NULL;
4320 bset = isl_basic_set_alloc(ctx, 0, 1, 0, 0, 2);
4324 k = isl_basic_set_alloc_inequality(bset);
4327 isl_int_set_si(bset->ineq[k][1], 1);
4328 isl_int_neg(bset->ineq[k][0], min);
4330 k = isl_basic_set_alloc_inequality(bset);
4333 isl_int_set_si(bset->ineq[k][1], -1);
4334 isl_int_set(bset->ineq[k][0], max);
4338 isl_basic_set_free(bset);
4342 /* Return the Cartesian product of the basic sets in list (in the given order).
4344 struct isl_basic_set *isl_basic_set_product(struct isl_basic_set_list *list)
4352 struct isl_basic_set *product = NULL;
4356 isl_assert(list->ctx, list->n > 0, goto error);
4357 isl_assert(list->ctx, list->p[0], goto error);
4358 nparam = isl_basic_set_n_param(list->p[0]);
4359 dim = isl_basic_set_n_dim(list->p[0]);
4360 extra = list->p[0]->n_div;
4361 n_eq = list->p[0]->n_eq;
4362 n_ineq = list->p[0]->n_ineq;
4363 for (i = 1; i < list->n; ++i) {
4364 isl_assert(list->ctx, list->p[i], goto error);
4365 isl_assert(list->ctx,
4366 nparam == isl_basic_set_n_param(list->p[i]), goto error);
4367 dim += isl_basic_set_n_dim(list->p[i]);
4368 extra += list->p[i]->n_div;
4369 n_eq += list->p[i]->n_eq;
4370 n_ineq += list->p[i]->n_ineq;
4372 product = isl_basic_set_alloc(list->ctx, nparam, dim, extra,
4377 for (i = 0; i < list->n; ++i) {
4378 isl_basic_set_add_constraints(product,
4379 isl_basic_set_copy(list->p[i]), dim);
4380 dim += isl_basic_set_n_dim(list->p[i]);
4382 isl_basic_set_list_free(list);
4385 isl_basic_set_free(product);
4386 isl_basic_set_list_free(list);
4390 struct isl_basic_map *isl_basic_map_product(
4391 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
4393 struct isl_dim *dim_result = NULL;
4394 struct isl_basic_map *bmap;
4395 unsigned in1, in2, out1, out2, nparam, total, pos;
4396 struct isl_dim_map *dim_map1, *dim_map2;
4398 if (!bmap1 || !bmap2)
4401 isl_assert(map1->ctx, isl_dim_match(bmap1->dim, isl_dim_param,
4402 bmap2->dim, isl_dim_param), goto error);
4403 dim_result = isl_dim_product(isl_dim_copy(bmap1->dim),
4404 isl_dim_copy(bmap2->dim));
4406 in1 = isl_basic_map_n_in(bmap1);
4407 in2 = isl_basic_map_n_in(bmap2);
4408 out1 = isl_basic_map_n_out(bmap1);
4409 out2 = isl_basic_map_n_out(bmap2);
4410 nparam = isl_basic_map_n_param(bmap1);
4412 total = nparam + in1 + in2 + out1 + out2 + bmap1->n_div + bmap2->n_div;
4413 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
4414 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
4415 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
4416 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
4417 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
4418 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos += in1);
4419 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += in2);
4420 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += out1);
4421 isl_dim_map_div(dim_map1, bmap1, pos += out2);
4422 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
4424 bmap = isl_basic_map_alloc_dim(dim_result,
4425 bmap1->n_div + bmap2->n_div,
4426 bmap1->n_eq + bmap2->n_eq,
4427 bmap1->n_ineq + bmap2->n_ineq);
4428 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
4429 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
4430 bmap = isl_basic_map_simplify(bmap);
4431 return isl_basic_map_finalize(bmap);
4433 isl_basic_map_free(bmap1);
4434 isl_basic_map_free(bmap2);
4438 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
4440 struct isl_map *isl_map_product(struct isl_map *map1, struct isl_map *map2)
4443 struct isl_map *result;
4449 isl_assert(map1->ctx, isl_dim_match(map1->dim, isl_dim_param,
4450 map2->dim, isl_dim_param), goto error);
4452 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
4453 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
4454 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
4456 result = isl_map_alloc_dim(isl_dim_product(isl_dim_copy(map1->dim),
4457 isl_dim_copy(map2->dim)),
4458 map1->n * map2->n, flags);
4461 for (i = 0; i < map1->n; ++i)
4462 for (j = 0; j < map2->n; ++j) {
4463 struct isl_basic_map *part;
4464 part = isl_basic_map_product(
4465 isl_basic_map_copy(map1->p[i]),
4466 isl_basic_map_copy(map2->p[j]));
4467 if (isl_basic_map_is_empty(part))
4468 isl_basic_map_free(part);
4470 result = isl_map_add(result, part);
4483 uint32_t isl_basic_set_get_hash(struct isl_basic_set *bset)
4491 bset = isl_basic_set_copy(bset);
4492 bset = isl_basic_set_normalize(bset);
4495 total = isl_basic_set_total_dim(bset);
4496 isl_hash_byte(hash, bset->n_eq & 0xFF);
4497 for (i = 0; i < bset->n_eq; ++i) {
4499 c_hash = isl_seq_get_hash(bset->eq[i], 1 + total);
4500 isl_hash_hash(hash, c_hash);
4502 isl_hash_byte(hash, bset->n_ineq & 0xFF);
4503 for (i = 0; i < bset->n_ineq; ++i) {
4505 c_hash = isl_seq_get_hash(bset->ineq[i], 1 + total);
4506 isl_hash_hash(hash, c_hash);
4508 isl_hash_byte(hash, bset->n_div & 0xFF);
4509 for (i = 0; i < bset->n_div; ++i) {
4511 if (isl_int_is_zero(bset->div[i][0]))
4513 isl_hash_byte(hash, i & 0xFF);
4514 c_hash = isl_seq_get_hash(bset->div[i], 1 + 1 + total);
4515 isl_hash_hash(hash, c_hash);
4517 isl_basic_set_free(bset);
4521 uint32_t isl_set_get_hash(struct isl_set *set)
4528 set = isl_set_copy(set);
4529 set = isl_set_normalize(set);
4533 hash = isl_hash_init();
4534 for (i = 0; i < set->n; ++i) {
4536 bset_hash = isl_basic_set_get_hash(set->p[i]);
4537 isl_hash_hash(hash, bset_hash);
4545 /* Check if the value for dimension dim is completely determined
4546 * by the values of the other parameters and variables.
4547 * That is, check if dimension dim is involved in an equality.
4549 int isl_basic_set_dim_is_unique(struct isl_basic_set *bset, unsigned dim)
4556 nparam = isl_basic_set_n_param(bset);
4557 for (i = 0; i < bset->n_eq; ++i)
4558 if (!isl_int_is_zero(bset->eq[i][1 + nparam + dim]))
4563 /* Check if the value for dimension dim is completely determined
4564 * by the values of the other parameters and variables.
4565 * That is, check if dimension dim is involved in an equality
4566 * for each of the subsets.
4568 int isl_set_dim_is_unique(struct isl_set *set, unsigned dim)
4574 for (i = 0; i < set->n; ++i) {
4576 unique = isl_basic_set_dim_is_unique(set->p[i], dim);