11 #include "isl_map_private.h"
12 #include "isl_map_piplib.h"
13 #include "isl_sample.h"
16 /* Maps dst positions to src positions */
22 static struct isl_dim_map *isl_dim_map_alloc(struct isl_ctx *ctx, unsigned len)
25 struct isl_dim_map *dim_map;
26 dim_map = isl_alloc(ctx, struct isl_dim_map,
27 sizeof(struct isl_dim_map) + len * sizeof(int));
30 dim_map->len = 1 + len;
32 for (i = 0; i < len; ++i)
33 dim_map->pos[1 + i] = -1;
37 static unsigned n(struct isl_dim *dim, enum isl_dim_type type)
40 case isl_dim_param: return dim->nparam;
41 case isl_dim_in: return dim->n_in;
42 case isl_dim_out: return dim->n_out;
46 static unsigned pos(struct isl_dim *dim, enum isl_dim_type type)
49 case isl_dim_param: return 1;
50 case isl_dim_in: return 1 + dim->nparam;
51 case isl_dim_out: return 1 + dim->nparam + dim->n_in;
55 static void isl_dim_map_dim(struct isl_dim_map *dim_map, struct isl_dim *dim,
56 enum isl_dim_type type, unsigned dst_pos)
64 src_pos = pos(dim, type);
65 for (i = 0; i < n(dim, type); ++i)
66 dim_map->pos[1 + dst_pos + i] = src_pos + i;
69 static void isl_dim_map_div(struct isl_dim_map *dim_map,
70 struct isl_basic_map *bmap, unsigned dst_pos)
75 if (!dim_map || !bmap)
78 src_pos = 1 + isl_dim_total(bmap->dim);
79 for (i = 0; i < bmap->n_div; ++i)
80 dim_map->pos[1 + dst_pos + i] = src_pos + i;
83 static void isl_dim_map_dump(struct isl_dim_map *dim_map)
87 for (i = 0; i < dim_map->len; ++i)
88 fprintf(stderr, "%d -> %d; ", i, dim_map->pos[i]);
89 fprintf(stderr, "\n");
92 unsigned isl_basic_map_dim(const struct isl_basic_map *bmap,
93 enum isl_dim_type type)
95 struct isl_dim *dim = bmap->dim;
99 case isl_dim_out: return isl_dim_size(bmap->dim, type);
100 case isl_dim_div: return bmap->n_div;
101 case isl_dim_all: return isl_basic_map_total_dim(bmap);
105 unsigned isl_map_dim(const struct isl_map *map, enum isl_dim_type type)
107 return n(map->dim, type);
110 unsigned isl_basic_map_offset(struct isl_basic_map *bmap,
111 enum isl_dim_type type)
113 struct isl_dim *dim = bmap->dim;
115 case isl_dim_param: return 1;
116 case isl_dim_in: return 1 + dim->nparam;
117 case isl_dim_out: return 1 + dim->nparam + dim->n_in;
118 case isl_dim_div: return 1 + dim->nparam + dim->n_in + dim->n_out;
122 static unsigned map_offset(struct isl_map *map, enum isl_dim_type type)
124 return pos(map->dim, type);
127 unsigned isl_basic_set_dim(const struct isl_basic_set *bset,
128 enum isl_dim_type type)
130 return isl_basic_map_dim((const struct isl_basic_map*)bset, type);
133 unsigned isl_basic_set_n_dim(const struct isl_basic_set *bset)
135 return bset->dim->n_out;
138 unsigned isl_basic_set_n_param(const struct isl_basic_set *bset)
140 return bset->dim->nparam;
143 unsigned isl_basic_set_total_dim(const struct isl_basic_set *bset)
145 return isl_dim_total(bset->dim) + bset->n_div;
148 unsigned isl_set_n_dim(const struct isl_set *set)
150 return set->dim->n_out;
153 unsigned isl_set_n_param(const struct isl_set *set)
155 return set->dim->nparam;
158 unsigned isl_basic_map_n_in(const struct isl_basic_map *bmap)
160 return bmap->dim->n_in;
163 unsigned isl_basic_map_n_out(const struct isl_basic_map *bmap)
165 return bmap->dim->n_out;
168 unsigned isl_basic_map_n_param(const struct isl_basic_map *bmap)
170 return bmap->dim->nparam;
173 unsigned isl_basic_map_n_div(const struct isl_basic_map *bmap)
178 unsigned isl_basic_map_total_dim(const struct isl_basic_map *bmap)
180 return isl_dim_total(bmap->dim) + bmap->n_div;
183 unsigned isl_map_n_in(const struct isl_map *map)
185 return map->dim->n_in;
188 unsigned isl_map_n_out(const struct isl_map *map)
190 return map->dim->n_out;
193 unsigned isl_map_n_param(const struct isl_map *map)
195 return map->dim->nparam;
198 int isl_map_compatible_domain(struct isl_map *map, struct isl_set *set)
200 return map->dim->n_in == set->dim->n_out &&
201 map->dim->nparam == set->dim->nparam;
204 int isl_basic_map_compatible_domain(struct isl_basic_map *bmap,
205 struct isl_basic_set *bset)
207 return bmap->dim->n_in == bset->dim->n_out &&
208 bmap->dim->nparam == bset->dim->nparam;
211 int isl_basic_map_compatible_range(struct isl_basic_map *bmap,
212 struct isl_basic_set *bset)
214 return bmap->dim->n_out == bset->dim->n_out &&
215 bmap->dim->nparam == bset->dim->nparam;
218 static struct isl_basic_map *basic_map_init(struct isl_ctx *ctx,
219 struct isl_basic_map *bmap, unsigned extra,
220 unsigned n_eq, unsigned n_ineq)
223 size_t row_size = 1 + isl_dim_total(bmap->dim) + extra;
225 bmap->block = isl_blk_alloc(ctx, (n_ineq + n_eq) * row_size);
226 if (isl_blk_is_error(bmap->block)) {
231 bmap->ineq = isl_alloc_array(ctx, isl_int *, n_ineq + n_eq);
233 isl_blk_free(ctx, bmap->block);
239 bmap->block2 = isl_blk_empty();
242 bmap->block2 = isl_blk_alloc(ctx, extra * (1 + row_size));
243 if (isl_blk_is_error(bmap->block2)) {
245 isl_blk_free(ctx, bmap->block);
250 bmap->div = isl_alloc_array(ctx, isl_int *, extra);
252 isl_blk_free(ctx, bmap->block2);
254 isl_blk_free(ctx, bmap->block);
260 for (i = 0; i < n_ineq + n_eq; ++i)
261 bmap->ineq[i] = bmap->block.data + i * row_size;
263 for (i = 0; i < extra; ++i)
264 bmap->div[i] = bmap->block2.data + i * (1 + row_size);
270 bmap->c_size = n_eq + n_ineq;
271 bmap->eq = bmap->ineq + n_ineq;
280 isl_basic_map_free(bmap);
284 struct isl_basic_set *isl_basic_set_alloc(struct isl_ctx *ctx,
285 unsigned nparam, unsigned dim, unsigned extra,
286 unsigned n_eq, unsigned n_ineq)
288 struct isl_basic_map *bmap;
289 bmap = isl_basic_map_alloc(ctx, nparam, 0, dim, extra, n_eq, n_ineq);
290 return (struct isl_basic_set *)bmap;
293 struct isl_basic_set *isl_basic_set_alloc_dim(struct isl_dim *dim,
294 unsigned extra, unsigned n_eq, unsigned n_ineq)
296 struct isl_basic_map *bmap;
299 isl_assert(dim->ctx, dim->n_in == 0, return NULL);
300 bmap = isl_basic_map_alloc_dim(dim, extra, n_eq, n_ineq);
301 return (struct isl_basic_set *)bmap;
304 struct isl_basic_map *isl_basic_map_alloc_dim(struct isl_dim *dim,
305 unsigned extra, unsigned n_eq, unsigned n_ineq)
307 struct isl_basic_map *bmap;
311 bmap = isl_alloc_type(dim->ctx, struct isl_basic_map);
316 return basic_map_init(dim->ctx, bmap, extra, n_eq, n_ineq);
322 struct isl_basic_map *isl_basic_map_alloc(struct isl_ctx *ctx,
323 unsigned nparam, unsigned in, unsigned out, unsigned extra,
324 unsigned n_eq, unsigned n_ineq)
326 struct isl_basic_map *bmap;
329 dim = isl_dim_alloc(ctx, nparam, in, out);
333 bmap = isl_basic_map_alloc_dim(dim, extra, n_eq, n_ineq);
337 static void dup_constraints(
338 struct isl_basic_map *dst, struct isl_basic_map *src)
341 unsigned total = isl_basic_map_total_dim(src);
343 for (i = 0; i < src->n_eq; ++i) {
344 int j = isl_basic_map_alloc_equality(dst);
345 isl_seq_cpy(dst->eq[j], src->eq[i], 1+total);
348 for (i = 0; i < src->n_ineq; ++i) {
349 int j = isl_basic_map_alloc_inequality(dst);
350 isl_seq_cpy(dst->ineq[j], src->ineq[i], 1+total);
353 for (i = 0; i < src->n_div; ++i) {
354 int j = isl_basic_map_alloc_div(dst);
355 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total);
357 ISL_F_SET(dst, ISL_BASIC_SET_FINAL);
360 struct isl_basic_map *isl_basic_map_dup(struct isl_basic_map *bmap)
362 struct isl_basic_map *dup;
366 dup = isl_basic_map_alloc_dim(isl_dim_copy(bmap->dim),
367 bmap->n_div, bmap->n_eq, bmap->n_ineq);
370 dup->flags = bmap->flags;
371 dup_constraints(dup, bmap);
372 dup->sample = isl_vec_copy(bmap->ctx, bmap->sample);
376 struct isl_basic_set *isl_basic_set_dup(struct isl_basic_set *bset)
378 struct isl_basic_map *dup;
380 dup = isl_basic_map_dup((struct isl_basic_map *)bset);
381 return (struct isl_basic_set *)dup;
384 struct isl_basic_set *isl_basic_set_copy(struct isl_basic_set *bset)
389 if (ISL_F_ISSET(bset, ISL_BASIC_SET_FINAL)) {
393 return isl_basic_set_dup(bset);
396 struct isl_set *isl_set_copy(struct isl_set *set)
405 struct isl_basic_map *isl_basic_map_copy(struct isl_basic_map *bmap)
410 if (ISL_F_ISSET(bmap, ISL_BASIC_SET_FINAL)) {
414 return isl_basic_map_dup(bmap);
417 struct isl_map *isl_map_copy(struct isl_map *map)
426 void isl_basic_map_free(struct isl_basic_map *bmap)
434 isl_ctx_deref(bmap->ctx);
436 isl_blk_free(bmap->ctx, bmap->block2);
438 isl_blk_free(bmap->ctx, bmap->block);
439 isl_vec_free(bmap->ctx, bmap->sample);
440 isl_dim_free(bmap->dim);
444 void isl_basic_set_free(struct isl_basic_set *bset)
446 isl_basic_map_free((struct isl_basic_map *)bset);
449 int isl_basic_map_alloc_equality(struct isl_basic_map *bmap)
455 isl_assert(ctx, bmap->n_eq + bmap->n_ineq < bmap->c_size, return -1);
456 isl_assert(ctx, (bmap->eq - bmap->ineq) + bmap->n_eq <= bmap->c_size,
458 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
459 if ((bmap->eq - bmap->ineq) + bmap->n_eq == bmap->c_size) {
461 int j = isl_basic_map_alloc_inequality(bmap);
465 bmap->ineq[j] = bmap->ineq[bmap->n_ineq - 1];
466 bmap->ineq[bmap->n_ineq - 1] = bmap->eq[-1];
473 isl_seq_clr(bmap->eq[bmap->n_eq] + 1 + isl_basic_map_total_dim(bmap),
474 bmap->extra - bmap->n_div);
478 int isl_basic_set_alloc_equality(struct isl_basic_set *bset)
480 return isl_basic_map_alloc_equality((struct isl_basic_map *)bset);
483 int isl_basic_map_free_equality(struct isl_basic_map *bmap, unsigned n)
487 isl_assert(bmap->ctx, n <= bmap->n_eq, return -1);
492 int isl_basic_map_drop_equality(struct isl_basic_map *bmap, unsigned pos)
497 isl_assert(bmap->ctx, pos < bmap->n_eq, return -1);
499 if (pos != bmap->n_eq - 1) {
501 bmap->eq[pos] = bmap->eq[bmap->n_eq - 1];
502 bmap->eq[bmap->n_eq - 1] = t;
508 int isl_basic_set_drop_equality(struct isl_basic_set *bset, unsigned pos)
510 return isl_basic_map_drop_equality((struct isl_basic_map *)bset, pos);
513 void isl_basic_map_inequality_to_equality(
514 struct isl_basic_map *bmap, unsigned pos)
519 bmap->ineq[pos] = bmap->ineq[bmap->n_ineq - 1];
520 bmap->ineq[bmap->n_ineq - 1] = bmap->eq[-1];
525 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
526 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
527 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
530 int isl_basic_map_alloc_inequality(struct isl_basic_map *bmap)
536 isl_assert(ctx, bmap->n_ineq < bmap->eq - bmap->ineq, return -1);
537 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_IMPLICIT);
538 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
539 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
540 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
541 isl_seq_clr(bmap->ineq[bmap->n_ineq] +
542 1 + isl_basic_map_total_dim(bmap),
543 bmap->extra - bmap->n_div);
544 return bmap->n_ineq++;
547 int isl_basic_set_alloc_inequality(struct isl_basic_set *bset)
549 return isl_basic_map_alloc_inequality((struct isl_basic_map *)bset);
552 int isl_basic_map_free_inequality(struct isl_basic_map *bmap, unsigned n)
556 isl_assert(bmap->ctx, n <= bmap->n_ineq, return -1);
561 int isl_basic_set_free_inequality(struct isl_basic_set *bset, unsigned n)
563 return isl_basic_map_free_inequality((struct isl_basic_map *)bset, n);
566 int isl_basic_map_drop_inequality(struct isl_basic_map *bmap, unsigned pos)
571 isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
573 if (pos != bmap->n_ineq - 1) {
575 bmap->ineq[pos] = bmap->ineq[bmap->n_ineq - 1];
576 bmap->ineq[bmap->n_ineq - 1] = t;
577 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
583 int isl_basic_set_drop_inequality(struct isl_basic_set *bset, unsigned pos)
585 return isl_basic_map_drop_inequality((struct isl_basic_map *)bset, pos);
588 int isl_basic_map_alloc_div(struct isl_basic_map *bmap)
592 isl_assert(bmap->ctx, bmap->n_div < bmap->extra, return -1);
593 isl_seq_clr(bmap->div[bmap->n_div] +
594 1 + 1 + isl_basic_map_total_dim(bmap),
595 bmap->extra - bmap->n_div);
596 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
597 return bmap->n_div++;
600 int isl_basic_map_free_div(struct isl_basic_map *bmap, unsigned n)
604 isl_assert(bmap->ctx, n <= bmap->n_div, return -1);
609 /* Copy constraint from src to dst, putting the vars of src at offset
610 * dim_off in dst and the divs of src at offset div_off in dst.
611 * If both sets are actually map, then dim_off applies to the input
614 static void copy_constraint(struct isl_basic_map *dst_map, isl_int *dst,
615 struct isl_basic_map *src_map, isl_int *src,
616 unsigned in_off, unsigned out_off, unsigned div_off)
618 unsigned src_nparam = isl_basic_map_n_param(src_map);
619 unsigned dst_nparam = isl_basic_map_n_param(dst_map);
620 unsigned src_in = isl_basic_map_n_in(src_map);
621 unsigned dst_in = isl_basic_map_n_in(dst_map);
622 unsigned src_out = isl_basic_map_n_out(src_map);
623 unsigned dst_out = isl_basic_map_n_out(dst_map);
624 isl_int_set(dst[0], src[0]);
625 isl_seq_cpy(dst+1, src+1, isl_min(dst_nparam, src_nparam));
626 if (dst_nparam > src_nparam)
627 isl_seq_clr(dst+1+src_nparam,
628 dst_nparam - src_nparam);
629 isl_seq_clr(dst+1+dst_nparam, in_off);
630 isl_seq_cpy(dst+1+dst_nparam+in_off,
632 isl_min(dst_in-in_off, src_in));
633 if (dst_in-in_off > src_in)
634 isl_seq_clr(dst+1+dst_nparam+in_off+src_in,
635 dst_in - in_off - src_in);
636 isl_seq_clr(dst+1+dst_nparam+dst_in, out_off);
637 isl_seq_cpy(dst+1+dst_nparam+dst_in+out_off,
638 src+1+src_nparam+src_in,
639 isl_min(dst_out-out_off, src_out));
640 if (dst_out-out_off > src_out)
641 isl_seq_clr(dst+1+dst_nparam+dst_in+out_off+src_out,
642 dst_out - out_off - src_out);
643 isl_seq_clr(dst+1+dst_nparam+dst_in+dst_out, div_off);
644 isl_seq_cpy(dst+1+dst_nparam+dst_in+dst_out+div_off,
645 src+1+src_nparam+src_in+src_out,
646 isl_min(dst_map->extra-div_off, src_map->n_div));
647 if (dst_map->n_div-div_off > src_map->n_div)
648 isl_seq_clr(dst+1+dst_nparam+dst_in+dst_out+
649 div_off+src_map->n_div,
650 dst_map->n_div - div_off - src_map->n_div);
653 static void copy_div(struct isl_basic_map *dst_map, isl_int *dst,
654 struct isl_basic_map *src_map, isl_int *src,
655 unsigned in_off, unsigned out_off, unsigned div_off)
657 isl_int_set(dst[0], src[0]);
658 copy_constraint(dst_map, dst+1, src_map, src+1, in_off, out_off, div_off);
661 static struct isl_basic_map *add_constraints(struct isl_basic_map *bmap1,
662 struct isl_basic_map *bmap2, unsigned i_pos, unsigned o_pos)
667 if (!bmap1 || !bmap2)
670 div_off = bmap1->n_div;
672 for (i = 0; i < bmap2->n_eq; ++i) {
673 int i1 = isl_basic_map_alloc_equality(bmap1);
676 copy_constraint(bmap1, bmap1->eq[i1], bmap2, bmap2->eq[i],
677 i_pos, o_pos, div_off);
680 for (i = 0; i < bmap2->n_ineq; ++i) {
681 int i1 = isl_basic_map_alloc_inequality(bmap1);
684 copy_constraint(bmap1, bmap1->ineq[i1], bmap2, bmap2->ineq[i],
685 i_pos, o_pos, div_off);
688 for (i = 0; i < bmap2->n_div; ++i) {
689 int i1 = isl_basic_map_alloc_div(bmap1);
692 copy_div(bmap1, bmap1->div[i1], bmap2, bmap2->div[i],
693 i_pos, o_pos, div_off);
696 isl_basic_map_free(bmap2);
701 isl_basic_map_free(bmap1);
702 isl_basic_map_free(bmap2);
706 static void copy_constraint_dim_map(isl_int *dst, isl_int *src,
707 struct isl_dim_map *dim_map)
711 for (i = 0; i < dim_map->len; ++i) {
712 if (dim_map->pos[i] < 0)
713 isl_int_set_si(dst[i], 0);
715 isl_int_set(dst[i], src[dim_map->pos[i]]);
719 static void copy_div_dim_map(isl_int *dst, isl_int *src,
720 struct isl_dim_map *dim_map)
722 isl_int_set(dst[0], src[0]);
723 copy_constraint_dim_map(dst+1, src+1, dim_map);
726 static struct isl_basic_map *add_constraints_dim_map(struct isl_basic_map *dst,
727 struct isl_basic_map *src, struct isl_dim_map *dim_map)
731 if (!src || !dst || !dim_map)
734 for (i = 0; i < src->n_eq; ++i) {
735 int i1 = isl_basic_map_alloc_equality(dst);
738 copy_constraint_dim_map(dst->eq[i1], src->eq[i], dim_map);
741 for (i = 0; i < src->n_ineq; ++i) {
742 int i1 = isl_basic_map_alloc_inequality(dst);
745 copy_constraint_dim_map(dst->ineq[i1], src->ineq[i], dim_map);
748 for (i = 0; i < src->n_div; ++i) {
749 int i1 = isl_basic_map_alloc_div(dst);
752 copy_div_dim_map(dst->div[i1], src->div[i], dim_map);
756 isl_basic_map_free(src);
761 isl_basic_map_free(src);
762 isl_basic_map_free(dst);
766 struct isl_basic_set *isl_basic_set_add_constraints(struct isl_basic_set *bset1,
767 struct isl_basic_set *bset2, unsigned pos)
769 return (struct isl_basic_set *)
770 add_constraints((struct isl_basic_map *)bset1,
771 (struct isl_basic_map *)bset2, 0, pos);
774 struct isl_basic_map *isl_basic_map_extend_dim(struct isl_basic_map *base,
775 struct isl_dim *dim, unsigned extra,
776 unsigned n_eq, unsigned n_ineq)
778 struct isl_basic_map *ext;
785 base = isl_basic_map_cow(base);
789 dims_ok = isl_dim_equal(base->dim, dim) &&
790 base->extra >= base->n_div + extra;
792 if (dims_ok && n_eq == 0 && n_ineq == 0) {
797 isl_assert(base->ctx, base->dim->nparam <= dim->nparam, goto error);
798 isl_assert(base->ctx, base->dim->n_in <= dim->n_in, goto error);
799 isl_assert(base->ctx, base->dim->n_out <= dim->n_out, goto error);
800 extra += base->extra;
802 n_ineq += base->n_ineq;
804 ext = isl_basic_map_alloc_dim(dim, extra, n_eq, n_ineq);
810 ext = add_constraints(ext, base, 0, 0);
813 ISL_F_CLR(ext, ISL_BASIC_SET_FINAL);
820 isl_basic_map_free(base);
824 struct isl_basic_set *isl_basic_set_extend_dim(struct isl_basic_set *base,
825 struct isl_dim *dim, unsigned extra,
826 unsigned n_eq, unsigned n_ineq)
828 return (struct isl_basic_set *)
829 isl_basic_map_extend_dim((struct isl_basic_map *)base, dim,
830 extra, n_eq, n_ineq);
833 struct isl_basic_map *isl_basic_map_extend_constraints(
834 struct isl_basic_map *base, unsigned n_eq, unsigned n_ineq)
838 return isl_basic_map_extend_dim(base, isl_dim_copy(base->dim),
842 struct isl_basic_map *isl_basic_map_extend(struct isl_basic_map *base,
843 unsigned nparam, unsigned n_in, unsigned n_out, unsigned extra,
844 unsigned n_eq, unsigned n_ineq)
846 struct isl_basic_map *bmap;
851 dim = isl_dim_alloc(base->ctx, nparam, n_in, n_out);
855 bmap = isl_basic_map_extend_dim(base, dim, extra, n_eq, n_ineq);
859 struct isl_basic_set *isl_basic_set_extend(struct isl_basic_set *base,
860 unsigned nparam, unsigned dim, unsigned extra,
861 unsigned n_eq, unsigned n_ineq)
863 return (struct isl_basic_set *)
864 isl_basic_map_extend((struct isl_basic_map *)base,
865 nparam, 0, dim, extra, n_eq, n_ineq);
868 struct isl_basic_set *isl_basic_set_extend_constraints(
869 struct isl_basic_set *base, unsigned n_eq, unsigned n_ineq)
871 return (struct isl_basic_set *)
872 isl_basic_map_extend_constraints((struct isl_basic_map *)base,
876 struct isl_basic_set *isl_basic_set_cow(struct isl_basic_set *bset)
878 return (struct isl_basic_set *)
879 isl_basic_map_cow((struct isl_basic_map *)bset);
882 struct isl_basic_map *isl_basic_map_cow(struct isl_basic_map *bmap)
889 bmap = isl_basic_map_dup(bmap);
891 ISL_F_CLR(bmap, ISL_BASIC_SET_FINAL);
895 struct isl_set *isl_set_cow(struct isl_set *set)
903 return isl_set_dup(set);
906 struct isl_map *isl_map_cow(struct isl_map *map)
914 return isl_map_dup(map);
917 static void swap_vars(struct isl_blk blk, isl_int *a,
918 unsigned a_len, unsigned b_len)
920 isl_seq_cpy(blk.data, a+a_len, b_len);
921 isl_seq_cpy(blk.data+b_len, a, a_len);
922 isl_seq_cpy(a, blk.data, b_len+a_len);
925 struct isl_basic_set *isl_basic_set_swap_vars(
926 struct isl_basic_set *bset, unsigned n)
936 nparam = isl_basic_set_n_param(bset);
937 dim = isl_basic_set_n_dim(bset);
938 isl_assert(bset->ctx, n <= dim, goto error);
943 bset = isl_basic_set_cow(bset);
947 blk = isl_blk_alloc(bset->ctx, dim);
948 if (isl_blk_is_error(blk))
951 for (i = 0; i < bset->n_eq; ++i)
953 bset->eq[i]+1+nparam, n, dim - n);
955 for (i = 0; i < bset->n_ineq; ++i)
957 bset->ineq[i]+1+nparam, n, dim - n);
959 for (i = 0; i < bset->n_div; ++i)
961 bset->div[i]+1+1+nparam, n, dim - n);
963 isl_blk_free(bset->ctx, blk);
965 ISL_F_CLR(bset, ISL_BASIC_SET_NORMALIZED);
969 isl_basic_set_free(bset);
973 struct isl_set *isl_set_swap_vars(struct isl_set *set, unsigned n)
976 set = isl_set_cow(set);
980 for (i = 0; i < set->n; ++i) {
981 set->p[i] = isl_basic_set_swap_vars(set->p[i], n);
987 ISL_F_CLR(set, ISL_SET_NORMALIZED);
991 struct isl_basic_map *isl_basic_map_set_to_empty(struct isl_basic_map *bmap)
997 total = isl_basic_map_total_dim(bmap);
998 isl_basic_map_free_div(bmap, bmap->n_div);
999 isl_basic_map_free_inequality(bmap, bmap->n_ineq);
1001 isl_basic_map_free_equality(bmap, bmap->n_eq-1);
1003 isl_basic_map_alloc_equality(bmap);
1007 isl_int_set_si(bmap->eq[i][0], 1);
1008 isl_seq_clr(bmap->eq[i]+1, total);
1009 ISL_F_SET(bmap, ISL_BASIC_MAP_EMPTY);
1010 return isl_basic_map_finalize(bmap);
1012 isl_basic_map_free(bmap);
1016 struct isl_basic_set *isl_basic_set_set_to_empty(struct isl_basic_set *bset)
1018 return (struct isl_basic_set *)
1019 isl_basic_map_set_to_empty((struct isl_basic_map *)bset);
1022 static void swap_div(struct isl_basic_map *bmap, int a, int b)
1025 unsigned off = isl_dim_total(bmap->dim);
1026 isl_int *t = bmap->div[a];
1027 bmap->div[a] = bmap->div[b];
1030 for (i = 0; i < bmap->n_eq; ++i)
1031 isl_int_swap(bmap->eq[i][1+off+a], bmap->eq[i][1+off+b]);
1033 for (i = 0; i < bmap->n_ineq; ++i)
1034 isl_int_swap(bmap->ineq[i][1+off+a], bmap->ineq[i][1+off+b]);
1036 for (i = 0; i < bmap->n_div; ++i)
1037 isl_int_swap(bmap->div[i][1+1+off+a], bmap->div[i][1+1+off+b]);
1038 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1041 /* Eliminate the specified n dimensions starting at first from the
1042 * constraints using Fourier-Motzkin, The dimensions themselves
1045 struct isl_set *isl_set_eliminate_dims(struct isl_set *set,
1046 unsigned first, unsigned n)
1056 set = isl_set_cow(set);
1059 isl_assert(set->ctx, first+n <= isl_set_n_dim(set), goto error);
1060 nparam = isl_set_n_param(set);
1062 for (i = 0; i < set->n; ++i) {
1063 set->p[i] = isl_basic_set_eliminate_vars(set->p[i],
1074 /* Project out n dimensions starting at first using Fourier-Motzkin */
1075 struct isl_set *isl_set_remove_dims(struct isl_set *set,
1076 unsigned first, unsigned n)
1078 set = isl_set_eliminate_dims(set, first, n);
1079 set = isl_set_drop_dims(set, first, n);
1083 struct isl_basic_set *isl_basic_set_remove_divs(struct isl_basic_set *bset)
1085 bset = isl_basic_set_eliminate_vars(bset, isl_dim_total(bset->dim),
1093 struct isl_set *isl_set_remove_divs(struct isl_set *set)
1102 set = isl_set_cow(set);
1106 for (i = 0; i < set->n; ++i) {
1107 set->p[i] = isl_basic_set_remove_divs(set->p[i]);
1117 struct isl_basic_map *isl_basic_map_remove(struct isl_basic_map *bmap,
1118 enum isl_dim_type type, unsigned first, unsigned n)
1122 isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
1126 bmap = isl_basic_map_eliminate_vars(bmap,
1127 isl_basic_map_offset(bmap, type) - 1 + first, n);
1128 bmap = isl_basic_map_drop(bmap, type, first, n);
1131 isl_basic_map_free(bmap);
1135 struct isl_map *isl_map_remove(struct isl_map *map,
1136 enum isl_dim_type type, unsigned first, unsigned n)
1144 map = isl_map_cow(map);
1147 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
1149 for (i = 0; i < map->n; ++i) {
1150 map->p[i] = isl_basic_map_eliminate_vars(map->p[i],
1151 isl_basic_map_offset(map->p[i], type) - 1 + first, n);
1155 map = isl_map_drop(map, type, first, n);
1162 /* Project out n inputs starting at first using Fourier-Motzkin */
1163 struct isl_map *isl_map_remove_inputs(struct isl_map *map,
1164 unsigned first, unsigned n)
1166 return isl_map_remove(map, isl_dim_in, first, n);
1169 /* Project out n dimensions starting at first using Fourier-Motzkin */
1170 struct isl_basic_set *isl_basic_set_remove_dims(struct isl_basic_set *bset,
1171 unsigned first, unsigned n)
1173 unsigned nparam = isl_basic_set_n_param(bset);
1174 bset = isl_basic_set_eliminate_vars(bset, nparam + first, n);
1175 bset = isl_basic_set_drop_dims(bset, first, n);
1179 static void dump_term(struct isl_basic_map *bmap,
1180 isl_int c, int pos, FILE *out)
1183 unsigned in = isl_basic_map_n_in(bmap);
1184 unsigned dim = in + isl_basic_map_n_out(bmap);
1185 unsigned nparam = isl_basic_map_n_param(bmap);
1187 isl_int_print(out, c, 0);
1189 if (!isl_int_is_one(c))
1190 isl_int_print(out, c, 0);
1191 if (pos < 1 + nparam) {
1192 name = isl_dim_get_name(bmap->dim,
1193 isl_dim_param, pos - 1);
1195 fprintf(out, "%s", name);
1197 fprintf(out, "p%d", pos - 1);
1198 } else if (pos < 1 + nparam + in)
1199 fprintf(out, "i%d", pos - 1 - nparam);
1200 else if (pos < 1 + nparam + dim)
1201 fprintf(out, "o%d", pos - 1 - nparam - in);
1203 fprintf(out, "e%d", pos - 1 - nparam - dim);
1207 static void dump_constraint_sign(struct isl_basic_map *bmap, isl_int *c,
1208 int sign, FILE *out)
1212 unsigned len = 1 + isl_basic_map_total_dim(bmap);
1216 for (i = 0, first = 1; i < len; ++i) {
1217 if (isl_int_sgn(c[i]) * sign <= 0)
1220 fprintf(out, " + ");
1222 isl_int_abs(v, c[i]);
1223 dump_term(bmap, v, i, out);
1230 static void dump_constraint(struct isl_basic_map *bmap, isl_int *c,
1231 const char *op, FILE *out, int indent)
1235 fprintf(out, "%*s", indent, "");
1237 dump_constraint_sign(bmap, c, 1, out);
1238 fprintf(out, " %s ", op);
1239 dump_constraint_sign(bmap, c, -1, out);
1243 for (i = bmap->n_div; i < bmap->extra; ++i) {
1244 if (isl_int_is_zero(c[1+isl_dim_total(bmap->dim)+i]))
1246 fprintf(out, "%*s", indent, "");
1247 fprintf(out, "ERROR: unused div coefficient not zero\n");
1252 static void dump_constraints(struct isl_basic_map *bmap,
1253 isl_int **c, unsigned n,
1254 const char *op, FILE *out, int indent)
1258 for (i = 0; i < n; ++i)
1259 dump_constraint(bmap, c[i], op, out, indent);
1262 static void dump_affine(struct isl_basic_map *bmap, isl_int *exp, FILE *out)
1266 unsigned total = isl_basic_map_total_dim(bmap);
1268 for (j = 0; j < 1 + total; ++j) {
1269 if (isl_int_is_zero(exp[j]))
1271 if (!first && isl_int_is_pos(exp[j]))
1273 dump_term(bmap, exp[j], j, out);
1278 static void dump(struct isl_basic_map *bmap, FILE *out, int indent)
1282 dump_constraints(bmap, bmap->eq, bmap->n_eq, "=", out, indent);
1283 dump_constraints(bmap, bmap->ineq, bmap->n_ineq, ">=", out, indent);
1285 for (i = 0; i < bmap->n_div; ++i) {
1286 fprintf(out, "%*s", indent, "");
1287 fprintf(out, "e%d = [(", i);
1288 dump_affine(bmap, bmap->div[i]+1, out);
1290 isl_int_print(out, bmap->div[i][0], 0);
1291 fprintf(out, "]\n");
1295 void isl_basic_set_dump(struct isl_basic_set *bset, FILE *out, int indent)
1298 fprintf(out, "null basic set\n");
1302 fprintf(out, "%*s", indent, "");
1303 fprintf(out, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n",
1304 bset->ref, bset->dim->nparam, bset->dim->n_out,
1305 bset->extra, bset->flags);
1306 dump((struct isl_basic_map *)bset, out, indent);
1309 void isl_basic_map_dump(struct isl_basic_map *bmap, FILE *out, int indent)
1312 fprintf(out, "null basic map\n");
1316 fprintf(out, "%*s", indent, "");
1317 fprintf(out, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, "
1318 "flags: %x, n_name: %d\n",
1320 bmap->dim->nparam, bmap->dim->n_in, bmap->dim->n_out,
1321 bmap->extra, bmap->flags, bmap->dim->n_name);
1322 dump(bmap, out, indent);
1325 int isl_inequality_negate(struct isl_basic_map *bmap, unsigned pos)
1330 total = isl_basic_map_total_dim(bmap);
1331 isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
1332 isl_seq_neg(bmap->ineq[pos], bmap->ineq[pos], 1 + total);
1333 isl_int_sub_ui(bmap->ineq[pos][0], bmap->ineq[pos][0], 1);
1334 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1338 struct isl_set *isl_set_alloc_dim(struct isl_dim *dim, int n, unsigned flags)
1340 struct isl_set *set;
1344 isl_assert(dim->ctx, dim->n_in == 0, return NULL);
1345 isl_assert(dim->ctx, n >= 0, return NULL);
1346 set = isl_alloc(dim->ctx, struct isl_set,
1347 sizeof(struct isl_set) +
1348 n * sizeof(struct isl_basic_set *));
1352 set->ctx = dim->ctx;
1353 isl_ctx_ref(set->ctx);
1365 struct isl_set *isl_set_alloc(struct isl_ctx *ctx,
1366 unsigned nparam, unsigned dim, int n, unsigned flags)
1368 struct isl_set *set;
1369 struct isl_dim *dims;
1371 dims = isl_dim_alloc(ctx, nparam, 0, dim);
1375 set = isl_set_alloc_dim(dims, n, flags);
1379 struct isl_set *isl_set_dup(struct isl_set *set)
1382 struct isl_set *dup;
1387 dup = isl_set_alloc_dim(isl_dim_copy(set->dim), set->n, set->flags);
1390 for (i = 0; i < set->n; ++i)
1391 dup = isl_set_add(dup, isl_basic_set_copy(set->p[i]));
1395 struct isl_set *isl_set_from_basic_set(struct isl_basic_set *bset)
1397 struct isl_set *set;
1402 set = isl_set_alloc_dim(isl_dim_copy(bset->dim), 1, ISL_MAP_DISJOINT);
1404 isl_basic_set_free(bset);
1407 return isl_set_add(set, bset);
1410 struct isl_map *isl_map_from_basic_map(struct isl_basic_map *bmap)
1412 struct isl_map *map;
1417 map = isl_map_alloc_dim(isl_dim_copy(bmap->dim), 1, ISL_MAP_DISJOINT);
1419 isl_basic_map_free(bmap);
1422 return isl_map_add(map, bmap);
1425 struct isl_set *isl_set_add(struct isl_set *set, struct isl_basic_set *bset)
1429 isl_assert(set->ctx, isl_dim_equal(set->dim, bset->dim), goto error);
1430 isl_assert(set->ctx, set->n < set->size, goto error);
1431 set->p[set->n] = bset;
1438 isl_basic_set_free(bset);
1442 void isl_set_free(struct isl_set *set)
1452 isl_ctx_deref(set->ctx);
1453 for (i = 0; i < set->n; ++i)
1454 isl_basic_set_free(set->p[i]);
1455 isl_dim_free(set->dim);
1459 void isl_set_dump(struct isl_set *set, FILE *out, int indent)
1464 fprintf(out, "null set\n");
1468 fprintf(out, "%*s", indent, "");
1469 fprintf(out, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
1470 set->ref, set->n, set->dim->nparam, set->dim->n_out,
1472 for (i = 0; i < set->n; ++i) {
1473 fprintf(out, "%*s", indent, "");
1474 fprintf(out, "basic set %d:\n", i);
1475 isl_basic_set_dump(set->p[i], out, indent+4);
1479 void isl_map_dump(struct isl_map *map, FILE *out, int indent)
1484 fprintf(out, "null map\n");
1488 fprintf(out, "%*s", indent, "");
1489 fprintf(out, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, "
1490 "flags: %x, n_name: %d\n",
1491 map->ref, map->n, map->dim->nparam, map->dim->n_in,
1492 map->dim->n_out, map->flags, map->dim->n_name);
1493 for (i = 0; i < map->n; ++i) {
1494 fprintf(out, "%*s", indent, "");
1495 fprintf(out, "basic map %d:\n", i);
1496 isl_basic_map_dump(map->p[i], out, indent+4);
1500 struct isl_basic_map *isl_basic_map_intersect_domain(
1501 struct isl_basic_map *bmap, struct isl_basic_set *bset)
1503 struct isl_basic_map *bmap_domain;
1504 struct isl_dim *dim;
1509 isl_assert(bset->ctx, isl_dim_match(bmap->dim, isl_dim_param,
1510 bset->dim, isl_dim_param), goto error);
1512 if (isl_dim_size(bset->dim, isl_dim_set) != 0)
1513 isl_assert(bset->ctx,
1514 isl_basic_map_compatible_domain(bmap, bset), goto error);
1516 bmap = isl_basic_map_extend_dim(bmap, isl_dim_copy(bmap->dim),
1517 bset->n_div, bset->n_eq, bset->n_ineq);
1520 dim = isl_dim_reverse(isl_dim_copy(bset->dim));
1521 bmap_domain = isl_basic_map_from_basic_set(bset, dim);
1522 bmap = add_constraints(bmap, bmap_domain, 0, 0);
1524 bmap = isl_basic_map_simplify(bmap);
1525 return isl_basic_map_finalize(bmap);
1527 isl_basic_map_free(bmap);
1528 isl_basic_set_free(bset);
1532 struct isl_basic_map *isl_basic_map_intersect_range(
1533 struct isl_basic_map *bmap, struct isl_basic_set *bset)
1535 struct isl_basic_map *bmap_range;
1540 isl_assert(bset->ctx, isl_dim_match(bmap->dim, isl_dim_param,
1541 bset->dim, isl_dim_param), goto error);
1543 if (isl_dim_size(bset->dim, isl_dim_set) != 0)
1544 isl_assert(bset->ctx,
1545 isl_basic_map_compatible_range(bmap, bset), goto error);
1547 bmap = isl_basic_map_extend_dim(bmap, isl_dim_copy(bmap->dim),
1548 bset->n_div, bset->n_eq, bset->n_ineq);
1551 bmap_range = isl_basic_map_from_basic_set(bset, isl_dim_copy(bset->dim));
1552 bmap = add_constraints(bmap, bmap_range, 0, 0);
1554 bmap = isl_basic_map_simplify(bmap);
1555 return isl_basic_map_finalize(bmap);
1557 isl_basic_map_free(bmap);
1558 isl_basic_set_free(bset);
1562 static int basic_map_contains(struct isl_basic_map *bmap, struct isl_vec *vec)
1568 total = 1 + isl_basic_map_total_dim(bmap);
1569 if (total != vec->size)
1574 for (i = 0; i < bmap->n_eq; ++i) {
1575 isl_seq_inner_product(vec->block.data, bmap->eq[i], total, &s);
1576 if (!isl_int_is_zero(s)) {
1582 for (i = 0; i < bmap->n_ineq; ++i) {
1583 isl_seq_inner_product(vec->block.data, bmap->ineq[i], total, &s);
1584 if (isl_int_is_neg(s)) {
1595 struct isl_basic_map *isl_basic_map_intersect(
1596 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
1598 struct isl_vec *sample = NULL;
1600 if (!bmap1 || !bmap2)
1603 isl_assert(bmap1->ctx, isl_dim_match(bmap1->dim, isl_dim_param,
1604 bmap2->dim, isl_dim_param), goto error);
1605 if (isl_dim_total(bmap1->dim) ==
1606 isl_dim_size(bmap1->dim, isl_dim_param) &&
1607 isl_dim_total(bmap2->dim) !=
1608 isl_dim_size(bmap2->dim, isl_dim_param))
1609 return isl_basic_map_intersect(bmap2, bmap1);
1611 if (isl_dim_total(bmap2->dim) !=
1612 isl_dim_size(bmap2->dim, isl_dim_param))
1613 isl_assert(bmap1->ctx,
1614 isl_dim_equal(bmap1->dim, bmap2->dim), goto error);
1616 if (bmap1->sample &&
1617 basic_map_contains(bmap1, bmap1->sample) > 0 &&
1618 basic_map_contains(bmap2, bmap1->sample) > 0)
1619 sample = isl_vec_copy(bmap1->ctx, bmap1->sample);
1620 else if (bmap2->sample &&
1621 basic_map_contains(bmap1, bmap2->sample) > 0 &&
1622 basic_map_contains(bmap2, bmap2->sample) > 0)
1623 sample = isl_vec_copy(bmap2->ctx, bmap2->sample);
1625 bmap1 = isl_basic_map_extend_dim(bmap1, isl_dim_copy(bmap1->dim),
1626 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
1629 bmap1 = add_constraints(bmap1, bmap2, 0, 0);
1632 isl_vec_free(bmap1->ctx, bmap1->sample);
1633 bmap1->sample = sample;
1636 bmap1 = isl_basic_map_simplify(bmap1);
1637 return isl_basic_map_finalize(bmap1);
1640 isl_vec_free(bmap1->ctx, sample);
1641 isl_basic_map_free(bmap1);
1642 isl_basic_map_free(bmap2);
1646 struct isl_basic_set *isl_basic_set_intersect(
1647 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
1649 return (struct isl_basic_set *)
1650 isl_basic_map_intersect(
1651 (struct isl_basic_map *)bset1,
1652 (struct isl_basic_map *)bset2);
1655 struct isl_map *isl_map_intersect(struct isl_map *map1, struct isl_map *map2)
1658 struct isl_map *result;
1664 isl_assert(map1->ctx, isl_dim_match(map1->dim, isl_dim_param,
1665 map2->dim, isl_dim_param), goto error);
1666 if (isl_dim_total(map1->dim) ==
1667 isl_dim_size(map1->dim, isl_dim_param) &&
1668 isl_dim_total(map2->dim) != isl_dim_size(map2->dim, isl_dim_param))
1669 return isl_map_intersect(map2, map1);
1671 if (isl_dim_total(map2->dim) != isl_dim_size(map2->dim, isl_dim_param))
1672 isl_assert(map1->ctx,
1673 isl_dim_equal(map1->dim, map2->dim), goto error);
1675 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
1676 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
1677 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
1679 result = isl_map_alloc_dim(isl_dim_copy(map1->dim),
1680 map1->n * map2->n, flags);
1683 for (i = 0; i < map1->n; ++i)
1684 for (j = 0; j < map2->n; ++j) {
1685 struct isl_basic_map *part;
1686 part = isl_basic_map_intersect(
1687 isl_basic_map_copy(map1->p[i]),
1688 isl_basic_map_copy(map2->p[j]));
1689 if (isl_basic_map_is_empty(part))
1690 isl_basic_map_free(part);
1692 result = isl_map_add(result, part);
1705 struct isl_set *isl_set_intersect(struct isl_set *set1, struct isl_set *set2)
1707 return (struct isl_set *)
1708 isl_map_intersect((struct isl_map *)set1,
1709 (struct isl_map *)set2);
1712 struct isl_basic_map *isl_basic_map_reverse(struct isl_basic_map *bmap)
1714 struct isl_dim *dim;
1715 struct isl_basic_set *bset;
1720 bmap = isl_basic_map_cow(bmap);
1723 dim = isl_dim_reverse(isl_dim_copy(bmap->dim));
1724 in = isl_basic_map_n_in(bmap);
1725 bset = isl_basic_set_from_basic_map(bmap);
1726 bset = isl_basic_set_swap_vars(bset, in);
1727 return isl_basic_map_from_basic_set(bset, dim);
1730 /* Turn final n dimensions into existentially quantified variables.
1732 struct isl_basic_set *isl_basic_set_project_out(
1733 struct isl_basic_set *bset, unsigned n, unsigned flags)
1743 isl_assert(bset->ctx, n <= isl_basic_set_n_dim(bset), goto error);
1748 bset = isl_basic_set_cow(bset);
1750 row_size = 1 + isl_dim_total(bset->dim) + bset->extra;
1751 old = bset->block2.data;
1752 bset->block2 = isl_blk_extend(bset->ctx, bset->block2,
1753 (bset->extra + n) * (1 + row_size));
1754 if (!bset->block2.data)
1756 new_div = isl_alloc_array(ctx, isl_int *, bset->extra + n);
1759 for (i = 0; i < n; ++i) {
1760 new_div[i] = bset->block2.data +
1761 (bset->extra + i) * (1 + row_size);
1762 isl_seq_clr(new_div[i], 1 + row_size);
1764 for (i = 0; i < bset->extra; ++i)
1765 new_div[n + i] = bset->block2.data + (bset->div[i] - old);
1767 bset->div = new_div;
1770 bset->dim = isl_dim_drop_outputs(bset->dim,
1771 isl_basic_set_n_dim(bset) - n, n);
1774 bset = isl_basic_set_simplify(bset);
1775 return isl_basic_set_finalize(bset);
1777 isl_basic_set_free(bset);
1781 struct isl_basic_map *add_divs(struct isl_basic_map *bmap, unsigned n)
1785 for (i = 0; i < n; ++i) {
1786 j = isl_basic_map_alloc_div(bmap);
1789 isl_seq_clr(bmap->div[j], 1+1+isl_basic_map_total_dim(bmap));
1793 isl_basic_map_free(bmap);
1797 struct isl_basic_map *isl_basic_map_apply_range(
1798 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
1800 struct isl_dim *dim_result = NULL;
1801 struct isl_basic_map *bmap;
1802 unsigned n_in, n_out, n, nparam, total, pos;
1803 struct isl_dim_map *dim_map1, *dim_map2;
1805 if (!bmap1 || !bmap2)
1808 dim_result = isl_dim_join(isl_dim_copy(bmap1->dim),
1809 isl_dim_copy(bmap2->dim));
1811 n_in = isl_basic_map_n_in(bmap1);
1812 n_out = isl_basic_map_n_out(bmap2);
1813 n = isl_basic_map_n_out(bmap1);
1814 nparam = isl_basic_map_n_param(bmap1);
1816 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + n;
1817 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
1818 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
1819 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
1820 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
1821 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
1822 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_in);
1823 isl_dim_map_div(dim_map1, bmap1, pos += n_out);
1824 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
1825 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
1826 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
1828 bmap = isl_basic_map_alloc_dim(dim_result,
1829 bmap1->n_div + bmap2->n_div + n,
1830 bmap1->n_eq + bmap2->n_eq,
1831 bmap1->n_ineq + bmap2->n_ineq);
1832 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
1833 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
1834 bmap = add_divs(bmap, n);
1835 bmap = isl_basic_map_simplify(bmap);
1836 return isl_basic_map_finalize(bmap);
1838 isl_basic_map_free(bmap1);
1839 isl_basic_map_free(bmap2);
1843 struct isl_basic_set *isl_basic_set_apply(
1844 struct isl_basic_set *bset, struct isl_basic_map *bmap)
1849 isl_assert(set->ctx, isl_basic_map_compatible_domain(bmap, bset),
1852 return (struct isl_basic_set *)
1853 isl_basic_map_apply_range((struct isl_basic_map *)bset, bmap);
1855 isl_basic_set_free(bset);
1856 isl_basic_map_free(bmap);
1860 struct isl_basic_map *isl_basic_map_apply_domain(
1861 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
1863 if (!bmap1 || !bmap2)
1867 isl_basic_map_n_in(bmap1) == isl_basic_map_n_in(bmap2), goto error);
1869 isl_basic_map_n_param(bmap1) == isl_basic_map_n_param(bmap2),
1872 bmap1 = isl_basic_map_reverse(bmap1);
1873 bmap1 = isl_basic_map_apply_range(bmap1, bmap2);
1874 return isl_basic_map_reverse(bmap1);
1876 isl_basic_map_free(bmap1);
1877 isl_basic_map_free(bmap2);
1881 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
1882 * A \cap B -> f(A) + f(B)
1884 struct isl_basic_map *isl_basic_map_sum(
1885 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
1887 unsigned n_in, n_out, nparam, total, pos;
1888 struct isl_basic_map *bmap = NULL;
1889 struct isl_dim_map *dim_map1, *dim_map2;
1892 if (!bmap1 || !bmap2)
1895 isl_assert(bmap1->ctx, isl_dim_equal(bmap1->dim, bmap2->dim),
1898 nparam = isl_basic_map_n_param(bmap1);
1899 n_in = isl_basic_map_n_in(bmap1);
1900 n_out = isl_basic_map_n_out(bmap1);
1902 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + 2 * n_out;
1903 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
1904 dim_map2 = isl_dim_map_alloc(bmap2->ctx, total);
1905 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
1906 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos);
1907 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
1908 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
1909 isl_dim_map_div(dim_map1, bmap1, pos += n_in + n_out);
1910 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
1911 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
1912 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_out);
1914 bmap = isl_basic_map_alloc_dim(isl_dim_copy(bmap1->dim),
1915 bmap1->n_div + bmap2->n_div + 2 * n_out,
1916 bmap1->n_eq + bmap2->n_eq + n_out,
1917 bmap1->n_ineq + bmap2->n_ineq);
1918 for (i = 0; i < n_out; ++i) {
1919 int j = isl_basic_map_alloc_equality(bmap);
1922 isl_seq_clr(bmap->eq[j], 1+total);
1923 isl_int_set_si(bmap->eq[j][1+nparam+n_in+i], -1);
1924 isl_int_set_si(bmap->eq[j][1+pos+i], 1);
1925 isl_int_set_si(bmap->eq[j][1+pos-n_out+i], 1);
1927 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
1928 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
1929 bmap = add_divs(bmap, 2 * n_out);
1931 bmap = isl_basic_map_simplify(bmap);
1932 return isl_basic_map_finalize(bmap);
1934 isl_basic_map_free(bmap);
1935 isl_basic_map_free(bmap1);
1936 isl_basic_map_free(bmap2);
1940 /* Given a basic map A -> f(A), construct A -> -f(A).
1942 struct isl_basic_map *isl_basic_map_neg(struct isl_basic_map *bmap)
1947 bmap = isl_basic_map_cow(bmap);
1951 n = isl_basic_map_dim(bmap, isl_dim_out);
1952 off = isl_basic_map_offset(bmap, isl_dim_out);
1953 for (i = 0; i < bmap->n_eq; ++i)
1954 for (j = 0; j < n; ++j)
1955 isl_int_neg(bmap->eq[i][off+j], bmap->eq[i][off+j]);
1956 for (i = 0; i < bmap->n_ineq; ++i)
1957 for (j = 0; j < n; ++j)
1958 isl_int_neg(bmap->ineq[i][off+j], bmap->ineq[i][off+j]);
1959 for (i = 0; i < bmap->n_div; ++i)
1960 for (j = 0; j < n; ++j)
1961 isl_int_neg(bmap->div[i][1+off+j], bmap->div[i][1+off+j]);
1962 return isl_basic_map_finalize(bmap);
1965 /* Given a basic map A -> f(A) and an integer d, construct a basic map
1966 * A -> floor(f(A)/d).
1968 struct isl_basic_map *isl_basic_map_floordiv(struct isl_basic_map *bmap,
1971 unsigned n_in, n_out, nparam, total, pos;
1972 struct isl_basic_map *result = NULL;
1973 struct isl_dim_map *dim_map;
1979 nparam = isl_basic_map_n_param(bmap);
1980 n_in = isl_basic_map_n_in(bmap);
1981 n_out = isl_basic_map_n_out(bmap);
1983 total = nparam + n_in + n_out + bmap->n_div + n_out;
1984 dim_map = isl_dim_map_alloc(bmap->ctx, total);
1985 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_param, pos = 0);
1986 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_in, pos += nparam);
1987 isl_dim_map_div(dim_map, bmap, pos += n_in + n_out);
1988 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_out, pos += bmap->n_div);
1990 result = isl_basic_map_alloc_dim(isl_dim_copy(bmap->dim),
1991 bmap->n_div + n_out,
1992 bmap->n_eq, bmap->n_ineq + 2 * n_out);
1993 result = add_constraints_dim_map(result, bmap, dim_map);
1994 result = add_divs(result, n_out);
1995 for (i = 0; i < n_out; ++i) {
1997 j = isl_basic_map_alloc_inequality(result);
2000 isl_seq_clr(result->ineq[j], 1+total);
2001 isl_int_neg(result->ineq[j][1+nparam+n_in+i], d);
2002 isl_int_set_si(result->ineq[j][1+pos+i], 1);
2003 j = isl_basic_map_alloc_inequality(result);
2006 isl_seq_clr(result->ineq[j], 1+total);
2007 isl_int_set(result->ineq[j][1+nparam+n_in+i], d);
2008 isl_int_set_si(result->ineq[j][1+pos+i], -1);
2009 isl_int_sub_ui(result->ineq[j][0], d, 1);
2012 result = isl_basic_map_simplify(result);
2013 return isl_basic_map_finalize(result);
2015 isl_basic_map_free(result);
2019 static struct isl_basic_map *var_equal(struct isl_basic_map *bmap, unsigned pos)
2025 i = isl_basic_map_alloc_equality(bmap);
2028 nparam = isl_basic_map_n_param(bmap);
2029 n_in = isl_basic_map_n_in(bmap);
2030 isl_seq_clr(bmap->eq[i], 1 + isl_basic_map_total_dim(bmap));
2031 isl_int_set_si(bmap->eq[i][1+nparam+pos], -1);
2032 isl_int_set_si(bmap->eq[i][1+nparam+n_in+pos], 1);
2033 return isl_basic_map_finalize(bmap);
2035 isl_basic_map_free(bmap);
2039 static struct isl_basic_map *var_more(struct isl_basic_map *bmap, unsigned pos)
2045 i = isl_basic_map_alloc_inequality(bmap);
2048 nparam = isl_basic_map_n_param(bmap);
2049 n_in = isl_basic_map_n_in(bmap);
2050 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
2051 isl_int_set_si(bmap->ineq[i][0], -1);
2052 isl_int_set_si(bmap->ineq[i][1+nparam+pos], -1);
2053 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], 1);
2054 return isl_basic_map_finalize(bmap);
2056 isl_basic_map_free(bmap);
2060 static struct isl_basic_map *var_less(struct isl_basic_map *bmap, unsigned pos)
2066 i = isl_basic_map_alloc_inequality(bmap);
2069 nparam = isl_basic_map_n_param(bmap);
2070 n_in = isl_basic_map_n_in(bmap);
2071 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
2072 isl_int_set_si(bmap->ineq[i][0], -1);
2073 isl_int_set_si(bmap->ineq[i][1+nparam+pos], 1);
2074 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], -1);
2075 return isl_basic_map_finalize(bmap);
2077 isl_basic_map_free(bmap);
2081 struct isl_basic_map *isl_basic_map_equal(struct isl_dim *dim, unsigned n_equal)
2084 struct isl_basic_map *bmap;
2085 bmap = isl_basic_map_alloc_dim(dim, 0, n_equal, 0);
2088 for (i = 0; i < n_equal && bmap; ++i)
2089 bmap = var_equal(bmap, i);
2090 return isl_basic_map_finalize(bmap);
2093 struct isl_basic_map *isl_basic_map_less_at(struct isl_dim *dim, unsigned pos)
2096 struct isl_basic_map *bmap;
2097 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
2100 for (i = 0; i < pos && bmap; ++i)
2101 bmap = var_equal(bmap, i);
2103 bmap = var_less(bmap, pos);
2104 return isl_basic_map_finalize(bmap);
2107 struct isl_basic_map *isl_basic_map_more_at(struct isl_dim *dim, unsigned pos)
2110 struct isl_basic_map *bmap;
2111 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
2114 for (i = 0; i < pos && bmap; ++i)
2115 bmap = var_equal(bmap, i);
2117 bmap = var_more(bmap, pos);
2118 return isl_basic_map_finalize(bmap);
2121 struct isl_basic_map *isl_basic_map_from_basic_set(
2122 struct isl_basic_set *bset, struct isl_dim *dim)
2124 struct isl_basic_map *bmap;
2126 bset = isl_basic_set_cow(bset);
2130 isl_assert(bset->ctx, isl_dim_compatible(bset->dim, dim), goto error);
2131 isl_dim_free(bset->dim);
2132 bmap = (struct isl_basic_map *) bset;
2134 return isl_basic_map_finalize(bmap);
2136 isl_basic_set_free(bset);
2141 struct isl_basic_set *isl_basic_set_from_basic_map(struct isl_basic_map *bmap)
2145 if (bmap->dim->n_in == 0)
2146 return (struct isl_basic_set *)bmap;
2147 bmap = isl_basic_map_cow(bmap);
2150 bmap->dim = isl_dim_cow(bmap->dim);
2153 bmap->dim->n_out += bmap->dim->n_in;
2154 bmap->dim->n_in = 0;
2155 bmap = isl_basic_map_finalize(bmap);
2156 return (struct isl_basic_set *)bmap;
2158 isl_basic_map_free(bmap);
2162 /* For a div d = floor(f/m), add the constraints
2165 * -(f-(n-1)) + m d >= 0
2167 * Note that the second constraint is the negation of
2171 static int add_div_constraints(struct isl_basic_map *bmap, unsigned div)
2174 unsigned total = isl_basic_map_total_dim(bmap);
2175 unsigned div_pos = 1 + total - bmap->n_div + div;
2177 i = isl_basic_map_alloc_inequality(bmap);
2180 isl_seq_cpy(bmap->ineq[i], bmap->div[div]+1, 1+total);
2181 isl_int_neg(bmap->ineq[i][div_pos], bmap->div[div][0]);
2183 j = isl_basic_map_alloc_inequality(bmap);
2186 isl_seq_neg(bmap->ineq[j], bmap->ineq[i], 1 + total);
2187 isl_int_add(bmap->ineq[j][0], bmap->ineq[j][0], bmap->ineq[j][div_pos]);
2188 isl_int_sub_ui(bmap->ineq[j][0], bmap->ineq[j][0], 1);
2192 struct isl_basic_set *isl_basic_map_underlying_set(
2193 struct isl_basic_map *bmap)
2197 if (bmap->dim->nparam == 0 && bmap->dim->n_in == 0 && bmap->n_div == 0)
2198 return (struct isl_basic_set *)bmap;
2199 bmap = isl_basic_map_cow(bmap);
2202 bmap->dim = isl_dim_underlying(bmap->dim, bmap->n_div);
2205 bmap->extra -= bmap->n_div;
2207 bmap = isl_basic_map_finalize(bmap);
2208 return (struct isl_basic_set *)bmap;
2213 struct isl_basic_map *isl_basic_map_overlying_set(
2214 struct isl_basic_set *bset, struct isl_basic_map *like)
2216 struct isl_basic_map *bmap;
2217 struct isl_ctx *ctx;
2224 isl_assert(ctx, bset->n_div == 0, goto error);
2225 isl_assert(ctx, isl_basic_set_n_param(bset) == 0, goto error);
2226 isl_assert(ctx, bset->dim->n_out == isl_basic_map_total_dim(like),
2228 if (isl_dim_equal(bset->dim, like->dim) && like->n_div == 0) {
2229 isl_basic_map_free(like);
2230 return (struct isl_basic_map *)bset;
2232 bset = isl_basic_set_cow(bset);
2235 total = bset->dim->n_out + bset->extra;
2236 bmap = (struct isl_basic_map *)bset;
2237 isl_dim_free(bmap->dim);
2238 bmap->dim = isl_dim_copy(like->dim);
2241 bmap->n_div = like->n_div;
2242 bmap->extra += like->n_div;
2245 ltotal = total - bmap->extra + like->extra;
2248 bmap->block2 = isl_blk_extend(ctx, bmap->block2,
2249 bmap->extra * (1 + 1 + total));
2250 if (isl_blk_is_error(bmap->block2))
2252 bmap->div = isl_realloc_array(ctx, bmap->div, isl_int *,
2256 for (i = 0; i < bmap->extra; ++i)
2257 bmap->div[i] = bmap->block2.data + i * (1 + 1 + total);
2258 for (i = 0; i < like->n_div; ++i) {
2259 isl_seq_cpy(bmap->div[i], like->div[i], 1 + 1 + ltotal);
2260 isl_seq_clr(bmap->div[i]+1+1+ltotal, total - ltotal);
2262 bmap = isl_basic_map_extend_constraints(bmap,
2263 0, 2 * like->n_div);
2264 for (i = 0; i < like->n_div; ++i) {
2265 if (isl_int_is_zero(bmap->div[i][0]))
2267 if (add_div_constraints(bmap, i) < 0)
2271 isl_basic_map_free(like);
2272 bmap = isl_basic_map_simplify(bmap);
2273 bmap = isl_basic_map_finalize(bmap);
2276 isl_basic_map_free(like);
2277 isl_basic_set_free(bset);
2281 struct isl_basic_set *isl_basic_set_from_underlying_set(
2282 struct isl_basic_set *bset, struct isl_basic_set *like)
2284 return (struct isl_basic_set *)
2285 isl_basic_map_overlying_set(bset, (struct isl_basic_map *)like);
2288 struct isl_set *isl_set_from_underlying_set(
2289 struct isl_set *set, struct isl_basic_set *like)
2295 isl_assert(set->ctx, set->dim->n_out == isl_basic_set_total_dim(like),
2297 if (isl_dim_equal(set->dim, like->dim) && like->n_div == 0) {
2298 isl_basic_set_free(like);
2301 set = isl_set_cow(set);
2304 for (i = 0; i < set->n; ++i) {
2305 set->p[i] = isl_basic_set_from_underlying_set(set->p[i],
2306 isl_basic_set_copy(like));
2310 isl_dim_free(set->dim);
2311 set->dim = isl_dim_copy(like->dim);
2314 isl_basic_set_free(like);
2317 isl_basic_set_free(like);
2322 struct isl_set *isl_map_underlying_set(struct isl_map *map)
2326 map = isl_map_cow(map);
2329 map->dim = isl_dim_cow(map->dim);
2333 for (i = 1; i < map->n; ++i)
2334 isl_assert(map->ctx, map->p[0]->n_div == map->p[i]->n_div,
2336 for (i = 0; i < map->n; ++i) {
2337 map->p[i] = (struct isl_basic_map *)
2338 isl_basic_map_underlying_set(map->p[i]);
2343 map->dim = isl_dim_underlying(map->dim, 0);
2345 isl_dim_free(map->dim);
2346 map->dim = isl_dim_copy(map->p[0]->dim);
2350 return (struct isl_set *)map;
2356 struct isl_set *isl_set_to_underlying_set(struct isl_set *set)
2358 return (struct isl_set *)isl_map_underlying_set((struct isl_map *)set);
2361 struct isl_basic_set *isl_basic_map_domain(struct isl_basic_map *bmap)
2363 struct isl_basic_set *domain;
2367 n_out = isl_basic_map_n_out(bmap);
2368 domain = isl_basic_set_from_basic_map(bmap);
2369 return isl_basic_set_project_out(domain, n_out, 0);
2372 struct isl_basic_set *isl_basic_map_range(struct isl_basic_map *bmap)
2374 return isl_basic_map_domain(isl_basic_map_reverse(bmap));
2377 struct isl_set *isl_map_range(struct isl_map *map)
2380 struct isl_set *set;
2384 map = isl_map_cow(map);
2388 set = (struct isl_set *) map;
2389 if (set->dim->n_in != 0) {
2390 set->dim = isl_dim_drop_inputs(set->dim, 0, set->dim->n_in);
2394 for (i = 0; i < map->n; ++i) {
2395 set->p[i] = isl_basic_map_range(map->p[i]);
2399 ISL_F_CLR(set, ISL_MAP_DISJOINT);
2400 ISL_F_CLR(set, ISL_SET_NORMALIZED);
2407 struct isl_map *isl_map_from_set(struct isl_set *set, struct isl_dim *dim)
2410 struct isl_map *map = NULL;
2412 set = isl_set_cow(set);
2415 isl_assert(set->ctx, isl_dim_compatible(set->dim, dim), goto error);
2416 map = (struct isl_map *)set;
2417 for (i = 0; i < set->n; ++i) {
2418 map->p[i] = isl_basic_map_from_basic_set(
2419 set->p[i], isl_dim_copy(dim));
2423 isl_dim_free(map->dim);
2432 struct isl_map *isl_map_from_range(struct isl_set *set)
2434 return (struct isl_map *)set;
2437 struct isl_set *isl_set_from_map(struct isl_map *map)
2440 struct isl_set *set = NULL;
2444 map = isl_map_cow(map);
2447 map->dim = isl_dim_cow(map->dim);
2450 map->dim->n_out += map->dim->n_in;
2452 set = (struct isl_set *)map;
2453 for (i = 0; i < map->n; ++i) {
2454 set->p[i] = isl_basic_set_from_basic_map(map->p[i]);
2464 struct isl_map *isl_map_alloc_dim(struct isl_dim *dim, int n, unsigned flags)
2466 struct isl_map *map;
2470 isl_assert(dim->ctx, n >= 0, return NULL);
2471 map = isl_alloc(dim->ctx, struct isl_map,
2472 sizeof(struct isl_map) +
2473 n * sizeof(struct isl_basic_map *));
2477 map->ctx = dim->ctx;
2478 isl_ctx_ref(map->ctx);
2490 struct isl_map *isl_map_alloc(struct isl_ctx *ctx,
2491 unsigned nparam, unsigned in, unsigned out, int n,
2494 struct isl_map *map;
2495 struct isl_dim *dims;
2497 dims = isl_dim_alloc(ctx, nparam, in, out);
2501 map = isl_map_alloc_dim(dims, n, flags);
2505 struct isl_basic_map *isl_basic_map_empty(struct isl_ctx *ctx,
2506 unsigned nparam, unsigned in, unsigned out)
2508 struct isl_basic_map *bmap;
2509 bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, 1, 0);
2510 bmap = isl_basic_map_set_to_empty(bmap);
2514 struct isl_basic_set *isl_basic_set_empty(struct isl_dim *dim)
2516 struct isl_basic_set *bset;
2517 bset = isl_basic_set_alloc_dim(dim, 0, 1, 0);
2518 bset = isl_basic_set_set_to_empty(bset);
2522 struct isl_basic_map *isl_basic_map_empty_like(struct isl_basic_map *model)
2524 struct isl_basic_map *bmap;
2527 bmap = isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
2528 bmap = isl_basic_map_set_to_empty(bmap);
2532 struct isl_basic_map *isl_basic_map_empty_like_map(struct isl_map *model)
2534 struct isl_basic_map *bmap;
2537 bmap = isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
2538 bmap = isl_basic_map_set_to_empty(bmap);
2542 struct isl_basic_set *isl_basic_set_empty_like(struct isl_basic_set *model)
2544 struct isl_basic_set *bset;
2547 bset = isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
2548 bset = isl_basic_set_set_to_empty(bset);
2552 struct isl_basic_map *isl_basic_map_universe(struct isl_dim *dim)
2554 struct isl_basic_map *bmap;
2555 bmap = isl_basic_map_alloc_dim(dim, 0, 0, 0);
2559 struct isl_basic_set *isl_basic_set_universe(struct isl_dim *dim)
2561 struct isl_basic_set *bset;
2562 bset = isl_basic_set_alloc_dim(dim, 0, 0, 0);
2566 struct isl_basic_set *isl_basic_set_universe_like(struct isl_basic_set *model)
2570 return isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
2573 struct isl_map *isl_map_empty(struct isl_dim *dim)
2575 return isl_map_alloc_dim(dim, 0, ISL_MAP_DISJOINT);
2578 struct isl_map *isl_map_empty_like(struct isl_map *model)
2582 return isl_map_alloc_dim(isl_dim_copy(model->dim), 0, ISL_MAP_DISJOINT);
2585 struct isl_map *isl_map_empty_like_basic_map(struct isl_basic_map *model)
2589 return isl_map_alloc_dim(isl_dim_copy(model->dim), 0, ISL_MAP_DISJOINT);
2592 struct isl_set *isl_set_empty(struct isl_dim *dim)
2594 return isl_set_alloc_dim(dim, 0, ISL_MAP_DISJOINT);
2597 struct isl_set *isl_set_empty_like(struct isl_set *model)
2601 return isl_set_empty(isl_dim_copy(model->dim));
2604 struct isl_set *isl_set_universe(struct isl_dim *dim)
2606 struct isl_set *set;
2609 set = isl_set_alloc_dim(isl_dim_copy(dim), 1, ISL_MAP_DISJOINT);
2610 set = isl_set_add(set, isl_basic_set_universe(dim));
2614 struct isl_map *isl_map_dup(struct isl_map *map)
2617 struct isl_map *dup;
2621 dup = isl_map_alloc_dim(isl_dim_copy(map->dim), map->n, map->flags);
2622 for (i = 0; i < map->n; ++i)
2623 dup = isl_map_add(dup, isl_basic_map_copy(map->p[i]));
2627 struct isl_map *isl_map_add(struct isl_map *map, struct isl_basic_map *bmap)
2631 isl_assert(map->ctx, isl_dim_equal(map->dim, bmap->dim), goto error);
2632 isl_assert(map->ctx, map->n < map->size, goto error);
2633 map->p[map->n] = bmap;
2635 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
2641 isl_basic_map_free(bmap);
2645 void isl_map_free(struct isl_map *map)
2655 isl_ctx_deref(map->ctx);
2656 for (i = 0; i < map->n; ++i)
2657 isl_basic_map_free(map->p[i]);
2658 isl_dim_free(map->dim);
2662 struct isl_map *isl_map_extend(struct isl_map *base,
2663 unsigned nparam, unsigned n_in, unsigned n_out)
2667 base = isl_map_cow(base);
2671 base->dim = isl_dim_extend(base->dim, nparam, n_in, n_out);
2674 for (i = 0; i < base->n; ++i) {
2675 base->p[i] = isl_basic_map_extend_dim(base->p[i],
2676 isl_dim_copy(base->dim), 0, 0, 0);
2686 struct isl_set *isl_set_extend(struct isl_set *base,
2687 unsigned nparam, unsigned dim)
2689 return (struct isl_set *)isl_map_extend((struct isl_map *)base,
2693 static struct isl_basic_map *isl_basic_map_fix_pos(struct isl_basic_map *bmap,
2694 unsigned pos, int value)
2698 bmap = isl_basic_map_cow(bmap);
2699 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
2700 j = isl_basic_map_alloc_equality(bmap);
2703 isl_seq_clr(bmap->eq[j], 1 + isl_basic_map_total_dim(bmap));
2704 isl_int_set_si(bmap->eq[j][pos], -1);
2705 isl_int_set_si(bmap->eq[j][0], value);
2706 bmap = isl_basic_map_simplify(bmap);
2707 return isl_basic_map_finalize(bmap);
2709 isl_basic_map_free(bmap);
2713 struct isl_basic_map *isl_basic_map_fix_si(struct isl_basic_map *bmap,
2714 enum isl_dim_type type, unsigned pos, int value)
2718 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
2719 return isl_basic_map_fix_pos(bmap, isl_basic_map_offset(bmap, type) + pos,
2722 isl_basic_map_free(bmap);
2726 struct isl_basic_set *isl_basic_set_fix_si(struct isl_basic_set *bset,
2727 enum isl_dim_type type, unsigned pos, int value)
2729 return (struct isl_basic_set *)
2730 isl_basic_map_fix_si((struct isl_basic_map *)bset,
2734 struct isl_basic_map *isl_basic_map_fix_input_si(struct isl_basic_map *bmap,
2735 unsigned input, int value)
2737 return isl_basic_map_fix_si(bmap, isl_dim_in, input, value);
2740 struct isl_basic_set *isl_basic_set_fix_dim_si(struct isl_basic_set *bset,
2741 unsigned dim, int value)
2743 return (struct isl_basic_set *)
2744 isl_basic_map_fix_si((struct isl_basic_map *)bset,
2745 isl_dim_set, dim, value);
2748 struct isl_map *isl_map_fix_si(struct isl_map *map,
2749 enum isl_dim_type type, unsigned pos, int value)
2753 map = isl_map_cow(map);
2757 isl_assert(ctx, pos < isl_map_dim(map, type), goto error);
2758 for (i = 0; i < map->n; ++i) {
2759 map->p[i] = isl_basic_map_fix_si(map->p[i], type, pos, value);
2763 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
2770 struct isl_map *isl_map_fix_input_si(struct isl_map *map,
2771 unsigned input, int value)
2773 return isl_map_fix_si(map, isl_dim_in, input, value);
2776 struct isl_set *isl_set_fix_dim_si(struct isl_set *set, unsigned dim, int value)
2778 return (struct isl_set *)
2779 isl_map_fix_si((struct isl_map *)set, isl_dim_set, dim, value);
2782 struct isl_basic_set *isl_basic_set_lower_bound_dim(struct isl_basic_set *bset,
2783 unsigned dim, isl_int value)
2788 bset = isl_basic_set_cow(bset);
2789 bset = isl_basic_set_extend_constraints(bset, 0, 1);
2790 j = isl_basic_set_alloc_inequality(bset);
2793 isl_seq_clr(bset->ineq[j], 1 + isl_basic_set_total_dim(bset));
2794 isl_int_set_si(bset->ineq[j][1 + isl_basic_set_n_param(bset) + dim], 1);
2795 isl_int_neg(bset->ineq[j][0], value);
2796 bset = isl_basic_set_simplify(bset);
2797 return isl_basic_set_finalize(bset);
2799 isl_basic_set_free(bset);
2803 struct isl_set *isl_set_lower_bound_dim(struct isl_set *set, unsigned dim,
2808 set = isl_set_cow(set);
2812 isl_assert(set->ctx, dim < isl_set_n_dim(set), goto error);
2813 for (i = 0; i < set->n; ++i) {
2814 set->p[i] = isl_basic_set_lower_bound_dim(set->p[i], dim, value);
2824 struct isl_map *isl_map_reverse(struct isl_map *map)
2829 map = isl_map_cow(map);
2833 map->dim = isl_dim_reverse(map->dim);
2836 for (i = 0; i < map->n; ++i) {
2837 map->p[i] = isl_basic_map_reverse(map->p[i]);
2841 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
2848 struct isl_map *isl_basic_map_lexmax(
2849 struct isl_basic_map *bmap, struct isl_basic_set *dom,
2850 struct isl_set **empty)
2852 return isl_pip_basic_map_lexmax(bmap, dom, empty);
2855 struct isl_map *isl_basic_map_lexmin(
2856 struct isl_basic_map *bmap, struct isl_basic_set *dom,
2857 struct isl_set **empty)
2859 return isl_pip_basic_map_lexmin(bmap, dom, empty);
2862 struct isl_set *isl_basic_set_lexmin(struct isl_basic_set *bset)
2864 struct isl_basic_map *bmap = NULL;
2865 struct isl_basic_set *dom = NULL;
2866 struct isl_map *min;
2867 struct isl_dim *param_dim;
2871 bmap = isl_basic_map_from_basic_set(bset, isl_dim_copy(bset->dim));
2874 param_dim = isl_dim_domain(isl_dim_copy(bmap->dim));
2875 dom = isl_basic_set_universe(param_dim);
2878 min = isl_basic_map_lexmin(bmap, dom, NULL);
2879 return isl_map_range(min);
2881 isl_basic_map_free(bmap);
2885 struct isl_map *isl_basic_map_compute_divs(struct isl_basic_map *bmap)
2892 off = isl_dim_total(bmap->dim);
2893 for (i = 0; i < bmap->n_div; ++i) {
2894 if (isl_int_is_zero(bmap->div[i][0]))
2895 return isl_pip_basic_map_compute_divs(bmap);
2896 isl_assert(bmap->ctx, isl_int_is_zero(bmap->div[i][1+1+off+i]),
2899 return isl_map_from_basic_map(bmap);
2901 isl_basic_map_free(bmap);
2905 struct isl_map *isl_map_compute_divs(struct isl_map *map)
2908 struct isl_map *res;
2914 res = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[0]));
2915 for (i = 1 ; i < map->n; ++i) {
2917 r2 = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[i]));
2918 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT))
2919 res = isl_map_union_disjoint(res, r2);
2921 res = isl_map_union(res, r2);
2928 struct isl_set *isl_basic_set_compute_divs(struct isl_basic_set *bset)
2930 return (struct isl_set *)
2931 isl_basic_map_compute_divs((struct isl_basic_map *)bset);
2934 struct isl_set *isl_set_compute_divs(struct isl_set *set)
2936 return (struct isl_set *)
2937 isl_map_compute_divs((struct isl_map *)set);
2940 struct isl_set *isl_map_domain(struct isl_map *map)
2943 struct isl_set *set;
2948 map = isl_map_cow(map);
2952 set = (struct isl_set *)map;
2953 set->dim = isl_dim_domain(set->dim);
2956 for (i = 0; i < map->n; ++i) {
2957 set->p[i] = isl_basic_map_domain(map->p[i]);
2961 ISL_F_CLR(set, ISL_MAP_DISJOINT);
2962 ISL_F_CLR(set, ISL_SET_NORMALIZED);
2969 struct isl_map *isl_map_union_disjoint(
2970 struct isl_map *map1, struct isl_map *map2)
2974 struct isl_map *map = NULL;
2988 isl_assert(map1->ctx, isl_dim_equal(map1->dim, map2->dim), goto error);
2990 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
2991 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
2992 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
2994 map = isl_map_alloc_dim(isl_dim_copy(map1->dim),
2995 map1->n + map2->n, flags);
2998 for (i = 0; i < map1->n; ++i) {
2999 map = isl_map_add(map,
3000 isl_basic_map_copy(map1->p[i]));
3004 for (i = 0; i < map2->n; ++i) {
3005 map = isl_map_add(map,
3006 isl_basic_map_copy(map2->p[i]));
3020 struct isl_map *isl_map_union(struct isl_map *map1, struct isl_map *map2)
3022 map1 = isl_map_union_disjoint(map1, map2);
3026 ISL_F_CLR(map1, ISL_MAP_DISJOINT);
3030 struct isl_set *isl_set_union_disjoint(
3031 struct isl_set *set1, struct isl_set *set2)
3033 return (struct isl_set *)
3034 isl_map_union_disjoint(
3035 (struct isl_map *)set1, (struct isl_map *)set2);
3038 struct isl_set *isl_set_union(struct isl_set *set1, struct isl_set *set2)
3040 return (struct isl_set *)
3041 isl_map_union((struct isl_map *)set1, (struct isl_map *)set2);
3044 struct isl_map *isl_map_intersect_range(
3045 struct isl_map *map, struct isl_set *set)
3048 struct isl_map *result;
3054 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT) &&
3055 ISL_F_ISSET(set, ISL_MAP_DISJOINT))
3056 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
3058 result = isl_map_alloc_dim(isl_dim_copy(map->dim),
3059 map->n * set->n, flags);
3062 for (i = 0; i < map->n; ++i)
3063 for (j = 0; j < set->n; ++j) {
3064 result = isl_map_add(result,
3065 isl_basic_map_intersect_range(
3066 isl_basic_map_copy(map->p[i]),
3067 isl_basic_set_copy(set->p[j])));
3080 struct isl_map *isl_map_intersect_domain(
3081 struct isl_map *map, struct isl_set *set)
3083 return isl_map_reverse(
3084 isl_map_intersect_range(isl_map_reverse(map), set));
3087 struct isl_map *isl_map_apply_domain(
3088 struct isl_map *map1, struct isl_map *map2)
3092 map1 = isl_map_reverse(map1);
3093 map1 = isl_map_apply_range(map1, map2);
3094 return isl_map_reverse(map1);
3101 struct isl_map *isl_map_apply_range(
3102 struct isl_map *map1, struct isl_map *map2)
3104 struct isl_dim *dim_result;
3105 struct isl_map *result;
3114 dim_result = isl_dim_join(isl_dim_copy(map1->dim),
3115 isl_dim_copy(map2->dim));
3117 result = isl_map_alloc_dim(dim_result, map1->n * map2->n, 0);
3120 for (i = 0; i < map1->n; ++i)
3121 for (j = 0; j < map2->n; ++j) {
3122 result = isl_map_add(result,
3123 isl_basic_map_apply_range(
3124 isl_basic_map_copy(map1->p[i]),
3125 isl_basic_map_copy(map2->p[j])));
3131 if (result && result->n <= 1)
3132 ISL_F_SET(result, ISL_MAP_DISJOINT);
3141 * returns range - domain
3143 struct isl_basic_set *isl_basic_map_deltas(struct isl_basic_map *bmap)
3145 struct isl_basic_set *bset;
3152 dim = isl_basic_map_n_in(bmap);
3153 nparam = isl_basic_map_n_param(bmap);
3154 isl_assert(bmap->ctx, dim == isl_basic_map_n_out(bmap), goto error);
3155 bset = isl_basic_set_from_basic_map(bmap);
3156 bset = isl_basic_set_extend(bset, nparam, 3*dim, 0, dim, 0);
3157 bset = isl_basic_set_swap_vars(bset, 2*dim);
3158 for (i = 0; i < dim; ++i) {
3159 int j = isl_basic_map_alloc_equality(
3160 (struct isl_basic_map *)bset);
3163 isl_seq_clr(bset->eq[j], 1 + isl_basic_set_total_dim(bset));
3164 isl_int_set_si(bset->eq[j][1+nparam+i], 1);
3165 isl_int_set_si(bset->eq[j][1+nparam+dim+i], 1);
3166 isl_int_set_si(bset->eq[j][1+nparam+2*dim+i], -1);
3168 return isl_basic_set_project_out(bset, 2*dim, 0);
3170 isl_basic_map_free(bmap);
3175 * returns range - domain
3177 struct isl_set *isl_map_deltas(struct isl_map *map)
3180 struct isl_set *result;
3185 isl_assert(map->ctx, isl_map_n_in(map) == isl_map_n_out(map), goto error);
3186 result = isl_set_alloc(map->ctx, isl_map_n_param(map),
3187 isl_map_n_in(map), map->n, map->flags);
3190 for (i = 0; i < map->n; ++i)
3191 result = isl_set_add(result,
3192 isl_basic_map_deltas(isl_basic_map_copy(map->p[i])));
3200 static struct isl_basic_map *basic_map_identity(struct isl_dim *dims)
3202 struct isl_basic_map *bmap;
3210 nparam = dims->nparam;
3212 bmap = isl_basic_map_alloc_dim(dims, 0, dim, 0);
3216 for (i = 0; i < dim; ++i) {
3217 int j = isl_basic_map_alloc_equality(bmap);
3220 isl_seq_clr(bmap->eq[j], 1 + isl_basic_map_total_dim(bmap));
3221 isl_int_set_si(bmap->eq[j][1+nparam+i], 1);
3222 isl_int_set_si(bmap->eq[j][1+nparam+dim+i], -1);
3224 return isl_basic_map_finalize(bmap);
3226 isl_basic_map_free(bmap);
3230 struct isl_basic_map *isl_basic_map_identity(struct isl_dim *set_dim)
3232 struct isl_dim *dim = isl_dim_map(set_dim);
3235 return basic_map_identity(dim);
3238 struct isl_basic_map *isl_basic_map_identity_like(struct isl_basic_map *model)
3240 if (!model || !model->dim)
3242 isl_assert(model->ctx,
3243 model->dim->n_in == model->dim->n_out, return NULL);
3244 return basic_map_identity(isl_dim_copy(model->dim));
3247 static struct isl_map *map_identity(struct isl_dim *dim)
3249 struct isl_map *map = isl_map_alloc_dim(dim, 1, ISL_MAP_DISJOINT);
3250 return isl_map_add(map, basic_map_identity(isl_dim_copy(dim)));
3253 struct isl_map *isl_map_identity(struct isl_dim *set_dim)
3255 struct isl_dim *dim = isl_dim_map(set_dim);
3258 return map_identity(dim);
3261 struct isl_map *isl_map_identity_like(struct isl_basic_map *model)
3263 if (!model || !model->dim)
3265 isl_assert(model->ctx,
3266 model->dim->n_in == model->dim->n_out, return NULL);
3267 return map_identity(isl_dim_copy(model->dim));
3270 int isl_set_is_equal(struct isl_set *set1, struct isl_set *set2)
3272 return isl_map_is_equal((struct isl_map *)set1, (struct isl_map *)set2);
3275 int isl_set_is_subset(struct isl_set *set1, struct isl_set *set2)
3277 return isl_map_is_subset(
3278 (struct isl_map *)set1, (struct isl_map *)set2);
3281 int isl_basic_map_is_subset(
3282 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3285 struct isl_map *map1;
3286 struct isl_map *map2;
3288 if (!bmap1 || !bmap2)
3291 map1 = isl_map_from_basic_map(isl_basic_map_copy(bmap1));
3292 map2 = isl_map_from_basic_map(isl_basic_map_copy(bmap2));
3294 is_subset = isl_map_is_subset(map1, map2);
3302 int isl_basic_map_is_equal(
3303 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3307 if (!bmap1 || !bmap2)
3309 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
3312 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
3316 int isl_basic_set_is_equal(
3317 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
3319 return isl_basic_map_is_equal(
3320 (struct isl_basic_map *)bset1, (struct isl_basic_map *)bset2);
3323 int isl_map_is_empty(struct isl_map *map)
3330 for (i = 0; i < map->n; ++i) {
3331 is_empty = isl_basic_map_is_empty(map->p[i]);
3340 int isl_map_fast_is_empty(struct isl_map *map)
3345 int isl_set_is_empty(struct isl_set *set)
3347 return isl_map_is_empty((struct isl_map *)set);
3350 int isl_map_is_subset(struct isl_map *map1, struct isl_map *map2)
3354 struct isl_map *diff;
3359 if (isl_map_is_empty(map1))
3362 if (isl_map_is_empty(map2))
3365 diff = isl_map_subtract(isl_map_copy(map1), isl_map_copy(map2));
3369 is_subset = isl_map_is_empty(diff);
3375 int isl_map_is_equal(struct isl_map *map1, struct isl_map *map2)
3381 is_subset = isl_map_is_subset(map1, map2);
3384 is_subset = isl_map_is_subset(map2, map1);
3388 int isl_basic_map_is_strict_subset(
3389 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3393 if (!bmap1 || !bmap2)
3395 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
3398 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
3399 if (is_subset == -1)
3404 int isl_basic_map_is_universe(struct isl_basic_map *bmap)
3408 return bmap->n_eq == 0 && bmap->n_ineq == 0;
3411 int isl_basic_map_is_empty(struct isl_basic_map *bmap)
3413 struct isl_basic_set *bset = NULL;
3414 struct isl_vec *sample = NULL;
3421 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY))
3424 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL)) {
3425 struct isl_basic_map *copy = isl_basic_map_copy(bmap);
3426 copy = isl_basic_map_convex_hull(copy);
3427 empty = ISL_F_ISSET(copy, ISL_BASIC_MAP_EMPTY);
3428 isl_basic_map_free(copy);
3432 total = 1 + isl_basic_map_total_dim(bmap);
3433 if (bmap->sample && bmap->sample->size == total) {
3434 int contains = basic_map_contains(bmap, bmap->sample);
3440 bset = isl_basic_map_underlying_set(isl_basic_map_copy(bmap));
3443 sample = isl_basic_set_sample(bset);
3446 empty = sample->size == 0;
3448 isl_vec_free(bmap->ctx, bmap->sample);
3449 bmap->sample = sample;
3454 int isl_basic_set_is_empty(struct isl_basic_set *bset)
3456 return isl_basic_map_is_empty((struct isl_basic_map *)bset);
3459 struct isl_map *isl_basic_map_union(
3460 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3462 struct isl_map *map;
3463 if (!bmap1 || !bmap2)
3466 isl_assert(map1->ctx, isl_dim_equal(bmap1->dim, bmap2->dim), goto error);
3468 map = isl_map_alloc_dim(isl_dim_copy(bmap1->dim), 2, 0);
3471 map = isl_map_add(map, bmap1);
3472 map = isl_map_add(map, bmap2);
3475 isl_basic_map_free(bmap1);
3476 isl_basic_map_free(bmap2);
3480 struct isl_set *isl_basic_set_union(
3481 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
3483 return (struct isl_set *)isl_basic_map_union(
3484 (struct isl_basic_map *)bset1,
3485 (struct isl_basic_map *)bset2);
3488 /* Order divs such that any div only depends on previous divs */
3489 static struct isl_basic_map *order_divs(struct isl_basic_map *bmap)
3492 unsigned off = isl_dim_total(bmap->dim);
3494 for (i = 0; i < bmap->n_div; ++i) {
3496 pos = isl_seq_first_non_zero(bmap->div[i]+1+1+off+i,
3500 swap_div(bmap, i, pos);
3506 /* Look for a div in dst that corresponds to the div "div" in src.
3507 * The divs before "div" in src and dst are assumed to be the same.
3509 * Returns -1 if no corresponding div was found and the position
3510 * of the corresponding div in dst otherwise.
3512 static int find_div(struct isl_basic_map *dst,
3513 struct isl_basic_map *src, unsigned div)
3517 unsigned total = isl_dim_total(src->dim);
3519 isl_assert(dst->ctx, div <= dst->n_div, return -1);
3520 for (i = div; i < dst->n_div; ++i)
3521 if (isl_seq_eq(dst->div[i], src->div[div], 1+1+total+div) &&
3522 isl_seq_first_non_zero(dst->div[i]+1+1+total+div,
3523 dst->n_div - div) == -1)
3528 struct isl_basic_map *isl_basic_map_align_divs(
3529 struct isl_basic_map *dst, struct isl_basic_map *src)
3532 unsigned total = isl_dim_total(src->dim);
3537 if (src->n_div == 0)
3540 for (i = 0; i < src->n_div; ++i)
3541 isl_assert(src->ctx, !isl_int_is_zero(src->div[i][0]), goto error);
3543 src = order_divs(src);
3544 dst = isl_basic_map_extend_dim(dst, isl_dim_copy(dst->dim),
3545 src->n_div, 0, 2 * src->n_div);
3548 for (i = 0; i < src->n_div; ++i) {
3549 int j = find_div(dst, src, i);
3551 j = isl_basic_map_alloc_div(dst);
3554 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total+i);
3555 isl_seq_clr(dst->div[j]+1+1+total+i, dst->n_div - i);
3556 if (add_div_constraints(dst, j) < 0)
3560 swap_div(dst, i, j);
3564 isl_basic_map_free(dst);
3568 struct isl_basic_set *isl_basic_set_align_divs(
3569 struct isl_basic_set *dst, struct isl_basic_set *src)
3571 return (struct isl_basic_set *)isl_basic_map_align_divs(
3572 (struct isl_basic_map *)dst, (struct isl_basic_map *)src);
3575 struct isl_map *isl_map_align_divs(struct isl_map *map)
3579 map = isl_map_compute_divs(map);
3580 map = isl_map_cow(map);
3584 for (i = 1; i < map->n; ++i)
3585 map->p[0] = isl_basic_map_align_divs(map->p[0], map->p[i]);
3586 for (i = 1; i < map->n; ++i)
3587 map->p[i] = isl_basic_map_align_divs(map->p[i], map->p[0]);
3589 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3593 static struct isl_map *add_cut_constraint(struct isl_map *dst,
3594 struct isl_basic_map *src, isl_int *c,
3595 unsigned len, int oppose)
3597 struct isl_basic_map *copy = NULL;
3602 copy = isl_basic_map_copy(src);
3603 copy = isl_basic_map_cow(copy);
3606 copy = isl_basic_map_extend_constraints(copy, 0, 1);
3607 k = isl_basic_map_alloc_inequality(copy);
3611 isl_seq_neg(copy->ineq[k], c, len);
3613 isl_seq_cpy(copy->ineq[k], c, len);
3614 total = 1 + isl_basic_map_total_dim(copy);
3615 isl_seq_clr(copy->ineq[k]+len, total - len);
3616 isl_inequality_negate(copy, k);
3617 copy = isl_basic_map_simplify(copy);
3618 copy = isl_basic_map_finalize(copy);
3619 is_empty = isl_basic_map_is_empty(copy);
3623 dst = isl_map_add(dst, copy);
3625 isl_basic_map_free(copy);
3628 isl_basic_map_free(copy);
3633 static struct isl_map *subtract(struct isl_map *map, struct isl_basic_map *bmap)
3637 struct isl_map *rest = NULL;
3639 unsigned total = isl_basic_map_total_dim(bmap);
3646 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT))
3647 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
3649 max = map->n * (2 * bmap->n_eq + bmap->n_ineq);
3650 rest = isl_map_alloc_dim(isl_dim_copy(map->dim), max, flags);
3654 for (i = 0; i < map->n; ++i) {
3655 map->p[i] = isl_basic_map_align_divs(map->p[i], bmap);
3660 for (j = 0; j < map->n; ++j)
3661 map->p[j] = isl_basic_map_cow(map->p[j]);
3663 for (i = 0; i < bmap->n_eq; ++i) {
3664 for (j = 0; j < map->n; ++j) {
3665 rest = add_cut_constraint(rest,
3666 map->p[j], bmap->eq[i], 1+total, 0);
3670 rest = add_cut_constraint(rest,
3671 map->p[j], bmap->eq[i], 1+total, 1);
3675 map->p[j] = isl_basic_map_extend_constraints(map->p[j],
3679 k = isl_basic_map_alloc_equality(map->p[j]);
3682 isl_seq_cpy(map->p[j]->eq[k], bmap->eq[i], 1+total);
3683 isl_seq_clr(map->p[j]->eq[k]+1+total,
3684 map->p[j]->n_div - bmap->n_div);
3688 for (i = 0; i < bmap->n_ineq; ++i) {
3689 for (j = 0; j < map->n; ++j) {
3690 rest = add_cut_constraint(rest,
3691 map->p[j], bmap->ineq[i], 1+total, 0);
3695 map->p[j] = isl_basic_map_extend_constraints(map->p[j],
3699 k = isl_basic_map_alloc_inequality(map->p[j]);
3702 isl_seq_cpy(map->p[j]->ineq[k], bmap->ineq[i], 1+total);
3703 isl_seq_clr(map->p[j]->ineq[k]+1+total,
3704 map->p[j]->n_div - bmap->n_div);
3716 struct isl_map *isl_map_subtract(struct isl_map *map1, struct isl_map *map2)
3722 isl_assert(map1->ctx, isl_dim_equal(map1->dim, map2->dim), goto error);
3724 if (isl_map_is_empty(map2)) {
3729 map1 = isl_map_compute_divs(map1);
3730 map2 = isl_map_compute_divs(map2);
3734 for (i = 0; map1 && i < map2->n; ++i)
3735 map1 = subtract(map1, map2->p[i]);
3745 struct isl_set *isl_set_subtract(struct isl_set *set1, struct isl_set *set2)
3747 return (struct isl_set *)
3749 (struct isl_map *)set1, (struct isl_map *)set2);
3752 struct isl_set *isl_set_apply(struct isl_set *set, struct isl_map *map)
3756 isl_assert(set->ctx, isl_map_compatible_domain(map, set), goto error);
3757 map = isl_map_intersect_domain(map, set);
3758 set = isl_map_range(map);
3766 /* There is no need to cow as removing empty parts doesn't change
3767 * the meaning of the set.
3769 struct isl_map *isl_map_remove_empty_parts(struct isl_map *map)
3776 for (i = map->n-1; i >= 0; --i) {
3777 if (!ISL_F_ISSET(map->p[i], ISL_BASIC_MAP_EMPTY))
3779 isl_basic_map_free(map->p[i]);
3780 if (i != map->n-1) {
3781 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3782 map->p[i] = map->p[map->n-1];
3790 struct isl_set *isl_set_remove_empty_parts(struct isl_set *set)
3792 return (struct isl_set *)
3793 isl_map_remove_empty_parts((struct isl_map *)set);
3796 struct isl_basic_map *isl_map_copy_basic_map(struct isl_map *map)
3798 struct isl_basic_map *bmap;
3799 if (!map || map->n == 0)
3801 bmap = map->p[map->n-1];
3802 isl_assert(map->ctx, ISL_F_ISSET(bmap, ISL_BASIC_SET_FINAL), return NULL);
3803 return isl_basic_map_copy(bmap);
3806 struct isl_basic_set *isl_set_copy_basic_set(struct isl_set *set)
3808 (struct isl_basic_set *)isl_map_copy_basic_map((struct isl_map *)set);
3811 struct isl_map *isl_map_drop_basic_map(struct isl_map *map,
3812 struct isl_basic_map *bmap)
3818 for (i = map->n-1; i >= 0; --i) {
3819 if (map->p[i] != bmap)
3821 map = isl_map_cow(map);
3824 isl_basic_map_free(map->p[i]);
3825 if (i != map->n-1) {
3826 ISL_F_CLR(map, ISL_SET_NORMALIZED);
3827 map->p[i] = map->p[map->n-1];
3832 isl_basic_map_free(bmap);
3836 isl_basic_map_free(bmap);
3840 struct isl_set *isl_set_drop_basic_set(struct isl_set *set,
3841 struct isl_basic_set *bset)
3843 (struct isl_set *)isl_map_drop_basic_map((struct isl_map *)set,
3844 (struct isl_basic_map *)bset);
3847 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
3848 * for any common value of the parameters and dimensions preceding dim
3849 * in both basic sets, the values of dimension pos in bset1 are
3850 * smaller or larger than those in bset2.
3853 * 1 if bset1 follows bset2
3854 * -1 if bset1 precedes bset2
3855 * 0 if bset1 and bset2 are incomparable
3856 * -2 if some error occurred.
3858 int isl_basic_set_compare_at(struct isl_basic_set *bset1,
3859 struct isl_basic_set *bset2, int pos)
3861 struct isl_dim *dims;
3862 struct isl_basic_map *bmap1 = NULL;
3863 struct isl_basic_map *bmap2 = NULL;
3864 struct isl_ctx *ctx;
3865 struct isl_vec *obj;
3868 unsigned dim1, dim2;
3870 enum isl_lp_result res;
3873 if (!bset1 || !bset2)
3876 nparam = isl_basic_set_n_param(bset1);
3877 dim1 = isl_basic_set_n_dim(bset1);
3878 dim2 = isl_basic_set_n_dim(bset2);
3879 dims = isl_dim_alloc(bset1->ctx, nparam, pos, dim1 - pos);
3880 bmap1 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset1), dims);
3881 dims = isl_dim_alloc(bset2->ctx, nparam, pos, dim2 - pos);
3882 bmap2 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset2), dims);
3883 if (!bmap1 || !bmap2)
3885 bmap1 = isl_basic_map_extend(bmap1, nparam,
3886 pos, (dim1 - pos) + (dim2 - pos),
3887 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
3888 bmap1 = add_constraints(bmap1, bmap2, 0, dim1 - pos);
3891 total = isl_basic_map_total_dim(bmap1);
3893 obj = isl_vec_alloc(ctx, total);
3894 isl_seq_clr(obj->block.data, total);
3895 isl_int_set_si(obj->block.data[nparam+pos], 1);
3896 isl_int_set_si(obj->block.data[nparam+pos+(dim1-pos)], -1);
3901 res = isl_solve_lp(bmap1, 0, obj->block.data, ctx->one, &num, &den);
3902 if (res == isl_lp_empty)
3904 else if (res == isl_lp_ok && isl_int_is_pos(num))
3906 else if ((res == isl_lp_ok && isl_int_is_neg(num)) ||
3907 res == isl_lp_unbounded)
3913 isl_basic_map_free(bmap1);
3914 isl_vec_free(ctx, obj);
3917 isl_basic_map_free(bmap1);
3918 isl_basic_map_free(bmap2);
3922 static int isl_basic_map_fast_has_fixed_var(struct isl_basic_map *bmap,
3923 unsigned pos, isl_int *val)
3931 total = isl_basic_map_total_dim(bmap);
3932 for (i = 0, d = total-1; i < bmap->n_eq && d+1 > pos; ++i) {
3933 for (; d+1 > pos; --d)
3934 if (!isl_int_is_zero(bmap->eq[i][1+d]))
3938 if (isl_seq_first_non_zero(bmap->eq[i]+1, d) != -1)
3940 if (isl_seq_first_non_zero(bmap->eq[i]+1+d+1, total-d-1) != -1)
3942 if (!isl_int_is_one(bmap->eq[i][1+d]))
3945 isl_int_neg(*val, bmap->eq[i][0]);
3951 static int isl_map_fast_has_fixed_var(struct isl_map *map,
3952 unsigned pos, isl_int *val)
3964 return isl_basic_map_fast_has_fixed_var(map->p[0], pos, val);
3967 fixed = isl_basic_map_fast_has_fixed_var(map->p[0], pos, &v);
3968 for (i = 1; fixed == 1 && i < map->n; ++i) {
3969 fixed = isl_basic_map_fast_has_fixed_var(map->p[i], pos, &tmp);
3970 if (fixed == 1 && isl_int_ne(tmp, v))
3974 isl_int_set(*val, v);
3980 static int isl_set_fast_has_fixed_var(struct isl_set *set, unsigned pos,
3983 return isl_map_fast_has_fixed_var((struct isl_map *)set, pos, val);
3986 int isl_basic_map_fast_is_fixed(struct isl_basic_map *bmap,
3987 enum isl_dim_type type, unsigned pos, isl_int *val)
3989 if (pos >= isl_basic_map_dim(bmap, type))
3991 return isl_basic_map_fast_has_fixed_var(bmap,
3992 isl_basic_map_offset(bmap, type) - 1 + pos, val);
3995 /* Check if dimension dim has fixed value and if so and if val is not NULL,
3996 * then return this fixed value in *val.
3998 int isl_set_fast_dim_is_fixed(struct isl_set *set, unsigned dim, isl_int *val)
4000 return isl_set_fast_has_fixed_var(set, isl_set_n_param(set) + dim, val);
4003 /* Check if input variable in has fixed value and if so and if val is not NULL,
4004 * then return this fixed value in *val.
4006 int isl_map_fast_input_is_fixed(struct isl_map *map, unsigned in, isl_int *val)
4008 return isl_map_fast_has_fixed_var(map, isl_map_n_param(map) + in, val);
4011 /* Check if dimension dim has an (obvious) fixed lower bound and if so
4012 * and if val is not NULL, then return this lower bound in *val.
4014 int isl_basic_set_fast_dim_has_fixed_lower_bound(struct isl_basic_set *bset,
4015 unsigned dim, isl_int *val)
4017 int i, i_eq = -1, i_ineq = -1;
4024 total = isl_basic_set_total_dim(bset);
4025 nparam = isl_basic_set_n_param(bset);
4026 for (i = 0; i < bset->n_eq; ++i) {
4027 if (isl_int_is_zero(bset->eq[i][1+nparam+dim]))
4033 for (i = 0; i < bset->n_ineq; ++i) {
4034 if (!isl_int_is_pos(bset->ineq[i][1+nparam+dim]))
4036 if (i_eq != -1 || i_ineq != -1)
4040 if (i_eq == -1 && i_ineq == -1)
4042 c = i_eq != -1 ? bset->eq[i_eq] : bset->ineq[i_ineq];
4043 /* The coefficient should always be one due to normalization. */
4044 if (!isl_int_is_one(c[1+nparam+dim]))
4046 if (isl_seq_first_non_zero(c+1, nparam+dim) != -1)
4048 if (isl_seq_first_non_zero(c+1+nparam+dim+1,
4049 total - nparam - dim - 1) != -1)
4052 isl_int_neg(*val, c[0]);
4056 int isl_set_fast_dim_has_fixed_lower_bound(struct isl_set *set,
4057 unsigned dim, isl_int *val)
4069 return isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[0],
4073 fixed = isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[0],
4075 for (i = 1; fixed == 1 && i < set->n; ++i) {
4076 fixed = isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[i],
4078 if (fixed == 1 && isl_int_ne(tmp, v))
4082 isl_int_set(*val, v);
4093 static int qsort_constraint_cmp(const void *p1, const void *p2)
4095 const struct constraint *c1 = (const struct constraint *)p1;
4096 const struct constraint *c2 = (const struct constraint *)p2;
4097 unsigned size = isl_min(c1->size, c2->size);
4098 return isl_seq_cmp(c1->c, c2->c, size);
4101 static struct isl_basic_map *isl_basic_map_sort_constraints(
4102 struct isl_basic_map *bmap)
4105 struct constraint *c;
4110 total = isl_basic_map_total_dim(bmap);
4111 c = isl_alloc_array(bmap->ctx, struct constraint, bmap->n_ineq);
4114 for (i = 0; i < bmap->n_ineq; ++i) {
4116 c[i].c = bmap->ineq[i];
4118 qsort(c, bmap->n_ineq, sizeof(struct constraint), qsort_constraint_cmp);
4119 for (i = 0; i < bmap->n_ineq; ++i)
4120 bmap->ineq[i] = c[i].c;
4124 isl_basic_map_free(bmap);
4128 struct isl_basic_map *isl_basic_map_normalize(struct isl_basic_map *bmap)
4132 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_NORMALIZED))
4134 bmap = isl_basic_map_convex_hull(bmap);
4135 bmap = isl_basic_map_sort_constraints(bmap);
4136 ISL_F_SET(bmap, ISL_BASIC_MAP_NORMALIZED);
4140 struct isl_basic_set *isl_basic_set_normalize(struct isl_basic_set *bset)
4142 return (struct isl_basic_set *)isl_basic_map_normalize(
4143 (struct isl_basic_map *)bset);
4146 static int isl_basic_map_fast_cmp(const struct isl_basic_map *bmap1,
4147 const struct isl_basic_map *bmap2)
4154 if (isl_basic_map_n_param(bmap1) != isl_basic_map_n_param(bmap2))
4155 return isl_basic_map_n_param(bmap1) - isl_basic_map_n_param(bmap2);
4156 if (isl_basic_map_n_in(bmap1) != isl_basic_map_n_in(bmap2))
4157 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
4158 if (isl_basic_map_n_out(bmap1) != isl_basic_map_n_out(bmap2))
4159 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
4160 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY) &&
4161 ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
4163 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY))
4165 if (ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
4167 if (bmap1->n_eq != bmap2->n_eq)
4168 return bmap1->n_eq - bmap2->n_eq;
4169 if (bmap1->n_ineq != bmap2->n_ineq)
4170 return bmap1->n_ineq - bmap2->n_ineq;
4171 if (bmap1->n_div != bmap2->n_div)
4172 return bmap1->n_div - bmap2->n_div;
4173 total = isl_basic_map_total_dim(bmap1);
4174 for (i = 0; i < bmap1->n_eq; ++i) {
4175 cmp = isl_seq_cmp(bmap1->eq[i], bmap2->eq[i], 1+total);
4179 for (i = 0; i < bmap1->n_ineq; ++i) {
4180 cmp = isl_seq_cmp(bmap1->ineq[i], bmap2->ineq[i], 1+total);
4184 for (i = 0; i < bmap1->n_div; ++i) {
4185 cmp = isl_seq_cmp(bmap1->div[i], bmap2->div[i], 1+1+total);
4192 static int isl_basic_map_fast_is_equal(struct isl_basic_map *bmap1,
4193 struct isl_basic_map *bmap2)
4195 return isl_basic_map_fast_cmp(bmap1, bmap2) == 0;
4198 static int qsort_bmap_cmp(const void *p1, const void *p2)
4200 const struct isl_basic_map *bmap1 = *(const struct isl_basic_map **)p1;
4201 const struct isl_basic_map *bmap2 = *(const struct isl_basic_map **)p2;
4203 return isl_basic_map_fast_cmp(bmap1, bmap2);
4206 /* We normalize in place, but if anything goes wrong we need
4207 * to return NULL, so we need to make sure we don't change the
4208 * meaning of any possible other copies of map.
4210 struct isl_map *isl_map_normalize(struct isl_map *map)
4213 struct isl_basic_map *bmap;
4217 if (ISL_F_ISSET(map, ISL_MAP_NORMALIZED))
4219 for (i = 0; i < map->n; ++i) {
4220 bmap = isl_basic_map_normalize(isl_basic_map_copy(map->p[i]));
4223 isl_basic_map_free(map->p[i]);
4226 qsort(map->p, map->n, sizeof(struct isl_basic_map *), qsort_bmap_cmp);
4227 ISL_F_SET(map, ISL_MAP_NORMALIZED);
4228 map = isl_map_remove_empty_parts(map);
4231 for (i = map->n - 1; i >= 1; --i) {
4232 if (!isl_basic_map_fast_is_equal(map->p[i-1], map->p[i]))
4234 isl_basic_map_free(map->p[i-1]);
4235 for (j = i; j < map->n; ++j)
4236 map->p[j-1] = map->p[j];
4246 struct isl_set *isl_set_normalize(struct isl_set *set)
4248 return (struct isl_set *)isl_map_normalize((struct isl_map *)set);
4251 int isl_map_fast_is_equal(struct isl_map *map1, struct isl_map *map2)
4261 if (!isl_dim_equal(map1->dim, map2->dim))
4264 map1 = isl_map_copy(map1);
4265 map2 = isl_map_copy(map2);
4266 map1 = isl_map_normalize(map1);
4267 map2 = isl_map_normalize(map2);
4270 equal = map1->n == map2->n;
4271 for (i = 0; equal && i < map1->n; ++i) {
4272 equal = isl_basic_map_fast_is_equal(map1->p[i], map2->p[i]);
4285 int isl_set_fast_is_equal(struct isl_set *set1, struct isl_set *set2)
4287 return isl_map_fast_is_equal((struct isl_map *)set1,
4288 (struct isl_map *)set2);
4291 /* Return an interval that ranges from min to max (inclusive)
4293 struct isl_basic_set *isl_basic_set_interval(struct isl_ctx *ctx,
4294 isl_int min, isl_int max)
4297 struct isl_basic_set *bset = NULL;
4299 bset = isl_basic_set_alloc(ctx, 0, 1, 0, 0, 2);
4303 k = isl_basic_set_alloc_inequality(bset);
4306 isl_int_set_si(bset->ineq[k][1], 1);
4307 isl_int_neg(bset->ineq[k][0], min);
4309 k = isl_basic_set_alloc_inequality(bset);
4312 isl_int_set_si(bset->ineq[k][1], -1);
4313 isl_int_set(bset->ineq[k][0], max);
4317 isl_basic_set_free(bset);
4321 /* Return the Cartesian product of the basic sets in list (in the given order).
4323 struct isl_basic_set *isl_basic_set_product(struct isl_basic_set_list *list)
4331 struct isl_basic_set *product = NULL;
4335 isl_assert(list->ctx, list->n > 0, goto error);
4336 isl_assert(list->ctx, list->p[0], goto error);
4337 nparam = isl_basic_set_n_param(list->p[0]);
4338 dim = isl_basic_set_n_dim(list->p[0]);
4339 extra = list->p[0]->n_div;
4340 n_eq = list->p[0]->n_eq;
4341 n_ineq = list->p[0]->n_ineq;
4342 for (i = 1; i < list->n; ++i) {
4343 isl_assert(list->ctx, list->p[i], goto error);
4344 isl_assert(list->ctx,
4345 nparam == isl_basic_set_n_param(list->p[i]), goto error);
4346 dim += isl_basic_set_n_dim(list->p[i]);
4347 extra += list->p[i]->n_div;
4348 n_eq += list->p[i]->n_eq;
4349 n_ineq += list->p[i]->n_ineq;
4351 product = isl_basic_set_alloc(list->ctx, nparam, dim, extra,
4356 for (i = 0; i < list->n; ++i) {
4357 isl_basic_set_add_constraints(product,
4358 isl_basic_set_copy(list->p[i]), dim);
4359 dim += isl_basic_set_n_dim(list->p[i]);
4361 isl_basic_set_list_free(list);
4364 isl_basic_set_free(product);
4365 isl_basic_set_list_free(list);
4369 struct isl_basic_map *isl_basic_map_product(
4370 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
4372 struct isl_dim *dim_result = NULL;
4373 struct isl_basic_map *bmap;
4374 unsigned in1, in2, out1, out2, nparam, total, pos;
4375 struct isl_dim_map *dim_map1, *dim_map2;
4377 if (!bmap1 || !bmap2)
4380 isl_assert(map1->ctx, isl_dim_match(bmap1->dim, isl_dim_param,
4381 bmap2->dim, isl_dim_param), goto error);
4382 dim_result = isl_dim_product(isl_dim_copy(bmap1->dim),
4383 isl_dim_copy(bmap2->dim));
4385 in1 = isl_basic_map_n_in(bmap1);
4386 in2 = isl_basic_map_n_in(bmap2);
4387 out1 = isl_basic_map_n_out(bmap1);
4388 out2 = isl_basic_map_n_out(bmap2);
4389 nparam = isl_basic_map_n_param(bmap1);
4391 total = nparam + in1 + in2 + out1 + out2 + bmap1->n_div + bmap2->n_div;
4392 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
4393 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
4394 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
4395 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
4396 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
4397 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos += in1);
4398 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += in2);
4399 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += out1);
4400 isl_dim_map_div(dim_map1, bmap1, pos += out2);
4401 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
4403 bmap = isl_basic_map_alloc_dim(dim_result,
4404 bmap1->n_div + bmap2->n_div,
4405 bmap1->n_eq + bmap2->n_eq,
4406 bmap1->n_ineq + bmap2->n_ineq);
4407 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
4408 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
4409 bmap = isl_basic_map_simplify(bmap);
4410 return isl_basic_map_finalize(bmap);
4412 isl_basic_map_free(bmap1);
4413 isl_basic_map_free(bmap2);
4417 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
4419 struct isl_map *isl_map_product(struct isl_map *map1, struct isl_map *map2)
4422 struct isl_map *result;
4428 isl_assert(map1->ctx, isl_dim_match(map1->dim, isl_dim_param,
4429 map2->dim, isl_dim_param), goto error);
4431 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
4432 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
4433 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
4435 result = isl_map_alloc_dim(isl_dim_product(isl_dim_copy(map1->dim),
4436 isl_dim_copy(map2->dim)),
4437 map1->n * map2->n, flags);
4440 for (i = 0; i < map1->n; ++i)
4441 for (j = 0; j < map2->n; ++j) {
4442 struct isl_basic_map *part;
4443 part = isl_basic_map_product(
4444 isl_basic_map_copy(map1->p[i]),
4445 isl_basic_map_copy(map2->p[j]));
4446 if (isl_basic_map_is_empty(part))
4447 isl_basic_map_free(part);
4449 result = isl_map_add(result, part);
4462 uint32_t isl_basic_set_get_hash(struct isl_basic_set *bset)
4470 bset = isl_basic_set_copy(bset);
4471 bset = isl_basic_set_normalize(bset);
4474 total = isl_basic_set_total_dim(bset);
4475 isl_hash_byte(hash, bset->n_eq & 0xFF);
4476 for (i = 0; i < bset->n_eq; ++i) {
4478 c_hash = isl_seq_get_hash(bset->eq[i], 1 + total);
4479 isl_hash_hash(hash, c_hash);
4481 isl_hash_byte(hash, bset->n_ineq & 0xFF);
4482 for (i = 0; i < bset->n_ineq; ++i) {
4484 c_hash = isl_seq_get_hash(bset->ineq[i], 1 + total);
4485 isl_hash_hash(hash, c_hash);
4487 isl_hash_byte(hash, bset->n_div & 0xFF);
4488 for (i = 0; i < bset->n_div; ++i) {
4490 if (isl_int_is_zero(bset->div[i][0]))
4492 isl_hash_byte(hash, i & 0xFF);
4493 c_hash = isl_seq_get_hash(bset->div[i], 1 + 1 + total);
4494 isl_hash_hash(hash, c_hash);
4496 isl_basic_set_free(bset);
4500 uint32_t isl_set_get_hash(struct isl_set *set)
4507 set = isl_set_copy(set);
4508 set = isl_set_normalize(set);
4512 hash = isl_hash_init();
4513 for (i = 0; i < set->n; ++i) {
4515 bset_hash = isl_basic_set_get_hash(set->p[i]);
4516 isl_hash_hash(hash, bset_hash);
4524 /* Check if the value for dimension dim is completely determined
4525 * by the values of the other parameters and variables.
4526 * That is, check if dimension dim is involved in an equality.
4528 int isl_basic_set_dim_is_unique(struct isl_basic_set *bset, unsigned dim)
4535 nparam = isl_basic_set_n_param(bset);
4536 for (i = 0; i < bset->n_eq; ++i)
4537 if (!isl_int_is_zero(bset->eq[i][1 + nparam + dim]))
4542 /* Check if the value for dimension dim is completely determined
4543 * by the values of the other parameters and variables.
4544 * That is, check if dimension dim is involved in an equality
4545 * for each of the subsets.
4547 int isl_set_dim_is_unique(struct isl_set *set, unsigned dim)
4553 for (i = 0; i < set->n; ++i) {
4555 unique = isl_basic_set_dim_is_unique(set->p[i], dim);