2 * Copyright 2008-2009 Katholieke Universiteit Leuven
3 * Copyright 2010 INRIA Saclay
4 * Copyright 2012 Ecole Normale Superieure
6 * Use of this software is governed by the GNU LGPLv2.1 license
8 * Written by Sven Verdoolaege, K.U.Leuven, Departement
9 * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium
10 * and INRIA Saclay - Ile-de-France, Parc Club Orsay Universite,
11 * ZAC des vignes, 4 rue Jacques Monod, 91893 Orsay, France
12 * and Ecole Normale Superieure, 45 rue d’Ulm, 75230 Paris, France
16 #include <isl_ctx_private.h>
17 #include <isl_map_private.h>
19 #include "isl_space_private.h"
20 #include "isl_equalities.h"
21 #include <isl_list_private.h>
26 #include "isl_map_piplib.h"
27 #include <isl_reordering.h>
28 #include "isl_sample.h"
31 #include <isl_mat_private.h>
32 #include <isl_dim_map.h>
33 #include <isl_local_space_private.h>
34 #include <isl_aff_private.h>
35 #include <isl_options_private.h>
37 static unsigned n(__isl_keep isl_space *dim, enum isl_dim_type type)
40 case isl_dim_param: return dim->nparam;
41 case isl_dim_in: return dim->n_in;
42 case isl_dim_out: return dim->n_out;
43 case isl_dim_all: return dim->nparam + dim->n_in + dim->n_out;
48 static unsigned pos(__isl_keep isl_space *dim, enum isl_dim_type type)
51 case isl_dim_param: return 1;
52 case isl_dim_in: return 1 + dim->nparam;
53 case isl_dim_out: return 1 + dim->nparam + dim->n_in;
58 unsigned isl_basic_map_dim(__isl_keep isl_basic_map *bmap,
59 enum isl_dim_type type)
64 case isl_dim_cst: return 1;
67 case isl_dim_out: return isl_space_dim(bmap->dim, type);
68 case isl_dim_div: return bmap->n_div;
69 case isl_dim_all: return isl_basic_map_total_dim(bmap);
74 unsigned isl_map_dim(__isl_keep isl_map *map, enum isl_dim_type type)
76 return map ? n(map->dim, type) : 0;
79 unsigned isl_set_dim(__isl_keep isl_set *set, enum isl_dim_type type)
81 return set ? n(set->dim, type) : 0;
84 unsigned isl_basic_map_offset(struct isl_basic_map *bmap,
85 enum isl_dim_type type)
87 isl_space *dim = bmap->dim;
89 case isl_dim_cst: return 0;
90 case isl_dim_param: return 1;
91 case isl_dim_in: return 1 + dim->nparam;
92 case isl_dim_out: return 1 + dim->nparam + dim->n_in;
93 case isl_dim_div: return 1 + dim->nparam + dim->n_in + dim->n_out;
98 unsigned isl_basic_set_offset(struct isl_basic_set *bset,
99 enum isl_dim_type type)
101 return isl_basic_map_offset(bset, type);
104 static unsigned map_offset(struct isl_map *map, enum isl_dim_type type)
106 return pos(map->dim, type);
109 unsigned isl_basic_set_dim(__isl_keep isl_basic_set *bset,
110 enum isl_dim_type type)
112 return isl_basic_map_dim(bset, type);
115 unsigned isl_basic_set_n_dim(__isl_keep isl_basic_set *bset)
117 return isl_basic_set_dim(bset, isl_dim_set);
120 unsigned isl_basic_set_n_param(__isl_keep isl_basic_set *bset)
122 return isl_basic_set_dim(bset, isl_dim_param);
125 unsigned isl_basic_set_total_dim(const struct isl_basic_set *bset)
129 return isl_space_dim(bset->dim, isl_dim_all) + bset->n_div;
132 unsigned isl_set_n_dim(__isl_keep isl_set *set)
134 return isl_set_dim(set, isl_dim_set);
137 unsigned isl_set_n_param(__isl_keep isl_set *set)
139 return isl_set_dim(set, isl_dim_param);
142 unsigned isl_basic_map_n_in(const struct isl_basic_map *bmap)
144 return bmap ? bmap->dim->n_in : 0;
147 unsigned isl_basic_map_n_out(const struct isl_basic_map *bmap)
149 return bmap ? bmap->dim->n_out : 0;
152 unsigned isl_basic_map_n_param(const struct isl_basic_map *bmap)
154 return bmap ? bmap->dim->nparam : 0;
157 unsigned isl_basic_map_n_div(const struct isl_basic_map *bmap)
159 return bmap ? bmap->n_div : 0;
162 unsigned isl_basic_map_total_dim(const struct isl_basic_map *bmap)
164 return bmap ? isl_space_dim(bmap->dim, isl_dim_all) + bmap->n_div : 0;
167 unsigned isl_map_n_in(const struct isl_map *map)
169 return map ? map->dim->n_in : 0;
172 unsigned isl_map_n_out(const struct isl_map *map)
174 return map ? map->dim->n_out : 0;
177 unsigned isl_map_n_param(const struct isl_map *map)
179 return map ? map->dim->nparam : 0;
182 int isl_map_compatible_domain(struct isl_map *map, struct isl_set *set)
187 m = isl_space_match(map->dim, isl_dim_param, set->dim, isl_dim_param);
190 return isl_space_tuple_match(map->dim, isl_dim_in, set->dim, isl_dim_set);
193 int isl_basic_map_compatible_domain(struct isl_basic_map *bmap,
194 struct isl_basic_set *bset)
199 m = isl_space_match(bmap->dim, isl_dim_param, bset->dim, isl_dim_param);
202 return isl_space_tuple_match(bmap->dim, isl_dim_in, bset->dim, isl_dim_set);
205 int isl_map_compatible_range(__isl_keep isl_map *map, __isl_keep isl_set *set)
210 m = isl_space_match(map->dim, isl_dim_param, set->dim, isl_dim_param);
213 return isl_space_tuple_match(map->dim, isl_dim_out, set->dim, isl_dim_set);
216 int isl_basic_map_compatible_range(struct isl_basic_map *bmap,
217 struct isl_basic_set *bset)
222 m = isl_space_match(bmap->dim, isl_dim_param, bset->dim, isl_dim_param);
225 return isl_space_tuple_match(bmap->dim, isl_dim_out, bset->dim, isl_dim_set);
228 isl_ctx *isl_basic_map_get_ctx(__isl_keep isl_basic_map *bmap)
230 return bmap ? bmap->ctx : NULL;
233 isl_ctx *isl_basic_set_get_ctx(__isl_keep isl_basic_set *bset)
235 return bset ? bset->ctx : NULL;
238 isl_ctx *isl_map_get_ctx(__isl_keep isl_map *map)
240 return map ? map->ctx : NULL;
243 isl_ctx *isl_set_get_ctx(__isl_keep isl_set *set)
245 return set ? set->ctx : NULL;
248 __isl_give isl_space *isl_basic_map_get_space(__isl_keep isl_basic_map *bmap)
252 return isl_space_copy(bmap->dim);
255 __isl_give isl_space *isl_basic_set_get_space(__isl_keep isl_basic_set *bset)
259 return isl_space_copy(bset->dim);
262 /* Extract the divs in "bmap" as a matrix.
264 __isl_give isl_mat *isl_basic_map_get_divs(__isl_keep isl_basic_map *bmap)
275 ctx = isl_basic_map_get_ctx(bmap);
276 total = isl_space_dim(bmap->dim, isl_dim_all);
277 cols = 1 + 1 + total + bmap->n_div;
278 div = isl_mat_alloc(ctx, bmap->n_div, cols);
282 for (i = 0; i < bmap->n_div; ++i)
283 isl_seq_cpy(div->row[i], bmap->div[i], cols);
288 __isl_give isl_local_space *isl_basic_map_get_local_space(
289 __isl_keep isl_basic_map *bmap)
296 div = isl_basic_map_get_divs(bmap);
297 return isl_local_space_alloc_div(isl_space_copy(bmap->dim), div);
300 __isl_give isl_local_space *isl_basic_set_get_local_space(
301 __isl_keep isl_basic_set *bset)
303 return isl_basic_map_get_local_space(bset);
306 __isl_give isl_basic_map *isl_basic_map_from_local_space(
307 __isl_take isl_local_space *ls)
316 n_div = isl_local_space_dim(ls, isl_dim_div);
317 bmap = isl_basic_map_alloc_space(isl_local_space_get_space(ls),
318 n_div, 0, 2 * n_div);
320 for (i = 0; i < n_div; ++i)
321 if (isl_basic_map_alloc_div(bmap) < 0)
324 for (i = 0; i < n_div; ++i) {
325 isl_seq_cpy(bmap->div[i], ls->div->row[i], ls->div->n_col);
326 if (isl_basic_map_add_div_constraints(bmap, i) < 0)
330 isl_local_space_free(ls);
333 isl_local_space_free(ls);
334 isl_basic_map_free(bmap);
338 __isl_give isl_basic_set *isl_basic_set_from_local_space(
339 __isl_take isl_local_space *ls)
341 return isl_basic_map_from_local_space(ls);
344 __isl_give isl_space *isl_map_get_space(__isl_keep isl_map *map)
348 return isl_space_copy(map->dim);
351 __isl_give isl_space *isl_set_get_space(__isl_keep isl_set *set)
355 return isl_space_copy(set->dim);
358 __isl_give isl_basic_map *isl_basic_map_set_tuple_name(
359 __isl_take isl_basic_map *bmap, enum isl_dim_type type, const char *s)
361 bmap = isl_basic_map_cow(bmap);
364 bmap->dim = isl_space_set_tuple_name(bmap->dim, type, s);
367 bmap = isl_basic_map_finalize(bmap);
370 isl_basic_map_free(bmap);
374 __isl_give isl_basic_set *isl_basic_set_set_tuple_name(
375 __isl_take isl_basic_set *bset, const char *s)
377 return isl_basic_map_set_tuple_name(bset, isl_dim_set, s);
380 const char *isl_basic_map_get_tuple_name(__isl_keep isl_basic_map *bmap,
381 enum isl_dim_type type)
383 return bmap ? isl_space_get_tuple_name(bmap->dim, type) : NULL;
386 __isl_give isl_map *isl_map_set_tuple_name(__isl_take isl_map *map,
387 enum isl_dim_type type, const char *s)
391 map = isl_map_cow(map);
395 map->dim = isl_space_set_tuple_name(map->dim, type, s);
399 for (i = 0; i < map->n; ++i) {
400 map->p[i] = isl_basic_map_set_tuple_name(map->p[i], type, s);
411 const char *isl_map_get_tuple_name(__isl_keep isl_map *map,
412 enum isl_dim_type type)
414 return map ? isl_space_get_tuple_name(map->dim, type) : NULL;
417 __isl_give isl_set *isl_set_set_tuple_name(__isl_take isl_set *set,
420 return (isl_set *)isl_map_set_tuple_name((isl_map *)set, isl_dim_set, s);
423 __isl_give isl_map *isl_map_set_tuple_id(__isl_take isl_map *map,
424 enum isl_dim_type type, __isl_take isl_id *id)
426 map = isl_map_cow(map);
428 return isl_id_free(id);
430 map->dim = isl_space_set_tuple_id(map->dim, type, id);
432 return isl_map_reset_space(map, isl_space_copy(map->dim));
435 __isl_give isl_set *isl_set_set_tuple_id(__isl_take isl_set *set,
436 __isl_take isl_id *id)
438 return isl_map_set_tuple_id(set, isl_dim_set, id);
441 __isl_give isl_map *isl_map_reset_tuple_id(__isl_take isl_map *map,
442 enum isl_dim_type type)
444 map = isl_map_cow(map);
448 map->dim = isl_space_reset_tuple_id(map->dim, type);
450 return isl_map_reset_space(map, isl_space_copy(map->dim));
453 __isl_give isl_set *isl_set_reset_tuple_id(__isl_take isl_set *set)
455 return isl_map_reset_tuple_id(set, isl_dim_set);
458 int isl_map_has_tuple_id(__isl_keep isl_map *map, enum isl_dim_type type)
460 return map ? isl_space_has_tuple_id(map->dim, type) : -1;
463 __isl_give isl_id *isl_map_get_tuple_id(__isl_keep isl_map *map,
464 enum isl_dim_type type)
466 return map ? isl_space_get_tuple_id(map->dim, type) : NULL;
469 int isl_set_has_tuple_id(__isl_keep isl_set *set)
471 return isl_map_has_tuple_id(set, isl_dim_set);
474 __isl_give isl_id *isl_set_get_tuple_id(__isl_keep isl_set *set)
476 return isl_map_get_tuple_id(set, isl_dim_set);
479 /* Does the set tuple have a name?
481 int isl_set_has_tuple_name(__isl_keep isl_set *set)
483 return set ? isl_space_has_tuple_name(set->dim, isl_dim_set) : -1;
487 const char *isl_basic_set_get_tuple_name(__isl_keep isl_basic_set *bset)
489 return bset ? isl_space_get_tuple_name(bset->dim, isl_dim_set) : NULL;
492 const char *isl_set_get_tuple_name(__isl_keep isl_set *set)
494 return set ? isl_space_get_tuple_name(set->dim, isl_dim_set) : NULL;
497 const char *isl_basic_map_get_dim_name(__isl_keep isl_basic_map *bmap,
498 enum isl_dim_type type, unsigned pos)
500 return bmap ? isl_space_get_dim_name(bmap->dim, type, pos) : NULL;
503 const char *isl_basic_set_get_dim_name(__isl_keep isl_basic_set *bset,
504 enum isl_dim_type type, unsigned pos)
506 return bset ? isl_space_get_dim_name(bset->dim, type, pos) : NULL;
509 /* Does the given dimension have a name?
511 int isl_map_has_dim_name(__isl_keep isl_map *map,
512 enum isl_dim_type type, unsigned pos)
514 return map ? isl_space_has_dim_name(map->dim, type, pos) : -1;
517 const char *isl_map_get_dim_name(__isl_keep isl_map *map,
518 enum isl_dim_type type, unsigned pos)
520 return map ? isl_space_get_dim_name(map->dim, type, pos) : NULL;
523 const char *isl_set_get_dim_name(__isl_keep isl_set *set,
524 enum isl_dim_type type, unsigned pos)
526 return set ? isl_space_get_dim_name(set->dim, type, pos) : NULL;
529 /* Does the given dimension have a name?
531 int isl_set_has_dim_name(__isl_keep isl_set *set,
532 enum isl_dim_type type, unsigned pos)
534 return set ? isl_space_has_dim_name(set->dim, type, pos) : -1;
537 __isl_give isl_basic_map *isl_basic_map_set_dim_name(
538 __isl_take isl_basic_map *bmap,
539 enum isl_dim_type type, unsigned pos, const char *s)
541 bmap = isl_basic_map_cow(bmap);
544 bmap->dim = isl_space_set_dim_name(bmap->dim, type, pos, s);
547 return isl_basic_map_finalize(bmap);
549 isl_basic_map_free(bmap);
553 __isl_give isl_map *isl_map_set_dim_name(__isl_take isl_map *map,
554 enum isl_dim_type type, unsigned pos, const char *s)
558 map = isl_map_cow(map);
562 map->dim = isl_space_set_dim_name(map->dim, type, pos, s);
566 for (i = 0; i < map->n; ++i) {
567 map->p[i] = isl_basic_map_set_dim_name(map->p[i], type, pos, s);
578 __isl_give isl_basic_set *isl_basic_set_set_dim_name(
579 __isl_take isl_basic_set *bset,
580 enum isl_dim_type type, unsigned pos, const char *s)
582 return (isl_basic_set *)isl_basic_map_set_dim_name(
583 (isl_basic_map *)bset, type, pos, s);
586 __isl_give isl_set *isl_set_set_dim_name(__isl_take isl_set *set,
587 enum isl_dim_type type, unsigned pos, const char *s)
589 return (isl_set *)isl_map_set_dim_name((isl_map *)set, type, pos, s);
592 int isl_basic_map_has_dim_id(__isl_keep isl_basic_map *bmap,
593 enum isl_dim_type type, unsigned pos)
595 return bmap ? isl_space_has_dim_id(bmap->dim, type, pos) : -1;
598 __isl_give isl_id *isl_basic_set_get_dim_id(__isl_keep isl_basic_set *bset,
599 enum isl_dim_type type, unsigned pos)
601 return bset ? isl_space_get_dim_id(bset->dim, type, pos) : NULL;
604 int isl_map_has_dim_id(__isl_keep isl_map *map,
605 enum isl_dim_type type, unsigned pos)
607 return map ? isl_space_has_dim_id(map->dim, type, pos) : -1;
610 __isl_give isl_id *isl_map_get_dim_id(__isl_keep isl_map *map,
611 enum isl_dim_type type, unsigned pos)
613 return map ? isl_space_get_dim_id(map->dim, type, pos) : NULL;
616 int isl_set_has_dim_id(__isl_keep isl_set *set,
617 enum isl_dim_type type, unsigned pos)
619 return isl_map_has_dim_id(set, type, pos);
622 __isl_give isl_id *isl_set_get_dim_id(__isl_keep isl_set *set,
623 enum isl_dim_type type, unsigned pos)
625 return isl_map_get_dim_id(set, type, pos);
628 __isl_give isl_map *isl_map_set_dim_id(__isl_take isl_map *map,
629 enum isl_dim_type type, unsigned pos, __isl_take isl_id *id)
631 map = isl_map_cow(map);
633 return isl_id_free(id);
635 map->dim = isl_space_set_dim_id(map->dim, type, pos, id);
637 return isl_map_reset_space(map, isl_space_copy(map->dim));
640 __isl_give isl_set *isl_set_set_dim_id(__isl_take isl_set *set,
641 enum isl_dim_type type, unsigned pos, __isl_take isl_id *id)
643 return isl_map_set_dim_id(set, type, pos, id);
646 int isl_map_find_dim_by_id(__isl_keep isl_map *map, enum isl_dim_type type,
647 __isl_keep isl_id *id)
651 return isl_space_find_dim_by_id(map->dim, type, id);
654 int isl_set_find_dim_by_id(__isl_keep isl_set *set, enum isl_dim_type type,
655 __isl_keep isl_id *id)
657 return isl_map_find_dim_by_id(set, type, id);
660 int isl_map_find_dim_by_name(__isl_keep isl_map *map, enum isl_dim_type type,
665 return isl_space_find_dim_by_name(map->dim, type, name);
668 int isl_set_find_dim_by_name(__isl_keep isl_set *set, enum isl_dim_type type,
671 return isl_map_find_dim_by_name(set, type, name);
674 int isl_basic_map_is_rational(__isl_keep isl_basic_map *bmap)
678 return ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL);
681 int isl_basic_set_is_rational(__isl_keep isl_basic_set *bset)
683 return isl_basic_map_is_rational(bset);
686 /* Is this basic set a parameter domain?
688 int isl_basic_set_is_params(__isl_keep isl_basic_set *bset)
692 return isl_space_is_params(bset->dim);
695 /* Is this set a parameter domain?
697 int isl_set_is_params(__isl_keep isl_set *set)
701 return isl_space_is_params(set->dim);
704 /* Is this map actually a parameter domain?
705 * Users should never call this function. Outside of isl,
706 * a map can never be a parameter domain.
708 int isl_map_is_params(__isl_keep isl_map *map)
712 return isl_space_is_params(map->dim);
715 static struct isl_basic_map *basic_map_init(struct isl_ctx *ctx,
716 struct isl_basic_map *bmap, unsigned extra,
717 unsigned n_eq, unsigned n_ineq)
720 size_t row_size = 1 + isl_space_dim(bmap->dim, isl_dim_all) + extra;
725 bmap->block = isl_blk_alloc(ctx, (n_ineq + n_eq) * row_size);
726 if (isl_blk_is_error(bmap->block))
729 bmap->ineq = isl_alloc_array(ctx, isl_int *, n_ineq + n_eq);
734 bmap->block2 = isl_blk_empty();
737 bmap->block2 = isl_blk_alloc(ctx, extra * (1 + row_size));
738 if (isl_blk_is_error(bmap->block2))
741 bmap->div = isl_alloc_array(ctx, isl_int *, extra);
746 for (i = 0; i < n_ineq + n_eq; ++i)
747 bmap->ineq[i] = bmap->block.data + i * row_size;
749 for (i = 0; i < extra; ++i)
750 bmap->div[i] = bmap->block2.data + i * (1 + row_size);
754 bmap->c_size = n_eq + n_ineq;
755 bmap->eq = bmap->ineq + n_ineq;
764 isl_basic_map_free(bmap);
768 struct isl_basic_set *isl_basic_set_alloc(struct isl_ctx *ctx,
769 unsigned nparam, unsigned dim, unsigned extra,
770 unsigned n_eq, unsigned n_ineq)
772 struct isl_basic_map *bmap;
775 space = isl_space_set_alloc(ctx, nparam, dim);
779 bmap = isl_basic_map_alloc_space(space, extra, n_eq, n_ineq);
780 return (struct isl_basic_set *)bmap;
783 struct isl_basic_set *isl_basic_set_alloc_space(__isl_take isl_space *dim,
784 unsigned extra, unsigned n_eq, unsigned n_ineq)
786 struct isl_basic_map *bmap;
789 isl_assert(dim->ctx, dim->n_in == 0, goto error);
790 bmap = isl_basic_map_alloc_space(dim, extra, n_eq, n_ineq);
791 return (struct isl_basic_set *)bmap;
797 struct isl_basic_map *isl_basic_map_alloc_space(__isl_take isl_space *dim,
798 unsigned extra, unsigned n_eq, unsigned n_ineq)
800 struct isl_basic_map *bmap;
804 bmap = isl_calloc_type(dim->ctx, struct isl_basic_map);
809 return basic_map_init(dim->ctx, bmap, extra, n_eq, n_ineq);
815 struct isl_basic_map *isl_basic_map_alloc(struct isl_ctx *ctx,
816 unsigned nparam, unsigned in, unsigned out, unsigned extra,
817 unsigned n_eq, unsigned n_ineq)
819 struct isl_basic_map *bmap;
822 dim = isl_space_alloc(ctx, nparam, in, out);
826 bmap = isl_basic_map_alloc_space(dim, extra, n_eq, n_ineq);
830 static void dup_constraints(
831 struct isl_basic_map *dst, struct isl_basic_map *src)
834 unsigned total = isl_basic_map_total_dim(src);
836 for (i = 0; i < src->n_eq; ++i) {
837 int j = isl_basic_map_alloc_equality(dst);
838 isl_seq_cpy(dst->eq[j], src->eq[i], 1+total);
841 for (i = 0; i < src->n_ineq; ++i) {
842 int j = isl_basic_map_alloc_inequality(dst);
843 isl_seq_cpy(dst->ineq[j], src->ineq[i], 1+total);
846 for (i = 0; i < src->n_div; ++i) {
847 int j = isl_basic_map_alloc_div(dst);
848 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total);
850 ISL_F_SET(dst, ISL_BASIC_SET_FINAL);
853 struct isl_basic_map *isl_basic_map_dup(struct isl_basic_map *bmap)
855 struct isl_basic_map *dup;
859 dup = isl_basic_map_alloc_space(isl_space_copy(bmap->dim),
860 bmap->n_div, bmap->n_eq, bmap->n_ineq);
863 dup_constraints(dup, bmap);
864 dup->flags = bmap->flags;
865 dup->sample = isl_vec_copy(bmap->sample);
869 struct isl_basic_set *isl_basic_set_dup(struct isl_basic_set *bset)
871 struct isl_basic_map *dup;
873 dup = isl_basic_map_dup((struct isl_basic_map *)bset);
874 return (struct isl_basic_set *)dup;
877 struct isl_basic_set *isl_basic_set_copy(struct isl_basic_set *bset)
882 if (ISL_F_ISSET(bset, ISL_BASIC_SET_FINAL)) {
886 return isl_basic_set_dup(bset);
889 struct isl_set *isl_set_copy(struct isl_set *set)
898 struct isl_basic_map *isl_basic_map_copy(struct isl_basic_map *bmap)
903 if (ISL_F_ISSET(bmap, ISL_BASIC_SET_FINAL)) {
907 bmap = isl_basic_map_dup(bmap);
909 ISL_F_SET(bmap, ISL_BASIC_SET_FINAL);
913 struct isl_map *isl_map_copy(struct isl_map *map)
922 void isl_basic_map_free(struct isl_basic_map *bmap)
930 isl_ctx_deref(bmap->ctx);
932 isl_blk_free(bmap->ctx, bmap->block2);
934 isl_blk_free(bmap->ctx, bmap->block);
935 isl_vec_free(bmap->sample);
936 isl_space_free(bmap->dim);
940 void isl_basic_set_free(struct isl_basic_set *bset)
942 isl_basic_map_free((struct isl_basic_map *)bset);
945 static int room_for_con(struct isl_basic_map *bmap, unsigned n)
947 return bmap->n_eq + bmap->n_ineq + n <= bmap->c_size;
950 __isl_give isl_map *isl_map_align_params_map_map_and(
951 __isl_take isl_map *map1, __isl_take isl_map *map2,
952 __isl_give isl_map *(*fn)(__isl_take isl_map *map1,
953 __isl_take isl_map *map2))
957 if (isl_space_match(map1->dim, isl_dim_param, map2->dim, isl_dim_param))
958 return fn(map1, map2);
959 if (!isl_space_has_named_params(map1->dim) ||
960 !isl_space_has_named_params(map2->dim))
961 isl_die(map1->ctx, isl_error_invalid,
962 "unaligned unnamed parameters", goto error);
963 map1 = isl_map_align_params(map1, isl_map_get_space(map2));
964 map2 = isl_map_align_params(map2, isl_map_get_space(map1));
965 return fn(map1, map2);
972 int isl_map_align_params_map_map_and_test(__isl_keep isl_map *map1,
973 __isl_keep isl_map *map2,
974 int (*fn)(__isl_keep isl_map *map1, __isl_keep isl_map *map2))
980 if (isl_space_match(map1->dim, isl_dim_param, map2->dim, isl_dim_param))
981 return fn(map1, map2);
982 if (!isl_space_has_named_params(map1->dim) ||
983 !isl_space_has_named_params(map2->dim))
984 isl_die(map1->ctx, isl_error_invalid,
985 "unaligned unnamed parameters", return -1);
986 map1 = isl_map_copy(map1);
987 map2 = isl_map_copy(map2);
988 map1 = isl_map_align_params(map1, isl_map_get_space(map2));
989 map2 = isl_map_align_params(map2, isl_map_get_space(map1));
996 int isl_basic_map_alloc_equality(struct isl_basic_map *bmap)
1002 isl_assert(ctx, room_for_con(bmap, 1), return -1);
1003 isl_assert(ctx, (bmap->eq - bmap->ineq) + bmap->n_eq <= bmap->c_size,
1005 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1006 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
1007 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_IMPLICIT);
1008 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
1009 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
1010 if ((bmap->eq - bmap->ineq) + bmap->n_eq == bmap->c_size) {
1012 int j = isl_basic_map_alloc_inequality(bmap);
1016 bmap->ineq[j] = bmap->ineq[bmap->n_ineq - 1];
1017 bmap->ineq[bmap->n_ineq - 1] = bmap->eq[-1];
1024 isl_seq_clr(bmap->eq[bmap->n_eq] + 1 + isl_basic_map_total_dim(bmap),
1025 bmap->extra - bmap->n_div);
1026 return bmap->n_eq++;
1029 int isl_basic_set_alloc_equality(struct isl_basic_set *bset)
1031 return isl_basic_map_alloc_equality((struct isl_basic_map *)bset);
1034 int isl_basic_map_free_equality(struct isl_basic_map *bmap, unsigned n)
1038 isl_assert(bmap->ctx, n <= bmap->n_eq, return -1);
1043 int isl_basic_set_free_equality(struct isl_basic_set *bset, unsigned n)
1045 return isl_basic_map_free_equality((struct isl_basic_map *)bset, n);
1048 int isl_basic_map_drop_equality(struct isl_basic_map *bmap, unsigned pos)
1053 isl_assert(bmap->ctx, pos < bmap->n_eq, return -1);
1055 if (pos != bmap->n_eq - 1) {
1057 bmap->eq[pos] = bmap->eq[bmap->n_eq - 1];
1058 bmap->eq[bmap->n_eq - 1] = t;
1064 int isl_basic_set_drop_equality(struct isl_basic_set *bset, unsigned pos)
1066 return isl_basic_map_drop_equality((struct isl_basic_map *)bset, pos);
1069 void isl_basic_map_inequality_to_equality(
1070 struct isl_basic_map *bmap, unsigned pos)
1074 t = bmap->ineq[pos];
1075 bmap->ineq[pos] = bmap->ineq[bmap->n_ineq - 1];
1076 bmap->ineq[bmap->n_ineq - 1] = bmap->eq[-1];
1081 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
1082 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1083 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
1084 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
1087 static int room_for_ineq(struct isl_basic_map *bmap, unsigned n)
1089 return bmap->n_ineq + n <= bmap->eq - bmap->ineq;
1092 int isl_basic_map_alloc_inequality(struct isl_basic_map *bmap)
1094 struct isl_ctx *ctx;
1098 isl_assert(ctx, room_for_ineq(bmap, 1), return -1);
1099 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_IMPLICIT);
1100 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
1101 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1102 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
1103 isl_seq_clr(bmap->ineq[bmap->n_ineq] +
1104 1 + isl_basic_map_total_dim(bmap),
1105 bmap->extra - bmap->n_div);
1106 return bmap->n_ineq++;
1109 int isl_basic_set_alloc_inequality(struct isl_basic_set *bset)
1111 return isl_basic_map_alloc_inequality((struct isl_basic_map *)bset);
1114 int isl_basic_map_free_inequality(struct isl_basic_map *bmap, unsigned n)
1118 isl_assert(bmap->ctx, n <= bmap->n_ineq, return -1);
1123 int isl_basic_set_free_inequality(struct isl_basic_set *bset, unsigned n)
1125 return isl_basic_map_free_inequality((struct isl_basic_map *)bset, n);
1128 int isl_basic_map_drop_inequality(struct isl_basic_map *bmap, unsigned pos)
1133 isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
1135 if (pos != bmap->n_ineq - 1) {
1136 t = bmap->ineq[pos];
1137 bmap->ineq[pos] = bmap->ineq[bmap->n_ineq - 1];
1138 bmap->ineq[bmap->n_ineq - 1] = t;
1139 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1145 int isl_basic_set_drop_inequality(struct isl_basic_set *bset, unsigned pos)
1147 return isl_basic_map_drop_inequality((struct isl_basic_map *)bset, pos);
1150 __isl_give isl_basic_map *isl_basic_map_add_eq(__isl_take isl_basic_map *bmap,
1155 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
1158 k = isl_basic_map_alloc_equality(bmap);
1161 isl_seq_cpy(bmap->eq[k], eq, 1 + isl_basic_map_total_dim(bmap));
1164 isl_basic_map_free(bmap);
1168 __isl_give isl_basic_set *isl_basic_set_add_eq(__isl_take isl_basic_set *bset,
1171 return (isl_basic_set *)
1172 isl_basic_map_add_eq((isl_basic_map *)bset, eq);
1175 __isl_give isl_basic_map *isl_basic_map_add_ineq(__isl_take isl_basic_map *bmap,
1180 bmap = isl_basic_map_extend_constraints(bmap, 0, 1);
1183 k = isl_basic_map_alloc_inequality(bmap);
1186 isl_seq_cpy(bmap->ineq[k], ineq, 1 + isl_basic_map_total_dim(bmap));
1189 isl_basic_map_free(bmap);
1193 __isl_give isl_basic_set *isl_basic_set_add_ineq(__isl_take isl_basic_set *bset,
1196 return (isl_basic_set *)
1197 isl_basic_map_add_ineq((isl_basic_map *)bset, ineq);
1200 int isl_basic_map_alloc_div(struct isl_basic_map *bmap)
1204 isl_assert(bmap->ctx, bmap->n_div < bmap->extra, return -1);
1205 isl_seq_clr(bmap->div[bmap->n_div] +
1206 1 + 1 + isl_basic_map_total_dim(bmap),
1207 bmap->extra - bmap->n_div);
1208 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
1209 return bmap->n_div++;
1212 int isl_basic_set_alloc_div(struct isl_basic_set *bset)
1214 return isl_basic_map_alloc_div((struct isl_basic_map *)bset);
1217 int isl_basic_map_free_div(struct isl_basic_map *bmap, unsigned n)
1221 isl_assert(bmap->ctx, n <= bmap->n_div, return -1);
1226 int isl_basic_set_free_div(struct isl_basic_set *bset, unsigned n)
1228 return isl_basic_map_free_div((struct isl_basic_map *)bset, n);
1231 /* Copy constraint from src to dst, putting the vars of src at offset
1232 * dim_off in dst and the divs of src at offset div_off in dst.
1233 * If both sets are actually map, then dim_off applies to the input
1236 static void copy_constraint(struct isl_basic_map *dst_map, isl_int *dst,
1237 struct isl_basic_map *src_map, isl_int *src,
1238 unsigned in_off, unsigned out_off, unsigned div_off)
1240 unsigned src_nparam = isl_basic_map_n_param(src_map);
1241 unsigned dst_nparam = isl_basic_map_n_param(dst_map);
1242 unsigned src_in = isl_basic_map_n_in(src_map);
1243 unsigned dst_in = isl_basic_map_n_in(dst_map);
1244 unsigned src_out = isl_basic_map_n_out(src_map);
1245 unsigned dst_out = isl_basic_map_n_out(dst_map);
1246 isl_int_set(dst[0], src[0]);
1247 isl_seq_cpy(dst+1, src+1, isl_min(dst_nparam, src_nparam));
1248 if (dst_nparam > src_nparam)
1249 isl_seq_clr(dst+1+src_nparam,
1250 dst_nparam - src_nparam);
1251 isl_seq_clr(dst+1+dst_nparam, in_off);
1252 isl_seq_cpy(dst+1+dst_nparam+in_off,
1254 isl_min(dst_in-in_off, src_in));
1255 if (dst_in-in_off > src_in)
1256 isl_seq_clr(dst+1+dst_nparam+in_off+src_in,
1257 dst_in - in_off - src_in);
1258 isl_seq_clr(dst+1+dst_nparam+dst_in, out_off);
1259 isl_seq_cpy(dst+1+dst_nparam+dst_in+out_off,
1260 src+1+src_nparam+src_in,
1261 isl_min(dst_out-out_off, src_out));
1262 if (dst_out-out_off > src_out)
1263 isl_seq_clr(dst+1+dst_nparam+dst_in+out_off+src_out,
1264 dst_out - out_off - src_out);
1265 isl_seq_clr(dst+1+dst_nparam+dst_in+dst_out, div_off);
1266 isl_seq_cpy(dst+1+dst_nparam+dst_in+dst_out+div_off,
1267 src+1+src_nparam+src_in+src_out,
1268 isl_min(dst_map->extra-div_off, src_map->n_div));
1269 if (dst_map->n_div-div_off > src_map->n_div)
1270 isl_seq_clr(dst+1+dst_nparam+dst_in+dst_out+
1271 div_off+src_map->n_div,
1272 dst_map->n_div - div_off - src_map->n_div);
1275 static void copy_div(struct isl_basic_map *dst_map, isl_int *dst,
1276 struct isl_basic_map *src_map, isl_int *src,
1277 unsigned in_off, unsigned out_off, unsigned div_off)
1279 isl_int_set(dst[0], src[0]);
1280 copy_constraint(dst_map, dst+1, src_map, src+1, in_off, out_off, div_off);
1283 static struct isl_basic_map *add_constraints(struct isl_basic_map *bmap1,
1284 struct isl_basic_map *bmap2, unsigned i_pos, unsigned o_pos)
1289 if (!bmap1 || !bmap2)
1292 div_off = bmap1->n_div;
1294 for (i = 0; i < bmap2->n_eq; ++i) {
1295 int i1 = isl_basic_map_alloc_equality(bmap1);
1298 copy_constraint(bmap1, bmap1->eq[i1], bmap2, bmap2->eq[i],
1299 i_pos, o_pos, div_off);
1302 for (i = 0; i < bmap2->n_ineq; ++i) {
1303 int i1 = isl_basic_map_alloc_inequality(bmap1);
1306 copy_constraint(bmap1, bmap1->ineq[i1], bmap2, bmap2->ineq[i],
1307 i_pos, o_pos, div_off);
1310 for (i = 0; i < bmap2->n_div; ++i) {
1311 int i1 = isl_basic_map_alloc_div(bmap1);
1314 copy_div(bmap1, bmap1->div[i1], bmap2, bmap2->div[i],
1315 i_pos, o_pos, div_off);
1318 isl_basic_map_free(bmap2);
1323 isl_basic_map_free(bmap1);
1324 isl_basic_map_free(bmap2);
1328 struct isl_basic_set *isl_basic_set_add_constraints(struct isl_basic_set *bset1,
1329 struct isl_basic_set *bset2, unsigned pos)
1331 return (struct isl_basic_set *)
1332 add_constraints((struct isl_basic_map *)bset1,
1333 (struct isl_basic_map *)bset2, 0, pos);
1336 struct isl_basic_map *isl_basic_map_extend_space(struct isl_basic_map *base,
1337 __isl_take isl_space *dim, unsigned extra,
1338 unsigned n_eq, unsigned n_ineq)
1340 struct isl_basic_map *ext;
1350 dims_ok = isl_space_is_equal(base->dim, dim) &&
1351 base->extra >= base->n_div + extra;
1353 if (dims_ok && room_for_con(base, n_eq + n_ineq) &&
1354 room_for_ineq(base, n_ineq)) {
1355 isl_space_free(dim);
1359 isl_assert(base->ctx, base->dim->nparam <= dim->nparam, goto error);
1360 isl_assert(base->ctx, base->dim->n_in <= dim->n_in, goto error);
1361 isl_assert(base->ctx, base->dim->n_out <= dim->n_out, goto error);
1362 extra += base->extra;
1364 n_ineq += base->n_ineq;
1366 ext = isl_basic_map_alloc_space(dim, extra, n_eq, n_ineq);
1372 ext->sample = isl_vec_copy(base->sample);
1373 flags = base->flags;
1374 ext = add_constraints(ext, base, 0, 0);
1377 ISL_F_CLR(ext, ISL_BASIC_SET_FINAL);
1383 isl_space_free(dim);
1384 isl_basic_map_free(base);
1388 struct isl_basic_set *isl_basic_set_extend_space(struct isl_basic_set *base,
1389 __isl_take isl_space *dim, unsigned extra,
1390 unsigned n_eq, unsigned n_ineq)
1392 return (struct isl_basic_set *)
1393 isl_basic_map_extend_space((struct isl_basic_map *)base, dim,
1394 extra, n_eq, n_ineq);
1397 struct isl_basic_map *isl_basic_map_extend_constraints(
1398 struct isl_basic_map *base, unsigned n_eq, unsigned n_ineq)
1402 return isl_basic_map_extend_space(base, isl_space_copy(base->dim),
1406 struct isl_basic_map *isl_basic_map_extend(struct isl_basic_map *base,
1407 unsigned nparam, unsigned n_in, unsigned n_out, unsigned extra,
1408 unsigned n_eq, unsigned n_ineq)
1410 struct isl_basic_map *bmap;
1415 dim = isl_space_alloc(base->ctx, nparam, n_in, n_out);
1419 bmap = isl_basic_map_extend_space(base, dim, extra, n_eq, n_ineq);
1422 isl_basic_map_free(base);
1426 struct isl_basic_set *isl_basic_set_extend(struct isl_basic_set *base,
1427 unsigned nparam, unsigned dim, unsigned extra,
1428 unsigned n_eq, unsigned n_ineq)
1430 return (struct isl_basic_set *)
1431 isl_basic_map_extend((struct isl_basic_map *)base,
1432 nparam, 0, dim, extra, n_eq, n_ineq);
1435 struct isl_basic_set *isl_basic_set_extend_constraints(
1436 struct isl_basic_set *base, unsigned n_eq, unsigned n_ineq)
1438 return (struct isl_basic_set *)
1439 isl_basic_map_extend_constraints((struct isl_basic_map *)base,
1443 struct isl_basic_set *isl_basic_set_cow(struct isl_basic_set *bset)
1445 return (struct isl_basic_set *)
1446 isl_basic_map_cow((struct isl_basic_map *)bset);
1449 struct isl_basic_map *isl_basic_map_cow(struct isl_basic_map *bmap)
1454 if (bmap->ref > 1) {
1456 bmap = isl_basic_map_dup(bmap);
1459 ISL_F_CLR(bmap, ISL_BASIC_SET_FINAL);
1463 struct isl_set *isl_set_cow(struct isl_set *set)
1471 return isl_set_dup(set);
1474 struct isl_map *isl_map_cow(struct isl_map *map)
1482 return isl_map_dup(map);
1485 static void swap_vars(struct isl_blk blk, isl_int *a,
1486 unsigned a_len, unsigned b_len)
1488 isl_seq_cpy(blk.data, a+a_len, b_len);
1489 isl_seq_cpy(blk.data+b_len, a, a_len);
1490 isl_seq_cpy(a, blk.data, b_len+a_len);
1493 static __isl_give isl_basic_map *isl_basic_map_swap_vars(
1494 __isl_take isl_basic_map *bmap, unsigned pos, unsigned n1, unsigned n2)
1502 isl_assert(bmap->ctx,
1503 pos + n1 + n2 <= 1 + isl_basic_map_total_dim(bmap), goto error);
1505 if (n1 == 0 || n2 == 0)
1508 bmap = isl_basic_map_cow(bmap);
1512 blk = isl_blk_alloc(bmap->ctx, n1 + n2);
1513 if (isl_blk_is_error(blk))
1516 for (i = 0; i < bmap->n_eq; ++i)
1518 bmap->eq[i] + pos, n1, n2);
1520 for (i = 0; i < bmap->n_ineq; ++i)
1522 bmap->ineq[i] + pos, n1, n2);
1524 for (i = 0; i < bmap->n_div; ++i)
1526 bmap->div[i]+1 + pos, n1, n2);
1528 isl_blk_free(bmap->ctx, blk);
1530 ISL_F_CLR(bmap, ISL_BASIC_SET_NORMALIZED);
1531 bmap = isl_basic_map_gauss(bmap, NULL);
1532 return isl_basic_map_finalize(bmap);
1534 isl_basic_map_free(bmap);
1538 static __isl_give isl_basic_set *isl_basic_set_swap_vars(
1539 __isl_take isl_basic_set *bset, unsigned n)
1544 nparam = isl_basic_set_n_param(bset);
1545 dim = isl_basic_set_n_dim(bset);
1546 isl_assert(bset->ctx, n <= dim, goto error);
1548 return isl_basic_map_swap_vars(bset, 1 + nparam, n, dim - n);
1550 isl_basic_set_free(bset);
1554 struct isl_basic_map *isl_basic_map_set_to_empty(struct isl_basic_map *bmap)
1560 total = isl_basic_map_total_dim(bmap);
1561 isl_basic_map_free_div(bmap, bmap->n_div);
1562 isl_basic_map_free_inequality(bmap, bmap->n_ineq);
1564 isl_basic_map_free_equality(bmap, bmap->n_eq-1);
1566 i = isl_basic_map_alloc_equality(bmap);
1570 isl_int_set_si(bmap->eq[i][0], 1);
1571 isl_seq_clr(bmap->eq[i]+1, total);
1572 ISL_F_SET(bmap, ISL_BASIC_MAP_EMPTY);
1573 isl_vec_free(bmap->sample);
1574 bmap->sample = NULL;
1575 return isl_basic_map_finalize(bmap);
1577 isl_basic_map_free(bmap);
1581 struct isl_basic_set *isl_basic_set_set_to_empty(struct isl_basic_set *bset)
1583 return (struct isl_basic_set *)
1584 isl_basic_map_set_to_empty((struct isl_basic_map *)bset);
1587 void isl_basic_map_swap_div(struct isl_basic_map *bmap, int a, int b)
1590 unsigned off = isl_space_dim(bmap->dim, isl_dim_all);
1591 isl_int *t = bmap->div[a];
1592 bmap->div[a] = bmap->div[b];
1595 for (i = 0; i < bmap->n_eq; ++i)
1596 isl_int_swap(bmap->eq[i][1+off+a], bmap->eq[i][1+off+b]);
1598 for (i = 0; i < bmap->n_ineq; ++i)
1599 isl_int_swap(bmap->ineq[i][1+off+a], bmap->ineq[i][1+off+b]);
1601 for (i = 0; i < bmap->n_div; ++i)
1602 isl_int_swap(bmap->div[i][1+1+off+a], bmap->div[i][1+1+off+b]);
1603 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1606 /* Eliminate the specified n dimensions starting at first from the
1607 * constraints, without removing the dimensions from the space.
1608 * If the set is rational, the dimensions are eliminated using Fourier-Motzkin.
1610 __isl_give isl_map *isl_map_eliminate(__isl_take isl_map *map,
1611 enum isl_dim_type type, unsigned first, unsigned n)
1620 if (first + n > isl_map_dim(map, type) || first + n < first)
1621 isl_die(map->ctx, isl_error_invalid,
1622 "index out of bounds", goto error);
1624 map = isl_map_cow(map);
1628 for (i = 0; i < map->n; ++i) {
1629 map->p[i] = isl_basic_map_eliminate(map->p[i], type, first, n);
1639 /* Eliminate the specified n dimensions starting at first from the
1640 * constraints, without removing the dimensions from the space.
1641 * If the set is rational, the dimensions are eliminated using Fourier-Motzkin.
1643 __isl_give isl_set *isl_set_eliminate(__isl_take isl_set *set,
1644 enum isl_dim_type type, unsigned first, unsigned n)
1646 return (isl_set *)isl_map_eliminate((isl_map *)set, type, first, n);
1649 /* Eliminate the specified n dimensions starting at first from the
1650 * constraints, without removing the dimensions from the space.
1651 * If the set is rational, the dimensions are eliminated using Fourier-Motzkin.
1653 __isl_give isl_set *isl_set_eliminate_dims(__isl_take isl_set *set,
1654 unsigned first, unsigned n)
1656 return isl_set_eliminate(set, isl_dim_set, first, n);
1659 __isl_give isl_basic_map *isl_basic_map_remove_divs(
1660 __isl_take isl_basic_map *bmap)
1664 bmap = isl_basic_map_eliminate_vars(bmap,
1665 isl_space_dim(bmap->dim, isl_dim_all), bmap->n_div);
1669 return isl_basic_map_finalize(bmap);
1672 __isl_give isl_basic_set *isl_basic_set_remove_divs(
1673 __isl_take isl_basic_set *bset)
1675 return (struct isl_basic_set *)isl_basic_map_remove_divs(
1676 (struct isl_basic_map *)bset);
1679 __isl_give isl_map *isl_map_remove_divs(__isl_take isl_map *map)
1688 map = isl_map_cow(map);
1692 for (i = 0; i < map->n; ++i) {
1693 map->p[i] = isl_basic_map_remove_divs(map->p[i]);
1703 __isl_give isl_set *isl_set_remove_divs(__isl_take isl_set *set)
1705 return isl_map_remove_divs(set);
1708 struct isl_basic_map *isl_basic_map_remove_dims(struct isl_basic_map *bmap,
1709 enum isl_dim_type type, unsigned first, unsigned n)
1713 isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
1715 if (n == 0 && !isl_space_is_named_or_nested(bmap->dim, type))
1717 bmap = isl_basic_map_eliminate_vars(bmap,
1718 isl_basic_map_offset(bmap, type) - 1 + first, n);
1721 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY) && type == isl_dim_div)
1723 bmap = isl_basic_map_drop(bmap, type, first, n);
1726 isl_basic_map_free(bmap);
1730 /* Return true if the definition of the given div (recursively) involves
1731 * any of the given variables.
1733 static int div_involves_vars(__isl_keep isl_basic_map *bmap, int div,
1734 unsigned first, unsigned n)
1737 unsigned div_offset = isl_basic_map_offset(bmap, isl_dim_div);
1739 if (isl_int_is_zero(bmap->div[div][0]))
1741 if (isl_seq_first_non_zero(bmap->div[div] + 1 + first, n) >= 0)
1744 for (i = bmap->n_div - 1; i >= 0; --i) {
1745 if (isl_int_is_zero(bmap->div[div][1 + div_offset + i]))
1747 if (div_involves_vars(bmap, i, first, n))
1754 /* Try and add a lower and/or upper bound on "div" to "bmap"
1755 * based on inequality "i".
1756 * "total" is the total number of variables (excluding the divs).
1757 * "v" is a temporary object that can be used during the calculations.
1758 * If "lb" is set, then a lower bound should be constructed.
1759 * If "ub" is set, then an upper bound should be constructed.
1761 * The calling function has already checked that the inequality does not
1762 * reference "div", but we still need to check that the inequality is
1763 * of the right form. We'll consider the case where we want to construct
1764 * a lower bound. The construction of upper bounds is similar.
1766 * Let "div" be of the form
1768 * q = floor((a + f(x))/d)
1770 * We essentially check if constraint "i" is of the form
1774 * so that we can use it to derive a lower bound on "div".
1775 * However, we allow a slightly more general form
1779 * with the condition that the coefficients of g(x) - f(x) are all
1781 * Rewriting this constraint as
1785 * adding a + f(x) to both sides and dividing by d, we obtain
1787 * (a + f(x))/d >= (a-b)/d + (f(x)-g(x))/d
1789 * Taking the floor on both sides, we obtain
1791 * q >= floor((a-b)/d) + (f(x)-g(x))/d
1795 * (g(x)-f(x))/d + ceil((b-a)/d) + q >= 0
1797 * In the case of an upper bound, we construct the constraint
1799 * (g(x)+f(x))/d + floor((b+a)/d) - q >= 0
1802 static __isl_give isl_basic_map *insert_bounds_on_div_from_ineq(
1803 __isl_take isl_basic_map *bmap, int div, int i,
1804 unsigned total, isl_int v, int lb, int ub)
1808 for (j = 0; (lb || ub) && j < total + bmap->n_div; ++j) {
1810 isl_int_sub(v, bmap->ineq[i][1 + j],
1811 bmap->div[div][1 + 1 + j]);
1812 lb = isl_int_is_divisible_by(v, bmap->div[div][0]);
1815 isl_int_add(v, bmap->ineq[i][1 + j],
1816 bmap->div[div][1 + 1 + j]);
1817 ub = isl_int_is_divisible_by(v, bmap->div[div][0]);
1823 bmap = isl_basic_map_extend_constraints(bmap, 0, lb + ub);
1825 int k = isl_basic_map_alloc_inequality(bmap);
1828 for (j = 0; j < 1 + total + bmap->n_div; ++j) {
1829 isl_int_sub(bmap->ineq[k][j], bmap->ineq[i][j],
1830 bmap->div[div][1 + j]);
1831 isl_int_cdiv_q(bmap->ineq[k][j],
1832 bmap->ineq[k][j], bmap->div[div][0]);
1834 isl_int_set_si(bmap->ineq[k][1 + total + div], 1);
1837 int k = isl_basic_map_alloc_inequality(bmap);
1840 for (j = 0; j < 1 + total + bmap->n_div; ++j) {
1841 isl_int_add(bmap->ineq[k][j], bmap->ineq[i][j],
1842 bmap->div[div][1 + j]);
1843 isl_int_fdiv_q(bmap->ineq[k][j],
1844 bmap->ineq[k][j], bmap->div[div][0]);
1846 isl_int_set_si(bmap->ineq[k][1 + total + div], -1);
1851 isl_basic_map_free(bmap);
1855 /* This function is called right before "div" is eliminated from "bmap"
1856 * using Fourier-Motzkin.
1857 * Look through the constraints of "bmap" for constraints on the argument
1858 * of the integer division and use them to construct constraints on the
1859 * integer division itself. These constraints can then be combined
1860 * during the Fourier-Motzkin elimination.
1861 * Note that it is only useful to introduce lower bounds on "div"
1862 * if "bmap" already contains upper bounds on "div" as the newly
1863 * introduce lower bounds can then be combined with the pre-existing
1864 * upper bounds. Similarly for upper bounds.
1865 * We therefore first check if "bmap" contains any lower and/or upper bounds
1868 * It is interesting to note that the introduction of these constraints
1869 * can indeed lead to more accurate results, even when compared to
1870 * deriving constraints on the argument of "div" from constraints on "div".
1871 * Consider, for example, the set
1873 * { [i,j,k] : 3 + i + 2j >= 0 and 2 * [(i+2j)/4] <= k }
1875 * The second constraint can be rewritten as
1877 * 2 * [(-i-2j+3)/4] + k >= 0
1879 * from which we can derive
1881 * -i - 2j + 3 >= -2k
1887 * Combined with the first constraint, we obtain
1889 * -3 <= 3 + 2k or k >= -3
1891 * If, on the other hand we derive a constraint on [(i+2j)/4] from
1892 * the first constraint, we obtain
1894 * [(i + 2j)/4] >= [-3/4] = -1
1896 * Combining this constraint with the second constraint, we obtain
1900 static __isl_give isl_basic_map *insert_bounds_on_div(
1901 __isl_take isl_basic_map *bmap, int div)
1904 int check_lb, check_ub;
1911 if (isl_int_is_zero(bmap->div[div][0]))
1914 total = isl_space_dim(bmap->dim, isl_dim_all);
1918 for (i = 0; (!check_lb || !check_ub) && i < bmap->n_ineq; ++i) {
1919 int s = isl_int_sgn(bmap->ineq[i][1 + total + div]);
1926 if (!check_lb && !check_ub)
1931 for (i = 0; bmap && i < bmap->n_ineq; ++i) {
1932 if (!isl_int_is_zero(bmap->ineq[i][1 + total + div]))
1935 bmap = insert_bounds_on_div_from_ineq(bmap, div, i, total, v,
1936 check_lb, check_ub);
1944 /* Remove all divs (recursively) involving any of the given dimensions
1945 * in their definitions.
1947 __isl_give isl_basic_map *isl_basic_map_remove_divs_involving_dims(
1948 __isl_take isl_basic_map *bmap,
1949 enum isl_dim_type type, unsigned first, unsigned n)
1955 isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
1957 first += isl_basic_map_offset(bmap, type);
1959 for (i = bmap->n_div - 1; i >= 0; --i) {
1960 if (!div_involves_vars(bmap, i, first, n))
1962 bmap = insert_bounds_on_div(bmap, i);
1963 bmap = isl_basic_map_remove_dims(bmap, isl_dim_div, i, 1);
1971 isl_basic_map_free(bmap);
1975 __isl_give isl_map *isl_map_remove_divs_involving_dims(__isl_take isl_map *map,
1976 enum isl_dim_type type, unsigned first, unsigned n)
1985 map = isl_map_cow(map);
1989 for (i = 0; i < map->n; ++i) {
1990 map->p[i] = isl_basic_map_remove_divs_involving_dims(map->p[i],
2001 __isl_give isl_set *isl_set_remove_divs_involving_dims(__isl_take isl_set *set,
2002 enum isl_dim_type type, unsigned first, unsigned n)
2004 return (isl_set *)isl_map_remove_divs_involving_dims((isl_map *)set,
2008 /* Does the desciption of "bmap" depend on the specified dimensions?
2009 * We also check whether the dimensions appear in any of the div definitions.
2010 * In principle there is no need for this check. If the dimensions appear
2011 * in a div definition, they also appear in the defining constraints of that
2014 int isl_basic_map_involves_dims(__isl_keep isl_basic_map *bmap,
2015 enum isl_dim_type type, unsigned first, unsigned n)
2022 if (first + n > isl_basic_map_dim(bmap, type))
2023 isl_die(bmap->ctx, isl_error_invalid,
2024 "index out of bounds", return -1);
2026 first += isl_basic_map_offset(bmap, type);
2027 for (i = 0; i < bmap->n_eq; ++i)
2028 if (isl_seq_first_non_zero(bmap->eq[i] + first, n) >= 0)
2030 for (i = 0; i < bmap->n_ineq; ++i)
2031 if (isl_seq_first_non_zero(bmap->ineq[i] + first, n) >= 0)
2033 for (i = 0; i < bmap->n_div; ++i) {
2034 if (isl_int_is_zero(bmap->div[i][0]))
2036 if (isl_seq_first_non_zero(bmap->div[i] + 1 + first, n) >= 0)
2043 int isl_map_involves_dims(__isl_keep isl_map *map,
2044 enum isl_dim_type type, unsigned first, unsigned n)
2051 if (first + n > isl_map_dim(map, type))
2052 isl_die(map->ctx, isl_error_invalid,
2053 "index out of bounds", return -1);
2055 for (i = 0; i < map->n; ++i) {
2056 int involves = isl_basic_map_involves_dims(map->p[i],
2058 if (involves < 0 || involves)
2065 int isl_basic_set_involves_dims(__isl_keep isl_basic_set *bset,
2066 enum isl_dim_type type, unsigned first, unsigned n)
2068 return isl_basic_map_involves_dims(bset, type, first, n);
2071 int isl_set_involves_dims(__isl_keep isl_set *set,
2072 enum isl_dim_type type, unsigned first, unsigned n)
2074 return isl_map_involves_dims(set, type, first, n);
2077 /* Return true if the definition of the given div is unknown or depends
2080 static int div_is_unknown(__isl_keep isl_basic_map *bmap, int div)
2083 unsigned div_offset = isl_basic_map_offset(bmap, isl_dim_div);
2085 if (isl_int_is_zero(bmap->div[div][0]))
2088 for (i = bmap->n_div - 1; i >= 0; --i) {
2089 if (isl_int_is_zero(bmap->div[div][1 + div_offset + i]))
2091 if (div_is_unknown(bmap, i))
2098 /* Remove all divs that are unknown or defined in terms of unknown divs.
2100 __isl_give isl_basic_map *isl_basic_map_remove_unknown_divs(
2101 __isl_take isl_basic_map *bmap)
2108 for (i = bmap->n_div - 1; i >= 0; --i) {
2109 if (!div_is_unknown(bmap, i))
2111 bmap = isl_basic_map_remove_dims(bmap, isl_dim_div, i, 1);
2120 __isl_give isl_map *isl_map_remove_unknown_divs(__isl_take isl_map *map)
2129 map = isl_map_cow(map);
2133 for (i = 0; i < map->n; ++i) {
2134 map->p[i] = isl_basic_map_remove_unknown_divs(map->p[i]);
2144 __isl_give isl_set *isl_set_remove_unknown_divs(__isl_take isl_set *set)
2146 return (isl_set *)isl_map_remove_unknown_divs((isl_map *)set);
2149 __isl_give isl_basic_set *isl_basic_set_remove_dims(
2150 __isl_take isl_basic_set *bset,
2151 enum isl_dim_type type, unsigned first, unsigned n)
2153 return (isl_basic_set *)
2154 isl_basic_map_remove_dims((isl_basic_map *)bset, type, first, n);
2157 struct isl_map *isl_map_remove_dims(struct isl_map *map,
2158 enum isl_dim_type type, unsigned first, unsigned n)
2165 map = isl_map_cow(map);
2168 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
2170 for (i = 0; i < map->n; ++i) {
2171 map->p[i] = isl_basic_map_eliminate_vars(map->p[i],
2172 isl_basic_map_offset(map->p[i], type) - 1 + first, n);
2176 map = isl_map_drop(map, type, first, n);
2183 __isl_give isl_set *isl_set_remove_dims(__isl_take isl_set *bset,
2184 enum isl_dim_type type, unsigned first, unsigned n)
2186 return (isl_set *)isl_map_remove_dims((isl_map *)bset, type, first, n);
2189 /* Project out n inputs starting at first using Fourier-Motzkin */
2190 struct isl_map *isl_map_remove_inputs(struct isl_map *map,
2191 unsigned first, unsigned n)
2193 return isl_map_remove_dims(map, isl_dim_in, first, n);
2196 static void dump_term(struct isl_basic_map *bmap,
2197 isl_int c, int pos, FILE *out)
2200 unsigned in = isl_basic_map_n_in(bmap);
2201 unsigned dim = in + isl_basic_map_n_out(bmap);
2202 unsigned nparam = isl_basic_map_n_param(bmap);
2204 isl_int_print(out, c, 0);
2206 if (!isl_int_is_one(c))
2207 isl_int_print(out, c, 0);
2208 if (pos < 1 + nparam) {
2209 name = isl_space_get_dim_name(bmap->dim,
2210 isl_dim_param, pos - 1);
2212 fprintf(out, "%s", name);
2214 fprintf(out, "p%d", pos - 1);
2215 } else if (pos < 1 + nparam + in)
2216 fprintf(out, "i%d", pos - 1 - nparam);
2217 else if (pos < 1 + nparam + dim)
2218 fprintf(out, "o%d", pos - 1 - nparam - in);
2220 fprintf(out, "e%d", pos - 1 - nparam - dim);
2224 static void dump_constraint_sign(struct isl_basic_map *bmap, isl_int *c,
2225 int sign, FILE *out)
2229 unsigned len = 1 + isl_basic_map_total_dim(bmap);
2233 for (i = 0, first = 1; i < len; ++i) {
2234 if (isl_int_sgn(c[i]) * sign <= 0)
2237 fprintf(out, " + ");
2239 isl_int_abs(v, c[i]);
2240 dump_term(bmap, v, i, out);
2247 static void dump_constraint(struct isl_basic_map *bmap, isl_int *c,
2248 const char *op, FILE *out, int indent)
2252 fprintf(out, "%*s", indent, "");
2254 dump_constraint_sign(bmap, c, 1, out);
2255 fprintf(out, " %s ", op);
2256 dump_constraint_sign(bmap, c, -1, out);
2260 for (i = bmap->n_div; i < bmap->extra; ++i) {
2261 if (isl_int_is_zero(c[1+isl_space_dim(bmap->dim, isl_dim_all)+i]))
2263 fprintf(out, "%*s", indent, "");
2264 fprintf(out, "ERROR: unused div coefficient not zero\n");
2269 static void dump_constraints(struct isl_basic_map *bmap,
2270 isl_int **c, unsigned n,
2271 const char *op, FILE *out, int indent)
2275 for (i = 0; i < n; ++i)
2276 dump_constraint(bmap, c[i], op, out, indent);
2279 static void dump_affine(struct isl_basic_map *bmap, isl_int *exp, FILE *out)
2283 unsigned total = isl_basic_map_total_dim(bmap);
2285 for (j = 0; j < 1 + total; ++j) {
2286 if (isl_int_is_zero(exp[j]))
2288 if (!first && isl_int_is_pos(exp[j]))
2290 dump_term(bmap, exp[j], j, out);
2295 static void dump(struct isl_basic_map *bmap, FILE *out, int indent)
2299 dump_constraints(bmap, bmap->eq, bmap->n_eq, "=", out, indent);
2300 dump_constraints(bmap, bmap->ineq, bmap->n_ineq, ">=", out, indent);
2302 for (i = 0; i < bmap->n_div; ++i) {
2303 fprintf(out, "%*s", indent, "");
2304 fprintf(out, "e%d = [(", i);
2305 dump_affine(bmap, bmap->div[i]+1, out);
2307 isl_int_print(out, bmap->div[i][0], 0);
2308 fprintf(out, "]\n");
2312 void isl_basic_set_print_internal(struct isl_basic_set *bset,
2313 FILE *out, int indent)
2316 fprintf(out, "null basic set\n");
2320 fprintf(out, "%*s", indent, "");
2321 fprintf(out, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n",
2322 bset->ref, bset->dim->nparam, bset->dim->n_out,
2323 bset->extra, bset->flags);
2324 dump((struct isl_basic_map *)bset, out, indent);
2327 void isl_basic_map_print_internal(struct isl_basic_map *bmap,
2328 FILE *out, int indent)
2331 fprintf(out, "null basic map\n");
2335 fprintf(out, "%*s", indent, "");
2336 fprintf(out, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, "
2337 "flags: %x, n_name: %d\n",
2339 bmap->dim->nparam, bmap->dim->n_in, bmap->dim->n_out,
2340 bmap->extra, bmap->flags, bmap->dim->n_id);
2341 dump(bmap, out, indent);
2344 int isl_inequality_negate(struct isl_basic_map *bmap, unsigned pos)
2349 total = isl_basic_map_total_dim(bmap);
2350 isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
2351 isl_seq_neg(bmap->ineq[pos], bmap->ineq[pos], 1 + total);
2352 isl_int_sub_ui(bmap->ineq[pos][0], bmap->ineq[pos][0], 1);
2353 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
2357 __isl_give isl_set *isl_set_alloc_space(__isl_take isl_space *dim, int n,
2360 struct isl_set *set;
2364 isl_assert(dim->ctx, dim->n_in == 0, goto error);
2365 isl_assert(dim->ctx, n >= 0, goto error);
2366 set = isl_alloc(dim->ctx, struct isl_set,
2367 sizeof(struct isl_set) +
2368 (n - 1) * sizeof(struct isl_basic_set *));
2372 set->ctx = dim->ctx;
2373 isl_ctx_ref(set->ctx);
2381 isl_space_free(dim);
2385 struct isl_set *isl_set_alloc(struct isl_ctx *ctx,
2386 unsigned nparam, unsigned dim, int n, unsigned flags)
2388 struct isl_set *set;
2391 dims = isl_space_alloc(ctx, nparam, 0, dim);
2395 set = isl_set_alloc_space(dims, n, flags);
2399 /* Make sure "map" has room for at least "n" more basic maps.
2401 struct isl_map *isl_map_grow(struct isl_map *map, int n)
2404 struct isl_map *grown = NULL;
2408 isl_assert(map->ctx, n >= 0, goto error);
2409 if (map->n + n <= map->size)
2411 grown = isl_map_alloc_space(isl_map_get_space(map), map->n + n, map->flags);
2414 for (i = 0; i < map->n; ++i) {
2415 grown->p[i] = isl_basic_map_copy(map->p[i]);
2423 isl_map_free(grown);
2428 /* Make sure "set" has room for at least "n" more basic sets.
2430 struct isl_set *isl_set_grow(struct isl_set *set, int n)
2432 return (struct isl_set *)isl_map_grow((struct isl_map *)set, n);
2435 struct isl_set *isl_set_dup(struct isl_set *set)
2438 struct isl_set *dup;
2443 dup = isl_set_alloc_space(isl_space_copy(set->dim), set->n, set->flags);
2446 for (i = 0; i < set->n; ++i)
2447 dup = isl_set_add_basic_set(dup, isl_basic_set_copy(set->p[i]));
2451 struct isl_set *isl_set_from_basic_set(struct isl_basic_set *bset)
2453 return isl_map_from_basic_map(bset);
2456 struct isl_map *isl_map_from_basic_map(struct isl_basic_map *bmap)
2458 struct isl_map *map;
2463 map = isl_map_alloc_space(isl_space_copy(bmap->dim), 1, ISL_MAP_DISJOINT);
2464 return isl_map_add_basic_map(map, bmap);
2467 __isl_give isl_set *isl_set_add_basic_set(__isl_take isl_set *set,
2468 __isl_take isl_basic_set *bset)
2470 return (struct isl_set *)isl_map_add_basic_map((struct isl_map *)set,
2471 (struct isl_basic_map *)bset);
2474 void *isl_set_free(__isl_take isl_set *set)
2484 isl_ctx_deref(set->ctx);
2485 for (i = 0; i < set->n; ++i)
2486 isl_basic_set_free(set->p[i]);
2487 isl_space_free(set->dim);
2493 void isl_set_print_internal(struct isl_set *set, FILE *out, int indent)
2498 fprintf(out, "null set\n");
2502 fprintf(out, "%*s", indent, "");
2503 fprintf(out, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
2504 set->ref, set->n, set->dim->nparam, set->dim->n_out,
2506 for (i = 0; i < set->n; ++i) {
2507 fprintf(out, "%*s", indent, "");
2508 fprintf(out, "basic set %d:\n", i);
2509 isl_basic_set_print_internal(set->p[i], out, indent+4);
2513 void isl_map_print_internal(struct isl_map *map, FILE *out, int indent)
2518 fprintf(out, "null map\n");
2522 fprintf(out, "%*s", indent, "");
2523 fprintf(out, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, "
2524 "flags: %x, n_name: %d\n",
2525 map->ref, map->n, map->dim->nparam, map->dim->n_in,
2526 map->dim->n_out, map->flags, map->dim->n_id);
2527 for (i = 0; i < map->n; ++i) {
2528 fprintf(out, "%*s", indent, "");
2529 fprintf(out, "basic map %d:\n", i);
2530 isl_basic_map_print_internal(map->p[i], out, indent+4);
2534 struct isl_basic_map *isl_basic_map_intersect_domain(
2535 struct isl_basic_map *bmap, struct isl_basic_set *bset)
2537 struct isl_basic_map *bmap_domain;
2542 isl_assert(bset->ctx, isl_space_match(bmap->dim, isl_dim_param,
2543 bset->dim, isl_dim_param), goto error);
2545 if (isl_space_dim(bset->dim, isl_dim_set) != 0)
2546 isl_assert(bset->ctx,
2547 isl_basic_map_compatible_domain(bmap, bset), goto error);
2549 bmap = isl_basic_map_cow(bmap);
2552 bmap = isl_basic_map_extend_space(bmap, isl_space_copy(bmap->dim),
2553 bset->n_div, bset->n_eq, bset->n_ineq);
2554 bmap_domain = isl_basic_map_from_domain(bset);
2555 bmap = add_constraints(bmap, bmap_domain, 0, 0);
2557 bmap = isl_basic_map_simplify(bmap);
2558 return isl_basic_map_finalize(bmap);
2560 isl_basic_map_free(bmap);
2561 isl_basic_set_free(bset);
2565 struct isl_basic_map *isl_basic_map_intersect_range(
2566 struct isl_basic_map *bmap, struct isl_basic_set *bset)
2568 struct isl_basic_map *bmap_range;
2573 isl_assert(bset->ctx, isl_space_match(bmap->dim, isl_dim_param,
2574 bset->dim, isl_dim_param), goto error);
2576 if (isl_space_dim(bset->dim, isl_dim_set) != 0)
2577 isl_assert(bset->ctx,
2578 isl_basic_map_compatible_range(bmap, bset), goto error);
2580 if (isl_basic_set_is_universe(bset)) {
2581 isl_basic_set_free(bset);
2585 bmap = isl_basic_map_cow(bmap);
2588 bmap = isl_basic_map_extend_space(bmap, isl_space_copy(bmap->dim),
2589 bset->n_div, bset->n_eq, bset->n_ineq);
2590 bmap_range = isl_basic_map_from_basic_set(bset, isl_space_copy(bset->dim));
2591 bmap = add_constraints(bmap, bmap_range, 0, 0);
2593 bmap = isl_basic_map_simplify(bmap);
2594 return isl_basic_map_finalize(bmap);
2596 isl_basic_map_free(bmap);
2597 isl_basic_set_free(bset);
2601 int isl_basic_map_contains(struct isl_basic_map *bmap, struct isl_vec *vec)
2607 total = 1 + isl_basic_map_total_dim(bmap);
2608 if (total != vec->size)
2613 for (i = 0; i < bmap->n_eq; ++i) {
2614 isl_seq_inner_product(vec->el, bmap->eq[i], total, &s);
2615 if (!isl_int_is_zero(s)) {
2621 for (i = 0; i < bmap->n_ineq; ++i) {
2622 isl_seq_inner_product(vec->el, bmap->ineq[i], total, &s);
2623 if (isl_int_is_neg(s)) {
2634 int isl_basic_set_contains(struct isl_basic_set *bset, struct isl_vec *vec)
2636 return isl_basic_map_contains((struct isl_basic_map *)bset, vec);
2639 struct isl_basic_map *isl_basic_map_intersect(
2640 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2642 struct isl_vec *sample = NULL;
2644 if (!bmap1 || !bmap2)
2647 isl_assert(bmap1->ctx, isl_space_match(bmap1->dim, isl_dim_param,
2648 bmap2->dim, isl_dim_param), goto error);
2649 if (isl_space_dim(bmap1->dim, isl_dim_all) ==
2650 isl_space_dim(bmap1->dim, isl_dim_param) &&
2651 isl_space_dim(bmap2->dim, isl_dim_all) !=
2652 isl_space_dim(bmap2->dim, isl_dim_param))
2653 return isl_basic_map_intersect(bmap2, bmap1);
2655 if (isl_space_dim(bmap2->dim, isl_dim_all) !=
2656 isl_space_dim(bmap2->dim, isl_dim_param))
2657 isl_assert(bmap1->ctx,
2658 isl_space_is_equal(bmap1->dim, bmap2->dim), goto error);
2660 if (bmap1->sample &&
2661 isl_basic_map_contains(bmap1, bmap1->sample) > 0 &&
2662 isl_basic_map_contains(bmap2, bmap1->sample) > 0)
2663 sample = isl_vec_copy(bmap1->sample);
2664 else if (bmap2->sample &&
2665 isl_basic_map_contains(bmap1, bmap2->sample) > 0 &&
2666 isl_basic_map_contains(bmap2, bmap2->sample) > 0)
2667 sample = isl_vec_copy(bmap2->sample);
2669 bmap1 = isl_basic_map_cow(bmap1);
2672 bmap1 = isl_basic_map_extend_space(bmap1, isl_space_copy(bmap1->dim),
2673 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
2674 bmap1 = add_constraints(bmap1, bmap2, 0, 0);
2677 isl_vec_free(sample);
2679 isl_vec_free(bmap1->sample);
2680 bmap1->sample = sample;
2683 bmap1 = isl_basic_map_simplify(bmap1);
2684 return isl_basic_map_finalize(bmap1);
2687 isl_vec_free(sample);
2688 isl_basic_map_free(bmap1);
2689 isl_basic_map_free(bmap2);
2693 struct isl_basic_set *isl_basic_set_intersect(
2694 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
2696 return (struct isl_basic_set *)
2697 isl_basic_map_intersect(
2698 (struct isl_basic_map *)bset1,
2699 (struct isl_basic_map *)bset2);
2702 __isl_give isl_basic_set *isl_basic_set_intersect_params(
2703 __isl_take isl_basic_set *bset1, __isl_take isl_basic_set *bset2)
2705 return isl_basic_set_intersect(bset1, bset2);
2708 /* Special case of isl_map_intersect, where both map1 and map2
2709 * are convex, without any divs and such that either map1 or map2
2710 * contains a single constraint. This constraint is then simply
2711 * added to the other map.
2713 static __isl_give isl_map *map_intersect_add_constraint(
2714 __isl_take isl_map *map1, __isl_take isl_map *map2)
2716 isl_assert(map1->ctx, map1->n == 1, goto error);
2717 isl_assert(map2->ctx, map1->n == 1, goto error);
2718 isl_assert(map1->ctx, map1->p[0]->n_div == 0, goto error);
2719 isl_assert(map2->ctx, map1->p[0]->n_div == 0, goto error);
2721 if (map2->p[0]->n_eq + map2->p[0]->n_ineq != 1)
2722 return isl_map_intersect(map2, map1);
2724 isl_assert(map2->ctx,
2725 map2->p[0]->n_eq + map2->p[0]->n_ineq == 1, goto error);
2727 map1 = isl_map_cow(map1);
2730 if (isl_map_plain_is_empty(map1)) {
2734 map1->p[0] = isl_basic_map_cow(map1->p[0]);
2735 if (map2->p[0]->n_eq == 1)
2736 map1->p[0] = isl_basic_map_add_eq(map1->p[0], map2->p[0]->eq[0]);
2738 map1->p[0] = isl_basic_map_add_ineq(map1->p[0],
2739 map2->p[0]->ineq[0]);
2741 map1->p[0] = isl_basic_map_simplify(map1->p[0]);
2742 map1->p[0] = isl_basic_map_finalize(map1->p[0]);
2746 if (isl_basic_map_plain_is_empty(map1->p[0])) {
2747 isl_basic_map_free(map1->p[0]);
2760 /* map2 may be either a parameter domain or a map living in the same
2763 static __isl_give isl_map *map_intersect_internal(__isl_take isl_map *map1,
2764 __isl_take isl_map *map2)
2767 struct isl_map *result;
2773 if (isl_map_plain_is_empty(map1) &&
2774 isl_space_is_equal(map1->dim, map2->dim)) {
2778 if (isl_map_plain_is_empty(map2) &&
2779 isl_space_is_equal(map1->dim, map2->dim)) {
2784 if (map1->n == 1 && map2->n == 1 &&
2785 map1->p[0]->n_div == 0 && map2->p[0]->n_div == 0 &&
2786 isl_space_is_equal(map1->dim, map2->dim) &&
2787 (map1->p[0]->n_eq + map1->p[0]->n_ineq == 1 ||
2788 map2->p[0]->n_eq + map2->p[0]->n_ineq == 1))
2789 return map_intersect_add_constraint(map1, map2);
2791 if (isl_space_dim(map2->dim, isl_dim_all) !=
2792 isl_space_dim(map2->dim, isl_dim_param))
2793 isl_assert(map1->ctx,
2794 isl_space_is_equal(map1->dim, map2->dim), goto error);
2796 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
2797 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
2798 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
2800 result = isl_map_alloc_space(isl_space_copy(map1->dim),
2801 map1->n * map2->n, flags);
2804 for (i = 0; i < map1->n; ++i)
2805 for (j = 0; j < map2->n; ++j) {
2806 struct isl_basic_map *part;
2807 part = isl_basic_map_intersect(
2808 isl_basic_map_copy(map1->p[i]),
2809 isl_basic_map_copy(map2->p[j]));
2810 if (isl_basic_map_is_empty(part))
2811 isl_basic_map_free(part);
2813 result = isl_map_add_basic_map(result, part);
2826 static __isl_give isl_map *map_intersect(__isl_take isl_map *map1,
2827 __isl_take isl_map *map2)
2831 if (!isl_space_is_equal(map1->dim, map2->dim))
2832 isl_die(isl_map_get_ctx(map1), isl_error_invalid,
2833 "spaces don't match", goto error);
2834 return map_intersect_internal(map1, map2);
2841 __isl_give isl_map *isl_map_intersect(__isl_take isl_map *map1,
2842 __isl_take isl_map *map2)
2844 return isl_map_align_params_map_map_and(map1, map2, &map_intersect);
2847 struct isl_set *isl_set_intersect(struct isl_set *set1, struct isl_set *set2)
2849 return (struct isl_set *)
2850 isl_map_intersect((struct isl_map *)set1,
2851 (struct isl_map *)set2);
2854 /* map_intersect_internal accepts intersections
2855 * with parameter domains, so we can just call that function.
2857 static __isl_give isl_map *map_intersect_params(__isl_take isl_map *map,
2858 __isl_take isl_set *params)
2860 return map_intersect_internal(map, params);
2863 __isl_give isl_map *isl_map_intersect_params(__isl_take isl_map *map1,
2864 __isl_take isl_map *map2)
2866 return isl_map_align_params_map_map_and(map1, map2, &map_intersect_params);
2869 __isl_give isl_set *isl_set_intersect_params(__isl_take isl_set *set,
2870 __isl_take isl_set *params)
2872 return isl_map_intersect_params(set, params);
2875 struct isl_basic_map *isl_basic_map_reverse(struct isl_basic_map *bmap)
2878 struct isl_basic_set *bset;
2883 bmap = isl_basic_map_cow(bmap);
2886 dim = isl_space_reverse(isl_space_copy(bmap->dim));
2887 in = isl_basic_map_n_in(bmap);
2888 bset = isl_basic_set_from_basic_map(bmap);
2889 bset = isl_basic_set_swap_vars(bset, in);
2890 return isl_basic_map_from_basic_set(bset, dim);
2893 static __isl_give isl_basic_map *basic_map_space_reset(
2894 __isl_take isl_basic_map *bmap, enum isl_dim_type type)
2898 if (!isl_space_is_named_or_nested(bmap->dim, type))
2901 space = isl_basic_map_get_space(bmap);
2902 space = isl_space_reset(space, type);
2903 bmap = isl_basic_map_reset_space(bmap, space);
2907 __isl_give isl_basic_map *isl_basic_map_insert(__isl_take isl_basic_map *bmap,
2908 enum isl_dim_type type, unsigned pos, unsigned n)
2911 struct isl_basic_map *res;
2912 struct isl_dim_map *dim_map;
2913 unsigned total, off;
2914 enum isl_dim_type t;
2917 return basic_map_space_reset(bmap, type);
2922 res_dim = isl_space_insert_dims(isl_basic_map_get_space(bmap), type, pos, n);
2924 total = isl_basic_map_total_dim(bmap) + n;
2925 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2927 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
2929 isl_dim_map_dim(dim_map, bmap->dim, t, off);
2931 unsigned size = isl_basic_map_dim(bmap, t);
2932 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2934 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2935 pos, size - pos, off + pos + n);
2937 off += isl_space_dim(res_dim, t);
2939 isl_dim_map_div(dim_map, bmap, off);
2941 res = isl_basic_map_alloc_space(res_dim,
2942 bmap->n_div, bmap->n_eq, bmap->n_ineq);
2943 if (isl_basic_map_is_rational(bmap))
2944 res = isl_basic_map_set_rational(res);
2945 if (isl_basic_map_plain_is_empty(bmap)) {
2946 isl_basic_map_free(bmap);
2947 return isl_basic_map_set_to_empty(res);
2949 res = isl_basic_map_add_constraints_dim_map(res, bmap, dim_map);
2950 return isl_basic_map_finalize(res);
2953 __isl_give isl_basic_map *isl_basic_map_add(__isl_take isl_basic_map *bmap,
2954 enum isl_dim_type type, unsigned n)
2958 return isl_basic_map_insert(bmap, type,
2959 isl_basic_map_dim(bmap, type), n);
2962 __isl_give isl_basic_set *isl_basic_set_add(__isl_take isl_basic_set *bset,
2963 enum isl_dim_type type, unsigned n)
2967 isl_assert(bset->ctx, type != isl_dim_in, goto error);
2968 return (isl_basic_set *)isl_basic_map_add((isl_basic_map *)bset, type, n);
2970 isl_basic_set_free(bset);
2974 static __isl_give isl_map *map_space_reset(__isl_take isl_map *map,
2975 enum isl_dim_type type)
2979 if (!map || !isl_space_is_named_or_nested(map->dim, type))
2982 space = isl_map_get_space(map);
2983 space = isl_space_reset(space, type);
2984 map = isl_map_reset_space(map, space);
2988 __isl_give isl_map *isl_map_insert_dims(__isl_take isl_map *map,
2989 enum isl_dim_type type, unsigned pos, unsigned n)
2994 return map_space_reset(map, type);
2996 map = isl_map_cow(map);
3000 map->dim = isl_space_insert_dims(map->dim, type, pos, n);
3004 for (i = 0; i < map->n; ++i) {
3005 map->p[i] = isl_basic_map_insert(map->p[i], type, pos, n);
3016 __isl_give isl_set *isl_set_insert_dims(__isl_take isl_set *set,
3017 enum isl_dim_type type, unsigned pos, unsigned n)
3019 return isl_map_insert_dims(set, type, pos, n);
3022 __isl_give isl_map *isl_map_add_dims(__isl_take isl_map *map,
3023 enum isl_dim_type type, unsigned n)
3027 return isl_map_insert_dims(map, type, isl_map_dim(map, type), n);
3030 __isl_give isl_set *isl_set_add_dims(__isl_take isl_set *set,
3031 enum isl_dim_type type, unsigned n)
3035 isl_assert(set->ctx, type != isl_dim_in, goto error);
3036 return (isl_set *)isl_map_add_dims((isl_map *)set, type, n);
3042 __isl_give isl_basic_map *isl_basic_map_move_dims(
3043 __isl_take isl_basic_map *bmap,
3044 enum isl_dim_type dst_type, unsigned dst_pos,
3045 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
3047 struct isl_dim_map *dim_map;
3048 struct isl_basic_map *res;
3049 enum isl_dim_type t;
3050 unsigned total, off;
3057 isl_assert(bmap->ctx, src_pos + n <= isl_basic_map_dim(bmap, src_type),
3060 if (dst_type == src_type && dst_pos == src_pos)
3063 isl_assert(bmap->ctx, dst_type != src_type, goto error);
3065 if (pos(bmap->dim, dst_type) + dst_pos ==
3066 pos(bmap->dim, src_type) + src_pos +
3067 ((src_type < dst_type) ? n : 0)) {
3068 bmap = isl_basic_map_cow(bmap);
3072 bmap->dim = isl_space_move_dims(bmap->dim, dst_type, dst_pos,
3073 src_type, src_pos, n);
3077 bmap = isl_basic_map_finalize(bmap);
3082 total = isl_basic_map_total_dim(bmap);
3083 dim_map = isl_dim_map_alloc(bmap->ctx, total);
3086 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
3087 unsigned size = isl_space_dim(bmap->dim, t);
3088 if (t == dst_type) {
3089 isl_dim_map_dim_range(dim_map, bmap->dim, t,
3092 isl_dim_map_dim_range(dim_map, bmap->dim, src_type,
3095 isl_dim_map_dim_range(dim_map, bmap->dim, t,
3096 dst_pos, size - dst_pos, off);
3097 off += size - dst_pos;
3098 } else if (t == src_type) {
3099 isl_dim_map_dim_range(dim_map, bmap->dim, t,
3102 isl_dim_map_dim_range(dim_map, bmap->dim, t,
3103 src_pos + n, size - src_pos - n, off);
3104 off += size - src_pos - n;
3106 isl_dim_map_dim(dim_map, bmap->dim, t, off);
3110 isl_dim_map_div(dim_map, bmap, off);
3112 res = isl_basic_map_alloc_space(isl_basic_map_get_space(bmap),
3113 bmap->n_div, bmap->n_eq, bmap->n_ineq);
3114 bmap = isl_basic_map_add_constraints_dim_map(res, bmap, dim_map);
3116 bmap->dim = isl_space_move_dims(bmap->dim, dst_type, dst_pos,
3117 src_type, src_pos, n);
3121 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
3122 bmap = isl_basic_map_gauss(bmap, NULL);
3123 bmap = isl_basic_map_finalize(bmap);
3127 isl_basic_map_free(bmap);
3131 __isl_give isl_basic_set *isl_basic_set_move_dims(__isl_take isl_basic_set *bset,
3132 enum isl_dim_type dst_type, unsigned dst_pos,
3133 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
3135 return (isl_basic_set *)isl_basic_map_move_dims(
3136 (isl_basic_map *)bset, dst_type, dst_pos, src_type, src_pos, n);
3139 __isl_give isl_set *isl_set_move_dims(__isl_take isl_set *set,
3140 enum isl_dim_type dst_type, unsigned dst_pos,
3141 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
3145 isl_assert(set->ctx, dst_type != isl_dim_in, goto error);
3146 return (isl_set *)isl_map_move_dims((isl_map *)set, dst_type, dst_pos,
3147 src_type, src_pos, n);
3153 __isl_give isl_map *isl_map_move_dims(__isl_take isl_map *map,
3154 enum isl_dim_type dst_type, unsigned dst_pos,
3155 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
3164 isl_assert(map->ctx, src_pos + n <= isl_map_dim(map, src_type),
3167 if (dst_type == src_type && dst_pos == src_pos)
3170 isl_assert(map->ctx, dst_type != src_type, goto error);
3172 map = isl_map_cow(map);
3176 map->dim = isl_space_move_dims(map->dim, dst_type, dst_pos, src_type, src_pos, n);
3180 for (i = 0; i < map->n; ++i) {
3181 map->p[i] = isl_basic_map_move_dims(map->p[i],
3183 src_type, src_pos, n);
3194 /* Move the specified dimensions to the last columns right before
3195 * the divs. Don't change the dimension specification of bmap.
3196 * That's the responsibility of the caller.
3198 static __isl_give isl_basic_map *move_last(__isl_take isl_basic_map *bmap,
3199 enum isl_dim_type type, unsigned first, unsigned n)
3201 struct isl_dim_map *dim_map;
3202 struct isl_basic_map *res;
3203 enum isl_dim_type t;
3204 unsigned total, off;
3208 if (pos(bmap->dim, type) + first + n ==
3209 1 + isl_space_dim(bmap->dim, isl_dim_all))
3212 total = isl_basic_map_total_dim(bmap);
3213 dim_map = isl_dim_map_alloc(bmap->ctx, total);
3216 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
3217 unsigned size = isl_space_dim(bmap->dim, t);
3219 isl_dim_map_dim_range(dim_map, bmap->dim, t,
3222 isl_dim_map_dim_range(dim_map, bmap->dim, t,
3223 first, n, total - bmap->n_div - n);
3224 isl_dim_map_dim_range(dim_map, bmap->dim, t,
3225 first + n, size - (first + n), off);
3226 off += size - (first + n);
3228 isl_dim_map_dim(dim_map, bmap->dim, t, off);
3232 isl_dim_map_div(dim_map, bmap, off + n);
3234 res = isl_basic_map_alloc_space(isl_basic_map_get_space(bmap),
3235 bmap->n_div, bmap->n_eq, bmap->n_ineq);
3236 res = isl_basic_map_add_constraints_dim_map(res, bmap, dim_map);
3240 /* Turn the n dimensions of type type, starting at first
3241 * into existentially quantified variables.
3243 __isl_give isl_basic_map *isl_basic_map_project_out(
3244 __isl_take isl_basic_map *bmap,
3245 enum isl_dim_type type, unsigned first, unsigned n)
3253 return basic_map_space_reset(bmap, type);
3258 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL))
3259 return isl_basic_map_remove_dims(bmap, type, first, n);
3261 isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
3264 bmap = move_last(bmap, type, first, n);
3265 bmap = isl_basic_map_cow(bmap);
3269 row_size = 1 + isl_space_dim(bmap->dim, isl_dim_all) + bmap->extra;
3270 old = bmap->block2.data;
3271 bmap->block2 = isl_blk_extend(bmap->ctx, bmap->block2,
3272 (bmap->extra + n) * (1 + row_size));
3273 if (!bmap->block2.data)
3275 new_div = isl_alloc_array(bmap->ctx, isl_int *, bmap->extra + n);
3278 for (i = 0; i < n; ++i) {
3279 new_div[i] = bmap->block2.data +
3280 (bmap->extra + i) * (1 + row_size);
3281 isl_seq_clr(new_div[i], 1 + row_size);
3283 for (i = 0; i < bmap->extra; ++i)
3284 new_div[n + i] = bmap->block2.data + (bmap->div[i] - old);
3286 bmap->div = new_div;
3290 bmap->dim = isl_space_drop_dims(bmap->dim, type, first, n);
3293 bmap = isl_basic_map_simplify(bmap);
3294 bmap = isl_basic_map_drop_redundant_divs(bmap);
3295 return isl_basic_map_finalize(bmap);
3297 isl_basic_map_free(bmap);
3301 /* Turn the n dimensions of type type, starting at first
3302 * into existentially quantified variables.
3304 struct isl_basic_set *isl_basic_set_project_out(struct isl_basic_set *bset,
3305 enum isl_dim_type type, unsigned first, unsigned n)
3307 return (isl_basic_set *)isl_basic_map_project_out(
3308 (isl_basic_map *)bset, type, first, n);
3311 /* Turn the n dimensions of type type, starting at first
3312 * into existentially quantified variables.
3314 __isl_give isl_map *isl_map_project_out(__isl_take isl_map *map,
3315 enum isl_dim_type type, unsigned first, unsigned n)
3323 return map_space_reset(map, type);
3325 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
3327 map = isl_map_cow(map);
3331 map->dim = isl_space_drop_dims(map->dim, type, first, n);
3335 for (i = 0; i < map->n; ++i) {
3336 map->p[i] = isl_basic_map_project_out(map->p[i], type, first, n);
3347 /* Turn the n dimensions of type type, starting at first
3348 * into existentially quantified variables.
3350 __isl_give isl_set *isl_set_project_out(__isl_take isl_set *set,
3351 enum isl_dim_type type, unsigned first, unsigned n)
3353 return (isl_set *)isl_map_project_out((isl_map *)set, type, first, n);
3356 static struct isl_basic_map *add_divs(struct isl_basic_map *bmap, unsigned n)
3360 for (i = 0; i < n; ++i) {
3361 j = isl_basic_map_alloc_div(bmap);
3364 isl_seq_clr(bmap->div[j], 1+1+isl_basic_map_total_dim(bmap));
3368 isl_basic_map_free(bmap);
3372 struct isl_basic_map *isl_basic_map_apply_range(
3373 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3375 isl_space *dim_result = NULL;
3376 struct isl_basic_map *bmap;
3377 unsigned n_in, n_out, n, nparam, total, pos;
3378 struct isl_dim_map *dim_map1, *dim_map2;
3380 if (!bmap1 || !bmap2)
3383 dim_result = isl_space_join(isl_space_copy(bmap1->dim),
3384 isl_space_copy(bmap2->dim));
3386 n_in = isl_basic_map_n_in(bmap1);
3387 n_out = isl_basic_map_n_out(bmap2);
3388 n = isl_basic_map_n_out(bmap1);
3389 nparam = isl_basic_map_n_param(bmap1);
3391 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + n;
3392 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
3393 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
3394 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
3395 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
3396 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
3397 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_in);
3398 isl_dim_map_div(dim_map1, bmap1, pos += n_out);
3399 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
3400 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
3401 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
3403 bmap = isl_basic_map_alloc_space(dim_result,
3404 bmap1->n_div + bmap2->n_div + n,
3405 bmap1->n_eq + bmap2->n_eq,
3406 bmap1->n_ineq + bmap2->n_ineq);
3407 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap1, dim_map1);
3408 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap2, dim_map2);
3409 bmap = add_divs(bmap, n);
3410 bmap = isl_basic_map_simplify(bmap);
3411 bmap = isl_basic_map_drop_redundant_divs(bmap);
3412 return isl_basic_map_finalize(bmap);
3414 isl_basic_map_free(bmap1);
3415 isl_basic_map_free(bmap2);
3419 struct isl_basic_set *isl_basic_set_apply(
3420 struct isl_basic_set *bset, struct isl_basic_map *bmap)
3425 isl_assert(bset->ctx, isl_basic_map_compatible_domain(bmap, bset),
3428 return (struct isl_basic_set *)
3429 isl_basic_map_apply_range((struct isl_basic_map *)bset, bmap);
3431 isl_basic_set_free(bset);
3432 isl_basic_map_free(bmap);
3436 struct isl_basic_map *isl_basic_map_apply_domain(
3437 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3439 if (!bmap1 || !bmap2)
3442 isl_assert(bmap1->ctx,
3443 isl_basic_map_n_in(bmap1) == isl_basic_map_n_in(bmap2), goto error);
3444 isl_assert(bmap1->ctx,
3445 isl_basic_map_n_param(bmap1) == isl_basic_map_n_param(bmap2),
3448 bmap1 = isl_basic_map_reverse(bmap1);
3449 bmap1 = isl_basic_map_apply_range(bmap1, bmap2);
3450 return isl_basic_map_reverse(bmap1);
3452 isl_basic_map_free(bmap1);
3453 isl_basic_map_free(bmap2);
3457 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
3458 * A \cap B -> f(A) + f(B)
3460 struct isl_basic_map *isl_basic_map_sum(
3461 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3463 unsigned n_in, n_out, nparam, total, pos;
3464 struct isl_basic_map *bmap = NULL;
3465 struct isl_dim_map *dim_map1, *dim_map2;
3468 if (!bmap1 || !bmap2)
3471 isl_assert(bmap1->ctx, isl_space_is_equal(bmap1->dim, bmap2->dim),
3474 nparam = isl_basic_map_n_param(bmap1);
3475 n_in = isl_basic_map_n_in(bmap1);
3476 n_out = isl_basic_map_n_out(bmap1);
3478 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + 2 * n_out;
3479 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
3480 dim_map2 = isl_dim_map_alloc(bmap2->ctx, total);
3481 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
3482 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos);
3483 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
3484 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
3485 isl_dim_map_div(dim_map1, bmap1, pos += n_in + n_out);
3486 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
3487 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
3488 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_out);
3490 bmap = isl_basic_map_alloc_space(isl_space_copy(bmap1->dim),
3491 bmap1->n_div + bmap2->n_div + 2 * n_out,
3492 bmap1->n_eq + bmap2->n_eq + n_out,
3493 bmap1->n_ineq + bmap2->n_ineq);
3494 for (i = 0; i < n_out; ++i) {
3495 int j = isl_basic_map_alloc_equality(bmap);
3498 isl_seq_clr(bmap->eq[j], 1+total);
3499 isl_int_set_si(bmap->eq[j][1+nparam+n_in+i], -1);
3500 isl_int_set_si(bmap->eq[j][1+pos+i], 1);
3501 isl_int_set_si(bmap->eq[j][1+pos-n_out+i], 1);
3503 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap1, dim_map1);
3504 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap2, dim_map2);
3505 bmap = add_divs(bmap, 2 * n_out);
3507 bmap = isl_basic_map_simplify(bmap);
3508 return isl_basic_map_finalize(bmap);
3510 isl_basic_map_free(bmap);
3511 isl_basic_map_free(bmap1);
3512 isl_basic_map_free(bmap2);
3516 /* Given two maps A -> f(A) and B -> g(B), construct a map
3517 * A \cap B -> f(A) + f(B)
3519 struct isl_map *isl_map_sum(struct isl_map *map1, struct isl_map *map2)
3521 struct isl_map *result;
3527 isl_assert(map1->ctx, isl_space_is_equal(map1->dim, map2->dim), goto error);
3529 result = isl_map_alloc_space(isl_space_copy(map1->dim),
3530 map1->n * map2->n, 0);
3533 for (i = 0; i < map1->n; ++i)
3534 for (j = 0; j < map2->n; ++j) {
3535 struct isl_basic_map *part;
3536 part = isl_basic_map_sum(
3537 isl_basic_map_copy(map1->p[i]),
3538 isl_basic_map_copy(map2->p[j]));
3539 if (isl_basic_map_is_empty(part))
3540 isl_basic_map_free(part);
3542 result = isl_map_add_basic_map(result, part);
3555 __isl_give isl_set *isl_set_sum(__isl_take isl_set *set1,
3556 __isl_take isl_set *set2)
3558 return (isl_set *)isl_map_sum((isl_map *)set1, (isl_map *)set2);
3561 /* Given a basic map A -> f(A), construct A -> -f(A).
3563 struct isl_basic_map *isl_basic_map_neg(struct isl_basic_map *bmap)
3568 bmap = isl_basic_map_cow(bmap);
3572 n = isl_basic_map_dim(bmap, isl_dim_out);
3573 off = isl_basic_map_offset(bmap, isl_dim_out);
3574 for (i = 0; i < bmap->n_eq; ++i)
3575 for (j = 0; j < n; ++j)
3576 isl_int_neg(bmap->eq[i][off+j], bmap->eq[i][off+j]);
3577 for (i = 0; i < bmap->n_ineq; ++i)
3578 for (j = 0; j < n; ++j)
3579 isl_int_neg(bmap->ineq[i][off+j], bmap->ineq[i][off+j]);
3580 for (i = 0; i < bmap->n_div; ++i)
3581 for (j = 0; j < n; ++j)
3582 isl_int_neg(bmap->div[i][1+off+j], bmap->div[i][1+off+j]);
3583 bmap = isl_basic_map_gauss(bmap, NULL);
3584 return isl_basic_map_finalize(bmap);
3587 __isl_give isl_basic_set *isl_basic_set_neg(__isl_take isl_basic_set *bset)
3589 return isl_basic_map_neg(bset);
3592 /* Given a map A -> f(A), construct A -> -f(A).
3594 struct isl_map *isl_map_neg(struct isl_map *map)
3598 map = isl_map_cow(map);
3602 for (i = 0; i < map->n; ++i) {
3603 map->p[i] = isl_basic_map_neg(map->p[i]);
3614 __isl_give isl_set *isl_set_neg(__isl_take isl_set *set)
3616 return (isl_set *)isl_map_neg((isl_map *)set);
3619 /* Given a basic map A -> f(A) and an integer d, construct a basic map
3620 * A -> floor(f(A)/d).
3622 struct isl_basic_map *isl_basic_map_floordiv(struct isl_basic_map *bmap,
3625 unsigned n_in, n_out, nparam, total, pos;
3626 struct isl_basic_map *result = NULL;
3627 struct isl_dim_map *dim_map;
3633 nparam = isl_basic_map_n_param(bmap);
3634 n_in = isl_basic_map_n_in(bmap);
3635 n_out = isl_basic_map_n_out(bmap);
3637 total = nparam + n_in + n_out + bmap->n_div + n_out;
3638 dim_map = isl_dim_map_alloc(bmap->ctx, total);
3639 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_param, pos = 0);
3640 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_in, pos += nparam);
3641 isl_dim_map_div(dim_map, bmap, pos += n_in + n_out);
3642 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_out, pos += bmap->n_div);
3644 result = isl_basic_map_alloc_space(isl_space_copy(bmap->dim),
3645 bmap->n_div + n_out,
3646 bmap->n_eq, bmap->n_ineq + 2 * n_out);
3647 result = isl_basic_map_add_constraints_dim_map(result, bmap, dim_map);
3648 result = add_divs(result, n_out);
3649 for (i = 0; i < n_out; ++i) {
3651 j = isl_basic_map_alloc_inequality(result);
3654 isl_seq_clr(result->ineq[j], 1+total);
3655 isl_int_neg(result->ineq[j][1+nparam+n_in+i], d);
3656 isl_int_set_si(result->ineq[j][1+pos+i], 1);
3657 j = isl_basic_map_alloc_inequality(result);
3660 isl_seq_clr(result->ineq[j], 1+total);
3661 isl_int_set(result->ineq[j][1+nparam+n_in+i], d);
3662 isl_int_set_si(result->ineq[j][1+pos+i], -1);
3663 isl_int_sub_ui(result->ineq[j][0], d, 1);
3666 result = isl_basic_map_simplify(result);
3667 return isl_basic_map_finalize(result);
3669 isl_basic_map_free(result);
3673 /* Given a map A -> f(A) and an integer d, construct a map
3674 * A -> floor(f(A)/d).
3676 struct isl_map *isl_map_floordiv(struct isl_map *map, isl_int d)
3680 map = isl_map_cow(map);
3684 ISL_F_CLR(map, ISL_MAP_DISJOINT);
3685 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3686 for (i = 0; i < map->n; ++i) {
3687 map->p[i] = isl_basic_map_floordiv(map->p[i], d);
3698 static struct isl_basic_map *var_equal(struct isl_basic_map *bmap, unsigned pos)
3704 i = isl_basic_map_alloc_equality(bmap);
3707 nparam = isl_basic_map_n_param(bmap);
3708 n_in = isl_basic_map_n_in(bmap);
3709 isl_seq_clr(bmap->eq[i], 1 + isl_basic_map_total_dim(bmap));
3710 isl_int_set_si(bmap->eq[i][1+nparam+pos], -1);
3711 isl_int_set_si(bmap->eq[i][1+nparam+n_in+pos], 1);
3712 return isl_basic_map_finalize(bmap);
3714 isl_basic_map_free(bmap);
3718 /* Add a constraints to "bmap" expressing i_pos < o_pos
3720 static struct isl_basic_map *var_less(struct isl_basic_map *bmap, unsigned pos)
3726 i = isl_basic_map_alloc_inequality(bmap);
3729 nparam = isl_basic_map_n_param(bmap);
3730 n_in = isl_basic_map_n_in(bmap);
3731 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
3732 isl_int_set_si(bmap->ineq[i][0], -1);
3733 isl_int_set_si(bmap->ineq[i][1+nparam+pos], -1);
3734 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], 1);
3735 return isl_basic_map_finalize(bmap);
3737 isl_basic_map_free(bmap);
3741 /* Add a constraint to "bmap" expressing i_pos <= o_pos
3743 static __isl_give isl_basic_map *var_less_or_equal(
3744 __isl_take isl_basic_map *bmap, unsigned pos)
3750 i = isl_basic_map_alloc_inequality(bmap);
3753 nparam = isl_basic_map_n_param(bmap);
3754 n_in = isl_basic_map_n_in(bmap);
3755 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
3756 isl_int_set_si(bmap->ineq[i][1+nparam+pos], -1);
3757 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], 1);
3758 return isl_basic_map_finalize(bmap);
3760 isl_basic_map_free(bmap);
3764 /* Add a constraints to "bmap" expressing i_pos > o_pos
3766 static struct isl_basic_map *var_more(struct isl_basic_map *bmap, unsigned pos)
3772 i = isl_basic_map_alloc_inequality(bmap);
3775 nparam = isl_basic_map_n_param(bmap);
3776 n_in = isl_basic_map_n_in(bmap);
3777 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
3778 isl_int_set_si(bmap->ineq[i][0], -1);
3779 isl_int_set_si(bmap->ineq[i][1+nparam+pos], 1);
3780 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], -1);
3781 return isl_basic_map_finalize(bmap);
3783 isl_basic_map_free(bmap);
3787 /* Add a constraint to "bmap" expressing i_pos >= o_pos
3789 static __isl_give isl_basic_map *var_more_or_equal(
3790 __isl_take isl_basic_map *bmap, unsigned pos)
3796 i = isl_basic_map_alloc_inequality(bmap);
3799 nparam = isl_basic_map_n_param(bmap);
3800 n_in = isl_basic_map_n_in(bmap);
3801 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
3802 isl_int_set_si(bmap->ineq[i][1+nparam+pos], 1);
3803 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], -1);
3804 return isl_basic_map_finalize(bmap);
3806 isl_basic_map_free(bmap);
3810 __isl_give isl_basic_map *isl_basic_map_equal(
3811 __isl_take isl_space *dim, unsigned n_equal)
3814 struct isl_basic_map *bmap;
3815 bmap = isl_basic_map_alloc_space(dim, 0, n_equal, 0);
3818 for (i = 0; i < n_equal && bmap; ++i)
3819 bmap = var_equal(bmap, i);
3820 return isl_basic_map_finalize(bmap);
3823 /* Return a relation on of dimension "dim" expressing i_[0..pos] << o_[0..pos]
3825 __isl_give isl_basic_map *isl_basic_map_less_at(__isl_take isl_space *dim,
3829 struct isl_basic_map *bmap;
3830 bmap = isl_basic_map_alloc_space(dim, 0, pos, 1);
3833 for (i = 0; i < pos && bmap; ++i)
3834 bmap = var_equal(bmap, i);
3836 bmap = var_less(bmap, pos);
3837 return isl_basic_map_finalize(bmap);
3840 /* Return a relation on of dimension "dim" expressing i_[0..pos] <<= o_[0..pos]
3842 __isl_give isl_basic_map *isl_basic_map_less_or_equal_at(
3843 __isl_take isl_space *dim, unsigned pos)
3846 isl_basic_map *bmap;
3848 bmap = isl_basic_map_alloc_space(dim, 0, pos, 1);
3849 for (i = 0; i < pos; ++i)
3850 bmap = var_equal(bmap, i);
3851 bmap = var_less_or_equal(bmap, pos);
3852 return isl_basic_map_finalize(bmap);
3855 /* Return a relation on pairs of sets of dimension "dim" expressing i_pos > o_pos
3857 __isl_give isl_basic_map *isl_basic_map_more_at(__isl_take isl_space *dim,
3861 struct isl_basic_map *bmap;
3862 bmap = isl_basic_map_alloc_space(dim, 0, pos, 1);
3865 for (i = 0; i < pos && bmap; ++i)
3866 bmap = var_equal(bmap, i);
3868 bmap = var_more(bmap, pos);
3869 return isl_basic_map_finalize(bmap);
3872 /* Return a relation on of dimension "dim" expressing i_[0..pos] >>= o_[0..pos]
3874 __isl_give isl_basic_map *isl_basic_map_more_or_equal_at(
3875 __isl_take isl_space *dim, unsigned pos)
3878 isl_basic_map *bmap;
3880 bmap = isl_basic_map_alloc_space(dim, 0, pos, 1);
3881 for (i = 0; i < pos; ++i)
3882 bmap = var_equal(bmap, i);
3883 bmap = var_more_or_equal(bmap, pos);
3884 return isl_basic_map_finalize(bmap);
3887 static __isl_give isl_map *map_lex_lte_first(__isl_take isl_space *dims,
3888 unsigned n, int equal)
3890 struct isl_map *map;
3893 if (n == 0 && equal)
3894 return isl_map_universe(dims);
3896 map = isl_map_alloc_space(isl_space_copy(dims), n, ISL_MAP_DISJOINT);
3898 for (i = 0; i + 1 < n; ++i)
3899 map = isl_map_add_basic_map(map,
3900 isl_basic_map_less_at(isl_space_copy(dims), i));
3903 map = isl_map_add_basic_map(map,
3904 isl_basic_map_less_or_equal_at(dims, n - 1));
3906 map = isl_map_add_basic_map(map,
3907 isl_basic_map_less_at(dims, n - 1));
3909 isl_space_free(dims);
3914 static __isl_give isl_map *map_lex_lte(__isl_take isl_space *dims, int equal)
3918 return map_lex_lte_first(dims, dims->n_out, equal);
3921 __isl_give isl_map *isl_map_lex_lt_first(__isl_take isl_space *dim, unsigned n)
3923 return map_lex_lte_first(dim, n, 0);
3926 __isl_give isl_map *isl_map_lex_le_first(__isl_take isl_space *dim, unsigned n)
3928 return map_lex_lte_first(dim, n, 1);
3931 __isl_give isl_map *isl_map_lex_lt(__isl_take isl_space *set_dim)
3933 return map_lex_lte(isl_space_map_from_set(set_dim), 0);
3936 __isl_give isl_map *isl_map_lex_le(__isl_take isl_space *set_dim)
3938 return map_lex_lte(isl_space_map_from_set(set_dim), 1);
3941 static __isl_give isl_map *map_lex_gte_first(__isl_take isl_space *dims,
3942 unsigned n, int equal)
3944 struct isl_map *map;
3947 if (n == 0 && equal)
3948 return isl_map_universe(dims);
3950 map = isl_map_alloc_space(isl_space_copy(dims), n, ISL_MAP_DISJOINT);
3952 for (i = 0; i + 1 < n; ++i)
3953 map = isl_map_add_basic_map(map,
3954 isl_basic_map_more_at(isl_space_copy(dims), i));
3957 map = isl_map_add_basic_map(map,
3958 isl_basic_map_more_or_equal_at(dims, n - 1));
3960 map = isl_map_add_basic_map(map,
3961 isl_basic_map_more_at(dims, n - 1));
3963 isl_space_free(dims);
3968 static __isl_give isl_map *map_lex_gte(__isl_take isl_space *dims, int equal)
3972 return map_lex_gte_first(dims, dims->n_out, equal);
3975 __isl_give isl_map *isl_map_lex_gt_first(__isl_take isl_space *dim, unsigned n)
3977 return map_lex_gte_first(dim, n, 0);
3980 __isl_give isl_map *isl_map_lex_ge_first(__isl_take isl_space *dim, unsigned n)
3982 return map_lex_gte_first(dim, n, 1);
3985 __isl_give isl_map *isl_map_lex_gt(__isl_take isl_space *set_dim)
3987 return map_lex_gte(isl_space_map_from_set(set_dim), 0);
3990 __isl_give isl_map *isl_map_lex_ge(__isl_take isl_space *set_dim)
3992 return map_lex_gte(isl_space_map_from_set(set_dim), 1);
3995 __isl_give isl_map *isl_set_lex_le_set(__isl_take isl_set *set1,
3996 __isl_take isl_set *set2)
3999 map = isl_map_lex_le(isl_set_get_space(set1));
4000 map = isl_map_intersect_domain(map, set1);
4001 map = isl_map_intersect_range(map, set2);
4005 __isl_give isl_map *isl_set_lex_lt_set(__isl_take isl_set *set1,
4006 __isl_take isl_set *set2)
4009 map = isl_map_lex_lt(isl_set_get_space(set1));
4010 map = isl_map_intersect_domain(map, set1);
4011 map = isl_map_intersect_range(map, set2);
4015 __isl_give isl_map *isl_set_lex_ge_set(__isl_take isl_set *set1,
4016 __isl_take isl_set *set2)
4019 map = isl_map_lex_ge(isl_set_get_space(set1));
4020 map = isl_map_intersect_domain(map, set1);
4021 map = isl_map_intersect_range(map, set2);
4025 __isl_give isl_map *isl_set_lex_gt_set(__isl_take isl_set *set1,
4026 __isl_take isl_set *set2)
4029 map = isl_map_lex_gt(isl_set_get_space(set1));
4030 map = isl_map_intersect_domain(map, set1);
4031 map = isl_map_intersect_range(map, set2);
4035 __isl_give isl_map *isl_map_lex_le_map(__isl_take isl_map *map1,
4036 __isl_take isl_map *map2)
4039 map = isl_map_lex_le(isl_space_range(isl_map_get_space(map1)));
4040 map = isl_map_apply_domain(map, isl_map_reverse(map1));
4041 map = isl_map_apply_range(map, isl_map_reverse(map2));
4045 __isl_give isl_map *isl_map_lex_lt_map(__isl_take isl_map *map1,
4046 __isl_take isl_map *map2)
4049 map = isl_map_lex_lt(isl_space_range(isl_map_get_space(map1)));
4050 map = isl_map_apply_domain(map, isl_map_reverse(map1));
4051 map = isl_map_apply_range(map, isl_map_reverse(map2));
4055 __isl_give isl_map *isl_map_lex_ge_map(__isl_take isl_map *map1,
4056 __isl_take isl_map *map2)
4059 map = isl_map_lex_ge(isl_space_range(isl_map_get_space(map1)));
4060 map = isl_map_apply_domain(map, isl_map_reverse(map1));
4061 map = isl_map_apply_range(map, isl_map_reverse(map2));
4065 __isl_give isl_map *isl_map_lex_gt_map(__isl_take isl_map *map1,
4066 __isl_take isl_map *map2)
4069 map = isl_map_lex_gt(isl_space_range(isl_map_get_space(map1)));
4070 map = isl_map_apply_domain(map, isl_map_reverse(map1));
4071 map = isl_map_apply_range(map, isl_map_reverse(map2));
4075 __isl_give isl_basic_map *isl_basic_map_from_basic_set(
4076 __isl_take isl_basic_set *bset, __isl_take isl_space *dim)
4078 struct isl_basic_map *bmap;
4080 bset = isl_basic_set_cow(bset);
4084 isl_assert(bset->ctx, isl_space_compatible(bset->dim, dim), goto error);
4085 isl_space_free(bset->dim);
4086 bmap = (struct isl_basic_map *) bset;
4088 return isl_basic_map_finalize(bmap);
4090 isl_basic_set_free(bset);
4091 isl_space_free(dim);
4095 struct isl_basic_set *isl_basic_set_from_basic_map(struct isl_basic_map *bmap)
4099 if (bmap->dim->n_in == 0)
4100 return (struct isl_basic_set *)bmap;
4101 bmap = isl_basic_map_cow(bmap);
4104 bmap->dim = isl_space_as_set_space(bmap->dim);
4107 bmap = isl_basic_map_finalize(bmap);
4108 return (struct isl_basic_set *)bmap;
4110 isl_basic_map_free(bmap);
4114 /* For a div d = floor(f/m), add the constraints
4117 * -(f-(n-1)) + m d >= 0
4119 * Note that the second constraint is the negation of
4123 int isl_basic_map_add_div_constraints_var(__isl_keep isl_basic_map *bmap,
4124 unsigned pos, isl_int *div)
4127 unsigned total = isl_basic_map_total_dim(bmap);
4129 i = isl_basic_map_alloc_inequality(bmap);
4132 isl_seq_cpy(bmap->ineq[i], div + 1, 1 + total);
4133 isl_int_neg(bmap->ineq[i][1 + pos], div[0]);
4135 j = isl_basic_map_alloc_inequality(bmap);
4138 isl_seq_neg(bmap->ineq[j], bmap->ineq[i], 1 + total);
4139 isl_int_add(bmap->ineq[j][0], bmap->ineq[j][0], bmap->ineq[j][1 + pos]);
4140 isl_int_sub_ui(bmap->ineq[j][0], bmap->ineq[j][0], 1);
4144 int isl_basic_set_add_div_constraints_var(__isl_keep isl_basic_set *bset,
4145 unsigned pos, isl_int *div)
4147 return isl_basic_map_add_div_constraints_var((isl_basic_map *)bset,
4151 int isl_basic_map_add_div_constraints(struct isl_basic_map *bmap, unsigned div)
4153 unsigned total = isl_basic_map_total_dim(bmap);
4154 unsigned div_pos = total - bmap->n_div + div;
4156 return isl_basic_map_add_div_constraints_var(bmap, div_pos,
4160 struct isl_basic_set *isl_basic_map_underlying_set(
4161 struct isl_basic_map *bmap)
4165 if (bmap->dim->nparam == 0 && bmap->dim->n_in == 0 &&
4167 !isl_space_is_named_or_nested(bmap->dim, isl_dim_in) &&
4168 !isl_space_is_named_or_nested(bmap->dim, isl_dim_out))
4169 return (struct isl_basic_set *)bmap;
4170 bmap = isl_basic_map_cow(bmap);
4173 bmap->dim = isl_space_underlying(bmap->dim, bmap->n_div);
4176 bmap->extra -= bmap->n_div;
4178 bmap = isl_basic_map_finalize(bmap);
4179 return (struct isl_basic_set *)bmap;
4184 __isl_give isl_basic_set *isl_basic_set_underlying_set(
4185 __isl_take isl_basic_set *bset)
4187 return isl_basic_map_underlying_set((isl_basic_map *)bset);
4190 struct isl_basic_map *isl_basic_map_overlying_set(
4191 struct isl_basic_set *bset, struct isl_basic_map *like)
4193 struct isl_basic_map *bmap;
4194 struct isl_ctx *ctx;
4201 isl_assert(ctx, bset->n_div == 0, goto error);
4202 isl_assert(ctx, isl_basic_set_n_param(bset) == 0, goto error);
4203 isl_assert(ctx, bset->dim->n_out == isl_basic_map_total_dim(like),
4205 if (isl_space_is_equal(bset->dim, like->dim) && like->n_div == 0) {
4206 isl_basic_map_free(like);
4207 return (struct isl_basic_map *)bset;
4209 bset = isl_basic_set_cow(bset);
4212 total = bset->dim->n_out + bset->extra;
4213 bmap = (struct isl_basic_map *)bset;
4214 isl_space_free(bmap->dim);
4215 bmap->dim = isl_space_copy(like->dim);
4218 bmap->n_div = like->n_div;
4219 bmap->extra += like->n_div;
4223 ltotal = total - bmap->extra + like->extra;
4226 bmap->block2 = isl_blk_extend(ctx, bmap->block2,
4227 bmap->extra * (1 + 1 + total));
4228 if (isl_blk_is_error(bmap->block2))
4230 div = isl_realloc_array(ctx, bmap->div, isl_int *, bmap->extra);
4234 for (i = 0; i < bmap->extra; ++i)
4235 bmap->div[i] = bmap->block2.data + i * (1 + 1 + total);
4236 for (i = 0; i < like->n_div; ++i) {
4237 isl_seq_cpy(bmap->div[i], like->div[i], 1 + 1 + ltotal);
4238 isl_seq_clr(bmap->div[i]+1+1+ltotal, total - ltotal);
4240 bmap = isl_basic_map_extend_constraints(bmap,
4241 0, 2 * like->n_div);
4242 for (i = 0; i < like->n_div; ++i) {
4243 if (isl_int_is_zero(bmap->div[i][0]))
4245 if (isl_basic_map_add_div_constraints(bmap, i) < 0)
4249 isl_basic_map_free(like);
4250 bmap = isl_basic_map_simplify(bmap);
4251 bmap = isl_basic_map_finalize(bmap);
4254 isl_basic_map_free(like);
4255 isl_basic_set_free(bset);
4259 struct isl_basic_set *isl_basic_set_from_underlying_set(
4260 struct isl_basic_set *bset, struct isl_basic_set *like)
4262 return (struct isl_basic_set *)
4263 isl_basic_map_overlying_set(bset, (struct isl_basic_map *)like);
4266 struct isl_set *isl_set_from_underlying_set(
4267 struct isl_set *set, struct isl_basic_set *like)
4273 isl_assert(set->ctx, set->dim->n_out == isl_basic_set_total_dim(like),
4275 if (isl_space_is_equal(set->dim, like->dim) && like->n_div == 0) {
4276 isl_basic_set_free(like);
4279 set = isl_set_cow(set);
4282 for (i = 0; i < set->n; ++i) {
4283 set->p[i] = isl_basic_set_from_underlying_set(set->p[i],
4284 isl_basic_set_copy(like));
4288 isl_space_free(set->dim);
4289 set->dim = isl_space_copy(like->dim);
4292 isl_basic_set_free(like);
4295 isl_basic_set_free(like);
4300 struct isl_set *isl_map_underlying_set(struct isl_map *map)
4304 map = isl_map_cow(map);
4307 map->dim = isl_space_cow(map->dim);
4311 for (i = 1; i < map->n; ++i)
4312 isl_assert(map->ctx, map->p[0]->n_div == map->p[i]->n_div,
4314 for (i = 0; i < map->n; ++i) {
4315 map->p[i] = (struct isl_basic_map *)
4316 isl_basic_map_underlying_set(map->p[i]);
4321 map->dim = isl_space_underlying(map->dim, 0);
4323 isl_space_free(map->dim);
4324 map->dim = isl_space_copy(map->p[0]->dim);
4328 return (struct isl_set *)map;
4334 struct isl_set *isl_set_to_underlying_set(struct isl_set *set)
4336 return (struct isl_set *)isl_map_underlying_set((struct isl_map *)set);
4339 __isl_give isl_basic_map *isl_basic_map_reset_space(
4340 __isl_take isl_basic_map *bmap, __isl_take isl_space *dim)
4342 bmap = isl_basic_map_cow(bmap);
4346 isl_space_free(bmap->dim);
4349 bmap = isl_basic_map_finalize(bmap);
4353 isl_basic_map_free(bmap);
4354 isl_space_free(dim);
4358 __isl_give isl_basic_set *isl_basic_set_reset_space(
4359 __isl_take isl_basic_set *bset, __isl_take isl_space *dim)
4361 return (isl_basic_set *)isl_basic_map_reset_space((isl_basic_map *)bset,
4365 __isl_give isl_map *isl_map_reset_space(__isl_take isl_map *map,
4366 __isl_take isl_space *dim)
4370 map = isl_map_cow(map);
4374 for (i = 0; i < map->n; ++i) {
4375 map->p[i] = isl_basic_map_reset_space(map->p[i],
4376 isl_space_copy(dim));
4380 isl_space_free(map->dim);
4386 isl_space_free(dim);
4390 __isl_give isl_set *isl_set_reset_space(__isl_take isl_set *set,
4391 __isl_take isl_space *dim)
4393 return (struct isl_set *) isl_map_reset_space((struct isl_map *)set, dim);
4396 /* Compute the parameter domain of the given basic set.
4398 __isl_give isl_basic_set *isl_basic_set_params(__isl_take isl_basic_set *bset)
4403 if (isl_basic_set_is_params(bset))
4406 n = isl_basic_set_dim(bset, isl_dim_set);
4407 bset = isl_basic_set_project_out(bset, isl_dim_set, 0, n);
4408 space = isl_basic_set_get_space(bset);
4409 space = isl_space_params(space);
4410 bset = isl_basic_set_reset_space(bset, space);
4414 /* Compute the parameter domain of the given set.
4416 __isl_give isl_set *isl_set_params(__isl_take isl_set *set)
4421 if (isl_set_is_params(set))
4424 n = isl_set_dim(set, isl_dim_set);
4425 set = isl_set_project_out(set, isl_dim_set, 0, n);
4426 space = isl_set_get_space(set);
4427 space = isl_space_params(space);
4428 set = isl_set_reset_space(set, space);
4432 /* Construct a zero-dimensional set with the given parameter domain.
4434 __isl_give isl_set *isl_set_from_params(__isl_take isl_set *set)
4437 space = isl_set_get_space(set);
4438 space = isl_space_set_from_params(space);
4439 set = isl_set_reset_space(set, space);
4443 /* Compute the parameter domain of the given map.
4445 __isl_give isl_set *isl_map_params(__isl_take isl_map *map)
4450 n = isl_map_dim(map, isl_dim_in);
4451 map = isl_map_project_out(map, isl_dim_in, 0, n);
4452 n = isl_map_dim(map, isl_dim_out);
4453 map = isl_map_project_out(map, isl_dim_out, 0, n);
4454 space = isl_map_get_space(map);
4455 space = isl_space_params(space);
4456 map = isl_map_reset_space(map, space);
4460 struct isl_basic_set *isl_basic_map_domain(struct isl_basic_map *bmap)
4463 struct isl_basic_set *domain;
4469 dim = isl_space_domain(isl_basic_map_get_space(bmap));
4471 n_in = isl_basic_map_n_in(bmap);
4472 n_out = isl_basic_map_n_out(bmap);
4473 domain = isl_basic_set_from_basic_map(bmap);
4474 domain = isl_basic_set_project_out(domain, isl_dim_set, n_in, n_out);
4476 domain = isl_basic_set_reset_space(domain, dim);
4481 int isl_basic_map_may_be_set(__isl_keep isl_basic_map *bmap)
4485 return isl_space_may_be_set(bmap->dim);
4488 /* Is this basic map actually a set?
4489 * Users should never call this function. Outside of isl,
4490 * the type should indicate whether something is a set or a map.
4492 int isl_basic_map_is_set(__isl_keep isl_basic_map *bmap)
4496 return isl_space_is_set(bmap->dim);
4499 struct isl_basic_set *isl_basic_map_range(struct isl_basic_map *bmap)
4503 if (isl_basic_map_is_set(bmap))
4505 return isl_basic_map_domain(isl_basic_map_reverse(bmap));
4508 __isl_give isl_basic_map *isl_basic_map_domain_map(
4509 __isl_take isl_basic_map *bmap)
4513 isl_basic_map *domain;
4514 int nparam, n_in, n_out;
4517 nparam = isl_basic_map_dim(bmap, isl_dim_param);
4518 n_in = isl_basic_map_dim(bmap, isl_dim_in);
4519 n_out = isl_basic_map_dim(bmap, isl_dim_out);
4521 dim = isl_space_from_range(isl_space_domain(isl_basic_map_get_space(bmap)));
4522 domain = isl_basic_map_universe(dim);
4524 bmap = isl_basic_map_from_domain(isl_basic_map_wrap(bmap));
4525 bmap = isl_basic_map_apply_range(bmap, domain);
4526 bmap = isl_basic_map_extend_constraints(bmap, n_in, 0);
4528 total = isl_basic_map_total_dim(bmap);
4530 for (i = 0; i < n_in; ++i) {
4531 k = isl_basic_map_alloc_equality(bmap);
4534 isl_seq_clr(bmap->eq[k], 1 + total);
4535 isl_int_set_si(bmap->eq[k][1 + nparam + i], -1);
4536 isl_int_set_si(bmap->eq[k][1 + nparam + n_in + n_out + i], 1);
4539 bmap = isl_basic_map_gauss(bmap, NULL);
4540 return isl_basic_map_finalize(bmap);
4542 isl_basic_map_free(bmap);
4546 __isl_give isl_basic_map *isl_basic_map_range_map(
4547 __isl_take isl_basic_map *bmap)
4551 isl_basic_map *range;
4552 int nparam, n_in, n_out;
4555 nparam = isl_basic_map_dim(bmap, isl_dim_param);
4556 n_in = isl_basic_map_dim(bmap, isl_dim_in);
4557 n_out = isl_basic_map_dim(bmap, isl_dim_out);
4559 dim = isl_space_from_range(isl_space_range(isl_basic_map_get_space(bmap)));
4560 range = isl_basic_map_universe(dim);
4562 bmap = isl_basic_map_from_domain(isl_basic_map_wrap(bmap));
4563 bmap = isl_basic_map_apply_range(bmap, range);
4564 bmap = isl_basic_map_extend_constraints(bmap, n_out, 0);
4566 total = isl_basic_map_total_dim(bmap);
4568 for (i = 0; i < n_out; ++i) {
4569 k = isl_basic_map_alloc_equality(bmap);
4572 isl_seq_clr(bmap->eq[k], 1 + total);
4573 isl_int_set_si(bmap->eq[k][1 + nparam + n_in + i], -1);
4574 isl_int_set_si(bmap->eq[k][1 + nparam + n_in + n_out + i], 1);
4577 bmap = isl_basic_map_gauss(bmap, NULL);
4578 return isl_basic_map_finalize(bmap);
4580 isl_basic_map_free(bmap);
4584 int isl_map_may_be_set(__isl_keep isl_map *map)
4588 return isl_space_may_be_set(map->dim);
4591 /* Is this map actually a set?
4592 * Users should never call this function. Outside of isl,
4593 * the type should indicate whether something is a set or a map.
4595 int isl_map_is_set(__isl_keep isl_map *map)
4599 return isl_space_is_set(map->dim);
4602 struct isl_set *isl_map_range(struct isl_map *map)
4605 struct isl_set *set;
4609 if (isl_map_is_set(map))
4610 return (isl_set *)map;
4612 map = isl_map_cow(map);
4616 set = (struct isl_set *) map;
4617 set->dim = isl_space_range(set->dim);
4620 for (i = 0; i < map->n; ++i) {
4621 set->p[i] = isl_basic_map_range(map->p[i]);
4625 ISL_F_CLR(set, ISL_MAP_DISJOINT);
4626 ISL_F_CLR(set, ISL_SET_NORMALIZED);
4633 __isl_give isl_map *isl_map_domain_map(__isl_take isl_map *map)
4636 isl_space *domain_dim;
4638 map = isl_map_cow(map);
4642 domain_dim = isl_space_from_range(isl_space_domain(isl_map_get_space(map)));
4643 map->dim = isl_space_from_domain(isl_space_wrap(map->dim));
4644 map->dim = isl_space_join(map->dim, domain_dim);
4647 for (i = 0; i < map->n; ++i) {
4648 map->p[i] = isl_basic_map_domain_map(map->p[i]);
4652 ISL_F_CLR(map, ISL_MAP_DISJOINT);
4653 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4660 __isl_give isl_map *isl_map_range_map(__isl_take isl_map *map)
4663 isl_space *range_dim;
4665 map = isl_map_cow(map);
4669 range_dim = isl_space_range(isl_map_get_space(map));
4670 range_dim = isl_space_from_range(range_dim);
4671 map->dim = isl_space_from_domain(isl_space_wrap(map->dim));
4672 map->dim = isl_space_join(map->dim, range_dim);
4675 for (i = 0; i < map->n; ++i) {
4676 map->p[i] = isl_basic_map_range_map(map->p[i]);
4680 ISL_F_CLR(map, ISL_MAP_DISJOINT);
4681 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4688 __isl_give isl_map *isl_map_from_set(__isl_take isl_set *set,
4689 __isl_take isl_space *dim)
4692 struct isl_map *map = NULL;
4694 set = isl_set_cow(set);
4697 isl_assert(set->ctx, isl_space_compatible(set->dim, dim), goto error);
4698 map = (struct isl_map *)set;
4699 for (i = 0; i < set->n; ++i) {
4700 map->p[i] = isl_basic_map_from_basic_set(
4701 set->p[i], isl_space_copy(dim));
4705 isl_space_free(map->dim);
4709 isl_space_free(dim);
4714 __isl_give isl_basic_map *isl_basic_map_from_domain(
4715 __isl_take isl_basic_set *bset)
4717 return isl_basic_map_reverse(isl_basic_map_from_range(bset));
4720 __isl_give isl_basic_map *isl_basic_map_from_range(
4721 __isl_take isl_basic_set *bset)
4724 space = isl_basic_set_get_space(bset);
4725 space = isl_space_from_range(space);
4726 bset = isl_basic_set_reset_space(bset, space);
4727 return (isl_basic_map *)bset;
4730 struct isl_map *isl_map_from_range(struct isl_set *set)
4733 space = isl_set_get_space(set);
4734 space = isl_space_from_range(space);
4735 set = isl_set_reset_space(set, space);
4736 return (struct isl_map *)set;
4739 __isl_give isl_map *isl_map_from_domain(__isl_take isl_set *set)
4741 return isl_map_reverse(isl_map_from_range(set));
4744 __isl_give isl_basic_map *isl_basic_map_from_domain_and_range(
4745 __isl_take isl_basic_set *domain, __isl_take isl_basic_set *range)
4747 return isl_basic_map_apply_range(isl_basic_map_reverse(domain), range);
4750 __isl_give isl_map *isl_map_from_domain_and_range(__isl_take isl_set *domain,
4751 __isl_take isl_set *range)
4753 return isl_map_apply_range(isl_map_reverse(domain), range);
4756 struct isl_set *isl_set_from_map(struct isl_map *map)
4759 struct isl_set *set = NULL;
4763 map = isl_map_cow(map);
4766 map->dim = isl_space_as_set_space(map->dim);
4769 set = (struct isl_set *)map;
4770 for (i = 0; i < map->n; ++i) {
4771 set->p[i] = isl_basic_set_from_basic_map(map->p[i]);
4781 __isl_give isl_map *isl_map_alloc_space(__isl_take isl_space *dim, int n,
4784 struct isl_map *map;
4789 isl_die(dim->ctx, isl_error_internal,
4790 "negative number of basic maps", goto error);
4791 map = isl_alloc(dim->ctx, struct isl_map,
4792 sizeof(struct isl_map) +
4793 (n - 1) * sizeof(struct isl_basic_map *));
4797 map->ctx = dim->ctx;
4798 isl_ctx_ref(map->ctx);
4806 isl_space_free(dim);
4810 struct isl_map *isl_map_alloc(struct isl_ctx *ctx,
4811 unsigned nparam, unsigned in, unsigned out, int n,
4814 struct isl_map *map;
4817 dims = isl_space_alloc(ctx, nparam, in, out);
4821 map = isl_map_alloc_space(dims, n, flags);
4825 __isl_give isl_basic_map *isl_basic_map_empty(__isl_take isl_space *dim)
4827 struct isl_basic_map *bmap;
4828 bmap = isl_basic_map_alloc_space(dim, 0, 1, 0);
4829 bmap = isl_basic_map_set_to_empty(bmap);
4833 __isl_give isl_basic_set *isl_basic_set_empty(__isl_take isl_space *dim)
4835 struct isl_basic_set *bset;
4836 bset = isl_basic_set_alloc_space(dim, 0, 1, 0);
4837 bset = isl_basic_set_set_to_empty(bset);
4841 struct isl_basic_map *isl_basic_map_empty_like(struct isl_basic_map *model)
4843 struct isl_basic_map *bmap;
4846 bmap = isl_basic_map_alloc_space(isl_space_copy(model->dim), 0, 1, 0);
4847 bmap = isl_basic_map_set_to_empty(bmap);
4851 struct isl_basic_map *isl_basic_map_empty_like_map(struct isl_map *model)
4853 struct isl_basic_map *bmap;
4856 bmap = isl_basic_map_alloc_space(isl_space_copy(model->dim), 0, 1, 0);
4857 bmap = isl_basic_map_set_to_empty(bmap);
4861 struct isl_basic_set *isl_basic_set_empty_like(struct isl_basic_set *model)
4863 struct isl_basic_set *bset;
4866 bset = isl_basic_set_alloc_space(isl_space_copy(model->dim), 0, 1, 0);
4867 bset = isl_basic_set_set_to_empty(bset);
4871 __isl_give isl_basic_map *isl_basic_map_universe(__isl_take isl_space *dim)
4873 struct isl_basic_map *bmap;
4874 bmap = isl_basic_map_alloc_space(dim, 0, 0, 0);
4875 bmap = isl_basic_map_finalize(bmap);
4879 __isl_give isl_basic_set *isl_basic_set_universe(__isl_take isl_space *dim)
4881 struct isl_basic_set *bset;
4882 bset = isl_basic_set_alloc_space(dim, 0, 0, 0);
4883 bset = isl_basic_set_finalize(bset);
4887 __isl_give isl_basic_map *isl_basic_map_nat_universe(__isl_take isl_space *dim)
4890 unsigned total = isl_space_dim(dim, isl_dim_all);
4891 isl_basic_map *bmap;
4893 bmap= isl_basic_map_alloc_space(dim, 0, 0, total);
4894 for (i = 0; i < total; ++i) {
4895 int k = isl_basic_map_alloc_inequality(bmap);
4898 isl_seq_clr(bmap->ineq[k], 1 + total);
4899 isl_int_set_si(bmap->ineq[k][1 + i], 1);
4903 isl_basic_map_free(bmap);
4907 __isl_give isl_basic_set *isl_basic_set_nat_universe(__isl_take isl_space *dim)
4909 return isl_basic_map_nat_universe(dim);
4912 __isl_give isl_map *isl_map_nat_universe(__isl_take isl_space *dim)
4914 return isl_map_from_basic_map(isl_basic_map_nat_universe(dim));
4917 __isl_give isl_set *isl_set_nat_universe(__isl_take isl_space *dim)
4919 return isl_map_nat_universe(dim);
4922 __isl_give isl_basic_map *isl_basic_map_universe_like(
4923 __isl_keep isl_basic_map *model)
4927 return isl_basic_map_alloc_space(isl_space_copy(model->dim), 0, 0, 0);
4930 struct isl_basic_set *isl_basic_set_universe_like(struct isl_basic_set *model)
4934 return isl_basic_set_alloc_space(isl_space_copy(model->dim), 0, 0, 0);
4937 __isl_give isl_basic_set *isl_basic_set_universe_like_set(
4938 __isl_keep isl_set *model)
4942 return isl_basic_set_alloc_space(isl_space_copy(model->dim), 0, 0, 0);
4945 __isl_give isl_map *isl_map_empty(__isl_take isl_space *dim)
4947 return isl_map_alloc_space(dim, 0, ISL_MAP_DISJOINT);
4950 struct isl_map *isl_map_empty_like(struct isl_map *model)
4954 return isl_map_alloc_space(isl_space_copy(model->dim), 0, ISL_MAP_DISJOINT);
4957 struct isl_map *isl_map_empty_like_basic_map(struct isl_basic_map *model)
4961 return isl_map_alloc_space(isl_space_copy(model->dim), 0, ISL_MAP_DISJOINT);
4964 __isl_give isl_set *isl_set_empty(__isl_take isl_space *dim)
4966 return isl_set_alloc_space(dim, 0, ISL_MAP_DISJOINT);
4969 struct isl_set *isl_set_empty_like(struct isl_set *model)
4973 return isl_set_empty(isl_space_copy(model->dim));
4976 __isl_give isl_map *isl_map_universe(__isl_take isl_space *dim)
4978 struct isl_map *map;
4981 map = isl_map_alloc_space(isl_space_copy(dim), 1, ISL_MAP_DISJOINT);
4982 map = isl_map_add_basic_map(map, isl_basic_map_universe(dim));
4986 __isl_give isl_set *isl_set_universe(__isl_take isl_space *dim)
4988 struct isl_set *set;
4991 set = isl_set_alloc_space(isl_space_copy(dim), 1, ISL_MAP_DISJOINT);
4992 set = isl_set_add_basic_set(set, isl_basic_set_universe(dim));
4996 __isl_give isl_set *isl_set_universe_like(__isl_keep isl_set *model)
5000 return isl_set_universe(isl_space_copy(model->dim));
5003 struct isl_map *isl_map_dup(struct isl_map *map)
5006 struct isl_map *dup;
5010 dup = isl_map_alloc_space(isl_space_copy(map->dim), map->n, map->flags);
5011 for (i = 0; i < map->n; ++i)
5012 dup = isl_map_add_basic_map(dup, isl_basic_map_copy(map->p[i]));
5016 __isl_give isl_map *isl_map_add_basic_map(__isl_take isl_map *map,
5017 __isl_take isl_basic_map *bmap)
5021 if (isl_basic_map_plain_is_empty(bmap)) {
5022 isl_basic_map_free(bmap);
5025 isl_assert(map->ctx, isl_space_is_equal(map->dim, bmap->dim), goto error);
5026 isl_assert(map->ctx, map->n < map->size, goto error);
5027 map->p[map->n] = bmap;
5029 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
5035 isl_basic_map_free(bmap);
5039 void isl_map_free(struct isl_map *map)
5049 isl_ctx_deref(map->ctx);
5050 for (i = 0; i < map->n; ++i)
5051 isl_basic_map_free(map->p[i]);
5052 isl_space_free(map->dim);
5056 struct isl_map *isl_map_extend(struct isl_map *base,
5057 unsigned nparam, unsigned n_in, unsigned n_out)
5061 base = isl_map_cow(base);
5065 base->dim = isl_space_extend(base->dim, nparam, n_in, n_out);
5068 for (i = 0; i < base->n; ++i) {
5069 base->p[i] = isl_basic_map_extend_space(base->p[i],
5070 isl_space_copy(base->dim), 0, 0, 0);
5080 struct isl_set *isl_set_extend(struct isl_set *base,
5081 unsigned nparam, unsigned dim)
5083 return (struct isl_set *)isl_map_extend((struct isl_map *)base,
5087 static struct isl_basic_map *isl_basic_map_fix_pos_si(
5088 struct isl_basic_map *bmap, unsigned pos, int value)
5092 bmap = isl_basic_map_cow(bmap);
5093 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
5094 j = isl_basic_map_alloc_equality(bmap);
5097 isl_seq_clr(bmap->eq[j] + 1, isl_basic_map_total_dim(bmap));
5098 isl_int_set_si(bmap->eq[j][pos], -1);
5099 isl_int_set_si(bmap->eq[j][0], value);
5100 bmap = isl_basic_map_simplify(bmap);
5101 return isl_basic_map_finalize(bmap);
5103 isl_basic_map_free(bmap);
5107 static __isl_give isl_basic_map *isl_basic_map_fix_pos(
5108 __isl_take isl_basic_map *bmap, unsigned pos, isl_int value)
5112 bmap = isl_basic_map_cow(bmap);
5113 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
5114 j = isl_basic_map_alloc_equality(bmap);
5117 isl_seq_clr(bmap->eq[j] + 1, isl_basic_map_total_dim(bmap));
5118 isl_int_set_si(bmap->eq[j][pos], -1);
5119 isl_int_set(bmap->eq[j][0], value);
5120 bmap = isl_basic_map_simplify(bmap);
5121 return isl_basic_map_finalize(bmap);
5123 isl_basic_map_free(bmap);
5127 struct isl_basic_map *isl_basic_map_fix_si(struct isl_basic_map *bmap,
5128 enum isl_dim_type type, unsigned pos, int value)
5132 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
5133 return isl_basic_map_fix_pos_si(bmap,
5134 isl_basic_map_offset(bmap, type) + pos, value);
5136 isl_basic_map_free(bmap);
5140 __isl_give isl_basic_map *isl_basic_map_fix(__isl_take isl_basic_map *bmap,
5141 enum isl_dim_type type, unsigned pos, isl_int value)
5145 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
5146 return isl_basic_map_fix_pos(bmap,
5147 isl_basic_map_offset(bmap, type) + pos, value);
5149 isl_basic_map_free(bmap);
5153 struct isl_basic_set *isl_basic_set_fix_si(struct isl_basic_set *bset,
5154 enum isl_dim_type type, unsigned pos, int value)
5156 return (struct isl_basic_set *)
5157 isl_basic_map_fix_si((struct isl_basic_map *)bset,
5161 __isl_give isl_basic_set *isl_basic_set_fix(__isl_take isl_basic_set *bset,
5162 enum isl_dim_type type, unsigned pos, isl_int value)
5164 return (struct isl_basic_set *)
5165 isl_basic_map_fix((struct isl_basic_map *)bset,
5169 struct isl_basic_map *isl_basic_map_fix_input_si(struct isl_basic_map *bmap,
5170 unsigned input, int value)
5172 return isl_basic_map_fix_si(bmap, isl_dim_in, input, value);
5175 struct isl_basic_set *isl_basic_set_fix_dim_si(struct isl_basic_set *bset,
5176 unsigned dim, int value)
5178 return (struct isl_basic_set *)
5179 isl_basic_map_fix_si((struct isl_basic_map *)bset,
5180 isl_dim_set, dim, value);
5183 static int remove_if_empty(__isl_keep isl_map *map, int i)
5185 int empty = isl_basic_map_plain_is_empty(map->p[i]);
5192 isl_basic_map_free(map->p[i]);
5193 if (i != map->n - 1) {
5194 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
5195 map->p[i] = map->p[map->n - 1];
5202 struct isl_map *isl_map_fix_si(struct isl_map *map,
5203 enum isl_dim_type type, unsigned pos, int value)
5207 map = isl_map_cow(map);
5211 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
5212 for (i = map->n - 1; i >= 0; --i) {
5213 map->p[i] = isl_basic_map_fix_si(map->p[i], type, pos, value);
5214 if (remove_if_empty(map, i) < 0)
5217 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
5224 __isl_give isl_set *isl_set_fix_si(__isl_take isl_set *set,
5225 enum isl_dim_type type, unsigned pos, int value)
5227 return (struct isl_set *)
5228 isl_map_fix_si((struct isl_map *)set, type, pos, value);
5231 __isl_give isl_map *isl_map_fix(__isl_take isl_map *map,
5232 enum isl_dim_type type, unsigned pos, isl_int value)
5236 map = isl_map_cow(map);
5240 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
5241 for (i = 0; i < map->n; ++i) {
5242 map->p[i] = isl_basic_map_fix(map->p[i], type, pos, value);
5246 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
5253 __isl_give isl_set *isl_set_fix(__isl_take isl_set *set,
5254 enum isl_dim_type type, unsigned pos, isl_int value)
5256 return (struct isl_set *)isl_map_fix((isl_map *)set, type, pos, value);
5259 struct isl_map *isl_map_fix_input_si(struct isl_map *map,
5260 unsigned input, int value)
5262 return isl_map_fix_si(map, isl_dim_in, input, value);
5265 struct isl_set *isl_set_fix_dim_si(struct isl_set *set, unsigned dim, int value)
5267 return (struct isl_set *)
5268 isl_map_fix_si((struct isl_map *)set, isl_dim_set, dim, value);
5271 static __isl_give isl_basic_map *basic_map_bound_si(
5272 __isl_take isl_basic_map *bmap,
5273 enum isl_dim_type type, unsigned pos, int value, int upper)
5279 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
5280 pos += isl_basic_map_offset(bmap, type);
5281 bmap = isl_basic_map_cow(bmap);
5282 bmap = isl_basic_map_extend_constraints(bmap, 0, 1);
5283 j = isl_basic_map_alloc_inequality(bmap);
5286 isl_seq_clr(bmap->ineq[j], 1 + isl_basic_map_total_dim(bmap));
5288 isl_int_set_si(bmap->ineq[j][pos], -1);
5289 isl_int_set_si(bmap->ineq[j][0], value);
5291 isl_int_set_si(bmap->ineq[j][pos], 1);
5292 isl_int_set_si(bmap->ineq[j][0], -value);
5294 bmap = isl_basic_map_simplify(bmap);
5295 return isl_basic_map_finalize(bmap);
5297 isl_basic_map_free(bmap);
5301 __isl_give isl_basic_map *isl_basic_map_lower_bound_si(
5302 __isl_take isl_basic_map *bmap,
5303 enum isl_dim_type type, unsigned pos, int value)
5305 return basic_map_bound_si(bmap, type, pos, value, 0);
5308 struct isl_basic_set *isl_basic_set_lower_bound_dim(struct isl_basic_set *bset,
5309 unsigned dim, isl_int value)
5313 bset = isl_basic_set_cow(bset);
5314 bset = isl_basic_set_extend_constraints(bset, 0, 1);
5315 j = isl_basic_set_alloc_inequality(bset);
5318 isl_seq_clr(bset->ineq[j], 1 + isl_basic_set_total_dim(bset));
5319 isl_int_set_si(bset->ineq[j][1 + isl_basic_set_n_param(bset) + dim], 1);
5320 isl_int_neg(bset->ineq[j][0], value);
5321 bset = isl_basic_set_simplify(bset);
5322 return isl_basic_set_finalize(bset);
5324 isl_basic_set_free(bset);
5328 static __isl_give isl_map *map_bound_si(__isl_take isl_map *map,
5329 enum isl_dim_type type, unsigned pos, int value, int upper)
5333 map = isl_map_cow(map);
5337 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
5338 for (i = 0; i < map->n; ++i) {
5339 map->p[i] = basic_map_bound_si(map->p[i],
5340 type, pos, value, upper);
5344 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
5351 __isl_give isl_map *isl_map_lower_bound_si(__isl_take isl_map *map,
5352 enum isl_dim_type type, unsigned pos, int value)
5354 return map_bound_si(map, type, pos, value, 0);
5357 __isl_give isl_map *isl_map_upper_bound_si(__isl_take isl_map *map,
5358 enum isl_dim_type type, unsigned pos, int value)
5360 return map_bound_si(map, type, pos, value, 1);
5363 __isl_give isl_set *isl_set_lower_bound_si(__isl_take isl_set *set,
5364 enum isl_dim_type type, unsigned pos, int value)
5366 return (struct isl_set *)
5367 isl_map_lower_bound_si((struct isl_map *)set, type, pos, value);
5370 __isl_give isl_set *isl_set_upper_bound_si(__isl_take isl_set *set,
5371 enum isl_dim_type type, unsigned pos, int value)
5373 return isl_map_upper_bound_si(set, type, pos, value);
5376 /* Bound the given variable of "bmap" from below (or above is "upper"
5377 * is set) to "value".
5379 static __isl_give isl_basic_map *basic_map_bound(
5380 __isl_take isl_basic_map *bmap,
5381 enum isl_dim_type type, unsigned pos, isl_int value, int upper)
5387 if (pos >= isl_basic_map_dim(bmap, type))
5388 isl_die(bmap->ctx, isl_error_invalid,
5389 "index out of bounds", goto error);
5390 pos += isl_basic_map_offset(bmap, type);
5391 bmap = isl_basic_map_cow(bmap);
5392 bmap = isl_basic_map_extend_constraints(bmap, 0, 1);
5393 j = isl_basic_map_alloc_inequality(bmap);
5396 isl_seq_clr(bmap->ineq[j], 1 + isl_basic_map_total_dim(bmap));
5398 isl_int_set_si(bmap->ineq[j][pos], -1);
5399 isl_int_set(bmap->ineq[j][0], value);
5401 isl_int_set_si(bmap->ineq[j][pos], 1);
5402 isl_int_neg(bmap->ineq[j][0], value);
5404 bmap = isl_basic_map_simplify(bmap);
5405 return isl_basic_map_finalize(bmap);
5407 isl_basic_map_free(bmap);
5411 /* Bound the given variable of "map" from below (or above is "upper"
5412 * is set) to "value".
5414 static __isl_give isl_map *map_bound(__isl_take isl_map *map,
5415 enum isl_dim_type type, unsigned pos, isl_int value, int upper)
5419 map = isl_map_cow(map);
5423 if (pos >= isl_map_dim(map, type))
5424 isl_die(map->ctx, isl_error_invalid,
5425 "index out of bounds", goto error);
5426 for (i = map->n - 1; i >= 0; --i) {
5427 map->p[i] = basic_map_bound(map->p[i], type, pos, value, upper);
5428 if (remove_if_empty(map, i) < 0)
5431 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
5438 __isl_give isl_map *isl_map_lower_bound(__isl_take isl_map *map,
5439 enum isl_dim_type type, unsigned pos, isl_int value)
5441 return map_bound(map, type, pos, value, 0);
5444 __isl_give isl_map *isl_map_upper_bound(__isl_take isl_map *map,
5445 enum isl_dim_type type, unsigned pos, isl_int value)
5447 return map_bound(map, type, pos, value, 1);
5450 __isl_give isl_set *isl_set_lower_bound(__isl_take isl_set *set,
5451 enum isl_dim_type type, unsigned pos, isl_int value)
5453 return isl_map_lower_bound(set, type, pos, value);
5456 __isl_give isl_set *isl_set_upper_bound(__isl_take isl_set *set,
5457 enum isl_dim_type type, unsigned pos, isl_int value)
5459 return isl_map_upper_bound(set, type, pos, value);
5462 struct isl_set *isl_set_lower_bound_dim(struct isl_set *set, unsigned dim,
5467 set = isl_set_cow(set);
5471 isl_assert(set->ctx, dim < isl_set_n_dim(set), goto error);
5472 for (i = 0; i < set->n; ++i) {
5473 set->p[i] = isl_basic_set_lower_bound_dim(set->p[i], dim, value);
5483 struct isl_map *isl_map_reverse(struct isl_map *map)
5487 map = isl_map_cow(map);
5491 map->dim = isl_space_reverse(map->dim);
5494 for (i = 0; i < map->n; ++i) {
5495 map->p[i] = isl_basic_map_reverse(map->p[i]);
5499 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
5506 static struct isl_map *isl_basic_map_partial_lexopt(
5507 struct isl_basic_map *bmap, struct isl_basic_set *dom,
5508 struct isl_set **empty, int max)
5512 if (bmap->ctx->opt->pip == ISL_PIP_PIP)
5513 return isl_pip_basic_map_lexopt(bmap, dom, empty, max);
5515 return isl_tab_basic_map_partial_lexopt(bmap, dom, empty, max);
5517 isl_basic_map_free(bmap);
5518 isl_basic_set_free(dom);
5524 struct isl_map *isl_basic_map_partial_lexmax(
5525 struct isl_basic_map *bmap, struct isl_basic_set *dom,
5526 struct isl_set **empty)
5528 return isl_basic_map_partial_lexopt(bmap, dom, empty, 1);
5531 struct isl_map *isl_basic_map_partial_lexmin(
5532 struct isl_basic_map *bmap, struct isl_basic_set *dom,
5533 struct isl_set **empty)
5535 return isl_basic_map_partial_lexopt(bmap, dom, empty, 0);
5538 struct isl_set *isl_basic_set_partial_lexmin(
5539 struct isl_basic_set *bset, struct isl_basic_set *dom,
5540 struct isl_set **empty)
5542 return (struct isl_set *)
5543 isl_basic_map_partial_lexmin((struct isl_basic_map *)bset,
5547 struct isl_set *isl_basic_set_partial_lexmax(
5548 struct isl_basic_set *bset, struct isl_basic_set *dom,
5549 struct isl_set **empty)
5551 return (struct isl_set *)
5552 isl_basic_map_partial_lexmax((struct isl_basic_map *)bset,
5556 __isl_give isl_pw_multi_aff *isl_basic_map_partial_lexmin_pw_multi_aff(
5557 __isl_take isl_basic_map *bmap, __isl_take isl_basic_set *dom,
5558 __isl_give isl_set **empty)
5560 return isl_basic_map_partial_lexopt_pw_multi_aff(bmap, dom, empty, 0);
5563 __isl_give isl_pw_multi_aff *isl_basic_map_partial_lexmax_pw_multi_aff(
5564 __isl_take isl_basic_map *bmap, __isl_take isl_basic_set *dom,
5565 __isl_give isl_set **empty)
5567 return isl_basic_map_partial_lexopt_pw_multi_aff(bmap, dom, empty, 1);
5570 __isl_give isl_pw_multi_aff *isl_basic_set_partial_lexmin_pw_multi_aff(
5571 __isl_take isl_basic_set *bset, __isl_take isl_basic_set *dom,
5572 __isl_give isl_set **empty)
5574 return isl_basic_map_partial_lexmin_pw_multi_aff(bset, dom, empty);
5577 __isl_give isl_pw_multi_aff *isl_basic_set_partial_lexmax_pw_multi_aff(
5578 __isl_take isl_basic_set *bset, __isl_take isl_basic_set *dom,
5579 __isl_give isl_set **empty)
5581 return isl_basic_map_partial_lexmax_pw_multi_aff(bset, dom, empty);
5584 __isl_give isl_pw_multi_aff *isl_basic_map_lexopt_pw_multi_aff(
5585 __isl_take isl_basic_map *bmap, int max)
5587 isl_basic_set *dom = NULL;
5588 isl_space *dom_space;
5592 dom_space = isl_space_domain(isl_space_copy(bmap->dim));
5593 dom = isl_basic_set_universe(dom_space);
5594 return isl_basic_map_partial_lexopt_pw_multi_aff(bmap, dom, NULL, max);
5596 isl_basic_map_free(bmap);
5600 __isl_give isl_pw_multi_aff *isl_basic_map_lexmin_pw_multi_aff(
5601 __isl_take isl_basic_map *bmap)
5603 return isl_basic_map_lexopt_pw_multi_aff(bmap, 0);
5606 /* Given a basic map "bmap", compute the lexicographically minimal
5607 * (or maximal) image element for each domain element in dom.
5608 * Set *empty to those elements in dom that do not have an image element.
5610 * We first make sure the basic sets in dom are disjoint and then
5611 * simply collect the results over each of the basic sets separately.
5612 * We could probably improve the efficiency a bit by moving the union
5613 * domain down into the parametric integer programming.
5615 static __isl_give isl_map *basic_map_partial_lexopt(
5616 __isl_take isl_basic_map *bmap, __isl_take isl_set *dom,
5617 __isl_give isl_set **empty, int max)
5620 struct isl_map *res;
5622 dom = isl_set_make_disjoint(dom);
5626 if (isl_set_plain_is_empty(dom)) {
5627 res = isl_map_empty_like_basic_map(bmap);
5628 *empty = isl_set_empty_like(dom);
5630 isl_basic_map_free(bmap);
5634 res = isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap),
5635 isl_basic_set_copy(dom->p[0]), empty, max);
5637 for (i = 1; i < dom->n; ++i) {
5638 struct isl_map *res_i;
5639 struct isl_set *empty_i;
5641 res_i = isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap),
5642 isl_basic_set_copy(dom->p[i]), &empty_i, max);
5644 res = isl_map_union_disjoint(res, res_i);
5645 *empty = isl_set_union_disjoint(*empty, empty_i);
5649 isl_basic_map_free(bmap);
5654 isl_basic_map_free(bmap);
5658 /* Given a map "map", compute the lexicographically minimal
5659 * (or maximal) image element for each domain element in dom.
5660 * Set *empty to those elements in dom that do not have an image element.
5662 * We first compute the lexicographically minimal or maximal element
5663 * in the first basic map. This results in a partial solution "res"
5664 * and a subset "todo" of dom that still need to be handled.
5665 * We then consider each of the remaining maps in "map" and successively
5666 * improve both "res" and "todo".
5668 * Let res^k and todo^k be the results after k steps and let i = k + 1.
5669 * Assume we are computing the lexicographical maximum.
5670 * We first compute the lexicographically maximal element in basic map i.
5671 * This results in a partial solution res_i and a subset todo_i.
5672 * Then we combine these results with those obtain for the first k basic maps
5673 * to obtain a result that is valid for the first k+1 basic maps.
5674 * In particular, the set where there is no solution is the set where
5675 * there is no solution for the first k basic maps and also no solution
5676 * for the ith basic map, i.e.,
5678 * todo^i = todo^k * todo_i
5680 * On dom(res^k) * dom(res_i), we need to pick the larger of the two
5681 * solutions, arbitrarily breaking ties in favor of res^k.
5682 * That is, when res^k(a) >= res_i(a), we pick res^k and
5683 * when res^k(a) < res_i(a), we pick res_i. (Here, ">=" and "<" denote
5684 * the lexicographic order.)
5685 * In practice, we compute
5687 * res^k * (res_i . "<=")
5691 * res_i * (res^k . "<")
5693 * Finally, we consider the symmetric difference of dom(res^k) and dom(res_i),
5694 * where only one of res^k and res_i provides a solution and we simply pick
5701 * Note that we only compute these intersections when dom(res^k) intersects
5702 * dom(res_i). Otherwise, the only effect of these intersections is to
5703 * potentially break up res^k and res_i into smaller pieces.
5704 * We want to avoid such splintering as much as possible.
5705 * In fact, an earlier implementation of this function would look for
5706 * better results in the domain of res^k and for extra results in todo^k,
5707 * but this would always result in a splintering according to todo^k,
5708 * even when the domain of basic map i is disjoint from the domains of
5709 * the previous basic maps.
5711 static __isl_give isl_map *isl_map_partial_lexopt_aligned(
5712 __isl_take isl_map *map, __isl_take isl_set *dom,
5713 __isl_give isl_set **empty, int max)
5716 struct isl_map *res;
5717 struct isl_set *todo;
5722 if (isl_map_plain_is_empty(map)) {
5730 res = basic_map_partial_lexopt(isl_basic_map_copy(map->p[0]),
5731 isl_set_copy(dom), &todo, max);
5733 for (i = 1; i < map->n; ++i) {
5737 isl_space *dim = isl_space_range(isl_map_get_space(res));
5739 res_i = basic_map_partial_lexopt(isl_basic_map_copy(map->p[i]),
5740 isl_set_copy(dom), &todo_i, max);
5743 lt = isl_map_lex_lt(isl_space_copy(dim));
5744 le = isl_map_lex_le(dim);
5746 lt = isl_map_lex_gt(isl_space_copy(dim));
5747 le = isl_map_lex_ge(dim);
5749 lt = isl_map_apply_range(isl_map_copy(res), lt);
5750 lt = isl_map_intersect(lt, isl_map_copy(res_i));
5751 le = isl_map_apply_range(isl_map_copy(res_i), le);
5752 le = isl_map_intersect(le, isl_map_copy(res));
5754 if (!isl_map_is_empty(lt) || !isl_map_is_empty(le)) {
5755 res = isl_map_intersect_domain(res,
5756 isl_set_copy(todo_i));
5757 res_i = isl_map_intersect_domain(res_i,
5758 isl_set_copy(todo));
5761 res = isl_map_union_disjoint(res, res_i);
5762 res = isl_map_union_disjoint(res, lt);
5763 res = isl_map_union_disjoint(res, le);
5765 todo = isl_set_intersect(todo, todo_i);
5785 /* Given a map "map", compute the lexicographically minimal
5786 * (or maximal) image element for each domain element in dom.
5787 * Set *empty to those elements in dom that do not have an image element.
5789 * Align parameters if needed and then call isl_map_partial_lexopt_aligned.
5791 static __isl_give isl_map *isl_map_partial_lexopt(
5792 __isl_take isl_map *map, __isl_take isl_set *dom,
5793 __isl_give isl_set **empty, int max)
5797 if (isl_space_match(map->dim, isl_dim_param, dom->dim, isl_dim_param))
5798 return isl_map_partial_lexopt_aligned(map, dom, empty, max);
5799 if (!isl_space_has_named_params(map->dim) ||
5800 !isl_space_has_named_params(dom->dim))
5801 isl_die(map->ctx, isl_error_invalid,
5802 "unaligned unnamed parameters", goto error);
5803 map = isl_map_align_params(map, isl_map_get_space(dom));
5804 dom = isl_map_align_params(dom, isl_map_get_space(map));
5805 return isl_map_partial_lexopt_aligned(map, dom, empty, max);
5814 __isl_give isl_map *isl_map_partial_lexmax(
5815 __isl_take isl_map *map, __isl_take isl_set *dom,
5816 __isl_give isl_set **empty)
5818 return isl_map_partial_lexopt(map, dom, empty, 1);
5821 __isl_give isl_map *isl_map_partial_lexmin(
5822 __isl_take isl_map *map, __isl_take isl_set *dom,
5823 __isl_give isl_set **empty)
5825 return isl_map_partial_lexopt(map, dom, empty, 0);
5828 __isl_give isl_set *isl_set_partial_lexmin(
5829 __isl_take isl_set *set, __isl_take isl_set *dom,
5830 __isl_give isl_set **empty)
5832 return (struct isl_set *)
5833 isl_map_partial_lexmin((struct isl_map *)set,
5837 __isl_give isl_set *isl_set_partial_lexmax(
5838 __isl_take isl_set *set, __isl_take isl_set *dom,
5839 __isl_give isl_set **empty)
5841 return (struct isl_set *)
5842 isl_map_partial_lexmax((struct isl_map *)set,
5846 __isl_give isl_map *isl_basic_map_lexopt(__isl_take isl_basic_map *bmap, int max)
5848 struct isl_basic_set *dom = NULL;
5853 dom_dim = isl_space_domain(isl_space_copy(bmap->dim));
5854 dom = isl_basic_set_universe(dom_dim);
5855 return isl_basic_map_partial_lexopt(bmap, dom, NULL, max);
5857 isl_basic_map_free(bmap);
5861 __isl_give isl_map *isl_basic_map_lexmin(__isl_take isl_basic_map *bmap)
5863 return isl_basic_map_lexopt(bmap, 0);
5866 __isl_give isl_map *isl_basic_map_lexmax(__isl_take isl_basic_map *bmap)
5868 return isl_basic_map_lexopt(bmap, 1);
5871 __isl_give isl_set *isl_basic_set_lexmin(__isl_take isl_basic_set *bset)
5873 return (isl_set *)isl_basic_map_lexmin((isl_basic_map *)bset);
5876 __isl_give isl_set *isl_basic_set_lexmax(__isl_take isl_basic_set *bset)
5878 return (isl_set *)isl_basic_map_lexmax((isl_basic_map *)bset);
5881 __isl_give isl_map *isl_map_lexopt(__isl_take isl_map *map, int max)
5883 struct isl_set *dom = NULL;
5888 dom_dim = isl_space_domain(isl_space_copy(map->dim));
5889 dom = isl_set_universe(dom_dim);
5890 return isl_map_partial_lexopt(map, dom, NULL, max);
5896 __isl_give isl_map *isl_map_lexmin(__isl_take isl_map *map)
5898 return isl_map_lexopt(map, 0);
5901 __isl_give isl_map *isl_map_lexmax(__isl_take isl_map *map)
5903 return isl_map_lexopt(map, 1);
5906 __isl_give isl_set *isl_set_lexmin(__isl_take isl_set *set)
5908 return (isl_set *)isl_map_lexmin((isl_map *)set);
5911 __isl_give isl_set *isl_set_lexmax(__isl_take isl_set *set)
5913 return (isl_set *)isl_map_lexmax((isl_map *)set);
5916 /* Extract the first and only affine expression from list
5917 * and then add it to *pwaff with the given dom.
5918 * This domain is known to be disjoint from other domains
5919 * because of the way isl_basic_map_foreach_lexmax works.
5921 static int update_dim_opt(__isl_take isl_basic_set *dom,
5922 __isl_take isl_aff_list *list, void *user)
5924 isl_ctx *ctx = isl_basic_set_get_ctx(dom);
5926 isl_pw_aff **pwaff = user;
5927 isl_pw_aff *pwaff_i;
5929 if (isl_aff_list_n_aff(list) != 1)
5930 isl_die(ctx, isl_error_internal,
5931 "expecting single element list", goto error);
5933 aff = isl_aff_list_get_aff(list, 0);
5934 pwaff_i = isl_pw_aff_alloc(isl_set_from_basic_set(dom), aff);
5936 *pwaff = isl_pw_aff_add_disjoint(*pwaff, pwaff_i);
5938 isl_aff_list_free(list);
5942 isl_basic_set_free(dom);
5943 isl_aff_list_free(list);
5947 /* Given a basic map with one output dimension, compute the minimum or
5948 * maximum of that dimension as an isl_pw_aff.
5950 * The isl_pw_aff is constructed by having isl_basic_map_foreach_lexopt
5951 * call update_dim_opt on each leaf of the result.
5953 static __isl_give isl_pw_aff *basic_map_dim_opt(__isl_keep isl_basic_map *bmap,
5956 isl_space *dim = isl_basic_map_get_space(bmap);
5960 dim = isl_space_from_domain(isl_space_domain(dim));
5961 dim = isl_space_add_dims(dim, isl_dim_out, 1);
5962 pwaff = isl_pw_aff_empty(dim);
5964 r = isl_basic_map_foreach_lexopt(bmap, max, &update_dim_opt, &pwaff);
5966 return isl_pw_aff_free(pwaff);
5971 /* Compute the minimum or maximum of the given output dimension
5972 * as a function of the parameters and the input dimensions,
5973 * but independently of the other output dimensions.
5975 * We first project out the other output dimension and then compute
5976 * the "lexicographic" maximum in each basic map, combining the results
5977 * using isl_pw_aff_union_max.
5979 static __isl_give isl_pw_aff *map_dim_opt(__isl_take isl_map *map, int pos,
5986 n_out = isl_map_dim(map, isl_dim_out);
5987 map = isl_map_project_out(map, isl_dim_out, pos + 1, n_out - (pos + 1));
5988 map = isl_map_project_out(map, isl_dim_out, 0, pos);
5993 isl_space *dim = isl_map_get_space(map);
5994 dim = isl_space_domain(isl_space_from_range(dim));
5996 return isl_pw_aff_empty(dim);
5999 pwaff = basic_map_dim_opt(map->p[0], max);
6000 for (i = 1; i < map->n; ++i) {
6001 isl_pw_aff *pwaff_i;
6003 pwaff_i = basic_map_dim_opt(map->p[i], max);
6004 pwaff = isl_pw_aff_union_opt(pwaff, pwaff_i, max);
6012 /* Compute the maximum of the given output dimension as a function of the
6013 * parameters and input dimensions, but independently of
6014 * the other output dimensions.
6016 __isl_give isl_pw_aff *isl_map_dim_max(__isl_take isl_map *map, int pos)
6018 return map_dim_opt(map, pos, 1);
6021 /* Compute the minimum or maximum of the given set dimension
6022 * as a function of the parameters,
6023 * but independently of the other set dimensions.
6025 static __isl_give isl_pw_aff *set_dim_opt(__isl_take isl_set *set, int pos,
6028 return map_dim_opt(set, pos, max);
6031 /* Compute the maximum of the given set dimension as a function of the
6032 * parameters, but independently of the other set dimensions.
6034 __isl_give isl_pw_aff *isl_set_dim_max(__isl_take isl_set *set, int pos)
6036 return set_dim_opt(set, pos, 1);
6039 /* Compute the minimum of the given set dimension as a function of the
6040 * parameters, but independently of the other set dimensions.
6042 __isl_give isl_pw_aff *isl_set_dim_min(__isl_take isl_set *set, int pos)
6044 return set_dim_opt(set, pos, 0);
6047 /* Apply a preimage specified by "mat" on the parameters of "bset".
6048 * bset is assumed to have only parameters and divs.
6050 static struct isl_basic_set *basic_set_parameter_preimage(
6051 struct isl_basic_set *bset, struct isl_mat *mat)
6058 bset->dim = isl_space_cow(bset->dim);
6062 nparam = isl_basic_set_dim(bset, isl_dim_param);
6064 isl_assert(bset->ctx, mat->n_row == 1 + nparam, goto error);
6066 bset->dim->nparam = 0;
6067 bset->dim->n_out = nparam;
6068 bset = isl_basic_set_preimage(bset, mat);
6070 bset->dim->nparam = bset->dim->n_out;
6071 bset->dim->n_out = 0;
6076 isl_basic_set_free(bset);
6080 /* Apply a preimage specified by "mat" on the parameters of "set".
6081 * set is assumed to have only parameters and divs.
6083 static struct isl_set *set_parameter_preimage(
6084 struct isl_set *set, struct isl_mat *mat)
6086 isl_space *dim = NULL;
6092 dim = isl_space_copy(set->dim);
6093 dim = isl_space_cow(dim);
6097 nparam = isl_set_dim(set, isl_dim_param);
6099 isl_assert(set->ctx, mat->n_row == 1 + nparam, goto error);
6102 dim->n_out = nparam;
6103 isl_set_reset_space(set, dim);
6104 set = isl_set_preimage(set, mat);
6107 dim = isl_space_copy(set->dim);
6108 dim = isl_space_cow(dim);
6111 dim->nparam = dim->n_out;
6113 isl_set_reset_space(set, dim);
6116 isl_space_free(dim);
6123 /* Intersect the basic set "bset" with the affine space specified by the
6124 * equalities in "eq".
6126 static struct isl_basic_set *basic_set_append_equalities(
6127 struct isl_basic_set *bset, struct isl_mat *eq)
6135 bset = isl_basic_set_extend_space(bset, isl_space_copy(bset->dim), 0,
6140 len = 1 + isl_space_dim(bset->dim, isl_dim_all) + bset->extra;
6141 for (i = 0; i < eq->n_row; ++i) {
6142 k = isl_basic_set_alloc_equality(bset);
6145 isl_seq_cpy(bset->eq[k], eq->row[i], eq->n_col);
6146 isl_seq_clr(bset->eq[k] + eq->n_col, len - eq->n_col);
6150 bset = isl_basic_set_gauss(bset, NULL);
6151 bset = isl_basic_set_finalize(bset);
6156 isl_basic_set_free(bset);
6160 /* Intersect the set "set" with the affine space specified by the
6161 * equalities in "eq".
6163 static struct isl_set *set_append_equalities(struct isl_set *set,
6171 for (i = 0; i < set->n; ++i) {
6172 set->p[i] = basic_set_append_equalities(set->p[i],
6185 /* Project the given basic set onto its parameter domain, possibly introducing
6186 * new, explicit, existential variables in the constraints.
6187 * The input has parameters and (possibly implicit) existential variables.
6188 * The output has the same parameters, but only
6189 * explicit existentially quantified variables.
6191 * The actual projection is performed by pip, but pip doesn't seem
6192 * to like equalities very much, so we first remove the equalities
6193 * among the parameters by performing a variable compression on
6194 * the parameters. Afterward, an inverse transformation is performed
6195 * and the equalities among the parameters are inserted back in.
6197 static struct isl_set *parameter_compute_divs(struct isl_basic_set *bset)
6201 struct isl_mat *T, *T2;
6202 struct isl_set *set;
6203 unsigned nparam, n_div;
6205 bset = isl_basic_set_cow(bset);
6209 if (bset->n_eq == 0)
6210 return isl_basic_set_lexmin(bset);
6212 isl_basic_set_gauss(bset, NULL);
6214 nparam = isl_basic_set_dim(bset, isl_dim_param);
6215 n_div = isl_basic_set_dim(bset, isl_dim_div);
6217 for (i = 0, j = n_div - 1; i < bset->n_eq && j >= 0; --j) {
6218 if (!isl_int_is_zero(bset->eq[i][1 + nparam + j]))
6221 if (i == bset->n_eq)
6222 return isl_basic_set_lexmin(bset);
6224 eq = isl_mat_sub_alloc6(bset->ctx, bset->eq, i, bset->n_eq - i,
6226 eq = isl_mat_cow(eq);
6227 T = isl_mat_variable_compression(isl_mat_copy(eq), &T2);
6228 if (T && T->n_col == 0) {
6232 bset = isl_basic_set_set_to_empty(bset);
6233 return isl_set_from_basic_set(bset);
6235 bset = basic_set_parameter_preimage(bset, T);
6237 set = isl_basic_set_lexmin(bset);
6238 set = set_parameter_preimage(set, T2);
6239 set = set_append_equalities(set, eq);
6243 /* Compute an explicit representation for all the existentially
6244 * quantified variables.
6245 * The input and output dimensions are first turned into parameters.
6246 * compute_divs then returns a map with the same parameters and
6247 * no input or output dimensions and the dimension specification
6248 * is reset to that of the input.
6250 static struct isl_map *compute_divs(struct isl_basic_map *bmap)
6252 struct isl_basic_set *bset;
6253 struct isl_set *set;
6254 struct isl_map *map;
6255 isl_space *dim, *orig_dim = NULL;
6260 bmap = isl_basic_map_cow(bmap);
6264 nparam = isl_basic_map_dim(bmap, isl_dim_param);
6265 n_in = isl_basic_map_dim(bmap, isl_dim_in);
6266 n_out = isl_basic_map_dim(bmap, isl_dim_out);
6267 dim = isl_space_set_alloc(bmap->ctx, nparam + n_in + n_out, 0);
6271 orig_dim = bmap->dim;
6273 bset = (struct isl_basic_set *)bmap;
6275 set = parameter_compute_divs(bset);
6276 map = (struct isl_map *)set;
6277 map = isl_map_reset_space(map, orig_dim);
6281 isl_basic_map_free(bmap);
6285 int isl_basic_map_divs_known(__isl_keep isl_basic_map *bmap)
6293 off = isl_space_dim(bmap->dim, isl_dim_all);
6294 for (i = 0; i < bmap->n_div; ++i) {
6295 if (isl_int_is_zero(bmap->div[i][0]))
6297 isl_assert(bmap->ctx, isl_int_is_zero(bmap->div[i][1+1+off+i]),
6303 static int map_divs_known(__isl_keep isl_map *map)
6310 for (i = 0; i < map->n; ++i) {
6311 int known = isl_basic_map_divs_known(map->p[i]);
6319 /* If bmap contains any unknown divs, then compute explicit
6320 * expressions for them. However, this computation may be
6321 * quite expensive, so first try to remove divs that aren't
6324 struct isl_map *isl_basic_map_compute_divs(struct isl_basic_map *bmap)
6327 struct isl_map *map;
6329 known = isl_basic_map_divs_known(bmap);
6333 return isl_map_from_basic_map(bmap);
6335 bmap = isl_basic_map_drop_redundant_divs(bmap);
6337 known = isl_basic_map_divs_known(bmap);
6341 return isl_map_from_basic_map(bmap);
6343 map = compute_divs(bmap);
6346 isl_basic_map_free(bmap);
6350 struct isl_map *isl_map_compute_divs(struct isl_map *map)
6354 struct isl_map *res;
6361 known = map_divs_known(map);
6369 res = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[0]));
6370 for (i = 1 ; i < map->n; ++i) {
6372 r2 = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[i]));
6373 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT))
6374 res = isl_map_union_disjoint(res, r2);
6376 res = isl_map_union(res, r2);
6383 struct isl_set *isl_basic_set_compute_divs(struct isl_basic_set *bset)
6385 return (struct isl_set *)
6386 isl_basic_map_compute_divs((struct isl_basic_map *)bset);
6389 struct isl_set *isl_set_compute_divs(struct isl_set *set)
6391 return (struct isl_set *)
6392 isl_map_compute_divs((struct isl_map *)set);
6395 struct isl_set *isl_map_domain(struct isl_map *map)
6398 struct isl_set *set;
6403 map = isl_map_cow(map);
6407 set = (struct isl_set *)map;
6408 set->dim = isl_space_domain(set->dim);
6411 for (i = 0; i < map->n; ++i) {
6412 set->p[i] = isl_basic_map_domain(map->p[i]);
6416 ISL_F_CLR(set, ISL_MAP_DISJOINT);
6417 ISL_F_CLR(set, ISL_SET_NORMALIZED);
6424 static __isl_give isl_map *map_union_disjoint(__isl_take isl_map *map1,
6425 __isl_take isl_map *map2)
6429 struct isl_map *map = NULL;
6443 isl_assert(map1->ctx, isl_space_is_equal(map1->dim, map2->dim), goto error);
6445 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
6446 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
6447 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
6449 map = isl_map_alloc_space(isl_space_copy(map1->dim),
6450 map1->n + map2->n, flags);
6453 for (i = 0; i < map1->n; ++i) {
6454 map = isl_map_add_basic_map(map,
6455 isl_basic_map_copy(map1->p[i]));
6459 for (i = 0; i < map2->n; ++i) {
6460 map = isl_map_add_basic_map(map,
6461 isl_basic_map_copy(map2->p[i]));
6475 __isl_give isl_map *isl_map_union_disjoint(__isl_take isl_map *map1,
6476 __isl_take isl_map *map2)
6478 return isl_map_align_params_map_map_and(map1, map2, &map_union_disjoint);
6481 struct isl_map *isl_map_union(struct isl_map *map1, struct isl_map *map2)
6483 map1 = isl_map_union_disjoint(map1, map2);
6487 ISL_F_CLR(map1, ISL_MAP_DISJOINT);
6491 struct isl_set *isl_set_union_disjoint(
6492 struct isl_set *set1, struct isl_set *set2)
6494 return (struct isl_set *)
6495 isl_map_union_disjoint(
6496 (struct isl_map *)set1, (struct isl_map *)set2);
6499 struct isl_set *isl_set_union(struct isl_set *set1, struct isl_set *set2)
6501 return (struct isl_set *)
6502 isl_map_union((struct isl_map *)set1, (struct isl_map *)set2);
6505 static __isl_give isl_map *map_intersect_range(__isl_take isl_map *map,
6506 __isl_take isl_set *set)
6509 struct isl_map *result;
6515 if (!isl_space_match(map->dim, isl_dim_param, set->dim, isl_dim_param))
6516 isl_die(set->ctx, isl_error_invalid,
6517 "parameters don't match", goto error);
6519 if (isl_space_dim(set->dim, isl_dim_set) != 0 &&
6520 !isl_map_compatible_range(map, set))
6521 isl_die(set->ctx, isl_error_invalid,
6522 "incompatible spaces", goto error);
6524 if (isl_set_plain_is_universe(set)) {
6529 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT) &&
6530 ISL_F_ISSET(set, ISL_MAP_DISJOINT))
6531 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
6533 result = isl_map_alloc_space(isl_space_copy(map->dim),
6534 map->n * set->n, flags);
6537 for (i = 0; i < map->n; ++i)
6538 for (j = 0; j < set->n; ++j) {
6539 result = isl_map_add_basic_map(result,
6540 isl_basic_map_intersect_range(
6541 isl_basic_map_copy(map->p[i]),
6542 isl_basic_set_copy(set->p[j])));
6555 __isl_give isl_map *isl_map_intersect_range(__isl_take isl_map *map,
6556 __isl_take isl_set *set)
6558 return isl_map_align_params_map_map_and(map, set, &map_intersect_range);
6561 struct isl_map *isl_map_intersect_domain(
6562 struct isl_map *map, struct isl_set *set)
6564 return isl_map_reverse(
6565 isl_map_intersect_range(isl_map_reverse(map), set));
6568 static __isl_give isl_map *map_apply_domain(__isl_take isl_map *map1,
6569 __isl_take isl_map *map2)
6573 map1 = isl_map_reverse(map1);
6574 map1 = isl_map_apply_range(map1, map2);
6575 return isl_map_reverse(map1);
6582 __isl_give isl_map *isl_map_apply_domain(__isl_take isl_map *map1,
6583 __isl_take isl_map *map2)
6585 return isl_map_align_params_map_map_and(map1, map2, &map_apply_domain);
6588 static __isl_give isl_map *map_apply_range(__isl_take isl_map *map1,
6589 __isl_take isl_map *map2)
6591 isl_space *dim_result;
6592 struct isl_map *result;
6598 dim_result = isl_space_join(isl_space_copy(map1->dim),
6599 isl_space_copy(map2->dim));
6601 result = isl_map_alloc_space(dim_result, map1->n * map2->n, 0);
6604 for (i = 0; i < map1->n; ++i)
6605 for (j = 0; j < map2->n; ++j) {
6606 result = isl_map_add_basic_map(result,
6607 isl_basic_map_apply_range(
6608 isl_basic_map_copy(map1->p[i]),
6609 isl_basic_map_copy(map2->p[j])));
6615 if (result && result->n <= 1)
6616 ISL_F_SET(result, ISL_MAP_DISJOINT);
6624 __isl_give isl_map *isl_map_apply_range(__isl_take isl_map *map1,
6625 __isl_take isl_map *map2)
6627 return isl_map_align_params_map_map_and(map1, map2, &map_apply_range);
6631 * returns range - domain
6633 struct isl_basic_set *isl_basic_map_deltas(struct isl_basic_map *bmap)
6635 isl_space *dims, *target_dim;
6636 struct isl_basic_set *bset;
6643 isl_assert(bmap->ctx, isl_space_tuple_match(bmap->dim, isl_dim_in,
6644 bmap->dim, isl_dim_out),
6646 target_dim = isl_space_domain(isl_basic_map_get_space(bmap));
6647 dim = isl_basic_map_n_in(bmap);
6648 nparam = isl_basic_map_n_param(bmap);
6649 bset = isl_basic_set_from_basic_map(bmap);
6650 bset = isl_basic_set_cow(bset);
6651 dims = isl_basic_set_get_space(bset);
6652 dims = isl_space_add_dims(dims, isl_dim_set, dim);
6653 bset = isl_basic_set_extend_space(bset, dims, 0, dim, 0);
6654 bset = isl_basic_set_swap_vars(bset, 2*dim);
6655 for (i = 0; i < dim; ++i) {
6656 int j = isl_basic_map_alloc_equality(
6657 (struct isl_basic_map *)bset);
6660 isl_seq_clr(bset->eq[j], 1 + isl_basic_set_total_dim(bset));
6661 isl_int_set_si(bset->eq[j][1+nparam+i], 1);
6662 isl_int_set_si(bset->eq[j][1+nparam+dim+i], 1);
6663 isl_int_set_si(bset->eq[j][1+nparam+2*dim+i], -1);
6665 bset = isl_basic_set_project_out(bset, isl_dim_set, dim, 2*dim);
6666 bset = isl_basic_set_reset_space(bset, target_dim);
6669 isl_basic_map_free(bmap);
6674 * returns range - domain
6676 __isl_give isl_set *isl_map_deltas(__isl_take isl_map *map)
6680 struct isl_set *result;
6685 isl_assert(map->ctx, isl_space_tuple_match(map->dim, isl_dim_in,
6686 map->dim, isl_dim_out),
6688 dim = isl_map_get_space(map);
6689 dim = isl_space_domain(dim);
6690 result = isl_set_alloc_space(dim, map->n, 0);
6693 for (i = 0; i < map->n; ++i)
6694 result = isl_set_add_basic_set(result,
6695 isl_basic_map_deltas(isl_basic_map_copy(map->p[i])));
6704 * returns [domain -> range] -> range - domain
6706 __isl_give isl_basic_map *isl_basic_map_deltas_map(
6707 __isl_take isl_basic_map *bmap)
6711 isl_basic_map *domain;
6715 if (!isl_space_tuple_match(bmap->dim, isl_dim_in, bmap->dim, isl_dim_out))
6716 isl_die(bmap->ctx, isl_error_invalid,
6717 "domain and range don't match", goto error);
6719 nparam = isl_basic_map_dim(bmap, isl_dim_param);
6720 n = isl_basic_map_dim(bmap, isl_dim_in);
6722 dim = isl_space_from_range(isl_space_domain(isl_basic_map_get_space(bmap)));
6723 domain = isl_basic_map_universe(dim);
6725 bmap = isl_basic_map_from_domain(isl_basic_map_wrap(bmap));
6726 bmap = isl_basic_map_apply_range(bmap, domain);
6727 bmap = isl_basic_map_extend_constraints(bmap, n, 0);
6729 total = isl_basic_map_total_dim(bmap);
6731 for (i = 0; i < n; ++i) {
6732 k = isl_basic_map_alloc_equality(bmap);
6735 isl_seq_clr(bmap->eq[k], 1 + total);
6736 isl_int_set_si(bmap->eq[k][1 + nparam + i], 1);
6737 isl_int_set_si(bmap->eq[k][1 + nparam + n + i], -1);
6738 isl_int_set_si(bmap->eq[k][1 + nparam + n + n + i], 1);
6741 bmap = isl_basic_map_gauss(bmap, NULL);
6742 return isl_basic_map_finalize(bmap);
6744 isl_basic_map_free(bmap);
6749 * returns [domain -> range] -> range - domain
6751 __isl_give isl_map *isl_map_deltas_map(__isl_take isl_map *map)
6754 isl_space *domain_dim;
6759 if (!isl_space_tuple_match(map->dim, isl_dim_in, map->dim, isl_dim_out))
6760 isl_die(map->ctx, isl_error_invalid,
6761 "domain and range don't match", goto error);
6763 map = isl_map_cow(map);
6767 domain_dim = isl_space_from_range(isl_space_domain(isl_map_get_space(map)));
6768 map->dim = isl_space_from_domain(isl_space_wrap(map->dim));
6769 map->dim = isl_space_join(map->dim, domain_dim);
6772 for (i = 0; i < map->n; ++i) {
6773 map->p[i] = isl_basic_map_deltas_map(map->p[i]);
6777 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
6784 __isl_give struct isl_basic_map *basic_map_identity(__isl_take isl_space *dims)
6786 struct isl_basic_map *bmap;
6794 nparam = dims->nparam;
6796 bmap = isl_basic_map_alloc_space(dims, 0, dim, 0);
6800 for (i = 0; i < dim; ++i) {
6801 int j = isl_basic_map_alloc_equality(bmap);
6804 isl_seq_clr(bmap->eq[j], 1 + isl_basic_map_total_dim(bmap));
6805 isl_int_set_si(bmap->eq[j][1+nparam+i], 1);
6806 isl_int_set_si(bmap->eq[j][1+nparam+dim+i], -1);
6808 return isl_basic_map_finalize(bmap);
6810 isl_basic_map_free(bmap);
6814 __isl_give isl_basic_map *isl_basic_map_identity(__isl_take isl_space *dim)
6818 if (dim->n_in != dim->n_out)
6819 isl_die(dim->ctx, isl_error_invalid,
6820 "number of input and output dimensions needs to be "
6821 "the same", goto error);
6822 return basic_map_identity(dim);
6824 isl_space_free(dim);
6828 struct isl_basic_map *isl_basic_map_identity_like(struct isl_basic_map *model)
6830 if (!model || !model->dim)
6832 return isl_basic_map_identity(isl_space_copy(model->dim));
6835 __isl_give isl_map *isl_map_identity(__isl_take isl_space *dim)
6837 return isl_map_from_basic_map(isl_basic_map_identity(dim));
6840 struct isl_map *isl_map_identity_like(struct isl_map *model)
6842 if (!model || !model->dim)
6844 return isl_map_identity(isl_space_copy(model->dim));
6847 struct isl_map *isl_map_identity_like_basic_map(struct isl_basic_map *model)
6849 if (!model || !model->dim)
6851 return isl_map_identity(isl_space_copy(model->dim));
6854 __isl_give isl_map *isl_set_identity(__isl_take isl_set *set)
6856 isl_space *dim = isl_set_get_space(set);
6858 id = isl_map_identity(isl_space_map_from_set(dim));
6859 return isl_map_intersect_range(id, set);
6862 /* Construct a basic set with all set dimensions having only non-negative
6865 __isl_give isl_basic_set *isl_basic_set_positive_orthant(
6866 __isl_take isl_space *space)
6871 struct isl_basic_set *bset;
6875 nparam = space->nparam;
6877 bset = isl_basic_set_alloc_space(space, 0, 0, dim);
6880 for (i = 0; i < dim; ++i) {
6881 int k = isl_basic_set_alloc_inequality(bset);
6884 isl_seq_clr(bset->ineq[k], 1 + isl_basic_set_total_dim(bset));
6885 isl_int_set_si(bset->ineq[k][1 + nparam + i], 1);
6889 isl_basic_set_free(bset);
6893 /* Construct the half-space x_pos >= 0.
6895 static __isl_give isl_basic_set *nonneg_halfspace(__isl_take isl_space *dim,
6899 isl_basic_set *nonneg;
6901 nonneg = isl_basic_set_alloc_space(dim, 0, 0, 1);
6902 k = isl_basic_set_alloc_inequality(nonneg);
6905 isl_seq_clr(nonneg->ineq[k], 1 + isl_basic_set_total_dim(nonneg));
6906 isl_int_set_si(nonneg->ineq[k][pos], 1);
6908 return isl_basic_set_finalize(nonneg);
6910 isl_basic_set_free(nonneg);
6914 /* Construct the half-space x_pos <= -1.
6916 static __isl_give isl_basic_set *neg_halfspace(__isl_take isl_space *dim, int pos)
6921 neg = isl_basic_set_alloc_space(dim, 0, 0, 1);
6922 k = isl_basic_set_alloc_inequality(neg);
6925 isl_seq_clr(neg->ineq[k], 1 + isl_basic_set_total_dim(neg));
6926 isl_int_set_si(neg->ineq[k][0], -1);
6927 isl_int_set_si(neg->ineq[k][pos], -1);
6929 return isl_basic_set_finalize(neg);
6931 isl_basic_set_free(neg);
6935 __isl_give isl_set *isl_set_split_dims(__isl_take isl_set *set,
6936 enum isl_dim_type type, unsigned first, unsigned n)
6939 isl_basic_set *nonneg;
6947 isl_assert(set->ctx, first + n <= isl_set_dim(set, type), goto error);
6949 for (i = 0; i < n; ++i) {
6950 nonneg = nonneg_halfspace(isl_set_get_space(set),
6951 pos(set->dim, type) + first + i);
6952 neg = neg_halfspace(isl_set_get_space(set),
6953 pos(set->dim, type) + first + i);
6955 set = isl_set_intersect(set, isl_basic_set_union(nonneg, neg));
6964 static int foreach_orthant(__isl_take isl_set *set, int *signs, int first,
6965 int len, int (*fn)(__isl_take isl_set *orthant, int *signs, void *user),
6972 if (isl_set_plain_is_empty(set)) {
6977 return fn(set, signs, user);
6980 half = isl_set_from_basic_set(nonneg_halfspace(isl_set_get_space(set),
6982 half = isl_set_intersect(half, isl_set_copy(set));
6983 if (foreach_orthant(half, signs, first + 1, len, fn, user) < 0)
6987 half = isl_set_from_basic_set(neg_halfspace(isl_set_get_space(set),
6989 half = isl_set_intersect(half, set);
6990 return foreach_orthant(half, signs, first + 1, len, fn, user);
6996 /* Call "fn" on the intersections of "set" with each of the orthants
6997 * (except for obviously empty intersections). The orthant is identified
6998 * by the signs array, with each entry having value 1 or -1 according
6999 * to the sign of the corresponding variable.
7001 int isl_set_foreach_orthant(__isl_keep isl_set *set,
7002 int (*fn)(__isl_take isl_set *orthant, int *signs, void *user),
7012 if (isl_set_plain_is_empty(set))
7015 nparam = isl_set_dim(set, isl_dim_param);
7016 nvar = isl_set_dim(set, isl_dim_set);
7018 signs = isl_alloc_array(set->ctx, int, nparam + nvar);
7020 r = foreach_orthant(isl_set_copy(set), signs, 0, nparam + nvar,
7028 int isl_set_is_equal(struct isl_set *set1, struct isl_set *set2)
7030 return isl_map_is_equal((struct isl_map *)set1, (struct isl_map *)set2);
7033 int isl_basic_map_is_subset(
7034 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
7037 struct isl_map *map1;
7038 struct isl_map *map2;
7040 if (!bmap1 || !bmap2)
7043 map1 = isl_map_from_basic_map(isl_basic_map_copy(bmap1));
7044 map2 = isl_map_from_basic_map(isl_basic_map_copy(bmap2));
7046 is_subset = isl_map_is_subset(map1, map2);
7054 int isl_basic_set_is_subset(__isl_keep isl_basic_set *bset1,
7055 __isl_keep isl_basic_set *bset2)
7057 return isl_basic_map_is_subset(bset1, bset2);
7060 int isl_basic_map_is_equal(
7061 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
7065 if (!bmap1 || !bmap2)
7067 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
7070 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
7074 int isl_basic_set_is_equal(
7075 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
7077 return isl_basic_map_is_equal(
7078 (struct isl_basic_map *)bset1, (struct isl_basic_map *)bset2);
7081 int isl_map_is_empty(struct isl_map *map)
7088 for (i = 0; i < map->n; ++i) {
7089 is_empty = isl_basic_map_is_empty(map->p[i]);
7098 int isl_map_plain_is_empty(__isl_keep isl_map *map)
7100 return map ? map->n == 0 : -1;
7103 int isl_map_fast_is_empty(__isl_keep isl_map *map)
7105 return isl_map_plain_is_empty(map);
7108 int isl_set_plain_is_empty(struct isl_set *set)
7110 return set ? set->n == 0 : -1;
7113 int isl_set_fast_is_empty(__isl_keep isl_set *set)
7115 return isl_set_plain_is_empty(set);
7118 int isl_set_is_empty(struct isl_set *set)
7120 return isl_map_is_empty((struct isl_map *)set);
7123 int isl_map_has_equal_space(__isl_keep isl_map *map1, __isl_keep isl_map *map2)
7128 return isl_space_is_equal(map1->dim, map2->dim);
7131 int isl_set_has_equal_space(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
7136 return isl_space_is_equal(set1->dim, set2->dim);
7139 static int map_is_equal(__isl_keep isl_map *map1, __isl_keep isl_map *map2)
7145 is_subset = isl_map_is_subset(map1, map2);
7148 is_subset = isl_map_is_subset(map2, map1);
7152 int isl_map_is_equal(__isl_keep isl_map *map1, __isl_keep isl_map *map2)
7154 return isl_map_align_params_map_map_and_test(map1, map2, &map_is_equal);
7157 int isl_basic_map_is_strict_subset(
7158 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
7162 if (!bmap1 || !bmap2)
7164 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
7167 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
7168 if (is_subset == -1)
7173 int isl_map_is_strict_subset(struct isl_map *map1, struct isl_map *map2)
7179 is_subset = isl_map_is_subset(map1, map2);
7182 is_subset = isl_map_is_subset(map2, map1);
7183 if (is_subset == -1)
7188 int isl_set_is_strict_subset(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
7190 return isl_map_is_strict_subset((isl_map *)set1, (isl_map *)set2);
7193 int isl_basic_map_is_universe(struct isl_basic_map *bmap)
7197 return bmap->n_eq == 0 && bmap->n_ineq == 0;
7200 int isl_basic_set_is_universe(struct isl_basic_set *bset)
7204 return bset->n_eq == 0 && bset->n_ineq == 0;
7207 int isl_map_plain_is_universe(__isl_keep isl_map *map)
7214 for (i = 0; i < map->n; ++i) {
7215 int r = isl_basic_map_is_universe(map->p[i]);
7223 int isl_set_plain_is_universe(__isl_keep isl_set *set)
7225 return isl_map_plain_is_universe((isl_map *) set);
7228 int isl_set_fast_is_universe(__isl_keep isl_set *set)
7230 return isl_set_plain_is_universe(set);
7233 int isl_basic_map_is_empty(struct isl_basic_map *bmap)
7235 struct isl_basic_set *bset = NULL;
7236 struct isl_vec *sample = NULL;
7243 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY))
7246 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL)) {
7247 struct isl_basic_map *copy = isl_basic_map_copy(bmap);
7248 copy = isl_basic_map_remove_redundancies(copy);
7249 empty = ISL_F_ISSET(copy, ISL_BASIC_MAP_EMPTY);
7250 isl_basic_map_free(copy);
7254 total = 1 + isl_basic_map_total_dim(bmap);
7255 if (bmap->sample && bmap->sample->size == total) {
7256 int contains = isl_basic_map_contains(bmap, bmap->sample);
7262 isl_vec_free(bmap->sample);
7263 bmap->sample = NULL;
7264 bset = isl_basic_map_underlying_set(isl_basic_map_copy(bmap));
7267 sample = isl_basic_set_sample_vec(bset);
7270 empty = sample->size == 0;
7271 isl_vec_free(bmap->sample);
7272 bmap->sample = sample;
7274 ISL_F_SET(bmap, ISL_BASIC_MAP_EMPTY);
7279 int isl_basic_map_plain_is_empty(__isl_keep isl_basic_map *bmap)
7283 return ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY);
7286 int isl_basic_map_fast_is_empty(__isl_keep isl_basic_map *bmap)
7288 return isl_basic_map_plain_is_empty(bmap);
7291 int isl_basic_set_plain_is_empty(__isl_keep isl_basic_set *bset)
7295 return ISL_F_ISSET(bset, ISL_BASIC_SET_EMPTY);
7298 int isl_basic_set_fast_is_empty(__isl_keep isl_basic_set *bset)
7300 return isl_basic_set_plain_is_empty(bset);
7303 int isl_basic_set_is_empty(struct isl_basic_set *bset)
7305 return isl_basic_map_is_empty((struct isl_basic_map *)bset);
7308 struct isl_map *isl_basic_map_union(
7309 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
7311 struct isl_map *map;
7312 if (!bmap1 || !bmap2)
7315 isl_assert(bmap1->ctx, isl_space_is_equal(bmap1->dim, bmap2->dim), goto error);
7317 map = isl_map_alloc_space(isl_space_copy(bmap1->dim), 2, 0);
7320 map = isl_map_add_basic_map(map, bmap1);
7321 map = isl_map_add_basic_map(map, bmap2);
7324 isl_basic_map_free(bmap1);
7325 isl_basic_map_free(bmap2);
7329 struct isl_set *isl_basic_set_union(
7330 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
7332 return (struct isl_set *)isl_basic_map_union(
7333 (struct isl_basic_map *)bset1,
7334 (struct isl_basic_map *)bset2);
7337 /* Order divs such that any div only depends on previous divs */
7338 struct isl_basic_map *isl_basic_map_order_divs(struct isl_basic_map *bmap)
7346 off = isl_space_dim(bmap->dim, isl_dim_all);
7348 for (i = 0; i < bmap->n_div; ++i) {
7350 if (isl_int_is_zero(bmap->div[i][0]))
7352 pos = isl_seq_first_non_zero(bmap->div[i]+1+1+off+i,
7356 isl_basic_map_swap_div(bmap, i, i + pos);
7362 struct isl_basic_set *isl_basic_set_order_divs(struct isl_basic_set *bset)
7364 return (struct isl_basic_set *)
7365 isl_basic_map_order_divs((struct isl_basic_map *)bset);
7368 __isl_give isl_map *isl_map_order_divs(__isl_take isl_map *map)
7375 for (i = 0; i < map->n; ++i) {
7376 map->p[i] = isl_basic_map_order_divs(map->p[i]);
7387 /* Apply the expansion computed by isl_merge_divs.
7388 * The expansion itself is given by "exp" while the resulting
7389 * list of divs is given by "div".
7391 __isl_give isl_basic_set *isl_basic_set_expand_divs(
7392 __isl_take isl_basic_set *bset, __isl_take isl_mat *div, int *exp)
7397 bset = isl_basic_set_cow(bset);
7401 if (div->n_row < bset->n_div)
7402 isl_die(isl_mat_get_ctx(div), isl_error_invalid,
7403 "not an expansion", goto error);
7405 bset = isl_basic_map_extend_space(bset, isl_space_copy(bset->dim),
7406 div->n_row - bset->n_div, 0,
7407 2 * (div->n_row - bset->n_div));
7409 n_div = bset->n_div;
7410 for (i = n_div; i < div->n_row; ++i)
7411 if (isl_basic_set_alloc_div(bset) < 0)
7415 for (i = div->n_row - 1; i >= 0; --i) {
7416 if (j >= 0 && exp[j] == i) {
7418 isl_basic_map_swap_div(bset, i, j);
7421 isl_seq_cpy(bset->div[i], div->row[i], div->n_col);
7422 if (isl_basic_map_add_div_constraints(bset, i) < 0)
7430 isl_basic_set_free(bset);
7435 /* Look for a div in dst that corresponds to the div "div" in src.
7436 * The divs before "div" in src and dst are assumed to be the same.
7438 * Returns -1 if no corresponding div was found and the position
7439 * of the corresponding div in dst otherwise.
7441 static int find_div(struct isl_basic_map *dst,
7442 struct isl_basic_map *src, unsigned div)
7446 unsigned total = isl_space_dim(src->dim, isl_dim_all);
7448 isl_assert(dst->ctx, div <= dst->n_div, return -1);
7449 for (i = div; i < dst->n_div; ++i)
7450 if (isl_seq_eq(dst->div[i], src->div[div], 1+1+total+div) &&
7451 isl_seq_first_non_zero(dst->div[i]+1+1+total+div,
7452 dst->n_div - div) == -1)
7457 struct isl_basic_map *isl_basic_map_align_divs(
7458 struct isl_basic_map *dst, struct isl_basic_map *src)
7461 unsigned total = isl_space_dim(src->dim, isl_dim_all);
7466 if (src->n_div == 0)
7469 for (i = 0; i < src->n_div; ++i)
7470 isl_assert(src->ctx, !isl_int_is_zero(src->div[i][0]), goto error);
7472 src = isl_basic_map_order_divs(src);
7473 dst = isl_basic_map_cow(dst);
7474 dst = isl_basic_map_extend_space(dst, isl_space_copy(dst->dim),
7475 src->n_div, 0, 2 * src->n_div);
7478 for (i = 0; i < src->n_div; ++i) {
7479 int j = find_div(dst, src, i);
7481 j = isl_basic_map_alloc_div(dst);
7484 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total+i);
7485 isl_seq_clr(dst->div[j]+1+1+total+i, dst->n_div - i);
7486 if (isl_basic_map_add_div_constraints(dst, j) < 0)
7490 isl_basic_map_swap_div(dst, i, j);
7494 isl_basic_map_free(dst);
7498 struct isl_basic_set *isl_basic_set_align_divs(
7499 struct isl_basic_set *dst, struct isl_basic_set *src)
7501 return (struct isl_basic_set *)isl_basic_map_align_divs(
7502 (struct isl_basic_map *)dst, (struct isl_basic_map *)src);
7505 struct isl_map *isl_map_align_divs(struct isl_map *map)
7513 map = isl_map_compute_divs(map);
7514 map = isl_map_cow(map);
7518 for (i = 1; i < map->n; ++i)
7519 map->p[0] = isl_basic_map_align_divs(map->p[0], map->p[i]);
7520 for (i = 1; i < map->n; ++i)
7521 map->p[i] = isl_basic_map_align_divs(map->p[i], map->p[0]);
7523 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
7527 struct isl_set *isl_set_align_divs(struct isl_set *set)
7529 return (struct isl_set *)isl_map_align_divs((struct isl_map *)set);
7532 static __isl_give isl_set *set_apply( __isl_take isl_set *set,
7533 __isl_take isl_map *map)
7537 isl_assert(set->ctx, isl_map_compatible_domain(map, set), goto error);
7538 map = isl_map_intersect_domain(map, set);
7539 set = isl_map_range(map);
7547 __isl_give isl_set *isl_set_apply( __isl_take isl_set *set,
7548 __isl_take isl_map *map)
7550 return isl_map_align_params_map_map_and(set, map, &set_apply);
7553 /* There is no need to cow as removing empty parts doesn't change
7554 * the meaning of the set.
7556 struct isl_map *isl_map_remove_empty_parts(struct isl_map *map)
7563 for (i = map->n - 1; i >= 0; --i)
7564 remove_if_empty(map, i);
7569 struct isl_set *isl_set_remove_empty_parts(struct isl_set *set)
7571 return (struct isl_set *)
7572 isl_map_remove_empty_parts((struct isl_map *)set);
7575 struct isl_basic_map *isl_map_copy_basic_map(struct isl_map *map)
7577 struct isl_basic_map *bmap;
7578 if (!map || map->n == 0)
7580 bmap = map->p[map->n-1];
7581 isl_assert(map->ctx, ISL_F_ISSET(bmap, ISL_BASIC_SET_FINAL), return NULL);
7582 return isl_basic_map_copy(bmap);
7585 struct isl_basic_set *isl_set_copy_basic_set(struct isl_set *set)
7587 return (struct isl_basic_set *)
7588 isl_map_copy_basic_map((struct isl_map *)set);
7591 __isl_give isl_map *isl_map_drop_basic_map(__isl_take isl_map *map,
7592 __isl_keep isl_basic_map *bmap)
7598 for (i = map->n-1; i >= 0; --i) {
7599 if (map->p[i] != bmap)
7601 map = isl_map_cow(map);
7604 isl_basic_map_free(map->p[i]);
7605 if (i != map->n-1) {
7606 ISL_F_CLR(map, ISL_SET_NORMALIZED);
7607 map->p[i] = map->p[map->n-1];
7618 struct isl_set *isl_set_drop_basic_set(struct isl_set *set,
7619 struct isl_basic_set *bset)
7621 return (struct isl_set *)isl_map_drop_basic_map((struct isl_map *)set,
7622 (struct isl_basic_map *)bset);
7625 /* Given two basic sets bset1 and bset2, compute the maximal difference
7626 * between the values of dimension pos in bset1 and those in bset2
7627 * for any common value of the parameters and dimensions preceding pos.
7629 static enum isl_lp_result basic_set_maximal_difference_at(
7630 __isl_keep isl_basic_set *bset1, __isl_keep isl_basic_set *bset2,
7631 int pos, isl_int *opt)
7634 struct isl_basic_map *bmap1 = NULL;
7635 struct isl_basic_map *bmap2 = NULL;
7636 struct isl_ctx *ctx;
7637 struct isl_vec *obj;
7640 unsigned dim1, dim2;
7641 enum isl_lp_result res;
7643 if (!bset1 || !bset2)
7644 return isl_lp_error;
7646 nparam = isl_basic_set_n_param(bset1);
7647 dim1 = isl_basic_set_n_dim(bset1);
7648 dim2 = isl_basic_set_n_dim(bset2);
7649 dims = isl_space_alloc(bset1->ctx, nparam, pos, dim1 - pos);
7650 bmap1 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset1), dims);
7651 dims = isl_space_alloc(bset2->ctx, nparam, pos, dim2 - pos);
7652 bmap2 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset2), dims);
7653 if (!bmap1 || !bmap2)
7655 bmap1 = isl_basic_map_cow(bmap1);
7656 bmap1 = isl_basic_map_extend(bmap1, nparam,
7657 pos, (dim1 - pos) + (dim2 - pos),
7658 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
7659 bmap1 = add_constraints(bmap1, bmap2, 0, dim1 - pos);
7662 total = isl_basic_map_total_dim(bmap1);
7664 obj = isl_vec_alloc(ctx, 1 + total);
7665 isl_seq_clr(obj->block.data, 1 + total);
7666 isl_int_set_si(obj->block.data[1+nparam+pos], 1);
7667 isl_int_set_si(obj->block.data[1+nparam+pos+(dim1-pos)], -1);
7670 res = isl_basic_map_solve_lp(bmap1, 1, obj->block.data, ctx->one,
7672 isl_basic_map_free(bmap1);
7676 isl_basic_map_free(bmap1);
7677 isl_basic_map_free(bmap2);
7678 return isl_lp_error;
7681 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
7682 * for any common value of the parameters and dimensions preceding pos
7683 * in both basic sets, the values of dimension pos in bset1 are
7684 * smaller or larger than those in bset2.
7687 * 1 if bset1 follows bset2
7688 * -1 if bset1 precedes bset2
7689 * 0 if bset1 and bset2 are incomparable
7690 * -2 if some error occurred.
7692 int isl_basic_set_compare_at(struct isl_basic_set *bset1,
7693 struct isl_basic_set *bset2, int pos)
7696 enum isl_lp_result res;
7701 res = basic_set_maximal_difference_at(bset1, bset2, pos, &opt);
7703 if (res == isl_lp_empty)
7705 else if ((res == isl_lp_ok && isl_int_is_pos(opt)) ||
7706 res == isl_lp_unbounded)
7708 else if (res == isl_lp_ok && isl_int_is_neg(opt))
7717 /* Given two basic sets bset1 and bset2, check whether
7718 * for any common value of the parameters and dimensions preceding pos
7719 * there is a value of dimension pos in bset1 that is larger
7720 * than a value of the same dimension in bset2.
7723 * 1 if there exists such a pair
7724 * 0 if there is no such pair, but there is a pair of equal values
7726 * -2 if some error occurred.
7728 int isl_basic_set_follows_at(__isl_keep isl_basic_set *bset1,
7729 __isl_keep isl_basic_set *bset2, int pos)
7732 enum isl_lp_result res;
7737 res = basic_set_maximal_difference_at(bset1, bset2, pos, &opt);
7739 if (res == isl_lp_empty)
7741 else if ((res == isl_lp_ok && isl_int_is_pos(opt)) ||
7742 res == isl_lp_unbounded)
7744 else if (res == isl_lp_ok && isl_int_is_neg(opt))
7746 else if (res == isl_lp_ok)
7755 /* Given two sets set1 and set2, check whether
7756 * for any common value of the parameters and dimensions preceding pos
7757 * there is a value of dimension pos in set1 that is larger
7758 * than a value of the same dimension in set2.
7761 * 1 if there exists such a pair
7762 * 0 if there is no such pair, but there is a pair of equal values
7764 * -2 if some error occurred.
7766 int isl_set_follows_at(__isl_keep isl_set *set1,
7767 __isl_keep isl_set *set2, int pos)
7775 for (i = 0; i < set1->n; ++i)
7776 for (j = 0; j < set2->n; ++j) {
7778 f = isl_basic_set_follows_at(set1->p[i], set2->p[j], pos);
7779 if (f == 1 || f == -2)
7788 static int isl_basic_map_plain_has_fixed_var(__isl_keep isl_basic_map *bmap,
7789 unsigned pos, isl_int *val)
7797 total = isl_basic_map_total_dim(bmap);
7798 for (i = 0, d = total-1; i < bmap->n_eq && d+1 > pos; ++i) {
7799 for (; d+1 > pos; --d)
7800 if (!isl_int_is_zero(bmap->eq[i][1+d]))
7804 if (isl_seq_first_non_zero(bmap->eq[i]+1, d) != -1)
7806 if (isl_seq_first_non_zero(bmap->eq[i]+1+d+1, total-d-1) != -1)
7808 if (!isl_int_is_one(bmap->eq[i][1+d]))
7811 isl_int_neg(*val, bmap->eq[i][0]);
7817 static int isl_map_plain_has_fixed_var(__isl_keep isl_map *map,
7818 unsigned pos, isl_int *val)
7830 return isl_basic_map_plain_has_fixed_var(map->p[0], pos, val);
7833 fixed = isl_basic_map_plain_has_fixed_var(map->p[0], pos, &v);
7834 for (i = 1; fixed == 1 && i < map->n; ++i) {
7835 fixed = isl_basic_map_plain_has_fixed_var(map->p[i], pos, &tmp);
7836 if (fixed == 1 && isl_int_ne(tmp, v))
7840 isl_int_set(*val, v);
7846 static int isl_basic_set_plain_has_fixed_var(__isl_keep isl_basic_set *bset,
7847 unsigned pos, isl_int *val)
7849 return isl_basic_map_plain_has_fixed_var((struct isl_basic_map *)bset,
7853 static int isl_set_plain_has_fixed_var(__isl_keep isl_set *set, unsigned pos,
7856 return isl_map_plain_has_fixed_var((struct isl_map *)set, pos, val);
7859 int isl_basic_map_plain_is_fixed(__isl_keep isl_basic_map *bmap,
7860 enum isl_dim_type type, unsigned pos, isl_int *val)
7862 if (pos >= isl_basic_map_dim(bmap, type))
7864 return isl_basic_map_plain_has_fixed_var(bmap,
7865 isl_basic_map_offset(bmap, type) - 1 + pos, val);
7868 int isl_map_plain_is_fixed(__isl_keep isl_map *map,
7869 enum isl_dim_type type, unsigned pos, isl_int *val)
7871 if (pos >= isl_map_dim(map, type))
7873 return isl_map_plain_has_fixed_var(map,
7874 map_offset(map, type) - 1 + pos, val);
7877 int isl_set_plain_is_fixed(__isl_keep isl_set *set,
7878 enum isl_dim_type type, unsigned pos, isl_int *val)
7880 return isl_map_plain_is_fixed(set, type, pos, val);
7883 int isl_map_fast_is_fixed(__isl_keep isl_map *map,
7884 enum isl_dim_type type, unsigned pos, isl_int *val)
7886 return isl_map_plain_is_fixed(map, type, pos, val);
7889 /* Check if dimension dim has fixed value and if so and if val is not NULL,
7890 * then return this fixed value in *val.
7892 int isl_basic_set_plain_dim_is_fixed(__isl_keep isl_basic_set *bset,
7893 unsigned dim, isl_int *val)
7895 return isl_basic_set_plain_has_fixed_var(bset,
7896 isl_basic_set_n_param(bset) + dim, val);
7899 /* Check if dimension dim has fixed value and if so and if val is not NULL,
7900 * then return this fixed value in *val.
7902 int isl_set_plain_dim_is_fixed(__isl_keep isl_set *set,
7903 unsigned dim, isl_int *val)
7905 return isl_set_plain_has_fixed_var(set, isl_set_n_param(set) + dim, val);
7908 int isl_set_fast_dim_is_fixed(__isl_keep isl_set *set,
7909 unsigned dim, isl_int *val)
7911 return isl_set_plain_dim_is_fixed(set, dim, val);
7914 /* Check if input variable in has fixed value and if so and if val is not NULL,
7915 * then return this fixed value in *val.
7917 int isl_map_plain_input_is_fixed(__isl_keep isl_map *map,
7918 unsigned in, isl_int *val)
7920 return isl_map_plain_has_fixed_var(map, isl_map_n_param(map) + in, val);
7923 /* Check if dimension dim has an (obvious) fixed lower bound and if so
7924 * and if val is not NULL, then return this lower bound in *val.
7926 int isl_basic_set_plain_dim_has_fixed_lower_bound(
7927 __isl_keep isl_basic_set *bset, unsigned dim, isl_int *val)
7929 int i, i_eq = -1, i_ineq = -1;
7936 total = isl_basic_set_total_dim(bset);
7937 nparam = isl_basic_set_n_param(bset);
7938 for (i = 0; i < bset->n_eq; ++i) {
7939 if (isl_int_is_zero(bset->eq[i][1+nparam+dim]))
7945 for (i = 0; i < bset->n_ineq; ++i) {
7946 if (!isl_int_is_pos(bset->ineq[i][1+nparam+dim]))
7948 if (i_eq != -1 || i_ineq != -1)
7952 if (i_eq == -1 && i_ineq == -1)
7954 c = i_eq != -1 ? bset->eq[i_eq] : bset->ineq[i_ineq];
7955 /* The coefficient should always be one due to normalization. */
7956 if (!isl_int_is_one(c[1+nparam+dim]))
7958 if (isl_seq_first_non_zero(c+1, nparam+dim) != -1)
7960 if (isl_seq_first_non_zero(c+1+nparam+dim+1,
7961 total - nparam - dim - 1) != -1)
7964 isl_int_neg(*val, c[0]);
7968 int isl_set_plain_dim_has_fixed_lower_bound(__isl_keep isl_set *set,
7969 unsigned dim, isl_int *val)
7981 return isl_basic_set_plain_dim_has_fixed_lower_bound(set->p[0],
7985 fixed = isl_basic_set_plain_dim_has_fixed_lower_bound(set->p[0],
7987 for (i = 1; fixed == 1 && i < set->n; ++i) {
7988 fixed = isl_basic_set_plain_dim_has_fixed_lower_bound(set->p[i],
7990 if (fixed == 1 && isl_int_ne(tmp, v))
7994 isl_int_set(*val, v);
8005 /* uset_gist depends on constraints without existentially quantified
8006 * variables sorting first.
8008 static int qsort_constraint_cmp(const void *p1, const void *p2)
8010 const struct constraint *c1 = (const struct constraint *)p1;
8011 const struct constraint *c2 = (const struct constraint *)p2;
8013 unsigned size = isl_min(c1->size, c2->size);
8015 l1 = isl_seq_last_non_zero(c1->c, size);
8016 l2 = isl_seq_last_non_zero(c2->c, size);
8021 return isl_seq_cmp(c1->c, c2->c, size);
8024 static struct isl_basic_map *isl_basic_map_sort_constraints(
8025 struct isl_basic_map *bmap)
8028 struct constraint *c;
8033 total = isl_basic_map_total_dim(bmap);
8034 c = isl_alloc_array(bmap->ctx, struct constraint, bmap->n_ineq);
8037 for (i = 0; i < bmap->n_ineq; ++i) {
8039 c[i].c = bmap->ineq[i];
8041 qsort(c, bmap->n_ineq, sizeof(struct constraint), qsort_constraint_cmp);
8042 for (i = 0; i < bmap->n_ineq; ++i)
8043 bmap->ineq[i] = c[i].c;
8047 isl_basic_map_free(bmap);
8051 __isl_give isl_basic_set *isl_basic_set_sort_constraints(
8052 __isl_take isl_basic_set *bset)
8054 return (struct isl_basic_set *)isl_basic_map_sort_constraints(
8055 (struct isl_basic_map *)bset);
8058 struct isl_basic_map *isl_basic_map_normalize(struct isl_basic_map *bmap)
8062 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_NORMALIZED))
8064 bmap = isl_basic_map_remove_redundancies(bmap);
8065 bmap = isl_basic_map_sort_constraints(bmap);
8066 ISL_F_SET(bmap, ISL_BASIC_MAP_NORMALIZED);
8070 struct isl_basic_set *isl_basic_set_normalize(struct isl_basic_set *bset)
8072 return (struct isl_basic_set *)isl_basic_map_normalize(
8073 (struct isl_basic_map *)bset);
8076 int isl_basic_map_plain_cmp(const __isl_keep isl_basic_map *bmap1,
8077 const __isl_keep isl_basic_map *bmap2)
8084 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_RATIONAL) !=
8085 ISL_F_ISSET(bmap2, ISL_BASIC_MAP_RATIONAL))
8086 return ISL_F_ISSET(bmap1, ISL_BASIC_MAP_RATIONAL) ? -1 : 1;
8087 if (isl_basic_map_n_param(bmap1) != isl_basic_map_n_param(bmap2))
8088 return isl_basic_map_n_param(bmap1) - isl_basic_map_n_param(bmap2);
8089 if (isl_basic_map_n_in(bmap1) != isl_basic_map_n_in(bmap2))
8090 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
8091 if (isl_basic_map_n_out(bmap1) != isl_basic_map_n_out(bmap2))
8092 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
8093 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY) &&
8094 ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
8096 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY))
8098 if (ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
8100 if (bmap1->n_eq != bmap2->n_eq)
8101 return bmap1->n_eq - bmap2->n_eq;
8102 if (bmap1->n_ineq != bmap2->n_ineq)
8103 return bmap1->n_ineq - bmap2->n_ineq;
8104 if (bmap1->n_div != bmap2->n_div)
8105 return bmap1->n_div - bmap2->n_div;
8106 total = isl_basic_map_total_dim(bmap1);
8107 for (i = 0; i < bmap1->n_eq; ++i) {
8108 cmp = isl_seq_cmp(bmap1->eq[i], bmap2->eq[i], 1+total);
8112 for (i = 0; i < bmap1->n_ineq; ++i) {
8113 cmp = isl_seq_cmp(bmap1->ineq[i], bmap2->ineq[i], 1+total);
8117 for (i = 0; i < bmap1->n_div; ++i) {
8118 cmp = isl_seq_cmp(bmap1->div[i], bmap2->div[i], 1+1+total);
8125 int isl_basic_set_plain_cmp(const __isl_keep isl_basic_set *bset1,
8126 const __isl_keep isl_basic_set *bset2)
8128 return isl_basic_map_plain_cmp(bset1, bset2);
8131 int isl_set_plain_cmp(const __isl_keep isl_set *set1,
8132 const __isl_keep isl_set *set2)
8138 if (set1->n != set2->n)
8139 return set1->n - set2->n;
8141 for (i = 0; i < set1->n; ++i) {
8142 cmp = isl_basic_set_plain_cmp(set1->p[i], set2->p[i]);
8150 int isl_basic_map_plain_is_equal(__isl_keep isl_basic_map *bmap1,
8151 __isl_keep isl_basic_map *bmap2)
8153 return isl_basic_map_plain_cmp(bmap1, bmap2) == 0;
8156 int isl_basic_set_plain_is_equal(__isl_keep isl_basic_set *bset1,
8157 __isl_keep isl_basic_set *bset2)
8159 return isl_basic_map_plain_is_equal((isl_basic_map *)bset1,
8160 (isl_basic_map *)bset2);
8163 static int qsort_bmap_cmp(const void *p1, const void *p2)
8165 const struct isl_basic_map *bmap1 = *(const struct isl_basic_map **)p1;
8166 const struct isl_basic_map *bmap2 = *(const struct isl_basic_map **)p2;
8168 return isl_basic_map_plain_cmp(bmap1, bmap2);
8171 /* We normalize in place, but if anything goes wrong we need
8172 * to return NULL, so we need to make sure we don't change the
8173 * meaning of any possible other copies of map.
8175 struct isl_map *isl_map_normalize(struct isl_map *map)
8178 struct isl_basic_map *bmap;
8182 if (ISL_F_ISSET(map, ISL_MAP_NORMALIZED))
8184 for (i = 0; i < map->n; ++i) {
8185 bmap = isl_basic_map_normalize(isl_basic_map_copy(map->p[i]));
8188 isl_basic_map_free(map->p[i]);
8191 qsort(map->p, map->n, sizeof(struct isl_basic_map *), qsort_bmap_cmp);
8192 ISL_F_SET(map, ISL_MAP_NORMALIZED);
8193 map = isl_map_remove_empty_parts(map);
8196 for (i = map->n - 1; i >= 1; --i) {
8197 if (!isl_basic_map_plain_is_equal(map->p[i-1], map->p[i]))
8199 isl_basic_map_free(map->p[i-1]);
8200 for (j = i; j < map->n; ++j)
8201 map->p[j-1] = map->p[j];
8211 struct isl_set *isl_set_normalize(struct isl_set *set)
8213 return (struct isl_set *)isl_map_normalize((struct isl_map *)set);
8216 int isl_map_plain_is_equal(__isl_keep isl_map *map1, __isl_keep isl_map *map2)
8226 if (!isl_space_is_equal(map1->dim, map2->dim))
8229 map1 = isl_map_copy(map1);
8230 map2 = isl_map_copy(map2);
8231 map1 = isl_map_normalize(map1);
8232 map2 = isl_map_normalize(map2);
8235 equal = map1->n == map2->n;
8236 for (i = 0; equal && i < map1->n; ++i) {
8237 equal = isl_basic_map_plain_is_equal(map1->p[i], map2->p[i]);
8250 int isl_map_fast_is_equal(__isl_keep isl_map *map1, __isl_keep isl_map *map2)
8252 return isl_map_plain_is_equal(map1, map2);
8255 int isl_set_plain_is_equal(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
8257 return isl_map_plain_is_equal((struct isl_map *)set1,
8258 (struct isl_map *)set2);
8261 int isl_set_fast_is_equal(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
8263 return isl_set_plain_is_equal(set1, set2);
8266 /* Return an interval that ranges from min to max (inclusive)
8268 struct isl_basic_set *isl_basic_set_interval(struct isl_ctx *ctx,
8269 isl_int min, isl_int max)
8272 struct isl_basic_set *bset = NULL;
8274 bset = isl_basic_set_alloc(ctx, 0, 1, 0, 0, 2);
8278 k = isl_basic_set_alloc_inequality(bset);
8281 isl_int_set_si(bset->ineq[k][1], 1);
8282 isl_int_neg(bset->ineq[k][0], min);
8284 k = isl_basic_set_alloc_inequality(bset);
8287 isl_int_set_si(bset->ineq[k][1], -1);
8288 isl_int_set(bset->ineq[k][0], max);
8292 isl_basic_set_free(bset);
8296 /* Return the Cartesian product of the basic sets in list (in the given order).
8298 __isl_give isl_basic_set *isl_basic_set_list_product(
8299 __isl_take struct isl_basic_set_list *list)
8307 struct isl_basic_set *product = NULL;
8311 isl_assert(list->ctx, list->n > 0, goto error);
8312 isl_assert(list->ctx, list->p[0], goto error);
8313 nparam = isl_basic_set_n_param(list->p[0]);
8314 dim = isl_basic_set_n_dim(list->p[0]);
8315 extra = list->p[0]->n_div;
8316 n_eq = list->p[0]->n_eq;
8317 n_ineq = list->p[0]->n_ineq;
8318 for (i = 1; i < list->n; ++i) {
8319 isl_assert(list->ctx, list->p[i], goto error);
8320 isl_assert(list->ctx,
8321 nparam == isl_basic_set_n_param(list->p[i]), goto error);
8322 dim += isl_basic_set_n_dim(list->p[i]);
8323 extra += list->p[i]->n_div;
8324 n_eq += list->p[i]->n_eq;
8325 n_ineq += list->p[i]->n_ineq;
8327 product = isl_basic_set_alloc(list->ctx, nparam, dim, extra,
8332 for (i = 0; i < list->n; ++i) {
8333 isl_basic_set_add_constraints(product,
8334 isl_basic_set_copy(list->p[i]), dim);
8335 dim += isl_basic_set_n_dim(list->p[i]);
8337 isl_basic_set_list_free(list);
8340 isl_basic_set_free(product);
8341 isl_basic_set_list_free(list);
8345 struct isl_basic_map *isl_basic_map_product(
8346 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
8348 isl_space *dim_result = NULL;
8349 struct isl_basic_map *bmap;
8350 unsigned in1, in2, out1, out2, nparam, total, pos;
8351 struct isl_dim_map *dim_map1, *dim_map2;
8353 if (!bmap1 || !bmap2)
8356 isl_assert(bmap1->ctx, isl_space_match(bmap1->dim, isl_dim_param,
8357 bmap2->dim, isl_dim_param), goto error);
8358 dim_result = isl_space_product(isl_space_copy(bmap1->dim),
8359 isl_space_copy(bmap2->dim));
8361 in1 = isl_basic_map_n_in(bmap1);
8362 in2 = isl_basic_map_n_in(bmap2);
8363 out1 = isl_basic_map_n_out(bmap1);
8364 out2 = isl_basic_map_n_out(bmap2);
8365 nparam = isl_basic_map_n_param(bmap1);
8367 total = nparam + in1 + in2 + out1 + out2 + bmap1->n_div + bmap2->n_div;
8368 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
8369 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
8370 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
8371 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
8372 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
8373 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos += in1);
8374 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += in2);
8375 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += out1);
8376 isl_dim_map_div(dim_map1, bmap1, pos += out2);
8377 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
8379 bmap = isl_basic_map_alloc_space(dim_result,
8380 bmap1->n_div + bmap2->n_div,
8381 bmap1->n_eq + bmap2->n_eq,
8382 bmap1->n_ineq + bmap2->n_ineq);
8383 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap1, dim_map1);
8384 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap2, dim_map2);
8385 bmap = isl_basic_map_simplify(bmap);
8386 return isl_basic_map_finalize(bmap);
8388 isl_basic_map_free(bmap1);
8389 isl_basic_map_free(bmap2);
8393 __isl_give isl_basic_map *isl_basic_map_flat_product(
8394 __isl_take isl_basic_map *bmap1, __isl_take isl_basic_map *bmap2)
8396 isl_basic_map *prod;
8398 prod = isl_basic_map_product(bmap1, bmap2);
8399 prod = isl_basic_map_flatten(prod);
8403 __isl_give isl_basic_set *isl_basic_set_flat_product(
8404 __isl_take isl_basic_set *bset1, __isl_take isl_basic_set *bset2)
8406 return isl_basic_map_flat_range_product(bset1, bset2);
8409 __isl_give isl_basic_map *isl_basic_map_domain_product(
8410 __isl_take isl_basic_map *bmap1, __isl_take isl_basic_map *bmap2)
8412 isl_space *space_result = NULL;
8413 isl_basic_map *bmap;
8414 unsigned in1, in2, out, nparam, total, pos;
8415 struct isl_dim_map *dim_map1, *dim_map2;
8417 if (!bmap1 || !bmap2)
8420 space_result = isl_space_domain_product(isl_space_copy(bmap1->dim),
8421 isl_space_copy(bmap2->dim));
8423 in1 = isl_basic_map_dim(bmap1, isl_dim_in);
8424 in2 = isl_basic_map_dim(bmap2, isl_dim_in);
8425 out = isl_basic_map_dim(bmap1, isl_dim_out);
8426 nparam = isl_basic_map_dim(bmap1, isl_dim_param);
8428 total = nparam + in1 + in2 + out + bmap1->n_div + bmap2->n_div;
8429 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
8430 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
8431 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
8432 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
8433 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
8434 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos += in1);
8435 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += in2);
8436 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos);
8437 isl_dim_map_div(dim_map1, bmap1, pos += out);
8438 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
8440 bmap = isl_basic_map_alloc_space(space_result,
8441 bmap1->n_div + bmap2->n_div,
8442 bmap1->n_eq + bmap2->n_eq,
8443 bmap1->n_ineq + bmap2->n_ineq);
8444 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap1, dim_map1);
8445 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap2, dim_map2);
8446 bmap = isl_basic_map_simplify(bmap);
8447 return isl_basic_map_finalize(bmap);
8449 isl_basic_map_free(bmap1);
8450 isl_basic_map_free(bmap2);
8454 __isl_give isl_basic_map *isl_basic_map_range_product(
8455 __isl_take isl_basic_map *bmap1, __isl_take isl_basic_map *bmap2)
8457 isl_space *dim_result = NULL;
8458 isl_basic_map *bmap;
8459 unsigned in, out1, out2, nparam, total, pos;
8460 struct isl_dim_map *dim_map1, *dim_map2;
8462 if (!bmap1 || !bmap2)
8465 if (!isl_space_match(bmap1->dim, isl_dim_param,
8466 bmap2->dim, isl_dim_param))
8467 isl_die(isl_basic_map_get_ctx(bmap1), isl_error_invalid,
8468 "parameters don't match", goto error);
8470 dim_result = isl_space_range_product(isl_space_copy(bmap1->dim),
8471 isl_space_copy(bmap2->dim));
8473 in = isl_basic_map_dim(bmap1, isl_dim_in);
8474 out1 = isl_basic_map_n_out(bmap1);
8475 out2 = isl_basic_map_n_out(bmap2);
8476 nparam = isl_basic_map_n_param(bmap1);
8478 total = nparam + in + out1 + out2 + bmap1->n_div + bmap2->n_div;
8479 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
8480 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
8481 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
8482 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
8483 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
8484 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
8485 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += in);
8486 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += out1);
8487 isl_dim_map_div(dim_map1, bmap1, pos += out2);
8488 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
8490 bmap = isl_basic_map_alloc_space(dim_result,
8491 bmap1->n_div + bmap2->n_div,
8492 bmap1->n_eq + bmap2->n_eq,
8493 bmap1->n_ineq + bmap2->n_ineq);
8494 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap1, dim_map1);
8495 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap2, dim_map2);
8496 bmap = isl_basic_map_simplify(bmap);
8497 return isl_basic_map_finalize(bmap);
8499 isl_basic_map_free(bmap1);
8500 isl_basic_map_free(bmap2);
8504 __isl_give isl_basic_map *isl_basic_map_flat_range_product(
8505 __isl_take isl_basic_map *bmap1, __isl_take isl_basic_map *bmap2)
8507 isl_basic_map *prod;
8509 prod = isl_basic_map_range_product(bmap1, bmap2);
8510 prod = isl_basic_map_flatten_range(prod);
8514 static __isl_give isl_map *map_product(__isl_take isl_map *map1,
8515 __isl_take isl_map *map2,
8516 __isl_give isl_space *(*dim_product)(__isl_take isl_space *left,
8517 __isl_take isl_space *right),
8518 __isl_give isl_basic_map *(*basic_map_product)(
8519 __isl_take isl_basic_map *left, __isl_take isl_basic_map *right))
8522 struct isl_map *result;
8528 isl_assert(map1->ctx, isl_space_match(map1->dim, isl_dim_param,
8529 map2->dim, isl_dim_param), goto error);
8531 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
8532 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
8533 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
8535 result = isl_map_alloc_space(dim_product(isl_space_copy(map1->dim),
8536 isl_space_copy(map2->dim)),
8537 map1->n * map2->n, flags);
8540 for (i = 0; i < map1->n; ++i)
8541 for (j = 0; j < map2->n; ++j) {
8542 struct isl_basic_map *part;
8543 part = basic_map_product(isl_basic_map_copy(map1->p[i]),
8544 isl_basic_map_copy(map2->p[j]));
8545 if (isl_basic_map_is_empty(part))
8546 isl_basic_map_free(part);
8548 result = isl_map_add_basic_map(result, part);
8561 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> [B -> D]
8563 static __isl_give isl_map *map_product_aligned(__isl_take isl_map *map1,
8564 __isl_take isl_map *map2)
8566 return map_product(map1, map2, &isl_space_product, &isl_basic_map_product);
8569 __isl_give isl_map *isl_map_product(__isl_take isl_map *map1,
8570 __isl_take isl_map *map2)
8572 return isl_map_align_params_map_map_and(map1, map2, &map_product_aligned);
8575 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
8577 __isl_give isl_map *isl_map_flat_product(__isl_take isl_map *map1,
8578 __isl_take isl_map *map2)
8582 prod = isl_map_product(map1, map2);
8583 prod = isl_map_flatten(prod);
8587 /* Given two set A and B, construct its Cartesian product A x B.
8589 struct isl_set *isl_set_product(struct isl_set *set1, struct isl_set *set2)
8591 return isl_map_range_product(set1, set2);
8594 __isl_give isl_set *isl_set_flat_product(__isl_take isl_set *set1,
8595 __isl_take isl_set *set2)
8597 return isl_map_flat_range_product(set1, set2);
8600 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> (B * D)
8602 static __isl_give isl_map *map_domain_product_aligned(__isl_take isl_map *map1,
8603 __isl_take isl_map *map2)
8605 return map_product(map1, map2, &isl_space_domain_product,
8606 &isl_basic_map_domain_product);
8609 /* Given two maps A -> B and C -> D, construct a map (A * C) -> [B -> D]
8611 static __isl_give isl_map *map_range_product_aligned(__isl_take isl_map *map1,
8612 __isl_take isl_map *map2)
8614 return map_product(map1, map2, &isl_space_range_product,
8615 &isl_basic_map_range_product);
8618 __isl_give isl_map *isl_map_domain_product(__isl_take isl_map *map1,
8619 __isl_take isl_map *map2)
8621 return isl_map_align_params_map_map_and(map1, map2,
8622 &map_domain_product_aligned);
8625 __isl_give isl_map *isl_map_range_product(__isl_take isl_map *map1,
8626 __isl_take isl_map *map2)
8628 return isl_map_align_params_map_map_and(map1, map2,
8629 &map_range_product_aligned);
8632 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B * D)
8634 __isl_give isl_map *isl_map_flat_domain_product(__isl_take isl_map *map1,
8635 __isl_take isl_map *map2)
8639 prod = isl_map_domain_product(map1, map2);
8640 prod = isl_map_flatten_domain(prod);
8644 /* Given two maps A -> B and C -> D, construct a map (A * C) -> (B, D)
8646 __isl_give isl_map *isl_map_flat_range_product(__isl_take isl_map *map1,
8647 __isl_take isl_map *map2)
8651 prod = isl_map_range_product(map1, map2);
8652 prod = isl_map_flatten_range(prod);
8656 uint32_t isl_basic_map_get_hash(__isl_keep isl_basic_map *bmap)
8659 uint32_t hash = isl_hash_init();
8664 bmap = isl_basic_map_copy(bmap);
8665 bmap = isl_basic_map_normalize(bmap);
8668 total = isl_basic_map_total_dim(bmap);
8669 isl_hash_byte(hash, bmap->n_eq & 0xFF);
8670 for (i = 0; i < bmap->n_eq; ++i) {
8672 c_hash = isl_seq_get_hash(bmap->eq[i], 1 + total);
8673 isl_hash_hash(hash, c_hash);
8675 isl_hash_byte(hash, bmap->n_ineq & 0xFF);
8676 for (i = 0; i < bmap->n_ineq; ++i) {
8678 c_hash = isl_seq_get_hash(bmap->ineq[i], 1 + total);
8679 isl_hash_hash(hash, c_hash);
8681 isl_hash_byte(hash, bmap->n_div & 0xFF);
8682 for (i = 0; i < bmap->n_div; ++i) {
8684 if (isl_int_is_zero(bmap->div[i][0]))
8686 isl_hash_byte(hash, i & 0xFF);
8687 c_hash = isl_seq_get_hash(bmap->div[i], 1 + 1 + total);
8688 isl_hash_hash(hash, c_hash);
8690 isl_basic_map_free(bmap);
8694 uint32_t isl_basic_set_get_hash(__isl_keep isl_basic_set *bset)
8696 return isl_basic_map_get_hash((isl_basic_map *)bset);
8699 uint32_t isl_map_get_hash(__isl_keep isl_map *map)
8706 map = isl_map_copy(map);
8707 map = isl_map_normalize(map);
8711 hash = isl_hash_init();
8712 for (i = 0; i < map->n; ++i) {
8714 bmap_hash = isl_basic_map_get_hash(map->p[i]);
8715 isl_hash_hash(hash, bmap_hash);
8723 uint32_t isl_set_get_hash(__isl_keep isl_set *set)
8725 return isl_map_get_hash((isl_map *)set);
8728 /* Check if the value for dimension dim is completely determined
8729 * by the values of the other parameters and variables.
8730 * That is, check if dimension dim is involved in an equality.
8732 int isl_basic_set_dim_is_unique(struct isl_basic_set *bset, unsigned dim)
8739 nparam = isl_basic_set_n_param(bset);
8740 for (i = 0; i < bset->n_eq; ++i)
8741 if (!isl_int_is_zero(bset->eq[i][1 + nparam + dim]))
8746 /* Check if the value for dimension dim is completely determined
8747 * by the values of the other parameters and variables.
8748 * That is, check if dimension dim is involved in an equality
8749 * for each of the subsets.
8751 int isl_set_dim_is_unique(struct isl_set *set, unsigned dim)
8757 for (i = 0; i < set->n; ++i) {
8759 unique = isl_basic_set_dim_is_unique(set->p[i], dim);
8766 int isl_set_n_basic_set(__isl_keep isl_set *set)
8768 return set ? set->n : 0;
8771 int isl_map_foreach_basic_map(__isl_keep isl_map *map,
8772 int (*fn)(__isl_take isl_basic_map *bmap, void *user), void *user)
8779 for (i = 0; i < map->n; ++i)
8780 if (fn(isl_basic_map_copy(map->p[i]), user) < 0)
8786 int isl_set_foreach_basic_set(__isl_keep isl_set *set,
8787 int (*fn)(__isl_take isl_basic_set *bset, void *user), void *user)
8794 for (i = 0; i < set->n; ++i)
8795 if (fn(isl_basic_set_copy(set->p[i]), user) < 0)
8801 __isl_give isl_basic_set *isl_basic_set_lift(__isl_take isl_basic_set *bset)
8808 bset = isl_basic_set_cow(bset);
8812 dim = isl_basic_set_get_space(bset);
8813 dim = isl_space_lift(dim, bset->n_div);
8816 isl_space_free(bset->dim);
8818 bset->extra -= bset->n_div;
8821 bset = isl_basic_set_finalize(bset);
8825 isl_basic_set_free(bset);
8829 __isl_give isl_set *isl_set_lift(__isl_take isl_set *set)
8835 set = isl_set_align_divs(set);
8840 set = isl_set_cow(set);
8844 n_div = set->p[0]->n_div;
8845 dim = isl_set_get_space(set);
8846 dim = isl_space_lift(dim, n_div);
8849 isl_space_free(set->dim);
8852 for (i = 0; i < set->n; ++i) {
8853 set->p[i] = isl_basic_set_lift(set->p[i]);
8864 __isl_give isl_map *isl_set_lifting(__isl_take isl_set *set)
8867 struct isl_basic_map *bmap;
8874 set = isl_set_align_divs(set);
8879 dim = isl_set_get_space(set);
8880 if (set->n == 0 || set->p[0]->n_div == 0) {
8882 return isl_map_identity(isl_space_map_from_set(dim));
8885 n_div = set->p[0]->n_div;
8886 dim = isl_space_map_from_set(dim);
8887 n_param = isl_space_dim(dim, isl_dim_param);
8888 n_set = isl_space_dim(dim, isl_dim_in);
8889 dim = isl_space_extend(dim, n_param, n_set, n_set + n_div);
8890 bmap = isl_basic_map_alloc_space(dim, 0, n_set, 2 * n_div);
8891 for (i = 0; i < n_set; ++i)
8892 bmap = var_equal(bmap, i);
8894 total = n_param + n_set + n_set + n_div;
8895 for (i = 0; i < n_div; ++i) {
8896 k = isl_basic_map_alloc_inequality(bmap);
8899 isl_seq_cpy(bmap->ineq[k], set->p[0]->div[i]+1, 1+n_param);
8900 isl_seq_clr(bmap->ineq[k]+1+n_param, n_set);
8901 isl_seq_cpy(bmap->ineq[k]+1+n_param+n_set,
8902 set->p[0]->div[i]+1+1+n_param, n_set + n_div);
8903 isl_int_neg(bmap->ineq[k][1+n_param+n_set+n_set+i],
8904 set->p[0]->div[i][0]);
8906 l = isl_basic_map_alloc_inequality(bmap);
8909 isl_seq_neg(bmap->ineq[l], bmap->ineq[k], 1 + total);
8910 isl_int_add(bmap->ineq[l][0], bmap->ineq[l][0],
8911 set->p[0]->div[i][0]);
8912 isl_int_sub_ui(bmap->ineq[l][0], bmap->ineq[l][0], 1);
8916 bmap = isl_basic_map_simplify(bmap);
8917 bmap = isl_basic_map_finalize(bmap);
8918 return isl_map_from_basic_map(bmap);
8921 isl_basic_map_free(bmap);
8925 int isl_basic_set_size(__isl_keep isl_basic_set *bset)
8933 dim = isl_basic_set_total_dim(bset);
8934 size += bset->n_eq * (1 + dim);
8935 size += bset->n_ineq * (1 + dim);
8936 size += bset->n_div * (2 + dim);
8941 int isl_set_size(__isl_keep isl_set *set)
8949 for (i = 0; i < set->n; ++i)
8950 size += isl_basic_set_size(set->p[i]);
8955 /* Check if there is any lower bound (if lower == 0) and/or upper
8956 * bound (if upper == 0) on the specified dim.
8958 static int basic_map_dim_is_bounded(__isl_keep isl_basic_map *bmap,
8959 enum isl_dim_type type, unsigned pos, int lower, int upper)
8966 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), return -1);
8968 pos += isl_basic_map_offset(bmap, type);
8970 for (i = 0; i < bmap->n_div; ++i) {
8971 if (isl_int_is_zero(bmap->div[i][0]))
8973 if (!isl_int_is_zero(bmap->div[i][1 + pos]))
8977 for (i = 0; i < bmap->n_eq; ++i)
8978 if (!isl_int_is_zero(bmap->eq[i][pos]))
8981 for (i = 0; i < bmap->n_ineq; ++i) {
8982 int sgn = isl_int_sgn(bmap->ineq[i][pos]);
8989 return lower && upper;
8992 int isl_basic_map_dim_is_bounded(__isl_keep isl_basic_map *bmap,
8993 enum isl_dim_type type, unsigned pos)
8995 return basic_map_dim_is_bounded(bmap, type, pos, 0, 0);
8998 int isl_basic_map_dim_has_lower_bound(__isl_keep isl_basic_map *bmap,
8999 enum isl_dim_type type, unsigned pos)
9001 return basic_map_dim_is_bounded(bmap, type, pos, 0, 1);
9004 int isl_basic_map_dim_has_upper_bound(__isl_keep isl_basic_map *bmap,
9005 enum isl_dim_type type, unsigned pos)
9007 return basic_map_dim_is_bounded(bmap, type, pos, 1, 0);
9010 int isl_map_dim_is_bounded(__isl_keep isl_map *map,
9011 enum isl_dim_type type, unsigned pos)
9018 for (i = 0; i < map->n; ++i) {
9020 bounded = isl_basic_map_dim_is_bounded(map->p[i], type, pos);
9021 if (bounded < 0 || !bounded)
9028 /* Return 1 if the specified dim is involved in both an upper bound
9029 * and a lower bound.
9031 int isl_set_dim_is_bounded(__isl_keep isl_set *set,
9032 enum isl_dim_type type, unsigned pos)
9034 return isl_map_dim_is_bounded((isl_map *)set, type, pos);
9037 static int has_bound(__isl_keep isl_map *map,
9038 enum isl_dim_type type, unsigned pos,
9039 int (*fn)(__isl_keep isl_basic_map *bmap,
9040 enum isl_dim_type type, unsigned pos))
9047 for (i = 0; i < map->n; ++i) {
9049 bounded = fn(map->p[i], type, pos);
9050 if (bounded < 0 || bounded)
9057 /* Return 1 if the specified dim is involved in any lower bound.
9059 int isl_set_dim_has_lower_bound(__isl_keep isl_set *set,
9060 enum isl_dim_type type, unsigned pos)
9062 return has_bound(set, type, pos, &isl_basic_map_dim_has_lower_bound);
9065 /* Return 1 if the specified dim is involved in any upper bound.
9067 int isl_set_dim_has_upper_bound(__isl_keep isl_set *set,
9068 enum isl_dim_type type, unsigned pos)
9070 return has_bound(set, type, pos, &isl_basic_map_dim_has_upper_bound);
9073 /* For each of the "n" variables starting at "first", determine
9074 * the sign of the variable and put the results in the first "n"
9075 * elements of the array "signs".
9077 * 1 means that the variable is non-negative
9078 * -1 means that the variable is non-positive
9079 * 0 means the variable attains both positive and negative values.
9081 int isl_basic_set_vars_get_sign(__isl_keep isl_basic_set *bset,
9082 unsigned first, unsigned n, int *signs)
9084 isl_vec *bound = NULL;
9085 struct isl_tab *tab = NULL;
9086 struct isl_tab_undo *snap;
9089 if (!bset || !signs)
9092 bound = isl_vec_alloc(bset->ctx, 1 + isl_basic_set_total_dim(bset));
9093 tab = isl_tab_from_basic_set(bset, 0);
9097 isl_seq_clr(bound->el, bound->size);
9098 isl_int_set_si(bound->el[0], -1);
9100 snap = isl_tab_snap(tab);
9101 for (i = 0; i < n; ++i) {
9104 isl_int_set_si(bound->el[1 + first + i], -1);
9105 if (isl_tab_add_ineq(tab, bound->el) < 0)
9108 isl_int_set_si(bound->el[1 + first + i], 0);
9109 if (isl_tab_rollback(tab, snap) < 0)
9117 isl_int_set_si(bound->el[1 + first + i], 1);
9118 if (isl_tab_add_ineq(tab, bound->el) < 0)
9121 isl_int_set_si(bound->el[1 + first + i], 0);
9122 if (isl_tab_rollback(tab, snap) < 0)
9125 signs[i] = empty ? -1 : 0;
9129 isl_vec_free(bound);
9133 isl_vec_free(bound);
9137 int isl_basic_set_dims_get_sign(__isl_keep isl_basic_set *bset,
9138 enum isl_dim_type type, unsigned first, unsigned n, int *signs)
9140 if (!bset || !signs)
9142 isl_assert(bset->ctx, first + n <= isl_basic_set_dim(bset, type),
9145 first += pos(bset->dim, type) - 1;
9146 return isl_basic_set_vars_get_sign(bset, first, n, signs);
9149 /* Check if the given basic map is obviously single-valued.
9150 * In particular, for each output dimension, check that there is
9151 * an equality that defines the output dimension in terms of
9152 * earlier dimensions.
9154 int isl_basic_map_plain_is_single_valued(__isl_keep isl_basic_map *bmap)
9164 total = 1 + isl_basic_map_total_dim(bmap);
9165 n_out = isl_basic_map_dim(bmap, isl_dim_out);
9166 o_out = isl_basic_map_offset(bmap, isl_dim_out);
9168 for (i = 0; i < n_out; ++i) {
9169 for (j = 0; j < bmap->n_eq; ++j) {
9170 if (isl_int_is_zero(bmap->eq[j][o_out + i]))
9172 if (isl_seq_first_non_zero(bmap->eq[j] + o_out + i + 1,
9173 total - (o_out + i + 1)) == -1)
9176 if (j >= bmap->n_eq)
9183 /* Check if the given basic map is single-valued.
9188 * and check if the result is a subset of the identity mapping.
9190 int isl_basic_map_is_single_valued(__isl_keep isl_basic_map *bmap)
9193 isl_basic_map *test;
9197 sv = isl_basic_map_plain_is_single_valued(bmap);
9201 test = isl_basic_map_reverse(isl_basic_map_copy(bmap));
9202 test = isl_basic_map_apply_range(test, isl_basic_map_copy(bmap));
9204 space = isl_basic_map_get_space(bmap);
9205 space = isl_space_map_from_set(isl_space_range(space));
9206 id = isl_basic_map_identity(space);
9208 sv = isl_basic_map_is_subset(test, id);
9210 isl_basic_map_free(test);
9211 isl_basic_map_free(id);
9216 /* Check if the given map is obviously single-valued.
9218 int isl_map_plain_is_single_valued(__isl_keep isl_map *map)
9227 return isl_basic_map_plain_is_single_valued(map->p[0]);
9230 /* Check if the given map is single-valued.
9235 * and check if the result is a subset of the identity mapping.
9237 int isl_map_is_single_valued(__isl_keep isl_map *map)
9244 sv = isl_map_plain_is_single_valued(map);
9248 test = isl_map_reverse(isl_map_copy(map));
9249 test = isl_map_apply_range(test, isl_map_copy(map));
9251 dim = isl_space_map_from_set(isl_space_range(isl_map_get_space(map)));
9252 id = isl_map_identity(dim);
9254 sv = isl_map_is_subset(test, id);
9262 int isl_map_is_injective(__isl_keep isl_map *map)
9266 map = isl_map_copy(map);
9267 map = isl_map_reverse(map);
9268 in = isl_map_is_single_valued(map);
9274 /* Check if the given map is obviously injective.
9276 int isl_map_plain_is_injective(__isl_keep isl_map *map)
9280 map = isl_map_copy(map);
9281 map = isl_map_reverse(map);
9282 in = isl_map_plain_is_single_valued(map);
9288 int isl_map_is_bijective(__isl_keep isl_map *map)
9292 sv = isl_map_is_single_valued(map);
9296 return isl_map_is_injective(map);
9299 int isl_set_is_singleton(__isl_keep isl_set *set)
9301 return isl_map_is_single_valued((isl_map *)set);
9304 int isl_map_is_translation(__isl_keep isl_map *map)
9309 delta = isl_map_deltas(isl_map_copy(map));
9310 ok = isl_set_is_singleton(delta);
9311 isl_set_free(delta);
9316 static int unique(isl_int *p, unsigned pos, unsigned len)
9318 if (isl_seq_first_non_zero(p, pos) != -1)
9320 if (isl_seq_first_non_zero(p + pos + 1, len - pos - 1) != -1)
9325 int isl_basic_set_is_box(__isl_keep isl_basic_set *bset)
9334 if (isl_basic_set_dim(bset, isl_dim_div) != 0)
9337 nvar = isl_basic_set_dim(bset, isl_dim_set);
9338 ovar = isl_space_offset(bset->dim, isl_dim_set);
9339 for (j = 0; j < nvar; ++j) {
9340 int lower = 0, upper = 0;
9341 for (i = 0; i < bset->n_eq; ++i) {
9342 if (isl_int_is_zero(bset->eq[i][1 + ovar + j]))
9344 if (!unique(bset->eq[i] + 1 + ovar, j, nvar))
9350 for (i = 0; i < bset->n_ineq; ++i) {
9351 if (isl_int_is_zero(bset->ineq[i][1 + ovar + j]))
9353 if (!unique(bset->ineq[i] + 1 + ovar, j, nvar))
9355 if (isl_int_is_pos(bset->ineq[i][1 + ovar + j]))
9360 if (!lower || !upper)
9367 int isl_set_is_box(__isl_keep isl_set *set)
9374 return isl_basic_set_is_box(set->p[0]);
9377 int isl_basic_set_is_wrapping(__isl_keep isl_basic_set *bset)
9382 return isl_space_is_wrapping(bset->dim);
9385 int isl_set_is_wrapping(__isl_keep isl_set *set)
9390 return isl_space_is_wrapping(set->dim);
9393 __isl_give isl_basic_set *isl_basic_map_wrap(__isl_take isl_basic_map *bmap)
9395 bmap = isl_basic_map_cow(bmap);
9399 bmap->dim = isl_space_wrap(bmap->dim);
9403 bmap = isl_basic_map_finalize(bmap);
9405 return (isl_basic_set *)bmap;
9407 isl_basic_map_free(bmap);
9411 __isl_give isl_set *isl_map_wrap(__isl_take isl_map *map)
9415 map = isl_map_cow(map);
9419 for (i = 0; i < map->n; ++i) {
9420 map->p[i] = (isl_basic_map *)isl_basic_map_wrap(map->p[i]);
9424 map->dim = isl_space_wrap(map->dim);
9428 return (isl_set *)map;
9434 __isl_give isl_basic_map *isl_basic_set_unwrap(__isl_take isl_basic_set *bset)
9436 bset = isl_basic_set_cow(bset);
9440 bset->dim = isl_space_unwrap(bset->dim);
9444 bset = isl_basic_set_finalize(bset);
9446 return (isl_basic_map *)bset;
9448 isl_basic_set_free(bset);
9452 __isl_give isl_map *isl_set_unwrap(__isl_take isl_set *set)
9459 if (!isl_set_is_wrapping(set))
9460 isl_die(set->ctx, isl_error_invalid, "not a wrapping set",
9463 set = isl_set_cow(set);
9467 for (i = 0; i < set->n; ++i) {
9468 set->p[i] = (isl_basic_set *)isl_basic_set_unwrap(set->p[i]);
9473 set->dim = isl_space_unwrap(set->dim);
9477 return (isl_map *)set;
9483 __isl_give isl_basic_map *isl_basic_map_reset(__isl_take isl_basic_map *bmap,
9484 enum isl_dim_type type)
9489 if (!isl_space_is_named_or_nested(bmap->dim, type))
9492 bmap = isl_basic_map_cow(bmap);
9496 bmap->dim = isl_space_reset(bmap->dim, type);
9500 bmap = isl_basic_map_finalize(bmap);
9504 isl_basic_map_free(bmap);
9508 __isl_give isl_map *isl_map_reset(__isl_take isl_map *map,
9509 enum isl_dim_type type)
9516 if (!isl_space_is_named_or_nested(map->dim, type))
9519 map = isl_map_cow(map);
9523 for (i = 0; i < map->n; ++i) {
9524 map->p[i] = isl_basic_map_reset(map->p[i], type);
9528 map->dim = isl_space_reset(map->dim, type);
9538 __isl_give isl_basic_map *isl_basic_map_flatten(__isl_take isl_basic_map *bmap)
9543 if (!bmap->dim->nested[0] && !bmap->dim->nested[1])
9546 bmap = isl_basic_map_cow(bmap);
9550 bmap->dim = isl_space_flatten(bmap->dim);
9554 bmap = isl_basic_map_finalize(bmap);
9558 isl_basic_map_free(bmap);
9562 __isl_give isl_basic_set *isl_basic_set_flatten(__isl_take isl_basic_set *bset)
9564 return (isl_basic_set *)isl_basic_map_flatten((isl_basic_map *)bset);
9567 __isl_give isl_basic_map *isl_basic_map_flatten_domain(
9568 __isl_take isl_basic_map *bmap)
9573 if (!bmap->dim->nested[0])
9576 bmap = isl_basic_map_cow(bmap);
9580 bmap->dim = isl_space_flatten_domain(bmap->dim);
9584 bmap = isl_basic_map_finalize(bmap);
9588 isl_basic_map_free(bmap);
9592 __isl_give isl_basic_map *isl_basic_map_flatten_range(
9593 __isl_take isl_basic_map *bmap)
9598 if (!bmap->dim->nested[1])
9601 bmap = isl_basic_map_cow(bmap);
9605 bmap->dim = isl_space_flatten_range(bmap->dim);
9609 bmap = isl_basic_map_finalize(bmap);
9613 isl_basic_map_free(bmap);
9617 __isl_give isl_map *isl_map_flatten(__isl_take isl_map *map)
9624 if (!map->dim->nested[0] && !map->dim->nested[1])
9627 map = isl_map_cow(map);
9631 for (i = 0; i < map->n; ++i) {
9632 map->p[i] = isl_basic_map_flatten(map->p[i]);
9636 map->dim = isl_space_flatten(map->dim);
9646 __isl_give isl_set *isl_set_flatten(__isl_take isl_set *set)
9648 return (isl_set *)isl_map_flatten((isl_map *)set);
9651 __isl_give isl_map *isl_set_flatten_map(__isl_take isl_set *set)
9653 isl_space *dim, *flat_dim;
9656 dim = isl_set_get_space(set);
9657 flat_dim = isl_space_flatten(isl_space_copy(dim));
9658 map = isl_map_identity(isl_space_join(isl_space_reverse(dim), flat_dim));
9659 map = isl_map_intersect_domain(map, set);
9664 __isl_give isl_map *isl_map_flatten_domain(__isl_take isl_map *map)
9671 if (!map->dim->nested[0])
9674 map = isl_map_cow(map);
9678 for (i = 0; i < map->n; ++i) {
9679 map->p[i] = isl_basic_map_flatten_domain(map->p[i]);
9683 map->dim = isl_space_flatten_domain(map->dim);
9693 __isl_give isl_map *isl_map_flatten_range(__isl_take isl_map *map)
9700 if (!map->dim->nested[1])
9703 map = isl_map_cow(map);
9707 for (i = 0; i < map->n; ++i) {
9708 map->p[i] = isl_basic_map_flatten_range(map->p[i]);
9712 map->dim = isl_space_flatten_range(map->dim);
9722 /* Reorder the dimensions of "bmap" according to the given dim_map
9723 * and set the dimension specification to "dim".
9725 __isl_give isl_basic_map *isl_basic_map_realign(__isl_take isl_basic_map *bmap,
9726 __isl_take isl_space *dim, __isl_take struct isl_dim_map *dim_map)
9731 bmap = isl_basic_map_cow(bmap);
9732 if (!bmap || !dim || !dim_map)
9735 flags = bmap->flags;
9736 ISL_FL_CLR(flags, ISL_BASIC_MAP_FINAL);
9737 ISL_FL_CLR(flags, ISL_BASIC_MAP_NORMALIZED);
9738 ISL_FL_CLR(flags, ISL_BASIC_MAP_NORMALIZED_DIVS);
9739 res = isl_basic_map_alloc_space(dim,
9740 bmap->n_div, bmap->n_eq, bmap->n_ineq);
9741 res = isl_basic_map_add_constraints_dim_map(res, bmap, dim_map);
9744 res = isl_basic_map_finalize(res);
9748 isl_basic_map_free(bmap);
9749 isl_space_free(dim);
9753 /* Reorder the dimensions of "map" according to given reordering.
9755 __isl_give isl_map *isl_map_realign(__isl_take isl_map *map,
9756 __isl_take isl_reordering *r)
9759 struct isl_dim_map *dim_map;
9761 map = isl_map_cow(map);
9762 dim_map = isl_dim_map_from_reordering(r);
9763 if (!map || !r || !dim_map)
9766 for (i = 0; i < map->n; ++i) {
9767 struct isl_dim_map *dim_map_i;
9769 dim_map_i = isl_dim_map_extend(dim_map, map->p[i]);
9771 map->p[i] = isl_basic_map_realign(map->p[i],
9772 isl_space_copy(r->dim), dim_map_i);
9778 map = isl_map_reset_space(map, isl_space_copy(r->dim));
9780 isl_reordering_free(r);
9786 isl_reordering_free(r);
9790 __isl_give isl_set *isl_set_realign(__isl_take isl_set *set,
9791 __isl_take isl_reordering *r)
9793 return (isl_set *)isl_map_realign((isl_map *)set, r);
9796 __isl_give isl_map *isl_map_align_params(__isl_take isl_map *map,
9797 __isl_take isl_space *model)
9804 ctx = isl_space_get_ctx(model);
9805 if (!isl_space_has_named_params(model))
9806 isl_die(ctx, isl_error_invalid,
9807 "model has unnamed parameters", goto error);
9808 if (!isl_space_has_named_params(map->dim))
9809 isl_die(ctx, isl_error_invalid,
9810 "relation has unnamed parameters", goto error);
9811 if (!isl_space_match(map->dim, isl_dim_param, model, isl_dim_param)) {
9812 isl_reordering *exp;
9814 model = isl_space_drop_dims(model, isl_dim_in,
9815 0, isl_space_dim(model, isl_dim_in));
9816 model = isl_space_drop_dims(model, isl_dim_out,
9817 0, isl_space_dim(model, isl_dim_out));
9818 exp = isl_parameter_alignment_reordering(map->dim, model);
9819 exp = isl_reordering_extend_space(exp, isl_map_get_space(map));
9820 map = isl_map_realign(map, exp);
9823 isl_space_free(model);
9826 isl_space_free(model);
9831 __isl_give isl_set *isl_set_align_params(__isl_take isl_set *set,
9832 __isl_take isl_space *model)
9834 return isl_map_align_params(set, model);
9837 __isl_give isl_mat *isl_basic_map_equalities_matrix(
9838 __isl_keep isl_basic_map *bmap, enum isl_dim_type c1,
9839 enum isl_dim_type c2, enum isl_dim_type c3,
9840 enum isl_dim_type c4, enum isl_dim_type c5)
9842 enum isl_dim_type c[5] = { c1, c2, c3, c4, c5 };
9843 struct isl_mat *mat;
9849 mat = isl_mat_alloc(bmap->ctx, bmap->n_eq,
9850 isl_basic_map_total_dim(bmap) + 1);
9853 for (i = 0; i < bmap->n_eq; ++i)
9854 for (j = 0, pos = 0; j < 5; ++j) {
9855 int off = isl_basic_map_offset(bmap, c[j]);
9856 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
9857 isl_int_set(mat->row[i][pos],
9858 bmap->eq[i][off + k]);
9866 __isl_give isl_mat *isl_basic_map_inequalities_matrix(
9867 __isl_keep isl_basic_map *bmap, enum isl_dim_type c1,
9868 enum isl_dim_type c2, enum isl_dim_type c3,
9869 enum isl_dim_type c4, enum isl_dim_type c5)
9871 enum isl_dim_type c[5] = { c1, c2, c3, c4, c5 };
9872 struct isl_mat *mat;
9878 mat = isl_mat_alloc(bmap->ctx, bmap->n_ineq,
9879 isl_basic_map_total_dim(bmap) + 1);
9882 for (i = 0; i < bmap->n_ineq; ++i)
9883 for (j = 0, pos = 0; j < 5; ++j) {
9884 int off = isl_basic_map_offset(bmap, c[j]);
9885 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
9886 isl_int_set(mat->row[i][pos],
9887 bmap->ineq[i][off + k]);
9895 __isl_give isl_basic_map *isl_basic_map_from_constraint_matrices(
9896 __isl_take isl_space *dim,
9897 __isl_take isl_mat *eq, __isl_take isl_mat *ineq, enum isl_dim_type c1,
9898 enum isl_dim_type c2, enum isl_dim_type c3,
9899 enum isl_dim_type c4, enum isl_dim_type c5)
9901 enum isl_dim_type c[5] = { c1, c2, c3, c4, c5 };
9902 isl_basic_map *bmap;
9908 if (!dim || !eq || !ineq)
9911 if (eq->n_col != ineq->n_col)
9912 isl_die(dim->ctx, isl_error_invalid,
9913 "equalities and inequalities matrices should have "
9914 "same number of columns", goto error);
9916 total = 1 + isl_space_dim(dim, isl_dim_all);
9918 if (eq->n_col < total)
9919 isl_die(dim->ctx, isl_error_invalid,
9920 "number of columns too small", goto error);
9922 extra = eq->n_col - total;
9924 bmap = isl_basic_map_alloc_space(isl_space_copy(dim), extra,
9925 eq->n_row, ineq->n_row);
9928 for (i = 0; i < extra; ++i) {
9929 k = isl_basic_map_alloc_div(bmap);
9932 isl_int_set_si(bmap->div[k][0], 0);
9934 for (i = 0; i < eq->n_row; ++i) {
9935 l = isl_basic_map_alloc_equality(bmap);
9938 for (j = 0, pos = 0; j < 5; ++j) {
9939 int off = isl_basic_map_offset(bmap, c[j]);
9940 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
9941 isl_int_set(bmap->eq[l][off + k],
9947 for (i = 0; i < ineq->n_row; ++i) {
9948 l = isl_basic_map_alloc_inequality(bmap);
9951 for (j = 0, pos = 0; j < 5; ++j) {
9952 int off = isl_basic_map_offset(bmap, c[j]);
9953 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
9954 isl_int_set(bmap->ineq[l][off + k],
9961 isl_space_free(dim);
9967 isl_space_free(dim);
9973 __isl_give isl_mat *isl_basic_set_equalities_matrix(
9974 __isl_keep isl_basic_set *bset, enum isl_dim_type c1,
9975 enum isl_dim_type c2, enum isl_dim_type c3, enum isl_dim_type c4)
9977 return isl_basic_map_equalities_matrix((isl_basic_map *)bset,
9978 c1, c2, c3, c4, isl_dim_in);
9981 __isl_give isl_mat *isl_basic_set_inequalities_matrix(
9982 __isl_keep isl_basic_set *bset, enum isl_dim_type c1,
9983 enum isl_dim_type c2, enum isl_dim_type c3, enum isl_dim_type c4)
9985 return isl_basic_map_inequalities_matrix((isl_basic_map *)bset,
9986 c1, c2, c3, c4, isl_dim_in);
9989 __isl_give isl_basic_set *isl_basic_set_from_constraint_matrices(
9990 __isl_take isl_space *dim,
9991 __isl_take isl_mat *eq, __isl_take isl_mat *ineq, enum isl_dim_type c1,
9992 enum isl_dim_type c2, enum isl_dim_type c3, enum isl_dim_type c4)
9994 return (isl_basic_set*)
9995 isl_basic_map_from_constraint_matrices(dim, eq, ineq,
9996 c1, c2, c3, c4, isl_dim_in);
9999 int isl_basic_map_can_zip(__isl_keep isl_basic_map *bmap)
10004 return isl_space_can_zip(bmap->dim);
10007 int isl_map_can_zip(__isl_keep isl_map *map)
10012 return isl_space_can_zip(map->dim);
10015 /* Given a basic map (A -> B) -> (C -> D), return the corresponding basic map
10016 * (A -> C) -> (B -> D).
10018 __isl_give isl_basic_map *isl_basic_map_zip(__isl_take isl_basic_map *bmap)
10027 if (!isl_basic_map_can_zip(bmap))
10028 isl_die(bmap->ctx, isl_error_invalid,
10029 "basic map cannot be zipped", goto error);
10030 pos = isl_basic_map_offset(bmap, isl_dim_in) +
10031 isl_space_dim(bmap->dim->nested[0], isl_dim_in);
10032 n1 = isl_space_dim(bmap->dim->nested[0], isl_dim_out);
10033 n2 = isl_space_dim(bmap->dim->nested[1], isl_dim_in);
10034 bmap = isl_basic_map_cow(bmap);
10035 bmap = isl_basic_map_swap_vars(bmap, pos, n1, n2);
10038 bmap->dim = isl_space_zip(bmap->dim);
10043 isl_basic_map_free(bmap);
10047 /* Given a map (A -> B) -> (C -> D), return the corresponding map
10048 * (A -> C) -> (B -> D).
10050 __isl_give isl_map *isl_map_zip(__isl_take isl_map *map)
10057 if (!isl_map_can_zip(map))
10058 isl_die(map->ctx, isl_error_invalid, "map cannot be zipped",
10061 map = isl_map_cow(map);
10065 for (i = 0; i < map->n; ++i) {
10066 map->p[i] = isl_basic_map_zip(map->p[i]);
10071 map->dim = isl_space_zip(map->dim);
10081 /* Can we apply isl_basic_map_curry to "bmap"?
10082 * That is, does it have a nested relation in its domain?
10084 int isl_basic_map_can_curry(__isl_keep isl_basic_map *bmap)
10089 return isl_space_can_curry(bmap->dim);
10092 /* Can we apply isl_map_curry to "map"?
10093 * That is, does it have a nested relation in its domain?
10095 int isl_map_can_curry(__isl_keep isl_map *map)
10100 return isl_space_can_curry(map->dim);
10103 /* Given a basic map (A -> B) -> C, return the corresponding basic map
10106 __isl_give isl_basic_map *isl_basic_map_curry(__isl_take isl_basic_map *bmap)
10112 if (!isl_basic_map_can_curry(bmap))
10113 isl_die(bmap->ctx, isl_error_invalid,
10114 "basic map cannot be curried", goto error);
10115 bmap->dim = isl_space_curry(bmap->dim);
10120 isl_basic_map_free(bmap);
10124 /* Given a map (A -> B) -> C, return the corresponding map
10127 __isl_give isl_map *isl_map_curry(__isl_take isl_map *map)
10134 if (!isl_map_can_curry(map))
10135 isl_die(map->ctx, isl_error_invalid, "map cannot be curried",
10138 map = isl_map_cow(map);
10142 for (i = 0; i < map->n; ++i) {
10143 map->p[i] = isl_basic_map_curry(map->p[i]);
10148 map->dim = isl_space_curry(map->dim);
10158 /* Construct a basic map mapping the domain of the affine expression
10159 * to a one-dimensional range prescribed by the affine expression.
10161 __isl_give isl_basic_map *isl_basic_map_from_aff(__isl_take isl_aff *aff)
10165 isl_local_space *ls;
10166 isl_basic_map *bmap;
10171 ls = isl_aff_get_local_space(aff);
10172 bmap = isl_basic_map_from_local_space(ls);
10173 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
10174 k = isl_basic_map_alloc_equality(bmap);
10178 pos = isl_basic_map_offset(bmap, isl_dim_out);
10179 isl_seq_cpy(bmap->eq[k], aff->v->el + 1, pos);
10180 isl_int_neg(bmap->eq[k][pos], aff->v->el[0]);
10181 isl_seq_cpy(bmap->eq[k] + pos + 1, aff->v->el + 1 + pos,
10182 aff->v->size - (pos + 1));
10185 bmap = isl_basic_map_finalize(bmap);
10189 isl_basic_map_free(bmap);
10193 /* Construct a map mapping the domain of the affine expression
10194 * to a one-dimensional range prescribed by the affine expression.
10196 __isl_give isl_map *isl_map_from_aff(__isl_take isl_aff *aff)
10198 isl_basic_map *bmap;
10200 bmap = isl_basic_map_from_aff(aff);
10201 return isl_map_from_basic_map(bmap);
10204 /* Construct a basic map mapping the domain the multi-affine expression
10205 * to its range, with each dimension in the range equated to the
10206 * corresponding affine expression.
10208 __isl_give isl_basic_map *isl_basic_map_from_multi_aff(
10209 __isl_take isl_multi_aff *maff)
10213 isl_basic_map *bmap;
10218 if (isl_space_dim(maff->space, isl_dim_out) != maff->n)
10219 isl_die(isl_multi_aff_get_ctx(maff), isl_error_internal,
10220 "invalid space", return isl_multi_aff_free(maff));
10222 space = isl_space_domain(isl_multi_aff_get_space(maff));
10223 bmap = isl_basic_map_universe(isl_space_from_domain(space));
10225 for (i = 0; i < maff->n; ++i) {
10227 isl_basic_map *bmap_i;
10229 aff = isl_aff_copy(maff->p[i]);
10230 bmap_i = isl_basic_map_from_aff(aff);
10232 bmap = isl_basic_map_flat_range_product(bmap, bmap_i);
10235 bmap = isl_basic_map_reset_space(bmap, isl_multi_aff_get_space(maff));
10237 isl_multi_aff_free(maff);
10241 /* Construct a map mapping the domain the multi-affine expression
10242 * to its range, with each dimension in the range equated to the
10243 * corresponding affine expression.
10245 __isl_give isl_map *isl_map_from_multi_aff(__isl_take isl_multi_aff *maff)
10247 isl_basic_map *bmap;
10249 bmap = isl_basic_map_from_multi_aff(maff);
10250 return isl_map_from_basic_map(bmap);
10253 /* Construct a basic map mapping a domain in the given space to
10254 * to an n-dimensional range, with n the number of elements in the list,
10255 * where each coordinate in the range is prescribed by the
10256 * corresponding affine expression.
10257 * The domains of all affine expressions in the list are assumed to match
10260 __isl_give isl_basic_map *isl_basic_map_from_aff_list(
10261 __isl_take isl_space *domain_dim, __isl_take isl_aff_list *list)
10265 isl_basic_map *bmap;
10270 dim = isl_space_from_domain(domain_dim);
10271 bmap = isl_basic_map_universe(dim);
10273 for (i = 0; i < list->n; ++i) {
10275 isl_basic_map *bmap_i;
10277 aff = isl_aff_copy(list->p[i]);
10278 bmap_i = isl_basic_map_from_aff(aff);
10280 bmap = isl_basic_map_flat_range_product(bmap, bmap_i);
10283 isl_aff_list_free(list);
10287 __isl_give isl_set *isl_set_equate(__isl_take isl_set *set,
10288 enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2)
10290 return isl_map_equate(set, type1, pos1, type2, pos2);
10293 /* Construct a basic map where the given dimensions are equal to each other.
10295 static __isl_give isl_basic_map *equator(__isl_take isl_space *space,
10296 enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2)
10298 isl_basic_map *bmap = NULL;
10304 if (pos1 >= isl_space_dim(space, type1))
10305 isl_die(isl_space_get_ctx(space), isl_error_invalid,
10306 "index out of bounds", goto error);
10307 if (pos2 >= isl_space_dim(space, type2))
10308 isl_die(isl_space_get_ctx(space), isl_error_invalid,
10309 "index out of bounds", goto error);
10311 if (type1 == type2 && pos1 == pos2)
10312 return isl_basic_map_universe(space);
10314 bmap = isl_basic_map_alloc_space(isl_space_copy(space), 0, 1, 0);
10315 i = isl_basic_map_alloc_equality(bmap);
10318 isl_seq_clr(bmap->eq[i], 1 + isl_basic_map_total_dim(bmap));
10319 pos1 += isl_basic_map_offset(bmap, type1);
10320 pos2 += isl_basic_map_offset(bmap, type2);
10321 isl_int_set_si(bmap->eq[i][pos1], -1);
10322 isl_int_set_si(bmap->eq[i][pos2], 1);
10323 bmap = isl_basic_map_finalize(bmap);
10324 isl_space_free(space);
10327 isl_space_free(space);
10328 isl_basic_map_free(bmap);
10332 /* Add a constraint imposing that the given two dimensions are equal.
10334 __isl_give isl_basic_map *isl_basic_map_equate(__isl_take isl_basic_map *bmap,
10335 enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2)
10339 eq = equator(isl_basic_map_get_space(bmap), type1, pos1, type2, pos2);
10341 bmap = isl_basic_map_intersect(bmap, eq);
10346 /* Add a constraint imposing that the given two dimensions are equal.
10348 __isl_give isl_map *isl_map_equate(__isl_take isl_map *map,
10349 enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2)
10351 isl_basic_map *bmap;
10353 bmap = equator(isl_map_get_space(map), type1, pos1, type2, pos2);
10355 map = isl_map_intersect(map, isl_map_from_basic_map(bmap));
10360 /* Add a constraint imposing that the given two dimensions have opposite values.
10362 __isl_give isl_map *isl_map_oppose(__isl_take isl_map *map,
10363 enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2)
10365 isl_basic_map *bmap = NULL;
10371 if (pos1 >= isl_map_dim(map, type1))
10372 isl_die(map->ctx, isl_error_invalid,
10373 "index out of bounds", goto error);
10374 if (pos2 >= isl_map_dim(map, type2))
10375 isl_die(map->ctx, isl_error_invalid,
10376 "index out of bounds", goto error);
10378 bmap = isl_basic_map_alloc_space(isl_map_get_space(map), 0, 1, 0);
10379 i = isl_basic_map_alloc_equality(bmap);
10382 isl_seq_clr(bmap->eq[i], 1 + isl_basic_map_total_dim(bmap));
10383 pos1 += isl_basic_map_offset(bmap, type1);
10384 pos2 += isl_basic_map_offset(bmap, type2);
10385 isl_int_set_si(bmap->eq[i][pos1], 1);
10386 isl_int_set_si(bmap->eq[i][pos2], 1);
10387 bmap = isl_basic_map_finalize(bmap);
10389 map = isl_map_intersect(map, isl_map_from_basic_map(bmap));
10393 isl_basic_map_free(bmap);
10398 /* Add a constraint imposing that the value of the first dimension is
10399 * greater than that of the second.
10401 __isl_give isl_map *isl_map_order_gt(__isl_take isl_map *map,
10402 enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2)
10404 isl_basic_map *bmap = NULL;
10410 if (pos1 >= isl_map_dim(map, type1))
10411 isl_die(map->ctx, isl_error_invalid,
10412 "index out of bounds", goto error);
10413 if (pos2 >= isl_map_dim(map, type2))
10414 isl_die(map->ctx, isl_error_invalid,
10415 "index out of bounds", goto error);
10417 if (type1 == type2 && pos1 == pos2) {
10418 isl_space *space = isl_map_get_space(map);
10420 return isl_map_empty(space);
10423 bmap = isl_basic_map_alloc_space(isl_map_get_space(map), 0, 0, 1);
10424 i = isl_basic_map_alloc_inequality(bmap);
10427 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
10428 pos1 += isl_basic_map_offset(bmap, type1);
10429 pos2 += isl_basic_map_offset(bmap, type2);
10430 isl_int_set_si(bmap->ineq[i][pos1], 1);
10431 isl_int_set_si(bmap->ineq[i][pos2], -1);
10432 isl_int_set_si(bmap->ineq[i][0], -1);
10433 bmap = isl_basic_map_finalize(bmap);
10435 map = isl_map_intersect(map, isl_map_from_basic_map(bmap));
10439 isl_basic_map_free(bmap);
10444 /* Add a constraint imposing that the value of the first dimension is
10445 * smaller than that of the second.
10447 __isl_give isl_map *isl_map_order_lt(__isl_take isl_map *map,
10448 enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2)
10450 return isl_map_order_gt(map, type2, pos2, type1, pos1);
10453 __isl_give isl_aff *isl_basic_map_get_div(__isl_keep isl_basic_map *bmap,
10457 isl_local_space *ls;
10462 if (!isl_basic_map_divs_known(bmap))
10463 isl_die(isl_basic_map_get_ctx(bmap), isl_error_invalid,
10464 "some divs are unknown", return NULL);
10466 ls = isl_basic_map_get_local_space(bmap);
10467 div = isl_local_space_get_div(ls, pos);
10468 isl_local_space_free(ls);
10473 __isl_give isl_aff *isl_basic_set_get_div(__isl_keep isl_basic_set *bset,
10476 return isl_basic_map_get_div(bset, pos);
10479 /* Plug in "subs" for dimension "type", "pos" of "bset".
10481 * Let i be the dimension to replace and let "subs" be of the form
10485 * Any integer division with a non-zero coefficient for i,
10487 * floor((a i + g)/m)
10491 * floor((a f + d g)/(m d))
10493 * Constraints of the form
10501 __isl_give isl_basic_set *isl_basic_set_substitute(
10502 __isl_take isl_basic_set *bset,
10503 enum isl_dim_type type, unsigned pos, __isl_keep isl_aff *subs)
10509 if (bset && isl_basic_set_plain_is_empty(bset))
10512 bset = isl_basic_set_cow(bset);
10513 if (!bset || !subs)
10516 ctx = isl_basic_set_get_ctx(bset);
10517 if (!isl_space_is_equal(bset->dim, subs->ls->dim))
10518 isl_die(ctx, isl_error_invalid,
10519 "spaces don't match", goto error);
10520 if (isl_local_space_dim(subs->ls, isl_dim_div) != 0)
10521 isl_die(ctx, isl_error_unsupported,
10522 "cannot handle divs yet", goto error);
10524 pos += isl_basic_set_offset(bset, type);
10528 for (i = 0; i < bset->n_eq; ++i) {
10529 if (isl_int_is_zero(bset->eq[i][pos]))
10531 isl_int_set(v, bset->eq[i][pos]);
10532 isl_int_set_si(bset->eq[i][pos], 0);
10533 isl_seq_combine(bset->eq[i], subs->v->el[0], bset->eq[i],
10534 v, subs->v->el + 1, subs->v->size - 1);
10537 for (i = 0; i < bset->n_ineq; ++i) {
10538 if (isl_int_is_zero(bset->ineq[i][pos]))
10540 isl_int_set(v, bset->ineq[i][pos]);
10541 isl_int_set_si(bset->ineq[i][pos], 0);
10542 isl_seq_combine(bset->ineq[i], subs->v->el[0], bset->ineq[i],
10543 v, subs->v->el + 1, subs->v->size - 1);
10546 for (i = 0; i < bset->n_div; ++i) {
10547 if (isl_int_is_zero(bset->div[i][1 + pos]))
10549 isl_int_set(v, bset->div[i][1 + pos]);
10550 isl_int_set_si(bset->div[i][1 + pos], 0);
10551 isl_seq_combine(bset->div[i] + 1,
10552 subs->v->el[0], bset->div[i] + 1,
10553 v, subs->v->el + 1, subs->v->size - 1);
10554 isl_int_mul(bset->div[i][0], bset->div[i][0], subs->v->el[0]);
10559 bset = isl_basic_set_simplify(bset);
10560 return isl_basic_set_finalize(bset);
10562 isl_basic_set_free(bset);
10566 /* Plug in "subs" for dimension "type", "pos" of "set".
10568 __isl_give isl_set *isl_set_substitute(__isl_take isl_set *set,
10569 enum isl_dim_type type, unsigned pos, __isl_keep isl_aff *subs)
10573 if (set && isl_set_plain_is_empty(set))
10576 set = isl_set_cow(set);
10580 for (i = set->n - 1; i >= 0; --i) {
10581 set->p[i] = isl_basic_set_substitute(set->p[i], type, pos, subs);
10582 if (remove_if_empty(set, i) < 0)