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_constraints(dup, bmap);
376 dup->flags = bmap->flags;
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);
469 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
470 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_IMPLICIT);
471 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
472 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
473 if ((bmap->eq - bmap->ineq) + bmap->n_eq == bmap->c_size) {
475 int j = isl_basic_map_alloc_inequality(bmap);
479 bmap->ineq[j] = bmap->ineq[bmap->n_ineq - 1];
480 bmap->ineq[bmap->n_ineq - 1] = bmap->eq[-1];
487 isl_seq_clr(bmap->eq[bmap->n_eq] + 1 + isl_basic_map_total_dim(bmap),
488 bmap->extra - bmap->n_div);
492 int isl_basic_set_alloc_equality(struct isl_basic_set *bset)
494 return isl_basic_map_alloc_equality((struct isl_basic_map *)bset);
497 int isl_basic_map_free_equality(struct isl_basic_map *bmap, unsigned n)
501 isl_assert(bmap->ctx, n <= bmap->n_eq, return -1);
506 int isl_basic_map_drop_equality(struct isl_basic_map *bmap, unsigned pos)
511 isl_assert(bmap->ctx, pos < bmap->n_eq, return -1);
513 if (pos != bmap->n_eq - 1) {
515 bmap->eq[pos] = bmap->eq[bmap->n_eq - 1];
516 bmap->eq[bmap->n_eq - 1] = t;
522 int isl_basic_set_drop_equality(struct isl_basic_set *bset, unsigned pos)
524 return isl_basic_map_drop_equality((struct isl_basic_map *)bset, pos);
527 void isl_basic_map_inequality_to_equality(
528 struct isl_basic_map *bmap, unsigned pos)
533 bmap->ineq[pos] = bmap->ineq[bmap->n_ineq - 1];
534 bmap->ineq[bmap->n_ineq - 1] = bmap->eq[-1];
539 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
540 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
541 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
542 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
545 static int room_for_ineq(struct isl_basic_map *bmap, unsigned n)
547 return bmap->n_ineq + n <= bmap->eq - bmap->ineq;
550 int isl_basic_map_alloc_inequality(struct isl_basic_map *bmap)
556 isl_assert(ctx, room_for_ineq(bmap, 1), return -1);
557 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_IMPLICIT);
558 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
559 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
560 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
561 isl_seq_clr(bmap->ineq[bmap->n_ineq] +
562 1 + isl_basic_map_total_dim(bmap),
563 bmap->extra - bmap->n_div);
564 return bmap->n_ineq++;
567 int isl_basic_set_alloc_inequality(struct isl_basic_set *bset)
569 return isl_basic_map_alloc_inequality((struct isl_basic_map *)bset);
572 int isl_basic_map_free_inequality(struct isl_basic_map *bmap, unsigned n)
576 isl_assert(bmap->ctx, n <= bmap->n_ineq, return -1);
581 int isl_basic_set_free_inequality(struct isl_basic_set *bset, unsigned n)
583 return isl_basic_map_free_inequality((struct isl_basic_map *)bset, n);
586 int isl_basic_map_drop_inequality(struct isl_basic_map *bmap, unsigned pos)
591 isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
593 if (pos != bmap->n_ineq - 1) {
595 bmap->ineq[pos] = bmap->ineq[bmap->n_ineq - 1];
596 bmap->ineq[bmap->n_ineq - 1] = t;
597 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
603 int isl_basic_set_drop_inequality(struct isl_basic_set *bset, unsigned pos)
605 return isl_basic_map_drop_inequality((struct isl_basic_map *)bset, pos);
608 int isl_basic_map_alloc_div(struct isl_basic_map *bmap)
612 isl_assert(bmap->ctx, bmap->n_div < bmap->extra, return -1);
613 isl_seq_clr(bmap->div[bmap->n_div] +
614 1 + 1 + isl_basic_map_total_dim(bmap),
615 bmap->extra - bmap->n_div);
616 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
617 return bmap->n_div++;
620 int isl_basic_map_free_div(struct isl_basic_map *bmap, unsigned n)
624 isl_assert(bmap->ctx, n <= bmap->n_div, return -1);
629 /* Copy constraint from src to dst, putting the vars of src at offset
630 * dim_off in dst and the divs of src at offset div_off in dst.
631 * If both sets are actually map, then dim_off applies to the input
634 static void copy_constraint(struct isl_basic_map *dst_map, isl_int *dst,
635 struct isl_basic_map *src_map, isl_int *src,
636 unsigned in_off, unsigned out_off, unsigned div_off)
638 unsigned src_nparam = isl_basic_map_n_param(src_map);
639 unsigned dst_nparam = isl_basic_map_n_param(dst_map);
640 unsigned src_in = isl_basic_map_n_in(src_map);
641 unsigned dst_in = isl_basic_map_n_in(dst_map);
642 unsigned src_out = isl_basic_map_n_out(src_map);
643 unsigned dst_out = isl_basic_map_n_out(dst_map);
644 isl_int_set(dst[0], src[0]);
645 isl_seq_cpy(dst+1, src+1, isl_min(dst_nparam, src_nparam));
646 if (dst_nparam > src_nparam)
647 isl_seq_clr(dst+1+src_nparam,
648 dst_nparam - src_nparam);
649 isl_seq_clr(dst+1+dst_nparam, in_off);
650 isl_seq_cpy(dst+1+dst_nparam+in_off,
652 isl_min(dst_in-in_off, src_in));
653 if (dst_in-in_off > src_in)
654 isl_seq_clr(dst+1+dst_nparam+in_off+src_in,
655 dst_in - in_off - src_in);
656 isl_seq_clr(dst+1+dst_nparam+dst_in, out_off);
657 isl_seq_cpy(dst+1+dst_nparam+dst_in+out_off,
658 src+1+src_nparam+src_in,
659 isl_min(dst_out-out_off, src_out));
660 if (dst_out-out_off > src_out)
661 isl_seq_clr(dst+1+dst_nparam+dst_in+out_off+src_out,
662 dst_out - out_off - src_out);
663 isl_seq_clr(dst+1+dst_nparam+dst_in+dst_out, div_off);
664 isl_seq_cpy(dst+1+dst_nparam+dst_in+dst_out+div_off,
665 src+1+src_nparam+src_in+src_out,
666 isl_min(dst_map->extra-div_off, src_map->n_div));
667 if (dst_map->n_div-div_off > src_map->n_div)
668 isl_seq_clr(dst+1+dst_nparam+dst_in+dst_out+
669 div_off+src_map->n_div,
670 dst_map->n_div - div_off - src_map->n_div);
673 static void copy_div(struct isl_basic_map *dst_map, isl_int *dst,
674 struct isl_basic_map *src_map, isl_int *src,
675 unsigned in_off, unsigned out_off, unsigned div_off)
677 isl_int_set(dst[0], src[0]);
678 copy_constraint(dst_map, dst+1, src_map, src+1, in_off, out_off, div_off);
681 static struct isl_basic_map *add_constraints(struct isl_basic_map *bmap1,
682 struct isl_basic_map *bmap2, unsigned i_pos, unsigned o_pos)
687 if (!bmap1 || !bmap2)
690 div_off = bmap1->n_div;
692 for (i = 0; i < bmap2->n_eq; ++i) {
693 int i1 = isl_basic_map_alloc_equality(bmap1);
696 copy_constraint(bmap1, bmap1->eq[i1], bmap2, bmap2->eq[i],
697 i_pos, o_pos, div_off);
700 for (i = 0; i < bmap2->n_ineq; ++i) {
701 int i1 = isl_basic_map_alloc_inequality(bmap1);
704 copy_constraint(bmap1, bmap1->ineq[i1], bmap2, bmap2->ineq[i],
705 i_pos, o_pos, div_off);
708 for (i = 0; i < bmap2->n_div; ++i) {
709 int i1 = isl_basic_map_alloc_div(bmap1);
712 copy_div(bmap1, bmap1->div[i1], bmap2, bmap2->div[i],
713 i_pos, o_pos, div_off);
716 isl_basic_map_free(bmap2);
721 isl_basic_map_free(bmap1);
722 isl_basic_map_free(bmap2);
726 static void copy_constraint_dim_map(isl_int *dst, isl_int *src,
727 struct isl_dim_map *dim_map)
731 for (i = 0; i < dim_map->len; ++i) {
732 if (dim_map->pos[i] < 0)
733 isl_int_set_si(dst[i], 0);
735 isl_int_set(dst[i], src[dim_map->pos[i]]);
739 static void copy_div_dim_map(isl_int *dst, isl_int *src,
740 struct isl_dim_map *dim_map)
742 isl_int_set(dst[0], src[0]);
743 copy_constraint_dim_map(dst+1, src+1, dim_map);
746 static struct isl_basic_map *add_constraints_dim_map(struct isl_basic_map *dst,
747 struct isl_basic_map *src, struct isl_dim_map *dim_map)
751 if (!src || !dst || !dim_map)
754 for (i = 0; i < src->n_eq; ++i) {
755 int i1 = isl_basic_map_alloc_equality(dst);
758 copy_constraint_dim_map(dst->eq[i1], src->eq[i], dim_map);
761 for (i = 0; i < src->n_ineq; ++i) {
762 int i1 = isl_basic_map_alloc_inequality(dst);
765 copy_constraint_dim_map(dst->ineq[i1], src->ineq[i], dim_map);
768 for (i = 0; i < src->n_div; ++i) {
769 int i1 = isl_basic_map_alloc_div(dst);
772 copy_div_dim_map(dst->div[i1], src->div[i], dim_map);
776 isl_basic_map_free(src);
781 isl_basic_map_free(src);
782 isl_basic_map_free(dst);
786 struct isl_basic_set *isl_basic_set_add_constraints(struct isl_basic_set *bset1,
787 struct isl_basic_set *bset2, unsigned pos)
789 return (struct isl_basic_set *)
790 add_constraints((struct isl_basic_map *)bset1,
791 (struct isl_basic_map *)bset2, 0, pos);
794 struct isl_basic_map *isl_basic_map_extend_dim(struct isl_basic_map *base,
795 struct isl_dim *dim, unsigned extra,
796 unsigned n_eq, unsigned n_ineq)
798 struct isl_basic_map *ext;
808 dims_ok = isl_dim_equal(base->dim, dim) &&
809 base->extra >= base->n_div + extra;
811 if (dims_ok && room_for_con(base, n_eq + n_ineq) &&
812 room_for_ineq(base, n_ineq)) {
817 isl_assert(base->ctx, base->dim->nparam <= dim->nparam, goto error);
818 isl_assert(base->ctx, base->dim->n_in <= dim->n_in, goto error);
819 isl_assert(base->ctx, base->dim->n_out <= dim->n_out, goto error);
820 extra += base->extra;
822 n_ineq += base->n_ineq;
824 ext = isl_basic_map_alloc_dim(dim, extra, n_eq, n_ineq);
830 ext = add_constraints(ext, base, 0, 0);
833 ISL_F_CLR(ext, ISL_BASIC_SET_FINAL);
840 isl_basic_map_free(base);
844 struct isl_basic_set *isl_basic_set_extend_dim(struct isl_basic_set *base,
845 struct isl_dim *dim, unsigned extra,
846 unsigned n_eq, unsigned n_ineq)
848 return (struct isl_basic_set *)
849 isl_basic_map_extend_dim((struct isl_basic_map *)base, dim,
850 extra, n_eq, n_ineq);
853 struct isl_basic_map *isl_basic_map_extend_constraints(
854 struct isl_basic_map *base, unsigned n_eq, unsigned n_ineq)
858 return isl_basic_map_extend_dim(base, isl_dim_copy(base->dim),
862 struct isl_basic_map *isl_basic_map_extend(struct isl_basic_map *base,
863 unsigned nparam, unsigned n_in, unsigned n_out, unsigned extra,
864 unsigned n_eq, unsigned n_ineq)
866 struct isl_basic_map *bmap;
871 dim = isl_dim_alloc(base->ctx, nparam, n_in, n_out);
875 bmap = isl_basic_map_extend_dim(base, dim, extra, n_eq, n_ineq);
879 struct isl_basic_set *isl_basic_set_extend(struct isl_basic_set *base,
880 unsigned nparam, unsigned dim, unsigned extra,
881 unsigned n_eq, unsigned n_ineq)
883 return (struct isl_basic_set *)
884 isl_basic_map_extend((struct isl_basic_map *)base,
885 nparam, 0, dim, extra, n_eq, n_ineq);
888 struct isl_basic_set *isl_basic_set_extend_constraints(
889 struct isl_basic_set *base, unsigned n_eq, unsigned n_ineq)
891 return (struct isl_basic_set *)
892 isl_basic_map_extend_constraints((struct isl_basic_map *)base,
896 struct isl_basic_set *isl_basic_set_cow(struct isl_basic_set *bset)
898 return (struct isl_basic_set *)
899 isl_basic_map_cow((struct isl_basic_map *)bset);
902 struct isl_basic_map *isl_basic_map_cow(struct isl_basic_map *bmap)
909 bmap = isl_basic_map_dup(bmap);
911 ISL_F_CLR(bmap, ISL_BASIC_SET_FINAL);
915 struct isl_set *isl_set_cow(struct isl_set *set)
923 return isl_set_dup(set);
926 struct isl_map *isl_map_cow(struct isl_map *map)
934 return isl_map_dup(map);
937 static void swap_vars(struct isl_blk blk, isl_int *a,
938 unsigned a_len, unsigned b_len)
940 isl_seq_cpy(blk.data, a+a_len, b_len);
941 isl_seq_cpy(blk.data+b_len, a, a_len);
942 isl_seq_cpy(a, blk.data, b_len+a_len);
945 struct isl_basic_set *isl_basic_set_swap_vars(
946 struct isl_basic_set *bset, unsigned n)
956 nparam = isl_basic_set_n_param(bset);
957 dim = isl_basic_set_n_dim(bset);
958 isl_assert(bset->ctx, n <= dim, goto error);
963 bset = isl_basic_set_cow(bset);
967 blk = isl_blk_alloc(bset->ctx, dim);
968 if (isl_blk_is_error(blk))
971 for (i = 0; i < bset->n_eq; ++i)
973 bset->eq[i]+1+nparam, n, dim - n);
975 for (i = 0; i < bset->n_ineq; ++i)
977 bset->ineq[i]+1+nparam, n, dim - n);
979 for (i = 0; i < bset->n_div; ++i)
981 bset->div[i]+1+1+nparam, n, dim - n);
983 isl_blk_free(bset->ctx, blk);
985 ISL_F_CLR(bset, ISL_BASIC_SET_NORMALIZED);
989 isl_basic_set_free(bset);
993 struct isl_set *isl_set_swap_vars(struct isl_set *set, unsigned n)
996 set = isl_set_cow(set);
1000 for (i = 0; i < set->n; ++i) {
1001 set->p[i] = isl_basic_set_swap_vars(set->p[i], n);
1007 ISL_F_CLR(set, ISL_SET_NORMALIZED);
1011 struct isl_basic_map *isl_basic_map_set_to_empty(struct isl_basic_map *bmap)
1017 total = isl_basic_map_total_dim(bmap);
1018 isl_basic_map_free_div(bmap, bmap->n_div);
1019 isl_basic_map_free_inequality(bmap, bmap->n_ineq);
1021 isl_basic_map_free_equality(bmap, bmap->n_eq-1);
1023 isl_basic_map_alloc_equality(bmap);
1027 isl_int_set_si(bmap->eq[i][0], 1);
1028 isl_seq_clr(bmap->eq[i]+1, total);
1029 ISL_F_SET(bmap, ISL_BASIC_MAP_EMPTY);
1030 return isl_basic_map_finalize(bmap);
1032 isl_basic_map_free(bmap);
1036 struct isl_basic_set *isl_basic_set_set_to_empty(struct isl_basic_set *bset)
1038 return (struct isl_basic_set *)
1039 isl_basic_map_set_to_empty((struct isl_basic_map *)bset);
1042 static void swap_div(struct isl_basic_map *bmap, int a, int b)
1045 unsigned off = isl_dim_total(bmap->dim);
1046 isl_int *t = bmap->div[a];
1047 bmap->div[a] = bmap->div[b];
1050 for (i = 0; i < bmap->n_eq; ++i)
1051 isl_int_swap(bmap->eq[i][1+off+a], bmap->eq[i][1+off+b]);
1053 for (i = 0; i < bmap->n_ineq; ++i)
1054 isl_int_swap(bmap->ineq[i][1+off+a], bmap->ineq[i][1+off+b]);
1056 for (i = 0; i < bmap->n_div; ++i)
1057 isl_int_swap(bmap->div[i][1+1+off+a], bmap->div[i][1+1+off+b]);
1058 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1061 /* Eliminate the specified n dimensions starting at first from the
1062 * constraints using Fourier-Motzkin, The dimensions themselves
1065 struct isl_set *isl_set_eliminate_dims(struct isl_set *set,
1066 unsigned first, unsigned n)
1076 set = isl_set_cow(set);
1079 isl_assert(set->ctx, first+n <= isl_set_n_dim(set), goto error);
1080 nparam = isl_set_n_param(set);
1082 for (i = 0; i < set->n; ++i) {
1083 set->p[i] = isl_basic_set_eliminate_vars(set->p[i],
1094 /* Project out n dimensions starting at first using Fourier-Motzkin */
1095 struct isl_set *isl_set_remove_dims(struct isl_set *set,
1096 unsigned first, unsigned n)
1098 set = isl_set_eliminate_dims(set, first, n);
1099 set = isl_set_drop_dims(set, first, n);
1103 struct isl_basic_set *isl_basic_set_remove_divs(struct isl_basic_set *bset)
1105 bset = isl_basic_set_eliminate_vars(bset, isl_dim_total(bset->dim),
1113 struct isl_set *isl_set_remove_divs(struct isl_set *set)
1122 set = isl_set_cow(set);
1126 for (i = 0; i < set->n; ++i) {
1127 set->p[i] = isl_basic_set_remove_divs(set->p[i]);
1137 struct isl_basic_map *isl_basic_map_remove(struct isl_basic_map *bmap,
1138 enum isl_dim_type type, unsigned first, unsigned n)
1142 isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
1146 bmap = isl_basic_map_eliminate_vars(bmap,
1147 isl_basic_map_offset(bmap, type) - 1 + first, n);
1148 bmap = isl_basic_map_drop(bmap, type, first, n);
1151 isl_basic_map_free(bmap);
1155 struct isl_map *isl_map_remove(struct isl_map *map,
1156 enum isl_dim_type type, unsigned first, unsigned n)
1164 map = isl_map_cow(map);
1167 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
1169 for (i = 0; i < map->n; ++i) {
1170 map->p[i] = isl_basic_map_eliminate_vars(map->p[i],
1171 isl_basic_map_offset(map->p[i], type) - 1 + first, n);
1175 map = isl_map_drop(map, type, first, n);
1182 /* Project out n inputs starting at first using Fourier-Motzkin */
1183 struct isl_map *isl_map_remove_inputs(struct isl_map *map,
1184 unsigned first, unsigned n)
1186 return isl_map_remove(map, isl_dim_in, first, n);
1189 /* Project out n dimensions starting at first using Fourier-Motzkin */
1190 struct isl_basic_set *isl_basic_set_remove_dims(struct isl_basic_set *bset,
1191 unsigned first, unsigned n)
1193 unsigned nparam = isl_basic_set_n_param(bset);
1194 bset = isl_basic_set_eliminate_vars(bset, nparam + first, n);
1195 bset = isl_basic_set_drop_dims(bset, first, n);
1199 static void dump_term(struct isl_basic_map *bmap,
1200 isl_int c, int pos, FILE *out)
1203 unsigned in = isl_basic_map_n_in(bmap);
1204 unsigned dim = in + isl_basic_map_n_out(bmap);
1205 unsigned nparam = isl_basic_map_n_param(bmap);
1207 isl_int_print(out, c, 0);
1209 if (!isl_int_is_one(c))
1210 isl_int_print(out, c, 0);
1211 if (pos < 1 + nparam) {
1212 name = isl_dim_get_name(bmap->dim,
1213 isl_dim_param, pos - 1);
1215 fprintf(out, "%s", name);
1217 fprintf(out, "p%d", pos - 1);
1218 } else if (pos < 1 + nparam + in)
1219 fprintf(out, "i%d", pos - 1 - nparam);
1220 else if (pos < 1 + nparam + dim)
1221 fprintf(out, "o%d", pos - 1 - nparam - in);
1223 fprintf(out, "e%d", pos - 1 - nparam - dim);
1227 static void dump_constraint_sign(struct isl_basic_map *bmap, isl_int *c,
1228 int sign, FILE *out)
1232 unsigned len = 1 + isl_basic_map_total_dim(bmap);
1236 for (i = 0, first = 1; i < len; ++i) {
1237 if (isl_int_sgn(c[i]) * sign <= 0)
1240 fprintf(out, " + ");
1242 isl_int_abs(v, c[i]);
1243 dump_term(bmap, v, i, out);
1250 static void dump_constraint(struct isl_basic_map *bmap, isl_int *c,
1251 const char *op, FILE *out, int indent)
1255 fprintf(out, "%*s", indent, "");
1257 dump_constraint_sign(bmap, c, 1, out);
1258 fprintf(out, " %s ", op);
1259 dump_constraint_sign(bmap, c, -1, out);
1263 for (i = bmap->n_div; i < bmap->extra; ++i) {
1264 if (isl_int_is_zero(c[1+isl_dim_total(bmap->dim)+i]))
1266 fprintf(out, "%*s", indent, "");
1267 fprintf(out, "ERROR: unused div coefficient not zero\n");
1272 static void dump_constraints(struct isl_basic_map *bmap,
1273 isl_int **c, unsigned n,
1274 const char *op, FILE *out, int indent)
1278 for (i = 0; i < n; ++i)
1279 dump_constraint(bmap, c[i], op, out, indent);
1282 static void dump_affine(struct isl_basic_map *bmap, isl_int *exp, FILE *out)
1286 unsigned total = isl_basic_map_total_dim(bmap);
1288 for (j = 0; j < 1 + total; ++j) {
1289 if (isl_int_is_zero(exp[j]))
1291 if (!first && isl_int_is_pos(exp[j]))
1293 dump_term(bmap, exp[j], j, out);
1298 static void dump(struct isl_basic_map *bmap, FILE *out, int indent)
1302 dump_constraints(bmap, bmap->eq, bmap->n_eq, "=", out, indent);
1303 dump_constraints(bmap, bmap->ineq, bmap->n_ineq, ">=", out, indent);
1305 for (i = 0; i < bmap->n_div; ++i) {
1306 fprintf(out, "%*s", indent, "");
1307 fprintf(out, "e%d = [(", i);
1308 dump_affine(bmap, bmap->div[i]+1, out);
1310 isl_int_print(out, bmap->div[i][0], 0);
1311 fprintf(out, "]\n");
1315 void isl_basic_set_dump(struct isl_basic_set *bset, FILE *out, int indent)
1318 fprintf(out, "null basic set\n");
1322 fprintf(out, "%*s", indent, "");
1323 fprintf(out, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n",
1324 bset->ref, bset->dim->nparam, bset->dim->n_out,
1325 bset->extra, bset->flags);
1326 dump((struct isl_basic_map *)bset, out, indent);
1329 void isl_basic_map_dump(struct isl_basic_map *bmap, FILE *out, int indent)
1332 fprintf(out, "null basic map\n");
1336 fprintf(out, "%*s", indent, "");
1337 fprintf(out, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, "
1338 "flags: %x, n_name: %d\n",
1340 bmap->dim->nparam, bmap->dim->n_in, bmap->dim->n_out,
1341 bmap->extra, bmap->flags, bmap->dim->n_name);
1342 dump(bmap, out, indent);
1345 int isl_inequality_negate(struct isl_basic_map *bmap, unsigned pos)
1350 total = isl_basic_map_total_dim(bmap);
1351 isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
1352 isl_seq_neg(bmap->ineq[pos], bmap->ineq[pos], 1 + total);
1353 isl_int_sub_ui(bmap->ineq[pos][0], bmap->ineq[pos][0], 1);
1354 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1358 struct isl_set *isl_set_alloc_dim(struct isl_dim *dim, int n, unsigned flags)
1360 struct isl_set *set;
1364 isl_assert(dim->ctx, dim->n_in == 0, return NULL);
1365 isl_assert(dim->ctx, n >= 0, return NULL);
1366 set = isl_alloc(dim->ctx, struct isl_set,
1367 sizeof(struct isl_set) +
1368 n * sizeof(struct isl_basic_set *));
1372 set->ctx = dim->ctx;
1373 isl_ctx_ref(set->ctx);
1385 struct isl_set *isl_set_alloc(struct isl_ctx *ctx,
1386 unsigned nparam, unsigned dim, int n, unsigned flags)
1388 struct isl_set *set;
1389 struct isl_dim *dims;
1391 dims = isl_dim_alloc(ctx, nparam, 0, dim);
1395 set = isl_set_alloc_dim(dims, n, flags);
1399 struct isl_set *isl_set_dup(struct isl_set *set)
1402 struct isl_set *dup;
1407 dup = isl_set_alloc_dim(isl_dim_copy(set->dim), set->n, set->flags);
1410 for (i = 0; i < set->n; ++i)
1411 dup = isl_set_add(dup, isl_basic_set_copy(set->p[i]));
1415 struct isl_set *isl_set_from_basic_set(struct isl_basic_set *bset)
1417 struct isl_set *set;
1422 set = isl_set_alloc_dim(isl_dim_copy(bset->dim), 1, ISL_MAP_DISJOINT);
1424 isl_basic_set_free(bset);
1427 return isl_set_add(set, bset);
1430 struct isl_map *isl_map_from_basic_map(struct isl_basic_map *bmap)
1432 struct isl_map *map;
1437 map = isl_map_alloc_dim(isl_dim_copy(bmap->dim), 1, ISL_MAP_DISJOINT);
1439 isl_basic_map_free(bmap);
1442 return isl_map_add(map, bmap);
1445 struct isl_set *isl_set_add(struct isl_set *set, struct isl_basic_set *bset)
1449 isl_assert(set->ctx, isl_dim_equal(set->dim, bset->dim), goto error);
1450 isl_assert(set->ctx, set->n < set->size, goto error);
1451 set->p[set->n] = bset;
1458 isl_basic_set_free(bset);
1462 void isl_set_free(struct isl_set *set)
1472 isl_ctx_deref(set->ctx);
1473 for (i = 0; i < set->n; ++i)
1474 isl_basic_set_free(set->p[i]);
1475 isl_dim_free(set->dim);
1479 void isl_set_dump(struct isl_set *set, FILE *out, int indent)
1484 fprintf(out, "null set\n");
1488 fprintf(out, "%*s", indent, "");
1489 fprintf(out, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
1490 set->ref, set->n, set->dim->nparam, set->dim->n_out,
1492 for (i = 0; i < set->n; ++i) {
1493 fprintf(out, "%*s", indent, "");
1494 fprintf(out, "basic set %d:\n", i);
1495 isl_basic_set_dump(set->p[i], out, indent+4);
1499 void isl_map_dump(struct isl_map *map, FILE *out, int indent)
1504 fprintf(out, "null map\n");
1508 fprintf(out, "%*s", indent, "");
1509 fprintf(out, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, "
1510 "flags: %x, n_name: %d\n",
1511 map->ref, map->n, map->dim->nparam, map->dim->n_in,
1512 map->dim->n_out, map->flags, map->dim->n_name);
1513 for (i = 0; i < map->n; ++i) {
1514 fprintf(out, "%*s", indent, "");
1515 fprintf(out, "basic map %d:\n", i);
1516 isl_basic_map_dump(map->p[i], out, indent+4);
1520 struct isl_basic_map *isl_basic_map_intersect_domain(
1521 struct isl_basic_map *bmap, struct isl_basic_set *bset)
1523 struct isl_basic_map *bmap_domain;
1524 struct isl_dim *dim;
1529 isl_assert(bset->ctx, isl_dim_match(bmap->dim, isl_dim_param,
1530 bset->dim, isl_dim_param), goto error);
1532 if (isl_dim_size(bset->dim, isl_dim_set) != 0)
1533 isl_assert(bset->ctx,
1534 isl_basic_map_compatible_domain(bmap, bset), goto error);
1536 bmap = isl_basic_map_cow(bmap);
1537 bmap = isl_basic_map_extend_dim(bmap, isl_dim_copy(bmap->dim),
1538 bset->n_div, bset->n_eq, bset->n_ineq);
1541 dim = isl_dim_reverse(isl_dim_copy(bset->dim));
1542 bmap_domain = isl_basic_map_from_basic_set(bset, dim);
1543 bmap = add_constraints(bmap, bmap_domain, 0, 0);
1545 bmap = isl_basic_map_simplify(bmap);
1546 return isl_basic_map_finalize(bmap);
1548 isl_basic_map_free(bmap);
1549 isl_basic_set_free(bset);
1553 struct isl_basic_map *isl_basic_map_intersect_range(
1554 struct isl_basic_map *bmap, struct isl_basic_set *bset)
1556 struct isl_basic_map *bmap_range;
1561 isl_assert(bset->ctx, isl_dim_match(bmap->dim, isl_dim_param,
1562 bset->dim, isl_dim_param), goto error);
1564 if (isl_dim_size(bset->dim, isl_dim_set) != 0)
1565 isl_assert(bset->ctx,
1566 isl_basic_map_compatible_range(bmap, bset), goto error);
1568 bmap = isl_basic_map_cow(bmap);
1569 bmap = isl_basic_map_extend_dim(bmap, isl_dim_copy(bmap->dim),
1570 bset->n_div, bset->n_eq, bset->n_ineq);
1573 bmap_range = isl_basic_map_from_basic_set(bset, isl_dim_copy(bset->dim));
1574 bmap = add_constraints(bmap, bmap_range, 0, 0);
1576 bmap = isl_basic_map_simplify(bmap);
1577 return isl_basic_map_finalize(bmap);
1579 isl_basic_map_free(bmap);
1580 isl_basic_set_free(bset);
1584 static int basic_map_contains(struct isl_basic_map *bmap, struct isl_vec *vec)
1590 total = 1 + isl_basic_map_total_dim(bmap);
1591 if (total != vec->size)
1596 for (i = 0; i < bmap->n_eq; ++i) {
1597 isl_seq_inner_product(vec->block.data, bmap->eq[i], total, &s);
1598 if (!isl_int_is_zero(s)) {
1604 for (i = 0; i < bmap->n_ineq; ++i) {
1605 isl_seq_inner_product(vec->block.data, bmap->ineq[i], total, &s);
1606 if (isl_int_is_neg(s)) {
1617 struct isl_basic_map *isl_basic_map_intersect(
1618 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
1620 struct isl_vec *sample = NULL;
1622 if (!bmap1 || !bmap2)
1625 isl_assert(bmap1->ctx, isl_dim_match(bmap1->dim, isl_dim_param,
1626 bmap2->dim, isl_dim_param), goto error);
1627 if (isl_dim_total(bmap1->dim) ==
1628 isl_dim_size(bmap1->dim, isl_dim_param) &&
1629 isl_dim_total(bmap2->dim) !=
1630 isl_dim_size(bmap2->dim, isl_dim_param))
1631 return isl_basic_map_intersect(bmap2, bmap1);
1633 if (isl_dim_total(bmap2->dim) !=
1634 isl_dim_size(bmap2->dim, isl_dim_param))
1635 isl_assert(bmap1->ctx,
1636 isl_dim_equal(bmap1->dim, bmap2->dim), goto error);
1638 if (bmap1->sample &&
1639 basic_map_contains(bmap1, bmap1->sample) > 0 &&
1640 basic_map_contains(bmap2, bmap1->sample) > 0)
1641 sample = isl_vec_copy(bmap1->ctx, bmap1->sample);
1642 else if (bmap2->sample &&
1643 basic_map_contains(bmap1, bmap2->sample) > 0 &&
1644 basic_map_contains(bmap2, bmap2->sample) > 0)
1645 sample = isl_vec_copy(bmap2->ctx, bmap2->sample);
1647 bmap1 = isl_basic_map_cow(bmap1);
1648 bmap1 = isl_basic_map_extend_dim(bmap1, isl_dim_copy(bmap1->dim),
1649 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
1652 bmap1 = add_constraints(bmap1, bmap2, 0, 0);
1655 isl_vec_free(bmap1->ctx, bmap1->sample);
1656 bmap1->sample = sample;
1659 bmap1 = isl_basic_map_simplify(bmap1);
1660 return isl_basic_map_finalize(bmap1);
1663 isl_vec_free(bmap1->ctx, sample);
1664 isl_basic_map_free(bmap1);
1665 isl_basic_map_free(bmap2);
1669 struct isl_basic_set *isl_basic_set_intersect(
1670 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
1672 return (struct isl_basic_set *)
1673 isl_basic_map_intersect(
1674 (struct isl_basic_map *)bset1,
1675 (struct isl_basic_map *)bset2);
1678 struct isl_map *isl_map_intersect(struct isl_map *map1, struct isl_map *map2)
1681 struct isl_map *result;
1687 isl_assert(map1->ctx, isl_dim_match(map1->dim, isl_dim_param,
1688 map2->dim, isl_dim_param), goto error);
1689 if (isl_dim_total(map1->dim) ==
1690 isl_dim_size(map1->dim, isl_dim_param) &&
1691 isl_dim_total(map2->dim) != isl_dim_size(map2->dim, isl_dim_param))
1692 return isl_map_intersect(map2, map1);
1694 if (isl_dim_total(map2->dim) != isl_dim_size(map2->dim, isl_dim_param))
1695 isl_assert(map1->ctx,
1696 isl_dim_equal(map1->dim, map2->dim), goto error);
1698 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
1699 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
1700 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
1702 result = isl_map_alloc_dim(isl_dim_copy(map1->dim),
1703 map1->n * map2->n, flags);
1706 for (i = 0; i < map1->n; ++i)
1707 for (j = 0; j < map2->n; ++j) {
1708 struct isl_basic_map *part;
1709 part = isl_basic_map_intersect(
1710 isl_basic_map_copy(map1->p[i]),
1711 isl_basic_map_copy(map2->p[j]));
1712 if (isl_basic_map_is_empty(part))
1713 isl_basic_map_free(part);
1715 result = isl_map_add(result, part);
1728 struct isl_set *isl_set_intersect(struct isl_set *set1, struct isl_set *set2)
1730 return (struct isl_set *)
1731 isl_map_intersect((struct isl_map *)set1,
1732 (struct isl_map *)set2);
1735 struct isl_basic_map *isl_basic_map_reverse(struct isl_basic_map *bmap)
1737 struct isl_dim *dim;
1738 struct isl_basic_set *bset;
1743 bmap = isl_basic_map_cow(bmap);
1746 dim = isl_dim_reverse(isl_dim_copy(bmap->dim));
1747 in = isl_basic_map_n_in(bmap);
1748 bset = isl_basic_set_from_basic_map(bmap);
1749 bset = isl_basic_set_swap_vars(bset, in);
1750 return isl_basic_map_from_basic_set(bset, dim);
1753 /* Turn final n dimensions into existentially quantified variables.
1755 struct isl_basic_set *isl_basic_set_project_out(
1756 struct isl_basic_set *bset, unsigned n, unsigned flags)
1766 isl_assert(bset->ctx, n <= isl_basic_set_n_dim(bset), goto error);
1771 bset = isl_basic_set_cow(bset);
1773 row_size = 1 + isl_dim_total(bset->dim) + bset->extra;
1774 old = bset->block2.data;
1775 bset->block2 = isl_blk_extend(bset->ctx, bset->block2,
1776 (bset->extra + n) * (1 + row_size));
1777 if (!bset->block2.data)
1779 new_div = isl_alloc_array(ctx, isl_int *, bset->extra + n);
1782 for (i = 0; i < n; ++i) {
1783 new_div[i] = bset->block2.data +
1784 (bset->extra + i) * (1 + row_size);
1785 isl_seq_clr(new_div[i], 1 + row_size);
1787 for (i = 0; i < bset->extra; ++i)
1788 new_div[n + i] = bset->block2.data + (bset->div[i] - old);
1790 bset->div = new_div;
1793 bset->dim = isl_dim_drop_outputs(bset->dim,
1794 isl_basic_set_n_dim(bset) - n, n);
1797 bset = isl_basic_set_simplify(bset);
1798 return isl_basic_set_finalize(bset);
1800 isl_basic_set_free(bset);
1804 struct isl_basic_map *add_divs(struct isl_basic_map *bmap, unsigned n)
1808 for (i = 0; i < n; ++i) {
1809 j = isl_basic_map_alloc_div(bmap);
1812 isl_seq_clr(bmap->div[j], 1+1+isl_basic_map_total_dim(bmap));
1816 isl_basic_map_free(bmap);
1820 struct isl_basic_map *isl_basic_map_apply_range(
1821 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
1823 struct isl_dim *dim_result = NULL;
1824 struct isl_basic_map *bmap;
1825 unsigned n_in, n_out, n, nparam, total, pos;
1826 struct isl_dim_map *dim_map1, *dim_map2;
1828 if (!bmap1 || !bmap2)
1831 dim_result = isl_dim_join(isl_dim_copy(bmap1->dim),
1832 isl_dim_copy(bmap2->dim));
1834 n_in = isl_basic_map_n_in(bmap1);
1835 n_out = isl_basic_map_n_out(bmap2);
1836 n = isl_basic_map_n_out(bmap1);
1837 nparam = isl_basic_map_n_param(bmap1);
1839 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + n;
1840 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
1841 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
1842 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
1843 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
1844 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
1845 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_in);
1846 isl_dim_map_div(dim_map1, bmap1, pos += n_out);
1847 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
1848 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
1849 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
1851 bmap = isl_basic_map_alloc_dim(dim_result,
1852 bmap1->n_div + bmap2->n_div + n,
1853 bmap1->n_eq + bmap2->n_eq,
1854 bmap1->n_ineq + bmap2->n_ineq);
1855 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
1856 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
1857 bmap = add_divs(bmap, n);
1858 bmap = isl_basic_map_simplify(bmap);
1859 return isl_basic_map_finalize(bmap);
1861 isl_basic_map_free(bmap1);
1862 isl_basic_map_free(bmap2);
1866 struct isl_basic_set *isl_basic_set_apply(
1867 struct isl_basic_set *bset, struct isl_basic_map *bmap)
1872 isl_assert(set->ctx, isl_basic_map_compatible_domain(bmap, bset),
1875 return (struct isl_basic_set *)
1876 isl_basic_map_apply_range((struct isl_basic_map *)bset, bmap);
1878 isl_basic_set_free(bset);
1879 isl_basic_map_free(bmap);
1883 struct isl_basic_map *isl_basic_map_apply_domain(
1884 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
1886 if (!bmap1 || !bmap2)
1890 isl_basic_map_n_in(bmap1) == isl_basic_map_n_in(bmap2), goto error);
1892 isl_basic_map_n_param(bmap1) == isl_basic_map_n_param(bmap2),
1895 bmap1 = isl_basic_map_reverse(bmap1);
1896 bmap1 = isl_basic_map_apply_range(bmap1, bmap2);
1897 return isl_basic_map_reverse(bmap1);
1899 isl_basic_map_free(bmap1);
1900 isl_basic_map_free(bmap2);
1904 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
1905 * A \cap B -> f(A) + f(B)
1907 struct isl_basic_map *isl_basic_map_sum(
1908 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
1910 unsigned n_in, n_out, nparam, total, pos;
1911 struct isl_basic_map *bmap = NULL;
1912 struct isl_dim_map *dim_map1, *dim_map2;
1915 if (!bmap1 || !bmap2)
1918 isl_assert(bmap1->ctx, isl_dim_equal(bmap1->dim, bmap2->dim),
1921 nparam = isl_basic_map_n_param(bmap1);
1922 n_in = isl_basic_map_n_in(bmap1);
1923 n_out = isl_basic_map_n_out(bmap1);
1925 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + 2 * n_out;
1926 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
1927 dim_map2 = isl_dim_map_alloc(bmap2->ctx, total);
1928 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
1929 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos);
1930 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
1931 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
1932 isl_dim_map_div(dim_map1, bmap1, pos += n_in + n_out);
1933 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
1934 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
1935 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_out);
1937 bmap = isl_basic_map_alloc_dim(isl_dim_copy(bmap1->dim),
1938 bmap1->n_div + bmap2->n_div + 2 * n_out,
1939 bmap1->n_eq + bmap2->n_eq + n_out,
1940 bmap1->n_ineq + bmap2->n_ineq);
1941 for (i = 0; i < n_out; ++i) {
1942 int j = isl_basic_map_alloc_equality(bmap);
1945 isl_seq_clr(bmap->eq[j], 1+total);
1946 isl_int_set_si(bmap->eq[j][1+nparam+n_in+i], -1);
1947 isl_int_set_si(bmap->eq[j][1+pos+i], 1);
1948 isl_int_set_si(bmap->eq[j][1+pos-n_out+i], 1);
1950 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
1951 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
1952 bmap = add_divs(bmap, 2 * n_out);
1954 bmap = isl_basic_map_simplify(bmap);
1955 return isl_basic_map_finalize(bmap);
1957 isl_basic_map_free(bmap);
1958 isl_basic_map_free(bmap1);
1959 isl_basic_map_free(bmap2);
1963 /* Given a basic map A -> f(A), construct A -> -f(A).
1965 struct isl_basic_map *isl_basic_map_neg(struct isl_basic_map *bmap)
1970 bmap = isl_basic_map_cow(bmap);
1974 n = isl_basic_map_dim(bmap, isl_dim_out);
1975 off = isl_basic_map_offset(bmap, isl_dim_out);
1976 for (i = 0; i < bmap->n_eq; ++i)
1977 for (j = 0; j < n; ++j)
1978 isl_int_neg(bmap->eq[i][off+j], bmap->eq[i][off+j]);
1979 for (i = 0; i < bmap->n_ineq; ++i)
1980 for (j = 0; j < n; ++j)
1981 isl_int_neg(bmap->ineq[i][off+j], bmap->ineq[i][off+j]);
1982 for (i = 0; i < bmap->n_div; ++i)
1983 for (j = 0; j < n; ++j)
1984 isl_int_neg(bmap->div[i][1+off+j], bmap->div[i][1+off+j]);
1985 return isl_basic_map_finalize(bmap);
1988 /* Given a basic map A -> f(A) and an integer d, construct a basic map
1989 * A -> floor(f(A)/d).
1991 struct isl_basic_map *isl_basic_map_floordiv(struct isl_basic_map *bmap,
1994 unsigned n_in, n_out, nparam, total, pos;
1995 struct isl_basic_map *result = NULL;
1996 struct isl_dim_map *dim_map;
2002 nparam = isl_basic_map_n_param(bmap);
2003 n_in = isl_basic_map_n_in(bmap);
2004 n_out = isl_basic_map_n_out(bmap);
2006 total = nparam + n_in + n_out + bmap->n_div + n_out;
2007 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2008 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_param, pos = 0);
2009 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_in, pos += nparam);
2010 isl_dim_map_div(dim_map, bmap, pos += n_in + n_out);
2011 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_out, pos += bmap->n_div);
2013 result = isl_basic_map_alloc_dim(isl_dim_copy(bmap->dim),
2014 bmap->n_div + n_out,
2015 bmap->n_eq, bmap->n_ineq + 2 * n_out);
2016 result = add_constraints_dim_map(result, bmap, dim_map);
2017 result = add_divs(result, n_out);
2018 for (i = 0; i < n_out; ++i) {
2020 j = isl_basic_map_alloc_inequality(result);
2023 isl_seq_clr(result->ineq[j], 1+total);
2024 isl_int_neg(result->ineq[j][1+nparam+n_in+i], d);
2025 isl_int_set_si(result->ineq[j][1+pos+i], 1);
2026 j = isl_basic_map_alloc_inequality(result);
2029 isl_seq_clr(result->ineq[j], 1+total);
2030 isl_int_set(result->ineq[j][1+nparam+n_in+i], d);
2031 isl_int_set_si(result->ineq[j][1+pos+i], -1);
2032 isl_int_sub_ui(result->ineq[j][0], d, 1);
2035 result = isl_basic_map_simplify(result);
2036 return isl_basic_map_finalize(result);
2038 isl_basic_map_free(result);
2042 static struct isl_basic_map *var_equal(struct isl_basic_map *bmap, unsigned pos)
2048 i = isl_basic_map_alloc_equality(bmap);
2051 nparam = isl_basic_map_n_param(bmap);
2052 n_in = isl_basic_map_n_in(bmap);
2053 isl_seq_clr(bmap->eq[i], 1 + isl_basic_map_total_dim(bmap));
2054 isl_int_set_si(bmap->eq[i][1+nparam+pos], -1);
2055 isl_int_set_si(bmap->eq[i][1+nparam+n_in+pos], 1);
2056 return isl_basic_map_finalize(bmap);
2058 isl_basic_map_free(bmap);
2062 static struct isl_basic_map *var_more(struct isl_basic_map *bmap, unsigned pos)
2068 i = isl_basic_map_alloc_inequality(bmap);
2071 nparam = isl_basic_map_n_param(bmap);
2072 n_in = isl_basic_map_n_in(bmap);
2073 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
2074 isl_int_set_si(bmap->ineq[i][0], -1);
2075 isl_int_set_si(bmap->ineq[i][1+nparam+pos], -1);
2076 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], 1);
2077 return isl_basic_map_finalize(bmap);
2079 isl_basic_map_free(bmap);
2083 static struct isl_basic_map *var_less(struct isl_basic_map *bmap, unsigned pos)
2089 i = isl_basic_map_alloc_inequality(bmap);
2092 nparam = isl_basic_map_n_param(bmap);
2093 n_in = isl_basic_map_n_in(bmap);
2094 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
2095 isl_int_set_si(bmap->ineq[i][0], -1);
2096 isl_int_set_si(bmap->ineq[i][1+nparam+pos], 1);
2097 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], -1);
2098 return isl_basic_map_finalize(bmap);
2100 isl_basic_map_free(bmap);
2104 struct isl_basic_map *isl_basic_map_equal(struct isl_dim *dim, unsigned n_equal)
2107 struct isl_basic_map *bmap;
2108 bmap = isl_basic_map_alloc_dim(dim, 0, n_equal, 0);
2111 for (i = 0; i < n_equal && bmap; ++i)
2112 bmap = var_equal(bmap, i);
2113 return isl_basic_map_finalize(bmap);
2116 struct isl_basic_map *isl_basic_map_less_at(struct isl_dim *dim, unsigned pos)
2119 struct isl_basic_map *bmap;
2120 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
2123 for (i = 0; i < pos && bmap; ++i)
2124 bmap = var_equal(bmap, i);
2126 bmap = var_less(bmap, pos);
2127 return isl_basic_map_finalize(bmap);
2130 struct isl_basic_map *isl_basic_map_more_at(struct isl_dim *dim, unsigned pos)
2133 struct isl_basic_map *bmap;
2134 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
2137 for (i = 0; i < pos && bmap; ++i)
2138 bmap = var_equal(bmap, i);
2140 bmap = var_more(bmap, pos);
2141 return isl_basic_map_finalize(bmap);
2144 struct isl_basic_map *isl_basic_map_from_basic_set(
2145 struct isl_basic_set *bset, struct isl_dim *dim)
2147 struct isl_basic_map *bmap;
2149 bset = isl_basic_set_cow(bset);
2153 isl_assert(bset->ctx, isl_dim_compatible(bset->dim, dim), goto error);
2154 isl_dim_free(bset->dim);
2155 bmap = (struct isl_basic_map *) bset;
2157 return isl_basic_map_finalize(bmap);
2159 isl_basic_set_free(bset);
2164 struct isl_basic_set *isl_basic_set_from_basic_map(struct isl_basic_map *bmap)
2168 if (bmap->dim->n_in == 0)
2169 return (struct isl_basic_set *)bmap;
2170 bmap = isl_basic_map_cow(bmap);
2173 bmap->dim = isl_dim_cow(bmap->dim);
2176 bmap->dim->n_out += bmap->dim->n_in;
2177 bmap->dim->n_in = 0;
2178 bmap = isl_basic_map_finalize(bmap);
2179 return (struct isl_basic_set *)bmap;
2181 isl_basic_map_free(bmap);
2185 /* For a div d = floor(f/m), add the constraints
2188 * -(f-(n-1)) + m d >= 0
2190 * Note that the second constraint is the negation of
2194 static int add_div_constraints(struct isl_basic_map *bmap, unsigned div)
2197 unsigned total = isl_basic_map_total_dim(bmap);
2198 unsigned div_pos = 1 + total - bmap->n_div + div;
2200 i = isl_basic_map_alloc_inequality(bmap);
2203 isl_seq_cpy(bmap->ineq[i], bmap->div[div]+1, 1+total);
2204 isl_int_neg(bmap->ineq[i][div_pos], bmap->div[div][0]);
2206 j = isl_basic_map_alloc_inequality(bmap);
2209 isl_seq_neg(bmap->ineq[j], bmap->ineq[i], 1 + total);
2210 isl_int_add(bmap->ineq[j][0], bmap->ineq[j][0], bmap->ineq[j][div_pos]);
2211 isl_int_sub_ui(bmap->ineq[j][0], bmap->ineq[j][0], 1);
2215 struct isl_basic_set *isl_basic_map_underlying_set(
2216 struct isl_basic_map *bmap)
2220 if (bmap->dim->nparam == 0 && bmap->dim->n_in == 0 && bmap->n_div == 0)
2221 return (struct isl_basic_set *)bmap;
2222 bmap = isl_basic_map_cow(bmap);
2225 bmap->dim = isl_dim_underlying(bmap->dim, bmap->n_div);
2228 bmap->extra -= bmap->n_div;
2230 bmap = isl_basic_map_finalize(bmap);
2231 return (struct isl_basic_set *)bmap;
2236 struct isl_basic_map *isl_basic_map_overlying_set(
2237 struct isl_basic_set *bset, struct isl_basic_map *like)
2239 struct isl_basic_map *bmap;
2240 struct isl_ctx *ctx;
2247 isl_assert(ctx, bset->n_div == 0, goto error);
2248 isl_assert(ctx, isl_basic_set_n_param(bset) == 0, goto error);
2249 isl_assert(ctx, bset->dim->n_out == isl_basic_map_total_dim(like),
2251 if (isl_dim_equal(bset->dim, like->dim) && like->n_div == 0) {
2252 isl_basic_map_free(like);
2253 return (struct isl_basic_map *)bset;
2255 bset = isl_basic_set_cow(bset);
2258 total = bset->dim->n_out + bset->extra;
2259 bmap = (struct isl_basic_map *)bset;
2260 isl_dim_free(bmap->dim);
2261 bmap->dim = isl_dim_copy(like->dim);
2264 bmap->n_div = like->n_div;
2265 bmap->extra += like->n_div;
2268 ltotal = total - bmap->extra + like->extra;
2271 bmap->block2 = isl_blk_extend(ctx, bmap->block2,
2272 bmap->extra * (1 + 1 + total));
2273 if (isl_blk_is_error(bmap->block2))
2275 bmap->div = isl_realloc_array(ctx, bmap->div, isl_int *,
2279 for (i = 0; i < bmap->extra; ++i)
2280 bmap->div[i] = bmap->block2.data + i * (1 + 1 + total);
2281 for (i = 0; i < like->n_div; ++i) {
2282 isl_seq_cpy(bmap->div[i], like->div[i], 1 + 1 + ltotal);
2283 isl_seq_clr(bmap->div[i]+1+1+ltotal, total - ltotal);
2285 bmap = isl_basic_map_extend_constraints(bmap,
2286 0, 2 * like->n_div);
2287 for (i = 0; i < like->n_div; ++i) {
2288 if (isl_int_is_zero(bmap->div[i][0]))
2290 if (add_div_constraints(bmap, i) < 0)
2294 isl_basic_map_free(like);
2295 bmap = isl_basic_map_simplify(bmap);
2296 bmap = isl_basic_map_finalize(bmap);
2299 isl_basic_map_free(like);
2300 isl_basic_set_free(bset);
2304 struct isl_basic_set *isl_basic_set_from_underlying_set(
2305 struct isl_basic_set *bset, struct isl_basic_set *like)
2307 return (struct isl_basic_set *)
2308 isl_basic_map_overlying_set(bset, (struct isl_basic_map *)like);
2311 struct isl_set *isl_set_from_underlying_set(
2312 struct isl_set *set, struct isl_basic_set *like)
2318 isl_assert(set->ctx, set->dim->n_out == isl_basic_set_total_dim(like),
2320 if (isl_dim_equal(set->dim, like->dim) && like->n_div == 0) {
2321 isl_basic_set_free(like);
2324 set = isl_set_cow(set);
2327 for (i = 0; i < set->n; ++i) {
2328 set->p[i] = isl_basic_set_from_underlying_set(set->p[i],
2329 isl_basic_set_copy(like));
2333 isl_dim_free(set->dim);
2334 set->dim = isl_dim_copy(like->dim);
2337 isl_basic_set_free(like);
2340 isl_basic_set_free(like);
2345 struct isl_set *isl_map_underlying_set(struct isl_map *map)
2349 map = isl_map_cow(map);
2352 map->dim = isl_dim_cow(map->dim);
2356 for (i = 1; i < map->n; ++i)
2357 isl_assert(map->ctx, map->p[0]->n_div == map->p[i]->n_div,
2359 for (i = 0; i < map->n; ++i) {
2360 map->p[i] = (struct isl_basic_map *)
2361 isl_basic_map_underlying_set(map->p[i]);
2366 map->dim = isl_dim_underlying(map->dim, 0);
2368 isl_dim_free(map->dim);
2369 map->dim = isl_dim_copy(map->p[0]->dim);
2373 return (struct isl_set *)map;
2379 struct isl_set *isl_set_to_underlying_set(struct isl_set *set)
2381 return (struct isl_set *)isl_map_underlying_set((struct isl_map *)set);
2384 struct isl_basic_set *isl_basic_map_domain(struct isl_basic_map *bmap)
2386 struct isl_basic_set *domain;
2390 n_out = isl_basic_map_n_out(bmap);
2391 domain = isl_basic_set_from_basic_map(bmap);
2392 return isl_basic_set_project_out(domain, n_out, 0);
2395 struct isl_basic_set *isl_basic_map_range(struct isl_basic_map *bmap)
2397 return isl_basic_map_domain(isl_basic_map_reverse(bmap));
2400 struct isl_set *isl_map_range(struct isl_map *map)
2403 struct isl_set *set;
2407 map = isl_map_cow(map);
2411 set = (struct isl_set *) map;
2412 if (set->dim->n_in != 0) {
2413 set->dim = isl_dim_drop_inputs(set->dim, 0, set->dim->n_in);
2417 for (i = 0; i < map->n; ++i) {
2418 set->p[i] = isl_basic_map_range(map->p[i]);
2422 ISL_F_CLR(set, ISL_MAP_DISJOINT);
2423 ISL_F_CLR(set, ISL_SET_NORMALIZED);
2430 struct isl_map *isl_map_from_set(struct isl_set *set, struct isl_dim *dim)
2433 struct isl_map *map = NULL;
2435 set = isl_set_cow(set);
2438 isl_assert(set->ctx, isl_dim_compatible(set->dim, dim), goto error);
2439 map = (struct isl_map *)set;
2440 for (i = 0; i < set->n; ++i) {
2441 map->p[i] = isl_basic_map_from_basic_set(
2442 set->p[i], isl_dim_copy(dim));
2446 isl_dim_free(map->dim);
2455 struct isl_map *isl_map_from_range(struct isl_set *set)
2457 return (struct isl_map *)set;
2460 struct isl_set *isl_set_from_map(struct isl_map *map)
2463 struct isl_set *set = NULL;
2467 map = isl_map_cow(map);
2470 map->dim = isl_dim_cow(map->dim);
2473 map->dim->n_out += map->dim->n_in;
2475 set = (struct isl_set *)map;
2476 for (i = 0; i < map->n; ++i) {
2477 set->p[i] = isl_basic_set_from_basic_map(map->p[i]);
2487 struct isl_map *isl_map_alloc_dim(struct isl_dim *dim, int n, unsigned flags)
2489 struct isl_map *map;
2493 isl_assert(dim->ctx, n >= 0, return NULL);
2494 map = isl_alloc(dim->ctx, struct isl_map,
2495 sizeof(struct isl_map) +
2496 n * sizeof(struct isl_basic_map *));
2500 map->ctx = dim->ctx;
2501 isl_ctx_ref(map->ctx);
2513 struct isl_map *isl_map_alloc(struct isl_ctx *ctx,
2514 unsigned nparam, unsigned in, unsigned out, int n,
2517 struct isl_map *map;
2518 struct isl_dim *dims;
2520 dims = isl_dim_alloc(ctx, nparam, in, out);
2524 map = isl_map_alloc_dim(dims, n, flags);
2528 struct isl_basic_map *isl_basic_map_empty(struct isl_ctx *ctx,
2529 unsigned nparam, unsigned in, unsigned out)
2531 struct isl_basic_map *bmap;
2532 bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, 1, 0);
2533 bmap = isl_basic_map_set_to_empty(bmap);
2537 struct isl_basic_set *isl_basic_set_empty(struct isl_dim *dim)
2539 struct isl_basic_set *bset;
2540 bset = isl_basic_set_alloc_dim(dim, 0, 1, 0);
2541 bset = isl_basic_set_set_to_empty(bset);
2545 struct isl_basic_map *isl_basic_map_empty_like(struct isl_basic_map *model)
2547 struct isl_basic_map *bmap;
2550 bmap = isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
2551 bmap = isl_basic_map_set_to_empty(bmap);
2555 struct isl_basic_map *isl_basic_map_empty_like_map(struct isl_map *model)
2557 struct isl_basic_map *bmap;
2560 bmap = isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
2561 bmap = isl_basic_map_set_to_empty(bmap);
2565 struct isl_basic_set *isl_basic_set_empty_like(struct isl_basic_set *model)
2567 struct isl_basic_set *bset;
2570 bset = isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
2571 bset = isl_basic_set_set_to_empty(bset);
2575 struct isl_basic_map *isl_basic_map_universe(struct isl_dim *dim)
2577 struct isl_basic_map *bmap;
2578 bmap = isl_basic_map_alloc_dim(dim, 0, 0, 0);
2582 struct isl_basic_set *isl_basic_set_universe(struct isl_dim *dim)
2584 struct isl_basic_set *bset;
2585 bset = isl_basic_set_alloc_dim(dim, 0, 0, 0);
2589 struct isl_basic_set *isl_basic_set_universe_like(struct isl_basic_set *model)
2593 return isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
2596 struct isl_map *isl_map_empty(struct isl_dim *dim)
2598 return isl_map_alloc_dim(dim, 0, ISL_MAP_DISJOINT);
2601 struct isl_map *isl_map_empty_like(struct isl_map *model)
2605 return isl_map_alloc_dim(isl_dim_copy(model->dim), 0, ISL_MAP_DISJOINT);
2608 struct isl_map *isl_map_empty_like_basic_map(struct isl_basic_map *model)
2612 return isl_map_alloc_dim(isl_dim_copy(model->dim), 0, ISL_MAP_DISJOINT);
2615 struct isl_set *isl_set_empty(struct isl_dim *dim)
2617 return isl_set_alloc_dim(dim, 0, ISL_MAP_DISJOINT);
2620 struct isl_set *isl_set_empty_like(struct isl_set *model)
2624 return isl_set_empty(isl_dim_copy(model->dim));
2627 struct isl_set *isl_set_universe(struct isl_dim *dim)
2629 struct isl_set *set;
2632 set = isl_set_alloc_dim(isl_dim_copy(dim), 1, ISL_MAP_DISJOINT);
2633 set = isl_set_add(set, isl_basic_set_universe(dim));
2637 struct isl_map *isl_map_dup(struct isl_map *map)
2640 struct isl_map *dup;
2644 dup = isl_map_alloc_dim(isl_dim_copy(map->dim), map->n, map->flags);
2645 for (i = 0; i < map->n; ++i)
2646 dup = isl_map_add(dup, isl_basic_map_copy(map->p[i]));
2650 struct isl_map *isl_map_add(struct isl_map *map, struct isl_basic_map *bmap)
2654 isl_assert(map->ctx, isl_dim_equal(map->dim, bmap->dim), goto error);
2655 isl_assert(map->ctx, map->n < map->size, goto error);
2656 map->p[map->n] = bmap;
2658 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
2664 isl_basic_map_free(bmap);
2668 void isl_map_free(struct isl_map *map)
2678 isl_ctx_deref(map->ctx);
2679 for (i = 0; i < map->n; ++i)
2680 isl_basic_map_free(map->p[i]);
2681 isl_dim_free(map->dim);
2685 struct isl_map *isl_map_extend(struct isl_map *base,
2686 unsigned nparam, unsigned n_in, unsigned n_out)
2690 base = isl_map_cow(base);
2694 base->dim = isl_dim_extend(base->dim, nparam, n_in, n_out);
2697 for (i = 0; i < base->n; ++i) {
2698 base->p[i] = isl_basic_map_extend_dim(base->p[i],
2699 isl_dim_copy(base->dim), 0, 0, 0);
2709 struct isl_set *isl_set_extend(struct isl_set *base,
2710 unsigned nparam, unsigned dim)
2712 return (struct isl_set *)isl_map_extend((struct isl_map *)base,
2716 static struct isl_basic_map *isl_basic_map_fix_pos(struct isl_basic_map *bmap,
2717 unsigned pos, int value)
2721 bmap = isl_basic_map_cow(bmap);
2722 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
2723 j = isl_basic_map_alloc_equality(bmap);
2726 isl_seq_clr(bmap->eq[j], 1 + isl_basic_map_total_dim(bmap));
2727 isl_int_set_si(bmap->eq[j][pos], -1);
2728 isl_int_set_si(bmap->eq[j][0], value);
2729 bmap = isl_basic_map_simplify(bmap);
2730 return isl_basic_map_finalize(bmap);
2732 isl_basic_map_free(bmap);
2736 struct isl_basic_map *isl_basic_map_fix_si(struct isl_basic_map *bmap,
2737 enum isl_dim_type type, unsigned pos, int value)
2741 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
2742 return isl_basic_map_fix_pos(bmap, isl_basic_map_offset(bmap, type) + pos,
2745 isl_basic_map_free(bmap);
2749 struct isl_basic_set *isl_basic_set_fix_si(struct isl_basic_set *bset,
2750 enum isl_dim_type type, unsigned pos, int value)
2752 return (struct isl_basic_set *)
2753 isl_basic_map_fix_si((struct isl_basic_map *)bset,
2757 struct isl_basic_map *isl_basic_map_fix_input_si(struct isl_basic_map *bmap,
2758 unsigned input, int value)
2760 return isl_basic_map_fix_si(bmap, isl_dim_in, input, value);
2763 struct isl_basic_set *isl_basic_set_fix_dim_si(struct isl_basic_set *bset,
2764 unsigned dim, int value)
2766 return (struct isl_basic_set *)
2767 isl_basic_map_fix_si((struct isl_basic_map *)bset,
2768 isl_dim_set, dim, value);
2771 struct isl_map *isl_map_fix_si(struct isl_map *map,
2772 enum isl_dim_type type, unsigned pos, int value)
2776 map = isl_map_cow(map);
2780 isl_assert(ctx, pos < isl_map_dim(map, type), goto error);
2781 for (i = 0; i < map->n; ++i) {
2782 map->p[i] = isl_basic_map_fix_si(map->p[i], type, pos, value);
2786 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
2793 struct isl_map *isl_map_fix_input_si(struct isl_map *map,
2794 unsigned input, int value)
2796 return isl_map_fix_si(map, isl_dim_in, input, value);
2799 struct isl_set *isl_set_fix_dim_si(struct isl_set *set, unsigned dim, int value)
2801 return (struct isl_set *)
2802 isl_map_fix_si((struct isl_map *)set, isl_dim_set, dim, value);
2805 struct isl_basic_set *isl_basic_set_lower_bound_dim(struct isl_basic_set *bset,
2806 unsigned dim, isl_int value)
2811 bset = isl_basic_set_cow(bset);
2812 bset = isl_basic_set_extend_constraints(bset, 0, 1);
2813 j = isl_basic_set_alloc_inequality(bset);
2816 isl_seq_clr(bset->ineq[j], 1 + isl_basic_set_total_dim(bset));
2817 isl_int_set_si(bset->ineq[j][1 + isl_basic_set_n_param(bset) + dim], 1);
2818 isl_int_neg(bset->ineq[j][0], value);
2819 bset = isl_basic_set_simplify(bset);
2820 return isl_basic_set_finalize(bset);
2822 isl_basic_set_free(bset);
2826 struct isl_set *isl_set_lower_bound_dim(struct isl_set *set, unsigned dim,
2831 set = isl_set_cow(set);
2835 isl_assert(set->ctx, dim < isl_set_n_dim(set), goto error);
2836 for (i = 0; i < set->n; ++i) {
2837 set->p[i] = isl_basic_set_lower_bound_dim(set->p[i], dim, value);
2847 struct isl_map *isl_map_reverse(struct isl_map *map)
2852 map = isl_map_cow(map);
2856 map->dim = isl_dim_reverse(map->dim);
2859 for (i = 0; i < map->n; ++i) {
2860 map->p[i] = isl_basic_map_reverse(map->p[i]);
2864 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
2871 struct isl_map *isl_basic_map_lexmax(
2872 struct isl_basic_map *bmap, struct isl_basic_set *dom,
2873 struct isl_set **empty)
2875 return isl_pip_basic_map_lexmax(bmap, dom, empty);
2878 struct isl_map *isl_basic_map_lexmin(
2879 struct isl_basic_map *bmap, struct isl_basic_set *dom,
2880 struct isl_set **empty)
2882 return isl_pip_basic_map_lexmin(bmap, dom, empty);
2885 struct isl_set *isl_basic_set_lexmin(struct isl_basic_set *bset)
2887 struct isl_basic_map *bmap = NULL;
2888 struct isl_basic_set *dom = NULL;
2889 struct isl_map *min;
2890 struct isl_dim *param_dim;
2894 bmap = isl_basic_map_from_basic_set(bset, isl_dim_copy(bset->dim));
2897 param_dim = isl_dim_domain(isl_dim_copy(bmap->dim));
2898 dom = isl_basic_set_universe(param_dim);
2901 min = isl_basic_map_lexmin(bmap, dom, NULL);
2902 return isl_map_range(min);
2904 isl_basic_map_free(bmap);
2908 struct isl_map *isl_basic_map_compute_divs(struct isl_basic_map *bmap)
2915 off = isl_dim_total(bmap->dim);
2916 for (i = 0; i < bmap->n_div; ++i) {
2917 if (isl_int_is_zero(bmap->div[i][0]))
2918 return isl_pip_basic_map_compute_divs(bmap);
2919 isl_assert(bmap->ctx, isl_int_is_zero(bmap->div[i][1+1+off+i]),
2922 return isl_map_from_basic_map(bmap);
2924 isl_basic_map_free(bmap);
2928 struct isl_map *isl_map_compute_divs(struct isl_map *map)
2931 struct isl_map *res;
2937 res = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[0]));
2938 for (i = 1 ; i < map->n; ++i) {
2940 r2 = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[i]));
2941 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT))
2942 res = isl_map_union_disjoint(res, r2);
2944 res = isl_map_union(res, r2);
2951 struct isl_set *isl_basic_set_compute_divs(struct isl_basic_set *bset)
2953 return (struct isl_set *)
2954 isl_basic_map_compute_divs((struct isl_basic_map *)bset);
2957 struct isl_set *isl_set_compute_divs(struct isl_set *set)
2959 return (struct isl_set *)
2960 isl_map_compute_divs((struct isl_map *)set);
2963 struct isl_set *isl_map_domain(struct isl_map *map)
2966 struct isl_set *set;
2971 map = isl_map_cow(map);
2975 set = (struct isl_set *)map;
2976 set->dim = isl_dim_domain(set->dim);
2979 for (i = 0; i < map->n; ++i) {
2980 set->p[i] = isl_basic_map_domain(map->p[i]);
2984 ISL_F_CLR(set, ISL_MAP_DISJOINT);
2985 ISL_F_CLR(set, ISL_SET_NORMALIZED);
2992 struct isl_map *isl_map_union_disjoint(
2993 struct isl_map *map1, struct isl_map *map2)
2997 struct isl_map *map = NULL;
3011 isl_assert(map1->ctx, isl_dim_equal(map1->dim, map2->dim), goto error);
3013 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
3014 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
3015 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
3017 map = isl_map_alloc_dim(isl_dim_copy(map1->dim),
3018 map1->n + map2->n, flags);
3021 for (i = 0; i < map1->n; ++i) {
3022 map = isl_map_add(map,
3023 isl_basic_map_copy(map1->p[i]));
3027 for (i = 0; i < map2->n; ++i) {
3028 map = isl_map_add(map,
3029 isl_basic_map_copy(map2->p[i]));
3043 struct isl_map *isl_map_union(struct isl_map *map1, struct isl_map *map2)
3045 map1 = isl_map_union_disjoint(map1, map2);
3049 ISL_F_CLR(map1, ISL_MAP_DISJOINT);
3053 struct isl_set *isl_set_union_disjoint(
3054 struct isl_set *set1, struct isl_set *set2)
3056 return (struct isl_set *)
3057 isl_map_union_disjoint(
3058 (struct isl_map *)set1, (struct isl_map *)set2);
3061 struct isl_set *isl_set_union(struct isl_set *set1, struct isl_set *set2)
3063 return (struct isl_set *)
3064 isl_map_union((struct isl_map *)set1, (struct isl_map *)set2);
3067 struct isl_map *isl_map_intersect_range(
3068 struct isl_map *map, struct isl_set *set)
3071 struct isl_map *result;
3077 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT) &&
3078 ISL_F_ISSET(set, ISL_MAP_DISJOINT))
3079 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
3081 result = isl_map_alloc_dim(isl_dim_copy(map->dim),
3082 map->n * set->n, flags);
3085 for (i = 0; i < map->n; ++i)
3086 for (j = 0; j < set->n; ++j) {
3087 result = isl_map_add(result,
3088 isl_basic_map_intersect_range(
3089 isl_basic_map_copy(map->p[i]),
3090 isl_basic_set_copy(set->p[j])));
3103 struct isl_map *isl_map_intersect_domain(
3104 struct isl_map *map, struct isl_set *set)
3106 return isl_map_reverse(
3107 isl_map_intersect_range(isl_map_reverse(map), set));
3110 struct isl_map *isl_map_apply_domain(
3111 struct isl_map *map1, struct isl_map *map2)
3115 map1 = isl_map_reverse(map1);
3116 map1 = isl_map_apply_range(map1, map2);
3117 return isl_map_reverse(map1);
3124 struct isl_map *isl_map_apply_range(
3125 struct isl_map *map1, struct isl_map *map2)
3127 struct isl_dim *dim_result;
3128 struct isl_map *result;
3137 dim_result = isl_dim_join(isl_dim_copy(map1->dim),
3138 isl_dim_copy(map2->dim));
3140 result = isl_map_alloc_dim(dim_result, map1->n * map2->n, 0);
3143 for (i = 0; i < map1->n; ++i)
3144 for (j = 0; j < map2->n; ++j) {
3145 result = isl_map_add(result,
3146 isl_basic_map_apply_range(
3147 isl_basic_map_copy(map1->p[i]),
3148 isl_basic_map_copy(map2->p[j])));
3154 if (result && result->n <= 1)
3155 ISL_F_SET(result, ISL_MAP_DISJOINT);
3164 * returns range - domain
3166 struct isl_basic_set *isl_basic_map_deltas(struct isl_basic_map *bmap)
3168 struct isl_basic_set *bset;
3175 dim = isl_basic_map_n_in(bmap);
3176 nparam = isl_basic_map_n_param(bmap);
3177 isl_assert(bmap->ctx, dim == isl_basic_map_n_out(bmap), goto error);
3178 bset = isl_basic_set_from_basic_map(bmap);
3179 bset = isl_basic_set_cow(bset);
3180 bset = isl_basic_set_extend(bset, nparam, 3*dim, 0, dim, 0);
3181 bset = isl_basic_set_swap_vars(bset, 2*dim);
3182 for (i = 0; i < dim; ++i) {
3183 int j = isl_basic_map_alloc_equality(
3184 (struct isl_basic_map *)bset);
3187 isl_seq_clr(bset->eq[j], 1 + isl_basic_set_total_dim(bset));
3188 isl_int_set_si(bset->eq[j][1+nparam+i], 1);
3189 isl_int_set_si(bset->eq[j][1+nparam+dim+i], 1);
3190 isl_int_set_si(bset->eq[j][1+nparam+2*dim+i], -1);
3192 return isl_basic_set_project_out(bset, 2*dim, 0);
3194 isl_basic_map_free(bmap);
3199 * returns range - domain
3201 struct isl_set *isl_map_deltas(struct isl_map *map)
3204 struct isl_set *result;
3209 isl_assert(map->ctx, isl_map_n_in(map) == isl_map_n_out(map), goto error);
3210 result = isl_set_alloc(map->ctx, isl_map_n_param(map),
3211 isl_map_n_in(map), map->n, map->flags);
3214 for (i = 0; i < map->n; ++i)
3215 result = isl_set_add(result,
3216 isl_basic_map_deltas(isl_basic_map_copy(map->p[i])));
3224 static struct isl_basic_map *basic_map_identity(struct isl_dim *dims)
3226 struct isl_basic_map *bmap;
3234 nparam = dims->nparam;
3236 bmap = isl_basic_map_alloc_dim(dims, 0, dim, 0);
3240 for (i = 0; i < dim; ++i) {
3241 int j = isl_basic_map_alloc_equality(bmap);
3244 isl_seq_clr(bmap->eq[j], 1 + isl_basic_map_total_dim(bmap));
3245 isl_int_set_si(bmap->eq[j][1+nparam+i], 1);
3246 isl_int_set_si(bmap->eq[j][1+nparam+dim+i], -1);
3248 return isl_basic_map_finalize(bmap);
3250 isl_basic_map_free(bmap);
3254 struct isl_basic_map *isl_basic_map_identity(struct isl_dim *set_dim)
3256 struct isl_dim *dim = isl_dim_map(set_dim);
3259 return basic_map_identity(dim);
3262 struct isl_basic_map *isl_basic_map_identity_like(struct isl_basic_map *model)
3264 if (!model || !model->dim)
3266 isl_assert(model->ctx,
3267 model->dim->n_in == model->dim->n_out, return NULL);
3268 return basic_map_identity(isl_dim_copy(model->dim));
3271 static struct isl_map *map_identity(struct isl_dim *dim)
3273 struct isl_map *map = isl_map_alloc_dim(dim, 1, ISL_MAP_DISJOINT);
3274 return isl_map_add(map, basic_map_identity(isl_dim_copy(dim)));
3277 struct isl_map *isl_map_identity(struct isl_dim *set_dim)
3279 struct isl_dim *dim = isl_dim_map(set_dim);
3282 return map_identity(dim);
3285 struct isl_map *isl_map_identity_like(struct isl_basic_map *model)
3287 if (!model || !model->dim)
3289 isl_assert(model->ctx,
3290 model->dim->n_in == model->dim->n_out, return NULL);
3291 return map_identity(isl_dim_copy(model->dim));
3294 int isl_set_is_equal(struct isl_set *set1, struct isl_set *set2)
3296 return isl_map_is_equal((struct isl_map *)set1, (struct isl_map *)set2);
3299 int isl_set_is_subset(struct isl_set *set1, struct isl_set *set2)
3301 return isl_map_is_subset(
3302 (struct isl_map *)set1, (struct isl_map *)set2);
3305 int isl_basic_map_is_subset(
3306 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3309 struct isl_map *map1;
3310 struct isl_map *map2;
3312 if (!bmap1 || !bmap2)
3315 map1 = isl_map_from_basic_map(isl_basic_map_copy(bmap1));
3316 map2 = isl_map_from_basic_map(isl_basic_map_copy(bmap2));
3318 is_subset = isl_map_is_subset(map1, map2);
3326 int isl_basic_map_is_equal(
3327 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3331 if (!bmap1 || !bmap2)
3333 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
3336 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
3340 int isl_basic_set_is_equal(
3341 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
3343 return isl_basic_map_is_equal(
3344 (struct isl_basic_map *)bset1, (struct isl_basic_map *)bset2);
3347 int isl_map_is_empty(struct isl_map *map)
3354 for (i = 0; i < map->n; ++i) {
3355 is_empty = isl_basic_map_is_empty(map->p[i]);
3364 int isl_map_fast_is_empty(struct isl_map *map)
3369 int isl_set_is_empty(struct isl_set *set)
3371 return isl_map_is_empty((struct isl_map *)set);
3374 int isl_map_is_subset(struct isl_map *map1, struct isl_map *map2)
3378 struct isl_map *diff;
3383 if (isl_map_is_empty(map1))
3386 if (isl_map_is_empty(map2))
3389 diff = isl_map_subtract(isl_map_copy(map1), isl_map_copy(map2));
3393 is_subset = isl_map_is_empty(diff);
3399 int isl_map_is_equal(struct isl_map *map1, struct isl_map *map2)
3405 is_subset = isl_map_is_subset(map1, map2);
3408 is_subset = isl_map_is_subset(map2, map1);
3412 int isl_basic_map_is_strict_subset(
3413 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3417 if (!bmap1 || !bmap2)
3419 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
3422 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
3423 if (is_subset == -1)
3428 int isl_basic_map_is_universe(struct isl_basic_map *bmap)
3432 return bmap->n_eq == 0 && bmap->n_ineq == 0;
3435 int isl_basic_map_is_empty(struct isl_basic_map *bmap)
3437 struct isl_basic_set *bset = NULL;
3438 struct isl_vec *sample = NULL;
3445 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY))
3448 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL)) {
3449 struct isl_basic_map *copy = isl_basic_map_copy(bmap);
3450 copy = isl_basic_map_convex_hull(copy);
3451 empty = ISL_F_ISSET(copy, ISL_BASIC_MAP_EMPTY);
3452 isl_basic_map_free(copy);
3456 total = 1 + isl_basic_map_total_dim(bmap);
3457 if (bmap->sample && bmap->sample->size == total) {
3458 int contains = basic_map_contains(bmap, bmap->sample);
3464 bset = isl_basic_map_underlying_set(isl_basic_map_copy(bmap));
3467 sample = isl_basic_set_sample(bset);
3470 empty = sample->size == 0;
3472 isl_vec_free(bmap->ctx, bmap->sample);
3473 bmap->sample = sample;
3478 int isl_basic_set_is_empty(struct isl_basic_set *bset)
3480 return isl_basic_map_is_empty((struct isl_basic_map *)bset);
3483 struct isl_map *isl_basic_map_union(
3484 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3486 struct isl_map *map;
3487 if (!bmap1 || !bmap2)
3490 isl_assert(map1->ctx, isl_dim_equal(bmap1->dim, bmap2->dim), goto error);
3492 map = isl_map_alloc_dim(isl_dim_copy(bmap1->dim), 2, 0);
3495 map = isl_map_add(map, bmap1);
3496 map = isl_map_add(map, bmap2);
3499 isl_basic_map_free(bmap1);
3500 isl_basic_map_free(bmap2);
3504 struct isl_set *isl_basic_set_union(
3505 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
3507 return (struct isl_set *)isl_basic_map_union(
3508 (struct isl_basic_map *)bset1,
3509 (struct isl_basic_map *)bset2);
3512 /* Order divs such that any div only depends on previous divs */
3513 static struct isl_basic_map *order_divs(struct isl_basic_map *bmap)
3516 unsigned off = isl_dim_total(bmap->dim);
3518 for (i = 0; i < bmap->n_div; ++i) {
3520 pos = isl_seq_first_non_zero(bmap->div[i]+1+1+off+i,
3524 swap_div(bmap, i, pos);
3530 /* Look for a div in dst that corresponds to the div "div" in src.
3531 * The divs before "div" in src and dst are assumed to be the same.
3533 * Returns -1 if no corresponding div was found and the position
3534 * of the corresponding div in dst otherwise.
3536 static int find_div(struct isl_basic_map *dst,
3537 struct isl_basic_map *src, unsigned div)
3541 unsigned total = isl_dim_total(src->dim);
3543 isl_assert(dst->ctx, div <= dst->n_div, return -1);
3544 for (i = div; i < dst->n_div; ++i)
3545 if (isl_seq_eq(dst->div[i], src->div[div], 1+1+total+div) &&
3546 isl_seq_first_non_zero(dst->div[i]+1+1+total+div,
3547 dst->n_div - div) == -1)
3552 struct isl_basic_map *isl_basic_map_align_divs(
3553 struct isl_basic_map *dst, struct isl_basic_map *src)
3556 unsigned total = isl_dim_total(src->dim);
3561 if (src->n_div == 0)
3564 for (i = 0; i < src->n_div; ++i)
3565 isl_assert(src->ctx, !isl_int_is_zero(src->div[i][0]), goto error);
3567 src = order_divs(src);
3568 dst = isl_basic_map_cow(dst);
3569 dst = isl_basic_map_extend_dim(dst, isl_dim_copy(dst->dim),
3570 src->n_div, 0, 2 * src->n_div);
3573 for (i = 0; i < src->n_div; ++i) {
3574 int j = find_div(dst, src, i);
3576 j = isl_basic_map_alloc_div(dst);
3579 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total+i);
3580 isl_seq_clr(dst->div[j]+1+1+total+i, dst->n_div - i);
3581 if (add_div_constraints(dst, j) < 0)
3585 swap_div(dst, i, j);
3589 isl_basic_map_free(dst);
3593 struct isl_basic_set *isl_basic_set_align_divs(
3594 struct isl_basic_set *dst, struct isl_basic_set *src)
3596 return (struct isl_basic_set *)isl_basic_map_align_divs(
3597 (struct isl_basic_map *)dst, (struct isl_basic_map *)src);
3600 struct isl_map *isl_map_align_divs(struct isl_map *map)
3604 map = isl_map_compute_divs(map);
3605 map = isl_map_cow(map);
3609 for (i = 1; i < map->n; ++i)
3610 map->p[0] = isl_basic_map_align_divs(map->p[0], map->p[i]);
3611 for (i = 1; i < map->n; ++i)
3612 map->p[i] = isl_basic_map_align_divs(map->p[i], map->p[0]);
3614 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3618 static struct isl_map *add_cut_constraint(struct isl_map *dst,
3619 struct isl_basic_map *src, isl_int *c,
3620 unsigned len, int oppose)
3622 struct isl_basic_map *copy = NULL;
3627 copy = isl_basic_map_copy(src);
3628 copy = isl_basic_map_cow(copy);
3631 copy = isl_basic_map_extend_constraints(copy, 0, 1);
3632 k = isl_basic_map_alloc_inequality(copy);
3636 isl_seq_neg(copy->ineq[k], c, len);
3638 isl_seq_cpy(copy->ineq[k], c, len);
3639 total = 1 + isl_basic_map_total_dim(copy);
3640 isl_seq_clr(copy->ineq[k]+len, total - len);
3641 isl_inequality_negate(copy, k);
3642 copy = isl_basic_map_simplify(copy);
3643 copy = isl_basic_map_finalize(copy);
3644 is_empty = isl_basic_map_is_empty(copy);
3648 dst = isl_map_add(dst, copy);
3650 isl_basic_map_free(copy);
3653 isl_basic_map_free(copy);
3658 static struct isl_map *subtract(struct isl_map *map, struct isl_basic_map *bmap)
3662 struct isl_map *rest = NULL;
3664 unsigned total = isl_basic_map_total_dim(bmap);
3671 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT))
3672 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
3674 max = map->n * (2 * bmap->n_eq + bmap->n_ineq);
3675 rest = isl_map_alloc_dim(isl_dim_copy(map->dim), max, flags);
3679 for (i = 0; i < map->n; ++i) {
3680 map->p[i] = isl_basic_map_align_divs(map->p[i], bmap);
3685 for (j = 0; j < map->n; ++j)
3686 map->p[j] = isl_basic_map_cow(map->p[j]);
3688 for (i = 0; i < bmap->n_eq; ++i) {
3689 for (j = 0; j < map->n; ++j) {
3690 rest = add_cut_constraint(rest,
3691 map->p[j], bmap->eq[i], 1+total, 0);
3695 rest = add_cut_constraint(rest,
3696 map->p[j], bmap->eq[i], 1+total, 1);
3700 map->p[j] = isl_basic_map_extend_constraints(map->p[j],
3704 k = isl_basic_map_alloc_equality(map->p[j]);
3707 isl_seq_cpy(map->p[j]->eq[k], bmap->eq[i], 1+total);
3708 isl_seq_clr(map->p[j]->eq[k]+1+total,
3709 map->p[j]->n_div - bmap->n_div);
3713 for (i = 0; i < bmap->n_ineq; ++i) {
3714 for (j = 0; j < map->n; ++j) {
3715 rest = add_cut_constraint(rest,
3716 map->p[j], bmap->ineq[i], 1+total, 0);
3720 map->p[j] = isl_basic_map_extend_constraints(map->p[j],
3724 k = isl_basic_map_alloc_inequality(map->p[j]);
3727 isl_seq_cpy(map->p[j]->ineq[k], bmap->ineq[i], 1+total);
3728 isl_seq_clr(map->p[j]->ineq[k]+1+total,
3729 map->p[j]->n_div - bmap->n_div);
3741 struct isl_map *isl_map_subtract(struct isl_map *map1, struct isl_map *map2)
3747 isl_assert(map1->ctx, isl_dim_equal(map1->dim, map2->dim), goto error);
3749 if (isl_map_is_empty(map2)) {
3754 map1 = isl_map_compute_divs(map1);
3755 map2 = isl_map_compute_divs(map2);
3759 for (i = 0; map1 && i < map2->n; ++i)
3760 map1 = subtract(map1, map2->p[i]);
3770 struct isl_set *isl_set_subtract(struct isl_set *set1, struct isl_set *set2)
3772 return (struct isl_set *)
3774 (struct isl_map *)set1, (struct isl_map *)set2);
3777 struct isl_set *isl_set_apply(struct isl_set *set, struct isl_map *map)
3781 isl_assert(set->ctx, isl_map_compatible_domain(map, set), goto error);
3782 map = isl_map_intersect_domain(map, set);
3783 set = isl_map_range(map);
3791 /* There is no need to cow as removing empty parts doesn't change
3792 * the meaning of the set.
3794 struct isl_map *isl_map_remove_empty_parts(struct isl_map *map)
3801 for (i = map->n-1; i >= 0; --i) {
3802 if (!ISL_F_ISSET(map->p[i], ISL_BASIC_MAP_EMPTY))
3804 isl_basic_map_free(map->p[i]);
3805 if (i != map->n-1) {
3806 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3807 map->p[i] = map->p[map->n-1];
3815 struct isl_set *isl_set_remove_empty_parts(struct isl_set *set)
3817 return (struct isl_set *)
3818 isl_map_remove_empty_parts((struct isl_map *)set);
3821 struct isl_basic_map *isl_map_copy_basic_map(struct isl_map *map)
3823 struct isl_basic_map *bmap;
3824 if (!map || map->n == 0)
3826 bmap = map->p[map->n-1];
3827 isl_assert(map->ctx, ISL_F_ISSET(bmap, ISL_BASIC_SET_FINAL), return NULL);
3828 return isl_basic_map_copy(bmap);
3831 struct isl_basic_set *isl_set_copy_basic_set(struct isl_set *set)
3833 (struct isl_basic_set *)isl_map_copy_basic_map((struct isl_map *)set);
3836 struct isl_map *isl_map_drop_basic_map(struct isl_map *map,
3837 struct isl_basic_map *bmap)
3843 for (i = map->n-1; i >= 0; --i) {
3844 if (map->p[i] != bmap)
3846 map = isl_map_cow(map);
3849 isl_basic_map_free(map->p[i]);
3850 if (i != map->n-1) {
3851 ISL_F_CLR(map, ISL_SET_NORMALIZED);
3852 map->p[i] = map->p[map->n-1];
3857 isl_basic_map_free(bmap);
3861 isl_basic_map_free(bmap);
3865 struct isl_set *isl_set_drop_basic_set(struct isl_set *set,
3866 struct isl_basic_set *bset)
3868 (struct isl_set *)isl_map_drop_basic_map((struct isl_map *)set,
3869 (struct isl_basic_map *)bset);
3872 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
3873 * for any common value of the parameters and dimensions preceding dim
3874 * in both basic sets, the values of dimension pos in bset1 are
3875 * smaller or larger than those in bset2.
3878 * 1 if bset1 follows bset2
3879 * -1 if bset1 precedes bset2
3880 * 0 if bset1 and bset2 are incomparable
3881 * -2 if some error occurred.
3883 int isl_basic_set_compare_at(struct isl_basic_set *bset1,
3884 struct isl_basic_set *bset2, int pos)
3886 struct isl_dim *dims;
3887 struct isl_basic_map *bmap1 = NULL;
3888 struct isl_basic_map *bmap2 = NULL;
3889 struct isl_ctx *ctx;
3890 struct isl_vec *obj;
3893 unsigned dim1, dim2;
3895 enum isl_lp_result res;
3898 if (!bset1 || !bset2)
3901 nparam = isl_basic_set_n_param(bset1);
3902 dim1 = isl_basic_set_n_dim(bset1);
3903 dim2 = isl_basic_set_n_dim(bset2);
3904 dims = isl_dim_alloc(bset1->ctx, nparam, pos, dim1 - pos);
3905 bmap1 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset1), dims);
3906 dims = isl_dim_alloc(bset2->ctx, nparam, pos, dim2 - pos);
3907 bmap2 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset2), dims);
3908 if (!bmap1 || !bmap2)
3910 bmap1 = isl_basic_map_cow(bmap1);
3911 bmap1 = isl_basic_map_extend(bmap1, nparam,
3912 pos, (dim1 - pos) + (dim2 - pos),
3913 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
3914 bmap1 = add_constraints(bmap1, bmap2, 0, dim1 - pos);
3917 total = isl_basic_map_total_dim(bmap1);
3919 obj = isl_vec_alloc(ctx, 1 + total);
3920 isl_seq_clr(obj->block.data, 1 + total);
3921 isl_int_set_si(obj->block.data[1+nparam+pos], 1);
3922 isl_int_set_si(obj->block.data[1+nparam+pos+(dim1-pos)], -1);
3927 res = isl_solve_lp(bmap1, 0, obj->block.data, ctx->one, &num, &den);
3928 if (res == isl_lp_empty)
3930 else if (res == isl_lp_ok && isl_int_is_pos(num))
3932 else if ((res == isl_lp_ok && isl_int_is_neg(num)) ||
3933 res == isl_lp_unbounded)
3939 isl_basic_map_free(bmap1);
3940 isl_vec_free(ctx, obj);
3943 isl_basic_map_free(bmap1);
3944 isl_basic_map_free(bmap2);
3948 static int isl_basic_map_fast_has_fixed_var(struct isl_basic_map *bmap,
3949 unsigned pos, isl_int *val)
3957 total = isl_basic_map_total_dim(bmap);
3958 for (i = 0, d = total-1; i < bmap->n_eq && d+1 > pos; ++i) {
3959 for (; d+1 > pos; --d)
3960 if (!isl_int_is_zero(bmap->eq[i][1+d]))
3964 if (isl_seq_first_non_zero(bmap->eq[i]+1, d) != -1)
3966 if (isl_seq_first_non_zero(bmap->eq[i]+1+d+1, total-d-1) != -1)
3968 if (!isl_int_is_one(bmap->eq[i][1+d]))
3971 isl_int_neg(*val, bmap->eq[i][0]);
3977 static int isl_map_fast_has_fixed_var(struct isl_map *map,
3978 unsigned pos, isl_int *val)
3990 return isl_basic_map_fast_has_fixed_var(map->p[0], pos, val);
3993 fixed = isl_basic_map_fast_has_fixed_var(map->p[0], pos, &v);
3994 for (i = 1; fixed == 1 && i < map->n; ++i) {
3995 fixed = isl_basic_map_fast_has_fixed_var(map->p[i], pos, &tmp);
3996 if (fixed == 1 && isl_int_ne(tmp, v))
4000 isl_int_set(*val, v);
4006 static int isl_set_fast_has_fixed_var(struct isl_set *set, unsigned pos,
4009 return isl_map_fast_has_fixed_var((struct isl_map *)set, pos, val);
4012 int isl_basic_map_fast_is_fixed(struct isl_basic_map *bmap,
4013 enum isl_dim_type type, unsigned pos, isl_int *val)
4015 if (pos >= isl_basic_map_dim(bmap, type))
4017 return isl_basic_map_fast_has_fixed_var(bmap,
4018 isl_basic_map_offset(bmap, type) - 1 + pos, val);
4021 /* Check if dimension dim has fixed value and if so and if val is not NULL,
4022 * then return this fixed value in *val.
4024 int isl_set_fast_dim_is_fixed(struct isl_set *set, unsigned dim, isl_int *val)
4026 return isl_set_fast_has_fixed_var(set, isl_set_n_param(set) + dim, val);
4029 /* Check if input variable in has fixed value and if so and if val is not NULL,
4030 * then return this fixed value in *val.
4032 int isl_map_fast_input_is_fixed(struct isl_map *map, unsigned in, isl_int *val)
4034 return isl_map_fast_has_fixed_var(map, isl_map_n_param(map) + in, val);
4037 /* Check if dimension dim has an (obvious) fixed lower bound and if so
4038 * and if val is not NULL, then return this lower bound in *val.
4040 int isl_basic_set_fast_dim_has_fixed_lower_bound(struct isl_basic_set *bset,
4041 unsigned dim, isl_int *val)
4043 int i, i_eq = -1, i_ineq = -1;
4050 total = isl_basic_set_total_dim(bset);
4051 nparam = isl_basic_set_n_param(bset);
4052 for (i = 0; i < bset->n_eq; ++i) {
4053 if (isl_int_is_zero(bset->eq[i][1+nparam+dim]))
4059 for (i = 0; i < bset->n_ineq; ++i) {
4060 if (!isl_int_is_pos(bset->ineq[i][1+nparam+dim]))
4062 if (i_eq != -1 || i_ineq != -1)
4066 if (i_eq == -1 && i_ineq == -1)
4068 c = i_eq != -1 ? bset->eq[i_eq] : bset->ineq[i_ineq];
4069 /* The coefficient should always be one due to normalization. */
4070 if (!isl_int_is_one(c[1+nparam+dim]))
4072 if (isl_seq_first_non_zero(c+1, nparam+dim) != -1)
4074 if (isl_seq_first_non_zero(c+1+nparam+dim+1,
4075 total - nparam - dim - 1) != -1)
4078 isl_int_neg(*val, c[0]);
4082 int isl_set_fast_dim_has_fixed_lower_bound(struct isl_set *set,
4083 unsigned dim, isl_int *val)
4095 return isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[0],
4099 fixed = isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[0],
4101 for (i = 1; fixed == 1 && i < set->n; ++i) {
4102 fixed = isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[i],
4104 if (fixed == 1 && isl_int_ne(tmp, v))
4108 isl_int_set(*val, v);
4119 static int qsort_constraint_cmp(const void *p1, const void *p2)
4121 const struct constraint *c1 = (const struct constraint *)p1;
4122 const struct constraint *c2 = (const struct constraint *)p2;
4123 unsigned size = isl_min(c1->size, c2->size);
4124 return isl_seq_cmp(c1->c, c2->c, size);
4127 static struct isl_basic_map *isl_basic_map_sort_constraints(
4128 struct isl_basic_map *bmap)
4131 struct constraint *c;
4136 total = isl_basic_map_total_dim(bmap);
4137 c = isl_alloc_array(bmap->ctx, struct constraint, bmap->n_ineq);
4140 for (i = 0; i < bmap->n_ineq; ++i) {
4142 c[i].c = bmap->ineq[i];
4144 qsort(c, bmap->n_ineq, sizeof(struct constraint), qsort_constraint_cmp);
4145 for (i = 0; i < bmap->n_ineq; ++i)
4146 bmap->ineq[i] = c[i].c;
4150 isl_basic_map_free(bmap);
4154 struct isl_basic_map *isl_basic_map_normalize(struct isl_basic_map *bmap)
4158 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_NORMALIZED))
4160 bmap = isl_basic_map_convex_hull(bmap);
4161 bmap = isl_basic_map_sort_constraints(bmap);
4162 ISL_F_SET(bmap, ISL_BASIC_MAP_NORMALIZED);
4166 struct isl_basic_set *isl_basic_set_normalize(struct isl_basic_set *bset)
4168 return (struct isl_basic_set *)isl_basic_map_normalize(
4169 (struct isl_basic_map *)bset);
4172 static int isl_basic_map_fast_cmp(const struct isl_basic_map *bmap1,
4173 const struct isl_basic_map *bmap2)
4180 if (isl_basic_map_n_param(bmap1) != isl_basic_map_n_param(bmap2))
4181 return isl_basic_map_n_param(bmap1) - isl_basic_map_n_param(bmap2);
4182 if (isl_basic_map_n_in(bmap1) != isl_basic_map_n_in(bmap2))
4183 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
4184 if (isl_basic_map_n_out(bmap1) != isl_basic_map_n_out(bmap2))
4185 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
4186 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY) &&
4187 ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
4189 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY))
4191 if (ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
4193 if (bmap1->n_eq != bmap2->n_eq)
4194 return bmap1->n_eq - bmap2->n_eq;
4195 if (bmap1->n_ineq != bmap2->n_ineq)
4196 return bmap1->n_ineq - bmap2->n_ineq;
4197 if (bmap1->n_div != bmap2->n_div)
4198 return bmap1->n_div - bmap2->n_div;
4199 total = isl_basic_map_total_dim(bmap1);
4200 for (i = 0; i < bmap1->n_eq; ++i) {
4201 cmp = isl_seq_cmp(bmap1->eq[i], bmap2->eq[i], 1+total);
4205 for (i = 0; i < bmap1->n_ineq; ++i) {
4206 cmp = isl_seq_cmp(bmap1->ineq[i], bmap2->ineq[i], 1+total);
4210 for (i = 0; i < bmap1->n_div; ++i) {
4211 cmp = isl_seq_cmp(bmap1->div[i], bmap2->div[i], 1+1+total);
4218 static int isl_basic_map_fast_is_equal(struct isl_basic_map *bmap1,
4219 struct isl_basic_map *bmap2)
4221 return isl_basic_map_fast_cmp(bmap1, bmap2) == 0;
4224 static int qsort_bmap_cmp(const void *p1, const void *p2)
4226 const struct isl_basic_map *bmap1 = *(const struct isl_basic_map **)p1;
4227 const struct isl_basic_map *bmap2 = *(const struct isl_basic_map **)p2;
4229 return isl_basic_map_fast_cmp(bmap1, bmap2);
4232 /* We normalize in place, but if anything goes wrong we need
4233 * to return NULL, so we need to make sure we don't change the
4234 * meaning of any possible other copies of map.
4236 struct isl_map *isl_map_normalize(struct isl_map *map)
4239 struct isl_basic_map *bmap;
4243 if (ISL_F_ISSET(map, ISL_MAP_NORMALIZED))
4245 for (i = 0; i < map->n; ++i) {
4246 bmap = isl_basic_map_normalize(isl_basic_map_copy(map->p[i]));
4249 isl_basic_map_free(map->p[i]);
4252 qsort(map->p, map->n, sizeof(struct isl_basic_map *), qsort_bmap_cmp);
4253 ISL_F_SET(map, ISL_MAP_NORMALIZED);
4254 map = isl_map_remove_empty_parts(map);
4257 for (i = map->n - 1; i >= 1; --i) {
4258 if (!isl_basic_map_fast_is_equal(map->p[i-1], map->p[i]))
4260 isl_basic_map_free(map->p[i-1]);
4261 for (j = i; j < map->n; ++j)
4262 map->p[j-1] = map->p[j];
4272 struct isl_set *isl_set_normalize(struct isl_set *set)
4274 return (struct isl_set *)isl_map_normalize((struct isl_map *)set);
4277 int isl_map_fast_is_equal(struct isl_map *map1, struct isl_map *map2)
4287 if (!isl_dim_equal(map1->dim, map2->dim))
4290 map1 = isl_map_copy(map1);
4291 map2 = isl_map_copy(map2);
4292 map1 = isl_map_normalize(map1);
4293 map2 = isl_map_normalize(map2);
4296 equal = map1->n == map2->n;
4297 for (i = 0; equal && i < map1->n; ++i) {
4298 equal = isl_basic_map_fast_is_equal(map1->p[i], map2->p[i]);
4311 int isl_set_fast_is_equal(struct isl_set *set1, struct isl_set *set2)
4313 return isl_map_fast_is_equal((struct isl_map *)set1,
4314 (struct isl_map *)set2);
4317 /* Return an interval that ranges from min to max (inclusive)
4319 struct isl_basic_set *isl_basic_set_interval(struct isl_ctx *ctx,
4320 isl_int min, isl_int max)
4323 struct isl_basic_set *bset = NULL;
4325 bset = isl_basic_set_alloc(ctx, 0, 1, 0, 0, 2);
4329 k = isl_basic_set_alloc_inequality(bset);
4332 isl_int_set_si(bset->ineq[k][1], 1);
4333 isl_int_neg(bset->ineq[k][0], min);
4335 k = isl_basic_set_alloc_inequality(bset);
4338 isl_int_set_si(bset->ineq[k][1], -1);
4339 isl_int_set(bset->ineq[k][0], max);
4343 isl_basic_set_free(bset);
4347 /* Return the Cartesian product of the basic sets in list (in the given order).
4349 struct isl_basic_set *isl_basic_set_product(struct isl_basic_set_list *list)
4357 struct isl_basic_set *product = NULL;
4361 isl_assert(list->ctx, list->n > 0, goto error);
4362 isl_assert(list->ctx, list->p[0], goto error);
4363 nparam = isl_basic_set_n_param(list->p[0]);
4364 dim = isl_basic_set_n_dim(list->p[0]);
4365 extra = list->p[0]->n_div;
4366 n_eq = list->p[0]->n_eq;
4367 n_ineq = list->p[0]->n_ineq;
4368 for (i = 1; i < list->n; ++i) {
4369 isl_assert(list->ctx, list->p[i], goto error);
4370 isl_assert(list->ctx,
4371 nparam == isl_basic_set_n_param(list->p[i]), goto error);
4372 dim += isl_basic_set_n_dim(list->p[i]);
4373 extra += list->p[i]->n_div;
4374 n_eq += list->p[i]->n_eq;
4375 n_ineq += list->p[i]->n_ineq;
4377 product = isl_basic_set_alloc(list->ctx, nparam, dim, extra,
4382 for (i = 0; i < list->n; ++i) {
4383 isl_basic_set_add_constraints(product,
4384 isl_basic_set_copy(list->p[i]), dim);
4385 dim += isl_basic_set_n_dim(list->p[i]);
4387 isl_basic_set_list_free(list);
4390 isl_basic_set_free(product);
4391 isl_basic_set_list_free(list);
4395 struct isl_basic_map *isl_basic_map_product(
4396 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
4398 struct isl_dim *dim_result = NULL;
4399 struct isl_basic_map *bmap;
4400 unsigned in1, in2, out1, out2, nparam, total, pos;
4401 struct isl_dim_map *dim_map1, *dim_map2;
4403 if (!bmap1 || !bmap2)
4406 isl_assert(map1->ctx, isl_dim_match(bmap1->dim, isl_dim_param,
4407 bmap2->dim, isl_dim_param), goto error);
4408 dim_result = isl_dim_product(isl_dim_copy(bmap1->dim),
4409 isl_dim_copy(bmap2->dim));
4411 in1 = isl_basic_map_n_in(bmap1);
4412 in2 = isl_basic_map_n_in(bmap2);
4413 out1 = isl_basic_map_n_out(bmap1);
4414 out2 = isl_basic_map_n_out(bmap2);
4415 nparam = isl_basic_map_n_param(bmap1);
4417 total = nparam + in1 + in2 + out1 + out2 + bmap1->n_div + bmap2->n_div;
4418 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
4419 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
4420 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
4421 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
4422 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
4423 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos += in1);
4424 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += in2);
4425 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += out1);
4426 isl_dim_map_div(dim_map1, bmap1, pos += out2);
4427 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
4429 bmap = isl_basic_map_alloc_dim(dim_result,
4430 bmap1->n_div + bmap2->n_div,
4431 bmap1->n_eq + bmap2->n_eq,
4432 bmap1->n_ineq + bmap2->n_ineq);
4433 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
4434 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
4435 bmap = isl_basic_map_simplify(bmap);
4436 return isl_basic_map_finalize(bmap);
4438 isl_basic_map_free(bmap1);
4439 isl_basic_map_free(bmap2);
4443 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
4445 struct isl_map *isl_map_product(struct isl_map *map1, struct isl_map *map2)
4448 struct isl_map *result;
4454 isl_assert(map1->ctx, isl_dim_match(map1->dim, isl_dim_param,
4455 map2->dim, isl_dim_param), goto error);
4457 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
4458 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
4459 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
4461 result = isl_map_alloc_dim(isl_dim_product(isl_dim_copy(map1->dim),
4462 isl_dim_copy(map2->dim)),
4463 map1->n * map2->n, flags);
4466 for (i = 0; i < map1->n; ++i)
4467 for (j = 0; j < map2->n; ++j) {
4468 struct isl_basic_map *part;
4469 part = isl_basic_map_product(
4470 isl_basic_map_copy(map1->p[i]),
4471 isl_basic_map_copy(map2->p[j]));
4472 if (isl_basic_map_is_empty(part))
4473 isl_basic_map_free(part);
4475 result = isl_map_add(result, part);
4488 uint32_t isl_basic_set_get_hash(struct isl_basic_set *bset)
4496 bset = isl_basic_set_copy(bset);
4497 bset = isl_basic_set_normalize(bset);
4500 total = isl_basic_set_total_dim(bset);
4501 isl_hash_byte(hash, bset->n_eq & 0xFF);
4502 for (i = 0; i < bset->n_eq; ++i) {
4504 c_hash = isl_seq_get_hash(bset->eq[i], 1 + total);
4505 isl_hash_hash(hash, c_hash);
4507 isl_hash_byte(hash, bset->n_ineq & 0xFF);
4508 for (i = 0; i < bset->n_ineq; ++i) {
4510 c_hash = isl_seq_get_hash(bset->ineq[i], 1 + total);
4511 isl_hash_hash(hash, c_hash);
4513 isl_hash_byte(hash, bset->n_div & 0xFF);
4514 for (i = 0; i < bset->n_div; ++i) {
4516 if (isl_int_is_zero(bset->div[i][0]))
4518 isl_hash_byte(hash, i & 0xFF);
4519 c_hash = isl_seq_get_hash(bset->div[i], 1 + 1 + total);
4520 isl_hash_hash(hash, c_hash);
4522 isl_basic_set_free(bset);
4526 uint32_t isl_set_get_hash(struct isl_set *set)
4533 set = isl_set_copy(set);
4534 set = isl_set_normalize(set);
4538 hash = isl_hash_init();
4539 for (i = 0; i < set->n; ++i) {
4541 bset_hash = isl_basic_set_get_hash(set->p[i]);
4542 isl_hash_hash(hash, bset_hash);
4550 /* Check if the value for dimension dim is completely determined
4551 * by the values of the other parameters and variables.
4552 * That is, check if dimension dim is involved in an equality.
4554 int isl_basic_set_dim_is_unique(struct isl_basic_set *bset, unsigned dim)
4561 nparam = isl_basic_set_n_param(bset);
4562 for (i = 0; i < bset->n_eq; ++i)
4563 if (!isl_int_is_zero(bset->eq[i][1 + nparam + dim]))
4568 /* Check if the value for dimension dim is completely determined
4569 * by the values of the other parameters and variables.
4570 * That is, check if dimension dim is involved in an equality
4571 * for each of the subsets.
4573 int isl_set_dim_is_unique(struct isl_set *set, unsigned dim)
4579 for (i = 0; i < set->n; ++i) {
4581 unique = isl_basic_set_dim_is_unique(set->p[i], dim);