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;
97 case isl_dim_param: return dim->nparam;
98 case isl_dim_in: return dim->n_in;
99 case isl_dim_out: return dim->n_out;
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 static unsigned basic_map_offset(struct isl_basic_map *bmap,
111 enum isl_dim_type type)
113 struct isl_dim *dim = bmap->dim;
115 case isl_dim_param: return 1;
116 case isl_dim_in: return 1 + dim->nparam;
117 case isl_dim_out: return 1 + dim->nparam + dim->n_in;
118 case isl_dim_div: return 1 + dim->nparam + dim->n_in + dim->n_out;
122 static unsigned map_offset(struct isl_map *map, enum isl_dim_type type)
124 return pos(map->dim, type);
127 unsigned isl_basic_set_dim(const struct isl_basic_set *bset,
128 enum isl_dim_type type)
130 return isl_basic_map_dim((const struct isl_basic_map*)bset, type);
133 unsigned isl_basic_set_n_dim(const struct isl_basic_set *bset)
135 return bset->dim->n_out;
138 unsigned isl_basic_set_n_param(const struct isl_basic_set *bset)
140 return bset->dim->nparam;
143 unsigned isl_basic_set_total_dim(const struct isl_basic_set *bset)
145 return isl_dim_total(bset->dim) + bset->n_div;
148 unsigned isl_set_n_dim(const struct isl_set *set)
150 return set->dim->n_out;
153 unsigned isl_set_n_param(const struct isl_set *set)
155 return set->dim->nparam;
158 unsigned isl_basic_map_n_in(const struct isl_basic_map *bmap)
160 return bmap->dim->n_in;
163 unsigned isl_basic_map_n_out(const struct isl_basic_map *bmap)
165 return bmap->dim->n_out;
168 unsigned isl_basic_map_n_param(const struct isl_basic_map *bmap)
170 return bmap->dim->nparam;
173 unsigned isl_basic_map_n_div(const struct isl_basic_map *bmap)
178 unsigned isl_basic_map_total_dim(const struct isl_basic_map *bmap)
180 return isl_dim_total(bmap->dim) + bmap->n_div;
183 unsigned isl_map_n_in(const struct isl_map *map)
185 return map->dim->n_in;
188 unsigned isl_map_n_out(const struct isl_map *map)
190 return map->dim->n_out;
193 unsigned isl_map_n_param(const struct isl_map *map)
195 return map->dim->nparam;
198 int isl_map_compatible_domain(struct isl_map *map, struct isl_set *set)
200 return map->dim->n_in == set->dim->n_out &&
201 map->dim->nparam == set->dim->nparam;
204 int isl_basic_map_compatible_domain(struct isl_basic_map *bmap,
205 struct isl_basic_set *bset)
207 return bmap->dim->n_in == bset->dim->n_out &&
208 bmap->dim->nparam == bset->dim->nparam;
211 int isl_basic_map_compatible_range(struct isl_basic_map *bmap,
212 struct isl_basic_set *bset)
214 return bmap->dim->n_out == bset->dim->n_out &&
215 bmap->dim->nparam == bset->dim->nparam;
218 static struct isl_basic_map *basic_map_init(struct isl_ctx *ctx,
219 struct isl_basic_map *bmap, unsigned extra,
220 unsigned n_eq, unsigned n_ineq)
223 size_t row_size = 1 + isl_dim_total(bmap->dim) + extra;
225 bmap->block = isl_blk_alloc(ctx, (n_eq + n_ineq) * row_size);
226 if (isl_blk_is_error(bmap->block)) {
231 bmap->eq = isl_alloc_array(ctx, isl_int *, n_eq + n_ineq);
233 isl_blk_free(ctx, bmap->block);
239 bmap->block2 = isl_blk_empty();
242 bmap->block2 = isl_blk_alloc(ctx, extra * (1 + row_size));
243 if (isl_blk_is_error(bmap->block2)) {
245 isl_blk_free(ctx, bmap->block);
250 bmap->div = isl_alloc_array(ctx, isl_int *, extra);
252 isl_blk_free(ctx, bmap->block2);
254 isl_blk_free(ctx, bmap->block);
260 for (i = 0; i < n_eq + n_ineq; ++i)
261 bmap->eq[i] = bmap->block.data + i * row_size;
263 for (i = 0; i < extra; ++i)
264 bmap->div[i] = bmap->block2.data + i * (1 + row_size);
270 bmap->c_size = n_eq + n_ineq;
271 bmap->ineq = bmap->eq + n_eq;
280 isl_basic_map_free(bmap);
284 struct isl_basic_set *isl_basic_set_alloc(struct isl_ctx *ctx,
285 unsigned nparam, unsigned dim, unsigned extra,
286 unsigned n_eq, unsigned n_ineq)
288 struct isl_basic_map *bmap;
289 bmap = isl_basic_map_alloc(ctx, nparam, 0, dim, extra, n_eq, n_ineq);
290 return (struct isl_basic_set *)bmap;
293 struct isl_basic_set *isl_basic_set_alloc_dim(struct isl_dim *dim,
294 unsigned extra, unsigned n_eq, unsigned n_ineq)
296 struct isl_basic_map *bmap;
299 isl_assert(dim->ctx, dim->n_in == 0, return NULL);
300 bmap = isl_basic_map_alloc_dim(dim, extra, n_eq, n_ineq);
301 return (struct isl_basic_set *)bmap;
304 struct isl_basic_map *isl_basic_map_alloc_dim(struct isl_dim *dim,
305 unsigned extra, unsigned n_eq, unsigned n_ineq)
307 struct isl_basic_map *bmap;
311 bmap = isl_alloc_type(dim->ctx, struct isl_basic_map);
316 return basic_map_init(dim->ctx, bmap, extra, n_eq, n_ineq);
322 struct isl_basic_map *isl_basic_map_alloc(struct isl_ctx *ctx,
323 unsigned nparam, unsigned in, unsigned out, unsigned extra,
324 unsigned n_eq, unsigned n_ineq)
326 struct isl_basic_map *bmap;
329 dim = isl_dim_alloc(ctx, nparam, in, out);
333 bmap = isl_basic_map_alloc_dim(dim, extra, n_eq, n_ineq);
337 static void dup_constraints(
338 struct isl_basic_map *dst, struct isl_basic_map *src)
341 unsigned total = isl_basic_map_total_dim(src);
343 for (i = 0; i < src->n_eq; ++i) {
344 int j = isl_basic_map_alloc_equality(dst);
345 isl_seq_cpy(dst->eq[j], src->eq[i], 1+total);
348 for (i = 0; i < src->n_ineq; ++i) {
349 int j = isl_basic_map_alloc_inequality(dst);
350 isl_seq_cpy(dst->ineq[j], src->ineq[i], 1+total);
353 for (i = 0; i < src->n_div; ++i) {
354 int j = isl_basic_map_alloc_div(dst);
355 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total);
357 F_SET(dst, ISL_BASIC_SET_FINAL);
360 struct isl_basic_map *isl_basic_map_dup(struct isl_basic_map *bmap)
362 struct isl_basic_map *dup;
366 dup = isl_basic_map_alloc_dim(isl_dim_copy(bmap->dim),
367 bmap->n_div, bmap->n_eq, bmap->n_ineq);
370 dup->flags = bmap->flags;
371 dup_constraints(dup, bmap);
372 dup->sample = isl_vec_copy(bmap->ctx, bmap->sample);
376 struct isl_basic_set *isl_basic_set_dup(struct isl_basic_set *bset)
378 struct isl_basic_map *dup;
380 dup = isl_basic_map_dup((struct isl_basic_map *)bset);
381 return (struct isl_basic_set *)dup;
384 struct isl_basic_set *isl_basic_set_copy(struct isl_basic_set *bset)
389 if (F_ISSET(bset, ISL_BASIC_SET_FINAL)) {
393 return isl_basic_set_dup(bset);
396 struct isl_set *isl_set_copy(struct isl_set *set)
405 struct isl_basic_map *isl_basic_map_copy(struct isl_basic_map *bmap)
410 if (F_ISSET(bmap, ISL_BASIC_SET_FINAL)) {
414 return isl_basic_map_dup(bmap);
417 struct isl_map *isl_map_copy(struct isl_map *map)
426 void isl_basic_map_free(struct isl_basic_map *bmap)
434 isl_ctx_deref(bmap->ctx);
436 isl_blk_free(bmap->ctx, bmap->block2);
438 isl_blk_free(bmap->ctx, bmap->block);
439 isl_vec_free(bmap->ctx, bmap->sample);
440 isl_dim_free(bmap->dim);
444 void isl_basic_set_free(struct isl_basic_set *bset)
446 isl_basic_map_free((struct isl_basic_map *)bset);
449 int isl_basic_map_alloc_equality(struct isl_basic_map *bmap)
455 isl_assert(ctx, bmap->n_eq + bmap->n_ineq < bmap->c_size, return -1);
456 isl_assert(ctx, bmap->eq + bmap->n_eq <= bmap->ineq, return -1);
457 if (bmap->eq + bmap->n_eq == bmap->ineq) {
459 int j = isl_basic_map_alloc_inequality(bmap);
463 bmap->ineq[0] = bmap->ineq[j];
468 isl_seq_clr(bmap->eq[bmap->n_eq] +
469 1 + isl_basic_map_total_dim(bmap),
470 bmap->extra - bmap->n_div);
471 F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
475 int isl_basic_set_alloc_equality(struct isl_basic_set *bset)
477 return isl_basic_map_alloc_equality((struct isl_basic_map *)bset);
480 int isl_basic_map_free_equality(struct isl_basic_map *bmap, unsigned n)
484 isl_assert(bmap->ctx, n <= bmap->n_eq, return -1);
489 int isl_basic_map_drop_equality(struct isl_basic_map *bmap, unsigned pos)
494 isl_assert(bmap->ctx, pos < bmap->n_eq, return -1);
496 if (pos != bmap->n_eq - 1) {
498 bmap->eq[pos] = bmap->eq[bmap->n_eq - 1];
499 bmap->eq[bmap->n_eq - 1] = t;
505 int isl_basic_set_drop_equality(struct isl_basic_set *bset, unsigned pos)
507 return isl_basic_map_drop_equality((struct isl_basic_map *)bset, pos);
510 void isl_basic_map_inequality_to_equality(
511 struct isl_basic_map *bmap, unsigned pos)
516 bmap->ineq[pos] = bmap->ineq[0];
517 bmap->ineq[0] = bmap->eq[bmap->n_eq];
518 bmap->eq[bmap->n_eq] = t;
522 F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
523 F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
526 int isl_basic_map_alloc_inequality(struct isl_basic_map *bmap)
532 isl_assert(ctx, (bmap->ineq - bmap->eq) + bmap->n_ineq < bmap->c_size,
534 F_CLR(bmap, ISL_BASIC_MAP_NO_IMPLICIT);
535 F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
536 F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
537 isl_seq_clr(bmap->ineq[bmap->n_ineq] +
538 1 + isl_basic_map_total_dim(bmap),
539 bmap->extra - bmap->n_div);
540 return bmap->n_ineq++;
543 int isl_basic_set_alloc_inequality(struct isl_basic_set *bset)
545 return isl_basic_map_alloc_inequality((struct isl_basic_map *)bset);
548 int isl_basic_map_free_inequality(struct isl_basic_map *bmap, unsigned n)
552 isl_assert(bmap->ctx, n <= bmap->n_ineq, return -1);
557 int isl_basic_set_free_inequality(struct isl_basic_set *bset, unsigned n)
559 return isl_basic_map_free_inequality((struct isl_basic_map *)bset, n);
562 int isl_basic_map_drop_inequality(struct isl_basic_map *bmap, unsigned pos)
567 isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
569 if (pos != bmap->n_ineq - 1) {
571 bmap->ineq[pos] = bmap->ineq[bmap->n_ineq - 1];
572 bmap->ineq[bmap->n_ineq - 1] = t;
573 F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
579 int isl_basic_set_drop_inequality(struct isl_basic_set *bset, unsigned pos)
581 return isl_basic_map_drop_inequality((struct isl_basic_map *)bset, pos);
584 int isl_basic_map_alloc_div(struct isl_basic_map *bmap)
588 isl_assert(bmap->ctx, bmap->n_div < bmap->extra, return -1);
589 isl_seq_clr(bmap->div[bmap->n_div] +
590 1 + 1 + isl_basic_map_total_dim(bmap),
591 bmap->extra - bmap->n_div);
592 F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
593 return bmap->n_div++;
596 int isl_basic_map_free_div(struct isl_basic_map *bmap, unsigned n)
600 isl_assert(bmap->ctx, n <= bmap->n_div, return -1);
605 /* Copy constraint from src to dst, putting the vars of src at offset
606 * dim_off in dst and the divs of src at offset div_off in dst.
607 * If both sets are actually map, then dim_off applies to the input
610 static void copy_constraint(struct isl_basic_map *dst_map, isl_int *dst,
611 struct isl_basic_map *src_map, isl_int *src,
612 unsigned in_off, unsigned out_off, unsigned div_off)
614 unsigned src_nparam = isl_basic_map_n_param(src_map);
615 unsigned dst_nparam = isl_basic_map_n_param(dst_map);
616 unsigned src_in = isl_basic_map_n_in(src_map);
617 unsigned dst_in = isl_basic_map_n_in(dst_map);
618 unsigned src_out = isl_basic_map_n_out(src_map);
619 unsigned dst_out = isl_basic_map_n_out(dst_map);
620 isl_int_set(dst[0], src[0]);
621 isl_seq_cpy(dst+1, src+1, isl_min(dst_nparam, src_nparam));
622 if (dst_nparam > src_nparam)
623 isl_seq_clr(dst+1+src_nparam,
624 dst_nparam - src_nparam);
625 isl_seq_clr(dst+1+dst_nparam, in_off);
626 isl_seq_cpy(dst+1+dst_nparam+in_off,
628 isl_min(dst_in-in_off, src_in));
629 if (dst_in-in_off > src_in)
630 isl_seq_clr(dst+1+dst_nparam+in_off+src_in,
631 dst_in - in_off - src_in);
632 isl_seq_clr(dst+1+dst_nparam+dst_in, out_off);
633 isl_seq_cpy(dst+1+dst_nparam+dst_in+out_off,
634 src+1+src_nparam+src_in,
635 isl_min(dst_out-out_off, src_out));
636 if (dst_out-out_off > src_out)
637 isl_seq_clr(dst+1+dst_nparam+dst_in+out_off+src_out,
638 dst_out - out_off - src_out);
639 isl_seq_clr(dst+1+dst_nparam+dst_in+dst_out, div_off);
640 isl_seq_cpy(dst+1+dst_nparam+dst_in+dst_out+div_off,
641 src+1+src_nparam+src_in+src_out,
642 isl_min(dst_map->extra-div_off, src_map->n_div));
643 if (dst_map->n_div-div_off > src_map->n_div)
644 isl_seq_clr(dst+1+dst_nparam+dst_in+dst_out+
645 div_off+src_map->n_div,
646 dst_map->n_div - div_off - src_map->n_div);
649 static void copy_div(struct isl_basic_map *dst_map, isl_int *dst,
650 struct isl_basic_map *src_map, isl_int *src,
651 unsigned in_off, unsigned out_off, unsigned div_off)
653 isl_int_set(dst[0], src[0]);
654 copy_constraint(dst_map, dst+1, src_map, src+1, in_off, out_off, div_off);
657 static struct isl_basic_map *add_constraints(struct isl_basic_map *bmap1,
658 struct isl_basic_map *bmap2, unsigned i_pos, unsigned o_pos)
663 if (!bmap1 || !bmap2)
666 div_off = bmap1->n_div;
668 for (i = 0; i < bmap2->n_eq; ++i) {
669 int i1 = isl_basic_map_alloc_equality(bmap1);
672 copy_constraint(bmap1, bmap1->eq[i1], bmap2, bmap2->eq[i],
673 i_pos, o_pos, div_off);
676 for (i = 0; i < bmap2->n_ineq; ++i) {
677 int i1 = isl_basic_map_alloc_inequality(bmap1);
680 copy_constraint(bmap1, bmap1->ineq[i1], bmap2, bmap2->ineq[i],
681 i_pos, o_pos, div_off);
684 for (i = 0; i < bmap2->n_div; ++i) {
685 int i1 = isl_basic_map_alloc_div(bmap1);
688 copy_div(bmap1, bmap1->div[i1], bmap2, bmap2->div[i],
689 i_pos, o_pos, div_off);
692 isl_basic_map_free(bmap2);
697 isl_basic_map_free(bmap1);
698 isl_basic_map_free(bmap2);
702 static void copy_constraint_dim_map(isl_int *dst, isl_int *src,
703 struct isl_dim_map *dim_map)
707 for (i = 0; i < dim_map->len; ++i) {
708 if (dim_map->pos[i] < 0)
709 isl_int_set_si(dst[i], 0);
711 isl_int_set(dst[i], src[dim_map->pos[i]]);
715 static void copy_div_dim_map(isl_int *dst, isl_int *src,
716 struct isl_dim_map *dim_map)
718 isl_int_set(dst[0], src[0]);
719 copy_constraint_dim_map(dst+1, src+1, dim_map);
722 static struct isl_basic_map *add_constraints_dim_map(struct isl_basic_map *dst,
723 struct isl_basic_map *src, struct isl_dim_map *dim_map)
727 if (!src || !dst || !dim_map)
730 for (i = 0; i < src->n_eq; ++i) {
731 int i1 = isl_basic_map_alloc_equality(dst);
734 copy_constraint_dim_map(dst->eq[i1], src->eq[i], dim_map);
737 for (i = 0; i < src->n_ineq; ++i) {
738 int i1 = isl_basic_map_alloc_inequality(dst);
741 copy_constraint_dim_map(dst->ineq[i1], src->ineq[i], dim_map);
744 for (i = 0; i < src->n_div; ++i) {
745 int i1 = isl_basic_map_alloc_div(dst);
748 copy_div_dim_map(dst->div[i1], src->div[i], dim_map);
752 isl_basic_map_free(src);
757 isl_basic_map_free(src);
758 isl_basic_map_free(dst);
762 struct isl_basic_set *isl_basic_set_add_constraints(struct isl_basic_set *bset1,
763 struct isl_basic_set *bset2, unsigned pos)
765 return (struct isl_basic_set *)
766 add_constraints((struct isl_basic_map *)bset1,
767 (struct isl_basic_map *)bset2, 0, pos);
770 struct isl_basic_map *isl_basic_map_extend_dim(struct isl_basic_map *base,
771 struct isl_dim *dim, unsigned extra,
772 unsigned n_eq, unsigned n_ineq)
774 struct isl_basic_map *ext;
781 base = isl_basic_map_cow(base);
785 dims_ok = isl_dim_equal(base->dim, dim) &&
786 base->extra >= base->n_div + extra;
788 if (dims_ok && n_eq == 0 && n_ineq == 0) {
793 isl_assert(base->ctx, base->dim->nparam <= dim->nparam, goto error);
794 isl_assert(base->ctx, base->dim->n_in <= dim->n_in, goto error);
795 isl_assert(base->ctx, base->dim->n_out <= dim->n_out, goto error);
796 extra += base->extra;
798 n_ineq += base->n_ineq;
800 ext = isl_basic_map_alloc_dim(dim, extra, n_eq, n_ineq);
806 ext = add_constraints(ext, base, 0, 0);
809 F_CLR(ext, ISL_BASIC_SET_FINAL);
816 isl_basic_map_free(base);
820 struct isl_basic_map *isl_basic_map_extend_constraints(
821 struct isl_basic_map *base, unsigned n_eq, unsigned n_ineq)
825 return isl_basic_map_extend_dim(base, isl_dim_copy(base->dim),
829 struct isl_basic_map *isl_basic_map_extend(struct isl_basic_map *base,
830 unsigned nparam, unsigned n_in, unsigned n_out, unsigned extra,
831 unsigned n_eq, unsigned n_ineq)
833 struct isl_basic_map *bmap;
838 dim = isl_dim_alloc(base->ctx, nparam, n_in, n_out);
842 bmap = isl_basic_map_extend_dim(base, dim, extra, n_eq, n_ineq);
846 struct isl_basic_set *isl_basic_set_extend(struct isl_basic_set *base,
847 unsigned nparam, unsigned dim, unsigned extra,
848 unsigned n_eq, unsigned n_ineq)
850 return (struct isl_basic_set *)
851 isl_basic_map_extend((struct isl_basic_map *)base,
852 nparam, 0, dim, extra, n_eq, n_ineq);
855 struct isl_basic_set *isl_basic_set_extend_constraints(
856 struct isl_basic_set *base, unsigned n_eq, unsigned n_ineq)
858 return (struct isl_basic_set *)
859 isl_basic_map_extend_constraints((struct isl_basic_map *)base,
863 struct isl_basic_set *isl_basic_set_cow(struct isl_basic_set *bset)
865 return (struct isl_basic_set *)
866 isl_basic_map_cow((struct isl_basic_map *)bset);
869 struct isl_basic_map *isl_basic_map_cow(struct isl_basic_map *bmap)
876 bmap = isl_basic_map_dup(bmap);
878 F_CLR(bmap, ISL_BASIC_SET_FINAL);
882 struct isl_set *isl_set_cow(struct isl_set *set)
890 return isl_set_dup(set);
893 struct isl_map *isl_map_cow(struct isl_map *map)
901 return isl_map_dup(map);
904 static void swap_vars(struct isl_blk blk, isl_int *a,
905 unsigned a_len, unsigned b_len)
907 isl_seq_cpy(blk.data, a+a_len, b_len);
908 isl_seq_cpy(blk.data+b_len, a, a_len);
909 isl_seq_cpy(a, blk.data, b_len+a_len);
912 struct isl_basic_set *isl_basic_set_swap_vars(
913 struct isl_basic_set *bset, unsigned n)
923 nparam = isl_basic_set_n_param(bset);
924 dim = isl_basic_set_n_dim(bset);
925 isl_assert(bset->ctx, n <= dim, goto error);
930 bset = isl_basic_set_cow(bset);
934 blk = isl_blk_alloc(bset->ctx, dim);
935 if (isl_blk_is_error(blk))
938 for (i = 0; i < bset->n_eq; ++i)
940 bset->eq[i]+1+nparam, n, dim - n);
942 for (i = 0; i < bset->n_ineq; ++i)
944 bset->ineq[i]+1+nparam, n, dim - n);
946 for (i = 0; i < bset->n_div; ++i)
948 bset->div[i]+1+1+nparam, n, dim - n);
950 isl_blk_free(bset->ctx, blk);
952 F_CLR(bset, ISL_BASIC_SET_NORMALIZED);
956 isl_basic_set_free(bset);
960 struct isl_set *isl_set_swap_vars(struct isl_set *set, unsigned n)
963 set = isl_set_cow(set);
967 for (i = 0; i < set->n; ++i) {
968 set->p[i] = isl_basic_set_swap_vars(set->p[i], n);
974 F_CLR(set, ISL_SET_NORMALIZED);
978 struct isl_basic_map *isl_basic_map_set_to_empty(struct isl_basic_map *bmap)
984 total = isl_basic_map_total_dim(bmap);
985 isl_basic_map_free_div(bmap, bmap->n_div);
986 isl_basic_map_free_inequality(bmap, bmap->n_ineq);
988 isl_basic_map_free_equality(bmap, bmap->n_eq-1);
990 isl_basic_map_alloc_equality(bmap);
994 isl_int_set_si(bmap->eq[i][0], 1);
995 isl_seq_clr(bmap->eq[i]+1, total);
996 F_SET(bmap, ISL_BASIC_MAP_EMPTY);
997 return isl_basic_map_finalize(bmap);
999 isl_basic_map_free(bmap);
1003 struct isl_basic_set *isl_basic_set_set_to_empty(struct isl_basic_set *bset)
1005 return (struct isl_basic_set *)
1006 isl_basic_map_set_to_empty((struct isl_basic_map *)bset);
1009 static void swap_div(struct isl_basic_map *bmap, int a, int b)
1012 unsigned off = isl_dim_total(bmap->dim);
1013 isl_int *t = bmap->div[a];
1014 bmap->div[a] = bmap->div[b];
1017 for (i = 0; i < bmap->n_eq; ++i)
1018 isl_int_swap(bmap->eq[i][1+off+a], bmap->eq[i][1+off+b]);
1020 for (i = 0; i < bmap->n_ineq; ++i)
1021 isl_int_swap(bmap->ineq[i][1+off+a], bmap->ineq[i][1+off+b]);
1023 for (i = 0; i < bmap->n_div; ++i)
1024 isl_int_swap(bmap->div[i][1+1+off+a], bmap->div[i][1+1+off+b]);
1025 F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1028 /* Eliminate the specified n dimensions starting at first from the
1029 * constraints using Fourier-Motzkin, The dimensions themselves
1032 struct isl_set *isl_set_eliminate_dims(struct isl_set *set,
1033 unsigned first, unsigned n)
1043 set = isl_set_cow(set);
1046 isl_assert(set->ctx, first+n <= isl_set_n_dim(set), goto error);
1047 nparam = isl_set_n_param(set);
1049 for (i = 0; i < set->n; ++i) {
1050 set->p[i] = isl_basic_set_eliminate_vars(set->p[i],
1061 /* Project out n dimensions starting at first using Fourier-Motzkin */
1062 struct isl_set *isl_set_remove_dims(struct isl_set *set,
1063 unsigned first, unsigned n)
1065 set = isl_set_eliminate_dims(set, first, n);
1066 set = isl_set_drop_dims(set, first, n);
1070 struct isl_basic_set *isl_basic_set_remove_divs(struct isl_basic_set *bset)
1072 bset = isl_basic_set_eliminate_vars(bset, isl_dim_total(bset->dim),
1080 struct isl_set *isl_set_remove_divs(struct isl_set *set)
1089 set = isl_set_cow(set);
1093 for (i = 0; i < set->n; ++i) {
1094 set->p[i] = isl_basic_set_remove_divs(set->p[i]);
1104 /* Project out n inputs starting at first using Fourier-Motzkin */
1105 struct isl_map *isl_map_remove_inputs(struct isl_map *map,
1106 unsigned first, unsigned n)
1114 map = isl_map_cow(map);
1117 nparam = isl_map_n_param(map);
1118 isl_assert(map->ctx, first+n <= isl_map_n_in(map), goto error);
1120 for (i = 0; i < map->n; ++i) {
1121 map->p[i] = isl_basic_map_eliminate_vars(map->p[i],
1126 map = isl_map_drop_inputs(map, first, n);
1133 /* Project out n dimensions starting at first using Fourier-Motzkin */
1134 struct isl_basic_set *isl_basic_set_remove_dims(struct isl_basic_set *bset,
1135 unsigned first, unsigned n)
1137 unsigned nparam = isl_basic_set_n_param(bset);
1138 bset = isl_basic_set_eliminate_vars(bset, nparam + first, n);
1139 bset = isl_basic_set_drop_dims(bset, first, n);
1143 static void dump_term(struct isl_basic_map *bmap,
1144 isl_int c, int pos, FILE *out)
1147 unsigned in = isl_basic_map_n_in(bmap);
1148 unsigned dim = in + isl_basic_map_n_out(bmap);
1149 unsigned nparam = isl_basic_map_n_param(bmap);
1151 isl_int_print(out, c, 0);
1153 if (!isl_int_is_one(c))
1154 isl_int_print(out, c, 0);
1155 if (pos < 1 + nparam) {
1156 name = isl_dim_get_name(bmap->dim,
1157 isl_dim_param, pos - 1);
1159 fprintf(out, "%s", name);
1161 fprintf(out, "p%d", pos - 1);
1162 } else if (pos < 1 + nparam + in)
1163 fprintf(out, "i%d", pos - 1 - nparam);
1164 else if (pos < 1 + nparam + dim)
1165 fprintf(out, "o%d", pos - 1 - nparam - in);
1167 fprintf(out, "e%d", pos - 1 - nparam - dim);
1171 static void dump_constraint_sign(struct isl_basic_map *bmap, isl_int *c,
1172 int sign, FILE *out)
1176 unsigned len = 1 + isl_basic_map_total_dim(bmap);
1180 for (i = 0, first = 1; i < len; ++i) {
1181 if (isl_int_sgn(c[i]) * sign <= 0)
1184 fprintf(out, " + ");
1186 isl_int_abs(v, c[i]);
1187 dump_term(bmap, v, i, out);
1194 static void dump_constraint(struct isl_basic_map *bmap, isl_int *c,
1195 const char *op, FILE *out, int indent)
1199 fprintf(out, "%*s", indent, "");
1201 dump_constraint_sign(bmap, c, 1, out);
1202 fprintf(out, " %s ", op);
1203 dump_constraint_sign(bmap, c, -1, out);
1207 for (i = bmap->n_div; i < bmap->extra; ++i) {
1208 if (isl_int_is_zero(c[1+isl_dim_total(bmap->dim)+i]))
1210 fprintf(out, "%*s", indent, "");
1211 fprintf(out, "ERROR: unused div coefficient not zero\n");
1216 static void dump_constraints(struct isl_basic_map *bmap,
1217 isl_int **c, unsigned n,
1218 const char *op, FILE *out, int indent)
1222 for (i = 0; i < n; ++i)
1223 dump_constraint(bmap, c[i], op, out, indent);
1226 static void dump_affine(struct isl_basic_map *bmap, isl_int *exp, FILE *out)
1230 unsigned total = isl_basic_map_total_dim(bmap);
1232 for (j = 0; j < 1 + total; ++j) {
1233 if (isl_int_is_zero(exp[j]))
1235 if (!first && isl_int_is_pos(exp[j]))
1237 dump_term(bmap, exp[j], j, out);
1242 static void dump(struct isl_basic_map *bmap, FILE *out, int indent)
1246 dump_constraints(bmap, bmap->eq, bmap->n_eq, "=", out, indent);
1247 dump_constraints(bmap, bmap->ineq, bmap->n_ineq, ">=", out, indent);
1249 for (i = 0; i < bmap->n_div; ++i) {
1250 fprintf(out, "%*s", indent, "");
1251 fprintf(out, "e%d = [(", i);
1252 dump_affine(bmap, bmap->div[i]+1, out);
1254 isl_int_print(out, bmap->div[i][0], 0);
1255 fprintf(out, "]\n");
1259 void isl_basic_set_dump(struct isl_basic_set *bset, FILE *out, int indent)
1262 fprintf(out, "null basic set\n");
1266 fprintf(out, "%*s", indent, "");
1267 fprintf(out, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n",
1268 bset->ref, bset->dim->nparam, bset->dim->n_out,
1269 bset->extra, bset->flags);
1270 dump((struct isl_basic_map *)bset, out, indent);
1273 void isl_basic_map_dump(struct isl_basic_map *bmap, FILE *out, int indent)
1276 fprintf(out, "null basic map\n");
1280 fprintf(out, "%*s", indent, "");
1281 fprintf(out, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, "
1282 "flags: %x, n_name: %d\n",
1284 bmap->dim->nparam, bmap->dim->n_in, bmap->dim->n_out,
1285 bmap->extra, bmap->flags, bmap->dim->n_name);
1286 dump(bmap, out, indent);
1289 int isl_inequality_negate(struct isl_basic_map *bmap, unsigned pos)
1294 total = isl_basic_map_total_dim(bmap);
1295 isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
1296 isl_seq_neg(bmap->ineq[pos], bmap->ineq[pos], 1 + total);
1297 isl_int_sub_ui(bmap->ineq[pos][0], bmap->ineq[pos][0], 1);
1298 F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1302 struct isl_set *isl_set_alloc_dim(struct isl_dim *dim, int n, unsigned flags)
1304 struct isl_set *set;
1308 isl_assert(dim->ctx, dim->n_in == 0, return NULL);
1309 isl_assert(dim->ctx, n >= 0, return NULL);
1310 set = isl_alloc(dim->ctx, struct isl_set,
1311 sizeof(struct isl_set) +
1312 n * sizeof(struct isl_basic_set *));
1316 set->ctx = dim->ctx;
1317 isl_ctx_ref(set->ctx);
1329 struct isl_set *isl_set_alloc(struct isl_ctx *ctx,
1330 unsigned nparam, unsigned dim, int n, unsigned flags)
1332 struct isl_set *set;
1333 struct isl_dim *dims;
1335 dims = isl_dim_alloc(ctx, nparam, 0, dim);
1339 set = isl_set_alloc_dim(dims, n, flags);
1343 struct isl_set *isl_set_dup(struct isl_set *set)
1346 struct isl_set *dup;
1351 dup = isl_set_alloc_dim(isl_dim_copy(set->dim), set->n, set->flags);
1354 for (i = 0; i < set->n; ++i)
1355 dup = isl_set_add(dup, isl_basic_set_copy(set->p[i]));
1359 struct isl_set *isl_set_from_basic_set(struct isl_basic_set *bset)
1361 struct isl_set *set;
1366 set = isl_set_alloc_dim(isl_dim_copy(bset->dim), 1, ISL_MAP_DISJOINT);
1368 isl_basic_set_free(bset);
1371 return isl_set_add(set, bset);
1374 struct isl_map *isl_map_from_basic_map(struct isl_basic_map *bmap)
1376 struct isl_map *map;
1381 map = isl_map_alloc_dim(isl_dim_copy(bmap->dim), 1, ISL_MAP_DISJOINT);
1383 isl_basic_map_free(bmap);
1386 return isl_map_add(map, bmap);
1389 struct isl_set *isl_set_add(struct isl_set *set, struct isl_basic_set *bset)
1393 isl_assert(set->ctx, isl_dim_equal(set->dim, bset->dim), goto error);
1394 isl_assert(set->ctx, set->n < set->size, goto error);
1395 set->p[set->n] = bset;
1402 isl_basic_set_free(bset);
1406 void isl_set_free(struct isl_set *set)
1416 isl_ctx_deref(set->ctx);
1417 for (i = 0; i < set->n; ++i)
1418 isl_basic_set_free(set->p[i]);
1419 isl_dim_free(set->dim);
1423 void isl_set_dump(struct isl_set *set, FILE *out, int indent)
1428 fprintf(out, "null set\n");
1432 fprintf(out, "%*s", indent, "");
1433 fprintf(out, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
1434 set->ref, set->n, set->dim->nparam, set->dim->n_out,
1436 for (i = 0; i < set->n; ++i) {
1437 fprintf(out, "%*s", indent, "");
1438 fprintf(out, "basic set %d:\n", i);
1439 isl_basic_set_dump(set->p[i], out, indent+4);
1443 void isl_map_dump(struct isl_map *map, FILE *out, int indent)
1448 fprintf(out, "null map\n");
1452 fprintf(out, "%*s", indent, "");
1453 fprintf(out, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, "
1454 "flags: %x, n_name: %d\n",
1455 map->ref, map->n, map->dim->nparam, map->dim->n_in,
1456 map->dim->n_out, map->flags, map->dim->n_name);
1457 for (i = 0; i < map->n; ++i) {
1458 fprintf(out, "%*s", indent, "");
1459 fprintf(out, "basic map %d:\n", i);
1460 isl_basic_map_dump(map->p[i], out, indent+4);
1464 struct isl_basic_map *isl_basic_map_intersect_domain(
1465 struct isl_basic_map *bmap, struct isl_basic_set *bset)
1467 struct isl_basic_map *bmap_domain;
1468 struct isl_dim *dim;
1473 isl_assert(set->ctx, isl_basic_map_compatible_domain(bmap, bset),
1476 bmap = isl_basic_map_extend_dim(bmap, isl_dim_copy(bmap->dim),
1477 bset->n_div, bset->n_eq, bset->n_ineq);
1480 dim = isl_dim_reverse(isl_dim_copy(bset->dim));
1481 bmap_domain = isl_basic_map_from_basic_set(bset, dim);
1482 bmap = add_constraints(bmap, bmap_domain, 0, 0);
1484 bmap = isl_basic_map_simplify(bmap);
1485 return isl_basic_map_finalize(bmap);
1487 isl_basic_map_free(bmap);
1488 isl_basic_set_free(bset);
1492 struct isl_basic_map *isl_basic_map_intersect_range(
1493 struct isl_basic_map *bmap, struct isl_basic_set *bset)
1495 struct isl_basic_map *bmap_range;
1500 isl_assert(bset->ctx, isl_basic_map_compatible_range(bmap, bset),
1503 bmap = isl_basic_map_extend_dim(bmap, isl_dim_copy(bmap->dim),
1504 bset->n_div, bset->n_eq, bset->n_ineq);
1507 bmap_range = isl_basic_map_from_basic_set(bset, isl_dim_copy(bset->dim));
1508 bmap = add_constraints(bmap, bmap_range, 0, 0);
1510 bmap = isl_basic_map_simplify(bmap);
1511 return isl_basic_map_finalize(bmap);
1513 isl_basic_map_free(bmap);
1514 isl_basic_set_free(bset);
1518 struct isl_basic_map *isl_basic_map_intersect(
1519 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
1521 if (!bmap1 || !bmap2)
1524 isl_assert(map1->ctx, isl_dim_equal(bmap1->dim, bmap2->dim), goto error);
1526 bmap1 = isl_basic_map_extend_dim(bmap1, isl_dim_copy(bmap1->dim),
1527 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
1530 bmap1 = add_constraints(bmap1, bmap2, 0, 0);
1532 bmap1 = isl_basic_map_simplify(bmap1);
1533 return isl_basic_map_finalize(bmap1);
1535 isl_basic_map_free(bmap1);
1536 isl_basic_map_free(bmap2);
1540 struct isl_basic_set *isl_basic_set_intersect(
1541 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
1543 return (struct isl_basic_set *)
1544 isl_basic_map_intersect(
1545 (struct isl_basic_map *)bset1,
1546 (struct isl_basic_map *)bset2);
1549 struct isl_map *isl_map_intersect(struct isl_map *map1, struct isl_map *map2)
1552 struct isl_map *result;
1558 if (F_ISSET(map1, ISL_MAP_DISJOINT) &&
1559 F_ISSET(map2, ISL_MAP_DISJOINT))
1560 FL_SET(flags, ISL_MAP_DISJOINT);
1562 result = isl_map_alloc_dim(isl_dim_copy(map1->dim),
1563 map1->n * map2->n, flags);
1566 for (i = 0; i < map1->n; ++i)
1567 for (j = 0; j < map2->n; ++j) {
1568 struct isl_basic_map *part;
1569 part = isl_basic_map_intersect(
1570 isl_basic_map_copy(map1->p[i]),
1571 isl_basic_map_copy(map2->p[j]));
1572 if (isl_basic_map_is_empty(part))
1573 isl_basic_map_free(part);
1575 result = isl_map_add(result, part);
1588 struct isl_set *isl_set_intersect(struct isl_set *set1, struct isl_set *set2)
1590 return (struct isl_set *)
1591 isl_map_intersect((struct isl_map *)set1,
1592 (struct isl_map *)set2);
1595 struct isl_basic_map *isl_basic_map_reverse(struct isl_basic_map *bmap)
1597 struct isl_dim *dim;
1598 struct isl_basic_set *bset;
1603 bmap = isl_basic_map_cow(bmap);
1606 dim = isl_dim_reverse(isl_dim_copy(bmap->dim));
1607 in = isl_basic_map_n_in(bmap);
1608 bset = isl_basic_set_from_basic_map(bmap);
1609 bset = isl_basic_set_swap_vars(bset, in);
1610 return isl_basic_map_from_basic_set(bset, dim);
1613 /* Turn final n dimensions into existentially quantified variables.
1615 struct isl_basic_set *isl_basic_set_project_out(
1616 struct isl_basic_set *bset, unsigned n, unsigned flags)
1626 isl_assert(bset->ctx, n <= isl_basic_set_n_dim(bset), goto error);
1631 bset = isl_basic_set_cow(bset);
1633 row_size = 1 + isl_dim_total(bset->dim) + bset->extra;
1634 old = bset->block2.data;
1635 bset->block2 = isl_blk_extend(bset->ctx, bset->block2,
1636 (bset->extra + n) * (1 + row_size));
1637 if (!bset->block2.data)
1639 new_div = isl_alloc_array(ctx, isl_int *, bset->extra + n);
1642 for (i = 0; i < n; ++i) {
1643 new_div[i] = bset->block2.data +
1644 (bset->extra + i) * (1 + row_size);
1645 isl_seq_clr(new_div[i], 1 + row_size);
1647 for (i = 0; i < bset->extra; ++i)
1648 new_div[n + i] = bset->block2.data + (bset->div[i] - old);
1650 bset->div = new_div;
1653 bset->dim = isl_dim_drop_outputs(bset->dim,
1654 isl_basic_set_n_dim(bset) - n, n);
1657 bset = isl_basic_set_simplify(bset);
1658 return isl_basic_set_finalize(bset);
1660 isl_basic_set_free(bset);
1664 struct isl_basic_map *add_divs(struct isl_basic_map *bmap, unsigned n)
1668 for (i = 0; i < n; ++i) {
1669 j = isl_basic_map_alloc_div(bmap);
1672 isl_seq_clr(bmap->div[j], 1+1+isl_basic_map_total_dim(bmap));
1676 isl_basic_map_free(bmap);
1680 struct isl_basic_map *isl_basic_map_apply_range(
1681 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
1683 struct isl_dim *dim_result = NULL;
1684 struct isl_basic_map *bmap;
1685 unsigned n_in, n_out, n, nparam, total, pos;
1686 struct isl_dim_map *dim_map1, *dim_map2;
1688 if (!bmap1 || !bmap2)
1691 dim_result = isl_dim_join(isl_dim_copy(bmap1->dim),
1692 isl_dim_copy(bmap2->dim));
1694 n_in = isl_basic_map_n_in(bmap1);
1695 n_out = isl_basic_map_n_out(bmap2);
1696 n = isl_basic_map_n_out(bmap1);
1697 nparam = isl_basic_map_n_param(bmap1);
1699 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + n;
1700 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
1701 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
1702 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
1703 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
1704 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
1705 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_in);
1706 isl_dim_map_div(dim_map1, bmap1, pos += n_out);
1707 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
1708 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
1709 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
1711 bmap = isl_basic_map_alloc_dim(dim_result,
1712 bmap1->n_div + bmap2->n_div + n,
1713 bmap1->n_eq + bmap2->n_eq,
1714 bmap1->n_ineq + bmap2->n_ineq);
1715 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
1716 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
1717 bmap = add_divs(bmap, n);
1718 bmap = isl_basic_map_simplify(bmap);
1719 return isl_basic_map_finalize(bmap);
1721 isl_basic_map_free(bmap1);
1722 isl_basic_map_free(bmap2);
1726 struct isl_basic_set *isl_basic_set_apply(
1727 struct isl_basic_set *bset, struct isl_basic_map *bmap)
1732 isl_assert(set->ctx, isl_basic_map_compatible_domain(bmap, bset),
1735 return (struct isl_basic_set *)
1736 isl_basic_map_apply_range((struct isl_basic_map *)bset, bmap);
1738 isl_basic_set_free(bset);
1739 isl_basic_map_free(bmap);
1743 struct isl_basic_map *isl_basic_map_apply_domain(
1744 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
1746 if (!bmap1 || !bmap2)
1750 isl_basic_map_n_in(bmap1) == isl_basic_map_n_in(bmap2), goto error);
1752 isl_basic_map_n_param(bmap1) == isl_basic_map_n_param(bmap2),
1755 bmap1 = isl_basic_map_reverse(bmap1);
1756 bmap1 = isl_basic_map_apply_range(bmap1, bmap2);
1757 return isl_basic_map_reverse(bmap1);
1759 isl_basic_map_free(bmap1);
1760 isl_basic_map_free(bmap2);
1764 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
1765 * A \cap B -> f(A) + f(B)
1767 struct isl_basic_map *isl_basic_map_sum(
1768 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
1770 unsigned n_in, n_out, nparam, total, pos;
1771 struct isl_basic_map *bmap = NULL;
1772 struct isl_dim_map *dim_map1, *dim_map2;
1775 if (!bmap1 || !bmap2)
1778 isl_assert(bmap1->ctx, isl_dim_equal(bmap1->dim, bmap2->dim),
1781 nparam = isl_basic_map_n_param(bmap1);
1782 n_in = isl_basic_map_n_in(bmap1);
1783 n_out = isl_basic_map_n_out(bmap1);
1785 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + 2 * n_out;
1786 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
1787 dim_map2 = isl_dim_map_alloc(bmap2->ctx, total);
1788 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
1789 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos);
1790 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
1791 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
1792 isl_dim_map_div(dim_map1, bmap1, pos += n_in + n_out);
1793 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
1794 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
1795 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_out);
1797 bmap = isl_basic_map_alloc_dim(isl_dim_copy(bmap1->dim),
1798 bmap1->n_div + bmap2->n_div + 2 * n_out,
1799 bmap1->n_eq + bmap2->n_eq + n_out,
1800 bmap1->n_ineq + bmap2->n_ineq);
1801 for (i = 0; i < n_out; ++i) {
1802 int j = isl_basic_map_alloc_equality(bmap);
1805 isl_seq_clr(bmap->eq[j], 1+total);
1806 isl_int_set_si(bmap->eq[j][1+nparam+n_in+i], -1);
1807 isl_int_set_si(bmap->eq[j][1+pos+i], 1);
1808 isl_int_set_si(bmap->eq[j][1+pos-n_out+i], 1);
1810 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
1811 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
1812 bmap = add_divs(bmap, 2 * n_out);
1814 bmap = isl_basic_map_simplify(bmap);
1815 return isl_basic_map_finalize(bmap);
1817 isl_basic_map_free(bmap);
1818 isl_basic_map_free(bmap1);
1819 isl_basic_map_free(bmap2);
1823 /* Given a basic map A -> f(A), construct A -> -f(A).
1825 struct isl_basic_map *isl_basic_map_neg(struct isl_basic_map *bmap)
1830 bmap = isl_basic_map_cow(bmap);
1834 n = isl_basic_map_dim(bmap, isl_dim_out);
1835 off = basic_map_offset(bmap, isl_dim_out);
1836 for (i = 0; i < bmap->n_eq; ++i)
1837 for (j = 0; j < n; ++j)
1838 isl_int_neg(bmap->eq[i][off+j], bmap->eq[i][off+j]);
1839 for (i = 0; i < bmap->n_ineq; ++i)
1840 for (j = 0; j < n; ++j)
1841 isl_int_neg(bmap->ineq[i][off+j], bmap->ineq[i][off+j]);
1842 for (i = 0; i < bmap->n_div; ++i)
1843 for (j = 0; j < n; ++j)
1844 isl_int_neg(bmap->div[i][1+off+j], bmap->div[i][1+off+j]);
1845 return isl_basic_map_finalize(bmap);
1848 static struct isl_basic_map *var_equal(struct isl_ctx *ctx,
1849 struct isl_basic_map *bmap, unsigned pos)
1855 i = isl_basic_map_alloc_equality(bmap);
1858 nparam = isl_basic_map_n_param(bmap);
1859 n_in = isl_basic_map_n_in(bmap);
1860 isl_seq_clr(bmap->eq[i], 1 + isl_basic_map_total_dim(bmap));
1861 isl_int_set_si(bmap->eq[i][1+nparam+pos], -1);
1862 isl_int_set_si(bmap->eq[i][1+nparam+n_in+pos], 1);
1863 return isl_basic_map_finalize(bmap);
1865 isl_basic_map_free(bmap);
1869 static struct isl_basic_map *var_more(struct isl_ctx *ctx,
1870 struct isl_basic_map *bmap, unsigned pos)
1876 i = isl_basic_map_alloc_inequality(bmap);
1879 nparam = isl_basic_map_n_param(bmap);
1880 n_in = isl_basic_map_n_in(bmap);
1881 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
1882 isl_int_set_si(bmap->ineq[i][0], -1);
1883 isl_int_set_si(bmap->ineq[i][1+nparam+pos], -1);
1884 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], 1);
1885 return isl_basic_map_finalize(bmap);
1887 isl_basic_map_free(bmap);
1891 static struct isl_basic_map *var_less(struct isl_ctx *ctx,
1892 struct isl_basic_map *bmap, unsigned pos)
1898 i = isl_basic_map_alloc_inequality(bmap);
1901 nparam = isl_basic_map_n_param(bmap);
1902 n_in = isl_basic_map_n_in(bmap);
1903 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
1904 isl_int_set_si(bmap->ineq[i][0], -1);
1905 isl_int_set_si(bmap->ineq[i][1+nparam+pos], 1);
1906 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], -1);
1907 return isl_basic_map_finalize(bmap);
1909 isl_basic_map_free(bmap);
1913 struct isl_basic_map *isl_basic_map_equal(struct isl_ctx *ctx,
1914 unsigned nparam, unsigned in, unsigned out, unsigned n_equal)
1917 struct isl_basic_map *bmap;
1918 bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, n_equal, 0);
1921 for (i = 0; i < n_equal && bmap; ++i)
1922 bmap = var_equal(ctx, bmap, i);
1923 return isl_basic_map_finalize(bmap);
1926 struct isl_basic_map *isl_basic_map_less_at(struct isl_ctx *ctx,
1927 unsigned nparam, unsigned in, unsigned out, unsigned pos)
1930 struct isl_basic_map *bmap;
1931 bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, pos, 1);
1934 for (i = 0; i < pos && bmap; ++i)
1935 bmap = var_equal(ctx, bmap, i);
1937 bmap = var_less(ctx, bmap, pos);
1938 return isl_basic_map_finalize(bmap);
1941 struct isl_basic_map *isl_basic_map_more_at(struct isl_ctx *ctx,
1942 unsigned nparam, unsigned in, unsigned out, unsigned pos)
1945 struct isl_basic_map *bmap;
1946 bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, pos, 1);
1949 for (i = 0; i < pos && bmap; ++i)
1950 bmap = var_equal(ctx, bmap, i);
1952 bmap = var_more(ctx, bmap, pos);
1953 return isl_basic_map_finalize(bmap);
1956 struct isl_basic_map *isl_basic_map_from_basic_set(
1957 struct isl_basic_set *bset, struct isl_dim *dim)
1959 struct isl_basic_map *bmap;
1961 bset = isl_basic_set_cow(bset);
1965 isl_assert(bset->ctx, isl_dim_compatible(bset->dim, dim), goto error);
1966 isl_dim_free(bset->dim);
1967 bmap = (struct isl_basic_map *) bset;
1969 return isl_basic_map_finalize(bmap);
1971 isl_basic_set_free(bset);
1976 struct isl_basic_set *isl_basic_set_from_basic_map(struct isl_basic_map *bmap)
1980 if (bmap->dim->n_in == 0)
1981 return (struct isl_basic_set *)bmap;
1982 bmap = isl_basic_map_cow(bmap);
1985 bmap->dim = isl_dim_cow(bmap->dim);
1988 bmap->dim->n_out += bmap->dim->n_in;
1989 bmap->dim->n_in = 0;
1990 bmap = isl_basic_map_finalize(bmap);
1991 return (struct isl_basic_set *)bmap;
1993 isl_basic_map_free(bmap);
1997 /* For a div d = floor(f/m), add the constraints
2000 * -(f-(n-1)) + m d >= 0
2002 * Note that the second constraint is the negation of
2006 static int add_div_constraints(struct isl_basic_map *bmap, unsigned div)
2009 unsigned total = isl_basic_map_total_dim(bmap);
2010 unsigned div_pos = 1 + total - bmap->n_div + div;
2012 i = isl_basic_map_alloc_inequality(bmap);
2015 isl_seq_cpy(bmap->ineq[i], bmap->div[div]+1, 1+total);
2016 isl_int_neg(bmap->ineq[i][div_pos], bmap->div[div][0]);
2018 j = isl_basic_map_alloc_inequality(bmap);
2021 isl_seq_neg(bmap->ineq[j], bmap->ineq[i], 1 + total);
2022 isl_int_add(bmap->ineq[j][0], bmap->ineq[j][0], bmap->ineq[j][div_pos]);
2023 isl_int_sub_ui(bmap->ineq[j][0], bmap->ineq[j][0], 1);
2027 struct isl_basic_set *isl_basic_map_underlying_set(
2028 struct isl_basic_map *bmap)
2032 if (bmap->dim->nparam == 0 && bmap->dim->n_in == 0 && bmap->n_div == 0)
2033 return (struct isl_basic_set *)bmap;
2034 bmap = isl_basic_map_cow(bmap);
2037 bmap->dim = isl_dim_underlying(bmap->dim, bmap->n_div);
2040 bmap->extra -= bmap->n_div;
2042 bmap = isl_basic_map_finalize(bmap);
2043 return (struct isl_basic_set *)bmap;
2048 struct isl_basic_map *isl_basic_map_overlying_set(
2049 struct isl_basic_set *bset, struct isl_basic_map *like)
2051 struct isl_basic_map *bmap;
2052 struct isl_ctx *ctx;
2059 isl_assert(ctx, bset->n_div == 0, goto error);
2060 isl_assert(ctx, isl_basic_set_n_param(bset) == 0, goto error);
2061 isl_assert(ctx, bset->dim->n_out == isl_basic_map_total_dim(like),
2063 if (isl_dim_equal(bset->dim, like->dim) && like->n_div == 0) {
2064 isl_basic_map_free(like);
2065 return (struct isl_basic_map *)bset;
2067 bset = isl_basic_set_cow(bset);
2070 total = bset->dim->n_out + bset->extra;
2071 bmap = (struct isl_basic_map *)bset;
2072 isl_dim_free(bmap->dim);
2073 bmap->dim = isl_dim_copy(like->dim);
2076 bmap->n_div = like->n_div;
2077 bmap->extra += like->n_div;
2080 ltotal = total - bmap->extra + like->extra;
2083 bmap->block2 = isl_blk_extend(ctx, bmap->block2,
2084 bmap->extra * (1 + 1 + total));
2085 if (isl_blk_is_error(bmap->block2))
2087 bmap->div = isl_realloc_array(ctx, bmap->div, isl_int *,
2091 for (i = 0; i < bmap->extra; ++i)
2092 bmap->div[i] = bmap->block2.data + i * (1 + 1 + total);
2093 for (i = 0; i < like->n_div; ++i) {
2094 isl_seq_cpy(bmap->div[i], like->div[i], 1 + 1 + ltotal);
2095 isl_seq_clr(bmap->div[i]+1+1+ltotal, total - ltotal);
2097 bmap = isl_basic_map_extend_constraints(bmap,
2098 0, 2 * like->n_div);
2099 for (i = 0; i < like->n_div; ++i)
2100 if (add_div_constraints(bmap, i) < 0)
2103 isl_basic_map_free(like);
2104 bmap = isl_basic_map_simplify(bmap);
2105 bmap = isl_basic_map_finalize(bmap);
2108 isl_basic_map_free(like);
2109 isl_basic_set_free(bset);
2113 struct isl_basic_set *isl_basic_set_from_underlying_set(
2114 struct isl_basic_set *bset, struct isl_basic_set *like)
2116 return (struct isl_basic_set *)
2117 isl_basic_map_overlying_set(bset, (struct isl_basic_map *)like);
2120 struct isl_set *isl_set_from_underlying_set(
2121 struct isl_set *set, struct isl_basic_set *like)
2127 isl_assert(set->ctx, set->dim->n_out == isl_basic_set_total_dim(like),
2129 if (isl_dim_equal(set->dim, like->dim) && like->n_div == 0) {
2130 isl_basic_set_free(like);
2133 set = isl_set_cow(set);
2136 for (i = 0; i < set->n; ++i) {
2137 set->p[i] = isl_basic_set_from_underlying_set(set->p[i],
2138 isl_basic_set_copy(like));
2142 isl_dim_free(set->dim);
2143 set->dim = isl_dim_copy(like->dim);
2146 isl_basic_set_free(like);
2149 isl_basic_set_free(like);
2154 struct isl_set *isl_map_underlying_set(struct isl_map *map)
2158 map = isl_map_cow(map);
2161 map->dim = isl_dim_cow(map->dim);
2165 for (i = 1; i < map->n; ++i)
2166 isl_assert(map->ctx, map->p[0]->n_div == map->p[i]->n_div,
2168 for (i = 0; i < map->n; ++i) {
2169 map->p[i] = (struct isl_basic_map *)
2170 isl_basic_map_underlying_set(map->p[i]);
2175 map->dim = isl_dim_underlying(map->dim, 0);
2177 isl_dim_free(map->dim);
2178 map->dim = isl_dim_copy(map->p[0]->dim);
2182 return (struct isl_set *)map;
2188 struct isl_set *isl_set_to_underlying_set(struct isl_set *set)
2190 return (struct isl_set *)isl_map_underlying_set((struct isl_map *)set);
2193 struct isl_basic_set *isl_basic_map_domain(struct isl_basic_map *bmap)
2195 struct isl_basic_set *domain;
2199 n_out = isl_basic_map_n_out(bmap);
2200 domain = isl_basic_set_from_basic_map(bmap);
2201 return isl_basic_set_project_out(domain, n_out, 0);
2204 struct isl_basic_set *isl_basic_map_range(struct isl_basic_map *bmap)
2206 return isl_basic_map_domain(isl_basic_map_reverse(bmap));
2209 struct isl_set *isl_map_range(struct isl_map *map)
2212 struct isl_set *set;
2216 map = isl_map_cow(map);
2220 set = (struct isl_set *) map;
2221 if (set->dim->n_in != 0) {
2222 set->dim = isl_dim_drop_inputs(set->dim, 0, set->dim->n_in);
2226 for (i = 0; i < map->n; ++i) {
2227 set->p[i] = isl_basic_map_range(map->p[i]);
2231 F_CLR(set, ISL_MAP_DISJOINT);
2232 F_CLR(set, ISL_SET_NORMALIZED);
2239 struct isl_map *isl_map_from_set(struct isl_set *set, struct isl_dim *dim)
2242 struct isl_map *map = NULL;
2244 set = isl_set_cow(set);
2247 isl_assert(set->ctx, isl_dim_compatible(set->dim, dim), goto error);
2248 map = (struct isl_map *)set;
2249 for (i = 0; i < set->n; ++i) {
2250 map->p[i] = isl_basic_map_from_basic_set(
2251 set->p[i], isl_dim_copy(dim));
2255 isl_dim_free(map->dim);
2264 struct isl_set *isl_set_from_map(struct isl_map *map)
2267 struct isl_set *set = NULL;
2271 map = isl_map_cow(map);
2274 map->dim = isl_dim_cow(map->dim);
2277 map->dim->n_out += map->dim->n_in;
2279 set = (struct isl_set *)map;
2280 for (i = 0; i < map->n; ++i) {
2281 set->p[i] = isl_basic_set_from_basic_map(map->p[i]);
2291 struct isl_map *isl_map_alloc_dim(struct isl_dim *dim, int n, unsigned flags)
2293 struct isl_map *map;
2297 isl_assert(dim->ctx, n >= 0, return NULL);
2298 map = isl_alloc(dim->ctx, struct isl_map,
2299 sizeof(struct isl_map) +
2300 n * sizeof(struct isl_basic_map *));
2304 map->ctx = dim->ctx;
2305 isl_ctx_ref(map->ctx);
2317 struct isl_map *isl_map_alloc(struct isl_ctx *ctx,
2318 unsigned nparam, unsigned in, unsigned out, int n,
2321 struct isl_map *map;
2322 struct isl_dim *dims;
2324 dims = isl_dim_alloc(ctx, nparam, in, out);
2328 map = isl_map_alloc_dim(dims, n, flags);
2332 struct isl_basic_map *isl_basic_map_empty(struct isl_ctx *ctx,
2333 unsigned nparam, unsigned in, unsigned out)
2335 struct isl_basic_map *bmap;
2336 bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, 1, 0);
2337 bmap = isl_basic_map_set_to_empty(bmap);
2341 struct isl_basic_set *isl_basic_set_empty(struct isl_dim *dim)
2343 struct isl_basic_set *bset;
2344 bset = isl_basic_set_alloc_dim(dim, 0, 1, 0);
2345 bset = isl_basic_set_set_to_empty(bset);
2349 struct isl_basic_map *isl_basic_map_empty_like(struct isl_basic_map *model)
2351 struct isl_basic_map *bmap;
2354 bmap = isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
2355 bmap = isl_basic_map_set_to_empty(bmap);
2359 struct isl_basic_map *isl_basic_map_empty_like_map(struct isl_map *model)
2361 struct isl_basic_map *bmap;
2364 bmap = isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
2365 bmap = isl_basic_map_set_to_empty(bmap);
2369 struct isl_basic_set *isl_basic_set_empty_like(struct isl_basic_set *model)
2371 struct isl_basic_set *bset;
2374 bset = isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
2375 bset = isl_basic_set_set_to_empty(bset);
2379 struct isl_basic_map *isl_basic_map_universe(struct isl_dim *dim)
2381 struct isl_basic_map *bmap;
2382 bmap = isl_basic_map_alloc_dim(dim, 0, 0, 0);
2386 struct isl_basic_set *isl_basic_set_universe(struct isl_dim *dim)
2388 struct isl_basic_set *bset;
2389 bset = isl_basic_set_alloc_dim(dim, 0, 0, 0);
2393 struct isl_basic_set *isl_basic_set_universe_like(struct isl_basic_set *model)
2397 return isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
2400 struct isl_map *isl_map_empty(struct isl_ctx *ctx,
2401 unsigned nparam, unsigned in, unsigned out)
2403 return isl_map_alloc(ctx, nparam, in, out, 0, ISL_MAP_DISJOINT);
2406 struct isl_map *isl_map_empty_like_basic_map(struct isl_basic_map *model)
2410 return isl_map_alloc_dim(isl_dim_copy(model->dim), 0, ISL_MAP_DISJOINT);
2413 struct isl_set *isl_set_empty(struct isl_dim *dim)
2415 return isl_set_alloc_dim(dim, 0, ISL_MAP_DISJOINT);
2418 struct isl_set *isl_set_empty_like(struct isl_set *model)
2422 return isl_set_empty(isl_dim_copy(model->dim));
2425 struct isl_set *isl_set_universe(struct isl_dim *dim)
2427 struct isl_set *set;
2430 set = isl_set_alloc_dim(isl_dim_copy(dim), 1, ISL_MAP_DISJOINT);
2431 set = isl_set_add(set, isl_basic_set_universe(dim));
2435 struct isl_map *isl_map_dup(struct isl_map *map)
2438 struct isl_map *dup;
2442 dup = isl_map_alloc_dim(isl_dim_copy(map->dim), map->n, map->flags);
2443 for (i = 0; i < map->n; ++i)
2444 dup = isl_map_add(dup, isl_basic_map_copy(map->p[i]));
2448 struct isl_map *isl_map_add(struct isl_map *map, struct isl_basic_map *bmap)
2452 isl_assert(map->ctx, isl_dim_equal(map->dim, bmap->dim), goto error);
2453 isl_assert(map->ctx, map->n < map->size, goto error);
2454 map->p[map->n] = bmap;
2456 F_CLR(map, ISL_MAP_NORMALIZED);
2462 isl_basic_map_free(bmap);
2466 void isl_map_free(struct isl_map *map)
2476 isl_ctx_deref(map->ctx);
2477 for (i = 0; i < map->n; ++i)
2478 isl_basic_map_free(map->p[i]);
2479 isl_dim_free(map->dim);
2483 struct isl_map *isl_map_extend(struct isl_map *base,
2484 unsigned nparam, unsigned n_in, unsigned n_out)
2488 base = isl_map_cow(base);
2492 base->dim = isl_dim_extend(base->dim, nparam, n_in, n_out);
2495 for (i = 0; i < base->n; ++i) {
2496 base->p[i] = isl_basic_map_extend_dim(base->p[i],
2497 isl_dim_copy(base->dim), 0, 0, 0);
2507 struct isl_set *isl_set_extend(struct isl_set *base,
2508 unsigned nparam, unsigned dim)
2510 return (struct isl_set *)isl_map_extend((struct isl_map *)base,
2514 static struct isl_basic_map *isl_basic_map_fix_pos(struct isl_basic_map *bmap,
2515 unsigned pos, int value)
2519 bmap = isl_basic_map_cow(bmap);
2520 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
2521 j = isl_basic_map_alloc_equality(bmap);
2524 isl_seq_clr(bmap->eq[j], 1 + isl_basic_map_total_dim(bmap));
2525 isl_int_set_si(bmap->eq[j][pos], -1);
2526 isl_int_set_si(bmap->eq[j][0], value);
2527 bmap = isl_basic_map_simplify(bmap);
2528 return isl_basic_map_finalize(bmap);
2530 isl_basic_map_free(bmap);
2534 struct isl_basic_map *isl_basic_map_fix_si(struct isl_basic_map *bmap,
2535 enum isl_dim_type type, unsigned pos, int value)
2539 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
2540 return isl_basic_map_fix_pos(bmap, basic_map_offset(bmap, type) + pos,
2543 isl_basic_map_free(bmap);
2547 struct isl_basic_map *isl_basic_map_fix_input_si(struct isl_basic_map *bmap,
2548 unsigned input, int value)
2550 return isl_basic_map_fix_si(bmap, isl_dim_in, input, value);
2553 struct isl_basic_set *isl_basic_set_fix_dim_si(struct isl_basic_set *bset,
2554 unsigned dim, int value)
2556 return (struct isl_basic_set *)
2557 isl_basic_map_fix_si((struct isl_basic_map *)bset,
2558 isl_dim_set, dim, value);
2561 struct isl_map *isl_map_fix_si(struct isl_map *map,
2562 enum isl_dim_type type, unsigned pos, int value)
2566 map = isl_map_cow(map);
2570 isl_assert(ctx, pos < isl_map_dim(map, type), goto error);
2571 for (i = 0; i < map->n; ++i) {
2572 map->p[i] = isl_basic_map_fix_si(map->p[i], type, pos, value);
2576 F_CLR(map, ISL_MAP_NORMALIZED);
2583 struct isl_map *isl_map_fix_input_si(struct isl_map *map,
2584 unsigned input, int value)
2586 return isl_map_fix_si(map, isl_dim_in, input, value);
2589 struct isl_set *isl_set_fix_dim_si(struct isl_set *set, unsigned dim, int value)
2591 return (struct isl_set *)
2592 isl_map_fix_si((struct isl_map *)set, isl_dim_set, dim, value);
2595 struct isl_basic_set *isl_basic_set_lower_bound_dim(struct isl_basic_set *bset,
2596 unsigned dim, isl_int value)
2601 bset = isl_basic_set_cow(bset);
2602 bset = isl_basic_set_extend_constraints(bset, 0, 1);
2603 j = isl_basic_set_alloc_inequality(bset);
2606 isl_seq_clr(bset->ineq[j], 1 + isl_basic_set_total_dim(bset));
2607 isl_int_set_si(bset->ineq[j][1 + isl_basic_set_n_param(bset) + dim], 1);
2608 isl_int_neg(bset->ineq[j][0], value);
2609 bset = isl_basic_set_simplify(bset);
2610 return isl_basic_set_finalize(bset);
2612 isl_basic_set_free(bset);
2616 struct isl_set *isl_set_lower_bound_dim(struct isl_set *set, unsigned dim,
2621 set = isl_set_cow(set);
2625 isl_assert(set->ctx, dim < isl_set_n_dim(set), goto error);
2626 for (i = 0; i < set->n; ++i) {
2627 set->p[i] = isl_basic_set_lower_bound_dim(set->p[i], dim, value);
2637 struct isl_map *isl_map_reverse(struct isl_map *map)
2642 map = isl_map_cow(map);
2646 map->dim = isl_dim_reverse(map->dim);
2649 for (i = 0; i < map->n; ++i) {
2650 map->p[i] = isl_basic_map_reverse(map->p[i]);
2654 F_CLR(map, ISL_MAP_NORMALIZED);
2661 struct isl_map *isl_basic_map_lexmax(
2662 struct isl_basic_map *bmap, struct isl_basic_set *dom,
2663 struct isl_set **empty)
2665 return isl_pip_basic_map_lexmax(bmap, dom, empty);
2668 struct isl_map *isl_basic_map_lexmin(
2669 struct isl_basic_map *bmap, struct isl_basic_set *dom,
2670 struct isl_set **empty)
2672 return isl_pip_basic_map_lexmin(bmap, dom, empty);
2675 struct isl_set *isl_basic_set_lexmin(struct isl_basic_set *bset)
2677 struct isl_basic_map *bmap = NULL;
2678 struct isl_basic_set *dom = NULL;
2679 struct isl_map *min;
2680 struct isl_dim *param_dim;
2684 bmap = isl_basic_map_from_basic_set(bset, isl_dim_copy(bset->dim));
2687 param_dim = isl_dim_domain(isl_dim_copy(bmap->dim));
2688 dom = isl_basic_set_universe(param_dim);
2691 min = isl_basic_map_lexmin(bmap, dom, NULL);
2692 return isl_map_range(min);
2694 isl_basic_map_free(bmap);
2698 struct isl_map *isl_basic_map_compute_divs(struct isl_basic_map *bmap)
2705 off = isl_dim_total(bmap->dim);
2706 for (i = 0; i < bmap->n_div; ++i) {
2707 if (isl_int_is_zero(bmap->div[i][0]))
2708 return isl_pip_basic_map_compute_divs(bmap);
2709 isl_assert(bmap->ctx, isl_int_is_zero(bmap->div[i][1+1+off+i]),
2712 return isl_map_from_basic_map(bmap);
2714 isl_basic_map_free(bmap);
2718 struct isl_map *isl_map_compute_divs(struct isl_map *map)
2721 struct isl_map *res;
2727 res = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[0]));
2728 for (i = 1 ; i < map->n; ++i) {
2730 r2 = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[i]));
2731 if (F_ISSET(map, ISL_MAP_DISJOINT))
2732 res = isl_map_union_disjoint(res, r2);
2734 res = isl_map_union(res, r2);
2741 struct isl_set *isl_basic_set_compute_divs(struct isl_basic_set *bset)
2743 return (struct isl_set *)
2744 isl_basic_map_compute_divs((struct isl_basic_map *)bset);
2747 struct isl_set *isl_set_compute_divs(struct isl_set *set)
2749 return (struct isl_set *)
2750 isl_map_compute_divs((struct isl_map *)set);
2753 struct isl_set *isl_map_domain(struct isl_map *map)
2756 struct isl_set *set;
2761 map = isl_map_cow(map);
2765 set = (struct isl_set *)map;
2766 set->dim = isl_dim_domain(set->dim);
2769 for (i = 0; i < map->n; ++i) {
2770 set->p[i] = isl_basic_map_domain(map->p[i]);
2774 F_CLR(set, ISL_MAP_DISJOINT);
2775 F_CLR(set, ISL_SET_NORMALIZED);
2782 struct isl_map *isl_map_union_disjoint(
2783 struct isl_map *map1, struct isl_map *map2)
2787 struct isl_map *map = NULL;
2801 isl_assert(map1->ctx, isl_dim_equal(map1->dim, map2->dim), goto error);
2803 if (F_ISSET(map1, ISL_MAP_DISJOINT) &&
2804 F_ISSET(map2, ISL_MAP_DISJOINT))
2805 FL_SET(flags, ISL_MAP_DISJOINT);
2807 map = isl_map_alloc_dim(isl_dim_copy(map1->dim),
2808 map1->n + map2->n, flags);
2811 for (i = 0; i < map1->n; ++i) {
2812 map = isl_map_add(map,
2813 isl_basic_map_copy(map1->p[i]));
2817 for (i = 0; i < map2->n; ++i) {
2818 map = isl_map_add(map,
2819 isl_basic_map_copy(map2->p[i]));
2833 struct isl_map *isl_map_union(struct isl_map *map1, struct isl_map *map2)
2835 map1 = isl_map_union_disjoint(map1, map2);
2839 F_CLR(map1, ISL_MAP_DISJOINT);
2843 struct isl_set *isl_set_union_disjoint(
2844 struct isl_set *set1, struct isl_set *set2)
2846 return (struct isl_set *)
2847 isl_map_union_disjoint(
2848 (struct isl_map *)set1, (struct isl_map *)set2);
2851 struct isl_set *isl_set_union(struct isl_set *set1, struct isl_set *set2)
2853 return (struct isl_set *)
2854 isl_map_union((struct isl_map *)set1, (struct isl_map *)set2);
2857 struct isl_map *isl_map_intersect_range(
2858 struct isl_map *map, struct isl_set *set)
2861 struct isl_map *result;
2867 if (F_ISSET(map, ISL_MAP_DISJOINT) &&
2868 F_ISSET(set, ISL_MAP_DISJOINT))
2869 FL_SET(flags, ISL_MAP_DISJOINT);
2871 result = isl_map_alloc_dim(isl_dim_copy(map->dim),
2872 map->n * set->n, flags);
2875 for (i = 0; i < map->n; ++i)
2876 for (j = 0; j < set->n; ++j) {
2877 result = isl_map_add(result,
2878 isl_basic_map_intersect_range(
2879 isl_basic_map_copy(map->p[i]),
2880 isl_basic_set_copy(set->p[j])));
2893 struct isl_map *isl_map_intersect_domain(
2894 struct isl_map *map, struct isl_set *set)
2896 return isl_map_reverse(
2897 isl_map_intersect_range(isl_map_reverse(map), set));
2900 struct isl_map *isl_map_apply_domain(
2901 struct isl_map *map1, struct isl_map *map2)
2905 map1 = isl_map_reverse(map1);
2906 map1 = isl_map_apply_range(map1, map2);
2907 return isl_map_reverse(map1);
2914 struct isl_map *isl_map_apply_range(
2915 struct isl_map *map1, struct isl_map *map2)
2917 struct isl_dim *dim_result;
2918 struct isl_map *result;
2927 dim_result = isl_dim_join(isl_dim_copy(map1->dim),
2928 isl_dim_copy(map2->dim));
2930 result = isl_map_alloc_dim(dim_result, map1->n * map2->n, 0);
2933 for (i = 0; i < map1->n; ++i)
2934 for (j = 0; j < map2->n; ++j) {
2935 result = isl_map_add(result,
2936 isl_basic_map_apply_range(
2937 isl_basic_map_copy(map1->p[i]),
2938 isl_basic_map_copy(map2->p[j])));
2944 if (result && result->n <= 1)
2945 F_SET(result, ISL_MAP_DISJOINT);
2954 * returns range - domain
2956 struct isl_basic_set *isl_basic_map_deltas(struct isl_basic_map *bmap)
2958 struct isl_basic_set *bset;
2965 dim = isl_basic_map_n_in(bmap);
2966 nparam = isl_basic_map_n_param(bmap);
2967 isl_assert(bmap->ctx, dim == isl_basic_map_n_out(bmap), goto error);
2968 bset = isl_basic_set_from_basic_map(bmap);
2969 bset = isl_basic_set_extend(bset, nparam, 3*dim, 0, dim, 0);
2970 bset = isl_basic_set_swap_vars(bset, 2*dim);
2971 for (i = 0; i < dim; ++i) {
2972 int j = isl_basic_map_alloc_equality(
2973 (struct isl_basic_map *)bset);
2976 isl_seq_clr(bset->eq[j], 1 + isl_basic_set_total_dim(bset));
2977 isl_int_set_si(bset->eq[j][1+nparam+i], 1);
2978 isl_int_set_si(bset->eq[j][1+nparam+dim+i], 1);
2979 isl_int_set_si(bset->eq[j][1+nparam+2*dim+i], -1);
2981 return isl_basic_set_project_out(bset, 2*dim, 0);
2983 isl_basic_map_free(bmap);
2988 * returns range - domain
2990 struct isl_set *isl_map_deltas(struct isl_map *map)
2993 struct isl_set *result;
2998 isl_assert(map->ctx, isl_map_n_in(map) == isl_map_n_out(map), goto error);
2999 result = isl_set_alloc(map->ctx, isl_map_n_param(map),
3000 isl_map_n_in(map), map->n, map->flags);
3003 for (i = 0; i < map->n; ++i)
3004 result = isl_set_add(result,
3005 isl_basic_map_deltas(isl_basic_map_copy(map->p[i])));
3013 static struct isl_basic_map *basic_map_identity(struct isl_dim *dims)
3015 struct isl_basic_map *bmap;
3023 nparam = dims->nparam;
3025 bmap = isl_basic_map_alloc_dim(dims, 0, dim, 0);
3029 for (i = 0; i < dim; ++i) {
3030 int j = isl_basic_map_alloc_equality(bmap);
3033 isl_seq_clr(bmap->eq[j], 1 + isl_basic_map_total_dim(bmap));
3034 isl_int_set_si(bmap->eq[j][1+nparam+i], 1);
3035 isl_int_set_si(bmap->eq[j][1+nparam+dim+i], -1);
3037 return isl_basic_map_finalize(bmap);
3039 isl_basic_map_free(bmap);
3043 struct isl_basic_map *isl_basic_map_identity(struct isl_dim *set_dim)
3045 struct isl_dim *dim = isl_dim_map(set_dim);
3048 return basic_map_identity(dim);
3051 struct isl_basic_map *isl_basic_map_identity_like(struct isl_basic_map *model)
3053 if (!model || !model->dim)
3055 isl_assert(model->ctx,
3056 model->dim->n_in == model->dim->n_out, return NULL);
3057 return basic_map_identity(isl_dim_copy(model->dim));
3060 static struct isl_map *map_identity(struct isl_dim *dim)
3062 struct isl_map *map = isl_map_alloc_dim(dim, 1, ISL_MAP_DISJOINT);
3063 return isl_map_add(map, basic_map_identity(isl_dim_copy(dim)));
3066 struct isl_map *isl_map_identity(struct isl_dim *set_dim)
3068 struct isl_dim *dim = isl_dim_map(set_dim);
3071 return map_identity(dim);
3074 struct isl_map *isl_map_identity_like(struct isl_basic_map *model)
3076 if (!model || !model->dim)
3078 isl_assert(model->ctx,
3079 model->dim->n_in == model->dim->n_out, return NULL);
3080 return map_identity(isl_dim_copy(model->dim));
3083 int isl_set_is_equal(struct isl_set *set1, struct isl_set *set2)
3085 return isl_map_is_equal((struct isl_map *)set1, (struct isl_map *)set2);
3088 int isl_set_is_subset(struct isl_set *set1, struct isl_set *set2)
3090 return isl_map_is_subset(
3091 (struct isl_map *)set1, (struct isl_map *)set2);
3094 int isl_basic_map_is_subset(
3095 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3098 struct isl_map *map1;
3099 struct isl_map *map2;
3101 if (!bmap1 || !bmap2)
3104 map1 = isl_map_from_basic_map(isl_basic_map_copy(bmap1));
3105 map2 = isl_map_from_basic_map(isl_basic_map_copy(bmap2));
3107 is_subset = isl_map_is_subset(map1, map2);
3115 int isl_basic_map_is_equal(
3116 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3120 if (!bmap1 || !bmap2)
3122 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
3125 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
3129 int isl_basic_set_is_equal(
3130 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
3132 return isl_basic_map_is_equal(
3133 (struct isl_basic_map *)bset1, (struct isl_basic_map *)bset2);
3136 int isl_map_is_empty(struct isl_map *map)
3143 for (i = 0; i < map->n; ++i) {
3144 is_empty = isl_basic_map_is_empty(map->p[i]);
3153 int isl_set_is_empty(struct isl_set *set)
3155 return isl_map_is_empty((struct isl_map *)set);
3158 int isl_map_is_subset(struct isl_map *map1, struct isl_map *map2)
3162 struct isl_map *diff;
3167 if (isl_map_is_empty(map1))
3170 if (isl_map_is_empty(map2))
3173 diff = isl_map_subtract(isl_map_copy(map1), isl_map_copy(map2));
3177 is_subset = isl_map_is_empty(diff);
3183 int isl_map_is_equal(struct isl_map *map1, struct isl_map *map2)
3189 is_subset = isl_map_is_subset(map1, map2);
3192 is_subset = isl_map_is_subset(map2, map1);
3196 int isl_basic_map_is_strict_subset(
3197 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3201 if (!bmap1 || !bmap2)
3203 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
3206 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
3207 if (is_subset == -1)
3212 static int basic_map_contains(struct isl_basic_map *bmap, struct isl_vec *vec)
3218 total = 1 + isl_basic_map_total_dim(bmap);
3219 if (total != vec->size)
3224 for (i = 0; i < bmap->n_eq; ++i) {
3225 isl_seq_inner_product(vec->block.data, bmap->eq[i], total, &s);
3226 if (!isl_int_is_zero(s)) {
3232 for (i = 0; i < bmap->n_ineq; ++i) {
3233 isl_seq_inner_product(vec->block.data, bmap->ineq[i], total, &s);
3234 if (isl_int_is_neg(s)) {
3245 int isl_basic_map_is_universe(struct isl_basic_map *bmap)
3249 return bmap->n_eq == 0 && bmap->n_ineq == 0;
3252 int isl_basic_map_is_empty(struct isl_basic_map *bmap)
3254 struct isl_basic_set *bset = NULL;
3255 struct isl_vec *sample = NULL;
3262 if (F_ISSET(bmap, ISL_BASIC_MAP_EMPTY))
3265 if (F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL)) {
3266 struct isl_basic_map *copy = isl_basic_map_copy(bmap);
3267 copy = isl_basic_map_convex_hull(copy);
3268 empty = F_ISSET(copy, ISL_BASIC_MAP_EMPTY);
3269 isl_basic_map_free(copy);
3273 total = 1 + isl_basic_map_total_dim(bmap);
3274 if (bmap->sample && bmap->sample->size == total) {
3275 int contains = basic_map_contains(bmap, bmap->sample);
3281 bset = isl_basic_map_underlying_set(isl_basic_map_copy(bmap));
3284 sample = isl_basic_set_sample(bset);
3287 empty = sample->size == 0;
3289 isl_vec_free(bmap->ctx, bmap->sample);
3290 bmap->sample = sample;
3295 int isl_basic_set_is_empty(struct isl_basic_set *bset)
3297 return isl_basic_map_is_empty((struct isl_basic_map *)bset);
3300 struct isl_map *isl_basic_map_union(
3301 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3303 struct isl_map *map;
3304 if (!bmap1 || !bmap2)
3307 isl_assert(map1->ctx, isl_dim_equal(bmap1->dim, bmap2->dim), goto error);
3309 map = isl_map_alloc_dim(isl_dim_copy(bmap1->dim), 2, 0);
3312 map = isl_map_add(map, bmap1);
3313 map = isl_map_add(map, bmap2);
3316 isl_basic_map_free(bmap1);
3317 isl_basic_map_free(bmap2);
3321 struct isl_set *isl_basic_set_union(
3322 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
3324 return (struct isl_set *)isl_basic_map_union(
3325 (struct isl_basic_map *)bset1,
3326 (struct isl_basic_map *)bset2);
3329 /* Order divs such that any div only depends on previous divs */
3330 static struct isl_basic_map *order_divs(struct isl_basic_map *bmap)
3333 unsigned off = isl_dim_total(bmap->dim);
3335 for (i = 0; i < bmap->n_div; ++i) {
3337 pos = isl_seq_first_non_zero(bmap->div[i]+1+1+off+i,
3341 swap_div(bmap, i, pos);
3347 /* Look for a div in dst that corresponds to the div "div" in src.
3348 * The divs before "div" in src and dst are assumed to be the same.
3350 * Returns -1 if no corresponding div was found and the position
3351 * of the corresponding div in dst otherwise.
3353 static int find_div(struct isl_basic_map *dst,
3354 struct isl_basic_map *src, unsigned div)
3358 unsigned total = isl_dim_total(src->dim);
3360 isl_assert(dst->ctx, div <= dst->n_div, return -1);
3361 for (i = div; i < dst->n_div; ++i)
3362 if (isl_seq_eq(dst->div[i], src->div[div], 1+1+total+div) &&
3363 isl_seq_first_non_zero(dst->div[i]+1+1+total+div,
3364 dst->n_div - div) == -1)
3369 struct isl_basic_map *isl_basic_map_align_divs(
3370 struct isl_basic_map *dst, struct isl_basic_map *src)
3373 unsigned total = isl_dim_total(src->dim);
3378 if (src->n_div == 0)
3381 for (i = 0; i < src->n_div; ++i)
3382 isl_assert(src->ctx, !isl_int_is_zero(src->div[i][0]), goto error);
3384 src = order_divs(src);
3385 dst = isl_basic_map_extend_dim(dst, isl_dim_copy(dst->dim),
3386 src->n_div, 0, 2 * src->n_div);
3389 for (i = 0; i < src->n_div; ++i) {
3390 int j = find_div(dst, src, i);
3392 j = isl_basic_map_alloc_div(dst);
3395 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total+i);
3396 isl_seq_clr(dst->div[j]+1+1+total+i, dst->n_div - i);
3397 if (add_div_constraints(dst, j) < 0)
3401 swap_div(dst, i, j);
3405 isl_basic_map_free(dst);
3409 struct isl_basic_set *isl_basic_set_align_divs(
3410 struct isl_basic_set *dst, struct isl_basic_set *src)
3412 return (struct isl_basic_set *)isl_basic_map_align_divs(
3413 (struct isl_basic_map *)dst, (struct isl_basic_map *)src);
3416 struct isl_map *isl_map_align_divs(struct isl_map *map)
3420 map = isl_map_compute_divs(map);
3421 map = isl_map_cow(map);
3425 for (i = 1; i < map->n; ++i)
3426 map->p[0] = isl_basic_map_align_divs(map->p[0], map->p[i]);
3427 for (i = 1; i < map->n; ++i)
3428 map->p[i] = isl_basic_map_align_divs(map->p[i], map->p[0]);
3430 F_CLR(map, ISL_MAP_NORMALIZED);
3434 static struct isl_map *add_cut_constraint(struct isl_map *dst,
3435 struct isl_basic_map *src, isl_int *c,
3436 unsigned len, int oppose)
3438 struct isl_basic_map *copy = NULL;
3443 copy = isl_basic_map_copy(src);
3444 copy = isl_basic_map_cow(copy);
3447 copy = isl_basic_map_extend_constraints(copy, 0, 1);
3448 k = isl_basic_map_alloc_inequality(copy);
3452 isl_seq_neg(copy->ineq[k], c, len);
3454 isl_seq_cpy(copy->ineq[k], c, len);
3455 total = 1 + isl_basic_map_total_dim(copy);
3456 isl_seq_clr(copy->ineq[k]+len, total - len);
3457 isl_inequality_negate(copy, k);
3458 copy = isl_basic_map_simplify(copy);
3459 copy = isl_basic_map_finalize(copy);
3460 is_empty = isl_basic_map_is_empty(copy);
3464 dst = isl_map_add(dst, copy);
3466 isl_basic_map_free(copy);
3469 isl_basic_map_free(copy);
3474 static struct isl_map *subtract(struct isl_map *map, struct isl_basic_map *bmap)
3478 struct isl_map *rest = NULL;
3480 unsigned total = isl_basic_map_total_dim(bmap);
3487 if (F_ISSET(map, ISL_MAP_DISJOINT))
3488 FL_SET(flags, ISL_MAP_DISJOINT);
3490 max = map->n * (2 * bmap->n_eq + bmap->n_ineq);
3491 rest = isl_map_alloc_dim(isl_dim_copy(map->dim), max, flags);
3495 for (i = 0; i < map->n; ++i) {
3496 map->p[i] = isl_basic_map_align_divs(map->p[i], bmap);
3501 for (j = 0; j < map->n; ++j)
3502 map->p[j] = isl_basic_map_cow(map->p[j]);
3504 for (i = 0; i < bmap->n_eq; ++i) {
3505 for (j = 0; j < map->n; ++j) {
3506 rest = add_cut_constraint(rest,
3507 map->p[j], bmap->eq[i], 1+total, 0);
3511 rest = add_cut_constraint(rest,
3512 map->p[j], bmap->eq[i], 1+total, 1);
3516 map->p[j] = isl_basic_map_extend_constraints(map->p[j],
3520 k = isl_basic_map_alloc_equality(map->p[j]);
3523 isl_seq_cpy(map->p[j]->eq[k], bmap->eq[i], 1+total);
3524 isl_seq_clr(map->p[j]->eq[k]+1+total,
3525 map->p[j]->n_div - bmap->n_div);
3529 for (i = 0; i < bmap->n_ineq; ++i) {
3530 for (j = 0; j < map->n; ++j) {
3531 rest = add_cut_constraint(rest,
3532 map->p[j], bmap->ineq[i], 1+total, 0);
3536 map->p[j] = isl_basic_map_extend_constraints(map->p[j],
3540 k = isl_basic_map_alloc_inequality(map->p[j]);
3543 isl_seq_cpy(map->p[j]->ineq[k], bmap->ineq[i], 1+total);
3544 isl_seq_clr(map->p[j]->ineq[k]+1+total,
3545 map->p[j]->n_div - bmap->n_div);
3557 struct isl_map *isl_map_subtract(struct isl_map *map1, struct isl_map *map2)
3563 isl_assert(map1->ctx, isl_dim_equal(map1->dim, map2->dim), goto error);
3565 if (isl_map_is_empty(map2)) {
3570 map1 = isl_map_compute_divs(map1);
3571 map2 = isl_map_compute_divs(map2);
3575 for (i = 0; map1 && i < map2->n; ++i)
3576 map1 = subtract(map1, map2->p[i]);
3586 struct isl_set *isl_set_subtract(struct isl_set *set1, struct isl_set *set2)
3588 return (struct isl_set *)
3590 (struct isl_map *)set1, (struct isl_map *)set2);
3593 struct isl_set *isl_set_apply(struct isl_set *set, struct isl_map *map)
3597 isl_assert(set->ctx, isl_map_compatible_domain(map, set), goto error);
3598 map = isl_map_intersect_domain(map, set);
3599 set = isl_map_range(map);
3607 /* There is no need to cow as removing empty parts doesn't change
3608 * the meaning of the set.
3610 struct isl_map *isl_map_remove_empty_parts(struct isl_map *map)
3617 for (i = map->n-1; i >= 0; --i) {
3618 if (!F_ISSET(map->p[i], ISL_BASIC_MAP_EMPTY))
3620 isl_basic_map_free(map->p[i]);
3621 if (i != map->n-1) {
3622 F_CLR(map, ISL_MAP_NORMALIZED);
3623 map->p[i] = map->p[map->n-1];
3631 struct isl_set *isl_set_remove_empty_parts(struct isl_set *set)
3633 return (struct isl_set *)
3634 isl_map_remove_empty_parts((struct isl_map *)set);
3637 struct isl_basic_set *isl_set_copy_basic_set(struct isl_set *set)
3639 struct isl_basic_set *bset;
3640 if (!set || set->n == 0)
3642 bset = set->p[set->n-1];
3643 isl_assert(set->ctx, F_ISSET(bset, ISL_BASIC_SET_FINAL), return NULL);
3644 return isl_basic_set_copy(bset);
3647 struct isl_set *isl_set_drop_basic_set(struct isl_set *set,
3648 struct isl_basic_set *bset)
3654 for (i = set->n-1; i >= 0; --i) {
3655 if (set->p[i] != bset)
3657 set = isl_set_cow(set);
3660 isl_basic_set_free(set->p[i]);
3661 if (i != set->n-1) {
3662 F_CLR(set, ISL_SET_NORMALIZED);
3663 set->p[i] = set->p[set->n-1];
3668 isl_basic_set_free(bset);
3672 isl_basic_set_free(bset);
3676 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
3677 * for any common value of the parameters and dimensions preceding dim
3678 * in both basic sets, the values of dimension pos in bset1 are
3679 * smaller or larger than those in bset2.
3682 * 1 if bset1 follows bset2
3683 * -1 if bset1 precedes bset2
3684 * 0 if bset1 and bset2 are incomparable
3685 * -2 if some error occurred.
3687 int isl_basic_set_compare_at(struct isl_basic_set *bset1,
3688 struct isl_basic_set *bset2, int pos)
3690 struct isl_dim *dims;
3691 struct isl_basic_map *bmap1 = NULL;
3692 struct isl_basic_map *bmap2 = NULL;
3693 struct isl_ctx *ctx;
3694 struct isl_vec *obj;
3697 unsigned dim1, dim2;
3699 enum isl_lp_result res;
3702 if (!bset1 || !bset2)
3705 nparam = isl_basic_set_n_param(bset1);
3706 dim1 = isl_basic_set_n_dim(bset1);
3707 dim2 = isl_basic_set_n_dim(bset2);
3708 dims = isl_dim_alloc(bset1->ctx, nparam, pos, dim1 - pos);
3709 bmap1 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset1), dims);
3710 dims = isl_dim_alloc(bset2->ctx, nparam, pos, dim2 - pos);
3711 bmap2 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset2), dims);
3712 if (!bmap1 || !bmap2)
3714 bmap1 = isl_basic_map_extend(bmap1, nparam,
3715 pos, (dim1 - pos) + (dim2 - pos),
3716 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
3717 bmap1 = add_constraints(bmap1, bmap2, 0, dim1 - pos);
3720 total = isl_basic_map_total_dim(bmap1);
3722 obj = isl_vec_alloc(ctx, total);
3723 isl_seq_clr(obj->block.data, total);
3724 isl_int_set_si(obj->block.data[nparam+pos], 1);
3725 isl_int_set_si(obj->block.data[nparam+pos+(dim1-pos)], -1);
3730 res = isl_solve_lp(bmap1, 0, obj->block.data, ctx->one, &num, &den);
3731 if (res == isl_lp_empty)
3733 else if (res == isl_lp_ok && isl_int_is_pos(num))
3735 else if ((res == isl_lp_ok && isl_int_is_neg(num)) ||
3736 res == isl_lp_unbounded)
3742 isl_basic_map_free(bmap1);
3743 isl_vec_free(ctx, obj);
3746 isl_basic_map_free(bmap1);
3747 isl_basic_map_free(bmap2);
3751 static int isl_basic_map_fast_has_fixed_var(struct isl_basic_map *bmap,
3752 unsigned pos, isl_int *val)
3760 total = isl_basic_map_total_dim(bmap);
3761 for (i = 0, d = total-1; i < bmap->n_eq && d+1 > pos; ++i) {
3762 for (; d+1 > pos; --d)
3763 if (!isl_int_is_zero(bmap->eq[i][1+d]))
3767 if (isl_seq_first_non_zero(bmap->eq[i]+1, d) != -1)
3769 if (isl_seq_first_non_zero(bmap->eq[i]+1+d+1, total-d-1) != -1)
3771 if (!isl_int_is_one(bmap->eq[i][1+d]))
3774 isl_int_neg(*val, bmap->eq[i][0]);
3780 static int isl_map_fast_has_fixed_var(struct isl_map *map,
3781 unsigned pos, isl_int *val)
3793 return isl_basic_map_fast_has_fixed_var(map->p[0], pos, val);
3796 fixed = isl_basic_map_fast_has_fixed_var(map->p[0], pos, &v);
3797 for (i = 1; fixed == 1 && i < map->n; ++i) {
3798 fixed = isl_basic_map_fast_has_fixed_var(map->p[i], pos, &tmp);
3799 if (fixed == 1 && isl_int_ne(tmp, v))
3803 isl_int_set(*val, v);
3809 static int isl_set_fast_has_fixed_var(struct isl_set *set, unsigned pos,
3812 return isl_map_fast_has_fixed_var((struct isl_map *)set, pos, val);
3815 int isl_basic_map_fast_is_fixed(struct isl_basic_map *bmap,
3816 enum isl_dim_type type, unsigned pos, isl_int *val)
3818 if (pos >= isl_basic_map_dim(bmap, type))
3820 return isl_basic_map_fast_has_fixed_var(bmap,
3821 basic_map_offset(bmap, type) - 1 + pos, val);
3824 /* Check if dimension dim has fixed value and if so and if val is not NULL,
3825 * then return this fixed value in *val.
3827 int isl_set_fast_dim_is_fixed(struct isl_set *set, unsigned dim, isl_int *val)
3829 return isl_set_fast_has_fixed_var(set, isl_set_n_param(set) + dim, val);
3832 /* Check if input variable in has fixed value and if so and if val is not NULL,
3833 * then return this fixed value in *val.
3835 int isl_map_fast_input_is_fixed(struct isl_map *map, unsigned in, isl_int *val)
3837 return isl_map_fast_has_fixed_var(map, isl_map_n_param(map) + in, val);
3840 /* Check if dimension dim has an (obvious) fixed lower bound and if so
3841 * and if val is not NULL, then return this lower bound in *val.
3843 int isl_basic_set_fast_dim_has_fixed_lower_bound(struct isl_basic_set *bset,
3844 unsigned dim, isl_int *val)
3846 int i, i_eq = -1, i_ineq = -1;
3853 total = isl_basic_set_total_dim(bset);
3854 nparam = isl_basic_set_n_param(bset);
3855 for (i = 0; i < bset->n_eq; ++i) {
3856 if (isl_int_is_zero(bset->eq[i][1+nparam+dim]))
3862 for (i = 0; i < bset->n_ineq; ++i) {
3863 if (!isl_int_is_pos(bset->ineq[i][1+nparam+dim]))
3865 if (i_eq != -1 || i_ineq != -1)
3869 if (i_eq == -1 && i_ineq == -1)
3871 c = i_eq != -1 ? bset->eq[i_eq] : bset->ineq[i_ineq];
3872 /* The coefficient should always be one due to normalization. */
3873 if (!isl_int_is_one(c[1+nparam+dim]))
3875 if (isl_seq_first_non_zero(c+1, nparam+dim) != -1)
3877 if (isl_seq_first_non_zero(c+1+nparam+dim+1,
3878 total - nparam - dim - 1) != -1)
3881 isl_int_neg(*val, c[0]);
3885 int isl_set_fast_dim_has_fixed_lower_bound(struct isl_set *set,
3886 unsigned dim, isl_int *val)
3898 return isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[0],
3902 fixed = isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[0],
3904 for (i = 1; fixed == 1 && i < set->n; ++i) {
3905 fixed = isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[i],
3907 if (fixed == 1 && isl_int_ne(tmp, v))
3911 isl_int_set(*val, v);
3922 static int qsort_constraint_cmp(const void *p1, const void *p2)
3924 const struct constraint *c1 = (const struct constraint *)p1;
3925 const struct constraint *c2 = (const struct constraint *)p2;
3926 unsigned size = isl_min(c1->size, c2->size);
3927 return isl_seq_cmp(c1->c, c2->c, size);
3930 static struct isl_basic_map *isl_basic_map_sort_constraints(
3931 struct isl_basic_map *bmap)
3934 struct constraint *c;
3939 total = isl_basic_map_total_dim(bmap);
3940 c = isl_alloc_array(bmap->ctx, struct constraint, bmap->n_ineq);
3943 for (i = 0; i < bmap->n_ineq; ++i) {
3945 c[i].c = bmap->ineq[i];
3947 qsort(c, bmap->n_ineq, sizeof(struct constraint), qsort_constraint_cmp);
3948 for (i = 0; i < bmap->n_ineq; ++i)
3949 bmap->ineq[i] = c[i].c;
3953 isl_basic_map_free(bmap);
3957 struct isl_basic_map *isl_basic_map_normalize(struct isl_basic_map *bmap)
3961 if (F_ISSET(bmap, ISL_BASIC_MAP_NORMALIZED))
3963 bmap = isl_basic_map_convex_hull(bmap);
3964 bmap = isl_basic_map_sort_constraints(bmap);
3965 F_SET(bmap, ISL_BASIC_MAP_NORMALIZED);
3969 struct isl_basic_set *isl_basic_set_normalize(struct isl_basic_set *bset)
3971 return (struct isl_basic_set *)isl_basic_map_normalize(
3972 (struct isl_basic_map *)bset);
3975 static int isl_basic_map_fast_cmp(const struct isl_basic_map *bmap1,
3976 const struct isl_basic_map *bmap2)
3983 if (isl_basic_map_n_param(bmap1) != isl_basic_map_n_param(bmap2))
3984 return isl_basic_map_n_param(bmap1) - isl_basic_map_n_param(bmap2);
3985 if (isl_basic_map_n_in(bmap1) != isl_basic_map_n_in(bmap2))
3986 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
3987 if (isl_basic_map_n_out(bmap1) != isl_basic_map_n_out(bmap2))
3988 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
3989 if (F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY) &&
3990 F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
3992 if (F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY))
3994 if (F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
3996 if (bmap1->n_eq != bmap2->n_eq)
3997 return bmap1->n_eq - bmap2->n_eq;
3998 if (bmap1->n_ineq != bmap2->n_ineq)
3999 return bmap1->n_ineq - bmap2->n_ineq;
4000 if (bmap1->n_div != bmap2->n_div)
4001 return bmap1->n_div - bmap2->n_div;
4002 total = isl_basic_map_total_dim(bmap1);
4003 for (i = 0; i < bmap1->n_eq; ++i) {
4004 cmp = isl_seq_cmp(bmap1->eq[i], bmap2->eq[i], 1+total);
4008 for (i = 0; i < bmap1->n_ineq; ++i) {
4009 cmp = isl_seq_cmp(bmap1->ineq[i], bmap2->ineq[i], 1+total);
4013 for (i = 0; i < bmap1->n_div; ++i) {
4014 cmp = isl_seq_cmp(bmap1->div[i], bmap2->div[i], 1+1+total);
4021 static int isl_basic_map_fast_is_equal(struct isl_basic_map *bmap1,
4022 struct isl_basic_map *bmap2)
4024 return isl_basic_map_fast_cmp(bmap1, bmap2) == 0;
4027 static int qsort_bmap_cmp(const void *p1, const void *p2)
4029 const struct isl_basic_map *bmap1 = *(const struct isl_basic_map **)p1;
4030 const struct isl_basic_map *bmap2 = *(const struct isl_basic_map **)p2;
4032 return isl_basic_map_fast_cmp(bmap1, bmap2);
4035 /* We normalize in place, but if anything goes wrong we need
4036 * to return NULL, so we need to make sure we don't change the
4037 * meaning of any possible other copies of map.
4039 struct isl_map *isl_map_normalize(struct isl_map *map)
4042 struct isl_basic_map *bmap;
4046 if (F_ISSET(map, ISL_MAP_NORMALIZED))
4048 for (i = 0; i < map->n; ++i) {
4049 bmap = isl_basic_map_normalize(isl_basic_map_copy(map->p[i]));
4052 isl_basic_map_free(map->p[i]);
4055 qsort(map->p, map->n, sizeof(struct isl_basic_map *), qsort_bmap_cmp);
4056 F_SET(map, ISL_MAP_NORMALIZED);
4057 map = isl_map_remove_empty_parts(map);
4060 for (i = map->n - 1; i >= 1; --i) {
4061 if (!isl_basic_map_fast_is_equal(map->p[i-1], map->p[i]))
4063 isl_basic_map_free(map->p[i-1]);
4064 for (j = i; j < map->n; ++j)
4065 map->p[j-1] = map->p[j];
4075 struct isl_set *isl_set_normalize(struct isl_set *set)
4077 return (struct isl_set *)isl_map_normalize((struct isl_map *)set);
4080 int isl_map_fast_is_equal(struct isl_map *map1, struct isl_map *map2)
4090 if (!isl_dim_equal(map1->dim, map2->dim))
4093 map1 = isl_map_copy(map1);
4094 map2 = isl_map_copy(map2);
4095 map1 = isl_map_normalize(map1);
4096 map2 = isl_map_normalize(map2);
4099 equal = map1->n == map2->n;
4100 for (i = 0; equal && i < map1->n; ++i) {
4101 equal = isl_basic_map_fast_is_equal(map1->p[i], map2->p[i]);
4114 int isl_set_fast_is_equal(struct isl_set *set1, struct isl_set *set2)
4116 return isl_map_fast_is_equal((struct isl_map *)set1,
4117 (struct isl_map *)set2);
4120 /* Return an interval that ranges from min to max (inclusive)
4122 struct isl_basic_set *isl_basic_set_interval(struct isl_ctx *ctx,
4123 isl_int min, isl_int max)
4126 struct isl_basic_set *bset = NULL;
4128 bset = isl_basic_set_alloc(ctx, 0, 1, 0, 0, 2);
4132 k = isl_basic_set_alloc_inequality(bset);
4135 isl_int_set_si(bset->ineq[k][1], 1);
4136 isl_int_neg(bset->ineq[k][0], min);
4138 k = isl_basic_set_alloc_inequality(bset);
4141 isl_int_set_si(bset->ineq[k][1], -1);
4142 isl_int_set(bset->ineq[k][0], max);
4146 isl_basic_set_free(bset);
4150 /* Return the Cartesian product of the basic sets in list (in the given order).
4152 struct isl_basic_set *isl_basic_set_product(struct isl_basic_set_list *list)
4160 struct isl_basic_set *product = NULL;
4164 isl_assert(list->ctx, list->n > 0, goto error);
4165 isl_assert(list->ctx, list->p[0], goto error);
4166 nparam = isl_basic_set_n_param(list->p[0]);
4167 dim = isl_basic_set_n_dim(list->p[0]);
4168 extra = list->p[0]->n_div;
4169 n_eq = list->p[0]->n_eq;
4170 n_ineq = list->p[0]->n_ineq;
4171 for (i = 1; i < list->n; ++i) {
4172 isl_assert(list->ctx, list->p[i], goto error);
4173 isl_assert(list->ctx,
4174 nparam == isl_basic_set_n_param(list->p[i]), goto error);
4175 dim += isl_basic_set_n_dim(list->p[i]);
4176 extra += list->p[i]->n_div;
4177 n_eq += list->p[i]->n_eq;
4178 n_ineq += list->p[i]->n_ineq;
4180 product = isl_basic_set_alloc(list->ctx, nparam, dim, extra,
4185 for (i = 0; i < list->n; ++i) {
4186 isl_basic_set_add_constraints(product,
4187 isl_basic_set_copy(list->p[i]), dim);
4188 dim += isl_basic_set_n_dim(list->p[i]);
4190 isl_basic_set_list_free(list);
4193 isl_basic_set_free(product);
4194 isl_basic_set_list_free(list);
4198 uint32_t isl_basic_set_get_hash(struct isl_basic_set *bset)
4206 bset = isl_basic_set_copy(bset);
4207 bset = isl_basic_set_normalize(bset);
4210 total = isl_basic_set_total_dim(bset);
4211 isl_hash_byte(hash, bset->n_eq & 0xFF);
4212 for (i = 0; i < bset->n_eq; ++i) {
4214 c_hash = isl_seq_get_hash(bset->eq[i], 1 + total);
4215 isl_hash_hash(hash, c_hash);
4217 isl_hash_byte(hash, bset->n_ineq & 0xFF);
4218 for (i = 0; i < bset->n_ineq; ++i) {
4220 c_hash = isl_seq_get_hash(bset->ineq[i], 1 + total);
4221 isl_hash_hash(hash, c_hash);
4223 isl_hash_byte(hash, bset->n_div & 0xFF);
4224 for (i = 0; i < bset->n_div; ++i) {
4226 if (isl_int_is_zero(bset->div[i][0]))
4228 isl_hash_byte(hash, i & 0xFF);
4229 c_hash = isl_seq_get_hash(bset->div[i], 1 + 1 + total);
4230 isl_hash_hash(hash, c_hash);
4232 isl_basic_set_free(bset);
4236 uint32_t isl_set_get_hash(struct isl_set *set)
4243 set = isl_set_copy(set);
4244 set = isl_set_normalize(set);
4248 hash = isl_hash_init();
4249 for (i = 0; i < set->n; ++i) {
4251 bset_hash = isl_basic_set_get_hash(set->p[i]);
4252 isl_hash_hash(hash, bset_hash);
4260 /* Check if the value for dimension dim is completely determined
4261 * by the values of the other parameters and variables.
4262 * That is, check if dimension dim is involved in an equality.
4264 int isl_basic_set_dim_is_unique(struct isl_basic_set *bset, unsigned dim)
4271 nparam = isl_basic_set_n_param(bset);
4272 for (i = 0; i < bset->n_eq; ++i)
4273 if (!isl_int_is_zero(bset->eq[i][1 + nparam + dim]))
4278 /* Check if the value for dimension dim is completely determined
4279 * by the values of the other parameters and variables.
4280 * That is, check if dimension dim is involved in an equality
4281 * for each of the subsets.
4283 int isl_set_dim_is_unique(struct isl_set *set, unsigned dim)
4289 for (i = 0; i < set->n; ++i) {
4291 unique = isl_basic_set_dim_is_unique(set->p[i], dim);