11 #include "isl_map_private.h"
12 #include "isl_map_piplib.h"
13 #include "isl_sample.h"
16 /* Maps dst positions to src positions */
22 static struct isl_dim_map *isl_dim_map_alloc(struct isl_ctx *ctx, unsigned len)
25 struct isl_dim_map *dim_map;
26 dim_map = isl_alloc(ctx, struct isl_dim_map,
27 sizeof(struct isl_dim_map) + len * sizeof(int));
30 dim_map->len = 1 + len;
32 for (i = 0; i < len; ++i)
33 dim_map->pos[1 + i] = -1;
37 static unsigned n(struct isl_dim *dim, enum isl_dim_type type)
40 case isl_dim_param: return dim->nparam;
41 case isl_dim_in: return dim->n_in;
42 case isl_dim_out: return dim->n_out;
46 static unsigned pos(struct isl_dim *dim, enum isl_dim_type type)
49 case isl_dim_param: return 1;
50 case isl_dim_in: return 1 + dim->nparam;
51 case isl_dim_out: return 1 + dim->nparam + dim->n_in;
55 static void isl_dim_map_dim(struct isl_dim_map *dim_map, struct isl_dim *dim,
56 enum isl_dim_type type, unsigned dst_pos)
64 src_pos = pos(dim, type);
65 for (i = 0; i < n(dim, type); ++i)
66 dim_map->pos[1 + dst_pos + i] = src_pos + i;
69 static void isl_dim_map_div(struct isl_dim_map *dim_map,
70 struct isl_basic_map *bmap, unsigned dst_pos)
75 if (!dim_map || !bmap)
78 src_pos = 1 + isl_dim_total(bmap->dim);
79 for (i = 0; i < bmap->n_div; ++i)
80 dim_map->pos[1 + dst_pos + i] = src_pos + i;
83 static void isl_dim_map_dump(struct isl_dim_map *dim_map)
87 for (i = 0; i < dim_map->len; ++i)
88 fprintf(stderr, "%d -> %d; ", i, dim_map->pos[i]);
89 fprintf(stderr, "\n");
92 unsigned isl_basic_map_dim(const struct isl_basic_map *bmap,
93 enum isl_dim_type type)
95 struct isl_dim *dim = bmap->dim;
97 case isl_dim_param: return dim->nparam;
98 case isl_dim_in: return dim->n_in;
99 case isl_dim_out: return dim->n_out;
100 case isl_dim_div: return bmap->n_div;
101 case isl_dim_all: return isl_basic_map_total_dim(bmap);
105 unsigned isl_basic_set_dim(const struct isl_basic_set *bset,
106 enum isl_dim_type type)
108 return isl_basic_map_dim((const struct isl_basic_map*)bset, type);
111 unsigned isl_basic_set_n_dim(const struct isl_basic_set *bset)
113 return bset->dim->n_out;
116 unsigned isl_basic_set_n_param(const struct isl_basic_set *bset)
118 return bset->dim->nparam;
121 unsigned isl_basic_set_total_dim(const struct isl_basic_set *bset)
123 return isl_dim_total(bset->dim) + bset->n_div;
126 unsigned isl_set_n_dim(const struct isl_set *set)
128 return set->dim->n_out;
131 unsigned isl_set_n_param(const struct isl_set *set)
133 return set->dim->nparam;
136 unsigned isl_basic_map_n_in(const struct isl_basic_map *bmap)
138 return bmap->dim->n_in;
141 unsigned isl_basic_map_n_out(const struct isl_basic_map *bmap)
143 return bmap->dim->n_out;
146 unsigned isl_basic_map_n_param(const struct isl_basic_map *bmap)
148 return bmap->dim->nparam;
151 unsigned isl_basic_map_n_div(const struct isl_basic_map *bmap)
156 unsigned isl_basic_map_total_dim(const struct isl_basic_map *bmap)
158 return isl_dim_total(bmap->dim) + bmap->n_div;
161 unsigned isl_map_n_in(const struct isl_map *map)
163 return map->dim->n_in;
166 unsigned isl_map_n_out(const struct isl_map *map)
168 return map->dim->n_out;
171 unsigned isl_map_n_param(const struct isl_map *map)
173 return map->dim->nparam;
176 int isl_map_compatible_domain(struct isl_map *map, struct isl_set *set)
178 return map->dim->n_in == set->dim->n_out &&
179 map->dim->nparam == set->dim->nparam;
182 int isl_basic_map_compatible_domain(struct isl_basic_map *bmap,
183 struct isl_basic_set *bset)
185 return bmap->dim->n_in == bset->dim->n_out &&
186 bmap->dim->nparam == bset->dim->nparam;
189 int isl_basic_map_compatible_range(struct isl_basic_map *bmap,
190 struct isl_basic_set *bset)
192 return bmap->dim->n_out == bset->dim->n_out &&
193 bmap->dim->nparam == bset->dim->nparam;
196 static struct isl_basic_map *basic_map_init(struct isl_ctx *ctx,
197 struct isl_basic_map *bmap, unsigned extra,
198 unsigned n_eq, unsigned n_ineq)
201 size_t row_size = 1 + isl_dim_total(bmap->dim) + extra;
203 bmap->block = isl_blk_alloc(ctx, (n_eq + n_ineq) * row_size);
204 if (isl_blk_is_error(bmap->block)) {
209 bmap->eq = isl_alloc_array(ctx, isl_int *, n_eq + n_ineq);
211 isl_blk_free(ctx, bmap->block);
217 bmap->block2 = isl_blk_empty();
220 bmap->block2 = isl_blk_alloc(ctx, extra * (1 + row_size));
221 if (isl_blk_is_error(bmap->block2)) {
223 isl_blk_free(ctx, bmap->block);
228 bmap->div = isl_alloc_array(ctx, isl_int *, extra);
230 isl_blk_free(ctx, bmap->block2);
232 isl_blk_free(ctx, bmap->block);
238 for (i = 0; i < n_eq + n_ineq; ++i)
239 bmap->eq[i] = bmap->block.data + i * row_size;
241 for (i = 0; i < extra; ++i)
242 bmap->div[i] = bmap->block2.data + i * (1 + row_size);
248 bmap->c_size = n_eq + n_ineq;
249 bmap->ineq = bmap->eq + n_eq;
258 isl_basic_map_free(bmap);
262 struct isl_basic_set *isl_basic_set_alloc(struct isl_ctx *ctx,
263 unsigned nparam, unsigned dim, unsigned extra,
264 unsigned n_eq, unsigned n_ineq)
266 struct isl_basic_map *bmap;
267 bmap = isl_basic_map_alloc(ctx, nparam, 0, dim, extra, n_eq, n_ineq);
268 return (struct isl_basic_set *)bmap;
271 struct isl_basic_set *isl_basic_set_alloc_dim(struct isl_dim *dim,
272 unsigned extra, unsigned n_eq, unsigned n_ineq)
274 struct isl_basic_map *bmap;
277 isl_assert(dim->ctx, dim->n_in == 0, return NULL);
278 bmap = isl_basic_map_alloc_dim(dim, extra, n_eq, n_ineq);
279 return (struct isl_basic_set *)bmap;
282 struct isl_basic_map *isl_basic_map_alloc_dim(struct isl_dim *dim,
283 unsigned extra, unsigned n_eq, unsigned n_ineq)
285 struct isl_basic_map *bmap;
289 bmap = isl_alloc_type(dim->ctx, struct isl_basic_map);
294 return basic_map_init(dim->ctx, bmap, extra, n_eq, n_ineq);
300 struct isl_basic_map *isl_basic_map_alloc(struct isl_ctx *ctx,
301 unsigned nparam, unsigned in, unsigned out, unsigned extra,
302 unsigned n_eq, unsigned n_ineq)
304 struct isl_basic_map *bmap;
307 dim = isl_dim_alloc(ctx, nparam, in, out);
311 bmap = isl_basic_map_alloc_dim(dim, extra, n_eq, n_ineq);
315 static void dup_constraints(
316 struct isl_basic_map *dst, struct isl_basic_map *src)
319 unsigned total = isl_basic_map_total_dim(src);
321 for (i = 0; i < src->n_eq; ++i) {
322 int j = isl_basic_map_alloc_equality(dst);
323 isl_seq_cpy(dst->eq[j], src->eq[i], 1+total);
326 for (i = 0; i < src->n_ineq; ++i) {
327 int j = isl_basic_map_alloc_inequality(dst);
328 isl_seq_cpy(dst->ineq[j], src->ineq[i], 1+total);
331 for (i = 0; i < src->n_div; ++i) {
332 int j = isl_basic_map_alloc_div(dst);
333 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total);
335 F_SET(dst, ISL_BASIC_SET_FINAL);
338 struct isl_basic_map *isl_basic_map_dup(struct isl_basic_map *bmap)
340 struct isl_basic_map *dup;
344 dup = isl_basic_map_alloc_dim(isl_dim_copy(bmap->dim),
345 bmap->n_div, bmap->n_eq, bmap->n_ineq);
348 dup->flags = bmap->flags;
349 dup_constraints(dup, bmap);
350 dup->sample = isl_vec_copy(bmap->ctx, bmap->sample);
354 struct isl_basic_set *isl_basic_set_dup(struct isl_basic_set *bset)
356 struct isl_basic_map *dup;
358 dup = isl_basic_map_dup((struct isl_basic_map *)bset);
359 return (struct isl_basic_set *)dup;
362 struct isl_basic_set *isl_basic_set_copy(struct isl_basic_set *bset)
367 if (F_ISSET(bset, ISL_BASIC_SET_FINAL)) {
371 return isl_basic_set_dup(bset);
374 struct isl_set *isl_set_copy(struct isl_set *set)
383 struct isl_basic_map *isl_basic_map_copy(struct isl_basic_map *bmap)
388 if (F_ISSET(bmap, ISL_BASIC_SET_FINAL)) {
392 return isl_basic_map_dup(bmap);
395 struct isl_map *isl_map_copy(struct isl_map *map)
404 void isl_basic_map_free(struct isl_basic_map *bmap)
412 isl_ctx_deref(bmap->ctx);
414 isl_blk_free(bmap->ctx, bmap->block2);
416 isl_blk_free(bmap->ctx, bmap->block);
417 isl_vec_free(bmap->ctx, bmap->sample);
418 isl_dim_free(bmap->dim);
422 void isl_basic_set_free(struct isl_basic_set *bset)
424 isl_basic_map_free((struct isl_basic_map *)bset);
427 int isl_basic_map_alloc_equality(struct isl_basic_map *bmap)
433 isl_assert(ctx, bmap->n_eq + bmap->n_ineq < bmap->c_size, return -1);
434 isl_assert(ctx, bmap->eq + bmap->n_eq <= bmap->ineq, return -1);
435 if (bmap->eq + bmap->n_eq == bmap->ineq) {
437 int j = isl_basic_map_alloc_inequality(bmap);
441 bmap->ineq[0] = bmap->ineq[j];
446 isl_seq_clr(bmap->eq[bmap->n_eq] +
447 1 + isl_basic_map_total_dim(bmap),
448 bmap->extra - bmap->n_div);
449 F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
453 int isl_basic_set_alloc_equality(struct isl_basic_set *bset)
455 return isl_basic_map_alloc_equality((struct isl_basic_map *)bset);
458 int isl_basic_map_free_equality(struct isl_basic_map *bmap, unsigned n)
462 isl_assert(bmap->ctx, n <= bmap->n_eq, return -1);
467 int isl_basic_map_drop_equality(struct isl_basic_map *bmap, unsigned pos)
472 isl_assert(bmap->ctx, pos < bmap->n_eq, return -1);
474 if (pos != bmap->n_eq - 1) {
476 bmap->eq[pos] = bmap->eq[bmap->n_eq - 1];
477 bmap->eq[bmap->n_eq - 1] = t;
483 int isl_basic_set_drop_equality(struct isl_basic_set *bset, unsigned pos)
485 return isl_basic_map_drop_equality((struct isl_basic_map *)bset, pos);
488 void isl_basic_map_inequality_to_equality(
489 struct isl_basic_map *bmap, unsigned pos)
494 bmap->ineq[pos] = bmap->ineq[0];
495 bmap->ineq[0] = bmap->eq[bmap->n_eq];
496 bmap->eq[bmap->n_eq] = t;
500 F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
501 F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
504 int isl_basic_map_alloc_inequality(struct isl_basic_map *bmap)
510 isl_assert(ctx, (bmap->ineq - bmap->eq) + bmap->n_ineq < bmap->c_size,
512 F_CLR(bmap, ISL_BASIC_MAP_NO_IMPLICIT);
513 F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
514 F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
515 isl_seq_clr(bmap->ineq[bmap->n_ineq] +
516 1 + isl_basic_map_total_dim(bmap),
517 bmap->extra - bmap->n_div);
518 return bmap->n_ineq++;
521 int isl_basic_set_alloc_inequality(struct isl_basic_set *bset)
523 return isl_basic_map_alloc_inequality((struct isl_basic_map *)bset);
526 int isl_basic_map_free_inequality(struct isl_basic_map *bmap, unsigned n)
530 isl_assert(bmap->ctx, n <= bmap->n_ineq, return -1);
535 int isl_basic_set_free_inequality(struct isl_basic_set *bset, unsigned n)
537 return isl_basic_map_free_inequality((struct isl_basic_map *)bset, n);
540 int isl_basic_map_drop_inequality(struct isl_basic_map *bmap, unsigned pos)
545 isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
547 if (pos != bmap->n_ineq - 1) {
549 bmap->ineq[pos] = bmap->ineq[bmap->n_ineq - 1];
550 bmap->ineq[bmap->n_ineq - 1] = t;
551 F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
557 int isl_basic_set_drop_inequality(struct isl_basic_set *bset, unsigned pos)
559 return isl_basic_map_drop_inequality((struct isl_basic_map *)bset, pos);
562 int isl_basic_map_alloc_div(struct isl_basic_map *bmap)
566 isl_assert(bmap->ctx, bmap->n_div < bmap->extra, return -1);
567 isl_seq_clr(bmap->div[bmap->n_div] +
568 1 + 1 + isl_basic_map_total_dim(bmap),
569 bmap->extra - bmap->n_div);
570 F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
571 return bmap->n_div++;
574 int isl_basic_map_free_div(struct isl_basic_map *bmap, unsigned n)
578 isl_assert(bmap->ctx, n <= bmap->n_div, return -1);
583 /* Copy constraint from src to dst, putting the vars of src at offset
584 * dim_off in dst and the divs of src at offset div_off in dst.
585 * If both sets are actually map, then dim_off applies to the input
588 static void copy_constraint(struct isl_basic_map *dst_map, isl_int *dst,
589 struct isl_basic_map *src_map, isl_int *src,
590 unsigned in_off, unsigned out_off, unsigned div_off)
592 unsigned src_nparam = isl_basic_map_n_param(src_map);
593 unsigned dst_nparam = isl_basic_map_n_param(dst_map);
594 unsigned src_in = isl_basic_map_n_in(src_map);
595 unsigned dst_in = isl_basic_map_n_in(dst_map);
596 unsigned src_out = isl_basic_map_n_out(src_map);
597 unsigned dst_out = isl_basic_map_n_out(dst_map);
598 isl_int_set(dst[0], src[0]);
599 isl_seq_cpy(dst+1, src+1, isl_min(dst_nparam, src_nparam));
600 if (dst_nparam > src_nparam)
601 isl_seq_clr(dst+1+src_nparam,
602 dst_nparam - src_nparam);
603 isl_seq_clr(dst+1+dst_nparam, in_off);
604 isl_seq_cpy(dst+1+dst_nparam+in_off,
606 isl_min(dst_in-in_off, src_in));
607 if (dst_in-in_off > src_in)
608 isl_seq_clr(dst+1+dst_nparam+in_off+src_in,
609 dst_in - in_off - src_in);
610 isl_seq_clr(dst+1+dst_nparam+dst_in, out_off);
611 isl_seq_cpy(dst+1+dst_nparam+dst_in+out_off,
612 src+1+src_nparam+src_in,
613 isl_min(dst_out-out_off, src_out));
614 if (dst_out-out_off > src_out)
615 isl_seq_clr(dst+1+dst_nparam+dst_in+out_off+src_out,
616 dst_out - out_off - src_out);
617 isl_seq_clr(dst+1+dst_nparam+dst_in+dst_out, div_off);
618 isl_seq_cpy(dst+1+dst_nparam+dst_in+dst_out+div_off,
619 src+1+src_nparam+src_in+src_out,
620 isl_min(dst_map->extra-div_off, src_map->n_div));
621 if (dst_map->n_div-div_off > src_map->n_div)
622 isl_seq_clr(dst+1+dst_nparam+dst_in+dst_out+
623 div_off+src_map->n_div,
624 dst_map->n_div - div_off - src_map->n_div);
627 static void copy_div(struct isl_basic_map *dst_map, isl_int *dst,
628 struct isl_basic_map *src_map, isl_int *src,
629 unsigned in_off, unsigned out_off, unsigned div_off)
631 isl_int_set(dst[0], src[0]);
632 copy_constraint(dst_map, dst+1, src_map, src+1, in_off, out_off, div_off);
635 static struct isl_basic_map *add_constraints(struct isl_basic_map *bmap1,
636 struct isl_basic_map *bmap2, unsigned i_pos, unsigned o_pos)
641 if (!bmap1 || !bmap2)
644 div_off = bmap1->n_div;
646 for (i = 0; i < bmap2->n_eq; ++i) {
647 int i1 = isl_basic_map_alloc_equality(bmap1);
650 copy_constraint(bmap1, bmap1->eq[i1], bmap2, bmap2->eq[i],
651 i_pos, o_pos, div_off);
654 for (i = 0; i < bmap2->n_ineq; ++i) {
655 int i1 = isl_basic_map_alloc_inequality(bmap1);
658 copy_constraint(bmap1, bmap1->ineq[i1], bmap2, bmap2->ineq[i],
659 i_pos, o_pos, div_off);
662 for (i = 0; i < bmap2->n_div; ++i) {
663 int i1 = isl_basic_map_alloc_div(bmap1);
666 copy_div(bmap1, bmap1->div[i1], bmap2, bmap2->div[i],
667 i_pos, o_pos, div_off);
670 isl_basic_map_free(bmap2);
675 isl_basic_map_free(bmap1);
676 isl_basic_map_free(bmap2);
680 static void copy_constraint_dim_map(isl_int *dst, isl_int *src,
681 struct isl_dim_map *dim_map)
685 for (i = 0; i < dim_map->len; ++i) {
686 if (dim_map->pos[i] < 0)
687 isl_int_set_si(dst[i], 0);
689 isl_int_set(dst[i], src[dim_map->pos[i]]);
693 static void copy_div_dim_map(isl_int *dst, isl_int *src,
694 struct isl_dim_map *dim_map)
696 isl_int_set(dst[0], src[0]);
697 copy_constraint_dim_map(dst+1, src+1, dim_map);
700 static struct isl_basic_map *add_constraints_dim_map(struct isl_basic_map *dst,
701 struct isl_basic_map *src, struct isl_dim_map *dim_map)
705 if (!src || !dst || !dim_map)
708 for (i = 0; i < src->n_eq; ++i) {
709 int i1 = isl_basic_map_alloc_equality(dst);
712 copy_constraint_dim_map(dst->eq[i1], src->eq[i], dim_map);
715 for (i = 0; i < src->n_ineq; ++i) {
716 int i1 = isl_basic_map_alloc_inequality(dst);
719 copy_constraint_dim_map(dst->ineq[i1], src->ineq[i], dim_map);
722 for (i = 0; i < src->n_div; ++i) {
723 int i1 = isl_basic_map_alloc_div(dst);
726 copy_div_dim_map(dst->div[i1], src->div[i], dim_map);
730 isl_basic_map_free(src);
735 isl_basic_map_free(src);
736 isl_basic_map_free(dst);
740 struct isl_basic_set *isl_basic_set_add_constraints(struct isl_basic_set *bset1,
741 struct isl_basic_set *bset2, unsigned pos)
743 return (struct isl_basic_set *)
744 add_constraints((struct isl_basic_map *)bset1,
745 (struct isl_basic_map *)bset2, 0, pos);
748 struct isl_basic_map *isl_basic_map_extend_dim(struct isl_basic_map *base,
749 struct isl_dim *dim, unsigned extra,
750 unsigned n_eq, unsigned n_ineq)
752 struct isl_basic_map *ext;
759 base = isl_basic_map_cow(base);
763 dims_ok = isl_dim_equal(base->dim, dim) &&
764 base->extra >= base->n_div + extra;
766 if (dims_ok && n_eq == 0 && n_ineq == 0) {
771 isl_assert(base->ctx, base->dim->nparam <= dim->nparam, goto error);
772 isl_assert(base->ctx, base->dim->n_in <= dim->n_in, goto error);
773 isl_assert(base->ctx, base->dim->n_out <= dim->n_out, goto error);
774 extra += base->extra;
776 n_ineq += base->n_ineq;
778 ext = isl_basic_map_alloc_dim(dim, extra, n_eq, n_ineq);
784 ext = add_constraints(ext, base, 0, 0);
787 F_CLR(ext, ISL_BASIC_SET_FINAL);
794 isl_basic_map_free(base);
798 struct isl_basic_map *isl_basic_map_extend_constraints(
799 struct isl_basic_map *base, unsigned n_eq, unsigned n_ineq)
803 return isl_basic_map_extend_dim(base, isl_dim_copy(base->dim),
807 struct isl_basic_map *isl_basic_map_extend(struct isl_basic_map *base,
808 unsigned nparam, unsigned n_in, unsigned n_out, unsigned extra,
809 unsigned n_eq, unsigned n_ineq)
811 struct isl_basic_map *bmap;
816 dim = isl_dim_alloc(base->ctx, nparam, n_in, n_out);
820 bmap = isl_basic_map_extend_dim(base, dim, extra, n_eq, n_ineq);
824 struct isl_basic_set *isl_basic_set_extend(struct isl_basic_set *base,
825 unsigned nparam, unsigned dim, unsigned extra,
826 unsigned n_eq, unsigned n_ineq)
828 return (struct isl_basic_set *)
829 isl_basic_map_extend((struct isl_basic_map *)base,
830 nparam, 0, dim, extra, n_eq, n_ineq);
833 struct isl_basic_set *isl_basic_set_extend_constraints(
834 struct isl_basic_set *base, unsigned n_eq, unsigned n_ineq)
836 return (struct isl_basic_set *)
837 isl_basic_map_extend_constraints((struct isl_basic_map *)base,
841 struct isl_basic_set *isl_basic_set_cow(struct isl_basic_set *bset)
843 return (struct isl_basic_set *)
844 isl_basic_map_cow((struct isl_basic_map *)bset);
847 struct isl_basic_map *isl_basic_map_cow(struct isl_basic_map *bmap)
854 bmap = isl_basic_map_dup(bmap);
856 F_CLR(bmap, ISL_BASIC_SET_FINAL);
860 struct isl_set *isl_set_cow(struct isl_set *set)
868 return isl_set_dup(set);
871 struct isl_map *isl_map_cow(struct isl_map *map)
879 return isl_map_dup(map);
882 static void swap_vars(struct isl_blk blk, isl_int *a,
883 unsigned a_len, unsigned b_len)
885 isl_seq_cpy(blk.data, a+a_len, b_len);
886 isl_seq_cpy(blk.data+b_len, a, a_len);
887 isl_seq_cpy(a, blk.data, b_len+a_len);
890 struct isl_basic_set *isl_basic_set_swap_vars(
891 struct isl_basic_set *bset, unsigned n)
901 nparam = isl_basic_set_n_param(bset);
902 dim = isl_basic_set_n_dim(bset);
903 isl_assert(bset->ctx, n <= dim, goto error);
908 bset = isl_basic_set_cow(bset);
912 blk = isl_blk_alloc(bset->ctx, dim);
913 if (isl_blk_is_error(blk))
916 for (i = 0; i < bset->n_eq; ++i)
918 bset->eq[i]+1+nparam, n, dim - n);
920 for (i = 0; i < bset->n_ineq; ++i)
922 bset->ineq[i]+1+nparam, n, dim - n);
924 for (i = 0; i < bset->n_div; ++i)
926 bset->div[i]+1+1+nparam, n, dim - n);
928 isl_blk_free(bset->ctx, blk);
930 F_CLR(bset, ISL_BASIC_SET_NORMALIZED);
934 isl_basic_set_free(bset);
938 struct isl_set *isl_set_swap_vars(struct isl_set *set, unsigned n)
941 set = isl_set_cow(set);
945 for (i = 0; i < set->n; ++i) {
946 set->p[i] = isl_basic_set_swap_vars(set->p[i], n);
952 F_CLR(set, ISL_SET_NORMALIZED);
956 struct isl_basic_map *isl_basic_map_set_to_empty(struct isl_basic_map *bmap)
962 total = isl_basic_map_total_dim(bmap);
963 isl_basic_map_free_div(bmap, bmap->n_div);
964 isl_basic_map_free_inequality(bmap, bmap->n_ineq);
966 isl_basic_map_free_equality(bmap, bmap->n_eq-1);
968 isl_basic_map_alloc_equality(bmap);
972 isl_int_set_si(bmap->eq[i][0], 1);
973 isl_seq_clr(bmap->eq[i]+1, total);
974 F_SET(bmap, ISL_BASIC_MAP_EMPTY);
975 return isl_basic_map_finalize(bmap);
977 isl_basic_map_free(bmap);
981 struct isl_basic_set *isl_basic_set_set_to_empty(struct isl_basic_set *bset)
983 return (struct isl_basic_set *)
984 isl_basic_map_set_to_empty((struct isl_basic_map *)bset);
987 static void swap_div(struct isl_basic_map *bmap, int a, int b)
990 unsigned off = isl_dim_total(bmap->dim);
991 isl_int *t = bmap->div[a];
992 bmap->div[a] = bmap->div[b];
995 for (i = 0; i < bmap->n_eq; ++i)
996 isl_int_swap(bmap->eq[i][1+off+a], bmap->eq[i][1+off+b]);
998 for (i = 0; i < bmap->n_ineq; ++i)
999 isl_int_swap(bmap->ineq[i][1+off+a], bmap->ineq[i][1+off+b]);
1001 for (i = 0; i < bmap->n_div; ++i)
1002 isl_int_swap(bmap->div[i][1+1+off+a], bmap->div[i][1+1+off+b]);
1003 F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1006 /* Eliminate the specified n dimensions starting at first from the
1007 * constraints using Fourier-Motzkin, The dimensions themselves
1010 struct isl_set *isl_set_eliminate_dims(struct isl_set *set,
1011 unsigned first, unsigned n)
1021 set = isl_set_cow(set);
1024 isl_assert(set->ctx, first+n <= isl_set_n_dim(set), goto error);
1025 nparam = isl_set_n_param(set);
1027 for (i = 0; i < set->n; ++i) {
1028 set->p[i] = isl_basic_set_eliminate_vars(set->p[i],
1039 /* Project out n dimensions starting at first using Fourier-Motzkin */
1040 struct isl_set *isl_set_remove_dims(struct isl_set *set,
1041 unsigned first, unsigned n)
1043 set = isl_set_eliminate_dims(set, first, n);
1044 set = isl_set_drop_dims(set, first, n);
1048 struct isl_basic_set *isl_basic_set_remove_divs(struct isl_basic_set *bset)
1050 bset = isl_basic_set_eliminate_vars(bset, isl_dim_total(bset->dim),
1058 struct isl_set *isl_set_remove_divs(struct isl_set *set)
1067 set = isl_set_cow(set);
1071 for (i = 0; i < set->n; ++i) {
1072 set->p[i] = isl_basic_set_remove_divs(set->p[i]);
1082 /* Project out n inputs starting at first using Fourier-Motzkin */
1083 struct isl_map *isl_map_remove_inputs(struct isl_map *map,
1084 unsigned first, unsigned n)
1092 map = isl_map_cow(map);
1095 nparam = isl_map_n_param(map);
1096 isl_assert(map->ctx, first+n <= isl_map_n_in(map), goto error);
1098 for (i = 0; i < map->n; ++i) {
1099 map->p[i] = isl_basic_map_eliminate_vars(map->p[i],
1104 map = isl_map_drop_inputs(map, first, n);
1111 /* Project out n dimensions starting at first using Fourier-Motzkin */
1112 struct isl_basic_set *isl_basic_set_remove_dims(struct isl_basic_set *bset,
1113 unsigned first, unsigned n)
1115 unsigned nparam = isl_basic_set_n_param(bset);
1116 bset = isl_basic_set_eliminate_vars(bset, nparam + first, n);
1117 bset = isl_basic_set_drop_dims(bset, first, n);
1121 static void dump_term(struct isl_basic_map *bmap,
1122 isl_int c, int pos, FILE *out)
1125 unsigned in = isl_basic_map_n_in(bmap);
1126 unsigned dim = in + isl_basic_map_n_out(bmap);
1127 unsigned nparam = isl_basic_map_n_param(bmap);
1129 isl_int_print(out, c, 0);
1131 if (!isl_int_is_one(c))
1132 isl_int_print(out, c, 0);
1133 if (pos < 1 + nparam) {
1134 name = isl_dim_get_name(bmap->dim,
1135 isl_dim_param, pos - 1);
1137 fprintf(out, "%s", name);
1139 fprintf(out, "p%d", pos - 1);
1140 } else if (pos < 1 + nparam + in)
1141 fprintf(out, "i%d", pos - 1 - nparam);
1142 else if (pos < 1 + nparam + dim)
1143 fprintf(out, "o%d", pos - 1 - nparam - in);
1145 fprintf(out, "e%d", pos - 1 - nparam - dim);
1149 static void dump_constraint_sign(struct isl_basic_map *bmap, isl_int *c,
1150 int sign, FILE *out)
1154 unsigned len = 1 + isl_basic_map_total_dim(bmap);
1158 for (i = 0, first = 1; i < len; ++i) {
1159 if (isl_int_sgn(c[i]) * sign <= 0)
1162 fprintf(out, " + ");
1164 isl_int_abs(v, c[i]);
1165 dump_term(bmap, v, i, out);
1172 static void dump_constraint(struct isl_basic_map *bmap, isl_int *c,
1173 const char *op, FILE *out, int indent)
1177 fprintf(out, "%*s", indent, "");
1179 dump_constraint_sign(bmap, c, 1, out);
1180 fprintf(out, " %s ", op);
1181 dump_constraint_sign(bmap, c, -1, out);
1185 for (i = bmap->n_div; i < bmap->extra; ++i) {
1186 if (isl_int_is_zero(c[1+isl_dim_total(bmap->dim)+i]))
1188 fprintf(out, "%*s", indent, "");
1189 fprintf(out, "ERROR: unused div coefficient not zero\n");
1194 static void dump_constraints(struct isl_basic_map *bmap,
1195 isl_int **c, unsigned n,
1196 const char *op, FILE *out, int indent)
1200 for (i = 0; i < n; ++i)
1201 dump_constraint(bmap, c[i], op, out, indent);
1204 static void dump_affine(struct isl_basic_map *bmap, isl_int *exp, FILE *out)
1208 unsigned total = isl_basic_map_total_dim(bmap);
1210 for (j = 0; j < 1 + total; ++j) {
1211 if (isl_int_is_zero(exp[j]))
1213 if (!first && isl_int_is_pos(exp[j]))
1215 dump_term(bmap, exp[j], j, out);
1220 static void dump(struct isl_basic_map *bmap, FILE *out, int indent)
1224 dump_constraints(bmap, bmap->eq, bmap->n_eq, "=", out, indent);
1225 dump_constraints(bmap, bmap->ineq, bmap->n_ineq, ">=", out, indent);
1227 for (i = 0; i < bmap->n_div; ++i) {
1228 fprintf(out, "%*s", indent, "");
1229 fprintf(out, "e%d = [(", i);
1230 dump_affine(bmap, bmap->div[i]+1, out);
1232 isl_int_print(out, bmap->div[i][0], 0);
1233 fprintf(out, "]\n");
1237 void isl_basic_set_dump(struct isl_basic_set *bset, FILE *out, int indent)
1240 fprintf(out, "null basic set\n");
1244 fprintf(out, "%*s", indent, "");
1245 fprintf(out, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n",
1246 bset->ref, bset->dim->nparam, bset->dim->n_out,
1247 bset->extra, bset->flags);
1248 dump((struct isl_basic_map *)bset, out, indent);
1251 void isl_basic_map_dump(struct isl_basic_map *bmap, FILE *out, int indent)
1254 fprintf(out, "null basic map\n");
1258 fprintf(out, "%*s", indent, "");
1259 fprintf(out, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, "
1260 "flags: %x, n_name: %d\n",
1262 bmap->dim->nparam, bmap->dim->n_in, bmap->dim->n_out,
1263 bmap->extra, bmap->flags, bmap->dim->n_name);
1264 dump(bmap, out, indent);
1267 int isl_inequality_negate(struct isl_basic_map *bmap, unsigned pos)
1272 total = isl_basic_map_total_dim(bmap);
1273 isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
1274 isl_seq_neg(bmap->ineq[pos], bmap->ineq[pos], 1 + total);
1275 isl_int_sub_ui(bmap->ineq[pos][0], bmap->ineq[pos][0], 1);
1276 F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1280 struct isl_set *isl_set_alloc_dim(struct isl_dim *dim, int n, unsigned flags)
1282 struct isl_set *set;
1286 isl_assert(dim->ctx, dim->n_in == 0, return NULL);
1287 isl_assert(dim->ctx, n >= 0, return NULL);
1288 set = isl_alloc(dim->ctx, struct isl_set,
1289 sizeof(struct isl_set) +
1290 n * sizeof(struct isl_basic_set *));
1294 set->ctx = dim->ctx;
1295 isl_ctx_ref(set->ctx);
1307 struct isl_set *isl_set_alloc(struct isl_ctx *ctx,
1308 unsigned nparam, unsigned dim, int n, unsigned flags)
1310 struct isl_set *set;
1311 struct isl_dim *dims;
1313 dims = isl_dim_alloc(ctx, nparam, 0, dim);
1317 set = isl_set_alloc_dim(dims, n, flags);
1321 struct isl_set *isl_set_dup(struct isl_set *set)
1324 struct isl_set *dup;
1329 dup = isl_set_alloc_dim(isl_dim_copy(set->dim), set->n, set->flags);
1332 for (i = 0; i < set->n; ++i)
1333 dup = isl_set_add(dup, isl_basic_set_copy(set->p[i]));
1337 struct isl_set *isl_set_from_basic_set(struct isl_basic_set *bset)
1339 struct isl_set *set;
1344 set = isl_set_alloc_dim(isl_dim_copy(bset->dim), 1, ISL_MAP_DISJOINT);
1346 isl_basic_set_free(bset);
1349 return isl_set_add(set, bset);
1352 struct isl_map *isl_map_from_basic_map(struct isl_basic_map *bmap)
1354 struct isl_map *map;
1359 map = isl_map_alloc_dim(isl_dim_copy(bmap->dim), 1, ISL_MAP_DISJOINT);
1361 isl_basic_map_free(bmap);
1364 return isl_map_add(map, bmap);
1367 struct isl_set *isl_set_add(struct isl_set *set, struct isl_basic_set *bset)
1371 isl_assert(set->ctx, isl_dim_equal(set->dim, bset->dim), goto error);
1372 isl_assert(set->ctx, set->n < set->size, goto error);
1373 set->p[set->n] = bset;
1380 isl_basic_set_free(bset);
1384 void isl_set_free(struct isl_set *set)
1394 isl_ctx_deref(set->ctx);
1395 for (i = 0; i < set->n; ++i)
1396 isl_basic_set_free(set->p[i]);
1397 isl_dim_free(set->dim);
1401 void isl_set_dump(struct isl_set *set, FILE *out, int indent)
1406 fprintf(out, "null set\n");
1410 fprintf(out, "%*s", indent, "");
1411 fprintf(out, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
1412 set->ref, set->n, set->dim->nparam, set->dim->n_out,
1414 for (i = 0; i < set->n; ++i) {
1415 fprintf(out, "%*s", indent, "");
1416 fprintf(out, "basic set %d:\n", i);
1417 isl_basic_set_dump(set->p[i], out, indent+4);
1421 void isl_map_dump(struct isl_map *map, FILE *out, int indent)
1426 fprintf(out, "null map\n");
1430 fprintf(out, "%*s", indent, "");
1431 fprintf(out, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, "
1432 "flags: %x, n_name: %d\n",
1433 map->ref, map->n, map->dim->nparam, map->dim->n_in,
1434 map->dim->n_out, map->flags, map->dim->n_name);
1435 for (i = 0; i < map->n; ++i) {
1436 fprintf(out, "%*s", indent, "");
1437 fprintf(out, "basic map %d:\n", i);
1438 isl_basic_map_dump(map->p[i], out, indent+4);
1442 struct isl_basic_map *isl_basic_map_intersect_domain(
1443 struct isl_basic_map *bmap, struct isl_basic_set *bset)
1445 struct isl_basic_map *bmap_domain;
1446 struct isl_dim *dim;
1451 isl_assert(set->ctx, isl_basic_map_compatible_domain(bmap, bset),
1454 bmap = isl_basic_map_extend_dim(bmap, isl_dim_copy(bmap->dim),
1455 bset->n_div, bset->n_eq, bset->n_ineq);
1458 dim = isl_dim_reverse(isl_dim_copy(bset->dim));
1459 bmap_domain = isl_basic_map_from_basic_set(bset, dim);
1460 bmap = add_constraints(bmap, bmap_domain, 0, 0);
1462 bmap = isl_basic_map_simplify(bmap);
1463 return isl_basic_map_finalize(bmap);
1465 isl_basic_map_free(bmap);
1466 isl_basic_set_free(bset);
1470 struct isl_basic_map *isl_basic_map_intersect_range(
1471 struct isl_basic_map *bmap, struct isl_basic_set *bset)
1473 struct isl_basic_map *bmap_range;
1478 isl_assert(bset->ctx, isl_basic_map_compatible_range(bmap, bset),
1481 bmap = isl_basic_map_extend_dim(bmap, isl_dim_copy(bmap->dim),
1482 bset->n_div, bset->n_eq, bset->n_ineq);
1485 bmap_range = isl_basic_map_from_basic_set(bset, isl_dim_copy(bset->dim));
1486 bmap = add_constraints(bmap, bmap_range, 0, 0);
1488 bmap = isl_basic_map_simplify(bmap);
1489 return isl_basic_map_finalize(bmap);
1491 isl_basic_map_free(bmap);
1492 isl_basic_set_free(bset);
1496 struct isl_basic_map *isl_basic_map_intersect(
1497 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
1499 if (!bmap1 || !bmap2)
1502 isl_assert(map1->ctx, isl_dim_equal(bmap1->dim, bmap2->dim), goto error);
1504 bmap1 = isl_basic_map_extend_dim(bmap1, isl_dim_copy(bmap1->dim),
1505 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
1508 bmap1 = add_constraints(bmap1, bmap2, 0, 0);
1510 bmap1 = isl_basic_map_simplify(bmap1);
1511 return isl_basic_map_finalize(bmap1);
1513 isl_basic_map_free(bmap1);
1514 isl_basic_map_free(bmap2);
1518 struct isl_basic_set *isl_basic_set_intersect(
1519 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
1521 return (struct isl_basic_set *)
1522 isl_basic_map_intersect(
1523 (struct isl_basic_map *)bset1,
1524 (struct isl_basic_map *)bset2);
1527 struct isl_map *isl_map_intersect(struct isl_map *map1, struct isl_map *map2)
1530 struct isl_map *result;
1536 if (F_ISSET(map1, ISL_MAP_DISJOINT) &&
1537 F_ISSET(map2, ISL_MAP_DISJOINT))
1538 FL_SET(flags, ISL_MAP_DISJOINT);
1540 result = isl_map_alloc_dim(isl_dim_copy(map1->dim),
1541 map1->n * map2->n, flags);
1544 for (i = 0; i < map1->n; ++i)
1545 for (j = 0; j < map2->n; ++j) {
1546 struct isl_basic_map *part;
1547 part = isl_basic_map_intersect(
1548 isl_basic_map_copy(map1->p[i]),
1549 isl_basic_map_copy(map2->p[j]));
1550 if (isl_basic_map_is_empty(part))
1551 isl_basic_map_free(part);
1553 result = isl_map_add(result, part);
1566 struct isl_set *isl_set_intersect(struct isl_set *set1, struct isl_set *set2)
1568 return (struct isl_set *)
1569 isl_map_intersect((struct isl_map *)set1,
1570 (struct isl_map *)set2);
1573 struct isl_basic_map *isl_basic_map_reverse(struct isl_basic_map *bmap)
1575 struct isl_dim *dim;
1576 struct isl_basic_set *bset;
1581 bmap = isl_basic_map_cow(bmap);
1584 dim = isl_dim_reverse(isl_dim_copy(bmap->dim));
1585 in = isl_basic_map_n_in(bmap);
1586 bset = isl_basic_set_from_basic_map(bmap);
1587 bset = isl_basic_set_swap_vars(bset, in);
1588 return isl_basic_map_from_basic_set(bset, dim);
1591 /* Turn final n dimensions into existentially quantified variables.
1593 struct isl_basic_set *isl_basic_set_project_out(
1594 struct isl_basic_set *bset, unsigned n, unsigned flags)
1604 isl_assert(bset->ctx, n <= isl_basic_set_n_dim(bset), goto error);
1609 bset = isl_basic_set_cow(bset);
1611 row_size = 1 + isl_dim_total(bset->dim) + bset->extra;
1612 old = bset->block2.data;
1613 bset->block2 = isl_blk_extend(bset->ctx, bset->block2,
1614 (bset->extra + n) * (1 + row_size));
1615 if (!bset->block2.data)
1617 new_div = isl_alloc_array(ctx, isl_int *, bset->extra + n);
1620 for (i = 0; i < n; ++i) {
1621 new_div[i] = bset->block2.data +
1622 (bset->extra + i) * (1 + row_size);
1623 isl_seq_clr(new_div[i], 1 + row_size);
1625 for (i = 0; i < bset->extra; ++i)
1626 new_div[n + i] = bset->block2.data + (bset->div[i] - old);
1628 bset->div = new_div;
1631 bset->dim = isl_dim_drop_outputs(bset->dim,
1632 isl_basic_set_n_dim(bset) - n, n);
1635 bset = isl_basic_set_simplify(bset);
1636 return isl_basic_set_finalize(bset);
1638 isl_basic_set_free(bset);
1642 struct isl_basic_map *add_divs(struct isl_basic_map *bmap, unsigned n)
1646 for (i = 0; i < n; ++i) {
1647 j = isl_basic_map_alloc_div(bmap);
1650 isl_seq_clr(bmap->div[j], 1+1+isl_basic_map_total_dim(bmap));
1654 isl_basic_map_free(bmap);
1658 struct isl_basic_map *isl_basic_map_apply_range(
1659 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
1661 struct isl_dim *dim_result = NULL;
1662 struct isl_basic_map *bmap;
1663 unsigned n_in, n_out, n, nparam, total, pos;
1664 struct isl_dim_map *dim_map1, *dim_map2;
1666 if (!bmap1 || !bmap2)
1669 dim_result = isl_dim_join(isl_dim_copy(bmap1->dim),
1670 isl_dim_copy(bmap2->dim));
1672 n_in = isl_basic_map_n_in(bmap1);
1673 n_out = isl_basic_map_n_out(bmap2);
1674 n = isl_basic_map_n_out(bmap1);
1675 nparam = isl_basic_map_n_param(bmap1);
1677 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + n;
1678 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
1679 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
1680 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
1681 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
1682 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
1683 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_in);
1684 isl_dim_map_div(dim_map1, bmap1, pos += n_out);
1685 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
1686 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
1687 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
1689 bmap = isl_basic_map_alloc_dim(dim_result,
1690 bmap1->n_div + bmap2->n_div + n,
1691 bmap1->n_eq + bmap2->n_eq,
1692 bmap1->n_ineq + bmap2->n_ineq);
1693 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
1694 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
1695 bmap = add_divs(bmap, n);
1696 bmap = isl_basic_map_simplify(bmap);
1697 return isl_basic_map_finalize(bmap);
1699 isl_basic_map_free(bmap1);
1700 isl_basic_map_free(bmap2);
1704 struct isl_basic_set *isl_basic_set_apply(
1705 struct isl_basic_set *bset, struct isl_basic_map *bmap)
1710 isl_assert(set->ctx, isl_basic_map_compatible_domain(bmap, bset),
1713 return (struct isl_basic_set *)
1714 isl_basic_map_apply_range((struct isl_basic_map *)bset, bmap);
1716 isl_basic_set_free(bset);
1717 isl_basic_map_free(bmap);
1721 struct isl_basic_map *isl_basic_map_apply_domain(
1722 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
1724 if (!bmap1 || !bmap2)
1728 isl_basic_map_n_in(bmap1) == isl_basic_map_n_in(bmap2), goto error);
1730 isl_basic_map_n_param(bmap1) == isl_basic_map_n_param(bmap2),
1733 bmap1 = isl_basic_map_reverse(bmap1);
1734 bmap1 = isl_basic_map_apply_range(bmap1, bmap2);
1735 return isl_basic_map_reverse(bmap1);
1737 isl_basic_map_free(bmap1);
1738 isl_basic_map_free(bmap2);
1742 static struct isl_basic_map *var_equal(struct isl_ctx *ctx,
1743 struct isl_basic_map *bmap, unsigned pos)
1749 i = isl_basic_map_alloc_equality(bmap);
1752 nparam = isl_basic_map_n_param(bmap);
1753 n_in = isl_basic_map_n_in(bmap);
1754 isl_seq_clr(bmap->eq[i], 1 + isl_basic_map_total_dim(bmap));
1755 isl_int_set_si(bmap->eq[i][1+nparam+pos], -1);
1756 isl_int_set_si(bmap->eq[i][1+nparam+n_in+pos], 1);
1757 return isl_basic_map_finalize(bmap);
1759 isl_basic_map_free(bmap);
1763 static struct isl_basic_map *var_more(struct isl_ctx *ctx,
1764 struct isl_basic_map *bmap, unsigned pos)
1770 i = isl_basic_map_alloc_inequality(bmap);
1773 nparam = isl_basic_map_n_param(bmap);
1774 n_in = isl_basic_map_n_in(bmap);
1775 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
1776 isl_int_set_si(bmap->ineq[i][0], -1);
1777 isl_int_set_si(bmap->ineq[i][1+nparam+pos], -1);
1778 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], 1);
1779 return isl_basic_map_finalize(bmap);
1781 isl_basic_map_free(bmap);
1785 static struct isl_basic_map *var_less(struct isl_ctx *ctx,
1786 struct isl_basic_map *bmap, unsigned pos)
1792 i = isl_basic_map_alloc_inequality(bmap);
1795 nparam = isl_basic_map_n_param(bmap);
1796 n_in = isl_basic_map_n_in(bmap);
1797 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
1798 isl_int_set_si(bmap->ineq[i][0], -1);
1799 isl_int_set_si(bmap->ineq[i][1+nparam+pos], 1);
1800 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], -1);
1801 return isl_basic_map_finalize(bmap);
1803 isl_basic_map_free(bmap);
1807 struct isl_basic_map *isl_basic_map_equal(struct isl_ctx *ctx,
1808 unsigned nparam, unsigned in, unsigned out, unsigned n_equal)
1811 struct isl_basic_map *bmap;
1812 bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, n_equal, 0);
1815 for (i = 0; i < n_equal && bmap; ++i)
1816 bmap = var_equal(ctx, bmap, i);
1817 return isl_basic_map_finalize(bmap);
1820 struct isl_basic_map *isl_basic_map_less_at(struct isl_ctx *ctx,
1821 unsigned nparam, unsigned in, unsigned out, unsigned pos)
1824 struct isl_basic_map *bmap;
1825 bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, pos, 1);
1828 for (i = 0; i < pos && bmap; ++i)
1829 bmap = var_equal(ctx, bmap, i);
1831 bmap = var_less(ctx, bmap, pos);
1832 return isl_basic_map_finalize(bmap);
1835 struct isl_basic_map *isl_basic_map_more_at(struct isl_ctx *ctx,
1836 unsigned nparam, unsigned in, unsigned out, unsigned pos)
1839 struct isl_basic_map *bmap;
1840 bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, pos, 1);
1843 for (i = 0; i < pos && bmap; ++i)
1844 bmap = var_equal(ctx, bmap, i);
1846 bmap = var_more(ctx, bmap, pos);
1847 return isl_basic_map_finalize(bmap);
1850 struct isl_basic_map *isl_basic_map_from_basic_set(
1851 struct isl_basic_set *bset, struct isl_dim *dim)
1853 struct isl_basic_map *bmap;
1855 bset = isl_basic_set_cow(bset);
1859 isl_assert(bset->ctx, isl_dim_compatible(bset->dim, dim), goto error);
1860 isl_dim_free(bset->dim);
1861 bmap = (struct isl_basic_map *) bset;
1863 return isl_basic_map_finalize(bmap);
1865 isl_basic_set_free(bset);
1870 struct isl_basic_set *isl_basic_set_from_basic_map(struct isl_basic_map *bmap)
1874 if (bmap->dim->n_in == 0)
1875 return (struct isl_basic_set *)bmap;
1876 bmap = isl_basic_map_cow(bmap);
1879 bmap->dim = isl_dim_cow(bmap->dim);
1882 bmap->dim->n_out += bmap->dim->n_in;
1883 bmap->dim->n_in = 0;
1884 bmap = isl_basic_map_finalize(bmap);
1885 return (struct isl_basic_set *)bmap;
1887 isl_basic_map_free(bmap);
1891 /* For a div d = floor(f/m), add the constraints
1894 * -(f-(n-1)) + m d >= 0
1896 * Note that the second constraint is the negation of
1900 static int add_div_constraints(struct isl_basic_map *bmap, unsigned div)
1903 unsigned total = isl_basic_map_total_dim(bmap);
1904 unsigned div_pos = 1 + total - bmap->n_div + div;
1906 i = isl_basic_map_alloc_inequality(bmap);
1909 isl_seq_cpy(bmap->ineq[i], bmap->div[div]+1, 1+total);
1910 isl_int_neg(bmap->ineq[i][div_pos], bmap->div[div][0]);
1912 j = isl_basic_map_alloc_inequality(bmap);
1915 isl_seq_neg(bmap->ineq[j], bmap->ineq[i], 1 + total);
1916 isl_int_add(bmap->ineq[j][0], bmap->ineq[j][0], bmap->ineq[j][div_pos]);
1917 isl_int_sub_ui(bmap->ineq[j][0], bmap->ineq[j][0], 1);
1921 struct isl_basic_set *isl_basic_map_underlying_set(
1922 struct isl_basic_map *bmap)
1926 if (bmap->dim->nparam == 0 && bmap->dim->n_in == 0 && bmap->n_div == 0)
1927 return (struct isl_basic_set *)bmap;
1928 bmap = isl_basic_map_cow(bmap);
1931 bmap->dim = isl_dim_underlying(bmap->dim, bmap->n_div);
1934 bmap->extra -= bmap->n_div;
1936 bmap = isl_basic_map_finalize(bmap);
1937 return (struct isl_basic_set *)bmap;
1942 struct isl_basic_map *isl_basic_map_overlying_set(
1943 struct isl_basic_set *bset, struct isl_basic_map *like)
1945 struct isl_basic_map *bmap;
1946 struct isl_ctx *ctx;
1953 isl_assert(ctx, bset->n_div == 0, goto error);
1954 isl_assert(ctx, isl_basic_set_n_param(bset) == 0, goto error);
1955 isl_assert(ctx, bset->dim->n_out == isl_basic_map_total_dim(like),
1957 if (isl_dim_equal(bset->dim, like->dim) && like->n_div == 0) {
1958 isl_basic_map_free(like);
1959 return (struct isl_basic_map *)bset;
1961 bset = isl_basic_set_cow(bset);
1964 total = bset->dim->n_out + bset->extra;
1965 bmap = (struct isl_basic_map *)bset;
1966 isl_dim_free(bmap->dim);
1967 bmap->dim = isl_dim_copy(like->dim);
1970 bmap->n_div = like->n_div;
1971 bmap->extra += like->n_div;
1974 ltotal = total - bmap->extra + like->extra;
1977 bmap->block2 = isl_blk_extend(ctx, bmap->block2,
1978 bmap->extra * (1 + 1 + total));
1979 if (isl_blk_is_error(bmap->block2))
1981 bmap->div = isl_realloc_array(ctx, bmap->div, isl_int *,
1985 for (i = 0; i < bmap->extra; ++i)
1986 bmap->div[i] = bmap->block2.data + i * (1 + 1 + total);
1987 for (i = 0; i < like->n_div; ++i) {
1988 isl_seq_cpy(bmap->div[i], like->div[i], 1 + 1 + ltotal);
1989 isl_seq_clr(bmap->div[i]+1+1+ltotal, total - ltotal);
1991 bmap = isl_basic_map_extend_constraints(bmap,
1992 0, 2 * like->n_div);
1993 for (i = 0; i < like->n_div; ++i)
1994 if (add_div_constraints(bmap, i) < 0)
1997 isl_basic_map_free(like);
1998 bmap = isl_basic_map_simplify(bmap);
1999 bmap = isl_basic_map_finalize(bmap);
2002 isl_basic_map_free(like);
2003 isl_basic_set_free(bset);
2007 struct isl_basic_set *isl_basic_set_from_underlying_set(
2008 struct isl_basic_set *bset, struct isl_basic_set *like)
2010 return (struct isl_basic_set *)
2011 isl_basic_map_overlying_set(bset, (struct isl_basic_map *)like);
2014 struct isl_set *isl_set_from_underlying_set(
2015 struct isl_set *set, struct isl_basic_set *like)
2021 isl_assert(set->ctx, set->dim->n_out == isl_basic_set_total_dim(like),
2023 if (isl_dim_equal(set->dim, like->dim) && like->n_div == 0) {
2024 isl_basic_set_free(like);
2027 set = isl_set_cow(set);
2030 for (i = 0; i < set->n; ++i) {
2031 set->p[i] = isl_basic_set_from_underlying_set(set->p[i],
2032 isl_basic_set_copy(like));
2036 isl_dim_free(set->dim);
2037 set->dim = isl_dim_copy(like->dim);
2040 isl_basic_set_free(like);
2043 isl_basic_set_free(like);
2048 struct isl_set *isl_map_underlying_set(struct isl_map *map)
2052 map = isl_map_cow(map);
2055 map->dim = isl_dim_cow(map->dim);
2059 for (i = 1; i < map->n; ++i)
2060 isl_assert(map->ctx, map->p[0]->n_div == map->p[i]->n_div,
2062 for (i = 0; i < map->n; ++i) {
2063 map->p[i] = (struct isl_basic_map *)
2064 isl_basic_map_underlying_set(map->p[i]);
2069 map->dim = isl_dim_underlying(map->dim, 0);
2071 isl_dim_free(map->dim);
2072 map->dim = isl_dim_copy(map->p[0]->dim);
2076 return (struct isl_set *)map;
2082 struct isl_set *isl_set_to_underlying_set(struct isl_set *set)
2084 return (struct isl_set *)isl_map_underlying_set((struct isl_map *)set);
2087 struct isl_basic_set *isl_basic_map_domain(struct isl_basic_map *bmap)
2089 struct isl_basic_set *domain;
2093 n_out = isl_basic_map_n_out(bmap);
2094 domain = isl_basic_set_from_basic_map(bmap);
2095 return isl_basic_set_project_out(domain, n_out, 0);
2098 struct isl_basic_set *isl_basic_map_range(struct isl_basic_map *bmap)
2100 return isl_basic_map_domain(isl_basic_map_reverse(bmap));
2103 struct isl_set *isl_map_range(struct isl_map *map)
2106 struct isl_set *set;
2110 map = isl_map_cow(map);
2114 set = (struct isl_set *) map;
2115 if (set->dim->n_in != 0) {
2116 set->dim = isl_dim_drop_inputs(set->dim, 0, set->dim->n_in);
2120 for (i = 0; i < map->n; ++i) {
2121 set->p[i] = isl_basic_map_range(map->p[i]);
2125 F_CLR(set, ISL_MAP_DISJOINT);
2126 F_CLR(set, ISL_SET_NORMALIZED);
2133 struct isl_map *isl_map_from_set(struct isl_set *set, struct isl_dim *dim)
2136 struct isl_map *map = NULL;
2138 set = isl_set_cow(set);
2141 isl_assert(set->ctx, isl_dim_compatible(set->dim, dim), goto error);
2142 map = (struct isl_map *)set;
2143 for (i = 0; i < set->n; ++i) {
2144 map->p[i] = isl_basic_map_from_basic_set(
2145 set->p[i], isl_dim_copy(dim));
2149 isl_dim_free(map->dim);
2158 struct isl_set *isl_set_from_map(struct isl_map *map)
2161 struct isl_set *set = NULL;
2165 map = isl_map_cow(map);
2168 map->dim = isl_dim_cow(map->dim);
2171 map->dim->n_out += map->dim->n_in;
2173 set = (struct isl_set *)map;
2174 for (i = 0; i < map->n; ++i) {
2175 set->p[i] = isl_basic_set_from_basic_map(map->p[i]);
2185 struct isl_map *isl_map_alloc_dim(struct isl_dim *dim, int n, unsigned flags)
2187 struct isl_map *map;
2191 isl_assert(dim->ctx, n >= 0, return NULL);
2192 map = isl_alloc(dim->ctx, struct isl_map,
2193 sizeof(struct isl_map) +
2194 n * sizeof(struct isl_basic_map *));
2198 map->ctx = dim->ctx;
2199 isl_ctx_ref(map->ctx);
2211 struct isl_map *isl_map_alloc(struct isl_ctx *ctx,
2212 unsigned nparam, unsigned in, unsigned out, int n,
2215 struct isl_map *map;
2216 struct isl_dim *dims;
2218 dims = isl_dim_alloc(ctx, nparam, in, out);
2222 map = isl_map_alloc_dim(dims, n, flags);
2226 struct isl_basic_map *isl_basic_map_empty(struct isl_ctx *ctx,
2227 unsigned nparam, unsigned in, unsigned out)
2229 struct isl_basic_map *bmap;
2230 bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, 1, 0);
2231 bmap = isl_basic_map_set_to_empty(bmap);
2235 struct isl_basic_set *isl_basic_set_empty(struct isl_dim *dim)
2237 struct isl_basic_set *bset;
2238 bset = isl_basic_set_alloc_dim(dim, 0, 1, 0);
2239 bset = isl_basic_set_set_to_empty(bset);
2243 struct isl_basic_map *isl_basic_map_empty_like(struct isl_basic_map *model)
2245 struct isl_basic_map *bmap;
2248 bmap = isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
2249 bmap = isl_basic_map_set_to_empty(bmap);
2253 struct isl_basic_map *isl_basic_map_empty_like_map(struct isl_map *model)
2255 struct isl_basic_map *bmap;
2258 bmap = isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
2259 bmap = isl_basic_map_set_to_empty(bmap);
2263 struct isl_basic_set *isl_basic_set_empty_like(struct isl_basic_set *model)
2265 struct isl_basic_set *bset;
2268 bset = isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
2269 bset = isl_basic_set_set_to_empty(bset);
2273 struct isl_basic_map *isl_basic_map_universe(struct isl_dim *dim)
2275 struct isl_basic_map *bmap;
2276 bmap = isl_basic_map_alloc_dim(dim, 0, 0, 0);
2280 struct isl_basic_set *isl_basic_set_universe(struct isl_dim *dim)
2282 struct isl_basic_set *bset;
2283 bset = isl_basic_set_alloc_dim(dim, 0, 0, 0);
2287 struct isl_basic_set *isl_basic_set_universe_like(struct isl_basic_set *model)
2291 return isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
2294 struct isl_map *isl_map_empty(struct isl_ctx *ctx,
2295 unsigned nparam, unsigned in, unsigned out)
2297 return isl_map_alloc(ctx, nparam, in, out, 0, ISL_MAP_DISJOINT);
2300 struct isl_map *isl_map_empty_like_basic_map(struct isl_basic_map *model)
2304 return isl_map_alloc_dim(isl_dim_copy(model->dim), 0, ISL_MAP_DISJOINT);
2307 struct isl_set *isl_set_empty(struct isl_dim *dim)
2309 return isl_set_alloc_dim(dim, 0, ISL_MAP_DISJOINT);
2312 struct isl_set *isl_set_empty_like(struct isl_set *model)
2316 return isl_set_empty(isl_dim_copy(model->dim));
2319 struct isl_set *isl_set_universe(struct isl_dim *dim)
2321 struct isl_set *set;
2324 set = isl_set_alloc_dim(isl_dim_copy(dim), 1, ISL_MAP_DISJOINT);
2325 set = isl_set_add(set, isl_basic_set_universe(dim));
2329 struct isl_map *isl_map_dup(struct isl_map *map)
2332 struct isl_map *dup;
2336 dup = isl_map_alloc_dim(isl_dim_copy(map->dim), map->n, map->flags);
2337 for (i = 0; i < map->n; ++i)
2338 dup = isl_map_add(dup, isl_basic_map_copy(map->p[i]));
2342 struct isl_map *isl_map_add(struct isl_map *map, struct isl_basic_map *bmap)
2346 isl_assert(map->ctx, isl_dim_equal(map->dim, bmap->dim), goto error);
2347 isl_assert(map->ctx, map->n < map->size, goto error);
2348 map->p[map->n] = bmap;
2350 F_CLR(map, ISL_MAP_NORMALIZED);
2356 isl_basic_map_free(bmap);
2360 void isl_map_free(struct isl_map *map)
2370 isl_ctx_deref(map->ctx);
2371 for (i = 0; i < map->n; ++i)
2372 isl_basic_map_free(map->p[i]);
2373 isl_dim_free(map->dim);
2377 struct isl_map *isl_map_extend(struct isl_map *base,
2378 unsigned nparam, unsigned n_in, unsigned n_out)
2382 base = isl_map_cow(base);
2386 base->dim = isl_dim_extend(base->dim, nparam, n_in, n_out);
2389 for (i = 0; i < base->n; ++i) {
2390 base->p[i] = isl_basic_map_extend_dim(base->p[i],
2391 isl_dim_copy(base->dim), 0, 0, 0);
2401 struct isl_set *isl_set_extend(struct isl_set *base,
2402 unsigned nparam, unsigned dim)
2404 return (struct isl_set *)isl_map_extend((struct isl_map *)base,
2408 static struct isl_basic_map *isl_basic_map_fix_var(struct isl_basic_map *bmap,
2409 unsigned var, int value)
2413 bmap = isl_basic_map_cow(bmap);
2414 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
2415 j = isl_basic_map_alloc_equality(bmap);
2418 isl_seq_clr(bmap->eq[j], 1 + isl_basic_map_total_dim(bmap));
2419 isl_int_set_si(bmap->eq[j][1 + var], -1);
2420 isl_int_set_si(bmap->eq[j][0], value);
2421 bmap = isl_basic_map_simplify(bmap);
2422 return isl_basic_map_finalize(bmap);
2424 isl_basic_map_free(bmap);
2428 struct isl_basic_map *isl_basic_map_fix_input_si(struct isl_basic_map *bmap,
2429 unsigned input, int value)
2433 isl_assert(bmap->ctx, input < isl_basic_map_n_in(bmap), goto error);
2434 return isl_basic_map_fix_var(bmap, isl_basic_map_n_param(bmap) + input,
2437 isl_basic_map_free(bmap);
2441 struct isl_basic_set *isl_basic_set_fix_dim_si(struct isl_basic_set *bset,
2442 unsigned dim, int value)
2446 isl_assert(bset->ctx, dim < isl_basic_set_n_dim(bset), goto error);
2447 return (struct isl_basic_set *)
2448 isl_basic_map_fix_var((struct isl_basic_map *)bset,
2449 isl_basic_set_n_param(bset) + dim, value);
2451 isl_basic_set_free(bset);
2455 struct isl_map *isl_map_fix_input_si(struct isl_map *map,
2456 unsigned input, int value)
2460 map = isl_map_cow(map);
2464 isl_assert(ctx, input < isl_map_n_in(map), goto error);
2465 for (i = 0; i < map->n; ++i) {
2466 map->p[i] = isl_basic_map_fix_input_si(map->p[i], input, value);
2470 F_CLR(map, ISL_MAP_NORMALIZED);
2477 struct isl_set *isl_set_fix_dim_si(struct isl_set *set, unsigned dim, int value)
2481 set = isl_set_cow(set);
2485 isl_assert(set->ctx, dim < isl_set_n_dim(set), goto error);
2486 for (i = 0; i < set->n; ++i) {
2487 set->p[i] = isl_basic_set_fix_dim_si(set->p[i], dim, value);
2497 struct isl_basic_set *isl_basic_set_lower_bound_dim(struct isl_basic_set *bset,
2498 unsigned dim, isl_int value)
2503 bset = isl_basic_set_cow(bset);
2504 bset = isl_basic_set_extend_constraints(bset, 0, 1);
2505 j = isl_basic_set_alloc_inequality(bset);
2508 isl_seq_clr(bset->ineq[j], 1 + isl_basic_set_total_dim(bset));
2509 isl_int_set_si(bset->ineq[j][1 + isl_basic_set_n_param(bset) + dim], 1);
2510 isl_int_neg(bset->ineq[j][0], value);
2511 bset = isl_basic_set_simplify(bset);
2512 return isl_basic_set_finalize(bset);
2514 isl_basic_set_free(bset);
2518 struct isl_set *isl_set_lower_bound_dim(struct isl_set *set, unsigned dim,
2523 set = isl_set_cow(set);
2527 isl_assert(set->ctx, dim < isl_set_n_dim(set), goto error);
2528 for (i = 0; i < set->n; ++i) {
2529 set->p[i] = isl_basic_set_lower_bound_dim(set->p[i], dim, value);
2539 struct isl_map *isl_map_reverse(struct isl_map *map)
2544 map = isl_map_cow(map);
2548 map->dim = isl_dim_reverse(map->dim);
2551 for (i = 0; i < map->n; ++i) {
2552 map->p[i] = isl_basic_map_reverse(map->p[i]);
2556 F_CLR(map, ISL_MAP_NORMALIZED);
2563 struct isl_map *isl_basic_map_lexmax(
2564 struct isl_basic_map *bmap, struct isl_basic_set *dom,
2565 struct isl_set **empty)
2567 return isl_pip_basic_map_lexmax(bmap, dom, empty);
2570 struct isl_map *isl_basic_map_lexmin(
2571 struct isl_basic_map *bmap, struct isl_basic_set *dom,
2572 struct isl_set **empty)
2574 return isl_pip_basic_map_lexmin(bmap, dom, empty);
2577 struct isl_set *isl_basic_set_lexmin(struct isl_basic_set *bset)
2579 struct isl_basic_map *bmap = NULL;
2580 struct isl_basic_set *dom = NULL;
2581 struct isl_map *min;
2582 struct isl_dim *param_dim;
2586 bmap = isl_basic_map_from_basic_set(bset, isl_dim_copy(bset->dim));
2589 param_dim = isl_dim_domain(isl_dim_copy(bmap->dim));
2590 dom = isl_basic_set_universe(param_dim);
2593 min = isl_basic_map_lexmin(bmap, dom, NULL);
2594 return isl_map_range(min);
2596 isl_basic_map_free(bmap);
2600 struct isl_map *isl_basic_map_compute_divs(struct isl_basic_map *bmap)
2607 off = isl_dim_total(bmap->dim);
2608 for (i = 0; i < bmap->n_div; ++i) {
2609 if (isl_int_is_zero(bmap->div[i][0]))
2610 return isl_pip_basic_map_compute_divs(bmap);
2611 isl_assert(bmap->ctx, isl_int_is_zero(bmap->div[i][1+1+off+i]),
2614 return isl_map_from_basic_map(bmap);
2616 isl_basic_map_free(bmap);
2620 struct isl_map *isl_map_compute_divs(struct isl_map *map)
2623 struct isl_map *res;
2629 res = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[0]));
2630 for (i = 1 ; i < map->n; ++i) {
2632 r2 = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[i]));
2633 if (F_ISSET(map, ISL_MAP_DISJOINT))
2634 res = isl_map_union_disjoint(res, r2);
2636 res = isl_map_union(res, r2);
2643 struct isl_set *isl_basic_set_compute_divs(struct isl_basic_set *bset)
2645 return (struct isl_set *)
2646 isl_basic_map_compute_divs((struct isl_basic_map *)bset);
2649 struct isl_set *isl_set_compute_divs(struct isl_set *set)
2651 return (struct isl_set *)
2652 isl_map_compute_divs((struct isl_map *)set);
2655 struct isl_set *isl_map_domain(struct isl_map *map)
2658 struct isl_set *set;
2663 map = isl_map_cow(map);
2667 set = (struct isl_set *)map;
2668 set->dim = isl_dim_domain(set->dim);
2671 for (i = 0; i < map->n; ++i) {
2672 set->p[i] = isl_basic_map_domain(map->p[i]);
2676 F_CLR(set, ISL_MAP_DISJOINT);
2677 F_CLR(set, ISL_SET_NORMALIZED);
2684 struct isl_map *isl_map_union_disjoint(
2685 struct isl_map *map1, struct isl_map *map2)
2689 struct isl_map *map = NULL;
2703 isl_assert(map1->ctx, isl_dim_equal(map1->dim, map2->dim), goto error);
2705 if (F_ISSET(map1, ISL_MAP_DISJOINT) &&
2706 F_ISSET(map2, ISL_MAP_DISJOINT))
2707 FL_SET(flags, ISL_MAP_DISJOINT);
2709 map = isl_map_alloc_dim(isl_dim_copy(map1->dim),
2710 map1->n + map2->n, flags);
2713 for (i = 0; i < map1->n; ++i) {
2714 map = isl_map_add(map,
2715 isl_basic_map_copy(map1->p[i]));
2719 for (i = 0; i < map2->n; ++i) {
2720 map = isl_map_add(map,
2721 isl_basic_map_copy(map2->p[i]));
2735 struct isl_map *isl_map_union(struct isl_map *map1, struct isl_map *map2)
2737 map1 = isl_map_union_disjoint(map1, map2);
2741 F_CLR(map1, ISL_MAP_DISJOINT);
2745 struct isl_set *isl_set_union_disjoint(
2746 struct isl_set *set1, struct isl_set *set2)
2748 return (struct isl_set *)
2749 isl_map_union_disjoint(
2750 (struct isl_map *)set1, (struct isl_map *)set2);
2753 struct isl_set *isl_set_union(struct isl_set *set1, struct isl_set *set2)
2755 return (struct isl_set *)
2756 isl_map_union((struct isl_map *)set1, (struct isl_map *)set2);
2759 struct isl_map *isl_map_intersect_range(
2760 struct isl_map *map, struct isl_set *set)
2763 struct isl_map *result;
2769 if (F_ISSET(map, ISL_MAP_DISJOINT) &&
2770 F_ISSET(set, ISL_MAP_DISJOINT))
2771 FL_SET(flags, ISL_MAP_DISJOINT);
2773 result = isl_map_alloc_dim(isl_dim_copy(map->dim),
2774 map->n * set->n, flags);
2777 for (i = 0; i < map->n; ++i)
2778 for (j = 0; j < set->n; ++j) {
2779 result = isl_map_add(result,
2780 isl_basic_map_intersect_range(
2781 isl_basic_map_copy(map->p[i]),
2782 isl_basic_set_copy(set->p[j])));
2795 struct isl_map *isl_map_intersect_domain(
2796 struct isl_map *map, struct isl_set *set)
2798 return isl_map_reverse(
2799 isl_map_intersect_range(isl_map_reverse(map), set));
2802 struct isl_map *isl_map_apply_domain(
2803 struct isl_map *map1, struct isl_map *map2)
2807 map1 = isl_map_reverse(map1);
2808 map1 = isl_map_apply_range(map1, map2);
2809 return isl_map_reverse(map1);
2816 struct isl_map *isl_map_apply_range(
2817 struct isl_map *map1, struct isl_map *map2)
2819 struct isl_dim *dim_result;
2820 struct isl_map *result;
2829 dim_result = isl_dim_join(isl_dim_copy(map1->dim),
2830 isl_dim_copy(map2->dim));
2832 result = isl_map_alloc_dim(dim_result, map1->n * map2->n, 0);
2835 for (i = 0; i < map1->n; ++i)
2836 for (j = 0; j < map2->n; ++j) {
2837 result = isl_map_add(result,
2838 isl_basic_map_apply_range(
2839 isl_basic_map_copy(map1->p[i]),
2840 isl_basic_map_copy(map2->p[j])));
2846 if (result && result->n <= 1)
2847 F_SET(result, ISL_MAP_DISJOINT);
2856 * returns range - domain
2858 struct isl_basic_set *isl_basic_map_deltas(struct isl_basic_map *bmap)
2860 struct isl_basic_set *bset;
2867 dim = isl_basic_map_n_in(bmap);
2868 nparam = isl_basic_map_n_param(bmap);
2869 isl_assert(bmap->ctx, dim == isl_basic_map_n_out(bmap), goto error);
2870 bset = isl_basic_set_from_basic_map(bmap);
2871 bset = isl_basic_set_extend(bset, nparam, 3*dim, 0, dim, 0);
2872 bset = isl_basic_set_swap_vars(bset, 2*dim);
2873 for (i = 0; i < dim; ++i) {
2874 int j = isl_basic_map_alloc_equality(
2875 (struct isl_basic_map *)bset);
2878 isl_seq_clr(bset->eq[j], 1 + isl_basic_set_total_dim(bset));
2879 isl_int_set_si(bset->eq[j][1+nparam+i], 1);
2880 isl_int_set_si(bset->eq[j][1+nparam+dim+i], 1);
2881 isl_int_set_si(bset->eq[j][1+nparam+2*dim+i], -1);
2883 return isl_basic_set_project_out(bset, 2*dim, 0);
2885 isl_basic_map_free(bmap);
2890 * returns range - domain
2892 struct isl_set *isl_map_deltas(struct isl_map *map)
2895 struct isl_set *result;
2900 isl_assert(map->ctx, isl_map_n_in(map) == isl_map_n_out(map), goto error);
2901 result = isl_set_alloc(map->ctx, isl_map_n_param(map),
2902 isl_map_n_in(map), map->n, map->flags);
2905 for (i = 0; i < map->n; ++i)
2906 result = isl_set_add(result,
2907 isl_basic_map_deltas(isl_basic_map_copy(map->p[i])));
2915 static struct isl_basic_map *basic_map_identity(struct isl_dim *dims)
2917 struct isl_basic_map *bmap;
2925 nparam = dims->nparam;
2927 bmap = isl_basic_map_alloc_dim(dims, 0, dim, 0);
2931 for (i = 0; i < dim; ++i) {
2932 int j = isl_basic_map_alloc_equality(bmap);
2935 isl_seq_clr(bmap->eq[j], 1 + isl_basic_map_total_dim(bmap));
2936 isl_int_set_si(bmap->eq[j][1+nparam+i], 1);
2937 isl_int_set_si(bmap->eq[j][1+nparam+dim+i], -1);
2939 return isl_basic_map_finalize(bmap);
2941 isl_basic_map_free(bmap);
2945 struct isl_basic_map *isl_basic_map_identity(struct isl_dim *set_dim)
2947 struct isl_dim *dim = isl_dim_map(set_dim);
2950 return basic_map_identity(dim);
2953 struct isl_basic_map *isl_basic_map_identity_like(struct isl_basic_map *model)
2955 if (!model || !model->dim)
2957 isl_assert(model->ctx,
2958 model->dim->n_in == model->dim->n_out, return NULL);
2959 return basic_map_identity(isl_dim_copy(model->dim));
2962 static struct isl_map *map_identity(struct isl_dim *dim)
2964 struct isl_map *map = isl_map_alloc_dim(dim, 1, ISL_MAP_DISJOINT);
2965 return isl_map_add(map, basic_map_identity(isl_dim_copy(dim)));
2968 struct isl_map *isl_map_identity(struct isl_dim *set_dim)
2970 struct isl_dim *dim = isl_dim_map(set_dim);
2973 return map_identity(dim);
2976 struct isl_map *isl_map_identity_like(struct isl_basic_map *model)
2978 if (!model || !model->dim)
2980 isl_assert(model->ctx,
2981 model->dim->n_in == model->dim->n_out, return NULL);
2982 return map_identity(isl_dim_copy(model->dim));
2985 int isl_set_is_equal(struct isl_set *set1, struct isl_set *set2)
2987 return isl_map_is_equal((struct isl_map *)set1, (struct isl_map *)set2);
2990 int isl_set_is_subset(struct isl_set *set1, struct isl_set *set2)
2992 return isl_map_is_subset(
2993 (struct isl_map *)set1, (struct isl_map *)set2);
2996 int isl_basic_map_is_subset(
2997 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3000 struct isl_map *map1;
3001 struct isl_map *map2;
3003 if (!bmap1 || !bmap2)
3006 map1 = isl_map_from_basic_map(isl_basic_map_copy(bmap1));
3007 map2 = isl_map_from_basic_map(isl_basic_map_copy(bmap2));
3009 is_subset = isl_map_is_subset(map1, map2);
3017 int isl_basic_map_is_equal(
3018 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3022 if (!bmap1 || !bmap2)
3024 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
3027 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
3031 int isl_basic_set_is_equal(
3032 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
3034 return isl_basic_map_is_equal(
3035 (struct isl_basic_map *)bset1, (struct isl_basic_map *)bset2);
3038 int isl_map_is_empty(struct isl_map *map)
3045 for (i = 0; i < map->n; ++i) {
3046 is_empty = isl_basic_map_is_empty(map->p[i]);
3055 int isl_set_is_empty(struct isl_set *set)
3057 return isl_map_is_empty((struct isl_map *)set);
3060 int isl_map_is_subset(struct isl_map *map1, struct isl_map *map2)
3064 struct isl_map *diff;
3069 if (isl_map_is_empty(map1))
3072 if (isl_map_is_empty(map2))
3075 diff = isl_map_subtract(isl_map_copy(map1), isl_map_copy(map2));
3079 is_subset = isl_map_is_empty(diff);
3085 int isl_map_is_equal(struct isl_map *map1, struct isl_map *map2)
3091 is_subset = isl_map_is_subset(map1, map2);
3094 is_subset = isl_map_is_subset(map2, map1);
3098 int isl_basic_map_is_strict_subset(
3099 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3103 if (!bmap1 || !bmap2)
3105 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
3108 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
3109 if (is_subset == -1)
3114 static int basic_map_contains(struct isl_basic_map *bmap, struct isl_vec *vec)
3120 total = 1 + isl_basic_map_total_dim(bmap);
3121 if (total != vec->size)
3126 for (i = 0; i < bmap->n_eq; ++i) {
3127 isl_seq_inner_product(vec->block.data, bmap->eq[i], total, &s);
3128 if (!isl_int_is_zero(s)) {
3134 for (i = 0; i < bmap->n_ineq; ++i) {
3135 isl_seq_inner_product(vec->block.data, bmap->ineq[i], total, &s);
3136 if (isl_int_is_neg(s)) {
3147 int isl_basic_map_is_universe(struct isl_basic_map *bmap)
3151 return bmap->n_eq == 0 && bmap->n_ineq == 0;
3154 int isl_basic_map_is_empty(struct isl_basic_map *bmap)
3156 struct isl_basic_set *bset = NULL;
3157 struct isl_vec *sample = NULL;
3164 if (F_ISSET(bmap, ISL_BASIC_MAP_EMPTY))
3167 if (F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL)) {
3168 struct isl_basic_map *copy = isl_basic_map_copy(bmap);
3169 copy = isl_basic_map_convex_hull(copy);
3170 empty = F_ISSET(copy, ISL_BASIC_MAP_EMPTY);
3171 isl_basic_map_free(copy);
3175 total = 1 + isl_basic_map_total_dim(bmap);
3176 if (bmap->sample && bmap->sample->size == total) {
3177 int contains = basic_map_contains(bmap, bmap->sample);
3183 bset = isl_basic_map_underlying_set(isl_basic_map_copy(bmap));
3186 sample = isl_basic_set_sample(bset);
3189 empty = sample->size == 0;
3191 isl_vec_free(bmap->ctx, bmap->sample);
3192 bmap->sample = sample;
3197 int isl_basic_set_is_empty(struct isl_basic_set *bset)
3199 return isl_basic_map_is_empty((struct isl_basic_map *)bset);
3202 struct isl_map *isl_basic_map_union(
3203 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3205 struct isl_map *map;
3206 if (!bmap1 || !bmap2)
3209 isl_assert(map1->ctx, isl_dim_equal(bmap1->dim, bmap2->dim), goto error);
3211 map = isl_map_alloc_dim(isl_dim_copy(bmap1->dim), 2, 0);
3214 map = isl_map_add(map, bmap1);
3215 map = isl_map_add(map, bmap2);
3218 isl_basic_map_free(bmap1);
3219 isl_basic_map_free(bmap2);
3223 struct isl_set *isl_basic_set_union(
3224 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
3226 return (struct isl_set *)isl_basic_map_union(
3227 (struct isl_basic_map *)bset1,
3228 (struct isl_basic_map *)bset2);
3231 /* Order divs such that any div only depends on previous divs */
3232 static struct isl_basic_map *order_divs(struct isl_basic_map *bmap)
3235 unsigned off = isl_dim_total(bmap->dim);
3237 for (i = 0; i < bmap->n_div; ++i) {
3239 pos = isl_seq_first_non_zero(bmap->div[i]+1+1+off+i,
3243 swap_div(bmap, i, pos);
3249 /* Look for a div in dst that corresponds to the div "div" in src.
3250 * The divs before "div" in src and dst are assumed to be the same.
3252 * Returns -1 if no corresponding div was found and the position
3253 * of the corresponding div in dst otherwise.
3255 static int find_div(struct isl_basic_map *dst,
3256 struct isl_basic_map *src, unsigned div)
3260 unsigned total = isl_dim_total(src->dim);
3262 isl_assert(dst->ctx, div <= dst->n_div, return -1);
3263 for (i = div; i < dst->n_div; ++i)
3264 if (isl_seq_eq(dst->div[i], src->div[div], 1+1+total+div) &&
3265 isl_seq_first_non_zero(dst->div[i]+1+1+total+div,
3266 dst->n_div - div) == -1)
3271 struct isl_basic_map *isl_basic_map_align_divs(
3272 struct isl_basic_map *dst, struct isl_basic_map *src)
3275 unsigned total = isl_dim_total(src->dim);
3280 if (src->n_div == 0)
3283 for (i = 0; i < src->n_div; ++i)
3284 isl_assert(src->ctx, !isl_int_is_zero(src->div[i][0]), goto error);
3286 src = order_divs(src);
3287 dst = isl_basic_map_extend_dim(dst, isl_dim_copy(dst->dim),
3288 src->n_div, 0, 2 * src->n_div);
3291 for (i = 0; i < src->n_div; ++i) {
3292 int j = find_div(dst, src, i);
3294 j = isl_basic_map_alloc_div(dst);
3297 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total+i);
3298 isl_seq_clr(dst->div[j]+1+1+total+i, dst->n_div - i);
3299 if (add_div_constraints(dst, j) < 0)
3303 swap_div(dst, i, j);
3307 isl_basic_map_free(dst);
3311 struct isl_basic_set *isl_basic_set_align_divs(
3312 struct isl_basic_set *dst, struct isl_basic_set *src)
3314 return (struct isl_basic_set *)isl_basic_map_align_divs(
3315 (struct isl_basic_map *)dst, (struct isl_basic_map *)src);
3318 struct isl_map *isl_map_align_divs(struct isl_map *map)
3322 map = isl_map_compute_divs(map);
3323 map = isl_map_cow(map);
3327 for (i = 1; i < map->n; ++i)
3328 map->p[0] = isl_basic_map_align_divs(map->p[0], map->p[i]);
3329 for (i = 1; i < map->n; ++i)
3330 map->p[i] = isl_basic_map_align_divs(map->p[i], map->p[0]);
3332 F_CLR(map, ISL_MAP_NORMALIZED);
3336 static struct isl_map *add_cut_constraint(struct isl_map *dst,
3337 struct isl_basic_map *src, isl_int *c,
3338 unsigned len, int oppose)
3340 struct isl_basic_map *copy = NULL;
3345 copy = isl_basic_map_copy(src);
3346 copy = isl_basic_map_cow(copy);
3349 copy = isl_basic_map_extend_constraints(copy, 0, 1);
3350 k = isl_basic_map_alloc_inequality(copy);
3354 isl_seq_neg(copy->ineq[k], c, len);
3356 isl_seq_cpy(copy->ineq[k], c, len);
3357 total = 1 + isl_basic_map_total_dim(copy);
3358 isl_seq_clr(copy->ineq[k]+len, total - len);
3359 isl_inequality_negate(copy, k);
3360 copy = isl_basic_map_simplify(copy);
3361 copy = isl_basic_map_finalize(copy);
3362 is_empty = isl_basic_map_is_empty(copy);
3366 dst = isl_map_add(dst, copy);
3368 isl_basic_map_free(copy);
3371 isl_basic_map_free(copy);
3376 static struct isl_map *subtract(struct isl_map *map, struct isl_basic_map *bmap)
3380 struct isl_map *rest = NULL;
3382 unsigned total = isl_basic_map_total_dim(bmap);
3389 if (F_ISSET(map, ISL_MAP_DISJOINT))
3390 FL_SET(flags, ISL_MAP_DISJOINT);
3392 max = map->n * (2 * bmap->n_eq + bmap->n_ineq);
3393 rest = isl_map_alloc_dim(isl_dim_copy(map->dim), max, flags);
3397 for (i = 0; i < map->n; ++i) {
3398 map->p[i] = isl_basic_map_align_divs(map->p[i], bmap);
3403 for (j = 0; j < map->n; ++j)
3404 map->p[j] = isl_basic_map_cow(map->p[j]);
3406 for (i = 0; i < bmap->n_eq; ++i) {
3407 for (j = 0; j < map->n; ++j) {
3408 rest = add_cut_constraint(rest,
3409 map->p[j], bmap->eq[i], 1+total, 0);
3413 rest = add_cut_constraint(rest,
3414 map->p[j], bmap->eq[i], 1+total, 1);
3418 map->p[j] = isl_basic_map_extend_constraints(map->p[j],
3422 k = isl_basic_map_alloc_equality(map->p[j]);
3425 isl_seq_cpy(map->p[j]->eq[k], bmap->eq[i], 1+total);
3426 isl_seq_clr(map->p[j]->eq[k]+1+total,
3427 map->p[j]->n_div - bmap->n_div);
3431 for (i = 0; i < bmap->n_ineq; ++i) {
3432 for (j = 0; j < map->n; ++j) {
3433 rest = add_cut_constraint(rest,
3434 map->p[j], bmap->ineq[i], 1+total, 0);
3438 map->p[j] = isl_basic_map_extend_constraints(map->p[j],
3442 k = isl_basic_map_alloc_inequality(map->p[j]);
3445 isl_seq_cpy(map->p[j]->ineq[k], bmap->ineq[i], 1+total);
3446 isl_seq_clr(map->p[j]->ineq[k]+1+total,
3447 map->p[j]->n_div - bmap->n_div);
3459 struct isl_map *isl_map_subtract(struct isl_map *map1, struct isl_map *map2)
3465 isl_assert(map1->ctx, isl_dim_equal(map1->dim, map2->dim), goto error);
3467 if (isl_map_is_empty(map2)) {
3472 map1 = isl_map_compute_divs(map1);
3473 map2 = isl_map_compute_divs(map2);
3477 for (i = 0; map1 && i < map2->n; ++i)
3478 map1 = subtract(map1, map2->p[i]);
3488 struct isl_set *isl_set_subtract(struct isl_set *set1, struct isl_set *set2)
3490 return (struct isl_set *)
3492 (struct isl_map *)set1, (struct isl_map *)set2);
3495 struct isl_set *isl_set_apply(struct isl_set *set, struct isl_map *map)
3499 isl_assert(set->ctx, isl_map_compatible_domain(map, set), goto error);
3500 map = isl_map_intersect_domain(map, set);
3501 set = isl_map_range(map);
3509 /* There is no need to cow as removing empty parts doesn't change
3510 * the meaning of the set.
3512 struct isl_map *isl_map_remove_empty_parts(struct isl_map *map)
3519 for (i = map->n-1; i >= 0; --i) {
3520 if (!F_ISSET(map->p[i], ISL_BASIC_MAP_EMPTY))
3522 isl_basic_map_free(map->p[i]);
3523 if (i != map->n-1) {
3524 F_CLR(map, ISL_MAP_NORMALIZED);
3525 map->p[i] = map->p[map->n-1];
3533 struct isl_set *isl_set_remove_empty_parts(struct isl_set *set)
3535 return (struct isl_set *)
3536 isl_map_remove_empty_parts((struct isl_map *)set);
3539 struct isl_basic_set *isl_set_copy_basic_set(struct isl_set *set)
3541 struct isl_basic_set *bset;
3542 if (!set || set->n == 0)
3544 bset = set->p[set->n-1];
3545 isl_assert(set->ctx, F_ISSET(bset, ISL_BASIC_SET_FINAL), return NULL);
3546 return isl_basic_set_copy(bset);
3549 struct isl_set *isl_set_drop_basic_set(struct isl_set *set,
3550 struct isl_basic_set *bset)
3556 for (i = set->n-1; i >= 0; --i) {
3557 if (set->p[i] != bset)
3559 set = isl_set_cow(set);
3562 isl_basic_set_free(set->p[i]);
3563 if (i != set->n-1) {
3564 F_CLR(set, ISL_SET_NORMALIZED);
3565 set->p[i] = set->p[set->n-1];
3570 isl_basic_set_free(bset);
3574 isl_basic_set_free(bset);
3578 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
3579 * for any common value of the parameters and dimensions preceding dim
3580 * in both basic sets, the values of dimension pos in bset1 are
3581 * smaller or larger than those in bset2.
3584 * 1 if bset1 follows bset2
3585 * -1 if bset1 precedes bset2
3586 * 0 if bset1 and bset2 are incomparable
3587 * -2 if some error occurred.
3589 int isl_basic_set_compare_at(struct isl_basic_set *bset1,
3590 struct isl_basic_set *bset2, int pos)
3592 struct isl_dim *dims;
3593 struct isl_basic_map *bmap1 = NULL;
3594 struct isl_basic_map *bmap2 = NULL;
3595 struct isl_ctx *ctx;
3596 struct isl_vec *obj;
3599 unsigned dim1, dim2;
3601 enum isl_lp_result res;
3604 if (!bset1 || !bset2)
3607 nparam = isl_basic_set_n_param(bset1);
3608 dim1 = isl_basic_set_n_dim(bset1);
3609 dim2 = isl_basic_set_n_dim(bset2);
3610 dims = isl_dim_alloc(bset1->ctx, nparam, pos, dim1 - pos);
3611 bmap1 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset1), dims);
3612 dims = isl_dim_alloc(bset2->ctx, nparam, pos, dim2 - pos);
3613 bmap2 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset2), dims);
3614 if (!bmap1 || !bmap2)
3616 bmap1 = isl_basic_map_extend(bmap1, nparam,
3617 pos, (dim1 - pos) + (dim2 - pos),
3618 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
3619 bmap1 = add_constraints(bmap1, bmap2, 0, dim1 - pos);
3622 total = isl_basic_map_total_dim(bmap1);
3624 obj = isl_vec_alloc(ctx, total);
3625 isl_seq_clr(obj->block.data, total);
3626 isl_int_set_si(obj->block.data[nparam+pos], 1);
3627 isl_int_set_si(obj->block.data[nparam+pos+(dim1-pos)], -1);
3632 res = isl_solve_lp(bmap1, 0, obj->block.data, ctx->one, &num, &den);
3633 if (res == isl_lp_empty)
3635 else if (res == isl_lp_ok && isl_int_is_pos(num))
3637 else if ((res == isl_lp_ok && isl_int_is_neg(num)) ||
3638 res == isl_lp_unbounded)
3644 isl_basic_map_free(bmap1);
3645 isl_vec_free(ctx, obj);
3648 isl_basic_map_free(bmap1);
3649 isl_basic_map_free(bmap2);
3653 static int isl_basic_map_fast_has_fixed_var(struct isl_basic_map *bmap,
3654 unsigned pos, isl_int *val)
3662 total = isl_basic_map_total_dim(bmap);
3663 for (i = 0, d = total-1; i < bmap->n_eq && d+1 > pos; ++i) {
3664 for (; d+1 > pos; --d)
3665 if (!isl_int_is_zero(bmap->eq[i][1+d]))
3669 if (isl_seq_first_non_zero(bmap->eq[i]+1, d) != -1)
3671 if (isl_seq_first_non_zero(bmap->eq[i]+1+d+1, total-d-1) != -1)
3673 if (!isl_int_is_one(bmap->eq[i][1+d]))
3676 isl_int_neg(*val, bmap->eq[i][0]);
3682 static int isl_map_fast_has_fixed_var(struct isl_map *map,
3683 unsigned pos, isl_int *val)
3695 return isl_basic_map_fast_has_fixed_var(map->p[0], pos, val);
3698 fixed = isl_basic_map_fast_has_fixed_var(map->p[0], pos, &v);
3699 for (i = 1; fixed == 1 && i < map->n; ++i) {
3700 fixed = isl_basic_map_fast_has_fixed_var(map->p[i], pos, &tmp);
3701 if (fixed == 1 && isl_int_ne(tmp, v))
3705 isl_int_set(*val, v);
3711 static int isl_set_fast_has_fixed_var(struct isl_set *set, unsigned pos,
3714 return isl_map_fast_has_fixed_var((struct isl_map *)set, pos, val);
3717 /* Check if dimension dim has fixed value and if so and if val is not NULL,
3718 * then return this fixed value in *val.
3720 int isl_set_fast_dim_is_fixed(struct isl_set *set, unsigned dim, isl_int *val)
3722 return isl_set_fast_has_fixed_var(set, isl_set_n_param(set) + dim, val);
3725 /* Check if input variable in has fixed value and if so and if val is not NULL,
3726 * then return this fixed value in *val.
3728 int isl_map_fast_input_is_fixed(struct isl_map *map, unsigned in, isl_int *val)
3730 return isl_map_fast_has_fixed_var(map, isl_map_n_param(map) + in, val);
3733 /* Check if dimension dim has an (obvious) fixed lower bound and if so
3734 * and if val is not NULL, then return this lower bound in *val.
3736 int isl_basic_set_fast_dim_has_fixed_lower_bound(struct isl_basic_set *bset,
3737 unsigned dim, isl_int *val)
3739 int i, i_eq = -1, i_ineq = -1;
3746 total = isl_basic_set_total_dim(bset);
3747 nparam = isl_basic_set_n_param(bset);
3748 for (i = 0; i < bset->n_eq; ++i) {
3749 if (isl_int_is_zero(bset->eq[i][1+nparam+dim]))
3755 for (i = 0; i < bset->n_ineq; ++i) {
3756 if (!isl_int_is_pos(bset->ineq[i][1+nparam+dim]))
3758 if (i_eq != -1 || i_ineq != -1)
3762 if (i_eq == -1 && i_ineq == -1)
3764 c = i_eq != -1 ? bset->eq[i_eq] : bset->ineq[i_ineq];
3765 /* The coefficient should always be one due to normalization. */
3766 if (!isl_int_is_one(c[1+nparam+dim]))
3768 if (isl_seq_first_non_zero(c+1, nparam+dim) != -1)
3770 if (isl_seq_first_non_zero(c+1+nparam+dim+1,
3771 total - nparam - dim - 1) != -1)
3774 isl_int_neg(*val, c[0]);
3778 int isl_set_fast_dim_has_fixed_lower_bound(struct isl_set *set,
3779 unsigned dim, isl_int *val)
3791 return isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[0],
3795 fixed = isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[0],
3797 for (i = 1; fixed == 1 && i < set->n; ++i) {
3798 fixed = isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[i],
3800 if (fixed == 1 && isl_int_ne(tmp, v))
3804 isl_int_set(*val, v);
3815 static int qsort_constraint_cmp(const void *p1, const void *p2)
3817 const struct constraint *c1 = (const struct constraint *)p1;
3818 const struct constraint *c2 = (const struct constraint *)p2;
3819 unsigned size = isl_min(c1->size, c2->size);
3820 return isl_seq_cmp(c1->c, c2->c, size);
3823 static struct isl_basic_map *isl_basic_map_sort_constraints(
3824 struct isl_basic_map *bmap)
3827 struct constraint *c;
3832 total = isl_basic_map_total_dim(bmap);
3833 c = isl_alloc_array(bmap->ctx, struct constraint, bmap->n_ineq);
3836 for (i = 0; i < bmap->n_ineq; ++i) {
3838 c[i].c = bmap->ineq[i];
3840 qsort(c, bmap->n_ineq, sizeof(struct constraint), qsort_constraint_cmp);
3841 for (i = 0; i < bmap->n_ineq; ++i)
3842 bmap->ineq[i] = c[i].c;
3846 isl_basic_map_free(bmap);
3850 struct isl_basic_map *isl_basic_map_normalize(struct isl_basic_map *bmap)
3854 if (F_ISSET(bmap, ISL_BASIC_MAP_NORMALIZED))
3856 bmap = isl_basic_map_convex_hull(bmap);
3857 bmap = isl_basic_map_sort_constraints(bmap);
3858 F_SET(bmap, ISL_BASIC_MAP_NORMALIZED);
3862 struct isl_basic_set *isl_basic_set_normalize(struct isl_basic_set *bset)
3864 return (struct isl_basic_set *)isl_basic_map_normalize(
3865 (struct isl_basic_map *)bset);
3868 static int isl_basic_map_fast_cmp(const struct isl_basic_map *bmap1,
3869 const struct isl_basic_map *bmap2)
3876 if (isl_basic_map_n_param(bmap1) != isl_basic_map_n_param(bmap2))
3877 return isl_basic_map_n_param(bmap1) - isl_basic_map_n_param(bmap2);
3878 if (isl_basic_map_n_in(bmap1) != isl_basic_map_n_in(bmap2))
3879 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
3880 if (isl_basic_map_n_out(bmap1) != isl_basic_map_n_out(bmap2))
3881 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
3882 if (F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY) &&
3883 F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
3885 if (F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY))
3887 if (F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
3889 if (bmap1->n_eq != bmap2->n_eq)
3890 return bmap1->n_eq - bmap2->n_eq;
3891 if (bmap1->n_ineq != bmap2->n_ineq)
3892 return bmap1->n_ineq - bmap2->n_ineq;
3893 if (bmap1->n_div != bmap2->n_div)
3894 return bmap1->n_div - bmap2->n_div;
3895 total = isl_basic_map_total_dim(bmap1);
3896 for (i = 0; i < bmap1->n_eq; ++i) {
3897 cmp = isl_seq_cmp(bmap1->eq[i], bmap2->eq[i], 1+total);
3901 for (i = 0; i < bmap1->n_ineq; ++i) {
3902 cmp = isl_seq_cmp(bmap1->ineq[i], bmap2->ineq[i], 1+total);
3906 for (i = 0; i < bmap1->n_div; ++i) {
3907 cmp = isl_seq_cmp(bmap1->div[i], bmap2->div[i], 1+1+total);
3914 static int isl_basic_map_fast_is_equal(struct isl_basic_map *bmap1,
3915 struct isl_basic_map *bmap2)
3917 return isl_basic_map_fast_cmp(bmap1, bmap2) == 0;
3920 static int qsort_bmap_cmp(const void *p1, const void *p2)
3922 const struct isl_basic_map *bmap1 = *(const struct isl_basic_map **)p1;
3923 const struct isl_basic_map *bmap2 = *(const struct isl_basic_map **)p2;
3925 return isl_basic_map_fast_cmp(bmap1, bmap2);
3928 /* We normalize in place, but if anything goes wrong we need
3929 * to return NULL, so we need to make sure we don't change the
3930 * meaning of any possible other copies of map.
3932 struct isl_map *isl_map_normalize(struct isl_map *map)
3935 struct isl_basic_map *bmap;
3939 if (F_ISSET(map, ISL_MAP_NORMALIZED))
3941 for (i = 0; i < map->n; ++i) {
3942 bmap = isl_basic_map_normalize(isl_basic_map_copy(map->p[i]));
3945 isl_basic_map_free(map->p[i]);
3948 qsort(map->p, map->n, sizeof(struct isl_basic_map *), qsort_bmap_cmp);
3949 F_SET(map, ISL_MAP_NORMALIZED);
3950 map = isl_map_remove_empty_parts(map);
3953 for (i = map->n - 1; i >= 1; --i) {
3954 if (!isl_basic_map_fast_is_equal(map->p[i-1], map->p[i]))
3956 isl_basic_map_free(map->p[i-1]);
3957 for (j = i; j < map->n; ++j)
3958 map->p[j-1] = map->p[j];
3968 struct isl_set *isl_set_normalize(struct isl_set *set)
3970 return (struct isl_set *)isl_map_normalize((struct isl_map *)set);
3973 int isl_map_fast_is_equal(struct isl_map *map1, struct isl_map *map2)
3983 if (!isl_dim_equal(map1->dim, map2->dim))
3986 map1 = isl_map_copy(map1);
3987 map2 = isl_map_copy(map2);
3988 map1 = isl_map_normalize(map1);
3989 map2 = isl_map_normalize(map2);
3992 equal = map1->n == map2->n;
3993 for (i = 0; equal && i < map1->n; ++i) {
3994 equal = isl_basic_map_fast_is_equal(map1->p[i], map2->p[i]);
4007 int isl_set_fast_is_equal(struct isl_set *set1, struct isl_set *set2)
4009 return isl_map_fast_is_equal((struct isl_map *)set1,
4010 (struct isl_map *)set2);
4013 /* Return an interval that ranges from min to max (inclusive)
4015 struct isl_basic_set *isl_basic_set_interval(struct isl_ctx *ctx,
4016 isl_int min, isl_int max)
4019 struct isl_basic_set *bset = NULL;
4021 bset = isl_basic_set_alloc(ctx, 0, 1, 0, 0, 2);
4025 k = isl_basic_set_alloc_inequality(bset);
4028 isl_int_set_si(bset->ineq[k][1], 1);
4029 isl_int_neg(bset->ineq[k][0], min);
4031 k = isl_basic_set_alloc_inequality(bset);
4034 isl_int_set_si(bset->ineq[k][1], -1);
4035 isl_int_set(bset->ineq[k][0], max);
4039 isl_basic_set_free(bset);
4043 /* Return the Cartesian product of the basic sets in list (in the given order).
4045 struct isl_basic_set *isl_basic_set_product(struct isl_basic_set_list *list)
4053 struct isl_basic_set *product = NULL;
4057 isl_assert(list->ctx, list->n > 0, goto error);
4058 isl_assert(list->ctx, list->p[0], goto error);
4059 nparam = isl_basic_set_n_param(list->p[0]);
4060 dim = isl_basic_set_n_dim(list->p[0]);
4061 extra = list->p[0]->n_div;
4062 n_eq = list->p[0]->n_eq;
4063 n_ineq = list->p[0]->n_ineq;
4064 for (i = 1; i < list->n; ++i) {
4065 isl_assert(list->ctx, list->p[i], goto error);
4066 isl_assert(list->ctx,
4067 nparam == isl_basic_set_n_param(list->p[i]), goto error);
4068 dim += isl_basic_set_n_dim(list->p[i]);
4069 extra += list->p[i]->n_div;
4070 n_eq += list->p[i]->n_eq;
4071 n_ineq += list->p[i]->n_ineq;
4073 product = isl_basic_set_alloc(list->ctx, nparam, dim, extra,
4078 for (i = 0; i < list->n; ++i) {
4079 isl_basic_set_add_constraints(product,
4080 isl_basic_set_copy(list->p[i]), dim);
4081 dim += isl_basic_set_n_dim(list->p[i]);
4083 isl_basic_set_list_free(list);
4086 isl_basic_set_free(product);
4087 isl_basic_set_list_free(list);
4091 uint32_t isl_basic_set_get_hash(struct isl_basic_set *bset)
4099 bset = isl_basic_set_copy(bset);
4100 bset = isl_basic_set_normalize(bset);
4103 total = isl_basic_set_total_dim(bset);
4104 isl_hash_byte(hash, bset->n_eq & 0xFF);
4105 for (i = 0; i < bset->n_eq; ++i) {
4107 c_hash = isl_seq_get_hash(bset->eq[i], 1 + total);
4108 isl_hash_hash(hash, c_hash);
4110 isl_hash_byte(hash, bset->n_ineq & 0xFF);
4111 for (i = 0; i < bset->n_ineq; ++i) {
4113 c_hash = isl_seq_get_hash(bset->ineq[i], 1 + total);
4114 isl_hash_hash(hash, c_hash);
4116 isl_hash_byte(hash, bset->n_div & 0xFF);
4117 for (i = 0; i < bset->n_div; ++i) {
4119 if (isl_int_is_zero(bset->div[i][0]))
4121 isl_hash_byte(hash, i & 0xFF);
4122 c_hash = isl_seq_get_hash(bset->div[i], 1 + 1 + total);
4123 isl_hash_hash(hash, c_hash);
4125 isl_basic_set_free(bset);
4129 uint32_t isl_set_get_hash(struct isl_set *set)
4136 set = isl_set_copy(set);
4137 set = isl_set_normalize(set);
4141 hash = isl_hash_init();
4142 for (i = 0; i < set->n; ++i) {
4144 bset_hash = isl_basic_set_get_hash(set->p[i]);
4145 isl_hash_hash(hash, bset_hash);
4153 /* Check if the value for dimension dim is completely determined
4154 * by the values of the other parameters and variables.
4155 * That is, check if dimension dim is involved in an equality.
4157 int isl_basic_set_dim_is_unique(struct isl_basic_set *bset, unsigned dim)
4164 nparam = isl_basic_set_n_param(bset);
4165 for (i = 0; i < bset->n_eq; ++i)
4166 if (!isl_int_is_zero(bset->eq[i][1 + nparam + dim]))
4171 /* Check if the value for dimension dim is completely determined
4172 * by the values of the other parameters and variables.
4173 * That is, check if dimension dim is involved in an equality
4174 * for each of the subsets.
4176 int isl_set_dim_is_unique(struct isl_set *set, unsigned dim)
4182 for (i = 0; i < set->n; ++i) {
4184 unique = isl_basic_set_dim_is_unique(set->p[i], dim);