6 #include "isl_equalities.h"
12 #include "isl_map_private.h"
13 #include "isl_map_piplib.h"
14 #include "isl_sample.h"
18 /* Maps dst positions to src positions */
24 static struct isl_dim_map *isl_dim_map_alloc(struct isl_ctx *ctx, unsigned len)
27 struct isl_dim_map *dim_map;
28 dim_map = isl_alloc(ctx, struct isl_dim_map,
29 sizeof(struct isl_dim_map) + len * sizeof(int));
32 dim_map->len = 1 + len;
34 for (i = 0; i < len; ++i)
35 dim_map->pos[1 + i] = -1;
39 static unsigned n(struct isl_dim *dim, enum isl_dim_type type)
42 case isl_dim_param: return dim->nparam;
43 case isl_dim_in: return dim->n_in;
44 case isl_dim_out: return dim->n_out;
45 case isl_dim_all: return dim->nparam + dim->n_in + dim->n_out;
49 static unsigned pos(struct isl_dim *dim, enum isl_dim_type type)
52 case isl_dim_param: return 1;
53 case isl_dim_in: return 1 + dim->nparam;
54 case isl_dim_out: return 1 + dim->nparam + dim->n_in;
58 static void isl_dim_map_dim(struct isl_dim_map *dim_map, struct isl_dim *dim,
59 enum isl_dim_type type, unsigned dst_pos)
67 src_pos = pos(dim, type);
68 for (i = 0; i < n(dim, type); ++i)
69 dim_map->pos[1 + dst_pos + i] = src_pos + i;
72 static void isl_dim_map_div(struct isl_dim_map *dim_map,
73 struct isl_basic_map *bmap, unsigned dst_pos)
78 if (!dim_map || !bmap)
81 src_pos = 1 + isl_dim_total(bmap->dim);
82 for (i = 0; i < bmap->n_div; ++i)
83 dim_map->pos[1 + dst_pos + i] = src_pos + i;
86 static void isl_dim_map_dump(struct isl_dim_map *dim_map)
90 for (i = 0; i < dim_map->len; ++i)
91 fprintf(stderr, "%d -> %d; ", i, dim_map->pos[i]);
92 fprintf(stderr, "\n");
95 unsigned isl_basic_map_dim(const struct isl_basic_map *bmap,
96 enum isl_dim_type type)
101 case isl_dim_out: return isl_dim_size(bmap->dim, type);
102 case isl_dim_div: return bmap->n_div;
103 case isl_dim_all: return isl_basic_map_total_dim(bmap);
107 unsigned isl_map_dim(const struct isl_map *map, enum isl_dim_type type)
109 return n(map->dim, type);
112 unsigned isl_set_dim(const struct isl_set *set, enum isl_dim_type type)
114 return n(set->dim, type);
117 unsigned isl_basic_map_offset(struct isl_basic_map *bmap,
118 enum isl_dim_type type)
120 struct isl_dim *dim = bmap->dim;
122 case isl_dim_param: return 1;
123 case isl_dim_in: return 1 + dim->nparam;
124 case isl_dim_out: return 1 + dim->nparam + dim->n_in;
125 case isl_dim_div: return 1 + dim->nparam + dim->n_in + dim->n_out;
129 static unsigned map_offset(struct isl_map *map, enum isl_dim_type type)
131 return pos(map->dim, type);
134 unsigned isl_basic_set_dim(const struct isl_basic_set *bset,
135 enum isl_dim_type type)
137 return isl_basic_map_dim((const struct isl_basic_map*)bset, type);
140 unsigned isl_basic_set_n_dim(const struct isl_basic_set *bset)
142 return bset->dim->n_out;
145 unsigned isl_basic_set_n_param(const struct isl_basic_set *bset)
147 return bset->dim->nparam;
150 unsigned isl_basic_set_total_dim(const struct isl_basic_set *bset)
152 return isl_dim_total(bset->dim) + bset->n_div;
155 unsigned isl_set_n_dim(const struct isl_set *set)
157 return set->dim->n_out;
160 unsigned isl_set_n_param(const struct isl_set *set)
162 return set->dim->nparam;
165 unsigned isl_basic_map_n_in(const struct isl_basic_map *bmap)
167 return bmap->dim->n_in;
170 unsigned isl_basic_map_n_out(const struct isl_basic_map *bmap)
172 return bmap->dim->n_out;
175 unsigned isl_basic_map_n_param(const struct isl_basic_map *bmap)
177 return bmap->dim->nparam;
180 unsigned isl_basic_map_n_div(const struct isl_basic_map *bmap)
185 unsigned isl_basic_map_total_dim(const struct isl_basic_map *bmap)
187 return isl_dim_total(bmap->dim) + bmap->n_div;
190 unsigned isl_map_n_in(const struct isl_map *map)
192 return map->dim->n_in;
195 unsigned isl_map_n_out(const struct isl_map *map)
197 return map->dim->n_out;
200 unsigned isl_map_n_param(const struct isl_map *map)
202 return map->dim->nparam;
205 int isl_map_compatible_domain(struct isl_map *map, struct isl_set *set)
207 return map->dim->n_in == set->dim->n_out &&
208 map->dim->nparam == set->dim->nparam;
211 int isl_basic_map_compatible_domain(struct isl_basic_map *bmap,
212 struct isl_basic_set *bset)
214 return bmap->dim->n_in == bset->dim->n_out &&
215 bmap->dim->nparam == bset->dim->nparam;
218 int isl_basic_map_compatible_range(struct isl_basic_map *bmap,
219 struct isl_basic_set *bset)
221 return bmap->dim->n_out == bset->dim->n_out &&
222 bmap->dim->nparam == bset->dim->nparam;
225 struct isl_dim *isl_basic_map_get_dim(struct isl_basic_map *bmap)
229 return isl_dim_copy(bmap->dim);
232 struct isl_dim *isl_basic_set_get_dim(struct isl_basic_set *bset)
236 return isl_dim_copy(bset->dim);
239 struct isl_dim *isl_map_get_dim(struct isl_map *map)
243 return isl_dim_copy(map->dim);
246 struct isl_dim *isl_set_get_dim(struct isl_set *set)
250 return isl_dim_copy(set->dim);
253 static struct isl_basic_map *basic_map_init(struct isl_ctx *ctx,
254 struct isl_basic_map *bmap, unsigned extra,
255 unsigned n_eq, unsigned n_ineq)
258 size_t row_size = 1 + isl_dim_total(bmap->dim) + extra;
260 bmap->block = isl_blk_alloc(ctx, (n_ineq + n_eq) * row_size);
261 if (isl_blk_is_error(bmap->block)) {
266 bmap->ineq = isl_alloc_array(ctx, isl_int *, n_ineq + n_eq);
268 isl_blk_free(ctx, bmap->block);
274 bmap->block2 = isl_blk_empty();
277 bmap->block2 = isl_blk_alloc(ctx, extra * (1 + row_size));
278 if (isl_blk_is_error(bmap->block2)) {
280 isl_blk_free(ctx, bmap->block);
285 bmap->div = isl_alloc_array(ctx, isl_int *, extra);
287 isl_blk_free(ctx, bmap->block2);
289 isl_blk_free(ctx, bmap->block);
295 for (i = 0; i < n_ineq + n_eq; ++i)
296 bmap->ineq[i] = bmap->block.data + i * row_size;
298 for (i = 0; i < extra; ++i)
299 bmap->div[i] = bmap->block2.data + i * (1 + row_size);
305 bmap->c_size = n_eq + n_ineq;
306 bmap->eq = bmap->ineq + n_ineq;
315 isl_basic_map_free(bmap);
319 struct isl_basic_set *isl_basic_set_alloc(struct isl_ctx *ctx,
320 unsigned nparam, unsigned dim, unsigned extra,
321 unsigned n_eq, unsigned n_ineq)
323 struct isl_basic_map *bmap;
324 bmap = isl_basic_map_alloc(ctx, nparam, 0, dim, extra, n_eq, n_ineq);
325 return (struct isl_basic_set *)bmap;
328 struct isl_basic_set *isl_basic_set_alloc_dim(struct isl_dim *dim,
329 unsigned extra, unsigned n_eq, unsigned n_ineq)
331 struct isl_basic_map *bmap;
334 isl_assert(dim->ctx, dim->n_in == 0, return NULL);
335 bmap = isl_basic_map_alloc_dim(dim, extra, n_eq, n_ineq);
336 return (struct isl_basic_set *)bmap;
339 struct isl_basic_map *isl_basic_map_alloc_dim(struct isl_dim *dim,
340 unsigned extra, unsigned n_eq, unsigned n_ineq)
342 struct isl_basic_map *bmap;
346 bmap = isl_alloc_type(dim->ctx, struct isl_basic_map);
351 return basic_map_init(dim->ctx, bmap, extra, n_eq, n_ineq);
357 struct isl_basic_map *isl_basic_map_alloc(struct isl_ctx *ctx,
358 unsigned nparam, unsigned in, unsigned out, unsigned extra,
359 unsigned n_eq, unsigned n_ineq)
361 struct isl_basic_map *bmap;
364 dim = isl_dim_alloc(ctx, nparam, in, out);
368 bmap = isl_basic_map_alloc_dim(dim, extra, n_eq, n_ineq);
372 static void dup_constraints(
373 struct isl_basic_map *dst, struct isl_basic_map *src)
376 unsigned total = isl_basic_map_total_dim(src);
378 for (i = 0; i < src->n_eq; ++i) {
379 int j = isl_basic_map_alloc_equality(dst);
380 isl_seq_cpy(dst->eq[j], src->eq[i], 1+total);
383 for (i = 0; i < src->n_ineq; ++i) {
384 int j = isl_basic_map_alloc_inequality(dst);
385 isl_seq_cpy(dst->ineq[j], src->ineq[i], 1+total);
388 for (i = 0; i < src->n_div; ++i) {
389 int j = isl_basic_map_alloc_div(dst);
390 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total);
392 ISL_F_SET(dst, ISL_BASIC_SET_FINAL);
395 struct isl_basic_map *isl_basic_map_dup(struct isl_basic_map *bmap)
397 struct isl_basic_map *dup;
401 dup = isl_basic_map_alloc_dim(isl_dim_copy(bmap->dim),
402 bmap->n_div, bmap->n_eq, bmap->n_ineq);
405 dup_constraints(dup, bmap);
406 dup->flags = bmap->flags;
407 dup->sample = isl_vec_copy(bmap->sample);
411 struct isl_basic_set *isl_basic_set_dup(struct isl_basic_set *bset)
413 struct isl_basic_map *dup;
415 dup = isl_basic_map_dup((struct isl_basic_map *)bset);
416 return (struct isl_basic_set *)dup;
419 struct isl_basic_set *isl_basic_set_copy(struct isl_basic_set *bset)
424 if (ISL_F_ISSET(bset, ISL_BASIC_SET_FINAL)) {
428 return isl_basic_set_dup(bset);
431 struct isl_set *isl_set_copy(struct isl_set *set)
440 struct isl_basic_map *isl_basic_map_copy(struct isl_basic_map *bmap)
445 if (ISL_F_ISSET(bmap, ISL_BASIC_SET_FINAL)) {
449 return isl_basic_map_dup(bmap);
452 struct isl_map *isl_map_copy(struct isl_map *map)
461 void isl_basic_map_free(struct isl_basic_map *bmap)
469 isl_ctx_deref(bmap->ctx);
471 isl_blk_free(bmap->ctx, bmap->block2);
473 isl_blk_free(bmap->ctx, bmap->block);
474 isl_vec_free(bmap->sample);
475 isl_dim_free(bmap->dim);
479 void isl_basic_set_free(struct isl_basic_set *bset)
481 isl_basic_map_free((struct isl_basic_map *)bset);
484 static int room_for_con(struct isl_basic_map *bmap, unsigned n)
486 return bmap->n_eq + bmap->n_ineq + n <= bmap->c_size;
489 int isl_basic_map_alloc_equality(struct isl_basic_map *bmap)
495 isl_assert(ctx, room_for_con(bmap, 1), return -1);
496 isl_assert(ctx, (bmap->eq - bmap->ineq) + bmap->n_eq <= bmap->c_size,
498 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
499 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
500 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_IMPLICIT);
501 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
502 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
503 if ((bmap->eq - bmap->ineq) + bmap->n_eq == bmap->c_size) {
505 int j = isl_basic_map_alloc_inequality(bmap);
509 bmap->ineq[j] = bmap->ineq[bmap->n_ineq - 1];
510 bmap->ineq[bmap->n_ineq - 1] = bmap->eq[-1];
517 isl_seq_clr(bmap->eq[bmap->n_eq] + 1 + isl_basic_map_total_dim(bmap),
518 bmap->extra - bmap->n_div);
522 int isl_basic_set_alloc_equality(struct isl_basic_set *bset)
524 return isl_basic_map_alloc_equality((struct isl_basic_map *)bset);
527 int isl_basic_map_free_equality(struct isl_basic_map *bmap, unsigned n)
531 isl_assert(bmap->ctx, n <= bmap->n_eq, return -1);
536 int isl_basic_set_free_equality(struct isl_basic_set *bset, unsigned n)
538 return isl_basic_map_free_equality((struct isl_basic_map *)bset, n);
541 int isl_basic_map_drop_equality(struct isl_basic_map *bmap, unsigned pos)
546 isl_assert(bmap->ctx, pos < bmap->n_eq, return -1);
548 if (pos != bmap->n_eq - 1) {
550 bmap->eq[pos] = bmap->eq[bmap->n_eq - 1];
551 bmap->eq[bmap->n_eq - 1] = t;
557 int isl_basic_set_drop_equality(struct isl_basic_set *bset, unsigned pos)
559 return isl_basic_map_drop_equality((struct isl_basic_map *)bset, pos);
562 void isl_basic_map_inequality_to_equality(
563 struct isl_basic_map *bmap, unsigned pos)
568 bmap->ineq[pos] = bmap->ineq[bmap->n_ineq - 1];
569 bmap->ineq[bmap->n_ineq - 1] = bmap->eq[-1];
574 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
575 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
576 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
577 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
580 static int room_for_ineq(struct isl_basic_map *bmap, unsigned n)
582 return bmap->n_ineq + n <= bmap->eq - bmap->ineq;
585 int isl_basic_map_alloc_inequality(struct isl_basic_map *bmap)
591 isl_assert(ctx, room_for_ineq(bmap, 1), return -1);
592 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_IMPLICIT);
593 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
594 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
595 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
596 isl_seq_clr(bmap->ineq[bmap->n_ineq] +
597 1 + isl_basic_map_total_dim(bmap),
598 bmap->extra - bmap->n_div);
599 return bmap->n_ineq++;
602 int isl_basic_set_alloc_inequality(struct isl_basic_set *bset)
604 return isl_basic_map_alloc_inequality((struct isl_basic_map *)bset);
607 int isl_basic_map_free_inequality(struct isl_basic_map *bmap, unsigned n)
611 isl_assert(bmap->ctx, n <= bmap->n_ineq, return -1);
616 int isl_basic_set_free_inequality(struct isl_basic_set *bset, unsigned n)
618 return isl_basic_map_free_inequality((struct isl_basic_map *)bset, n);
621 int isl_basic_map_drop_inequality(struct isl_basic_map *bmap, unsigned pos)
626 isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
628 if (pos != bmap->n_ineq - 1) {
630 bmap->ineq[pos] = bmap->ineq[bmap->n_ineq - 1];
631 bmap->ineq[bmap->n_ineq - 1] = t;
632 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
638 int isl_basic_set_drop_inequality(struct isl_basic_set *bset, unsigned pos)
640 return isl_basic_map_drop_inequality((struct isl_basic_map *)bset, pos);
643 __isl_give isl_basic_map *isl_basic_map_add_eq(__isl_take isl_basic_map *bmap,
648 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
651 k = isl_basic_map_alloc_equality(bmap);
654 isl_seq_cpy(bmap->eq[k], eq, 1 + isl_basic_map_total_dim(bmap));
657 isl_basic_map_free(bmap);
661 __isl_give isl_basic_set *isl_basic_set_add_eq(__isl_take isl_basic_set *bset,
664 return (isl_basic_set *)
665 isl_basic_map_add_eq((isl_basic_map *)bset, eq);
668 __isl_give isl_basic_map *isl_basic_map_add_ineq(__isl_take isl_basic_map *bmap,
673 bmap = isl_basic_map_extend_constraints(bmap, 0, 1);
676 k = isl_basic_map_alloc_inequality(bmap);
679 isl_seq_cpy(bmap->ineq[k], ineq, 1 + isl_basic_map_total_dim(bmap));
682 isl_basic_map_free(bmap);
686 __isl_give isl_basic_set *isl_basic_set_add_ineq(__isl_take isl_basic_set *bset,
689 return (isl_basic_set *)
690 isl_basic_map_add_ineq((isl_basic_map *)bset, ineq);
693 int isl_basic_map_alloc_div(struct isl_basic_map *bmap)
697 isl_assert(bmap->ctx, bmap->n_div < bmap->extra, return -1);
698 isl_seq_clr(bmap->div[bmap->n_div] +
699 1 + 1 + isl_basic_map_total_dim(bmap),
700 bmap->extra - bmap->n_div);
701 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
702 return bmap->n_div++;
705 int isl_basic_set_alloc_div(struct isl_basic_set *bset)
707 return isl_basic_map_alloc_div((struct isl_basic_map *)bset);
710 int isl_basic_map_free_div(struct isl_basic_map *bmap, unsigned n)
714 isl_assert(bmap->ctx, n <= bmap->n_div, return -1);
719 int isl_basic_set_free_div(struct isl_basic_set *bset, unsigned n)
721 return isl_basic_map_free_div((struct isl_basic_map *)bset, n);
724 /* Copy constraint from src to dst, putting the vars of src at offset
725 * dim_off in dst and the divs of src at offset div_off in dst.
726 * If both sets are actually map, then dim_off applies to the input
729 static void copy_constraint(struct isl_basic_map *dst_map, isl_int *dst,
730 struct isl_basic_map *src_map, isl_int *src,
731 unsigned in_off, unsigned out_off, unsigned div_off)
733 unsigned src_nparam = isl_basic_map_n_param(src_map);
734 unsigned dst_nparam = isl_basic_map_n_param(dst_map);
735 unsigned src_in = isl_basic_map_n_in(src_map);
736 unsigned dst_in = isl_basic_map_n_in(dst_map);
737 unsigned src_out = isl_basic_map_n_out(src_map);
738 unsigned dst_out = isl_basic_map_n_out(dst_map);
739 isl_int_set(dst[0], src[0]);
740 isl_seq_cpy(dst+1, src+1, isl_min(dst_nparam, src_nparam));
741 if (dst_nparam > src_nparam)
742 isl_seq_clr(dst+1+src_nparam,
743 dst_nparam - src_nparam);
744 isl_seq_clr(dst+1+dst_nparam, in_off);
745 isl_seq_cpy(dst+1+dst_nparam+in_off,
747 isl_min(dst_in-in_off, src_in));
748 if (dst_in-in_off > src_in)
749 isl_seq_clr(dst+1+dst_nparam+in_off+src_in,
750 dst_in - in_off - src_in);
751 isl_seq_clr(dst+1+dst_nparam+dst_in, out_off);
752 isl_seq_cpy(dst+1+dst_nparam+dst_in+out_off,
753 src+1+src_nparam+src_in,
754 isl_min(dst_out-out_off, src_out));
755 if (dst_out-out_off > src_out)
756 isl_seq_clr(dst+1+dst_nparam+dst_in+out_off+src_out,
757 dst_out - out_off - src_out);
758 isl_seq_clr(dst+1+dst_nparam+dst_in+dst_out, div_off);
759 isl_seq_cpy(dst+1+dst_nparam+dst_in+dst_out+div_off,
760 src+1+src_nparam+src_in+src_out,
761 isl_min(dst_map->extra-div_off, src_map->n_div));
762 if (dst_map->n_div-div_off > src_map->n_div)
763 isl_seq_clr(dst+1+dst_nparam+dst_in+dst_out+
764 div_off+src_map->n_div,
765 dst_map->n_div - div_off - src_map->n_div);
768 static void copy_div(struct isl_basic_map *dst_map, isl_int *dst,
769 struct isl_basic_map *src_map, isl_int *src,
770 unsigned in_off, unsigned out_off, unsigned div_off)
772 isl_int_set(dst[0], src[0]);
773 copy_constraint(dst_map, dst+1, src_map, src+1, in_off, out_off, div_off);
776 static struct isl_basic_map *add_constraints(struct isl_basic_map *bmap1,
777 struct isl_basic_map *bmap2, unsigned i_pos, unsigned o_pos)
782 if (!bmap1 || !bmap2)
785 div_off = bmap1->n_div;
787 for (i = 0; i < bmap2->n_eq; ++i) {
788 int i1 = isl_basic_map_alloc_equality(bmap1);
791 copy_constraint(bmap1, bmap1->eq[i1], bmap2, bmap2->eq[i],
792 i_pos, o_pos, div_off);
795 for (i = 0; i < bmap2->n_ineq; ++i) {
796 int i1 = isl_basic_map_alloc_inequality(bmap1);
799 copy_constraint(bmap1, bmap1->ineq[i1], bmap2, bmap2->ineq[i],
800 i_pos, o_pos, div_off);
803 for (i = 0; i < bmap2->n_div; ++i) {
804 int i1 = isl_basic_map_alloc_div(bmap1);
807 copy_div(bmap1, bmap1->div[i1], bmap2, bmap2->div[i],
808 i_pos, o_pos, div_off);
811 isl_basic_map_free(bmap2);
816 isl_basic_map_free(bmap1);
817 isl_basic_map_free(bmap2);
821 static void copy_constraint_dim_map(isl_int *dst, isl_int *src,
822 struct isl_dim_map *dim_map)
826 for (i = 0; i < dim_map->len; ++i) {
827 if (dim_map->pos[i] < 0)
828 isl_int_set_si(dst[i], 0);
830 isl_int_set(dst[i], src[dim_map->pos[i]]);
834 static void copy_div_dim_map(isl_int *dst, isl_int *src,
835 struct isl_dim_map *dim_map)
837 isl_int_set(dst[0], src[0]);
838 copy_constraint_dim_map(dst+1, src+1, dim_map);
841 static struct isl_basic_map *add_constraints_dim_map(struct isl_basic_map *dst,
842 struct isl_basic_map *src, struct isl_dim_map *dim_map)
846 if (!src || !dst || !dim_map)
849 for (i = 0; i < src->n_eq; ++i) {
850 int i1 = isl_basic_map_alloc_equality(dst);
853 copy_constraint_dim_map(dst->eq[i1], src->eq[i], dim_map);
856 for (i = 0; i < src->n_ineq; ++i) {
857 int i1 = isl_basic_map_alloc_inequality(dst);
860 copy_constraint_dim_map(dst->ineq[i1], src->ineq[i], dim_map);
863 for (i = 0; i < src->n_div; ++i) {
864 int i1 = isl_basic_map_alloc_div(dst);
867 copy_div_dim_map(dst->div[i1], src->div[i], dim_map);
871 isl_basic_map_free(src);
876 isl_basic_map_free(src);
877 isl_basic_map_free(dst);
881 struct isl_basic_set *isl_basic_set_add_constraints(struct isl_basic_set *bset1,
882 struct isl_basic_set *bset2, unsigned pos)
884 return (struct isl_basic_set *)
885 add_constraints((struct isl_basic_map *)bset1,
886 (struct isl_basic_map *)bset2, 0, pos);
889 struct isl_basic_map *isl_basic_map_extend_dim(struct isl_basic_map *base,
890 struct isl_dim *dim, unsigned extra,
891 unsigned n_eq, unsigned n_ineq)
893 struct isl_basic_map *ext;
903 dims_ok = isl_dim_equal(base->dim, dim) &&
904 base->extra >= base->n_div + extra;
906 if (dims_ok && room_for_con(base, n_eq + n_ineq) &&
907 room_for_ineq(base, n_ineq)) {
912 isl_assert(base->ctx, base->dim->nparam <= dim->nparam, goto error);
913 isl_assert(base->ctx, base->dim->n_in <= dim->n_in, goto error);
914 isl_assert(base->ctx, base->dim->n_out <= dim->n_out, goto error);
915 extra += base->extra;
917 n_ineq += base->n_ineq;
919 ext = isl_basic_map_alloc_dim(dim, extra, n_eq, n_ineq);
925 ext->sample = isl_vec_copy(base->sample);
927 ext = add_constraints(ext, base, 0, 0);
930 ISL_F_CLR(ext, ISL_BASIC_SET_FINAL);
937 isl_basic_map_free(base);
941 struct isl_basic_set *isl_basic_set_extend_dim(struct isl_basic_set *base,
942 struct isl_dim *dim, unsigned extra,
943 unsigned n_eq, unsigned n_ineq)
945 return (struct isl_basic_set *)
946 isl_basic_map_extend_dim((struct isl_basic_map *)base, dim,
947 extra, n_eq, n_ineq);
950 struct isl_basic_map *isl_basic_map_extend_constraints(
951 struct isl_basic_map *base, unsigned n_eq, unsigned n_ineq)
955 return isl_basic_map_extend_dim(base, isl_dim_copy(base->dim),
959 struct isl_basic_map *isl_basic_map_extend(struct isl_basic_map *base,
960 unsigned nparam, unsigned n_in, unsigned n_out, unsigned extra,
961 unsigned n_eq, unsigned n_ineq)
963 struct isl_basic_map *bmap;
968 dim = isl_dim_alloc(base->ctx, nparam, n_in, n_out);
972 bmap = isl_basic_map_extend_dim(base, dim, extra, n_eq, n_ineq);
976 struct isl_basic_set *isl_basic_set_extend(struct isl_basic_set *base,
977 unsigned nparam, unsigned dim, unsigned extra,
978 unsigned n_eq, unsigned n_ineq)
980 return (struct isl_basic_set *)
981 isl_basic_map_extend((struct isl_basic_map *)base,
982 nparam, 0, dim, extra, n_eq, n_ineq);
985 struct isl_basic_set *isl_basic_set_extend_constraints(
986 struct isl_basic_set *base, unsigned n_eq, unsigned n_ineq)
988 return (struct isl_basic_set *)
989 isl_basic_map_extend_constraints((struct isl_basic_map *)base,
993 struct isl_basic_set *isl_basic_set_cow(struct isl_basic_set *bset)
995 return (struct isl_basic_set *)
996 isl_basic_map_cow((struct isl_basic_map *)bset);
999 struct isl_basic_map *isl_basic_map_cow(struct isl_basic_map *bmap)
1004 if (bmap->ref > 1) {
1006 bmap = isl_basic_map_dup(bmap);
1008 ISL_F_CLR(bmap, ISL_BASIC_SET_FINAL);
1012 struct isl_set *isl_set_cow(struct isl_set *set)
1020 return isl_set_dup(set);
1023 struct isl_map *isl_map_cow(struct isl_map *map)
1031 return isl_map_dup(map);
1034 static void swap_vars(struct isl_blk blk, isl_int *a,
1035 unsigned a_len, unsigned b_len)
1037 isl_seq_cpy(blk.data, a+a_len, b_len);
1038 isl_seq_cpy(blk.data+b_len, a, a_len);
1039 isl_seq_cpy(a, blk.data, b_len+a_len);
1042 struct isl_basic_set *isl_basic_set_swap_vars(
1043 struct isl_basic_set *bset, unsigned n)
1053 nparam = isl_basic_set_n_param(bset);
1054 dim = isl_basic_set_n_dim(bset);
1055 isl_assert(bset->ctx, n <= dim, goto error);
1060 bset = isl_basic_set_cow(bset);
1064 blk = isl_blk_alloc(bset->ctx, dim);
1065 if (isl_blk_is_error(blk))
1068 for (i = 0; i < bset->n_eq; ++i)
1070 bset->eq[i]+1+nparam, n, dim - n);
1072 for (i = 0; i < bset->n_ineq; ++i)
1074 bset->ineq[i]+1+nparam, n, dim - n);
1076 for (i = 0; i < bset->n_div; ++i)
1078 bset->div[i]+1+1+nparam, n, dim - n);
1080 isl_blk_free(bset->ctx, blk);
1082 ISL_F_CLR(bset, ISL_BASIC_SET_NORMALIZED);
1083 return isl_basic_set_gauss(bset, NULL);
1085 isl_basic_set_free(bset);
1089 struct isl_set *isl_set_swap_vars(struct isl_set *set, unsigned n)
1092 set = isl_set_cow(set);
1096 for (i = 0; i < set->n; ++i) {
1097 set->p[i] = isl_basic_set_swap_vars(set->p[i], n);
1103 ISL_F_CLR(set, ISL_SET_NORMALIZED);
1107 struct isl_basic_map *isl_basic_map_set_to_empty(struct isl_basic_map *bmap)
1113 total = isl_basic_map_total_dim(bmap);
1114 isl_basic_map_free_div(bmap, bmap->n_div);
1115 isl_basic_map_free_inequality(bmap, bmap->n_ineq);
1117 isl_basic_map_free_equality(bmap, bmap->n_eq-1);
1119 isl_basic_map_alloc_equality(bmap);
1123 isl_int_set_si(bmap->eq[i][0], 1);
1124 isl_seq_clr(bmap->eq[i]+1, total);
1125 ISL_F_SET(bmap, ISL_BASIC_MAP_EMPTY);
1126 return isl_basic_map_finalize(bmap);
1128 isl_basic_map_free(bmap);
1132 struct isl_basic_set *isl_basic_set_set_to_empty(struct isl_basic_set *bset)
1134 return (struct isl_basic_set *)
1135 isl_basic_map_set_to_empty((struct isl_basic_map *)bset);
1138 void isl_basic_map_swap_div(struct isl_basic_map *bmap, int a, int b)
1141 unsigned off = isl_dim_total(bmap->dim);
1142 isl_int *t = bmap->div[a];
1143 bmap->div[a] = bmap->div[b];
1146 for (i = 0; i < bmap->n_eq; ++i)
1147 isl_int_swap(bmap->eq[i][1+off+a], bmap->eq[i][1+off+b]);
1149 for (i = 0; i < bmap->n_ineq; ++i)
1150 isl_int_swap(bmap->ineq[i][1+off+a], bmap->ineq[i][1+off+b]);
1152 for (i = 0; i < bmap->n_div; ++i)
1153 isl_int_swap(bmap->div[i][1+1+off+a], bmap->div[i][1+1+off+b]);
1154 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1157 /* Eliminate the specified n dimensions starting at first from the
1158 * constraints using Fourier-Motzkin, The dimensions themselves
1161 struct isl_set *isl_set_eliminate_dims(struct isl_set *set,
1162 unsigned first, unsigned n)
1172 set = isl_set_cow(set);
1175 isl_assert(set->ctx, first+n <= isl_set_n_dim(set), goto error);
1176 nparam = isl_set_n_param(set);
1178 for (i = 0; i < set->n; ++i) {
1179 set->p[i] = isl_basic_set_eliminate_vars(set->p[i],
1190 /* Project out n dimensions starting at first using Fourier-Motzkin */
1191 struct isl_set *isl_set_remove_dims(struct isl_set *set,
1192 unsigned first, unsigned n)
1194 set = isl_set_eliminate_dims(set, first, n);
1195 set = isl_set_drop_dims(set, first, n);
1199 struct isl_basic_set *isl_basic_set_remove_divs(struct isl_basic_set *bset)
1201 bset = isl_basic_set_eliminate_vars(bset, isl_dim_total(bset->dim),
1209 struct isl_set *isl_set_remove_divs(struct isl_set *set)
1218 set = isl_set_cow(set);
1222 for (i = 0; i < set->n; ++i) {
1223 set->p[i] = isl_basic_set_remove_divs(set->p[i]);
1233 struct isl_basic_map *isl_basic_map_remove(struct isl_basic_map *bmap,
1234 enum isl_dim_type type, unsigned first, unsigned n)
1238 isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
1242 bmap = isl_basic_map_eliminate_vars(bmap,
1243 isl_basic_map_offset(bmap, type) - 1 + first, n);
1246 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY) && type == isl_dim_div)
1248 bmap = isl_basic_map_drop(bmap, type, first, n);
1251 isl_basic_map_free(bmap);
1255 __isl_give isl_basic_set *isl_basic_set_remove(__isl_take isl_basic_set *bset,
1256 enum isl_dim_type type, unsigned first, unsigned n)
1258 return (isl_basic_set *)
1259 isl_basic_map_remove((isl_basic_map *)bset, type, first, n);
1262 struct isl_map *isl_map_remove(struct isl_map *map,
1263 enum isl_dim_type type, unsigned first, unsigned n)
1270 map = isl_map_cow(map);
1273 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
1275 for (i = 0; i < map->n; ++i) {
1276 map->p[i] = isl_basic_map_eliminate_vars(map->p[i],
1277 isl_basic_map_offset(map->p[i], type) - 1 + first, n);
1281 map = isl_map_drop(map, type, first, n);
1288 __isl_give isl_set *isl_set_remove(__isl_take isl_set *bset,
1289 enum isl_dim_type type, unsigned first, unsigned n)
1291 return (isl_set *)isl_map_remove((isl_map *)bset, type, first, n);
1294 /* Project out n inputs starting at first using Fourier-Motzkin */
1295 struct isl_map *isl_map_remove_inputs(struct isl_map *map,
1296 unsigned first, unsigned n)
1298 return isl_map_remove(map, isl_dim_in, first, n);
1301 /* Project out n dimensions starting at first using Fourier-Motzkin */
1302 struct isl_basic_set *isl_basic_set_remove_dims(struct isl_basic_set *bset,
1303 unsigned first, unsigned n)
1305 unsigned nparam = isl_basic_set_n_param(bset);
1306 bset = isl_basic_set_eliminate_vars(bset, nparam + first, n);
1307 bset = isl_basic_set_drop_dims(bset, first, n);
1311 static void dump_term(struct isl_basic_map *bmap,
1312 isl_int c, int pos, FILE *out)
1315 unsigned in = isl_basic_map_n_in(bmap);
1316 unsigned dim = in + isl_basic_map_n_out(bmap);
1317 unsigned nparam = isl_basic_map_n_param(bmap);
1319 isl_int_print(out, c, 0);
1321 if (!isl_int_is_one(c))
1322 isl_int_print(out, c, 0);
1323 if (pos < 1 + nparam) {
1324 name = isl_dim_get_name(bmap->dim,
1325 isl_dim_param, pos - 1);
1327 fprintf(out, "%s", name);
1329 fprintf(out, "p%d", pos - 1);
1330 } else if (pos < 1 + nparam + in)
1331 fprintf(out, "i%d", pos - 1 - nparam);
1332 else if (pos < 1 + nparam + dim)
1333 fprintf(out, "o%d", pos - 1 - nparam - in);
1335 fprintf(out, "e%d", pos - 1 - nparam - dim);
1339 static void dump_constraint_sign(struct isl_basic_map *bmap, isl_int *c,
1340 int sign, FILE *out)
1344 unsigned len = 1 + isl_basic_map_total_dim(bmap);
1348 for (i = 0, first = 1; i < len; ++i) {
1349 if (isl_int_sgn(c[i]) * sign <= 0)
1352 fprintf(out, " + ");
1354 isl_int_abs(v, c[i]);
1355 dump_term(bmap, v, i, out);
1362 static void dump_constraint(struct isl_basic_map *bmap, isl_int *c,
1363 const char *op, FILE *out, int indent)
1367 fprintf(out, "%*s", indent, "");
1369 dump_constraint_sign(bmap, c, 1, out);
1370 fprintf(out, " %s ", op);
1371 dump_constraint_sign(bmap, c, -1, out);
1375 for (i = bmap->n_div; i < bmap->extra; ++i) {
1376 if (isl_int_is_zero(c[1+isl_dim_total(bmap->dim)+i]))
1378 fprintf(out, "%*s", indent, "");
1379 fprintf(out, "ERROR: unused div coefficient not zero\n");
1384 static void dump_constraints(struct isl_basic_map *bmap,
1385 isl_int **c, unsigned n,
1386 const char *op, FILE *out, int indent)
1390 for (i = 0; i < n; ++i)
1391 dump_constraint(bmap, c[i], op, out, indent);
1394 static void dump_affine(struct isl_basic_map *bmap, isl_int *exp, FILE *out)
1398 unsigned total = isl_basic_map_total_dim(bmap);
1400 for (j = 0; j < 1 + total; ++j) {
1401 if (isl_int_is_zero(exp[j]))
1403 if (!first && isl_int_is_pos(exp[j]))
1405 dump_term(bmap, exp[j], j, out);
1410 static void dump(struct isl_basic_map *bmap, FILE *out, int indent)
1414 dump_constraints(bmap, bmap->eq, bmap->n_eq, "=", out, indent);
1415 dump_constraints(bmap, bmap->ineq, bmap->n_ineq, ">=", out, indent);
1417 for (i = 0; i < bmap->n_div; ++i) {
1418 fprintf(out, "%*s", indent, "");
1419 fprintf(out, "e%d = [(", i);
1420 dump_affine(bmap, bmap->div[i]+1, out);
1422 isl_int_print(out, bmap->div[i][0], 0);
1423 fprintf(out, "]\n");
1427 void isl_basic_set_dump(struct isl_basic_set *bset, FILE *out, int indent)
1430 fprintf(out, "null basic set\n");
1434 fprintf(out, "%*s", indent, "");
1435 fprintf(out, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n",
1436 bset->ref, bset->dim->nparam, bset->dim->n_out,
1437 bset->extra, bset->flags);
1438 dump((struct isl_basic_map *)bset, out, indent);
1441 void isl_basic_map_dump(struct isl_basic_map *bmap, FILE *out, int indent)
1444 fprintf(out, "null basic map\n");
1448 fprintf(out, "%*s", indent, "");
1449 fprintf(out, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, "
1450 "flags: %x, n_name: %d\n",
1452 bmap->dim->nparam, bmap->dim->n_in, bmap->dim->n_out,
1453 bmap->extra, bmap->flags, bmap->dim->n_name);
1454 dump(bmap, out, indent);
1457 int isl_inequality_negate(struct isl_basic_map *bmap, unsigned pos)
1462 total = isl_basic_map_total_dim(bmap);
1463 isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
1464 isl_seq_neg(bmap->ineq[pos], bmap->ineq[pos], 1 + total);
1465 isl_int_sub_ui(bmap->ineq[pos][0], bmap->ineq[pos][0], 1);
1466 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1470 struct isl_set *isl_set_alloc_dim(struct isl_dim *dim, int n, unsigned flags)
1472 struct isl_set *set;
1476 isl_assert(dim->ctx, dim->n_in == 0, return NULL);
1477 isl_assert(dim->ctx, n >= 0, return NULL);
1478 set = isl_alloc(dim->ctx, struct isl_set,
1479 sizeof(struct isl_set) +
1480 (n - 1) * sizeof(struct isl_basic_set *));
1484 set->ctx = dim->ctx;
1485 isl_ctx_ref(set->ctx);
1497 struct isl_set *isl_set_alloc(struct isl_ctx *ctx,
1498 unsigned nparam, unsigned dim, int n, unsigned flags)
1500 struct isl_set *set;
1501 struct isl_dim *dims;
1503 dims = isl_dim_alloc(ctx, nparam, 0, dim);
1507 set = isl_set_alloc_dim(dims, n, flags);
1511 /* Make sure "map" has room for at least "n" more basic maps.
1513 struct isl_map *isl_map_grow(struct isl_map *map, int n)
1516 struct isl_map *grown = NULL;
1520 isl_assert(map->ctx, n >= 0, goto error);
1521 if (map->n + n <= map->size)
1523 grown = isl_map_alloc_dim(isl_map_get_dim(map), map->n + n, map->flags);
1526 for (i = 0; i < map->n; ++i) {
1527 grown->p[i] = isl_basic_map_copy(map->p[i]);
1535 isl_map_free(grown);
1540 /* Make sure "set" has room for at least "n" more basic sets.
1542 struct isl_set *isl_set_grow(struct isl_set *set, int n)
1544 return (struct isl_set *)isl_map_grow((struct isl_map *)set, n);
1547 struct isl_set *isl_set_dup(struct isl_set *set)
1550 struct isl_set *dup;
1555 dup = isl_set_alloc_dim(isl_dim_copy(set->dim), set->n, set->flags);
1558 for (i = 0; i < set->n; ++i)
1559 dup = isl_set_add(dup, isl_basic_set_copy(set->p[i]));
1563 struct isl_set *isl_set_from_basic_set(struct isl_basic_set *bset)
1565 struct isl_set *set;
1570 set = isl_set_alloc_dim(isl_dim_copy(bset->dim), 1, ISL_MAP_DISJOINT);
1572 isl_basic_set_free(bset);
1575 return isl_set_add(set, bset);
1578 struct isl_map *isl_map_from_basic_map(struct isl_basic_map *bmap)
1580 struct isl_map *map;
1585 map = isl_map_alloc_dim(isl_dim_copy(bmap->dim), 1, ISL_MAP_DISJOINT);
1587 isl_basic_map_free(bmap);
1590 return isl_map_add(map, bmap);
1593 struct isl_set *isl_set_add(struct isl_set *set, struct isl_basic_set *bset)
1595 return (struct isl_set *)isl_map_add((struct isl_map *)set,
1596 (struct isl_basic_map *)bset);
1599 void isl_set_free(struct isl_set *set)
1609 isl_ctx_deref(set->ctx);
1610 for (i = 0; i < set->n; ++i)
1611 isl_basic_set_free(set->p[i]);
1612 isl_dim_free(set->dim);
1616 void isl_set_dump(struct isl_set *set, FILE *out, int indent)
1621 fprintf(out, "null set\n");
1625 fprintf(out, "%*s", indent, "");
1626 fprintf(out, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
1627 set->ref, set->n, set->dim->nparam, set->dim->n_out,
1629 for (i = 0; i < set->n; ++i) {
1630 fprintf(out, "%*s", indent, "");
1631 fprintf(out, "basic set %d:\n", i);
1632 isl_basic_set_dump(set->p[i], out, indent+4);
1636 void isl_map_dump(struct isl_map *map, FILE *out, int indent)
1641 fprintf(out, "null map\n");
1645 fprintf(out, "%*s", indent, "");
1646 fprintf(out, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, "
1647 "flags: %x, n_name: %d\n",
1648 map->ref, map->n, map->dim->nparam, map->dim->n_in,
1649 map->dim->n_out, map->flags, map->dim->n_name);
1650 for (i = 0; i < map->n; ++i) {
1651 fprintf(out, "%*s", indent, "");
1652 fprintf(out, "basic map %d:\n", i);
1653 isl_basic_map_dump(map->p[i], out, indent+4);
1657 struct isl_basic_map *isl_basic_map_intersect_domain(
1658 struct isl_basic_map *bmap, struct isl_basic_set *bset)
1660 struct isl_basic_map *bmap_domain;
1661 struct isl_dim *dim;
1666 isl_assert(bset->ctx, isl_dim_match(bmap->dim, isl_dim_param,
1667 bset->dim, isl_dim_param), goto error);
1669 if (isl_dim_size(bset->dim, isl_dim_set) != 0)
1670 isl_assert(bset->ctx,
1671 isl_basic_map_compatible_domain(bmap, bset), goto error);
1673 bmap = isl_basic_map_cow(bmap);
1674 bmap = isl_basic_map_extend_dim(bmap, isl_dim_copy(bmap->dim),
1675 bset->n_div, bset->n_eq, bset->n_ineq);
1678 dim = isl_dim_reverse(isl_dim_copy(bset->dim));
1679 bmap_domain = isl_basic_map_from_basic_set(bset, dim);
1680 bmap = add_constraints(bmap, bmap_domain, 0, 0);
1682 bmap = isl_basic_map_simplify(bmap);
1683 return isl_basic_map_finalize(bmap);
1685 isl_basic_map_free(bmap);
1686 isl_basic_set_free(bset);
1690 struct isl_basic_map *isl_basic_map_intersect_range(
1691 struct isl_basic_map *bmap, struct isl_basic_set *bset)
1693 struct isl_basic_map *bmap_range;
1698 isl_assert(bset->ctx, isl_dim_match(bmap->dim, isl_dim_param,
1699 bset->dim, isl_dim_param), goto error);
1701 if (isl_dim_size(bset->dim, isl_dim_set) != 0)
1702 isl_assert(bset->ctx,
1703 isl_basic_map_compatible_range(bmap, bset), goto error);
1705 bmap = isl_basic_map_cow(bmap);
1706 bmap = isl_basic_map_extend_dim(bmap, isl_dim_copy(bmap->dim),
1707 bset->n_div, bset->n_eq, bset->n_ineq);
1710 bmap_range = isl_basic_map_from_basic_set(bset, isl_dim_copy(bset->dim));
1711 bmap = add_constraints(bmap, bmap_range, 0, 0);
1713 bmap = isl_basic_map_simplify(bmap);
1714 return isl_basic_map_finalize(bmap);
1716 isl_basic_map_free(bmap);
1717 isl_basic_set_free(bset);
1721 int isl_basic_map_contains(struct isl_basic_map *bmap, struct isl_vec *vec)
1727 total = 1 + isl_basic_map_total_dim(bmap);
1728 if (total != vec->size)
1733 for (i = 0; i < bmap->n_eq; ++i) {
1734 isl_seq_inner_product(vec->el, bmap->eq[i], total, &s);
1735 if (!isl_int_is_zero(s)) {
1741 for (i = 0; i < bmap->n_ineq; ++i) {
1742 isl_seq_inner_product(vec->el, bmap->ineq[i], total, &s);
1743 if (isl_int_is_neg(s)) {
1754 int isl_basic_set_contains(struct isl_basic_set *bset, struct isl_vec *vec)
1756 return isl_basic_map_contains((struct isl_basic_map *)bset, vec);
1759 struct isl_basic_map *isl_basic_map_intersect(
1760 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
1762 struct isl_vec *sample = NULL;
1764 if (!bmap1 || !bmap2)
1767 isl_assert(bmap1->ctx, isl_dim_match(bmap1->dim, isl_dim_param,
1768 bmap2->dim, isl_dim_param), goto error);
1769 if (isl_dim_total(bmap1->dim) ==
1770 isl_dim_size(bmap1->dim, isl_dim_param) &&
1771 isl_dim_total(bmap2->dim) !=
1772 isl_dim_size(bmap2->dim, isl_dim_param))
1773 return isl_basic_map_intersect(bmap2, bmap1);
1775 if (isl_dim_total(bmap2->dim) !=
1776 isl_dim_size(bmap2->dim, isl_dim_param))
1777 isl_assert(bmap1->ctx,
1778 isl_dim_equal(bmap1->dim, bmap2->dim), goto error);
1780 if (bmap1->sample &&
1781 isl_basic_map_contains(bmap1, bmap1->sample) > 0 &&
1782 isl_basic_map_contains(bmap2, bmap1->sample) > 0)
1783 sample = isl_vec_copy(bmap1->sample);
1784 else if (bmap2->sample &&
1785 isl_basic_map_contains(bmap1, bmap2->sample) > 0 &&
1786 isl_basic_map_contains(bmap2, bmap2->sample) > 0)
1787 sample = isl_vec_copy(bmap2->sample);
1789 bmap1 = isl_basic_map_cow(bmap1);
1790 bmap1 = isl_basic_map_extend_dim(bmap1, isl_dim_copy(bmap1->dim),
1791 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
1794 bmap1 = add_constraints(bmap1, bmap2, 0, 0);
1797 isl_vec_free(bmap1->sample);
1798 bmap1->sample = sample;
1801 bmap1 = isl_basic_map_simplify(bmap1);
1802 return isl_basic_map_finalize(bmap1);
1805 isl_vec_free(sample);
1806 isl_basic_map_free(bmap1);
1807 isl_basic_map_free(bmap2);
1811 struct isl_basic_set *isl_basic_set_intersect(
1812 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
1814 return (struct isl_basic_set *)
1815 isl_basic_map_intersect(
1816 (struct isl_basic_map *)bset1,
1817 (struct isl_basic_map *)bset2);
1820 /* Special case of isl_map_intersect, where both map1 and map2
1821 * are convex, without any divs and such that either map1 or map2
1822 * contains a single constraint. This constraint is then simply
1823 * added to the other map.
1825 static __isl_give isl_map *map_intersect_add_constraint(
1826 __isl_take isl_map *map1, __isl_take isl_map *map2)
1828 struct isl_basic_map *bmap1;
1829 struct isl_basic_map *bmap2;
1831 isl_assert(map1->ctx, map1->n == 1, goto error);
1832 isl_assert(map2->ctx, map1->n == 1, goto error);
1833 isl_assert(map1->ctx, map1->p[0]->n_div == 0, goto error);
1834 isl_assert(map2->ctx, map1->p[0]->n_div == 0, goto error);
1836 if (map2->p[0]->n_eq + map2->p[0]->n_ineq != 1)
1837 return isl_map_intersect(map2, map1);
1839 isl_assert(map2->ctx,
1840 map2->p[0]->n_eq + map2->p[0]->n_ineq == 1, goto error);
1842 map1 = isl_map_cow(map1);
1845 map1->p[0] = isl_basic_map_cow(map1->p[0]);
1846 if (map2->p[0]->n_eq == 1)
1847 map1->p[0] = isl_basic_map_add_eq(map1->p[0], map2->p[0]->eq[0]);
1849 map1->p[0] = isl_basic_map_add_ineq(map1->p[0],
1850 map2->p[0]->ineq[0]);
1852 map1->p[0] = isl_basic_map_simplify(map1->p[0]);
1853 map1->p[0] = isl_basic_map_finalize(map1->p[0]);
1866 struct isl_map *isl_map_intersect(struct isl_map *map1, struct isl_map *map2)
1869 struct isl_map *result;
1875 if (map1->n == 1 && map2->n == 1 &&
1876 map1->p[0]->n_div == 0 && map2->p[0]->n_div == 0 &&
1877 isl_dim_equal(map1->dim, map2->dim) &&
1878 (map1->p[0]->n_eq + map1->p[0]->n_ineq == 1 ||
1879 map2->p[0]->n_eq + map2->p[0]->n_ineq == 1))
1880 return map_intersect_add_constraint(map1, map2);
1881 isl_assert(map1->ctx, isl_dim_match(map1->dim, isl_dim_param,
1882 map2->dim, isl_dim_param), goto error);
1883 if (isl_dim_total(map1->dim) ==
1884 isl_dim_size(map1->dim, isl_dim_param) &&
1885 isl_dim_total(map2->dim) != isl_dim_size(map2->dim, isl_dim_param))
1886 return isl_map_intersect(map2, map1);
1888 if (isl_dim_total(map2->dim) != isl_dim_size(map2->dim, isl_dim_param))
1889 isl_assert(map1->ctx,
1890 isl_dim_equal(map1->dim, map2->dim), goto error);
1892 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
1893 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
1894 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
1896 result = isl_map_alloc_dim(isl_dim_copy(map1->dim),
1897 map1->n * map2->n, flags);
1900 for (i = 0; i < map1->n; ++i)
1901 for (j = 0; j < map2->n; ++j) {
1902 struct isl_basic_map *part;
1903 part = isl_basic_map_intersect(
1904 isl_basic_map_copy(map1->p[i]),
1905 isl_basic_map_copy(map2->p[j]));
1906 if (isl_basic_map_is_empty(part))
1907 isl_basic_map_free(part);
1909 result = isl_map_add(result, part);
1922 struct isl_set *isl_set_intersect(struct isl_set *set1, struct isl_set *set2)
1924 return (struct isl_set *)
1925 isl_map_intersect((struct isl_map *)set1,
1926 (struct isl_map *)set2);
1929 struct isl_basic_map *isl_basic_map_reverse(struct isl_basic_map *bmap)
1931 struct isl_dim *dim;
1932 struct isl_basic_set *bset;
1937 bmap = isl_basic_map_cow(bmap);
1940 dim = isl_dim_reverse(isl_dim_copy(bmap->dim));
1941 in = isl_basic_map_n_in(bmap);
1942 bset = isl_basic_set_from_basic_map(bmap);
1943 bset = isl_basic_set_swap_vars(bset, in);
1944 return isl_basic_map_from_basic_set(bset, dim);
1947 /* Turn final n dimensions into existentially quantified variables.
1949 struct isl_basic_set *isl_basic_set_project_out(struct isl_basic_set *bset,
1950 enum isl_dim_type type, unsigned first, unsigned n)
1960 isl_assert(bset->ctx, type == isl_dim_set, goto error);
1961 isl_assert(bset->ctx, first + n == isl_basic_set_n_dim(bset), goto error);
1966 if (ISL_F_ISSET(bset, ISL_BASIC_SET_RATIONAL))
1967 return isl_basic_set_remove(bset, type, first, n);
1969 bset = isl_basic_set_cow(bset);
1971 row_size = 1 + isl_dim_total(bset->dim) + bset->extra;
1972 old = bset->block2.data;
1973 bset->block2 = isl_blk_extend(bset->ctx, bset->block2,
1974 (bset->extra + n) * (1 + row_size));
1975 if (!bset->block2.data)
1977 new_div = isl_alloc_array(ctx, isl_int *, bset->extra + n);
1980 for (i = 0; i < n; ++i) {
1981 new_div[i] = bset->block2.data +
1982 (bset->extra + i) * (1 + row_size);
1983 isl_seq_clr(new_div[i], 1 + row_size);
1985 for (i = 0; i < bset->extra; ++i)
1986 new_div[n + i] = bset->block2.data + (bset->div[i] - old);
1988 bset->div = new_div;
1991 bset->dim = isl_dim_drop_outputs(bset->dim,
1992 isl_basic_set_n_dim(bset) - n, n);
1995 bset = isl_basic_set_simplify(bset);
1996 bset = isl_basic_set_drop_redundant_divs(bset);
1997 return isl_basic_set_finalize(bset);
1999 isl_basic_set_free(bset);
2003 /* Turn final n dimensions into existentially quantified variables.
2005 __isl_give isl_set *isl_set_project_out(__isl_take isl_set *set,
2006 enum isl_dim_type type, unsigned first, unsigned n)
2013 isl_assert(set->ctx, type == isl_dim_set, goto error);
2014 isl_assert(set->ctx, first + n == isl_set_n_dim(set), goto error);
2019 set = isl_set_cow(set);
2022 set->dim = isl_dim_drop_outputs(set->dim, first, n);
2023 for (i = 0; i < set->n; ++i) {
2024 set->p[i] = isl_basic_set_project_out(set->p[i], type, first, n);
2029 ISL_F_CLR(set, ISL_SET_NORMALIZED);
2036 static struct isl_basic_map *add_divs(struct isl_basic_map *bmap, unsigned n)
2040 for (i = 0; i < n; ++i) {
2041 j = isl_basic_map_alloc_div(bmap);
2044 isl_seq_clr(bmap->div[j], 1+1+isl_basic_map_total_dim(bmap));
2048 isl_basic_map_free(bmap);
2052 struct isl_basic_map *isl_basic_map_apply_range(
2053 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2055 struct isl_dim *dim_result = NULL;
2056 struct isl_basic_map *bmap;
2057 unsigned n_in, n_out, n, nparam, total, pos;
2058 struct isl_dim_map *dim_map1, *dim_map2;
2060 if (!bmap1 || !bmap2)
2063 dim_result = isl_dim_join(isl_dim_copy(bmap1->dim),
2064 isl_dim_copy(bmap2->dim));
2066 n_in = isl_basic_map_n_in(bmap1);
2067 n_out = isl_basic_map_n_out(bmap2);
2068 n = isl_basic_map_n_out(bmap1);
2069 nparam = isl_basic_map_n_param(bmap1);
2071 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + n;
2072 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
2073 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
2074 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
2075 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
2076 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
2077 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_in);
2078 isl_dim_map_div(dim_map1, bmap1, pos += n_out);
2079 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
2080 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
2081 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
2083 bmap = isl_basic_map_alloc_dim(dim_result,
2084 bmap1->n_div + bmap2->n_div + n,
2085 bmap1->n_eq + bmap2->n_eq,
2086 bmap1->n_ineq + bmap2->n_ineq);
2087 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
2088 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
2089 bmap = add_divs(bmap, n);
2090 bmap = isl_basic_map_simplify(bmap);
2091 bmap = isl_basic_map_drop_redundant_divs(bmap);
2092 return isl_basic_map_finalize(bmap);
2094 isl_basic_map_free(bmap1);
2095 isl_basic_map_free(bmap2);
2099 struct isl_basic_set *isl_basic_set_apply(
2100 struct isl_basic_set *bset, struct isl_basic_map *bmap)
2105 isl_assert(bset->ctx, isl_basic_map_compatible_domain(bmap, bset),
2108 return (struct isl_basic_set *)
2109 isl_basic_map_apply_range((struct isl_basic_map *)bset, bmap);
2111 isl_basic_set_free(bset);
2112 isl_basic_map_free(bmap);
2116 struct isl_basic_map *isl_basic_map_apply_domain(
2117 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2119 if (!bmap1 || !bmap2)
2122 isl_assert(bmap1->ctx,
2123 isl_basic_map_n_in(bmap1) == isl_basic_map_n_in(bmap2), goto error);
2124 isl_assert(bmap1->ctx,
2125 isl_basic_map_n_param(bmap1) == isl_basic_map_n_param(bmap2),
2128 bmap1 = isl_basic_map_reverse(bmap1);
2129 bmap1 = isl_basic_map_apply_range(bmap1, bmap2);
2130 return isl_basic_map_reverse(bmap1);
2132 isl_basic_map_free(bmap1);
2133 isl_basic_map_free(bmap2);
2137 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
2138 * A \cap B -> f(A) + f(B)
2140 struct isl_basic_map *isl_basic_map_sum(
2141 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2143 unsigned n_in, n_out, nparam, total, pos;
2144 struct isl_basic_map *bmap = NULL;
2145 struct isl_dim_map *dim_map1, *dim_map2;
2148 if (!bmap1 || !bmap2)
2151 isl_assert(bmap1->ctx, isl_dim_equal(bmap1->dim, bmap2->dim),
2154 nparam = isl_basic_map_n_param(bmap1);
2155 n_in = isl_basic_map_n_in(bmap1);
2156 n_out = isl_basic_map_n_out(bmap1);
2158 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + 2 * n_out;
2159 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
2160 dim_map2 = isl_dim_map_alloc(bmap2->ctx, total);
2161 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
2162 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos);
2163 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
2164 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
2165 isl_dim_map_div(dim_map1, bmap1, pos += n_in + n_out);
2166 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
2167 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
2168 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_out);
2170 bmap = isl_basic_map_alloc_dim(isl_dim_copy(bmap1->dim),
2171 bmap1->n_div + bmap2->n_div + 2 * n_out,
2172 bmap1->n_eq + bmap2->n_eq + n_out,
2173 bmap1->n_ineq + bmap2->n_ineq);
2174 for (i = 0; i < n_out; ++i) {
2175 int j = isl_basic_map_alloc_equality(bmap);
2178 isl_seq_clr(bmap->eq[j], 1+total);
2179 isl_int_set_si(bmap->eq[j][1+nparam+n_in+i], -1);
2180 isl_int_set_si(bmap->eq[j][1+pos+i], 1);
2181 isl_int_set_si(bmap->eq[j][1+pos-n_out+i], 1);
2183 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
2184 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
2185 bmap = add_divs(bmap, 2 * n_out);
2187 bmap = isl_basic_map_simplify(bmap);
2188 return isl_basic_map_finalize(bmap);
2190 isl_basic_map_free(bmap);
2191 isl_basic_map_free(bmap1);
2192 isl_basic_map_free(bmap2);
2196 /* Given two maps A -> f(A) and B -> g(B), construct a map
2197 * A \cap B -> f(A) + f(B)
2199 struct isl_map *isl_map_sum(struct isl_map *map1, struct isl_map *map2)
2201 struct isl_map *result;
2207 isl_assert(map1->ctx, isl_dim_equal(map1->dim, map2->dim), goto error);
2209 result = isl_map_alloc_dim(isl_dim_copy(map1->dim),
2210 map1->n * map2->n, 0);
2213 for (i = 0; i < map1->n; ++i)
2214 for (j = 0; j < map2->n; ++j) {
2215 struct isl_basic_map *part;
2216 part = isl_basic_map_sum(
2217 isl_basic_map_copy(map1->p[i]),
2218 isl_basic_map_copy(map2->p[j]));
2219 if (isl_basic_map_is_empty(part))
2220 isl_basic_map_free(part);
2222 result = isl_map_add(result, part);
2235 /* Given a basic map A -> f(A), construct A -> -f(A).
2237 struct isl_basic_map *isl_basic_map_neg(struct isl_basic_map *bmap)
2242 bmap = isl_basic_map_cow(bmap);
2246 n = isl_basic_map_dim(bmap, isl_dim_out);
2247 off = isl_basic_map_offset(bmap, isl_dim_out);
2248 for (i = 0; i < bmap->n_eq; ++i)
2249 for (j = 0; j < n; ++j)
2250 isl_int_neg(bmap->eq[i][off+j], bmap->eq[i][off+j]);
2251 for (i = 0; i < bmap->n_ineq; ++i)
2252 for (j = 0; j < n; ++j)
2253 isl_int_neg(bmap->ineq[i][off+j], bmap->ineq[i][off+j]);
2254 for (i = 0; i < bmap->n_div; ++i)
2255 for (j = 0; j < n; ++j)
2256 isl_int_neg(bmap->div[i][1+off+j], bmap->div[i][1+off+j]);
2257 return isl_basic_map_finalize(bmap);
2260 /* Given a map A -> f(A), construct A -> -f(A).
2262 struct isl_map *isl_map_neg(struct isl_map *map)
2266 map = isl_map_cow(map);
2270 for (i = 0; i < map->n; ++i) {
2271 map->p[i] = isl_basic_map_neg(map->p[i]);
2282 /* Given a basic map A -> f(A) and an integer d, construct a basic map
2283 * A -> floor(f(A)/d).
2285 struct isl_basic_map *isl_basic_map_floordiv(struct isl_basic_map *bmap,
2288 unsigned n_in, n_out, nparam, total, pos;
2289 struct isl_basic_map *result = NULL;
2290 struct isl_dim_map *dim_map;
2296 nparam = isl_basic_map_n_param(bmap);
2297 n_in = isl_basic_map_n_in(bmap);
2298 n_out = isl_basic_map_n_out(bmap);
2300 total = nparam + n_in + n_out + bmap->n_div + n_out;
2301 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2302 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_param, pos = 0);
2303 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_in, pos += nparam);
2304 isl_dim_map_div(dim_map, bmap, pos += n_in + n_out);
2305 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_out, pos += bmap->n_div);
2307 result = isl_basic_map_alloc_dim(isl_dim_copy(bmap->dim),
2308 bmap->n_div + n_out,
2309 bmap->n_eq, bmap->n_ineq + 2 * n_out);
2310 result = add_constraints_dim_map(result, bmap, dim_map);
2311 result = add_divs(result, n_out);
2312 for (i = 0; i < n_out; ++i) {
2314 j = isl_basic_map_alloc_inequality(result);
2317 isl_seq_clr(result->ineq[j], 1+total);
2318 isl_int_neg(result->ineq[j][1+nparam+n_in+i], d);
2319 isl_int_set_si(result->ineq[j][1+pos+i], 1);
2320 j = isl_basic_map_alloc_inequality(result);
2323 isl_seq_clr(result->ineq[j], 1+total);
2324 isl_int_set(result->ineq[j][1+nparam+n_in+i], d);
2325 isl_int_set_si(result->ineq[j][1+pos+i], -1);
2326 isl_int_sub_ui(result->ineq[j][0], d, 1);
2329 result = isl_basic_map_simplify(result);
2330 return isl_basic_map_finalize(result);
2332 isl_basic_map_free(result);
2336 /* Given a map A -> f(A) and an integer d, construct a map
2337 * A -> floor(f(A)/d).
2339 struct isl_map *isl_map_floordiv(struct isl_map *map, isl_int d)
2343 map = isl_map_cow(map);
2347 ISL_F_CLR(map, ISL_MAP_DISJOINT);
2348 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
2349 for (i = 0; i < map->n; ++i) {
2350 map->p[i] = isl_basic_map_floordiv(map->p[i], d);
2361 static struct isl_basic_map *var_equal(struct isl_basic_map *bmap, unsigned pos)
2367 i = isl_basic_map_alloc_equality(bmap);
2370 nparam = isl_basic_map_n_param(bmap);
2371 n_in = isl_basic_map_n_in(bmap);
2372 isl_seq_clr(bmap->eq[i], 1 + isl_basic_map_total_dim(bmap));
2373 isl_int_set_si(bmap->eq[i][1+nparam+pos], -1);
2374 isl_int_set_si(bmap->eq[i][1+nparam+n_in+pos], 1);
2375 return isl_basic_map_finalize(bmap);
2377 isl_basic_map_free(bmap);
2381 /* Add a constraints to "bmap" expressing i_pos < o_pos
2383 static struct isl_basic_map *var_less(struct isl_basic_map *bmap, unsigned pos)
2389 i = isl_basic_map_alloc_inequality(bmap);
2392 nparam = isl_basic_map_n_param(bmap);
2393 n_in = isl_basic_map_n_in(bmap);
2394 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
2395 isl_int_set_si(bmap->ineq[i][0], -1);
2396 isl_int_set_si(bmap->ineq[i][1+nparam+pos], -1);
2397 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], 1);
2398 return isl_basic_map_finalize(bmap);
2400 isl_basic_map_free(bmap);
2404 /* Add a constraints to "bmap" expressing i_pos > o_pos
2406 static struct isl_basic_map *var_more(struct isl_basic_map *bmap, unsigned pos)
2412 i = isl_basic_map_alloc_inequality(bmap);
2415 nparam = isl_basic_map_n_param(bmap);
2416 n_in = isl_basic_map_n_in(bmap);
2417 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
2418 isl_int_set_si(bmap->ineq[i][0], -1);
2419 isl_int_set_si(bmap->ineq[i][1+nparam+pos], 1);
2420 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], -1);
2421 return isl_basic_map_finalize(bmap);
2423 isl_basic_map_free(bmap);
2427 struct isl_basic_map *isl_basic_map_equal(struct isl_dim *dim, unsigned n_equal)
2430 struct isl_basic_map *bmap;
2431 bmap = isl_basic_map_alloc_dim(dim, 0, n_equal, 0);
2434 for (i = 0; i < n_equal && bmap; ++i)
2435 bmap = var_equal(bmap, i);
2436 return isl_basic_map_finalize(bmap);
2439 /* Return a relation on pairs of sets of dimension "dim" expressing i_pos < o_pos
2441 struct isl_basic_map *isl_basic_map_less_at(struct isl_dim *dim, unsigned pos)
2444 struct isl_basic_map *bmap;
2445 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
2448 for (i = 0; i < pos && bmap; ++i)
2449 bmap = var_equal(bmap, i);
2451 bmap = var_less(bmap, pos);
2452 return isl_basic_map_finalize(bmap);
2455 /* Return a relation on pairs of sets of dimension "dim" expressing i_pos > o_pos
2457 struct isl_basic_map *isl_basic_map_more_at(struct isl_dim *dim, unsigned pos)
2460 struct isl_basic_map *bmap;
2461 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
2464 for (i = 0; i < pos && bmap; ++i)
2465 bmap = var_equal(bmap, i);
2467 bmap = var_more(bmap, pos);
2468 return isl_basic_map_finalize(bmap);
2471 static __isl_give isl_map *map_lex_lte(__isl_take isl_dim *dims, int equal)
2473 struct isl_map *map;
2480 map = isl_map_alloc_dim(isl_dim_copy(dims), dim + equal, ISL_MAP_DISJOINT);
2482 for (i = 0; i < dim; ++i)
2483 map = isl_map_add(map,
2484 isl_basic_map_less_at(isl_dim_copy(dims), i));
2486 map = isl_map_add(map,
2487 isl_basic_map_equal(isl_dim_copy(dims), dim));
2493 __isl_give isl_map *isl_map_lex_lt(__isl_take isl_dim *set_dim)
2495 return map_lex_lte(isl_dim_map(set_dim), 0);
2498 __isl_give isl_map *isl_map_lex_le(__isl_take isl_dim *set_dim)
2500 return map_lex_lte(isl_dim_map(set_dim), 1);
2503 static __isl_give isl_map *map_lex_gte(__isl_take isl_dim *dims, int equal)
2505 struct isl_map *map;
2512 map = isl_map_alloc_dim(isl_dim_copy(dims), dim + equal, ISL_MAP_DISJOINT);
2514 for (i = 0; i < dim; ++i)
2515 map = isl_map_add(map,
2516 isl_basic_map_more_at(isl_dim_copy(dims), i));
2518 map = isl_map_add(map,
2519 isl_basic_map_equal(isl_dim_copy(dims), dim));
2525 __isl_give isl_map *isl_map_lex_gt(__isl_take isl_dim *set_dim)
2527 return map_lex_gte(isl_dim_map(set_dim), 0);
2530 __isl_give isl_map *isl_map_lex_ge(__isl_take isl_dim *set_dim)
2532 return map_lex_gte(isl_dim_map(set_dim), 1);
2535 struct isl_basic_map *isl_basic_map_from_basic_set(
2536 struct isl_basic_set *bset, struct isl_dim *dim)
2538 struct isl_basic_map *bmap;
2540 bset = isl_basic_set_cow(bset);
2544 isl_assert(bset->ctx, isl_dim_compatible(bset->dim, dim), goto error);
2545 isl_dim_free(bset->dim);
2546 bmap = (struct isl_basic_map *) bset;
2548 return isl_basic_map_finalize(bmap);
2550 isl_basic_set_free(bset);
2555 struct isl_basic_set *isl_basic_set_from_basic_map(struct isl_basic_map *bmap)
2559 if (bmap->dim->n_in == 0)
2560 return (struct isl_basic_set *)bmap;
2561 bmap = isl_basic_map_cow(bmap);
2564 bmap->dim = isl_dim_cow(bmap->dim);
2567 bmap->dim->n_out += bmap->dim->n_in;
2568 bmap->dim->n_in = 0;
2569 bmap = isl_basic_map_finalize(bmap);
2570 return (struct isl_basic_set *)bmap;
2572 isl_basic_map_free(bmap);
2576 /* For a div d = floor(f/m), add the constraints
2579 * -(f-(n-1)) + m d >= 0
2581 * Note that the second constraint is the negation of
2585 static int add_div_constraints(struct isl_basic_map *bmap, unsigned div)
2588 unsigned total = isl_basic_map_total_dim(bmap);
2589 unsigned div_pos = 1 + total - bmap->n_div + div;
2591 i = isl_basic_map_alloc_inequality(bmap);
2594 isl_seq_cpy(bmap->ineq[i], bmap->div[div]+1, 1+total);
2595 isl_int_neg(bmap->ineq[i][div_pos], bmap->div[div][0]);
2597 j = isl_basic_map_alloc_inequality(bmap);
2600 isl_seq_neg(bmap->ineq[j], bmap->ineq[i], 1 + total);
2601 isl_int_add(bmap->ineq[j][0], bmap->ineq[j][0], bmap->ineq[j][div_pos]);
2602 isl_int_sub_ui(bmap->ineq[j][0], bmap->ineq[j][0], 1);
2606 struct isl_basic_set *isl_basic_map_underlying_set(
2607 struct isl_basic_map *bmap)
2611 if (bmap->dim->nparam == 0 && bmap->dim->n_in == 0 && bmap->n_div == 0)
2612 return (struct isl_basic_set *)bmap;
2613 bmap = isl_basic_map_cow(bmap);
2616 bmap->dim = isl_dim_underlying(bmap->dim, bmap->n_div);
2619 bmap->extra -= bmap->n_div;
2621 bmap = isl_basic_map_finalize(bmap);
2622 return (struct isl_basic_set *)bmap;
2627 __isl_give isl_basic_set *isl_basic_set_underlying_set(
2628 __isl_take isl_basic_set *bset)
2630 return isl_basic_map_underlying_set((isl_basic_map *)bset);
2633 struct isl_basic_map *isl_basic_map_overlying_set(
2634 struct isl_basic_set *bset, struct isl_basic_map *like)
2636 struct isl_basic_map *bmap;
2637 struct isl_ctx *ctx;
2644 isl_assert(ctx, bset->n_div == 0, goto error);
2645 isl_assert(ctx, isl_basic_set_n_param(bset) == 0, goto error);
2646 isl_assert(ctx, bset->dim->n_out == isl_basic_map_total_dim(like),
2648 if (isl_dim_equal(bset->dim, like->dim) && like->n_div == 0) {
2649 isl_basic_map_free(like);
2650 return (struct isl_basic_map *)bset;
2652 bset = isl_basic_set_cow(bset);
2655 total = bset->dim->n_out + bset->extra;
2656 bmap = (struct isl_basic_map *)bset;
2657 isl_dim_free(bmap->dim);
2658 bmap->dim = isl_dim_copy(like->dim);
2661 bmap->n_div = like->n_div;
2662 bmap->extra += like->n_div;
2665 ltotal = total - bmap->extra + like->extra;
2668 bmap->block2 = isl_blk_extend(ctx, bmap->block2,
2669 bmap->extra * (1 + 1 + total));
2670 if (isl_blk_is_error(bmap->block2))
2672 bmap->div = isl_realloc_array(ctx, bmap->div, isl_int *,
2676 for (i = 0; i < bmap->extra; ++i)
2677 bmap->div[i] = bmap->block2.data + i * (1 + 1 + total);
2678 for (i = 0; i < like->n_div; ++i) {
2679 isl_seq_cpy(bmap->div[i], like->div[i], 1 + 1 + ltotal);
2680 isl_seq_clr(bmap->div[i]+1+1+ltotal, total - ltotal);
2682 bmap = isl_basic_map_extend_constraints(bmap,
2683 0, 2 * like->n_div);
2684 for (i = 0; i < like->n_div; ++i) {
2685 if (isl_int_is_zero(bmap->div[i][0]))
2687 if (add_div_constraints(bmap, i) < 0)
2691 isl_basic_map_free(like);
2692 bmap = isl_basic_map_simplify(bmap);
2693 bmap = isl_basic_map_finalize(bmap);
2696 isl_basic_map_free(like);
2697 isl_basic_set_free(bset);
2701 struct isl_basic_set *isl_basic_set_from_underlying_set(
2702 struct isl_basic_set *bset, struct isl_basic_set *like)
2704 return (struct isl_basic_set *)
2705 isl_basic_map_overlying_set(bset, (struct isl_basic_map *)like);
2708 struct isl_set *isl_set_from_underlying_set(
2709 struct isl_set *set, struct isl_basic_set *like)
2715 isl_assert(set->ctx, set->dim->n_out == isl_basic_set_total_dim(like),
2717 if (isl_dim_equal(set->dim, like->dim) && like->n_div == 0) {
2718 isl_basic_set_free(like);
2721 set = isl_set_cow(set);
2724 for (i = 0; i < set->n; ++i) {
2725 set->p[i] = isl_basic_set_from_underlying_set(set->p[i],
2726 isl_basic_set_copy(like));
2730 isl_dim_free(set->dim);
2731 set->dim = isl_dim_copy(like->dim);
2734 isl_basic_set_free(like);
2737 isl_basic_set_free(like);
2742 struct isl_set *isl_map_underlying_set(struct isl_map *map)
2746 map = isl_map_cow(map);
2749 map->dim = isl_dim_cow(map->dim);
2753 for (i = 1; i < map->n; ++i)
2754 isl_assert(map->ctx, map->p[0]->n_div == map->p[i]->n_div,
2756 for (i = 0; i < map->n; ++i) {
2757 map->p[i] = (struct isl_basic_map *)
2758 isl_basic_map_underlying_set(map->p[i]);
2763 map->dim = isl_dim_underlying(map->dim, 0);
2765 isl_dim_free(map->dim);
2766 map->dim = isl_dim_copy(map->p[0]->dim);
2770 return (struct isl_set *)map;
2776 struct isl_set *isl_set_to_underlying_set(struct isl_set *set)
2778 return (struct isl_set *)isl_map_underlying_set((struct isl_map *)set);
2781 struct isl_basic_set *isl_basic_map_domain(struct isl_basic_map *bmap)
2783 struct isl_basic_set *domain;
2788 n_in = isl_basic_map_n_in(bmap);
2789 n_out = isl_basic_map_n_out(bmap);
2790 domain = isl_basic_set_from_basic_map(bmap);
2791 return isl_basic_set_project_out(domain, isl_dim_set, n_in, n_out);
2794 struct isl_basic_set *isl_basic_map_range(struct isl_basic_map *bmap)
2796 return isl_basic_map_domain(isl_basic_map_reverse(bmap));
2799 struct isl_set *isl_map_range(struct isl_map *map)
2802 struct isl_set *set;
2806 map = isl_map_cow(map);
2810 set = (struct isl_set *) map;
2811 if (set->dim->n_in != 0) {
2812 set->dim = isl_dim_drop_inputs(set->dim, 0, set->dim->n_in);
2816 for (i = 0; i < map->n; ++i) {
2817 set->p[i] = isl_basic_map_range(map->p[i]);
2821 ISL_F_CLR(set, ISL_MAP_DISJOINT);
2822 ISL_F_CLR(set, ISL_SET_NORMALIZED);
2829 struct isl_map *isl_map_from_set(struct isl_set *set, struct isl_dim *dim)
2832 struct isl_map *map = NULL;
2834 set = isl_set_cow(set);
2837 isl_assert(set->ctx, isl_dim_compatible(set->dim, dim), goto error);
2838 map = (struct isl_map *)set;
2839 for (i = 0; i < set->n; ++i) {
2840 map->p[i] = isl_basic_map_from_basic_set(
2841 set->p[i], isl_dim_copy(dim));
2845 isl_dim_free(map->dim);
2854 struct isl_map *isl_map_from_range(struct isl_set *set)
2856 return (struct isl_map *)set;
2859 struct isl_set *isl_set_from_map(struct isl_map *map)
2862 struct isl_set *set = NULL;
2866 map = isl_map_cow(map);
2869 map->dim = isl_dim_cow(map->dim);
2872 map->dim->n_out += map->dim->n_in;
2874 set = (struct isl_set *)map;
2875 for (i = 0; i < map->n; ++i) {
2876 set->p[i] = isl_basic_set_from_basic_map(map->p[i]);
2886 struct isl_map *isl_map_alloc_dim(struct isl_dim *dim, int n, unsigned flags)
2888 struct isl_map *map;
2892 isl_assert(dim->ctx, n >= 0, return NULL);
2893 map = isl_alloc(dim->ctx, struct isl_map,
2894 sizeof(struct isl_map) +
2895 (n - 1) * sizeof(struct isl_basic_map *));
2899 map->ctx = dim->ctx;
2900 isl_ctx_ref(map->ctx);
2912 struct isl_map *isl_map_alloc(struct isl_ctx *ctx,
2913 unsigned nparam, unsigned in, unsigned out, int n,
2916 struct isl_map *map;
2917 struct isl_dim *dims;
2919 dims = isl_dim_alloc(ctx, nparam, in, out);
2923 map = isl_map_alloc_dim(dims, n, flags);
2927 struct isl_basic_map *isl_basic_map_empty(struct isl_dim *dim)
2929 struct isl_basic_map *bmap;
2930 bmap = isl_basic_map_alloc_dim(dim, 0, 1, 0);
2931 bmap = isl_basic_map_set_to_empty(bmap);
2935 struct isl_basic_set *isl_basic_set_empty(struct isl_dim *dim)
2937 struct isl_basic_set *bset;
2938 bset = isl_basic_set_alloc_dim(dim, 0, 1, 0);
2939 bset = isl_basic_set_set_to_empty(bset);
2943 struct isl_basic_map *isl_basic_map_empty_like(struct isl_basic_map *model)
2945 struct isl_basic_map *bmap;
2948 bmap = isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
2949 bmap = isl_basic_map_set_to_empty(bmap);
2953 struct isl_basic_map *isl_basic_map_empty_like_map(struct isl_map *model)
2955 struct isl_basic_map *bmap;
2958 bmap = isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
2959 bmap = isl_basic_map_set_to_empty(bmap);
2963 struct isl_basic_set *isl_basic_set_empty_like(struct isl_basic_set *model)
2965 struct isl_basic_set *bset;
2968 bset = isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
2969 bset = isl_basic_set_set_to_empty(bset);
2973 struct isl_basic_map *isl_basic_map_universe(struct isl_dim *dim)
2975 struct isl_basic_map *bmap;
2976 bmap = isl_basic_map_alloc_dim(dim, 0, 0, 0);
2980 struct isl_basic_set *isl_basic_set_universe(struct isl_dim *dim)
2982 struct isl_basic_set *bset;
2983 bset = isl_basic_set_alloc_dim(dim, 0, 0, 0);
2987 __isl_give isl_basic_map *isl_basic_map_universe_like(
2988 __isl_keep isl_basic_map *model)
2992 return isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
2995 struct isl_basic_set *isl_basic_set_universe_like(struct isl_basic_set *model)
2999 return isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
3002 __isl_give isl_basic_set *isl_basic_set_universe_like_set(
3003 __isl_keep isl_set *model)
3007 return isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
3010 struct isl_map *isl_map_empty(struct isl_dim *dim)
3012 return isl_map_alloc_dim(dim, 0, ISL_MAP_DISJOINT);
3015 struct isl_map *isl_map_empty_like(struct isl_map *model)
3019 return isl_map_alloc_dim(isl_dim_copy(model->dim), 0, ISL_MAP_DISJOINT);
3022 struct isl_map *isl_map_empty_like_basic_map(struct isl_basic_map *model)
3026 return isl_map_alloc_dim(isl_dim_copy(model->dim), 0, ISL_MAP_DISJOINT);
3029 struct isl_set *isl_set_empty(struct isl_dim *dim)
3031 return isl_set_alloc_dim(dim, 0, ISL_MAP_DISJOINT);
3034 struct isl_set *isl_set_empty_like(struct isl_set *model)
3038 return isl_set_empty(isl_dim_copy(model->dim));
3041 struct isl_map *isl_map_universe(struct isl_dim *dim)
3043 struct isl_map *map;
3046 map = isl_map_alloc_dim(isl_dim_copy(dim), 1, ISL_MAP_DISJOINT);
3047 map = isl_map_add(map, isl_basic_map_universe(dim));
3051 struct isl_set *isl_set_universe(struct isl_dim *dim)
3053 struct isl_set *set;
3056 set = isl_set_alloc_dim(isl_dim_copy(dim), 1, ISL_MAP_DISJOINT);
3057 set = isl_set_add(set, isl_basic_set_universe(dim));
3061 __isl_give isl_set *isl_set_universe_like(__isl_keep isl_set *model)
3065 return isl_set_universe(isl_dim_copy(model->dim));
3068 struct isl_map *isl_map_dup(struct isl_map *map)
3071 struct isl_map *dup;
3075 dup = isl_map_alloc_dim(isl_dim_copy(map->dim), map->n, map->flags);
3076 for (i = 0; i < map->n; ++i)
3077 dup = isl_map_add(dup, isl_basic_map_copy(map->p[i]));
3081 struct isl_map *isl_map_add(struct isl_map *map, struct isl_basic_map *bmap)
3085 if (isl_basic_map_fast_is_empty(bmap)) {
3086 isl_basic_map_free(bmap);
3089 isl_assert(map->ctx, isl_dim_equal(map->dim, bmap->dim), goto error);
3090 isl_assert(map->ctx, map->n < map->size, goto error);
3091 map->p[map->n] = bmap;
3093 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3099 isl_basic_map_free(bmap);
3103 void isl_map_free(struct isl_map *map)
3113 isl_ctx_deref(map->ctx);
3114 for (i = 0; i < map->n; ++i)
3115 isl_basic_map_free(map->p[i]);
3116 isl_dim_free(map->dim);
3120 struct isl_map *isl_map_extend(struct isl_map *base,
3121 unsigned nparam, unsigned n_in, unsigned n_out)
3125 base = isl_map_cow(base);
3129 base->dim = isl_dim_extend(base->dim, nparam, n_in, n_out);
3132 for (i = 0; i < base->n; ++i) {
3133 base->p[i] = isl_basic_map_extend_dim(base->p[i],
3134 isl_dim_copy(base->dim), 0, 0, 0);
3144 struct isl_set *isl_set_extend(struct isl_set *base,
3145 unsigned nparam, unsigned dim)
3147 return (struct isl_set *)isl_map_extend((struct isl_map *)base,
3151 static struct isl_basic_map *isl_basic_map_fix_pos_si(
3152 struct isl_basic_map *bmap, unsigned pos, int value)
3156 bmap = isl_basic_map_cow(bmap);
3157 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
3158 j = isl_basic_map_alloc_equality(bmap);
3161 isl_seq_clr(bmap->eq[j] + 1, isl_basic_map_total_dim(bmap));
3162 isl_int_set_si(bmap->eq[j][pos], -1);
3163 isl_int_set_si(bmap->eq[j][0], value);
3164 bmap = isl_basic_map_simplify(bmap);
3165 return isl_basic_map_finalize(bmap);
3167 isl_basic_map_free(bmap);
3171 static __isl_give isl_basic_map *isl_basic_map_fix_pos(
3172 __isl_take isl_basic_map *bmap, unsigned pos, isl_int value)
3176 bmap = isl_basic_map_cow(bmap);
3177 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
3178 j = isl_basic_map_alloc_equality(bmap);
3181 isl_seq_clr(bmap->eq[j] + 1, isl_basic_map_total_dim(bmap));
3182 isl_int_set_si(bmap->eq[j][pos], -1);
3183 isl_int_set(bmap->eq[j][0], value);
3184 bmap = isl_basic_map_simplify(bmap);
3185 return isl_basic_map_finalize(bmap);
3187 isl_basic_map_free(bmap);
3191 struct isl_basic_map *isl_basic_map_fix_si(struct isl_basic_map *bmap,
3192 enum isl_dim_type type, unsigned pos, int value)
3196 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
3197 return isl_basic_map_fix_pos_si(bmap,
3198 isl_basic_map_offset(bmap, type) + pos, value);
3200 isl_basic_map_free(bmap);
3204 __isl_give isl_basic_map *isl_basic_map_fix(__isl_take isl_basic_map *bmap,
3205 enum isl_dim_type type, unsigned pos, isl_int value)
3209 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
3210 return isl_basic_map_fix_pos(bmap,
3211 isl_basic_map_offset(bmap, type) + pos, value);
3213 isl_basic_map_free(bmap);
3217 struct isl_basic_set *isl_basic_set_fix_si(struct isl_basic_set *bset,
3218 enum isl_dim_type type, unsigned pos, int value)
3220 return (struct isl_basic_set *)
3221 isl_basic_map_fix_si((struct isl_basic_map *)bset,
3225 __isl_give isl_basic_set *isl_basic_set_fix(__isl_take isl_basic_set *bset,
3226 enum isl_dim_type type, unsigned pos, isl_int value)
3228 return (struct isl_basic_set *)
3229 isl_basic_map_fix((struct isl_basic_map *)bset,
3233 struct isl_basic_map *isl_basic_map_fix_input_si(struct isl_basic_map *bmap,
3234 unsigned input, int value)
3236 return isl_basic_map_fix_si(bmap, isl_dim_in, input, value);
3239 struct isl_basic_set *isl_basic_set_fix_dim_si(struct isl_basic_set *bset,
3240 unsigned dim, int value)
3242 return (struct isl_basic_set *)
3243 isl_basic_map_fix_si((struct isl_basic_map *)bset,
3244 isl_dim_set, dim, value);
3247 struct isl_map *isl_map_fix_si(struct isl_map *map,
3248 enum isl_dim_type type, unsigned pos, int value)
3252 map = isl_map_cow(map);
3256 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
3257 for (i = 0; i < map->n; ++i) {
3258 map->p[i] = isl_basic_map_fix_si(map->p[i], type, pos, value);
3262 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3269 __isl_give isl_map *isl_map_fix(__isl_take isl_map *map,
3270 enum isl_dim_type type, unsigned pos, isl_int value)
3274 map = isl_map_cow(map);
3278 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
3279 for (i = 0; i < map->n; ++i) {
3280 map->p[i] = isl_basic_map_fix(map->p[i], type, pos, value);
3284 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3291 __isl_give isl_set *isl_set_fix(__isl_take isl_set *set,
3292 enum isl_dim_type type, unsigned pos, isl_int value)
3294 return (struct isl_set *)isl_map_fix((isl_map *)set, type, pos, value);
3297 struct isl_map *isl_map_fix_input_si(struct isl_map *map,
3298 unsigned input, int value)
3300 return isl_map_fix_si(map, isl_dim_in, input, value);
3303 struct isl_set *isl_set_fix_dim_si(struct isl_set *set, unsigned dim, int value)
3305 return (struct isl_set *)
3306 isl_map_fix_si((struct isl_map *)set, isl_dim_set, dim, value);
3309 struct isl_basic_set *isl_basic_set_lower_bound_dim(struct isl_basic_set *bset,
3310 unsigned dim, isl_int value)
3314 bset = isl_basic_set_cow(bset);
3315 bset = isl_basic_set_extend_constraints(bset, 0, 1);
3316 j = isl_basic_set_alloc_inequality(bset);
3319 isl_seq_clr(bset->ineq[j], 1 + isl_basic_set_total_dim(bset));
3320 isl_int_set_si(bset->ineq[j][1 + isl_basic_set_n_param(bset) + dim], 1);
3321 isl_int_neg(bset->ineq[j][0], value);
3322 bset = isl_basic_set_simplify(bset);
3323 return isl_basic_set_finalize(bset);
3325 isl_basic_set_free(bset);
3329 struct isl_set *isl_set_lower_bound_dim(struct isl_set *set, unsigned dim,
3334 set = isl_set_cow(set);
3338 isl_assert(set->ctx, dim < isl_set_n_dim(set), goto error);
3339 for (i = 0; i < set->n; ++i) {
3340 set->p[i] = isl_basic_set_lower_bound_dim(set->p[i], dim, value);
3350 struct isl_map *isl_map_reverse(struct isl_map *map)
3354 map = isl_map_cow(map);
3358 map->dim = isl_dim_reverse(map->dim);
3361 for (i = 0; i < map->n; ++i) {
3362 map->p[i] = isl_basic_map_reverse(map->p[i]);
3366 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3373 static struct isl_map *isl_basic_map_partial_lexopt(
3374 struct isl_basic_map *bmap, struct isl_basic_set *dom,
3375 struct isl_set **empty, int max)
3379 if (bmap->ctx->opt->pip == ISL_PIP_PIP)
3380 return isl_pip_basic_map_lexopt(bmap, dom, empty, max);
3382 return isl_tab_basic_map_partial_lexopt(bmap, dom, empty, max);
3384 isl_basic_map_free(bmap);
3385 isl_basic_set_free(dom);
3391 struct isl_map *isl_basic_map_partial_lexmax(
3392 struct isl_basic_map *bmap, struct isl_basic_set *dom,
3393 struct isl_set **empty)
3395 return isl_basic_map_partial_lexopt(bmap, dom, empty, 1);
3398 struct isl_map *isl_basic_map_partial_lexmin(
3399 struct isl_basic_map *bmap, struct isl_basic_set *dom,
3400 struct isl_set **empty)
3402 return isl_basic_map_partial_lexopt(bmap, dom, empty, 0);
3405 struct isl_set *isl_basic_set_partial_lexmin(
3406 struct isl_basic_set *bset, struct isl_basic_set *dom,
3407 struct isl_set **empty)
3409 return (struct isl_set *)
3410 isl_basic_map_partial_lexmin((struct isl_basic_map *)bset,
3414 struct isl_set *isl_basic_set_partial_lexmax(
3415 struct isl_basic_set *bset, struct isl_basic_set *dom,
3416 struct isl_set **empty)
3418 return (struct isl_set *)
3419 isl_basic_map_partial_lexmax((struct isl_basic_map *)bset,
3423 __isl_give isl_map *isl_basic_map_lexopt(__isl_take isl_basic_map *bmap, int max)
3425 struct isl_basic_set *dom = NULL;
3426 struct isl_dim *dom_dim;
3430 dom_dim = isl_dim_domain(isl_dim_copy(bmap->dim));
3431 dom = isl_basic_set_universe(dom_dim);
3432 return isl_basic_map_partial_lexopt(bmap, dom, NULL, max);
3434 isl_basic_map_free(bmap);
3438 __isl_give isl_map *isl_basic_map_lexmin(__isl_take isl_basic_map *bmap)
3440 return isl_basic_map_lexopt(bmap, 0);
3443 __isl_give isl_map *isl_basic_map_lexmax(__isl_take isl_basic_map *bmap)
3445 return isl_basic_map_lexopt(bmap, 1);
3448 __isl_give isl_set *isl_basic_set_lexmin(__isl_take isl_basic_set *bset)
3450 return (isl_set *)isl_basic_map_lexmin((isl_basic_map *)bset);
3453 __isl_give isl_set *isl_basic_set_lexmax(__isl_take isl_basic_set *bset)
3455 return (isl_set *)isl_basic_map_lexmax((isl_basic_map *)bset);
3458 static struct isl_map *isl_map_reset_dim(struct isl_map *map,
3459 struct isl_dim *dim)
3466 for (i = 0; i < map->n; ++i) {
3467 isl_dim_free(map->p[i]->dim);
3468 map->p[i]->dim = isl_dim_copy(dim);
3470 isl_dim_free(map->dim);
3480 static struct isl_set *isl_set_reset_dim(struct isl_set *set,
3481 struct isl_dim *dim)
3483 return (struct isl_set *) isl_map_reset_dim((struct isl_map *)set, dim);
3486 /* Apply a preimage specified by "mat" on the parameters of "bset".
3487 * bset is assumed to have only parameters and divs.
3489 static struct isl_basic_set *basic_set_parameter_preimage(
3490 struct isl_basic_set *bset, struct isl_mat *mat)
3497 bset->dim = isl_dim_cow(bset->dim);
3501 nparam = isl_basic_set_dim(bset, isl_dim_param);
3503 isl_assert(bset->ctx, mat->n_row == 1 + nparam, goto error);
3505 bset->dim->nparam = 0;
3506 bset->dim->n_out = nparam;
3507 bset = isl_basic_set_preimage(bset, mat);
3509 bset->dim->nparam = bset->dim->n_out;
3510 bset->dim->n_out = 0;
3515 isl_basic_set_free(bset);
3519 /* Apply a preimage specified by "mat" on the parameters of "set".
3520 * set is assumed to have only parameters and divs.
3522 static struct isl_set *set_parameter_preimage(
3523 struct isl_set *set, struct isl_mat *mat)
3525 struct isl_dim *dim = NULL;
3531 dim = isl_dim_copy(set->dim);
3532 dim = isl_dim_cow(dim);
3536 nparam = isl_set_dim(set, isl_dim_param);
3538 isl_assert(set->ctx, mat->n_row == 1 + nparam, goto error);
3541 dim->n_out = nparam;
3542 isl_set_reset_dim(set, dim);
3543 set = isl_set_preimage(set, mat);
3546 dim = isl_dim_copy(set->dim);
3547 dim = isl_dim_cow(dim);
3550 dim->nparam = dim->n_out;
3552 isl_set_reset_dim(set, dim);
3562 /* Intersect the basic set "bset" with the affine space specified by the
3563 * equalities in "eq".
3565 static struct isl_basic_set *basic_set_append_equalities(
3566 struct isl_basic_set *bset, struct isl_mat *eq)
3574 bset = isl_basic_set_extend_dim(bset, isl_dim_copy(bset->dim), 0,
3579 len = 1 + isl_dim_total(bset->dim) + bset->extra;
3580 for (i = 0; i < eq->n_row; ++i) {
3581 k = isl_basic_set_alloc_equality(bset);
3584 isl_seq_cpy(bset->eq[k], eq->row[i], eq->n_col);
3585 isl_seq_clr(bset->eq[k] + eq->n_col, len - eq->n_col);
3592 isl_basic_set_free(bset);
3596 /* Intersect the set "set" with the affine space specified by the
3597 * equalities in "eq".
3599 static struct isl_set *set_append_equalities(struct isl_set *set,
3607 for (i = 0; i < set->n; ++i) {
3608 set->p[i] = basic_set_append_equalities(set->p[i],
3621 /* Project the given basic set onto its parameter domain, possibly introducing
3622 * new, explicit, existential variables in the constraints.
3623 * The input has parameters and (possibly implicit) existential variables.
3624 * The output has the same parameters, but only
3625 * explicit existentially quantified variables.
3627 * The actual projection is performed by pip, but pip doesn't seem
3628 * to like equalities very much, so we first remove the equalities
3629 * among the parameters by performing a variable compression on
3630 * the parameters. Afterward, an inverse transformation is performed
3631 * and the equalities among the parameters are inserted back in.
3633 static struct isl_set *parameter_compute_divs(struct isl_basic_set *bset)
3637 struct isl_mat *T, *T2;
3638 struct isl_set *set;
3639 unsigned nparam, n_div;
3641 bset = isl_basic_set_cow(bset);
3645 if (bset->n_eq == 0)
3646 return isl_basic_set_lexmin(bset);
3648 isl_basic_set_gauss(bset, NULL);
3650 nparam = isl_basic_set_dim(bset, isl_dim_param);
3651 n_div = isl_basic_set_dim(bset, isl_dim_div);
3653 for (i = 0, j = n_div - 1; i < bset->n_eq && j >= 0; --j) {
3654 if (!isl_int_is_zero(bset->eq[i][1 + nparam + j]))
3657 if (i == bset->n_eq)
3658 return isl_basic_set_lexmin(bset);
3660 eq = isl_mat_sub_alloc(bset->ctx, bset->eq, i, bset->n_eq - i,
3662 eq = isl_mat_cow(eq);
3663 T = isl_mat_variable_compression(isl_mat_copy(eq), &T2);
3664 bset = basic_set_parameter_preimage(bset, T);
3666 set = isl_basic_set_lexmin(bset);
3667 set = set_parameter_preimage(set, T2);
3668 set = set_append_equalities(set, eq);
3672 /* Compute an explicit representation for all the existentially
3673 * quantified variables.
3674 * The input and output dimensions are first turned into parameters.
3675 * compute_divs then returns a map with the same parameters and
3676 * no input or output dimensions and the dimension specification
3677 * is reset to that of the input.
3679 static struct isl_map *compute_divs(struct isl_basic_map *bmap)
3681 struct isl_basic_set *bset;
3682 struct isl_set *set;
3683 struct isl_map *map;
3684 struct isl_dim *dim, *orig_dim = NULL;
3689 bmap = isl_basic_map_cow(bmap);
3693 nparam = isl_basic_map_dim(bmap, isl_dim_param);
3694 n_in = isl_basic_map_dim(bmap, isl_dim_in);
3695 n_out = isl_basic_map_dim(bmap, isl_dim_out);
3696 dim = isl_dim_set_alloc(bmap->ctx, nparam + n_in + n_out, 0);
3700 orig_dim = bmap->dim;
3702 bset = (struct isl_basic_set *)bmap;
3704 set = parameter_compute_divs(bset);
3705 map = (struct isl_map *)set;
3706 map = isl_map_reset_dim(map, orig_dim);
3710 isl_basic_map_free(bmap);
3714 static int basic_map_divs_known(__isl_keep isl_basic_map *bmap)
3722 off = isl_dim_total(bmap->dim);
3723 for (i = 0; i < bmap->n_div; ++i) {
3724 if (isl_int_is_zero(bmap->div[i][0]))
3726 isl_assert(bmap->ctx, isl_int_is_zero(bmap->div[i][1+1+off+i]),
3732 static int map_divs_known(__isl_keep isl_map *map)
3739 for (i = 0; i < map->n; ++i) {
3740 int known = basic_map_divs_known(map->p[i]);
3748 /* If bmap contains any unknown divs, then compute explicit
3749 * expressions for them. However, this computation may be
3750 * quite expensive, so first try to remove divs that aren't
3753 struct isl_map *isl_basic_map_compute_divs(struct isl_basic_map *bmap)
3757 struct isl_map *map;
3759 known = basic_map_divs_known(bmap);
3763 return isl_map_from_basic_map(bmap);
3765 bmap = isl_basic_map_drop_redundant_divs(bmap);
3767 known = basic_map_divs_known(bmap);
3771 return isl_map_from_basic_map(bmap);
3773 map = compute_divs(bmap);
3776 isl_basic_map_free(bmap);
3780 struct isl_map *isl_map_compute_divs(struct isl_map *map)
3784 struct isl_map *res;
3791 known = map_divs_known(map);
3799 res = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[0]));
3800 for (i = 1 ; i < map->n; ++i) {
3802 r2 = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[i]));
3803 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT))
3804 res = isl_map_union_disjoint(res, r2);
3806 res = isl_map_union(res, r2);
3813 struct isl_set *isl_basic_set_compute_divs(struct isl_basic_set *bset)
3815 return (struct isl_set *)
3816 isl_basic_map_compute_divs((struct isl_basic_map *)bset);
3819 struct isl_set *isl_set_compute_divs(struct isl_set *set)
3821 return (struct isl_set *)
3822 isl_map_compute_divs((struct isl_map *)set);
3825 struct isl_set *isl_map_domain(struct isl_map *map)
3828 struct isl_set *set;
3833 map = isl_map_cow(map);
3837 set = (struct isl_set *)map;
3838 set->dim = isl_dim_domain(set->dim);
3841 for (i = 0; i < map->n; ++i) {
3842 set->p[i] = isl_basic_map_domain(map->p[i]);
3846 ISL_F_CLR(set, ISL_MAP_DISJOINT);
3847 ISL_F_CLR(set, ISL_SET_NORMALIZED);
3854 struct isl_map *isl_map_union_disjoint(
3855 struct isl_map *map1, struct isl_map *map2)
3859 struct isl_map *map = NULL;
3873 isl_assert(map1->ctx, isl_dim_equal(map1->dim, map2->dim), goto error);
3875 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
3876 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
3877 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
3879 map = isl_map_alloc_dim(isl_dim_copy(map1->dim),
3880 map1->n + map2->n, flags);
3883 for (i = 0; i < map1->n; ++i) {
3884 map = isl_map_add(map,
3885 isl_basic_map_copy(map1->p[i]));
3889 for (i = 0; i < map2->n; ++i) {
3890 map = isl_map_add(map,
3891 isl_basic_map_copy(map2->p[i]));
3905 struct isl_map *isl_map_union(struct isl_map *map1, struct isl_map *map2)
3907 map1 = isl_map_union_disjoint(map1, map2);
3911 ISL_F_CLR(map1, ISL_MAP_DISJOINT);
3915 struct isl_set *isl_set_union_disjoint(
3916 struct isl_set *set1, struct isl_set *set2)
3918 return (struct isl_set *)
3919 isl_map_union_disjoint(
3920 (struct isl_map *)set1, (struct isl_map *)set2);
3923 struct isl_set *isl_set_union(struct isl_set *set1, struct isl_set *set2)
3925 return (struct isl_set *)
3926 isl_map_union((struct isl_map *)set1, (struct isl_map *)set2);
3929 struct isl_map *isl_map_intersect_range(
3930 struct isl_map *map, struct isl_set *set)
3933 struct isl_map *result;
3939 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT) &&
3940 ISL_F_ISSET(set, ISL_MAP_DISJOINT))
3941 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
3943 result = isl_map_alloc_dim(isl_dim_copy(map->dim),
3944 map->n * set->n, flags);
3947 for (i = 0; i < map->n; ++i)
3948 for (j = 0; j < set->n; ++j) {
3949 result = isl_map_add(result,
3950 isl_basic_map_intersect_range(
3951 isl_basic_map_copy(map->p[i]),
3952 isl_basic_set_copy(set->p[j])));
3965 struct isl_map *isl_map_intersect_domain(
3966 struct isl_map *map, struct isl_set *set)
3968 return isl_map_reverse(
3969 isl_map_intersect_range(isl_map_reverse(map), set));
3972 struct isl_map *isl_map_apply_domain(
3973 struct isl_map *map1, struct isl_map *map2)
3977 map1 = isl_map_reverse(map1);
3978 map1 = isl_map_apply_range(map1, map2);
3979 return isl_map_reverse(map1);
3986 struct isl_map *isl_map_apply_range(
3987 struct isl_map *map1, struct isl_map *map2)
3989 struct isl_dim *dim_result;
3990 struct isl_map *result;
3996 dim_result = isl_dim_join(isl_dim_copy(map1->dim),
3997 isl_dim_copy(map2->dim));
3999 result = isl_map_alloc_dim(dim_result, map1->n * map2->n, 0);
4002 for (i = 0; i < map1->n; ++i)
4003 for (j = 0; j < map2->n; ++j) {
4004 result = isl_map_add(result,
4005 isl_basic_map_apply_range(
4006 isl_basic_map_copy(map1->p[i]),
4007 isl_basic_map_copy(map2->p[j])));
4013 if (result && result->n <= 1)
4014 ISL_F_SET(result, ISL_MAP_DISJOINT);
4023 * returns range - domain
4025 struct isl_basic_set *isl_basic_map_deltas(struct isl_basic_map *bmap)
4027 struct isl_basic_set *bset;
4034 dim = isl_basic_map_n_in(bmap);
4035 nparam = isl_basic_map_n_param(bmap);
4036 isl_assert(bmap->ctx, dim == isl_basic_map_n_out(bmap), goto error);
4037 bset = isl_basic_set_from_basic_map(bmap);
4038 bset = isl_basic_set_cow(bset);
4039 bset = isl_basic_set_extend(bset, nparam, 3*dim, 0, dim, 0);
4040 bset = isl_basic_set_swap_vars(bset, 2*dim);
4041 for (i = 0; i < dim; ++i) {
4042 int j = isl_basic_map_alloc_equality(
4043 (struct isl_basic_map *)bset);
4046 isl_seq_clr(bset->eq[j], 1 + isl_basic_set_total_dim(bset));
4047 isl_int_set_si(bset->eq[j][1+nparam+i], 1);
4048 isl_int_set_si(bset->eq[j][1+nparam+dim+i], 1);
4049 isl_int_set_si(bset->eq[j][1+nparam+2*dim+i], -1);
4051 return isl_basic_set_project_out(bset, isl_dim_set, dim, 2*dim);
4053 isl_basic_map_free(bmap);
4058 * returns range - domain
4060 struct isl_set *isl_map_deltas(struct isl_map *map)
4063 struct isl_set *result;
4068 isl_assert(map->ctx, isl_map_n_in(map) == isl_map_n_out(map), goto error);
4069 result = isl_set_alloc(map->ctx, isl_map_n_param(map),
4070 isl_map_n_in(map), map->n, map->flags);
4073 for (i = 0; i < map->n; ++i)
4074 result = isl_set_add(result,
4075 isl_basic_map_deltas(isl_basic_map_copy(map->p[i])));
4083 static struct isl_basic_map *basic_map_identity(struct isl_dim *dims)
4085 struct isl_basic_map *bmap;
4093 nparam = dims->nparam;
4095 bmap = isl_basic_map_alloc_dim(dims, 0, dim, 0);
4099 for (i = 0; i < dim; ++i) {
4100 int j = isl_basic_map_alloc_equality(bmap);
4103 isl_seq_clr(bmap->eq[j], 1 + isl_basic_map_total_dim(bmap));
4104 isl_int_set_si(bmap->eq[j][1+nparam+i], 1);
4105 isl_int_set_si(bmap->eq[j][1+nparam+dim+i], -1);
4107 return isl_basic_map_finalize(bmap);
4109 isl_basic_map_free(bmap);
4113 struct isl_basic_map *isl_basic_map_identity(struct isl_dim *set_dim)
4115 struct isl_dim *dim = isl_dim_map(set_dim);
4118 return basic_map_identity(dim);
4121 struct isl_basic_map *isl_basic_map_identity_like(struct isl_basic_map *model)
4123 if (!model || !model->dim)
4125 isl_assert(model->ctx,
4126 model->dim->n_in == model->dim->n_out, return NULL);
4127 return basic_map_identity(isl_dim_copy(model->dim));
4130 static struct isl_map *map_identity(struct isl_dim *dim)
4132 struct isl_map *map = isl_map_alloc_dim(dim, 1, ISL_MAP_DISJOINT);
4133 return isl_map_add(map, basic_map_identity(isl_dim_copy(dim)));
4136 struct isl_map *isl_map_identity(struct isl_dim *set_dim)
4138 struct isl_dim *dim = isl_dim_map(set_dim);
4141 return map_identity(dim);
4144 struct isl_map *isl_map_identity_like(struct isl_map *model)
4146 if (!model || !model->dim)
4148 isl_assert(model->ctx,
4149 model->dim->n_in == model->dim->n_out, return NULL);
4150 return map_identity(isl_dim_copy(model->dim));
4153 struct isl_map *isl_map_identity_like_basic_map(struct isl_basic_map *model)
4155 if (!model || !model->dim)
4157 isl_assert(model->ctx,
4158 model->dim->n_in == model->dim->n_out, return NULL);
4159 return map_identity(isl_dim_copy(model->dim));
4162 /* Construct a basic set with all set dimensions having only non-negative
4165 struct isl_basic_set *isl_basic_set_positive_orthant(struct isl_dim *dims)
4170 struct isl_basic_set *bset;
4174 nparam = dims->nparam;
4176 bset = isl_basic_set_alloc_dim(dims, 0, 0, dim);
4179 for (i = 0; i < dim; ++i) {
4180 int k = isl_basic_set_alloc_inequality(bset);
4183 isl_seq_clr(bset->ineq[k], 1 + isl_basic_set_total_dim(bset));
4184 isl_int_set_si(bset->ineq[k][1 + nparam + i], 1);
4188 isl_basic_set_free(bset);
4192 int isl_set_is_equal(struct isl_set *set1, struct isl_set *set2)
4194 return isl_map_is_equal((struct isl_map *)set1, (struct isl_map *)set2);
4197 int isl_basic_map_is_subset(
4198 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
4201 struct isl_map *map1;
4202 struct isl_map *map2;
4204 if (!bmap1 || !bmap2)
4207 map1 = isl_map_from_basic_map(isl_basic_map_copy(bmap1));
4208 map2 = isl_map_from_basic_map(isl_basic_map_copy(bmap2));
4210 is_subset = isl_map_is_subset(map1, map2);
4218 int isl_basic_map_is_equal(
4219 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
4223 if (!bmap1 || !bmap2)
4225 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
4228 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
4232 int isl_basic_set_is_equal(
4233 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
4235 return isl_basic_map_is_equal(
4236 (struct isl_basic_map *)bset1, (struct isl_basic_map *)bset2);
4239 int isl_map_is_empty(struct isl_map *map)
4246 for (i = 0; i < map->n; ++i) {
4247 is_empty = isl_basic_map_is_empty(map->p[i]);
4256 int isl_map_fast_is_empty(struct isl_map *map)
4261 int isl_set_is_empty(struct isl_set *set)
4263 return isl_map_is_empty((struct isl_map *)set);
4266 int isl_map_is_equal(struct isl_map *map1, struct isl_map *map2)
4272 is_subset = isl_map_is_subset(map1, map2);
4275 is_subset = isl_map_is_subset(map2, map1);
4279 int isl_basic_map_is_strict_subset(
4280 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
4284 if (!bmap1 || !bmap2)
4286 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
4289 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
4290 if (is_subset == -1)
4295 int isl_map_is_strict_subset(struct isl_map *map1, struct isl_map *map2)
4301 is_subset = isl_map_is_subset(map1, map2);
4304 is_subset = isl_map_is_subset(map2, map1);
4305 if (is_subset == -1)
4310 int isl_set_is_strict_subset(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
4312 return isl_map_is_strict_subset((isl_map *)set1, (isl_map *)set2);
4315 int isl_basic_map_is_universe(struct isl_basic_map *bmap)
4319 return bmap->n_eq == 0 && bmap->n_ineq == 0;
4322 int isl_basic_set_is_universe(struct isl_basic_set *bset)
4326 return bset->n_eq == 0 && bset->n_ineq == 0;
4329 int isl_map_fast_is_universe(__isl_keep isl_map *map)
4334 return map->n == 1 && isl_basic_map_is_universe(map->p[0]);
4337 int isl_basic_map_is_empty(struct isl_basic_map *bmap)
4339 struct isl_basic_set *bset = NULL;
4340 struct isl_vec *sample = NULL;
4347 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY))
4350 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL)) {
4351 struct isl_basic_map *copy = isl_basic_map_copy(bmap);
4352 copy = isl_basic_map_convex_hull(copy);
4353 empty = ISL_F_ISSET(copy, ISL_BASIC_MAP_EMPTY);
4354 isl_basic_map_free(copy);
4358 total = 1 + isl_basic_map_total_dim(bmap);
4359 if (bmap->sample && bmap->sample->size == total) {
4360 int contains = isl_basic_map_contains(bmap, bmap->sample);
4366 isl_vec_free(bmap->sample);
4367 bmap->sample = NULL;
4368 bset = isl_basic_map_underlying_set(isl_basic_map_copy(bmap));
4371 sample = isl_basic_set_sample_vec(bset);
4374 empty = sample->size == 0;
4375 isl_vec_free(bmap->sample);
4376 bmap->sample = sample;
4378 ISL_F_SET(bmap, ISL_BASIC_MAP_EMPTY);
4383 int isl_basic_map_fast_is_empty(struct isl_basic_map *bmap)
4387 return ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY);
4390 int isl_basic_set_fast_is_empty(struct isl_basic_set *bset)
4394 return ISL_F_ISSET(bset, ISL_BASIC_SET_EMPTY);
4397 int isl_basic_set_is_empty(struct isl_basic_set *bset)
4399 return isl_basic_map_is_empty((struct isl_basic_map *)bset);
4402 struct isl_map *isl_basic_map_union(
4403 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
4405 struct isl_map *map;
4406 if (!bmap1 || !bmap2)
4409 isl_assert(bmap1->ctx, isl_dim_equal(bmap1->dim, bmap2->dim), goto error);
4411 map = isl_map_alloc_dim(isl_dim_copy(bmap1->dim), 2, 0);
4414 map = isl_map_add(map, bmap1);
4415 map = isl_map_add(map, bmap2);
4418 isl_basic_map_free(bmap1);
4419 isl_basic_map_free(bmap2);
4423 struct isl_set *isl_basic_set_union(
4424 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
4426 return (struct isl_set *)isl_basic_map_union(
4427 (struct isl_basic_map *)bset1,
4428 (struct isl_basic_map *)bset2);
4431 /* Order divs such that any div only depends on previous divs */
4432 struct isl_basic_map *isl_basic_map_order_divs(struct isl_basic_map *bmap)
4435 unsigned off = isl_dim_total(bmap->dim);
4437 for (i = 0; i < bmap->n_div; ++i) {
4439 if (isl_int_is_zero(bmap->div[i][0]))
4441 pos = isl_seq_first_non_zero(bmap->div[i]+1+1+off+i,
4445 isl_basic_map_swap_div(bmap, i, i + pos);
4451 struct isl_basic_set *isl_basic_set_order_divs(struct isl_basic_set *bset)
4453 return (struct isl_basic_set *)
4454 isl_basic_map_order_divs((struct isl_basic_map *)bset);
4457 /* Look for a div in dst that corresponds to the div "div" in src.
4458 * The divs before "div" in src and dst are assumed to be the same.
4460 * Returns -1 if no corresponding div was found and the position
4461 * of the corresponding div in dst otherwise.
4463 static int find_div(struct isl_basic_map *dst,
4464 struct isl_basic_map *src, unsigned div)
4468 unsigned total = isl_dim_total(src->dim);
4470 isl_assert(dst->ctx, div <= dst->n_div, return -1);
4471 for (i = div; i < dst->n_div; ++i)
4472 if (isl_seq_eq(dst->div[i], src->div[div], 1+1+total+div) &&
4473 isl_seq_first_non_zero(dst->div[i]+1+1+total+div,
4474 dst->n_div - div) == -1)
4479 struct isl_basic_map *isl_basic_map_align_divs(
4480 struct isl_basic_map *dst, struct isl_basic_map *src)
4483 unsigned total = isl_dim_total(src->dim);
4488 if (src->n_div == 0)
4491 for (i = 0; i < src->n_div; ++i)
4492 isl_assert(src->ctx, !isl_int_is_zero(src->div[i][0]), goto error);
4494 src = isl_basic_map_order_divs(src);
4495 dst = isl_basic_map_cow(dst);
4496 dst = isl_basic_map_extend_dim(dst, isl_dim_copy(dst->dim),
4497 src->n_div, 0, 2 * src->n_div);
4500 for (i = 0; i < src->n_div; ++i) {
4501 int j = find_div(dst, src, i);
4503 j = isl_basic_map_alloc_div(dst);
4506 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total+i);
4507 isl_seq_clr(dst->div[j]+1+1+total+i, dst->n_div - i);
4508 if (add_div_constraints(dst, j) < 0)
4512 isl_basic_map_swap_div(dst, i, j);
4516 isl_basic_map_free(dst);
4520 struct isl_basic_set *isl_basic_set_align_divs(
4521 struct isl_basic_set *dst, struct isl_basic_set *src)
4523 return (struct isl_basic_set *)isl_basic_map_align_divs(
4524 (struct isl_basic_map *)dst, (struct isl_basic_map *)src);
4527 struct isl_map *isl_map_align_divs(struct isl_map *map)
4535 map = isl_map_compute_divs(map);
4536 map = isl_map_cow(map);
4540 for (i = 1; i < map->n; ++i)
4541 map->p[0] = isl_basic_map_align_divs(map->p[0], map->p[i]);
4542 for (i = 1; i < map->n; ++i)
4543 map->p[i] = isl_basic_map_align_divs(map->p[i], map->p[0]);
4545 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4549 struct isl_set *isl_set_align_divs(struct isl_set *set)
4551 return (struct isl_set *)isl_map_align_divs((struct isl_map *)set);
4554 struct isl_set *isl_set_apply(struct isl_set *set, struct isl_map *map)
4558 isl_assert(set->ctx, isl_map_compatible_domain(map, set), goto error);
4559 map = isl_map_intersect_domain(map, set);
4560 set = isl_map_range(map);
4568 /* There is no need to cow as removing empty parts doesn't change
4569 * the meaning of the set.
4571 struct isl_map *isl_map_remove_empty_parts(struct isl_map *map)
4578 for (i = map->n-1; i >= 0; --i) {
4579 if (!ISL_F_ISSET(map->p[i], ISL_BASIC_MAP_EMPTY))
4581 isl_basic_map_free(map->p[i]);
4582 if (i != map->n-1) {
4583 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4584 map->p[i] = map->p[map->n-1];
4592 struct isl_set *isl_set_remove_empty_parts(struct isl_set *set)
4594 return (struct isl_set *)
4595 isl_map_remove_empty_parts((struct isl_map *)set);
4598 struct isl_basic_map *isl_map_copy_basic_map(struct isl_map *map)
4600 struct isl_basic_map *bmap;
4601 if (!map || map->n == 0)
4603 bmap = map->p[map->n-1];
4604 isl_assert(map->ctx, ISL_F_ISSET(bmap, ISL_BASIC_SET_FINAL), return NULL);
4605 return isl_basic_map_copy(bmap);
4608 struct isl_basic_set *isl_set_copy_basic_set(struct isl_set *set)
4610 return (struct isl_basic_set *)
4611 isl_map_copy_basic_map((struct isl_map *)set);
4614 __isl_give isl_map *isl_map_drop_basic_map(__isl_take isl_map *map,
4615 __isl_keep isl_basic_map *bmap)
4621 for (i = map->n-1; i >= 0; --i) {
4622 if (map->p[i] != bmap)
4624 map = isl_map_cow(map);
4627 isl_basic_map_free(map->p[i]);
4628 if (i != map->n-1) {
4629 ISL_F_CLR(map, ISL_SET_NORMALIZED);
4630 map->p[i] = map->p[map->n-1];
4641 struct isl_set *isl_set_drop_basic_set(struct isl_set *set,
4642 struct isl_basic_set *bset)
4644 return (struct isl_set *)isl_map_drop_basic_map((struct isl_map *)set,
4645 (struct isl_basic_map *)bset);
4648 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
4649 * for any common value of the parameters and dimensions preceding dim
4650 * in both basic sets, the values of dimension pos in bset1 are
4651 * smaller or larger than those in bset2.
4654 * 1 if bset1 follows bset2
4655 * -1 if bset1 precedes bset2
4656 * 0 if bset1 and bset2 are incomparable
4657 * -2 if some error occurred.
4659 int isl_basic_set_compare_at(struct isl_basic_set *bset1,
4660 struct isl_basic_set *bset2, int pos)
4662 struct isl_dim *dims;
4663 struct isl_basic_map *bmap1 = NULL;
4664 struct isl_basic_map *bmap2 = NULL;
4665 struct isl_ctx *ctx;
4666 struct isl_vec *obj;
4669 unsigned dim1, dim2;
4671 enum isl_lp_result res;
4674 if (!bset1 || !bset2)
4677 nparam = isl_basic_set_n_param(bset1);
4678 dim1 = isl_basic_set_n_dim(bset1);
4679 dim2 = isl_basic_set_n_dim(bset2);
4680 dims = isl_dim_alloc(bset1->ctx, nparam, pos, dim1 - pos);
4681 bmap1 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset1), dims);
4682 dims = isl_dim_alloc(bset2->ctx, nparam, pos, dim2 - pos);
4683 bmap2 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset2), dims);
4684 if (!bmap1 || !bmap2)
4686 bmap1 = isl_basic_map_cow(bmap1);
4687 bmap1 = isl_basic_map_extend(bmap1, nparam,
4688 pos, (dim1 - pos) + (dim2 - pos),
4689 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
4690 bmap1 = add_constraints(bmap1, bmap2, 0, dim1 - pos);
4693 total = isl_basic_map_total_dim(bmap1);
4695 obj = isl_vec_alloc(ctx, 1 + total);
4696 isl_seq_clr(obj->block.data, 1 + total);
4697 isl_int_set_si(obj->block.data[1+nparam+pos], 1);
4698 isl_int_set_si(obj->block.data[1+nparam+pos+(dim1-pos)], -1);
4703 res = isl_basic_map_solve_lp(bmap1, 0, obj->block.data, ctx->one,
4705 if (res == isl_lp_empty)
4707 else if (res == isl_lp_ok && isl_int_is_pos(num))
4709 else if ((res == isl_lp_ok && isl_int_is_neg(num)) ||
4710 res == isl_lp_unbounded)
4716 isl_basic_map_free(bmap1);
4720 isl_basic_map_free(bmap1);
4721 isl_basic_map_free(bmap2);
4725 static int isl_basic_map_fast_has_fixed_var(struct isl_basic_map *bmap,
4726 unsigned pos, isl_int *val)
4734 total = isl_basic_map_total_dim(bmap);
4735 for (i = 0, d = total-1; i < bmap->n_eq && d+1 > pos; ++i) {
4736 for (; d+1 > pos; --d)
4737 if (!isl_int_is_zero(bmap->eq[i][1+d]))
4741 if (isl_seq_first_non_zero(bmap->eq[i]+1, d) != -1)
4743 if (isl_seq_first_non_zero(bmap->eq[i]+1+d+1, total-d-1) != -1)
4745 if (!isl_int_is_one(bmap->eq[i][1+d]))
4748 isl_int_neg(*val, bmap->eq[i][0]);
4754 static int isl_map_fast_has_fixed_var(struct isl_map *map,
4755 unsigned pos, isl_int *val)
4767 return isl_basic_map_fast_has_fixed_var(map->p[0], pos, val);
4770 fixed = isl_basic_map_fast_has_fixed_var(map->p[0], pos, &v);
4771 for (i = 1; fixed == 1 && i < map->n; ++i) {
4772 fixed = isl_basic_map_fast_has_fixed_var(map->p[i], pos, &tmp);
4773 if (fixed == 1 && isl_int_ne(tmp, v))
4777 isl_int_set(*val, v);
4783 static int isl_basic_set_fast_has_fixed_var(struct isl_basic_set *bset,
4784 unsigned pos, isl_int *val)
4786 return isl_basic_map_fast_has_fixed_var((struct isl_basic_map *)bset,
4790 static int isl_set_fast_has_fixed_var(struct isl_set *set, unsigned pos,
4793 return isl_map_fast_has_fixed_var((struct isl_map *)set, pos, val);
4796 int isl_basic_map_fast_is_fixed(struct isl_basic_map *bmap,
4797 enum isl_dim_type type, unsigned pos, isl_int *val)
4799 if (pos >= isl_basic_map_dim(bmap, type))
4801 return isl_basic_map_fast_has_fixed_var(bmap,
4802 isl_basic_map_offset(bmap, type) - 1 + pos, val);
4805 int isl_map_fast_is_fixed(struct isl_map *map,
4806 enum isl_dim_type type, unsigned pos, isl_int *val)
4808 if (pos >= isl_map_dim(map, type))
4810 return isl_map_fast_has_fixed_var(map,
4811 map_offset(map, type) - 1 + pos, val);
4814 /* Check if dimension dim has fixed value and if so and if val is not NULL,
4815 * then return this fixed value in *val.
4817 int isl_basic_set_fast_dim_is_fixed(struct isl_basic_set *bset, unsigned dim,
4820 return isl_basic_set_fast_has_fixed_var(bset,
4821 isl_basic_set_n_param(bset) + dim, val);
4824 /* Check if dimension dim has fixed value and if so and if val is not NULL,
4825 * then return this fixed value in *val.
4827 int isl_set_fast_dim_is_fixed(struct isl_set *set, unsigned dim, isl_int *val)
4829 return isl_set_fast_has_fixed_var(set, isl_set_n_param(set) + dim, val);
4832 /* Check if input variable in has fixed value and if so and if val is not NULL,
4833 * then return this fixed value in *val.
4835 int isl_map_fast_input_is_fixed(struct isl_map *map, unsigned in, isl_int *val)
4837 return isl_map_fast_has_fixed_var(map, isl_map_n_param(map) + in, val);
4840 /* Check if dimension dim has an (obvious) fixed lower bound and if so
4841 * and if val is not NULL, then return this lower bound in *val.
4843 int isl_basic_set_fast_dim_has_fixed_lower_bound(struct isl_basic_set *bset,
4844 unsigned dim, isl_int *val)
4846 int i, i_eq = -1, i_ineq = -1;
4853 total = isl_basic_set_total_dim(bset);
4854 nparam = isl_basic_set_n_param(bset);
4855 for (i = 0; i < bset->n_eq; ++i) {
4856 if (isl_int_is_zero(bset->eq[i][1+nparam+dim]))
4862 for (i = 0; i < bset->n_ineq; ++i) {
4863 if (!isl_int_is_pos(bset->ineq[i][1+nparam+dim]))
4865 if (i_eq != -1 || i_ineq != -1)
4869 if (i_eq == -1 && i_ineq == -1)
4871 c = i_eq != -1 ? bset->eq[i_eq] : bset->ineq[i_ineq];
4872 /* The coefficient should always be one due to normalization. */
4873 if (!isl_int_is_one(c[1+nparam+dim]))
4875 if (isl_seq_first_non_zero(c+1, nparam+dim) != -1)
4877 if (isl_seq_first_non_zero(c+1+nparam+dim+1,
4878 total - nparam - dim - 1) != -1)
4881 isl_int_neg(*val, c[0]);
4885 int isl_set_fast_dim_has_fixed_lower_bound(struct isl_set *set,
4886 unsigned dim, isl_int *val)
4898 return isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[0],
4902 fixed = isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[0],
4904 for (i = 1; fixed == 1 && i < set->n; ++i) {
4905 fixed = isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[i],
4907 if (fixed == 1 && isl_int_ne(tmp, v))
4911 isl_int_set(*val, v);
4922 static int qsort_constraint_cmp(const void *p1, const void *p2)
4924 const struct constraint *c1 = (const struct constraint *)p1;
4925 const struct constraint *c2 = (const struct constraint *)p2;
4926 unsigned size = isl_min(c1->size, c2->size);
4927 return isl_seq_cmp(c1->c, c2->c, size);
4930 static struct isl_basic_map *isl_basic_map_sort_constraints(
4931 struct isl_basic_map *bmap)
4934 struct constraint *c;
4939 total = isl_basic_map_total_dim(bmap);
4940 c = isl_alloc_array(bmap->ctx, struct constraint, bmap->n_ineq);
4943 for (i = 0; i < bmap->n_ineq; ++i) {
4945 c[i].c = bmap->ineq[i];
4947 qsort(c, bmap->n_ineq, sizeof(struct constraint), qsort_constraint_cmp);
4948 for (i = 0; i < bmap->n_ineq; ++i)
4949 bmap->ineq[i] = c[i].c;
4953 isl_basic_map_free(bmap);
4957 struct isl_basic_map *isl_basic_map_normalize(struct isl_basic_map *bmap)
4961 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_NORMALIZED))
4963 bmap = isl_basic_map_convex_hull(bmap);
4964 bmap = isl_basic_map_sort_constraints(bmap);
4965 ISL_F_SET(bmap, ISL_BASIC_MAP_NORMALIZED);
4969 struct isl_basic_set *isl_basic_set_normalize(struct isl_basic_set *bset)
4971 return (struct isl_basic_set *)isl_basic_map_normalize(
4972 (struct isl_basic_map *)bset);
4975 static int isl_basic_map_fast_cmp(const struct isl_basic_map *bmap1,
4976 const struct isl_basic_map *bmap2)
4983 if (isl_basic_map_n_param(bmap1) != isl_basic_map_n_param(bmap2))
4984 return isl_basic_map_n_param(bmap1) - isl_basic_map_n_param(bmap2);
4985 if (isl_basic_map_n_in(bmap1) != isl_basic_map_n_in(bmap2))
4986 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
4987 if (isl_basic_map_n_out(bmap1) != isl_basic_map_n_out(bmap2))
4988 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
4989 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY) &&
4990 ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
4992 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY))
4994 if (ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
4996 if (bmap1->n_eq != bmap2->n_eq)
4997 return bmap1->n_eq - bmap2->n_eq;
4998 if (bmap1->n_ineq != bmap2->n_ineq)
4999 return bmap1->n_ineq - bmap2->n_ineq;
5000 if (bmap1->n_div != bmap2->n_div)
5001 return bmap1->n_div - bmap2->n_div;
5002 total = isl_basic_map_total_dim(bmap1);
5003 for (i = 0; i < bmap1->n_eq; ++i) {
5004 cmp = isl_seq_cmp(bmap1->eq[i], bmap2->eq[i], 1+total);
5008 for (i = 0; i < bmap1->n_ineq; ++i) {
5009 cmp = isl_seq_cmp(bmap1->ineq[i], bmap2->ineq[i], 1+total);
5013 for (i = 0; i < bmap1->n_div; ++i) {
5014 cmp = isl_seq_cmp(bmap1->div[i], bmap2->div[i], 1+1+total);
5021 static int isl_basic_map_fast_is_equal(struct isl_basic_map *bmap1,
5022 struct isl_basic_map *bmap2)
5024 return isl_basic_map_fast_cmp(bmap1, bmap2) == 0;
5027 static int qsort_bmap_cmp(const void *p1, const void *p2)
5029 const struct isl_basic_map *bmap1 = *(const struct isl_basic_map **)p1;
5030 const struct isl_basic_map *bmap2 = *(const struct isl_basic_map **)p2;
5032 return isl_basic_map_fast_cmp(bmap1, bmap2);
5035 /* We normalize in place, but if anything goes wrong we need
5036 * to return NULL, so we need to make sure we don't change the
5037 * meaning of any possible other copies of map.
5039 struct isl_map *isl_map_normalize(struct isl_map *map)
5042 struct isl_basic_map *bmap;
5046 if (ISL_F_ISSET(map, ISL_MAP_NORMALIZED))
5048 for (i = 0; i < map->n; ++i) {
5049 bmap = isl_basic_map_normalize(isl_basic_map_copy(map->p[i]));
5052 isl_basic_map_free(map->p[i]);
5055 qsort(map->p, map->n, sizeof(struct isl_basic_map *), qsort_bmap_cmp);
5056 ISL_F_SET(map, ISL_MAP_NORMALIZED);
5057 map = isl_map_remove_empty_parts(map);
5060 for (i = map->n - 1; i >= 1; --i) {
5061 if (!isl_basic_map_fast_is_equal(map->p[i-1], map->p[i]))
5063 isl_basic_map_free(map->p[i-1]);
5064 for (j = i; j < map->n; ++j)
5065 map->p[j-1] = map->p[j];
5075 struct isl_set *isl_set_normalize(struct isl_set *set)
5077 return (struct isl_set *)isl_map_normalize((struct isl_map *)set);
5080 int isl_map_fast_is_equal(struct isl_map *map1, struct isl_map *map2)
5090 if (!isl_dim_equal(map1->dim, map2->dim))
5093 map1 = isl_map_copy(map1);
5094 map2 = isl_map_copy(map2);
5095 map1 = isl_map_normalize(map1);
5096 map2 = isl_map_normalize(map2);
5099 equal = map1->n == map2->n;
5100 for (i = 0; equal && i < map1->n; ++i) {
5101 equal = isl_basic_map_fast_is_equal(map1->p[i], map2->p[i]);
5114 int isl_set_fast_is_equal(struct isl_set *set1, struct isl_set *set2)
5116 return isl_map_fast_is_equal((struct isl_map *)set1,
5117 (struct isl_map *)set2);
5120 /* Return an interval that ranges from min to max (inclusive)
5122 struct isl_basic_set *isl_basic_set_interval(struct isl_ctx *ctx,
5123 isl_int min, isl_int max)
5126 struct isl_basic_set *bset = NULL;
5128 bset = isl_basic_set_alloc(ctx, 0, 1, 0, 0, 2);
5132 k = isl_basic_set_alloc_inequality(bset);
5135 isl_int_set_si(bset->ineq[k][1], 1);
5136 isl_int_neg(bset->ineq[k][0], min);
5138 k = isl_basic_set_alloc_inequality(bset);
5141 isl_int_set_si(bset->ineq[k][1], -1);
5142 isl_int_set(bset->ineq[k][0], max);
5146 isl_basic_set_free(bset);
5150 /* Return the Cartesian product of the basic sets in list (in the given order).
5152 struct isl_basic_set *isl_basic_set_product(struct isl_basic_set_list *list)
5160 struct isl_basic_set *product = NULL;
5164 isl_assert(list->ctx, list->n > 0, goto error);
5165 isl_assert(list->ctx, list->p[0], goto error);
5166 nparam = isl_basic_set_n_param(list->p[0]);
5167 dim = isl_basic_set_n_dim(list->p[0]);
5168 extra = list->p[0]->n_div;
5169 n_eq = list->p[0]->n_eq;
5170 n_ineq = list->p[0]->n_ineq;
5171 for (i = 1; i < list->n; ++i) {
5172 isl_assert(list->ctx, list->p[i], goto error);
5173 isl_assert(list->ctx,
5174 nparam == isl_basic_set_n_param(list->p[i]), goto error);
5175 dim += isl_basic_set_n_dim(list->p[i]);
5176 extra += list->p[i]->n_div;
5177 n_eq += list->p[i]->n_eq;
5178 n_ineq += list->p[i]->n_ineq;
5180 product = isl_basic_set_alloc(list->ctx, nparam, dim, extra,
5185 for (i = 0; i < list->n; ++i) {
5186 isl_basic_set_add_constraints(product,
5187 isl_basic_set_copy(list->p[i]), dim);
5188 dim += isl_basic_set_n_dim(list->p[i]);
5190 isl_basic_set_list_free(list);
5193 isl_basic_set_free(product);
5194 isl_basic_set_list_free(list);
5198 struct isl_basic_map *isl_basic_map_product(
5199 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
5201 struct isl_dim *dim_result = NULL;
5202 struct isl_basic_map *bmap;
5203 unsigned in1, in2, out1, out2, nparam, total, pos;
5204 struct isl_dim_map *dim_map1, *dim_map2;
5206 if (!bmap1 || !bmap2)
5209 isl_assert(bmap1->ctx, isl_dim_match(bmap1->dim, isl_dim_param,
5210 bmap2->dim, isl_dim_param), goto error);
5211 dim_result = isl_dim_product(isl_dim_copy(bmap1->dim),
5212 isl_dim_copy(bmap2->dim));
5214 in1 = isl_basic_map_n_in(bmap1);
5215 in2 = isl_basic_map_n_in(bmap2);
5216 out1 = isl_basic_map_n_out(bmap1);
5217 out2 = isl_basic_map_n_out(bmap2);
5218 nparam = isl_basic_map_n_param(bmap1);
5220 total = nparam + in1 + in2 + out1 + out2 + bmap1->n_div + bmap2->n_div;
5221 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
5222 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
5223 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
5224 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
5225 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
5226 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos += in1);
5227 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += in2);
5228 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += out1);
5229 isl_dim_map_div(dim_map1, bmap1, pos += out2);
5230 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
5232 bmap = isl_basic_map_alloc_dim(dim_result,
5233 bmap1->n_div + bmap2->n_div,
5234 bmap1->n_eq + bmap2->n_eq,
5235 bmap1->n_ineq + bmap2->n_ineq);
5236 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
5237 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
5238 bmap = isl_basic_map_simplify(bmap);
5239 return isl_basic_map_finalize(bmap);
5241 isl_basic_map_free(bmap1);
5242 isl_basic_map_free(bmap2);
5246 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
5248 struct isl_map *isl_map_product(struct isl_map *map1, struct isl_map *map2)
5251 struct isl_map *result;
5257 isl_assert(map1->ctx, isl_dim_match(map1->dim, isl_dim_param,
5258 map2->dim, isl_dim_param), goto error);
5260 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
5261 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
5262 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
5264 result = isl_map_alloc_dim(isl_dim_product(isl_dim_copy(map1->dim),
5265 isl_dim_copy(map2->dim)),
5266 map1->n * map2->n, flags);
5269 for (i = 0; i < map1->n; ++i)
5270 for (j = 0; j < map2->n; ++j) {
5271 struct isl_basic_map *part;
5272 part = isl_basic_map_product(
5273 isl_basic_map_copy(map1->p[i]),
5274 isl_basic_map_copy(map2->p[j]));
5275 if (isl_basic_map_is_empty(part))
5276 isl_basic_map_free(part);
5278 result = isl_map_add(result, part);
5291 /* Given two set A and B, construct its Cartesian product A x B.
5293 struct isl_set *isl_set_product(struct isl_set *set1, struct isl_set *set2)
5295 return (struct isl_set *)isl_map_product((struct isl_map *)set1,
5296 (struct isl_map *)set2);
5299 uint32_t isl_basic_set_get_hash(struct isl_basic_set *bset)
5302 uint32_t hash = isl_hash_init();
5307 bset = isl_basic_set_copy(bset);
5308 bset = isl_basic_set_normalize(bset);
5311 total = isl_basic_set_total_dim(bset);
5312 isl_hash_byte(hash, bset->n_eq & 0xFF);
5313 for (i = 0; i < bset->n_eq; ++i) {
5315 c_hash = isl_seq_get_hash(bset->eq[i], 1 + total);
5316 isl_hash_hash(hash, c_hash);
5318 isl_hash_byte(hash, bset->n_ineq & 0xFF);
5319 for (i = 0; i < bset->n_ineq; ++i) {
5321 c_hash = isl_seq_get_hash(bset->ineq[i], 1 + total);
5322 isl_hash_hash(hash, c_hash);
5324 isl_hash_byte(hash, bset->n_div & 0xFF);
5325 for (i = 0; i < bset->n_div; ++i) {
5327 if (isl_int_is_zero(bset->div[i][0]))
5329 isl_hash_byte(hash, i & 0xFF);
5330 c_hash = isl_seq_get_hash(bset->div[i], 1 + 1 + total);
5331 isl_hash_hash(hash, c_hash);
5333 isl_basic_set_free(bset);
5337 uint32_t isl_set_get_hash(struct isl_set *set)
5344 set = isl_set_copy(set);
5345 set = isl_set_normalize(set);
5349 hash = isl_hash_init();
5350 for (i = 0; i < set->n; ++i) {
5352 bset_hash = isl_basic_set_get_hash(set->p[i]);
5353 isl_hash_hash(hash, bset_hash);
5361 /* Check if the value for dimension dim is completely determined
5362 * by the values of the other parameters and variables.
5363 * That is, check if dimension dim is involved in an equality.
5365 int isl_basic_set_dim_is_unique(struct isl_basic_set *bset, unsigned dim)
5372 nparam = isl_basic_set_n_param(bset);
5373 for (i = 0; i < bset->n_eq; ++i)
5374 if (!isl_int_is_zero(bset->eq[i][1 + nparam + dim]))
5379 /* Check if the value for dimension dim is completely determined
5380 * by the values of the other parameters and variables.
5381 * That is, check if dimension dim is involved in an equality
5382 * for each of the subsets.
5384 int isl_set_dim_is_unique(struct isl_set *set, unsigned dim)
5390 for (i = 0; i < set->n; ++i) {
5392 unique = isl_basic_set_dim_is_unique(set->p[i], dim);
5399 int isl_map_foreach_basic_map(__isl_keep isl_map *map,
5400 int (*fn)(__isl_take isl_basic_map *bmap, void *user), void *user)
5407 for (i = 0; i < map->n; ++i)
5408 if (fn(isl_basic_map_copy(map->p[i]), user) < 0)
5414 int isl_set_foreach_basic_set(__isl_keep isl_set *set,
5415 int (*fn)(__isl_take isl_basic_set *bset, void *user), void *user)
5422 for (i = 0; i < set->n; ++i)
5423 if (fn(isl_basic_set_copy(set->p[i]), user) < 0)
5429 __isl_give isl_map *isl_set_lifting(__isl_take isl_set *set)
5431 struct isl_dim *dim;
5432 struct isl_basic_map *bmap;
5439 set = isl_set_align_divs(set);
5444 dim = isl_set_get_dim(set);
5445 if (set->n == 0 || set->p[0]->n_div == 0) {
5447 return isl_map_identity(dim);
5450 n_div = set->p[0]->n_div;
5451 dim = isl_dim_map(dim);
5452 n_param = isl_dim_size(dim, isl_dim_param);
5453 n_set = isl_dim_size(dim, isl_dim_in);
5454 dim = isl_dim_extend(dim, n_param, n_set, n_set + n_div);
5455 bmap = isl_basic_map_alloc_dim(dim, 0, n_set, 2 * n_div);
5456 for (i = 0; i < n_set; ++i)
5457 bmap = var_equal(bmap, i);
5459 total = n_param + n_set + n_set + n_div;
5460 for (i = 0; i < n_div; ++i) {
5461 k = isl_basic_map_alloc_inequality(bmap);
5464 isl_seq_cpy(bmap->ineq[k], set->p[0]->div[i]+1, 1+n_param);
5465 isl_seq_clr(bmap->ineq[k]+1+n_param, n_set);
5466 isl_seq_cpy(bmap->ineq[k]+1+n_param+n_set,
5467 set->p[0]->div[i]+1+1+n_param, n_set + n_div);
5468 isl_int_neg(bmap->ineq[k][1+n_param+n_set+n_set+i],
5469 set->p[0]->div[i][0]);
5471 l = isl_basic_map_alloc_inequality(bmap);
5474 isl_seq_neg(bmap->ineq[l], bmap->ineq[k], 1 + total);
5475 isl_int_add(bmap->ineq[l][0], bmap->ineq[l][0],
5476 set->p[0]->div[i][0]);
5477 isl_int_sub_ui(bmap->ineq[l][0], bmap->ineq[l][0], 1);
5481 return isl_map_from_basic_map(bmap);
5484 isl_basic_map_free(bmap);
5488 int isl_basic_set_size(__isl_keep isl_basic_set *bset)
5496 dim = isl_basic_set_total_dim(bset);
5497 size += bset->n_eq * (1 + dim);
5498 size += bset->n_ineq * (1 + dim);
5499 size += bset->n_div * (2 + dim);
5504 int isl_set_size(__isl_keep isl_set *set)
5512 for (i = 0; i < set->n; ++i)
5513 size += isl_basic_set_size(set->p[i]);