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);
1069 return isl_basic_set_gauss(bset, NULL);
1071 isl_basic_set_free(bset);
1075 struct isl_set *isl_set_swap_vars(struct isl_set *set, unsigned n)
1078 set = isl_set_cow(set);
1082 for (i = 0; i < set->n; ++i) {
1083 set->p[i] = isl_basic_set_swap_vars(set->p[i], n);
1089 ISL_F_CLR(set, ISL_SET_NORMALIZED);
1093 struct isl_basic_map *isl_basic_map_set_to_empty(struct isl_basic_map *bmap)
1099 total = isl_basic_map_total_dim(bmap);
1100 isl_basic_map_free_div(bmap, bmap->n_div);
1101 isl_basic_map_free_inequality(bmap, bmap->n_ineq);
1103 isl_basic_map_free_equality(bmap, bmap->n_eq-1);
1105 isl_basic_map_alloc_equality(bmap);
1109 isl_int_set_si(bmap->eq[i][0], 1);
1110 isl_seq_clr(bmap->eq[i]+1, total);
1111 ISL_F_SET(bmap, ISL_BASIC_MAP_EMPTY);
1112 return isl_basic_map_finalize(bmap);
1114 isl_basic_map_free(bmap);
1118 struct isl_basic_set *isl_basic_set_set_to_empty(struct isl_basic_set *bset)
1120 return (struct isl_basic_set *)
1121 isl_basic_map_set_to_empty((struct isl_basic_map *)bset);
1124 void isl_basic_map_swap_div(struct isl_basic_map *bmap, int a, int b)
1127 unsigned off = isl_dim_total(bmap->dim);
1128 isl_int *t = bmap->div[a];
1129 bmap->div[a] = bmap->div[b];
1132 for (i = 0; i < bmap->n_eq; ++i)
1133 isl_int_swap(bmap->eq[i][1+off+a], bmap->eq[i][1+off+b]);
1135 for (i = 0; i < bmap->n_ineq; ++i)
1136 isl_int_swap(bmap->ineq[i][1+off+a], bmap->ineq[i][1+off+b]);
1138 for (i = 0; i < bmap->n_div; ++i)
1139 isl_int_swap(bmap->div[i][1+1+off+a], bmap->div[i][1+1+off+b]);
1140 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1143 /* Eliminate the specified n dimensions starting at first from the
1144 * constraints using Fourier-Motzkin, The dimensions themselves
1147 struct isl_set *isl_set_eliminate_dims(struct isl_set *set,
1148 unsigned first, unsigned n)
1158 set = isl_set_cow(set);
1161 isl_assert(set->ctx, first+n <= isl_set_n_dim(set), goto error);
1162 nparam = isl_set_n_param(set);
1164 for (i = 0; i < set->n; ++i) {
1165 set->p[i] = isl_basic_set_eliminate_vars(set->p[i],
1176 /* Project out n dimensions starting at first using Fourier-Motzkin */
1177 struct isl_set *isl_set_remove_dims(struct isl_set *set,
1178 unsigned first, unsigned n)
1180 set = isl_set_eliminate_dims(set, first, n);
1181 set = isl_set_drop_dims(set, first, n);
1185 struct isl_basic_set *isl_basic_set_remove_divs(struct isl_basic_set *bset)
1187 bset = isl_basic_set_eliminate_vars(bset, isl_dim_total(bset->dim),
1195 struct isl_set *isl_set_remove_divs(struct isl_set *set)
1204 set = isl_set_cow(set);
1208 for (i = 0; i < set->n; ++i) {
1209 set->p[i] = isl_basic_set_remove_divs(set->p[i]);
1219 struct isl_basic_map *isl_basic_map_remove(struct isl_basic_map *bmap,
1220 enum isl_dim_type type, unsigned first, unsigned n)
1224 isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
1228 bmap = isl_basic_map_eliminate_vars(bmap,
1229 isl_basic_map_offset(bmap, type) - 1 + first, n);
1232 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY) && type == isl_dim_div)
1234 bmap = isl_basic_map_drop(bmap, type, first, n);
1237 isl_basic_map_free(bmap);
1241 __isl_give isl_basic_set *isl_basic_set_remove(__isl_take isl_basic_set *bset,
1242 enum isl_dim_type type, unsigned first, unsigned n)
1244 return (isl_basic_set *)
1245 isl_basic_map_remove((isl_basic_map *)bset, type, first, n);
1248 struct isl_map *isl_map_remove(struct isl_map *map,
1249 enum isl_dim_type type, unsigned first, unsigned n)
1256 map = isl_map_cow(map);
1259 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
1261 for (i = 0; i < map->n; ++i) {
1262 map->p[i] = isl_basic_map_eliminate_vars(map->p[i],
1263 isl_basic_map_offset(map->p[i], type) - 1 + first, n);
1267 map = isl_map_drop(map, type, first, n);
1274 __isl_give isl_set *isl_set_remove(__isl_take isl_set *bset,
1275 enum isl_dim_type type, unsigned first, unsigned n)
1277 return (isl_set *)isl_map_remove((isl_map *)bset, type, first, n);
1280 /* Project out n inputs starting at first using Fourier-Motzkin */
1281 struct isl_map *isl_map_remove_inputs(struct isl_map *map,
1282 unsigned first, unsigned n)
1284 return isl_map_remove(map, isl_dim_in, first, n);
1287 /* Project out n dimensions starting at first using Fourier-Motzkin */
1288 struct isl_basic_set *isl_basic_set_remove_dims(struct isl_basic_set *bset,
1289 unsigned first, unsigned n)
1291 unsigned nparam = isl_basic_set_n_param(bset);
1292 bset = isl_basic_set_eliminate_vars(bset, nparam + first, n);
1293 bset = isl_basic_set_drop_dims(bset, first, n);
1297 static void dump_term(struct isl_basic_map *bmap,
1298 isl_int c, int pos, FILE *out)
1301 unsigned in = isl_basic_map_n_in(bmap);
1302 unsigned dim = in + isl_basic_map_n_out(bmap);
1303 unsigned nparam = isl_basic_map_n_param(bmap);
1305 isl_int_print(out, c, 0);
1307 if (!isl_int_is_one(c))
1308 isl_int_print(out, c, 0);
1309 if (pos < 1 + nparam) {
1310 name = isl_dim_get_name(bmap->dim,
1311 isl_dim_param, pos - 1);
1313 fprintf(out, "%s", name);
1315 fprintf(out, "p%d", pos - 1);
1316 } else if (pos < 1 + nparam + in)
1317 fprintf(out, "i%d", pos - 1 - nparam);
1318 else if (pos < 1 + nparam + dim)
1319 fprintf(out, "o%d", pos - 1 - nparam - in);
1321 fprintf(out, "e%d", pos - 1 - nparam - dim);
1325 static void dump_constraint_sign(struct isl_basic_map *bmap, isl_int *c,
1326 int sign, FILE *out)
1330 unsigned len = 1 + isl_basic_map_total_dim(bmap);
1334 for (i = 0, first = 1; i < len; ++i) {
1335 if (isl_int_sgn(c[i]) * sign <= 0)
1338 fprintf(out, " + ");
1340 isl_int_abs(v, c[i]);
1341 dump_term(bmap, v, i, out);
1348 static void dump_constraint(struct isl_basic_map *bmap, isl_int *c,
1349 const char *op, FILE *out, int indent)
1353 fprintf(out, "%*s", indent, "");
1355 dump_constraint_sign(bmap, c, 1, out);
1356 fprintf(out, " %s ", op);
1357 dump_constraint_sign(bmap, c, -1, out);
1361 for (i = bmap->n_div; i < bmap->extra; ++i) {
1362 if (isl_int_is_zero(c[1+isl_dim_total(bmap->dim)+i]))
1364 fprintf(out, "%*s", indent, "");
1365 fprintf(out, "ERROR: unused div coefficient not zero\n");
1370 static void dump_constraints(struct isl_basic_map *bmap,
1371 isl_int **c, unsigned n,
1372 const char *op, FILE *out, int indent)
1376 for (i = 0; i < n; ++i)
1377 dump_constraint(bmap, c[i], op, out, indent);
1380 static void dump_affine(struct isl_basic_map *bmap, isl_int *exp, FILE *out)
1384 unsigned total = isl_basic_map_total_dim(bmap);
1386 for (j = 0; j < 1 + total; ++j) {
1387 if (isl_int_is_zero(exp[j]))
1389 if (!first && isl_int_is_pos(exp[j]))
1391 dump_term(bmap, exp[j], j, out);
1396 static void dump(struct isl_basic_map *bmap, FILE *out, int indent)
1400 dump_constraints(bmap, bmap->eq, bmap->n_eq, "=", out, indent);
1401 dump_constraints(bmap, bmap->ineq, bmap->n_ineq, ">=", out, indent);
1403 for (i = 0; i < bmap->n_div; ++i) {
1404 fprintf(out, "%*s", indent, "");
1405 fprintf(out, "e%d = [(", i);
1406 dump_affine(bmap, bmap->div[i]+1, out);
1408 isl_int_print(out, bmap->div[i][0], 0);
1409 fprintf(out, "]\n");
1413 void isl_basic_set_dump(struct isl_basic_set *bset, FILE *out, int indent)
1416 fprintf(out, "null basic set\n");
1420 fprintf(out, "%*s", indent, "");
1421 fprintf(out, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n",
1422 bset->ref, bset->dim->nparam, bset->dim->n_out,
1423 bset->extra, bset->flags);
1424 dump((struct isl_basic_map *)bset, out, indent);
1427 void isl_basic_map_dump(struct isl_basic_map *bmap, FILE *out, int indent)
1430 fprintf(out, "null basic map\n");
1434 fprintf(out, "%*s", indent, "");
1435 fprintf(out, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, "
1436 "flags: %x, n_name: %d\n",
1438 bmap->dim->nparam, bmap->dim->n_in, bmap->dim->n_out,
1439 bmap->extra, bmap->flags, bmap->dim->n_name);
1440 dump(bmap, out, indent);
1443 int isl_inequality_negate(struct isl_basic_map *bmap, unsigned pos)
1448 total = isl_basic_map_total_dim(bmap);
1449 isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
1450 isl_seq_neg(bmap->ineq[pos], bmap->ineq[pos], 1 + total);
1451 isl_int_sub_ui(bmap->ineq[pos][0], bmap->ineq[pos][0], 1);
1452 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1456 struct isl_set *isl_set_alloc_dim(struct isl_dim *dim, int n, unsigned flags)
1458 struct isl_set *set;
1462 isl_assert(dim->ctx, dim->n_in == 0, return NULL);
1463 isl_assert(dim->ctx, n >= 0, return NULL);
1464 set = isl_alloc(dim->ctx, struct isl_set,
1465 sizeof(struct isl_set) +
1466 (n - 1) * sizeof(struct isl_basic_set *));
1470 set->ctx = dim->ctx;
1471 isl_ctx_ref(set->ctx);
1483 struct isl_set *isl_set_alloc(struct isl_ctx *ctx,
1484 unsigned nparam, unsigned dim, int n, unsigned flags)
1486 struct isl_set *set;
1487 struct isl_dim *dims;
1489 dims = isl_dim_alloc(ctx, nparam, 0, dim);
1493 set = isl_set_alloc_dim(dims, n, flags);
1497 /* Make sure "map" has room for at least "n" more basic maps.
1499 struct isl_map *isl_map_grow(struct isl_map *map, int n)
1502 struct isl_map *grown = NULL;
1506 isl_assert(map->ctx, n >= 0, goto error);
1507 if (map->n + n <= map->size)
1509 grown = isl_map_alloc_dim(isl_map_get_dim(map), map->n + n, map->flags);
1512 for (i = 0; i < map->n; ++i) {
1513 grown->p[i] = isl_basic_map_copy(map->p[i]);
1521 isl_map_free(grown);
1526 /* Make sure "set" has room for at least "n" more basic sets.
1528 struct isl_set *isl_set_grow(struct isl_set *set, int n)
1530 return (struct isl_set *)isl_map_grow((struct isl_map *)set, n);
1533 struct isl_set *isl_set_dup(struct isl_set *set)
1536 struct isl_set *dup;
1541 dup = isl_set_alloc_dim(isl_dim_copy(set->dim), set->n, set->flags);
1544 for (i = 0; i < set->n; ++i)
1545 dup = isl_set_add(dup, isl_basic_set_copy(set->p[i]));
1549 struct isl_set *isl_set_from_basic_set(struct isl_basic_set *bset)
1551 struct isl_set *set;
1556 set = isl_set_alloc_dim(isl_dim_copy(bset->dim), 1, ISL_MAP_DISJOINT);
1558 isl_basic_set_free(bset);
1561 return isl_set_add(set, bset);
1564 struct isl_map *isl_map_from_basic_map(struct isl_basic_map *bmap)
1566 struct isl_map *map;
1571 map = isl_map_alloc_dim(isl_dim_copy(bmap->dim), 1, ISL_MAP_DISJOINT);
1573 isl_basic_map_free(bmap);
1576 return isl_map_add(map, bmap);
1579 struct isl_set *isl_set_add(struct isl_set *set, struct isl_basic_set *bset)
1581 return (struct isl_set *)isl_map_add((struct isl_map *)set,
1582 (struct isl_basic_map *)bset);
1585 void isl_set_free(struct isl_set *set)
1595 isl_ctx_deref(set->ctx);
1596 for (i = 0; i < set->n; ++i)
1597 isl_basic_set_free(set->p[i]);
1598 isl_dim_free(set->dim);
1602 void isl_set_dump(struct isl_set *set, FILE *out, int indent)
1607 fprintf(out, "null set\n");
1611 fprintf(out, "%*s", indent, "");
1612 fprintf(out, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
1613 set->ref, set->n, set->dim->nparam, set->dim->n_out,
1615 for (i = 0; i < set->n; ++i) {
1616 fprintf(out, "%*s", indent, "");
1617 fprintf(out, "basic set %d:\n", i);
1618 isl_basic_set_dump(set->p[i], out, indent+4);
1622 void isl_map_dump(struct isl_map *map, FILE *out, int indent)
1627 fprintf(out, "null map\n");
1631 fprintf(out, "%*s", indent, "");
1632 fprintf(out, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, "
1633 "flags: %x, n_name: %d\n",
1634 map->ref, map->n, map->dim->nparam, map->dim->n_in,
1635 map->dim->n_out, map->flags, map->dim->n_name);
1636 for (i = 0; i < map->n; ++i) {
1637 fprintf(out, "%*s", indent, "");
1638 fprintf(out, "basic map %d:\n", i);
1639 isl_basic_map_dump(map->p[i], out, indent+4);
1643 struct isl_basic_map *isl_basic_map_intersect_domain(
1644 struct isl_basic_map *bmap, struct isl_basic_set *bset)
1646 struct isl_basic_map *bmap_domain;
1647 struct isl_dim *dim;
1652 isl_assert(bset->ctx, isl_dim_match(bmap->dim, isl_dim_param,
1653 bset->dim, isl_dim_param), goto error);
1655 if (isl_dim_size(bset->dim, isl_dim_set) != 0)
1656 isl_assert(bset->ctx,
1657 isl_basic_map_compatible_domain(bmap, bset), goto error);
1659 bmap = isl_basic_map_cow(bmap);
1660 bmap = isl_basic_map_extend_dim(bmap, isl_dim_copy(bmap->dim),
1661 bset->n_div, bset->n_eq, bset->n_ineq);
1664 dim = isl_dim_reverse(isl_dim_copy(bset->dim));
1665 bmap_domain = isl_basic_map_from_basic_set(bset, dim);
1666 bmap = add_constraints(bmap, bmap_domain, 0, 0);
1668 bmap = isl_basic_map_simplify(bmap);
1669 return isl_basic_map_finalize(bmap);
1671 isl_basic_map_free(bmap);
1672 isl_basic_set_free(bset);
1676 struct isl_basic_map *isl_basic_map_intersect_range(
1677 struct isl_basic_map *bmap, struct isl_basic_set *bset)
1679 struct isl_basic_map *bmap_range;
1684 isl_assert(bset->ctx, isl_dim_match(bmap->dim, isl_dim_param,
1685 bset->dim, isl_dim_param), goto error);
1687 if (isl_dim_size(bset->dim, isl_dim_set) != 0)
1688 isl_assert(bset->ctx,
1689 isl_basic_map_compatible_range(bmap, bset), goto error);
1691 bmap = isl_basic_map_cow(bmap);
1692 bmap = isl_basic_map_extend_dim(bmap, isl_dim_copy(bmap->dim),
1693 bset->n_div, bset->n_eq, bset->n_ineq);
1696 bmap_range = isl_basic_map_from_basic_set(bset, isl_dim_copy(bset->dim));
1697 bmap = add_constraints(bmap, bmap_range, 0, 0);
1699 bmap = isl_basic_map_simplify(bmap);
1700 return isl_basic_map_finalize(bmap);
1702 isl_basic_map_free(bmap);
1703 isl_basic_set_free(bset);
1707 static int basic_map_contains(struct isl_basic_map *bmap, struct isl_vec *vec)
1713 total = 1 + isl_basic_map_total_dim(bmap);
1714 if (total != vec->size)
1719 for (i = 0; i < bmap->n_eq; ++i) {
1720 isl_seq_inner_product(vec->el, bmap->eq[i], total, &s);
1721 if (!isl_int_is_zero(s)) {
1727 for (i = 0; i < bmap->n_ineq; ++i) {
1728 isl_seq_inner_product(vec->el, bmap->ineq[i], total, &s);
1729 if (isl_int_is_neg(s)) {
1740 int isl_basic_set_contains(struct isl_basic_set *bset, struct isl_vec *vec)
1742 return basic_map_contains((struct isl_basic_map *)bset, vec);
1745 struct isl_basic_map *isl_basic_map_intersect(
1746 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
1748 struct isl_vec *sample = NULL;
1750 if (!bmap1 || !bmap2)
1753 isl_assert(bmap1->ctx, isl_dim_match(bmap1->dim, isl_dim_param,
1754 bmap2->dim, isl_dim_param), goto error);
1755 if (isl_dim_total(bmap1->dim) ==
1756 isl_dim_size(bmap1->dim, isl_dim_param) &&
1757 isl_dim_total(bmap2->dim) !=
1758 isl_dim_size(bmap2->dim, isl_dim_param))
1759 return isl_basic_map_intersect(bmap2, bmap1);
1761 if (isl_dim_total(bmap2->dim) !=
1762 isl_dim_size(bmap2->dim, isl_dim_param))
1763 isl_assert(bmap1->ctx,
1764 isl_dim_equal(bmap1->dim, bmap2->dim), goto error);
1766 if (bmap1->sample &&
1767 basic_map_contains(bmap1, bmap1->sample) > 0 &&
1768 basic_map_contains(bmap2, bmap1->sample) > 0)
1769 sample = isl_vec_copy(bmap1->sample);
1770 else if (bmap2->sample &&
1771 basic_map_contains(bmap1, bmap2->sample) > 0 &&
1772 basic_map_contains(bmap2, bmap2->sample) > 0)
1773 sample = isl_vec_copy(bmap2->sample);
1775 bmap1 = isl_basic_map_cow(bmap1);
1776 bmap1 = isl_basic_map_extend_dim(bmap1, isl_dim_copy(bmap1->dim),
1777 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
1780 bmap1 = add_constraints(bmap1, bmap2, 0, 0);
1783 isl_vec_free(bmap1->sample);
1784 bmap1->sample = sample;
1787 bmap1 = isl_basic_map_simplify(bmap1);
1788 return isl_basic_map_finalize(bmap1);
1791 isl_vec_free(sample);
1792 isl_basic_map_free(bmap1);
1793 isl_basic_map_free(bmap2);
1797 struct isl_basic_set *isl_basic_set_intersect(
1798 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
1800 return (struct isl_basic_set *)
1801 isl_basic_map_intersect(
1802 (struct isl_basic_map *)bset1,
1803 (struct isl_basic_map *)bset2);
1806 struct isl_map *isl_map_intersect(struct isl_map *map1, struct isl_map *map2)
1809 struct isl_map *result;
1815 isl_assert(map1->ctx, isl_dim_match(map1->dim, isl_dim_param,
1816 map2->dim, isl_dim_param), goto error);
1817 if (isl_dim_total(map1->dim) ==
1818 isl_dim_size(map1->dim, isl_dim_param) &&
1819 isl_dim_total(map2->dim) != isl_dim_size(map2->dim, isl_dim_param))
1820 return isl_map_intersect(map2, map1);
1822 if (isl_dim_total(map2->dim) != isl_dim_size(map2->dim, isl_dim_param))
1823 isl_assert(map1->ctx,
1824 isl_dim_equal(map1->dim, map2->dim), goto error);
1826 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
1827 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
1828 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
1830 result = isl_map_alloc_dim(isl_dim_copy(map1->dim),
1831 map1->n * map2->n, flags);
1834 for (i = 0; i < map1->n; ++i)
1835 for (j = 0; j < map2->n; ++j) {
1836 struct isl_basic_map *part;
1837 part = isl_basic_map_intersect(
1838 isl_basic_map_copy(map1->p[i]),
1839 isl_basic_map_copy(map2->p[j]));
1840 if (isl_basic_map_is_empty(part))
1841 isl_basic_map_free(part);
1843 result = isl_map_add(result, part);
1856 struct isl_set *isl_set_intersect(struct isl_set *set1, struct isl_set *set2)
1858 return (struct isl_set *)
1859 isl_map_intersect((struct isl_map *)set1,
1860 (struct isl_map *)set2);
1863 struct isl_basic_map *isl_basic_map_reverse(struct isl_basic_map *bmap)
1865 struct isl_dim *dim;
1866 struct isl_basic_set *bset;
1871 bmap = isl_basic_map_cow(bmap);
1874 dim = isl_dim_reverse(isl_dim_copy(bmap->dim));
1875 in = isl_basic_map_n_in(bmap);
1876 bset = isl_basic_set_from_basic_map(bmap);
1877 bset = isl_basic_set_swap_vars(bset, in);
1878 return isl_basic_map_from_basic_set(bset, dim);
1881 /* Turn final n dimensions into existentially quantified variables.
1883 struct isl_basic_set *isl_basic_set_project_out(struct isl_basic_set *bset,
1884 enum isl_dim_type type, unsigned first, unsigned n)
1894 isl_assert(bset->ctx, type == isl_dim_set, goto error);
1895 isl_assert(bset->ctx, first + n == isl_basic_set_n_dim(bset), goto error);
1900 if (ISL_F_ISSET(bset, ISL_BASIC_SET_RATIONAL))
1901 return isl_basic_set_remove(bset, type, first, n);
1903 bset = isl_basic_set_cow(bset);
1905 row_size = 1 + isl_dim_total(bset->dim) + bset->extra;
1906 old = bset->block2.data;
1907 bset->block2 = isl_blk_extend(bset->ctx, bset->block2,
1908 (bset->extra + n) * (1 + row_size));
1909 if (!bset->block2.data)
1911 new_div = isl_alloc_array(ctx, isl_int *, bset->extra + n);
1914 for (i = 0; i < n; ++i) {
1915 new_div[i] = bset->block2.data +
1916 (bset->extra + i) * (1 + row_size);
1917 isl_seq_clr(new_div[i], 1 + row_size);
1919 for (i = 0; i < bset->extra; ++i)
1920 new_div[n + i] = bset->block2.data + (bset->div[i] - old);
1922 bset->div = new_div;
1925 bset->dim = isl_dim_drop_outputs(bset->dim,
1926 isl_basic_set_n_dim(bset) - n, n);
1929 bset = isl_basic_set_simplify(bset);
1930 bset = isl_basic_set_drop_redundant_divs(bset);
1931 return isl_basic_set_finalize(bset);
1933 isl_basic_set_free(bset);
1937 /* Turn final n dimensions into existentially quantified variables.
1939 __isl_give isl_set *isl_set_project_out(__isl_take isl_set *set,
1940 enum isl_dim_type type, unsigned first, unsigned n)
1947 isl_assert(set->ctx, type == isl_dim_set, goto error);
1948 isl_assert(set->ctx, first + n == isl_set_n_dim(set), goto error);
1953 set = isl_set_cow(set);
1956 set->dim = isl_dim_drop_outputs(set->dim, first, n);
1957 for (i = 0; i < set->n; ++i) {
1958 set->p[i] = isl_basic_set_project_out(set->p[i], type, first, n);
1963 ISL_F_CLR(set, ISL_SET_NORMALIZED);
1970 static struct isl_basic_map *add_divs(struct isl_basic_map *bmap, unsigned n)
1974 for (i = 0; i < n; ++i) {
1975 j = isl_basic_map_alloc_div(bmap);
1978 isl_seq_clr(bmap->div[j], 1+1+isl_basic_map_total_dim(bmap));
1982 isl_basic_map_free(bmap);
1986 struct isl_basic_map *isl_basic_map_apply_range(
1987 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
1989 struct isl_dim *dim_result = NULL;
1990 struct isl_basic_map *bmap;
1991 unsigned n_in, n_out, n, nparam, total, pos;
1992 struct isl_dim_map *dim_map1, *dim_map2;
1994 if (!bmap1 || !bmap2)
1997 dim_result = isl_dim_join(isl_dim_copy(bmap1->dim),
1998 isl_dim_copy(bmap2->dim));
2000 n_in = isl_basic_map_n_in(bmap1);
2001 n_out = isl_basic_map_n_out(bmap2);
2002 n = isl_basic_map_n_out(bmap1);
2003 nparam = isl_basic_map_n_param(bmap1);
2005 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + n;
2006 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
2007 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
2008 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
2009 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
2010 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
2011 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_in);
2012 isl_dim_map_div(dim_map1, bmap1, pos += n_out);
2013 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
2014 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
2015 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
2017 bmap = isl_basic_map_alloc_dim(dim_result,
2018 bmap1->n_div + bmap2->n_div + n,
2019 bmap1->n_eq + bmap2->n_eq,
2020 bmap1->n_ineq + bmap2->n_ineq);
2021 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
2022 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
2023 bmap = add_divs(bmap, n);
2024 bmap = isl_basic_map_simplify(bmap);
2025 bmap = isl_basic_map_drop_redundant_divs(bmap);
2026 return isl_basic_map_finalize(bmap);
2028 isl_basic_map_free(bmap1);
2029 isl_basic_map_free(bmap2);
2033 struct isl_basic_set *isl_basic_set_apply(
2034 struct isl_basic_set *bset, struct isl_basic_map *bmap)
2039 isl_assert(bset->ctx, isl_basic_map_compatible_domain(bmap, bset),
2042 return (struct isl_basic_set *)
2043 isl_basic_map_apply_range((struct isl_basic_map *)bset, bmap);
2045 isl_basic_set_free(bset);
2046 isl_basic_map_free(bmap);
2050 struct isl_basic_map *isl_basic_map_apply_domain(
2051 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2053 if (!bmap1 || !bmap2)
2056 isl_assert(bmap1->ctx,
2057 isl_basic_map_n_in(bmap1) == isl_basic_map_n_in(bmap2), goto error);
2058 isl_assert(bmap1->ctx,
2059 isl_basic_map_n_param(bmap1) == isl_basic_map_n_param(bmap2),
2062 bmap1 = isl_basic_map_reverse(bmap1);
2063 bmap1 = isl_basic_map_apply_range(bmap1, bmap2);
2064 return isl_basic_map_reverse(bmap1);
2066 isl_basic_map_free(bmap1);
2067 isl_basic_map_free(bmap2);
2071 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
2072 * A \cap B -> f(A) + f(B)
2074 struct isl_basic_map *isl_basic_map_sum(
2075 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2077 unsigned n_in, n_out, nparam, total, pos;
2078 struct isl_basic_map *bmap = NULL;
2079 struct isl_dim_map *dim_map1, *dim_map2;
2082 if (!bmap1 || !bmap2)
2085 isl_assert(bmap1->ctx, isl_dim_equal(bmap1->dim, bmap2->dim),
2088 nparam = isl_basic_map_n_param(bmap1);
2089 n_in = isl_basic_map_n_in(bmap1);
2090 n_out = isl_basic_map_n_out(bmap1);
2092 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + 2 * n_out;
2093 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
2094 dim_map2 = isl_dim_map_alloc(bmap2->ctx, total);
2095 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
2096 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos);
2097 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
2098 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
2099 isl_dim_map_div(dim_map1, bmap1, pos += n_in + n_out);
2100 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
2101 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
2102 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_out);
2104 bmap = isl_basic_map_alloc_dim(isl_dim_copy(bmap1->dim),
2105 bmap1->n_div + bmap2->n_div + 2 * n_out,
2106 bmap1->n_eq + bmap2->n_eq + n_out,
2107 bmap1->n_ineq + bmap2->n_ineq);
2108 for (i = 0; i < n_out; ++i) {
2109 int j = isl_basic_map_alloc_equality(bmap);
2112 isl_seq_clr(bmap->eq[j], 1+total);
2113 isl_int_set_si(bmap->eq[j][1+nparam+n_in+i], -1);
2114 isl_int_set_si(bmap->eq[j][1+pos+i], 1);
2115 isl_int_set_si(bmap->eq[j][1+pos-n_out+i], 1);
2117 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
2118 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
2119 bmap = add_divs(bmap, 2 * n_out);
2121 bmap = isl_basic_map_simplify(bmap);
2122 return isl_basic_map_finalize(bmap);
2124 isl_basic_map_free(bmap);
2125 isl_basic_map_free(bmap1);
2126 isl_basic_map_free(bmap2);
2130 /* Given two maps A -> f(A) and B -> g(B), construct a map
2131 * A \cap B -> f(A) + f(B)
2133 struct isl_map *isl_map_sum(struct isl_map *map1, struct isl_map *map2)
2135 struct isl_map *result;
2141 isl_assert(map1->ctx, isl_dim_equal(map1->dim, map2->dim), goto error);
2143 result = isl_map_alloc_dim(isl_dim_copy(map1->dim),
2144 map1->n * map2->n, 0);
2147 for (i = 0; i < map1->n; ++i)
2148 for (j = 0; j < map2->n; ++j) {
2149 struct isl_basic_map *part;
2150 part = isl_basic_map_sum(
2151 isl_basic_map_copy(map1->p[i]),
2152 isl_basic_map_copy(map2->p[j]));
2153 if (isl_basic_map_is_empty(part))
2154 isl_basic_map_free(part);
2156 result = isl_map_add(result, part);
2169 /* Given a basic map A -> f(A), construct A -> -f(A).
2171 struct isl_basic_map *isl_basic_map_neg(struct isl_basic_map *bmap)
2176 bmap = isl_basic_map_cow(bmap);
2180 n = isl_basic_map_dim(bmap, isl_dim_out);
2181 off = isl_basic_map_offset(bmap, isl_dim_out);
2182 for (i = 0; i < bmap->n_eq; ++i)
2183 for (j = 0; j < n; ++j)
2184 isl_int_neg(bmap->eq[i][off+j], bmap->eq[i][off+j]);
2185 for (i = 0; i < bmap->n_ineq; ++i)
2186 for (j = 0; j < n; ++j)
2187 isl_int_neg(bmap->ineq[i][off+j], bmap->ineq[i][off+j]);
2188 for (i = 0; i < bmap->n_div; ++i)
2189 for (j = 0; j < n; ++j)
2190 isl_int_neg(bmap->div[i][1+off+j], bmap->div[i][1+off+j]);
2191 return isl_basic_map_finalize(bmap);
2194 /* Given a map A -> f(A), construct A -> -f(A).
2196 struct isl_map *isl_map_neg(struct isl_map *map)
2200 map = isl_map_cow(map);
2204 for (i = 0; i < map->n; ++i) {
2205 map->p[i] = isl_basic_map_neg(map->p[i]);
2216 /* Given a basic map A -> f(A) and an integer d, construct a basic map
2217 * A -> floor(f(A)/d).
2219 struct isl_basic_map *isl_basic_map_floordiv(struct isl_basic_map *bmap,
2222 unsigned n_in, n_out, nparam, total, pos;
2223 struct isl_basic_map *result = NULL;
2224 struct isl_dim_map *dim_map;
2230 nparam = isl_basic_map_n_param(bmap);
2231 n_in = isl_basic_map_n_in(bmap);
2232 n_out = isl_basic_map_n_out(bmap);
2234 total = nparam + n_in + n_out + bmap->n_div + n_out;
2235 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2236 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_param, pos = 0);
2237 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_in, pos += nparam);
2238 isl_dim_map_div(dim_map, bmap, pos += n_in + n_out);
2239 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_out, pos += bmap->n_div);
2241 result = isl_basic_map_alloc_dim(isl_dim_copy(bmap->dim),
2242 bmap->n_div + n_out,
2243 bmap->n_eq, bmap->n_ineq + 2 * n_out);
2244 result = add_constraints_dim_map(result, bmap, dim_map);
2245 result = add_divs(result, n_out);
2246 for (i = 0; i < n_out; ++i) {
2248 j = isl_basic_map_alloc_inequality(result);
2251 isl_seq_clr(result->ineq[j], 1+total);
2252 isl_int_neg(result->ineq[j][1+nparam+n_in+i], d);
2253 isl_int_set_si(result->ineq[j][1+pos+i], 1);
2254 j = isl_basic_map_alloc_inequality(result);
2257 isl_seq_clr(result->ineq[j], 1+total);
2258 isl_int_set(result->ineq[j][1+nparam+n_in+i], d);
2259 isl_int_set_si(result->ineq[j][1+pos+i], -1);
2260 isl_int_sub_ui(result->ineq[j][0], d, 1);
2263 result = isl_basic_map_simplify(result);
2264 return isl_basic_map_finalize(result);
2266 isl_basic_map_free(result);
2270 /* Given a map A -> f(A) and an integer d, construct a map
2271 * A -> floor(f(A)/d).
2273 struct isl_map *isl_map_floordiv(struct isl_map *map, isl_int d)
2277 map = isl_map_cow(map);
2281 ISL_F_CLR(map, ISL_MAP_DISJOINT);
2282 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
2283 for (i = 0; i < map->n; ++i) {
2284 map->p[i] = isl_basic_map_floordiv(map->p[i], d);
2295 static struct isl_basic_map *var_equal(struct isl_basic_map *bmap, unsigned pos)
2301 i = isl_basic_map_alloc_equality(bmap);
2304 nparam = isl_basic_map_n_param(bmap);
2305 n_in = isl_basic_map_n_in(bmap);
2306 isl_seq_clr(bmap->eq[i], 1 + isl_basic_map_total_dim(bmap));
2307 isl_int_set_si(bmap->eq[i][1+nparam+pos], -1);
2308 isl_int_set_si(bmap->eq[i][1+nparam+n_in+pos], 1);
2309 return isl_basic_map_finalize(bmap);
2311 isl_basic_map_free(bmap);
2315 /* Add a constraints to "bmap" expressing i_pos < o_pos
2317 static struct isl_basic_map *var_less(struct isl_basic_map *bmap, unsigned pos)
2323 i = isl_basic_map_alloc_inequality(bmap);
2326 nparam = isl_basic_map_n_param(bmap);
2327 n_in = isl_basic_map_n_in(bmap);
2328 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
2329 isl_int_set_si(bmap->ineq[i][0], -1);
2330 isl_int_set_si(bmap->ineq[i][1+nparam+pos], -1);
2331 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], 1);
2332 return isl_basic_map_finalize(bmap);
2334 isl_basic_map_free(bmap);
2338 /* Add a constraints to "bmap" expressing i_pos > o_pos
2340 static struct isl_basic_map *var_more(struct isl_basic_map *bmap, unsigned pos)
2346 i = isl_basic_map_alloc_inequality(bmap);
2349 nparam = isl_basic_map_n_param(bmap);
2350 n_in = isl_basic_map_n_in(bmap);
2351 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
2352 isl_int_set_si(bmap->ineq[i][0], -1);
2353 isl_int_set_si(bmap->ineq[i][1+nparam+pos], 1);
2354 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], -1);
2355 return isl_basic_map_finalize(bmap);
2357 isl_basic_map_free(bmap);
2361 struct isl_basic_map *isl_basic_map_equal(struct isl_dim *dim, unsigned n_equal)
2364 struct isl_basic_map *bmap;
2365 bmap = isl_basic_map_alloc_dim(dim, 0, n_equal, 0);
2368 for (i = 0; i < n_equal && bmap; ++i)
2369 bmap = var_equal(bmap, i);
2370 return isl_basic_map_finalize(bmap);
2373 /* Return a relation on pairs of sets of dimension "dim" expressing i_pos < o_pos
2375 struct isl_basic_map *isl_basic_map_less_at(struct isl_dim *dim, unsigned pos)
2378 struct isl_basic_map *bmap;
2379 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
2382 for (i = 0; i < pos && bmap; ++i)
2383 bmap = var_equal(bmap, i);
2385 bmap = var_less(bmap, pos);
2386 return isl_basic_map_finalize(bmap);
2389 /* Return a relation on pairs of sets of dimension "dim" expressing i_pos > o_pos
2391 struct isl_basic_map *isl_basic_map_more_at(struct isl_dim *dim, unsigned pos)
2394 struct isl_basic_map *bmap;
2395 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
2398 for (i = 0; i < pos && bmap; ++i)
2399 bmap = var_equal(bmap, i);
2401 bmap = var_more(bmap, pos);
2402 return isl_basic_map_finalize(bmap);
2405 static __isl_give isl_map *map_lex_lte(__isl_take isl_dim *dims, int equal)
2407 struct isl_map *map;
2414 map = isl_map_alloc_dim(isl_dim_copy(dims), dim + equal, ISL_MAP_DISJOINT);
2416 for (i = 0; i < dim; ++i)
2417 map = isl_map_add(map,
2418 isl_basic_map_less_at(isl_dim_copy(dims), i));
2420 map = isl_map_add(map,
2421 isl_basic_map_equal(isl_dim_copy(dims), dim));
2427 __isl_give isl_map *isl_map_lex_lt(__isl_take isl_dim *set_dim)
2429 return map_lex_lte(isl_dim_map(set_dim), 0);
2432 __isl_give isl_map *isl_map_lex_le(__isl_take isl_dim *set_dim)
2434 return map_lex_lte(isl_dim_map(set_dim), 1);
2437 static __isl_give isl_map *map_lex_gte(__isl_take isl_dim *dims, int equal)
2439 struct isl_map *map;
2446 map = isl_map_alloc_dim(isl_dim_copy(dims), dim + equal, ISL_MAP_DISJOINT);
2448 for (i = 0; i < dim; ++i)
2449 map = isl_map_add(map,
2450 isl_basic_map_more_at(isl_dim_copy(dims), i));
2452 map = isl_map_add(map,
2453 isl_basic_map_equal(isl_dim_copy(dims), dim));
2459 __isl_give isl_map *isl_map_lex_gt(__isl_take isl_dim *set_dim)
2461 return map_lex_gte(isl_dim_map(set_dim), 0);
2464 __isl_give isl_map *isl_map_lex_ge(__isl_take isl_dim *set_dim)
2466 return map_lex_gte(isl_dim_map(set_dim), 1);
2469 struct isl_basic_map *isl_basic_map_from_basic_set(
2470 struct isl_basic_set *bset, struct isl_dim *dim)
2472 struct isl_basic_map *bmap;
2474 bset = isl_basic_set_cow(bset);
2478 isl_assert(bset->ctx, isl_dim_compatible(bset->dim, dim), goto error);
2479 isl_dim_free(bset->dim);
2480 bmap = (struct isl_basic_map *) bset;
2482 return isl_basic_map_finalize(bmap);
2484 isl_basic_set_free(bset);
2489 struct isl_basic_set *isl_basic_set_from_basic_map(struct isl_basic_map *bmap)
2493 if (bmap->dim->n_in == 0)
2494 return (struct isl_basic_set *)bmap;
2495 bmap = isl_basic_map_cow(bmap);
2498 bmap->dim = isl_dim_cow(bmap->dim);
2501 bmap->dim->n_out += bmap->dim->n_in;
2502 bmap->dim->n_in = 0;
2503 bmap = isl_basic_map_finalize(bmap);
2504 return (struct isl_basic_set *)bmap;
2506 isl_basic_map_free(bmap);
2510 /* For a div d = floor(f/m), add the constraints
2513 * -(f-(n-1)) + m d >= 0
2515 * Note that the second constraint is the negation of
2519 static int add_div_constraints(struct isl_basic_map *bmap, unsigned div)
2522 unsigned total = isl_basic_map_total_dim(bmap);
2523 unsigned div_pos = 1 + total - bmap->n_div + div;
2525 i = isl_basic_map_alloc_inequality(bmap);
2528 isl_seq_cpy(bmap->ineq[i], bmap->div[div]+1, 1+total);
2529 isl_int_neg(bmap->ineq[i][div_pos], bmap->div[div][0]);
2531 j = isl_basic_map_alloc_inequality(bmap);
2534 isl_seq_neg(bmap->ineq[j], bmap->ineq[i], 1 + total);
2535 isl_int_add(bmap->ineq[j][0], bmap->ineq[j][0], bmap->ineq[j][div_pos]);
2536 isl_int_sub_ui(bmap->ineq[j][0], bmap->ineq[j][0], 1);
2540 struct isl_basic_set *isl_basic_map_underlying_set(
2541 struct isl_basic_map *bmap)
2545 if (bmap->dim->nparam == 0 && bmap->dim->n_in == 0 && bmap->n_div == 0)
2546 return (struct isl_basic_set *)bmap;
2547 bmap = isl_basic_map_cow(bmap);
2550 bmap->dim = isl_dim_underlying(bmap->dim, bmap->n_div);
2553 bmap->extra -= bmap->n_div;
2555 bmap = isl_basic_map_finalize(bmap);
2556 return (struct isl_basic_set *)bmap;
2561 __isl_give isl_basic_set *isl_basic_set_underlying_set(
2562 __isl_take isl_basic_set *bset)
2564 return isl_basic_map_underlying_set((isl_basic_map *)bset);
2567 struct isl_basic_map *isl_basic_map_overlying_set(
2568 struct isl_basic_set *bset, struct isl_basic_map *like)
2570 struct isl_basic_map *bmap;
2571 struct isl_ctx *ctx;
2578 isl_assert(ctx, bset->n_div == 0, goto error);
2579 isl_assert(ctx, isl_basic_set_n_param(bset) == 0, goto error);
2580 isl_assert(ctx, bset->dim->n_out == isl_basic_map_total_dim(like),
2582 if (isl_dim_equal(bset->dim, like->dim) && like->n_div == 0) {
2583 isl_basic_map_free(like);
2584 return (struct isl_basic_map *)bset;
2586 bset = isl_basic_set_cow(bset);
2589 total = bset->dim->n_out + bset->extra;
2590 bmap = (struct isl_basic_map *)bset;
2591 isl_dim_free(bmap->dim);
2592 bmap->dim = isl_dim_copy(like->dim);
2595 bmap->n_div = like->n_div;
2596 bmap->extra += like->n_div;
2599 ltotal = total - bmap->extra + like->extra;
2602 bmap->block2 = isl_blk_extend(ctx, bmap->block2,
2603 bmap->extra * (1 + 1 + total));
2604 if (isl_blk_is_error(bmap->block2))
2606 bmap->div = isl_realloc_array(ctx, bmap->div, isl_int *,
2610 for (i = 0; i < bmap->extra; ++i)
2611 bmap->div[i] = bmap->block2.data + i * (1 + 1 + total);
2612 for (i = 0; i < like->n_div; ++i) {
2613 isl_seq_cpy(bmap->div[i], like->div[i], 1 + 1 + ltotal);
2614 isl_seq_clr(bmap->div[i]+1+1+ltotal, total - ltotal);
2616 bmap = isl_basic_map_extend_constraints(bmap,
2617 0, 2 * like->n_div);
2618 for (i = 0; i < like->n_div; ++i) {
2619 if (isl_int_is_zero(bmap->div[i][0]))
2621 if (add_div_constraints(bmap, i) < 0)
2625 isl_basic_map_free(like);
2626 bmap = isl_basic_map_simplify(bmap);
2627 bmap = isl_basic_map_finalize(bmap);
2630 isl_basic_map_free(like);
2631 isl_basic_set_free(bset);
2635 struct isl_basic_set *isl_basic_set_from_underlying_set(
2636 struct isl_basic_set *bset, struct isl_basic_set *like)
2638 return (struct isl_basic_set *)
2639 isl_basic_map_overlying_set(bset, (struct isl_basic_map *)like);
2642 struct isl_set *isl_set_from_underlying_set(
2643 struct isl_set *set, struct isl_basic_set *like)
2649 isl_assert(set->ctx, set->dim->n_out == isl_basic_set_total_dim(like),
2651 if (isl_dim_equal(set->dim, like->dim) && like->n_div == 0) {
2652 isl_basic_set_free(like);
2655 set = isl_set_cow(set);
2658 for (i = 0; i < set->n; ++i) {
2659 set->p[i] = isl_basic_set_from_underlying_set(set->p[i],
2660 isl_basic_set_copy(like));
2664 isl_dim_free(set->dim);
2665 set->dim = isl_dim_copy(like->dim);
2668 isl_basic_set_free(like);
2671 isl_basic_set_free(like);
2676 struct isl_set *isl_map_underlying_set(struct isl_map *map)
2680 map = isl_map_cow(map);
2683 map->dim = isl_dim_cow(map->dim);
2687 for (i = 1; i < map->n; ++i)
2688 isl_assert(map->ctx, map->p[0]->n_div == map->p[i]->n_div,
2690 for (i = 0; i < map->n; ++i) {
2691 map->p[i] = (struct isl_basic_map *)
2692 isl_basic_map_underlying_set(map->p[i]);
2697 map->dim = isl_dim_underlying(map->dim, 0);
2699 isl_dim_free(map->dim);
2700 map->dim = isl_dim_copy(map->p[0]->dim);
2704 return (struct isl_set *)map;
2710 struct isl_set *isl_set_to_underlying_set(struct isl_set *set)
2712 return (struct isl_set *)isl_map_underlying_set((struct isl_map *)set);
2715 struct isl_basic_set *isl_basic_map_domain(struct isl_basic_map *bmap)
2717 struct isl_basic_set *domain;
2722 n_in = isl_basic_map_n_in(bmap);
2723 n_out = isl_basic_map_n_out(bmap);
2724 domain = isl_basic_set_from_basic_map(bmap);
2725 return isl_basic_set_project_out(domain, isl_dim_set, n_in, n_out);
2728 struct isl_basic_set *isl_basic_map_range(struct isl_basic_map *bmap)
2730 return isl_basic_map_domain(isl_basic_map_reverse(bmap));
2733 struct isl_set *isl_map_range(struct isl_map *map)
2736 struct isl_set *set;
2740 map = isl_map_cow(map);
2744 set = (struct isl_set *) map;
2745 if (set->dim->n_in != 0) {
2746 set->dim = isl_dim_drop_inputs(set->dim, 0, set->dim->n_in);
2750 for (i = 0; i < map->n; ++i) {
2751 set->p[i] = isl_basic_map_range(map->p[i]);
2755 ISL_F_CLR(set, ISL_MAP_DISJOINT);
2756 ISL_F_CLR(set, ISL_SET_NORMALIZED);
2763 struct isl_map *isl_map_from_set(struct isl_set *set, struct isl_dim *dim)
2766 struct isl_map *map = NULL;
2768 set = isl_set_cow(set);
2771 isl_assert(set->ctx, isl_dim_compatible(set->dim, dim), goto error);
2772 map = (struct isl_map *)set;
2773 for (i = 0; i < set->n; ++i) {
2774 map->p[i] = isl_basic_map_from_basic_set(
2775 set->p[i], isl_dim_copy(dim));
2779 isl_dim_free(map->dim);
2788 struct isl_map *isl_map_from_range(struct isl_set *set)
2790 return (struct isl_map *)set;
2793 struct isl_set *isl_set_from_map(struct isl_map *map)
2796 struct isl_set *set = NULL;
2800 map = isl_map_cow(map);
2803 map->dim = isl_dim_cow(map->dim);
2806 map->dim->n_out += map->dim->n_in;
2808 set = (struct isl_set *)map;
2809 for (i = 0; i < map->n; ++i) {
2810 set->p[i] = isl_basic_set_from_basic_map(map->p[i]);
2820 struct isl_map *isl_map_alloc_dim(struct isl_dim *dim, int n, unsigned flags)
2822 struct isl_map *map;
2826 isl_assert(dim->ctx, n >= 0, return NULL);
2827 map = isl_alloc(dim->ctx, struct isl_map,
2828 sizeof(struct isl_map) +
2829 (n - 1) * sizeof(struct isl_basic_map *));
2833 map->ctx = dim->ctx;
2834 isl_ctx_ref(map->ctx);
2846 struct isl_map *isl_map_alloc(struct isl_ctx *ctx,
2847 unsigned nparam, unsigned in, unsigned out, int n,
2850 struct isl_map *map;
2851 struct isl_dim *dims;
2853 dims = isl_dim_alloc(ctx, nparam, in, out);
2857 map = isl_map_alloc_dim(dims, n, flags);
2861 struct isl_basic_map *isl_basic_map_empty(struct isl_dim *dim)
2863 struct isl_basic_map *bmap;
2864 bmap = isl_basic_map_alloc_dim(dim, 0, 1, 0);
2865 bmap = isl_basic_map_set_to_empty(bmap);
2869 struct isl_basic_set *isl_basic_set_empty(struct isl_dim *dim)
2871 struct isl_basic_set *bset;
2872 bset = isl_basic_set_alloc_dim(dim, 0, 1, 0);
2873 bset = isl_basic_set_set_to_empty(bset);
2877 struct isl_basic_map *isl_basic_map_empty_like(struct isl_basic_map *model)
2879 struct isl_basic_map *bmap;
2882 bmap = isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
2883 bmap = isl_basic_map_set_to_empty(bmap);
2887 struct isl_basic_map *isl_basic_map_empty_like_map(struct isl_map *model)
2889 struct isl_basic_map *bmap;
2892 bmap = isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
2893 bmap = isl_basic_map_set_to_empty(bmap);
2897 struct isl_basic_set *isl_basic_set_empty_like(struct isl_basic_set *model)
2899 struct isl_basic_set *bset;
2902 bset = isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
2903 bset = isl_basic_set_set_to_empty(bset);
2907 struct isl_basic_map *isl_basic_map_universe(struct isl_dim *dim)
2909 struct isl_basic_map *bmap;
2910 bmap = isl_basic_map_alloc_dim(dim, 0, 0, 0);
2914 struct isl_basic_set *isl_basic_set_universe(struct isl_dim *dim)
2916 struct isl_basic_set *bset;
2917 bset = isl_basic_set_alloc_dim(dim, 0, 0, 0);
2921 __isl_give isl_basic_map *isl_basic_map_universe_like(
2922 __isl_keep isl_basic_map *model)
2926 return isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
2929 struct isl_basic_set *isl_basic_set_universe_like(struct isl_basic_set *model)
2933 return isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
2936 __isl_give isl_basic_set *isl_basic_set_universe_like_set(
2937 __isl_keep isl_set *model)
2941 return isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
2944 struct isl_map *isl_map_empty(struct isl_dim *dim)
2946 return isl_map_alloc_dim(dim, 0, ISL_MAP_DISJOINT);
2949 struct isl_map *isl_map_empty_like(struct isl_map *model)
2953 return isl_map_alloc_dim(isl_dim_copy(model->dim), 0, ISL_MAP_DISJOINT);
2956 struct isl_map *isl_map_empty_like_basic_map(struct isl_basic_map *model)
2960 return isl_map_alloc_dim(isl_dim_copy(model->dim), 0, ISL_MAP_DISJOINT);
2963 struct isl_set *isl_set_empty(struct isl_dim *dim)
2965 return isl_set_alloc_dim(dim, 0, ISL_MAP_DISJOINT);
2968 struct isl_set *isl_set_empty_like(struct isl_set *model)
2972 return isl_set_empty(isl_dim_copy(model->dim));
2975 struct isl_map *isl_map_universe(struct isl_dim *dim)
2977 struct isl_map *map;
2980 map = isl_map_alloc_dim(isl_dim_copy(dim), 1, ISL_MAP_DISJOINT);
2981 map = isl_map_add(map, isl_basic_map_universe(dim));
2985 struct isl_set *isl_set_universe(struct isl_dim *dim)
2987 struct isl_set *set;
2990 set = isl_set_alloc_dim(isl_dim_copy(dim), 1, ISL_MAP_DISJOINT);
2991 set = isl_set_add(set, isl_basic_set_universe(dim));
2995 __isl_give isl_set *isl_set_universe_like(__isl_keep isl_set *model)
2999 return isl_set_universe(isl_dim_copy(model->dim));
3002 struct isl_map *isl_map_dup(struct isl_map *map)
3005 struct isl_map *dup;
3009 dup = isl_map_alloc_dim(isl_dim_copy(map->dim), map->n, map->flags);
3010 for (i = 0; i < map->n; ++i)
3011 dup = isl_map_add(dup, isl_basic_map_copy(map->p[i]));
3015 struct isl_map *isl_map_add(struct isl_map *map, struct isl_basic_map *bmap)
3019 if (isl_basic_map_fast_is_empty(bmap)) {
3020 isl_basic_map_free(bmap);
3023 isl_assert(map->ctx, isl_dim_equal(map->dim, bmap->dim), goto error);
3024 isl_assert(map->ctx, map->n < map->size, goto error);
3025 map->p[map->n] = bmap;
3027 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3033 isl_basic_map_free(bmap);
3037 void isl_map_free(struct isl_map *map)
3047 isl_ctx_deref(map->ctx);
3048 for (i = 0; i < map->n; ++i)
3049 isl_basic_map_free(map->p[i]);
3050 isl_dim_free(map->dim);
3054 struct isl_map *isl_map_extend(struct isl_map *base,
3055 unsigned nparam, unsigned n_in, unsigned n_out)
3059 base = isl_map_cow(base);
3063 base->dim = isl_dim_extend(base->dim, nparam, n_in, n_out);
3066 for (i = 0; i < base->n; ++i) {
3067 base->p[i] = isl_basic_map_extend_dim(base->p[i],
3068 isl_dim_copy(base->dim), 0, 0, 0);
3078 struct isl_set *isl_set_extend(struct isl_set *base,
3079 unsigned nparam, unsigned dim)
3081 return (struct isl_set *)isl_map_extend((struct isl_map *)base,
3085 static struct isl_basic_map *isl_basic_map_fix_pos_si(
3086 struct isl_basic_map *bmap, unsigned pos, int value)
3090 bmap = isl_basic_map_cow(bmap);
3091 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
3092 j = isl_basic_map_alloc_equality(bmap);
3095 isl_seq_clr(bmap->eq[j] + 1, isl_basic_map_total_dim(bmap));
3096 isl_int_set_si(bmap->eq[j][pos], -1);
3097 isl_int_set_si(bmap->eq[j][0], value);
3098 bmap = isl_basic_map_simplify(bmap);
3099 return isl_basic_map_finalize(bmap);
3101 isl_basic_map_free(bmap);
3105 static __isl_give isl_basic_map *isl_basic_map_fix_pos(
3106 __isl_take isl_basic_map *bmap, unsigned pos, isl_int value)
3110 bmap = isl_basic_map_cow(bmap);
3111 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
3112 j = isl_basic_map_alloc_equality(bmap);
3115 isl_seq_clr(bmap->eq[j] + 1, isl_basic_map_total_dim(bmap));
3116 isl_int_set_si(bmap->eq[j][pos], -1);
3117 isl_int_set(bmap->eq[j][0], value);
3118 bmap = isl_basic_map_simplify(bmap);
3119 return isl_basic_map_finalize(bmap);
3121 isl_basic_map_free(bmap);
3125 struct isl_basic_map *isl_basic_map_fix_si(struct isl_basic_map *bmap,
3126 enum isl_dim_type type, unsigned pos, int value)
3130 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
3131 return isl_basic_map_fix_pos_si(bmap,
3132 isl_basic_map_offset(bmap, type) + pos, value);
3134 isl_basic_map_free(bmap);
3138 __isl_give isl_basic_map *isl_basic_map_fix(__isl_take isl_basic_map *bmap,
3139 enum isl_dim_type type, unsigned pos, isl_int value)
3143 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
3144 return isl_basic_map_fix_pos(bmap,
3145 isl_basic_map_offset(bmap, type) + pos, value);
3147 isl_basic_map_free(bmap);
3151 struct isl_basic_set *isl_basic_set_fix_si(struct isl_basic_set *bset,
3152 enum isl_dim_type type, unsigned pos, int value)
3154 return (struct isl_basic_set *)
3155 isl_basic_map_fix_si((struct isl_basic_map *)bset,
3159 __isl_give isl_basic_set *isl_basic_set_fix(__isl_take isl_basic_set *bset,
3160 enum isl_dim_type type, unsigned pos, isl_int value)
3162 return (struct isl_basic_set *)
3163 isl_basic_map_fix((struct isl_basic_map *)bset,
3167 struct isl_basic_map *isl_basic_map_fix_input_si(struct isl_basic_map *bmap,
3168 unsigned input, int value)
3170 return isl_basic_map_fix_si(bmap, isl_dim_in, input, value);
3173 struct isl_basic_set *isl_basic_set_fix_dim_si(struct isl_basic_set *bset,
3174 unsigned dim, int value)
3176 return (struct isl_basic_set *)
3177 isl_basic_map_fix_si((struct isl_basic_map *)bset,
3178 isl_dim_set, dim, value);
3181 struct isl_map *isl_map_fix_si(struct isl_map *map,
3182 enum isl_dim_type type, unsigned pos, int value)
3186 map = isl_map_cow(map);
3190 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
3191 for (i = 0; i < map->n; ++i) {
3192 map->p[i] = isl_basic_map_fix_si(map->p[i], type, pos, value);
3196 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3203 __isl_give isl_map *isl_map_fix(__isl_take isl_map *map,
3204 enum isl_dim_type type, unsigned pos, isl_int value)
3208 map = isl_map_cow(map);
3212 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
3213 for (i = 0; i < map->n; ++i) {
3214 map->p[i] = isl_basic_map_fix(map->p[i], type, pos, value);
3218 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3225 __isl_give isl_set *isl_set_fix(__isl_take isl_set *set,
3226 enum isl_dim_type type, unsigned pos, isl_int value)
3228 return (struct isl_set *)isl_map_fix((isl_map *)set, type, pos, value);
3231 struct isl_map *isl_map_fix_input_si(struct isl_map *map,
3232 unsigned input, int value)
3234 return isl_map_fix_si(map, isl_dim_in, input, value);
3237 struct isl_set *isl_set_fix_dim_si(struct isl_set *set, unsigned dim, int value)
3239 return (struct isl_set *)
3240 isl_map_fix_si((struct isl_map *)set, isl_dim_set, dim, value);
3243 struct isl_basic_set *isl_basic_set_lower_bound_dim(struct isl_basic_set *bset,
3244 unsigned dim, isl_int value)
3248 bset = isl_basic_set_cow(bset);
3249 bset = isl_basic_set_extend_constraints(bset, 0, 1);
3250 j = isl_basic_set_alloc_inequality(bset);
3253 isl_seq_clr(bset->ineq[j], 1 + isl_basic_set_total_dim(bset));
3254 isl_int_set_si(bset->ineq[j][1 + isl_basic_set_n_param(bset) + dim], 1);
3255 isl_int_neg(bset->ineq[j][0], value);
3256 bset = isl_basic_set_simplify(bset);
3257 return isl_basic_set_finalize(bset);
3259 isl_basic_set_free(bset);
3263 struct isl_set *isl_set_lower_bound_dim(struct isl_set *set, unsigned dim,
3268 set = isl_set_cow(set);
3272 isl_assert(set->ctx, dim < isl_set_n_dim(set), goto error);
3273 for (i = 0; i < set->n; ++i) {
3274 set->p[i] = isl_basic_set_lower_bound_dim(set->p[i], dim, value);
3284 struct isl_map *isl_map_reverse(struct isl_map *map)
3288 map = isl_map_cow(map);
3292 map->dim = isl_dim_reverse(map->dim);
3295 for (i = 0; i < map->n; ++i) {
3296 map->p[i] = isl_basic_map_reverse(map->p[i]);
3300 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3307 static struct isl_map *isl_basic_map_partial_lexopt(
3308 struct isl_basic_map *bmap, struct isl_basic_set *dom,
3309 struct isl_set **empty, int max)
3313 if (bmap->ctx->opt->pip == ISL_PIP_PIP)
3314 return isl_pip_basic_map_lexopt(bmap, dom, empty, max);
3316 return isl_tab_basic_map_partial_lexopt(bmap, dom, empty, max);
3318 isl_basic_map_free(bmap);
3319 isl_basic_set_free(dom);
3325 struct isl_map *isl_basic_map_partial_lexmax(
3326 struct isl_basic_map *bmap, struct isl_basic_set *dom,
3327 struct isl_set **empty)
3329 return isl_basic_map_partial_lexopt(bmap, dom, empty, 1);
3332 struct isl_map *isl_basic_map_partial_lexmin(
3333 struct isl_basic_map *bmap, struct isl_basic_set *dom,
3334 struct isl_set **empty)
3336 return isl_basic_map_partial_lexopt(bmap, dom, empty, 0);
3339 struct isl_set *isl_basic_set_partial_lexmin(
3340 struct isl_basic_set *bset, struct isl_basic_set *dom,
3341 struct isl_set **empty)
3343 return (struct isl_set *)
3344 isl_basic_map_partial_lexmin((struct isl_basic_map *)bset,
3348 struct isl_set *isl_basic_set_partial_lexmax(
3349 struct isl_basic_set *bset, struct isl_basic_set *dom,
3350 struct isl_set **empty)
3352 return (struct isl_set *)
3353 isl_basic_map_partial_lexmax((struct isl_basic_map *)bset,
3357 __isl_give isl_map *isl_basic_map_lexopt(__isl_take isl_basic_map *bmap, int max)
3359 struct isl_basic_set *dom = NULL;
3360 struct isl_dim *dom_dim;
3364 dom_dim = isl_dim_domain(isl_dim_copy(bmap->dim));
3365 dom = isl_basic_set_universe(dom_dim);
3366 return isl_basic_map_partial_lexopt(bmap, dom, NULL, max);
3368 isl_basic_map_free(bmap);
3372 __isl_give isl_map *isl_basic_map_lexmin(__isl_take isl_basic_map *bmap)
3374 return isl_basic_map_lexopt(bmap, 0);
3377 __isl_give isl_map *isl_basic_map_lexmax(__isl_take isl_basic_map *bmap)
3379 return isl_basic_map_lexopt(bmap, 1);
3382 __isl_give isl_set *isl_basic_set_lexmin(__isl_take isl_basic_set *bset)
3384 return (isl_set *)isl_basic_map_lexmin((isl_basic_map *)bset);
3387 __isl_give isl_set *isl_basic_set_lexmax(__isl_take isl_basic_set *bset)
3389 return (isl_set *)isl_basic_map_lexmax((isl_basic_map *)bset);
3392 static struct isl_map *isl_map_reset_dim(struct isl_map *map,
3393 struct isl_dim *dim)
3400 for (i = 0; i < map->n; ++i) {
3401 isl_dim_free(map->p[i]->dim);
3402 map->p[i]->dim = isl_dim_copy(dim);
3404 isl_dim_free(map->dim);
3414 static struct isl_set *isl_set_reset_dim(struct isl_set *set,
3415 struct isl_dim *dim)
3417 return (struct isl_set *) isl_map_reset_dim((struct isl_map *)set, dim);
3420 /* Apply a preimage specified by "mat" on the parameters of "bset".
3421 * bset is assumed to have only parameters and divs.
3423 static struct isl_basic_set *basic_set_parameter_preimage(
3424 struct isl_basic_set *bset, struct isl_mat *mat)
3431 bset->dim = isl_dim_cow(bset->dim);
3435 nparam = isl_basic_set_dim(bset, isl_dim_param);
3437 isl_assert(bset->ctx, mat->n_row == 1 + nparam, goto error);
3439 bset->dim->nparam = 0;
3440 bset->dim->n_out = nparam;
3441 bset = isl_basic_set_preimage(bset, mat);
3443 bset->dim->nparam = bset->dim->n_out;
3444 bset->dim->n_out = 0;
3449 isl_basic_set_free(bset);
3453 /* Apply a preimage specified by "mat" on the parameters of "set".
3454 * set is assumed to have only parameters and divs.
3456 static struct isl_set *set_parameter_preimage(
3457 struct isl_set *set, struct isl_mat *mat)
3459 struct isl_dim *dim = NULL;
3465 dim = isl_dim_copy(set->dim);
3466 dim = isl_dim_cow(dim);
3470 nparam = isl_set_dim(set, isl_dim_param);
3472 isl_assert(set->ctx, mat->n_row == 1 + nparam, goto error);
3475 dim->n_out = nparam;
3476 isl_set_reset_dim(set, dim);
3477 set = isl_set_preimage(set, mat);
3480 dim = isl_dim_copy(set->dim);
3481 dim = isl_dim_cow(dim);
3484 dim->nparam = dim->n_out;
3486 isl_set_reset_dim(set, dim);
3496 /* Intersect the basic set "bset" with the affine space specified by the
3497 * equalities in "eq".
3499 static struct isl_basic_set *basic_set_append_equalities(
3500 struct isl_basic_set *bset, struct isl_mat *eq)
3508 bset = isl_basic_set_extend_dim(bset, isl_dim_copy(bset->dim), 0,
3513 len = 1 + isl_dim_total(bset->dim) + bset->extra;
3514 for (i = 0; i < eq->n_row; ++i) {
3515 k = isl_basic_set_alloc_equality(bset);
3518 isl_seq_cpy(bset->eq[k], eq->row[i], eq->n_col);
3519 isl_seq_clr(bset->eq[k] + eq->n_col, len - eq->n_col);
3526 isl_basic_set_free(bset);
3530 /* Intersect the set "set" with the affine space specified by the
3531 * equalities in "eq".
3533 static struct isl_set *set_append_equalities(struct isl_set *set,
3541 for (i = 0; i < set->n; ++i) {
3542 set->p[i] = basic_set_append_equalities(set->p[i],
3555 /* Project the given basic set onto its parameter domain, possibly introducing
3556 * new, explicit, existential variables in the constraints.
3557 * The input has parameters and (possibly implicit) existential variables.
3558 * The output has the same parameters, but only
3559 * explicit existentially quantified variables.
3561 * The actual projection is performed by pip, but pip doesn't seem
3562 * to like equalities very much, so we first remove the equalities
3563 * among the parameters by performing a variable compression on
3564 * the parameters. Afterward, an inverse transformation is performed
3565 * and the equalities among the parameters are inserted back in.
3567 static struct isl_set *parameter_compute_divs(struct isl_basic_set *bset)
3571 struct isl_mat *T, *T2;
3572 struct isl_set *set;
3573 unsigned nparam, n_div;
3575 bset = isl_basic_set_cow(bset);
3579 if (bset->n_eq == 0)
3580 return isl_basic_set_lexmin(bset);
3582 isl_basic_set_gauss(bset, NULL);
3584 nparam = isl_basic_set_dim(bset, isl_dim_param);
3585 n_div = isl_basic_set_dim(bset, isl_dim_div);
3587 for (i = 0, j = n_div - 1; i < bset->n_eq && j >= 0; --j) {
3588 if (!isl_int_is_zero(bset->eq[i][1 + nparam + j]))
3591 if (i == bset->n_eq)
3592 return isl_basic_set_lexmin(bset);
3594 eq = isl_mat_sub_alloc(bset->ctx, bset->eq, i, bset->n_eq - i,
3596 eq = isl_mat_cow(eq);
3597 T = isl_mat_variable_compression(isl_mat_copy(eq), &T2);
3598 bset = basic_set_parameter_preimage(bset, T);
3600 set = isl_basic_set_lexmin(bset);
3601 set = set_parameter_preimage(set, T2);
3602 set = set_append_equalities(set, eq);
3606 /* Compute an explicit representation for all the existentially
3607 * quantified variables.
3608 * The input and output dimensions are first turned into parameters.
3609 * compute_divs then returns a map with the same parameters and
3610 * no input or output dimensions and the dimension specification
3611 * is reset to that of the input.
3613 static struct isl_map *compute_divs(struct isl_basic_map *bmap)
3615 struct isl_basic_set *bset;
3616 struct isl_set *set;
3617 struct isl_map *map;
3618 struct isl_dim *dim, *orig_dim = NULL;
3623 bmap = isl_basic_map_cow(bmap);
3627 nparam = isl_basic_map_dim(bmap, isl_dim_param);
3628 n_in = isl_basic_map_dim(bmap, isl_dim_in);
3629 n_out = isl_basic_map_dim(bmap, isl_dim_out);
3630 dim = isl_dim_set_alloc(bmap->ctx, nparam + n_in + n_out, 0);
3634 orig_dim = bmap->dim;
3636 bset = (struct isl_basic_set *)bmap;
3638 set = parameter_compute_divs(bset);
3639 map = (struct isl_map *)set;
3640 map = isl_map_reset_dim(map, orig_dim);
3644 isl_basic_map_free(bmap);
3648 static int basic_map_divs_known(__isl_keep isl_basic_map *bmap)
3656 off = isl_dim_total(bmap->dim);
3657 for (i = 0; i < bmap->n_div; ++i) {
3658 if (isl_int_is_zero(bmap->div[i][0]))
3660 isl_assert(bmap->ctx, isl_int_is_zero(bmap->div[i][1+1+off+i]),
3666 static int map_divs_known(__isl_keep isl_map *map)
3673 for (i = 0; i < map->n; ++i) {
3674 int known = basic_map_divs_known(map->p[i]);
3682 /* If bmap contains any unknown divs, then compute explicit
3683 * expressions for them. However, this computation may be
3684 * quite expensive, so first try to remove divs that aren't
3687 struct isl_map *isl_basic_map_compute_divs(struct isl_basic_map *bmap)
3691 struct isl_map *map;
3693 known = basic_map_divs_known(bmap);
3697 return isl_map_from_basic_map(bmap);
3699 bmap = isl_basic_map_drop_redundant_divs(bmap);
3701 known = basic_map_divs_known(bmap);
3705 return isl_map_from_basic_map(bmap);
3707 map = compute_divs(bmap);
3710 isl_basic_map_free(bmap);
3714 struct isl_map *isl_map_compute_divs(struct isl_map *map)
3718 struct isl_map *res;
3725 known = map_divs_known(map);
3733 res = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[0]));
3734 for (i = 1 ; i < map->n; ++i) {
3736 r2 = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[i]));
3737 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT))
3738 res = isl_map_union_disjoint(res, r2);
3740 res = isl_map_union(res, r2);
3747 struct isl_set *isl_basic_set_compute_divs(struct isl_basic_set *bset)
3749 return (struct isl_set *)
3750 isl_basic_map_compute_divs((struct isl_basic_map *)bset);
3753 struct isl_set *isl_set_compute_divs(struct isl_set *set)
3755 return (struct isl_set *)
3756 isl_map_compute_divs((struct isl_map *)set);
3759 struct isl_set *isl_map_domain(struct isl_map *map)
3762 struct isl_set *set;
3767 map = isl_map_cow(map);
3771 set = (struct isl_set *)map;
3772 set->dim = isl_dim_domain(set->dim);
3775 for (i = 0; i < map->n; ++i) {
3776 set->p[i] = isl_basic_map_domain(map->p[i]);
3780 ISL_F_CLR(set, ISL_MAP_DISJOINT);
3781 ISL_F_CLR(set, ISL_SET_NORMALIZED);
3788 struct isl_map *isl_map_union_disjoint(
3789 struct isl_map *map1, struct isl_map *map2)
3793 struct isl_map *map = NULL;
3807 isl_assert(map1->ctx, isl_dim_equal(map1->dim, map2->dim), goto error);
3809 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
3810 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
3811 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
3813 map = isl_map_alloc_dim(isl_dim_copy(map1->dim),
3814 map1->n + map2->n, flags);
3817 for (i = 0; i < map1->n; ++i) {
3818 map = isl_map_add(map,
3819 isl_basic_map_copy(map1->p[i]));
3823 for (i = 0; i < map2->n; ++i) {
3824 map = isl_map_add(map,
3825 isl_basic_map_copy(map2->p[i]));
3839 struct isl_map *isl_map_union(struct isl_map *map1, struct isl_map *map2)
3841 map1 = isl_map_union_disjoint(map1, map2);
3845 ISL_F_CLR(map1, ISL_MAP_DISJOINT);
3849 struct isl_set *isl_set_union_disjoint(
3850 struct isl_set *set1, struct isl_set *set2)
3852 return (struct isl_set *)
3853 isl_map_union_disjoint(
3854 (struct isl_map *)set1, (struct isl_map *)set2);
3857 struct isl_set *isl_set_union(struct isl_set *set1, struct isl_set *set2)
3859 return (struct isl_set *)
3860 isl_map_union((struct isl_map *)set1, (struct isl_map *)set2);
3863 struct isl_map *isl_map_intersect_range(
3864 struct isl_map *map, struct isl_set *set)
3867 struct isl_map *result;
3873 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT) &&
3874 ISL_F_ISSET(set, ISL_MAP_DISJOINT))
3875 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
3877 result = isl_map_alloc_dim(isl_dim_copy(map->dim),
3878 map->n * set->n, flags);
3881 for (i = 0; i < map->n; ++i)
3882 for (j = 0; j < set->n; ++j) {
3883 result = isl_map_add(result,
3884 isl_basic_map_intersect_range(
3885 isl_basic_map_copy(map->p[i]),
3886 isl_basic_set_copy(set->p[j])));
3899 struct isl_map *isl_map_intersect_domain(
3900 struct isl_map *map, struct isl_set *set)
3902 return isl_map_reverse(
3903 isl_map_intersect_range(isl_map_reverse(map), set));
3906 struct isl_map *isl_map_apply_domain(
3907 struct isl_map *map1, struct isl_map *map2)
3911 map1 = isl_map_reverse(map1);
3912 map1 = isl_map_apply_range(map1, map2);
3913 return isl_map_reverse(map1);
3920 struct isl_map *isl_map_apply_range(
3921 struct isl_map *map1, struct isl_map *map2)
3923 struct isl_dim *dim_result;
3924 struct isl_map *result;
3930 dim_result = isl_dim_join(isl_dim_copy(map1->dim),
3931 isl_dim_copy(map2->dim));
3933 result = isl_map_alloc_dim(dim_result, map1->n * map2->n, 0);
3936 for (i = 0; i < map1->n; ++i)
3937 for (j = 0; j < map2->n; ++j) {
3938 result = isl_map_add(result,
3939 isl_basic_map_apply_range(
3940 isl_basic_map_copy(map1->p[i]),
3941 isl_basic_map_copy(map2->p[j])));
3947 if (result && result->n <= 1)
3948 ISL_F_SET(result, ISL_MAP_DISJOINT);
3957 * returns range - domain
3959 struct isl_basic_set *isl_basic_map_deltas(struct isl_basic_map *bmap)
3961 struct isl_basic_set *bset;
3968 dim = isl_basic_map_n_in(bmap);
3969 nparam = isl_basic_map_n_param(bmap);
3970 isl_assert(bmap->ctx, dim == isl_basic_map_n_out(bmap), goto error);
3971 bset = isl_basic_set_from_basic_map(bmap);
3972 bset = isl_basic_set_cow(bset);
3973 bset = isl_basic_set_extend(bset, nparam, 3*dim, 0, dim, 0);
3974 bset = isl_basic_set_swap_vars(bset, 2*dim);
3975 for (i = 0; i < dim; ++i) {
3976 int j = isl_basic_map_alloc_equality(
3977 (struct isl_basic_map *)bset);
3980 isl_seq_clr(bset->eq[j], 1 + isl_basic_set_total_dim(bset));
3981 isl_int_set_si(bset->eq[j][1+nparam+i], 1);
3982 isl_int_set_si(bset->eq[j][1+nparam+dim+i], 1);
3983 isl_int_set_si(bset->eq[j][1+nparam+2*dim+i], -1);
3985 return isl_basic_set_project_out(bset, isl_dim_set, dim, 2*dim);
3987 isl_basic_map_free(bmap);
3992 * returns range - domain
3994 struct isl_set *isl_map_deltas(struct isl_map *map)
3997 struct isl_set *result;
4002 isl_assert(map->ctx, isl_map_n_in(map) == isl_map_n_out(map), goto error);
4003 result = isl_set_alloc(map->ctx, isl_map_n_param(map),
4004 isl_map_n_in(map), map->n, map->flags);
4007 for (i = 0; i < map->n; ++i)
4008 result = isl_set_add(result,
4009 isl_basic_map_deltas(isl_basic_map_copy(map->p[i])));
4017 static struct isl_basic_map *basic_map_identity(struct isl_dim *dims)
4019 struct isl_basic_map *bmap;
4027 nparam = dims->nparam;
4029 bmap = isl_basic_map_alloc_dim(dims, 0, dim, 0);
4033 for (i = 0; i < dim; ++i) {
4034 int j = isl_basic_map_alloc_equality(bmap);
4037 isl_seq_clr(bmap->eq[j], 1 + isl_basic_map_total_dim(bmap));
4038 isl_int_set_si(bmap->eq[j][1+nparam+i], 1);
4039 isl_int_set_si(bmap->eq[j][1+nparam+dim+i], -1);
4041 return isl_basic_map_finalize(bmap);
4043 isl_basic_map_free(bmap);
4047 struct isl_basic_map *isl_basic_map_identity(struct isl_dim *set_dim)
4049 struct isl_dim *dim = isl_dim_map(set_dim);
4052 return basic_map_identity(dim);
4055 struct isl_basic_map *isl_basic_map_identity_like(struct isl_basic_map *model)
4057 if (!model || !model->dim)
4059 isl_assert(model->ctx,
4060 model->dim->n_in == model->dim->n_out, return NULL);
4061 return basic_map_identity(isl_dim_copy(model->dim));
4064 static struct isl_map *map_identity(struct isl_dim *dim)
4066 struct isl_map *map = isl_map_alloc_dim(dim, 1, ISL_MAP_DISJOINT);
4067 return isl_map_add(map, basic_map_identity(isl_dim_copy(dim)));
4070 struct isl_map *isl_map_identity(struct isl_dim *set_dim)
4072 struct isl_dim *dim = isl_dim_map(set_dim);
4075 return map_identity(dim);
4078 struct isl_map *isl_map_identity_like(struct isl_map *model)
4080 if (!model || !model->dim)
4082 isl_assert(model->ctx,
4083 model->dim->n_in == model->dim->n_out, return NULL);
4084 return map_identity(isl_dim_copy(model->dim));
4087 struct isl_map *isl_map_identity_like_basic_map(struct isl_basic_map *model)
4089 if (!model || !model->dim)
4091 isl_assert(model->ctx,
4092 model->dim->n_in == model->dim->n_out, return NULL);
4093 return map_identity(isl_dim_copy(model->dim));
4096 /* Construct a basic set with all set dimensions having only non-negative
4099 struct isl_basic_set *isl_basic_set_positive_orthant(struct isl_dim *dims)
4104 struct isl_basic_set *bset;
4108 nparam = dims->nparam;
4110 bset = isl_basic_set_alloc_dim(dims, 0, 0, dim);
4113 for (i = 0; i < dim; ++i) {
4114 int k = isl_basic_set_alloc_inequality(bset);
4117 isl_seq_clr(bset->ineq[k], 1 + isl_basic_set_total_dim(bset));
4118 isl_int_set_si(bset->ineq[k][1 + nparam + i], 1);
4122 isl_basic_set_free(bset);
4126 int isl_set_is_equal(struct isl_set *set1, struct isl_set *set2)
4128 return isl_map_is_equal((struct isl_map *)set1, (struct isl_map *)set2);
4131 int isl_set_is_subset(struct isl_set *set1, struct isl_set *set2)
4133 return isl_map_is_subset(
4134 (struct isl_map *)set1, (struct isl_map *)set2);
4137 int isl_basic_map_is_subset(
4138 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
4141 struct isl_map *map1;
4142 struct isl_map *map2;
4144 if (!bmap1 || !bmap2)
4147 map1 = isl_map_from_basic_map(isl_basic_map_copy(bmap1));
4148 map2 = isl_map_from_basic_map(isl_basic_map_copy(bmap2));
4150 is_subset = isl_map_is_subset(map1, map2);
4158 int isl_basic_map_is_equal(
4159 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
4163 if (!bmap1 || !bmap2)
4165 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
4168 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
4172 int isl_basic_set_is_equal(
4173 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
4175 return isl_basic_map_is_equal(
4176 (struct isl_basic_map *)bset1, (struct isl_basic_map *)bset2);
4179 int isl_map_is_empty(struct isl_map *map)
4186 for (i = 0; i < map->n; ++i) {
4187 is_empty = isl_basic_map_is_empty(map->p[i]);
4196 int isl_map_fast_is_empty(struct isl_map *map)
4201 int isl_set_is_empty(struct isl_set *set)
4203 return isl_map_is_empty((struct isl_map *)set);
4206 /* Return 1 if "bmap" contains a single element.
4208 int isl_basic_map_is_singleton(__isl_keep isl_basic_map *bmap)
4216 return bmap->n_eq == isl_basic_map_total_dim(bmap);
4219 /* Return 1 if "map" contains a single element.
4221 int isl_map_is_singleton(__isl_keep isl_map *map)
4228 return isl_basic_map_is_singleton(map->p[0]);
4231 /* Given a singleton basic map, extract the single element
4234 static __isl_give isl_vec *singleton_extract_point(__isl_keep isl_basic_map *bmap)
4238 struct isl_vec *point;
4244 dim = isl_basic_map_total_dim(bmap);
4245 isl_assert(bmap->ctx, bmap->n_eq == dim, return NULL);
4246 point = isl_vec_alloc(bmap->ctx, 1 + dim);
4252 isl_int_set_si(point->el[0], 1);
4253 for (j = 0; j < bmap->n_eq; ++j) {
4255 int i = dim - 1 - j;
4256 isl_assert(bmap->ctx,
4257 isl_seq_first_non_zero(bmap->eq[j] + 1, i) == -1,
4259 isl_assert(bmap->ctx,
4260 isl_int_is_one(bmap->eq[j][1 + i]) ||
4261 isl_int_is_negone(bmap->eq[j][1 + i]),
4263 isl_assert(bmap->ctx,
4264 isl_seq_first_non_zero(bmap->eq[j]+1+i+1, dim-i-1) == -1,
4267 isl_int_gcd(m, point->el[0], bmap->eq[j][1 + i]);
4268 isl_int_divexact(m, bmap->eq[j][1 + i], m);
4270 isl_seq_scale(point->el, point->el, m, 1 + i);
4271 isl_int_divexact(m, point->el[0], bmap->eq[j][1 + i]);
4273 isl_int_mul(point->el[1 + i], m, bmap->eq[j][0]);
4280 isl_vec_free(point);
4284 /* Return 1 if "bmap" contains the point "point".
4285 * "bmap" is assumed to have known divs.
4286 * The point is first extended with the divs and then passed
4287 * to basic_map_contains.
4289 static int basic_map_contains_point(__isl_keep isl_basic_map *bmap,
4290 __isl_keep isl_vec *point)
4293 struct isl_vec *vec;
4297 if (!bmap || !point)
4299 if (bmap->n_div == 0)
4300 return basic_map_contains(bmap, point);
4302 dim = isl_basic_map_total_dim(bmap) - bmap->n_div;
4303 vec = isl_vec_alloc(bmap->ctx, 1 + dim + bmap->n_div);
4307 isl_seq_cpy(vec->el, point->el, point->size);
4308 for (i = 0; i < bmap->n_div; ++i) {
4309 isl_seq_inner_product(bmap->div[i] + 1, vec->el,
4310 1 + dim + i, &vec->el[1+dim+i]);
4311 isl_int_fdiv_q(vec->el[1+dim+i], vec->el[1+dim+i],
4315 contains = basic_map_contains(bmap, vec);
4321 /* Return 1 is the singleton map "map1" is a subset of "map2",
4322 * i.e., if the single element of "map1" is also an element of "map2".
4324 static int map_is_singleton_subset(__isl_keep isl_map *map1,
4325 __isl_keep isl_map *map2)
4329 struct isl_vec *point;
4336 point = singleton_extract_point(map1->p[0]);
4340 for (i = 0; i < map2->n; ++i) {
4341 is_subset = basic_map_contains_point(map2->p[i], point);
4346 isl_vec_free(point);
4350 int isl_map_is_subset(struct isl_map *map1, struct isl_map *map2)
4353 struct isl_map *diff;
4358 if (isl_map_is_empty(map1))
4361 if (isl_map_is_empty(map2))
4364 if (isl_map_fast_is_universe(map2))
4367 map2 = isl_map_compute_divs(isl_map_copy(map2));
4368 if (isl_map_is_singleton(map1)) {
4369 is_subset = map_is_singleton_subset(map1, map2);
4373 diff = isl_map_subtract(isl_map_copy(map1), map2);
4377 is_subset = isl_map_is_empty(diff);
4383 int isl_map_is_equal(struct isl_map *map1, struct isl_map *map2)
4389 is_subset = isl_map_is_subset(map1, map2);
4392 is_subset = isl_map_is_subset(map2, map1);
4396 int isl_basic_map_is_strict_subset(
4397 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
4401 if (!bmap1 || !bmap2)
4403 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
4406 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
4407 if (is_subset == -1)
4412 int isl_map_is_strict_subset(struct isl_map *map1, struct isl_map *map2)
4418 is_subset = isl_map_is_subset(map1, map2);
4421 is_subset = isl_map_is_subset(map2, map1);
4422 if (is_subset == -1)
4427 int isl_set_is_strict_subset(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
4429 return isl_map_is_strict_subset((isl_map *)set1, (isl_map *)set2);
4432 int isl_basic_map_is_universe(struct isl_basic_map *bmap)
4436 return bmap->n_eq == 0 && bmap->n_ineq == 0;
4439 int isl_basic_set_is_universe(struct isl_basic_set *bset)
4443 return bset->n_eq == 0 && bset->n_ineq == 0;
4446 int isl_map_fast_is_universe(__isl_keep isl_map *map)
4451 return map->n == 1 && isl_basic_map_is_universe(map->p[0]);
4454 int isl_basic_map_is_empty(struct isl_basic_map *bmap)
4456 struct isl_basic_set *bset = NULL;
4457 struct isl_vec *sample = NULL;
4464 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY))
4467 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL)) {
4468 struct isl_basic_map *copy = isl_basic_map_copy(bmap);
4469 copy = isl_basic_map_convex_hull(copy);
4470 empty = ISL_F_ISSET(copy, ISL_BASIC_MAP_EMPTY);
4471 isl_basic_map_free(copy);
4475 total = 1 + isl_basic_map_total_dim(bmap);
4476 if (bmap->sample && bmap->sample->size == total) {
4477 int contains = basic_map_contains(bmap, bmap->sample);
4483 isl_vec_free(bmap->sample);
4484 bmap->sample = NULL;
4485 bset = isl_basic_map_underlying_set(isl_basic_map_copy(bmap));
4488 sample = isl_basic_set_sample_vec(bset);
4491 empty = sample->size == 0;
4492 isl_vec_free(bmap->sample);
4493 bmap->sample = sample;
4495 ISL_F_SET(bmap, ISL_BASIC_MAP_EMPTY);
4500 int isl_basic_map_fast_is_empty(struct isl_basic_map *bmap)
4504 return ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY);
4507 int isl_basic_set_fast_is_empty(struct isl_basic_set *bset)
4511 return ISL_F_ISSET(bset, ISL_BASIC_SET_EMPTY);
4514 int isl_basic_set_is_empty(struct isl_basic_set *bset)
4516 return isl_basic_map_is_empty((struct isl_basic_map *)bset);
4519 struct isl_map *isl_basic_map_union(
4520 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
4522 struct isl_map *map;
4523 if (!bmap1 || !bmap2)
4526 isl_assert(bmap1->ctx, isl_dim_equal(bmap1->dim, bmap2->dim), goto error);
4528 map = isl_map_alloc_dim(isl_dim_copy(bmap1->dim), 2, 0);
4531 map = isl_map_add(map, bmap1);
4532 map = isl_map_add(map, bmap2);
4535 isl_basic_map_free(bmap1);
4536 isl_basic_map_free(bmap2);
4540 struct isl_set *isl_basic_set_union(
4541 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
4543 return (struct isl_set *)isl_basic_map_union(
4544 (struct isl_basic_map *)bset1,
4545 (struct isl_basic_map *)bset2);
4548 /* Order divs such that any div only depends on previous divs */
4549 struct isl_basic_map *isl_basic_map_order_divs(struct isl_basic_map *bmap)
4552 unsigned off = isl_dim_total(bmap->dim);
4554 for (i = 0; i < bmap->n_div; ++i) {
4556 if (isl_int_is_zero(bmap->div[i][0]))
4558 pos = isl_seq_first_non_zero(bmap->div[i]+1+1+off+i,
4562 isl_basic_map_swap_div(bmap, i, i + pos);
4568 struct isl_basic_set *isl_basic_set_order_divs(struct isl_basic_set *bset)
4570 return (struct isl_basic_set *)
4571 isl_basic_map_order_divs((struct isl_basic_map *)bset);
4574 /* Look for a div in dst that corresponds to the div "div" in src.
4575 * The divs before "div" in src and dst are assumed to be the same.
4577 * Returns -1 if no corresponding div was found and the position
4578 * of the corresponding div in dst otherwise.
4580 static int find_div(struct isl_basic_map *dst,
4581 struct isl_basic_map *src, unsigned div)
4585 unsigned total = isl_dim_total(src->dim);
4587 isl_assert(dst->ctx, div <= dst->n_div, return -1);
4588 for (i = div; i < dst->n_div; ++i)
4589 if (isl_seq_eq(dst->div[i], src->div[div], 1+1+total+div) &&
4590 isl_seq_first_non_zero(dst->div[i]+1+1+total+div,
4591 dst->n_div - div) == -1)
4596 struct isl_basic_map *isl_basic_map_align_divs(
4597 struct isl_basic_map *dst, struct isl_basic_map *src)
4600 unsigned total = isl_dim_total(src->dim);
4605 if (src->n_div == 0)
4608 for (i = 0; i < src->n_div; ++i)
4609 isl_assert(src->ctx, !isl_int_is_zero(src->div[i][0]), goto error);
4611 src = isl_basic_map_order_divs(src);
4612 dst = isl_basic_map_cow(dst);
4613 dst = isl_basic_map_extend_dim(dst, isl_dim_copy(dst->dim),
4614 src->n_div, 0, 2 * src->n_div);
4617 for (i = 0; i < src->n_div; ++i) {
4618 int j = find_div(dst, src, i);
4620 j = isl_basic_map_alloc_div(dst);
4623 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total+i);
4624 isl_seq_clr(dst->div[j]+1+1+total+i, dst->n_div - i);
4625 if (add_div_constraints(dst, j) < 0)
4629 isl_basic_map_swap_div(dst, i, j);
4633 isl_basic_map_free(dst);
4637 struct isl_basic_set *isl_basic_set_align_divs(
4638 struct isl_basic_set *dst, struct isl_basic_set *src)
4640 return (struct isl_basic_set *)isl_basic_map_align_divs(
4641 (struct isl_basic_map *)dst, (struct isl_basic_map *)src);
4644 struct isl_map *isl_map_align_divs(struct isl_map *map)
4652 map = isl_map_compute_divs(map);
4653 map = isl_map_cow(map);
4657 for (i = 1; i < map->n; ++i)
4658 map->p[0] = isl_basic_map_align_divs(map->p[0], map->p[i]);
4659 for (i = 1; i < map->n; ++i)
4660 map->p[i] = isl_basic_map_align_divs(map->p[i], map->p[0]);
4662 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4666 struct isl_set *isl_set_align_divs(struct isl_set *set)
4668 return (struct isl_set *)isl_map_align_divs((struct isl_map *)set);
4671 static struct isl_map *add_cut_constraint(struct isl_map *dst,
4672 struct isl_basic_map *src, isl_int *c,
4673 unsigned len, int oppose)
4675 struct isl_basic_map *copy = NULL;
4680 copy = isl_basic_map_copy(src);
4681 copy = isl_basic_map_cow(copy);
4684 copy = isl_basic_map_extend_constraints(copy, 0, 1);
4685 k = isl_basic_map_alloc_inequality(copy);
4689 isl_seq_neg(copy->ineq[k], c, len);
4691 isl_seq_cpy(copy->ineq[k], c, len);
4692 total = 1 + isl_basic_map_total_dim(copy);
4693 isl_seq_clr(copy->ineq[k]+len, total - len);
4694 isl_inequality_negate(copy, k);
4695 copy = isl_basic_map_simplify(copy);
4696 copy = isl_basic_map_finalize(copy);
4697 is_empty = isl_basic_map_is_empty(copy);
4701 dst = isl_map_add(dst, copy);
4703 isl_basic_map_free(copy);
4706 isl_basic_map_free(copy);
4711 static struct isl_map *subtract(struct isl_map *map, struct isl_basic_map *bmap)
4715 struct isl_map *rest = NULL;
4717 unsigned total = isl_basic_map_total_dim(bmap);
4719 map = isl_map_cow(map);
4724 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT))
4725 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
4727 max = map->n * (2 * bmap->n_eq + bmap->n_ineq);
4728 rest = isl_map_alloc_dim(isl_dim_copy(map->dim), max, flags);
4732 for (i = 0; i < map->n; ++i) {
4733 map->p[i] = isl_basic_map_align_divs(map->p[i], bmap);
4738 for (j = 0; j < map->n; ++j)
4739 map->p[j] = isl_basic_map_cow(map->p[j]);
4741 for (i = 0; i < bmap->n_eq; ++i) {
4742 for (j = 0; j < map->n; ++j) {
4743 rest = add_cut_constraint(rest,
4744 map->p[j], bmap->eq[i], 1+total, 0);
4748 rest = add_cut_constraint(rest,
4749 map->p[j], bmap->eq[i], 1+total, 1);
4753 map->p[j] = isl_basic_map_extend_constraints(map->p[j],
4757 k = isl_basic_map_alloc_equality(map->p[j]);
4760 isl_seq_cpy(map->p[j]->eq[k], bmap->eq[i], 1+total);
4761 isl_seq_clr(map->p[j]->eq[k]+1+total,
4762 map->p[j]->n_div - bmap->n_div);
4766 for (i = 0; i < bmap->n_ineq; ++i) {
4767 for (j = 0; j < map->n; ++j) {
4768 rest = add_cut_constraint(rest,
4769 map->p[j], bmap->ineq[i], 1+total, 0);
4773 map->p[j] = isl_basic_map_extend_constraints(map->p[j],
4777 k = isl_basic_map_alloc_inequality(map->p[j]);
4780 isl_seq_cpy(map->p[j]->ineq[k], bmap->ineq[i], 1+total);
4781 isl_seq_clr(map->p[j]->ineq[k]+1+total,
4782 map->p[j]->n_div - bmap->n_div);
4794 struct isl_map *isl_map_subtract(struct isl_map *map1, struct isl_map *map2)
4800 isl_assert(map1->ctx, isl_dim_equal(map1->dim, map2->dim), goto error);
4802 if (isl_map_is_empty(map2)) {
4807 map1 = isl_map_compute_divs(map1);
4808 map2 = isl_map_compute_divs(map2);
4812 map1 = isl_map_remove_empty_parts(map1);
4813 map2 = isl_map_remove_empty_parts(map2);
4815 for (i = 0; map1 && i < map2->n; ++i)
4816 map1 = subtract(map1, map2->p[i]);
4826 struct isl_set *isl_set_subtract(struct isl_set *set1, struct isl_set *set2)
4828 return (struct isl_set *)
4830 (struct isl_map *)set1, (struct isl_map *)set2);
4833 struct isl_set *isl_set_apply(struct isl_set *set, struct isl_map *map)
4837 isl_assert(set->ctx, isl_map_compatible_domain(map, set), goto error);
4838 map = isl_map_intersect_domain(map, set);
4839 set = isl_map_range(map);
4847 /* There is no need to cow as removing empty parts doesn't change
4848 * the meaning of the set.
4850 struct isl_map *isl_map_remove_empty_parts(struct isl_map *map)
4857 for (i = map->n-1; i >= 0; --i) {
4858 if (!ISL_F_ISSET(map->p[i], ISL_BASIC_MAP_EMPTY))
4860 isl_basic_map_free(map->p[i]);
4861 if (i != map->n-1) {
4862 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4863 map->p[i] = map->p[map->n-1];
4871 struct isl_set *isl_set_remove_empty_parts(struct isl_set *set)
4873 return (struct isl_set *)
4874 isl_map_remove_empty_parts((struct isl_map *)set);
4877 struct isl_basic_map *isl_map_copy_basic_map(struct isl_map *map)
4879 struct isl_basic_map *bmap;
4880 if (!map || map->n == 0)
4882 bmap = map->p[map->n-1];
4883 isl_assert(map->ctx, ISL_F_ISSET(bmap, ISL_BASIC_SET_FINAL), return NULL);
4884 return isl_basic_map_copy(bmap);
4887 struct isl_basic_set *isl_set_copy_basic_set(struct isl_set *set)
4889 return (struct isl_basic_set *)
4890 isl_map_copy_basic_map((struct isl_map *)set);
4893 __isl_give isl_map *isl_map_drop_basic_map(__isl_take isl_map *map,
4894 __isl_keep isl_basic_map *bmap)
4900 for (i = map->n-1; i >= 0; --i) {
4901 if (map->p[i] != bmap)
4903 map = isl_map_cow(map);
4906 isl_basic_map_free(map->p[i]);
4907 if (i != map->n-1) {
4908 ISL_F_CLR(map, ISL_SET_NORMALIZED);
4909 map->p[i] = map->p[map->n-1];
4920 struct isl_set *isl_set_drop_basic_set(struct isl_set *set,
4921 struct isl_basic_set *bset)
4923 return (struct isl_set *)isl_map_drop_basic_map((struct isl_map *)set,
4924 (struct isl_basic_map *)bset);
4927 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
4928 * for any common value of the parameters and dimensions preceding dim
4929 * in both basic sets, the values of dimension pos in bset1 are
4930 * smaller or larger than those in bset2.
4933 * 1 if bset1 follows bset2
4934 * -1 if bset1 precedes bset2
4935 * 0 if bset1 and bset2 are incomparable
4936 * -2 if some error occurred.
4938 int isl_basic_set_compare_at(struct isl_basic_set *bset1,
4939 struct isl_basic_set *bset2, int pos)
4941 struct isl_dim *dims;
4942 struct isl_basic_map *bmap1 = NULL;
4943 struct isl_basic_map *bmap2 = NULL;
4944 struct isl_ctx *ctx;
4945 struct isl_vec *obj;
4948 unsigned dim1, dim2;
4950 enum isl_lp_result res;
4953 if (!bset1 || !bset2)
4956 nparam = isl_basic_set_n_param(bset1);
4957 dim1 = isl_basic_set_n_dim(bset1);
4958 dim2 = isl_basic_set_n_dim(bset2);
4959 dims = isl_dim_alloc(bset1->ctx, nparam, pos, dim1 - pos);
4960 bmap1 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset1), dims);
4961 dims = isl_dim_alloc(bset2->ctx, nparam, pos, dim2 - pos);
4962 bmap2 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset2), dims);
4963 if (!bmap1 || !bmap2)
4965 bmap1 = isl_basic_map_cow(bmap1);
4966 bmap1 = isl_basic_map_extend(bmap1, nparam,
4967 pos, (dim1 - pos) + (dim2 - pos),
4968 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
4969 bmap1 = add_constraints(bmap1, bmap2, 0, dim1 - pos);
4972 total = isl_basic_map_total_dim(bmap1);
4974 obj = isl_vec_alloc(ctx, 1 + total);
4975 isl_seq_clr(obj->block.data, 1 + total);
4976 isl_int_set_si(obj->block.data[1+nparam+pos], 1);
4977 isl_int_set_si(obj->block.data[1+nparam+pos+(dim1-pos)], -1);
4982 res = isl_basic_map_solve_lp(bmap1, 0, obj->block.data, ctx->one,
4984 if (res == isl_lp_empty)
4986 else if (res == isl_lp_ok && isl_int_is_pos(num))
4988 else if ((res == isl_lp_ok && isl_int_is_neg(num)) ||
4989 res == isl_lp_unbounded)
4995 isl_basic_map_free(bmap1);
4999 isl_basic_map_free(bmap1);
5000 isl_basic_map_free(bmap2);
5004 static int isl_basic_map_fast_has_fixed_var(struct isl_basic_map *bmap,
5005 unsigned pos, isl_int *val)
5013 total = isl_basic_map_total_dim(bmap);
5014 for (i = 0, d = total-1; i < bmap->n_eq && d+1 > pos; ++i) {
5015 for (; d+1 > pos; --d)
5016 if (!isl_int_is_zero(bmap->eq[i][1+d]))
5020 if (isl_seq_first_non_zero(bmap->eq[i]+1, d) != -1)
5022 if (isl_seq_first_non_zero(bmap->eq[i]+1+d+1, total-d-1) != -1)
5024 if (!isl_int_is_one(bmap->eq[i][1+d]))
5027 isl_int_neg(*val, bmap->eq[i][0]);
5033 static int isl_map_fast_has_fixed_var(struct isl_map *map,
5034 unsigned pos, isl_int *val)
5046 return isl_basic_map_fast_has_fixed_var(map->p[0], pos, val);
5049 fixed = isl_basic_map_fast_has_fixed_var(map->p[0], pos, &v);
5050 for (i = 1; fixed == 1 && i < map->n; ++i) {
5051 fixed = isl_basic_map_fast_has_fixed_var(map->p[i], pos, &tmp);
5052 if (fixed == 1 && isl_int_ne(tmp, v))
5056 isl_int_set(*val, v);
5062 static int isl_basic_set_fast_has_fixed_var(struct isl_basic_set *bset,
5063 unsigned pos, isl_int *val)
5065 return isl_basic_map_fast_has_fixed_var((struct isl_basic_map *)bset,
5069 static int isl_set_fast_has_fixed_var(struct isl_set *set, unsigned pos,
5072 return isl_map_fast_has_fixed_var((struct isl_map *)set, pos, val);
5075 int isl_basic_map_fast_is_fixed(struct isl_basic_map *bmap,
5076 enum isl_dim_type type, unsigned pos, isl_int *val)
5078 if (pos >= isl_basic_map_dim(bmap, type))
5080 return isl_basic_map_fast_has_fixed_var(bmap,
5081 isl_basic_map_offset(bmap, type) - 1 + pos, val);
5084 int isl_map_fast_is_fixed(struct isl_map *map,
5085 enum isl_dim_type type, unsigned pos, isl_int *val)
5087 if (pos >= isl_map_dim(map, type))
5089 return isl_map_fast_has_fixed_var(map,
5090 map_offset(map, type) - 1 + pos, val);
5093 /* Check if dimension dim has fixed value and if so and if val is not NULL,
5094 * then return this fixed value in *val.
5096 int isl_basic_set_fast_dim_is_fixed(struct isl_basic_set *bset, unsigned dim,
5099 return isl_basic_set_fast_has_fixed_var(bset,
5100 isl_basic_set_n_param(bset) + dim, val);
5103 /* Check if dimension dim has fixed value and if so and if val is not NULL,
5104 * then return this fixed value in *val.
5106 int isl_set_fast_dim_is_fixed(struct isl_set *set, unsigned dim, isl_int *val)
5108 return isl_set_fast_has_fixed_var(set, isl_set_n_param(set) + dim, val);
5111 /* Check if input variable in has fixed value and if so and if val is not NULL,
5112 * then return this fixed value in *val.
5114 int isl_map_fast_input_is_fixed(struct isl_map *map, unsigned in, isl_int *val)
5116 return isl_map_fast_has_fixed_var(map, isl_map_n_param(map) + in, val);
5119 /* Check if dimension dim has an (obvious) fixed lower bound and if so
5120 * and if val is not NULL, then return this lower bound in *val.
5122 int isl_basic_set_fast_dim_has_fixed_lower_bound(struct isl_basic_set *bset,
5123 unsigned dim, isl_int *val)
5125 int i, i_eq = -1, i_ineq = -1;
5132 total = isl_basic_set_total_dim(bset);
5133 nparam = isl_basic_set_n_param(bset);
5134 for (i = 0; i < bset->n_eq; ++i) {
5135 if (isl_int_is_zero(bset->eq[i][1+nparam+dim]))
5141 for (i = 0; i < bset->n_ineq; ++i) {
5142 if (!isl_int_is_pos(bset->ineq[i][1+nparam+dim]))
5144 if (i_eq != -1 || i_ineq != -1)
5148 if (i_eq == -1 && i_ineq == -1)
5150 c = i_eq != -1 ? bset->eq[i_eq] : bset->ineq[i_ineq];
5151 /* The coefficient should always be one due to normalization. */
5152 if (!isl_int_is_one(c[1+nparam+dim]))
5154 if (isl_seq_first_non_zero(c+1, nparam+dim) != -1)
5156 if (isl_seq_first_non_zero(c+1+nparam+dim+1,
5157 total - nparam - dim - 1) != -1)
5160 isl_int_neg(*val, c[0]);
5164 int isl_set_fast_dim_has_fixed_lower_bound(struct isl_set *set,
5165 unsigned dim, isl_int *val)
5177 return isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[0],
5181 fixed = isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[0],
5183 for (i = 1; fixed == 1 && i < set->n; ++i) {
5184 fixed = isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[i],
5186 if (fixed == 1 && isl_int_ne(tmp, v))
5190 isl_int_set(*val, v);
5201 static int qsort_constraint_cmp(const void *p1, const void *p2)
5203 const struct constraint *c1 = (const struct constraint *)p1;
5204 const struct constraint *c2 = (const struct constraint *)p2;
5205 unsigned size = isl_min(c1->size, c2->size);
5206 return isl_seq_cmp(c1->c, c2->c, size);
5209 static struct isl_basic_map *isl_basic_map_sort_constraints(
5210 struct isl_basic_map *bmap)
5213 struct constraint *c;
5218 total = isl_basic_map_total_dim(bmap);
5219 c = isl_alloc_array(bmap->ctx, struct constraint, bmap->n_ineq);
5222 for (i = 0; i < bmap->n_ineq; ++i) {
5224 c[i].c = bmap->ineq[i];
5226 qsort(c, bmap->n_ineq, sizeof(struct constraint), qsort_constraint_cmp);
5227 for (i = 0; i < bmap->n_ineq; ++i)
5228 bmap->ineq[i] = c[i].c;
5232 isl_basic_map_free(bmap);
5236 struct isl_basic_map *isl_basic_map_normalize(struct isl_basic_map *bmap)
5240 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_NORMALIZED))
5242 bmap = isl_basic_map_convex_hull(bmap);
5243 bmap = isl_basic_map_sort_constraints(bmap);
5244 ISL_F_SET(bmap, ISL_BASIC_MAP_NORMALIZED);
5248 struct isl_basic_set *isl_basic_set_normalize(struct isl_basic_set *bset)
5250 return (struct isl_basic_set *)isl_basic_map_normalize(
5251 (struct isl_basic_map *)bset);
5254 static int isl_basic_map_fast_cmp(const struct isl_basic_map *bmap1,
5255 const struct isl_basic_map *bmap2)
5262 if (isl_basic_map_n_param(bmap1) != isl_basic_map_n_param(bmap2))
5263 return isl_basic_map_n_param(bmap1) - isl_basic_map_n_param(bmap2);
5264 if (isl_basic_map_n_in(bmap1) != isl_basic_map_n_in(bmap2))
5265 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
5266 if (isl_basic_map_n_out(bmap1) != isl_basic_map_n_out(bmap2))
5267 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
5268 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY) &&
5269 ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
5271 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY))
5273 if (ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
5275 if (bmap1->n_eq != bmap2->n_eq)
5276 return bmap1->n_eq - bmap2->n_eq;
5277 if (bmap1->n_ineq != bmap2->n_ineq)
5278 return bmap1->n_ineq - bmap2->n_ineq;
5279 if (bmap1->n_div != bmap2->n_div)
5280 return bmap1->n_div - bmap2->n_div;
5281 total = isl_basic_map_total_dim(bmap1);
5282 for (i = 0; i < bmap1->n_eq; ++i) {
5283 cmp = isl_seq_cmp(bmap1->eq[i], bmap2->eq[i], 1+total);
5287 for (i = 0; i < bmap1->n_ineq; ++i) {
5288 cmp = isl_seq_cmp(bmap1->ineq[i], bmap2->ineq[i], 1+total);
5292 for (i = 0; i < bmap1->n_div; ++i) {
5293 cmp = isl_seq_cmp(bmap1->div[i], bmap2->div[i], 1+1+total);
5300 static int isl_basic_map_fast_is_equal(struct isl_basic_map *bmap1,
5301 struct isl_basic_map *bmap2)
5303 return isl_basic_map_fast_cmp(bmap1, bmap2) == 0;
5306 static int qsort_bmap_cmp(const void *p1, const void *p2)
5308 const struct isl_basic_map *bmap1 = *(const struct isl_basic_map **)p1;
5309 const struct isl_basic_map *bmap2 = *(const struct isl_basic_map **)p2;
5311 return isl_basic_map_fast_cmp(bmap1, bmap2);
5314 /* We normalize in place, but if anything goes wrong we need
5315 * to return NULL, so we need to make sure we don't change the
5316 * meaning of any possible other copies of map.
5318 struct isl_map *isl_map_normalize(struct isl_map *map)
5321 struct isl_basic_map *bmap;
5325 if (ISL_F_ISSET(map, ISL_MAP_NORMALIZED))
5327 for (i = 0; i < map->n; ++i) {
5328 bmap = isl_basic_map_normalize(isl_basic_map_copy(map->p[i]));
5331 isl_basic_map_free(map->p[i]);
5334 qsort(map->p, map->n, sizeof(struct isl_basic_map *), qsort_bmap_cmp);
5335 ISL_F_SET(map, ISL_MAP_NORMALIZED);
5336 map = isl_map_remove_empty_parts(map);
5339 for (i = map->n - 1; i >= 1; --i) {
5340 if (!isl_basic_map_fast_is_equal(map->p[i-1], map->p[i]))
5342 isl_basic_map_free(map->p[i-1]);
5343 for (j = i; j < map->n; ++j)
5344 map->p[j-1] = map->p[j];
5354 struct isl_set *isl_set_normalize(struct isl_set *set)
5356 return (struct isl_set *)isl_map_normalize((struct isl_map *)set);
5359 int isl_map_fast_is_equal(struct isl_map *map1, struct isl_map *map2)
5369 if (!isl_dim_equal(map1->dim, map2->dim))
5372 map1 = isl_map_copy(map1);
5373 map2 = isl_map_copy(map2);
5374 map1 = isl_map_normalize(map1);
5375 map2 = isl_map_normalize(map2);
5378 equal = map1->n == map2->n;
5379 for (i = 0; equal && i < map1->n; ++i) {
5380 equal = isl_basic_map_fast_is_equal(map1->p[i], map2->p[i]);
5393 int isl_set_fast_is_equal(struct isl_set *set1, struct isl_set *set2)
5395 return isl_map_fast_is_equal((struct isl_map *)set1,
5396 (struct isl_map *)set2);
5399 /* Return an interval that ranges from min to max (inclusive)
5401 struct isl_basic_set *isl_basic_set_interval(struct isl_ctx *ctx,
5402 isl_int min, isl_int max)
5405 struct isl_basic_set *bset = NULL;
5407 bset = isl_basic_set_alloc(ctx, 0, 1, 0, 0, 2);
5411 k = isl_basic_set_alloc_inequality(bset);
5414 isl_int_set_si(bset->ineq[k][1], 1);
5415 isl_int_neg(bset->ineq[k][0], min);
5417 k = isl_basic_set_alloc_inequality(bset);
5420 isl_int_set_si(bset->ineq[k][1], -1);
5421 isl_int_set(bset->ineq[k][0], max);
5425 isl_basic_set_free(bset);
5429 /* Return the Cartesian product of the basic sets in list (in the given order).
5431 struct isl_basic_set *isl_basic_set_product(struct isl_basic_set_list *list)
5439 struct isl_basic_set *product = NULL;
5443 isl_assert(list->ctx, list->n > 0, goto error);
5444 isl_assert(list->ctx, list->p[0], goto error);
5445 nparam = isl_basic_set_n_param(list->p[0]);
5446 dim = isl_basic_set_n_dim(list->p[0]);
5447 extra = list->p[0]->n_div;
5448 n_eq = list->p[0]->n_eq;
5449 n_ineq = list->p[0]->n_ineq;
5450 for (i = 1; i < list->n; ++i) {
5451 isl_assert(list->ctx, list->p[i], goto error);
5452 isl_assert(list->ctx,
5453 nparam == isl_basic_set_n_param(list->p[i]), goto error);
5454 dim += isl_basic_set_n_dim(list->p[i]);
5455 extra += list->p[i]->n_div;
5456 n_eq += list->p[i]->n_eq;
5457 n_ineq += list->p[i]->n_ineq;
5459 product = isl_basic_set_alloc(list->ctx, nparam, dim, extra,
5464 for (i = 0; i < list->n; ++i) {
5465 isl_basic_set_add_constraints(product,
5466 isl_basic_set_copy(list->p[i]), dim);
5467 dim += isl_basic_set_n_dim(list->p[i]);
5469 isl_basic_set_list_free(list);
5472 isl_basic_set_free(product);
5473 isl_basic_set_list_free(list);
5477 struct isl_basic_map *isl_basic_map_product(
5478 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
5480 struct isl_dim *dim_result = NULL;
5481 struct isl_basic_map *bmap;
5482 unsigned in1, in2, out1, out2, nparam, total, pos;
5483 struct isl_dim_map *dim_map1, *dim_map2;
5485 if (!bmap1 || !bmap2)
5488 isl_assert(bmap1->ctx, isl_dim_match(bmap1->dim, isl_dim_param,
5489 bmap2->dim, isl_dim_param), goto error);
5490 dim_result = isl_dim_product(isl_dim_copy(bmap1->dim),
5491 isl_dim_copy(bmap2->dim));
5493 in1 = isl_basic_map_n_in(bmap1);
5494 in2 = isl_basic_map_n_in(bmap2);
5495 out1 = isl_basic_map_n_out(bmap1);
5496 out2 = isl_basic_map_n_out(bmap2);
5497 nparam = isl_basic_map_n_param(bmap1);
5499 total = nparam + in1 + in2 + out1 + out2 + bmap1->n_div + bmap2->n_div;
5500 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
5501 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
5502 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
5503 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
5504 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
5505 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos += in1);
5506 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += in2);
5507 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += out1);
5508 isl_dim_map_div(dim_map1, bmap1, pos += out2);
5509 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
5511 bmap = isl_basic_map_alloc_dim(dim_result,
5512 bmap1->n_div + bmap2->n_div,
5513 bmap1->n_eq + bmap2->n_eq,
5514 bmap1->n_ineq + bmap2->n_ineq);
5515 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
5516 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
5517 bmap = isl_basic_map_simplify(bmap);
5518 return isl_basic_map_finalize(bmap);
5520 isl_basic_map_free(bmap1);
5521 isl_basic_map_free(bmap2);
5525 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
5527 struct isl_map *isl_map_product(struct isl_map *map1, struct isl_map *map2)
5530 struct isl_map *result;
5536 isl_assert(map1->ctx, isl_dim_match(map1->dim, isl_dim_param,
5537 map2->dim, isl_dim_param), goto error);
5539 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
5540 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
5541 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
5543 result = isl_map_alloc_dim(isl_dim_product(isl_dim_copy(map1->dim),
5544 isl_dim_copy(map2->dim)),
5545 map1->n * map2->n, flags);
5548 for (i = 0; i < map1->n; ++i)
5549 for (j = 0; j < map2->n; ++j) {
5550 struct isl_basic_map *part;
5551 part = isl_basic_map_product(
5552 isl_basic_map_copy(map1->p[i]),
5553 isl_basic_map_copy(map2->p[j]));
5554 if (isl_basic_map_is_empty(part))
5555 isl_basic_map_free(part);
5557 result = isl_map_add(result, part);
5570 /* Given two set A and B, construct its Cartesian product A x B.
5572 struct isl_set *isl_set_product(struct isl_set *set1, struct isl_set *set2)
5574 return (struct isl_set *)isl_map_product((struct isl_map *)set1,
5575 (struct isl_map *)set2);
5578 uint32_t isl_basic_set_get_hash(struct isl_basic_set *bset)
5581 uint32_t hash = isl_hash_init();
5586 bset = isl_basic_set_copy(bset);
5587 bset = isl_basic_set_normalize(bset);
5590 total = isl_basic_set_total_dim(bset);
5591 isl_hash_byte(hash, bset->n_eq & 0xFF);
5592 for (i = 0; i < bset->n_eq; ++i) {
5594 c_hash = isl_seq_get_hash(bset->eq[i], 1 + total);
5595 isl_hash_hash(hash, c_hash);
5597 isl_hash_byte(hash, bset->n_ineq & 0xFF);
5598 for (i = 0; i < bset->n_ineq; ++i) {
5600 c_hash = isl_seq_get_hash(bset->ineq[i], 1 + total);
5601 isl_hash_hash(hash, c_hash);
5603 isl_hash_byte(hash, bset->n_div & 0xFF);
5604 for (i = 0; i < bset->n_div; ++i) {
5606 if (isl_int_is_zero(bset->div[i][0]))
5608 isl_hash_byte(hash, i & 0xFF);
5609 c_hash = isl_seq_get_hash(bset->div[i], 1 + 1 + total);
5610 isl_hash_hash(hash, c_hash);
5612 isl_basic_set_free(bset);
5616 uint32_t isl_set_get_hash(struct isl_set *set)
5623 set = isl_set_copy(set);
5624 set = isl_set_normalize(set);
5628 hash = isl_hash_init();
5629 for (i = 0; i < set->n; ++i) {
5631 bset_hash = isl_basic_set_get_hash(set->p[i]);
5632 isl_hash_hash(hash, bset_hash);
5640 /* Check if the value for dimension dim is completely determined
5641 * by the values of the other parameters and variables.
5642 * That is, check if dimension dim is involved in an equality.
5644 int isl_basic_set_dim_is_unique(struct isl_basic_set *bset, unsigned dim)
5651 nparam = isl_basic_set_n_param(bset);
5652 for (i = 0; i < bset->n_eq; ++i)
5653 if (!isl_int_is_zero(bset->eq[i][1 + nparam + dim]))
5658 /* Check if the value for dimension dim is completely determined
5659 * by the values of the other parameters and variables.
5660 * That is, check if dimension dim is involved in an equality
5661 * for each of the subsets.
5663 int isl_set_dim_is_unique(struct isl_set *set, unsigned dim)
5669 for (i = 0; i < set->n; ++i) {
5671 unique = isl_basic_set_dim_is_unique(set->p[i], dim);
5678 int isl_map_foreach_basic_map(__isl_keep isl_map *map,
5679 int (*fn)(__isl_take isl_basic_map *bmap, void *user), void *user)
5686 for (i = 0; i < map->n; ++i)
5687 if (fn(isl_basic_map_copy(map->p[i]), user) < 0)
5693 int isl_set_foreach_basic_set(__isl_keep isl_set *set,
5694 int (*fn)(__isl_take isl_basic_set *bset, void *user), void *user)
5701 for (i = 0; i < set->n; ++i)
5702 if (fn(isl_basic_set_copy(set->p[i]), user) < 0)
5708 __isl_give isl_map *isl_set_lifting(__isl_take isl_set *set)
5710 struct isl_dim *dim;
5711 struct isl_basic_map *bmap;
5718 set = isl_set_align_divs(set);
5723 dim = isl_set_get_dim(set);
5724 if (set->n == 0 || set->p[0]->n_div == 0) {
5726 return isl_map_identity(dim);
5729 n_div = set->p[0]->n_div;
5730 dim = isl_dim_map(dim);
5731 n_param = isl_dim_size(dim, isl_dim_param);
5732 n_set = isl_dim_size(dim, isl_dim_in);
5733 dim = isl_dim_extend(dim, n_param, n_set, n_set + n_div);
5734 bmap = isl_basic_map_alloc_dim(dim, 0, n_set, 2 * n_div);
5735 for (i = 0; i < n_set; ++i)
5736 bmap = var_equal(bmap, i);
5738 total = n_param + n_set + n_set + n_div;
5739 for (i = 0; i < n_div; ++i) {
5740 k = isl_basic_map_alloc_inequality(bmap);
5743 isl_seq_cpy(bmap->ineq[k], set->p[0]->div[i]+1, 1+n_param);
5744 isl_seq_clr(bmap->ineq[k]+1+n_param, n_set);
5745 isl_seq_cpy(bmap->ineq[k]+1+n_param+n_set,
5746 set->p[0]->div[i]+1+1+n_param, n_set + n_div);
5747 isl_int_neg(bmap->ineq[k][1+n_param+n_set+n_set+i],
5748 set->p[0]->div[i][0]);
5750 l = isl_basic_map_alloc_inequality(bmap);
5753 isl_seq_neg(bmap->ineq[l], bmap->ineq[k], 1 + total);
5754 isl_int_add(bmap->ineq[l][0], bmap->ineq[l][0],
5755 set->p[0]->div[i][0]);
5756 isl_int_sub_ui(bmap->ineq[l][0], bmap->ineq[l][0], 1);
5760 return isl_map_from_basic_map(bmap);
5763 isl_basic_map_free(bmap);
5767 int isl_basic_set_size(__isl_keep isl_basic_set *bset)
5775 dim = isl_basic_set_total_dim(bset);
5776 size += bset->n_eq * (1 + dim);
5777 size += bset->n_ineq * (1 + dim);
5778 size += bset->n_div * (2 + dim);
5783 int isl_set_size(__isl_keep isl_set *set)
5791 for (i = 0; i < set->n; ++i)
5792 size += isl_basic_set_size(set->p[i]);