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_set *isl_basic_set_add_eq(__isl_take isl_basic_set *bset,
648 bset = isl_basic_set_extend_constraints(bset, 1, 0);
651 k = isl_basic_set_alloc_equality(bset);
654 isl_seq_cpy(bset->eq[k], eq, 1 + isl_basic_set_total_dim(bset));
657 isl_basic_set_free(bset);
661 __isl_give isl_basic_set *isl_basic_set_add_ineq(__isl_take isl_basic_set *bset,
666 bset = isl_basic_set_extend_constraints(bset, 0, 1);
669 k = isl_basic_set_alloc_inequality(bset);
672 isl_seq_cpy(bset->ineq[k], ineq, 1 + isl_basic_set_total_dim(bset));
675 isl_basic_set_free(bset);
679 int isl_basic_map_alloc_div(struct isl_basic_map *bmap)
683 isl_assert(bmap->ctx, bmap->n_div < bmap->extra, return -1);
684 isl_seq_clr(bmap->div[bmap->n_div] +
685 1 + 1 + isl_basic_map_total_dim(bmap),
686 bmap->extra - bmap->n_div);
687 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
688 return bmap->n_div++;
691 int isl_basic_set_alloc_div(struct isl_basic_set *bset)
693 return isl_basic_map_alloc_div((struct isl_basic_map *)bset);
696 int isl_basic_map_free_div(struct isl_basic_map *bmap, unsigned n)
700 isl_assert(bmap->ctx, n <= bmap->n_div, return -1);
705 int isl_basic_set_free_div(struct isl_basic_set *bset, unsigned n)
707 return isl_basic_map_free_div((struct isl_basic_map *)bset, n);
710 /* Copy constraint from src to dst, putting the vars of src at offset
711 * dim_off in dst and the divs of src at offset div_off in dst.
712 * If both sets are actually map, then dim_off applies to the input
715 static void copy_constraint(struct isl_basic_map *dst_map, isl_int *dst,
716 struct isl_basic_map *src_map, isl_int *src,
717 unsigned in_off, unsigned out_off, unsigned div_off)
719 unsigned src_nparam = isl_basic_map_n_param(src_map);
720 unsigned dst_nparam = isl_basic_map_n_param(dst_map);
721 unsigned src_in = isl_basic_map_n_in(src_map);
722 unsigned dst_in = isl_basic_map_n_in(dst_map);
723 unsigned src_out = isl_basic_map_n_out(src_map);
724 unsigned dst_out = isl_basic_map_n_out(dst_map);
725 isl_int_set(dst[0], src[0]);
726 isl_seq_cpy(dst+1, src+1, isl_min(dst_nparam, src_nparam));
727 if (dst_nparam > src_nparam)
728 isl_seq_clr(dst+1+src_nparam,
729 dst_nparam - src_nparam);
730 isl_seq_clr(dst+1+dst_nparam, in_off);
731 isl_seq_cpy(dst+1+dst_nparam+in_off,
733 isl_min(dst_in-in_off, src_in));
734 if (dst_in-in_off > src_in)
735 isl_seq_clr(dst+1+dst_nparam+in_off+src_in,
736 dst_in - in_off - src_in);
737 isl_seq_clr(dst+1+dst_nparam+dst_in, out_off);
738 isl_seq_cpy(dst+1+dst_nparam+dst_in+out_off,
739 src+1+src_nparam+src_in,
740 isl_min(dst_out-out_off, src_out));
741 if (dst_out-out_off > src_out)
742 isl_seq_clr(dst+1+dst_nparam+dst_in+out_off+src_out,
743 dst_out - out_off - src_out);
744 isl_seq_clr(dst+1+dst_nparam+dst_in+dst_out, div_off);
745 isl_seq_cpy(dst+1+dst_nparam+dst_in+dst_out+div_off,
746 src+1+src_nparam+src_in+src_out,
747 isl_min(dst_map->extra-div_off, src_map->n_div));
748 if (dst_map->n_div-div_off > src_map->n_div)
749 isl_seq_clr(dst+1+dst_nparam+dst_in+dst_out+
750 div_off+src_map->n_div,
751 dst_map->n_div - div_off - src_map->n_div);
754 static void copy_div(struct isl_basic_map *dst_map, isl_int *dst,
755 struct isl_basic_map *src_map, isl_int *src,
756 unsigned in_off, unsigned out_off, unsigned div_off)
758 isl_int_set(dst[0], src[0]);
759 copy_constraint(dst_map, dst+1, src_map, src+1, in_off, out_off, div_off);
762 static struct isl_basic_map *add_constraints(struct isl_basic_map *bmap1,
763 struct isl_basic_map *bmap2, unsigned i_pos, unsigned o_pos)
768 if (!bmap1 || !bmap2)
771 div_off = bmap1->n_div;
773 for (i = 0; i < bmap2->n_eq; ++i) {
774 int i1 = isl_basic_map_alloc_equality(bmap1);
777 copy_constraint(bmap1, bmap1->eq[i1], bmap2, bmap2->eq[i],
778 i_pos, o_pos, div_off);
781 for (i = 0; i < bmap2->n_ineq; ++i) {
782 int i1 = isl_basic_map_alloc_inequality(bmap1);
785 copy_constraint(bmap1, bmap1->ineq[i1], bmap2, bmap2->ineq[i],
786 i_pos, o_pos, div_off);
789 for (i = 0; i < bmap2->n_div; ++i) {
790 int i1 = isl_basic_map_alloc_div(bmap1);
793 copy_div(bmap1, bmap1->div[i1], bmap2, bmap2->div[i],
794 i_pos, o_pos, div_off);
797 isl_basic_map_free(bmap2);
802 isl_basic_map_free(bmap1);
803 isl_basic_map_free(bmap2);
807 static void copy_constraint_dim_map(isl_int *dst, isl_int *src,
808 struct isl_dim_map *dim_map)
812 for (i = 0; i < dim_map->len; ++i) {
813 if (dim_map->pos[i] < 0)
814 isl_int_set_si(dst[i], 0);
816 isl_int_set(dst[i], src[dim_map->pos[i]]);
820 static void copy_div_dim_map(isl_int *dst, isl_int *src,
821 struct isl_dim_map *dim_map)
823 isl_int_set(dst[0], src[0]);
824 copy_constraint_dim_map(dst+1, src+1, dim_map);
827 static struct isl_basic_map *add_constraints_dim_map(struct isl_basic_map *dst,
828 struct isl_basic_map *src, struct isl_dim_map *dim_map)
832 if (!src || !dst || !dim_map)
835 for (i = 0; i < src->n_eq; ++i) {
836 int i1 = isl_basic_map_alloc_equality(dst);
839 copy_constraint_dim_map(dst->eq[i1], src->eq[i], dim_map);
842 for (i = 0; i < src->n_ineq; ++i) {
843 int i1 = isl_basic_map_alloc_inequality(dst);
846 copy_constraint_dim_map(dst->ineq[i1], src->ineq[i], dim_map);
849 for (i = 0; i < src->n_div; ++i) {
850 int i1 = isl_basic_map_alloc_div(dst);
853 copy_div_dim_map(dst->div[i1], src->div[i], dim_map);
857 isl_basic_map_free(src);
862 isl_basic_map_free(src);
863 isl_basic_map_free(dst);
867 struct isl_basic_set *isl_basic_set_add_constraints(struct isl_basic_set *bset1,
868 struct isl_basic_set *bset2, unsigned pos)
870 return (struct isl_basic_set *)
871 add_constraints((struct isl_basic_map *)bset1,
872 (struct isl_basic_map *)bset2, 0, pos);
875 struct isl_basic_map *isl_basic_map_extend_dim(struct isl_basic_map *base,
876 struct isl_dim *dim, unsigned extra,
877 unsigned n_eq, unsigned n_ineq)
879 struct isl_basic_map *ext;
889 dims_ok = isl_dim_equal(base->dim, dim) &&
890 base->extra >= base->n_div + extra;
892 if (dims_ok && room_for_con(base, n_eq + n_ineq) &&
893 room_for_ineq(base, n_ineq)) {
898 isl_assert(base->ctx, base->dim->nparam <= dim->nparam, goto error);
899 isl_assert(base->ctx, base->dim->n_in <= dim->n_in, goto error);
900 isl_assert(base->ctx, base->dim->n_out <= dim->n_out, goto error);
901 extra += base->extra;
903 n_ineq += base->n_ineq;
905 ext = isl_basic_map_alloc_dim(dim, extra, n_eq, n_ineq);
911 ext->sample = isl_vec_copy(base->sample);
913 ext = add_constraints(ext, base, 0, 0);
916 ISL_F_CLR(ext, ISL_BASIC_SET_FINAL);
923 isl_basic_map_free(base);
927 struct isl_basic_set *isl_basic_set_extend_dim(struct isl_basic_set *base,
928 struct isl_dim *dim, unsigned extra,
929 unsigned n_eq, unsigned n_ineq)
931 return (struct isl_basic_set *)
932 isl_basic_map_extend_dim((struct isl_basic_map *)base, dim,
933 extra, n_eq, n_ineq);
936 struct isl_basic_map *isl_basic_map_extend_constraints(
937 struct isl_basic_map *base, unsigned n_eq, unsigned n_ineq)
941 return isl_basic_map_extend_dim(base, isl_dim_copy(base->dim),
945 struct isl_basic_map *isl_basic_map_extend(struct isl_basic_map *base,
946 unsigned nparam, unsigned n_in, unsigned n_out, unsigned extra,
947 unsigned n_eq, unsigned n_ineq)
949 struct isl_basic_map *bmap;
954 dim = isl_dim_alloc(base->ctx, nparam, n_in, n_out);
958 bmap = isl_basic_map_extend_dim(base, dim, extra, n_eq, n_ineq);
962 struct isl_basic_set *isl_basic_set_extend(struct isl_basic_set *base,
963 unsigned nparam, unsigned dim, unsigned extra,
964 unsigned n_eq, unsigned n_ineq)
966 return (struct isl_basic_set *)
967 isl_basic_map_extend((struct isl_basic_map *)base,
968 nparam, 0, dim, extra, n_eq, n_ineq);
971 struct isl_basic_set *isl_basic_set_extend_constraints(
972 struct isl_basic_set *base, unsigned n_eq, unsigned n_ineq)
974 return (struct isl_basic_set *)
975 isl_basic_map_extend_constraints((struct isl_basic_map *)base,
979 struct isl_basic_set *isl_basic_set_cow(struct isl_basic_set *bset)
981 return (struct isl_basic_set *)
982 isl_basic_map_cow((struct isl_basic_map *)bset);
985 struct isl_basic_map *isl_basic_map_cow(struct isl_basic_map *bmap)
992 bmap = isl_basic_map_dup(bmap);
994 ISL_F_CLR(bmap, ISL_BASIC_SET_FINAL);
998 struct isl_set *isl_set_cow(struct isl_set *set)
1006 return isl_set_dup(set);
1009 struct isl_map *isl_map_cow(struct isl_map *map)
1017 return isl_map_dup(map);
1020 static void swap_vars(struct isl_blk blk, isl_int *a,
1021 unsigned a_len, unsigned b_len)
1023 isl_seq_cpy(blk.data, a+a_len, b_len);
1024 isl_seq_cpy(blk.data+b_len, a, a_len);
1025 isl_seq_cpy(a, blk.data, b_len+a_len);
1028 struct isl_basic_set *isl_basic_set_swap_vars(
1029 struct isl_basic_set *bset, unsigned n)
1039 nparam = isl_basic_set_n_param(bset);
1040 dim = isl_basic_set_n_dim(bset);
1041 isl_assert(bset->ctx, n <= dim, goto error);
1046 bset = isl_basic_set_cow(bset);
1050 blk = isl_blk_alloc(bset->ctx, dim);
1051 if (isl_blk_is_error(blk))
1054 for (i = 0; i < bset->n_eq; ++i)
1056 bset->eq[i]+1+nparam, n, dim - n);
1058 for (i = 0; i < bset->n_ineq; ++i)
1060 bset->ineq[i]+1+nparam, n, dim - n);
1062 for (i = 0; i < bset->n_div; ++i)
1064 bset->div[i]+1+1+nparam, n, dim - n);
1066 isl_blk_free(bset->ctx, blk);
1068 ISL_F_CLR(bset, ISL_BASIC_SET_NORMALIZED);
1072 isl_basic_set_free(bset);
1076 struct isl_set *isl_set_swap_vars(struct isl_set *set, unsigned n)
1079 set = isl_set_cow(set);
1083 for (i = 0; i < set->n; ++i) {
1084 set->p[i] = isl_basic_set_swap_vars(set->p[i], n);
1090 ISL_F_CLR(set, ISL_SET_NORMALIZED);
1094 struct isl_basic_map *isl_basic_map_set_to_empty(struct isl_basic_map *bmap)
1100 total = isl_basic_map_total_dim(bmap);
1101 isl_basic_map_free_div(bmap, bmap->n_div);
1102 isl_basic_map_free_inequality(bmap, bmap->n_ineq);
1104 isl_basic_map_free_equality(bmap, bmap->n_eq-1);
1106 isl_basic_map_alloc_equality(bmap);
1110 isl_int_set_si(bmap->eq[i][0], 1);
1111 isl_seq_clr(bmap->eq[i]+1, total);
1112 ISL_F_SET(bmap, ISL_BASIC_MAP_EMPTY);
1113 return isl_basic_map_finalize(bmap);
1115 isl_basic_map_free(bmap);
1119 struct isl_basic_set *isl_basic_set_set_to_empty(struct isl_basic_set *bset)
1121 return (struct isl_basic_set *)
1122 isl_basic_map_set_to_empty((struct isl_basic_map *)bset);
1125 void isl_basic_map_swap_div(struct isl_basic_map *bmap, int a, int b)
1128 unsigned off = isl_dim_total(bmap->dim);
1129 isl_int *t = bmap->div[a];
1130 bmap->div[a] = bmap->div[b];
1133 for (i = 0; i < bmap->n_eq; ++i)
1134 isl_int_swap(bmap->eq[i][1+off+a], bmap->eq[i][1+off+b]);
1136 for (i = 0; i < bmap->n_ineq; ++i)
1137 isl_int_swap(bmap->ineq[i][1+off+a], bmap->ineq[i][1+off+b]);
1139 for (i = 0; i < bmap->n_div; ++i)
1140 isl_int_swap(bmap->div[i][1+1+off+a], bmap->div[i][1+1+off+b]);
1141 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1144 /* Eliminate the specified n dimensions starting at first from the
1145 * constraints using Fourier-Motzkin, The dimensions themselves
1148 struct isl_set *isl_set_eliminate_dims(struct isl_set *set,
1149 unsigned first, unsigned n)
1159 set = isl_set_cow(set);
1162 isl_assert(set->ctx, first+n <= isl_set_n_dim(set), goto error);
1163 nparam = isl_set_n_param(set);
1165 for (i = 0; i < set->n; ++i) {
1166 set->p[i] = isl_basic_set_eliminate_vars(set->p[i],
1177 /* Project out n dimensions starting at first using Fourier-Motzkin */
1178 struct isl_set *isl_set_remove_dims(struct isl_set *set,
1179 unsigned first, unsigned n)
1181 set = isl_set_eliminate_dims(set, first, n);
1182 set = isl_set_drop_dims(set, first, n);
1186 struct isl_basic_set *isl_basic_set_remove_divs(struct isl_basic_set *bset)
1188 bset = isl_basic_set_eliminate_vars(bset, isl_dim_total(bset->dim),
1196 struct isl_set *isl_set_remove_divs(struct isl_set *set)
1205 set = isl_set_cow(set);
1209 for (i = 0; i < set->n; ++i) {
1210 set->p[i] = isl_basic_set_remove_divs(set->p[i]);
1220 struct isl_basic_map *isl_basic_map_remove(struct isl_basic_map *bmap,
1221 enum isl_dim_type type, unsigned first, unsigned n)
1225 isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
1229 bmap = isl_basic_map_eliminate_vars(bmap,
1230 isl_basic_map_offset(bmap, type) - 1 + first, n);
1233 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY) && type == isl_dim_div)
1235 bmap = isl_basic_map_drop(bmap, type, first, n);
1238 isl_basic_map_free(bmap);
1242 __isl_give isl_basic_set *isl_basic_set_remove(__isl_take isl_basic_set *bset,
1243 enum isl_dim_type type, unsigned first, unsigned n)
1245 return (isl_basic_set *)
1246 isl_basic_map_remove((isl_basic_map *)bset, type, first, n);
1249 struct isl_map *isl_map_remove(struct isl_map *map,
1250 enum isl_dim_type type, unsigned first, unsigned n)
1257 map = isl_map_cow(map);
1260 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
1262 for (i = 0; i < map->n; ++i) {
1263 map->p[i] = isl_basic_map_eliminate_vars(map->p[i],
1264 isl_basic_map_offset(map->p[i], type) - 1 + first, n);
1268 map = isl_map_drop(map, type, first, n);
1275 /* Project out n inputs starting at first using Fourier-Motzkin */
1276 struct isl_map *isl_map_remove_inputs(struct isl_map *map,
1277 unsigned first, unsigned n)
1279 return isl_map_remove(map, isl_dim_in, first, n);
1282 /* Project out n dimensions starting at first using Fourier-Motzkin */
1283 struct isl_basic_set *isl_basic_set_remove_dims(struct isl_basic_set *bset,
1284 unsigned first, unsigned n)
1286 unsigned nparam = isl_basic_set_n_param(bset);
1287 bset = isl_basic_set_eliminate_vars(bset, nparam + first, n);
1288 bset = isl_basic_set_drop_dims(bset, first, n);
1292 static void dump_term(struct isl_basic_map *bmap,
1293 isl_int c, int pos, FILE *out)
1296 unsigned in = isl_basic_map_n_in(bmap);
1297 unsigned dim = in + isl_basic_map_n_out(bmap);
1298 unsigned nparam = isl_basic_map_n_param(bmap);
1300 isl_int_print(out, c, 0);
1302 if (!isl_int_is_one(c))
1303 isl_int_print(out, c, 0);
1304 if (pos < 1 + nparam) {
1305 name = isl_dim_get_name(bmap->dim,
1306 isl_dim_param, pos - 1);
1308 fprintf(out, "%s", name);
1310 fprintf(out, "p%d", pos - 1);
1311 } else if (pos < 1 + nparam + in)
1312 fprintf(out, "i%d", pos - 1 - nparam);
1313 else if (pos < 1 + nparam + dim)
1314 fprintf(out, "o%d", pos - 1 - nparam - in);
1316 fprintf(out, "e%d", pos - 1 - nparam - dim);
1320 static void dump_constraint_sign(struct isl_basic_map *bmap, isl_int *c,
1321 int sign, FILE *out)
1325 unsigned len = 1 + isl_basic_map_total_dim(bmap);
1329 for (i = 0, first = 1; i < len; ++i) {
1330 if (isl_int_sgn(c[i]) * sign <= 0)
1333 fprintf(out, " + ");
1335 isl_int_abs(v, c[i]);
1336 dump_term(bmap, v, i, out);
1343 static void dump_constraint(struct isl_basic_map *bmap, isl_int *c,
1344 const char *op, FILE *out, int indent)
1348 fprintf(out, "%*s", indent, "");
1350 dump_constraint_sign(bmap, c, 1, out);
1351 fprintf(out, " %s ", op);
1352 dump_constraint_sign(bmap, c, -1, out);
1356 for (i = bmap->n_div; i < bmap->extra; ++i) {
1357 if (isl_int_is_zero(c[1+isl_dim_total(bmap->dim)+i]))
1359 fprintf(out, "%*s", indent, "");
1360 fprintf(out, "ERROR: unused div coefficient not zero\n");
1365 static void dump_constraints(struct isl_basic_map *bmap,
1366 isl_int **c, unsigned n,
1367 const char *op, FILE *out, int indent)
1371 for (i = 0; i < n; ++i)
1372 dump_constraint(bmap, c[i], op, out, indent);
1375 static void dump_affine(struct isl_basic_map *bmap, isl_int *exp, FILE *out)
1379 unsigned total = isl_basic_map_total_dim(bmap);
1381 for (j = 0; j < 1 + total; ++j) {
1382 if (isl_int_is_zero(exp[j]))
1384 if (!first && isl_int_is_pos(exp[j]))
1386 dump_term(bmap, exp[j], j, out);
1391 static void dump(struct isl_basic_map *bmap, FILE *out, int indent)
1395 dump_constraints(bmap, bmap->eq, bmap->n_eq, "=", out, indent);
1396 dump_constraints(bmap, bmap->ineq, bmap->n_ineq, ">=", out, indent);
1398 for (i = 0; i < bmap->n_div; ++i) {
1399 fprintf(out, "%*s", indent, "");
1400 fprintf(out, "e%d = [(", i);
1401 dump_affine(bmap, bmap->div[i]+1, out);
1403 isl_int_print(out, bmap->div[i][0], 0);
1404 fprintf(out, "]\n");
1408 void isl_basic_set_dump(struct isl_basic_set *bset, FILE *out, int indent)
1411 fprintf(out, "null basic set\n");
1415 fprintf(out, "%*s", indent, "");
1416 fprintf(out, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n",
1417 bset->ref, bset->dim->nparam, bset->dim->n_out,
1418 bset->extra, bset->flags);
1419 dump((struct isl_basic_map *)bset, out, indent);
1422 void isl_basic_map_dump(struct isl_basic_map *bmap, FILE *out, int indent)
1425 fprintf(out, "null basic map\n");
1429 fprintf(out, "%*s", indent, "");
1430 fprintf(out, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, "
1431 "flags: %x, n_name: %d\n",
1433 bmap->dim->nparam, bmap->dim->n_in, bmap->dim->n_out,
1434 bmap->extra, bmap->flags, bmap->dim->n_name);
1435 dump(bmap, out, indent);
1438 int isl_inequality_negate(struct isl_basic_map *bmap, unsigned pos)
1443 total = isl_basic_map_total_dim(bmap);
1444 isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
1445 isl_seq_neg(bmap->ineq[pos], bmap->ineq[pos], 1 + total);
1446 isl_int_sub_ui(bmap->ineq[pos][0], bmap->ineq[pos][0], 1);
1447 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1451 struct isl_set *isl_set_alloc_dim(struct isl_dim *dim, int n, unsigned flags)
1453 struct isl_set *set;
1457 isl_assert(dim->ctx, dim->n_in == 0, return NULL);
1458 isl_assert(dim->ctx, n >= 0, return NULL);
1459 set = isl_alloc(dim->ctx, struct isl_set,
1460 sizeof(struct isl_set) +
1461 (n - 1) * sizeof(struct isl_basic_set *));
1465 set->ctx = dim->ctx;
1466 isl_ctx_ref(set->ctx);
1478 struct isl_set *isl_set_alloc(struct isl_ctx *ctx,
1479 unsigned nparam, unsigned dim, int n, unsigned flags)
1481 struct isl_set *set;
1482 struct isl_dim *dims;
1484 dims = isl_dim_alloc(ctx, nparam, 0, dim);
1488 set = isl_set_alloc_dim(dims, n, flags);
1492 /* Make sure "map" has room for at least "n" more basic maps.
1494 struct isl_map *isl_map_grow(struct isl_map *map, int n)
1497 struct isl_map *grown = NULL;
1501 isl_assert(map->ctx, n >= 0, goto error);
1502 if (map->n + n <= map->size)
1504 grown = isl_map_alloc_dim(isl_map_get_dim(map), map->n + n, map->flags);
1507 for (i = 0; i < map->n; ++i) {
1508 grown->p[i] = isl_basic_map_copy(map->p[i]);
1516 isl_map_free(grown);
1521 /* Make sure "set" has room for at least "n" more basic sets.
1523 struct isl_set *isl_set_grow(struct isl_set *set, int n)
1525 return (struct isl_set *)isl_map_grow((struct isl_map *)set, n);
1528 struct isl_set *isl_set_dup(struct isl_set *set)
1531 struct isl_set *dup;
1536 dup = isl_set_alloc_dim(isl_dim_copy(set->dim), set->n, set->flags);
1539 for (i = 0; i < set->n; ++i)
1540 dup = isl_set_add(dup, isl_basic_set_copy(set->p[i]));
1544 struct isl_set *isl_set_from_basic_set(struct isl_basic_set *bset)
1546 struct isl_set *set;
1551 set = isl_set_alloc_dim(isl_dim_copy(bset->dim), 1, ISL_MAP_DISJOINT);
1553 isl_basic_set_free(bset);
1556 return isl_set_add(set, bset);
1559 struct isl_map *isl_map_from_basic_map(struct isl_basic_map *bmap)
1561 struct isl_map *map;
1566 map = isl_map_alloc_dim(isl_dim_copy(bmap->dim), 1, ISL_MAP_DISJOINT);
1568 isl_basic_map_free(bmap);
1571 return isl_map_add(map, bmap);
1574 struct isl_set *isl_set_add(struct isl_set *set, struct isl_basic_set *bset)
1576 return (struct isl_set *)isl_map_add((struct isl_map *)set,
1577 (struct isl_basic_map *)bset);
1580 void isl_set_free(struct isl_set *set)
1590 isl_ctx_deref(set->ctx);
1591 for (i = 0; i < set->n; ++i)
1592 isl_basic_set_free(set->p[i]);
1593 isl_dim_free(set->dim);
1597 void isl_set_dump(struct isl_set *set, FILE *out, int indent)
1602 fprintf(out, "null set\n");
1606 fprintf(out, "%*s", indent, "");
1607 fprintf(out, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
1608 set->ref, set->n, set->dim->nparam, set->dim->n_out,
1610 for (i = 0; i < set->n; ++i) {
1611 fprintf(out, "%*s", indent, "");
1612 fprintf(out, "basic set %d:\n", i);
1613 isl_basic_set_dump(set->p[i], out, indent+4);
1617 void isl_map_dump(struct isl_map *map, FILE *out, int indent)
1622 fprintf(out, "null map\n");
1626 fprintf(out, "%*s", indent, "");
1627 fprintf(out, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, "
1628 "flags: %x, n_name: %d\n",
1629 map->ref, map->n, map->dim->nparam, map->dim->n_in,
1630 map->dim->n_out, map->flags, map->dim->n_name);
1631 for (i = 0; i < map->n; ++i) {
1632 fprintf(out, "%*s", indent, "");
1633 fprintf(out, "basic map %d:\n", i);
1634 isl_basic_map_dump(map->p[i], out, indent+4);
1638 struct isl_basic_map *isl_basic_map_intersect_domain(
1639 struct isl_basic_map *bmap, struct isl_basic_set *bset)
1641 struct isl_basic_map *bmap_domain;
1642 struct isl_dim *dim;
1647 isl_assert(bset->ctx, isl_dim_match(bmap->dim, isl_dim_param,
1648 bset->dim, isl_dim_param), goto error);
1650 if (isl_dim_size(bset->dim, isl_dim_set) != 0)
1651 isl_assert(bset->ctx,
1652 isl_basic_map_compatible_domain(bmap, bset), goto error);
1654 bmap = isl_basic_map_cow(bmap);
1655 bmap = isl_basic_map_extend_dim(bmap, isl_dim_copy(bmap->dim),
1656 bset->n_div, bset->n_eq, bset->n_ineq);
1659 dim = isl_dim_reverse(isl_dim_copy(bset->dim));
1660 bmap_domain = isl_basic_map_from_basic_set(bset, dim);
1661 bmap = add_constraints(bmap, bmap_domain, 0, 0);
1663 bmap = isl_basic_map_simplify(bmap);
1664 return isl_basic_map_finalize(bmap);
1666 isl_basic_map_free(bmap);
1667 isl_basic_set_free(bset);
1671 struct isl_basic_map *isl_basic_map_intersect_range(
1672 struct isl_basic_map *bmap, struct isl_basic_set *bset)
1674 struct isl_basic_map *bmap_range;
1679 isl_assert(bset->ctx, isl_dim_match(bmap->dim, isl_dim_param,
1680 bset->dim, isl_dim_param), goto error);
1682 if (isl_dim_size(bset->dim, isl_dim_set) != 0)
1683 isl_assert(bset->ctx,
1684 isl_basic_map_compatible_range(bmap, bset), goto error);
1686 bmap = isl_basic_map_cow(bmap);
1687 bmap = isl_basic_map_extend_dim(bmap, isl_dim_copy(bmap->dim),
1688 bset->n_div, bset->n_eq, bset->n_ineq);
1691 bmap_range = isl_basic_map_from_basic_set(bset, isl_dim_copy(bset->dim));
1692 bmap = add_constraints(bmap, bmap_range, 0, 0);
1694 bmap = isl_basic_map_simplify(bmap);
1695 return isl_basic_map_finalize(bmap);
1697 isl_basic_map_free(bmap);
1698 isl_basic_set_free(bset);
1702 static int basic_map_contains(struct isl_basic_map *bmap, struct isl_vec *vec)
1708 total = 1 + isl_basic_map_total_dim(bmap);
1709 if (total != vec->size)
1714 for (i = 0; i < bmap->n_eq; ++i) {
1715 isl_seq_inner_product(vec->el, bmap->eq[i], total, &s);
1716 if (!isl_int_is_zero(s)) {
1722 for (i = 0; i < bmap->n_ineq; ++i) {
1723 isl_seq_inner_product(vec->el, bmap->ineq[i], total, &s);
1724 if (isl_int_is_neg(s)) {
1735 int isl_basic_set_contains(struct isl_basic_set *bset, struct isl_vec *vec)
1737 return basic_map_contains((struct isl_basic_map *)bset, vec);
1740 struct isl_basic_map *isl_basic_map_intersect(
1741 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
1743 struct isl_vec *sample = NULL;
1745 if (!bmap1 || !bmap2)
1748 isl_assert(bmap1->ctx, isl_dim_match(bmap1->dim, isl_dim_param,
1749 bmap2->dim, isl_dim_param), goto error);
1750 if (isl_dim_total(bmap1->dim) ==
1751 isl_dim_size(bmap1->dim, isl_dim_param) &&
1752 isl_dim_total(bmap2->dim) !=
1753 isl_dim_size(bmap2->dim, isl_dim_param))
1754 return isl_basic_map_intersect(bmap2, bmap1);
1756 if (isl_dim_total(bmap2->dim) !=
1757 isl_dim_size(bmap2->dim, isl_dim_param))
1758 isl_assert(bmap1->ctx,
1759 isl_dim_equal(bmap1->dim, bmap2->dim), goto error);
1761 if (bmap1->sample &&
1762 basic_map_contains(bmap1, bmap1->sample) > 0 &&
1763 basic_map_contains(bmap2, bmap1->sample) > 0)
1764 sample = isl_vec_copy(bmap1->sample);
1765 else if (bmap2->sample &&
1766 basic_map_contains(bmap1, bmap2->sample) > 0 &&
1767 basic_map_contains(bmap2, bmap2->sample) > 0)
1768 sample = isl_vec_copy(bmap2->sample);
1770 bmap1 = isl_basic_map_cow(bmap1);
1771 bmap1 = isl_basic_map_extend_dim(bmap1, isl_dim_copy(bmap1->dim),
1772 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
1775 bmap1 = add_constraints(bmap1, bmap2, 0, 0);
1778 isl_vec_free(bmap1->sample);
1779 bmap1->sample = sample;
1782 bmap1 = isl_basic_map_simplify(bmap1);
1783 return isl_basic_map_finalize(bmap1);
1786 isl_vec_free(sample);
1787 isl_basic_map_free(bmap1);
1788 isl_basic_map_free(bmap2);
1792 struct isl_basic_set *isl_basic_set_intersect(
1793 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
1795 return (struct isl_basic_set *)
1796 isl_basic_map_intersect(
1797 (struct isl_basic_map *)bset1,
1798 (struct isl_basic_map *)bset2);
1801 struct isl_map *isl_map_intersect(struct isl_map *map1, struct isl_map *map2)
1804 struct isl_map *result;
1810 isl_assert(map1->ctx, isl_dim_match(map1->dim, isl_dim_param,
1811 map2->dim, isl_dim_param), goto error);
1812 if (isl_dim_total(map1->dim) ==
1813 isl_dim_size(map1->dim, isl_dim_param) &&
1814 isl_dim_total(map2->dim) != isl_dim_size(map2->dim, isl_dim_param))
1815 return isl_map_intersect(map2, map1);
1817 if (isl_dim_total(map2->dim) != isl_dim_size(map2->dim, isl_dim_param))
1818 isl_assert(map1->ctx,
1819 isl_dim_equal(map1->dim, map2->dim), goto error);
1821 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
1822 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
1823 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
1825 result = isl_map_alloc_dim(isl_dim_copy(map1->dim),
1826 map1->n * map2->n, flags);
1829 for (i = 0; i < map1->n; ++i)
1830 for (j = 0; j < map2->n; ++j) {
1831 struct isl_basic_map *part;
1832 part = isl_basic_map_intersect(
1833 isl_basic_map_copy(map1->p[i]),
1834 isl_basic_map_copy(map2->p[j]));
1835 if (isl_basic_map_is_empty(part))
1836 isl_basic_map_free(part);
1838 result = isl_map_add(result, part);
1851 struct isl_set *isl_set_intersect(struct isl_set *set1, struct isl_set *set2)
1853 return (struct isl_set *)
1854 isl_map_intersect((struct isl_map *)set1,
1855 (struct isl_map *)set2);
1858 struct isl_basic_map *isl_basic_map_reverse(struct isl_basic_map *bmap)
1860 struct isl_dim *dim;
1861 struct isl_basic_set *bset;
1866 bmap = isl_basic_map_cow(bmap);
1869 dim = isl_dim_reverse(isl_dim_copy(bmap->dim));
1870 in = isl_basic_map_n_in(bmap);
1871 bset = isl_basic_set_from_basic_map(bmap);
1872 bset = isl_basic_set_swap_vars(bset, in);
1873 return isl_basic_map_from_basic_set(bset, dim);
1876 /* Turn final n dimensions into existentially quantified variables.
1878 struct isl_basic_set *isl_basic_set_project_out(struct isl_basic_set *bset,
1879 enum isl_dim_type type, unsigned first, unsigned n)
1889 isl_assert(bset->ctx, type == isl_dim_set, goto error);
1890 isl_assert(bset->ctx, first + n == isl_basic_set_n_dim(bset), goto error);
1895 if (ISL_F_ISSET(bset, ISL_BASIC_SET_RATIONAL))
1896 return isl_basic_set_remove(bset, type, first, n);
1898 bset = isl_basic_set_cow(bset);
1900 row_size = 1 + isl_dim_total(bset->dim) + bset->extra;
1901 old = bset->block2.data;
1902 bset->block2 = isl_blk_extend(bset->ctx, bset->block2,
1903 (bset->extra + n) * (1 + row_size));
1904 if (!bset->block2.data)
1906 new_div = isl_alloc_array(ctx, isl_int *, bset->extra + n);
1909 for (i = 0; i < n; ++i) {
1910 new_div[i] = bset->block2.data +
1911 (bset->extra + i) * (1 + row_size);
1912 isl_seq_clr(new_div[i], 1 + row_size);
1914 for (i = 0; i < bset->extra; ++i)
1915 new_div[n + i] = bset->block2.data + (bset->div[i] - old);
1917 bset->div = new_div;
1920 bset->dim = isl_dim_drop_outputs(bset->dim,
1921 isl_basic_set_n_dim(bset) - n, n);
1924 bset = isl_basic_set_simplify(bset);
1925 bset = isl_basic_set_drop_redundant_divs(bset);
1926 return isl_basic_set_finalize(bset);
1928 isl_basic_set_free(bset);
1932 /* Turn final n dimensions into existentially quantified variables.
1934 __isl_give isl_set *isl_set_project_out(__isl_take isl_set *set,
1935 enum isl_dim_type type, unsigned first, unsigned n)
1942 isl_assert(set->ctx, type == isl_dim_set, goto error);
1943 isl_assert(set->ctx, first + n == isl_set_n_dim(set), goto error);
1948 set = isl_set_cow(set);
1951 set->dim = isl_dim_drop_outputs(set->dim, first, n);
1952 for (i = 0; i < set->n; ++i) {
1953 set->p[i] = isl_basic_set_project_out(set->p[i], type, first, n);
1958 ISL_F_CLR(set, ISL_SET_NORMALIZED);
1965 static struct isl_basic_map *add_divs(struct isl_basic_map *bmap, unsigned n)
1969 for (i = 0; i < n; ++i) {
1970 j = isl_basic_map_alloc_div(bmap);
1973 isl_seq_clr(bmap->div[j], 1+1+isl_basic_map_total_dim(bmap));
1977 isl_basic_map_free(bmap);
1981 struct isl_basic_map *isl_basic_map_apply_range(
1982 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
1984 struct isl_dim *dim_result = NULL;
1985 struct isl_basic_map *bmap;
1986 unsigned n_in, n_out, n, nparam, total, pos;
1987 struct isl_dim_map *dim_map1, *dim_map2;
1989 if (!bmap1 || !bmap2)
1992 dim_result = isl_dim_join(isl_dim_copy(bmap1->dim),
1993 isl_dim_copy(bmap2->dim));
1995 n_in = isl_basic_map_n_in(bmap1);
1996 n_out = isl_basic_map_n_out(bmap2);
1997 n = isl_basic_map_n_out(bmap1);
1998 nparam = isl_basic_map_n_param(bmap1);
2000 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + n;
2001 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
2002 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
2003 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
2004 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
2005 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
2006 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_in);
2007 isl_dim_map_div(dim_map1, bmap1, pos += n_out);
2008 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
2009 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
2010 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
2012 bmap = isl_basic_map_alloc_dim(dim_result,
2013 bmap1->n_div + bmap2->n_div + n,
2014 bmap1->n_eq + bmap2->n_eq,
2015 bmap1->n_ineq + bmap2->n_ineq);
2016 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
2017 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
2018 bmap = add_divs(bmap, n);
2019 bmap = isl_basic_map_simplify(bmap);
2020 bmap = isl_basic_map_drop_redundant_divs(bmap);
2021 return isl_basic_map_finalize(bmap);
2023 isl_basic_map_free(bmap1);
2024 isl_basic_map_free(bmap2);
2028 struct isl_basic_set *isl_basic_set_apply(
2029 struct isl_basic_set *bset, struct isl_basic_map *bmap)
2034 isl_assert(bset->ctx, isl_basic_map_compatible_domain(bmap, bset),
2037 return (struct isl_basic_set *)
2038 isl_basic_map_apply_range((struct isl_basic_map *)bset, bmap);
2040 isl_basic_set_free(bset);
2041 isl_basic_map_free(bmap);
2045 struct isl_basic_map *isl_basic_map_apply_domain(
2046 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2048 if (!bmap1 || !bmap2)
2051 isl_assert(bmap1->ctx,
2052 isl_basic_map_n_in(bmap1) == isl_basic_map_n_in(bmap2), goto error);
2053 isl_assert(bmap1->ctx,
2054 isl_basic_map_n_param(bmap1) == isl_basic_map_n_param(bmap2),
2057 bmap1 = isl_basic_map_reverse(bmap1);
2058 bmap1 = isl_basic_map_apply_range(bmap1, bmap2);
2059 return isl_basic_map_reverse(bmap1);
2061 isl_basic_map_free(bmap1);
2062 isl_basic_map_free(bmap2);
2066 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
2067 * A \cap B -> f(A) + f(B)
2069 struct isl_basic_map *isl_basic_map_sum(
2070 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2072 unsigned n_in, n_out, nparam, total, pos;
2073 struct isl_basic_map *bmap = NULL;
2074 struct isl_dim_map *dim_map1, *dim_map2;
2077 if (!bmap1 || !bmap2)
2080 isl_assert(bmap1->ctx, isl_dim_equal(bmap1->dim, bmap2->dim),
2083 nparam = isl_basic_map_n_param(bmap1);
2084 n_in = isl_basic_map_n_in(bmap1);
2085 n_out = isl_basic_map_n_out(bmap1);
2087 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + 2 * n_out;
2088 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
2089 dim_map2 = isl_dim_map_alloc(bmap2->ctx, total);
2090 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
2091 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos);
2092 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
2093 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
2094 isl_dim_map_div(dim_map1, bmap1, pos += n_in + n_out);
2095 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
2096 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
2097 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_out);
2099 bmap = isl_basic_map_alloc_dim(isl_dim_copy(bmap1->dim),
2100 bmap1->n_div + bmap2->n_div + 2 * n_out,
2101 bmap1->n_eq + bmap2->n_eq + n_out,
2102 bmap1->n_ineq + bmap2->n_ineq);
2103 for (i = 0; i < n_out; ++i) {
2104 int j = isl_basic_map_alloc_equality(bmap);
2107 isl_seq_clr(bmap->eq[j], 1+total);
2108 isl_int_set_si(bmap->eq[j][1+nparam+n_in+i], -1);
2109 isl_int_set_si(bmap->eq[j][1+pos+i], 1);
2110 isl_int_set_si(bmap->eq[j][1+pos-n_out+i], 1);
2112 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
2113 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
2114 bmap = add_divs(bmap, 2 * n_out);
2116 bmap = isl_basic_map_simplify(bmap);
2117 return isl_basic_map_finalize(bmap);
2119 isl_basic_map_free(bmap);
2120 isl_basic_map_free(bmap1);
2121 isl_basic_map_free(bmap2);
2125 /* Given two maps A -> f(A) and B -> g(B), construct a map
2126 * A \cap B -> f(A) + f(B)
2128 struct isl_map *isl_map_sum(struct isl_map *map1, struct isl_map *map2)
2130 struct isl_map *result;
2136 isl_assert(map1->ctx, isl_dim_equal(map1->dim, map2->dim), goto error);
2138 result = isl_map_alloc_dim(isl_dim_copy(map1->dim),
2139 map1->n * map2->n, 0);
2142 for (i = 0; i < map1->n; ++i)
2143 for (j = 0; j < map2->n; ++j) {
2144 struct isl_basic_map *part;
2145 part = isl_basic_map_sum(
2146 isl_basic_map_copy(map1->p[i]),
2147 isl_basic_map_copy(map2->p[j]));
2148 if (isl_basic_map_is_empty(part))
2149 isl_basic_map_free(part);
2151 result = isl_map_add(result, part);
2164 /* Given a basic map A -> f(A), construct A -> -f(A).
2166 struct isl_basic_map *isl_basic_map_neg(struct isl_basic_map *bmap)
2171 bmap = isl_basic_map_cow(bmap);
2175 n = isl_basic_map_dim(bmap, isl_dim_out);
2176 off = isl_basic_map_offset(bmap, isl_dim_out);
2177 for (i = 0; i < bmap->n_eq; ++i)
2178 for (j = 0; j < n; ++j)
2179 isl_int_neg(bmap->eq[i][off+j], bmap->eq[i][off+j]);
2180 for (i = 0; i < bmap->n_ineq; ++i)
2181 for (j = 0; j < n; ++j)
2182 isl_int_neg(bmap->ineq[i][off+j], bmap->ineq[i][off+j]);
2183 for (i = 0; i < bmap->n_div; ++i)
2184 for (j = 0; j < n; ++j)
2185 isl_int_neg(bmap->div[i][1+off+j], bmap->div[i][1+off+j]);
2186 return isl_basic_map_finalize(bmap);
2189 /* Given a map A -> f(A), construct A -> -f(A).
2191 struct isl_map *isl_map_neg(struct isl_map *map)
2195 map = isl_map_cow(map);
2199 for (i = 0; i < map->n; ++i) {
2200 map->p[i] = isl_basic_map_neg(map->p[i]);
2211 /* Given a basic map A -> f(A) and an integer d, construct a basic map
2212 * A -> floor(f(A)/d).
2214 struct isl_basic_map *isl_basic_map_floordiv(struct isl_basic_map *bmap,
2217 unsigned n_in, n_out, nparam, total, pos;
2218 struct isl_basic_map *result = NULL;
2219 struct isl_dim_map *dim_map;
2225 nparam = isl_basic_map_n_param(bmap);
2226 n_in = isl_basic_map_n_in(bmap);
2227 n_out = isl_basic_map_n_out(bmap);
2229 total = nparam + n_in + n_out + bmap->n_div + n_out;
2230 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2231 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_param, pos = 0);
2232 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_in, pos += nparam);
2233 isl_dim_map_div(dim_map, bmap, pos += n_in + n_out);
2234 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_out, pos += bmap->n_div);
2236 result = isl_basic_map_alloc_dim(isl_dim_copy(bmap->dim),
2237 bmap->n_div + n_out,
2238 bmap->n_eq, bmap->n_ineq + 2 * n_out);
2239 result = add_constraints_dim_map(result, bmap, dim_map);
2240 result = add_divs(result, n_out);
2241 for (i = 0; i < n_out; ++i) {
2243 j = isl_basic_map_alloc_inequality(result);
2246 isl_seq_clr(result->ineq[j], 1+total);
2247 isl_int_neg(result->ineq[j][1+nparam+n_in+i], d);
2248 isl_int_set_si(result->ineq[j][1+pos+i], 1);
2249 j = isl_basic_map_alloc_inequality(result);
2252 isl_seq_clr(result->ineq[j], 1+total);
2253 isl_int_set(result->ineq[j][1+nparam+n_in+i], d);
2254 isl_int_set_si(result->ineq[j][1+pos+i], -1);
2255 isl_int_sub_ui(result->ineq[j][0], d, 1);
2258 result = isl_basic_map_simplify(result);
2259 return isl_basic_map_finalize(result);
2261 isl_basic_map_free(result);
2265 /* Given a map A -> f(A) and an integer d, construct a map
2266 * A -> floor(f(A)/d).
2268 struct isl_map *isl_map_floordiv(struct isl_map *map, isl_int d)
2272 map = isl_map_cow(map);
2276 ISL_F_CLR(map, ISL_MAP_DISJOINT);
2277 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
2278 for (i = 0; i < map->n; ++i) {
2279 map->p[i] = isl_basic_map_floordiv(map->p[i], d);
2290 static struct isl_basic_map *var_equal(struct isl_basic_map *bmap, unsigned pos)
2296 i = isl_basic_map_alloc_equality(bmap);
2299 nparam = isl_basic_map_n_param(bmap);
2300 n_in = isl_basic_map_n_in(bmap);
2301 isl_seq_clr(bmap->eq[i], 1 + isl_basic_map_total_dim(bmap));
2302 isl_int_set_si(bmap->eq[i][1+nparam+pos], -1);
2303 isl_int_set_si(bmap->eq[i][1+nparam+n_in+pos], 1);
2304 return isl_basic_map_finalize(bmap);
2306 isl_basic_map_free(bmap);
2310 /* Add a constraints to "bmap" expressing i_pos < o_pos
2312 static struct isl_basic_map *var_less(struct isl_basic_map *bmap, unsigned pos)
2318 i = isl_basic_map_alloc_inequality(bmap);
2321 nparam = isl_basic_map_n_param(bmap);
2322 n_in = isl_basic_map_n_in(bmap);
2323 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
2324 isl_int_set_si(bmap->ineq[i][0], -1);
2325 isl_int_set_si(bmap->ineq[i][1+nparam+pos], -1);
2326 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], 1);
2327 return isl_basic_map_finalize(bmap);
2329 isl_basic_map_free(bmap);
2333 /* Add a constraints to "bmap" expressing i_pos > o_pos
2335 static struct isl_basic_map *var_more(struct isl_basic_map *bmap, unsigned pos)
2341 i = isl_basic_map_alloc_inequality(bmap);
2344 nparam = isl_basic_map_n_param(bmap);
2345 n_in = isl_basic_map_n_in(bmap);
2346 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
2347 isl_int_set_si(bmap->ineq[i][0], -1);
2348 isl_int_set_si(bmap->ineq[i][1+nparam+pos], 1);
2349 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], -1);
2350 return isl_basic_map_finalize(bmap);
2352 isl_basic_map_free(bmap);
2356 struct isl_basic_map *isl_basic_map_equal(struct isl_dim *dim, unsigned n_equal)
2359 struct isl_basic_map *bmap;
2360 bmap = isl_basic_map_alloc_dim(dim, 0, n_equal, 0);
2363 for (i = 0; i < n_equal && bmap; ++i)
2364 bmap = var_equal(bmap, i);
2365 return isl_basic_map_finalize(bmap);
2368 /* Return a relation on pairs of sets of dimension "dim" expressing i_pos < o_pos
2370 struct isl_basic_map *isl_basic_map_less_at(struct isl_dim *dim, unsigned pos)
2373 struct isl_basic_map *bmap;
2374 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
2377 for (i = 0; i < pos && bmap; ++i)
2378 bmap = var_equal(bmap, i);
2380 bmap = var_less(bmap, pos);
2381 return isl_basic_map_finalize(bmap);
2384 /* Return a relation on pairs of sets of dimension "dim" expressing i_pos > o_pos
2386 struct isl_basic_map *isl_basic_map_more_at(struct isl_dim *dim, unsigned pos)
2389 struct isl_basic_map *bmap;
2390 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
2393 for (i = 0; i < pos && bmap; ++i)
2394 bmap = var_equal(bmap, i);
2396 bmap = var_more(bmap, pos);
2397 return isl_basic_map_finalize(bmap);
2400 static __isl_give isl_map *map_lex_lte(__isl_take isl_dim *dims, int equal)
2402 struct isl_map *map;
2409 map = isl_map_alloc_dim(isl_dim_copy(dims), dim + equal, ISL_MAP_DISJOINT);
2411 for (i = 0; i < dim; ++i)
2412 map = isl_map_add(map,
2413 isl_basic_map_less_at(isl_dim_copy(dims), i));
2415 map = isl_map_add(map,
2416 isl_basic_map_equal(isl_dim_copy(dims), dim));
2422 __isl_give isl_map *isl_map_lex_lt(__isl_take isl_dim *set_dim)
2424 return map_lex_lte(isl_dim_map(set_dim), 0);
2427 __isl_give isl_map *isl_map_lex_le(__isl_take isl_dim *set_dim)
2429 return map_lex_lte(isl_dim_map(set_dim), 1);
2432 static __isl_give isl_map *map_lex_gte(__isl_take isl_dim *dims, int equal)
2434 struct isl_map *map;
2441 map = isl_map_alloc_dim(isl_dim_copy(dims), dim + equal, ISL_MAP_DISJOINT);
2443 for (i = 0; i < dim; ++i)
2444 map = isl_map_add(map,
2445 isl_basic_map_more_at(isl_dim_copy(dims), i));
2447 map = isl_map_add(map,
2448 isl_basic_map_equal(isl_dim_copy(dims), dim));
2454 __isl_give isl_map *isl_map_lex_gt(__isl_take isl_dim *set_dim)
2456 return map_lex_gte(isl_dim_map(set_dim), 0);
2459 __isl_give isl_map *isl_map_lex_ge(__isl_take isl_dim *set_dim)
2461 return map_lex_gte(isl_dim_map(set_dim), 1);
2464 struct isl_basic_map *isl_basic_map_from_basic_set(
2465 struct isl_basic_set *bset, struct isl_dim *dim)
2467 struct isl_basic_map *bmap;
2469 bset = isl_basic_set_cow(bset);
2473 isl_assert(bset->ctx, isl_dim_compatible(bset->dim, dim), goto error);
2474 isl_dim_free(bset->dim);
2475 bmap = (struct isl_basic_map *) bset;
2477 return isl_basic_map_finalize(bmap);
2479 isl_basic_set_free(bset);
2484 struct isl_basic_set *isl_basic_set_from_basic_map(struct isl_basic_map *bmap)
2488 if (bmap->dim->n_in == 0)
2489 return (struct isl_basic_set *)bmap;
2490 bmap = isl_basic_map_cow(bmap);
2493 bmap->dim = isl_dim_cow(bmap->dim);
2496 bmap->dim->n_out += bmap->dim->n_in;
2497 bmap->dim->n_in = 0;
2498 bmap = isl_basic_map_finalize(bmap);
2499 return (struct isl_basic_set *)bmap;
2501 isl_basic_map_free(bmap);
2505 /* For a div d = floor(f/m), add the constraints
2508 * -(f-(n-1)) + m d >= 0
2510 * Note that the second constraint is the negation of
2514 static int add_div_constraints(struct isl_basic_map *bmap, unsigned div)
2517 unsigned total = isl_basic_map_total_dim(bmap);
2518 unsigned div_pos = 1 + total - bmap->n_div + div;
2520 i = isl_basic_map_alloc_inequality(bmap);
2523 isl_seq_cpy(bmap->ineq[i], bmap->div[div]+1, 1+total);
2524 isl_int_neg(bmap->ineq[i][div_pos], bmap->div[div][0]);
2526 j = isl_basic_map_alloc_inequality(bmap);
2529 isl_seq_neg(bmap->ineq[j], bmap->ineq[i], 1 + total);
2530 isl_int_add(bmap->ineq[j][0], bmap->ineq[j][0], bmap->ineq[j][div_pos]);
2531 isl_int_sub_ui(bmap->ineq[j][0], bmap->ineq[j][0], 1);
2535 struct isl_basic_set *isl_basic_map_underlying_set(
2536 struct isl_basic_map *bmap)
2540 if (bmap->dim->nparam == 0 && bmap->dim->n_in == 0 && bmap->n_div == 0)
2541 return (struct isl_basic_set *)bmap;
2542 bmap = isl_basic_map_cow(bmap);
2545 bmap->dim = isl_dim_underlying(bmap->dim, bmap->n_div);
2548 bmap->extra -= bmap->n_div;
2550 bmap = isl_basic_map_finalize(bmap);
2551 return (struct isl_basic_set *)bmap;
2556 __isl_give isl_basic_set *isl_basic_set_underlying_set(
2557 __isl_take isl_basic_set *bset)
2559 return isl_basic_map_underlying_set((isl_basic_map *)bset);
2562 struct isl_basic_map *isl_basic_map_overlying_set(
2563 struct isl_basic_set *bset, struct isl_basic_map *like)
2565 struct isl_basic_map *bmap;
2566 struct isl_ctx *ctx;
2573 isl_assert(ctx, bset->n_div == 0, goto error);
2574 isl_assert(ctx, isl_basic_set_n_param(bset) == 0, goto error);
2575 isl_assert(ctx, bset->dim->n_out == isl_basic_map_total_dim(like),
2577 if (isl_dim_equal(bset->dim, like->dim) && like->n_div == 0) {
2578 isl_basic_map_free(like);
2579 return (struct isl_basic_map *)bset;
2581 bset = isl_basic_set_cow(bset);
2584 total = bset->dim->n_out + bset->extra;
2585 bmap = (struct isl_basic_map *)bset;
2586 isl_dim_free(bmap->dim);
2587 bmap->dim = isl_dim_copy(like->dim);
2590 bmap->n_div = like->n_div;
2591 bmap->extra += like->n_div;
2594 ltotal = total - bmap->extra + like->extra;
2597 bmap->block2 = isl_blk_extend(ctx, bmap->block2,
2598 bmap->extra * (1 + 1 + total));
2599 if (isl_blk_is_error(bmap->block2))
2601 bmap->div = isl_realloc_array(ctx, bmap->div, isl_int *,
2605 for (i = 0; i < bmap->extra; ++i)
2606 bmap->div[i] = bmap->block2.data + i * (1 + 1 + total);
2607 for (i = 0; i < like->n_div; ++i) {
2608 isl_seq_cpy(bmap->div[i], like->div[i], 1 + 1 + ltotal);
2609 isl_seq_clr(bmap->div[i]+1+1+ltotal, total - ltotal);
2611 bmap = isl_basic_map_extend_constraints(bmap,
2612 0, 2 * like->n_div);
2613 for (i = 0; i < like->n_div; ++i) {
2614 if (isl_int_is_zero(bmap->div[i][0]))
2616 if (add_div_constraints(bmap, i) < 0)
2620 isl_basic_map_free(like);
2621 bmap = isl_basic_map_simplify(bmap);
2622 bmap = isl_basic_map_finalize(bmap);
2625 isl_basic_map_free(like);
2626 isl_basic_set_free(bset);
2630 struct isl_basic_set *isl_basic_set_from_underlying_set(
2631 struct isl_basic_set *bset, struct isl_basic_set *like)
2633 return (struct isl_basic_set *)
2634 isl_basic_map_overlying_set(bset, (struct isl_basic_map *)like);
2637 struct isl_set *isl_set_from_underlying_set(
2638 struct isl_set *set, struct isl_basic_set *like)
2644 isl_assert(set->ctx, set->dim->n_out == isl_basic_set_total_dim(like),
2646 if (isl_dim_equal(set->dim, like->dim) && like->n_div == 0) {
2647 isl_basic_set_free(like);
2650 set = isl_set_cow(set);
2653 for (i = 0; i < set->n; ++i) {
2654 set->p[i] = isl_basic_set_from_underlying_set(set->p[i],
2655 isl_basic_set_copy(like));
2659 isl_dim_free(set->dim);
2660 set->dim = isl_dim_copy(like->dim);
2663 isl_basic_set_free(like);
2666 isl_basic_set_free(like);
2671 struct isl_set *isl_map_underlying_set(struct isl_map *map)
2675 map = isl_map_cow(map);
2678 map->dim = isl_dim_cow(map->dim);
2682 for (i = 1; i < map->n; ++i)
2683 isl_assert(map->ctx, map->p[0]->n_div == map->p[i]->n_div,
2685 for (i = 0; i < map->n; ++i) {
2686 map->p[i] = (struct isl_basic_map *)
2687 isl_basic_map_underlying_set(map->p[i]);
2692 map->dim = isl_dim_underlying(map->dim, 0);
2694 isl_dim_free(map->dim);
2695 map->dim = isl_dim_copy(map->p[0]->dim);
2699 return (struct isl_set *)map;
2705 struct isl_set *isl_set_to_underlying_set(struct isl_set *set)
2707 return (struct isl_set *)isl_map_underlying_set((struct isl_map *)set);
2710 struct isl_basic_set *isl_basic_map_domain(struct isl_basic_map *bmap)
2712 struct isl_basic_set *domain;
2717 n_in = isl_basic_map_n_in(bmap);
2718 n_out = isl_basic_map_n_out(bmap);
2719 domain = isl_basic_set_from_basic_map(bmap);
2720 return isl_basic_set_project_out(domain, isl_dim_set, n_in, n_out);
2723 struct isl_basic_set *isl_basic_map_range(struct isl_basic_map *bmap)
2725 return isl_basic_map_domain(isl_basic_map_reverse(bmap));
2728 struct isl_set *isl_map_range(struct isl_map *map)
2731 struct isl_set *set;
2735 map = isl_map_cow(map);
2739 set = (struct isl_set *) map;
2740 if (set->dim->n_in != 0) {
2741 set->dim = isl_dim_drop_inputs(set->dim, 0, set->dim->n_in);
2745 for (i = 0; i < map->n; ++i) {
2746 set->p[i] = isl_basic_map_range(map->p[i]);
2750 ISL_F_CLR(set, ISL_MAP_DISJOINT);
2751 ISL_F_CLR(set, ISL_SET_NORMALIZED);
2758 struct isl_map *isl_map_from_set(struct isl_set *set, struct isl_dim *dim)
2761 struct isl_map *map = NULL;
2763 set = isl_set_cow(set);
2766 isl_assert(set->ctx, isl_dim_compatible(set->dim, dim), goto error);
2767 map = (struct isl_map *)set;
2768 for (i = 0; i < set->n; ++i) {
2769 map->p[i] = isl_basic_map_from_basic_set(
2770 set->p[i], isl_dim_copy(dim));
2774 isl_dim_free(map->dim);
2783 struct isl_map *isl_map_from_range(struct isl_set *set)
2785 return (struct isl_map *)set;
2788 struct isl_set *isl_set_from_map(struct isl_map *map)
2791 struct isl_set *set = NULL;
2795 map = isl_map_cow(map);
2798 map->dim = isl_dim_cow(map->dim);
2801 map->dim->n_out += map->dim->n_in;
2803 set = (struct isl_set *)map;
2804 for (i = 0; i < map->n; ++i) {
2805 set->p[i] = isl_basic_set_from_basic_map(map->p[i]);
2815 struct isl_map *isl_map_alloc_dim(struct isl_dim *dim, int n, unsigned flags)
2817 struct isl_map *map;
2821 isl_assert(dim->ctx, n >= 0, return NULL);
2822 map = isl_alloc(dim->ctx, struct isl_map,
2823 sizeof(struct isl_map) +
2824 (n - 1) * sizeof(struct isl_basic_map *));
2828 map->ctx = dim->ctx;
2829 isl_ctx_ref(map->ctx);
2841 struct isl_map *isl_map_alloc(struct isl_ctx *ctx,
2842 unsigned nparam, unsigned in, unsigned out, int n,
2845 struct isl_map *map;
2846 struct isl_dim *dims;
2848 dims = isl_dim_alloc(ctx, nparam, in, out);
2852 map = isl_map_alloc_dim(dims, n, flags);
2856 struct isl_basic_map *isl_basic_map_empty(struct isl_dim *dim)
2858 struct isl_basic_map *bmap;
2859 bmap = isl_basic_map_alloc_dim(dim, 0, 1, 0);
2860 bmap = isl_basic_map_set_to_empty(bmap);
2864 struct isl_basic_set *isl_basic_set_empty(struct isl_dim *dim)
2866 struct isl_basic_set *bset;
2867 bset = isl_basic_set_alloc_dim(dim, 0, 1, 0);
2868 bset = isl_basic_set_set_to_empty(bset);
2872 struct isl_basic_map *isl_basic_map_empty_like(struct isl_basic_map *model)
2874 struct isl_basic_map *bmap;
2877 bmap = isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
2878 bmap = isl_basic_map_set_to_empty(bmap);
2882 struct isl_basic_map *isl_basic_map_empty_like_map(struct isl_map *model)
2884 struct isl_basic_map *bmap;
2887 bmap = isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
2888 bmap = isl_basic_map_set_to_empty(bmap);
2892 struct isl_basic_set *isl_basic_set_empty_like(struct isl_basic_set *model)
2894 struct isl_basic_set *bset;
2897 bset = isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
2898 bset = isl_basic_set_set_to_empty(bset);
2902 struct isl_basic_map *isl_basic_map_universe(struct isl_dim *dim)
2904 struct isl_basic_map *bmap;
2905 bmap = isl_basic_map_alloc_dim(dim, 0, 0, 0);
2909 struct isl_basic_set *isl_basic_set_universe(struct isl_dim *dim)
2911 struct isl_basic_set *bset;
2912 bset = isl_basic_set_alloc_dim(dim, 0, 0, 0);
2916 __isl_give isl_basic_map *isl_basic_map_universe_like(
2917 __isl_keep isl_basic_map *model)
2921 return isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
2924 struct isl_basic_set *isl_basic_set_universe_like(struct isl_basic_set *model)
2928 return isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
2931 __isl_give isl_basic_set *isl_basic_set_universe_like_set(
2932 __isl_keep isl_set *model)
2936 return isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
2939 struct isl_map *isl_map_empty(struct isl_dim *dim)
2941 return isl_map_alloc_dim(dim, 0, ISL_MAP_DISJOINT);
2944 struct isl_map *isl_map_empty_like(struct isl_map *model)
2948 return isl_map_alloc_dim(isl_dim_copy(model->dim), 0, ISL_MAP_DISJOINT);
2951 struct isl_map *isl_map_empty_like_basic_map(struct isl_basic_map *model)
2955 return isl_map_alloc_dim(isl_dim_copy(model->dim), 0, ISL_MAP_DISJOINT);
2958 struct isl_set *isl_set_empty(struct isl_dim *dim)
2960 return isl_set_alloc_dim(dim, 0, ISL_MAP_DISJOINT);
2963 struct isl_set *isl_set_empty_like(struct isl_set *model)
2967 return isl_set_empty(isl_dim_copy(model->dim));
2970 struct isl_map *isl_map_universe(struct isl_dim *dim)
2972 struct isl_map *map;
2975 map = isl_map_alloc_dim(isl_dim_copy(dim), 1, ISL_MAP_DISJOINT);
2976 map = isl_map_add(map, isl_basic_map_universe(dim));
2980 struct isl_set *isl_set_universe(struct isl_dim *dim)
2982 struct isl_set *set;
2985 set = isl_set_alloc_dim(isl_dim_copy(dim), 1, ISL_MAP_DISJOINT);
2986 set = isl_set_add(set, isl_basic_set_universe(dim));
2990 __isl_give isl_set *isl_set_universe_like(__isl_keep isl_set *model)
2994 return isl_set_universe(isl_dim_copy(model->dim));
2997 struct isl_map *isl_map_dup(struct isl_map *map)
3000 struct isl_map *dup;
3004 dup = isl_map_alloc_dim(isl_dim_copy(map->dim), map->n, map->flags);
3005 for (i = 0; i < map->n; ++i)
3006 dup = isl_map_add(dup, isl_basic_map_copy(map->p[i]));
3010 struct isl_map *isl_map_add(struct isl_map *map, struct isl_basic_map *bmap)
3014 if (isl_basic_map_fast_is_empty(bmap)) {
3015 isl_basic_map_free(bmap);
3018 isl_assert(map->ctx, isl_dim_equal(map->dim, bmap->dim), goto error);
3019 isl_assert(map->ctx, map->n < map->size, goto error);
3020 map->p[map->n] = bmap;
3022 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3028 isl_basic_map_free(bmap);
3032 void isl_map_free(struct isl_map *map)
3042 isl_ctx_deref(map->ctx);
3043 for (i = 0; i < map->n; ++i)
3044 isl_basic_map_free(map->p[i]);
3045 isl_dim_free(map->dim);
3049 struct isl_map *isl_map_extend(struct isl_map *base,
3050 unsigned nparam, unsigned n_in, unsigned n_out)
3054 base = isl_map_cow(base);
3058 base->dim = isl_dim_extend(base->dim, nparam, n_in, n_out);
3061 for (i = 0; i < base->n; ++i) {
3062 base->p[i] = isl_basic_map_extend_dim(base->p[i],
3063 isl_dim_copy(base->dim), 0, 0, 0);
3073 struct isl_set *isl_set_extend(struct isl_set *base,
3074 unsigned nparam, unsigned dim)
3076 return (struct isl_set *)isl_map_extend((struct isl_map *)base,
3080 static struct isl_basic_map *isl_basic_map_fix_pos_si(
3081 struct isl_basic_map *bmap, unsigned pos, int value)
3085 bmap = isl_basic_map_cow(bmap);
3086 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
3087 j = isl_basic_map_alloc_equality(bmap);
3090 isl_seq_clr(bmap->eq[j] + 1, isl_basic_map_total_dim(bmap));
3091 isl_int_set_si(bmap->eq[j][pos], -1);
3092 isl_int_set_si(bmap->eq[j][0], value);
3093 bmap = isl_basic_map_simplify(bmap);
3094 return isl_basic_map_finalize(bmap);
3096 isl_basic_map_free(bmap);
3100 static __isl_give isl_basic_map *isl_basic_map_fix_pos(
3101 __isl_take isl_basic_map *bmap, unsigned pos, isl_int value)
3105 bmap = isl_basic_map_cow(bmap);
3106 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
3107 j = isl_basic_map_alloc_equality(bmap);
3110 isl_seq_clr(bmap->eq[j] + 1, isl_basic_map_total_dim(bmap));
3111 isl_int_set_si(bmap->eq[j][pos], -1);
3112 isl_int_set(bmap->eq[j][0], value);
3113 bmap = isl_basic_map_simplify(bmap);
3114 return isl_basic_map_finalize(bmap);
3116 isl_basic_map_free(bmap);
3120 struct isl_basic_map *isl_basic_map_fix_si(struct isl_basic_map *bmap,
3121 enum isl_dim_type type, unsigned pos, int value)
3125 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
3126 return isl_basic_map_fix_pos_si(bmap,
3127 isl_basic_map_offset(bmap, type) + pos, value);
3129 isl_basic_map_free(bmap);
3133 __isl_give isl_basic_map *isl_basic_map_fix(__isl_take isl_basic_map *bmap,
3134 enum isl_dim_type type, unsigned pos, isl_int value)
3138 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
3139 return isl_basic_map_fix_pos(bmap,
3140 isl_basic_map_offset(bmap, type) + pos, value);
3142 isl_basic_map_free(bmap);
3146 struct isl_basic_set *isl_basic_set_fix_si(struct isl_basic_set *bset,
3147 enum isl_dim_type type, unsigned pos, int value)
3149 return (struct isl_basic_set *)
3150 isl_basic_map_fix_si((struct isl_basic_map *)bset,
3154 __isl_give isl_basic_set *isl_basic_set_fix(__isl_take isl_basic_set *bset,
3155 enum isl_dim_type type, unsigned pos, isl_int value)
3157 return (struct isl_basic_set *)
3158 isl_basic_map_fix((struct isl_basic_map *)bset,
3162 struct isl_basic_map *isl_basic_map_fix_input_si(struct isl_basic_map *bmap,
3163 unsigned input, int value)
3165 return isl_basic_map_fix_si(bmap, isl_dim_in, input, value);
3168 struct isl_basic_set *isl_basic_set_fix_dim_si(struct isl_basic_set *bset,
3169 unsigned dim, int value)
3171 return (struct isl_basic_set *)
3172 isl_basic_map_fix_si((struct isl_basic_map *)bset,
3173 isl_dim_set, dim, value);
3176 struct isl_map *isl_map_fix_si(struct isl_map *map,
3177 enum isl_dim_type type, unsigned pos, int value)
3181 map = isl_map_cow(map);
3185 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
3186 for (i = 0; i < map->n; ++i) {
3187 map->p[i] = isl_basic_map_fix_si(map->p[i], type, pos, value);
3191 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3198 struct isl_map *isl_map_fix_input_si(struct isl_map *map,
3199 unsigned input, int value)
3201 return isl_map_fix_si(map, isl_dim_in, input, value);
3204 struct isl_set *isl_set_fix_dim_si(struct isl_set *set, unsigned dim, int value)
3206 return (struct isl_set *)
3207 isl_map_fix_si((struct isl_map *)set, isl_dim_set, dim, value);
3210 struct isl_basic_set *isl_basic_set_lower_bound_dim(struct isl_basic_set *bset,
3211 unsigned dim, isl_int value)
3215 bset = isl_basic_set_cow(bset);
3216 bset = isl_basic_set_extend_constraints(bset, 0, 1);
3217 j = isl_basic_set_alloc_inequality(bset);
3220 isl_seq_clr(bset->ineq[j], 1 + isl_basic_set_total_dim(bset));
3221 isl_int_set_si(bset->ineq[j][1 + isl_basic_set_n_param(bset) + dim], 1);
3222 isl_int_neg(bset->ineq[j][0], value);
3223 bset = isl_basic_set_simplify(bset);
3224 return isl_basic_set_finalize(bset);
3226 isl_basic_set_free(bset);
3230 struct isl_set *isl_set_lower_bound_dim(struct isl_set *set, unsigned dim,
3235 set = isl_set_cow(set);
3239 isl_assert(set->ctx, dim < isl_set_n_dim(set), goto error);
3240 for (i = 0; i < set->n; ++i) {
3241 set->p[i] = isl_basic_set_lower_bound_dim(set->p[i], dim, value);
3251 struct isl_map *isl_map_reverse(struct isl_map *map)
3255 map = isl_map_cow(map);
3259 map->dim = isl_dim_reverse(map->dim);
3262 for (i = 0; i < map->n; ++i) {
3263 map->p[i] = isl_basic_map_reverse(map->p[i]);
3267 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3274 static struct isl_map *isl_basic_map_partial_lexopt(
3275 struct isl_basic_map *bmap, struct isl_basic_set *dom,
3276 struct isl_set **empty, int max)
3280 if (bmap->ctx->pip == ISL_PIP_PIP)
3281 return isl_pip_basic_map_lexopt(bmap, dom, empty, max);
3283 return isl_tab_basic_map_partial_lexopt(bmap, dom, empty, max);
3285 isl_basic_map_free(bmap);
3286 isl_basic_set_free(dom);
3292 struct isl_map *isl_basic_map_partial_lexmax(
3293 struct isl_basic_map *bmap, struct isl_basic_set *dom,
3294 struct isl_set **empty)
3296 return isl_basic_map_partial_lexopt(bmap, dom, empty, 1);
3299 struct isl_map *isl_basic_map_partial_lexmin(
3300 struct isl_basic_map *bmap, struct isl_basic_set *dom,
3301 struct isl_set **empty)
3303 return isl_basic_map_partial_lexopt(bmap, dom, empty, 0);
3306 struct isl_set *isl_basic_set_partial_lexmin(
3307 struct isl_basic_set *bset, struct isl_basic_set *dom,
3308 struct isl_set **empty)
3310 return (struct isl_set *)
3311 isl_basic_map_partial_lexmin((struct isl_basic_map *)bset,
3315 struct isl_set *isl_basic_set_partial_lexmax(
3316 struct isl_basic_set *bset, struct isl_basic_set *dom,
3317 struct isl_set **empty)
3319 return (struct isl_set *)
3320 isl_basic_map_partial_lexmax((struct isl_basic_map *)bset,
3324 __isl_give isl_map *isl_basic_map_lexmin(__isl_take isl_basic_map *bmap)
3326 struct isl_basic_set *dom = NULL;
3327 struct isl_map *min;
3328 struct isl_dim *dom_dim;
3332 dom_dim = isl_dim_domain(isl_dim_copy(bmap->dim));
3333 dom = isl_basic_set_universe(dom_dim);
3334 return isl_basic_map_partial_lexmin(bmap, dom, NULL);
3336 isl_basic_map_free(bmap);
3340 __isl_give isl_set *isl_basic_set_lexmin(__isl_take isl_basic_set *bset)
3342 return (isl_set *)isl_basic_map_lexmin((isl_basic_map *)bset);
3345 static struct isl_map *isl_map_reset_dim(struct isl_map *map,
3346 struct isl_dim *dim)
3353 for (i = 0; i < map->n; ++i) {
3354 isl_dim_free(map->p[i]->dim);
3355 map->p[i]->dim = isl_dim_copy(dim);
3357 isl_dim_free(map->dim);
3367 static struct isl_set *isl_set_reset_dim(struct isl_set *set,
3368 struct isl_dim *dim)
3370 return (struct isl_set *) isl_map_reset_dim((struct isl_map *)set, dim);
3373 /* Apply a preimage specified by "mat" on the parameters of "bset".
3374 * bset is assumed to have only parameters and divs.
3376 static struct isl_basic_set *basic_set_parameter_preimage(
3377 struct isl_basic_set *bset, struct isl_mat *mat)
3384 bset->dim = isl_dim_cow(bset->dim);
3388 nparam = isl_basic_set_dim(bset, isl_dim_param);
3390 isl_assert(bset->ctx, mat->n_row == 1 + nparam, goto error);
3392 bset->dim->nparam = 0;
3393 bset->dim->n_out = nparam;
3394 bset = isl_basic_set_preimage(bset, mat);
3396 bset->dim->nparam = bset->dim->n_out;
3397 bset->dim->n_out = 0;
3402 isl_basic_set_free(bset);
3406 /* Apply a preimage specified by "mat" on the parameters of "set".
3407 * set is assumed to have only parameters and divs.
3409 static struct isl_set *set_parameter_preimage(
3410 struct isl_set *set, struct isl_mat *mat)
3412 struct isl_dim *dim = NULL;
3418 dim = isl_dim_copy(set->dim);
3419 dim = isl_dim_cow(dim);
3423 nparam = isl_set_dim(set, isl_dim_param);
3425 isl_assert(set->ctx, mat->n_row == 1 + nparam, goto error);
3428 dim->n_out = nparam;
3429 isl_set_reset_dim(set, dim);
3430 set = isl_set_preimage(set, mat);
3433 dim = isl_dim_copy(set->dim);
3434 dim = isl_dim_cow(dim);
3437 dim->nparam = dim->n_out;
3439 isl_set_reset_dim(set, dim);
3449 /* Intersect the basic set "bset" with the affine space specified by the
3450 * equalities in "eq".
3452 static struct isl_basic_set *basic_set_append_equalities(
3453 struct isl_basic_set *bset, struct isl_mat *eq)
3461 bset = isl_basic_set_extend_dim(bset, isl_dim_copy(bset->dim), 0,
3466 len = 1 + isl_dim_total(bset->dim) + bset->extra;
3467 for (i = 0; i < eq->n_row; ++i) {
3468 k = isl_basic_set_alloc_equality(bset);
3471 isl_seq_cpy(bset->eq[k], eq->row[i], eq->n_col);
3472 isl_seq_clr(bset->eq[k] + eq->n_col, len - eq->n_col);
3479 isl_basic_set_free(bset);
3483 /* Intersect the set "set" with the affine space specified by the
3484 * equalities in "eq".
3486 static struct isl_set *set_append_equalities(struct isl_set *set,
3494 for (i = 0; i < set->n; ++i) {
3495 set->p[i] = basic_set_append_equalities(set->p[i],
3508 /* Project the given basic set onto its parameter domain, possibly introducing
3509 * new, explicit, existential variables in the constraints.
3510 * The input has parameters and (possibly implicit) existential variables.
3511 * The output has the same parameters, but only
3512 * explicit existentially quantified variables.
3514 * The actual projection is performed by pip, but pip doesn't seem
3515 * to like equalities very much, so we first remove the equalities
3516 * among the parameters by performing a variable compression on
3517 * the parameters. Afterward, an inverse transformation is performed
3518 * and the equalities among the parameters are inserted back in.
3520 static struct isl_set *parameter_compute_divs(struct isl_basic_set *bset)
3524 struct isl_mat *T, *T2;
3525 struct isl_set *set;
3526 unsigned nparam, n_div;
3528 bset = isl_basic_set_cow(bset);
3532 if (bset->n_eq == 0)
3533 return isl_basic_set_lexmin(bset);
3535 isl_basic_set_gauss(bset, NULL);
3537 nparam = isl_basic_set_dim(bset, isl_dim_param);
3538 n_div = isl_basic_set_dim(bset, isl_dim_div);
3540 for (i = 0, j = n_div - 1; i < bset->n_eq && j >= 0; --j) {
3541 if (!isl_int_is_zero(bset->eq[i][1 + nparam + j]))
3544 if (i == bset->n_eq)
3545 return isl_basic_set_lexmin(bset);
3547 eq = isl_mat_sub_alloc(bset->ctx, bset->eq, i, bset->n_eq - i,
3549 eq = isl_mat_cow(eq);
3550 T = isl_mat_variable_compression(isl_mat_copy(eq), &T2);
3551 bset = basic_set_parameter_preimage(bset, T);
3553 set = isl_basic_set_lexmin(bset);
3554 set = set_parameter_preimage(set, T2);
3555 set = set_append_equalities(set, eq);
3559 /* Compute an explicit representation for all the existentially
3560 * quantified variables.
3561 * The input and output dimensions are first turned into parameters.
3562 * compute_divs then returns a map with the same parameters and
3563 * no input or output dimensions and the dimension specification
3564 * is reset to that of the input.
3566 static struct isl_map *compute_divs(struct isl_basic_map *bmap)
3568 struct isl_basic_set *bset;
3569 struct isl_set *set;
3570 struct isl_map *map;
3571 struct isl_dim *dim, *orig_dim = NULL;
3576 bmap = isl_basic_map_cow(bmap);
3580 nparam = isl_basic_map_dim(bmap, isl_dim_param);
3581 n_in = isl_basic_map_dim(bmap, isl_dim_in);
3582 n_out = isl_basic_map_dim(bmap, isl_dim_out);
3583 dim = isl_dim_set_alloc(bmap->ctx, nparam + n_in + n_out, 0);
3587 orig_dim = bmap->dim;
3589 bset = (struct isl_basic_set *)bmap;
3591 set = parameter_compute_divs(bset);
3592 map = (struct isl_map *)set;
3593 map = isl_map_reset_dim(map, orig_dim);
3597 isl_basic_map_free(bmap);
3601 static int basic_map_divs_known(__isl_keep isl_basic_map *bmap)
3609 off = isl_dim_total(bmap->dim);
3610 for (i = 0; i < bmap->n_div; ++i) {
3611 if (isl_int_is_zero(bmap->div[i][0]))
3613 isl_assert(bmap->ctx, isl_int_is_zero(bmap->div[i][1+1+off+i]),
3619 static int map_divs_known(__isl_keep isl_map *map)
3626 for (i = 0; i < map->n; ++i) {
3627 int known = basic_map_divs_known(map->p[i]);
3635 /* If bmap contains any unknown divs, then compute explicit
3636 * expressions for them. However, this computation may be
3637 * quite expensive, so first try to remove divs that aren't
3640 struct isl_map *isl_basic_map_compute_divs(struct isl_basic_map *bmap)
3644 struct isl_map *map;
3646 known = basic_map_divs_known(bmap);
3650 return isl_map_from_basic_map(bmap);
3652 bmap = isl_basic_map_drop_redundant_divs(bmap);
3654 known = basic_map_divs_known(bmap);
3658 return isl_map_from_basic_map(bmap);
3660 map = compute_divs(bmap);
3663 isl_basic_map_free(bmap);
3667 struct isl_map *isl_map_compute_divs(struct isl_map *map)
3671 struct isl_map *res;
3678 known = map_divs_known(map);
3686 res = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[0]));
3687 for (i = 1 ; i < map->n; ++i) {
3689 r2 = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[i]));
3690 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT))
3691 res = isl_map_union_disjoint(res, r2);
3693 res = isl_map_union(res, r2);
3700 struct isl_set *isl_basic_set_compute_divs(struct isl_basic_set *bset)
3702 return (struct isl_set *)
3703 isl_basic_map_compute_divs((struct isl_basic_map *)bset);
3706 struct isl_set *isl_set_compute_divs(struct isl_set *set)
3708 return (struct isl_set *)
3709 isl_map_compute_divs((struct isl_map *)set);
3712 struct isl_set *isl_map_domain(struct isl_map *map)
3715 struct isl_set *set;
3720 map = isl_map_cow(map);
3724 set = (struct isl_set *)map;
3725 set->dim = isl_dim_domain(set->dim);
3728 for (i = 0; i < map->n; ++i) {
3729 set->p[i] = isl_basic_map_domain(map->p[i]);
3733 ISL_F_CLR(set, ISL_MAP_DISJOINT);
3734 ISL_F_CLR(set, ISL_SET_NORMALIZED);
3741 struct isl_map *isl_map_union_disjoint(
3742 struct isl_map *map1, struct isl_map *map2)
3746 struct isl_map *map = NULL;
3760 isl_assert(map1->ctx, isl_dim_equal(map1->dim, map2->dim), goto error);
3762 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
3763 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
3764 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
3766 map = isl_map_alloc_dim(isl_dim_copy(map1->dim),
3767 map1->n + map2->n, flags);
3770 for (i = 0; i < map1->n; ++i) {
3771 map = isl_map_add(map,
3772 isl_basic_map_copy(map1->p[i]));
3776 for (i = 0; i < map2->n; ++i) {
3777 map = isl_map_add(map,
3778 isl_basic_map_copy(map2->p[i]));
3792 struct isl_map *isl_map_union(struct isl_map *map1, struct isl_map *map2)
3794 map1 = isl_map_union_disjoint(map1, map2);
3798 ISL_F_CLR(map1, ISL_MAP_DISJOINT);
3802 struct isl_set *isl_set_union_disjoint(
3803 struct isl_set *set1, struct isl_set *set2)
3805 return (struct isl_set *)
3806 isl_map_union_disjoint(
3807 (struct isl_map *)set1, (struct isl_map *)set2);
3810 struct isl_set *isl_set_union(struct isl_set *set1, struct isl_set *set2)
3812 return (struct isl_set *)
3813 isl_map_union((struct isl_map *)set1, (struct isl_map *)set2);
3816 struct isl_map *isl_map_intersect_range(
3817 struct isl_map *map, struct isl_set *set)
3820 struct isl_map *result;
3826 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT) &&
3827 ISL_F_ISSET(set, ISL_MAP_DISJOINT))
3828 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
3830 result = isl_map_alloc_dim(isl_dim_copy(map->dim),
3831 map->n * set->n, flags);
3834 for (i = 0; i < map->n; ++i)
3835 for (j = 0; j < set->n; ++j) {
3836 result = isl_map_add(result,
3837 isl_basic_map_intersect_range(
3838 isl_basic_map_copy(map->p[i]),
3839 isl_basic_set_copy(set->p[j])));
3852 struct isl_map *isl_map_intersect_domain(
3853 struct isl_map *map, struct isl_set *set)
3855 return isl_map_reverse(
3856 isl_map_intersect_range(isl_map_reverse(map), set));
3859 struct isl_map *isl_map_apply_domain(
3860 struct isl_map *map1, struct isl_map *map2)
3864 map1 = isl_map_reverse(map1);
3865 map1 = isl_map_apply_range(map1, map2);
3866 return isl_map_reverse(map1);
3873 struct isl_map *isl_map_apply_range(
3874 struct isl_map *map1, struct isl_map *map2)
3876 struct isl_dim *dim_result;
3877 struct isl_map *result;
3883 dim_result = isl_dim_join(isl_dim_copy(map1->dim),
3884 isl_dim_copy(map2->dim));
3886 result = isl_map_alloc_dim(dim_result, map1->n * map2->n, 0);
3889 for (i = 0; i < map1->n; ++i)
3890 for (j = 0; j < map2->n; ++j) {
3891 result = isl_map_add(result,
3892 isl_basic_map_apply_range(
3893 isl_basic_map_copy(map1->p[i]),
3894 isl_basic_map_copy(map2->p[j])));
3900 if (result && result->n <= 1)
3901 ISL_F_SET(result, ISL_MAP_DISJOINT);
3910 * returns range - domain
3912 struct isl_basic_set *isl_basic_map_deltas(struct isl_basic_map *bmap)
3914 struct isl_basic_set *bset;
3921 dim = isl_basic_map_n_in(bmap);
3922 nparam = isl_basic_map_n_param(bmap);
3923 isl_assert(bmap->ctx, dim == isl_basic_map_n_out(bmap), goto error);
3924 bset = isl_basic_set_from_basic_map(bmap);
3925 bset = isl_basic_set_cow(bset);
3926 bset = isl_basic_set_extend(bset, nparam, 3*dim, 0, dim, 0);
3927 bset = isl_basic_set_swap_vars(bset, 2*dim);
3928 for (i = 0; i < dim; ++i) {
3929 int j = isl_basic_map_alloc_equality(
3930 (struct isl_basic_map *)bset);
3933 isl_seq_clr(bset->eq[j], 1 + isl_basic_set_total_dim(bset));
3934 isl_int_set_si(bset->eq[j][1+nparam+i], 1);
3935 isl_int_set_si(bset->eq[j][1+nparam+dim+i], 1);
3936 isl_int_set_si(bset->eq[j][1+nparam+2*dim+i], -1);
3938 return isl_basic_set_project_out(bset, isl_dim_set, dim, 2*dim);
3940 isl_basic_map_free(bmap);
3945 * returns range - domain
3947 struct isl_set *isl_map_deltas(struct isl_map *map)
3950 struct isl_set *result;
3955 isl_assert(map->ctx, isl_map_n_in(map) == isl_map_n_out(map), goto error);
3956 result = isl_set_alloc(map->ctx, isl_map_n_param(map),
3957 isl_map_n_in(map), map->n, map->flags);
3960 for (i = 0; i < map->n; ++i)
3961 result = isl_set_add(result,
3962 isl_basic_map_deltas(isl_basic_map_copy(map->p[i])));
3970 static struct isl_basic_map *basic_map_identity(struct isl_dim *dims)
3972 struct isl_basic_map *bmap;
3980 nparam = dims->nparam;
3982 bmap = isl_basic_map_alloc_dim(dims, 0, dim, 0);
3986 for (i = 0; i < dim; ++i) {
3987 int j = isl_basic_map_alloc_equality(bmap);
3990 isl_seq_clr(bmap->eq[j], 1 + isl_basic_map_total_dim(bmap));
3991 isl_int_set_si(bmap->eq[j][1+nparam+i], 1);
3992 isl_int_set_si(bmap->eq[j][1+nparam+dim+i], -1);
3994 return isl_basic_map_finalize(bmap);
3996 isl_basic_map_free(bmap);
4000 struct isl_basic_map *isl_basic_map_identity(struct isl_dim *set_dim)
4002 struct isl_dim *dim = isl_dim_map(set_dim);
4005 return basic_map_identity(dim);
4008 struct isl_basic_map *isl_basic_map_identity_like(struct isl_basic_map *model)
4010 if (!model || !model->dim)
4012 isl_assert(model->ctx,
4013 model->dim->n_in == model->dim->n_out, return NULL);
4014 return basic_map_identity(isl_dim_copy(model->dim));
4017 static struct isl_map *map_identity(struct isl_dim *dim)
4019 struct isl_map *map = isl_map_alloc_dim(dim, 1, ISL_MAP_DISJOINT);
4020 return isl_map_add(map, basic_map_identity(isl_dim_copy(dim)));
4023 struct isl_map *isl_map_identity(struct isl_dim *set_dim)
4025 struct isl_dim *dim = isl_dim_map(set_dim);
4028 return map_identity(dim);
4031 struct isl_map *isl_map_identity_like(struct isl_map *model)
4033 if (!model || !model->dim)
4035 isl_assert(model->ctx,
4036 model->dim->n_in == model->dim->n_out, return NULL);
4037 return map_identity(isl_dim_copy(model->dim));
4040 struct isl_map *isl_map_identity_like_basic_map(struct isl_basic_map *model)
4042 if (!model || !model->dim)
4044 isl_assert(model->ctx,
4045 model->dim->n_in == model->dim->n_out, return NULL);
4046 return map_identity(isl_dim_copy(model->dim));
4049 /* Construct a basic set with all set dimensions having only non-negative
4052 struct isl_basic_set *isl_basic_set_positive_orthant(struct isl_dim *dims)
4057 struct isl_basic_set *bset;
4061 nparam = dims->nparam;
4063 bset = isl_basic_set_alloc_dim(dims, 0, 0, dim);
4066 for (i = 0; i < dim; ++i) {
4067 int k = isl_basic_set_alloc_inequality(bset);
4070 isl_seq_clr(bset->ineq[k], 1 + isl_basic_set_total_dim(bset));
4071 isl_int_set_si(bset->ineq[k][1 + nparam + i], 1);
4075 isl_basic_set_free(bset);
4079 int isl_set_is_equal(struct isl_set *set1, struct isl_set *set2)
4081 return isl_map_is_equal((struct isl_map *)set1, (struct isl_map *)set2);
4084 int isl_set_is_subset(struct isl_set *set1, struct isl_set *set2)
4086 return isl_map_is_subset(
4087 (struct isl_map *)set1, (struct isl_map *)set2);
4090 int isl_basic_map_is_subset(
4091 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
4094 struct isl_map *map1;
4095 struct isl_map *map2;
4097 if (!bmap1 || !bmap2)
4100 map1 = isl_map_from_basic_map(isl_basic_map_copy(bmap1));
4101 map2 = isl_map_from_basic_map(isl_basic_map_copy(bmap2));
4103 is_subset = isl_map_is_subset(map1, map2);
4111 int isl_basic_map_is_equal(
4112 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
4116 if (!bmap1 || !bmap2)
4118 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
4121 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
4125 int isl_basic_set_is_equal(
4126 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
4128 return isl_basic_map_is_equal(
4129 (struct isl_basic_map *)bset1, (struct isl_basic_map *)bset2);
4132 int isl_map_is_empty(struct isl_map *map)
4139 for (i = 0; i < map->n; ++i) {
4140 is_empty = isl_basic_map_is_empty(map->p[i]);
4149 int isl_map_fast_is_empty(struct isl_map *map)
4154 int isl_set_is_empty(struct isl_set *set)
4156 return isl_map_is_empty((struct isl_map *)set);
4159 /* Return 1 if "bmap" contains a single element.
4161 int isl_basic_map_is_singleton(__isl_keep isl_basic_map *bmap)
4169 return bmap->n_eq == isl_basic_map_total_dim(bmap);
4172 /* Return 1 if "map" contains a single element.
4174 int isl_map_is_singleton(__isl_keep isl_map *map)
4181 return isl_basic_map_is_singleton(map->p[0]);
4184 /* Given a singleton basic map, extract the single element
4187 static __isl_give isl_vec *singleton_extract_point(__isl_keep isl_basic_map *bmap)
4191 struct isl_vec *point;
4197 dim = isl_basic_map_total_dim(bmap);
4198 isl_assert(bmap->ctx, bmap->n_eq == dim, return NULL);
4199 point = isl_vec_alloc(bmap->ctx, 1 + dim);
4205 isl_int_set_si(point->el[0], 1);
4206 for (j = 0; j < bmap->n_eq; ++j) {
4208 int i = dim - 1 - j;
4209 isl_assert(bmap->ctx,
4210 isl_seq_first_non_zero(bmap->eq[j] + 1, i) == -1,
4212 isl_assert(bmap->ctx,
4213 isl_int_is_one(bmap->eq[j][1 + i]) ||
4214 isl_int_is_negone(bmap->eq[j][1 + i]),
4216 isl_assert(bmap->ctx,
4217 isl_seq_first_non_zero(bmap->eq[j]+1+i+1, dim-i-1) == -1,
4220 isl_int_gcd(m, point->el[0], bmap->eq[j][1 + i]);
4221 isl_int_divexact(m, bmap->eq[j][1 + i], m);
4223 isl_seq_scale(point->el, point->el, m, 1 + i);
4224 isl_int_divexact(m, point->el[0], bmap->eq[j][1 + i]);
4226 isl_int_mul(point->el[1 + i], m, bmap->eq[j][0]);
4233 isl_vec_free(point);
4237 /* Return 1 if "bmap" contains the point "point".
4238 * "bmap" is assumed to have known divs.
4239 * The point is first extended with the divs and then passed
4240 * to basic_map_contains.
4242 static int basic_map_contains_point(__isl_keep isl_basic_map *bmap,
4243 __isl_keep isl_vec *point)
4246 struct isl_vec *vec;
4250 if (!bmap || !point)
4252 if (bmap->n_div == 0)
4253 return basic_map_contains(bmap, point);
4255 dim = isl_basic_map_total_dim(bmap) - bmap->n_div;
4256 vec = isl_vec_alloc(bmap->ctx, 1 + dim + bmap->n_div);
4260 isl_seq_cpy(vec->el, point->el, point->size);
4261 for (i = 0; i < bmap->n_div; ++i) {
4262 isl_seq_inner_product(bmap->div[i] + 1, vec->el,
4263 1 + dim + i, &vec->el[1+dim+i]);
4264 isl_int_fdiv_q(vec->el[1+dim+i], vec->el[1+dim+i],
4268 contains = basic_map_contains(bmap, vec);
4274 /* Return 1 is the singleton map "map1" is a subset of "map2",
4275 * i.e., if the single element of "map1" is also an element of "map2".
4277 static int map_is_singleton_subset(__isl_keep isl_map *map1,
4278 __isl_keep isl_map *map2)
4282 struct isl_vec *point;
4289 point = singleton_extract_point(map1->p[0]);
4293 for (i = 0; i < map2->n; ++i) {
4294 is_subset = basic_map_contains_point(map2->p[i], point);
4299 isl_vec_free(point);
4303 int isl_map_is_subset(struct isl_map *map1, struct isl_map *map2)
4306 struct isl_map *diff;
4311 if (isl_map_is_empty(map1))
4314 if (isl_map_is_empty(map2))
4317 if (isl_map_fast_is_universe(map2))
4320 map2 = isl_map_compute_divs(isl_map_copy(map2));
4321 if (isl_map_is_singleton(map1)) {
4322 is_subset = map_is_singleton_subset(map1, map2);
4326 diff = isl_map_subtract(isl_map_copy(map1), map2);
4330 is_subset = isl_map_is_empty(diff);
4336 int isl_map_is_equal(struct isl_map *map1, struct isl_map *map2)
4342 is_subset = isl_map_is_subset(map1, map2);
4345 is_subset = isl_map_is_subset(map2, map1);
4349 int isl_basic_map_is_strict_subset(
4350 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
4354 if (!bmap1 || !bmap2)
4356 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
4359 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
4360 if (is_subset == -1)
4365 int isl_map_is_strict_subset(struct isl_map *map1, struct isl_map *map2)
4371 is_subset = isl_map_is_subset(map1, map2);
4374 is_subset = isl_map_is_subset(map2, map1);
4375 if (is_subset == -1)
4380 int isl_set_is_strict_subset(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
4382 return isl_map_is_strict_subset((isl_map *)set1, (isl_map *)set2);
4385 int isl_basic_map_is_universe(struct isl_basic_map *bmap)
4389 return bmap->n_eq == 0 && bmap->n_ineq == 0;
4392 int isl_basic_set_is_universe(struct isl_basic_set *bset)
4396 return bset->n_eq == 0 && bset->n_ineq == 0;
4399 int isl_map_fast_is_universe(__isl_keep isl_map *map)
4404 return map->n == 1 && isl_basic_map_is_universe(map->p[0]);
4407 int isl_basic_map_is_empty(struct isl_basic_map *bmap)
4409 struct isl_basic_set *bset = NULL;
4410 struct isl_vec *sample = NULL;
4417 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY))
4420 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL)) {
4421 struct isl_basic_map *copy = isl_basic_map_copy(bmap);
4422 copy = isl_basic_map_convex_hull(copy);
4423 empty = ISL_F_ISSET(copy, ISL_BASIC_MAP_EMPTY);
4424 isl_basic_map_free(copy);
4428 total = 1 + isl_basic_map_total_dim(bmap);
4429 if (bmap->sample && bmap->sample->size == total) {
4430 int contains = basic_map_contains(bmap, bmap->sample);
4436 isl_vec_free(bmap->sample);
4437 bmap->sample = NULL;
4438 bset = isl_basic_map_underlying_set(isl_basic_map_copy(bmap));
4441 sample = isl_basic_set_sample_vec(bset);
4444 empty = sample->size == 0;
4445 isl_vec_free(bmap->sample);
4446 bmap->sample = sample;
4448 ISL_F_SET(bmap, ISL_BASIC_MAP_EMPTY);
4453 int isl_basic_map_fast_is_empty(struct isl_basic_map *bmap)
4457 return ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY);
4460 int isl_basic_set_fast_is_empty(struct isl_basic_set *bset)
4464 return ISL_F_ISSET(bset, ISL_BASIC_SET_EMPTY);
4467 int isl_basic_set_is_empty(struct isl_basic_set *bset)
4469 return isl_basic_map_is_empty((struct isl_basic_map *)bset);
4472 struct isl_map *isl_basic_map_union(
4473 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
4475 struct isl_map *map;
4476 if (!bmap1 || !bmap2)
4479 isl_assert(bmap1->ctx, isl_dim_equal(bmap1->dim, bmap2->dim), goto error);
4481 map = isl_map_alloc_dim(isl_dim_copy(bmap1->dim), 2, 0);
4484 map = isl_map_add(map, bmap1);
4485 map = isl_map_add(map, bmap2);
4488 isl_basic_map_free(bmap1);
4489 isl_basic_map_free(bmap2);
4493 struct isl_set *isl_basic_set_union(
4494 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
4496 return (struct isl_set *)isl_basic_map_union(
4497 (struct isl_basic_map *)bset1,
4498 (struct isl_basic_map *)bset2);
4501 /* Order divs such that any div only depends on previous divs */
4502 struct isl_basic_map *isl_basic_map_order_divs(struct isl_basic_map *bmap)
4505 unsigned off = isl_dim_total(bmap->dim);
4507 for (i = 0; i < bmap->n_div; ++i) {
4509 if (isl_int_is_zero(bmap->div[i][0]))
4511 pos = isl_seq_first_non_zero(bmap->div[i]+1+1+off+i,
4515 isl_basic_map_swap_div(bmap, i, i + pos);
4521 struct isl_basic_set *isl_basic_set_order_divs(struct isl_basic_set *bset)
4523 return (struct isl_basic_set *)
4524 isl_basic_map_order_divs((struct isl_basic_map *)bset);
4527 /* Look for a div in dst that corresponds to the div "div" in src.
4528 * The divs before "div" in src and dst are assumed to be the same.
4530 * Returns -1 if no corresponding div was found and the position
4531 * of the corresponding div in dst otherwise.
4533 static int find_div(struct isl_basic_map *dst,
4534 struct isl_basic_map *src, unsigned div)
4538 unsigned total = isl_dim_total(src->dim);
4540 isl_assert(dst->ctx, div <= dst->n_div, return -1);
4541 for (i = div; i < dst->n_div; ++i)
4542 if (isl_seq_eq(dst->div[i], src->div[div], 1+1+total+div) &&
4543 isl_seq_first_non_zero(dst->div[i]+1+1+total+div,
4544 dst->n_div - div) == -1)
4549 struct isl_basic_map *isl_basic_map_align_divs(
4550 struct isl_basic_map *dst, struct isl_basic_map *src)
4553 unsigned total = isl_dim_total(src->dim);
4558 if (src->n_div == 0)
4561 for (i = 0; i < src->n_div; ++i)
4562 isl_assert(src->ctx, !isl_int_is_zero(src->div[i][0]), goto error);
4564 src = isl_basic_map_order_divs(src);
4565 dst = isl_basic_map_cow(dst);
4566 dst = isl_basic_map_extend_dim(dst, isl_dim_copy(dst->dim),
4567 src->n_div, 0, 2 * src->n_div);
4570 for (i = 0; i < src->n_div; ++i) {
4571 int j = find_div(dst, src, i);
4573 j = isl_basic_map_alloc_div(dst);
4576 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total+i);
4577 isl_seq_clr(dst->div[j]+1+1+total+i, dst->n_div - i);
4578 if (add_div_constraints(dst, j) < 0)
4582 isl_basic_map_swap_div(dst, i, j);
4586 isl_basic_map_free(dst);
4590 struct isl_basic_set *isl_basic_set_align_divs(
4591 struct isl_basic_set *dst, struct isl_basic_set *src)
4593 return (struct isl_basic_set *)isl_basic_map_align_divs(
4594 (struct isl_basic_map *)dst, (struct isl_basic_map *)src);
4597 struct isl_map *isl_map_align_divs(struct isl_map *map)
4605 map = isl_map_compute_divs(map);
4606 map = isl_map_cow(map);
4610 for (i = 1; i < map->n; ++i)
4611 map->p[0] = isl_basic_map_align_divs(map->p[0], map->p[i]);
4612 for (i = 1; i < map->n; ++i)
4613 map->p[i] = isl_basic_map_align_divs(map->p[i], map->p[0]);
4615 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4619 struct isl_set *isl_set_align_divs(struct isl_set *set)
4621 return (struct isl_set *)isl_map_align_divs((struct isl_map *)set);
4624 static struct isl_map *add_cut_constraint(struct isl_map *dst,
4625 struct isl_basic_map *src, isl_int *c,
4626 unsigned len, int oppose)
4628 struct isl_basic_map *copy = NULL;
4633 copy = isl_basic_map_copy(src);
4634 copy = isl_basic_map_cow(copy);
4637 copy = isl_basic_map_extend_constraints(copy, 0, 1);
4638 k = isl_basic_map_alloc_inequality(copy);
4642 isl_seq_neg(copy->ineq[k], c, len);
4644 isl_seq_cpy(copy->ineq[k], c, len);
4645 total = 1 + isl_basic_map_total_dim(copy);
4646 isl_seq_clr(copy->ineq[k]+len, total - len);
4647 isl_inequality_negate(copy, k);
4648 copy = isl_basic_map_simplify(copy);
4649 copy = isl_basic_map_finalize(copy);
4650 is_empty = isl_basic_map_is_empty(copy);
4654 dst = isl_map_add(dst, copy);
4656 isl_basic_map_free(copy);
4659 isl_basic_map_free(copy);
4664 static struct isl_map *subtract(struct isl_map *map, struct isl_basic_map *bmap)
4668 struct isl_map *rest = NULL;
4670 unsigned total = isl_basic_map_total_dim(bmap);
4672 map = isl_map_cow(map);
4677 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT))
4678 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
4680 max = map->n * (2 * bmap->n_eq + bmap->n_ineq);
4681 rest = isl_map_alloc_dim(isl_dim_copy(map->dim), max, flags);
4685 for (i = 0; i < map->n; ++i) {
4686 map->p[i] = isl_basic_map_align_divs(map->p[i], bmap);
4691 for (j = 0; j < map->n; ++j)
4692 map->p[j] = isl_basic_map_cow(map->p[j]);
4694 for (i = 0; i < bmap->n_eq; ++i) {
4695 for (j = 0; j < map->n; ++j) {
4696 rest = add_cut_constraint(rest,
4697 map->p[j], bmap->eq[i], 1+total, 0);
4701 rest = add_cut_constraint(rest,
4702 map->p[j], bmap->eq[i], 1+total, 1);
4706 map->p[j] = isl_basic_map_extend_constraints(map->p[j],
4710 k = isl_basic_map_alloc_equality(map->p[j]);
4713 isl_seq_cpy(map->p[j]->eq[k], bmap->eq[i], 1+total);
4714 isl_seq_clr(map->p[j]->eq[k]+1+total,
4715 map->p[j]->n_div - bmap->n_div);
4719 for (i = 0; i < bmap->n_ineq; ++i) {
4720 for (j = 0; j < map->n; ++j) {
4721 rest = add_cut_constraint(rest,
4722 map->p[j], bmap->ineq[i], 1+total, 0);
4726 map->p[j] = isl_basic_map_extend_constraints(map->p[j],
4730 k = isl_basic_map_alloc_inequality(map->p[j]);
4733 isl_seq_cpy(map->p[j]->ineq[k], bmap->ineq[i], 1+total);
4734 isl_seq_clr(map->p[j]->ineq[k]+1+total,
4735 map->p[j]->n_div - bmap->n_div);
4747 struct isl_map *isl_map_subtract(struct isl_map *map1, struct isl_map *map2)
4753 isl_assert(map1->ctx, isl_dim_equal(map1->dim, map2->dim), goto error);
4755 if (isl_map_is_empty(map2)) {
4760 map1 = isl_map_compute_divs(map1);
4761 map2 = isl_map_compute_divs(map2);
4765 map1 = isl_map_remove_empty_parts(map1);
4766 map2 = isl_map_remove_empty_parts(map2);
4768 for (i = 0; map1 && i < map2->n; ++i)
4769 map1 = subtract(map1, map2->p[i]);
4779 struct isl_set *isl_set_subtract(struct isl_set *set1, struct isl_set *set2)
4781 return (struct isl_set *)
4783 (struct isl_map *)set1, (struct isl_map *)set2);
4786 struct isl_set *isl_set_apply(struct isl_set *set, struct isl_map *map)
4790 isl_assert(set->ctx, isl_map_compatible_domain(map, set), goto error);
4791 map = isl_map_intersect_domain(map, set);
4792 set = isl_map_range(map);
4800 /* There is no need to cow as removing empty parts doesn't change
4801 * the meaning of the set.
4803 struct isl_map *isl_map_remove_empty_parts(struct isl_map *map)
4810 for (i = map->n-1; i >= 0; --i) {
4811 if (!ISL_F_ISSET(map->p[i], ISL_BASIC_MAP_EMPTY))
4813 isl_basic_map_free(map->p[i]);
4814 if (i != map->n-1) {
4815 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4816 map->p[i] = map->p[map->n-1];
4824 struct isl_set *isl_set_remove_empty_parts(struct isl_set *set)
4826 return (struct isl_set *)
4827 isl_map_remove_empty_parts((struct isl_map *)set);
4830 struct isl_basic_map *isl_map_copy_basic_map(struct isl_map *map)
4832 struct isl_basic_map *bmap;
4833 if (!map || map->n == 0)
4835 bmap = map->p[map->n-1];
4836 isl_assert(map->ctx, ISL_F_ISSET(bmap, ISL_BASIC_SET_FINAL), return NULL);
4837 return isl_basic_map_copy(bmap);
4840 struct isl_basic_set *isl_set_copy_basic_set(struct isl_set *set)
4842 return (struct isl_basic_set *)
4843 isl_map_copy_basic_map((struct isl_map *)set);
4846 struct isl_map *isl_map_drop_basic_map(struct isl_map *map,
4847 struct isl_basic_map *bmap)
4853 for (i = map->n-1; i >= 0; --i) {
4854 if (map->p[i] != bmap)
4856 map = isl_map_cow(map);
4859 isl_basic_map_free(map->p[i]);
4860 if (i != map->n-1) {
4861 ISL_F_CLR(map, ISL_SET_NORMALIZED);
4862 map->p[i] = map->p[map->n-1];
4867 isl_basic_map_free(bmap);
4871 isl_basic_map_free(bmap);
4875 struct isl_set *isl_set_drop_basic_set(struct isl_set *set,
4876 struct isl_basic_set *bset)
4878 return (struct isl_set *)isl_map_drop_basic_map((struct isl_map *)set,
4879 (struct isl_basic_map *)bset);
4882 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
4883 * for any common value of the parameters and dimensions preceding dim
4884 * in both basic sets, the values of dimension pos in bset1 are
4885 * smaller or larger than those in bset2.
4888 * 1 if bset1 follows bset2
4889 * -1 if bset1 precedes bset2
4890 * 0 if bset1 and bset2 are incomparable
4891 * -2 if some error occurred.
4893 int isl_basic_set_compare_at(struct isl_basic_set *bset1,
4894 struct isl_basic_set *bset2, int pos)
4896 struct isl_dim *dims;
4897 struct isl_basic_map *bmap1 = NULL;
4898 struct isl_basic_map *bmap2 = NULL;
4899 struct isl_ctx *ctx;
4900 struct isl_vec *obj;
4903 unsigned dim1, dim2;
4905 enum isl_lp_result res;
4908 if (!bset1 || !bset2)
4911 nparam = isl_basic_set_n_param(bset1);
4912 dim1 = isl_basic_set_n_dim(bset1);
4913 dim2 = isl_basic_set_n_dim(bset2);
4914 dims = isl_dim_alloc(bset1->ctx, nparam, pos, dim1 - pos);
4915 bmap1 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset1), dims);
4916 dims = isl_dim_alloc(bset2->ctx, nparam, pos, dim2 - pos);
4917 bmap2 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset2), dims);
4918 if (!bmap1 || !bmap2)
4920 bmap1 = isl_basic_map_cow(bmap1);
4921 bmap1 = isl_basic_map_extend(bmap1, nparam,
4922 pos, (dim1 - pos) + (dim2 - pos),
4923 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
4924 bmap1 = add_constraints(bmap1, bmap2, 0, dim1 - pos);
4927 total = isl_basic_map_total_dim(bmap1);
4929 obj = isl_vec_alloc(ctx, 1 + total);
4930 isl_seq_clr(obj->block.data, 1 + total);
4931 isl_int_set_si(obj->block.data[1+nparam+pos], 1);
4932 isl_int_set_si(obj->block.data[1+nparam+pos+(dim1-pos)], -1);
4937 res = isl_basic_map_solve_lp(bmap1, 0, obj->block.data, ctx->one,
4939 if (res == isl_lp_empty)
4941 else if (res == isl_lp_ok && isl_int_is_pos(num))
4943 else if ((res == isl_lp_ok && isl_int_is_neg(num)) ||
4944 res == isl_lp_unbounded)
4950 isl_basic_map_free(bmap1);
4954 isl_basic_map_free(bmap1);
4955 isl_basic_map_free(bmap2);
4959 static int isl_basic_map_fast_has_fixed_var(struct isl_basic_map *bmap,
4960 unsigned pos, isl_int *val)
4968 total = isl_basic_map_total_dim(bmap);
4969 for (i = 0, d = total-1; i < bmap->n_eq && d+1 > pos; ++i) {
4970 for (; d+1 > pos; --d)
4971 if (!isl_int_is_zero(bmap->eq[i][1+d]))
4975 if (isl_seq_first_non_zero(bmap->eq[i]+1, d) != -1)
4977 if (isl_seq_first_non_zero(bmap->eq[i]+1+d+1, total-d-1) != -1)
4979 if (!isl_int_is_one(bmap->eq[i][1+d]))
4982 isl_int_neg(*val, bmap->eq[i][0]);
4988 static int isl_map_fast_has_fixed_var(struct isl_map *map,
4989 unsigned pos, isl_int *val)
5001 return isl_basic_map_fast_has_fixed_var(map->p[0], pos, val);
5004 fixed = isl_basic_map_fast_has_fixed_var(map->p[0], pos, &v);
5005 for (i = 1; fixed == 1 && i < map->n; ++i) {
5006 fixed = isl_basic_map_fast_has_fixed_var(map->p[i], pos, &tmp);
5007 if (fixed == 1 && isl_int_ne(tmp, v))
5011 isl_int_set(*val, v);
5017 static int isl_basic_set_fast_has_fixed_var(struct isl_basic_set *bset,
5018 unsigned pos, isl_int *val)
5020 return isl_basic_map_fast_has_fixed_var((struct isl_basic_map *)bset,
5024 static int isl_set_fast_has_fixed_var(struct isl_set *set, unsigned pos,
5027 return isl_map_fast_has_fixed_var((struct isl_map *)set, pos, val);
5030 int isl_basic_map_fast_is_fixed(struct isl_basic_map *bmap,
5031 enum isl_dim_type type, unsigned pos, isl_int *val)
5033 if (pos >= isl_basic_map_dim(bmap, type))
5035 return isl_basic_map_fast_has_fixed_var(bmap,
5036 isl_basic_map_offset(bmap, type) - 1 + pos, val);
5039 int isl_map_fast_is_fixed(struct isl_map *map,
5040 enum isl_dim_type type, unsigned pos, isl_int *val)
5042 if (pos >= isl_map_dim(map, type))
5044 return isl_map_fast_has_fixed_var(map,
5045 map_offset(map, type) - 1 + pos, val);
5048 /* Check if dimension dim has fixed value and if so and if val is not NULL,
5049 * then return this fixed value in *val.
5051 int isl_basic_set_fast_dim_is_fixed(struct isl_basic_set *bset, unsigned dim,
5054 return isl_basic_set_fast_has_fixed_var(bset,
5055 isl_basic_set_n_param(bset) + dim, val);
5058 /* Check if dimension dim has fixed value and if so and if val is not NULL,
5059 * then return this fixed value in *val.
5061 int isl_set_fast_dim_is_fixed(struct isl_set *set, unsigned dim, isl_int *val)
5063 return isl_set_fast_has_fixed_var(set, isl_set_n_param(set) + dim, val);
5066 /* Check if input variable in has fixed value and if so and if val is not NULL,
5067 * then return this fixed value in *val.
5069 int isl_map_fast_input_is_fixed(struct isl_map *map, unsigned in, isl_int *val)
5071 return isl_map_fast_has_fixed_var(map, isl_map_n_param(map) + in, val);
5074 /* Check if dimension dim has an (obvious) fixed lower bound and if so
5075 * and if val is not NULL, then return this lower bound in *val.
5077 int isl_basic_set_fast_dim_has_fixed_lower_bound(struct isl_basic_set *bset,
5078 unsigned dim, isl_int *val)
5080 int i, i_eq = -1, i_ineq = -1;
5087 total = isl_basic_set_total_dim(bset);
5088 nparam = isl_basic_set_n_param(bset);
5089 for (i = 0; i < bset->n_eq; ++i) {
5090 if (isl_int_is_zero(bset->eq[i][1+nparam+dim]))
5096 for (i = 0; i < bset->n_ineq; ++i) {
5097 if (!isl_int_is_pos(bset->ineq[i][1+nparam+dim]))
5099 if (i_eq != -1 || i_ineq != -1)
5103 if (i_eq == -1 && i_ineq == -1)
5105 c = i_eq != -1 ? bset->eq[i_eq] : bset->ineq[i_ineq];
5106 /* The coefficient should always be one due to normalization. */
5107 if (!isl_int_is_one(c[1+nparam+dim]))
5109 if (isl_seq_first_non_zero(c+1, nparam+dim) != -1)
5111 if (isl_seq_first_non_zero(c+1+nparam+dim+1,
5112 total - nparam - dim - 1) != -1)
5115 isl_int_neg(*val, c[0]);
5119 int isl_set_fast_dim_has_fixed_lower_bound(struct isl_set *set,
5120 unsigned dim, isl_int *val)
5132 return isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[0],
5136 fixed = isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[0],
5138 for (i = 1; fixed == 1 && i < set->n; ++i) {
5139 fixed = isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[i],
5141 if (fixed == 1 && isl_int_ne(tmp, v))
5145 isl_int_set(*val, v);
5156 static int qsort_constraint_cmp(const void *p1, const void *p2)
5158 const struct constraint *c1 = (const struct constraint *)p1;
5159 const struct constraint *c2 = (const struct constraint *)p2;
5160 unsigned size = isl_min(c1->size, c2->size);
5161 return isl_seq_cmp(c1->c, c2->c, size);
5164 static struct isl_basic_map *isl_basic_map_sort_constraints(
5165 struct isl_basic_map *bmap)
5168 struct constraint *c;
5173 total = isl_basic_map_total_dim(bmap);
5174 c = isl_alloc_array(bmap->ctx, struct constraint, bmap->n_ineq);
5177 for (i = 0; i < bmap->n_ineq; ++i) {
5179 c[i].c = bmap->ineq[i];
5181 qsort(c, bmap->n_ineq, sizeof(struct constraint), qsort_constraint_cmp);
5182 for (i = 0; i < bmap->n_ineq; ++i)
5183 bmap->ineq[i] = c[i].c;
5187 isl_basic_map_free(bmap);
5191 struct isl_basic_map *isl_basic_map_normalize(struct isl_basic_map *bmap)
5195 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_NORMALIZED))
5197 bmap = isl_basic_map_convex_hull(bmap);
5198 bmap = isl_basic_map_sort_constraints(bmap);
5199 ISL_F_SET(bmap, ISL_BASIC_MAP_NORMALIZED);
5203 struct isl_basic_set *isl_basic_set_normalize(struct isl_basic_set *bset)
5205 return (struct isl_basic_set *)isl_basic_map_normalize(
5206 (struct isl_basic_map *)bset);
5209 static int isl_basic_map_fast_cmp(const struct isl_basic_map *bmap1,
5210 const struct isl_basic_map *bmap2)
5217 if (isl_basic_map_n_param(bmap1) != isl_basic_map_n_param(bmap2))
5218 return isl_basic_map_n_param(bmap1) - isl_basic_map_n_param(bmap2);
5219 if (isl_basic_map_n_in(bmap1) != isl_basic_map_n_in(bmap2))
5220 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
5221 if (isl_basic_map_n_out(bmap1) != isl_basic_map_n_out(bmap2))
5222 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
5223 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY) &&
5224 ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
5226 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY))
5228 if (ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
5230 if (bmap1->n_eq != bmap2->n_eq)
5231 return bmap1->n_eq - bmap2->n_eq;
5232 if (bmap1->n_ineq != bmap2->n_ineq)
5233 return bmap1->n_ineq - bmap2->n_ineq;
5234 if (bmap1->n_div != bmap2->n_div)
5235 return bmap1->n_div - bmap2->n_div;
5236 total = isl_basic_map_total_dim(bmap1);
5237 for (i = 0; i < bmap1->n_eq; ++i) {
5238 cmp = isl_seq_cmp(bmap1->eq[i], bmap2->eq[i], 1+total);
5242 for (i = 0; i < bmap1->n_ineq; ++i) {
5243 cmp = isl_seq_cmp(bmap1->ineq[i], bmap2->ineq[i], 1+total);
5247 for (i = 0; i < bmap1->n_div; ++i) {
5248 cmp = isl_seq_cmp(bmap1->div[i], bmap2->div[i], 1+1+total);
5255 static int isl_basic_map_fast_is_equal(struct isl_basic_map *bmap1,
5256 struct isl_basic_map *bmap2)
5258 return isl_basic_map_fast_cmp(bmap1, bmap2) == 0;
5261 static int qsort_bmap_cmp(const void *p1, const void *p2)
5263 const struct isl_basic_map *bmap1 = *(const struct isl_basic_map **)p1;
5264 const struct isl_basic_map *bmap2 = *(const struct isl_basic_map **)p2;
5266 return isl_basic_map_fast_cmp(bmap1, bmap2);
5269 /* We normalize in place, but if anything goes wrong we need
5270 * to return NULL, so we need to make sure we don't change the
5271 * meaning of any possible other copies of map.
5273 struct isl_map *isl_map_normalize(struct isl_map *map)
5276 struct isl_basic_map *bmap;
5280 if (ISL_F_ISSET(map, ISL_MAP_NORMALIZED))
5282 for (i = 0; i < map->n; ++i) {
5283 bmap = isl_basic_map_normalize(isl_basic_map_copy(map->p[i]));
5286 isl_basic_map_free(map->p[i]);
5289 qsort(map->p, map->n, sizeof(struct isl_basic_map *), qsort_bmap_cmp);
5290 ISL_F_SET(map, ISL_MAP_NORMALIZED);
5291 map = isl_map_remove_empty_parts(map);
5294 for (i = map->n - 1; i >= 1; --i) {
5295 if (!isl_basic_map_fast_is_equal(map->p[i-1], map->p[i]))
5297 isl_basic_map_free(map->p[i-1]);
5298 for (j = i; j < map->n; ++j)
5299 map->p[j-1] = map->p[j];
5309 struct isl_set *isl_set_normalize(struct isl_set *set)
5311 return (struct isl_set *)isl_map_normalize((struct isl_map *)set);
5314 int isl_map_fast_is_equal(struct isl_map *map1, struct isl_map *map2)
5324 if (!isl_dim_equal(map1->dim, map2->dim))
5327 map1 = isl_map_copy(map1);
5328 map2 = isl_map_copy(map2);
5329 map1 = isl_map_normalize(map1);
5330 map2 = isl_map_normalize(map2);
5333 equal = map1->n == map2->n;
5334 for (i = 0; equal && i < map1->n; ++i) {
5335 equal = isl_basic_map_fast_is_equal(map1->p[i], map2->p[i]);
5348 int isl_set_fast_is_equal(struct isl_set *set1, struct isl_set *set2)
5350 return isl_map_fast_is_equal((struct isl_map *)set1,
5351 (struct isl_map *)set2);
5354 /* Return an interval that ranges from min to max (inclusive)
5356 struct isl_basic_set *isl_basic_set_interval(struct isl_ctx *ctx,
5357 isl_int min, isl_int max)
5360 struct isl_basic_set *bset = NULL;
5362 bset = isl_basic_set_alloc(ctx, 0, 1, 0, 0, 2);
5366 k = isl_basic_set_alloc_inequality(bset);
5369 isl_int_set_si(bset->ineq[k][1], 1);
5370 isl_int_neg(bset->ineq[k][0], min);
5372 k = isl_basic_set_alloc_inequality(bset);
5375 isl_int_set_si(bset->ineq[k][1], -1);
5376 isl_int_set(bset->ineq[k][0], max);
5380 isl_basic_set_free(bset);
5384 /* Return the Cartesian product of the basic sets in list (in the given order).
5386 struct isl_basic_set *isl_basic_set_product(struct isl_basic_set_list *list)
5394 struct isl_basic_set *product = NULL;
5398 isl_assert(list->ctx, list->n > 0, goto error);
5399 isl_assert(list->ctx, list->p[0], goto error);
5400 nparam = isl_basic_set_n_param(list->p[0]);
5401 dim = isl_basic_set_n_dim(list->p[0]);
5402 extra = list->p[0]->n_div;
5403 n_eq = list->p[0]->n_eq;
5404 n_ineq = list->p[0]->n_ineq;
5405 for (i = 1; i < list->n; ++i) {
5406 isl_assert(list->ctx, list->p[i], goto error);
5407 isl_assert(list->ctx,
5408 nparam == isl_basic_set_n_param(list->p[i]), goto error);
5409 dim += isl_basic_set_n_dim(list->p[i]);
5410 extra += list->p[i]->n_div;
5411 n_eq += list->p[i]->n_eq;
5412 n_ineq += list->p[i]->n_ineq;
5414 product = isl_basic_set_alloc(list->ctx, nparam, dim, extra,
5419 for (i = 0; i < list->n; ++i) {
5420 isl_basic_set_add_constraints(product,
5421 isl_basic_set_copy(list->p[i]), dim);
5422 dim += isl_basic_set_n_dim(list->p[i]);
5424 isl_basic_set_list_free(list);
5427 isl_basic_set_free(product);
5428 isl_basic_set_list_free(list);
5432 struct isl_basic_map *isl_basic_map_product(
5433 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
5435 struct isl_dim *dim_result = NULL;
5436 struct isl_basic_map *bmap;
5437 unsigned in1, in2, out1, out2, nparam, total, pos;
5438 struct isl_dim_map *dim_map1, *dim_map2;
5440 if (!bmap1 || !bmap2)
5443 isl_assert(bmap1->ctx, isl_dim_match(bmap1->dim, isl_dim_param,
5444 bmap2->dim, isl_dim_param), goto error);
5445 dim_result = isl_dim_product(isl_dim_copy(bmap1->dim),
5446 isl_dim_copy(bmap2->dim));
5448 in1 = isl_basic_map_n_in(bmap1);
5449 in2 = isl_basic_map_n_in(bmap2);
5450 out1 = isl_basic_map_n_out(bmap1);
5451 out2 = isl_basic_map_n_out(bmap2);
5452 nparam = isl_basic_map_n_param(bmap1);
5454 total = nparam + in1 + in2 + out1 + out2 + bmap1->n_div + bmap2->n_div;
5455 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
5456 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
5457 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
5458 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
5459 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
5460 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos += in1);
5461 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += in2);
5462 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += out1);
5463 isl_dim_map_div(dim_map1, bmap1, pos += out2);
5464 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
5466 bmap = isl_basic_map_alloc_dim(dim_result,
5467 bmap1->n_div + bmap2->n_div,
5468 bmap1->n_eq + bmap2->n_eq,
5469 bmap1->n_ineq + bmap2->n_ineq);
5470 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
5471 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
5472 bmap = isl_basic_map_simplify(bmap);
5473 return isl_basic_map_finalize(bmap);
5475 isl_basic_map_free(bmap1);
5476 isl_basic_map_free(bmap2);
5480 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
5482 struct isl_map *isl_map_product(struct isl_map *map1, struct isl_map *map2)
5485 struct isl_map *result;
5491 isl_assert(map1->ctx, isl_dim_match(map1->dim, isl_dim_param,
5492 map2->dim, isl_dim_param), goto error);
5494 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
5495 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
5496 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
5498 result = isl_map_alloc_dim(isl_dim_product(isl_dim_copy(map1->dim),
5499 isl_dim_copy(map2->dim)),
5500 map1->n * map2->n, flags);
5503 for (i = 0; i < map1->n; ++i)
5504 for (j = 0; j < map2->n; ++j) {
5505 struct isl_basic_map *part;
5506 part = isl_basic_map_product(
5507 isl_basic_map_copy(map1->p[i]),
5508 isl_basic_map_copy(map2->p[j]));
5509 if (isl_basic_map_is_empty(part))
5510 isl_basic_map_free(part);
5512 result = isl_map_add(result, part);
5525 /* Given two set A and B, construct its Cartesian product A x B.
5527 struct isl_set *isl_set_product(struct isl_set *set1, struct isl_set *set2)
5529 return (struct isl_set *)isl_map_product((struct isl_map *)set1,
5530 (struct isl_map *)set2);
5533 uint32_t isl_basic_set_get_hash(struct isl_basic_set *bset)
5536 uint32_t hash = isl_hash_init();
5541 bset = isl_basic_set_copy(bset);
5542 bset = isl_basic_set_normalize(bset);
5545 total = isl_basic_set_total_dim(bset);
5546 isl_hash_byte(hash, bset->n_eq & 0xFF);
5547 for (i = 0; i < bset->n_eq; ++i) {
5549 c_hash = isl_seq_get_hash(bset->eq[i], 1 + total);
5550 isl_hash_hash(hash, c_hash);
5552 isl_hash_byte(hash, bset->n_ineq & 0xFF);
5553 for (i = 0; i < bset->n_ineq; ++i) {
5555 c_hash = isl_seq_get_hash(bset->ineq[i], 1 + total);
5556 isl_hash_hash(hash, c_hash);
5558 isl_hash_byte(hash, bset->n_div & 0xFF);
5559 for (i = 0; i < bset->n_div; ++i) {
5561 if (isl_int_is_zero(bset->div[i][0]))
5563 isl_hash_byte(hash, i & 0xFF);
5564 c_hash = isl_seq_get_hash(bset->div[i], 1 + 1 + total);
5565 isl_hash_hash(hash, c_hash);
5567 isl_basic_set_free(bset);
5571 uint32_t isl_set_get_hash(struct isl_set *set)
5578 set = isl_set_copy(set);
5579 set = isl_set_normalize(set);
5583 hash = isl_hash_init();
5584 for (i = 0; i < set->n; ++i) {
5586 bset_hash = isl_basic_set_get_hash(set->p[i]);
5587 isl_hash_hash(hash, bset_hash);
5595 /* Check if the value for dimension dim is completely determined
5596 * by the values of the other parameters and variables.
5597 * That is, check if dimension dim is involved in an equality.
5599 int isl_basic_set_dim_is_unique(struct isl_basic_set *bset, unsigned dim)
5606 nparam = isl_basic_set_n_param(bset);
5607 for (i = 0; i < bset->n_eq; ++i)
5608 if (!isl_int_is_zero(bset->eq[i][1 + nparam + dim]))
5613 /* Check if the value for dimension dim is completely determined
5614 * by the values of the other parameters and variables.
5615 * That is, check if dimension dim is involved in an equality
5616 * for each of the subsets.
5618 int isl_set_dim_is_unique(struct isl_set *set, unsigned dim)
5624 for (i = 0; i < set->n; ++i) {
5626 unique = isl_basic_set_dim_is_unique(set->p[i], dim);
5633 int isl_map_foreach_basic_map(__isl_keep isl_map *map,
5634 int (*fn)(__isl_take isl_basic_map *bmap, void *user), void *user)
5641 for (i = 0; i < map->n; ++i)
5642 if (fn(isl_basic_map_copy(map->p[i]), user) < 0)
5648 int isl_set_foreach_basic_set(__isl_keep isl_set *set,
5649 int (*fn)(__isl_take isl_basic_set *bset, void *user), void *user)
5656 for (i = 0; i < set->n; ++i)
5657 if (fn(isl_basic_set_copy(set->p[i]), user) < 0)
5663 __isl_give isl_map *isl_set_lifting(__isl_take isl_set *set)
5665 struct isl_dim *dim;
5666 struct isl_basic_map *bmap;
5673 set = isl_set_align_divs(set);
5678 dim = isl_set_get_dim(set);
5679 if (set->n == 0 || set->p[0]->n_div == 0) {
5681 return isl_map_identity(dim);
5684 n_div = set->p[0]->n_div;
5685 dim = isl_dim_map(dim);
5686 n_param = isl_dim_size(dim, isl_dim_param);
5687 n_set = isl_dim_size(dim, isl_dim_in);
5688 dim = isl_dim_extend(dim, n_param, n_set, n_set + n_div);
5689 bmap = isl_basic_map_alloc_dim(dim, 0, n_set, 2 * n_div);
5690 for (i = 0; i < n_set; ++i)
5691 bmap = var_equal(bmap, i);
5693 total = n_param + n_set + n_set + n_div;
5694 for (i = 0; i < n_div; ++i) {
5695 k = isl_basic_map_alloc_inequality(bmap);
5698 isl_seq_cpy(bmap->ineq[k], set->p[0]->div[i]+1, 1+n_param);
5699 isl_seq_clr(bmap->ineq[k]+1+n_param, n_set);
5700 isl_seq_cpy(bmap->ineq[k]+1+n_param+n_set,
5701 set->p[0]->div[i]+1+1+n_param, n_set + n_div);
5702 isl_int_neg(bmap->ineq[k][1+n_param+n_set+n_set+i],
5703 set->p[0]->div[i][0]);
5705 l = isl_basic_map_alloc_inequality(bmap);
5708 isl_seq_neg(bmap->ineq[l], bmap->ineq[k], 1 + total);
5709 isl_int_add(bmap->ineq[l][0], bmap->ineq[l][0],
5710 set->p[0]->div[i][0]);
5711 isl_int_sub_ui(bmap->ineq[l][0], bmap->ineq[l][0], 1);
5715 return isl_map_from_basic_map(bmap);
5718 isl_basic_map_free(bmap);
5722 int isl_basic_set_size(__isl_keep isl_basic_set *bset)
5730 dim = isl_basic_set_total_dim(bset);
5731 size += bset->n_eq * (1 + dim);
5732 size += bset->n_ineq * (1 + dim);
5733 size += bset->n_div * (2 + dim);
5738 int isl_set_size(__isl_keep isl_set *set)
5746 for (i = 0; i < set->n; ++i)
5747 size += isl_basic_set_size(set->p[i]);