2 * Copyright 2008-2009 Katholieke Universiteit Leuven
3 * Copyright 2010 INRIA Saclay
5 * Use of this software is governed by the GNU LGPLv2.1 license
7 * Written by Sven Verdoolaege, K.U.Leuven, Departement
8 * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium
9 * and INRIA Saclay - Ile-de-France, Parc Club Orsay Universite,
10 * ZAC des vignes, 4 rue Jacques Monod, 91893 Orsay, France
15 #include <isl_ctx_private.h>
16 #include <isl_map_private.h>
18 #include "isl_dim_private.h"
19 #include "isl_equalities.h"
25 #include "isl_map_piplib.h"
26 #include <isl_reordering.h>
27 #include "isl_sample.h"
30 #include <isl_mat_private.h>
31 #include <isl_dim_map.h>
33 static unsigned n(struct isl_dim *dim, enum isl_dim_type type)
36 case isl_dim_param: return dim->nparam;
37 case isl_dim_in: return dim->n_in;
38 case isl_dim_out: return dim->n_out;
39 case isl_dim_all: return dim->nparam + dim->n_in + dim->n_out;
44 static unsigned pos(struct isl_dim *dim, enum isl_dim_type type)
47 case isl_dim_param: return 1;
48 case isl_dim_in: return 1 + dim->nparam;
49 case isl_dim_out: return 1 + dim->nparam + dim->n_in;
54 unsigned isl_basic_map_dim(const struct isl_basic_map *bmap,
55 enum isl_dim_type type)
60 case isl_dim_cst: return 1;
63 case isl_dim_out: return isl_dim_size(bmap->dim, type);
64 case isl_dim_div: return bmap->n_div;
65 case isl_dim_all: return isl_basic_map_total_dim(bmap);
70 unsigned isl_map_dim(const struct isl_map *map, enum isl_dim_type type)
72 return map ? n(map->dim, type) : 0;
75 unsigned isl_set_dim(const struct isl_set *set, enum isl_dim_type type)
77 return set ? n(set->dim, type) : 0;
80 unsigned isl_basic_map_offset(struct isl_basic_map *bmap,
81 enum isl_dim_type type)
83 struct isl_dim *dim = bmap->dim;
85 case isl_dim_cst: return 0;
86 case isl_dim_param: return 1;
87 case isl_dim_in: return 1 + dim->nparam;
88 case isl_dim_out: return 1 + dim->nparam + dim->n_in;
89 case isl_dim_div: return 1 + dim->nparam + dim->n_in + dim->n_out;
94 static unsigned map_offset(struct isl_map *map, enum isl_dim_type type)
96 return pos(map->dim, type);
99 unsigned isl_basic_set_dim(const struct isl_basic_set *bset,
100 enum isl_dim_type type)
102 return isl_basic_map_dim((const struct isl_basic_map*)bset, type);
105 unsigned isl_basic_set_n_dim(const struct isl_basic_set *bset)
107 return isl_basic_set_dim(bset, isl_dim_set);
110 unsigned isl_basic_set_n_param(const struct isl_basic_set *bset)
112 return isl_basic_set_dim(bset, isl_dim_param);
115 unsigned isl_basic_set_total_dim(const struct isl_basic_set *bset)
117 return isl_dim_total(bset->dim) + bset->n_div;
120 unsigned isl_set_n_dim(const struct isl_set *set)
122 return isl_set_dim(set, isl_dim_set);
125 unsigned isl_set_n_param(const struct isl_set *set)
127 return isl_set_dim(set, isl_dim_param);
130 unsigned isl_basic_map_n_in(const struct isl_basic_map *bmap)
132 return bmap ? bmap->dim->n_in : 0;
135 unsigned isl_basic_map_n_out(const struct isl_basic_map *bmap)
137 return bmap ? bmap->dim->n_out : 0;
140 unsigned isl_basic_map_n_param(const struct isl_basic_map *bmap)
142 return bmap ? bmap->dim->nparam : 0;
145 unsigned isl_basic_map_n_div(const struct isl_basic_map *bmap)
147 return bmap ? bmap->n_div : 0;
150 unsigned isl_basic_map_total_dim(const struct isl_basic_map *bmap)
152 return bmap ? isl_dim_total(bmap->dim) + bmap->n_div : 0;
155 unsigned isl_map_n_in(const struct isl_map *map)
157 return map->dim->n_in;
160 unsigned isl_map_n_out(const struct isl_map *map)
162 return map->dim->n_out;
165 unsigned isl_map_n_param(const struct isl_map *map)
167 return map->dim->nparam;
170 int isl_map_compatible_domain(struct isl_map *map, struct isl_set *set)
175 m = isl_dim_match(map->dim, isl_dim_param, set->dim, isl_dim_param);
178 return isl_dim_tuple_match(map->dim, isl_dim_in, set->dim, isl_dim_set);
181 int isl_basic_map_compatible_domain(struct isl_basic_map *bmap,
182 struct isl_basic_set *bset)
187 m = isl_dim_match(bmap->dim, isl_dim_param, bset->dim, isl_dim_param);
190 return isl_dim_tuple_match(bmap->dim, isl_dim_in, bset->dim, isl_dim_set);
193 int isl_basic_map_compatible_range(struct isl_basic_map *bmap,
194 struct isl_basic_set *bset)
199 m = isl_dim_match(bmap->dim, isl_dim_param, bset->dim, isl_dim_param);
202 return isl_dim_tuple_match(bmap->dim, isl_dim_out, bset->dim, isl_dim_set);
205 isl_ctx *isl_basic_map_get_ctx(__isl_keep isl_basic_map *bmap)
207 return bmap ? bmap->ctx : NULL;
210 isl_ctx *isl_basic_set_get_ctx(__isl_keep isl_basic_set *bset)
212 return bset ? bset->ctx : NULL;
215 isl_ctx *isl_map_get_ctx(__isl_keep isl_map *map)
217 return map ? map->ctx : NULL;
220 isl_ctx *isl_set_get_ctx(__isl_keep isl_set *set)
222 return set ? set->ctx : NULL;
225 struct isl_dim *isl_basic_map_get_dim(struct isl_basic_map *bmap)
229 return isl_dim_copy(bmap->dim);
232 struct isl_dim *isl_basic_set_get_dim(struct isl_basic_set *bset)
236 return isl_dim_copy(bset->dim);
239 struct isl_dim *isl_map_get_dim(struct isl_map *map)
243 return isl_dim_copy(map->dim);
246 struct isl_dim *isl_set_get_dim(struct isl_set *set)
250 return isl_dim_copy(set->dim);
253 __isl_give isl_basic_map *isl_basic_map_set_tuple_name(
254 __isl_take isl_basic_map *bmap, enum isl_dim_type type, const char *s)
256 bmap = isl_basic_map_cow(bmap);
259 bmap->dim = isl_dim_set_tuple_name(bmap->dim, type, s);
262 bmap = isl_basic_map_finalize(bmap);
265 isl_basic_map_free(bmap);
269 const char *isl_basic_map_get_tuple_name(__isl_keep isl_basic_map *bmap,
270 enum isl_dim_type type)
272 return bmap ? isl_dim_get_tuple_name(bmap->dim, type) : NULL;
275 __isl_give isl_map *isl_map_set_tuple_name(__isl_take isl_map *map,
276 enum isl_dim_type type, const char *s)
280 map = isl_map_cow(map);
284 map->dim = isl_dim_set_tuple_name(map->dim, type, s);
288 for (i = 0; i < map->n; ++i) {
289 map->p[i] = isl_basic_map_set_tuple_name(map->p[i], type, s);
300 const char *isl_map_get_tuple_name(__isl_keep isl_map *map,
301 enum isl_dim_type type)
303 return map ? isl_dim_get_tuple_name(map->dim, type) : NULL;
306 __isl_give isl_set *isl_set_set_tuple_name(__isl_take isl_set *set,
309 return (isl_set *)isl_map_set_tuple_name((isl_map *)set, isl_dim_set, s);
312 const char *isl_basic_set_get_tuple_name(__isl_keep isl_basic_set *bset)
314 return bset ? isl_dim_get_tuple_name(bset->dim, isl_dim_set) : NULL;
317 const char *isl_set_get_tuple_name(__isl_keep isl_set *set)
319 return set ? isl_dim_get_tuple_name(set->dim, isl_dim_set) : NULL;
322 const char *isl_basic_map_get_dim_name(__isl_keep isl_basic_map *bmap,
323 enum isl_dim_type type, unsigned pos)
325 return bmap ? isl_dim_get_name(bmap->dim, type, pos) : NULL;
328 const char *isl_basic_set_get_dim_name(__isl_keep isl_basic_set *bset,
329 enum isl_dim_type type, unsigned pos)
331 return bset ? isl_dim_get_name(bset->dim, type, pos) : NULL;
334 const char *isl_map_get_dim_name(__isl_keep isl_map *map,
335 enum isl_dim_type type, unsigned pos)
337 return map ? isl_dim_get_name(map->dim, type, pos) : NULL;
340 const char *isl_set_get_dim_name(__isl_keep isl_set *set,
341 enum isl_dim_type type, unsigned pos)
343 return set ? isl_dim_get_name(set->dim, type, pos) : NULL;
346 __isl_give isl_basic_map *isl_basic_map_set_dim_name(
347 __isl_take isl_basic_map *bmap,
348 enum isl_dim_type type, unsigned pos, const char *s)
352 bmap->dim = isl_dim_set_name(bmap->dim, type, pos, s);
357 isl_basic_map_free(bmap);
361 __isl_give isl_map *isl_map_set_dim_name(__isl_take isl_map *map,
362 enum isl_dim_type type, unsigned pos, const char *s)
369 map->dim = isl_dim_set_name(map->dim, type, pos, s);
373 for (i = 0; i < map->n; ++i) {
374 map->p[i] = isl_basic_map_set_dim_name(map->p[i], type, pos, s);
385 __isl_give isl_basic_set *isl_basic_set_set_dim_name(
386 __isl_take isl_basic_set *bset,
387 enum isl_dim_type type, unsigned pos, const char *s)
389 return (isl_basic_set *)isl_basic_map_set_dim_name(
390 (isl_basic_map *)bset, type, pos, s);
393 __isl_give isl_set *isl_set_set_dim_name(__isl_take isl_set *set,
394 enum isl_dim_type type, unsigned pos, const char *s)
396 return (isl_set *)isl_map_set_dim_name((isl_map *)set, type, pos, s);
399 int isl_basic_map_is_rational(__isl_keep isl_basic_map *bmap)
403 return ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL);
406 int isl_basic_set_is_rational(__isl_keep isl_basic_set *bset)
408 return isl_basic_map_is_rational(bset);
411 static struct isl_basic_map *basic_map_init(struct isl_ctx *ctx,
412 struct isl_basic_map *bmap, unsigned extra,
413 unsigned n_eq, unsigned n_ineq)
416 size_t row_size = 1 + isl_dim_total(bmap->dim) + extra;
421 bmap->block = isl_blk_alloc(ctx, (n_ineq + n_eq) * row_size);
422 if (isl_blk_is_error(bmap->block))
425 bmap->ineq = isl_alloc_array(ctx, isl_int *, n_ineq + n_eq);
430 bmap->block2 = isl_blk_empty();
433 bmap->block2 = isl_blk_alloc(ctx, extra * (1 + row_size));
434 if (isl_blk_is_error(bmap->block2))
437 bmap->div = isl_alloc_array(ctx, isl_int *, extra);
442 for (i = 0; i < n_ineq + n_eq; ++i)
443 bmap->ineq[i] = bmap->block.data + i * row_size;
445 for (i = 0; i < extra; ++i)
446 bmap->div[i] = bmap->block2.data + i * (1 + row_size);
450 bmap->c_size = n_eq + n_ineq;
451 bmap->eq = bmap->ineq + n_ineq;
460 isl_basic_map_free(bmap);
464 struct isl_basic_set *isl_basic_set_alloc(struct isl_ctx *ctx,
465 unsigned nparam, unsigned dim, unsigned extra,
466 unsigned n_eq, unsigned n_ineq)
468 struct isl_basic_map *bmap;
469 bmap = isl_basic_map_alloc(ctx, nparam, 0, dim, extra, n_eq, n_ineq);
470 return (struct isl_basic_set *)bmap;
473 struct isl_basic_set *isl_basic_set_alloc_dim(struct isl_dim *dim,
474 unsigned extra, unsigned n_eq, unsigned n_ineq)
476 struct isl_basic_map *bmap;
479 isl_assert(dim->ctx, dim->n_in == 0, goto error);
480 bmap = isl_basic_map_alloc_dim(dim, extra, n_eq, n_ineq);
481 return (struct isl_basic_set *)bmap;
487 struct isl_basic_map *isl_basic_map_alloc_dim(struct isl_dim *dim,
488 unsigned extra, unsigned n_eq, unsigned n_ineq)
490 struct isl_basic_map *bmap;
494 bmap = isl_calloc_type(dim->ctx, struct isl_basic_map);
499 return basic_map_init(dim->ctx, bmap, extra, n_eq, n_ineq);
505 struct isl_basic_map *isl_basic_map_alloc(struct isl_ctx *ctx,
506 unsigned nparam, unsigned in, unsigned out, unsigned extra,
507 unsigned n_eq, unsigned n_ineq)
509 struct isl_basic_map *bmap;
512 dim = isl_dim_alloc(ctx, nparam, in, out);
516 bmap = isl_basic_map_alloc_dim(dim, extra, n_eq, n_ineq);
520 static void dup_constraints(
521 struct isl_basic_map *dst, struct isl_basic_map *src)
524 unsigned total = isl_basic_map_total_dim(src);
526 for (i = 0; i < src->n_eq; ++i) {
527 int j = isl_basic_map_alloc_equality(dst);
528 isl_seq_cpy(dst->eq[j], src->eq[i], 1+total);
531 for (i = 0; i < src->n_ineq; ++i) {
532 int j = isl_basic_map_alloc_inequality(dst);
533 isl_seq_cpy(dst->ineq[j], src->ineq[i], 1+total);
536 for (i = 0; i < src->n_div; ++i) {
537 int j = isl_basic_map_alloc_div(dst);
538 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total);
540 ISL_F_SET(dst, ISL_BASIC_SET_FINAL);
543 struct isl_basic_map *isl_basic_map_dup(struct isl_basic_map *bmap)
545 struct isl_basic_map *dup;
549 dup = isl_basic_map_alloc_dim(isl_dim_copy(bmap->dim),
550 bmap->n_div, bmap->n_eq, bmap->n_ineq);
553 dup_constraints(dup, bmap);
554 dup->flags = bmap->flags;
555 dup->sample = isl_vec_copy(bmap->sample);
559 struct isl_basic_set *isl_basic_set_dup(struct isl_basic_set *bset)
561 struct isl_basic_map *dup;
563 dup = isl_basic_map_dup((struct isl_basic_map *)bset);
564 return (struct isl_basic_set *)dup;
567 struct isl_basic_set *isl_basic_set_copy(struct isl_basic_set *bset)
572 if (ISL_F_ISSET(bset, ISL_BASIC_SET_FINAL)) {
576 return isl_basic_set_dup(bset);
579 struct isl_set *isl_set_copy(struct isl_set *set)
588 struct isl_basic_map *isl_basic_map_copy(struct isl_basic_map *bmap)
593 if (ISL_F_ISSET(bmap, ISL_BASIC_SET_FINAL)) {
597 bmap = isl_basic_map_dup(bmap);
599 ISL_F_SET(bmap, ISL_BASIC_SET_FINAL);
603 struct isl_map *isl_map_copy(struct isl_map *map)
612 void isl_basic_map_free(struct isl_basic_map *bmap)
620 isl_ctx_deref(bmap->ctx);
622 isl_blk_free(bmap->ctx, bmap->block2);
624 isl_blk_free(bmap->ctx, bmap->block);
625 isl_vec_free(bmap->sample);
626 isl_dim_free(bmap->dim);
630 void isl_basic_set_free(struct isl_basic_set *bset)
632 isl_basic_map_free((struct isl_basic_map *)bset);
635 static int room_for_con(struct isl_basic_map *bmap, unsigned n)
637 return bmap->n_eq + bmap->n_ineq + n <= bmap->c_size;
640 int isl_basic_map_alloc_equality(struct isl_basic_map *bmap)
646 isl_assert(ctx, room_for_con(bmap, 1), return -1);
647 isl_assert(ctx, (bmap->eq - bmap->ineq) + bmap->n_eq <= bmap->c_size,
649 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
650 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
651 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_IMPLICIT);
652 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
653 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
654 if ((bmap->eq - bmap->ineq) + bmap->n_eq == bmap->c_size) {
656 int j = isl_basic_map_alloc_inequality(bmap);
660 bmap->ineq[j] = bmap->ineq[bmap->n_ineq - 1];
661 bmap->ineq[bmap->n_ineq - 1] = bmap->eq[-1];
668 isl_seq_clr(bmap->eq[bmap->n_eq] + 1 + isl_basic_map_total_dim(bmap),
669 bmap->extra - bmap->n_div);
673 int isl_basic_set_alloc_equality(struct isl_basic_set *bset)
675 return isl_basic_map_alloc_equality((struct isl_basic_map *)bset);
678 int isl_basic_map_free_equality(struct isl_basic_map *bmap, unsigned n)
682 isl_assert(bmap->ctx, n <= bmap->n_eq, return -1);
687 int isl_basic_set_free_equality(struct isl_basic_set *bset, unsigned n)
689 return isl_basic_map_free_equality((struct isl_basic_map *)bset, n);
692 int isl_basic_map_drop_equality(struct isl_basic_map *bmap, unsigned pos)
697 isl_assert(bmap->ctx, pos < bmap->n_eq, return -1);
699 if (pos != bmap->n_eq - 1) {
701 bmap->eq[pos] = bmap->eq[bmap->n_eq - 1];
702 bmap->eq[bmap->n_eq - 1] = t;
708 int isl_basic_set_drop_equality(struct isl_basic_set *bset, unsigned pos)
710 return isl_basic_map_drop_equality((struct isl_basic_map *)bset, pos);
713 void isl_basic_map_inequality_to_equality(
714 struct isl_basic_map *bmap, unsigned pos)
719 bmap->ineq[pos] = bmap->ineq[bmap->n_ineq - 1];
720 bmap->ineq[bmap->n_ineq - 1] = bmap->eq[-1];
725 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
726 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
727 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
728 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
731 static int room_for_ineq(struct isl_basic_map *bmap, unsigned n)
733 return bmap->n_ineq + n <= bmap->eq - bmap->ineq;
736 int isl_basic_map_alloc_inequality(struct isl_basic_map *bmap)
742 isl_assert(ctx, room_for_ineq(bmap, 1), return -1);
743 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_IMPLICIT);
744 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
745 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
746 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
747 isl_seq_clr(bmap->ineq[bmap->n_ineq] +
748 1 + isl_basic_map_total_dim(bmap),
749 bmap->extra - bmap->n_div);
750 return bmap->n_ineq++;
753 int isl_basic_set_alloc_inequality(struct isl_basic_set *bset)
755 return isl_basic_map_alloc_inequality((struct isl_basic_map *)bset);
758 int isl_basic_map_free_inequality(struct isl_basic_map *bmap, unsigned n)
762 isl_assert(bmap->ctx, n <= bmap->n_ineq, return -1);
767 int isl_basic_set_free_inequality(struct isl_basic_set *bset, unsigned n)
769 return isl_basic_map_free_inequality((struct isl_basic_map *)bset, n);
772 int isl_basic_map_drop_inequality(struct isl_basic_map *bmap, unsigned pos)
777 isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
779 if (pos != bmap->n_ineq - 1) {
781 bmap->ineq[pos] = bmap->ineq[bmap->n_ineq - 1];
782 bmap->ineq[bmap->n_ineq - 1] = t;
783 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
789 int isl_basic_set_drop_inequality(struct isl_basic_set *bset, unsigned pos)
791 return isl_basic_map_drop_inequality((struct isl_basic_map *)bset, pos);
794 __isl_give isl_basic_map *isl_basic_map_add_eq(__isl_take isl_basic_map *bmap,
799 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
802 k = isl_basic_map_alloc_equality(bmap);
805 isl_seq_cpy(bmap->eq[k], eq, 1 + isl_basic_map_total_dim(bmap));
808 isl_basic_map_free(bmap);
812 __isl_give isl_basic_set *isl_basic_set_add_eq(__isl_take isl_basic_set *bset,
815 return (isl_basic_set *)
816 isl_basic_map_add_eq((isl_basic_map *)bset, eq);
819 __isl_give isl_basic_map *isl_basic_map_add_ineq(__isl_take isl_basic_map *bmap,
824 bmap = isl_basic_map_extend_constraints(bmap, 0, 1);
827 k = isl_basic_map_alloc_inequality(bmap);
830 isl_seq_cpy(bmap->ineq[k], ineq, 1 + isl_basic_map_total_dim(bmap));
833 isl_basic_map_free(bmap);
837 __isl_give isl_basic_set *isl_basic_set_add_ineq(__isl_take isl_basic_set *bset,
840 return (isl_basic_set *)
841 isl_basic_map_add_ineq((isl_basic_map *)bset, ineq);
844 int isl_basic_map_alloc_div(struct isl_basic_map *bmap)
848 isl_assert(bmap->ctx, bmap->n_div < bmap->extra, return -1);
849 isl_seq_clr(bmap->div[bmap->n_div] +
850 1 + 1 + isl_basic_map_total_dim(bmap),
851 bmap->extra - bmap->n_div);
852 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
853 return bmap->n_div++;
856 int isl_basic_set_alloc_div(struct isl_basic_set *bset)
858 return isl_basic_map_alloc_div((struct isl_basic_map *)bset);
861 int isl_basic_map_free_div(struct isl_basic_map *bmap, unsigned n)
865 isl_assert(bmap->ctx, n <= bmap->n_div, return -1);
870 int isl_basic_set_free_div(struct isl_basic_set *bset, unsigned n)
872 return isl_basic_map_free_div((struct isl_basic_map *)bset, n);
875 /* Copy constraint from src to dst, putting the vars of src at offset
876 * dim_off in dst and the divs of src at offset div_off in dst.
877 * If both sets are actually map, then dim_off applies to the input
880 static void copy_constraint(struct isl_basic_map *dst_map, isl_int *dst,
881 struct isl_basic_map *src_map, isl_int *src,
882 unsigned in_off, unsigned out_off, unsigned div_off)
884 unsigned src_nparam = isl_basic_map_n_param(src_map);
885 unsigned dst_nparam = isl_basic_map_n_param(dst_map);
886 unsigned src_in = isl_basic_map_n_in(src_map);
887 unsigned dst_in = isl_basic_map_n_in(dst_map);
888 unsigned src_out = isl_basic_map_n_out(src_map);
889 unsigned dst_out = isl_basic_map_n_out(dst_map);
890 isl_int_set(dst[0], src[0]);
891 isl_seq_cpy(dst+1, src+1, isl_min(dst_nparam, src_nparam));
892 if (dst_nparam > src_nparam)
893 isl_seq_clr(dst+1+src_nparam,
894 dst_nparam - src_nparam);
895 isl_seq_clr(dst+1+dst_nparam, in_off);
896 isl_seq_cpy(dst+1+dst_nparam+in_off,
898 isl_min(dst_in-in_off, src_in));
899 if (dst_in-in_off > src_in)
900 isl_seq_clr(dst+1+dst_nparam+in_off+src_in,
901 dst_in - in_off - src_in);
902 isl_seq_clr(dst+1+dst_nparam+dst_in, out_off);
903 isl_seq_cpy(dst+1+dst_nparam+dst_in+out_off,
904 src+1+src_nparam+src_in,
905 isl_min(dst_out-out_off, src_out));
906 if (dst_out-out_off > src_out)
907 isl_seq_clr(dst+1+dst_nparam+dst_in+out_off+src_out,
908 dst_out - out_off - src_out);
909 isl_seq_clr(dst+1+dst_nparam+dst_in+dst_out, div_off);
910 isl_seq_cpy(dst+1+dst_nparam+dst_in+dst_out+div_off,
911 src+1+src_nparam+src_in+src_out,
912 isl_min(dst_map->extra-div_off, src_map->n_div));
913 if (dst_map->n_div-div_off > src_map->n_div)
914 isl_seq_clr(dst+1+dst_nparam+dst_in+dst_out+
915 div_off+src_map->n_div,
916 dst_map->n_div - div_off - src_map->n_div);
919 static void copy_div(struct isl_basic_map *dst_map, isl_int *dst,
920 struct isl_basic_map *src_map, isl_int *src,
921 unsigned in_off, unsigned out_off, unsigned div_off)
923 isl_int_set(dst[0], src[0]);
924 copy_constraint(dst_map, dst+1, src_map, src+1, in_off, out_off, div_off);
927 static struct isl_basic_map *add_constraints(struct isl_basic_map *bmap1,
928 struct isl_basic_map *bmap2, unsigned i_pos, unsigned o_pos)
933 if (!bmap1 || !bmap2)
936 div_off = bmap1->n_div;
938 for (i = 0; i < bmap2->n_eq; ++i) {
939 int i1 = isl_basic_map_alloc_equality(bmap1);
942 copy_constraint(bmap1, bmap1->eq[i1], bmap2, bmap2->eq[i],
943 i_pos, o_pos, div_off);
946 for (i = 0; i < bmap2->n_ineq; ++i) {
947 int i1 = isl_basic_map_alloc_inequality(bmap1);
950 copy_constraint(bmap1, bmap1->ineq[i1], bmap2, bmap2->ineq[i],
951 i_pos, o_pos, div_off);
954 for (i = 0; i < bmap2->n_div; ++i) {
955 int i1 = isl_basic_map_alloc_div(bmap1);
958 copy_div(bmap1, bmap1->div[i1], bmap2, bmap2->div[i],
959 i_pos, o_pos, div_off);
962 isl_basic_map_free(bmap2);
967 isl_basic_map_free(bmap1);
968 isl_basic_map_free(bmap2);
972 struct isl_basic_set *isl_basic_set_add_constraints(struct isl_basic_set *bset1,
973 struct isl_basic_set *bset2, unsigned pos)
975 return (struct isl_basic_set *)
976 add_constraints((struct isl_basic_map *)bset1,
977 (struct isl_basic_map *)bset2, 0, pos);
980 struct isl_basic_map *isl_basic_map_extend_dim(struct isl_basic_map *base,
981 struct isl_dim *dim, unsigned extra,
982 unsigned n_eq, unsigned n_ineq)
984 struct isl_basic_map *ext;
994 dims_ok = isl_dim_equal(base->dim, dim) &&
995 base->extra >= base->n_div + extra;
997 if (dims_ok && room_for_con(base, n_eq + n_ineq) &&
998 room_for_ineq(base, n_ineq)) {
1003 isl_assert(base->ctx, base->dim->nparam <= dim->nparam, goto error);
1004 isl_assert(base->ctx, base->dim->n_in <= dim->n_in, goto error);
1005 isl_assert(base->ctx, base->dim->n_out <= dim->n_out, goto error);
1006 extra += base->extra;
1008 n_ineq += base->n_ineq;
1010 ext = isl_basic_map_alloc_dim(dim, extra, n_eq, n_ineq);
1016 ext->sample = isl_vec_copy(base->sample);
1017 flags = base->flags;
1018 ext = add_constraints(ext, base, 0, 0);
1021 ISL_F_CLR(ext, ISL_BASIC_SET_FINAL);
1028 isl_basic_map_free(base);
1032 struct isl_basic_set *isl_basic_set_extend_dim(struct isl_basic_set *base,
1033 struct isl_dim *dim, unsigned extra,
1034 unsigned n_eq, unsigned n_ineq)
1036 return (struct isl_basic_set *)
1037 isl_basic_map_extend_dim((struct isl_basic_map *)base, dim,
1038 extra, n_eq, n_ineq);
1041 struct isl_basic_map *isl_basic_map_extend_constraints(
1042 struct isl_basic_map *base, unsigned n_eq, unsigned n_ineq)
1046 return isl_basic_map_extend_dim(base, isl_dim_copy(base->dim),
1050 struct isl_basic_map *isl_basic_map_extend(struct isl_basic_map *base,
1051 unsigned nparam, unsigned n_in, unsigned n_out, unsigned extra,
1052 unsigned n_eq, unsigned n_ineq)
1054 struct isl_basic_map *bmap;
1055 struct isl_dim *dim;
1059 dim = isl_dim_alloc(base->ctx, nparam, n_in, n_out);
1063 bmap = isl_basic_map_extend_dim(base, dim, extra, n_eq, n_ineq);
1066 isl_basic_map_free(base);
1070 struct isl_basic_set *isl_basic_set_extend(struct isl_basic_set *base,
1071 unsigned nparam, unsigned dim, unsigned extra,
1072 unsigned n_eq, unsigned n_ineq)
1074 return (struct isl_basic_set *)
1075 isl_basic_map_extend((struct isl_basic_map *)base,
1076 nparam, 0, dim, extra, n_eq, n_ineq);
1079 struct isl_basic_set *isl_basic_set_extend_constraints(
1080 struct isl_basic_set *base, unsigned n_eq, unsigned n_ineq)
1082 return (struct isl_basic_set *)
1083 isl_basic_map_extend_constraints((struct isl_basic_map *)base,
1087 struct isl_basic_set *isl_basic_set_cow(struct isl_basic_set *bset)
1089 return (struct isl_basic_set *)
1090 isl_basic_map_cow((struct isl_basic_map *)bset);
1093 struct isl_basic_map *isl_basic_map_cow(struct isl_basic_map *bmap)
1098 if (bmap->ref > 1) {
1100 bmap = isl_basic_map_dup(bmap);
1103 ISL_F_CLR(bmap, ISL_BASIC_SET_FINAL);
1107 struct isl_set *isl_set_cow(struct isl_set *set)
1115 return isl_set_dup(set);
1118 struct isl_map *isl_map_cow(struct isl_map *map)
1126 return isl_map_dup(map);
1129 static void swap_vars(struct isl_blk blk, isl_int *a,
1130 unsigned a_len, unsigned b_len)
1132 isl_seq_cpy(blk.data, a+a_len, b_len);
1133 isl_seq_cpy(blk.data+b_len, a, a_len);
1134 isl_seq_cpy(a, blk.data, b_len+a_len);
1137 static __isl_give isl_basic_map *isl_basic_map_swap_vars(
1138 __isl_take isl_basic_map *bmap, unsigned pos, unsigned n1, unsigned n2)
1146 isl_assert(bmap->ctx,
1147 pos + n1 + n2 <= 1 + isl_basic_map_total_dim(bmap), goto error);
1149 if (n1 == 0 || n2 == 0)
1152 bmap = isl_basic_map_cow(bmap);
1156 blk = isl_blk_alloc(bmap->ctx, n1 + n2);
1157 if (isl_blk_is_error(blk))
1160 for (i = 0; i < bmap->n_eq; ++i)
1162 bmap->eq[i] + pos, n1, n2);
1164 for (i = 0; i < bmap->n_ineq; ++i)
1166 bmap->ineq[i] + pos, n1, n2);
1168 for (i = 0; i < bmap->n_div; ++i)
1170 bmap->div[i]+1 + pos, n1, n2);
1172 isl_blk_free(bmap->ctx, blk);
1174 ISL_F_CLR(bmap, ISL_BASIC_SET_NORMALIZED);
1175 bmap = isl_basic_map_gauss(bmap, NULL);
1176 return isl_basic_map_finalize(bmap);
1178 isl_basic_map_free(bmap);
1182 static __isl_give isl_basic_set *isl_basic_set_swap_vars(
1183 __isl_take isl_basic_set *bset, unsigned n)
1188 nparam = isl_basic_set_n_param(bset);
1189 dim = isl_basic_set_n_dim(bset);
1190 isl_assert(bset->ctx, n <= dim, goto error);
1192 return isl_basic_map_swap_vars(bset, 1 + nparam, n, dim - n);
1194 isl_basic_set_free(bset);
1198 static __isl_give isl_set *isl_set_swap_vars(__isl_take isl_set *set,
1202 set = isl_set_cow(set);
1206 for (i = 0; i < set->n; ++i) {
1207 set->p[i] = isl_basic_set_swap_vars(set->p[i], n);
1213 ISL_F_CLR(set, ISL_SET_NORMALIZED);
1217 struct isl_basic_map *isl_basic_map_set_to_empty(struct isl_basic_map *bmap)
1223 total = isl_basic_map_total_dim(bmap);
1224 isl_basic_map_free_div(bmap, bmap->n_div);
1225 isl_basic_map_free_inequality(bmap, bmap->n_ineq);
1227 isl_basic_map_free_equality(bmap, bmap->n_eq-1);
1229 i = isl_basic_map_alloc_equality(bmap);
1233 isl_int_set_si(bmap->eq[i][0], 1);
1234 isl_seq_clr(bmap->eq[i]+1, total);
1235 ISL_F_SET(bmap, ISL_BASIC_MAP_EMPTY);
1236 isl_vec_free(bmap->sample);
1237 bmap->sample = NULL;
1238 return isl_basic_map_finalize(bmap);
1240 isl_basic_map_free(bmap);
1244 struct isl_basic_set *isl_basic_set_set_to_empty(struct isl_basic_set *bset)
1246 return (struct isl_basic_set *)
1247 isl_basic_map_set_to_empty((struct isl_basic_map *)bset);
1250 void isl_basic_map_swap_div(struct isl_basic_map *bmap, int a, int b)
1253 unsigned off = isl_dim_total(bmap->dim);
1254 isl_int *t = bmap->div[a];
1255 bmap->div[a] = bmap->div[b];
1258 for (i = 0; i < bmap->n_eq; ++i)
1259 isl_int_swap(bmap->eq[i][1+off+a], bmap->eq[i][1+off+b]);
1261 for (i = 0; i < bmap->n_ineq; ++i)
1262 isl_int_swap(bmap->ineq[i][1+off+a], bmap->ineq[i][1+off+b]);
1264 for (i = 0; i < bmap->n_div; ++i)
1265 isl_int_swap(bmap->div[i][1+1+off+a], bmap->div[i][1+1+off+b]);
1266 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1269 /* Eliminate the specified n dimensions starting at first from the
1270 * constraints using Fourier-Motzkin. The dimensions themselves
1273 __isl_give isl_map *isl_map_eliminate(__isl_take isl_map *map,
1274 enum isl_dim_type type, unsigned first, unsigned n)
1283 map = isl_map_cow(map);
1286 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
1287 first += pos(map->dim, type) - 1;
1289 for (i = 0; i < map->n; ++i) {
1290 map->p[i] = isl_basic_map_eliminate_vars(map->p[i], first, n);
1300 /* Eliminate the specified n dimensions starting at first from the
1301 * constraints using Fourier-Motzkin. The dimensions themselves
1304 __isl_give isl_set *isl_set_eliminate(__isl_take isl_set *set,
1305 enum isl_dim_type type, unsigned first, unsigned n)
1307 return (isl_set *)isl_map_eliminate((isl_map *)set, type, first, n);
1310 /* Eliminate the specified n dimensions starting at first from the
1311 * constraints using Fourier-Motzkin. The dimensions themselves
1314 __isl_give isl_set *isl_set_eliminate_dims(__isl_take isl_set *set,
1315 unsigned first, unsigned n)
1317 return isl_set_eliminate(set, isl_dim_set, first, n);
1320 __isl_give isl_basic_map *isl_basic_map_remove_divs(
1321 __isl_take isl_basic_map *bmap)
1323 bmap = isl_basic_map_eliminate_vars(bmap, isl_dim_total(bmap->dim),
1328 return isl_basic_map_finalize(bmap);
1331 __isl_give isl_basic_set *isl_basic_set_remove_divs(
1332 __isl_take isl_basic_set *bset)
1334 return (struct isl_basic_set *)isl_basic_map_remove_divs(
1335 (struct isl_basic_map *)bset);
1338 __isl_give isl_map *isl_map_remove_divs(__isl_take isl_map *map)
1347 map = isl_map_cow(map);
1351 for (i = 0; i < map->n; ++i) {
1352 map->p[i] = isl_basic_map_remove_divs(map->p[i]);
1362 __isl_give isl_set *isl_set_remove_divs(__isl_take isl_set *set)
1364 return isl_map_remove_divs(set);
1367 struct isl_basic_map *isl_basic_map_remove_dims(struct isl_basic_map *bmap,
1368 enum isl_dim_type type, unsigned first, unsigned n)
1372 isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
1376 bmap = isl_basic_map_eliminate_vars(bmap,
1377 isl_basic_map_offset(bmap, type) - 1 + first, n);
1380 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY) && type == isl_dim_div)
1382 bmap = isl_basic_map_drop(bmap, type, first, n);
1385 isl_basic_map_free(bmap);
1389 /* Return true if the definition of the given div (recursively) involves
1390 * any of the given variables.
1392 static int div_involves_vars(__isl_keep isl_basic_map *bmap, int div,
1393 unsigned first, unsigned n)
1396 unsigned div_offset = isl_basic_map_offset(bmap, isl_dim_div);
1398 if (isl_int_is_zero(bmap->div[div][0]))
1400 if (isl_seq_first_non_zero(bmap->div[div] + 1 + first, n) >= 0)
1403 for (i = bmap->n_div - 1; i >= 0; --i) {
1404 if (isl_int_is_zero(bmap->div[div][1 + div_offset + i]))
1406 if (div_involves_vars(bmap, i, first, n))
1413 /* Remove all divs (recursively) involving any of the given dimensions
1414 * in their definitions.
1416 __isl_give isl_basic_map *isl_basic_map_remove_divs_involving_dims(
1417 __isl_take isl_basic_map *bmap,
1418 enum isl_dim_type type, unsigned first, unsigned n)
1424 isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
1426 first += isl_basic_map_offset(bmap, type);
1428 for (i = bmap->n_div - 1; i >= 0; --i) {
1429 if (!div_involves_vars(bmap, i, first, n))
1431 bmap = isl_basic_map_remove_dims(bmap, isl_dim_div, i, 1);
1436 isl_basic_map_free(bmap);
1440 __isl_give isl_map *isl_map_remove_divs_involving_dims(__isl_take isl_map *map,
1441 enum isl_dim_type type, unsigned first, unsigned n)
1450 map = isl_map_cow(map);
1454 for (i = 0; i < map->n; ++i) {
1455 map->p[i] = isl_basic_map_remove_divs_involving_dims(map->p[i],
1466 __isl_give isl_set *isl_set_remove_divs_involving_dims(__isl_take isl_set *set,
1467 enum isl_dim_type type, unsigned first, unsigned n)
1469 return (isl_set *)isl_map_remove_divs_involving_dims((isl_map *)set,
1473 /* Return true if the definition of the given div is unknown or depends
1476 static int div_is_unknown(__isl_keep isl_basic_map *bmap, int div)
1479 unsigned div_offset = isl_basic_map_offset(bmap, isl_dim_div);
1481 if (isl_int_is_zero(bmap->div[div][0]))
1484 for (i = bmap->n_div - 1; i >= 0; --i) {
1485 if (isl_int_is_zero(bmap->div[div][1 + div_offset + i]))
1487 if (div_is_unknown(bmap, i))
1494 /* Remove all divs that are unknown or defined in terms of unknown divs.
1496 __isl_give isl_basic_map *isl_basic_map_remove_unknown_divs(
1497 __isl_take isl_basic_map *bmap)
1504 for (i = bmap->n_div - 1; i >= 0; --i) {
1505 if (!div_is_unknown(bmap, i))
1507 bmap = isl_basic_map_remove_dims(bmap, isl_dim_div, i, 1);
1513 __isl_give isl_map *isl_map_remove_unknown_divs(__isl_take isl_map *map)
1522 map = isl_map_cow(map);
1526 for (i = 0; i < map->n; ++i) {
1527 map->p[i] = isl_basic_map_remove_unknown_divs(map->p[i]);
1537 __isl_give isl_set *isl_set_remove_unknown_divs(__isl_take isl_set *set)
1539 return (isl_set *)isl_map_remove_unknown_divs((isl_map *)set);
1542 __isl_give isl_basic_set *isl_basic_set_remove_dims(
1543 __isl_take isl_basic_set *bset,
1544 enum isl_dim_type type, unsigned first, unsigned n)
1546 return (isl_basic_set *)
1547 isl_basic_map_remove_dims((isl_basic_map *)bset, type, first, n);
1550 struct isl_map *isl_map_remove_dims(struct isl_map *map,
1551 enum isl_dim_type type, unsigned first, unsigned n)
1558 map = isl_map_cow(map);
1561 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
1563 for (i = 0; i < map->n; ++i) {
1564 map->p[i] = isl_basic_map_eliminate_vars(map->p[i],
1565 isl_basic_map_offset(map->p[i], type) - 1 + first, n);
1569 map = isl_map_drop(map, type, first, n);
1576 __isl_give isl_set *isl_set_remove_dims(__isl_take isl_set *bset,
1577 enum isl_dim_type type, unsigned first, unsigned n)
1579 return (isl_set *)isl_map_remove_dims((isl_map *)bset, type, first, n);
1582 /* Project out n inputs starting at first using Fourier-Motzkin */
1583 struct isl_map *isl_map_remove_inputs(struct isl_map *map,
1584 unsigned first, unsigned n)
1586 return isl_map_remove_dims(map, isl_dim_in, first, n);
1589 static void dump_term(struct isl_basic_map *bmap,
1590 isl_int c, int pos, FILE *out)
1593 unsigned in = isl_basic_map_n_in(bmap);
1594 unsigned dim = in + isl_basic_map_n_out(bmap);
1595 unsigned nparam = isl_basic_map_n_param(bmap);
1597 isl_int_print(out, c, 0);
1599 if (!isl_int_is_one(c))
1600 isl_int_print(out, c, 0);
1601 if (pos < 1 + nparam) {
1602 name = isl_dim_get_name(bmap->dim,
1603 isl_dim_param, pos - 1);
1605 fprintf(out, "%s", name);
1607 fprintf(out, "p%d", pos - 1);
1608 } else if (pos < 1 + nparam + in)
1609 fprintf(out, "i%d", pos - 1 - nparam);
1610 else if (pos < 1 + nparam + dim)
1611 fprintf(out, "o%d", pos - 1 - nparam - in);
1613 fprintf(out, "e%d", pos - 1 - nparam - dim);
1617 static void dump_constraint_sign(struct isl_basic_map *bmap, isl_int *c,
1618 int sign, FILE *out)
1622 unsigned len = 1 + isl_basic_map_total_dim(bmap);
1626 for (i = 0, first = 1; i < len; ++i) {
1627 if (isl_int_sgn(c[i]) * sign <= 0)
1630 fprintf(out, " + ");
1632 isl_int_abs(v, c[i]);
1633 dump_term(bmap, v, i, out);
1640 static void dump_constraint(struct isl_basic_map *bmap, isl_int *c,
1641 const char *op, FILE *out, int indent)
1645 fprintf(out, "%*s", indent, "");
1647 dump_constraint_sign(bmap, c, 1, out);
1648 fprintf(out, " %s ", op);
1649 dump_constraint_sign(bmap, c, -1, out);
1653 for (i = bmap->n_div; i < bmap->extra; ++i) {
1654 if (isl_int_is_zero(c[1+isl_dim_total(bmap->dim)+i]))
1656 fprintf(out, "%*s", indent, "");
1657 fprintf(out, "ERROR: unused div coefficient not zero\n");
1662 static void dump_constraints(struct isl_basic_map *bmap,
1663 isl_int **c, unsigned n,
1664 const char *op, FILE *out, int indent)
1668 for (i = 0; i < n; ++i)
1669 dump_constraint(bmap, c[i], op, out, indent);
1672 static void dump_affine(struct isl_basic_map *bmap, isl_int *exp, FILE *out)
1676 unsigned total = isl_basic_map_total_dim(bmap);
1678 for (j = 0; j < 1 + total; ++j) {
1679 if (isl_int_is_zero(exp[j]))
1681 if (!first && isl_int_is_pos(exp[j]))
1683 dump_term(bmap, exp[j], j, out);
1688 static void dump(struct isl_basic_map *bmap, FILE *out, int indent)
1692 dump_constraints(bmap, bmap->eq, bmap->n_eq, "=", out, indent);
1693 dump_constraints(bmap, bmap->ineq, bmap->n_ineq, ">=", out, indent);
1695 for (i = 0; i < bmap->n_div; ++i) {
1696 fprintf(out, "%*s", indent, "");
1697 fprintf(out, "e%d = [(", i);
1698 dump_affine(bmap, bmap->div[i]+1, out);
1700 isl_int_print(out, bmap->div[i][0], 0);
1701 fprintf(out, "]\n");
1705 void isl_basic_set_print_internal(struct isl_basic_set *bset,
1706 FILE *out, int indent)
1709 fprintf(out, "null basic set\n");
1713 fprintf(out, "%*s", indent, "");
1714 fprintf(out, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n",
1715 bset->ref, bset->dim->nparam, bset->dim->n_out,
1716 bset->extra, bset->flags);
1717 dump((struct isl_basic_map *)bset, out, indent);
1720 void isl_basic_map_print_internal(struct isl_basic_map *bmap,
1721 FILE *out, int indent)
1724 fprintf(out, "null basic map\n");
1728 fprintf(out, "%*s", indent, "");
1729 fprintf(out, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, "
1730 "flags: %x, n_name: %d\n",
1732 bmap->dim->nparam, bmap->dim->n_in, bmap->dim->n_out,
1733 bmap->extra, bmap->flags, bmap->dim->n_name);
1734 dump(bmap, out, indent);
1737 int isl_inequality_negate(struct isl_basic_map *bmap, unsigned pos)
1742 total = isl_basic_map_total_dim(bmap);
1743 isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
1744 isl_seq_neg(bmap->ineq[pos], bmap->ineq[pos], 1 + total);
1745 isl_int_sub_ui(bmap->ineq[pos][0], bmap->ineq[pos][0], 1);
1746 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1750 struct isl_set *isl_set_alloc_dim(struct isl_dim *dim, int n, unsigned flags)
1752 struct isl_set *set;
1756 isl_assert(dim->ctx, dim->n_in == 0, goto error);
1757 isl_assert(dim->ctx, n >= 0, goto error);
1758 set = isl_alloc(dim->ctx, struct isl_set,
1759 sizeof(struct isl_set) +
1760 (n - 1) * sizeof(struct isl_basic_set *));
1764 set->ctx = dim->ctx;
1765 isl_ctx_ref(set->ctx);
1777 struct isl_set *isl_set_alloc(struct isl_ctx *ctx,
1778 unsigned nparam, unsigned dim, int n, unsigned flags)
1780 struct isl_set *set;
1781 struct isl_dim *dims;
1783 dims = isl_dim_alloc(ctx, nparam, 0, dim);
1787 set = isl_set_alloc_dim(dims, n, flags);
1791 /* Make sure "map" has room for at least "n" more basic maps.
1793 struct isl_map *isl_map_grow(struct isl_map *map, int n)
1796 struct isl_map *grown = NULL;
1800 isl_assert(map->ctx, n >= 0, goto error);
1801 if (map->n + n <= map->size)
1803 grown = isl_map_alloc_dim(isl_map_get_dim(map), map->n + n, map->flags);
1806 for (i = 0; i < map->n; ++i) {
1807 grown->p[i] = isl_basic_map_copy(map->p[i]);
1815 isl_map_free(grown);
1820 /* Make sure "set" has room for at least "n" more basic sets.
1822 struct isl_set *isl_set_grow(struct isl_set *set, int n)
1824 return (struct isl_set *)isl_map_grow((struct isl_map *)set, n);
1827 struct isl_set *isl_set_dup(struct isl_set *set)
1830 struct isl_set *dup;
1835 dup = isl_set_alloc_dim(isl_dim_copy(set->dim), set->n, set->flags);
1838 for (i = 0; i < set->n; ++i)
1839 dup = isl_set_add_basic_set(dup, isl_basic_set_copy(set->p[i]));
1843 struct isl_set *isl_set_from_basic_set(struct isl_basic_set *bset)
1845 return isl_map_from_basic_map(bset);
1848 struct isl_map *isl_map_from_basic_map(struct isl_basic_map *bmap)
1850 struct isl_map *map;
1855 map = isl_map_alloc_dim(isl_dim_copy(bmap->dim), 1, ISL_MAP_DISJOINT);
1856 return isl_map_add_basic_map(map, bmap);
1859 __isl_give isl_set *isl_set_add_basic_set(__isl_take isl_set *set,
1860 __isl_take isl_basic_set *bset)
1862 return (struct isl_set *)isl_map_add_basic_map((struct isl_map *)set,
1863 (struct isl_basic_map *)bset);
1866 void isl_set_free(struct isl_set *set)
1876 isl_ctx_deref(set->ctx);
1877 for (i = 0; i < set->n; ++i)
1878 isl_basic_set_free(set->p[i]);
1879 isl_dim_free(set->dim);
1883 void isl_set_print_internal(struct isl_set *set, FILE *out, int indent)
1888 fprintf(out, "null set\n");
1892 fprintf(out, "%*s", indent, "");
1893 fprintf(out, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
1894 set->ref, set->n, set->dim->nparam, set->dim->n_out,
1896 for (i = 0; i < set->n; ++i) {
1897 fprintf(out, "%*s", indent, "");
1898 fprintf(out, "basic set %d:\n", i);
1899 isl_basic_set_print_internal(set->p[i], out, indent+4);
1903 void isl_map_print_internal(struct isl_map *map, FILE *out, int indent)
1908 fprintf(out, "null map\n");
1912 fprintf(out, "%*s", indent, "");
1913 fprintf(out, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, "
1914 "flags: %x, n_name: %d\n",
1915 map->ref, map->n, map->dim->nparam, map->dim->n_in,
1916 map->dim->n_out, map->flags, map->dim->n_name);
1917 for (i = 0; i < map->n; ++i) {
1918 fprintf(out, "%*s", indent, "");
1919 fprintf(out, "basic map %d:\n", i);
1920 isl_basic_map_print_internal(map->p[i], out, indent+4);
1924 struct isl_basic_map *isl_basic_map_intersect_domain(
1925 struct isl_basic_map *bmap, struct isl_basic_set *bset)
1927 struct isl_basic_map *bmap_domain;
1932 isl_assert(bset->ctx, isl_dim_match(bmap->dim, isl_dim_param,
1933 bset->dim, isl_dim_param), goto error);
1935 if (isl_dim_size(bset->dim, isl_dim_set) != 0)
1936 isl_assert(bset->ctx,
1937 isl_basic_map_compatible_domain(bmap, bset), goto error);
1939 bmap = isl_basic_map_cow(bmap);
1942 bmap = isl_basic_map_extend_dim(bmap, isl_dim_copy(bmap->dim),
1943 bset->n_div, bset->n_eq, bset->n_ineq);
1944 bmap_domain = isl_basic_map_from_domain(bset);
1945 bmap = add_constraints(bmap, bmap_domain, 0, 0);
1947 bmap = isl_basic_map_simplify(bmap);
1948 return isl_basic_map_finalize(bmap);
1950 isl_basic_map_free(bmap);
1951 isl_basic_set_free(bset);
1955 struct isl_basic_map *isl_basic_map_intersect_range(
1956 struct isl_basic_map *bmap, struct isl_basic_set *bset)
1958 struct isl_basic_map *bmap_range;
1963 isl_assert(bset->ctx, isl_dim_match(bmap->dim, isl_dim_param,
1964 bset->dim, isl_dim_param), goto error);
1966 if (isl_dim_size(bset->dim, isl_dim_set) != 0)
1967 isl_assert(bset->ctx,
1968 isl_basic_map_compatible_range(bmap, bset), goto error);
1970 bmap = isl_basic_map_cow(bmap);
1973 bmap = isl_basic_map_extend_dim(bmap, isl_dim_copy(bmap->dim),
1974 bset->n_div, bset->n_eq, bset->n_ineq);
1975 bmap_range = isl_basic_map_from_basic_set(bset, isl_dim_copy(bset->dim));
1976 bmap = add_constraints(bmap, bmap_range, 0, 0);
1978 bmap = isl_basic_map_simplify(bmap);
1979 return isl_basic_map_finalize(bmap);
1981 isl_basic_map_free(bmap);
1982 isl_basic_set_free(bset);
1986 int isl_basic_map_contains(struct isl_basic_map *bmap, struct isl_vec *vec)
1992 total = 1 + isl_basic_map_total_dim(bmap);
1993 if (total != vec->size)
1998 for (i = 0; i < bmap->n_eq; ++i) {
1999 isl_seq_inner_product(vec->el, bmap->eq[i], total, &s);
2000 if (!isl_int_is_zero(s)) {
2006 for (i = 0; i < bmap->n_ineq; ++i) {
2007 isl_seq_inner_product(vec->el, bmap->ineq[i], total, &s);
2008 if (isl_int_is_neg(s)) {
2019 int isl_basic_set_contains(struct isl_basic_set *bset, struct isl_vec *vec)
2021 return isl_basic_map_contains((struct isl_basic_map *)bset, vec);
2024 struct isl_basic_map *isl_basic_map_intersect(
2025 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2027 struct isl_vec *sample = NULL;
2029 if (!bmap1 || !bmap2)
2032 isl_assert(bmap1->ctx, isl_dim_match(bmap1->dim, isl_dim_param,
2033 bmap2->dim, isl_dim_param), goto error);
2034 if (isl_dim_total(bmap1->dim) ==
2035 isl_dim_size(bmap1->dim, isl_dim_param) &&
2036 isl_dim_total(bmap2->dim) !=
2037 isl_dim_size(bmap2->dim, isl_dim_param))
2038 return isl_basic_map_intersect(bmap2, bmap1);
2040 if (isl_dim_total(bmap2->dim) !=
2041 isl_dim_size(bmap2->dim, isl_dim_param))
2042 isl_assert(bmap1->ctx,
2043 isl_dim_equal(bmap1->dim, bmap2->dim), goto error);
2045 if (bmap1->sample &&
2046 isl_basic_map_contains(bmap1, bmap1->sample) > 0 &&
2047 isl_basic_map_contains(bmap2, bmap1->sample) > 0)
2048 sample = isl_vec_copy(bmap1->sample);
2049 else if (bmap2->sample &&
2050 isl_basic_map_contains(bmap1, bmap2->sample) > 0 &&
2051 isl_basic_map_contains(bmap2, bmap2->sample) > 0)
2052 sample = isl_vec_copy(bmap2->sample);
2054 bmap1 = isl_basic_map_cow(bmap1);
2057 bmap1 = isl_basic_map_extend_dim(bmap1, isl_dim_copy(bmap1->dim),
2058 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
2059 bmap1 = add_constraints(bmap1, bmap2, 0, 0);
2062 isl_vec_free(sample);
2064 isl_vec_free(bmap1->sample);
2065 bmap1->sample = sample;
2068 bmap1 = isl_basic_map_simplify(bmap1);
2069 return isl_basic_map_finalize(bmap1);
2072 isl_vec_free(sample);
2073 isl_basic_map_free(bmap1);
2074 isl_basic_map_free(bmap2);
2078 struct isl_basic_set *isl_basic_set_intersect(
2079 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
2081 return (struct isl_basic_set *)
2082 isl_basic_map_intersect(
2083 (struct isl_basic_map *)bset1,
2084 (struct isl_basic_map *)bset2);
2087 /* Special case of isl_map_intersect, where both map1 and map2
2088 * are convex, without any divs and such that either map1 or map2
2089 * contains a single constraint. This constraint is then simply
2090 * added to the other map.
2092 static __isl_give isl_map *map_intersect_add_constraint(
2093 __isl_take isl_map *map1, __isl_take isl_map *map2)
2095 struct isl_basic_map *bmap1;
2096 struct isl_basic_map *bmap2;
2098 isl_assert(map1->ctx, map1->n == 1, goto error);
2099 isl_assert(map2->ctx, map1->n == 1, goto error);
2100 isl_assert(map1->ctx, map1->p[0]->n_div == 0, goto error);
2101 isl_assert(map2->ctx, map1->p[0]->n_div == 0, goto error);
2103 if (map2->p[0]->n_eq + map2->p[0]->n_ineq != 1)
2104 return isl_map_intersect(map2, map1);
2106 isl_assert(map2->ctx,
2107 map2->p[0]->n_eq + map2->p[0]->n_ineq == 1, goto error);
2109 map1 = isl_map_cow(map1);
2112 if (isl_map_fast_is_empty(map1)) {
2116 map1->p[0] = isl_basic_map_cow(map1->p[0]);
2117 if (map2->p[0]->n_eq == 1)
2118 map1->p[0] = isl_basic_map_add_eq(map1->p[0], map2->p[0]->eq[0]);
2120 map1->p[0] = isl_basic_map_add_ineq(map1->p[0],
2121 map2->p[0]->ineq[0]);
2123 map1->p[0] = isl_basic_map_simplify(map1->p[0]);
2124 map1->p[0] = isl_basic_map_finalize(map1->p[0]);
2128 if (isl_basic_map_fast_is_empty(map1->p[0])) {
2129 isl_basic_map_free(map1->p[0]);
2142 struct isl_map *isl_map_intersect(struct isl_map *map1, struct isl_map *map2)
2145 struct isl_map *result;
2151 if (isl_map_fast_is_empty(map1)) {
2155 if (isl_map_fast_is_empty(map2)) {
2160 if (map1->n == 1 && map2->n == 1 &&
2161 map1->p[0]->n_div == 0 && map2->p[0]->n_div == 0 &&
2162 isl_dim_equal(map1->dim, map2->dim) &&
2163 (map1->p[0]->n_eq + map1->p[0]->n_ineq == 1 ||
2164 map2->p[0]->n_eq + map2->p[0]->n_ineq == 1))
2165 return map_intersect_add_constraint(map1, map2);
2166 isl_assert(map1->ctx, isl_dim_match(map1->dim, isl_dim_param,
2167 map2->dim, isl_dim_param), goto error);
2168 if (isl_dim_total(map1->dim) ==
2169 isl_dim_size(map1->dim, isl_dim_param) &&
2170 isl_dim_total(map2->dim) != isl_dim_size(map2->dim, isl_dim_param))
2171 return isl_map_intersect(map2, map1);
2173 if (isl_dim_total(map2->dim) != isl_dim_size(map2->dim, isl_dim_param))
2174 isl_assert(map1->ctx,
2175 isl_dim_equal(map1->dim, map2->dim), goto error);
2177 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
2178 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
2179 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
2181 result = isl_map_alloc_dim(isl_dim_copy(map1->dim),
2182 map1->n * map2->n, flags);
2185 for (i = 0; i < map1->n; ++i)
2186 for (j = 0; j < map2->n; ++j) {
2187 struct isl_basic_map *part;
2188 part = isl_basic_map_intersect(
2189 isl_basic_map_copy(map1->p[i]),
2190 isl_basic_map_copy(map2->p[j]));
2191 if (isl_basic_map_is_empty(part))
2192 isl_basic_map_free(part);
2194 result = isl_map_add_basic_map(result, part);
2207 struct isl_set *isl_set_intersect(struct isl_set *set1, struct isl_set *set2)
2209 return (struct isl_set *)
2210 isl_map_intersect((struct isl_map *)set1,
2211 (struct isl_map *)set2);
2214 struct isl_basic_map *isl_basic_map_reverse(struct isl_basic_map *bmap)
2216 struct isl_dim *dim;
2217 struct isl_basic_set *bset;
2222 bmap = isl_basic_map_cow(bmap);
2225 dim = isl_dim_reverse(isl_dim_copy(bmap->dim));
2226 in = isl_basic_map_n_in(bmap);
2227 bset = isl_basic_set_from_basic_map(bmap);
2228 bset = isl_basic_set_swap_vars(bset, in);
2229 return isl_basic_map_from_basic_set(bset, dim);
2232 __isl_give isl_basic_map *isl_basic_map_insert(__isl_take isl_basic_map *bmap,
2233 enum isl_dim_type type, unsigned pos, unsigned n)
2235 struct isl_dim *res_dim;
2236 struct isl_basic_map *res;
2237 struct isl_dim_map *dim_map;
2238 unsigned total, off;
2239 enum isl_dim_type t;
2247 res_dim = isl_dim_insert(isl_basic_map_get_dim(bmap), type, pos, n);
2249 total = isl_basic_map_total_dim(bmap) + n;
2250 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2252 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
2254 isl_dim_map_dim(dim_map, bmap->dim, t, off);
2256 unsigned size = isl_basic_map_dim(bmap, t);
2257 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2259 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2260 pos, size - pos, off + pos + n);
2262 off += isl_dim_size(res_dim, t);
2264 isl_dim_map_div(dim_map, bmap, off);
2266 res = isl_basic_map_alloc_dim(res_dim,
2267 bmap->n_div, bmap->n_eq, bmap->n_ineq);
2268 if (isl_basic_map_is_rational(bmap))
2269 res = isl_basic_map_set_rational(res);
2270 res = isl_basic_map_add_constraints_dim_map(res, bmap, dim_map);
2271 return isl_basic_map_finalize(res);
2274 __isl_give isl_basic_map *isl_basic_map_add(__isl_take isl_basic_map *bmap,
2275 enum isl_dim_type type, unsigned n)
2279 return isl_basic_map_insert(bmap, type,
2280 isl_basic_map_dim(bmap, type), n);
2283 __isl_give isl_basic_set *isl_basic_set_add(__isl_take isl_basic_set *bset,
2284 enum isl_dim_type type, unsigned n)
2288 isl_assert(bset->ctx, type != isl_dim_in, goto error);
2289 return (isl_basic_set *)isl_basic_map_add((isl_basic_map *)bset, type, n);
2291 isl_basic_set_free(bset);
2295 __isl_give isl_map *isl_map_insert(__isl_take isl_map *map,
2296 enum isl_dim_type type, unsigned pos, unsigned n)
2303 map = isl_map_cow(map);
2307 map->dim = isl_dim_insert(map->dim, type, pos, n);
2311 for (i = 0; i < map->n; ++i) {
2312 map->p[i] = isl_basic_map_insert(map->p[i], type, pos, n);
2323 __isl_give isl_set *isl_set_insert(__isl_take isl_set *set,
2324 enum isl_dim_type type, unsigned pos, unsigned n)
2326 return (isl_set *)isl_map_insert((isl_map *)set, type, pos, n);
2329 __isl_give isl_map *isl_map_add_dims(__isl_take isl_map *map,
2330 enum isl_dim_type type, unsigned n)
2334 return isl_map_insert(map, type, isl_map_dim(map, type), n);
2337 __isl_give isl_set *isl_set_add_dims(__isl_take isl_set *set,
2338 enum isl_dim_type type, unsigned n)
2342 isl_assert(set->ctx, type != isl_dim_in, goto error);
2343 return (isl_set *)isl_map_add_dims((isl_map *)set, type, n);
2349 __isl_give isl_basic_map *isl_basic_map_move_dims(
2350 __isl_take isl_basic_map *bmap,
2351 enum isl_dim_type dst_type, unsigned dst_pos,
2352 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2355 struct isl_dim_map *dim_map;
2356 struct isl_basic_map *res;
2357 enum isl_dim_type t;
2358 unsigned total, off;
2365 isl_assert(bmap->ctx, src_pos + n <= isl_basic_map_dim(bmap, src_type),
2368 if (dst_type == src_type && dst_pos == src_pos)
2371 isl_assert(bmap->ctx, dst_type != src_type, goto error);
2373 if (pos(bmap->dim, dst_type) + dst_pos ==
2374 pos(bmap->dim, src_type) + src_pos +
2375 ((src_type < dst_type) ? n : 0)) {
2376 bmap = isl_basic_map_cow(bmap);
2380 bmap->dim = isl_dim_move(bmap->dim, dst_type, dst_pos,
2381 src_type, src_pos, n);
2385 bmap = isl_basic_map_finalize(bmap);
2390 total = isl_basic_map_total_dim(bmap);
2391 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2394 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
2395 unsigned size = isl_dim_size(bmap->dim, t);
2396 if (t == dst_type) {
2397 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2400 isl_dim_map_dim_range(dim_map, bmap->dim, src_type,
2403 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2404 dst_pos, size - dst_pos, off);
2405 off += size - dst_pos;
2406 } else if (t == src_type) {
2407 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2410 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2411 src_pos + n, size - src_pos - n, off);
2412 off += size - src_pos - n;
2414 isl_dim_map_dim(dim_map, bmap->dim, t, off);
2418 isl_dim_map_div(dim_map, bmap, off);
2420 res = isl_basic_map_alloc_dim(isl_basic_map_get_dim(bmap),
2421 bmap->n_div, bmap->n_eq, bmap->n_ineq);
2422 bmap = isl_basic_map_add_constraints_dim_map(res, bmap, dim_map);
2424 bmap->dim = isl_dim_move(bmap->dim, dst_type, dst_pos,
2425 src_type, src_pos, n);
2429 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
2430 bmap = isl_basic_map_gauss(bmap, NULL);
2431 bmap = isl_basic_map_finalize(bmap);
2435 isl_basic_map_free(bmap);
2439 __isl_give isl_basic_set *isl_basic_set_move_dims(__isl_take isl_basic_set *bset,
2440 enum isl_dim_type dst_type, unsigned dst_pos,
2441 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2443 return (isl_basic_set *)isl_basic_map_move_dims(
2444 (isl_basic_map *)bset, dst_type, dst_pos, src_type, src_pos, n);
2447 __isl_give isl_set *isl_set_move_dims(__isl_take isl_set *set,
2448 enum isl_dim_type dst_type, unsigned dst_pos,
2449 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2453 isl_assert(set->ctx, dst_type != isl_dim_in, goto error);
2454 return (isl_set *)isl_map_move_dims((isl_map *)set, dst_type, dst_pos,
2455 src_type, src_pos, n);
2461 __isl_give isl_map *isl_map_move_dims(__isl_take isl_map *map,
2462 enum isl_dim_type dst_type, unsigned dst_pos,
2463 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2472 isl_assert(map->ctx, src_pos + n <= isl_map_dim(map, src_type),
2475 if (dst_type == src_type && dst_pos == src_pos)
2478 isl_assert(map->ctx, dst_type != src_type, goto error);
2480 map = isl_map_cow(map);
2484 map->dim = isl_dim_move(map->dim, dst_type, dst_pos, src_type, src_pos, n);
2488 for (i = 0; i < map->n; ++i) {
2489 map->p[i] = isl_basic_map_move_dims(map->p[i],
2491 src_type, src_pos, n);
2502 /* Move the specified dimensions to the last columns right before
2503 * the divs. Don't change the dimension specification of bmap.
2504 * That's the responsibility of the caller.
2506 static __isl_give isl_basic_map *move_last(__isl_take isl_basic_map *bmap,
2507 enum isl_dim_type type, unsigned first, unsigned n)
2509 struct isl_dim_map *dim_map;
2510 struct isl_basic_map *res;
2511 enum isl_dim_type t;
2512 unsigned total, off;
2516 if (pos(bmap->dim, type) + first + n == 1 + isl_dim_total(bmap->dim))
2519 total = isl_basic_map_total_dim(bmap);
2520 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2523 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
2524 unsigned size = isl_dim_size(bmap->dim, t);
2526 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2529 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2530 first, n, total - bmap->n_div - n);
2531 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2532 first + n, size - (first + n), off);
2533 off += size - (first + n);
2535 isl_dim_map_dim(dim_map, bmap->dim, t, off);
2539 isl_dim_map_div(dim_map, bmap, off + n);
2541 res = isl_basic_map_alloc_dim(isl_basic_map_get_dim(bmap),
2542 bmap->n_div, bmap->n_eq, bmap->n_ineq);
2543 res = isl_basic_map_add_constraints_dim_map(res, bmap, dim_map);
2547 /* Turn the n dimensions of type type, starting at first
2548 * into existentially quantified variables.
2550 __isl_give isl_basic_map *isl_basic_map_project_out(
2551 __isl_take isl_basic_map *bmap,
2552 enum isl_dim_type type, unsigned first, unsigned n)
2565 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL))
2566 return isl_basic_map_remove_dims(bmap, type, first, n);
2568 isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
2571 bmap = move_last(bmap, type, first, n);
2572 bmap = isl_basic_map_cow(bmap);
2576 row_size = 1 + isl_dim_total(bmap->dim) + bmap->extra;
2577 old = bmap->block2.data;
2578 bmap->block2 = isl_blk_extend(bmap->ctx, bmap->block2,
2579 (bmap->extra + n) * (1 + row_size));
2580 if (!bmap->block2.data)
2582 new_div = isl_alloc_array(bmap->ctx, isl_int *, bmap->extra + n);
2585 for (i = 0; i < n; ++i) {
2586 new_div[i] = bmap->block2.data +
2587 (bmap->extra + i) * (1 + row_size);
2588 isl_seq_clr(new_div[i], 1 + row_size);
2590 for (i = 0; i < bmap->extra; ++i)
2591 new_div[n + i] = bmap->block2.data + (bmap->div[i] - old);
2593 bmap->div = new_div;
2597 bmap->dim = isl_dim_drop(bmap->dim, type, first, n);
2600 bmap = isl_basic_map_simplify(bmap);
2601 bmap = isl_basic_map_drop_redundant_divs(bmap);
2602 return isl_basic_map_finalize(bmap);
2604 isl_basic_map_free(bmap);
2608 /* Turn the n dimensions of type type, starting at first
2609 * into existentially quantified variables.
2611 struct isl_basic_set *isl_basic_set_project_out(struct isl_basic_set *bset,
2612 enum isl_dim_type type, unsigned first, unsigned n)
2614 return (isl_basic_set *)isl_basic_map_project_out(
2615 (isl_basic_map *)bset, type, first, n);
2618 /* Turn the n dimensions of type type, starting at first
2619 * into existentially quantified variables.
2621 __isl_give isl_map *isl_map_project_out(__isl_take isl_map *map,
2622 enum isl_dim_type type, unsigned first, unsigned n)
2632 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
2634 map = isl_map_cow(map);
2638 map->dim = isl_dim_drop(map->dim, type, first, n);
2642 for (i = 0; i < map->n; ++i) {
2643 map->p[i] = isl_basic_map_project_out(map->p[i], type, first, n);
2654 /* Turn the n dimensions of type type, starting at first
2655 * into existentially quantified variables.
2657 __isl_give isl_set *isl_set_project_out(__isl_take isl_set *set,
2658 enum isl_dim_type type, unsigned first, unsigned n)
2660 return (isl_set *)isl_map_project_out((isl_map *)set, type, first, n);
2663 static struct isl_basic_map *add_divs(struct isl_basic_map *bmap, unsigned n)
2667 for (i = 0; i < n; ++i) {
2668 j = isl_basic_map_alloc_div(bmap);
2671 isl_seq_clr(bmap->div[j], 1+1+isl_basic_map_total_dim(bmap));
2675 isl_basic_map_free(bmap);
2679 struct isl_basic_map *isl_basic_map_apply_range(
2680 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2682 struct isl_dim *dim_result = NULL;
2683 struct isl_basic_map *bmap;
2684 unsigned n_in, n_out, n, nparam, total, pos;
2685 struct isl_dim_map *dim_map1, *dim_map2;
2687 if (!bmap1 || !bmap2)
2690 dim_result = isl_dim_join(isl_dim_copy(bmap1->dim),
2691 isl_dim_copy(bmap2->dim));
2693 n_in = isl_basic_map_n_in(bmap1);
2694 n_out = isl_basic_map_n_out(bmap2);
2695 n = isl_basic_map_n_out(bmap1);
2696 nparam = isl_basic_map_n_param(bmap1);
2698 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + n;
2699 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
2700 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
2701 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
2702 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
2703 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
2704 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_in);
2705 isl_dim_map_div(dim_map1, bmap1, pos += n_out);
2706 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
2707 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
2708 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
2710 bmap = isl_basic_map_alloc_dim(dim_result,
2711 bmap1->n_div + bmap2->n_div + n,
2712 bmap1->n_eq + bmap2->n_eq,
2713 bmap1->n_ineq + bmap2->n_ineq);
2714 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap1, dim_map1);
2715 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap2, dim_map2);
2716 bmap = add_divs(bmap, n);
2717 bmap = isl_basic_map_simplify(bmap);
2718 bmap = isl_basic_map_drop_redundant_divs(bmap);
2719 return isl_basic_map_finalize(bmap);
2721 isl_basic_map_free(bmap1);
2722 isl_basic_map_free(bmap2);
2726 struct isl_basic_set *isl_basic_set_apply(
2727 struct isl_basic_set *bset, struct isl_basic_map *bmap)
2732 isl_assert(bset->ctx, isl_basic_map_compatible_domain(bmap, bset),
2735 return (struct isl_basic_set *)
2736 isl_basic_map_apply_range((struct isl_basic_map *)bset, bmap);
2738 isl_basic_set_free(bset);
2739 isl_basic_map_free(bmap);
2743 struct isl_basic_map *isl_basic_map_apply_domain(
2744 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2746 if (!bmap1 || !bmap2)
2749 isl_assert(bmap1->ctx,
2750 isl_basic_map_n_in(bmap1) == isl_basic_map_n_in(bmap2), goto error);
2751 isl_assert(bmap1->ctx,
2752 isl_basic_map_n_param(bmap1) == isl_basic_map_n_param(bmap2),
2755 bmap1 = isl_basic_map_reverse(bmap1);
2756 bmap1 = isl_basic_map_apply_range(bmap1, bmap2);
2757 return isl_basic_map_reverse(bmap1);
2759 isl_basic_map_free(bmap1);
2760 isl_basic_map_free(bmap2);
2764 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
2765 * A \cap B -> f(A) + f(B)
2767 struct isl_basic_map *isl_basic_map_sum(
2768 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2770 unsigned n_in, n_out, nparam, total, pos;
2771 struct isl_basic_map *bmap = NULL;
2772 struct isl_dim_map *dim_map1, *dim_map2;
2775 if (!bmap1 || !bmap2)
2778 isl_assert(bmap1->ctx, isl_dim_equal(bmap1->dim, bmap2->dim),
2781 nparam = isl_basic_map_n_param(bmap1);
2782 n_in = isl_basic_map_n_in(bmap1);
2783 n_out = isl_basic_map_n_out(bmap1);
2785 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + 2 * n_out;
2786 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
2787 dim_map2 = isl_dim_map_alloc(bmap2->ctx, total);
2788 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
2789 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos);
2790 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
2791 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
2792 isl_dim_map_div(dim_map1, bmap1, pos += n_in + n_out);
2793 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
2794 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
2795 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_out);
2797 bmap = isl_basic_map_alloc_dim(isl_dim_copy(bmap1->dim),
2798 bmap1->n_div + bmap2->n_div + 2 * n_out,
2799 bmap1->n_eq + bmap2->n_eq + n_out,
2800 bmap1->n_ineq + bmap2->n_ineq);
2801 for (i = 0; i < n_out; ++i) {
2802 int j = isl_basic_map_alloc_equality(bmap);
2805 isl_seq_clr(bmap->eq[j], 1+total);
2806 isl_int_set_si(bmap->eq[j][1+nparam+n_in+i], -1);
2807 isl_int_set_si(bmap->eq[j][1+pos+i], 1);
2808 isl_int_set_si(bmap->eq[j][1+pos-n_out+i], 1);
2810 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap1, dim_map1);
2811 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap2, dim_map2);
2812 bmap = add_divs(bmap, 2 * n_out);
2814 bmap = isl_basic_map_simplify(bmap);
2815 return isl_basic_map_finalize(bmap);
2817 isl_basic_map_free(bmap);
2818 isl_basic_map_free(bmap1);
2819 isl_basic_map_free(bmap2);
2823 /* Given two maps A -> f(A) and B -> g(B), construct a map
2824 * A \cap B -> f(A) + f(B)
2826 struct isl_map *isl_map_sum(struct isl_map *map1, struct isl_map *map2)
2828 struct isl_map *result;
2834 isl_assert(map1->ctx, isl_dim_equal(map1->dim, map2->dim), goto error);
2836 result = isl_map_alloc_dim(isl_dim_copy(map1->dim),
2837 map1->n * map2->n, 0);
2840 for (i = 0; i < map1->n; ++i)
2841 for (j = 0; j < map2->n; ++j) {
2842 struct isl_basic_map *part;
2843 part = isl_basic_map_sum(
2844 isl_basic_map_copy(map1->p[i]),
2845 isl_basic_map_copy(map2->p[j]));
2846 if (isl_basic_map_is_empty(part))
2847 isl_basic_map_free(part);
2849 result = isl_map_add_basic_map(result, part);
2862 __isl_give isl_set *isl_set_sum(__isl_take isl_set *set1,
2863 __isl_take isl_set *set2)
2865 return (isl_set *)isl_map_sum((isl_map *)set1, (isl_map *)set2);
2868 /* Given a basic map A -> f(A), construct A -> -f(A).
2870 struct isl_basic_map *isl_basic_map_neg(struct isl_basic_map *bmap)
2875 bmap = isl_basic_map_cow(bmap);
2879 n = isl_basic_map_dim(bmap, isl_dim_out);
2880 off = isl_basic_map_offset(bmap, isl_dim_out);
2881 for (i = 0; i < bmap->n_eq; ++i)
2882 for (j = 0; j < n; ++j)
2883 isl_int_neg(bmap->eq[i][off+j], bmap->eq[i][off+j]);
2884 for (i = 0; i < bmap->n_ineq; ++i)
2885 for (j = 0; j < n; ++j)
2886 isl_int_neg(bmap->ineq[i][off+j], bmap->ineq[i][off+j]);
2887 for (i = 0; i < bmap->n_div; ++i)
2888 for (j = 0; j < n; ++j)
2889 isl_int_neg(bmap->div[i][1+off+j], bmap->div[i][1+off+j]);
2890 return isl_basic_map_finalize(bmap);
2893 __isl_give isl_basic_set *isl_basic_set_neg(__isl_take isl_basic_set *bset)
2895 return isl_basic_map_neg(bset);
2898 /* Given a map A -> f(A), construct A -> -f(A).
2900 struct isl_map *isl_map_neg(struct isl_map *map)
2904 map = isl_map_cow(map);
2908 for (i = 0; i < map->n; ++i) {
2909 map->p[i] = isl_basic_map_neg(map->p[i]);
2920 __isl_give isl_set *isl_set_neg(__isl_take isl_set *set)
2922 return (isl_set *)isl_map_neg((isl_map *)set);
2925 /* Given a basic map A -> f(A) and an integer d, construct a basic map
2926 * A -> floor(f(A)/d).
2928 struct isl_basic_map *isl_basic_map_floordiv(struct isl_basic_map *bmap,
2931 unsigned n_in, n_out, nparam, total, pos;
2932 struct isl_basic_map *result = NULL;
2933 struct isl_dim_map *dim_map;
2939 nparam = isl_basic_map_n_param(bmap);
2940 n_in = isl_basic_map_n_in(bmap);
2941 n_out = isl_basic_map_n_out(bmap);
2943 total = nparam + n_in + n_out + bmap->n_div + n_out;
2944 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2945 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_param, pos = 0);
2946 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_in, pos += nparam);
2947 isl_dim_map_div(dim_map, bmap, pos += n_in + n_out);
2948 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_out, pos += bmap->n_div);
2950 result = isl_basic_map_alloc_dim(isl_dim_copy(bmap->dim),
2951 bmap->n_div + n_out,
2952 bmap->n_eq, bmap->n_ineq + 2 * n_out);
2953 result = isl_basic_map_add_constraints_dim_map(result, bmap, dim_map);
2954 result = add_divs(result, n_out);
2955 for (i = 0; i < n_out; ++i) {
2957 j = isl_basic_map_alloc_inequality(result);
2960 isl_seq_clr(result->ineq[j], 1+total);
2961 isl_int_neg(result->ineq[j][1+nparam+n_in+i], d);
2962 isl_int_set_si(result->ineq[j][1+pos+i], 1);
2963 j = isl_basic_map_alloc_inequality(result);
2966 isl_seq_clr(result->ineq[j], 1+total);
2967 isl_int_set(result->ineq[j][1+nparam+n_in+i], d);
2968 isl_int_set_si(result->ineq[j][1+pos+i], -1);
2969 isl_int_sub_ui(result->ineq[j][0], d, 1);
2972 result = isl_basic_map_simplify(result);
2973 return isl_basic_map_finalize(result);
2975 isl_basic_map_free(result);
2979 /* Given a map A -> f(A) and an integer d, construct a map
2980 * A -> floor(f(A)/d).
2982 struct isl_map *isl_map_floordiv(struct isl_map *map, isl_int d)
2986 map = isl_map_cow(map);
2990 ISL_F_CLR(map, ISL_MAP_DISJOINT);
2991 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
2992 for (i = 0; i < map->n; ++i) {
2993 map->p[i] = isl_basic_map_floordiv(map->p[i], d);
3004 static struct isl_basic_map *var_equal(struct isl_basic_map *bmap, unsigned pos)
3010 i = isl_basic_map_alloc_equality(bmap);
3013 nparam = isl_basic_map_n_param(bmap);
3014 n_in = isl_basic_map_n_in(bmap);
3015 isl_seq_clr(bmap->eq[i], 1 + isl_basic_map_total_dim(bmap));
3016 isl_int_set_si(bmap->eq[i][1+nparam+pos], -1);
3017 isl_int_set_si(bmap->eq[i][1+nparam+n_in+pos], 1);
3018 return isl_basic_map_finalize(bmap);
3020 isl_basic_map_free(bmap);
3024 /* Add a constraints to "bmap" expressing i_pos < o_pos
3026 static struct isl_basic_map *var_less(struct isl_basic_map *bmap, unsigned pos)
3032 i = isl_basic_map_alloc_inequality(bmap);
3035 nparam = isl_basic_map_n_param(bmap);
3036 n_in = isl_basic_map_n_in(bmap);
3037 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
3038 isl_int_set_si(bmap->ineq[i][0], -1);
3039 isl_int_set_si(bmap->ineq[i][1+nparam+pos], -1);
3040 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], 1);
3041 return isl_basic_map_finalize(bmap);
3043 isl_basic_map_free(bmap);
3047 /* Add a constraint to "bmap" expressing i_pos <= o_pos
3049 static __isl_give isl_basic_map *var_less_or_equal(
3050 __isl_take isl_basic_map *bmap, unsigned pos)
3056 i = isl_basic_map_alloc_inequality(bmap);
3059 nparam = isl_basic_map_n_param(bmap);
3060 n_in = isl_basic_map_n_in(bmap);
3061 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
3062 isl_int_set_si(bmap->ineq[i][1+nparam+pos], -1);
3063 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], 1);
3064 return isl_basic_map_finalize(bmap);
3066 isl_basic_map_free(bmap);
3070 /* Add a constraints to "bmap" expressing i_pos > o_pos
3072 static struct isl_basic_map *var_more(struct isl_basic_map *bmap, unsigned pos)
3078 i = isl_basic_map_alloc_inequality(bmap);
3081 nparam = isl_basic_map_n_param(bmap);
3082 n_in = isl_basic_map_n_in(bmap);
3083 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
3084 isl_int_set_si(bmap->ineq[i][0], -1);
3085 isl_int_set_si(bmap->ineq[i][1+nparam+pos], 1);
3086 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], -1);
3087 return isl_basic_map_finalize(bmap);
3089 isl_basic_map_free(bmap);
3093 /* Add a constraint to "bmap" expressing i_pos >= o_pos
3095 static __isl_give isl_basic_map *var_more_or_equal(
3096 __isl_take isl_basic_map *bmap, unsigned pos)
3102 i = isl_basic_map_alloc_inequality(bmap);
3105 nparam = isl_basic_map_n_param(bmap);
3106 n_in = isl_basic_map_n_in(bmap);
3107 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
3108 isl_int_set_si(bmap->ineq[i][1+nparam+pos], 1);
3109 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], -1);
3110 return isl_basic_map_finalize(bmap);
3112 isl_basic_map_free(bmap);
3116 struct isl_basic_map *isl_basic_map_equal(struct isl_dim *dim, unsigned n_equal)
3119 struct isl_basic_map *bmap;
3120 bmap = isl_basic_map_alloc_dim(dim, 0, n_equal, 0);
3123 for (i = 0; i < n_equal && bmap; ++i)
3124 bmap = var_equal(bmap, i);
3125 return isl_basic_map_finalize(bmap);
3128 /* Return a relation on of dimension "dim" expressing i_[0..pos] << o_[0..pos]
3130 struct isl_basic_map *isl_basic_map_less_at(struct isl_dim *dim, unsigned pos)
3133 struct isl_basic_map *bmap;
3134 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
3137 for (i = 0; i < pos && bmap; ++i)
3138 bmap = var_equal(bmap, i);
3140 bmap = var_less(bmap, pos);
3141 return isl_basic_map_finalize(bmap);
3144 /* Return a relation on of dimension "dim" expressing i_[0..pos] <<= o_[0..pos]
3146 __isl_give isl_basic_map *isl_basic_map_less_or_equal_at(
3147 __isl_take isl_dim *dim, unsigned pos)
3150 isl_basic_map *bmap;
3152 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
3153 for (i = 0; i < pos; ++i)
3154 bmap = var_equal(bmap, i);
3155 bmap = var_less_or_equal(bmap, pos);
3156 return isl_basic_map_finalize(bmap);
3159 /* Return a relation on pairs of sets of dimension "dim" expressing i_pos > o_pos
3161 struct isl_basic_map *isl_basic_map_more_at(struct isl_dim *dim, unsigned pos)
3164 struct isl_basic_map *bmap;
3165 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
3168 for (i = 0; i < pos && bmap; ++i)
3169 bmap = var_equal(bmap, i);
3171 bmap = var_more(bmap, pos);
3172 return isl_basic_map_finalize(bmap);
3175 /* Return a relation on of dimension "dim" expressing i_[0..pos] >>= o_[0..pos]
3177 __isl_give isl_basic_map *isl_basic_map_more_or_equal_at(
3178 __isl_take isl_dim *dim, unsigned pos)
3181 isl_basic_map *bmap;
3183 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
3184 for (i = 0; i < pos; ++i)
3185 bmap = var_equal(bmap, i);
3186 bmap = var_more_or_equal(bmap, pos);
3187 return isl_basic_map_finalize(bmap);
3190 static __isl_give isl_map *map_lex_lte_first(__isl_take isl_dim *dims,
3191 unsigned n, int equal)
3193 struct isl_map *map;
3196 if (n == 0 && equal)
3197 return isl_map_universe(dims);
3199 map = isl_map_alloc_dim(isl_dim_copy(dims), n, ISL_MAP_DISJOINT);
3201 for (i = 0; i + 1 < n; ++i)
3202 map = isl_map_add_basic_map(map,
3203 isl_basic_map_less_at(isl_dim_copy(dims), i));
3206 map = isl_map_add_basic_map(map,
3207 isl_basic_map_less_or_equal_at(dims, n - 1));
3209 map = isl_map_add_basic_map(map,
3210 isl_basic_map_less_at(dims, n - 1));
3217 static __isl_give isl_map *map_lex_lte(__isl_take isl_dim *dims, int equal)
3221 return map_lex_lte_first(dims, dims->n_out, equal);
3224 __isl_give isl_map *isl_map_lex_lt_first(__isl_take isl_dim *dim, unsigned n)
3226 return map_lex_lte_first(dim, n, 0);
3229 __isl_give isl_map *isl_map_lex_le_first(__isl_take isl_dim *dim, unsigned n)
3231 return map_lex_lte_first(dim, n, 1);
3234 __isl_give isl_map *isl_map_lex_lt(__isl_take isl_dim *set_dim)
3236 return map_lex_lte(isl_dim_map_from_set(set_dim), 0);
3239 __isl_give isl_map *isl_map_lex_le(__isl_take isl_dim *set_dim)
3241 return map_lex_lte(isl_dim_map_from_set(set_dim), 1);
3244 static __isl_give isl_map *map_lex_gte_first(__isl_take isl_dim *dims,
3245 unsigned n, int equal)
3247 struct isl_map *map;
3250 if (n == 0 && equal)
3251 return isl_map_universe(dims);
3253 map = isl_map_alloc_dim(isl_dim_copy(dims), n, ISL_MAP_DISJOINT);
3255 for (i = 0; i + 1 < n; ++i)
3256 map = isl_map_add_basic_map(map,
3257 isl_basic_map_more_at(isl_dim_copy(dims), i));
3260 map = isl_map_add_basic_map(map,
3261 isl_basic_map_more_or_equal_at(dims, n - 1));
3263 map = isl_map_add_basic_map(map,
3264 isl_basic_map_more_at(dims, n - 1));
3271 static __isl_give isl_map *map_lex_gte(__isl_take isl_dim *dims, int equal)
3275 return map_lex_gte_first(dims, dims->n_out, equal);
3278 __isl_give isl_map *isl_map_lex_gt_first(__isl_take isl_dim *dim, unsigned n)
3280 return map_lex_gte_first(dim, n, 0);
3283 __isl_give isl_map *isl_map_lex_ge_first(__isl_take isl_dim *dim, unsigned n)
3285 return map_lex_gte_first(dim, n, 1);
3288 __isl_give isl_map *isl_map_lex_gt(__isl_take isl_dim *set_dim)
3290 return map_lex_gte(isl_dim_map_from_set(set_dim), 0);
3293 __isl_give isl_map *isl_map_lex_ge(__isl_take isl_dim *set_dim)
3295 return map_lex_gte(isl_dim_map_from_set(set_dim), 1);
3298 __isl_give isl_map *isl_set_lex_le_set(__isl_take isl_set *set1,
3299 __isl_take isl_set *set2)
3302 map = isl_map_lex_le(isl_set_get_dim(set1));
3303 map = isl_map_intersect_domain(map, set1);
3304 map = isl_map_intersect_range(map, set2);
3308 __isl_give isl_map *isl_set_lex_lt_set(__isl_take isl_set *set1,
3309 __isl_take isl_set *set2)
3312 map = isl_map_lex_lt(isl_set_get_dim(set1));
3313 map = isl_map_intersect_domain(map, set1);
3314 map = isl_map_intersect_range(map, set2);
3318 __isl_give isl_map *isl_set_lex_ge_set(__isl_take isl_set *set1,
3319 __isl_take isl_set *set2)
3322 map = isl_map_lex_ge(isl_set_get_dim(set1));
3323 map = isl_map_intersect_domain(map, set1);
3324 map = isl_map_intersect_range(map, set2);
3328 __isl_give isl_map *isl_set_lex_gt_set(__isl_take isl_set *set1,
3329 __isl_take isl_set *set2)
3332 map = isl_map_lex_gt(isl_set_get_dim(set1));
3333 map = isl_map_intersect_domain(map, set1);
3334 map = isl_map_intersect_range(map, set2);
3338 __isl_give isl_map *isl_map_lex_le_map(__isl_take isl_map *map1,
3339 __isl_take isl_map *map2)
3342 map = isl_map_lex_le(isl_dim_range(isl_map_get_dim(map1)));
3343 map = isl_map_apply_domain(map, isl_map_reverse(map1));
3344 map = isl_map_apply_range(map, isl_map_reverse(map2));
3348 __isl_give isl_map *isl_map_lex_lt_map(__isl_take isl_map *map1,
3349 __isl_take isl_map *map2)
3352 map = isl_map_lex_lt(isl_dim_range(isl_map_get_dim(map1)));
3353 map = isl_map_apply_domain(map, isl_map_reverse(map1));
3354 map = isl_map_apply_range(map, isl_map_reverse(map2));
3358 __isl_give isl_map *isl_map_lex_ge_map(__isl_take isl_map *map1,
3359 __isl_take isl_map *map2)
3362 map = isl_map_lex_ge(isl_dim_range(isl_map_get_dim(map1)));
3363 map = isl_map_apply_domain(map, isl_map_reverse(map1));
3364 map = isl_map_apply_range(map, isl_map_reverse(map2));
3368 __isl_give isl_map *isl_map_lex_gt_map(__isl_take isl_map *map1,
3369 __isl_take isl_map *map2)
3372 map = isl_map_lex_gt(isl_dim_range(isl_map_get_dim(map1)));
3373 map = isl_map_apply_domain(map, isl_map_reverse(map1));
3374 map = isl_map_apply_range(map, isl_map_reverse(map2));
3378 struct isl_basic_map *isl_basic_map_from_basic_set(
3379 struct isl_basic_set *bset, struct isl_dim *dim)
3381 struct isl_basic_map *bmap;
3383 bset = isl_basic_set_cow(bset);
3387 isl_assert(bset->ctx, isl_dim_compatible(bset->dim, dim), goto error);
3388 isl_dim_free(bset->dim);
3389 bmap = (struct isl_basic_map *) bset;
3391 return isl_basic_map_finalize(bmap);
3393 isl_basic_set_free(bset);
3398 struct isl_basic_set *isl_basic_set_from_basic_map(struct isl_basic_map *bmap)
3402 if (bmap->dim->n_in == 0)
3403 return (struct isl_basic_set *)bmap;
3404 bmap = isl_basic_map_cow(bmap);
3407 bmap->dim = isl_dim_as_set_dim(bmap->dim);
3410 bmap = isl_basic_map_finalize(bmap);
3411 return (struct isl_basic_set *)bmap;
3413 isl_basic_map_free(bmap);
3417 /* For a div d = floor(f/m), add the constraints
3420 * -(f-(n-1)) + m d >= 0
3422 * Note that the second constraint is the negation of
3426 int isl_basic_map_add_div_constraints_var(__isl_keep isl_basic_map *bmap,
3427 unsigned pos, isl_int *div)
3430 unsigned total = isl_basic_map_total_dim(bmap);
3432 i = isl_basic_map_alloc_inequality(bmap);
3435 isl_seq_cpy(bmap->ineq[i], div + 1, 1 + total);
3436 isl_int_neg(bmap->ineq[i][1 + pos], div[0]);
3438 j = isl_basic_map_alloc_inequality(bmap);
3441 isl_seq_neg(bmap->ineq[j], bmap->ineq[i], 1 + total);
3442 isl_int_add(bmap->ineq[j][0], bmap->ineq[j][0], bmap->ineq[j][1 + pos]);
3443 isl_int_sub_ui(bmap->ineq[j][0], bmap->ineq[j][0], 1);
3447 int isl_basic_set_add_div_constraints_var(__isl_keep isl_basic_set *bset,
3448 unsigned pos, isl_int *div)
3450 return isl_basic_map_add_div_constraints_var((isl_basic_map *)bset,
3454 int isl_basic_map_add_div_constraints(struct isl_basic_map *bmap, unsigned div)
3456 unsigned total = isl_basic_map_total_dim(bmap);
3457 unsigned div_pos = total - bmap->n_div + div;
3459 return isl_basic_map_add_div_constraints_var(bmap, div_pos,
3463 struct isl_basic_set *isl_basic_map_underlying_set(
3464 struct isl_basic_map *bmap)
3468 if (bmap->dim->nparam == 0 && bmap->dim->n_in == 0 &&
3470 !isl_dim_is_named_or_nested(bmap->dim, isl_dim_in) &&
3471 !isl_dim_is_named_or_nested(bmap->dim, isl_dim_out))
3472 return (struct isl_basic_set *)bmap;
3473 bmap = isl_basic_map_cow(bmap);
3476 bmap->dim = isl_dim_underlying(bmap->dim, bmap->n_div);
3479 bmap->extra -= bmap->n_div;
3481 bmap = isl_basic_map_finalize(bmap);
3482 return (struct isl_basic_set *)bmap;
3487 __isl_give isl_basic_set *isl_basic_set_underlying_set(
3488 __isl_take isl_basic_set *bset)
3490 return isl_basic_map_underlying_set((isl_basic_map *)bset);
3493 struct isl_basic_map *isl_basic_map_overlying_set(
3494 struct isl_basic_set *bset, struct isl_basic_map *like)
3496 struct isl_basic_map *bmap;
3497 struct isl_ctx *ctx;
3504 isl_assert(ctx, bset->n_div == 0, goto error);
3505 isl_assert(ctx, isl_basic_set_n_param(bset) == 0, goto error);
3506 isl_assert(ctx, bset->dim->n_out == isl_basic_map_total_dim(like),
3508 if (isl_dim_equal(bset->dim, like->dim) && like->n_div == 0) {
3509 isl_basic_map_free(like);
3510 return (struct isl_basic_map *)bset;
3512 bset = isl_basic_set_cow(bset);
3515 total = bset->dim->n_out + bset->extra;
3516 bmap = (struct isl_basic_map *)bset;
3517 isl_dim_free(bmap->dim);
3518 bmap->dim = isl_dim_copy(like->dim);
3521 bmap->n_div = like->n_div;
3522 bmap->extra += like->n_div;
3526 ltotal = total - bmap->extra + like->extra;
3529 bmap->block2 = isl_blk_extend(ctx, bmap->block2,
3530 bmap->extra * (1 + 1 + total));
3531 if (isl_blk_is_error(bmap->block2))
3533 div = isl_realloc_array(ctx, bmap->div, isl_int *, bmap->extra);
3537 for (i = 0; i < bmap->extra; ++i)
3538 bmap->div[i] = bmap->block2.data + i * (1 + 1 + total);
3539 for (i = 0; i < like->n_div; ++i) {
3540 isl_seq_cpy(bmap->div[i], like->div[i], 1 + 1 + ltotal);
3541 isl_seq_clr(bmap->div[i]+1+1+ltotal, total - ltotal);
3543 bmap = isl_basic_map_extend_constraints(bmap,
3544 0, 2 * like->n_div);
3545 for (i = 0; i < like->n_div; ++i) {
3546 if (isl_int_is_zero(bmap->div[i][0]))
3548 if (isl_basic_map_add_div_constraints(bmap, i) < 0)
3552 isl_basic_map_free(like);
3553 bmap = isl_basic_map_simplify(bmap);
3554 bmap = isl_basic_map_finalize(bmap);
3557 isl_basic_map_free(like);
3558 isl_basic_set_free(bset);
3562 struct isl_basic_set *isl_basic_set_from_underlying_set(
3563 struct isl_basic_set *bset, struct isl_basic_set *like)
3565 return (struct isl_basic_set *)
3566 isl_basic_map_overlying_set(bset, (struct isl_basic_map *)like);
3569 struct isl_set *isl_set_from_underlying_set(
3570 struct isl_set *set, struct isl_basic_set *like)
3576 isl_assert(set->ctx, set->dim->n_out == isl_basic_set_total_dim(like),
3578 if (isl_dim_equal(set->dim, like->dim) && like->n_div == 0) {
3579 isl_basic_set_free(like);
3582 set = isl_set_cow(set);
3585 for (i = 0; i < set->n; ++i) {
3586 set->p[i] = isl_basic_set_from_underlying_set(set->p[i],
3587 isl_basic_set_copy(like));
3591 isl_dim_free(set->dim);
3592 set->dim = isl_dim_copy(like->dim);
3595 isl_basic_set_free(like);
3598 isl_basic_set_free(like);
3603 struct isl_set *isl_map_underlying_set(struct isl_map *map)
3607 map = isl_map_cow(map);
3610 map->dim = isl_dim_cow(map->dim);
3614 for (i = 1; i < map->n; ++i)
3615 isl_assert(map->ctx, map->p[0]->n_div == map->p[i]->n_div,
3617 for (i = 0; i < map->n; ++i) {
3618 map->p[i] = (struct isl_basic_map *)
3619 isl_basic_map_underlying_set(map->p[i]);
3624 map->dim = isl_dim_underlying(map->dim, 0);
3626 isl_dim_free(map->dim);
3627 map->dim = isl_dim_copy(map->p[0]->dim);
3631 return (struct isl_set *)map;
3637 struct isl_set *isl_set_to_underlying_set(struct isl_set *set)
3639 return (struct isl_set *)isl_map_underlying_set((struct isl_map *)set);
3642 __isl_give isl_basic_map *isl_basic_map_reset_dim(
3643 __isl_take isl_basic_map *bmap, __isl_take isl_dim *dim)
3645 bmap = isl_basic_map_cow(bmap);
3649 isl_dim_free(bmap->dim);
3652 bmap = isl_basic_map_finalize(bmap);
3656 isl_basic_map_free(bmap);
3661 __isl_give isl_basic_set *isl_basic_set_reset_dim(
3662 __isl_take isl_basic_set *bset, __isl_take isl_dim *dim)
3664 return (isl_basic_set *)isl_basic_map_reset_dim((isl_basic_map *)bset,
3668 __isl_give isl_map *isl_map_reset_dim(__isl_take isl_map *map,
3669 __isl_take isl_dim *dim)
3673 map = isl_map_cow(map);
3677 for (i = 0; i < map->n; ++i) {
3678 map->p[i] = isl_basic_map_reset_dim(map->p[i],
3683 isl_dim_free(map->dim);
3693 __isl_give isl_set *isl_set_reset_dim(__isl_take isl_set *set,
3694 __isl_take isl_dim *dim)
3696 return (struct isl_set *) isl_map_reset_dim((struct isl_map *)set, dim);
3699 struct isl_basic_set *isl_basic_map_domain(struct isl_basic_map *bmap)
3702 struct isl_basic_set *domain;
3708 dim = isl_dim_domain(isl_basic_map_get_dim(bmap));
3710 n_in = isl_basic_map_n_in(bmap);
3711 n_out = isl_basic_map_n_out(bmap);
3712 domain = isl_basic_set_from_basic_map(bmap);
3713 domain = isl_basic_set_project_out(domain, isl_dim_set, n_in, n_out);
3715 domain = isl_basic_set_reset_dim(domain, dim);
3720 struct isl_basic_set *isl_basic_map_range(struct isl_basic_map *bmap)
3722 return isl_basic_map_domain(isl_basic_map_reverse(bmap));
3725 __isl_give isl_basic_map *isl_basic_map_domain_map(
3726 __isl_take isl_basic_map *bmap)
3730 isl_basic_map *domain;
3731 isl_basic_set *bset;
3732 int nparam, n_in, n_out;
3735 nparam = isl_basic_map_dim(bmap, isl_dim_param);
3736 n_in = isl_basic_map_dim(bmap, isl_dim_in);
3737 n_out = isl_basic_map_dim(bmap, isl_dim_out);
3739 dim = isl_dim_from_range(isl_dim_domain(isl_basic_map_get_dim(bmap)));
3740 domain = isl_basic_map_universe(dim);
3742 bmap = isl_basic_map_from_domain(isl_basic_map_wrap(bmap));
3743 bmap = isl_basic_map_apply_range(bmap, domain);
3744 bmap = isl_basic_map_extend_constraints(bmap, n_in, 0);
3746 total = isl_basic_map_total_dim(bmap);
3748 for (i = 0; i < n_in; ++i) {
3749 k = isl_basic_map_alloc_equality(bmap);
3752 isl_seq_clr(bmap->eq[k], 1 + total);
3753 isl_int_set_si(bmap->eq[k][1 + nparam + i], -1);
3754 isl_int_set_si(bmap->eq[k][1 + nparam + n_in + n_out + i], 1);
3757 bmap = isl_basic_map_gauss(bmap, NULL);
3758 return isl_basic_map_finalize(bmap);
3760 isl_basic_map_free(bmap);
3764 __isl_give isl_basic_map *isl_basic_map_range_map(
3765 __isl_take isl_basic_map *bmap)
3769 isl_basic_map *range;
3770 isl_basic_set *bset;
3771 int nparam, n_in, n_out;
3774 nparam = isl_basic_map_dim(bmap, isl_dim_param);
3775 n_in = isl_basic_map_dim(bmap, isl_dim_in);
3776 n_out = isl_basic_map_dim(bmap, isl_dim_out);
3778 dim = isl_dim_from_range(isl_dim_range(isl_basic_map_get_dim(bmap)));
3779 range = isl_basic_map_universe(dim);
3781 bmap = isl_basic_map_from_domain(isl_basic_map_wrap(bmap));
3782 bmap = isl_basic_map_apply_range(bmap, range);
3783 bmap = isl_basic_map_extend_constraints(bmap, n_out, 0);
3785 total = isl_basic_map_total_dim(bmap);
3787 for (i = 0; i < n_out; ++i) {
3788 k = isl_basic_map_alloc_equality(bmap);
3791 isl_seq_clr(bmap->eq[k], 1 + total);
3792 isl_int_set_si(bmap->eq[k][1 + nparam + n_in + i], -1);
3793 isl_int_set_si(bmap->eq[k][1 + nparam + n_in + n_out + i], 1);
3796 bmap = isl_basic_map_gauss(bmap, NULL);
3797 return isl_basic_map_finalize(bmap);
3799 isl_basic_map_free(bmap);
3803 struct isl_set *isl_map_range(struct isl_map *map)
3806 struct isl_set *set;
3810 if (isl_map_dim(map, isl_dim_in) == 0)
3811 return (isl_set *)map;
3813 map = isl_map_cow(map);
3817 set = (struct isl_set *) map;
3818 set->dim = isl_dim_drop_inputs(set->dim, 0, set->dim->n_in);
3821 for (i = 0; i < map->n; ++i) {
3822 set->p[i] = isl_basic_map_range(map->p[i]);
3826 ISL_F_CLR(set, ISL_MAP_DISJOINT);
3827 ISL_F_CLR(set, ISL_SET_NORMALIZED);
3834 __isl_give isl_map *isl_map_domain_map(__isl_take isl_map *map)
3837 isl_dim *domain_dim;
3839 map = isl_map_cow(map);
3843 domain_dim = isl_dim_from_range(isl_dim_domain(isl_map_get_dim(map)));
3844 map->dim = isl_dim_from_domain(isl_dim_wrap(map->dim));
3845 map->dim = isl_dim_join(map->dim, domain_dim);
3848 for (i = 0; i < map->n; ++i) {
3849 map->p[i] = isl_basic_map_domain_map(map->p[i]);
3853 ISL_F_CLR(map, ISL_MAP_DISJOINT);
3854 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3861 __isl_give isl_map *isl_map_range_map(__isl_take isl_map *map)
3866 map = isl_map_cow(map);
3870 range_dim = isl_dim_range(isl_map_get_dim(map));
3871 map->dim = isl_dim_from_domain(isl_dim_wrap(map->dim));
3872 map->dim = isl_dim_join(map->dim, range_dim);
3875 for (i = 0; i < map->n; ++i) {
3876 map->p[i] = isl_basic_map_range_map(map->p[i]);
3880 ISL_F_CLR(map, ISL_MAP_DISJOINT);
3881 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3888 struct isl_map *isl_map_from_set(struct isl_set *set, struct isl_dim *dim)
3891 struct isl_map *map = NULL;
3893 set = isl_set_cow(set);
3896 isl_assert(set->ctx, isl_dim_compatible(set->dim, dim), goto error);
3897 map = (struct isl_map *)set;
3898 for (i = 0; i < set->n; ++i) {
3899 map->p[i] = isl_basic_map_from_basic_set(
3900 set->p[i], isl_dim_copy(dim));
3904 isl_dim_free(map->dim);
3913 __isl_give isl_basic_map *isl_basic_map_from_domain(
3914 __isl_take isl_basic_set *bset)
3916 return isl_basic_map_reverse(isl_basic_map_from_range(bset));
3919 __isl_give isl_basic_map *isl_basic_map_from_range(
3920 __isl_take isl_basic_set *bset)
3922 return (isl_basic_map *)bset;
3925 struct isl_map *isl_map_from_range(struct isl_set *set)
3927 return (struct isl_map *)set;
3930 __isl_give isl_map *isl_map_from_domain(__isl_take isl_set *set)
3932 return isl_map_reverse(isl_map_from_range(set));
3935 __isl_give isl_basic_map *isl_basic_map_from_domain_and_range(
3936 __isl_take isl_basic_set *domain, __isl_take isl_basic_set *range)
3938 return isl_basic_map_apply_range(isl_basic_map_from_domain(domain),
3939 isl_basic_map_from_range(range));
3942 __isl_give isl_map *isl_map_from_domain_and_range(__isl_take isl_set *domain,
3943 __isl_take isl_set *range)
3945 return isl_map_apply_range(isl_map_from_domain(domain),
3946 isl_map_from_range(range));
3949 struct isl_set *isl_set_from_map(struct isl_map *map)
3952 struct isl_set *set = NULL;
3956 map = isl_map_cow(map);
3959 map->dim = isl_dim_as_set_dim(map->dim);
3962 set = (struct isl_set *)map;
3963 for (i = 0; i < map->n; ++i) {
3964 set->p[i] = isl_basic_set_from_basic_map(map->p[i]);
3974 struct isl_map *isl_map_alloc_dim(struct isl_dim *dim, int n, unsigned flags)
3976 struct isl_map *map;
3980 isl_assert(dim->ctx, n >= 0, return NULL);
3981 map = isl_alloc(dim->ctx, struct isl_map,
3982 sizeof(struct isl_map) +
3983 (n - 1) * sizeof(struct isl_basic_map *));
3987 map->ctx = dim->ctx;
3988 isl_ctx_ref(map->ctx);
4000 struct isl_map *isl_map_alloc(struct isl_ctx *ctx,
4001 unsigned nparam, unsigned in, unsigned out, int n,
4004 struct isl_map *map;
4005 struct isl_dim *dims;
4007 dims = isl_dim_alloc(ctx, nparam, in, out);
4011 map = isl_map_alloc_dim(dims, n, flags);
4015 struct isl_basic_map *isl_basic_map_empty(struct isl_dim *dim)
4017 struct isl_basic_map *bmap;
4018 bmap = isl_basic_map_alloc_dim(dim, 0, 1, 0);
4019 bmap = isl_basic_map_set_to_empty(bmap);
4023 struct isl_basic_set *isl_basic_set_empty(struct isl_dim *dim)
4025 struct isl_basic_set *bset;
4026 bset = isl_basic_set_alloc_dim(dim, 0, 1, 0);
4027 bset = isl_basic_set_set_to_empty(bset);
4031 struct isl_basic_map *isl_basic_map_empty_like(struct isl_basic_map *model)
4033 struct isl_basic_map *bmap;
4036 bmap = isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
4037 bmap = isl_basic_map_set_to_empty(bmap);
4041 struct isl_basic_map *isl_basic_map_empty_like_map(struct isl_map *model)
4043 struct isl_basic_map *bmap;
4046 bmap = isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
4047 bmap = isl_basic_map_set_to_empty(bmap);
4051 struct isl_basic_set *isl_basic_set_empty_like(struct isl_basic_set *model)
4053 struct isl_basic_set *bset;
4056 bset = isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
4057 bset = isl_basic_set_set_to_empty(bset);
4061 struct isl_basic_map *isl_basic_map_universe(struct isl_dim *dim)
4063 struct isl_basic_map *bmap;
4064 bmap = isl_basic_map_alloc_dim(dim, 0, 0, 0);
4065 bmap = isl_basic_map_finalize(bmap);
4069 struct isl_basic_set *isl_basic_set_universe(struct isl_dim *dim)
4071 struct isl_basic_set *bset;
4072 bset = isl_basic_set_alloc_dim(dim, 0, 0, 0);
4073 bset = isl_basic_set_finalize(bset);
4077 __isl_give isl_basic_map *isl_basic_map_nat_universe(__isl_take isl_dim *dim)
4080 unsigned total = isl_dim_total(dim);
4081 isl_basic_map *bmap;
4083 bmap= isl_basic_map_alloc_dim(dim, 0, 0, total);
4084 for (i = 0; i < total; ++i) {
4085 int k = isl_basic_map_alloc_inequality(bmap);
4088 isl_seq_clr(bmap->ineq[k], 1 + total);
4089 isl_int_set_si(bmap->ineq[k][1 + i], 1);
4093 isl_basic_map_free(bmap);
4097 __isl_give isl_basic_set *isl_basic_set_nat_universe(__isl_take isl_dim *dim)
4099 return isl_basic_map_nat_universe(dim);
4102 __isl_give isl_map *isl_map_nat_universe(__isl_take isl_dim *dim)
4104 return isl_map_from_basic_map(isl_basic_map_nat_universe(dim));
4107 __isl_give isl_set *isl_set_nat_universe(__isl_take isl_dim *dim)
4109 return isl_map_nat_universe(dim);
4112 __isl_give isl_basic_map *isl_basic_map_universe_like(
4113 __isl_keep isl_basic_map *model)
4117 return isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
4120 struct isl_basic_set *isl_basic_set_universe_like(struct isl_basic_set *model)
4124 return isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
4127 __isl_give isl_basic_set *isl_basic_set_universe_like_set(
4128 __isl_keep isl_set *model)
4132 return isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
4135 struct isl_map *isl_map_empty(struct isl_dim *dim)
4137 return isl_map_alloc_dim(dim, 0, ISL_MAP_DISJOINT);
4140 struct isl_map *isl_map_empty_like(struct isl_map *model)
4144 return isl_map_alloc_dim(isl_dim_copy(model->dim), 0, ISL_MAP_DISJOINT);
4147 struct isl_map *isl_map_empty_like_basic_map(struct isl_basic_map *model)
4151 return isl_map_alloc_dim(isl_dim_copy(model->dim), 0, ISL_MAP_DISJOINT);
4154 struct isl_set *isl_set_empty(struct isl_dim *dim)
4156 return isl_set_alloc_dim(dim, 0, ISL_MAP_DISJOINT);
4159 struct isl_set *isl_set_empty_like(struct isl_set *model)
4163 return isl_set_empty(isl_dim_copy(model->dim));
4166 struct isl_map *isl_map_universe(struct isl_dim *dim)
4168 struct isl_map *map;
4171 map = isl_map_alloc_dim(isl_dim_copy(dim), 1, ISL_MAP_DISJOINT);
4172 map = isl_map_add_basic_map(map, isl_basic_map_universe(dim));
4176 struct isl_set *isl_set_universe(struct isl_dim *dim)
4178 struct isl_set *set;
4181 set = isl_set_alloc_dim(isl_dim_copy(dim), 1, ISL_MAP_DISJOINT);
4182 set = isl_set_add_basic_set(set, isl_basic_set_universe(dim));
4186 __isl_give isl_set *isl_set_universe_like(__isl_keep isl_set *model)
4190 return isl_set_universe(isl_dim_copy(model->dim));
4193 struct isl_map *isl_map_dup(struct isl_map *map)
4196 struct isl_map *dup;
4200 dup = isl_map_alloc_dim(isl_dim_copy(map->dim), map->n, map->flags);
4201 for (i = 0; i < map->n; ++i)
4202 dup = isl_map_add_basic_map(dup, isl_basic_map_copy(map->p[i]));
4206 __isl_give isl_map *isl_map_add_basic_map(__isl_take isl_map *map,
4207 __isl_take isl_basic_map *bmap)
4211 if (isl_basic_map_fast_is_empty(bmap)) {
4212 isl_basic_map_free(bmap);
4215 isl_assert(map->ctx, isl_dim_equal(map->dim, bmap->dim), goto error);
4216 isl_assert(map->ctx, map->n < map->size, goto error);
4217 map->p[map->n] = bmap;
4219 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4225 isl_basic_map_free(bmap);
4229 void isl_map_free(struct isl_map *map)
4239 isl_ctx_deref(map->ctx);
4240 for (i = 0; i < map->n; ++i)
4241 isl_basic_map_free(map->p[i]);
4242 isl_dim_free(map->dim);
4246 struct isl_map *isl_map_extend(struct isl_map *base,
4247 unsigned nparam, unsigned n_in, unsigned n_out)
4251 base = isl_map_cow(base);
4255 base->dim = isl_dim_extend(base->dim, nparam, n_in, n_out);
4258 for (i = 0; i < base->n; ++i) {
4259 base->p[i] = isl_basic_map_extend_dim(base->p[i],
4260 isl_dim_copy(base->dim), 0, 0, 0);
4270 struct isl_set *isl_set_extend(struct isl_set *base,
4271 unsigned nparam, unsigned dim)
4273 return (struct isl_set *)isl_map_extend((struct isl_map *)base,
4277 static struct isl_basic_map *isl_basic_map_fix_pos_si(
4278 struct isl_basic_map *bmap, unsigned pos, int value)
4282 bmap = isl_basic_map_cow(bmap);
4283 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
4284 j = isl_basic_map_alloc_equality(bmap);
4287 isl_seq_clr(bmap->eq[j] + 1, isl_basic_map_total_dim(bmap));
4288 isl_int_set_si(bmap->eq[j][pos], -1);
4289 isl_int_set_si(bmap->eq[j][0], value);
4290 bmap = isl_basic_map_simplify(bmap);
4291 return isl_basic_map_finalize(bmap);
4293 isl_basic_map_free(bmap);
4297 static __isl_give isl_basic_map *isl_basic_map_fix_pos(
4298 __isl_take isl_basic_map *bmap, unsigned pos, isl_int value)
4302 bmap = isl_basic_map_cow(bmap);
4303 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
4304 j = isl_basic_map_alloc_equality(bmap);
4307 isl_seq_clr(bmap->eq[j] + 1, isl_basic_map_total_dim(bmap));
4308 isl_int_set_si(bmap->eq[j][pos], -1);
4309 isl_int_set(bmap->eq[j][0], value);
4310 bmap = isl_basic_map_simplify(bmap);
4311 return isl_basic_map_finalize(bmap);
4313 isl_basic_map_free(bmap);
4317 struct isl_basic_map *isl_basic_map_fix_si(struct isl_basic_map *bmap,
4318 enum isl_dim_type type, unsigned pos, int value)
4322 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
4323 return isl_basic_map_fix_pos_si(bmap,
4324 isl_basic_map_offset(bmap, type) + pos, value);
4326 isl_basic_map_free(bmap);
4330 __isl_give isl_basic_map *isl_basic_map_fix(__isl_take isl_basic_map *bmap,
4331 enum isl_dim_type type, unsigned pos, isl_int value)
4335 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
4336 return isl_basic_map_fix_pos(bmap,
4337 isl_basic_map_offset(bmap, type) + pos, value);
4339 isl_basic_map_free(bmap);
4343 struct isl_basic_set *isl_basic_set_fix_si(struct isl_basic_set *bset,
4344 enum isl_dim_type type, unsigned pos, int value)
4346 return (struct isl_basic_set *)
4347 isl_basic_map_fix_si((struct isl_basic_map *)bset,
4351 __isl_give isl_basic_set *isl_basic_set_fix(__isl_take isl_basic_set *bset,
4352 enum isl_dim_type type, unsigned pos, isl_int value)
4354 return (struct isl_basic_set *)
4355 isl_basic_map_fix((struct isl_basic_map *)bset,
4359 struct isl_basic_map *isl_basic_map_fix_input_si(struct isl_basic_map *bmap,
4360 unsigned input, int value)
4362 return isl_basic_map_fix_si(bmap, isl_dim_in, input, value);
4365 struct isl_basic_set *isl_basic_set_fix_dim_si(struct isl_basic_set *bset,
4366 unsigned dim, int value)
4368 return (struct isl_basic_set *)
4369 isl_basic_map_fix_si((struct isl_basic_map *)bset,
4370 isl_dim_set, dim, value);
4373 struct isl_map *isl_map_fix_si(struct isl_map *map,
4374 enum isl_dim_type type, unsigned pos, int value)
4378 map = isl_map_cow(map);
4382 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
4383 for (i = 0; i < map->n; ++i) {
4384 map->p[i] = isl_basic_map_fix_si(map->p[i], type, pos, value);
4388 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4395 __isl_give isl_set *isl_set_fix_si(__isl_take isl_set *set,
4396 enum isl_dim_type type, unsigned pos, int value)
4398 return (struct isl_set *)
4399 isl_map_fix_si((struct isl_map *)set, type, pos, value);
4402 __isl_give isl_map *isl_map_fix(__isl_take isl_map *map,
4403 enum isl_dim_type type, unsigned pos, isl_int value)
4407 map = isl_map_cow(map);
4411 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
4412 for (i = 0; i < map->n; ++i) {
4413 map->p[i] = isl_basic_map_fix(map->p[i], type, pos, value);
4417 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4424 __isl_give isl_set *isl_set_fix(__isl_take isl_set *set,
4425 enum isl_dim_type type, unsigned pos, isl_int value)
4427 return (struct isl_set *)isl_map_fix((isl_map *)set, type, pos, value);
4430 struct isl_map *isl_map_fix_input_si(struct isl_map *map,
4431 unsigned input, int value)
4433 return isl_map_fix_si(map, isl_dim_in, input, value);
4436 struct isl_set *isl_set_fix_dim_si(struct isl_set *set, unsigned dim, int value)
4438 return (struct isl_set *)
4439 isl_map_fix_si((struct isl_map *)set, isl_dim_set, dim, value);
4442 __isl_give isl_basic_map *isl_basic_map_lower_bound_si(
4443 __isl_take isl_basic_map *bmap,
4444 enum isl_dim_type type, unsigned pos, int value)
4450 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
4451 pos += isl_basic_map_offset(bmap, type);
4452 bmap = isl_basic_map_cow(bmap);
4453 bmap = isl_basic_map_extend_constraints(bmap, 0, 1);
4454 j = isl_basic_map_alloc_inequality(bmap);
4457 isl_seq_clr(bmap->ineq[j], 1 + isl_basic_map_total_dim(bmap));
4458 isl_int_set_si(bmap->ineq[j][pos], 1);
4459 isl_int_set_si(bmap->ineq[j][0], -value);
4460 bmap = isl_basic_map_simplify(bmap);
4461 return isl_basic_map_finalize(bmap);
4463 isl_basic_map_free(bmap);
4467 struct isl_basic_set *isl_basic_set_lower_bound_dim(struct isl_basic_set *bset,
4468 unsigned dim, isl_int value)
4472 bset = isl_basic_set_cow(bset);
4473 bset = isl_basic_set_extend_constraints(bset, 0, 1);
4474 j = isl_basic_set_alloc_inequality(bset);
4477 isl_seq_clr(bset->ineq[j], 1 + isl_basic_set_total_dim(bset));
4478 isl_int_set_si(bset->ineq[j][1 + isl_basic_set_n_param(bset) + dim], 1);
4479 isl_int_neg(bset->ineq[j][0], value);
4480 bset = isl_basic_set_simplify(bset);
4481 return isl_basic_set_finalize(bset);
4483 isl_basic_set_free(bset);
4487 __isl_give isl_map *isl_map_lower_bound_si(__isl_take isl_map *map,
4488 enum isl_dim_type type, unsigned pos, int value)
4492 map = isl_map_cow(map);
4496 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
4497 for (i = 0; i < map->n; ++i) {
4498 map->p[i] = isl_basic_map_lower_bound_si(map->p[i],
4503 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4510 __isl_give isl_set *isl_set_lower_bound_si(__isl_take isl_set *set,
4511 enum isl_dim_type type, unsigned pos, int value)
4513 return (struct isl_set *)
4514 isl_map_lower_bound_si((struct isl_map *)set, type, pos, value);
4517 struct isl_set *isl_set_lower_bound_dim(struct isl_set *set, unsigned dim,
4522 set = isl_set_cow(set);
4526 isl_assert(set->ctx, dim < isl_set_n_dim(set), goto error);
4527 for (i = 0; i < set->n; ++i) {
4528 set->p[i] = isl_basic_set_lower_bound_dim(set->p[i], dim, value);
4538 struct isl_map *isl_map_reverse(struct isl_map *map)
4542 map = isl_map_cow(map);
4546 map->dim = isl_dim_reverse(map->dim);
4549 for (i = 0; i < map->n; ++i) {
4550 map->p[i] = isl_basic_map_reverse(map->p[i]);
4554 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4561 static struct isl_map *isl_basic_map_partial_lexopt(
4562 struct isl_basic_map *bmap, struct isl_basic_set *dom,
4563 struct isl_set **empty, int max)
4567 if (bmap->ctx->opt->pip == ISL_PIP_PIP)
4568 return isl_pip_basic_map_lexopt(bmap, dom, empty, max);
4570 return isl_tab_basic_map_partial_lexopt(bmap, dom, empty, max);
4572 isl_basic_map_free(bmap);
4573 isl_basic_set_free(dom);
4579 struct isl_map *isl_basic_map_partial_lexmax(
4580 struct isl_basic_map *bmap, struct isl_basic_set *dom,
4581 struct isl_set **empty)
4583 return isl_basic_map_partial_lexopt(bmap, dom, empty, 1);
4586 struct isl_map *isl_basic_map_partial_lexmin(
4587 struct isl_basic_map *bmap, struct isl_basic_set *dom,
4588 struct isl_set **empty)
4590 return isl_basic_map_partial_lexopt(bmap, dom, empty, 0);
4593 struct isl_set *isl_basic_set_partial_lexmin(
4594 struct isl_basic_set *bset, struct isl_basic_set *dom,
4595 struct isl_set **empty)
4597 return (struct isl_set *)
4598 isl_basic_map_partial_lexmin((struct isl_basic_map *)bset,
4602 struct isl_set *isl_basic_set_partial_lexmax(
4603 struct isl_basic_set *bset, struct isl_basic_set *dom,
4604 struct isl_set **empty)
4606 return (struct isl_set *)
4607 isl_basic_map_partial_lexmax((struct isl_basic_map *)bset,
4611 /* Given a basic map "bmap", compute the lexicographically minimal
4612 * (or maximal) image element for each domain element in dom.
4613 * Set *empty to those elements in dom that do not have an image element.
4615 * We first make sure the basic sets in dom are disjoint and then
4616 * simply collect the results over each of the basic sets separately.
4617 * We could probably improve the efficiency a bit by moving the union
4618 * domain down into the parametric integer programming.
4620 static __isl_give isl_map *basic_map_partial_lexopt(
4621 __isl_take isl_basic_map *bmap, __isl_take isl_set *dom,
4622 __isl_give isl_set **empty, int max)
4625 struct isl_map *res;
4627 dom = isl_set_make_disjoint(dom);
4631 if (isl_set_fast_is_empty(dom)) {
4632 res = isl_map_empty_like_basic_map(bmap);
4633 *empty = isl_set_empty_like(dom);
4635 isl_basic_map_free(bmap);
4639 res = isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap),
4640 isl_basic_set_copy(dom->p[0]), empty, max);
4642 for (i = 1; i < dom->n; ++i) {
4643 struct isl_map *res_i;
4644 struct isl_set *empty_i;
4646 res_i = isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap),
4647 isl_basic_set_copy(dom->p[i]), &empty_i, max);
4649 res = isl_map_union_disjoint(res, res_i);
4650 *empty = isl_set_union_disjoint(*empty, empty_i);
4654 isl_basic_map_free(bmap);
4659 isl_basic_map_free(bmap);
4663 /* Given a map "map", compute the lexicographically minimal
4664 * (or maximal) image element for each domain element in dom.
4665 * Set *empty to those elements in dom that do not have an image element.
4667 * We first compute the lexicographically minimal or maximal element
4668 * in the first basic map. This results in a partial solution "res"
4669 * and a subset "todo" of dom that still need to be handled.
4670 * We then consider each of the remaining maps in "map" and successively
4671 * improve both "res" and "todo".
4673 * Let res^k and todo^k be the results after k steps and let i = k + 1.
4674 * Assume we are computing the lexicographical maximum.
4675 * We first compute the lexicographically maximal element in basic map i.
4676 * This results in a partial solution res_i and a subset todo_i.
4677 * Then we combine these results with those obtain for the first k basic maps
4678 * to obtain a result that is valid for the first k+1 basic maps.
4679 * In particular, the set where there is no solution is the set where
4680 * there is no solution for the first k basic maps and also no solution
4681 * for the ith basic map, i.e.,
4683 * todo^i = todo^k * todo_i
4685 * On dom(res^k) * dom(res_i), we need to pick the larger of the two
4686 * solutions, arbitrarily breaking ties in favor of res^k.
4687 * That is, when res^k(a) >= res_i(a), we pick res^k and
4688 * when res^k(a) < res_i(a), we pick res_i. (Here, ">=" and "<" denote
4689 * the lexicographic order.)
4690 * In practice, we compute
4692 * res^k * (res_i . "<=")
4696 * res_i * (res^k . "<")
4698 * Finally, we consider the symmetric difference of dom(res^k) and dom(res_i),
4699 * where only one of res^k and res_i provides a solution and we simply pick
4706 * Note that we only compute these intersections when dom(res^k) intersects
4707 * dom(res_i). Otherwise, the only effect of these intersections is to
4708 * potentially break up res^k and res_i into smaller pieces.
4709 * We want to avoid such splintering as much as possible.
4710 * In fact, an earlier implementation of this function would look for
4711 * better results in the domain of res^k and for extra results in todo^k,
4712 * but this would always result in a splintering according to todo^k,
4713 * even when the domain of basic map i is disjoint from the domains of
4714 * the previous basic maps.
4716 static __isl_give isl_map *isl_map_partial_lexopt(
4717 __isl_take isl_map *map, __isl_take isl_set *dom,
4718 __isl_give isl_set **empty, int max)
4721 struct isl_map *res;
4722 struct isl_set *todo;
4727 if (isl_map_fast_is_empty(map)) {
4735 res = basic_map_partial_lexopt(isl_basic_map_copy(map->p[0]),
4736 isl_set_copy(dom), &todo, max);
4738 for (i = 1; i < map->n; ++i) {
4742 isl_dim *dim = isl_dim_range(isl_map_get_dim(res));
4744 res_i = basic_map_partial_lexopt(isl_basic_map_copy(map->p[i]),
4745 isl_set_copy(dom), &todo_i, max);
4748 lt = isl_map_lex_lt(isl_dim_copy(dim));
4749 le = isl_map_lex_le(dim);
4751 lt = isl_map_lex_gt(isl_dim_copy(dim));
4752 le = isl_map_lex_ge(dim);
4754 lt = isl_map_apply_range(isl_map_copy(res), lt);
4755 lt = isl_map_intersect(lt, isl_map_copy(res_i));
4756 le = isl_map_apply_range(isl_map_copy(res_i), le);
4757 le = isl_map_intersect(le, isl_map_copy(res));
4759 if (!isl_map_is_empty(lt) || !isl_map_is_empty(le)) {
4760 res = isl_map_intersect_domain(res,
4761 isl_set_copy(todo_i));
4762 res_i = isl_map_intersect_domain(res_i,
4763 isl_set_copy(todo));
4766 res = isl_map_union_disjoint(res, res_i);
4767 res = isl_map_union_disjoint(res, lt);
4768 res = isl_map_union_disjoint(res, le);
4770 todo = isl_set_intersect(todo, todo_i);
4790 __isl_give isl_map *isl_map_partial_lexmax(
4791 __isl_take isl_map *map, __isl_take isl_set *dom,
4792 __isl_give isl_set **empty)
4794 return isl_map_partial_lexopt(map, dom, empty, 1);
4797 __isl_give isl_map *isl_map_partial_lexmin(
4798 __isl_take isl_map *map, __isl_take isl_set *dom,
4799 __isl_give isl_set **empty)
4801 return isl_map_partial_lexopt(map, dom, empty, 0);
4804 __isl_give isl_set *isl_set_partial_lexmin(
4805 __isl_take isl_set *set, __isl_take isl_set *dom,
4806 __isl_give isl_set **empty)
4808 return (struct isl_set *)
4809 isl_map_partial_lexmin((struct isl_map *)set,
4813 __isl_give isl_set *isl_set_partial_lexmax(
4814 __isl_take isl_set *set, __isl_take isl_set *dom,
4815 __isl_give isl_set **empty)
4817 return (struct isl_set *)
4818 isl_map_partial_lexmax((struct isl_map *)set,
4822 __isl_give isl_map *isl_basic_map_lexopt(__isl_take isl_basic_map *bmap, int max)
4824 struct isl_basic_set *dom = NULL;
4825 struct isl_dim *dom_dim;
4829 dom_dim = isl_dim_domain(isl_dim_copy(bmap->dim));
4830 dom = isl_basic_set_universe(dom_dim);
4831 return isl_basic_map_partial_lexopt(bmap, dom, NULL, max);
4833 isl_basic_map_free(bmap);
4837 __isl_give isl_map *isl_basic_map_lexmin(__isl_take isl_basic_map *bmap)
4839 return isl_basic_map_lexopt(bmap, 0);
4842 __isl_give isl_map *isl_basic_map_lexmax(__isl_take isl_basic_map *bmap)
4844 return isl_basic_map_lexopt(bmap, 1);
4847 __isl_give isl_set *isl_basic_set_lexmin(__isl_take isl_basic_set *bset)
4849 return (isl_set *)isl_basic_map_lexmin((isl_basic_map *)bset);
4852 __isl_give isl_set *isl_basic_set_lexmax(__isl_take isl_basic_set *bset)
4854 return (isl_set *)isl_basic_map_lexmax((isl_basic_map *)bset);
4857 __isl_give isl_map *isl_map_lexopt(__isl_take isl_map *map, int max)
4859 struct isl_set *dom = NULL;
4860 struct isl_dim *dom_dim;
4864 dom_dim = isl_dim_domain(isl_dim_copy(map->dim));
4865 dom = isl_set_universe(dom_dim);
4866 return isl_map_partial_lexopt(map, dom, NULL, max);
4872 __isl_give isl_map *isl_map_lexmin(__isl_take isl_map *map)
4874 return isl_map_lexopt(map, 0);
4877 __isl_give isl_map *isl_map_lexmax(__isl_take isl_map *map)
4879 return isl_map_lexopt(map, 1);
4882 __isl_give isl_set *isl_set_lexmin(__isl_take isl_set *set)
4884 return (isl_set *)isl_map_lexmin((isl_map *)set);
4887 __isl_give isl_set *isl_set_lexmax(__isl_take isl_set *set)
4889 return (isl_set *)isl_map_lexmax((isl_map *)set);
4892 /* Apply a preimage specified by "mat" on the parameters of "bset".
4893 * bset is assumed to have only parameters and divs.
4895 static struct isl_basic_set *basic_set_parameter_preimage(
4896 struct isl_basic_set *bset, struct isl_mat *mat)
4903 bset->dim = isl_dim_cow(bset->dim);
4907 nparam = isl_basic_set_dim(bset, isl_dim_param);
4909 isl_assert(bset->ctx, mat->n_row == 1 + nparam, goto error);
4911 bset->dim->nparam = 0;
4912 bset->dim->n_out = nparam;
4913 bset = isl_basic_set_preimage(bset, mat);
4915 bset->dim->nparam = bset->dim->n_out;
4916 bset->dim->n_out = 0;
4921 isl_basic_set_free(bset);
4925 /* Apply a preimage specified by "mat" on the parameters of "set".
4926 * set is assumed to have only parameters and divs.
4928 static struct isl_set *set_parameter_preimage(
4929 struct isl_set *set, struct isl_mat *mat)
4931 struct isl_dim *dim = NULL;
4937 dim = isl_dim_copy(set->dim);
4938 dim = isl_dim_cow(dim);
4942 nparam = isl_set_dim(set, isl_dim_param);
4944 isl_assert(set->ctx, mat->n_row == 1 + nparam, goto error);
4947 dim->n_out = nparam;
4948 isl_set_reset_dim(set, dim);
4949 set = isl_set_preimage(set, mat);
4952 dim = isl_dim_copy(set->dim);
4953 dim = isl_dim_cow(dim);
4956 dim->nparam = dim->n_out;
4958 isl_set_reset_dim(set, dim);
4968 /* Intersect the basic set "bset" with the affine space specified by the
4969 * equalities in "eq".
4971 static struct isl_basic_set *basic_set_append_equalities(
4972 struct isl_basic_set *bset, struct isl_mat *eq)
4980 bset = isl_basic_set_extend_dim(bset, isl_dim_copy(bset->dim), 0,
4985 len = 1 + isl_dim_total(bset->dim) + bset->extra;
4986 for (i = 0; i < eq->n_row; ++i) {
4987 k = isl_basic_set_alloc_equality(bset);
4990 isl_seq_cpy(bset->eq[k], eq->row[i], eq->n_col);
4991 isl_seq_clr(bset->eq[k] + eq->n_col, len - eq->n_col);
4995 bset = isl_basic_set_gauss(bset, NULL);
4996 bset = isl_basic_set_finalize(bset);
5001 isl_basic_set_free(bset);
5005 /* Intersect the set "set" with the affine space specified by the
5006 * equalities in "eq".
5008 static struct isl_set *set_append_equalities(struct isl_set *set,
5016 for (i = 0; i < set->n; ++i) {
5017 set->p[i] = basic_set_append_equalities(set->p[i],
5030 /* Project the given basic set onto its parameter domain, possibly introducing
5031 * new, explicit, existential variables in the constraints.
5032 * The input has parameters and (possibly implicit) existential variables.
5033 * The output has the same parameters, but only
5034 * explicit existentially quantified variables.
5036 * The actual projection is performed by pip, but pip doesn't seem
5037 * to like equalities very much, so we first remove the equalities
5038 * among the parameters by performing a variable compression on
5039 * the parameters. Afterward, an inverse transformation is performed
5040 * and the equalities among the parameters are inserted back in.
5042 static struct isl_set *parameter_compute_divs(struct isl_basic_set *bset)
5046 struct isl_mat *T, *T2;
5047 struct isl_set *set;
5048 unsigned nparam, n_div;
5050 bset = isl_basic_set_cow(bset);
5054 if (bset->n_eq == 0)
5055 return isl_basic_set_lexmin(bset);
5057 isl_basic_set_gauss(bset, NULL);
5059 nparam = isl_basic_set_dim(bset, isl_dim_param);
5060 n_div = isl_basic_set_dim(bset, isl_dim_div);
5062 for (i = 0, j = n_div - 1; i < bset->n_eq && j >= 0; --j) {
5063 if (!isl_int_is_zero(bset->eq[i][1 + nparam + j]))
5066 if (i == bset->n_eq)
5067 return isl_basic_set_lexmin(bset);
5069 eq = isl_mat_sub_alloc(bset->ctx, bset->eq, i, bset->n_eq - i,
5071 eq = isl_mat_cow(eq);
5072 T = isl_mat_variable_compression(isl_mat_copy(eq), &T2);
5073 if (T && T->n_col == 0) {
5077 bset = isl_basic_set_set_to_empty(bset);
5078 return isl_set_from_basic_set(bset);
5080 bset = basic_set_parameter_preimage(bset, T);
5082 set = isl_basic_set_lexmin(bset);
5083 set = set_parameter_preimage(set, T2);
5084 set = set_append_equalities(set, eq);
5088 /* Compute an explicit representation for all the existentially
5089 * quantified variables.
5090 * The input and output dimensions are first turned into parameters.
5091 * compute_divs then returns a map with the same parameters and
5092 * no input or output dimensions and the dimension specification
5093 * is reset to that of the input.
5095 static struct isl_map *compute_divs(struct isl_basic_map *bmap)
5097 struct isl_basic_set *bset;
5098 struct isl_set *set;
5099 struct isl_map *map;
5100 struct isl_dim *dim, *orig_dim = NULL;
5105 bmap = isl_basic_map_cow(bmap);
5109 nparam = isl_basic_map_dim(bmap, isl_dim_param);
5110 n_in = isl_basic_map_dim(bmap, isl_dim_in);
5111 n_out = isl_basic_map_dim(bmap, isl_dim_out);
5112 dim = isl_dim_set_alloc(bmap->ctx, nparam + n_in + n_out, 0);
5116 orig_dim = bmap->dim;
5118 bset = (struct isl_basic_set *)bmap;
5120 set = parameter_compute_divs(bset);
5121 map = (struct isl_map *)set;
5122 map = isl_map_reset_dim(map, orig_dim);
5126 isl_basic_map_free(bmap);
5130 static int basic_map_divs_known(__isl_keep isl_basic_map *bmap)
5138 off = isl_dim_total(bmap->dim);
5139 for (i = 0; i < bmap->n_div; ++i) {
5140 if (isl_int_is_zero(bmap->div[i][0]))
5142 isl_assert(bmap->ctx, isl_int_is_zero(bmap->div[i][1+1+off+i]),
5148 static int map_divs_known(__isl_keep isl_map *map)
5155 for (i = 0; i < map->n; ++i) {
5156 int known = basic_map_divs_known(map->p[i]);
5164 /* If bmap contains any unknown divs, then compute explicit
5165 * expressions for them. However, this computation may be
5166 * quite expensive, so first try to remove divs that aren't
5169 struct isl_map *isl_basic_map_compute_divs(struct isl_basic_map *bmap)
5173 struct isl_map *map;
5175 known = basic_map_divs_known(bmap);
5179 return isl_map_from_basic_map(bmap);
5181 bmap = isl_basic_map_drop_redundant_divs(bmap);
5183 known = basic_map_divs_known(bmap);
5187 return isl_map_from_basic_map(bmap);
5189 map = compute_divs(bmap);
5192 isl_basic_map_free(bmap);
5196 struct isl_map *isl_map_compute_divs(struct isl_map *map)
5200 struct isl_map *res;
5207 known = map_divs_known(map);
5215 res = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[0]));
5216 for (i = 1 ; i < map->n; ++i) {
5218 r2 = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[i]));
5219 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT))
5220 res = isl_map_union_disjoint(res, r2);
5222 res = isl_map_union(res, r2);
5229 struct isl_set *isl_basic_set_compute_divs(struct isl_basic_set *bset)
5231 return (struct isl_set *)
5232 isl_basic_map_compute_divs((struct isl_basic_map *)bset);
5235 struct isl_set *isl_set_compute_divs(struct isl_set *set)
5237 return (struct isl_set *)
5238 isl_map_compute_divs((struct isl_map *)set);
5241 struct isl_set *isl_map_domain(struct isl_map *map)
5244 struct isl_set *set;
5249 map = isl_map_cow(map);
5253 set = (struct isl_set *)map;
5254 set->dim = isl_dim_domain(set->dim);
5257 for (i = 0; i < map->n; ++i) {
5258 set->p[i] = isl_basic_map_domain(map->p[i]);
5262 ISL_F_CLR(set, ISL_MAP_DISJOINT);
5263 ISL_F_CLR(set, ISL_SET_NORMALIZED);
5270 struct isl_map *isl_map_union_disjoint(
5271 struct isl_map *map1, struct isl_map *map2)
5275 struct isl_map *map = NULL;
5289 isl_assert(map1->ctx, isl_dim_equal(map1->dim, map2->dim), goto error);
5291 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
5292 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
5293 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
5295 map = isl_map_alloc_dim(isl_dim_copy(map1->dim),
5296 map1->n + map2->n, flags);
5299 for (i = 0; i < map1->n; ++i) {
5300 map = isl_map_add_basic_map(map,
5301 isl_basic_map_copy(map1->p[i]));
5305 for (i = 0; i < map2->n; ++i) {
5306 map = isl_map_add_basic_map(map,
5307 isl_basic_map_copy(map2->p[i]));
5321 struct isl_map *isl_map_union(struct isl_map *map1, struct isl_map *map2)
5323 map1 = isl_map_union_disjoint(map1, map2);
5327 ISL_F_CLR(map1, ISL_MAP_DISJOINT);
5331 struct isl_set *isl_set_union_disjoint(
5332 struct isl_set *set1, struct isl_set *set2)
5334 return (struct isl_set *)
5335 isl_map_union_disjoint(
5336 (struct isl_map *)set1, (struct isl_map *)set2);
5339 struct isl_set *isl_set_union(struct isl_set *set1, struct isl_set *set2)
5341 return (struct isl_set *)
5342 isl_map_union((struct isl_map *)set1, (struct isl_map *)set2);
5345 struct isl_map *isl_map_intersect_range(
5346 struct isl_map *map, struct isl_set *set)
5349 struct isl_map *result;
5355 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT) &&
5356 ISL_F_ISSET(set, ISL_MAP_DISJOINT))
5357 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
5359 result = isl_map_alloc_dim(isl_dim_copy(map->dim),
5360 map->n * set->n, flags);
5363 for (i = 0; i < map->n; ++i)
5364 for (j = 0; j < set->n; ++j) {
5365 result = isl_map_add_basic_map(result,
5366 isl_basic_map_intersect_range(
5367 isl_basic_map_copy(map->p[i]),
5368 isl_basic_set_copy(set->p[j])));
5381 struct isl_map *isl_map_intersect_domain(
5382 struct isl_map *map, struct isl_set *set)
5384 return isl_map_reverse(
5385 isl_map_intersect_range(isl_map_reverse(map), set));
5388 struct isl_map *isl_map_apply_domain(
5389 struct isl_map *map1, struct isl_map *map2)
5393 map1 = isl_map_reverse(map1);
5394 map1 = isl_map_apply_range(map1, map2);
5395 return isl_map_reverse(map1);
5402 struct isl_map *isl_map_apply_range(
5403 struct isl_map *map1, struct isl_map *map2)
5405 struct isl_dim *dim_result;
5406 struct isl_map *result;
5412 dim_result = isl_dim_join(isl_dim_copy(map1->dim),
5413 isl_dim_copy(map2->dim));
5415 result = isl_map_alloc_dim(dim_result, map1->n * map2->n, 0);
5418 for (i = 0; i < map1->n; ++i)
5419 for (j = 0; j < map2->n; ++j) {
5420 result = isl_map_add_basic_map(result,
5421 isl_basic_map_apply_range(
5422 isl_basic_map_copy(map1->p[i]),
5423 isl_basic_map_copy(map2->p[j])));
5429 if (result && result->n <= 1)
5430 ISL_F_SET(result, ISL_MAP_DISJOINT);
5439 * returns range - domain
5441 struct isl_basic_set *isl_basic_map_deltas(struct isl_basic_map *bmap)
5443 isl_dim *dims, *target_dim;
5444 struct isl_basic_set *bset;
5451 isl_assert(bmap->ctx, isl_dim_tuple_match(bmap->dim, isl_dim_in,
5452 bmap->dim, isl_dim_out),
5454 target_dim = isl_dim_domain(isl_basic_map_get_dim(bmap));
5455 dim = isl_basic_map_n_in(bmap);
5456 nparam = isl_basic_map_n_param(bmap);
5457 bset = isl_basic_set_from_basic_map(bmap);
5458 bset = isl_basic_set_cow(bset);
5459 dims = isl_basic_set_get_dim(bset);
5460 dims = isl_dim_add(dims, isl_dim_set, dim);
5461 bset = isl_basic_set_extend_dim(bset, dims, 0, dim, 0);
5462 bset = isl_basic_set_swap_vars(bset, 2*dim);
5463 for (i = 0; i < dim; ++i) {
5464 int j = isl_basic_map_alloc_equality(
5465 (struct isl_basic_map *)bset);
5468 isl_seq_clr(bset->eq[j], 1 + isl_basic_set_total_dim(bset));
5469 isl_int_set_si(bset->eq[j][1+nparam+i], 1);
5470 isl_int_set_si(bset->eq[j][1+nparam+dim+i], 1);
5471 isl_int_set_si(bset->eq[j][1+nparam+2*dim+i], -1);
5473 bset = isl_basic_set_project_out(bset, isl_dim_set, dim, 2*dim);
5474 bset = isl_basic_set_reset_dim(bset, target_dim);
5477 isl_basic_map_free(bmap);
5482 * returns range - domain
5484 struct isl_set *isl_map_deltas(struct isl_map *map)
5488 struct isl_set *result;
5493 isl_assert(map->ctx, isl_dim_tuple_match(map->dim, isl_dim_in,
5494 map->dim, isl_dim_out),
5496 dim = isl_map_get_dim(map);
5497 dim = isl_dim_domain(dim);
5498 result = isl_set_alloc_dim(dim, map->n, 0);
5501 for (i = 0; i < map->n; ++i)
5502 result = isl_set_add_basic_set(result,
5503 isl_basic_map_deltas(isl_basic_map_copy(map->p[i])));
5512 * returns [domain -> range] -> range - domain
5514 __isl_give isl_basic_map *isl_basic_map_deltas_map(
5515 __isl_take isl_basic_map *bmap)
5519 isl_basic_map *domain;
5520 isl_basic_set *bset;
5524 if (!isl_dim_tuple_match(bmap->dim, isl_dim_in, bmap->dim, isl_dim_out))
5525 isl_die(bmap->ctx, isl_error_invalid,
5526 "domain and range don't match", goto error);
5528 nparam = isl_basic_map_dim(bmap, isl_dim_param);
5529 n = isl_basic_map_dim(bmap, isl_dim_in);
5531 dim = isl_dim_from_range(isl_dim_domain(isl_basic_map_get_dim(bmap)));
5532 domain = isl_basic_map_universe(dim);
5534 bmap = isl_basic_map_from_domain(isl_basic_map_wrap(bmap));
5535 bmap = isl_basic_map_apply_range(bmap, domain);
5536 bmap = isl_basic_map_extend_constraints(bmap, n, 0);
5538 total = isl_basic_map_total_dim(bmap);
5540 for (i = 0; i < n; ++i) {
5541 k = isl_basic_map_alloc_equality(bmap);
5544 isl_seq_clr(bmap->eq[k], 1 + total);
5545 isl_int_set_si(bmap->eq[k][1 + nparam + i], 1);
5546 isl_int_set_si(bmap->eq[k][1 + nparam + n + i], -1);
5547 isl_int_set_si(bmap->eq[k][1 + nparam + n + n + i], 1);
5550 bmap = isl_basic_map_gauss(bmap, NULL);
5551 return isl_basic_map_finalize(bmap);
5553 isl_basic_map_free(bmap);
5558 * returns [domain -> range] -> range - domain
5560 __isl_give isl_map *isl_map_deltas_map(__isl_take isl_map *map)
5563 isl_dim *domain_dim;
5568 if (!isl_dim_tuple_match(map->dim, isl_dim_in, map->dim, isl_dim_out))
5569 isl_die(map->ctx, isl_error_invalid,
5570 "domain and range don't match", goto error);
5572 map = isl_map_cow(map);
5576 domain_dim = isl_dim_from_range(isl_dim_domain(isl_map_get_dim(map)));
5577 map->dim = isl_dim_from_domain(isl_dim_wrap(map->dim));
5578 map->dim = isl_dim_join(map->dim, domain_dim);
5581 for (i = 0; i < map->n; ++i) {
5582 map->p[i] = isl_basic_map_deltas_map(map->p[i]);
5586 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
5593 static struct isl_basic_map *basic_map_identity(struct isl_dim *dims)
5595 struct isl_basic_map *bmap;
5603 nparam = dims->nparam;
5605 bmap = isl_basic_map_alloc_dim(dims, 0, dim, 0);
5609 for (i = 0; i < dim; ++i) {
5610 int j = isl_basic_map_alloc_equality(bmap);
5613 isl_seq_clr(bmap->eq[j], 1 + isl_basic_map_total_dim(bmap));
5614 isl_int_set_si(bmap->eq[j][1+nparam+i], 1);
5615 isl_int_set_si(bmap->eq[j][1+nparam+dim+i], -1);
5617 return isl_basic_map_finalize(bmap);
5619 isl_basic_map_free(bmap);
5623 __isl_give isl_basic_map *isl_basic_map_identity(__isl_take isl_dim *dim)
5627 if (dim->n_in != dim->n_out)
5628 isl_die(dim->ctx, isl_error_invalid,
5629 "number of input and output dimensions needs to be "
5630 "the same", goto error);
5631 return basic_map_identity(dim);
5637 struct isl_basic_map *isl_basic_map_identity_like(struct isl_basic_map *model)
5639 if (!model || !model->dim)
5641 return isl_basic_map_identity(isl_dim_copy(model->dim));
5644 __isl_give isl_map *isl_map_identity(__isl_take isl_dim *dim)
5646 return isl_map_from_basic_map(isl_basic_map_identity(dim));
5649 struct isl_map *isl_map_identity_like(struct isl_map *model)
5651 if (!model || !model->dim)
5653 return isl_map_identity(isl_dim_copy(model->dim));
5656 struct isl_map *isl_map_identity_like_basic_map(struct isl_basic_map *model)
5658 if (!model || !model->dim)
5660 return isl_map_identity(isl_dim_copy(model->dim));
5663 __isl_give isl_map *isl_set_identity(__isl_take isl_set *set)
5665 isl_dim *dim = isl_set_get_dim(set);
5667 id = isl_map_identity(isl_dim_map_from_set(dim));
5668 return isl_map_intersect_range(id, set);
5671 /* Construct a basic set with all set dimensions having only non-negative
5674 struct isl_basic_set *isl_basic_set_positive_orthant(struct isl_dim *dims)
5679 struct isl_basic_set *bset;
5683 nparam = dims->nparam;
5685 bset = isl_basic_set_alloc_dim(dims, 0, 0, dim);
5688 for (i = 0; i < dim; ++i) {
5689 int k = isl_basic_set_alloc_inequality(bset);
5692 isl_seq_clr(bset->ineq[k], 1 + isl_basic_set_total_dim(bset));
5693 isl_int_set_si(bset->ineq[k][1 + nparam + i], 1);
5697 isl_basic_set_free(bset);
5701 /* Construct the half-space x_pos >= 0.
5703 static __isl_give isl_basic_set *nonneg_halfspace(__isl_take isl_dim *dim,
5707 isl_basic_set *nonneg;
5709 nonneg = isl_basic_set_alloc_dim(dim, 0, 0, 1);
5710 k = isl_basic_set_alloc_inequality(nonneg);
5713 isl_seq_clr(nonneg->ineq[k], 1 + isl_basic_set_total_dim(nonneg));
5714 isl_int_set_si(nonneg->ineq[k][pos], 1);
5716 return isl_basic_set_finalize(nonneg);
5718 isl_basic_set_free(nonneg);
5722 /* Construct the half-space x_pos <= -1.
5724 static __isl_give isl_basic_set *neg_halfspace(__isl_take isl_dim *dim, int pos)
5729 neg = isl_basic_set_alloc_dim(dim, 0, 0, 1);
5730 k = isl_basic_set_alloc_inequality(neg);
5733 isl_seq_clr(neg->ineq[k], 1 + isl_basic_set_total_dim(neg));
5734 isl_int_set_si(neg->ineq[k][0], -1);
5735 isl_int_set_si(neg->ineq[k][pos], -1);
5737 return isl_basic_set_finalize(neg);
5739 isl_basic_set_free(neg);
5743 __isl_give isl_set *isl_set_split_dims(__isl_take isl_set *set,
5744 enum isl_dim_type type, unsigned first, unsigned n)
5747 isl_basic_set *nonneg;
5755 isl_assert(set->ctx, first + n <= isl_set_dim(set, type), goto error);
5757 for (i = 0; i < n; ++i) {
5758 nonneg = nonneg_halfspace(isl_set_get_dim(set),
5759 pos(set->dim, type) + first + i);
5760 neg = neg_halfspace(isl_set_get_dim(set),
5761 pos(set->dim, type) + first + i);
5763 set = isl_set_intersect(set, isl_basic_set_union(nonneg, neg));
5772 static int foreach_orthant(__isl_take isl_set *set, int *signs, int first,
5773 int len, int (*fn)(__isl_take isl_set *orthant, int *signs, void *user),
5780 if (isl_set_fast_is_empty(set)) {
5785 return fn(set, signs, user);
5788 half = isl_set_from_basic_set(nonneg_halfspace(isl_set_get_dim(set),
5790 half = isl_set_intersect(half, isl_set_copy(set));
5791 if (foreach_orthant(half, signs, first + 1, len, fn, user) < 0)
5795 half = isl_set_from_basic_set(neg_halfspace(isl_set_get_dim(set),
5797 half = isl_set_intersect(half, set);
5798 return foreach_orthant(half, signs, first + 1, len, fn, user);
5804 /* Call "fn" on the intersections of "set" with each of the orthants
5805 * (except for obviously empty intersections). The orthant is identified
5806 * by the signs array, with each entry having value 1 or -1 according
5807 * to the sign of the corresponding variable.
5809 int isl_set_foreach_orthant(__isl_keep isl_set *set,
5810 int (*fn)(__isl_take isl_set *orthant, int *signs, void *user),
5820 if (isl_set_fast_is_empty(set))
5823 nparam = isl_set_dim(set, isl_dim_param);
5824 nvar = isl_set_dim(set, isl_dim_set);
5826 signs = isl_alloc_array(set->ctx, int, nparam + nvar);
5828 r = foreach_orthant(isl_set_copy(set), signs, 0, nparam + nvar,
5836 int isl_set_is_equal(struct isl_set *set1, struct isl_set *set2)
5838 return isl_map_is_equal((struct isl_map *)set1, (struct isl_map *)set2);
5841 int isl_basic_map_is_subset(
5842 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
5845 struct isl_map *map1;
5846 struct isl_map *map2;
5848 if (!bmap1 || !bmap2)
5851 map1 = isl_map_from_basic_map(isl_basic_map_copy(bmap1));
5852 map2 = isl_map_from_basic_map(isl_basic_map_copy(bmap2));
5854 is_subset = isl_map_is_subset(map1, map2);
5862 int isl_basic_map_is_equal(
5863 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
5867 if (!bmap1 || !bmap2)
5869 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
5872 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
5876 int isl_basic_set_is_equal(
5877 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
5879 return isl_basic_map_is_equal(
5880 (struct isl_basic_map *)bset1, (struct isl_basic_map *)bset2);
5883 int isl_map_is_empty(struct isl_map *map)
5890 for (i = 0; i < map->n; ++i) {
5891 is_empty = isl_basic_map_is_empty(map->p[i]);
5900 int isl_map_fast_is_empty(struct isl_map *map)
5902 return map ? map->n == 0 : -1;
5905 int isl_set_fast_is_empty(struct isl_set *set)
5907 return set ? set->n == 0 : -1;
5910 int isl_set_is_empty(struct isl_set *set)
5912 return isl_map_is_empty((struct isl_map *)set);
5915 int isl_map_has_equal_dim(__isl_keep isl_map *map1, __isl_keep isl_map *map2)
5920 return isl_dim_equal(map1->dim, map2->dim);
5923 int isl_set_has_equal_dim(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
5928 return isl_dim_equal(set1->dim, set2->dim);
5931 int isl_map_is_equal(struct isl_map *map1, struct isl_map *map2)
5937 is_subset = isl_map_is_subset(map1, map2);
5940 is_subset = isl_map_is_subset(map2, map1);
5944 int isl_basic_map_is_strict_subset(
5945 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
5949 if (!bmap1 || !bmap2)
5951 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
5954 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
5955 if (is_subset == -1)
5960 int isl_map_is_strict_subset(struct isl_map *map1, struct isl_map *map2)
5966 is_subset = isl_map_is_subset(map1, map2);
5969 is_subset = isl_map_is_subset(map2, map1);
5970 if (is_subset == -1)
5975 int isl_set_is_strict_subset(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
5977 return isl_map_is_strict_subset((isl_map *)set1, (isl_map *)set2);
5980 int isl_basic_map_is_universe(struct isl_basic_map *bmap)
5984 return bmap->n_eq == 0 && bmap->n_ineq == 0;
5987 int isl_basic_set_is_universe(struct isl_basic_set *bset)
5991 return bset->n_eq == 0 && bset->n_ineq == 0;
5994 int isl_map_fast_is_universe(__isl_keep isl_map *map)
6001 for (i = 0; i < map->n; ++i) {
6002 int r = isl_basic_map_is_universe(map->p[i]);
6010 int isl_set_fast_is_universe(__isl_keep isl_set *set)
6012 return isl_map_fast_is_universe((isl_map *) set);
6015 int isl_basic_map_is_empty(struct isl_basic_map *bmap)
6017 struct isl_basic_set *bset = NULL;
6018 struct isl_vec *sample = NULL;
6025 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY))
6028 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL)) {
6029 struct isl_basic_map *copy = isl_basic_map_copy(bmap);
6030 copy = isl_basic_map_remove_redundancies(copy);
6031 empty = ISL_F_ISSET(copy, ISL_BASIC_MAP_EMPTY);
6032 isl_basic_map_free(copy);
6036 total = 1 + isl_basic_map_total_dim(bmap);
6037 if (bmap->sample && bmap->sample->size == total) {
6038 int contains = isl_basic_map_contains(bmap, bmap->sample);
6044 isl_vec_free(bmap->sample);
6045 bmap->sample = NULL;
6046 bset = isl_basic_map_underlying_set(isl_basic_map_copy(bmap));
6049 sample = isl_basic_set_sample_vec(bset);
6052 empty = sample->size == 0;
6053 isl_vec_free(bmap->sample);
6054 bmap->sample = sample;
6056 ISL_F_SET(bmap, ISL_BASIC_MAP_EMPTY);
6061 int isl_basic_map_fast_is_empty(struct isl_basic_map *bmap)
6065 return ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY);
6068 int isl_basic_set_fast_is_empty(struct isl_basic_set *bset)
6072 return ISL_F_ISSET(bset, ISL_BASIC_SET_EMPTY);
6075 int isl_basic_set_is_empty(struct isl_basic_set *bset)
6077 return isl_basic_map_is_empty((struct isl_basic_map *)bset);
6080 struct isl_map *isl_basic_map_union(
6081 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
6083 struct isl_map *map;
6084 if (!bmap1 || !bmap2)
6087 isl_assert(bmap1->ctx, isl_dim_equal(bmap1->dim, bmap2->dim), goto error);
6089 map = isl_map_alloc_dim(isl_dim_copy(bmap1->dim), 2, 0);
6092 map = isl_map_add_basic_map(map, bmap1);
6093 map = isl_map_add_basic_map(map, bmap2);
6096 isl_basic_map_free(bmap1);
6097 isl_basic_map_free(bmap2);
6101 struct isl_set *isl_basic_set_union(
6102 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
6104 return (struct isl_set *)isl_basic_map_union(
6105 (struct isl_basic_map *)bset1,
6106 (struct isl_basic_map *)bset2);
6109 /* Order divs such that any div only depends on previous divs */
6110 struct isl_basic_map *isl_basic_map_order_divs(struct isl_basic_map *bmap)
6118 off = isl_dim_total(bmap->dim);
6120 for (i = 0; i < bmap->n_div; ++i) {
6122 if (isl_int_is_zero(bmap->div[i][0]))
6124 pos = isl_seq_first_non_zero(bmap->div[i]+1+1+off+i,
6128 isl_basic_map_swap_div(bmap, i, i + pos);
6134 struct isl_basic_set *isl_basic_set_order_divs(struct isl_basic_set *bset)
6136 return (struct isl_basic_set *)
6137 isl_basic_map_order_divs((struct isl_basic_map *)bset);
6140 __isl_give isl_map *isl_map_order_divs(__isl_take isl_map *map)
6147 for (i = 0; i < map->n; ++i) {
6148 map->p[i] = isl_basic_map_order_divs(map->p[i]);
6159 /* Look for a div in dst that corresponds to the div "div" in src.
6160 * The divs before "div" in src and dst are assumed to be the same.
6162 * Returns -1 if no corresponding div was found and the position
6163 * of the corresponding div in dst otherwise.
6165 static int find_div(struct isl_basic_map *dst,
6166 struct isl_basic_map *src, unsigned div)
6170 unsigned total = isl_dim_total(src->dim);
6172 isl_assert(dst->ctx, div <= dst->n_div, return -1);
6173 for (i = div; i < dst->n_div; ++i)
6174 if (isl_seq_eq(dst->div[i], src->div[div], 1+1+total+div) &&
6175 isl_seq_first_non_zero(dst->div[i]+1+1+total+div,
6176 dst->n_div - div) == -1)
6181 struct isl_basic_map *isl_basic_map_align_divs(
6182 struct isl_basic_map *dst, struct isl_basic_map *src)
6185 unsigned total = isl_dim_total(src->dim);
6190 if (src->n_div == 0)
6193 for (i = 0; i < src->n_div; ++i)
6194 isl_assert(src->ctx, !isl_int_is_zero(src->div[i][0]), goto error);
6196 src = isl_basic_map_order_divs(src);
6197 dst = isl_basic_map_cow(dst);
6198 dst = isl_basic_map_extend_dim(dst, isl_dim_copy(dst->dim),
6199 src->n_div, 0, 2 * src->n_div);
6202 for (i = 0; i < src->n_div; ++i) {
6203 int j = find_div(dst, src, i);
6205 j = isl_basic_map_alloc_div(dst);
6208 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total+i);
6209 isl_seq_clr(dst->div[j]+1+1+total+i, dst->n_div - i);
6210 if (isl_basic_map_add_div_constraints(dst, j) < 0)
6214 isl_basic_map_swap_div(dst, i, j);
6218 isl_basic_map_free(dst);
6222 struct isl_basic_set *isl_basic_set_align_divs(
6223 struct isl_basic_set *dst, struct isl_basic_set *src)
6225 return (struct isl_basic_set *)isl_basic_map_align_divs(
6226 (struct isl_basic_map *)dst, (struct isl_basic_map *)src);
6229 struct isl_map *isl_map_align_divs(struct isl_map *map)
6237 map = isl_map_compute_divs(map);
6238 map = isl_map_cow(map);
6242 for (i = 1; i < map->n; ++i)
6243 map->p[0] = isl_basic_map_align_divs(map->p[0], map->p[i]);
6244 for (i = 1; i < map->n; ++i)
6245 map->p[i] = isl_basic_map_align_divs(map->p[i], map->p[0]);
6247 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
6251 struct isl_set *isl_set_align_divs(struct isl_set *set)
6253 return (struct isl_set *)isl_map_align_divs((struct isl_map *)set);
6256 struct isl_set *isl_set_apply(struct isl_set *set, struct isl_map *map)
6260 isl_assert(set->ctx, isl_map_compatible_domain(map, set), goto error);
6261 map = isl_map_intersect_domain(map, set);
6262 set = isl_map_range(map);
6270 /* There is no need to cow as removing empty parts doesn't change
6271 * the meaning of the set.
6273 struct isl_map *isl_map_remove_empty_parts(struct isl_map *map)
6280 for (i = map->n-1; i >= 0; --i) {
6281 if (!ISL_F_ISSET(map->p[i], ISL_BASIC_MAP_EMPTY))
6283 isl_basic_map_free(map->p[i]);
6284 if (i != map->n-1) {
6285 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
6286 map->p[i] = map->p[map->n-1];
6294 struct isl_set *isl_set_remove_empty_parts(struct isl_set *set)
6296 return (struct isl_set *)
6297 isl_map_remove_empty_parts((struct isl_map *)set);
6300 struct isl_basic_map *isl_map_copy_basic_map(struct isl_map *map)
6302 struct isl_basic_map *bmap;
6303 if (!map || map->n == 0)
6305 bmap = map->p[map->n-1];
6306 isl_assert(map->ctx, ISL_F_ISSET(bmap, ISL_BASIC_SET_FINAL), return NULL);
6307 return isl_basic_map_copy(bmap);
6310 struct isl_basic_set *isl_set_copy_basic_set(struct isl_set *set)
6312 return (struct isl_basic_set *)
6313 isl_map_copy_basic_map((struct isl_map *)set);
6316 __isl_give isl_map *isl_map_drop_basic_map(__isl_take isl_map *map,
6317 __isl_keep isl_basic_map *bmap)
6323 for (i = map->n-1; i >= 0; --i) {
6324 if (map->p[i] != bmap)
6326 map = isl_map_cow(map);
6329 isl_basic_map_free(map->p[i]);
6330 if (i != map->n-1) {
6331 ISL_F_CLR(map, ISL_SET_NORMALIZED);
6332 map->p[i] = map->p[map->n-1];
6343 struct isl_set *isl_set_drop_basic_set(struct isl_set *set,
6344 struct isl_basic_set *bset)
6346 return (struct isl_set *)isl_map_drop_basic_map((struct isl_map *)set,
6347 (struct isl_basic_map *)bset);
6350 /* Given two basic sets bset1 and bset2, compute the maximal difference
6351 * between the values of dimension pos in bset1 and those in bset2
6352 * for any common value of the parameters and dimensions preceding pos.
6354 static enum isl_lp_result basic_set_maximal_difference_at(
6355 __isl_keep isl_basic_set *bset1, __isl_keep isl_basic_set *bset2,
6356 int pos, isl_int *opt)
6358 struct isl_dim *dims;
6359 struct isl_basic_map *bmap1 = NULL;
6360 struct isl_basic_map *bmap2 = NULL;
6361 struct isl_ctx *ctx;
6362 struct isl_vec *obj;
6365 unsigned dim1, dim2;
6366 enum isl_lp_result res;
6368 if (!bset1 || !bset2)
6369 return isl_lp_error;
6371 nparam = isl_basic_set_n_param(bset1);
6372 dim1 = isl_basic_set_n_dim(bset1);
6373 dim2 = isl_basic_set_n_dim(bset2);
6374 dims = isl_dim_alloc(bset1->ctx, nparam, pos, dim1 - pos);
6375 bmap1 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset1), dims);
6376 dims = isl_dim_alloc(bset2->ctx, nparam, pos, dim2 - pos);
6377 bmap2 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset2), dims);
6378 if (!bmap1 || !bmap2)
6380 bmap1 = isl_basic_map_cow(bmap1);
6381 bmap1 = isl_basic_map_extend(bmap1, nparam,
6382 pos, (dim1 - pos) + (dim2 - pos),
6383 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
6384 bmap1 = add_constraints(bmap1, bmap2, 0, dim1 - pos);
6387 total = isl_basic_map_total_dim(bmap1);
6389 obj = isl_vec_alloc(ctx, 1 + total);
6390 isl_seq_clr(obj->block.data, 1 + total);
6391 isl_int_set_si(obj->block.data[1+nparam+pos], 1);
6392 isl_int_set_si(obj->block.data[1+nparam+pos+(dim1-pos)], -1);
6395 res = isl_basic_map_solve_lp(bmap1, 1, obj->block.data, ctx->one,
6397 isl_basic_map_free(bmap1);
6401 isl_basic_map_free(bmap1);
6402 isl_basic_map_free(bmap2);
6403 return isl_lp_error;
6406 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
6407 * for any common value of the parameters and dimensions preceding pos
6408 * in both basic sets, the values of dimension pos in bset1 are
6409 * smaller or larger than those in bset2.
6412 * 1 if bset1 follows bset2
6413 * -1 if bset1 precedes bset2
6414 * 0 if bset1 and bset2 are incomparable
6415 * -2 if some error occurred.
6417 int isl_basic_set_compare_at(struct isl_basic_set *bset1,
6418 struct isl_basic_set *bset2, int pos)
6421 enum isl_lp_result res;
6426 res = basic_set_maximal_difference_at(bset1, bset2, pos, &opt);
6428 if (res == isl_lp_empty)
6430 else if ((res == isl_lp_ok && isl_int_is_pos(opt)) ||
6431 res == isl_lp_unbounded)
6433 else if (res == isl_lp_ok && isl_int_is_neg(opt))
6442 /* Given two basic sets bset1 and bset2, check whether
6443 * for any common value of the parameters and dimensions preceding pos
6444 * there is a value of dimension pos in bset1 that is larger
6445 * than a value of the same dimension in bset2.
6448 * 1 if there exists such a pair
6449 * 0 if there is no such pair, but there is a pair of equal values
6451 * -2 if some error occurred.
6453 int isl_basic_set_follows_at(__isl_keep isl_basic_set *bset1,
6454 __isl_keep isl_basic_set *bset2, int pos)
6457 enum isl_lp_result res;
6462 res = basic_set_maximal_difference_at(bset1, bset2, pos, &opt);
6464 if (res == isl_lp_empty)
6466 else if ((res == isl_lp_ok && isl_int_is_pos(opt)) ||
6467 res == isl_lp_unbounded)
6469 else if (res == isl_lp_ok && isl_int_is_neg(opt))
6471 else if (res == isl_lp_ok)
6480 /* Given two sets set1 and set2, check whether
6481 * for any common value of the parameters and dimensions preceding pos
6482 * there is a value of dimension pos in set1 that is larger
6483 * than a value of the same dimension in set2.
6486 * 1 if there exists such a pair
6487 * 0 if there is no such pair, but there is a pair of equal values
6489 * -2 if some error occurred.
6491 int isl_set_follows_at(__isl_keep isl_set *set1,
6492 __isl_keep isl_set *set2, int pos)
6500 for (i = 0; i < set1->n; ++i)
6501 for (j = 0; j < set2->n; ++j) {
6503 f = isl_basic_set_follows_at(set1->p[i], set2->p[j], pos);
6504 if (f == 1 || f == -2)
6513 static int isl_basic_map_fast_has_fixed_var(struct isl_basic_map *bmap,
6514 unsigned pos, isl_int *val)
6522 total = isl_basic_map_total_dim(bmap);
6523 for (i = 0, d = total-1; i < bmap->n_eq && d+1 > pos; ++i) {
6524 for (; d+1 > pos; --d)
6525 if (!isl_int_is_zero(bmap->eq[i][1+d]))
6529 if (isl_seq_first_non_zero(bmap->eq[i]+1, d) != -1)
6531 if (isl_seq_first_non_zero(bmap->eq[i]+1+d+1, total-d-1) != -1)
6533 if (!isl_int_is_one(bmap->eq[i][1+d]))
6536 isl_int_neg(*val, bmap->eq[i][0]);
6542 static int isl_map_fast_has_fixed_var(struct isl_map *map,
6543 unsigned pos, isl_int *val)
6555 return isl_basic_map_fast_has_fixed_var(map->p[0], pos, val);
6558 fixed = isl_basic_map_fast_has_fixed_var(map->p[0], pos, &v);
6559 for (i = 1; fixed == 1 && i < map->n; ++i) {
6560 fixed = isl_basic_map_fast_has_fixed_var(map->p[i], pos, &tmp);
6561 if (fixed == 1 && isl_int_ne(tmp, v))
6565 isl_int_set(*val, v);
6571 static int isl_basic_set_fast_has_fixed_var(struct isl_basic_set *bset,
6572 unsigned pos, isl_int *val)
6574 return isl_basic_map_fast_has_fixed_var((struct isl_basic_map *)bset,
6578 static int isl_set_fast_has_fixed_var(struct isl_set *set, unsigned pos,
6581 return isl_map_fast_has_fixed_var((struct isl_map *)set, pos, val);
6584 int isl_basic_map_fast_is_fixed(struct isl_basic_map *bmap,
6585 enum isl_dim_type type, unsigned pos, isl_int *val)
6587 if (pos >= isl_basic_map_dim(bmap, type))
6589 return isl_basic_map_fast_has_fixed_var(bmap,
6590 isl_basic_map_offset(bmap, type) - 1 + pos, val);
6593 int isl_map_fast_is_fixed(struct isl_map *map,
6594 enum isl_dim_type type, unsigned pos, isl_int *val)
6596 if (pos >= isl_map_dim(map, type))
6598 return isl_map_fast_has_fixed_var(map,
6599 map_offset(map, type) - 1 + pos, val);
6602 /* Check if dimension dim has fixed value and if so and if val is not NULL,
6603 * then return this fixed value in *val.
6605 int isl_basic_set_fast_dim_is_fixed(struct isl_basic_set *bset, unsigned dim,
6608 return isl_basic_set_fast_has_fixed_var(bset,
6609 isl_basic_set_n_param(bset) + dim, val);
6612 /* Check if dimension dim has fixed value and if so and if val is not NULL,
6613 * then return this fixed value in *val.
6615 int isl_set_fast_dim_is_fixed(struct isl_set *set, unsigned dim, isl_int *val)
6617 return isl_set_fast_has_fixed_var(set, isl_set_n_param(set) + dim, val);
6620 /* Check if input variable in has fixed value and if so and if val is not NULL,
6621 * then return this fixed value in *val.
6623 int isl_map_fast_input_is_fixed(struct isl_map *map, unsigned in, isl_int *val)
6625 return isl_map_fast_has_fixed_var(map, isl_map_n_param(map) + in, val);
6628 /* Check if dimension dim has an (obvious) fixed lower bound and if so
6629 * and if val is not NULL, then return this lower bound in *val.
6631 int isl_basic_set_fast_dim_has_fixed_lower_bound(struct isl_basic_set *bset,
6632 unsigned dim, isl_int *val)
6634 int i, i_eq = -1, i_ineq = -1;
6641 total = isl_basic_set_total_dim(bset);
6642 nparam = isl_basic_set_n_param(bset);
6643 for (i = 0; i < bset->n_eq; ++i) {
6644 if (isl_int_is_zero(bset->eq[i][1+nparam+dim]))
6650 for (i = 0; i < bset->n_ineq; ++i) {
6651 if (!isl_int_is_pos(bset->ineq[i][1+nparam+dim]))
6653 if (i_eq != -1 || i_ineq != -1)
6657 if (i_eq == -1 && i_ineq == -1)
6659 c = i_eq != -1 ? bset->eq[i_eq] : bset->ineq[i_ineq];
6660 /* The coefficient should always be one due to normalization. */
6661 if (!isl_int_is_one(c[1+nparam+dim]))
6663 if (isl_seq_first_non_zero(c+1, nparam+dim) != -1)
6665 if (isl_seq_first_non_zero(c+1+nparam+dim+1,
6666 total - nparam - dim - 1) != -1)
6669 isl_int_neg(*val, c[0]);
6673 int isl_set_fast_dim_has_fixed_lower_bound(struct isl_set *set,
6674 unsigned dim, isl_int *val)
6686 return isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[0],
6690 fixed = isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[0],
6692 for (i = 1; fixed == 1 && i < set->n; ++i) {
6693 fixed = isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[i],
6695 if (fixed == 1 && isl_int_ne(tmp, v))
6699 isl_int_set(*val, v);
6710 /* uset_gist depends on constraints without existentially quantified
6711 * variables sorting first.
6713 static int qsort_constraint_cmp(const void *p1, const void *p2)
6715 const struct constraint *c1 = (const struct constraint *)p1;
6716 const struct constraint *c2 = (const struct constraint *)p2;
6718 unsigned size = isl_min(c1->size, c2->size);
6720 l1 = isl_seq_last_non_zero(c1->c, size);
6721 l2 = isl_seq_last_non_zero(c2->c, size);
6726 return isl_seq_cmp(c1->c, c2->c, size);
6729 static struct isl_basic_map *isl_basic_map_sort_constraints(
6730 struct isl_basic_map *bmap)
6733 struct constraint *c;
6738 total = isl_basic_map_total_dim(bmap);
6739 c = isl_alloc_array(bmap->ctx, struct constraint, bmap->n_ineq);
6742 for (i = 0; i < bmap->n_ineq; ++i) {
6744 c[i].c = bmap->ineq[i];
6746 qsort(c, bmap->n_ineq, sizeof(struct constraint), qsort_constraint_cmp);
6747 for (i = 0; i < bmap->n_ineq; ++i)
6748 bmap->ineq[i] = c[i].c;
6752 isl_basic_map_free(bmap);
6756 __isl_give isl_basic_set *isl_basic_set_sort_constraints(
6757 __isl_take isl_basic_set *bset)
6759 return (struct isl_basic_set *)isl_basic_map_sort_constraints(
6760 (struct isl_basic_map *)bset);
6763 struct isl_basic_map *isl_basic_map_normalize(struct isl_basic_map *bmap)
6767 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_NORMALIZED))
6769 bmap = isl_basic_map_remove_redundancies(bmap);
6770 bmap = isl_basic_map_sort_constraints(bmap);
6771 ISL_F_SET(bmap, ISL_BASIC_MAP_NORMALIZED);
6775 struct isl_basic_set *isl_basic_set_normalize(struct isl_basic_set *bset)
6777 return (struct isl_basic_set *)isl_basic_map_normalize(
6778 (struct isl_basic_map *)bset);
6781 int isl_basic_map_fast_cmp(const __isl_keep isl_basic_map *bmap1,
6782 const __isl_keep isl_basic_map *bmap2)
6789 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_RATIONAL) !=
6790 ISL_F_ISSET(bmap2, ISL_BASIC_MAP_RATIONAL))
6791 return ISL_F_ISSET(bmap1, ISL_BASIC_MAP_RATIONAL) ? -1 : 1;
6792 if (isl_basic_map_n_param(bmap1) != isl_basic_map_n_param(bmap2))
6793 return isl_basic_map_n_param(bmap1) - isl_basic_map_n_param(bmap2);
6794 if (isl_basic_map_n_in(bmap1) != isl_basic_map_n_in(bmap2))
6795 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
6796 if (isl_basic_map_n_out(bmap1) != isl_basic_map_n_out(bmap2))
6797 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
6798 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY) &&
6799 ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
6801 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY))
6803 if (ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
6805 if (bmap1->n_eq != bmap2->n_eq)
6806 return bmap1->n_eq - bmap2->n_eq;
6807 if (bmap1->n_ineq != bmap2->n_ineq)
6808 return bmap1->n_ineq - bmap2->n_ineq;
6809 if (bmap1->n_div != bmap2->n_div)
6810 return bmap1->n_div - bmap2->n_div;
6811 total = isl_basic_map_total_dim(bmap1);
6812 for (i = 0; i < bmap1->n_eq; ++i) {
6813 cmp = isl_seq_cmp(bmap1->eq[i], bmap2->eq[i], 1+total);
6817 for (i = 0; i < bmap1->n_ineq; ++i) {
6818 cmp = isl_seq_cmp(bmap1->ineq[i], bmap2->ineq[i], 1+total);
6822 for (i = 0; i < bmap1->n_div; ++i) {
6823 cmp = isl_seq_cmp(bmap1->div[i], bmap2->div[i], 1+1+total);
6830 int isl_basic_map_fast_is_equal(__isl_keep isl_basic_map *bmap1,
6831 __isl_keep isl_basic_map *bmap2)
6833 return isl_basic_map_fast_cmp(bmap1, bmap2) == 0;
6836 int isl_basic_set_fast_is_equal(__isl_keep isl_basic_set *bset1,
6837 __isl_keep isl_basic_set *bset2)
6839 return isl_basic_map_fast_is_equal((isl_basic_map *)bset1,
6840 (isl_basic_map *)bset2);
6843 static int qsort_bmap_cmp(const void *p1, const void *p2)
6845 const struct isl_basic_map *bmap1 = *(const struct isl_basic_map **)p1;
6846 const struct isl_basic_map *bmap2 = *(const struct isl_basic_map **)p2;
6848 return isl_basic_map_fast_cmp(bmap1, bmap2);
6851 /* We normalize in place, but if anything goes wrong we need
6852 * to return NULL, so we need to make sure we don't change the
6853 * meaning of any possible other copies of map.
6855 struct isl_map *isl_map_normalize(struct isl_map *map)
6858 struct isl_basic_map *bmap;
6862 if (ISL_F_ISSET(map, ISL_MAP_NORMALIZED))
6864 for (i = 0; i < map->n; ++i) {
6865 bmap = isl_basic_map_normalize(isl_basic_map_copy(map->p[i]));
6868 isl_basic_map_free(map->p[i]);
6871 qsort(map->p, map->n, sizeof(struct isl_basic_map *), qsort_bmap_cmp);
6872 ISL_F_SET(map, ISL_MAP_NORMALIZED);
6873 map = isl_map_remove_empty_parts(map);
6876 for (i = map->n - 1; i >= 1; --i) {
6877 if (!isl_basic_map_fast_is_equal(map->p[i-1], map->p[i]))
6879 isl_basic_map_free(map->p[i-1]);
6880 for (j = i; j < map->n; ++j)
6881 map->p[j-1] = map->p[j];
6891 struct isl_set *isl_set_normalize(struct isl_set *set)
6893 return (struct isl_set *)isl_map_normalize((struct isl_map *)set);
6896 int isl_map_fast_is_equal(struct isl_map *map1, struct isl_map *map2)
6906 if (!isl_dim_equal(map1->dim, map2->dim))
6909 map1 = isl_map_copy(map1);
6910 map2 = isl_map_copy(map2);
6911 map1 = isl_map_normalize(map1);
6912 map2 = isl_map_normalize(map2);
6915 equal = map1->n == map2->n;
6916 for (i = 0; equal && i < map1->n; ++i) {
6917 equal = isl_basic_map_fast_is_equal(map1->p[i], map2->p[i]);
6930 int isl_set_fast_is_equal(struct isl_set *set1, struct isl_set *set2)
6932 return isl_map_fast_is_equal((struct isl_map *)set1,
6933 (struct isl_map *)set2);
6936 /* Return an interval that ranges from min to max (inclusive)
6938 struct isl_basic_set *isl_basic_set_interval(struct isl_ctx *ctx,
6939 isl_int min, isl_int max)
6942 struct isl_basic_set *bset = NULL;
6944 bset = isl_basic_set_alloc(ctx, 0, 1, 0, 0, 2);
6948 k = isl_basic_set_alloc_inequality(bset);
6951 isl_int_set_si(bset->ineq[k][1], 1);
6952 isl_int_neg(bset->ineq[k][0], min);
6954 k = isl_basic_set_alloc_inequality(bset);
6957 isl_int_set_si(bset->ineq[k][1], -1);
6958 isl_int_set(bset->ineq[k][0], max);
6962 isl_basic_set_free(bset);
6966 /* Return the Cartesian product of the basic sets in list (in the given order).
6968 __isl_give isl_basic_set *isl_basic_set_list_product(
6969 __isl_take struct isl_basic_set_list *list)
6977 struct isl_basic_set *product = NULL;
6981 isl_assert(list->ctx, list->n > 0, goto error);
6982 isl_assert(list->ctx, list->p[0], goto error);
6983 nparam = isl_basic_set_n_param(list->p[0]);
6984 dim = isl_basic_set_n_dim(list->p[0]);
6985 extra = list->p[0]->n_div;
6986 n_eq = list->p[0]->n_eq;
6987 n_ineq = list->p[0]->n_ineq;
6988 for (i = 1; i < list->n; ++i) {
6989 isl_assert(list->ctx, list->p[i], goto error);
6990 isl_assert(list->ctx,
6991 nparam == isl_basic_set_n_param(list->p[i]), goto error);
6992 dim += isl_basic_set_n_dim(list->p[i]);
6993 extra += list->p[i]->n_div;
6994 n_eq += list->p[i]->n_eq;
6995 n_ineq += list->p[i]->n_ineq;
6997 product = isl_basic_set_alloc(list->ctx, nparam, dim, extra,
7002 for (i = 0; i < list->n; ++i) {
7003 isl_basic_set_add_constraints(product,
7004 isl_basic_set_copy(list->p[i]), dim);
7005 dim += isl_basic_set_n_dim(list->p[i]);
7007 isl_basic_set_list_free(list);
7010 isl_basic_set_free(product);
7011 isl_basic_set_list_free(list);
7015 struct isl_basic_map *isl_basic_map_product(
7016 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
7018 struct isl_dim *dim_result = NULL;
7019 struct isl_basic_map *bmap;
7020 unsigned in1, in2, out1, out2, nparam, total, pos;
7021 struct isl_dim_map *dim_map1, *dim_map2;
7023 if (!bmap1 || !bmap2)
7026 isl_assert(bmap1->ctx, isl_dim_match(bmap1->dim, isl_dim_param,
7027 bmap2->dim, isl_dim_param), goto error);
7028 dim_result = isl_dim_product(isl_dim_copy(bmap1->dim),
7029 isl_dim_copy(bmap2->dim));
7031 in1 = isl_basic_map_n_in(bmap1);
7032 in2 = isl_basic_map_n_in(bmap2);
7033 out1 = isl_basic_map_n_out(bmap1);
7034 out2 = isl_basic_map_n_out(bmap2);
7035 nparam = isl_basic_map_n_param(bmap1);
7037 total = nparam + in1 + in2 + out1 + out2 + bmap1->n_div + bmap2->n_div;
7038 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
7039 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
7040 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
7041 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
7042 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
7043 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos += in1);
7044 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += in2);
7045 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += out1);
7046 isl_dim_map_div(dim_map1, bmap1, pos += out2);
7047 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
7049 bmap = isl_basic_map_alloc_dim(dim_result,
7050 bmap1->n_div + bmap2->n_div,
7051 bmap1->n_eq + bmap2->n_eq,
7052 bmap1->n_ineq + bmap2->n_ineq);
7053 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap1, dim_map1);
7054 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap2, dim_map2);
7055 bmap = isl_basic_map_simplify(bmap);
7056 return isl_basic_map_finalize(bmap);
7058 isl_basic_map_free(bmap1);
7059 isl_basic_map_free(bmap2);
7063 __isl_give isl_basic_map *isl_basic_map_flat_product(
7064 __isl_take isl_basic_map *bmap1, __isl_take isl_basic_map *bmap2)
7066 isl_basic_map *prod;
7068 prod = isl_basic_map_product(bmap1, bmap2);
7069 prod = isl_basic_map_flatten(prod);
7073 __isl_give isl_basic_set *isl_basic_set_flat_product(
7074 __isl_take isl_basic_set *bset1, __isl_take isl_basic_set *bset2)
7076 return isl_basic_map_flat_product(bset1, bset2);
7079 __isl_give isl_basic_map *isl_basic_map_range_product(
7080 __isl_take isl_basic_map *bmap1, __isl_take isl_basic_map *bmap2)
7082 isl_dim *dim_result = NULL;
7083 isl_basic_map *bmap;
7084 unsigned in, out1, out2, nparam, total, pos;
7085 struct isl_dim_map *dim_map1, *dim_map2;
7087 if (!bmap1 || !bmap2)
7090 dim_result = isl_dim_range_product(isl_dim_copy(bmap1->dim),
7091 isl_dim_copy(bmap2->dim));
7093 in = isl_basic_map_dim(bmap1, isl_dim_in);
7094 out1 = isl_basic_map_n_out(bmap1);
7095 out2 = isl_basic_map_n_out(bmap2);
7096 nparam = isl_basic_map_n_param(bmap1);
7098 total = nparam + in + out1 + out2 + bmap1->n_div + bmap2->n_div;
7099 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
7100 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
7101 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
7102 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
7103 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
7104 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
7105 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += in);
7106 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += out1);
7107 isl_dim_map_div(dim_map1, bmap1, pos += out2);
7108 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
7110 bmap = isl_basic_map_alloc_dim(dim_result,
7111 bmap1->n_div + bmap2->n_div,
7112 bmap1->n_eq + bmap2->n_eq,
7113 bmap1->n_ineq + bmap2->n_ineq);
7114 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap1, dim_map1);
7115 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap2, dim_map2);
7116 bmap = isl_basic_map_simplify(bmap);
7117 return isl_basic_map_finalize(bmap);
7119 isl_basic_map_free(bmap1);
7120 isl_basic_map_free(bmap2);
7124 static __isl_give isl_map *map_product(__isl_take isl_map *map1,
7125 __isl_take isl_map *map2,
7126 __isl_give isl_dim *(*dim_product)(__isl_take isl_dim *left,
7127 __isl_take isl_dim *right),
7128 __isl_give isl_basic_map *(*basic_map_product)(
7129 __isl_take isl_basic_map *left, __isl_take isl_basic_map *right))
7132 struct isl_map *result;
7138 isl_assert(map1->ctx, isl_dim_match(map1->dim, isl_dim_param,
7139 map2->dim, isl_dim_param), goto error);
7141 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
7142 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
7143 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
7145 result = isl_map_alloc_dim(dim_product(isl_dim_copy(map1->dim),
7146 isl_dim_copy(map2->dim)),
7147 map1->n * map2->n, flags);
7150 for (i = 0; i < map1->n; ++i)
7151 for (j = 0; j < map2->n; ++j) {
7152 struct isl_basic_map *part;
7153 part = basic_map_product(isl_basic_map_copy(map1->p[i]),
7154 isl_basic_map_copy(map2->p[j]));
7155 if (isl_basic_map_is_empty(part))
7156 isl_basic_map_free(part);
7158 result = isl_map_add_basic_map(result, part);
7171 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> [B -> D]
7173 struct isl_map *isl_map_product(struct isl_map *map1, struct isl_map *map2)
7175 return map_product(map1, map2, &isl_dim_product, &isl_basic_map_product);
7178 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
7180 __isl_give isl_map *isl_map_flat_product(__isl_take isl_map *map1,
7181 __isl_take isl_map *map2)
7185 prod = isl_map_product(map1, map2);
7186 prod = isl_map_flatten(prod);
7190 /* Given two set A and B, construct its Cartesian product A x B.
7192 struct isl_set *isl_set_product(struct isl_set *set1, struct isl_set *set2)
7194 return (struct isl_set *)isl_map_product((struct isl_map *)set1,
7195 (struct isl_map *)set2);
7198 __isl_give isl_set *isl_set_flat_product(__isl_take isl_set *set1,
7199 __isl_take isl_set *set2)
7201 return (isl_set *)isl_map_flat_product((isl_map *)set1, (isl_map *)set2);
7204 /* Given two maps A -> B and C -> D, construct a map (A * C) -> [B -> D]
7206 __isl_give isl_map *isl_map_range_product(__isl_take isl_map *map1,
7207 __isl_take isl_map *map2)
7209 return map_product(map1, map2, &isl_dim_range_product,
7210 &isl_basic_map_range_product);
7213 uint32_t isl_basic_map_get_hash(__isl_keep isl_basic_map *bmap)
7216 uint32_t hash = isl_hash_init();
7221 bmap = isl_basic_map_copy(bmap);
7222 bmap = isl_basic_map_normalize(bmap);
7225 total = isl_basic_map_total_dim(bmap);
7226 isl_hash_byte(hash, bmap->n_eq & 0xFF);
7227 for (i = 0; i < bmap->n_eq; ++i) {
7229 c_hash = isl_seq_get_hash(bmap->eq[i], 1 + total);
7230 isl_hash_hash(hash, c_hash);
7232 isl_hash_byte(hash, bmap->n_ineq & 0xFF);
7233 for (i = 0; i < bmap->n_ineq; ++i) {
7235 c_hash = isl_seq_get_hash(bmap->ineq[i], 1 + total);
7236 isl_hash_hash(hash, c_hash);
7238 isl_hash_byte(hash, bmap->n_div & 0xFF);
7239 for (i = 0; i < bmap->n_div; ++i) {
7241 if (isl_int_is_zero(bmap->div[i][0]))
7243 isl_hash_byte(hash, i & 0xFF);
7244 c_hash = isl_seq_get_hash(bmap->div[i], 1 + 1 + total);
7245 isl_hash_hash(hash, c_hash);
7247 isl_basic_map_free(bmap);
7251 uint32_t isl_basic_set_get_hash(__isl_keep isl_basic_set *bset)
7253 return isl_basic_map_get_hash((isl_basic_map *)bset);
7256 uint32_t isl_map_get_hash(__isl_keep isl_map *map)
7263 map = isl_map_copy(map);
7264 map = isl_map_normalize(map);
7268 hash = isl_hash_init();
7269 for (i = 0; i < map->n; ++i) {
7271 bmap_hash = isl_basic_map_get_hash(map->p[i]);
7272 isl_hash_hash(hash, bmap_hash);
7280 uint32_t isl_set_get_hash(__isl_keep isl_set *set)
7282 return isl_map_get_hash((isl_map *)set);
7285 /* Check if the value for dimension dim is completely determined
7286 * by the values of the other parameters and variables.
7287 * That is, check if dimension dim is involved in an equality.
7289 int isl_basic_set_dim_is_unique(struct isl_basic_set *bset, unsigned dim)
7296 nparam = isl_basic_set_n_param(bset);
7297 for (i = 0; i < bset->n_eq; ++i)
7298 if (!isl_int_is_zero(bset->eq[i][1 + nparam + dim]))
7303 /* Check if the value for dimension dim is completely determined
7304 * by the values of the other parameters and variables.
7305 * That is, check if dimension dim is involved in an equality
7306 * for each of the subsets.
7308 int isl_set_dim_is_unique(struct isl_set *set, unsigned dim)
7314 for (i = 0; i < set->n; ++i) {
7316 unique = isl_basic_set_dim_is_unique(set->p[i], dim);
7323 int isl_set_n_basic_set(__isl_keep isl_set *set)
7325 return set ? set->n : 0;
7328 int isl_map_foreach_basic_map(__isl_keep isl_map *map,
7329 int (*fn)(__isl_take isl_basic_map *bmap, void *user), void *user)
7336 for (i = 0; i < map->n; ++i)
7337 if (fn(isl_basic_map_copy(map->p[i]), user) < 0)
7343 int isl_set_foreach_basic_set(__isl_keep isl_set *set,
7344 int (*fn)(__isl_take isl_basic_set *bset, void *user), void *user)
7351 for (i = 0; i < set->n; ++i)
7352 if (fn(isl_basic_set_copy(set->p[i]), user) < 0)
7358 __isl_give isl_basic_set *isl_basic_set_lift(__isl_take isl_basic_set *bset)
7360 struct isl_dim *dim;
7365 bset = isl_basic_set_cow(bset);
7369 dim = isl_basic_set_get_dim(bset);
7370 dim = isl_dim_lift(dim, bset->n_div);
7373 isl_dim_free(bset->dim);
7375 bset->extra -= bset->n_div;
7378 bset = isl_basic_set_finalize(bset);
7382 isl_basic_set_free(bset);
7386 __isl_give isl_set *isl_set_lift(__isl_take isl_set *set)
7389 struct isl_dim *dim;
7392 set = isl_set_align_divs(set);
7397 set = isl_set_cow(set);
7401 n_div = set->p[0]->n_div;
7402 dim = isl_set_get_dim(set);
7403 dim = isl_dim_lift(dim, n_div);
7406 isl_dim_free(set->dim);
7409 for (i = 0; i < set->n; ++i) {
7410 set->p[i] = isl_basic_set_lift(set->p[i]);
7421 __isl_give isl_map *isl_set_lifting(__isl_take isl_set *set)
7423 struct isl_dim *dim;
7424 struct isl_basic_map *bmap;
7431 set = isl_set_align_divs(set);
7436 dim = isl_set_get_dim(set);
7437 if (set->n == 0 || set->p[0]->n_div == 0) {
7439 return isl_map_identity(isl_dim_map_from_set(dim));
7442 n_div = set->p[0]->n_div;
7443 dim = isl_dim_map_from_set(dim);
7444 n_param = isl_dim_size(dim, isl_dim_param);
7445 n_set = isl_dim_size(dim, isl_dim_in);
7446 dim = isl_dim_extend(dim, n_param, n_set, n_set + n_div);
7447 bmap = isl_basic_map_alloc_dim(dim, 0, n_set, 2 * n_div);
7448 for (i = 0; i < n_set; ++i)
7449 bmap = var_equal(bmap, i);
7451 total = n_param + n_set + n_set + n_div;
7452 for (i = 0; i < n_div; ++i) {
7453 k = isl_basic_map_alloc_inequality(bmap);
7456 isl_seq_cpy(bmap->ineq[k], set->p[0]->div[i]+1, 1+n_param);
7457 isl_seq_clr(bmap->ineq[k]+1+n_param, n_set);
7458 isl_seq_cpy(bmap->ineq[k]+1+n_param+n_set,
7459 set->p[0]->div[i]+1+1+n_param, n_set + n_div);
7460 isl_int_neg(bmap->ineq[k][1+n_param+n_set+n_set+i],
7461 set->p[0]->div[i][0]);
7463 l = isl_basic_map_alloc_inequality(bmap);
7466 isl_seq_neg(bmap->ineq[l], bmap->ineq[k], 1 + total);
7467 isl_int_add(bmap->ineq[l][0], bmap->ineq[l][0],
7468 set->p[0]->div[i][0]);
7469 isl_int_sub_ui(bmap->ineq[l][0], bmap->ineq[l][0], 1);
7473 bmap = isl_basic_map_simplify(bmap);
7474 bmap = isl_basic_map_finalize(bmap);
7475 return isl_map_from_basic_map(bmap);
7478 isl_basic_map_free(bmap);
7482 int isl_basic_set_size(__isl_keep isl_basic_set *bset)
7490 dim = isl_basic_set_total_dim(bset);
7491 size += bset->n_eq * (1 + dim);
7492 size += bset->n_ineq * (1 + dim);
7493 size += bset->n_div * (2 + dim);
7498 int isl_set_size(__isl_keep isl_set *set)
7506 for (i = 0; i < set->n; ++i)
7507 size += isl_basic_set_size(set->p[i]);
7512 int isl_basic_map_dim_is_bounded(__isl_keep isl_basic_map *bmap,
7513 enum isl_dim_type type, unsigned pos)
7521 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), return -1);
7523 pos += isl_basic_map_offset(bmap, type);
7525 for (i = 0; i < bmap->n_eq; ++i)
7526 if (!isl_int_is_zero(bmap->eq[i][pos]))
7530 for (i = 0; i < bmap->n_ineq; ++i) {
7531 int sgn = isl_int_sgn(bmap->ineq[i][pos]);
7538 return lower && upper;
7541 int isl_map_dim_is_bounded(__isl_keep isl_map *map,
7542 enum isl_dim_type type, unsigned pos)
7549 for (i = 0; i < map->n; ++i) {
7551 bounded = isl_basic_map_dim_is_bounded(map->p[i], type, pos);
7552 if (bounded < 0 || !bounded)
7559 /* Return 1 if the specified dim is involved in both an upper bound
7560 * and a lower bound.
7562 int isl_set_dim_is_bounded(__isl_keep isl_set *set,
7563 enum isl_dim_type type, unsigned pos)
7565 return isl_map_dim_is_bounded((isl_map *)set, type, pos);
7568 /* For each of the "n" variables starting at "first", determine
7569 * the sign of the variable and put the results in the first "n"
7570 * elements of the array "signs".
7572 * 1 means that the variable is non-negative
7573 * -1 means that the variable is non-positive
7574 * 0 means the variable attains both positive and negative values.
7576 int isl_basic_set_vars_get_sign(__isl_keep isl_basic_set *bset,
7577 unsigned first, unsigned n, int *signs)
7579 isl_vec *bound = NULL;
7580 struct isl_tab *tab = NULL;
7581 struct isl_tab_undo *snap;
7584 if (!bset || !signs)
7587 bound = isl_vec_alloc(bset->ctx, 1 + isl_basic_set_total_dim(bset));
7588 tab = isl_tab_from_basic_set(bset);
7592 isl_seq_clr(bound->el, bound->size);
7593 isl_int_set_si(bound->el[0], -1);
7595 snap = isl_tab_snap(tab);
7596 for (i = 0; i < n; ++i) {
7599 isl_int_set_si(bound->el[1 + first + i], -1);
7600 if (isl_tab_add_ineq(tab, bound->el) < 0)
7603 isl_int_set_si(bound->el[1 + first + i], 0);
7604 if (isl_tab_rollback(tab, snap) < 0)
7612 isl_int_set_si(bound->el[1 + first + i], 1);
7613 if (isl_tab_add_ineq(tab, bound->el) < 0)
7616 isl_int_set_si(bound->el[1 + first + i], 0);
7617 if (isl_tab_rollback(tab, snap) < 0)
7620 signs[i] = empty ? -1 : 0;
7624 isl_vec_free(bound);
7628 isl_vec_free(bound);
7632 int isl_basic_set_dims_get_sign(__isl_keep isl_basic_set *bset,
7633 enum isl_dim_type type, unsigned first, unsigned n, int *signs)
7635 if (!bset || !signs)
7637 isl_assert(bset->ctx, first + n <= isl_basic_set_dim(bset, type),
7640 first += pos(bset->dim, type) - 1;
7641 return isl_basic_set_vars_get_sign(bset, first, n, signs);
7644 /* Check if the given basic map is obviously single-valued.
7645 * In particular, for each output dimension, check that there is
7646 * an equality that defines the output dimension in terms of
7647 * earlier dimensions.
7649 int isl_basic_map_fast_is_single_valued(__isl_keep isl_basic_map *bmap)
7659 total = 1 + isl_basic_map_total_dim(bmap);
7660 n_out = isl_basic_map_dim(bmap, isl_dim_out);
7661 o_out = isl_basic_map_offset(bmap, isl_dim_out);
7663 for (i = 0; i < n_out; ++i) {
7664 for (j = 0; j < bmap->n_eq; ++j) {
7665 if (isl_int_is_zero(bmap->eq[j][o_out + i]))
7667 if (isl_seq_first_non_zero(bmap->eq[j] + o_out + i + 1,
7668 total - (o_out + i + 1)) == -1)
7671 if (j >= bmap->n_eq)
7678 /* Check if the given map is obviously single-valued.
7680 int isl_map_fast_is_single_valued(__isl_keep isl_map *map)
7691 return isl_basic_map_fast_is_single_valued(map->p[0]);
7694 /* Check if the given map is single-valued.
7699 * and check if the result is a subset of the identity mapping.
7701 int isl_map_is_single_valued(__isl_keep isl_map *map)
7708 sv = isl_map_fast_is_single_valued(map);
7712 test = isl_map_reverse(isl_map_copy(map));
7713 test = isl_map_apply_range(test, isl_map_copy(map));
7715 dim = isl_dim_map_from_set(isl_dim_range(isl_map_get_dim(map)));
7716 id = isl_map_identity(dim);
7718 sv = isl_map_is_subset(test, id);
7726 int isl_map_is_bijective(__isl_keep isl_map *map)
7730 sv = isl_map_is_single_valued(map);
7734 map = isl_map_copy(map);
7735 map = isl_map_reverse(map);
7736 sv = isl_map_is_single_valued(map);
7742 int isl_set_is_singleton(__isl_keep isl_set *set)
7744 return isl_map_is_single_valued((isl_map *)set);
7747 int isl_map_is_translation(__isl_keep isl_map *map)
7752 delta = isl_map_deltas(isl_map_copy(map));
7753 ok = isl_set_is_singleton(delta);
7754 isl_set_free(delta);
7759 static int unique(isl_int *p, unsigned pos, unsigned len)
7761 if (isl_seq_first_non_zero(p, pos) != -1)
7763 if (isl_seq_first_non_zero(p + pos + 1, len - pos - 1) != -1)
7768 int isl_basic_set_is_box(__isl_keep isl_basic_set *bset)
7777 if (isl_basic_set_dim(bset, isl_dim_div) != 0)
7780 nvar = isl_basic_set_dim(bset, isl_dim_set);
7781 ovar = isl_dim_offset(bset->dim, isl_dim_set);
7782 for (j = 0; j < nvar; ++j) {
7783 int lower = 0, upper = 0;
7784 for (i = 0; i < bset->n_eq; ++i) {
7785 if (isl_int_is_zero(bset->eq[i][1 + ovar + j]))
7787 if (!unique(bset->eq[i] + 1 + ovar, j, nvar))
7793 for (i = 0; i < bset->n_ineq; ++i) {
7794 if (isl_int_is_zero(bset->ineq[i][1 + ovar + j]))
7796 if (!unique(bset->ineq[i] + 1 + ovar, j, nvar))
7798 if (isl_int_is_pos(bset->ineq[i][1 + ovar + j]))
7803 if (!lower || !upper)
7810 int isl_set_is_box(__isl_keep isl_set *set)
7817 return isl_basic_set_is_box(set->p[0]);
7820 int isl_basic_set_is_wrapping(__isl_keep isl_basic_set *bset)
7825 return isl_dim_is_wrapping(bset->dim);
7828 int isl_set_is_wrapping(__isl_keep isl_set *set)
7833 return isl_dim_is_wrapping(set->dim);
7836 __isl_give isl_basic_set *isl_basic_map_wrap(__isl_take isl_basic_map *bmap)
7838 bmap = isl_basic_map_cow(bmap);
7842 bmap->dim = isl_dim_wrap(bmap->dim);
7846 bmap = isl_basic_map_finalize(bmap);
7848 return (isl_basic_set *)bmap;
7850 isl_basic_map_free(bmap);
7854 __isl_give isl_set *isl_map_wrap(__isl_take isl_map *map)
7858 map = isl_map_cow(map);
7862 for (i = 0; i < map->n; ++i) {
7863 map->p[i] = (isl_basic_map *)isl_basic_map_wrap(map->p[i]);
7867 map->dim = isl_dim_wrap(map->dim);
7871 return (isl_set *)map;
7877 __isl_give isl_basic_map *isl_basic_set_unwrap(__isl_take isl_basic_set *bset)
7879 bset = isl_basic_set_cow(bset);
7883 bset->dim = isl_dim_unwrap(bset->dim);
7887 bset = isl_basic_set_finalize(bset);
7889 return (isl_basic_map *)bset;
7891 isl_basic_set_free(bset);
7895 __isl_give isl_map *isl_set_unwrap(__isl_take isl_set *set)
7902 if (!isl_set_is_wrapping(set))
7903 isl_die(set->ctx, isl_error_invalid, "not a wrapping set",
7906 set = isl_set_cow(set);
7910 for (i = 0; i < set->n; ++i) {
7911 set->p[i] = (isl_basic_set *)isl_basic_set_unwrap(set->p[i]);
7916 set->dim = isl_dim_unwrap(set->dim);
7920 return (isl_map *)set;
7926 __isl_give isl_basic_map *isl_basic_map_reset(__isl_take isl_basic_map *bmap,
7927 enum isl_dim_type type)
7932 if (!isl_dim_is_named_or_nested(bmap->dim, type))
7935 bmap = isl_basic_map_cow(bmap);
7939 bmap->dim = isl_dim_reset(bmap->dim, type);
7943 bmap = isl_basic_map_finalize(bmap);
7947 isl_basic_map_free(bmap);
7951 __isl_give isl_map *isl_map_reset(__isl_take isl_map *map,
7952 enum isl_dim_type type)
7959 if (!isl_dim_is_named_or_nested(map->dim, type))
7962 map = isl_map_cow(map);
7966 for (i = 0; i < map->n; ++i) {
7967 map->p[i] = isl_basic_map_reset(map->p[i], type);
7971 map->dim = isl_dim_reset(map->dim, type);
7981 __isl_give isl_basic_map *isl_basic_map_flatten(__isl_take isl_basic_map *bmap)
7986 if (!bmap->dim->nested[0] && !bmap->dim->nested[1])
7989 bmap = isl_basic_map_cow(bmap);
7993 bmap->dim = isl_dim_flatten(bmap->dim);
7997 bmap = isl_basic_map_finalize(bmap);
8001 isl_basic_map_free(bmap);
8005 __isl_give isl_basic_set *isl_basic_set_flatten(__isl_take isl_basic_set *bset)
8007 return (isl_basic_set *)isl_basic_map_flatten((isl_basic_map *)bset);
8010 __isl_give isl_map *isl_map_flatten(__isl_take isl_map *map)
8017 if (!map->dim->nested[0] && !map->dim->nested[1])
8020 map = isl_map_cow(map);
8024 for (i = 0; i < map->n; ++i) {
8025 map->p[i] = isl_basic_map_flatten(map->p[i]);
8029 map->dim = isl_dim_flatten(map->dim);
8039 __isl_give isl_set *isl_set_flatten(__isl_take isl_set *set)
8041 return (isl_set *)isl_map_flatten((isl_map *)set);
8044 __isl_give isl_map *isl_set_flatten_map(__isl_take isl_set *set)
8046 isl_dim *dim, *flat_dim;
8049 dim = isl_set_get_dim(set);
8050 flat_dim = isl_dim_flatten(isl_dim_copy(dim));
8051 map = isl_map_identity(isl_dim_join(isl_dim_reverse(dim), flat_dim));
8052 map = isl_map_intersect_domain(map, set);
8057 /* Reorder the dimensions of "bmap" according to the given dim_map
8058 * and set the dimension specification to "dim".
8060 __isl_give isl_basic_map *isl_basic_map_realign(__isl_take isl_basic_map *bmap,
8061 __isl_take isl_dim *dim, __isl_take struct isl_dim_map *dim_map)
8065 bmap = isl_basic_map_cow(bmap);
8066 if (!bmap || !dim || !dim_map)
8069 res = isl_basic_map_alloc_dim(dim,
8070 bmap->n_div, bmap->n_eq, bmap->n_ineq);
8071 res = isl_basic_map_add_constraints_dim_map(res, bmap, dim_map);
8072 res = isl_basic_map_finalize(res);
8076 isl_basic_map_free(bmap);
8081 /* Reorder the dimensions of "map" according to given reordering.
8083 __isl_give isl_map *isl_map_realign(__isl_take isl_map *map,
8084 __isl_take isl_reordering *r)
8087 struct isl_dim_map *dim_map;
8089 map = isl_map_cow(map);
8090 dim_map = isl_dim_map_from_reordering(r);
8091 if (!map || !r || !dim_map)
8094 for (i = 0; i < map->n; ++i) {
8095 struct isl_dim_map *dim_map_i;
8097 dim_map_i = isl_dim_map_extend(dim_map, map->p[i]);
8099 map->p[i] = isl_basic_map_realign(map->p[i],
8100 isl_dim_copy(r->dim), dim_map_i);
8106 map = isl_map_reset_dim(map, isl_dim_copy(r->dim));
8108 isl_reordering_free(r);
8114 isl_reordering_free(r);
8118 __isl_give isl_set *isl_set_realign(__isl_take isl_set *set,
8119 __isl_take isl_reordering *r)
8121 return (isl_set *)isl_map_realign((isl_map *)set, r);
8124 __isl_give isl_mat *isl_basic_map_equalities_matrix(
8125 __isl_keep isl_basic_map *bmap, enum isl_dim_type c1,
8126 enum isl_dim_type c2, enum isl_dim_type c3,
8127 enum isl_dim_type c4, enum isl_dim_type c5)
8129 enum isl_dim_type c[5] = { c1, c2, c3, c4, c5 };
8130 struct isl_mat *mat;
8136 mat = isl_mat_alloc(bmap->ctx, bmap->n_eq,
8137 isl_basic_map_total_dim(bmap) + 1);
8140 for (i = 0; i < bmap->n_eq; ++i)
8141 for (j = 0, pos = 0; j < 5; ++j) {
8142 int off = isl_basic_map_offset(bmap, c[j]);
8143 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
8144 isl_int_set(mat->row[i][pos],
8145 bmap->eq[i][off + k]);
8153 __isl_give isl_mat *isl_basic_map_inequalities_matrix(
8154 __isl_keep isl_basic_map *bmap, enum isl_dim_type c1,
8155 enum isl_dim_type c2, enum isl_dim_type c3,
8156 enum isl_dim_type c4, enum isl_dim_type c5)
8158 enum isl_dim_type c[5] = { c1, c2, c3, c4, c5 };
8159 struct isl_mat *mat;
8165 mat = isl_mat_alloc(bmap->ctx, bmap->n_ineq,
8166 isl_basic_map_total_dim(bmap) + 1);
8169 for (i = 0; i < bmap->n_ineq; ++i)
8170 for (j = 0, pos = 0; j < 5; ++j) {
8171 int off = isl_basic_map_offset(bmap, c[j]);
8172 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
8173 isl_int_set(mat->row[i][pos],
8174 bmap->ineq[i][off + k]);
8182 __isl_give isl_basic_map *isl_basic_map_from_constraint_matrices(
8183 __isl_take isl_dim *dim,
8184 __isl_take isl_mat *eq, __isl_take isl_mat *ineq, enum isl_dim_type c1,
8185 enum isl_dim_type c2, enum isl_dim_type c3,
8186 enum isl_dim_type c4, enum isl_dim_type c5)
8188 enum isl_dim_type c[5] = { c1, c2, c3, c4, c5 };
8189 isl_basic_map *bmap;
8195 if (!dim || !eq || !ineq)
8198 if (eq->n_col != ineq->n_col)
8199 isl_die(dim->ctx, isl_error_invalid,
8200 "equalities and inequalities matrices should have "
8201 "same number of columns", goto error);
8203 total = 1 + isl_dim_total(dim);
8205 if (eq->n_col < total)
8206 isl_die(dim->ctx, isl_error_invalid,
8207 "number of columns too small", goto error);
8209 extra = eq->n_col - total;
8211 bmap = isl_basic_map_alloc_dim(isl_dim_copy(dim), extra,
8212 eq->n_row, ineq->n_row);
8215 for (i = 0; i < extra; ++i) {
8216 k = isl_basic_map_alloc_div(bmap);
8219 isl_int_set_si(bmap->div[k][0], 0);
8221 for (i = 0; i < eq->n_row; ++i) {
8222 l = isl_basic_map_alloc_equality(bmap);
8225 for (j = 0, pos = 0; j < 5; ++j) {
8226 int off = isl_basic_map_offset(bmap, c[j]);
8227 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
8228 isl_int_set(bmap->eq[l][off + k],
8234 for (i = 0; i < ineq->n_row; ++i) {
8235 l = isl_basic_map_alloc_inequality(bmap);
8238 for (j = 0, pos = 0; j < 5; ++j) {
8239 int off = isl_basic_map_offset(bmap, c[j]);
8240 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
8241 isl_int_set(bmap->ineq[l][off + k],
8260 __isl_give isl_mat *isl_basic_set_equalities_matrix(
8261 __isl_keep isl_basic_set *bset, enum isl_dim_type c1,
8262 enum isl_dim_type c2, enum isl_dim_type c3, enum isl_dim_type c4)
8264 return isl_basic_map_equalities_matrix((isl_basic_map *)bset,
8265 c1, c2, c3, c4, isl_dim_in);
8268 __isl_give isl_mat *isl_basic_set_inequalities_matrix(
8269 __isl_keep isl_basic_set *bset, enum isl_dim_type c1,
8270 enum isl_dim_type c2, enum isl_dim_type c3, enum isl_dim_type c4)
8272 return isl_basic_map_inequalities_matrix((isl_basic_map *)bset,
8273 c1, c2, c3, c4, isl_dim_in);
8276 __isl_give isl_basic_set *isl_basic_set_from_constraint_matrices(
8277 __isl_take isl_dim *dim,
8278 __isl_take isl_mat *eq, __isl_take isl_mat *ineq, enum isl_dim_type c1,
8279 enum isl_dim_type c2, enum isl_dim_type c3, enum isl_dim_type c4)
8281 return (isl_basic_set*)
8282 isl_basic_map_from_constraint_matrices(dim, eq, ineq,
8283 c1, c2, c3, c4, isl_dim_in);
8286 int isl_basic_map_can_zip(__isl_keep isl_basic_map *bmap)
8291 return isl_dim_can_zip(bmap->dim);
8294 int isl_map_can_zip(__isl_keep isl_map *map)
8299 return isl_dim_can_zip(map->dim);
8302 /* Given a basic map (A -> B) -> (C -> D), return the corresponding basic map
8303 * (A -> C) -> (B -> D).
8305 __isl_give isl_basic_map *isl_basic_map_zip(__isl_take isl_basic_map *bmap)
8314 if (!isl_basic_map_can_zip(bmap))
8315 isl_die(bmap->ctx, isl_error_invalid,
8316 "basic map cannot be zipped", goto error);
8317 pos = isl_basic_map_offset(bmap, isl_dim_in) +
8318 isl_dim_size(bmap->dim->nested[0], isl_dim_in);
8319 n1 = isl_dim_size(bmap->dim->nested[0], isl_dim_out);
8320 n2 = isl_dim_size(bmap->dim->nested[1], isl_dim_in);
8321 bmap = isl_basic_map_swap_vars(bmap, pos, n1, n2);
8324 bmap->dim = isl_dim_zip(bmap->dim);
8329 isl_basic_map_free(bmap);
8333 /* Given a map (A -> B) -> (C -> D), return the corresponding map
8334 * (A -> C) -> (B -> D).
8336 __isl_give isl_map *isl_map_zip(__isl_take isl_map *map)
8343 if (!isl_map_can_zip(map))
8344 isl_die(map->ctx, isl_error_invalid, "map cannot be zipped",
8347 map = isl_map_cow(map);
8351 for (i = 0; i < map->n; ++i) {
8352 map->p[i] = isl_basic_map_zip(map->p[i]);
8357 map->dim = isl_dim_zip(map->dim);