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_map *isl_basic_map_extend_constraints(
825 struct isl_basic_map *base, unsigned n_eq, unsigned n_ineq)
829 return isl_basic_map_extend_dim(base, isl_dim_copy(base->dim),
833 struct isl_basic_map *isl_basic_map_extend(struct isl_basic_map *base,
834 unsigned nparam, unsigned n_in, unsigned n_out, unsigned extra,
835 unsigned n_eq, unsigned n_ineq)
837 struct isl_basic_map *bmap;
842 dim = isl_dim_alloc(base->ctx, nparam, n_in, n_out);
846 bmap = isl_basic_map_extend_dim(base, dim, extra, n_eq, n_ineq);
850 struct isl_basic_set *isl_basic_set_extend(struct isl_basic_set *base,
851 unsigned nparam, unsigned dim, unsigned extra,
852 unsigned n_eq, unsigned n_ineq)
854 return (struct isl_basic_set *)
855 isl_basic_map_extend((struct isl_basic_map *)base,
856 nparam, 0, dim, extra, n_eq, n_ineq);
859 struct isl_basic_set *isl_basic_set_extend_constraints(
860 struct isl_basic_set *base, unsigned n_eq, unsigned n_ineq)
862 return (struct isl_basic_set *)
863 isl_basic_map_extend_constraints((struct isl_basic_map *)base,
867 struct isl_basic_set *isl_basic_set_cow(struct isl_basic_set *bset)
869 return (struct isl_basic_set *)
870 isl_basic_map_cow((struct isl_basic_map *)bset);
873 struct isl_basic_map *isl_basic_map_cow(struct isl_basic_map *bmap)
880 bmap = isl_basic_map_dup(bmap);
882 ISL_F_CLR(bmap, ISL_BASIC_SET_FINAL);
886 struct isl_set *isl_set_cow(struct isl_set *set)
894 return isl_set_dup(set);
897 struct isl_map *isl_map_cow(struct isl_map *map)
905 return isl_map_dup(map);
908 static void swap_vars(struct isl_blk blk, isl_int *a,
909 unsigned a_len, unsigned b_len)
911 isl_seq_cpy(blk.data, a+a_len, b_len);
912 isl_seq_cpy(blk.data+b_len, a, a_len);
913 isl_seq_cpy(a, blk.data, b_len+a_len);
916 struct isl_basic_set *isl_basic_set_swap_vars(
917 struct isl_basic_set *bset, unsigned n)
927 nparam = isl_basic_set_n_param(bset);
928 dim = isl_basic_set_n_dim(bset);
929 isl_assert(bset->ctx, n <= dim, goto error);
934 bset = isl_basic_set_cow(bset);
938 blk = isl_blk_alloc(bset->ctx, dim);
939 if (isl_blk_is_error(blk))
942 for (i = 0; i < bset->n_eq; ++i)
944 bset->eq[i]+1+nparam, n, dim - n);
946 for (i = 0; i < bset->n_ineq; ++i)
948 bset->ineq[i]+1+nparam, n, dim - n);
950 for (i = 0; i < bset->n_div; ++i)
952 bset->div[i]+1+1+nparam, n, dim - n);
954 isl_blk_free(bset->ctx, blk);
956 ISL_F_CLR(bset, ISL_BASIC_SET_NORMALIZED);
960 isl_basic_set_free(bset);
964 struct isl_set *isl_set_swap_vars(struct isl_set *set, unsigned n)
967 set = isl_set_cow(set);
971 for (i = 0; i < set->n; ++i) {
972 set->p[i] = isl_basic_set_swap_vars(set->p[i], n);
978 ISL_F_CLR(set, ISL_SET_NORMALIZED);
982 struct isl_basic_map *isl_basic_map_set_to_empty(struct isl_basic_map *bmap)
988 total = isl_basic_map_total_dim(bmap);
989 isl_basic_map_free_div(bmap, bmap->n_div);
990 isl_basic_map_free_inequality(bmap, bmap->n_ineq);
992 isl_basic_map_free_equality(bmap, bmap->n_eq-1);
994 isl_basic_map_alloc_equality(bmap);
998 isl_int_set_si(bmap->eq[i][0], 1);
999 isl_seq_clr(bmap->eq[i]+1, total);
1000 ISL_F_SET(bmap, ISL_BASIC_MAP_EMPTY);
1001 return isl_basic_map_finalize(bmap);
1003 isl_basic_map_free(bmap);
1007 struct isl_basic_set *isl_basic_set_set_to_empty(struct isl_basic_set *bset)
1009 return (struct isl_basic_set *)
1010 isl_basic_map_set_to_empty((struct isl_basic_map *)bset);
1013 static void swap_div(struct isl_basic_map *bmap, int a, int b)
1016 unsigned off = isl_dim_total(bmap->dim);
1017 isl_int *t = bmap->div[a];
1018 bmap->div[a] = bmap->div[b];
1021 for (i = 0; i < bmap->n_eq; ++i)
1022 isl_int_swap(bmap->eq[i][1+off+a], bmap->eq[i][1+off+b]);
1024 for (i = 0; i < bmap->n_ineq; ++i)
1025 isl_int_swap(bmap->ineq[i][1+off+a], bmap->ineq[i][1+off+b]);
1027 for (i = 0; i < bmap->n_div; ++i)
1028 isl_int_swap(bmap->div[i][1+1+off+a], bmap->div[i][1+1+off+b]);
1029 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1032 /* Eliminate the specified n dimensions starting at first from the
1033 * constraints using Fourier-Motzkin, The dimensions themselves
1036 struct isl_set *isl_set_eliminate_dims(struct isl_set *set,
1037 unsigned first, unsigned n)
1047 set = isl_set_cow(set);
1050 isl_assert(set->ctx, first+n <= isl_set_n_dim(set), goto error);
1051 nparam = isl_set_n_param(set);
1053 for (i = 0; i < set->n; ++i) {
1054 set->p[i] = isl_basic_set_eliminate_vars(set->p[i],
1065 /* Project out n dimensions starting at first using Fourier-Motzkin */
1066 struct isl_set *isl_set_remove_dims(struct isl_set *set,
1067 unsigned first, unsigned n)
1069 set = isl_set_eliminate_dims(set, first, n);
1070 set = isl_set_drop_dims(set, first, n);
1074 struct isl_basic_set *isl_basic_set_remove_divs(struct isl_basic_set *bset)
1076 bset = isl_basic_set_eliminate_vars(bset, isl_dim_total(bset->dim),
1084 struct isl_set *isl_set_remove_divs(struct isl_set *set)
1093 set = isl_set_cow(set);
1097 for (i = 0; i < set->n; ++i) {
1098 set->p[i] = isl_basic_set_remove_divs(set->p[i]);
1108 struct isl_basic_map *isl_basic_map_remove(struct isl_basic_map *bmap,
1109 enum isl_dim_type type, unsigned first, unsigned n)
1113 isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
1117 bmap = isl_basic_map_eliminate_vars(bmap,
1118 isl_basic_map_offset(bmap, type) - 1 + first, n);
1119 bmap = isl_basic_map_drop(bmap, type, first, n);
1122 isl_basic_map_free(bmap);
1126 struct isl_map *isl_map_remove(struct isl_map *map,
1127 enum isl_dim_type type, unsigned first, unsigned n)
1135 map = isl_map_cow(map);
1138 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
1140 for (i = 0; i < map->n; ++i) {
1141 map->p[i] = isl_basic_map_eliminate_vars(map->p[i],
1142 isl_basic_map_offset(map->p[i], type) - 1 + first, n);
1146 map = isl_map_drop(map, type, first, n);
1153 /* Project out n inputs starting at first using Fourier-Motzkin */
1154 struct isl_map *isl_map_remove_inputs(struct isl_map *map,
1155 unsigned first, unsigned n)
1157 return isl_map_remove(map, isl_dim_in, first, n);
1160 /* Project out n dimensions starting at first using Fourier-Motzkin */
1161 struct isl_basic_set *isl_basic_set_remove_dims(struct isl_basic_set *bset,
1162 unsigned first, unsigned n)
1164 unsigned nparam = isl_basic_set_n_param(bset);
1165 bset = isl_basic_set_eliminate_vars(bset, nparam + first, n);
1166 bset = isl_basic_set_drop_dims(bset, first, n);
1170 static void dump_term(struct isl_basic_map *bmap,
1171 isl_int c, int pos, FILE *out)
1174 unsigned in = isl_basic_map_n_in(bmap);
1175 unsigned dim = in + isl_basic_map_n_out(bmap);
1176 unsigned nparam = isl_basic_map_n_param(bmap);
1178 isl_int_print(out, c, 0);
1180 if (!isl_int_is_one(c))
1181 isl_int_print(out, c, 0);
1182 if (pos < 1 + nparam) {
1183 name = isl_dim_get_name(bmap->dim,
1184 isl_dim_param, pos - 1);
1186 fprintf(out, "%s", name);
1188 fprintf(out, "p%d", pos - 1);
1189 } else if (pos < 1 + nparam + in)
1190 fprintf(out, "i%d", pos - 1 - nparam);
1191 else if (pos < 1 + nparam + dim)
1192 fprintf(out, "o%d", pos - 1 - nparam - in);
1194 fprintf(out, "e%d", pos - 1 - nparam - dim);
1198 static void dump_constraint_sign(struct isl_basic_map *bmap, isl_int *c,
1199 int sign, FILE *out)
1203 unsigned len = 1 + isl_basic_map_total_dim(bmap);
1207 for (i = 0, first = 1; i < len; ++i) {
1208 if (isl_int_sgn(c[i]) * sign <= 0)
1211 fprintf(out, " + ");
1213 isl_int_abs(v, c[i]);
1214 dump_term(bmap, v, i, out);
1221 static void dump_constraint(struct isl_basic_map *bmap, isl_int *c,
1222 const char *op, FILE *out, int indent)
1226 fprintf(out, "%*s", indent, "");
1228 dump_constraint_sign(bmap, c, 1, out);
1229 fprintf(out, " %s ", op);
1230 dump_constraint_sign(bmap, c, -1, out);
1234 for (i = bmap->n_div; i < bmap->extra; ++i) {
1235 if (isl_int_is_zero(c[1+isl_dim_total(bmap->dim)+i]))
1237 fprintf(out, "%*s", indent, "");
1238 fprintf(out, "ERROR: unused div coefficient not zero\n");
1243 static void dump_constraints(struct isl_basic_map *bmap,
1244 isl_int **c, unsigned n,
1245 const char *op, FILE *out, int indent)
1249 for (i = 0; i < n; ++i)
1250 dump_constraint(bmap, c[i], op, out, indent);
1253 static void dump_affine(struct isl_basic_map *bmap, isl_int *exp, FILE *out)
1257 unsigned total = isl_basic_map_total_dim(bmap);
1259 for (j = 0; j < 1 + total; ++j) {
1260 if (isl_int_is_zero(exp[j]))
1262 if (!first && isl_int_is_pos(exp[j]))
1264 dump_term(bmap, exp[j], j, out);
1269 static void dump(struct isl_basic_map *bmap, FILE *out, int indent)
1273 dump_constraints(bmap, bmap->eq, bmap->n_eq, "=", out, indent);
1274 dump_constraints(bmap, bmap->ineq, bmap->n_ineq, ">=", out, indent);
1276 for (i = 0; i < bmap->n_div; ++i) {
1277 fprintf(out, "%*s", indent, "");
1278 fprintf(out, "e%d = [(", i);
1279 dump_affine(bmap, bmap->div[i]+1, out);
1281 isl_int_print(out, bmap->div[i][0], 0);
1282 fprintf(out, "]\n");
1286 void isl_basic_set_dump(struct isl_basic_set *bset, FILE *out, int indent)
1289 fprintf(out, "null basic set\n");
1293 fprintf(out, "%*s", indent, "");
1294 fprintf(out, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n",
1295 bset->ref, bset->dim->nparam, bset->dim->n_out,
1296 bset->extra, bset->flags);
1297 dump((struct isl_basic_map *)bset, out, indent);
1300 void isl_basic_map_dump(struct isl_basic_map *bmap, FILE *out, int indent)
1303 fprintf(out, "null basic map\n");
1307 fprintf(out, "%*s", indent, "");
1308 fprintf(out, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, "
1309 "flags: %x, n_name: %d\n",
1311 bmap->dim->nparam, bmap->dim->n_in, bmap->dim->n_out,
1312 bmap->extra, bmap->flags, bmap->dim->n_name);
1313 dump(bmap, out, indent);
1316 int isl_inequality_negate(struct isl_basic_map *bmap, unsigned pos)
1321 total = isl_basic_map_total_dim(bmap);
1322 isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
1323 isl_seq_neg(bmap->ineq[pos], bmap->ineq[pos], 1 + total);
1324 isl_int_sub_ui(bmap->ineq[pos][0], bmap->ineq[pos][0], 1);
1325 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1329 struct isl_set *isl_set_alloc_dim(struct isl_dim *dim, int n, unsigned flags)
1331 struct isl_set *set;
1335 isl_assert(dim->ctx, dim->n_in == 0, return NULL);
1336 isl_assert(dim->ctx, n >= 0, return NULL);
1337 set = isl_alloc(dim->ctx, struct isl_set,
1338 sizeof(struct isl_set) +
1339 n * sizeof(struct isl_basic_set *));
1343 set->ctx = dim->ctx;
1344 isl_ctx_ref(set->ctx);
1356 struct isl_set *isl_set_alloc(struct isl_ctx *ctx,
1357 unsigned nparam, unsigned dim, int n, unsigned flags)
1359 struct isl_set *set;
1360 struct isl_dim *dims;
1362 dims = isl_dim_alloc(ctx, nparam, 0, dim);
1366 set = isl_set_alloc_dim(dims, n, flags);
1370 struct isl_set *isl_set_dup(struct isl_set *set)
1373 struct isl_set *dup;
1378 dup = isl_set_alloc_dim(isl_dim_copy(set->dim), set->n, set->flags);
1381 for (i = 0; i < set->n; ++i)
1382 dup = isl_set_add(dup, isl_basic_set_copy(set->p[i]));
1386 struct isl_set *isl_set_from_basic_set(struct isl_basic_set *bset)
1388 struct isl_set *set;
1393 set = isl_set_alloc_dim(isl_dim_copy(bset->dim), 1, ISL_MAP_DISJOINT);
1395 isl_basic_set_free(bset);
1398 return isl_set_add(set, bset);
1401 struct isl_map *isl_map_from_basic_map(struct isl_basic_map *bmap)
1403 struct isl_map *map;
1408 map = isl_map_alloc_dim(isl_dim_copy(bmap->dim), 1, ISL_MAP_DISJOINT);
1410 isl_basic_map_free(bmap);
1413 return isl_map_add(map, bmap);
1416 struct isl_set *isl_set_add(struct isl_set *set, struct isl_basic_set *bset)
1420 isl_assert(set->ctx, isl_dim_equal(set->dim, bset->dim), goto error);
1421 isl_assert(set->ctx, set->n < set->size, goto error);
1422 set->p[set->n] = bset;
1429 isl_basic_set_free(bset);
1433 void isl_set_free(struct isl_set *set)
1443 isl_ctx_deref(set->ctx);
1444 for (i = 0; i < set->n; ++i)
1445 isl_basic_set_free(set->p[i]);
1446 isl_dim_free(set->dim);
1450 void isl_set_dump(struct isl_set *set, FILE *out, int indent)
1455 fprintf(out, "null set\n");
1459 fprintf(out, "%*s", indent, "");
1460 fprintf(out, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
1461 set->ref, set->n, set->dim->nparam, set->dim->n_out,
1463 for (i = 0; i < set->n; ++i) {
1464 fprintf(out, "%*s", indent, "");
1465 fprintf(out, "basic set %d:\n", i);
1466 isl_basic_set_dump(set->p[i], out, indent+4);
1470 void isl_map_dump(struct isl_map *map, FILE *out, int indent)
1475 fprintf(out, "null map\n");
1479 fprintf(out, "%*s", indent, "");
1480 fprintf(out, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, "
1481 "flags: %x, n_name: %d\n",
1482 map->ref, map->n, map->dim->nparam, map->dim->n_in,
1483 map->dim->n_out, map->flags, map->dim->n_name);
1484 for (i = 0; i < map->n; ++i) {
1485 fprintf(out, "%*s", indent, "");
1486 fprintf(out, "basic map %d:\n", i);
1487 isl_basic_map_dump(map->p[i], out, indent+4);
1491 struct isl_basic_map *isl_basic_map_intersect_domain(
1492 struct isl_basic_map *bmap, struct isl_basic_set *bset)
1494 struct isl_basic_map *bmap_domain;
1495 struct isl_dim *dim;
1500 isl_assert(bset->ctx, isl_dim_match(bmap->dim, isl_dim_param,
1501 bset->dim, isl_dim_param), goto error);
1503 if (isl_dim_size(bset->dim, isl_dim_set) != 0)
1504 isl_assert(bset->ctx,
1505 isl_basic_map_compatible_domain(bmap, bset), goto error);
1507 bmap = isl_basic_map_extend_dim(bmap, isl_dim_copy(bmap->dim),
1508 bset->n_div, bset->n_eq, bset->n_ineq);
1511 dim = isl_dim_reverse(isl_dim_copy(bset->dim));
1512 bmap_domain = isl_basic_map_from_basic_set(bset, dim);
1513 bmap = add_constraints(bmap, bmap_domain, 0, 0);
1515 bmap = isl_basic_map_simplify(bmap);
1516 return isl_basic_map_finalize(bmap);
1518 isl_basic_map_free(bmap);
1519 isl_basic_set_free(bset);
1523 struct isl_basic_map *isl_basic_map_intersect_range(
1524 struct isl_basic_map *bmap, struct isl_basic_set *bset)
1526 struct isl_basic_map *bmap_range;
1531 isl_assert(bset->ctx, isl_dim_match(bmap->dim, isl_dim_param,
1532 bset->dim, isl_dim_param), goto error);
1534 if (isl_dim_size(bset->dim, isl_dim_set) != 0)
1535 isl_assert(bset->ctx,
1536 isl_basic_map_compatible_range(bmap, bset), goto error);
1538 bmap = isl_basic_map_extend_dim(bmap, isl_dim_copy(bmap->dim),
1539 bset->n_div, bset->n_eq, bset->n_ineq);
1542 bmap_range = isl_basic_map_from_basic_set(bset, isl_dim_copy(bset->dim));
1543 bmap = add_constraints(bmap, bmap_range, 0, 0);
1545 bmap = isl_basic_map_simplify(bmap);
1546 return isl_basic_map_finalize(bmap);
1548 isl_basic_map_free(bmap);
1549 isl_basic_set_free(bset);
1553 struct isl_basic_map *isl_basic_map_intersect(
1554 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
1556 if (!bmap1 || !bmap2)
1559 isl_assert(bmap1->ctx, isl_dim_match(bmap1->dim, isl_dim_param,
1560 bmap2->dim, isl_dim_param), goto error);
1561 if (isl_dim_total(bmap1->dim) ==
1562 isl_dim_size(bmap1->dim, isl_dim_param) &&
1563 isl_dim_total(bmap2->dim) !=
1564 isl_dim_size(bmap2->dim, isl_dim_param))
1565 return isl_basic_map_intersect(bmap2, bmap1);
1567 if (isl_dim_total(bmap2->dim) !=
1568 isl_dim_size(bmap2->dim, isl_dim_param))
1569 isl_assert(bmap1->ctx,
1570 isl_dim_equal(bmap1->dim, bmap2->dim), goto error);
1572 bmap1 = isl_basic_map_extend_dim(bmap1, isl_dim_copy(bmap1->dim),
1573 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
1576 bmap1 = add_constraints(bmap1, bmap2, 0, 0);
1578 bmap1 = isl_basic_map_simplify(bmap1);
1579 return isl_basic_map_finalize(bmap1);
1581 isl_basic_map_free(bmap1);
1582 isl_basic_map_free(bmap2);
1586 struct isl_basic_set *isl_basic_set_intersect(
1587 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
1589 return (struct isl_basic_set *)
1590 isl_basic_map_intersect(
1591 (struct isl_basic_map *)bset1,
1592 (struct isl_basic_map *)bset2);
1595 struct isl_map *isl_map_intersect(struct isl_map *map1, struct isl_map *map2)
1598 struct isl_map *result;
1604 isl_assert(map1->ctx, isl_dim_match(map1->dim, isl_dim_param,
1605 map2->dim, isl_dim_param), goto error);
1606 if (isl_dim_total(map1->dim) ==
1607 isl_dim_size(map1->dim, isl_dim_param) &&
1608 isl_dim_total(map2->dim) != isl_dim_size(map2->dim, isl_dim_param))
1609 return isl_map_intersect(map2, map1);
1611 if (isl_dim_total(map2->dim) != isl_dim_size(map2->dim, isl_dim_param))
1612 isl_assert(map1->ctx,
1613 isl_dim_equal(map1->dim, map2->dim), goto error);
1615 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
1616 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
1617 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
1619 result = isl_map_alloc_dim(isl_dim_copy(map1->dim),
1620 map1->n * map2->n, flags);
1623 for (i = 0; i < map1->n; ++i)
1624 for (j = 0; j < map2->n; ++j) {
1625 struct isl_basic_map *part;
1626 part = isl_basic_map_intersect(
1627 isl_basic_map_copy(map1->p[i]),
1628 isl_basic_map_copy(map2->p[j]));
1629 if (isl_basic_map_is_empty(part))
1630 isl_basic_map_free(part);
1632 result = isl_map_add(result, part);
1645 struct isl_set *isl_set_intersect(struct isl_set *set1, struct isl_set *set2)
1647 return (struct isl_set *)
1648 isl_map_intersect((struct isl_map *)set1,
1649 (struct isl_map *)set2);
1652 struct isl_basic_map *isl_basic_map_reverse(struct isl_basic_map *bmap)
1654 struct isl_dim *dim;
1655 struct isl_basic_set *bset;
1660 bmap = isl_basic_map_cow(bmap);
1663 dim = isl_dim_reverse(isl_dim_copy(bmap->dim));
1664 in = isl_basic_map_n_in(bmap);
1665 bset = isl_basic_set_from_basic_map(bmap);
1666 bset = isl_basic_set_swap_vars(bset, in);
1667 return isl_basic_map_from_basic_set(bset, dim);
1670 /* Turn final n dimensions into existentially quantified variables.
1672 struct isl_basic_set *isl_basic_set_project_out(
1673 struct isl_basic_set *bset, unsigned n, unsigned flags)
1683 isl_assert(bset->ctx, n <= isl_basic_set_n_dim(bset), goto error);
1688 bset = isl_basic_set_cow(bset);
1690 row_size = 1 + isl_dim_total(bset->dim) + bset->extra;
1691 old = bset->block2.data;
1692 bset->block2 = isl_blk_extend(bset->ctx, bset->block2,
1693 (bset->extra + n) * (1 + row_size));
1694 if (!bset->block2.data)
1696 new_div = isl_alloc_array(ctx, isl_int *, bset->extra + n);
1699 for (i = 0; i < n; ++i) {
1700 new_div[i] = bset->block2.data +
1701 (bset->extra + i) * (1 + row_size);
1702 isl_seq_clr(new_div[i], 1 + row_size);
1704 for (i = 0; i < bset->extra; ++i)
1705 new_div[n + i] = bset->block2.data + (bset->div[i] - old);
1707 bset->div = new_div;
1710 bset->dim = isl_dim_drop_outputs(bset->dim,
1711 isl_basic_set_n_dim(bset) - n, n);
1714 bset = isl_basic_set_simplify(bset);
1715 return isl_basic_set_finalize(bset);
1717 isl_basic_set_free(bset);
1721 struct isl_basic_map *add_divs(struct isl_basic_map *bmap, unsigned n)
1725 for (i = 0; i < n; ++i) {
1726 j = isl_basic_map_alloc_div(bmap);
1729 isl_seq_clr(bmap->div[j], 1+1+isl_basic_map_total_dim(bmap));
1733 isl_basic_map_free(bmap);
1737 struct isl_basic_map *isl_basic_map_apply_range(
1738 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
1740 struct isl_dim *dim_result = NULL;
1741 struct isl_basic_map *bmap;
1742 unsigned n_in, n_out, n, nparam, total, pos;
1743 struct isl_dim_map *dim_map1, *dim_map2;
1745 if (!bmap1 || !bmap2)
1748 dim_result = isl_dim_join(isl_dim_copy(bmap1->dim),
1749 isl_dim_copy(bmap2->dim));
1751 n_in = isl_basic_map_n_in(bmap1);
1752 n_out = isl_basic_map_n_out(bmap2);
1753 n = isl_basic_map_n_out(bmap1);
1754 nparam = isl_basic_map_n_param(bmap1);
1756 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + n;
1757 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
1758 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
1759 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
1760 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
1761 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
1762 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_in);
1763 isl_dim_map_div(dim_map1, bmap1, pos += n_out);
1764 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
1765 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
1766 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
1768 bmap = isl_basic_map_alloc_dim(dim_result,
1769 bmap1->n_div + bmap2->n_div + n,
1770 bmap1->n_eq + bmap2->n_eq,
1771 bmap1->n_ineq + bmap2->n_ineq);
1772 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
1773 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
1774 bmap = add_divs(bmap, n);
1775 bmap = isl_basic_map_simplify(bmap);
1776 return isl_basic_map_finalize(bmap);
1778 isl_basic_map_free(bmap1);
1779 isl_basic_map_free(bmap2);
1783 struct isl_basic_set *isl_basic_set_apply(
1784 struct isl_basic_set *bset, struct isl_basic_map *bmap)
1789 isl_assert(set->ctx, isl_basic_map_compatible_domain(bmap, bset),
1792 return (struct isl_basic_set *)
1793 isl_basic_map_apply_range((struct isl_basic_map *)bset, bmap);
1795 isl_basic_set_free(bset);
1796 isl_basic_map_free(bmap);
1800 struct isl_basic_map *isl_basic_map_apply_domain(
1801 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
1803 if (!bmap1 || !bmap2)
1807 isl_basic_map_n_in(bmap1) == isl_basic_map_n_in(bmap2), goto error);
1809 isl_basic_map_n_param(bmap1) == isl_basic_map_n_param(bmap2),
1812 bmap1 = isl_basic_map_reverse(bmap1);
1813 bmap1 = isl_basic_map_apply_range(bmap1, bmap2);
1814 return isl_basic_map_reverse(bmap1);
1816 isl_basic_map_free(bmap1);
1817 isl_basic_map_free(bmap2);
1821 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
1822 * A \cap B -> f(A) + f(B)
1824 struct isl_basic_map *isl_basic_map_sum(
1825 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
1827 unsigned n_in, n_out, nparam, total, pos;
1828 struct isl_basic_map *bmap = NULL;
1829 struct isl_dim_map *dim_map1, *dim_map2;
1832 if (!bmap1 || !bmap2)
1835 isl_assert(bmap1->ctx, isl_dim_equal(bmap1->dim, bmap2->dim),
1838 nparam = isl_basic_map_n_param(bmap1);
1839 n_in = isl_basic_map_n_in(bmap1);
1840 n_out = isl_basic_map_n_out(bmap1);
1842 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + 2 * n_out;
1843 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
1844 dim_map2 = isl_dim_map_alloc(bmap2->ctx, total);
1845 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
1846 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos);
1847 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
1848 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
1849 isl_dim_map_div(dim_map1, bmap1, pos += n_in + n_out);
1850 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
1851 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
1852 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_out);
1854 bmap = isl_basic_map_alloc_dim(isl_dim_copy(bmap1->dim),
1855 bmap1->n_div + bmap2->n_div + 2 * n_out,
1856 bmap1->n_eq + bmap2->n_eq + n_out,
1857 bmap1->n_ineq + bmap2->n_ineq);
1858 for (i = 0; i < n_out; ++i) {
1859 int j = isl_basic_map_alloc_equality(bmap);
1862 isl_seq_clr(bmap->eq[j], 1+total);
1863 isl_int_set_si(bmap->eq[j][1+nparam+n_in+i], -1);
1864 isl_int_set_si(bmap->eq[j][1+pos+i], 1);
1865 isl_int_set_si(bmap->eq[j][1+pos-n_out+i], 1);
1867 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
1868 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
1869 bmap = add_divs(bmap, 2 * n_out);
1871 bmap = isl_basic_map_simplify(bmap);
1872 return isl_basic_map_finalize(bmap);
1874 isl_basic_map_free(bmap);
1875 isl_basic_map_free(bmap1);
1876 isl_basic_map_free(bmap2);
1880 /* Given a basic map A -> f(A), construct A -> -f(A).
1882 struct isl_basic_map *isl_basic_map_neg(struct isl_basic_map *bmap)
1887 bmap = isl_basic_map_cow(bmap);
1891 n = isl_basic_map_dim(bmap, isl_dim_out);
1892 off = isl_basic_map_offset(bmap, isl_dim_out);
1893 for (i = 0; i < bmap->n_eq; ++i)
1894 for (j = 0; j < n; ++j)
1895 isl_int_neg(bmap->eq[i][off+j], bmap->eq[i][off+j]);
1896 for (i = 0; i < bmap->n_ineq; ++i)
1897 for (j = 0; j < n; ++j)
1898 isl_int_neg(bmap->ineq[i][off+j], bmap->ineq[i][off+j]);
1899 for (i = 0; i < bmap->n_div; ++i)
1900 for (j = 0; j < n; ++j)
1901 isl_int_neg(bmap->div[i][1+off+j], bmap->div[i][1+off+j]);
1902 return isl_basic_map_finalize(bmap);
1905 /* Given a basic map A -> f(A) and an integer d, construct a basic map
1906 * A -> floor(f(A)/d).
1908 struct isl_basic_map *isl_basic_map_floordiv(struct isl_basic_map *bmap,
1911 unsigned n_in, n_out, nparam, total, pos;
1912 struct isl_basic_map *result = NULL;
1913 struct isl_dim_map *dim_map;
1919 nparam = isl_basic_map_n_param(bmap);
1920 n_in = isl_basic_map_n_in(bmap);
1921 n_out = isl_basic_map_n_out(bmap);
1923 total = nparam + n_in + n_out + bmap->n_div + n_out;
1924 dim_map = isl_dim_map_alloc(bmap->ctx, total);
1925 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_param, pos = 0);
1926 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_in, pos += nparam);
1927 isl_dim_map_div(dim_map, bmap, pos += n_in + n_out);
1928 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_out, pos += bmap->n_div);
1930 result = isl_basic_map_alloc_dim(isl_dim_copy(bmap->dim),
1931 bmap->n_div + n_out,
1932 bmap->n_eq, bmap->n_ineq + 2 * n_out);
1933 result = add_constraints_dim_map(result, bmap, dim_map);
1934 result = add_divs(result, n_out);
1935 for (i = 0; i < n_out; ++i) {
1937 j = isl_basic_map_alloc_inequality(result);
1940 isl_seq_clr(result->ineq[j], 1+total);
1941 isl_int_neg(result->ineq[j][1+nparam+n_in+i], d);
1942 isl_int_set_si(result->ineq[j][1+pos+i], 1);
1943 j = isl_basic_map_alloc_inequality(result);
1946 isl_seq_clr(result->ineq[j], 1+total);
1947 isl_int_set(result->ineq[j][1+nparam+n_in+i], d);
1948 isl_int_set_si(result->ineq[j][1+pos+i], -1);
1949 isl_int_sub_ui(result->ineq[j][0], d, 1);
1952 result = isl_basic_map_simplify(result);
1953 return isl_basic_map_finalize(result);
1955 isl_basic_map_free(result);
1959 static struct isl_basic_map *var_equal(struct isl_basic_map *bmap, unsigned pos)
1965 i = isl_basic_map_alloc_equality(bmap);
1968 nparam = isl_basic_map_n_param(bmap);
1969 n_in = isl_basic_map_n_in(bmap);
1970 isl_seq_clr(bmap->eq[i], 1 + isl_basic_map_total_dim(bmap));
1971 isl_int_set_si(bmap->eq[i][1+nparam+pos], -1);
1972 isl_int_set_si(bmap->eq[i][1+nparam+n_in+pos], 1);
1973 return isl_basic_map_finalize(bmap);
1975 isl_basic_map_free(bmap);
1979 static struct isl_basic_map *var_more(struct isl_basic_map *bmap, unsigned pos)
1985 i = isl_basic_map_alloc_inequality(bmap);
1988 nparam = isl_basic_map_n_param(bmap);
1989 n_in = isl_basic_map_n_in(bmap);
1990 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
1991 isl_int_set_si(bmap->ineq[i][0], -1);
1992 isl_int_set_si(bmap->ineq[i][1+nparam+pos], -1);
1993 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], 1);
1994 return isl_basic_map_finalize(bmap);
1996 isl_basic_map_free(bmap);
2000 static struct isl_basic_map *var_less(struct isl_basic_map *bmap, unsigned pos)
2006 i = isl_basic_map_alloc_inequality(bmap);
2009 nparam = isl_basic_map_n_param(bmap);
2010 n_in = isl_basic_map_n_in(bmap);
2011 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
2012 isl_int_set_si(bmap->ineq[i][0], -1);
2013 isl_int_set_si(bmap->ineq[i][1+nparam+pos], 1);
2014 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], -1);
2015 return isl_basic_map_finalize(bmap);
2017 isl_basic_map_free(bmap);
2021 struct isl_basic_map *isl_basic_map_equal(struct isl_dim *dim, unsigned n_equal)
2024 struct isl_basic_map *bmap;
2025 bmap = isl_basic_map_alloc_dim(dim, 0, n_equal, 0);
2028 for (i = 0; i < n_equal && bmap; ++i)
2029 bmap = var_equal(bmap, i);
2030 return isl_basic_map_finalize(bmap);
2033 struct isl_basic_map *isl_basic_map_less_at(struct isl_dim *dim, unsigned pos)
2036 struct isl_basic_map *bmap;
2037 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
2040 for (i = 0; i < pos && bmap; ++i)
2041 bmap = var_equal(bmap, i);
2043 bmap = var_less(bmap, pos);
2044 return isl_basic_map_finalize(bmap);
2047 struct isl_basic_map *isl_basic_map_more_at(struct isl_dim *dim, unsigned pos)
2050 struct isl_basic_map *bmap;
2051 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
2054 for (i = 0; i < pos && bmap; ++i)
2055 bmap = var_equal(bmap, i);
2057 bmap = var_more(bmap, pos);
2058 return isl_basic_map_finalize(bmap);
2061 struct isl_basic_map *isl_basic_map_from_basic_set(
2062 struct isl_basic_set *bset, struct isl_dim *dim)
2064 struct isl_basic_map *bmap;
2066 bset = isl_basic_set_cow(bset);
2070 isl_assert(bset->ctx, isl_dim_compatible(bset->dim, dim), goto error);
2071 isl_dim_free(bset->dim);
2072 bmap = (struct isl_basic_map *) bset;
2074 return isl_basic_map_finalize(bmap);
2076 isl_basic_set_free(bset);
2081 struct isl_basic_set *isl_basic_set_from_basic_map(struct isl_basic_map *bmap)
2085 if (bmap->dim->n_in == 0)
2086 return (struct isl_basic_set *)bmap;
2087 bmap = isl_basic_map_cow(bmap);
2090 bmap->dim = isl_dim_cow(bmap->dim);
2093 bmap->dim->n_out += bmap->dim->n_in;
2094 bmap->dim->n_in = 0;
2095 bmap = isl_basic_map_finalize(bmap);
2096 return (struct isl_basic_set *)bmap;
2098 isl_basic_map_free(bmap);
2102 /* For a div d = floor(f/m), add the constraints
2105 * -(f-(n-1)) + m d >= 0
2107 * Note that the second constraint is the negation of
2111 static int add_div_constraints(struct isl_basic_map *bmap, unsigned div)
2114 unsigned total = isl_basic_map_total_dim(bmap);
2115 unsigned div_pos = 1 + total - bmap->n_div + div;
2117 i = isl_basic_map_alloc_inequality(bmap);
2120 isl_seq_cpy(bmap->ineq[i], bmap->div[div]+1, 1+total);
2121 isl_int_neg(bmap->ineq[i][div_pos], bmap->div[div][0]);
2123 j = isl_basic_map_alloc_inequality(bmap);
2126 isl_seq_neg(bmap->ineq[j], bmap->ineq[i], 1 + total);
2127 isl_int_add(bmap->ineq[j][0], bmap->ineq[j][0], bmap->ineq[j][div_pos]);
2128 isl_int_sub_ui(bmap->ineq[j][0], bmap->ineq[j][0], 1);
2132 struct isl_basic_set *isl_basic_map_underlying_set(
2133 struct isl_basic_map *bmap)
2137 if (bmap->dim->nparam == 0 && bmap->dim->n_in == 0 && bmap->n_div == 0)
2138 return (struct isl_basic_set *)bmap;
2139 bmap = isl_basic_map_cow(bmap);
2142 bmap->dim = isl_dim_underlying(bmap->dim, bmap->n_div);
2145 bmap->extra -= bmap->n_div;
2147 bmap = isl_basic_map_finalize(bmap);
2148 return (struct isl_basic_set *)bmap;
2153 struct isl_basic_map *isl_basic_map_overlying_set(
2154 struct isl_basic_set *bset, struct isl_basic_map *like)
2156 struct isl_basic_map *bmap;
2157 struct isl_ctx *ctx;
2164 isl_assert(ctx, bset->n_div == 0, goto error);
2165 isl_assert(ctx, isl_basic_set_n_param(bset) == 0, goto error);
2166 isl_assert(ctx, bset->dim->n_out == isl_basic_map_total_dim(like),
2168 if (isl_dim_equal(bset->dim, like->dim) && like->n_div == 0) {
2169 isl_basic_map_free(like);
2170 return (struct isl_basic_map *)bset;
2172 bset = isl_basic_set_cow(bset);
2175 total = bset->dim->n_out + bset->extra;
2176 bmap = (struct isl_basic_map *)bset;
2177 isl_dim_free(bmap->dim);
2178 bmap->dim = isl_dim_copy(like->dim);
2181 bmap->n_div = like->n_div;
2182 bmap->extra += like->n_div;
2185 ltotal = total - bmap->extra + like->extra;
2188 bmap->block2 = isl_blk_extend(ctx, bmap->block2,
2189 bmap->extra * (1 + 1 + total));
2190 if (isl_blk_is_error(bmap->block2))
2192 bmap->div = isl_realloc_array(ctx, bmap->div, isl_int *,
2196 for (i = 0; i < bmap->extra; ++i)
2197 bmap->div[i] = bmap->block2.data + i * (1 + 1 + total);
2198 for (i = 0; i < like->n_div; ++i) {
2199 isl_seq_cpy(bmap->div[i], like->div[i], 1 + 1 + ltotal);
2200 isl_seq_clr(bmap->div[i]+1+1+ltotal, total - ltotal);
2202 bmap = isl_basic_map_extend_constraints(bmap,
2203 0, 2 * like->n_div);
2204 for (i = 0; i < like->n_div; ++i) {
2205 if (isl_int_is_zero(bmap->div[i][0]))
2207 if (add_div_constraints(bmap, i) < 0)
2211 isl_basic_map_free(like);
2212 bmap = isl_basic_map_simplify(bmap);
2213 bmap = isl_basic_map_finalize(bmap);
2216 isl_basic_map_free(like);
2217 isl_basic_set_free(bset);
2221 struct isl_basic_set *isl_basic_set_from_underlying_set(
2222 struct isl_basic_set *bset, struct isl_basic_set *like)
2224 return (struct isl_basic_set *)
2225 isl_basic_map_overlying_set(bset, (struct isl_basic_map *)like);
2228 struct isl_set *isl_set_from_underlying_set(
2229 struct isl_set *set, struct isl_basic_set *like)
2235 isl_assert(set->ctx, set->dim->n_out == isl_basic_set_total_dim(like),
2237 if (isl_dim_equal(set->dim, like->dim) && like->n_div == 0) {
2238 isl_basic_set_free(like);
2241 set = isl_set_cow(set);
2244 for (i = 0; i < set->n; ++i) {
2245 set->p[i] = isl_basic_set_from_underlying_set(set->p[i],
2246 isl_basic_set_copy(like));
2250 isl_dim_free(set->dim);
2251 set->dim = isl_dim_copy(like->dim);
2254 isl_basic_set_free(like);
2257 isl_basic_set_free(like);
2262 struct isl_set *isl_map_underlying_set(struct isl_map *map)
2266 map = isl_map_cow(map);
2269 map->dim = isl_dim_cow(map->dim);
2273 for (i = 1; i < map->n; ++i)
2274 isl_assert(map->ctx, map->p[0]->n_div == map->p[i]->n_div,
2276 for (i = 0; i < map->n; ++i) {
2277 map->p[i] = (struct isl_basic_map *)
2278 isl_basic_map_underlying_set(map->p[i]);
2283 map->dim = isl_dim_underlying(map->dim, 0);
2285 isl_dim_free(map->dim);
2286 map->dim = isl_dim_copy(map->p[0]->dim);
2290 return (struct isl_set *)map;
2296 struct isl_set *isl_set_to_underlying_set(struct isl_set *set)
2298 return (struct isl_set *)isl_map_underlying_set((struct isl_map *)set);
2301 struct isl_basic_set *isl_basic_map_domain(struct isl_basic_map *bmap)
2303 struct isl_basic_set *domain;
2307 n_out = isl_basic_map_n_out(bmap);
2308 domain = isl_basic_set_from_basic_map(bmap);
2309 return isl_basic_set_project_out(domain, n_out, 0);
2312 struct isl_basic_set *isl_basic_map_range(struct isl_basic_map *bmap)
2314 return isl_basic_map_domain(isl_basic_map_reverse(bmap));
2317 struct isl_set *isl_map_range(struct isl_map *map)
2320 struct isl_set *set;
2324 map = isl_map_cow(map);
2328 set = (struct isl_set *) map;
2329 if (set->dim->n_in != 0) {
2330 set->dim = isl_dim_drop_inputs(set->dim, 0, set->dim->n_in);
2334 for (i = 0; i < map->n; ++i) {
2335 set->p[i] = isl_basic_map_range(map->p[i]);
2339 ISL_F_CLR(set, ISL_MAP_DISJOINT);
2340 ISL_F_CLR(set, ISL_SET_NORMALIZED);
2347 struct isl_map *isl_map_from_set(struct isl_set *set, struct isl_dim *dim)
2350 struct isl_map *map = NULL;
2352 set = isl_set_cow(set);
2355 isl_assert(set->ctx, isl_dim_compatible(set->dim, dim), goto error);
2356 map = (struct isl_map *)set;
2357 for (i = 0; i < set->n; ++i) {
2358 map->p[i] = isl_basic_map_from_basic_set(
2359 set->p[i], isl_dim_copy(dim));
2363 isl_dim_free(map->dim);
2372 struct isl_map *isl_map_from_range(struct isl_set *set)
2374 return (struct isl_map *)set;
2377 struct isl_set *isl_set_from_map(struct isl_map *map)
2380 struct isl_set *set = NULL;
2384 map = isl_map_cow(map);
2387 map->dim = isl_dim_cow(map->dim);
2390 map->dim->n_out += map->dim->n_in;
2392 set = (struct isl_set *)map;
2393 for (i = 0; i < map->n; ++i) {
2394 set->p[i] = isl_basic_set_from_basic_map(map->p[i]);
2404 struct isl_map *isl_map_alloc_dim(struct isl_dim *dim, int n, unsigned flags)
2406 struct isl_map *map;
2410 isl_assert(dim->ctx, n >= 0, return NULL);
2411 map = isl_alloc(dim->ctx, struct isl_map,
2412 sizeof(struct isl_map) +
2413 n * sizeof(struct isl_basic_map *));
2417 map->ctx = dim->ctx;
2418 isl_ctx_ref(map->ctx);
2430 struct isl_map *isl_map_alloc(struct isl_ctx *ctx,
2431 unsigned nparam, unsigned in, unsigned out, int n,
2434 struct isl_map *map;
2435 struct isl_dim *dims;
2437 dims = isl_dim_alloc(ctx, nparam, in, out);
2441 map = isl_map_alloc_dim(dims, n, flags);
2445 struct isl_basic_map *isl_basic_map_empty(struct isl_ctx *ctx,
2446 unsigned nparam, unsigned in, unsigned out)
2448 struct isl_basic_map *bmap;
2449 bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, 1, 0);
2450 bmap = isl_basic_map_set_to_empty(bmap);
2454 struct isl_basic_set *isl_basic_set_empty(struct isl_dim *dim)
2456 struct isl_basic_set *bset;
2457 bset = isl_basic_set_alloc_dim(dim, 0, 1, 0);
2458 bset = isl_basic_set_set_to_empty(bset);
2462 struct isl_basic_map *isl_basic_map_empty_like(struct isl_basic_map *model)
2464 struct isl_basic_map *bmap;
2467 bmap = isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
2468 bmap = isl_basic_map_set_to_empty(bmap);
2472 struct isl_basic_map *isl_basic_map_empty_like_map(struct isl_map *model)
2474 struct isl_basic_map *bmap;
2477 bmap = isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
2478 bmap = isl_basic_map_set_to_empty(bmap);
2482 struct isl_basic_set *isl_basic_set_empty_like(struct isl_basic_set *model)
2484 struct isl_basic_set *bset;
2487 bset = isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
2488 bset = isl_basic_set_set_to_empty(bset);
2492 struct isl_basic_map *isl_basic_map_universe(struct isl_dim *dim)
2494 struct isl_basic_map *bmap;
2495 bmap = isl_basic_map_alloc_dim(dim, 0, 0, 0);
2499 struct isl_basic_set *isl_basic_set_universe(struct isl_dim *dim)
2501 struct isl_basic_set *bset;
2502 bset = isl_basic_set_alloc_dim(dim, 0, 0, 0);
2506 struct isl_basic_set *isl_basic_set_universe_like(struct isl_basic_set *model)
2510 return isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
2513 struct isl_map *isl_map_empty(struct isl_dim *dim)
2515 return isl_map_alloc_dim(dim, 0, ISL_MAP_DISJOINT);
2518 struct isl_map *isl_map_empty_like(struct isl_map *model)
2522 return isl_map_alloc_dim(isl_dim_copy(model->dim), 0, ISL_MAP_DISJOINT);
2525 struct isl_map *isl_map_empty_like_basic_map(struct isl_basic_map *model)
2529 return isl_map_alloc_dim(isl_dim_copy(model->dim), 0, ISL_MAP_DISJOINT);
2532 struct isl_set *isl_set_empty(struct isl_dim *dim)
2534 return isl_set_alloc_dim(dim, 0, ISL_MAP_DISJOINT);
2537 struct isl_set *isl_set_empty_like(struct isl_set *model)
2541 return isl_set_empty(isl_dim_copy(model->dim));
2544 struct isl_set *isl_set_universe(struct isl_dim *dim)
2546 struct isl_set *set;
2549 set = isl_set_alloc_dim(isl_dim_copy(dim), 1, ISL_MAP_DISJOINT);
2550 set = isl_set_add(set, isl_basic_set_universe(dim));
2554 struct isl_map *isl_map_dup(struct isl_map *map)
2557 struct isl_map *dup;
2561 dup = isl_map_alloc_dim(isl_dim_copy(map->dim), map->n, map->flags);
2562 for (i = 0; i < map->n; ++i)
2563 dup = isl_map_add(dup, isl_basic_map_copy(map->p[i]));
2567 struct isl_map *isl_map_add(struct isl_map *map, struct isl_basic_map *bmap)
2571 isl_assert(map->ctx, isl_dim_equal(map->dim, bmap->dim), goto error);
2572 isl_assert(map->ctx, map->n < map->size, goto error);
2573 map->p[map->n] = bmap;
2575 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
2581 isl_basic_map_free(bmap);
2585 void isl_map_free(struct isl_map *map)
2595 isl_ctx_deref(map->ctx);
2596 for (i = 0; i < map->n; ++i)
2597 isl_basic_map_free(map->p[i]);
2598 isl_dim_free(map->dim);
2602 struct isl_map *isl_map_extend(struct isl_map *base,
2603 unsigned nparam, unsigned n_in, unsigned n_out)
2607 base = isl_map_cow(base);
2611 base->dim = isl_dim_extend(base->dim, nparam, n_in, n_out);
2614 for (i = 0; i < base->n; ++i) {
2615 base->p[i] = isl_basic_map_extend_dim(base->p[i],
2616 isl_dim_copy(base->dim), 0, 0, 0);
2626 struct isl_set *isl_set_extend(struct isl_set *base,
2627 unsigned nparam, unsigned dim)
2629 return (struct isl_set *)isl_map_extend((struct isl_map *)base,
2633 static struct isl_basic_map *isl_basic_map_fix_pos(struct isl_basic_map *bmap,
2634 unsigned pos, int value)
2638 bmap = isl_basic_map_cow(bmap);
2639 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
2640 j = isl_basic_map_alloc_equality(bmap);
2643 isl_seq_clr(bmap->eq[j], 1 + isl_basic_map_total_dim(bmap));
2644 isl_int_set_si(bmap->eq[j][pos], -1);
2645 isl_int_set_si(bmap->eq[j][0], value);
2646 bmap = isl_basic_map_simplify(bmap);
2647 return isl_basic_map_finalize(bmap);
2649 isl_basic_map_free(bmap);
2653 struct isl_basic_map *isl_basic_map_fix_si(struct isl_basic_map *bmap,
2654 enum isl_dim_type type, unsigned pos, int value)
2658 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
2659 return isl_basic_map_fix_pos(bmap, isl_basic_map_offset(bmap, type) + pos,
2662 isl_basic_map_free(bmap);
2666 struct isl_basic_set *isl_basic_set_fix_si(struct isl_basic_set *bset,
2667 enum isl_dim_type type, unsigned pos, int value)
2669 return (struct isl_basic_set *)
2670 isl_basic_map_fix_si((struct isl_basic_map *)bset,
2674 struct isl_basic_map *isl_basic_map_fix_input_si(struct isl_basic_map *bmap,
2675 unsigned input, int value)
2677 return isl_basic_map_fix_si(bmap, isl_dim_in, input, value);
2680 struct isl_basic_set *isl_basic_set_fix_dim_si(struct isl_basic_set *bset,
2681 unsigned dim, int value)
2683 return (struct isl_basic_set *)
2684 isl_basic_map_fix_si((struct isl_basic_map *)bset,
2685 isl_dim_set, dim, value);
2688 struct isl_map *isl_map_fix_si(struct isl_map *map,
2689 enum isl_dim_type type, unsigned pos, int value)
2693 map = isl_map_cow(map);
2697 isl_assert(ctx, pos < isl_map_dim(map, type), goto error);
2698 for (i = 0; i < map->n; ++i) {
2699 map->p[i] = isl_basic_map_fix_si(map->p[i], type, pos, value);
2703 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
2710 struct isl_map *isl_map_fix_input_si(struct isl_map *map,
2711 unsigned input, int value)
2713 return isl_map_fix_si(map, isl_dim_in, input, value);
2716 struct isl_set *isl_set_fix_dim_si(struct isl_set *set, unsigned dim, int value)
2718 return (struct isl_set *)
2719 isl_map_fix_si((struct isl_map *)set, isl_dim_set, dim, value);
2722 struct isl_basic_set *isl_basic_set_lower_bound_dim(struct isl_basic_set *bset,
2723 unsigned dim, isl_int value)
2728 bset = isl_basic_set_cow(bset);
2729 bset = isl_basic_set_extend_constraints(bset, 0, 1);
2730 j = isl_basic_set_alloc_inequality(bset);
2733 isl_seq_clr(bset->ineq[j], 1 + isl_basic_set_total_dim(bset));
2734 isl_int_set_si(bset->ineq[j][1 + isl_basic_set_n_param(bset) + dim], 1);
2735 isl_int_neg(bset->ineq[j][0], value);
2736 bset = isl_basic_set_simplify(bset);
2737 return isl_basic_set_finalize(bset);
2739 isl_basic_set_free(bset);
2743 struct isl_set *isl_set_lower_bound_dim(struct isl_set *set, unsigned dim,
2748 set = isl_set_cow(set);
2752 isl_assert(set->ctx, dim < isl_set_n_dim(set), goto error);
2753 for (i = 0; i < set->n; ++i) {
2754 set->p[i] = isl_basic_set_lower_bound_dim(set->p[i], dim, value);
2764 struct isl_map *isl_map_reverse(struct isl_map *map)
2769 map = isl_map_cow(map);
2773 map->dim = isl_dim_reverse(map->dim);
2776 for (i = 0; i < map->n; ++i) {
2777 map->p[i] = isl_basic_map_reverse(map->p[i]);
2781 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
2788 struct isl_map *isl_basic_map_lexmax(
2789 struct isl_basic_map *bmap, struct isl_basic_set *dom,
2790 struct isl_set **empty)
2792 return isl_pip_basic_map_lexmax(bmap, dom, empty);
2795 struct isl_map *isl_basic_map_lexmin(
2796 struct isl_basic_map *bmap, struct isl_basic_set *dom,
2797 struct isl_set **empty)
2799 return isl_pip_basic_map_lexmin(bmap, dom, empty);
2802 struct isl_set *isl_basic_set_lexmin(struct isl_basic_set *bset)
2804 struct isl_basic_map *bmap = NULL;
2805 struct isl_basic_set *dom = NULL;
2806 struct isl_map *min;
2807 struct isl_dim *param_dim;
2811 bmap = isl_basic_map_from_basic_set(bset, isl_dim_copy(bset->dim));
2814 param_dim = isl_dim_domain(isl_dim_copy(bmap->dim));
2815 dom = isl_basic_set_universe(param_dim);
2818 min = isl_basic_map_lexmin(bmap, dom, NULL);
2819 return isl_map_range(min);
2821 isl_basic_map_free(bmap);
2825 struct isl_map *isl_basic_map_compute_divs(struct isl_basic_map *bmap)
2832 off = isl_dim_total(bmap->dim);
2833 for (i = 0; i < bmap->n_div; ++i) {
2834 if (isl_int_is_zero(bmap->div[i][0]))
2835 return isl_pip_basic_map_compute_divs(bmap);
2836 isl_assert(bmap->ctx, isl_int_is_zero(bmap->div[i][1+1+off+i]),
2839 return isl_map_from_basic_map(bmap);
2841 isl_basic_map_free(bmap);
2845 struct isl_map *isl_map_compute_divs(struct isl_map *map)
2848 struct isl_map *res;
2854 res = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[0]));
2855 for (i = 1 ; i < map->n; ++i) {
2857 r2 = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[i]));
2858 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT))
2859 res = isl_map_union_disjoint(res, r2);
2861 res = isl_map_union(res, r2);
2868 struct isl_set *isl_basic_set_compute_divs(struct isl_basic_set *bset)
2870 return (struct isl_set *)
2871 isl_basic_map_compute_divs((struct isl_basic_map *)bset);
2874 struct isl_set *isl_set_compute_divs(struct isl_set *set)
2876 return (struct isl_set *)
2877 isl_map_compute_divs((struct isl_map *)set);
2880 struct isl_set *isl_map_domain(struct isl_map *map)
2883 struct isl_set *set;
2888 map = isl_map_cow(map);
2892 set = (struct isl_set *)map;
2893 set->dim = isl_dim_domain(set->dim);
2896 for (i = 0; i < map->n; ++i) {
2897 set->p[i] = isl_basic_map_domain(map->p[i]);
2901 ISL_F_CLR(set, ISL_MAP_DISJOINT);
2902 ISL_F_CLR(set, ISL_SET_NORMALIZED);
2909 struct isl_map *isl_map_union_disjoint(
2910 struct isl_map *map1, struct isl_map *map2)
2914 struct isl_map *map = NULL;
2928 isl_assert(map1->ctx, isl_dim_equal(map1->dim, map2->dim), goto error);
2930 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
2931 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
2932 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
2934 map = isl_map_alloc_dim(isl_dim_copy(map1->dim),
2935 map1->n + map2->n, flags);
2938 for (i = 0; i < map1->n; ++i) {
2939 map = isl_map_add(map,
2940 isl_basic_map_copy(map1->p[i]));
2944 for (i = 0; i < map2->n; ++i) {
2945 map = isl_map_add(map,
2946 isl_basic_map_copy(map2->p[i]));
2960 struct isl_map *isl_map_union(struct isl_map *map1, struct isl_map *map2)
2962 map1 = isl_map_union_disjoint(map1, map2);
2966 ISL_F_CLR(map1, ISL_MAP_DISJOINT);
2970 struct isl_set *isl_set_union_disjoint(
2971 struct isl_set *set1, struct isl_set *set2)
2973 return (struct isl_set *)
2974 isl_map_union_disjoint(
2975 (struct isl_map *)set1, (struct isl_map *)set2);
2978 struct isl_set *isl_set_union(struct isl_set *set1, struct isl_set *set2)
2980 return (struct isl_set *)
2981 isl_map_union((struct isl_map *)set1, (struct isl_map *)set2);
2984 struct isl_map *isl_map_intersect_range(
2985 struct isl_map *map, struct isl_set *set)
2988 struct isl_map *result;
2994 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT) &&
2995 ISL_F_ISSET(set, ISL_MAP_DISJOINT))
2996 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
2998 result = isl_map_alloc_dim(isl_dim_copy(map->dim),
2999 map->n * set->n, flags);
3002 for (i = 0; i < map->n; ++i)
3003 for (j = 0; j < set->n; ++j) {
3004 result = isl_map_add(result,
3005 isl_basic_map_intersect_range(
3006 isl_basic_map_copy(map->p[i]),
3007 isl_basic_set_copy(set->p[j])));
3020 struct isl_map *isl_map_intersect_domain(
3021 struct isl_map *map, struct isl_set *set)
3023 return isl_map_reverse(
3024 isl_map_intersect_range(isl_map_reverse(map), set));
3027 struct isl_map *isl_map_apply_domain(
3028 struct isl_map *map1, struct isl_map *map2)
3032 map1 = isl_map_reverse(map1);
3033 map1 = isl_map_apply_range(map1, map2);
3034 return isl_map_reverse(map1);
3041 struct isl_map *isl_map_apply_range(
3042 struct isl_map *map1, struct isl_map *map2)
3044 struct isl_dim *dim_result;
3045 struct isl_map *result;
3054 dim_result = isl_dim_join(isl_dim_copy(map1->dim),
3055 isl_dim_copy(map2->dim));
3057 result = isl_map_alloc_dim(dim_result, map1->n * map2->n, 0);
3060 for (i = 0; i < map1->n; ++i)
3061 for (j = 0; j < map2->n; ++j) {
3062 result = isl_map_add(result,
3063 isl_basic_map_apply_range(
3064 isl_basic_map_copy(map1->p[i]),
3065 isl_basic_map_copy(map2->p[j])));
3071 if (result && result->n <= 1)
3072 ISL_F_SET(result, ISL_MAP_DISJOINT);
3081 * returns range - domain
3083 struct isl_basic_set *isl_basic_map_deltas(struct isl_basic_map *bmap)
3085 struct isl_basic_set *bset;
3092 dim = isl_basic_map_n_in(bmap);
3093 nparam = isl_basic_map_n_param(bmap);
3094 isl_assert(bmap->ctx, dim == isl_basic_map_n_out(bmap), goto error);
3095 bset = isl_basic_set_from_basic_map(bmap);
3096 bset = isl_basic_set_extend(bset, nparam, 3*dim, 0, dim, 0);
3097 bset = isl_basic_set_swap_vars(bset, 2*dim);
3098 for (i = 0; i < dim; ++i) {
3099 int j = isl_basic_map_alloc_equality(
3100 (struct isl_basic_map *)bset);
3103 isl_seq_clr(bset->eq[j], 1 + isl_basic_set_total_dim(bset));
3104 isl_int_set_si(bset->eq[j][1+nparam+i], 1);
3105 isl_int_set_si(bset->eq[j][1+nparam+dim+i], 1);
3106 isl_int_set_si(bset->eq[j][1+nparam+2*dim+i], -1);
3108 return isl_basic_set_project_out(bset, 2*dim, 0);
3110 isl_basic_map_free(bmap);
3115 * returns range - domain
3117 struct isl_set *isl_map_deltas(struct isl_map *map)
3120 struct isl_set *result;
3125 isl_assert(map->ctx, isl_map_n_in(map) == isl_map_n_out(map), goto error);
3126 result = isl_set_alloc(map->ctx, isl_map_n_param(map),
3127 isl_map_n_in(map), map->n, map->flags);
3130 for (i = 0; i < map->n; ++i)
3131 result = isl_set_add(result,
3132 isl_basic_map_deltas(isl_basic_map_copy(map->p[i])));
3140 static struct isl_basic_map *basic_map_identity(struct isl_dim *dims)
3142 struct isl_basic_map *bmap;
3150 nparam = dims->nparam;
3152 bmap = isl_basic_map_alloc_dim(dims, 0, dim, 0);
3156 for (i = 0; i < dim; ++i) {
3157 int j = isl_basic_map_alloc_equality(bmap);
3160 isl_seq_clr(bmap->eq[j], 1 + isl_basic_map_total_dim(bmap));
3161 isl_int_set_si(bmap->eq[j][1+nparam+i], 1);
3162 isl_int_set_si(bmap->eq[j][1+nparam+dim+i], -1);
3164 return isl_basic_map_finalize(bmap);
3166 isl_basic_map_free(bmap);
3170 struct isl_basic_map *isl_basic_map_identity(struct isl_dim *set_dim)
3172 struct isl_dim *dim = isl_dim_map(set_dim);
3175 return basic_map_identity(dim);
3178 struct isl_basic_map *isl_basic_map_identity_like(struct isl_basic_map *model)
3180 if (!model || !model->dim)
3182 isl_assert(model->ctx,
3183 model->dim->n_in == model->dim->n_out, return NULL);
3184 return basic_map_identity(isl_dim_copy(model->dim));
3187 static struct isl_map *map_identity(struct isl_dim *dim)
3189 struct isl_map *map = isl_map_alloc_dim(dim, 1, ISL_MAP_DISJOINT);
3190 return isl_map_add(map, basic_map_identity(isl_dim_copy(dim)));
3193 struct isl_map *isl_map_identity(struct isl_dim *set_dim)
3195 struct isl_dim *dim = isl_dim_map(set_dim);
3198 return map_identity(dim);
3201 struct isl_map *isl_map_identity_like(struct isl_basic_map *model)
3203 if (!model || !model->dim)
3205 isl_assert(model->ctx,
3206 model->dim->n_in == model->dim->n_out, return NULL);
3207 return map_identity(isl_dim_copy(model->dim));
3210 int isl_set_is_equal(struct isl_set *set1, struct isl_set *set2)
3212 return isl_map_is_equal((struct isl_map *)set1, (struct isl_map *)set2);
3215 int isl_set_is_subset(struct isl_set *set1, struct isl_set *set2)
3217 return isl_map_is_subset(
3218 (struct isl_map *)set1, (struct isl_map *)set2);
3221 int isl_basic_map_is_subset(
3222 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3225 struct isl_map *map1;
3226 struct isl_map *map2;
3228 if (!bmap1 || !bmap2)
3231 map1 = isl_map_from_basic_map(isl_basic_map_copy(bmap1));
3232 map2 = isl_map_from_basic_map(isl_basic_map_copy(bmap2));
3234 is_subset = isl_map_is_subset(map1, map2);
3242 int isl_basic_map_is_equal(
3243 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3247 if (!bmap1 || !bmap2)
3249 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
3252 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
3256 int isl_basic_set_is_equal(
3257 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
3259 return isl_basic_map_is_equal(
3260 (struct isl_basic_map *)bset1, (struct isl_basic_map *)bset2);
3263 int isl_map_is_empty(struct isl_map *map)
3270 for (i = 0; i < map->n; ++i) {
3271 is_empty = isl_basic_map_is_empty(map->p[i]);
3280 int isl_map_fast_is_empty(struct isl_map *map)
3285 int isl_set_is_empty(struct isl_set *set)
3287 return isl_map_is_empty((struct isl_map *)set);
3290 int isl_map_is_subset(struct isl_map *map1, struct isl_map *map2)
3294 struct isl_map *diff;
3299 if (isl_map_is_empty(map1))
3302 if (isl_map_is_empty(map2))
3305 diff = isl_map_subtract(isl_map_copy(map1), isl_map_copy(map2));
3309 is_subset = isl_map_is_empty(diff);
3315 int isl_map_is_equal(struct isl_map *map1, struct isl_map *map2)
3321 is_subset = isl_map_is_subset(map1, map2);
3324 is_subset = isl_map_is_subset(map2, map1);
3328 int isl_basic_map_is_strict_subset(
3329 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3333 if (!bmap1 || !bmap2)
3335 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
3338 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
3339 if (is_subset == -1)
3344 static int basic_map_contains(struct isl_basic_map *bmap, struct isl_vec *vec)
3350 total = 1 + isl_basic_map_total_dim(bmap);
3351 if (total != vec->size)
3356 for (i = 0; i < bmap->n_eq; ++i) {
3357 isl_seq_inner_product(vec->block.data, bmap->eq[i], total, &s);
3358 if (!isl_int_is_zero(s)) {
3364 for (i = 0; i < bmap->n_ineq; ++i) {
3365 isl_seq_inner_product(vec->block.data, bmap->ineq[i], total, &s);
3366 if (isl_int_is_neg(s)) {
3377 int isl_basic_map_is_universe(struct isl_basic_map *bmap)
3381 return bmap->n_eq == 0 && bmap->n_ineq == 0;
3384 int isl_basic_map_is_empty(struct isl_basic_map *bmap)
3386 struct isl_basic_set *bset = NULL;
3387 struct isl_vec *sample = NULL;
3394 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY))
3397 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL)) {
3398 struct isl_basic_map *copy = isl_basic_map_copy(bmap);
3399 copy = isl_basic_map_convex_hull(copy);
3400 empty = ISL_F_ISSET(copy, ISL_BASIC_MAP_EMPTY);
3401 isl_basic_map_free(copy);
3405 total = 1 + isl_basic_map_total_dim(bmap);
3406 if (bmap->sample && bmap->sample->size == total) {
3407 int contains = basic_map_contains(bmap, bmap->sample);
3413 bset = isl_basic_map_underlying_set(isl_basic_map_copy(bmap));
3416 sample = isl_basic_set_sample(bset);
3419 empty = sample->size == 0;
3421 isl_vec_free(bmap->ctx, bmap->sample);
3422 bmap->sample = sample;
3427 int isl_basic_set_is_empty(struct isl_basic_set *bset)
3429 return isl_basic_map_is_empty((struct isl_basic_map *)bset);
3432 struct isl_map *isl_basic_map_union(
3433 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3435 struct isl_map *map;
3436 if (!bmap1 || !bmap2)
3439 isl_assert(map1->ctx, isl_dim_equal(bmap1->dim, bmap2->dim), goto error);
3441 map = isl_map_alloc_dim(isl_dim_copy(bmap1->dim), 2, 0);
3444 map = isl_map_add(map, bmap1);
3445 map = isl_map_add(map, bmap2);
3448 isl_basic_map_free(bmap1);
3449 isl_basic_map_free(bmap2);
3453 struct isl_set *isl_basic_set_union(
3454 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
3456 return (struct isl_set *)isl_basic_map_union(
3457 (struct isl_basic_map *)bset1,
3458 (struct isl_basic_map *)bset2);
3461 /* Order divs such that any div only depends on previous divs */
3462 static struct isl_basic_map *order_divs(struct isl_basic_map *bmap)
3465 unsigned off = isl_dim_total(bmap->dim);
3467 for (i = 0; i < bmap->n_div; ++i) {
3469 pos = isl_seq_first_non_zero(bmap->div[i]+1+1+off+i,
3473 swap_div(bmap, i, pos);
3479 /* Look for a div in dst that corresponds to the div "div" in src.
3480 * The divs before "div" in src and dst are assumed to be the same.
3482 * Returns -1 if no corresponding div was found and the position
3483 * of the corresponding div in dst otherwise.
3485 static int find_div(struct isl_basic_map *dst,
3486 struct isl_basic_map *src, unsigned div)
3490 unsigned total = isl_dim_total(src->dim);
3492 isl_assert(dst->ctx, div <= dst->n_div, return -1);
3493 for (i = div; i < dst->n_div; ++i)
3494 if (isl_seq_eq(dst->div[i], src->div[div], 1+1+total+div) &&
3495 isl_seq_first_non_zero(dst->div[i]+1+1+total+div,
3496 dst->n_div - div) == -1)
3501 struct isl_basic_map *isl_basic_map_align_divs(
3502 struct isl_basic_map *dst, struct isl_basic_map *src)
3505 unsigned total = isl_dim_total(src->dim);
3510 if (src->n_div == 0)
3513 for (i = 0; i < src->n_div; ++i)
3514 isl_assert(src->ctx, !isl_int_is_zero(src->div[i][0]), goto error);
3516 src = order_divs(src);
3517 dst = isl_basic_map_extend_dim(dst, isl_dim_copy(dst->dim),
3518 src->n_div, 0, 2 * src->n_div);
3521 for (i = 0; i < src->n_div; ++i) {
3522 int j = find_div(dst, src, i);
3524 j = isl_basic_map_alloc_div(dst);
3527 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total+i);
3528 isl_seq_clr(dst->div[j]+1+1+total+i, dst->n_div - i);
3529 if (add_div_constraints(dst, j) < 0)
3533 swap_div(dst, i, j);
3537 isl_basic_map_free(dst);
3541 struct isl_basic_set *isl_basic_set_align_divs(
3542 struct isl_basic_set *dst, struct isl_basic_set *src)
3544 return (struct isl_basic_set *)isl_basic_map_align_divs(
3545 (struct isl_basic_map *)dst, (struct isl_basic_map *)src);
3548 struct isl_map *isl_map_align_divs(struct isl_map *map)
3552 map = isl_map_compute_divs(map);
3553 map = isl_map_cow(map);
3557 for (i = 1; i < map->n; ++i)
3558 map->p[0] = isl_basic_map_align_divs(map->p[0], map->p[i]);
3559 for (i = 1; i < map->n; ++i)
3560 map->p[i] = isl_basic_map_align_divs(map->p[i], map->p[0]);
3562 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3566 static struct isl_map *add_cut_constraint(struct isl_map *dst,
3567 struct isl_basic_map *src, isl_int *c,
3568 unsigned len, int oppose)
3570 struct isl_basic_map *copy = NULL;
3575 copy = isl_basic_map_copy(src);
3576 copy = isl_basic_map_cow(copy);
3579 copy = isl_basic_map_extend_constraints(copy, 0, 1);
3580 k = isl_basic_map_alloc_inequality(copy);
3584 isl_seq_neg(copy->ineq[k], c, len);
3586 isl_seq_cpy(copy->ineq[k], c, len);
3587 total = 1 + isl_basic_map_total_dim(copy);
3588 isl_seq_clr(copy->ineq[k]+len, total - len);
3589 isl_inequality_negate(copy, k);
3590 copy = isl_basic_map_simplify(copy);
3591 copy = isl_basic_map_finalize(copy);
3592 is_empty = isl_basic_map_is_empty(copy);
3596 dst = isl_map_add(dst, copy);
3598 isl_basic_map_free(copy);
3601 isl_basic_map_free(copy);
3606 static struct isl_map *subtract(struct isl_map *map, struct isl_basic_map *bmap)
3610 struct isl_map *rest = NULL;
3612 unsigned total = isl_basic_map_total_dim(bmap);
3619 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT))
3620 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
3622 max = map->n * (2 * bmap->n_eq + bmap->n_ineq);
3623 rest = isl_map_alloc_dim(isl_dim_copy(map->dim), max, flags);
3627 for (i = 0; i < map->n; ++i) {
3628 map->p[i] = isl_basic_map_align_divs(map->p[i], bmap);
3633 for (j = 0; j < map->n; ++j)
3634 map->p[j] = isl_basic_map_cow(map->p[j]);
3636 for (i = 0; i < bmap->n_eq; ++i) {
3637 for (j = 0; j < map->n; ++j) {
3638 rest = add_cut_constraint(rest,
3639 map->p[j], bmap->eq[i], 1+total, 0);
3643 rest = add_cut_constraint(rest,
3644 map->p[j], bmap->eq[i], 1+total, 1);
3648 map->p[j] = isl_basic_map_extend_constraints(map->p[j],
3652 k = isl_basic_map_alloc_equality(map->p[j]);
3655 isl_seq_cpy(map->p[j]->eq[k], bmap->eq[i], 1+total);
3656 isl_seq_clr(map->p[j]->eq[k]+1+total,
3657 map->p[j]->n_div - bmap->n_div);
3661 for (i = 0; i < bmap->n_ineq; ++i) {
3662 for (j = 0; j < map->n; ++j) {
3663 rest = add_cut_constraint(rest,
3664 map->p[j], bmap->ineq[i], 1+total, 0);
3668 map->p[j] = isl_basic_map_extend_constraints(map->p[j],
3672 k = isl_basic_map_alloc_inequality(map->p[j]);
3675 isl_seq_cpy(map->p[j]->ineq[k], bmap->ineq[i], 1+total);
3676 isl_seq_clr(map->p[j]->ineq[k]+1+total,
3677 map->p[j]->n_div - bmap->n_div);
3689 struct isl_map *isl_map_subtract(struct isl_map *map1, struct isl_map *map2)
3695 isl_assert(map1->ctx, isl_dim_equal(map1->dim, map2->dim), goto error);
3697 if (isl_map_is_empty(map2)) {
3702 map1 = isl_map_compute_divs(map1);
3703 map2 = isl_map_compute_divs(map2);
3707 for (i = 0; map1 && i < map2->n; ++i)
3708 map1 = subtract(map1, map2->p[i]);
3718 struct isl_set *isl_set_subtract(struct isl_set *set1, struct isl_set *set2)
3720 return (struct isl_set *)
3722 (struct isl_map *)set1, (struct isl_map *)set2);
3725 struct isl_set *isl_set_apply(struct isl_set *set, struct isl_map *map)
3729 isl_assert(set->ctx, isl_map_compatible_domain(map, set), goto error);
3730 map = isl_map_intersect_domain(map, set);
3731 set = isl_map_range(map);
3739 /* There is no need to cow as removing empty parts doesn't change
3740 * the meaning of the set.
3742 struct isl_map *isl_map_remove_empty_parts(struct isl_map *map)
3749 for (i = map->n-1; i >= 0; --i) {
3750 if (!ISL_F_ISSET(map->p[i], ISL_BASIC_MAP_EMPTY))
3752 isl_basic_map_free(map->p[i]);
3753 if (i != map->n-1) {
3754 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3755 map->p[i] = map->p[map->n-1];
3763 struct isl_set *isl_set_remove_empty_parts(struct isl_set *set)
3765 return (struct isl_set *)
3766 isl_map_remove_empty_parts((struct isl_map *)set);
3769 struct isl_basic_map *isl_map_copy_basic_map(struct isl_map *map)
3771 struct isl_basic_map *bmap;
3772 if (!map || map->n == 0)
3774 bmap = map->p[map->n-1];
3775 isl_assert(map->ctx, ISL_F_ISSET(bmap, ISL_BASIC_SET_FINAL), return NULL);
3776 return isl_basic_map_copy(bmap);
3779 struct isl_basic_set *isl_set_copy_basic_set(struct isl_set *set)
3781 (struct isl_basic_set *)isl_map_copy_basic_map((struct isl_map *)set);
3784 struct isl_map *isl_map_drop_basic_map(struct isl_map *map,
3785 struct isl_basic_map *bmap)
3791 for (i = map->n-1; i >= 0; --i) {
3792 if (map->p[i] != bmap)
3794 map = isl_map_cow(map);
3797 isl_basic_map_free(map->p[i]);
3798 if (i != map->n-1) {
3799 ISL_F_CLR(map, ISL_SET_NORMALIZED);
3800 map->p[i] = map->p[map->n-1];
3805 isl_basic_map_free(bmap);
3809 isl_basic_map_free(bmap);
3813 struct isl_set *isl_set_drop_basic_set(struct isl_set *set,
3814 struct isl_basic_set *bset)
3816 (struct isl_set *)isl_map_drop_basic_map((struct isl_map *)set,
3817 (struct isl_basic_map *)bset);
3820 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
3821 * for any common value of the parameters and dimensions preceding dim
3822 * in both basic sets, the values of dimension pos in bset1 are
3823 * smaller or larger than those in bset2.
3826 * 1 if bset1 follows bset2
3827 * -1 if bset1 precedes bset2
3828 * 0 if bset1 and bset2 are incomparable
3829 * -2 if some error occurred.
3831 int isl_basic_set_compare_at(struct isl_basic_set *bset1,
3832 struct isl_basic_set *bset2, int pos)
3834 struct isl_dim *dims;
3835 struct isl_basic_map *bmap1 = NULL;
3836 struct isl_basic_map *bmap2 = NULL;
3837 struct isl_ctx *ctx;
3838 struct isl_vec *obj;
3841 unsigned dim1, dim2;
3843 enum isl_lp_result res;
3846 if (!bset1 || !bset2)
3849 nparam = isl_basic_set_n_param(bset1);
3850 dim1 = isl_basic_set_n_dim(bset1);
3851 dim2 = isl_basic_set_n_dim(bset2);
3852 dims = isl_dim_alloc(bset1->ctx, nparam, pos, dim1 - pos);
3853 bmap1 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset1), dims);
3854 dims = isl_dim_alloc(bset2->ctx, nparam, pos, dim2 - pos);
3855 bmap2 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset2), dims);
3856 if (!bmap1 || !bmap2)
3858 bmap1 = isl_basic_map_extend(bmap1, nparam,
3859 pos, (dim1 - pos) + (dim2 - pos),
3860 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
3861 bmap1 = add_constraints(bmap1, bmap2, 0, dim1 - pos);
3864 total = isl_basic_map_total_dim(bmap1);
3866 obj = isl_vec_alloc(ctx, total);
3867 isl_seq_clr(obj->block.data, total);
3868 isl_int_set_si(obj->block.data[nparam+pos], 1);
3869 isl_int_set_si(obj->block.data[nparam+pos+(dim1-pos)], -1);
3874 res = isl_solve_lp(bmap1, 0, obj->block.data, ctx->one, &num, &den);
3875 if (res == isl_lp_empty)
3877 else if (res == isl_lp_ok && isl_int_is_pos(num))
3879 else if ((res == isl_lp_ok && isl_int_is_neg(num)) ||
3880 res == isl_lp_unbounded)
3886 isl_basic_map_free(bmap1);
3887 isl_vec_free(ctx, obj);
3890 isl_basic_map_free(bmap1);
3891 isl_basic_map_free(bmap2);
3895 static int isl_basic_map_fast_has_fixed_var(struct isl_basic_map *bmap,
3896 unsigned pos, isl_int *val)
3904 total = isl_basic_map_total_dim(bmap);
3905 for (i = 0, d = total-1; i < bmap->n_eq && d+1 > pos; ++i) {
3906 for (; d+1 > pos; --d)
3907 if (!isl_int_is_zero(bmap->eq[i][1+d]))
3911 if (isl_seq_first_non_zero(bmap->eq[i]+1, d) != -1)
3913 if (isl_seq_first_non_zero(bmap->eq[i]+1+d+1, total-d-1) != -1)
3915 if (!isl_int_is_one(bmap->eq[i][1+d]))
3918 isl_int_neg(*val, bmap->eq[i][0]);
3924 static int isl_map_fast_has_fixed_var(struct isl_map *map,
3925 unsigned pos, isl_int *val)
3937 return isl_basic_map_fast_has_fixed_var(map->p[0], pos, val);
3940 fixed = isl_basic_map_fast_has_fixed_var(map->p[0], pos, &v);
3941 for (i = 1; fixed == 1 && i < map->n; ++i) {
3942 fixed = isl_basic_map_fast_has_fixed_var(map->p[i], pos, &tmp);
3943 if (fixed == 1 && isl_int_ne(tmp, v))
3947 isl_int_set(*val, v);
3953 static int isl_set_fast_has_fixed_var(struct isl_set *set, unsigned pos,
3956 return isl_map_fast_has_fixed_var((struct isl_map *)set, pos, val);
3959 int isl_basic_map_fast_is_fixed(struct isl_basic_map *bmap,
3960 enum isl_dim_type type, unsigned pos, isl_int *val)
3962 if (pos >= isl_basic_map_dim(bmap, type))
3964 return isl_basic_map_fast_has_fixed_var(bmap,
3965 isl_basic_map_offset(bmap, type) - 1 + pos, val);
3968 /* Check if dimension dim has fixed value and if so and if val is not NULL,
3969 * then return this fixed value in *val.
3971 int isl_set_fast_dim_is_fixed(struct isl_set *set, unsigned dim, isl_int *val)
3973 return isl_set_fast_has_fixed_var(set, isl_set_n_param(set) + dim, val);
3976 /* Check if input variable in has fixed value and if so and if val is not NULL,
3977 * then return this fixed value in *val.
3979 int isl_map_fast_input_is_fixed(struct isl_map *map, unsigned in, isl_int *val)
3981 return isl_map_fast_has_fixed_var(map, isl_map_n_param(map) + in, val);
3984 /* Check if dimension dim has an (obvious) fixed lower bound and if so
3985 * and if val is not NULL, then return this lower bound in *val.
3987 int isl_basic_set_fast_dim_has_fixed_lower_bound(struct isl_basic_set *bset,
3988 unsigned dim, isl_int *val)
3990 int i, i_eq = -1, i_ineq = -1;
3997 total = isl_basic_set_total_dim(bset);
3998 nparam = isl_basic_set_n_param(bset);
3999 for (i = 0; i < bset->n_eq; ++i) {
4000 if (isl_int_is_zero(bset->eq[i][1+nparam+dim]))
4006 for (i = 0; i < bset->n_ineq; ++i) {
4007 if (!isl_int_is_pos(bset->ineq[i][1+nparam+dim]))
4009 if (i_eq != -1 || i_ineq != -1)
4013 if (i_eq == -1 && i_ineq == -1)
4015 c = i_eq != -1 ? bset->eq[i_eq] : bset->ineq[i_ineq];
4016 /* The coefficient should always be one due to normalization. */
4017 if (!isl_int_is_one(c[1+nparam+dim]))
4019 if (isl_seq_first_non_zero(c+1, nparam+dim) != -1)
4021 if (isl_seq_first_non_zero(c+1+nparam+dim+1,
4022 total - nparam - dim - 1) != -1)
4025 isl_int_neg(*val, c[0]);
4029 int isl_set_fast_dim_has_fixed_lower_bound(struct isl_set *set,
4030 unsigned dim, isl_int *val)
4042 return isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[0],
4046 fixed = isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[0],
4048 for (i = 1; fixed == 1 && i < set->n; ++i) {
4049 fixed = isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[i],
4051 if (fixed == 1 && isl_int_ne(tmp, v))
4055 isl_int_set(*val, v);
4066 static int qsort_constraint_cmp(const void *p1, const void *p2)
4068 const struct constraint *c1 = (const struct constraint *)p1;
4069 const struct constraint *c2 = (const struct constraint *)p2;
4070 unsigned size = isl_min(c1->size, c2->size);
4071 return isl_seq_cmp(c1->c, c2->c, size);
4074 static struct isl_basic_map *isl_basic_map_sort_constraints(
4075 struct isl_basic_map *bmap)
4078 struct constraint *c;
4083 total = isl_basic_map_total_dim(bmap);
4084 c = isl_alloc_array(bmap->ctx, struct constraint, bmap->n_ineq);
4087 for (i = 0; i < bmap->n_ineq; ++i) {
4089 c[i].c = bmap->ineq[i];
4091 qsort(c, bmap->n_ineq, sizeof(struct constraint), qsort_constraint_cmp);
4092 for (i = 0; i < bmap->n_ineq; ++i)
4093 bmap->ineq[i] = c[i].c;
4097 isl_basic_map_free(bmap);
4101 struct isl_basic_map *isl_basic_map_normalize(struct isl_basic_map *bmap)
4105 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_NORMALIZED))
4107 bmap = isl_basic_map_convex_hull(bmap);
4108 bmap = isl_basic_map_sort_constraints(bmap);
4109 ISL_F_SET(bmap, ISL_BASIC_MAP_NORMALIZED);
4113 struct isl_basic_set *isl_basic_set_normalize(struct isl_basic_set *bset)
4115 return (struct isl_basic_set *)isl_basic_map_normalize(
4116 (struct isl_basic_map *)bset);
4119 static int isl_basic_map_fast_cmp(const struct isl_basic_map *bmap1,
4120 const struct isl_basic_map *bmap2)
4127 if (isl_basic_map_n_param(bmap1) != isl_basic_map_n_param(bmap2))
4128 return isl_basic_map_n_param(bmap1) - isl_basic_map_n_param(bmap2);
4129 if (isl_basic_map_n_in(bmap1) != isl_basic_map_n_in(bmap2))
4130 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
4131 if (isl_basic_map_n_out(bmap1) != isl_basic_map_n_out(bmap2))
4132 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
4133 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY) &&
4134 ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
4136 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY))
4138 if (ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
4140 if (bmap1->n_eq != bmap2->n_eq)
4141 return bmap1->n_eq - bmap2->n_eq;
4142 if (bmap1->n_ineq != bmap2->n_ineq)
4143 return bmap1->n_ineq - bmap2->n_ineq;
4144 if (bmap1->n_div != bmap2->n_div)
4145 return bmap1->n_div - bmap2->n_div;
4146 total = isl_basic_map_total_dim(bmap1);
4147 for (i = 0; i < bmap1->n_eq; ++i) {
4148 cmp = isl_seq_cmp(bmap1->eq[i], bmap2->eq[i], 1+total);
4152 for (i = 0; i < bmap1->n_ineq; ++i) {
4153 cmp = isl_seq_cmp(bmap1->ineq[i], bmap2->ineq[i], 1+total);
4157 for (i = 0; i < bmap1->n_div; ++i) {
4158 cmp = isl_seq_cmp(bmap1->div[i], bmap2->div[i], 1+1+total);
4165 static int isl_basic_map_fast_is_equal(struct isl_basic_map *bmap1,
4166 struct isl_basic_map *bmap2)
4168 return isl_basic_map_fast_cmp(bmap1, bmap2) == 0;
4171 static int qsort_bmap_cmp(const void *p1, const void *p2)
4173 const struct isl_basic_map *bmap1 = *(const struct isl_basic_map **)p1;
4174 const struct isl_basic_map *bmap2 = *(const struct isl_basic_map **)p2;
4176 return isl_basic_map_fast_cmp(bmap1, bmap2);
4179 /* We normalize in place, but if anything goes wrong we need
4180 * to return NULL, so we need to make sure we don't change the
4181 * meaning of any possible other copies of map.
4183 struct isl_map *isl_map_normalize(struct isl_map *map)
4186 struct isl_basic_map *bmap;
4190 if (ISL_F_ISSET(map, ISL_MAP_NORMALIZED))
4192 for (i = 0; i < map->n; ++i) {
4193 bmap = isl_basic_map_normalize(isl_basic_map_copy(map->p[i]));
4196 isl_basic_map_free(map->p[i]);
4199 qsort(map->p, map->n, sizeof(struct isl_basic_map *), qsort_bmap_cmp);
4200 ISL_F_SET(map, ISL_MAP_NORMALIZED);
4201 map = isl_map_remove_empty_parts(map);
4204 for (i = map->n - 1; i >= 1; --i) {
4205 if (!isl_basic_map_fast_is_equal(map->p[i-1], map->p[i]))
4207 isl_basic_map_free(map->p[i-1]);
4208 for (j = i; j < map->n; ++j)
4209 map->p[j-1] = map->p[j];
4219 struct isl_set *isl_set_normalize(struct isl_set *set)
4221 return (struct isl_set *)isl_map_normalize((struct isl_map *)set);
4224 int isl_map_fast_is_equal(struct isl_map *map1, struct isl_map *map2)
4234 if (!isl_dim_equal(map1->dim, map2->dim))
4237 map1 = isl_map_copy(map1);
4238 map2 = isl_map_copy(map2);
4239 map1 = isl_map_normalize(map1);
4240 map2 = isl_map_normalize(map2);
4243 equal = map1->n == map2->n;
4244 for (i = 0; equal && i < map1->n; ++i) {
4245 equal = isl_basic_map_fast_is_equal(map1->p[i], map2->p[i]);
4258 int isl_set_fast_is_equal(struct isl_set *set1, struct isl_set *set2)
4260 return isl_map_fast_is_equal((struct isl_map *)set1,
4261 (struct isl_map *)set2);
4264 /* Return an interval that ranges from min to max (inclusive)
4266 struct isl_basic_set *isl_basic_set_interval(struct isl_ctx *ctx,
4267 isl_int min, isl_int max)
4270 struct isl_basic_set *bset = NULL;
4272 bset = isl_basic_set_alloc(ctx, 0, 1, 0, 0, 2);
4276 k = isl_basic_set_alloc_inequality(bset);
4279 isl_int_set_si(bset->ineq[k][1], 1);
4280 isl_int_neg(bset->ineq[k][0], min);
4282 k = isl_basic_set_alloc_inequality(bset);
4285 isl_int_set_si(bset->ineq[k][1], -1);
4286 isl_int_set(bset->ineq[k][0], max);
4290 isl_basic_set_free(bset);
4294 /* Return the Cartesian product of the basic sets in list (in the given order).
4296 struct isl_basic_set *isl_basic_set_product(struct isl_basic_set_list *list)
4304 struct isl_basic_set *product = NULL;
4308 isl_assert(list->ctx, list->n > 0, goto error);
4309 isl_assert(list->ctx, list->p[0], goto error);
4310 nparam = isl_basic_set_n_param(list->p[0]);
4311 dim = isl_basic_set_n_dim(list->p[0]);
4312 extra = list->p[0]->n_div;
4313 n_eq = list->p[0]->n_eq;
4314 n_ineq = list->p[0]->n_ineq;
4315 for (i = 1; i < list->n; ++i) {
4316 isl_assert(list->ctx, list->p[i], goto error);
4317 isl_assert(list->ctx,
4318 nparam == isl_basic_set_n_param(list->p[i]), goto error);
4319 dim += isl_basic_set_n_dim(list->p[i]);
4320 extra += list->p[i]->n_div;
4321 n_eq += list->p[i]->n_eq;
4322 n_ineq += list->p[i]->n_ineq;
4324 product = isl_basic_set_alloc(list->ctx, nparam, dim, extra,
4329 for (i = 0; i < list->n; ++i) {
4330 isl_basic_set_add_constraints(product,
4331 isl_basic_set_copy(list->p[i]), dim);
4332 dim += isl_basic_set_n_dim(list->p[i]);
4334 isl_basic_set_list_free(list);
4337 isl_basic_set_free(product);
4338 isl_basic_set_list_free(list);
4342 struct isl_basic_map *isl_basic_map_product(
4343 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
4345 struct isl_dim *dim_result = NULL;
4346 struct isl_basic_map *bmap;
4347 unsigned in1, in2, out1, out2, nparam, total, pos;
4348 struct isl_dim_map *dim_map1, *dim_map2;
4350 if (!bmap1 || !bmap2)
4353 isl_assert(map1->ctx, isl_dim_match(bmap1->dim, isl_dim_param,
4354 bmap2->dim, isl_dim_param), goto error);
4355 dim_result = isl_dim_product(isl_dim_copy(bmap1->dim),
4356 isl_dim_copy(bmap2->dim));
4358 in1 = isl_basic_map_n_in(bmap1);
4359 in2 = isl_basic_map_n_in(bmap2);
4360 out1 = isl_basic_map_n_out(bmap1);
4361 out2 = isl_basic_map_n_out(bmap2);
4362 nparam = isl_basic_map_n_param(bmap1);
4364 total = nparam + in1 + in2 + out1 + out2 + bmap1->n_div + bmap2->n_div;
4365 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
4366 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
4367 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
4368 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
4369 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
4370 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos += in1);
4371 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += in2);
4372 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += out1);
4373 isl_dim_map_div(dim_map1, bmap1, pos += out2);
4374 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
4376 bmap = isl_basic_map_alloc_dim(dim_result,
4377 bmap1->n_div + bmap2->n_div,
4378 bmap1->n_eq + bmap2->n_eq,
4379 bmap1->n_ineq + bmap2->n_ineq);
4380 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
4381 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
4382 bmap = isl_basic_map_simplify(bmap);
4383 return isl_basic_map_finalize(bmap);
4385 isl_basic_map_free(bmap1);
4386 isl_basic_map_free(bmap2);
4390 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
4392 struct isl_map *isl_map_product(struct isl_map *map1, struct isl_map *map2)
4395 struct isl_map *result;
4401 isl_assert(map1->ctx, isl_dim_match(map1->dim, isl_dim_param,
4402 map2->dim, isl_dim_param), goto error);
4404 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
4405 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
4406 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
4408 result = isl_map_alloc_dim(isl_dim_product(isl_dim_copy(map1->dim),
4409 isl_dim_copy(map2->dim)),
4410 map1->n * map2->n, flags);
4413 for (i = 0; i < map1->n; ++i)
4414 for (j = 0; j < map2->n; ++j) {
4415 struct isl_basic_map *part;
4416 part = isl_basic_map_product(
4417 isl_basic_map_copy(map1->p[i]),
4418 isl_basic_map_copy(map2->p[j]));
4419 if (isl_basic_map_is_empty(part))
4420 isl_basic_map_free(part);
4422 result = isl_map_add(result, part);
4435 uint32_t isl_basic_set_get_hash(struct isl_basic_set *bset)
4443 bset = isl_basic_set_copy(bset);
4444 bset = isl_basic_set_normalize(bset);
4447 total = isl_basic_set_total_dim(bset);
4448 isl_hash_byte(hash, bset->n_eq & 0xFF);
4449 for (i = 0; i < bset->n_eq; ++i) {
4451 c_hash = isl_seq_get_hash(bset->eq[i], 1 + total);
4452 isl_hash_hash(hash, c_hash);
4454 isl_hash_byte(hash, bset->n_ineq & 0xFF);
4455 for (i = 0; i < bset->n_ineq; ++i) {
4457 c_hash = isl_seq_get_hash(bset->ineq[i], 1 + total);
4458 isl_hash_hash(hash, c_hash);
4460 isl_hash_byte(hash, bset->n_div & 0xFF);
4461 for (i = 0; i < bset->n_div; ++i) {
4463 if (isl_int_is_zero(bset->div[i][0]))
4465 isl_hash_byte(hash, i & 0xFF);
4466 c_hash = isl_seq_get_hash(bset->div[i], 1 + 1 + total);
4467 isl_hash_hash(hash, c_hash);
4469 isl_basic_set_free(bset);
4473 uint32_t isl_set_get_hash(struct isl_set *set)
4480 set = isl_set_copy(set);
4481 set = isl_set_normalize(set);
4485 hash = isl_hash_init();
4486 for (i = 0; i < set->n; ++i) {
4488 bset_hash = isl_basic_set_get_hash(set->p[i]);
4489 isl_hash_hash(hash, bset_hash);
4497 /* Check if the value for dimension dim is completely determined
4498 * by the values of the other parameters and variables.
4499 * That is, check if dimension dim is involved in an equality.
4501 int isl_basic_set_dim_is_unique(struct isl_basic_set *bset, unsigned dim)
4508 nparam = isl_basic_set_n_param(bset);
4509 for (i = 0; i < bset->n_eq; ++i)
4510 if (!isl_int_is_zero(bset->eq[i][1 + nparam + dim]))
4515 /* Check if the value for dimension dim is completely determined
4516 * by the values of the other parameters and variables.
4517 * That is, check if dimension dim is involved in an equality
4518 * for each of the subsets.
4520 int isl_set_dim_is_unique(struct isl_set *set, unsigned dim)
4526 for (i = 0; i < set->n; ++i) {
4528 unique = isl_basic_set_dim_is_unique(set->p[i], dim);