8 #include "isl_map_private.h"
9 #include "isl_map_piplib.h"
10 #include "isl_sample.h"
13 static struct isl_basic_map *basic_map_init(struct isl_ctx *ctx,
14 struct isl_basic_map *bmap,
15 unsigned nparam, unsigned n_in, unsigned n_out, unsigned extra,
16 unsigned n_eq, unsigned n_ineq)
19 size_t row_size = 1 + nparam + n_in + n_out + extra;
21 bmap->block = isl_blk_alloc(ctx, (n_eq + n_ineq) * row_size);
22 if (!bmap->block.data) {
27 bmap->eq = isl_alloc_array(ctx, isl_int *, n_eq + n_ineq);
29 isl_blk_free(ctx, bmap->block);
35 bmap->block2.size = 0;
36 bmap->block2.data = NULL;
39 bmap->block2 = isl_blk_alloc(ctx, extra * (1 + row_size));
40 if (!bmap->block2.data) {
42 isl_blk_free(ctx, bmap->block);
47 bmap->div = isl_alloc_array(ctx, isl_int *, extra);
49 isl_blk_free(ctx, bmap->block2);
51 isl_blk_free(ctx, bmap->block);
57 for (i = 0; i < n_eq + n_ineq; ++i)
58 bmap->eq[i] = bmap->block.data + i * row_size;
60 for (i = 0; i < extra; ++i)
61 bmap->div[i] = bmap->block2.data + i * (1 + row_size);
65 bmap->c_size = n_eq + n_ineq;
66 bmap->ineq = bmap->eq + n_eq;
67 bmap->nparam = nparam;
79 struct isl_basic_set *isl_basic_set_alloc(struct isl_ctx *ctx,
80 unsigned nparam, unsigned dim, unsigned extra,
81 unsigned n_eq, unsigned n_ineq)
83 struct isl_basic_map *bmap;
84 bmap = isl_basic_map_alloc(ctx, nparam, 0, dim, extra, n_eq, n_ineq);
85 return (struct isl_basic_set *)bmap;
88 struct isl_basic_map *isl_basic_map_alloc(struct isl_ctx *ctx,
89 unsigned nparam, unsigned in, unsigned out, unsigned extra,
90 unsigned n_eq, unsigned n_ineq)
92 struct isl_basic_map *bmap;
94 bmap = isl_alloc_type(ctx, struct isl_basic_map);
98 return basic_map_init(ctx, bmap,
99 nparam, in, out, extra, n_eq, n_ineq);
102 static void dup_constraints(struct isl_ctx *ctx,
103 struct isl_basic_map *dst, struct isl_basic_map *src)
106 unsigned total = src->nparam + src->n_in + src->n_out + src->n_div;
108 for (i = 0; i < src->n_eq; ++i) {
109 int j = isl_basic_map_alloc_equality(ctx, dst);
110 isl_seq_cpy(dst->eq[j], src->eq[i], 1+total);
113 for (i = 0; i < src->n_ineq; ++i) {
114 int j = isl_basic_map_alloc_inequality(ctx, dst);
115 isl_seq_cpy(dst->ineq[j], src->ineq[i], 1+total);
118 for (i = 0; i < src->n_div; ++i) {
119 int j = isl_basic_map_alloc_div(ctx, dst);
120 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total);
122 F_SET(dst, ISL_BASIC_SET_FINAL);
125 struct isl_basic_map *isl_basic_map_dup(struct isl_ctx *ctx,
126 struct isl_basic_map *bmap)
128 struct isl_basic_map *dup;
130 dup = isl_basic_map_alloc(ctx, bmap->nparam,
131 bmap->n_in, bmap->n_out,
132 bmap->n_div, bmap->n_eq, bmap->n_ineq);
135 dup_constraints(ctx, dup, bmap);
136 dup->sample = isl_vec_copy(ctx, bmap->sample);
140 struct isl_basic_set *isl_basic_set_dup(struct isl_ctx *ctx,
141 struct isl_basic_set *bset)
143 struct isl_basic_map *dup;
145 dup = isl_basic_map_dup(ctx, (struct isl_basic_map *)bset);
146 return (struct isl_basic_set *)dup;
149 struct isl_basic_set *isl_basic_set_copy(struct isl_ctx *ctx,
150 struct isl_basic_set *bset)
155 if (F_ISSET(bset, ISL_BASIC_SET_FINAL)) {
159 return isl_basic_set_dup(ctx, bset);
162 struct isl_set *isl_set_copy(struct isl_ctx *ctx, struct isl_set *set)
171 struct isl_basic_map *isl_basic_map_copy(struct isl_ctx *ctx,
172 struct isl_basic_map *bmap)
177 if (F_ISSET(bmap, ISL_BASIC_SET_FINAL)) {
181 return isl_basic_map_dup(ctx, bmap);
184 struct isl_map *isl_map_copy(struct isl_ctx *ctx, struct isl_map *map)
193 void isl_basic_map_free(struct isl_ctx *ctx, struct isl_basic_map *bmap)
202 isl_blk_free(ctx, bmap->block2);
204 isl_blk_free(ctx, bmap->block);
205 isl_vec_free(ctx, bmap->sample);
209 void isl_basic_set_free(struct isl_ctx *ctx, struct isl_basic_set *bset)
211 isl_basic_map_free(ctx, (struct isl_basic_map *)bset);
214 int isl_basic_map_alloc_equality(struct isl_ctx *ctx,
215 struct isl_basic_map *bmap)
219 isl_assert(ctx, bmap->n_eq + bmap->n_ineq < bmap->c_size, return -1);
220 isl_assert(ctx, bmap->eq + bmap->n_eq <= bmap->ineq, return -1);
221 if (bmap->eq + bmap->n_eq == bmap->ineq) {
223 int j = isl_basic_map_alloc_inequality(ctx, bmap);
227 bmap->ineq[0] = bmap->ineq[j];
235 int isl_basic_map_free_equality(struct isl_ctx *ctx,
236 struct isl_basic_map *bmap, unsigned n)
238 isl_assert(ctx, n <= bmap->n_eq, return -1);
243 int isl_basic_map_drop_equality(struct isl_ctx *ctx,
244 struct isl_basic_map *bmap, unsigned pos)
247 isl_assert(ctx, pos < bmap->n_eq, return -1);
249 if (pos != bmap->n_eq - 1) {
251 bmap->eq[pos] = bmap->eq[bmap->n_eq - 1];
252 bmap->eq[bmap->n_eq - 1] = t;
258 void isl_basic_map_inequality_to_equality(struct isl_ctx *ctx,
259 struct isl_basic_map *bmap, unsigned pos)
264 bmap->ineq[pos] = bmap->ineq[0];
265 bmap->ineq[0] = bmap->eq[bmap->n_eq];
266 bmap->eq[bmap->n_eq] = t;
272 int isl_basic_map_alloc_inequality(struct isl_ctx *ctx,
273 struct isl_basic_map *bmap)
275 isl_assert(ctx, (bmap->ineq - bmap->eq) + bmap->n_ineq < bmap->c_size,
277 return bmap->n_ineq++;
280 int isl_basic_map_free_inequality(struct isl_ctx *ctx,
281 struct isl_basic_map *bmap, unsigned n)
283 isl_assert(ctx, n <= bmap->n_ineq, return -1);
288 int isl_basic_map_drop_inequality(struct isl_ctx *ctx,
289 struct isl_basic_map *bmap, unsigned pos)
292 isl_assert(ctx, pos < bmap->n_ineq, return -1);
294 if (pos != bmap->n_ineq - 1) {
296 bmap->ineq[pos] = bmap->ineq[bmap->n_ineq - 1];
297 bmap->ineq[bmap->n_ineq - 1] = t;
303 int isl_basic_map_alloc_div(struct isl_ctx *ctx,
304 struct isl_basic_map *bmap)
306 isl_assert(ctx, bmap->n_div < bmap->extra, return -1);
307 return bmap->n_div++;
310 int isl_basic_map_free_div(struct isl_ctx *ctx,
311 struct isl_basic_map *bmap, unsigned n)
313 isl_assert(ctx, n <= bmap->n_div, return -1);
318 /* Copy constraint from src to dst, putting the vars of src at offset
319 * dim_off in dst and the divs of src at offset div_off in dst.
320 * If both sets are actually map, then dim_off applies to the input
323 static void copy_constraint(struct isl_basic_map *dst_map, isl_int *dst,
324 struct isl_basic_map *src_map, isl_int *src,
325 unsigned in_off, unsigned out_off, unsigned div_off)
327 isl_int_set(dst[0], src[0]);
328 isl_seq_cpy(dst+1, src+1, isl_min(dst_map->nparam, src_map->nparam));
329 isl_seq_cpy(dst+1+dst_map->nparam+in_off,
330 src+1+src_map->nparam,
331 isl_min(dst_map->n_in-in_off, src_map->n_in));
332 isl_seq_cpy(dst+1+dst_map->nparam+dst_map->n_in+out_off,
333 src+1+src_map->nparam+src_map->n_in,
334 isl_min(dst_map->n_out-out_off, src_map->n_out));
335 isl_seq_cpy(dst+1+dst_map->nparam+dst_map->n_in+dst_map->n_out+div_off,
336 src+1+src_map->nparam+src_map->n_in+src_map->n_out,
337 isl_min(dst_map->extra-div_off, src_map->extra));
340 static void copy_div(struct isl_basic_map *dst_map, isl_int *dst,
341 struct isl_basic_map *src_map, isl_int *src,
342 unsigned in_off, unsigned out_off, unsigned div_off)
344 isl_int_set(dst[0], src[0]);
345 copy_constraint(dst_map, dst+1, src_map, src+1, in_off, out_off, div_off);
348 static struct isl_basic_map *add_constraints(struct isl_ctx *ctx,
349 struct isl_basic_map *bmap1,
350 struct isl_basic_map *bmap2, unsigned i_pos, unsigned o_pos)
353 unsigned div_off = bmap1->n_div;
355 for (i = 0; i < bmap2->n_eq; ++i) {
356 int i1 = isl_basic_map_alloc_equality(ctx, bmap1);
359 copy_constraint(bmap1, bmap1->eq[i1], bmap2, bmap2->eq[i],
360 i_pos, o_pos, div_off);
363 for (i = 0; i < bmap2->n_ineq; ++i) {
364 int i1 = isl_basic_map_alloc_inequality(ctx, bmap1);
367 copy_constraint(bmap1, bmap1->ineq[i1], bmap2, bmap2->ineq[i],
368 i_pos, o_pos, div_off);
371 for (i = 0; i < bmap2->n_div; ++i) {
372 int i1 = isl_basic_map_alloc_div(ctx, bmap1);
375 copy_div(bmap1, bmap1->div[i1], bmap2, bmap2->div[i],
376 i_pos, o_pos, div_off);
379 isl_basic_map_free(ctx, bmap2);
384 isl_basic_map_free(ctx, bmap1);
385 isl_basic_map_free(ctx, bmap2);
389 struct isl_basic_map *isl_basic_map_extend(struct isl_ctx *ctx,
390 struct isl_basic_map *base,
391 unsigned nparam, unsigned n_in, unsigned n_out, unsigned extra,
392 unsigned n_eq, unsigned n_ineq)
394 struct isl_basic_map *ext;
397 base = isl_basic_map_cow(ctx, base);
401 dims_ok = base && base->nparam == nparam &&
402 base->n_in == n_in && base->n_out == n_out &&
403 base->extra >= base->n_div + extra;
405 if (dims_ok && n_eq == 0 && n_ineq == 0)
409 isl_assert(ctx, base->nparam <= nparam, goto error);
410 isl_assert(ctx, base->n_in <= n_in, goto error);
411 isl_assert(ctx, base->n_out <= n_out, goto error);
412 extra += base->extra;
414 n_ineq += base->n_ineq;
417 ext = isl_basic_map_alloc(ctx, nparam, n_in, n_out,
418 extra, n_eq, n_ineq);
424 ext = add_constraints(ctx, ext, base, 0, 0);
429 isl_basic_map_free(ctx, base);
433 struct isl_basic_set *isl_basic_set_extend(struct isl_ctx *ctx,
434 struct isl_basic_set *base,
435 unsigned nparam, unsigned dim, unsigned extra,
436 unsigned n_eq, unsigned n_ineq)
438 return (struct isl_basic_set *)
439 isl_basic_map_extend(ctx, (struct isl_basic_map *)base,
440 nparam, 0, dim, extra, n_eq, n_ineq);
443 struct isl_basic_set *isl_basic_set_cow(struct isl_ctx *ctx,
444 struct isl_basic_set *bset)
446 return (struct isl_basic_set *)
447 isl_basic_map_cow(ctx, (struct isl_basic_map *)bset);
450 struct isl_basic_map *isl_basic_map_cow(struct isl_ctx *ctx,
451 struct isl_basic_map *bmap)
458 bmap = isl_basic_map_dup(ctx, bmap);
460 F_CLR(bmap, ISL_BASIC_SET_FINAL);
464 static struct isl_set *isl_set_cow(struct isl_ctx *ctx, struct isl_set *set)
469 return isl_set_dup(ctx, set);
472 struct isl_map *isl_map_cow(struct isl_ctx *ctx, struct isl_map *map)
477 return isl_map_dup(ctx, map);
480 static void swap_vars(struct isl_blk blk, isl_int *a,
481 unsigned a_len, unsigned b_len)
483 isl_seq_cpy(blk.data, a+a_len, b_len);
484 isl_seq_cpy(blk.data+b_len, a, a_len);
485 isl_seq_cpy(a, blk.data, b_len+a_len);
488 struct isl_basic_set *isl_basic_set_swap_vars(struct isl_ctx *ctx,
489 struct isl_basic_set *bset, unsigned n)
497 isl_assert(ctx, n <= bset->dim, goto error);
502 bset = isl_basic_set_cow(ctx, bset);
506 blk = isl_blk_alloc(ctx, bset->dim);
510 for (i = 0; i < bset->n_eq; ++i)
512 bset->eq[i]+1+bset->nparam, n, bset->dim - n);
514 for (i = 0; i < bset->n_ineq; ++i)
516 bset->ineq[i]+1+bset->nparam, n, bset->dim - n);
518 for (i = 0; i < bset->n_div; ++i)
520 bset->div[i]+1+1+bset->nparam, n, bset->dim - n);
522 isl_blk_free(ctx, blk);
527 isl_basic_set_free(ctx, bset);
531 struct isl_set *isl_set_swap_vars(struct isl_ctx *ctx,
532 struct isl_set *set, unsigned n)
535 set = isl_set_cow(ctx, set);
539 for (i = 0; i < set->n; ++i) {
540 set->p[i] = isl_basic_set_swap_vars(ctx, set->p[i], n);
542 isl_set_free(ctx, set);
549 static void constraint_drop_vars(isl_int *c, unsigned n, unsigned rem)
551 isl_seq_cpy(c, c + n, rem);
552 isl_seq_clr(c + rem, n);
555 struct isl_basic_set *isl_basic_set_drop_vars(struct isl_ctx *ctx,
556 struct isl_basic_set *bset, unsigned first, unsigned n)
563 isl_assert(ctx, first + n <= bset->dim, goto error);
568 bset = isl_basic_set_cow(ctx, bset);
572 for (i = 0; i < bset->n_eq; ++i)
573 constraint_drop_vars(bset->eq[i]+1+bset->nparam+first, n,
574 (bset->dim-first-n)+bset->extra);
576 for (i = 0; i < bset->n_ineq; ++i)
577 constraint_drop_vars(bset->ineq[i]+1+bset->nparam+first, n,
578 (bset->dim-first-n)+bset->extra);
580 for (i = 0; i < bset->n_div; ++i)
581 constraint_drop_vars(bset->div[i]+1+1+bset->nparam+first, n,
582 (bset->dim-first-n)+bset->extra);
587 return isl_basic_set_finalize(ctx, bset);
589 isl_basic_set_free(ctx, bset);
594 * We don't cow, as the div is assumed to be redundant.
596 static struct isl_basic_map *isl_basic_map_drop_div(struct isl_ctx *ctx,
597 struct isl_basic_map *bmap, unsigned div)
605 pos = 1 + bmap->nparam + bmap->n_in + bmap->n_out + div;
607 isl_assert(ctx, div < bmap->n_div, goto error);
609 for (i = 0; i < bmap->n_eq; ++i)
610 constraint_drop_vars(bmap->eq[i]+pos, 1, bmap->extra-div-1);
612 for (i = 0; i < bmap->n_ineq; ++i) {
613 if (!isl_int_is_zero(bmap->ineq[i][pos])) {
614 isl_basic_map_drop_inequality(ctx, bmap, i);
618 constraint_drop_vars(bmap->ineq[i]+pos, 1, bmap->extra-div-1);
621 for (i = 0; i < bmap->n_div; ++i)
622 constraint_drop_vars(bmap->div[i]+1+pos, 1, bmap->extra-div-1);
624 if (div != bmap->n_div - 1) {
626 isl_int *t = bmap->div[div];
628 for (j = div; j < bmap->n_div - 1; ++j)
629 bmap->div[j] = bmap->div[j+1];
631 bmap->div[bmap->n_div - 1] = t;
633 isl_basic_map_free_div(ctx, bmap, 1);
637 isl_basic_map_free(ctx, bmap);
641 static void eliminate_div(struct isl_ctx *ctx, struct isl_basic_map *bmap,
642 isl_int *eq, unsigned div)
645 unsigned pos = 1 + bmap->nparam + bmap->n_in + bmap->n_out + div;
647 len = 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
649 for (i = 0; i < bmap->n_eq; ++i)
650 if (bmap->eq[i] != eq)
651 isl_seq_elim(bmap->eq[i], eq, pos, len, NULL);
653 for (i = 0; i < bmap->n_ineq; ++i)
654 isl_seq_elim(bmap->ineq[i], eq, pos, len, NULL);
656 /* We need to be careful about circular definitions,
657 * so for now we just remove the definitions of other divs that
658 * depend on this div and (possibly) recompute them later.
660 for (i = 0; i < bmap->n_div; ++i)
661 if (!isl_int_is_zero(bmap->div[i][0]) &&
662 !isl_int_is_zero(bmap->div[i][1 + pos]))
663 isl_seq_clr(bmap->div[i], 1 + len);
665 isl_basic_map_drop_div(ctx, bmap, div);
668 struct isl_basic_map *isl_basic_map_set_to_empty(
669 struct isl_ctx *ctx, struct isl_basic_map *bmap)
675 total = bmap->nparam + bmap->n_in + bmap->n_out;
676 isl_basic_map_free_div(ctx, bmap, bmap->n_div);
677 isl_basic_map_free_inequality(ctx, bmap, bmap->n_ineq);
679 isl_basic_map_free_equality(ctx, bmap, bmap->n_eq-1);
681 isl_basic_map_alloc_equality(ctx, bmap);
685 isl_int_set_si(bmap->eq[i][0], 1);
686 isl_seq_clr(bmap->eq[i]+1, total);
687 F_SET(bmap, ISL_BASIC_MAP_EMPTY);
688 return isl_basic_map_finalize(ctx, bmap);
690 isl_basic_map_free(ctx, bmap);
694 struct isl_basic_set *isl_basic_set_set_to_empty(
695 struct isl_ctx *ctx, struct isl_basic_set *bset)
697 return (struct isl_basic_set *)
698 isl_basic_map_set_to_empty(ctx, (struct isl_basic_map *)bset);
701 static void swap_equality(struct isl_basic_map *bmap, int a, int b)
703 isl_int *t = bmap->eq[a];
704 bmap->eq[a] = bmap->eq[b];
708 static void swap_inequality(struct isl_basic_map *bmap, int a, int b)
710 isl_int *t = bmap->ineq[a];
711 bmap->ineq[a] = bmap->ineq[b];
715 static void swap_div(struct isl_basic_map *bmap, int a, int b)
718 unsigned off = bmap->nparam + bmap->n_in + bmap->n_out;
719 isl_int *t = bmap->div[a];
720 bmap->div[a] = bmap->div[b];
723 for (i = 0; i < bmap->n_eq; ++i)
724 isl_int_swap(bmap->eq[i][1+off+a], bmap->eq[i][1+off+b]);
726 for (i = 0; i < bmap->n_ineq; ++i)
727 isl_int_swap(bmap->ineq[i][1+off+a], bmap->ineq[i][1+off+b]);
729 for (i = 0; i < bmap->n_div; ++i)
730 isl_int_swap(bmap->div[i][1+1+off+a], bmap->div[i][1+1+off+b]);
733 struct isl_basic_map *isl_basic_map_gauss(struct isl_ctx *ctx,
734 struct isl_basic_map *bmap, int *progress)
745 total_var = bmap->nparam + bmap->n_in + bmap->n_out;
746 total = total_var + bmap->n_div;
748 last_var = total - 1;
749 for (done = 0; done < bmap->n_eq; ++done) {
750 for (; last_var >= 0; --last_var) {
751 for (k = done; k < bmap->n_eq; ++k)
752 if (!isl_int_is_zero(bmap->eq[k][1+last_var]))
760 swap_equality(bmap, k, done);
761 if (isl_int_is_neg(bmap->eq[done][1+last_var]))
762 isl_seq_neg(bmap->eq[done], bmap->eq[done], 1+total);
764 for (k = 0; k < bmap->n_eq; ++k) {
767 if (isl_int_is_zero(bmap->eq[k][1+last_var]))
771 isl_seq_elim(bmap->eq[k], bmap->eq[done],
772 1+last_var, 1+total, NULL);
775 for (k = 0; k < bmap->n_ineq; ++k) {
776 if (isl_int_is_zero(bmap->ineq[k][1+last_var]))
780 isl_seq_elim(bmap->ineq[k], bmap->eq[done],
781 1+last_var, 1+total, NULL);
784 for (k = 0; k < bmap->n_div; ++k) {
785 if (isl_int_is_zero(bmap->div[k][0]))
787 if (isl_int_is_zero(bmap->div[k][1+1+last_var]))
791 isl_seq_elim(bmap->div[k]+1, bmap->eq[done],
792 1+last_var, 1+total, &bmap->div[k][0]);
795 if (last_var >= total_var &&
796 isl_int_is_zero(bmap->div[last_var - total_var][0])) {
797 unsigned div = last_var - total_var;
798 isl_seq_neg(bmap->div[div]+1, bmap->eq[done], 1+total);
799 isl_int_set_si(bmap->div[div][1+1+last_var], 0);
800 isl_int_set(bmap->div[div][0],
801 bmap->eq[done][1+last_var]);
804 if (done == bmap->n_eq)
806 for (k = done; k < bmap->n_eq; ++k) {
807 if (isl_int_is_zero(bmap->eq[k][0]))
809 return isl_basic_map_set_to_empty(ctx, bmap);
811 isl_basic_map_free_equality(ctx, bmap, bmap->n_eq-done);
815 struct isl_basic_set *isl_basic_set_gauss(struct isl_ctx *ctx,
816 struct isl_basic_set *bset, int *progress)
818 return (struct isl_basic_set*)isl_basic_map_gauss(ctx,
819 (struct isl_basic_map *)bset, progress);
822 static unsigned int round_up(unsigned int v)
833 static int hash_index(int *index, unsigned int size, int bits,
834 struct isl_basic_map *bmap, int k)
837 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
838 u_int32_t hash = isl_seq_hash(bmap->ineq[k]+1, total, bits);
839 for (h = hash; index[h]; h = (h+1) % size)
840 if (k != index[h]-1 &&
841 isl_seq_eq(bmap->ineq[k]+1,
842 bmap->ineq[index[h]-1]+1, total))
847 static struct isl_basic_map *remove_duplicate_constraints(
849 struct isl_basic_map *bmap, int *progress)
855 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
858 if (bmap->n_ineq <= 1)
861 size = round_up(4 * (bmap->n_ineq+1) / 3 - 1);
862 bits = ffs(size) - 1;
863 index = isl_alloc_array(ctx, int, size);
864 memset(index, 0, size * sizeof(int));
868 index[isl_seq_hash(bmap->ineq[0]+1, total, bits)] = 1;
869 for (k = 1; k < bmap->n_ineq; ++k) {
870 h = hash_index(index, size, bits, bmap, k);
877 if (isl_int_lt(bmap->ineq[k][0], bmap->ineq[l][0]))
878 swap_inequality(bmap, k, l);
879 isl_basic_map_drop_inequality(ctx, bmap, k);
883 for (k = 0; k < bmap->n_ineq-1; ++k) {
884 isl_seq_neg(bmap->ineq[k]+1, bmap->ineq[k]+1, total);
885 h = hash_index(index, size, bits, bmap, k);
886 isl_seq_neg(bmap->ineq[k]+1, bmap->ineq[k]+1, total);
890 isl_int_add(sum, bmap->ineq[k][0], bmap->ineq[l][0]);
891 if (isl_int_is_pos(sum))
893 if (isl_int_is_zero(sum)) {
894 /* We need to break out of the loop after these
895 * changes since the contents of the hash
896 * will no longer be valid.
897 * Plus, we probably we want to regauss first.
899 isl_basic_map_drop_inequality(ctx, bmap, l);
900 isl_basic_map_inequality_to_equality(ctx, bmap, k);
902 bmap = isl_basic_map_set_to_empty(ctx, bmap);
911 static struct isl_basic_map *remove_duplicate_divs(struct isl_ctx *ctx,
912 struct isl_basic_map *bmap, int *progress)
919 unsigned total_var = bmap->nparam + bmap->n_in + bmap->n_out;
920 unsigned total = total_var + bmap->n_div;
922 if (bmap->n_div <= 1)
925 for (k = bmap->n_div - 1; k >= 0; --k)
926 if (!isl_int_is_zero(bmap->div[k][0]))
931 size = round_up(4 * bmap->n_div / 3 - 1);
932 bits = ffs(size) - 1;
933 index = isl_alloc_array(ctx, int, size);
934 memset(index, 0, size * sizeof(int));
937 eq = isl_blk_alloc(ctx, 1+total);
941 isl_seq_clr(eq.data, 1+total);
942 index[isl_seq_hash(bmap->div[k], 2+total, bits)] = k + 1;
943 for (--k; k >= 0; --k) {
946 if (isl_int_is_zero(bmap->div[k][0]))
949 hash = isl_seq_hash(bmap->div[k], 2+total, bits);
950 for (h = hash; index[h]; h = (h+1) % size)
951 if (isl_seq_eq(bmap->div[k],
952 bmap->div[index[h]-1], 2+total))
957 isl_int_set_si(eq.data[1+total_var+k], -1);
958 isl_int_set_si(eq.data[1+total_var+l], 1);
959 eliminate_div(ctx, bmap, eq.data, l);
960 isl_int_set_si(eq.data[1+total_var+k], 0);
961 isl_int_set_si(eq.data[1+total_var+l], 0);
966 isl_blk_free(ctx, eq);
972 static struct isl_basic_map *eliminate_divs(
973 struct isl_ctx *ctx, struct isl_basic_map *bmap,
984 off = 1 + bmap->nparam + bmap->n_in + bmap->n_out;
986 for (d = bmap->n_div - 1; d >= 0 ; --d) {
987 for (i = 0; i < bmap->n_eq; ++i) {
988 if (!isl_int_is_one(bmap->eq[i][off + d]) &&
989 !isl_int_is_negone(bmap->eq[i][off + d]))
993 eliminate_div(ctx, bmap, bmap->eq[i], d);
994 isl_basic_map_drop_equality(ctx, bmap, i);
998 return eliminate_divs(ctx, bmap, progress);
1002 static struct isl_basic_map *normalize_constraints(
1003 struct isl_ctx *ctx, struct isl_basic_map *bmap)
1007 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
1010 for (i = bmap->n_eq - 1; i >= 0; --i) {
1011 isl_seq_gcd(bmap->eq[i]+1, total, &gcd);
1012 if (isl_int_is_zero(gcd)) {
1013 if (!isl_int_is_zero(bmap->eq[i][0])) {
1014 bmap = isl_basic_map_set_to_empty(ctx, bmap);
1017 isl_basic_map_drop_equality(ctx, bmap, i);
1020 if (isl_int_is_one(gcd))
1022 if (!isl_int_is_divisible_by(bmap->eq[i][0], gcd)) {
1023 bmap = isl_basic_map_set_to_empty(ctx, bmap);
1026 isl_seq_scale_down(bmap->eq[i], bmap->eq[i], gcd, 1+total);
1029 for (i = bmap->n_ineq - 1; i >= 0; --i) {
1030 isl_seq_gcd(bmap->ineq[i]+1, total, &gcd);
1031 if (isl_int_is_zero(gcd)) {
1032 if (isl_int_is_neg(bmap->ineq[i][0])) {
1033 bmap = isl_basic_map_set_to_empty(ctx, bmap);
1036 isl_basic_map_drop_inequality(ctx, bmap, i);
1039 if (isl_int_is_one(gcd))
1041 isl_int_fdiv_q(bmap->ineq[i][0], bmap->ineq[i][0], gcd);
1042 isl_seq_scale_down(bmap->ineq[i]+1, bmap->ineq[i]+1, gcd, total);
1049 struct isl_basic_map *isl_basic_map_simplify(
1050 struct isl_ctx *ctx, struct isl_basic_map *bmap)
1057 bmap = normalize_constraints(ctx, bmap);
1058 bmap = eliminate_divs(ctx, bmap, &progress);
1059 bmap = isl_basic_map_gauss(ctx, bmap, &progress);
1060 bmap = remove_duplicate_divs(ctx, bmap, &progress);
1061 bmap = remove_duplicate_constraints(ctx, bmap, &progress);
1066 struct isl_basic_set *isl_basic_set_simplify(
1067 struct isl_ctx *ctx, struct isl_basic_set *bset)
1069 return (struct isl_basic_set *)
1070 isl_basic_map_simplify(ctx,
1071 (struct isl_basic_map *)bset);
1074 static void dump_term(struct isl_basic_map *bmap,
1075 isl_int c, int pos, FILE *out)
1077 unsigned in = bmap->n_in;
1078 unsigned dim = bmap->n_in + bmap->n_out;
1080 isl_int_print(out, c);
1082 if (!isl_int_is_one(c))
1083 isl_int_print(out, c);
1084 if (pos < 1 + bmap->nparam)
1085 fprintf(out, "p%d", pos - 1);
1086 else if (pos < 1 + bmap->nparam + in)
1087 fprintf(out, "i%d", pos - 1 - bmap->nparam);
1088 else if (pos < 1 + bmap->nparam + dim)
1089 fprintf(out, "o%d", pos - 1 - bmap->nparam - in);
1091 fprintf(out, "e%d", pos - 1 - bmap->nparam - dim);
1095 static void dump_constraint_sign(struct isl_basic_map *bmap, isl_int *c,
1096 int sign, FILE *out)
1100 unsigned len = 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
1104 for (i = 0, first = 1; i < len; ++i) {
1105 if (isl_int_sgn(c[i]) * sign <= 0)
1108 fprintf(out, " + ");
1110 isl_int_abs(v, c[i]);
1111 dump_term(bmap, v, i, out);
1118 static void dump_constraint(struct isl_basic_map *bmap, isl_int *c,
1119 const char *op, FILE *out, int indent)
1121 fprintf(out, "%*s", indent, "");
1123 dump_constraint_sign(bmap, c, 1, out);
1124 fprintf(out, " %s ", op);
1125 dump_constraint_sign(bmap, c, -1, out);
1130 static void dump_constraints(struct isl_basic_map *bmap,
1131 isl_int **c, unsigned n,
1132 const char *op, FILE *out, int indent)
1136 for (i = 0; i < n; ++i)
1137 dump_constraint(bmap, c[i], op, out, indent);
1140 static void dump_affine(struct isl_basic_map *bmap, isl_int *exp, FILE *out)
1144 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
1146 for (j = 0; j < 1 + total; ++j) {
1147 if (isl_int_is_zero(exp[j]))
1149 if (!first && isl_int_is_pos(exp[j]))
1151 dump_term(bmap, exp[j], j, out);
1156 static void dump(struct isl_basic_map *bmap, FILE *out, int indent)
1160 dump_constraints(bmap, bmap->eq, bmap->n_eq, "=", out, indent);
1161 dump_constraints(bmap, bmap->ineq, bmap->n_ineq, ">=", out, indent);
1163 for (i = 0; i < bmap->n_div; ++i) {
1164 fprintf(out, "%*s", indent, "");
1165 fprintf(out, "e%d = [(", i);
1166 dump_affine(bmap, bmap->div[i]+1, out);
1168 isl_int_print(out, bmap->div[i][0]);
1169 fprintf(out, "]\n");
1173 void isl_basic_set_dump(struct isl_ctx *ctx, struct isl_basic_set *bset,
1174 FILE *out, int indent)
1176 fprintf(out, "%*s", indent, "");
1177 fprintf(out, "nparam: %d, dim: %d, extra: %d\n",
1178 bset->nparam, bset->dim, bset->extra);
1179 dump((struct isl_basic_map *)bset, out, indent);
1182 void isl_basic_map_dump(struct isl_ctx *ctx, struct isl_basic_map *bmap,
1183 FILE *out, int indent)
1185 fprintf(out, "%*s", indent, "");
1186 fprintf(out, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d\n",
1188 bmap->nparam, bmap->n_in, bmap->n_out, bmap->extra);
1189 dump(bmap, out, indent);
1192 int isl_inequality_negate(struct isl_ctx *ctx,
1193 struct isl_basic_map *bmap, unsigned pos)
1195 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
1196 isl_assert(ctx, pos < bmap->n_ineq, return -1);
1197 isl_seq_neg(bmap->ineq[pos], bmap->ineq[pos], 1 + total);
1198 isl_int_sub_ui(bmap->ineq[pos][0], bmap->ineq[pos][0], 1);
1202 struct isl_set *isl_set_alloc(struct isl_ctx *ctx,
1203 unsigned nparam, unsigned dim, int n, unsigned flags)
1205 struct isl_set *set;
1207 set = isl_alloc(ctx, struct isl_set,
1208 sizeof(struct isl_set) +
1209 n * sizeof(struct isl_basic_set *));
1216 set->nparam = nparam;
1223 struct isl_set *isl_set_dup(struct isl_ctx *ctx, struct isl_set *set)
1226 struct isl_set *dup;
1228 dup = isl_set_alloc(ctx, set->nparam, set->dim, set->n, set->flags);
1231 for (i = 0; i < set->n; ++i)
1232 dup = isl_set_add(ctx, dup,
1233 isl_basic_set_dup(ctx, set->p[i]));
1237 struct isl_set *isl_set_from_basic_set(struct isl_ctx *ctx,
1238 struct isl_basic_set *bset)
1240 struct isl_set *set;
1242 set = isl_set_alloc(ctx, bset->nparam, bset->dim, 1, ISL_MAP_DISJOINT);
1244 isl_basic_set_free(ctx, bset);
1247 return isl_set_add(ctx, set, bset);
1250 struct isl_map *isl_map_from_basic_map(struct isl_ctx *ctx,
1251 struct isl_basic_map *bmap)
1253 struct isl_map *map;
1255 map = isl_map_alloc(ctx, bmap->nparam, bmap->n_in, bmap->n_out, 1,
1258 isl_basic_map_free(ctx, bmap);
1261 return isl_map_add(ctx, map, bmap);
1264 struct isl_set *isl_set_add(struct isl_ctx *ctx, struct isl_set *set,
1265 struct isl_basic_set *bset)
1269 isl_assert(ctx, set->nparam == bset->nparam, goto error);
1270 isl_assert(ctx, set->dim == bset->dim, goto error);
1271 isl_assert(ctx, set->n < set->size, goto error);
1272 set->p[set->n] = bset;
1277 isl_set_free(ctx, set);
1279 isl_basic_set_free(ctx, bset);
1283 void isl_set_free(struct isl_ctx *ctx, struct isl_set *set)
1293 for (i = 0; i < set->n; ++i)
1294 isl_basic_set_free(ctx, set->p[i]);
1298 void isl_set_dump(struct isl_ctx *ctx, struct isl_set *set, FILE *out,
1304 fprintf(out, "null set\n");
1308 fprintf(out, "%*s", indent, "");
1309 fprintf(out, "ref: %d, n: %d\n", set->ref, set->n);
1310 for (i = 0; i < set->n; ++i) {
1311 fprintf(out, "%*s", indent, "");
1312 fprintf(out, "basic set %d:\n", i);
1313 isl_basic_set_dump(ctx, set->p[i], out, indent+4);
1317 void isl_map_dump(struct isl_ctx *ctx, struct isl_map *map, FILE *out,
1322 fprintf(out, "%*s", indent, "");
1323 fprintf(out, "ref: %d, n: %d, nparam: %d, in: %d, out: %d\n",
1324 map->ref, map->n, map->nparam, map->n_in, map->n_out);
1325 for (i = 0; i < map->n; ++i) {
1326 fprintf(out, "%*s", indent, "");
1327 fprintf(out, "basic map %d:\n", i);
1328 isl_basic_map_dump(ctx, map->p[i], out, indent+4);
1332 struct isl_basic_map *isl_basic_map_intersect_domain(
1333 struct isl_ctx *ctx, struct isl_basic_map *bmap,
1334 struct isl_basic_set *bset)
1336 struct isl_basic_map *bmap_domain;
1341 isl_assert(ctx, bset->dim == bmap->n_in, goto error);
1342 isl_assert(ctx, bset->nparam == bmap->nparam, goto error);
1344 bmap = isl_basic_map_extend(ctx, bmap,
1345 bset->nparam, bmap->n_in, bmap->n_out,
1346 bset->n_div, bset->n_eq, bset->n_ineq);
1349 bmap_domain = isl_basic_map_from_basic_set(ctx, bset,
1351 bmap = add_constraints(ctx, bmap, bmap_domain, 0, 0);
1353 bmap = isl_basic_map_simplify(ctx, bmap);
1354 return isl_basic_map_finalize(ctx, bmap);
1356 isl_basic_map_free(ctx, bmap);
1357 isl_basic_set_free(ctx, bset);
1361 struct isl_basic_map *isl_basic_map_intersect_range(
1362 struct isl_ctx *ctx, struct isl_basic_map *bmap,
1363 struct isl_basic_set *bset)
1365 struct isl_basic_map *bmap_range;
1370 isl_assert(ctx, bset->dim == bmap->n_out, goto error);
1371 isl_assert(ctx, bset->nparam == bmap->nparam, goto error);
1373 bmap = isl_basic_map_extend(ctx, bmap,
1374 bset->nparam, bmap->n_in, bmap->n_out,
1375 bset->n_div, bset->n_eq, bset->n_ineq);
1378 bmap_range = isl_basic_map_from_basic_set(ctx, bset,
1380 bmap = add_constraints(ctx, bmap, bmap_range, 0, 0);
1382 bmap = isl_basic_map_simplify(ctx, bmap);
1383 return isl_basic_map_finalize(ctx, bmap);
1385 isl_basic_map_free(ctx, bmap);
1386 isl_basic_set_free(ctx, bset);
1390 struct isl_basic_map *isl_basic_map_intersect(
1391 struct isl_ctx *ctx, struct isl_basic_map *bmap1,
1392 struct isl_basic_map *bmap2)
1394 isl_assert(ctx, bmap1->nparam == bmap2->nparam, goto error);
1395 isl_assert(ctx, bmap1->n_in == bmap2->n_in, goto error);
1396 isl_assert(ctx, bmap1->n_out == bmap2->n_out, goto error);
1398 bmap1 = isl_basic_map_extend(ctx, bmap1,
1399 bmap1->nparam, bmap1->n_in, bmap1->n_out,
1400 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
1403 bmap1 = add_constraints(ctx, bmap1, bmap2, 0, 0);
1405 bmap1 = isl_basic_map_simplify(ctx, bmap1);
1406 return isl_basic_map_finalize(ctx, bmap1);
1408 isl_basic_map_free(ctx, bmap1);
1409 isl_basic_map_free(ctx, bmap2);
1413 struct isl_basic_set *isl_basic_set_intersect(
1414 struct isl_ctx *ctx, struct isl_basic_set *bset1,
1415 struct isl_basic_set *bset2)
1417 return (struct isl_basic_set *)
1418 isl_basic_map_intersect(ctx,
1419 (struct isl_basic_map *)bset1,
1420 (struct isl_basic_map *)bset2);
1423 struct isl_map *isl_map_intersect(struct isl_ctx *ctx, struct isl_map *map1,
1424 struct isl_map *map2)
1427 struct isl_map *result;
1433 if (F_ISSET(map1, ISL_MAP_DISJOINT) &&
1434 F_ISSET(map2, ISL_MAP_DISJOINT))
1435 FL_SET(flags, ISL_MAP_DISJOINT);
1437 result = isl_map_alloc(ctx, map1->nparam, map1->n_in, map1->n_out,
1438 map1->n * map2->n, flags);
1441 for (i = 0; i < map1->n; ++i)
1442 for (j = 0; j < map2->n; ++j) {
1443 struct isl_basic_map *part;
1444 part = isl_basic_map_intersect(ctx,
1445 isl_basic_map_copy(ctx, map1->p[i]),
1446 isl_basic_map_copy(ctx, map2->p[j]));
1447 if (isl_basic_map_is_empty(ctx, part))
1448 isl_basic_map_free(ctx, part);
1450 result = isl_map_add(ctx, result, part);
1454 isl_map_free(ctx, map1);
1455 isl_map_free(ctx, map2);
1458 isl_map_free(ctx, map1);
1459 isl_map_free(ctx, map2);
1463 struct isl_basic_map *isl_basic_map_reverse(struct isl_ctx *ctx,
1464 struct isl_basic_map *bmap)
1466 struct isl_basic_set *bset;
1471 bmap = isl_basic_map_cow(ctx, bmap);
1475 bset = isl_basic_set_from_basic_map(ctx, bmap);
1476 bset = isl_basic_set_swap_vars(ctx, bset, in);
1477 return isl_basic_map_from_basic_set(ctx, bset, bset->dim-in, in);
1480 /* Turn final n dimensions into existentially quantified variables.
1482 struct isl_basic_set *isl_basic_set_project_out(
1483 struct isl_ctx *ctx, struct isl_basic_set *bset,
1484 unsigned n, unsigned flags)
1494 isl_assert(ctx, n <= bset->dim, goto error);
1499 bset = isl_basic_set_cow(ctx, bset);
1501 row_size = 1 + bset->nparam + bset->dim + bset->extra;
1502 old = bset->block2.data;
1503 bset->block2 = isl_blk_extend(ctx, bset->block2,
1504 (bset->extra + n) * (1 + row_size));
1505 if (!bset->block2.data)
1507 new_div = isl_alloc_array(ctx, isl_int *, bset->extra + n);
1510 for (i = 0; i < n; ++i) {
1511 new_div[i] = bset->block2.data +
1512 (bset->extra + i) * (1 + row_size);
1513 isl_seq_clr(new_div[i], 1 + row_size);
1515 for (i = 0; i < bset->extra; ++i)
1516 new_div[n + i] = bset->block2.data + (bset->div[i] - old);
1518 bset->div = new_div;
1522 bset = isl_basic_set_simplify(ctx, bset);
1523 return isl_basic_set_finalize(ctx, bset);
1525 isl_basic_set_free(ctx, bset);
1529 struct isl_basic_map *isl_basic_map_apply_range(
1530 struct isl_ctx *ctx, struct isl_basic_map *bmap1,
1531 struct isl_basic_map *bmap2)
1533 struct isl_basic_set *bset;
1534 unsigned n_in, n_out;
1536 if (!bmap1 || !bmap2)
1539 isl_assert(ctx, bmap1->n_out == bmap2->n_in, goto error);
1540 isl_assert(ctx, bmap1->nparam == bmap2->nparam, goto error);
1543 n_out = bmap2->n_out;
1545 bmap2 = isl_basic_map_reverse(ctx, bmap2);
1548 bmap1 = isl_basic_map_extend(ctx, bmap1, bmap1->nparam,
1549 bmap1->n_in + bmap2->n_in, bmap1->n_out,
1550 bmap2->extra, bmap2->n_eq, bmap2->n_ineq);
1553 bmap1 = add_constraints(ctx, bmap1, bmap2, bmap1->n_in - bmap2->n_in, 0);
1554 bmap1 = isl_basic_map_simplify(ctx, bmap1);
1555 bset = isl_basic_set_from_basic_map(ctx, bmap1);
1556 bset = isl_basic_set_project_out(ctx, bset,
1557 bset->dim - (n_in + n_out), 0);
1558 return isl_basic_map_from_basic_set(ctx, bset, n_in, n_out);
1560 isl_basic_map_free(ctx, bmap1);
1561 isl_basic_map_free(ctx, bmap2);
1565 struct isl_basic_map *isl_basic_map_apply_domain(
1566 struct isl_ctx *ctx, struct isl_basic_map *bmap1,
1567 struct isl_basic_map *bmap2)
1569 if (!bmap1 || !bmap2)
1572 isl_assert(ctx, bmap1->n_in == bmap2->n_in, goto error);
1573 isl_assert(ctx, bmap1->nparam == bmap2->nparam, goto error);
1575 bmap1 = isl_basic_map_reverse(ctx, bmap1);
1576 bmap1 = isl_basic_map_apply_range(ctx, bmap1, bmap2);
1577 return isl_basic_map_reverse(ctx, bmap1);
1579 isl_basic_map_free(ctx, bmap1);
1580 isl_basic_map_free(ctx, bmap2);
1584 static struct isl_basic_map *var_equal(struct isl_ctx *ctx,
1585 struct isl_basic_map *bmap, unsigned pos)
1588 i = isl_basic_map_alloc_equality(ctx, bmap);
1591 isl_seq_clr(bmap->eq[i],
1592 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->extra);
1593 isl_int_set_si(bmap->eq[i][1+bmap->nparam+pos], -1);
1594 isl_int_set_si(bmap->eq[i][1+bmap->nparam+bmap->n_in+pos], 1);
1595 return isl_basic_map_finalize(ctx, bmap);
1597 isl_basic_map_free(ctx, bmap);
1601 static struct isl_basic_map *var_more(struct isl_ctx *ctx,
1602 struct isl_basic_map *bmap, unsigned pos)
1605 i = isl_basic_map_alloc_inequality(ctx, bmap);
1608 isl_seq_clr(bmap->ineq[i],
1609 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->extra);
1610 isl_int_set_si(bmap->ineq[i][0], -1);
1611 isl_int_set_si(bmap->ineq[i][1+bmap->nparam+pos], -1);
1612 isl_int_set_si(bmap->ineq[i][1+bmap->nparam+bmap->n_in+pos], 1);
1613 return isl_basic_map_finalize(ctx, bmap);
1615 isl_basic_map_free(ctx, bmap);
1619 static struct isl_basic_map *var_less(struct isl_ctx *ctx,
1620 struct isl_basic_map *bmap, unsigned pos)
1623 i = isl_basic_map_alloc_inequality(ctx, bmap);
1626 isl_seq_clr(bmap->ineq[i],
1627 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->extra);
1628 isl_int_set_si(bmap->ineq[i][0], -1);
1629 isl_int_set_si(bmap->ineq[i][1+bmap->nparam+pos], 1);
1630 isl_int_set_si(bmap->ineq[i][1+bmap->nparam+bmap->n_in+pos], -1);
1631 return isl_basic_map_finalize(ctx, bmap);
1633 isl_basic_map_free(ctx, bmap);
1637 struct isl_basic_map *isl_basic_map_equal(struct isl_ctx *ctx,
1638 unsigned nparam, unsigned in, unsigned out, unsigned n_equal)
1641 struct isl_basic_map *bmap;
1642 bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, n_equal, 0);
1645 for (i = 0; i < n_equal && bmap; ++i)
1646 bmap = var_equal(ctx, bmap, i);
1647 return isl_basic_map_finalize(ctx, bmap);
1650 struct isl_basic_map *isl_basic_map_less_at(struct isl_ctx *ctx,
1651 unsigned nparam, unsigned in, unsigned out, unsigned pos)
1654 struct isl_basic_map *bmap;
1655 bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, pos, 1);
1658 for (i = 0; i < pos && bmap; ++i)
1659 bmap = var_equal(ctx, bmap, i);
1661 bmap = var_less(ctx, bmap, pos);
1662 return isl_basic_map_finalize(ctx, bmap);
1665 struct isl_basic_map *isl_basic_map_more_at(struct isl_ctx *ctx,
1666 unsigned nparam, unsigned in, unsigned out, unsigned pos)
1669 struct isl_basic_map *bmap;
1670 bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, pos, 1);
1673 for (i = 0; i < pos && bmap; ++i)
1674 bmap = var_equal(ctx, bmap, i);
1676 bmap = var_more(ctx, bmap, pos);
1677 return isl_basic_map_finalize(ctx, bmap);
1680 struct isl_basic_map *isl_basic_map_from_basic_set(
1681 struct isl_ctx *ctx, struct isl_basic_set *bset,
1682 unsigned n_in, unsigned n_out)
1684 struct isl_basic_map *bmap;
1686 bset = isl_basic_set_cow(ctx, bset);
1690 isl_assert(ctx, bset->dim == n_in + n_out, goto error);
1691 bmap = (struct isl_basic_map *) bset;
1693 bmap->n_out = n_out;
1694 return isl_basic_map_finalize(ctx, bmap);
1696 isl_basic_set_free(ctx, bset);
1700 struct isl_basic_set *isl_basic_set_from_basic_map(
1701 struct isl_ctx *ctx, struct isl_basic_map *bmap)
1705 if (bmap->n_in == 0)
1706 return (struct isl_basic_set *)bmap;
1707 bmap = isl_basic_map_cow(ctx, bmap);
1710 bmap->n_out += bmap->n_in;
1712 bmap = isl_basic_map_finalize(ctx, bmap);
1713 return (struct isl_basic_set *)bmap;
1718 static struct isl_basic_set *isl_basic_map_underlying_set(
1719 struct isl_ctx *ctx, struct isl_basic_map *bmap)
1723 if (bmap->nparam == 0 && bmap->n_in == 0 && bmap->n_div == 0)
1724 return (struct isl_basic_set *)bmap;
1725 bmap = isl_basic_map_cow(ctx, bmap);
1728 bmap->n_out += bmap->nparam + bmap->n_in + bmap->n_div;
1732 bmap = isl_basic_map_finalize(ctx, bmap);
1733 return (struct isl_basic_set *)bmap;
1738 struct isl_basic_set *isl_basic_map_domain(struct isl_ctx *ctx,
1739 struct isl_basic_map *bmap)
1741 struct isl_basic_set *domain;
1745 n_out = bmap->n_out;
1746 domain = isl_basic_set_from_basic_map(ctx, bmap);
1747 return isl_basic_set_project_out(ctx, domain, n_out, 0);
1750 struct isl_basic_set *isl_basic_map_range(struct isl_ctx *ctx,
1751 struct isl_basic_map *bmap)
1753 return isl_basic_map_domain(ctx,
1754 isl_basic_map_reverse(ctx, bmap));
1757 struct isl_set *isl_map_range(struct isl_ctx *ctx, struct isl_map *map)
1760 struct isl_set *set;
1764 map = isl_map_cow(ctx, map);
1768 set = (struct isl_set *) map;
1770 for (i = 0; i < map->n; ++i) {
1771 set->p[i] = isl_basic_map_range(ctx, map->p[i]);
1775 F_CLR(set, ISL_MAP_DISJOINT);
1778 isl_map_free(ctx, map);
1782 struct isl_map *isl_map_from_set(
1783 struct isl_ctx *ctx, struct isl_set *set,
1784 unsigned n_in, unsigned n_out)
1787 struct isl_map *map = NULL;
1791 isl_assert(ctx, set->dim == n_in + n_out, goto error);
1792 set = isl_set_cow(ctx, set);
1795 map = (struct isl_map *)set;
1796 for (i = 0; i < set->n; ++i) {
1797 map->p[i] = isl_basic_map_from_basic_set(ctx,
1798 set->p[i], n_in, n_out);
1806 isl_set_free(ctx, set);
1810 struct isl_map *isl_map_alloc(struct isl_ctx *ctx,
1811 unsigned nparam, unsigned in, unsigned out, int n,
1814 struct isl_map *map;
1816 map = isl_alloc(ctx, struct isl_map,
1817 sizeof(struct isl_map) +
1818 n * sizeof(struct isl_basic_map *));
1825 map->nparam = nparam;
1832 struct isl_basic_map *isl_basic_map_empty(struct isl_ctx *ctx,
1833 unsigned nparam, unsigned in, unsigned out)
1835 struct isl_basic_map *bmap;
1836 bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, 1, 0);
1837 bmap = isl_basic_map_set_to_empty(ctx, bmap);
1841 struct isl_map *isl_map_empty(struct isl_ctx *ctx,
1842 unsigned nparam, unsigned in, unsigned out)
1844 return isl_map_alloc(ctx, nparam, in, out, 0, ISL_MAP_DISJOINT);
1847 struct isl_set *isl_set_empty(struct isl_ctx *ctx,
1848 unsigned nparam, unsigned dim)
1850 return isl_set_alloc(ctx, nparam, dim, 0, ISL_MAP_DISJOINT);
1853 struct isl_map *isl_map_dup(struct isl_ctx *ctx, struct isl_map *map)
1856 struct isl_map *dup;
1858 dup = isl_map_alloc(ctx, map->nparam, map->n_in, map->n_out, map->n,
1860 for (i = 0; i < map->n; ++i)
1861 dup = isl_map_add(ctx, dup,
1862 isl_basic_map_dup(ctx, map->p[i]));
1866 struct isl_map *isl_map_add(struct isl_ctx *ctx, struct isl_map *map,
1867 struct isl_basic_map *bmap)
1871 isl_assert(ctx, map->nparam == bmap->nparam, goto error);
1872 isl_assert(ctx, map->n_in == bmap->n_in, goto error);
1873 isl_assert(ctx, map->n_out == bmap->n_out, goto error);
1874 isl_assert(ctx, map->n < map->size, goto error);
1875 map->p[map->n] = bmap;
1880 isl_map_free(ctx, map);
1882 isl_basic_map_free(ctx, bmap);
1886 void isl_map_free(struct isl_ctx *ctx, struct isl_map *map)
1896 for (i = 0; i < map->n; ++i)
1897 isl_basic_map_free(ctx, map->p[i]);
1901 struct isl_map *isl_map_extend(struct isl_ctx *ctx, struct isl_map *base,
1902 unsigned nparam, unsigned n_in, unsigned n_out)
1906 base = isl_map_cow(ctx, base);
1910 isl_assert(ctx, base->nparam <= nparam, goto error);
1911 isl_assert(ctx, base->n_in <= n_in, goto error);
1912 isl_assert(ctx, base->n_out <= n_out, goto error);
1913 base->nparam = nparam;
1915 base->n_out = n_out;
1916 for (i = 0; i < base->n; ++i) {
1917 base->p[i] = isl_basic_map_extend(ctx, base->p[i],
1918 nparam, n_in, n_out, 0, 0, 0);
1924 isl_map_free(ctx, base);
1928 struct isl_basic_map *isl_basic_map_fix_input_si(struct isl_ctx *ctx,
1929 struct isl_basic_map *bmap,
1930 unsigned input, int value)
1934 bmap = isl_basic_map_cow(ctx, bmap);
1937 isl_assert(ctx, input < bmap->n_in, goto error);
1939 bmap = isl_basic_map_extend(ctx, bmap,
1940 bmap->nparam, bmap->n_in, bmap->n_out, 0, 1, 0);
1941 j = isl_basic_map_alloc_equality(ctx, bmap);
1944 isl_int_set_si(bmap->eq[j][1+bmap->nparam+input], -1);
1945 isl_int_set_si(bmap->eq[j][0], value);
1946 bmap = isl_basic_map_simplify(ctx, bmap);
1947 return isl_basic_map_finalize(ctx, bmap);
1949 isl_basic_map_free(ctx, bmap);
1953 struct isl_map *isl_map_fix_input_si(struct isl_ctx *ctx, struct isl_map *map,
1954 unsigned input, int value)
1958 map = isl_map_cow(ctx, map);
1962 isl_assert(ctx, input < map->n_in, goto error);
1963 for (i = 0; i < map->n; ++i) {
1964 map->p[i] = isl_basic_map_fix_input_si(ctx, map->p[i],
1971 isl_map_free(ctx, map);
1975 struct isl_map *isl_map_reverse(struct isl_ctx *ctx, struct isl_map *map)
1980 map = isl_map_cow(ctx, map);
1985 map->n_in = map->n_out;
1987 for (i = 0; i < map->n; ++i) {
1988 map->p[i] = isl_basic_map_reverse(ctx, map->p[i]);
1994 isl_map_free(ctx, map);
1998 struct isl_map *isl_basic_map_lexmax(struct isl_ctx *ctx,
1999 struct isl_basic_map *bmap, struct isl_basic_set *dom,
2000 struct isl_set **empty)
2002 return isl_pip_basic_map_lexmax(ctx, bmap, dom, empty);
2005 struct isl_map *isl_basic_map_lexmin(struct isl_ctx *ctx,
2006 struct isl_basic_map *bmap, struct isl_basic_set *dom,
2007 struct isl_set **empty)
2009 return isl_pip_basic_map_lexmin(ctx, bmap, dom, empty);
2012 struct isl_set *isl_basic_set_lexmin(struct isl_ctx *ctx,
2013 struct isl_basic_set *bset)
2015 struct isl_basic_map *bmap = NULL;
2016 struct isl_basic_set *dom = NULL;
2017 struct isl_map *min;
2021 bmap = isl_basic_map_from_basic_set(ctx, bset, 0, bset->dim);
2024 dom = isl_basic_set_alloc(ctx, bmap->nparam, 0, 0, 0, 0);
2027 min = isl_basic_map_lexmin(ctx, bmap, dom, NULL);
2028 return isl_map_range(ctx, min);
2030 isl_basic_map_free(ctx, bmap);
2034 struct isl_map *isl_basic_map_compute_divs(struct isl_ctx *ctx,
2035 struct isl_basic_map *bmap)
2037 if (bmap->n_div == 0)
2038 return isl_map_from_basic_map(ctx, bmap);
2039 return isl_pip_basic_map_compute_divs(ctx, bmap);
2042 struct isl_map *isl_map_compute_divs(struct isl_ctx *ctx, struct isl_map *map)
2045 struct isl_map *res;
2051 res = isl_basic_map_compute_divs(ctx,
2052 isl_basic_map_copy(ctx, map->p[0]));
2053 for (i = 1 ; i < map->n; ++i) {
2055 r2 = isl_basic_map_compute_divs(ctx,
2056 isl_basic_map_copy(ctx, map->p[i]));
2057 if (F_ISSET(map, ISL_MAP_DISJOINT))
2058 res = isl_map_union_disjoint(ctx, res, r2);
2060 res = isl_map_union(ctx, res, r2);
2062 isl_map_free(ctx, map);
2067 struct isl_set *isl_basic_set_compute_divs(struct isl_ctx *ctx,
2068 struct isl_basic_set *bset)
2070 return (struct isl_set *)
2071 isl_basic_map_compute_divs(ctx,
2072 (struct isl_basic_map *)bset);
2075 struct isl_set *isl_map_domain(struct isl_ctx *ctx, struct isl_map *map)
2078 struct isl_set *set;
2083 map = isl_map_cow(ctx, map);
2087 set = (struct isl_set *)map;
2088 set->dim = map->n_in;
2090 for (i = 0; i < map->n; ++i) {
2091 set->p[i] = isl_basic_map_domain(ctx, map->p[i]);
2095 F_CLR(set, ISL_MAP_DISJOINT);
2098 isl_map_free(ctx, map);
2102 struct isl_map *isl_map_union_disjoint(struct isl_ctx *ctx,
2103 struct isl_map *map1, struct isl_map *map2)
2107 struct isl_map *map = NULL;
2113 isl_map_free(ctx, map1);
2117 isl_map_free(ctx, map2);
2121 isl_assert(ctx, map1->nparam == map2->nparam, goto error);
2122 isl_assert(ctx, map1->n_in == map2->n_in, goto error);
2123 isl_assert(ctx, map1->n_out == map2->n_out, goto error);
2125 if (F_ISSET(map1, ISL_MAP_DISJOINT) &&
2126 F_ISSET(map2, ISL_MAP_DISJOINT))
2127 FL_SET(flags, ISL_MAP_DISJOINT);
2129 map = isl_map_alloc(ctx, map1->nparam, map1->n_in, map1->n_out,
2130 map1->n + map2->n, flags);
2133 for (i = 0; i < map1->n; ++i) {
2134 map = isl_map_add(ctx, map,
2135 isl_basic_map_copy(ctx, map1->p[i]));
2139 for (i = 0; i < map2->n; ++i) {
2140 map = isl_map_add(ctx, map,
2141 isl_basic_map_copy(ctx, map2->p[i]));
2145 isl_map_free(ctx, map1);
2146 isl_map_free(ctx, map2);
2149 isl_map_free(ctx, map);
2150 isl_map_free(ctx, map1);
2151 isl_map_free(ctx, map2);
2155 struct isl_map *isl_map_union(struct isl_ctx *ctx,
2156 struct isl_map *map1, struct isl_map *map2)
2158 map1 = isl_map_union_disjoint(ctx, map1, map2);
2162 F_CLR(map1, ISL_MAP_DISJOINT);
2166 struct isl_set *isl_set_union_disjoint(struct isl_ctx *ctx,
2167 struct isl_set *set1, struct isl_set *set2)
2169 return (struct isl_set *)
2170 isl_map_union_disjoint(ctx,
2171 (struct isl_map *)set1, (struct isl_map *)set2);
2174 struct isl_set *isl_set_union(struct isl_ctx *ctx,
2175 struct isl_set *set1, struct isl_set *set2)
2177 return (struct isl_set *)
2179 (struct isl_map *)set1, (struct isl_map *)set2);
2182 struct isl_map *isl_map_intersect_range(
2183 struct isl_ctx *ctx, struct isl_map *map,
2184 struct isl_set *set)
2187 struct isl_map *result;
2193 if (F_ISSET(map, ISL_MAP_DISJOINT) &&
2194 F_ISSET(set, ISL_MAP_DISJOINT))
2195 FL_SET(flags, ISL_MAP_DISJOINT);
2197 result = isl_map_alloc(ctx, map->nparam, map->n_in, map->n_out,
2198 map->n * set->n, flags);
2201 for (i = 0; i < map->n; ++i)
2202 for (j = 0; j < set->n; ++j) {
2203 result = isl_map_add(ctx, result,
2204 isl_basic_map_intersect_range(ctx,
2205 isl_basic_map_copy(ctx, map->p[i]),
2206 isl_basic_set_copy(ctx, set->p[j])));
2210 isl_map_free(ctx, map);
2211 isl_set_free(ctx, set);
2214 isl_map_free(ctx, map);
2215 isl_set_free(ctx, set);
2219 struct isl_map *isl_map_intersect_domain(
2220 struct isl_ctx *ctx, struct isl_map *map,
2221 struct isl_set *set)
2223 return isl_map_reverse(ctx,
2224 isl_map_intersect_range(ctx, isl_map_reverse(ctx, map), set));
2227 struct isl_map *isl_map_apply_domain(
2228 struct isl_ctx *ctx, struct isl_map *map1,
2229 struct isl_map *map2)
2233 map1 = isl_map_reverse(ctx, map1);
2234 map1 = isl_map_apply_range(ctx, map1, map2);
2235 return isl_map_reverse(ctx, map1);
2237 isl_map_free(ctx, map1);
2238 isl_map_free(ctx, map2);
2242 struct isl_map *isl_map_apply_range(
2243 struct isl_ctx *ctx, struct isl_map *map1,
2244 struct isl_map *map2)
2246 struct isl_map *result;
2252 isl_assert(ctx, map1->nparam == map2->nparam, goto error);
2253 isl_assert(ctx, map1->n_out == map2->n_in, goto error);
2255 result = isl_map_alloc(ctx, map1->nparam, map1->n_in, map2->n_out,
2256 map1->n * map2->n, 0);
2259 for (i = 0; i < map1->n; ++i)
2260 for (j = 0; j < map2->n; ++j) {
2261 result = isl_map_add(ctx, result,
2262 isl_basic_map_apply_range(ctx,
2263 isl_basic_map_copy(ctx, map1->p[i]),
2264 isl_basic_map_copy(ctx, map2->p[j])));
2268 isl_map_free(ctx, map1);
2269 isl_map_free(ctx, map2);
2272 isl_map_free(ctx, map1);
2273 isl_map_free(ctx, map2);
2278 * returns range - domain
2280 struct isl_basic_set *isl_basic_map_deltas(struct isl_ctx *ctx,
2281 struct isl_basic_map *bmap)
2283 struct isl_basic_set *bset;
2289 isl_assert(ctx, bmap->n_in == bmap->n_out, goto error);
2291 bset = isl_basic_set_from_basic_map(ctx, bmap);
2292 bset = isl_basic_set_extend(ctx, bset, bset->nparam, 3*dim, 0,
2294 bset = isl_basic_set_swap_vars(ctx, bset, 2*dim);
2295 for (i = 0; i < dim; ++i) {
2296 int j = isl_basic_map_alloc_equality(ctx,
2297 (struct isl_basic_map *)bset);
2300 isl_int_set_si(bset->eq[j][1+bset->nparam+i], 1);
2301 isl_int_set_si(bset->eq[j][1+bset->nparam+dim+i], 1);
2302 isl_int_set_si(bset->eq[j][1+bset->nparam+2*dim+i], -1);
2304 return isl_basic_set_project_out(ctx, bset, 2*dim, 0);
2306 isl_basic_map_free(ctx, bmap);
2310 /* If the only constraints a div d=floor(f/m)
2311 * appears in are its two defining constraints
2314 * -(f - (m - 1)) + m d >= 0
2316 * then it can safely be removed.
2318 static int div_is_redundant(struct isl_ctx *ctx, struct isl_basic_map *bmap,
2322 unsigned pos = 1 + bmap->nparam + bmap->n_in + bmap->n_out + div;
2324 for (i = 0; i < bmap->n_eq; ++i)
2325 if (!isl_int_is_zero(bmap->eq[i][pos]))
2328 for (i = 0; i < bmap->n_ineq; ++i) {
2329 if (isl_int_is_zero(bmap->ineq[i][pos]))
2331 if (isl_int_eq(bmap->ineq[i][pos], bmap->div[div][0])) {
2333 isl_int_sub(bmap->div[div][1],
2334 bmap->div[div][1], bmap->div[div][0]);
2335 isl_int_add_ui(bmap->div[div][1], bmap->div[div][1], 1);
2336 neg = isl_seq_is_neg(bmap->ineq[i], bmap->div[div]+1, pos);
2337 isl_int_sub_ui(bmap->div[div][1], bmap->div[div][1], 1);
2338 isl_int_add(bmap->div[div][1],
2339 bmap->div[div][1], bmap->div[div][0]);
2342 if (isl_seq_first_non_zero(bmap->ineq[i]+pos+1,
2343 bmap->n_div-div-1) != -1)
2345 } else if (isl_int_abs_eq(bmap->ineq[i][pos], bmap->div[div][0])) {
2346 if (!isl_seq_eq(bmap->ineq[i], bmap->div[div]+1, pos))
2348 if (isl_seq_first_non_zero(bmap->ineq[i]+pos+1,
2349 bmap->n_div-div-1) != -1)
2355 for (i = 0; i < bmap->n_div; ++i)
2356 if (!isl_int_is_zero(bmap->div[i][1+pos]))
2363 * Remove divs that don't occur in any of the constraints or other divs.
2364 * These can arise when dropping some of the variables in a quast
2365 * returned by piplib.
2367 static struct isl_basic_map *remove_redundant_divs(struct isl_ctx *ctx,
2368 struct isl_basic_map *bmap)
2372 for (i = bmap->n_div-1; i >= 0; --i) {
2373 if (!div_is_redundant(ctx, bmap, i))
2375 bmap = isl_basic_map_drop_div(ctx, bmap, i);
2380 struct isl_basic_map *isl_basic_map_finalize(struct isl_ctx *ctx,
2381 struct isl_basic_map *bmap)
2383 bmap = remove_redundant_divs(ctx, bmap);
2386 F_SET(bmap, ISL_BASIC_SET_FINAL);
2390 struct isl_basic_set *isl_basic_set_finalize(struct isl_ctx *ctx,
2391 struct isl_basic_set *bset)
2393 return (struct isl_basic_set *)
2394 isl_basic_map_finalize(ctx,
2395 (struct isl_basic_map *)bset);
2398 struct isl_set *isl_set_finalize(struct isl_ctx *ctx, struct isl_set *set)
2404 for (i = 0; i < set->n; ++i) {
2405 set->p[i] = isl_basic_set_finalize(ctx, set->p[i]);
2411 isl_set_free(ctx, set);
2415 struct isl_map *isl_map_finalize(struct isl_ctx *ctx, struct isl_map *map)
2421 for (i = 0; i < map->n; ++i) {
2422 map->p[i] = isl_basic_map_finalize(ctx, map->p[i]);
2428 isl_map_free(ctx, map);
2432 struct isl_basic_map *isl_basic_map_identity(struct isl_ctx *ctx,
2433 unsigned nparam, unsigned dim)
2435 struct isl_basic_map *bmap;
2438 bmap = isl_basic_map_alloc(ctx, nparam, dim, dim, 0, dim, 0);
2442 for (i = 0; i < dim; ++i) {
2443 int j = isl_basic_map_alloc_equality(ctx, bmap);
2446 isl_int_set_si(bmap->eq[j][1+nparam+i], 1);
2447 isl_int_set_si(bmap->eq[j][1+nparam+dim+i], -1);
2449 return isl_basic_map_finalize(ctx, bmap);
2451 isl_basic_map_free(ctx, bmap);
2455 struct isl_map *isl_map_identity(struct isl_ctx *ctx,
2456 unsigned nparam, unsigned dim)
2458 struct isl_map *map = isl_map_alloc(ctx, nparam, dim, dim, 1,
2462 map = isl_map_add(ctx, map,
2463 isl_basic_map_identity(ctx, nparam, dim));
2466 isl_map_free(ctx, map);
2470 int isl_set_is_equal(struct isl_ctx *ctx,
2471 struct isl_set *set1, struct isl_set *set2)
2473 return isl_map_is_equal(ctx,
2474 (struct isl_map *)set1, (struct isl_map *)set2);
2477 int isl_set_is_subset(struct isl_ctx *ctx,
2478 struct isl_set *set1, struct isl_set *set2)
2480 return isl_map_is_subset(ctx,
2481 (struct isl_map *)set1, (struct isl_map *)set2);
2484 int isl_basic_map_is_subset(struct isl_ctx *ctx,
2485 struct isl_basic_map *bmap1,
2486 struct isl_basic_map *bmap2)
2489 struct isl_map *map1;
2490 struct isl_map *map2;
2492 if (!bmap1 || !bmap2)
2495 map1 = isl_map_from_basic_map(ctx,
2496 isl_basic_map_copy(ctx, bmap1));
2497 map2 = isl_map_from_basic_map(ctx,
2498 isl_basic_map_copy(ctx, bmap2));
2500 is_subset = isl_map_is_subset(ctx, map1, map2);
2502 isl_map_free(ctx, map1);
2503 isl_map_free(ctx, map2);
2508 int isl_map_is_empty(struct isl_ctx *ctx, struct isl_map *map)
2515 for (i = 0; i < map->n; ++i) {
2516 is_empty = isl_basic_map_is_empty(ctx, map->p[i]);
2525 int isl_set_is_empty(struct isl_ctx *ctx, struct isl_set *set)
2527 return isl_map_is_empty(ctx, (struct isl_map *)set);
2530 int isl_map_is_subset(struct isl_ctx *ctx, struct isl_map *map1,
2531 struct isl_map *map2)
2535 struct isl_map *diff;
2540 if (isl_map_is_empty(ctx, map1))
2543 if (isl_map_is_empty(ctx, map2))
2546 diff = isl_map_subtract(ctx, isl_map_copy(ctx, map1),
2547 isl_map_copy(ctx, map2));
2551 is_subset = isl_map_is_empty(ctx, diff);
2552 isl_map_free(ctx, diff);
2557 int isl_map_is_equal(struct isl_ctx *ctx,
2558 struct isl_map *map1, struct isl_map *map2)
2564 is_subset = isl_map_is_subset(ctx, map1, map2);
2567 is_subset = isl_map_is_subset(ctx, map2, map1);
2571 int isl_basic_map_is_strict_subset(struct isl_ctx *ctx,
2572 struct isl_basic_map *bmap1,
2573 struct isl_basic_map *bmap2)
2577 if (!bmap1 || !bmap2)
2579 is_subset = isl_basic_map_is_subset(ctx, bmap1, bmap2);
2582 is_subset = isl_basic_map_is_subset(ctx, bmap2, bmap1);
2583 if (is_subset == -1)
2588 static int basic_map_contains(struct isl_ctx *ctx, struct isl_basic_map *bmap,
2589 struct isl_vec *vec)
2595 total = 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
2596 if (total != vec->size)
2601 for (i = 0; i < bmap->n_eq; ++i) {
2602 isl_seq_inner_product(vec->block.data, bmap->eq[i], total, &s);
2603 if (!isl_int_is_zero(s)) {
2609 for (i = 0; i < bmap->n_ineq; ++i) {
2610 isl_seq_inner_product(vec->block.data, bmap->ineq[i], total, &s);
2611 if (isl_int_is_neg(s)) {
2622 int isl_basic_map_is_empty(struct isl_ctx *ctx,
2623 struct isl_basic_map *bmap)
2625 struct isl_basic_set *bset = NULL;
2626 struct isl_vec *sample = NULL;
2633 if (F_ISSET(bmap, ISL_BASIC_MAP_EMPTY))
2636 total = 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
2637 if (bmap->sample && bmap->sample->size == total) {
2638 int contains = basic_map_contains(ctx, bmap, bmap->sample);
2644 bset = isl_basic_map_underlying_set(ctx,
2645 isl_basic_map_copy(ctx, bmap));
2648 sample = isl_basic_set_sample(ctx, bset);
2651 empty = sample->size == 0;
2653 isl_vec_free(ctx, bmap->sample);
2654 bmap->sample = sample;
2659 struct isl_map *isl_basic_map_union(
2660 struct isl_ctx *ctx, struct isl_basic_map *bmap1,
2661 struct isl_basic_map *bmap2)
2663 struct isl_map *map;
2664 if (!bmap1 || !bmap2)
2667 isl_assert(ctx, bmap1->nparam == bmap2->nparam, goto error);
2668 isl_assert(ctx, bmap1->n_in == bmap2->n_in, goto error);
2669 isl_assert(ctx, bmap1->n_out == bmap2->n_out, goto error);
2671 map = isl_map_alloc(ctx, bmap1->nparam,
2672 bmap1->n_in, bmap1->n_out, 2, 0);
2675 map = isl_map_add(ctx, map, bmap1);
2676 map = isl_map_add(ctx, map, bmap2);
2679 isl_basic_map_free(ctx, bmap1);
2680 isl_basic_map_free(ctx, bmap2);
2684 struct isl_set *isl_basic_set_union(
2685 struct isl_ctx *ctx, struct isl_basic_set *bset1,
2686 struct isl_basic_set *bset2)
2688 return (struct isl_set *)isl_basic_map_union(ctx,
2689 (struct isl_basic_map *)bset1,
2690 (struct isl_basic_map *)bset2);
2693 /* Order divs such that any div only depends on previous divs */
2694 static struct isl_basic_map *order_divs(struct isl_ctx *ctx,
2695 struct isl_basic_map *bmap)
2698 unsigned off = bmap->nparam + bmap->n_in + bmap->n_out;
2700 for (i = 0; i < bmap->n_div; ++i) {
2702 pos = isl_seq_first_non_zero(bmap->div[i]+1+1+off+i,
2706 swap_div(bmap, i, pos);
2712 static int find_div(struct isl_basic_map *dst,
2713 struct isl_basic_map *src, unsigned div)
2717 unsigned total = src->nparam + src->n_in + src->n_out + src->n_div;
2719 for (i = 0; i < dst->n_div; ++i)
2720 if (isl_seq_eq(dst->div[i], src->div[div], 1+1+total) &&
2721 isl_seq_first_non_zero(dst->div[i]+1+1+total,
2722 dst->n_div - src->n_div) == -1)
2727 /* For a div d = floor(f/m), add the constraints
2730 * -(f-(n-1)) + m d >= 0
2732 * Note that the second constraint is the negation of
2736 static int add_div_constraints(struct isl_ctx *ctx,
2737 struct isl_basic_map *bmap, unsigned div)
2740 unsigned div_pos = 1 + bmap->nparam + bmap->n_in + bmap->n_out + div;
2741 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
2743 i = isl_basic_map_alloc_inequality(ctx, bmap);
2746 isl_seq_cpy(bmap->ineq[i], bmap->div[div]+1, 1+total);
2747 isl_int_neg(bmap->ineq[i][div_pos], bmap->div[div][0]);
2749 j = isl_basic_map_alloc_inequality(ctx, bmap);
2752 isl_seq_neg(bmap->ineq[j], bmap->ineq[i], 1 + total);
2753 isl_int_add(bmap->ineq[j][0], bmap->ineq[j][0], bmap->ineq[j][div_pos]);
2754 isl_int_sub_ui(bmap->ineq[j][0], bmap->ineq[j][0], 1);
2758 struct isl_basic_map *isl_basic_map_align_divs(struct isl_ctx *ctx,
2759 struct isl_basic_map *dst, struct isl_basic_map *src)
2762 unsigned total = src->nparam + src->n_in + src->n_out + src->n_div;
2764 if (src->n_div == 0)
2767 src = order_divs(ctx, src);
2768 dst = isl_basic_map_extend(ctx, dst, dst->nparam, dst->n_in,
2769 dst->n_out, src->n_div, 0, 2 * src->n_div);
2772 for (i = 0; i < src->n_div; ++i) {
2773 int j = find_div(dst, src, i);
2775 j = isl_basic_map_alloc_div(ctx, dst);
2778 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total);
2779 if (add_div_constraints(ctx, dst, j) < 0)
2783 swap_div(dst, i, j);
2787 isl_basic_map_free(ctx, dst);
2791 static struct isl_map *add_cut_constraint(struct isl_ctx *ctx,
2792 struct isl_map *dst,
2793 struct isl_basic_map *src, isl_int *c,
2794 unsigned len, unsigned extra, int oppose)
2796 struct isl_basic_map *copy = NULL;
2800 copy = isl_basic_map_copy(ctx, src);
2801 copy = isl_basic_map_cow(ctx, copy);
2804 copy = isl_basic_map_extend(ctx, copy,
2805 copy->nparam, copy->n_in, copy->n_out, 0, 0, 1);
2806 k = isl_basic_map_alloc_inequality(ctx, copy);
2810 isl_seq_neg(copy->ineq[k], c, len);
2812 isl_seq_cpy(copy->ineq[k], c, len);
2813 isl_seq_clr(copy->ineq[k]+len, extra);
2814 isl_inequality_negate(ctx, copy, k);
2815 copy = isl_basic_map_simplify(ctx, copy);
2816 copy = isl_basic_map_finalize(ctx, copy);
2817 is_empty = isl_basic_map_is_empty(ctx, copy);
2821 dst = isl_map_add(ctx, dst, copy);
2823 isl_basic_map_free(ctx, copy);
2826 isl_basic_map_free(ctx, copy);
2827 isl_map_free(ctx, dst);
2831 static struct isl_map *subtract(struct isl_ctx *ctx, struct isl_map *map,
2832 struct isl_basic_map *bmap)
2836 struct isl_map *rest = NULL;
2838 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
2845 if (F_ISSET(map, ISL_MAP_DISJOINT))
2846 FL_SET(flags, ISL_MAP_DISJOINT);
2848 max = map->n * (2 * bmap->n_eq + bmap->n_ineq);
2849 rest = isl_map_alloc(ctx, map->nparam, map->n_in, map->n_out,
2854 for (i = 0; i < map->n; ++i) {
2855 map->p[i] = isl_basic_map_align_divs(ctx, map->p[i], bmap);
2860 for (j = 0; j < map->n; ++j)
2861 map->p[j] = isl_basic_map_cow(ctx, map->p[j]);
2863 for (i = 0; i < bmap->n_eq; ++i) {
2864 for (j = 0; j < map->n; ++j) {
2865 rest = add_cut_constraint(ctx, rest,
2866 map->p[j], bmap->eq[i],
2867 1+total, map->p[j]->n_div - bmap->n_div, 0);
2871 rest = add_cut_constraint(ctx, rest,
2872 map->p[j], bmap->eq[i],
2873 1+total, map->p[j]->n_div - bmap->n_div, 1);
2877 map->p[j] = isl_basic_map_extend(ctx, map->p[j],
2878 map->p[j]->nparam, map->p[j]->n_in,
2879 map->p[j]->n_out, 0, 1, 0);
2882 k = isl_basic_map_alloc_equality(ctx, map->p[j]);
2885 isl_seq_cpy(map->p[j]->eq[k], bmap->eq[i], 1+total);
2886 isl_seq_clr(map->p[j]->eq[k]+1+total,
2887 map->p[j]->n_div - bmap->n_div);
2891 for (i = 0; i < bmap->n_ineq; ++i) {
2892 for (j = 0; j < map->n; ++j) {
2893 rest = add_cut_constraint(ctx, rest,
2894 map->p[j], bmap->ineq[i],
2895 1+total, map->p[j]->n_div - bmap->n_div, 0);
2899 map->p[j] = isl_basic_map_extend(ctx, map->p[j],
2900 map->p[j]->nparam, map->p[j]->n_in,
2901 map->p[j]->n_out, 0, 0, 1);
2904 k = isl_basic_map_alloc_inequality(ctx, map->p[j]);
2907 isl_seq_cpy(map->p[j]->ineq[k], bmap->ineq[i], 1+total);
2908 isl_seq_clr(map->p[j]->ineq[k]+1+total,
2909 map->p[j]->n_div - bmap->n_div);
2913 isl_map_free(ctx, map);
2916 isl_map_free(ctx, map);
2917 isl_map_free(ctx, rest);
2921 struct isl_map *isl_map_subtract(struct isl_ctx *ctx, struct isl_map *map1,
2922 struct isl_map *map2)
2928 isl_assert(ctx, map1->nparam == map2->nparam, goto error);
2929 isl_assert(ctx, map1->n_in == map2->n_in, goto error);
2930 isl_assert(ctx, map1->n_out == map2->n_out, goto error);
2932 if (isl_map_is_empty(ctx, map2)) {
2933 isl_map_free(ctx, map2);
2937 map1 = isl_map_compute_divs(ctx, map1);
2938 map2 = isl_map_compute_divs(ctx, map2);
2942 for (i = 0; map1 && i < map2->n; ++i)
2943 map1 = subtract(ctx, map1, map2->p[i]);
2945 isl_map_free(ctx, map2);
2948 isl_map_free(ctx, map1);
2949 isl_map_free(ctx, map2);
2953 struct isl_set *isl_set_subtract(struct isl_ctx *ctx, struct isl_set *set1,
2954 struct isl_set *set2)
2956 return (struct isl_set *)
2957 isl_map_subtract(ctx,
2958 (struct isl_map *)set1, (struct isl_map *)set2);
2961 struct isl_set *isl_set_apply(struct isl_ctx *ctx, struct isl_set *set,
2962 struct isl_map *map)
2964 isl_assert(ctx, set->dim == map->n_in, goto error);
2965 map = isl_map_intersect_domain(ctx, map, set);
2966 set = isl_map_range(ctx, map);
2969 isl_set_free(ctx, set);
2970 isl_map_free(ctx, map);