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 bset = isl_basic_set_cow(bset);
1897 row_size = 1 + isl_dim_total(bset->dim) + bset->extra;
1898 old = bset->block2.data;
1899 bset->block2 = isl_blk_extend(bset->ctx, bset->block2,
1900 (bset->extra + n) * (1 + row_size));
1901 if (!bset->block2.data)
1903 new_div = isl_alloc_array(ctx, isl_int *, bset->extra + n);
1906 for (i = 0; i < n; ++i) {
1907 new_div[i] = bset->block2.data +
1908 (bset->extra + i) * (1 + row_size);
1909 isl_seq_clr(new_div[i], 1 + row_size);
1911 for (i = 0; i < bset->extra; ++i)
1912 new_div[n + i] = bset->block2.data + (bset->div[i] - old);
1914 bset->div = new_div;
1917 bset->dim = isl_dim_drop_outputs(bset->dim,
1918 isl_basic_set_n_dim(bset) - n, n);
1921 bset = isl_basic_set_simplify(bset);
1922 bset = isl_basic_set_drop_redundant_divs(bset);
1923 return isl_basic_set_finalize(bset);
1925 isl_basic_set_free(bset);
1929 /* Turn final n dimensions into existentially quantified variables.
1931 __isl_give isl_set *isl_set_project_out(__isl_take isl_set *set,
1932 enum isl_dim_type type, unsigned first, unsigned n)
1939 isl_assert(set->ctx, type == isl_dim_set, goto error);
1940 isl_assert(set->ctx, first + n == isl_set_n_dim(set), goto error);
1945 set = isl_set_cow(set);
1948 set->dim = isl_dim_drop_outputs(set->dim, first, n);
1949 for (i = 0; i < set->n; ++i) {
1950 set->p[i] = isl_basic_set_project_out(set->p[i], type, first, n);
1955 ISL_F_CLR(set, ISL_SET_NORMALIZED);
1962 static struct isl_basic_map *add_divs(struct isl_basic_map *bmap, unsigned n)
1966 for (i = 0; i < n; ++i) {
1967 j = isl_basic_map_alloc_div(bmap);
1970 isl_seq_clr(bmap->div[j], 1+1+isl_basic_map_total_dim(bmap));
1974 isl_basic_map_free(bmap);
1978 struct isl_basic_map *isl_basic_map_apply_range(
1979 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
1981 struct isl_dim *dim_result = NULL;
1982 struct isl_basic_map *bmap;
1983 unsigned n_in, n_out, n, nparam, total, pos;
1984 struct isl_dim_map *dim_map1, *dim_map2;
1986 if (!bmap1 || !bmap2)
1989 dim_result = isl_dim_join(isl_dim_copy(bmap1->dim),
1990 isl_dim_copy(bmap2->dim));
1992 n_in = isl_basic_map_n_in(bmap1);
1993 n_out = isl_basic_map_n_out(bmap2);
1994 n = isl_basic_map_n_out(bmap1);
1995 nparam = isl_basic_map_n_param(bmap1);
1997 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + n;
1998 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
1999 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
2000 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
2001 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
2002 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
2003 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_in);
2004 isl_dim_map_div(dim_map1, bmap1, pos += n_out);
2005 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
2006 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
2007 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
2009 bmap = isl_basic_map_alloc_dim(dim_result,
2010 bmap1->n_div + bmap2->n_div + n,
2011 bmap1->n_eq + bmap2->n_eq,
2012 bmap1->n_ineq + bmap2->n_ineq);
2013 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
2014 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
2015 bmap = add_divs(bmap, n);
2016 bmap = isl_basic_map_simplify(bmap);
2017 bmap = isl_basic_map_drop_redundant_divs(bmap);
2018 return isl_basic_map_finalize(bmap);
2020 isl_basic_map_free(bmap1);
2021 isl_basic_map_free(bmap2);
2025 struct isl_basic_set *isl_basic_set_apply(
2026 struct isl_basic_set *bset, struct isl_basic_map *bmap)
2031 isl_assert(bset->ctx, isl_basic_map_compatible_domain(bmap, bset),
2034 return (struct isl_basic_set *)
2035 isl_basic_map_apply_range((struct isl_basic_map *)bset, bmap);
2037 isl_basic_set_free(bset);
2038 isl_basic_map_free(bmap);
2042 struct isl_basic_map *isl_basic_map_apply_domain(
2043 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2045 if (!bmap1 || !bmap2)
2048 isl_assert(bmap1->ctx,
2049 isl_basic_map_n_in(bmap1) == isl_basic_map_n_in(bmap2), goto error);
2050 isl_assert(bmap1->ctx,
2051 isl_basic_map_n_param(bmap1) == isl_basic_map_n_param(bmap2),
2054 bmap1 = isl_basic_map_reverse(bmap1);
2055 bmap1 = isl_basic_map_apply_range(bmap1, bmap2);
2056 return isl_basic_map_reverse(bmap1);
2058 isl_basic_map_free(bmap1);
2059 isl_basic_map_free(bmap2);
2063 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
2064 * A \cap B -> f(A) + f(B)
2066 struct isl_basic_map *isl_basic_map_sum(
2067 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2069 unsigned n_in, n_out, nparam, total, pos;
2070 struct isl_basic_map *bmap = NULL;
2071 struct isl_dim_map *dim_map1, *dim_map2;
2074 if (!bmap1 || !bmap2)
2077 isl_assert(bmap1->ctx, isl_dim_equal(bmap1->dim, bmap2->dim),
2080 nparam = isl_basic_map_n_param(bmap1);
2081 n_in = isl_basic_map_n_in(bmap1);
2082 n_out = isl_basic_map_n_out(bmap1);
2084 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + 2 * n_out;
2085 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
2086 dim_map2 = isl_dim_map_alloc(bmap2->ctx, total);
2087 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
2088 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos);
2089 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
2090 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
2091 isl_dim_map_div(dim_map1, bmap1, pos += n_in + n_out);
2092 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
2093 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
2094 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_out);
2096 bmap = isl_basic_map_alloc_dim(isl_dim_copy(bmap1->dim),
2097 bmap1->n_div + bmap2->n_div + 2 * n_out,
2098 bmap1->n_eq + bmap2->n_eq + n_out,
2099 bmap1->n_ineq + bmap2->n_ineq);
2100 for (i = 0; i < n_out; ++i) {
2101 int j = isl_basic_map_alloc_equality(bmap);
2104 isl_seq_clr(bmap->eq[j], 1+total);
2105 isl_int_set_si(bmap->eq[j][1+nparam+n_in+i], -1);
2106 isl_int_set_si(bmap->eq[j][1+pos+i], 1);
2107 isl_int_set_si(bmap->eq[j][1+pos-n_out+i], 1);
2109 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
2110 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
2111 bmap = add_divs(bmap, 2 * n_out);
2113 bmap = isl_basic_map_simplify(bmap);
2114 return isl_basic_map_finalize(bmap);
2116 isl_basic_map_free(bmap);
2117 isl_basic_map_free(bmap1);
2118 isl_basic_map_free(bmap2);
2122 /* Given two maps A -> f(A) and B -> g(B), construct a map
2123 * A \cap B -> f(A) + f(B)
2125 struct isl_map *isl_map_sum(struct isl_map *map1, struct isl_map *map2)
2127 struct isl_map *result;
2133 isl_assert(map1->ctx, isl_dim_equal(map1->dim, map2->dim), goto error);
2135 result = isl_map_alloc_dim(isl_dim_copy(map1->dim),
2136 map1->n * map2->n, 0);
2139 for (i = 0; i < map1->n; ++i)
2140 for (j = 0; j < map2->n; ++j) {
2141 struct isl_basic_map *part;
2142 part = isl_basic_map_sum(
2143 isl_basic_map_copy(map1->p[i]),
2144 isl_basic_map_copy(map2->p[j]));
2145 if (isl_basic_map_is_empty(part))
2146 isl_basic_map_free(part);
2148 result = isl_map_add(result, part);
2161 /* Given a basic map A -> f(A), construct A -> -f(A).
2163 struct isl_basic_map *isl_basic_map_neg(struct isl_basic_map *bmap)
2168 bmap = isl_basic_map_cow(bmap);
2172 n = isl_basic_map_dim(bmap, isl_dim_out);
2173 off = isl_basic_map_offset(bmap, isl_dim_out);
2174 for (i = 0; i < bmap->n_eq; ++i)
2175 for (j = 0; j < n; ++j)
2176 isl_int_neg(bmap->eq[i][off+j], bmap->eq[i][off+j]);
2177 for (i = 0; i < bmap->n_ineq; ++i)
2178 for (j = 0; j < n; ++j)
2179 isl_int_neg(bmap->ineq[i][off+j], bmap->ineq[i][off+j]);
2180 for (i = 0; i < bmap->n_div; ++i)
2181 for (j = 0; j < n; ++j)
2182 isl_int_neg(bmap->div[i][1+off+j], bmap->div[i][1+off+j]);
2183 return isl_basic_map_finalize(bmap);
2186 /* Given a map A -> f(A), construct A -> -f(A).
2188 struct isl_map *isl_map_neg(struct isl_map *map)
2192 map = isl_map_cow(map);
2196 for (i = 0; i < map->n; ++i) {
2197 map->p[i] = isl_basic_map_neg(map->p[i]);
2208 /* Given a basic map A -> f(A) and an integer d, construct a basic map
2209 * A -> floor(f(A)/d).
2211 struct isl_basic_map *isl_basic_map_floordiv(struct isl_basic_map *bmap,
2214 unsigned n_in, n_out, nparam, total, pos;
2215 struct isl_basic_map *result = NULL;
2216 struct isl_dim_map *dim_map;
2222 nparam = isl_basic_map_n_param(bmap);
2223 n_in = isl_basic_map_n_in(bmap);
2224 n_out = isl_basic_map_n_out(bmap);
2226 total = nparam + n_in + n_out + bmap->n_div + n_out;
2227 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2228 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_param, pos = 0);
2229 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_in, pos += nparam);
2230 isl_dim_map_div(dim_map, bmap, pos += n_in + n_out);
2231 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_out, pos += bmap->n_div);
2233 result = isl_basic_map_alloc_dim(isl_dim_copy(bmap->dim),
2234 bmap->n_div + n_out,
2235 bmap->n_eq, bmap->n_ineq + 2 * n_out);
2236 result = add_constraints_dim_map(result, bmap, dim_map);
2237 result = add_divs(result, n_out);
2238 for (i = 0; i < n_out; ++i) {
2240 j = isl_basic_map_alloc_inequality(result);
2243 isl_seq_clr(result->ineq[j], 1+total);
2244 isl_int_neg(result->ineq[j][1+nparam+n_in+i], d);
2245 isl_int_set_si(result->ineq[j][1+pos+i], 1);
2246 j = isl_basic_map_alloc_inequality(result);
2249 isl_seq_clr(result->ineq[j], 1+total);
2250 isl_int_set(result->ineq[j][1+nparam+n_in+i], d);
2251 isl_int_set_si(result->ineq[j][1+pos+i], -1);
2252 isl_int_sub_ui(result->ineq[j][0], d, 1);
2255 result = isl_basic_map_simplify(result);
2256 return isl_basic_map_finalize(result);
2258 isl_basic_map_free(result);
2262 /* Given a map A -> f(A) and an integer d, construct a map
2263 * A -> floor(f(A)/d).
2265 struct isl_map *isl_map_floordiv(struct isl_map *map, isl_int d)
2269 map = isl_map_cow(map);
2273 ISL_F_CLR(map, ISL_MAP_DISJOINT);
2274 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
2275 for (i = 0; i < map->n; ++i) {
2276 map->p[i] = isl_basic_map_floordiv(map->p[i], d);
2287 static struct isl_basic_map *var_equal(struct isl_basic_map *bmap, unsigned pos)
2293 i = isl_basic_map_alloc_equality(bmap);
2296 nparam = isl_basic_map_n_param(bmap);
2297 n_in = isl_basic_map_n_in(bmap);
2298 isl_seq_clr(bmap->eq[i], 1 + isl_basic_map_total_dim(bmap));
2299 isl_int_set_si(bmap->eq[i][1+nparam+pos], -1);
2300 isl_int_set_si(bmap->eq[i][1+nparam+n_in+pos], 1);
2301 return isl_basic_map_finalize(bmap);
2303 isl_basic_map_free(bmap);
2307 /* Add a constraints to "bmap" expressing i_pos < o_pos
2309 static struct isl_basic_map *var_less(struct isl_basic_map *bmap, unsigned pos)
2315 i = isl_basic_map_alloc_inequality(bmap);
2318 nparam = isl_basic_map_n_param(bmap);
2319 n_in = isl_basic_map_n_in(bmap);
2320 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
2321 isl_int_set_si(bmap->ineq[i][0], -1);
2322 isl_int_set_si(bmap->ineq[i][1+nparam+pos], -1);
2323 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], 1);
2324 return isl_basic_map_finalize(bmap);
2326 isl_basic_map_free(bmap);
2330 /* Add a constraints to "bmap" expressing i_pos > o_pos
2332 static struct isl_basic_map *var_more(struct isl_basic_map *bmap, unsigned pos)
2338 i = isl_basic_map_alloc_inequality(bmap);
2341 nparam = isl_basic_map_n_param(bmap);
2342 n_in = isl_basic_map_n_in(bmap);
2343 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
2344 isl_int_set_si(bmap->ineq[i][0], -1);
2345 isl_int_set_si(bmap->ineq[i][1+nparam+pos], 1);
2346 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], -1);
2347 return isl_basic_map_finalize(bmap);
2349 isl_basic_map_free(bmap);
2353 struct isl_basic_map *isl_basic_map_equal(struct isl_dim *dim, unsigned n_equal)
2356 struct isl_basic_map *bmap;
2357 bmap = isl_basic_map_alloc_dim(dim, 0, n_equal, 0);
2360 for (i = 0; i < n_equal && bmap; ++i)
2361 bmap = var_equal(bmap, i);
2362 return isl_basic_map_finalize(bmap);
2365 /* Return a relation on pairs of sets of dimension "dim" expressing i_pos < o_pos
2367 struct isl_basic_map *isl_basic_map_less_at(struct isl_dim *dim, unsigned pos)
2370 struct isl_basic_map *bmap;
2371 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
2374 for (i = 0; i < pos && bmap; ++i)
2375 bmap = var_equal(bmap, i);
2377 bmap = var_less(bmap, pos);
2378 return isl_basic_map_finalize(bmap);
2381 /* Return a relation on pairs of sets of dimension "dim" expressing i_pos > o_pos
2383 struct isl_basic_map *isl_basic_map_more_at(struct isl_dim *dim, unsigned pos)
2386 struct isl_basic_map *bmap;
2387 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
2390 for (i = 0; i < pos && bmap; ++i)
2391 bmap = var_equal(bmap, i);
2393 bmap = var_more(bmap, pos);
2394 return isl_basic_map_finalize(bmap);
2397 static __isl_give isl_map *map_lex_lte(__isl_take isl_dim *dims, int equal)
2399 struct isl_map *map;
2406 map = isl_map_alloc_dim(isl_dim_copy(dims), dim + equal, ISL_MAP_DISJOINT);
2408 for (i = 0; i < dim; ++i)
2409 map = isl_map_add(map,
2410 isl_basic_map_less_at(isl_dim_copy(dims), i));
2412 map = isl_map_add(map,
2413 isl_basic_map_equal(isl_dim_copy(dims), dim));
2419 __isl_give isl_map *isl_map_lex_lt(__isl_take isl_dim *set_dim)
2421 return map_lex_lte(isl_dim_map(set_dim), 0);
2424 __isl_give isl_map *isl_map_lex_le(__isl_take isl_dim *set_dim)
2426 return map_lex_lte(isl_dim_map(set_dim), 1);
2429 static __isl_give isl_map *map_lex_gte(__isl_take isl_dim *dims, int equal)
2431 struct isl_map *map;
2438 map = isl_map_alloc_dim(isl_dim_copy(dims), dim + equal, ISL_MAP_DISJOINT);
2440 for (i = 0; i < dim; ++i)
2441 map = isl_map_add(map,
2442 isl_basic_map_more_at(isl_dim_copy(dims), i));
2444 map = isl_map_add(map,
2445 isl_basic_map_equal(isl_dim_copy(dims), dim));
2451 __isl_give isl_map *isl_map_lex_gt(__isl_take isl_dim *set_dim)
2453 return map_lex_gte(isl_dim_map(set_dim), 0);
2456 __isl_give isl_map *isl_map_lex_ge(__isl_take isl_dim *set_dim)
2458 return map_lex_gte(isl_dim_map(set_dim), 1);
2461 struct isl_basic_map *isl_basic_map_from_basic_set(
2462 struct isl_basic_set *bset, struct isl_dim *dim)
2464 struct isl_basic_map *bmap;
2466 bset = isl_basic_set_cow(bset);
2470 isl_assert(bset->ctx, isl_dim_compatible(bset->dim, dim), goto error);
2471 isl_dim_free(bset->dim);
2472 bmap = (struct isl_basic_map *) bset;
2474 return isl_basic_map_finalize(bmap);
2476 isl_basic_set_free(bset);
2481 struct isl_basic_set *isl_basic_set_from_basic_map(struct isl_basic_map *bmap)
2485 if (bmap->dim->n_in == 0)
2486 return (struct isl_basic_set *)bmap;
2487 bmap = isl_basic_map_cow(bmap);
2490 bmap->dim = isl_dim_cow(bmap->dim);
2493 bmap->dim->n_out += bmap->dim->n_in;
2494 bmap->dim->n_in = 0;
2495 bmap = isl_basic_map_finalize(bmap);
2496 return (struct isl_basic_set *)bmap;
2498 isl_basic_map_free(bmap);
2502 /* For a div d = floor(f/m), add the constraints
2505 * -(f-(n-1)) + m d >= 0
2507 * Note that the second constraint is the negation of
2511 static int add_div_constraints(struct isl_basic_map *bmap, unsigned div)
2514 unsigned total = isl_basic_map_total_dim(bmap);
2515 unsigned div_pos = 1 + total - bmap->n_div + div;
2517 i = isl_basic_map_alloc_inequality(bmap);
2520 isl_seq_cpy(bmap->ineq[i], bmap->div[div]+1, 1+total);
2521 isl_int_neg(bmap->ineq[i][div_pos], bmap->div[div][0]);
2523 j = isl_basic_map_alloc_inequality(bmap);
2526 isl_seq_neg(bmap->ineq[j], bmap->ineq[i], 1 + total);
2527 isl_int_add(bmap->ineq[j][0], bmap->ineq[j][0], bmap->ineq[j][div_pos]);
2528 isl_int_sub_ui(bmap->ineq[j][0], bmap->ineq[j][0], 1);
2532 struct isl_basic_set *isl_basic_map_underlying_set(
2533 struct isl_basic_map *bmap)
2537 if (bmap->dim->nparam == 0 && bmap->dim->n_in == 0 && bmap->n_div == 0)
2538 return (struct isl_basic_set *)bmap;
2539 bmap = isl_basic_map_cow(bmap);
2542 bmap->dim = isl_dim_underlying(bmap->dim, bmap->n_div);
2545 bmap->extra -= bmap->n_div;
2547 bmap = isl_basic_map_finalize(bmap);
2548 return (struct isl_basic_set *)bmap;
2553 __isl_give isl_basic_set *isl_basic_set_underlying_set(
2554 __isl_take isl_basic_set *bset)
2556 return isl_basic_map_underlying_set((isl_basic_map *)bset);
2559 struct isl_basic_map *isl_basic_map_overlying_set(
2560 struct isl_basic_set *bset, struct isl_basic_map *like)
2562 struct isl_basic_map *bmap;
2563 struct isl_ctx *ctx;
2570 isl_assert(ctx, bset->n_div == 0, goto error);
2571 isl_assert(ctx, isl_basic_set_n_param(bset) == 0, goto error);
2572 isl_assert(ctx, bset->dim->n_out == isl_basic_map_total_dim(like),
2574 if (isl_dim_equal(bset->dim, like->dim) && like->n_div == 0) {
2575 isl_basic_map_free(like);
2576 return (struct isl_basic_map *)bset;
2578 bset = isl_basic_set_cow(bset);
2581 total = bset->dim->n_out + bset->extra;
2582 bmap = (struct isl_basic_map *)bset;
2583 isl_dim_free(bmap->dim);
2584 bmap->dim = isl_dim_copy(like->dim);
2587 bmap->n_div = like->n_div;
2588 bmap->extra += like->n_div;
2591 ltotal = total - bmap->extra + like->extra;
2594 bmap->block2 = isl_blk_extend(ctx, bmap->block2,
2595 bmap->extra * (1 + 1 + total));
2596 if (isl_blk_is_error(bmap->block2))
2598 bmap->div = isl_realloc_array(ctx, bmap->div, isl_int *,
2602 for (i = 0; i < bmap->extra; ++i)
2603 bmap->div[i] = bmap->block2.data + i * (1 + 1 + total);
2604 for (i = 0; i < like->n_div; ++i) {
2605 isl_seq_cpy(bmap->div[i], like->div[i], 1 + 1 + ltotal);
2606 isl_seq_clr(bmap->div[i]+1+1+ltotal, total - ltotal);
2608 bmap = isl_basic_map_extend_constraints(bmap,
2609 0, 2 * like->n_div);
2610 for (i = 0; i < like->n_div; ++i) {
2611 if (isl_int_is_zero(bmap->div[i][0]))
2613 if (add_div_constraints(bmap, i) < 0)
2617 isl_basic_map_free(like);
2618 bmap = isl_basic_map_simplify(bmap);
2619 bmap = isl_basic_map_finalize(bmap);
2622 isl_basic_map_free(like);
2623 isl_basic_set_free(bset);
2627 struct isl_basic_set *isl_basic_set_from_underlying_set(
2628 struct isl_basic_set *bset, struct isl_basic_set *like)
2630 return (struct isl_basic_set *)
2631 isl_basic_map_overlying_set(bset, (struct isl_basic_map *)like);
2634 struct isl_set *isl_set_from_underlying_set(
2635 struct isl_set *set, struct isl_basic_set *like)
2641 isl_assert(set->ctx, set->dim->n_out == isl_basic_set_total_dim(like),
2643 if (isl_dim_equal(set->dim, like->dim) && like->n_div == 0) {
2644 isl_basic_set_free(like);
2647 set = isl_set_cow(set);
2650 for (i = 0; i < set->n; ++i) {
2651 set->p[i] = isl_basic_set_from_underlying_set(set->p[i],
2652 isl_basic_set_copy(like));
2656 isl_dim_free(set->dim);
2657 set->dim = isl_dim_copy(like->dim);
2660 isl_basic_set_free(like);
2663 isl_basic_set_free(like);
2668 struct isl_set *isl_map_underlying_set(struct isl_map *map)
2672 map = isl_map_cow(map);
2675 map->dim = isl_dim_cow(map->dim);
2679 for (i = 1; i < map->n; ++i)
2680 isl_assert(map->ctx, map->p[0]->n_div == map->p[i]->n_div,
2682 for (i = 0; i < map->n; ++i) {
2683 map->p[i] = (struct isl_basic_map *)
2684 isl_basic_map_underlying_set(map->p[i]);
2689 map->dim = isl_dim_underlying(map->dim, 0);
2691 isl_dim_free(map->dim);
2692 map->dim = isl_dim_copy(map->p[0]->dim);
2696 return (struct isl_set *)map;
2702 struct isl_set *isl_set_to_underlying_set(struct isl_set *set)
2704 return (struct isl_set *)isl_map_underlying_set((struct isl_map *)set);
2707 struct isl_basic_set *isl_basic_map_domain(struct isl_basic_map *bmap)
2709 struct isl_basic_set *domain;
2714 n_in = isl_basic_map_n_in(bmap);
2715 n_out = isl_basic_map_n_out(bmap);
2716 domain = isl_basic_set_from_basic_map(bmap);
2717 return isl_basic_set_project_out(domain, isl_dim_set, n_in, n_out);
2720 struct isl_basic_set *isl_basic_map_range(struct isl_basic_map *bmap)
2722 return isl_basic_map_domain(isl_basic_map_reverse(bmap));
2725 struct isl_set *isl_map_range(struct isl_map *map)
2728 struct isl_set *set;
2732 map = isl_map_cow(map);
2736 set = (struct isl_set *) map;
2737 if (set->dim->n_in != 0) {
2738 set->dim = isl_dim_drop_inputs(set->dim, 0, set->dim->n_in);
2742 for (i = 0; i < map->n; ++i) {
2743 set->p[i] = isl_basic_map_range(map->p[i]);
2747 ISL_F_CLR(set, ISL_MAP_DISJOINT);
2748 ISL_F_CLR(set, ISL_SET_NORMALIZED);
2755 struct isl_map *isl_map_from_set(struct isl_set *set, struct isl_dim *dim)
2758 struct isl_map *map = NULL;
2760 set = isl_set_cow(set);
2763 isl_assert(set->ctx, isl_dim_compatible(set->dim, dim), goto error);
2764 map = (struct isl_map *)set;
2765 for (i = 0; i < set->n; ++i) {
2766 map->p[i] = isl_basic_map_from_basic_set(
2767 set->p[i], isl_dim_copy(dim));
2771 isl_dim_free(map->dim);
2780 struct isl_map *isl_map_from_range(struct isl_set *set)
2782 return (struct isl_map *)set;
2785 struct isl_set *isl_set_from_map(struct isl_map *map)
2788 struct isl_set *set = NULL;
2792 map = isl_map_cow(map);
2795 map->dim = isl_dim_cow(map->dim);
2798 map->dim->n_out += map->dim->n_in;
2800 set = (struct isl_set *)map;
2801 for (i = 0; i < map->n; ++i) {
2802 set->p[i] = isl_basic_set_from_basic_map(map->p[i]);
2812 struct isl_map *isl_map_alloc_dim(struct isl_dim *dim, int n, unsigned flags)
2814 struct isl_map *map;
2818 isl_assert(dim->ctx, n >= 0, return NULL);
2819 map = isl_alloc(dim->ctx, struct isl_map,
2820 sizeof(struct isl_map) +
2821 (n - 1) * sizeof(struct isl_basic_map *));
2825 map->ctx = dim->ctx;
2826 isl_ctx_ref(map->ctx);
2838 struct isl_map *isl_map_alloc(struct isl_ctx *ctx,
2839 unsigned nparam, unsigned in, unsigned out, int n,
2842 struct isl_map *map;
2843 struct isl_dim *dims;
2845 dims = isl_dim_alloc(ctx, nparam, in, out);
2849 map = isl_map_alloc_dim(dims, n, flags);
2853 struct isl_basic_map *isl_basic_map_empty(struct isl_dim *dim)
2855 struct isl_basic_map *bmap;
2856 bmap = isl_basic_map_alloc_dim(dim, 0, 1, 0);
2857 bmap = isl_basic_map_set_to_empty(bmap);
2861 struct isl_basic_set *isl_basic_set_empty(struct isl_dim *dim)
2863 struct isl_basic_set *bset;
2864 bset = isl_basic_set_alloc_dim(dim, 0, 1, 0);
2865 bset = isl_basic_set_set_to_empty(bset);
2869 struct isl_basic_map *isl_basic_map_empty_like(struct isl_basic_map *model)
2871 struct isl_basic_map *bmap;
2874 bmap = isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
2875 bmap = isl_basic_map_set_to_empty(bmap);
2879 struct isl_basic_map *isl_basic_map_empty_like_map(struct isl_map *model)
2881 struct isl_basic_map *bmap;
2884 bmap = isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
2885 bmap = isl_basic_map_set_to_empty(bmap);
2889 struct isl_basic_set *isl_basic_set_empty_like(struct isl_basic_set *model)
2891 struct isl_basic_set *bset;
2894 bset = isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
2895 bset = isl_basic_set_set_to_empty(bset);
2899 struct isl_basic_map *isl_basic_map_universe(struct isl_dim *dim)
2901 struct isl_basic_map *bmap;
2902 bmap = isl_basic_map_alloc_dim(dim, 0, 0, 0);
2906 struct isl_basic_set *isl_basic_set_universe(struct isl_dim *dim)
2908 struct isl_basic_set *bset;
2909 bset = isl_basic_set_alloc_dim(dim, 0, 0, 0);
2913 __isl_give isl_basic_map *isl_basic_map_universe_like(
2914 __isl_keep isl_basic_map *model)
2918 return isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
2921 struct isl_basic_set *isl_basic_set_universe_like(struct isl_basic_set *model)
2925 return isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
2928 __isl_give isl_basic_set *isl_basic_set_universe_like_set(
2929 __isl_keep isl_set *model)
2933 return isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
2936 struct isl_map *isl_map_empty(struct isl_dim *dim)
2938 return isl_map_alloc_dim(dim, 0, ISL_MAP_DISJOINT);
2941 struct isl_map *isl_map_empty_like(struct isl_map *model)
2945 return isl_map_alloc_dim(isl_dim_copy(model->dim), 0, ISL_MAP_DISJOINT);
2948 struct isl_map *isl_map_empty_like_basic_map(struct isl_basic_map *model)
2952 return isl_map_alloc_dim(isl_dim_copy(model->dim), 0, ISL_MAP_DISJOINT);
2955 struct isl_set *isl_set_empty(struct isl_dim *dim)
2957 return isl_set_alloc_dim(dim, 0, ISL_MAP_DISJOINT);
2960 struct isl_set *isl_set_empty_like(struct isl_set *model)
2964 return isl_set_empty(isl_dim_copy(model->dim));
2967 struct isl_map *isl_map_universe(struct isl_dim *dim)
2969 struct isl_map *map;
2972 map = isl_map_alloc_dim(isl_dim_copy(dim), 1, ISL_MAP_DISJOINT);
2973 map = isl_map_add(map, isl_basic_map_universe(dim));
2977 struct isl_set *isl_set_universe(struct isl_dim *dim)
2979 struct isl_set *set;
2982 set = isl_set_alloc_dim(isl_dim_copy(dim), 1, ISL_MAP_DISJOINT);
2983 set = isl_set_add(set, isl_basic_set_universe(dim));
2987 __isl_give isl_set *isl_set_universe_like(__isl_keep isl_set *model)
2991 return isl_set_universe(isl_dim_copy(model->dim));
2994 struct isl_map *isl_map_dup(struct isl_map *map)
2997 struct isl_map *dup;
3001 dup = isl_map_alloc_dim(isl_dim_copy(map->dim), map->n, map->flags);
3002 for (i = 0; i < map->n; ++i)
3003 dup = isl_map_add(dup, isl_basic_map_copy(map->p[i]));
3007 struct isl_map *isl_map_add(struct isl_map *map, struct isl_basic_map *bmap)
3011 if (isl_basic_map_fast_is_empty(bmap)) {
3012 isl_basic_map_free(bmap);
3015 isl_assert(map->ctx, isl_dim_equal(map->dim, bmap->dim), goto error);
3016 isl_assert(map->ctx, map->n < map->size, goto error);
3017 map->p[map->n] = bmap;
3019 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3025 isl_basic_map_free(bmap);
3029 void isl_map_free(struct isl_map *map)
3039 isl_ctx_deref(map->ctx);
3040 for (i = 0; i < map->n; ++i)
3041 isl_basic_map_free(map->p[i]);
3042 isl_dim_free(map->dim);
3046 struct isl_map *isl_map_extend(struct isl_map *base,
3047 unsigned nparam, unsigned n_in, unsigned n_out)
3051 base = isl_map_cow(base);
3055 base->dim = isl_dim_extend(base->dim, nparam, n_in, n_out);
3058 for (i = 0; i < base->n; ++i) {
3059 base->p[i] = isl_basic_map_extend_dim(base->p[i],
3060 isl_dim_copy(base->dim), 0, 0, 0);
3070 struct isl_set *isl_set_extend(struct isl_set *base,
3071 unsigned nparam, unsigned dim)
3073 return (struct isl_set *)isl_map_extend((struct isl_map *)base,
3077 static struct isl_basic_map *isl_basic_map_fix_pos(struct isl_basic_map *bmap,
3078 unsigned pos, int value)
3082 bmap = isl_basic_map_cow(bmap);
3083 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
3084 j = isl_basic_map_alloc_equality(bmap);
3087 isl_seq_clr(bmap->eq[j] + 1, isl_basic_map_total_dim(bmap));
3088 isl_int_set_si(bmap->eq[j][pos], -1);
3089 isl_int_set_si(bmap->eq[j][0], value);
3090 bmap = isl_basic_map_simplify(bmap);
3091 return isl_basic_map_finalize(bmap);
3093 isl_basic_map_free(bmap);
3097 struct isl_basic_map *isl_basic_map_fix_si(struct isl_basic_map *bmap,
3098 enum isl_dim_type type, unsigned pos, int value)
3102 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
3103 return isl_basic_map_fix_pos(bmap, isl_basic_map_offset(bmap, type) + pos,
3106 isl_basic_map_free(bmap);
3110 struct isl_basic_set *isl_basic_set_fix_si(struct isl_basic_set *bset,
3111 enum isl_dim_type type, unsigned pos, int value)
3113 return (struct isl_basic_set *)
3114 isl_basic_map_fix_si((struct isl_basic_map *)bset,
3118 struct isl_basic_map *isl_basic_map_fix_input_si(struct isl_basic_map *bmap,
3119 unsigned input, int value)
3121 return isl_basic_map_fix_si(bmap, isl_dim_in, input, value);
3124 struct isl_basic_set *isl_basic_set_fix_dim_si(struct isl_basic_set *bset,
3125 unsigned dim, int value)
3127 return (struct isl_basic_set *)
3128 isl_basic_map_fix_si((struct isl_basic_map *)bset,
3129 isl_dim_set, dim, value);
3132 struct isl_map *isl_map_fix_si(struct isl_map *map,
3133 enum isl_dim_type type, unsigned pos, int value)
3137 map = isl_map_cow(map);
3141 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
3142 for (i = 0; i < map->n; ++i) {
3143 map->p[i] = isl_basic_map_fix_si(map->p[i], type, pos, value);
3147 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3154 struct isl_map *isl_map_fix_input_si(struct isl_map *map,
3155 unsigned input, int value)
3157 return isl_map_fix_si(map, isl_dim_in, input, value);
3160 struct isl_set *isl_set_fix_dim_si(struct isl_set *set, unsigned dim, int value)
3162 return (struct isl_set *)
3163 isl_map_fix_si((struct isl_map *)set, isl_dim_set, dim, value);
3166 struct isl_basic_set *isl_basic_set_lower_bound_dim(struct isl_basic_set *bset,
3167 unsigned dim, isl_int value)
3171 bset = isl_basic_set_cow(bset);
3172 bset = isl_basic_set_extend_constraints(bset, 0, 1);
3173 j = isl_basic_set_alloc_inequality(bset);
3176 isl_seq_clr(bset->ineq[j], 1 + isl_basic_set_total_dim(bset));
3177 isl_int_set_si(bset->ineq[j][1 + isl_basic_set_n_param(bset) + dim], 1);
3178 isl_int_neg(bset->ineq[j][0], value);
3179 bset = isl_basic_set_simplify(bset);
3180 return isl_basic_set_finalize(bset);
3182 isl_basic_set_free(bset);
3186 struct isl_set *isl_set_lower_bound_dim(struct isl_set *set, unsigned dim,
3191 set = isl_set_cow(set);
3195 isl_assert(set->ctx, dim < isl_set_n_dim(set), goto error);
3196 for (i = 0; i < set->n; ++i) {
3197 set->p[i] = isl_basic_set_lower_bound_dim(set->p[i], dim, value);
3207 struct isl_map *isl_map_reverse(struct isl_map *map)
3211 map = isl_map_cow(map);
3215 map->dim = isl_dim_reverse(map->dim);
3218 for (i = 0; i < map->n; ++i) {
3219 map->p[i] = isl_basic_map_reverse(map->p[i]);
3223 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3230 static struct isl_map *isl_basic_map_partial_lexopt(
3231 struct isl_basic_map *bmap, struct isl_basic_set *dom,
3232 struct isl_set **empty, int max)
3236 if (bmap->ctx->pip == ISL_PIP_PIP)
3237 return isl_pip_basic_map_lexopt(bmap, dom, empty, max);
3239 return isl_tab_basic_map_partial_lexopt(bmap, dom, empty, max);
3241 isl_basic_map_free(bmap);
3242 isl_basic_set_free(dom);
3248 struct isl_map *isl_basic_map_partial_lexmax(
3249 struct isl_basic_map *bmap, struct isl_basic_set *dom,
3250 struct isl_set **empty)
3252 return isl_basic_map_partial_lexopt(bmap, dom, empty, 1);
3255 struct isl_map *isl_basic_map_partial_lexmin(
3256 struct isl_basic_map *bmap, struct isl_basic_set *dom,
3257 struct isl_set **empty)
3259 return isl_basic_map_partial_lexopt(bmap, dom, empty, 0);
3262 struct isl_set *isl_basic_set_partial_lexmin(
3263 struct isl_basic_set *bset, struct isl_basic_set *dom,
3264 struct isl_set **empty)
3266 return (struct isl_set *)
3267 isl_basic_map_partial_lexmin((struct isl_basic_map *)bset,
3271 struct isl_set *isl_basic_set_partial_lexmax(
3272 struct isl_basic_set *bset, struct isl_basic_set *dom,
3273 struct isl_set **empty)
3275 return (struct isl_set *)
3276 isl_basic_map_partial_lexmax((struct isl_basic_map *)bset,
3280 __isl_give isl_map *isl_basic_map_lexmin(__isl_take isl_basic_map *bmap)
3282 struct isl_basic_set *dom = NULL;
3283 struct isl_map *min;
3284 struct isl_dim *dom_dim;
3288 dom_dim = isl_dim_domain(isl_dim_copy(bmap->dim));
3289 dom = isl_basic_set_universe(dom_dim);
3290 return isl_basic_map_partial_lexmin(bmap, dom, NULL);
3292 isl_basic_map_free(bmap);
3296 __isl_give isl_set *isl_basic_set_lexmin(__isl_take isl_basic_set *bset)
3298 return (isl_set *)isl_basic_map_lexmin((isl_basic_map *)bset);
3301 static struct isl_map *isl_map_reset_dim(struct isl_map *map,
3302 struct isl_dim *dim)
3309 for (i = 0; i < map->n; ++i) {
3310 isl_dim_free(map->p[i]->dim);
3311 map->p[i]->dim = isl_dim_copy(dim);
3313 isl_dim_free(map->dim);
3323 static struct isl_set *isl_set_reset_dim(struct isl_set *set,
3324 struct isl_dim *dim)
3326 return (struct isl_set *) isl_map_reset_dim((struct isl_map *)set, dim);
3329 /* Apply a preimage specified by "mat" on the parameters of "bset".
3330 * bset is assumed to have only parameters and divs.
3332 static struct isl_basic_set *basic_set_parameter_preimage(
3333 struct isl_basic_set *bset, struct isl_mat *mat)
3340 bset->dim = isl_dim_cow(bset->dim);
3344 nparam = isl_basic_set_dim(bset, isl_dim_param);
3346 isl_assert(bset->ctx, mat->n_row == 1 + nparam, goto error);
3348 bset->dim->nparam = 0;
3349 bset->dim->n_out = nparam;
3350 bset = isl_basic_set_preimage(bset, mat);
3352 bset->dim->nparam = bset->dim->n_out;
3353 bset->dim->n_out = 0;
3358 isl_basic_set_free(bset);
3362 /* Apply a preimage specified by "mat" on the parameters of "set".
3363 * set is assumed to have only parameters and divs.
3365 static struct isl_set *set_parameter_preimage(
3366 struct isl_set *set, struct isl_mat *mat)
3368 struct isl_dim *dim = NULL;
3374 dim = isl_dim_copy(set->dim);
3375 dim = isl_dim_cow(dim);
3379 nparam = isl_set_dim(set, isl_dim_param);
3381 isl_assert(set->ctx, mat->n_row == 1 + nparam, goto error);
3384 dim->n_out = nparam;
3385 isl_set_reset_dim(set, dim);
3386 set = isl_set_preimage(set, mat);
3389 dim = isl_dim_copy(set->dim);
3390 dim = isl_dim_cow(dim);
3393 dim->nparam = dim->n_out;
3395 isl_set_reset_dim(set, dim);
3405 /* Intersect the basic set "bset" with the affine space specified by the
3406 * equalities in "eq".
3408 static struct isl_basic_set *basic_set_append_equalities(
3409 struct isl_basic_set *bset, struct isl_mat *eq)
3417 bset = isl_basic_set_extend_dim(bset, isl_dim_copy(bset->dim), 0,
3422 len = 1 + isl_dim_total(bset->dim) + bset->extra;
3423 for (i = 0; i < eq->n_row; ++i) {
3424 k = isl_basic_set_alloc_equality(bset);
3427 isl_seq_cpy(bset->eq[k], eq->row[i], eq->n_col);
3428 isl_seq_clr(bset->eq[k] + eq->n_col, len - eq->n_col);
3435 isl_basic_set_free(bset);
3439 /* Intersect the set "set" with the affine space specified by the
3440 * equalities in "eq".
3442 static struct isl_set *set_append_equalities(struct isl_set *set,
3450 for (i = 0; i < set->n; ++i) {
3451 set->p[i] = basic_set_append_equalities(set->p[i],
3464 /* Project the given basic set onto its parameter domain, possibly introducing
3465 * new, explicit, existential variables in the constraints.
3466 * The input has parameters and (possibly implicit) existential variables.
3467 * The output has the same parameters, but only
3468 * explicit existentially quantified variables.
3470 * The actual projection is performed by pip, but pip doesn't seem
3471 * to like equalities very much, so we first remove the equalities
3472 * among the parameters by performing a variable compression on
3473 * the parameters. Afterward, an inverse transformation is performed
3474 * and the equalities among the parameters are inserted back in.
3476 static struct isl_set *parameter_compute_divs(struct isl_basic_set *bset)
3480 struct isl_mat *T, *T2;
3481 struct isl_set *set;
3482 unsigned nparam, n_div;
3484 bset = isl_basic_set_cow(bset);
3488 if (bset->n_eq == 0)
3489 return isl_basic_set_lexmin(bset);
3491 isl_basic_set_gauss(bset, NULL);
3493 nparam = isl_basic_set_dim(bset, isl_dim_param);
3494 n_div = isl_basic_set_dim(bset, isl_dim_div);
3496 for (i = 0, j = n_div - 1; i < bset->n_eq && j >= 0; --j) {
3497 if (!isl_int_is_zero(bset->eq[i][1 + nparam + j]))
3500 if (i == bset->n_eq)
3501 return isl_basic_set_lexmin(bset);
3503 eq = isl_mat_sub_alloc(bset->ctx, bset->eq, i, bset->n_eq - i,
3505 eq = isl_mat_cow(eq);
3506 T = isl_mat_variable_compression(isl_mat_copy(eq), &T2);
3507 bset = basic_set_parameter_preimage(bset, T);
3509 set = isl_basic_set_lexmin(bset);
3510 set = set_parameter_preimage(set, T2);
3511 set = set_append_equalities(set, eq);
3515 /* Compute an explicit representation for all the existentially
3516 * quantified variables.
3517 * The input and output dimensions are first turned into parameters.
3518 * compute_divs then returns a map with the same parameters and
3519 * no input or output dimensions and the dimension specification
3520 * is reset to that of the input.
3522 static struct isl_map *compute_divs(struct isl_basic_map *bmap)
3524 struct isl_basic_set *bset;
3525 struct isl_set *set;
3526 struct isl_map *map;
3527 struct isl_dim *dim, *orig_dim = NULL;
3532 bmap = isl_basic_map_cow(bmap);
3536 nparam = isl_basic_map_dim(bmap, isl_dim_param);
3537 n_in = isl_basic_map_dim(bmap, isl_dim_in);
3538 n_out = isl_basic_map_dim(bmap, isl_dim_out);
3539 dim = isl_dim_set_alloc(bmap->ctx, nparam + n_in + n_out, 0);
3543 orig_dim = bmap->dim;
3545 bset = (struct isl_basic_set *)bmap;
3547 set = parameter_compute_divs(bset);
3548 map = (struct isl_map *)set;
3549 map = isl_map_reset_dim(map, orig_dim);
3553 isl_basic_map_free(bmap);
3557 static int basic_map_divs_known(__isl_keep isl_basic_map *bmap)
3565 off = isl_dim_total(bmap->dim);
3566 for (i = 0; i < bmap->n_div; ++i) {
3567 if (isl_int_is_zero(bmap->div[i][0]))
3569 isl_assert(bmap->ctx, isl_int_is_zero(bmap->div[i][1+1+off+i]),
3575 static int map_divs_known(__isl_keep isl_map *map)
3582 for (i = 0; i < map->n; ++i) {
3583 int known = basic_map_divs_known(map->p[i]);
3591 /* If bmap contains any unknown divs, then compute explicit
3592 * expressions for them. However, this computation may be
3593 * quite expensive, so first try to remove divs that aren't
3596 struct isl_map *isl_basic_map_compute_divs(struct isl_basic_map *bmap)
3601 known = basic_map_divs_known(bmap);
3605 return isl_map_from_basic_map(bmap);
3607 bmap = isl_basic_map_drop_redundant_divs(bmap);
3609 known = basic_map_divs_known(bmap);
3613 return isl_map_from_basic_map(bmap);
3615 struct isl_map *map = compute_divs(bmap);
3618 isl_basic_map_free(bmap);
3622 struct isl_map *isl_map_compute_divs(struct isl_map *map)
3626 struct isl_map *res;
3633 known = map_divs_known(map);
3641 res = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[0]));
3642 for (i = 1 ; i < map->n; ++i) {
3644 r2 = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[i]));
3645 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT))
3646 res = isl_map_union_disjoint(res, r2);
3648 res = isl_map_union(res, r2);
3655 struct isl_set *isl_basic_set_compute_divs(struct isl_basic_set *bset)
3657 return (struct isl_set *)
3658 isl_basic_map_compute_divs((struct isl_basic_map *)bset);
3661 struct isl_set *isl_set_compute_divs(struct isl_set *set)
3663 return (struct isl_set *)
3664 isl_map_compute_divs((struct isl_map *)set);
3667 struct isl_set *isl_map_domain(struct isl_map *map)
3670 struct isl_set *set;
3675 map = isl_map_cow(map);
3679 set = (struct isl_set *)map;
3680 set->dim = isl_dim_domain(set->dim);
3683 for (i = 0; i < map->n; ++i) {
3684 set->p[i] = isl_basic_map_domain(map->p[i]);
3688 ISL_F_CLR(set, ISL_MAP_DISJOINT);
3689 ISL_F_CLR(set, ISL_SET_NORMALIZED);
3696 struct isl_map *isl_map_union_disjoint(
3697 struct isl_map *map1, struct isl_map *map2)
3701 struct isl_map *map = NULL;
3715 isl_assert(map1->ctx, isl_dim_equal(map1->dim, map2->dim), goto error);
3717 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
3718 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
3719 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
3721 map = isl_map_alloc_dim(isl_dim_copy(map1->dim),
3722 map1->n + map2->n, flags);
3725 for (i = 0; i < map1->n; ++i) {
3726 map = isl_map_add(map,
3727 isl_basic_map_copy(map1->p[i]));
3731 for (i = 0; i < map2->n; ++i) {
3732 map = isl_map_add(map,
3733 isl_basic_map_copy(map2->p[i]));
3747 struct isl_map *isl_map_union(struct isl_map *map1, struct isl_map *map2)
3749 map1 = isl_map_union_disjoint(map1, map2);
3753 ISL_F_CLR(map1, ISL_MAP_DISJOINT);
3757 struct isl_set *isl_set_union_disjoint(
3758 struct isl_set *set1, struct isl_set *set2)
3760 return (struct isl_set *)
3761 isl_map_union_disjoint(
3762 (struct isl_map *)set1, (struct isl_map *)set2);
3765 struct isl_set *isl_set_union(struct isl_set *set1, struct isl_set *set2)
3767 return (struct isl_set *)
3768 isl_map_union((struct isl_map *)set1, (struct isl_map *)set2);
3771 struct isl_map *isl_map_intersect_range(
3772 struct isl_map *map, struct isl_set *set)
3775 struct isl_map *result;
3781 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT) &&
3782 ISL_F_ISSET(set, ISL_MAP_DISJOINT))
3783 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
3785 result = isl_map_alloc_dim(isl_dim_copy(map->dim),
3786 map->n * set->n, flags);
3789 for (i = 0; i < map->n; ++i)
3790 for (j = 0; j < set->n; ++j) {
3791 result = isl_map_add(result,
3792 isl_basic_map_intersect_range(
3793 isl_basic_map_copy(map->p[i]),
3794 isl_basic_set_copy(set->p[j])));
3807 struct isl_map *isl_map_intersect_domain(
3808 struct isl_map *map, struct isl_set *set)
3810 return isl_map_reverse(
3811 isl_map_intersect_range(isl_map_reverse(map), set));
3814 struct isl_map *isl_map_apply_domain(
3815 struct isl_map *map1, struct isl_map *map2)
3819 map1 = isl_map_reverse(map1);
3820 map1 = isl_map_apply_range(map1, map2);
3821 return isl_map_reverse(map1);
3828 struct isl_map *isl_map_apply_range(
3829 struct isl_map *map1, struct isl_map *map2)
3831 struct isl_dim *dim_result;
3832 struct isl_map *result;
3838 dim_result = isl_dim_join(isl_dim_copy(map1->dim),
3839 isl_dim_copy(map2->dim));
3841 result = isl_map_alloc_dim(dim_result, map1->n * map2->n, 0);
3844 for (i = 0; i < map1->n; ++i)
3845 for (j = 0; j < map2->n; ++j) {
3846 result = isl_map_add(result,
3847 isl_basic_map_apply_range(
3848 isl_basic_map_copy(map1->p[i]),
3849 isl_basic_map_copy(map2->p[j])));
3855 if (result && result->n <= 1)
3856 ISL_F_SET(result, ISL_MAP_DISJOINT);
3865 * returns range - domain
3867 struct isl_basic_set *isl_basic_map_deltas(struct isl_basic_map *bmap)
3869 struct isl_basic_set *bset;
3876 dim = isl_basic_map_n_in(bmap);
3877 nparam = isl_basic_map_n_param(bmap);
3878 isl_assert(bmap->ctx, dim == isl_basic_map_n_out(bmap), goto error);
3879 bset = isl_basic_set_from_basic_map(bmap);
3880 bset = isl_basic_set_cow(bset);
3881 bset = isl_basic_set_extend(bset, nparam, 3*dim, 0, dim, 0);
3882 bset = isl_basic_set_swap_vars(bset, 2*dim);
3883 for (i = 0; i < dim; ++i) {
3884 int j = isl_basic_map_alloc_equality(
3885 (struct isl_basic_map *)bset);
3888 isl_seq_clr(bset->eq[j], 1 + isl_basic_set_total_dim(bset));
3889 isl_int_set_si(bset->eq[j][1+nparam+i], 1);
3890 isl_int_set_si(bset->eq[j][1+nparam+dim+i], 1);
3891 isl_int_set_si(bset->eq[j][1+nparam+2*dim+i], -1);
3893 return isl_basic_set_project_out(bset, isl_dim_set, dim, 2*dim);
3895 isl_basic_map_free(bmap);
3900 * returns range - domain
3902 struct isl_set *isl_map_deltas(struct isl_map *map)
3905 struct isl_set *result;
3910 isl_assert(map->ctx, isl_map_n_in(map) == isl_map_n_out(map), goto error);
3911 result = isl_set_alloc(map->ctx, isl_map_n_param(map),
3912 isl_map_n_in(map), map->n, map->flags);
3915 for (i = 0; i < map->n; ++i)
3916 result = isl_set_add(result,
3917 isl_basic_map_deltas(isl_basic_map_copy(map->p[i])));
3925 static struct isl_basic_map *basic_map_identity(struct isl_dim *dims)
3927 struct isl_basic_map *bmap;
3935 nparam = dims->nparam;
3937 bmap = isl_basic_map_alloc_dim(dims, 0, dim, 0);
3941 for (i = 0; i < dim; ++i) {
3942 int j = isl_basic_map_alloc_equality(bmap);
3945 isl_seq_clr(bmap->eq[j], 1 + isl_basic_map_total_dim(bmap));
3946 isl_int_set_si(bmap->eq[j][1+nparam+i], 1);
3947 isl_int_set_si(bmap->eq[j][1+nparam+dim+i], -1);
3949 return isl_basic_map_finalize(bmap);
3951 isl_basic_map_free(bmap);
3955 struct isl_basic_map *isl_basic_map_identity(struct isl_dim *set_dim)
3957 struct isl_dim *dim = isl_dim_map(set_dim);
3960 return basic_map_identity(dim);
3963 struct isl_basic_map *isl_basic_map_identity_like(struct isl_basic_map *model)
3965 if (!model || !model->dim)
3967 isl_assert(model->ctx,
3968 model->dim->n_in == model->dim->n_out, return NULL);
3969 return basic_map_identity(isl_dim_copy(model->dim));
3972 static struct isl_map *map_identity(struct isl_dim *dim)
3974 struct isl_map *map = isl_map_alloc_dim(dim, 1, ISL_MAP_DISJOINT);
3975 return isl_map_add(map, basic_map_identity(isl_dim_copy(dim)));
3978 struct isl_map *isl_map_identity(struct isl_dim *set_dim)
3980 struct isl_dim *dim = isl_dim_map(set_dim);
3983 return map_identity(dim);
3986 struct isl_map *isl_map_identity_like(struct isl_map *model)
3988 if (!model || !model->dim)
3990 isl_assert(model->ctx,
3991 model->dim->n_in == model->dim->n_out, return NULL);
3992 return map_identity(isl_dim_copy(model->dim));
3995 struct isl_map *isl_map_identity_like_basic_map(struct isl_basic_map *model)
3997 if (!model || !model->dim)
3999 isl_assert(model->ctx,
4000 model->dim->n_in == model->dim->n_out, return NULL);
4001 return map_identity(isl_dim_copy(model->dim));
4004 /* Construct a basic set with all set dimensions having only non-negative
4007 struct isl_basic_set *isl_basic_set_positive_orthant(struct isl_dim *dims)
4012 struct isl_basic_set *bset;
4016 nparam = dims->nparam;
4018 bset = isl_basic_set_alloc_dim(dims, 0, 0, dim);
4021 for (i = 0; i < dim; ++i) {
4022 int k = isl_basic_set_alloc_inequality(bset);
4025 isl_seq_clr(bset->ineq[k], 1 + isl_basic_set_total_dim(bset));
4026 isl_int_set_si(bset->ineq[k][1 + nparam + i], 1);
4030 isl_basic_set_free(bset);
4034 int isl_set_is_equal(struct isl_set *set1, struct isl_set *set2)
4036 return isl_map_is_equal((struct isl_map *)set1, (struct isl_map *)set2);
4039 int isl_set_is_subset(struct isl_set *set1, struct isl_set *set2)
4041 return isl_map_is_subset(
4042 (struct isl_map *)set1, (struct isl_map *)set2);
4045 int isl_basic_map_is_subset(
4046 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
4049 struct isl_map *map1;
4050 struct isl_map *map2;
4052 if (!bmap1 || !bmap2)
4055 map1 = isl_map_from_basic_map(isl_basic_map_copy(bmap1));
4056 map2 = isl_map_from_basic_map(isl_basic_map_copy(bmap2));
4058 is_subset = isl_map_is_subset(map1, map2);
4066 int isl_basic_map_is_equal(
4067 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
4071 if (!bmap1 || !bmap2)
4073 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
4076 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
4080 int isl_basic_set_is_equal(
4081 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
4083 return isl_basic_map_is_equal(
4084 (struct isl_basic_map *)bset1, (struct isl_basic_map *)bset2);
4087 int isl_map_is_empty(struct isl_map *map)
4094 for (i = 0; i < map->n; ++i) {
4095 is_empty = isl_basic_map_is_empty(map->p[i]);
4104 int isl_map_fast_is_empty(struct isl_map *map)
4109 int isl_set_is_empty(struct isl_set *set)
4111 return isl_map_is_empty((struct isl_map *)set);
4114 /* Return 1 if "bmap" contains a single element.
4116 int isl_basic_map_is_singleton(__isl_keep isl_basic_map *bmap)
4124 return bmap->n_eq == isl_basic_map_total_dim(bmap);
4127 /* Return 1 if "map" contains a single element.
4129 int isl_map_is_singleton(__isl_keep isl_map *map)
4136 return isl_basic_map_is_singleton(map->p[0]);
4139 /* Given a singleton basic map, extract the single element
4142 static __isl_give isl_vec *singleton_extract_point(__isl_keep isl_basic_map *bmap)
4146 struct isl_vec *point;
4152 dim = isl_basic_map_total_dim(bmap);
4153 isl_assert(bmap->ctx, bmap->n_eq == dim, return NULL);
4154 point = isl_vec_alloc(bmap->ctx, 1 + dim);
4160 isl_int_set_si(point->el[0], 1);
4161 for (j = 0; j < bmap->n_eq; ++j) {
4163 int i = dim - 1 - j;
4164 isl_assert(bmap->ctx,
4165 isl_seq_first_non_zero(bmap->eq[j] + 1, i) == -1,
4167 isl_assert(bmap->ctx,
4168 isl_int_is_one(bmap->eq[j][1 + i]) ||
4169 isl_int_is_negone(bmap->eq[j][1 + i]),
4171 isl_assert(bmap->ctx,
4172 isl_seq_first_non_zero(bmap->eq[j]+1+i+1, dim-i-1) == -1,
4175 isl_int_gcd(m, point->el[0], bmap->eq[j][1 + i]);
4176 isl_int_divexact(m, bmap->eq[j][1 + i], m);
4178 isl_seq_scale(point->el, point->el, m, 1 + i);
4179 isl_int_divexact(m, point->el[0], bmap->eq[j][1 + i]);
4181 isl_int_mul(point->el[1 + i], m, bmap->eq[j][0]);
4188 isl_vec_free(point);
4192 /* Return 1 if "bmap" contains the point "point".
4193 * "bmap" is assumed to have known divs.
4194 * The point is first extended with the divs and then passed
4195 * to basic_map_contains.
4197 static int basic_map_contains_point(__isl_keep isl_basic_map *bmap,
4198 __isl_keep isl_vec *point)
4201 struct isl_vec *vec;
4205 if (!bmap || !point)
4207 if (bmap->n_div == 0)
4208 return basic_map_contains(bmap, point);
4210 dim = isl_basic_map_total_dim(bmap) - bmap->n_div;
4211 vec = isl_vec_alloc(bmap->ctx, 1 + dim + bmap->n_div);
4215 isl_seq_cpy(vec->el, point->el, point->size);
4216 for (i = 0; i < bmap->n_div; ++i) {
4217 isl_seq_inner_product(bmap->div[i] + 1, vec->el,
4218 1 + dim + i, &vec->el[1+dim+i]);
4219 isl_int_fdiv_q(vec->el[1+dim+i], vec->el[1+dim+i],
4223 contains = basic_map_contains(bmap, vec);
4229 /* Return 1 is the singleton map "map1" is a subset of "map2",
4230 * i.e., if the single element of "map1" is also an element of "map2".
4232 static int map_is_singleton_subset(__isl_keep isl_map *map1,
4233 __isl_keep isl_map *map2)
4237 struct isl_vec *point;
4244 point = singleton_extract_point(map1->p[0]);
4248 for (i = 0; i < map2->n; ++i) {
4249 is_subset = basic_map_contains_point(map2->p[i], point);
4254 isl_vec_free(point);
4258 int isl_map_is_subset(struct isl_map *map1, struct isl_map *map2)
4261 struct isl_map *diff;
4266 if (isl_map_is_empty(map1))
4269 if (isl_map_is_empty(map2))
4272 if (isl_map_fast_is_universe(map2))
4275 map2 = isl_map_compute_divs(isl_map_copy(map2));
4276 if (isl_map_is_singleton(map1)) {
4277 is_subset = map_is_singleton_subset(map1, map2);
4281 diff = isl_map_subtract(isl_map_copy(map1), map2);
4285 is_subset = isl_map_is_empty(diff);
4291 int isl_map_is_equal(struct isl_map *map1, struct isl_map *map2)
4297 is_subset = isl_map_is_subset(map1, map2);
4300 is_subset = isl_map_is_subset(map2, map1);
4304 int isl_basic_map_is_strict_subset(
4305 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
4309 if (!bmap1 || !bmap2)
4311 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
4314 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
4315 if (is_subset == -1)
4320 int isl_map_is_strict_subset(struct isl_map *map1, struct isl_map *map2)
4326 is_subset = isl_map_is_subset(map1, map2);
4329 is_subset = isl_map_is_subset(map2, map1);
4330 if (is_subset == -1)
4335 int isl_set_is_strict_subset(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
4337 return isl_map_is_strict_subset((isl_map *)set1, (isl_map *)set2);
4340 int isl_basic_map_is_universe(struct isl_basic_map *bmap)
4344 return bmap->n_eq == 0 && bmap->n_ineq == 0;
4347 int isl_basic_set_is_universe(struct isl_basic_set *bset)
4351 return bset->n_eq == 0 && bset->n_ineq == 0;
4354 int isl_map_fast_is_universe(__isl_keep isl_map *map)
4359 return map->n == 1 && isl_basic_map_is_universe(map->p[0]);
4362 int isl_basic_map_is_empty(struct isl_basic_map *bmap)
4364 struct isl_basic_set *bset = NULL;
4365 struct isl_vec *sample = NULL;
4372 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY))
4375 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL)) {
4376 struct isl_basic_map *copy = isl_basic_map_copy(bmap);
4377 copy = isl_basic_map_convex_hull(copy);
4378 empty = ISL_F_ISSET(copy, ISL_BASIC_MAP_EMPTY);
4379 isl_basic_map_free(copy);
4383 total = 1 + isl_basic_map_total_dim(bmap);
4384 if (bmap->sample && bmap->sample->size == total) {
4385 int contains = basic_map_contains(bmap, bmap->sample);
4391 isl_vec_free(bmap->sample);
4392 bmap->sample = NULL;
4393 bset = isl_basic_map_underlying_set(isl_basic_map_copy(bmap));
4396 sample = isl_basic_set_sample_vec(bset);
4399 empty = sample->size == 0;
4400 isl_vec_free(bmap->sample);
4401 bmap->sample = sample;
4403 ISL_F_SET(bmap, ISL_BASIC_MAP_EMPTY);
4408 int isl_basic_map_fast_is_empty(struct isl_basic_map *bmap)
4412 return ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY);
4415 int isl_basic_set_fast_is_empty(struct isl_basic_set *bset)
4419 return ISL_F_ISSET(bset, ISL_BASIC_SET_EMPTY);
4422 int isl_basic_set_is_empty(struct isl_basic_set *bset)
4424 return isl_basic_map_is_empty((struct isl_basic_map *)bset);
4427 struct isl_map *isl_basic_map_union(
4428 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
4430 struct isl_map *map;
4431 if (!bmap1 || !bmap2)
4434 isl_assert(bmap1->ctx, isl_dim_equal(bmap1->dim, bmap2->dim), goto error);
4436 map = isl_map_alloc_dim(isl_dim_copy(bmap1->dim), 2, 0);
4439 map = isl_map_add(map, bmap1);
4440 map = isl_map_add(map, bmap2);
4443 isl_basic_map_free(bmap1);
4444 isl_basic_map_free(bmap2);
4448 struct isl_set *isl_basic_set_union(
4449 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
4451 return (struct isl_set *)isl_basic_map_union(
4452 (struct isl_basic_map *)bset1,
4453 (struct isl_basic_map *)bset2);
4456 /* Order divs such that any div only depends on previous divs */
4457 struct isl_basic_map *isl_basic_map_order_divs(struct isl_basic_map *bmap)
4460 unsigned off = isl_dim_total(bmap->dim);
4462 for (i = 0; i < bmap->n_div; ++i) {
4464 if (isl_int_is_zero(bmap->div[i][0]))
4466 pos = isl_seq_first_non_zero(bmap->div[i]+1+1+off+i,
4470 isl_basic_map_swap_div(bmap, i, i + pos);
4476 struct isl_basic_set *isl_basic_set_order_divs(struct isl_basic_set *bset)
4478 return (struct isl_basic_set *)
4479 isl_basic_map_order_divs((struct isl_basic_map *)bset);
4482 /* Look for a div in dst that corresponds to the div "div" in src.
4483 * The divs before "div" in src and dst are assumed to be the same.
4485 * Returns -1 if no corresponding div was found and the position
4486 * of the corresponding div in dst otherwise.
4488 static int find_div(struct isl_basic_map *dst,
4489 struct isl_basic_map *src, unsigned div)
4493 unsigned total = isl_dim_total(src->dim);
4495 isl_assert(dst->ctx, div <= dst->n_div, return -1);
4496 for (i = div; i < dst->n_div; ++i)
4497 if (isl_seq_eq(dst->div[i], src->div[div], 1+1+total+div) &&
4498 isl_seq_first_non_zero(dst->div[i]+1+1+total+div,
4499 dst->n_div - div) == -1)
4504 struct isl_basic_map *isl_basic_map_align_divs(
4505 struct isl_basic_map *dst, struct isl_basic_map *src)
4508 unsigned total = isl_dim_total(src->dim);
4513 if (src->n_div == 0)
4516 for (i = 0; i < src->n_div; ++i)
4517 isl_assert(src->ctx, !isl_int_is_zero(src->div[i][0]), goto error);
4519 src = isl_basic_map_order_divs(src);
4520 dst = isl_basic_map_cow(dst);
4521 dst = isl_basic_map_extend_dim(dst, isl_dim_copy(dst->dim),
4522 src->n_div, 0, 2 * src->n_div);
4525 for (i = 0; i < src->n_div; ++i) {
4526 int j = find_div(dst, src, i);
4528 j = isl_basic_map_alloc_div(dst);
4531 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total+i);
4532 isl_seq_clr(dst->div[j]+1+1+total+i, dst->n_div - i);
4533 if (add_div_constraints(dst, j) < 0)
4537 isl_basic_map_swap_div(dst, i, j);
4541 isl_basic_map_free(dst);
4545 struct isl_basic_set *isl_basic_set_align_divs(
4546 struct isl_basic_set *dst, struct isl_basic_set *src)
4548 return (struct isl_basic_set *)isl_basic_map_align_divs(
4549 (struct isl_basic_map *)dst, (struct isl_basic_map *)src);
4552 struct isl_map *isl_map_align_divs(struct isl_map *map)
4560 map = isl_map_compute_divs(map);
4561 map = isl_map_cow(map);
4565 for (i = 1; i < map->n; ++i)
4566 map->p[0] = isl_basic_map_align_divs(map->p[0], map->p[i]);
4567 for (i = 1; i < map->n; ++i)
4568 map->p[i] = isl_basic_map_align_divs(map->p[i], map->p[0]);
4570 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4574 struct isl_set *isl_set_align_divs(struct isl_set *set)
4576 return (struct isl_set *)isl_map_align_divs((struct isl_map *)set);
4579 static struct isl_map *add_cut_constraint(struct isl_map *dst,
4580 struct isl_basic_map *src, isl_int *c,
4581 unsigned len, int oppose)
4583 struct isl_basic_map *copy = NULL;
4588 copy = isl_basic_map_copy(src);
4589 copy = isl_basic_map_cow(copy);
4592 copy = isl_basic_map_extend_constraints(copy, 0, 1);
4593 k = isl_basic_map_alloc_inequality(copy);
4597 isl_seq_neg(copy->ineq[k], c, len);
4599 isl_seq_cpy(copy->ineq[k], c, len);
4600 total = 1 + isl_basic_map_total_dim(copy);
4601 isl_seq_clr(copy->ineq[k]+len, total - len);
4602 isl_inequality_negate(copy, k);
4603 copy = isl_basic_map_simplify(copy);
4604 copy = isl_basic_map_finalize(copy);
4605 is_empty = isl_basic_map_is_empty(copy);
4609 dst = isl_map_add(dst, copy);
4611 isl_basic_map_free(copy);
4614 isl_basic_map_free(copy);
4619 static struct isl_map *subtract(struct isl_map *map, struct isl_basic_map *bmap)
4623 struct isl_map *rest = NULL;
4625 unsigned total = isl_basic_map_total_dim(bmap);
4627 map = isl_map_cow(map);
4632 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT))
4633 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
4635 max = map->n * (2 * bmap->n_eq + bmap->n_ineq);
4636 rest = isl_map_alloc_dim(isl_dim_copy(map->dim), max, flags);
4640 for (i = 0; i < map->n; ++i) {
4641 map->p[i] = isl_basic_map_align_divs(map->p[i], bmap);
4646 for (j = 0; j < map->n; ++j)
4647 map->p[j] = isl_basic_map_cow(map->p[j]);
4649 for (i = 0; i < bmap->n_eq; ++i) {
4650 for (j = 0; j < map->n; ++j) {
4651 rest = add_cut_constraint(rest,
4652 map->p[j], bmap->eq[i], 1+total, 0);
4656 rest = add_cut_constraint(rest,
4657 map->p[j], bmap->eq[i], 1+total, 1);
4661 map->p[j] = isl_basic_map_extend_constraints(map->p[j],
4665 k = isl_basic_map_alloc_equality(map->p[j]);
4668 isl_seq_cpy(map->p[j]->eq[k], bmap->eq[i], 1+total);
4669 isl_seq_clr(map->p[j]->eq[k]+1+total,
4670 map->p[j]->n_div - bmap->n_div);
4674 for (i = 0; i < bmap->n_ineq; ++i) {
4675 for (j = 0; j < map->n; ++j) {
4676 rest = add_cut_constraint(rest,
4677 map->p[j], bmap->ineq[i], 1+total, 0);
4681 map->p[j] = isl_basic_map_extend_constraints(map->p[j],
4685 k = isl_basic_map_alloc_inequality(map->p[j]);
4688 isl_seq_cpy(map->p[j]->ineq[k], bmap->ineq[i], 1+total);
4689 isl_seq_clr(map->p[j]->ineq[k]+1+total,
4690 map->p[j]->n_div - bmap->n_div);
4702 struct isl_map *isl_map_subtract(struct isl_map *map1, struct isl_map *map2)
4708 isl_assert(map1->ctx, isl_dim_equal(map1->dim, map2->dim), goto error);
4710 if (isl_map_is_empty(map2)) {
4715 map1 = isl_map_compute_divs(map1);
4716 map2 = isl_map_compute_divs(map2);
4720 map1 = isl_map_remove_empty_parts(map1);
4721 map2 = isl_map_remove_empty_parts(map2);
4723 for (i = 0; map1 && i < map2->n; ++i)
4724 map1 = subtract(map1, map2->p[i]);
4734 struct isl_set *isl_set_subtract(struct isl_set *set1, struct isl_set *set2)
4736 return (struct isl_set *)
4738 (struct isl_map *)set1, (struct isl_map *)set2);
4741 struct isl_set *isl_set_apply(struct isl_set *set, struct isl_map *map)
4745 isl_assert(set->ctx, isl_map_compatible_domain(map, set), goto error);
4746 map = isl_map_intersect_domain(map, set);
4747 set = isl_map_range(map);
4755 /* There is no need to cow as removing empty parts doesn't change
4756 * the meaning of the set.
4758 struct isl_map *isl_map_remove_empty_parts(struct isl_map *map)
4765 for (i = map->n-1; i >= 0; --i) {
4766 if (!ISL_F_ISSET(map->p[i], ISL_BASIC_MAP_EMPTY))
4768 isl_basic_map_free(map->p[i]);
4769 if (i != map->n-1) {
4770 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4771 map->p[i] = map->p[map->n-1];
4779 struct isl_set *isl_set_remove_empty_parts(struct isl_set *set)
4781 return (struct isl_set *)
4782 isl_map_remove_empty_parts((struct isl_map *)set);
4785 struct isl_basic_map *isl_map_copy_basic_map(struct isl_map *map)
4787 struct isl_basic_map *bmap;
4788 if (!map || map->n == 0)
4790 bmap = map->p[map->n-1];
4791 isl_assert(map->ctx, ISL_F_ISSET(bmap, ISL_BASIC_SET_FINAL), return NULL);
4792 return isl_basic_map_copy(bmap);
4795 struct isl_basic_set *isl_set_copy_basic_set(struct isl_set *set)
4797 return (struct isl_basic_set *)
4798 isl_map_copy_basic_map((struct isl_map *)set);
4801 struct isl_map *isl_map_drop_basic_map(struct isl_map *map,
4802 struct isl_basic_map *bmap)
4808 for (i = map->n-1; i >= 0; --i) {
4809 if (map->p[i] != bmap)
4811 map = isl_map_cow(map);
4814 isl_basic_map_free(map->p[i]);
4815 if (i != map->n-1) {
4816 ISL_F_CLR(map, ISL_SET_NORMALIZED);
4817 map->p[i] = map->p[map->n-1];
4822 isl_basic_map_free(bmap);
4826 isl_basic_map_free(bmap);
4830 struct isl_set *isl_set_drop_basic_set(struct isl_set *set,
4831 struct isl_basic_set *bset)
4833 return (struct isl_set *)isl_map_drop_basic_map((struct isl_map *)set,
4834 (struct isl_basic_map *)bset);
4837 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
4838 * for any common value of the parameters and dimensions preceding dim
4839 * in both basic sets, the values of dimension pos in bset1 are
4840 * smaller or larger than those in bset2.
4843 * 1 if bset1 follows bset2
4844 * -1 if bset1 precedes bset2
4845 * 0 if bset1 and bset2 are incomparable
4846 * -2 if some error occurred.
4848 int isl_basic_set_compare_at(struct isl_basic_set *bset1,
4849 struct isl_basic_set *bset2, int pos)
4851 struct isl_dim *dims;
4852 struct isl_basic_map *bmap1 = NULL;
4853 struct isl_basic_map *bmap2 = NULL;
4854 struct isl_ctx *ctx;
4855 struct isl_vec *obj;
4858 unsigned dim1, dim2;
4860 enum isl_lp_result res;
4863 if (!bset1 || !bset2)
4866 nparam = isl_basic_set_n_param(bset1);
4867 dim1 = isl_basic_set_n_dim(bset1);
4868 dim2 = isl_basic_set_n_dim(bset2);
4869 dims = isl_dim_alloc(bset1->ctx, nparam, pos, dim1 - pos);
4870 bmap1 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset1), dims);
4871 dims = isl_dim_alloc(bset2->ctx, nparam, pos, dim2 - pos);
4872 bmap2 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset2), dims);
4873 if (!bmap1 || !bmap2)
4875 bmap1 = isl_basic_map_cow(bmap1);
4876 bmap1 = isl_basic_map_extend(bmap1, nparam,
4877 pos, (dim1 - pos) + (dim2 - pos),
4878 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
4879 bmap1 = add_constraints(bmap1, bmap2, 0, dim1 - pos);
4882 total = isl_basic_map_total_dim(bmap1);
4884 obj = isl_vec_alloc(ctx, 1 + total);
4885 isl_seq_clr(obj->block.data, 1 + total);
4886 isl_int_set_si(obj->block.data[1+nparam+pos], 1);
4887 isl_int_set_si(obj->block.data[1+nparam+pos+(dim1-pos)], -1);
4892 res = isl_basic_map_solve_lp(bmap1, 0, obj->block.data, ctx->one,
4894 if (res == isl_lp_empty)
4896 else if (res == isl_lp_ok && isl_int_is_pos(num))
4898 else if ((res == isl_lp_ok && isl_int_is_neg(num)) ||
4899 res == isl_lp_unbounded)
4905 isl_basic_map_free(bmap1);
4909 isl_basic_map_free(bmap1);
4910 isl_basic_map_free(bmap2);
4914 static int isl_basic_map_fast_has_fixed_var(struct isl_basic_map *bmap,
4915 unsigned pos, isl_int *val)
4923 total = isl_basic_map_total_dim(bmap);
4924 for (i = 0, d = total-1; i < bmap->n_eq && d+1 > pos; ++i) {
4925 for (; d+1 > pos; --d)
4926 if (!isl_int_is_zero(bmap->eq[i][1+d]))
4930 if (isl_seq_first_non_zero(bmap->eq[i]+1, d) != -1)
4932 if (isl_seq_first_non_zero(bmap->eq[i]+1+d+1, total-d-1) != -1)
4934 if (!isl_int_is_one(bmap->eq[i][1+d]))
4937 isl_int_neg(*val, bmap->eq[i][0]);
4943 static int isl_map_fast_has_fixed_var(struct isl_map *map,
4944 unsigned pos, isl_int *val)
4956 return isl_basic_map_fast_has_fixed_var(map->p[0], pos, val);
4959 fixed = isl_basic_map_fast_has_fixed_var(map->p[0], pos, &v);
4960 for (i = 1; fixed == 1 && i < map->n; ++i) {
4961 fixed = isl_basic_map_fast_has_fixed_var(map->p[i], pos, &tmp);
4962 if (fixed == 1 && isl_int_ne(tmp, v))
4966 isl_int_set(*val, v);
4972 static int isl_basic_set_fast_has_fixed_var(struct isl_basic_set *bset,
4973 unsigned pos, isl_int *val)
4975 return isl_basic_map_fast_has_fixed_var((struct isl_basic_map *)bset,
4979 static int isl_set_fast_has_fixed_var(struct isl_set *set, unsigned pos,
4982 return isl_map_fast_has_fixed_var((struct isl_map *)set, pos, val);
4985 int isl_basic_map_fast_is_fixed(struct isl_basic_map *bmap,
4986 enum isl_dim_type type, unsigned pos, isl_int *val)
4988 if (pos >= isl_basic_map_dim(bmap, type))
4990 return isl_basic_map_fast_has_fixed_var(bmap,
4991 isl_basic_map_offset(bmap, type) - 1 + pos, val);
4994 int isl_map_fast_is_fixed(struct isl_map *map,
4995 enum isl_dim_type type, unsigned pos, isl_int *val)
4997 if (pos >= isl_map_dim(map, type))
4999 return isl_map_fast_has_fixed_var(map,
5000 map_offset(map, type) - 1 + pos, val);
5003 /* Check if dimension dim has fixed value and if so and if val is not NULL,
5004 * then return this fixed value in *val.
5006 int isl_basic_set_fast_dim_is_fixed(struct isl_basic_set *bset, unsigned dim,
5009 return isl_basic_set_fast_has_fixed_var(bset,
5010 isl_basic_set_n_param(bset) + dim, val);
5013 /* Check if dimension dim has fixed value and if so and if val is not NULL,
5014 * then return this fixed value in *val.
5016 int isl_set_fast_dim_is_fixed(struct isl_set *set, unsigned dim, isl_int *val)
5018 return isl_set_fast_has_fixed_var(set, isl_set_n_param(set) + dim, val);
5021 /* Check if input variable in has fixed value and if so and if val is not NULL,
5022 * then return this fixed value in *val.
5024 int isl_map_fast_input_is_fixed(struct isl_map *map, unsigned in, isl_int *val)
5026 return isl_map_fast_has_fixed_var(map, isl_map_n_param(map) + in, val);
5029 /* Check if dimension dim has an (obvious) fixed lower bound and if so
5030 * and if val is not NULL, then return this lower bound in *val.
5032 int isl_basic_set_fast_dim_has_fixed_lower_bound(struct isl_basic_set *bset,
5033 unsigned dim, isl_int *val)
5035 int i, i_eq = -1, i_ineq = -1;
5042 total = isl_basic_set_total_dim(bset);
5043 nparam = isl_basic_set_n_param(bset);
5044 for (i = 0; i < bset->n_eq; ++i) {
5045 if (isl_int_is_zero(bset->eq[i][1+nparam+dim]))
5051 for (i = 0; i < bset->n_ineq; ++i) {
5052 if (!isl_int_is_pos(bset->ineq[i][1+nparam+dim]))
5054 if (i_eq != -1 || i_ineq != -1)
5058 if (i_eq == -1 && i_ineq == -1)
5060 c = i_eq != -1 ? bset->eq[i_eq] : bset->ineq[i_ineq];
5061 /* The coefficient should always be one due to normalization. */
5062 if (!isl_int_is_one(c[1+nparam+dim]))
5064 if (isl_seq_first_non_zero(c+1, nparam+dim) != -1)
5066 if (isl_seq_first_non_zero(c+1+nparam+dim+1,
5067 total - nparam - dim - 1) != -1)
5070 isl_int_neg(*val, c[0]);
5074 int isl_set_fast_dim_has_fixed_lower_bound(struct isl_set *set,
5075 unsigned dim, isl_int *val)
5087 return isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[0],
5091 fixed = isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[0],
5093 for (i = 1; fixed == 1 && i < set->n; ++i) {
5094 fixed = isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[i],
5096 if (fixed == 1 && isl_int_ne(tmp, v))
5100 isl_int_set(*val, v);
5111 static int qsort_constraint_cmp(const void *p1, const void *p2)
5113 const struct constraint *c1 = (const struct constraint *)p1;
5114 const struct constraint *c2 = (const struct constraint *)p2;
5115 unsigned size = isl_min(c1->size, c2->size);
5116 return isl_seq_cmp(c1->c, c2->c, size);
5119 static struct isl_basic_map *isl_basic_map_sort_constraints(
5120 struct isl_basic_map *bmap)
5123 struct constraint *c;
5128 total = isl_basic_map_total_dim(bmap);
5129 c = isl_alloc_array(bmap->ctx, struct constraint, bmap->n_ineq);
5132 for (i = 0; i < bmap->n_ineq; ++i) {
5134 c[i].c = bmap->ineq[i];
5136 qsort(c, bmap->n_ineq, sizeof(struct constraint), qsort_constraint_cmp);
5137 for (i = 0; i < bmap->n_ineq; ++i)
5138 bmap->ineq[i] = c[i].c;
5142 isl_basic_map_free(bmap);
5146 struct isl_basic_map *isl_basic_map_normalize(struct isl_basic_map *bmap)
5150 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_NORMALIZED))
5152 bmap = isl_basic_map_convex_hull(bmap);
5153 bmap = isl_basic_map_sort_constraints(bmap);
5154 ISL_F_SET(bmap, ISL_BASIC_MAP_NORMALIZED);
5158 struct isl_basic_set *isl_basic_set_normalize(struct isl_basic_set *bset)
5160 return (struct isl_basic_set *)isl_basic_map_normalize(
5161 (struct isl_basic_map *)bset);
5164 static int isl_basic_map_fast_cmp(const struct isl_basic_map *bmap1,
5165 const struct isl_basic_map *bmap2)
5172 if (isl_basic_map_n_param(bmap1) != isl_basic_map_n_param(bmap2))
5173 return isl_basic_map_n_param(bmap1) - isl_basic_map_n_param(bmap2);
5174 if (isl_basic_map_n_in(bmap1) != isl_basic_map_n_in(bmap2))
5175 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
5176 if (isl_basic_map_n_out(bmap1) != isl_basic_map_n_out(bmap2))
5177 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
5178 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY) &&
5179 ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
5181 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY))
5183 if (ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
5185 if (bmap1->n_eq != bmap2->n_eq)
5186 return bmap1->n_eq - bmap2->n_eq;
5187 if (bmap1->n_ineq != bmap2->n_ineq)
5188 return bmap1->n_ineq - bmap2->n_ineq;
5189 if (bmap1->n_div != bmap2->n_div)
5190 return bmap1->n_div - bmap2->n_div;
5191 total = isl_basic_map_total_dim(bmap1);
5192 for (i = 0; i < bmap1->n_eq; ++i) {
5193 cmp = isl_seq_cmp(bmap1->eq[i], bmap2->eq[i], 1+total);
5197 for (i = 0; i < bmap1->n_ineq; ++i) {
5198 cmp = isl_seq_cmp(bmap1->ineq[i], bmap2->ineq[i], 1+total);
5202 for (i = 0; i < bmap1->n_div; ++i) {
5203 cmp = isl_seq_cmp(bmap1->div[i], bmap2->div[i], 1+1+total);
5210 static int isl_basic_map_fast_is_equal(struct isl_basic_map *bmap1,
5211 struct isl_basic_map *bmap2)
5213 return isl_basic_map_fast_cmp(bmap1, bmap2) == 0;
5216 static int qsort_bmap_cmp(const void *p1, const void *p2)
5218 const struct isl_basic_map *bmap1 = *(const struct isl_basic_map **)p1;
5219 const struct isl_basic_map *bmap2 = *(const struct isl_basic_map **)p2;
5221 return isl_basic_map_fast_cmp(bmap1, bmap2);
5224 /* We normalize in place, but if anything goes wrong we need
5225 * to return NULL, so we need to make sure we don't change the
5226 * meaning of any possible other copies of map.
5228 struct isl_map *isl_map_normalize(struct isl_map *map)
5231 struct isl_basic_map *bmap;
5235 if (ISL_F_ISSET(map, ISL_MAP_NORMALIZED))
5237 for (i = 0; i < map->n; ++i) {
5238 bmap = isl_basic_map_normalize(isl_basic_map_copy(map->p[i]));
5241 isl_basic_map_free(map->p[i]);
5244 qsort(map->p, map->n, sizeof(struct isl_basic_map *), qsort_bmap_cmp);
5245 ISL_F_SET(map, ISL_MAP_NORMALIZED);
5246 map = isl_map_remove_empty_parts(map);
5249 for (i = map->n - 1; i >= 1; --i) {
5250 if (!isl_basic_map_fast_is_equal(map->p[i-1], map->p[i]))
5252 isl_basic_map_free(map->p[i-1]);
5253 for (j = i; j < map->n; ++j)
5254 map->p[j-1] = map->p[j];
5264 struct isl_set *isl_set_normalize(struct isl_set *set)
5266 return (struct isl_set *)isl_map_normalize((struct isl_map *)set);
5269 int isl_map_fast_is_equal(struct isl_map *map1, struct isl_map *map2)
5279 if (!isl_dim_equal(map1->dim, map2->dim))
5282 map1 = isl_map_copy(map1);
5283 map2 = isl_map_copy(map2);
5284 map1 = isl_map_normalize(map1);
5285 map2 = isl_map_normalize(map2);
5288 equal = map1->n == map2->n;
5289 for (i = 0; equal && i < map1->n; ++i) {
5290 equal = isl_basic_map_fast_is_equal(map1->p[i], map2->p[i]);
5303 int isl_set_fast_is_equal(struct isl_set *set1, struct isl_set *set2)
5305 return isl_map_fast_is_equal((struct isl_map *)set1,
5306 (struct isl_map *)set2);
5309 /* Return an interval that ranges from min to max (inclusive)
5311 struct isl_basic_set *isl_basic_set_interval(struct isl_ctx *ctx,
5312 isl_int min, isl_int max)
5315 struct isl_basic_set *bset = NULL;
5317 bset = isl_basic_set_alloc(ctx, 0, 1, 0, 0, 2);
5321 k = isl_basic_set_alloc_inequality(bset);
5324 isl_int_set_si(bset->ineq[k][1], 1);
5325 isl_int_neg(bset->ineq[k][0], min);
5327 k = isl_basic_set_alloc_inequality(bset);
5330 isl_int_set_si(bset->ineq[k][1], -1);
5331 isl_int_set(bset->ineq[k][0], max);
5335 isl_basic_set_free(bset);
5339 /* Return the Cartesian product of the basic sets in list (in the given order).
5341 struct isl_basic_set *isl_basic_set_product(struct isl_basic_set_list *list)
5349 struct isl_basic_set *product = NULL;
5353 isl_assert(list->ctx, list->n > 0, goto error);
5354 isl_assert(list->ctx, list->p[0], goto error);
5355 nparam = isl_basic_set_n_param(list->p[0]);
5356 dim = isl_basic_set_n_dim(list->p[0]);
5357 extra = list->p[0]->n_div;
5358 n_eq = list->p[0]->n_eq;
5359 n_ineq = list->p[0]->n_ineq;
5360 for (i = 1; i < list->n; ++i) {
5361 isl_assert(list->ctx, list->p[i], goto error);
5362 isl_assert(list->ctx,
5363 nparam == isl_basic_set_n_param(list->p[i]), goto error);
5364 dim += isl_basic_set_n_dim(list->p[i]);
5365 extra += list->p[i]->n_div;
5366 n_eq += list->p[i]->n_eq;
5367 n_ineq += list->p[i]->n_ineq;
5369 product = isl_basic_set_alloc(list->ctx, nparam, dim, extra,
5374 for (i = 0; i < list->n; ++i) {
5375 isl_basic_set_add_constraints(product,
5376 isl_basic_set_copy(list->p[i]), dim);
5377 dim += isl_basic_set_n_dim(list->p[i]);
5379 isl_basic_set_list_free(list);
5382 isl_basic_set_free(product);
5383 isl_basic_set_list_free(list);
5387 struct isl_basic_map *isl_basic_map_product(
5388 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
5390 struct isl_dim *dim_result = NULL;
5391 struct isl_basic_map *bmap;
5392 unsigned in1, in2, out1, out2, nparam, total, pos;
5393 struct isl_dim_map *dim_map1, *dim_map2;
5395 if (!bmap1 || !bmap2)
5398 isl_assert(bmap1->ctx, isl_dim_match(bmap1->dim, isl_dim_param,
5399 bmap2->dim, isl_dim_param), goto error);
5400 dim_result = isl_dim_product(isl_dim_copy(bmap1->dim),
5401 isl_dim_copy(bmap2->dim));
5403 in1 = isl_basic_map_n_in(bmap1);
5404 in2 = isl_basic_map_n_in(bmap2);
5405 out1 = isl_basic_map_n_out(bmap1);
5406 out2 = isl_basic_map_n_out(bmap2);
5407 nparam = isl_basic_map_n_param(bmap1);
5409 total = nparam + in1 + in2 + out1 + out2 + bmap1->n_div + bmap2->n_div;
5410 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
5411 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
5412 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
5413 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
5414 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
5415 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos += in1);
5416 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += in2);
5417 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += out1);
5418 isl_dim_map_div(dim_map1, bmap1, pos += out2);
5419 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
5421 bmap = isl_basic_map_alloc_dim(dim_result,
5422 bmap1->n_div + bmap2->n_div,
5423 bmap1->n_eq + bmap2->n_eq,
5424 bmap1->n_ineq + bmap2->n_ineq);
5425 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
5426 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
5427 bmap = isl_basic_map_simplify(bmap);
5428 return isl_basic_map_finalize(bmap);
5430 isl_basic_map_free(bmap1);
5431 isl_basic_map_free(bmap2);
5435 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
5437 struct isl_map *isl_map_product(struct isl_map *map1, struct isl_map *map2)
5440 struct isl_map *result;
5446 isl_assert(map1->ctx, isl_dim_match(map1->dim, isl_dim_param,
5447 map2->dim, isl_dim_param), goto error);
5449 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
5450 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
5451 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
5453 result = isl_map_alloc_dim(isl_dim_product(isl_dim_copy(map1->dim),
5454 isl_dim_copy(map2->dim)),
5455 map1->n * map2->n, flags);
5458 for (i = 0; i < map1->n; ++i)
5459 for (j = 0; j < map2->n; ++j) {
5460 struct isl_basic_map *part;
5461 part = isl_basic_map_product(
5462 isl_basic_map_copy(map1->p[i]),
5463 isl_basic_map_copy(map2->p[j]));
5464 if (isl_basic_map_is_empty(part))
5465 isl_basic_map_free(part);
5467 result = isl_map_add(result, part);
5480 /* Given two set A and B, construct its Cartesian product A x B.
5482 struct isl_set *isl_set_product(struct isl_set *set1, struct isl_set *set2)
5484 return (struct isl_set *)isl_map_product((struct isl_map *)set1,
5485 (struct isl_map *)set2);
5488 uint32_t isl_basic_set_get_hash(struct isl_basic_set *bset)
5491 uint32_t hash = isl_hash_init();
5496 bset = isl_basic_set_copy(bset);
5497 bset = isl_basic_set_normalize(bset);
5500 total = isl_basic_set_total_dim(bset);
5501 isl_hash_byte(hash, bset->n_eq & 0xFF);
5502 for (i = 0; i < bset->n_eq; ++i) {
5504 c_hash = isl_seq_get_hash(bset->eq[i], 1 + total);
5505 isl_hash_hash(hash, c_hash);
5507 isl_hash_byte(hash, bset->n_ineq & 0xFF);
5508 for (i = 0; i < bset->n_ineq; ++i) {
5510 c_hash = isl_seq_get_hash(bset->ineq[i], 1 + total);
5511 isl_hash_hash(hash, c_hash);
5513 isl_hash_byte(hash, bset->n_div & 0xFF);
5514 for (i = 0; i < bset->n_div; ++i) {
5516 if (isl_int_is_zero(bset->div[i][0]))
5518 isl_hash_byte(hash, i & 0xFF);
5519 c_hash = isl_seq_get_hash(bset->div[i], 1 + 1 + total);
5520 isl_hash_hash(hash, c_hash);
5522 isl_basic_set_free(bset);
5526 uint32_t isl_set_get_hash(struct isl_set *set)
5533 set = isl_set_copy(set);
5534 set = isl_set_normalize(set);
5538 hash = isl_hash_init();
5539 for (i = 0; i < set->n; ++i) {
5541 bset_hash = isl_basic_set_get_hash(set->p[i]);
5542 isl_hash_hash(hash, bset_hash);
5550 /* Check if the value for dimension dim is completely determined
5551 * by the values of the other parameters and variables.
5552 * That is, check if dimension dim is involved in an equality.
5554 int isl_basic_set_dim_is_unique(struct isl_basic_set *bset, unsigned dim)
5561 nparam = isl_basic_set_n_param(bset);
5562 for (i = 0; i < bset->n_eq; ++i)
5563 if (!isl_int_is_zero(bset->eq[i][1 + nparam + dim]))
5568 /* Check if the value for dimension dim is completely determined
5569 * by the values of the other parameters and variables.
5570 * That is, check if dimension dim is involved in an equality
5571 * for each of the subsets.
5573 int isl_set_dim_is_unique(struct isl_set *set, unsigned dim)
5579 for (i = 0; i < set->n; ++i) {
5581 unique = isl_basic_set_dim_is_unique(set->p[i], dim);
5588 int isl_map_foreach_basic_map(__isl_keep isl_map *map,
5589 int (*fn)(__isl_take isl_basic_map *bmap, void *user), void *user)
5596 for (i = 0; i < map->n; ++i)
5597 if (fn(isl_basic_map_copy(map->p[i]), user) < 0)
5603 int isl_set_foreach_basic_set(__isl_keep isl_set *set,
5604 int (*fn)(__isl_take isl_basic_set *bset, void *user), void *user)
5611 for (i = 0; i < set->n; ++i)
5612 if (fn(isl_basic_set_copy(set->p[i]), user) < 0)
5618 __isl_give isl_map *isl_set_lifting(__isl_take isl_set *set)
5620 struct isl_dim *dim;
5621 struct isl_basic_map *bmap;
5628 set = isl_set_align_divs(set);
5633 dim = isl_set_get_dim(set);
5634 if (set->n == 0 || set->p[0]->n_div == 0) {
5636 return isl_map_identity(dim);
5639 n_div = set->p[0]->n_div;
5640 dim = isl_dim_map(dim);
5641 n_param = isl_dim_size(dim, isl_dim_param);
5642 n_set = isl_dim_size(dim, isl_dim_in);
5643 dim = isl_dim_extend(dim, n_param, n_set, n_set + n_div);
5644 bmap = isl_basic_map_alloc_dim(dim, 0, n_set, 2 * n_div);
5645 for (i = 0; i < n_set; ++i)
5646 bmap = var_equal(bmap, i);
5648 total = n_param + n_set + n_set + n_div;
5649 for (i = 0; i < n_div; ++i) {
5650 k = isl_basic_map_alloc_inequality(bmap);
5653 isl_seq_cpy(bmap->ineq[k], set->p[0]->div[i]+1, 1+n_param);
5654 isl_seq_clr(bmap->ineq[k]+1+n_param, n_set);
5655 isl_seq_cpy(bmap->ineq[k]+1+n_param+n_set,
5656 set->p[0]->div[i]+1+1+n_param, n_set + n_div);
5657 isl_int_neg(bmap->ineq[k][1+n_param+n_set+n_set+i],
5658 set->p[0]->div[i][0]);
5660 l = isl_basic_map_alloc_inequality(bmap);
5663 isl_seq_neg(bmap->ineq[l], bmap->ineq[k], 1 + total);
5664 isl_int_add(bmap->ineq[l][0], bmap->ineq[l][0],
5665 set->p[0]->div[i][0]);
5666 isl_int_sub_ui(bmap->ineq[l][0], bmap->ineq[l][0], 1);
5670 return isl_map_from_basic_map(bmap);
5673 isl_basic_map_free(bmap);
5677 int isl_basic_set_size(__isl_keep isl_basic_set *bset)
5685 dim = isl_basic_set_total_dim(bset);
5686 size += bset->n_eq * (1 + dim);
5687 size += bset->n_ineq * (1 + dim);
5688 size += bset->n_div * (2 + dim);
5693 int isl_set_size(__isl_keep isl_set *set)
5701 for (i = 0; i < set->n; ++i)
5702 size += isl_basic_set_size(set->p[i]);