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_basic_set *isl_basic_set_remove_divs_involving_dims(
1976 __isl_take isl_basic_set *bset,
1977 enum isl_dim_type type, unsigned first, unsigned n)
1979 return isl_basic_map_remove_divs_involving_dims(bset, type, first, n);
1982 __isl_give isl_map *isl_map_remove_divs_involving_dims(__isl_take isl_map *map,
1983 enum isl_dim_type type, unsigned first, unsigned n)
1992 map = isl_map_cow(map);
1996 for (i = 0; i < map->n; ++i) {
1997 map->p[i] = isl_basic_map_remove_divs_involving_dims(map->p[i],
2008 __isl_give isl_set *isl_set_remove_divs_involving_dims(__isl_take isl_set *set,
2009 enum isl_dim_type type, unsigned first, unsigned n)
2011 return (isl_set *)isl_map_remove_divs_involving_dims((isl_map *)set,
2015 /* Does the desciption of "bmap" depend on the specified dimensions?
2016 * We also check whether the dimensions appear in any of the div definitions.
2017 * In principle there is no need for this check. If the dimensions appear
2018 * in a div definition, they also appear in the defining constraints of that
2021 int isl_basic_map_involves_dims(__isl_keep isl_basic_map *bmap,
2022 enum isl_dim_type type, unsigned first, unsigned n)
2029 if (first + n > isl_basic_map_dim(bmap, type))
2030 isl_die(bmap->ctx, isl_error_invalid,
2031 "index out of bounds", return -1);
2033 first += isl_basic_map_offset(bmap, type);
2034 for (i = 0; i < bmap->n_eq; ++i)
2035 if (isl_seq_first_non_zero(bmap->eq[i] + first, n) >= 0)
2037 for (i = 0; i < bmap->n_ineq; ++i)
2038 if (isl_seq_first_non_zero(bmap->ineq[i] + first, n) >= 0)
2040 for (i = 0; i < bmap->n_div; ++i) {
2041 if (isl_int_is_zero(bmap->div[i][0]))
2043 if (isl_seq_first_non_zero(bmap->div[i] + 1 + first, n) >= 0)
2050 int isl_map_involves_dims(__isl_keep isl_map *map,
2051 enum isl_dim_type type, unsigned first, unsigned n)
2058 if (first + n > isl_map_dim(map, type))
2059 isl_die(map->ctx, isl_error_invalid,
2060 "index out of bounds", return -1);
2062 for (i = 0; i < map->n; ++i) {
2063 int involves = isl_basic_map_involves_dims(map->p[i],
2065 if (involves < 0 || involves)
2072 int isl_basic_set_involves_dims(__isl_keep isl_basic_set *bset,
2073 enum isl_dim_type type, unsigned first, unsigned n)
2075 return isl_basic_map_involves_dims(bset, type, first, n);
2078 int isl_set_involves_dims(__isl_keep isl_set *set,
2079 enum isl_dim_type type, unsigned first, unsigned n)
2081 return isl_map_involves_dims(set, type, first, n);
2084 /* Return true if the definition of the given div is unknown or depends
2087 static int div_is_unknown(__isl_keep isl_basic_map *bmap, int div)
2090 unsigned div_offset = isl_basic_map_offset(bmap, isl_dim_div);
2092 if (isl_int_is_zero(bmap->div[div][0]))
2095 for (i = bmap->n_div - 1; i >= 0; --i) {
2096 if (isl_int_is_zero(bmap->div[div][1 + div_offset + i]))
2098 if (div_is_unknown(bmap, i))
2105 /* Remove all divs that are unknown or defined in terms of unknown divs.
2107 __isl_give isl_basic_map *isl_basic_map_remove_unknown_divs(
2108 __isl_take isl_basic_map *bmap)
2115 for (i = bmap->n_div - 1; i >= 0; --i) {
2116 if (!div_is_unknown(bmap, i))
2118 bmap = isl_basic_map_remove_dims(bmap, isl_dim_div, i, 1);
2127 __isl_give isl_map *isl_map_remove_unknown_divs(__isl_take isl_map *map)
2136 map = isl_map_cow(map);
2140 for (i = 0; i < map->n; ++i) {
2141 map->p[i] = isl_basic_map_remove_unknown_divs(map->p[i]);
2151 __isl_give isl_set *isl_set_remove_unknown_divs(__isl_take isl_set *set)
2153 return (isl_set *)isl_map_remove_unknown_divs((isl_map *)set);
2156 __isl_give isl_basic_set *isl_basic_set_remove_dims(
2157 __isl_take isl_basic_set *bset,
2158 enum isl_dim_type type, unsigned first, unsigned n)
2160 return (isl_basic_set *)
2161 isl_basic_map_remove_dims((isl_basic_map *)bset, type, first, n);
2164 struct isl_map *isl_map_remove_dims(struct isl_map *map,
2165 enum isl_dim_type type, unsigned first, unsigned n)
2172 map = isl_map_cow(map);
2175 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
2177 for (i = 0; i < map->n; ++i) {
2178 map->p[i] = isl_basic_map_eliminate_vars(map->p[i],
2179 isl_basic_map_offset(map->p[i], type) - 1 + first, n);
2183 map = isl_map_drop(map, type, first, n);
2190 __isl_give isl_set *isl_set_remove_dims(__isl_take isl_set *bset,
2191 enum isl_dim_type type, unsigned first, unsigned n)
2193 return (isl_set *)isl_map_remove_dims((isl_map *)bset, type, first, n);
2196 /* Project out n inputs starting at first using Fourier-Motzkin */
2197 struct isl_map *isl_map_remove_inputs(struct isl_map *map,
2198 unsigned first, unsigned n)
2200 return isl_map_remove_dims(map, isl_dim_in, first, n);
2203 static void dump_term(struct isl_basic_map *bmap,
2204 isl_int c, int pos, FILE *out)
2207 unsigned in = isl_basic_map_n_in(bmap);
2208 unsigned dim = in + isl_basic_map_n_out(bmap);
2209 unsigned nparam = isl_basic_map_n_param(bmap);
2211 isl_int_print(out, c, 0);
2213 if (!isl_int_is_one(c))
2214 isl_int_print(out, c, 0);
2215 if (pos < 1 + nparam) {
2216 name = isl_space_get_dim_name(bmap->dim,
2217 isl_dim_param, pos - 1);
2219 fprintf(out, "%s", name);
2221 fprintf(out, "p%d", pos - 1);
2222 } else if (pos < 1 + nparam + in)
2223 fprintf(out, "i%d", pos - 1 - nparam);
2224 else if (pos < 1 + nparam + dim)
2225 fprintf(out, "o%d", pos - 1 - nparam - in);
2227 fprintf(out, "e%d", pos - 1 - nparam - dim);
2231 static void dump_constraint_sign(struct isl_basic_map *bmap, isl_int *c,
2232 int sign, FILE *out)
2236 unsigned len = 1 + isl_basic_map_total_dim(bmap);
2240 for (i = 0, first = 1; i < len; ++i) {
2241 if (isl_int_sgn(c[i]) * sign <= 0)
2244 fprintf(out, " + ");
2246 isl_int_abs(v, c[i]);
2247 dump_term(bmap, v, i, out);
2254 static void dump_constraint(struct isl_basic_map *bmap, isl_int *c,
2255 const char *op, FILE *out, int indent)
2259 fprintf(out, "%*s", indent, "");
2261 dump_constraint_sign(bmap, c, 1, out);
2262 fprintf(out, " %s ", op);
2263 dump_constraint_sign(bmap, c, -1, out);
2267 for (i = bmap->n_div; i < bmap->extra; ++i) {
2268 if (isl_int_is_zero(c[1+isl_space_dim(bmap->dim, isl_dim_all)+i]))
2270 fprintf(out, "%*s", indent, "");
2271 fprintf(out, "ERROR: unused div coefficient not zero\n");
2276 static void dump_constraints(struct isl_basic_map *bmap,
2277 isl_int **c, unsigned n,
2278 const char *op, FILE *out, int indent)
2282 for (i = 0; i < n; ++i)
2283 dump_constraint(bmap, c[i], op, out, indent);
2286 static void dump_affine(struct isl_basic_map *bmap, isl_int *exp, FILE *out)
2290 unsigned total = isl_basic_map_total_dim(bmap);
2292 for (j = 0; j < 1 + total; ++j) {
2293 if (isl_int_is_zero(exp[j]))
2295 if (!first && isl_int_is_pos(exp[j]))
2297 dump_term(bmap, exp[j], j, out);
2302 static void dump(struct isl_basic_map *bmap, FILE *out, int indent)
2306 dump_constraints(bmap, bmap->eq, bmap->n_eq, "=", out, indent);
2307 dump_constraints(bmap, bmap->ineq, bmap->n_ineq, ">=", out, indent);
2309 for (i = 0; i < bmap->n_div; ++i) {
2310 fprintf(out, "%*s", indent, "");
2311 fprintf(out, "e%d = [(", i);
2312 dump_affine(bmap, bmap->div[i]+1, out);
2314 isl_int_print(out, bmap->div[i][0], 0);
2315 fprintf(out, "]\n");
2319 void isl_basic_set_print_internal(struct isl_basic_set *bset,
2320 FILE *out, int indent)
2323 fprintf(out, "null basic set\n");
2327 fprintf(out, "%*s", indent, "");
2328 fprintf(out, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n",
2329 bset->ref, bset->dim->nparam, bset->dim->n_out,
2330 bset->extra, bset->flags);
2331 dump((struct isl_basic_map *)bset, out, indent);
2334 void isl_basic_map_print_internal(struct isl_basic_map *bmap,
2335 FILE *out, int indent)
2338 fprintf(out, "null basic map\n");
2342 fprintf(out, "%*s", indent, "");
2343 fprintf(out, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, "
2344 "flags: %x, n_name: %d\n",
2346 bmap->dim->nparam, bmap->dim->n_in, bmap->dim->n_out,
2347 bmap->extra, bmap->flags, bmap->dim->n_id);
2348 dump(bmap, out, indent);
2351 int isl_inequality_negate(struct isl_basic_map *bmap, unsigned pos)
2356 total = isl_basic_map_total_dim(bmap);
2357 isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
2358 isl_seq_neg(bmap->ineq[pos], bmap->ineq[pos], 1 + total);
2359 isl_int_sub_ui(bmap->ineq[pos][0], bmap->ineq[pos][0], 1);
2360 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
2364 __isl_give isl_set *isl_set_alloc_space(__isl_take isl_space *dim, int n,
2367 struct isl_set *set;
2371 isl_assert(dim->ctx, dim->n_in == 0, goto error);
2372 isl_assert(dim->ctx, n >= 0, goto error);
2373 set = isl_alloc(dim->ctx, struct isl_set,
2374 sizeof(struct isl_set) +
2375 (n - 1) * sizeof(struct isl_basic_set *));
2379 set->ctx = dim->ctx;
2380 isl_ctx_ref(set->ctx);
2388 isl_space_free(dim);
2392 struct isl_set *isl_set_alloc(struct isl_ctx *ctx,
2393 unsigned nparam, unsigned dim, int n, unsigned flags)
2395 struct isl_set *set;
2398 dims = isl_space_alloc(ctx, nparam, 0, dim);
2402 set = isl_set_alloc_space(dims, n, flags);
2406 /* Make sure "map" has room for at least "n" more basic maps.
2408 struct isl_map *isl_map_grow(struct isl_map *map, int n)
2411 struct isl_map *grown = NULL;
2415 isl_assert(map->ctx, n >= 0, goto error);
2416 if (map->n + n <= map->size)
2418 grown = isl_map_alloc_space(isl_map_get_space(map), map->n + n, map->flags);
2421 for (i = 0; i < map->n; ++i) {
2422 grown->p[i] = isl_basic_map_copy(map->p[i]);
2430 isl_map_free(grown);
2435 /* Make sure "set" has room for at least "n" more basic sets.
2437 struct isl_set *isl_set_grow(struct isl_set *set, int n)
2439 return (struct isl_set *)isl_map_grow((struct isl_map *)set, n);
2442 struct isl_set *isl_set_dup(struct isl_set *set)
2445 struct isl_set *dup;
2450 dup = isl_set_alloc_space(isl_space_copy(set->dim), set->n, set->flags);
2453 for (i = 0; i < set->n; ++i)
2454 dup = isl_set_add_basic_set(dup, isl_basic_set_copy(set->p[i]));
2458 struct isl_set *isl_set_from_basic_set(struct isl_basic_set *bset)
2460 return isl_map_from_basic_map(bset);
2463 struct isl_map *isl_map_from_basic_map(struct isl_basic_map *bmap)
2465 struct isl_map *map;
2470 map = isl_map_alloc_space(isl_space_copy(bmap->dim), 1, ISL_MAP_DISJOINT);
2471 return isl_map_add_basic_map(map, bmap);
2474 __isl_give isl_set *isl_set_add_basic_set(__isl_take isl_set *set,
2475 __isl_take isl_basic_set *bset)
2477 return (struct isl_set *)isl_map_add_basic_map((struct isl_map *)set,
2478 (struct isl_basic_map *)bset);
2481 void *isl_set_free(__isl_take isl_set *set)
2491 isl_ctx_deref(set->ctx);
2492 for (i = 0; i < set->n; ++i)
2493 isl_basic_set_free(set->p[i]);
2494 isl_space_free(set->dim);
2500 void isl_set_print_internal(struct isl_set *set, FILE *out, int indent)
2505 fprintf(out, "null set\n");
2509 fprintf(out, "%*s", indent, "");
2510 fprintf(out, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
2511 set->ref, set->n, set->dim->nparam, set->dim->n_out,
2513 for (i = 0; i < set->n; ++i) {
2514 fprintf(out, "%*s", indent, "");
2515 fprintf(out, "basic set %d:\n", i);
2516 isl_basic_set_print_internal(set->p[i], out, indent+4);
2520 void isl_map_print_internal(struct isl_map *map, FILE *out, int indent)
2525 fprintf(out, "null map\n");
2529 fprintf(out, "%*s", indent, "");
2530 fprintf(out, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, "
2531 "flags: %x, n_name: %d\n",
2532 map->ref, map->n, map->dim->nparam, map->dim->n_in,
2533 map->dim->n_out, map->flags, map->dim->n_id);
2534 for (i = 0; i < map->n; ++i) {
2535 fprintf(out, "%*s", indent, "");
2536 fprintf(out, "basic map %d:\n", i);
2537 isl_basic_map_print_internal(map->p[i], out, indent+4);
2541 struct isl_basic_map *isl_basic_map_intersect_domain(
2542 struct isl_basic_map *bmap, struct isl_basic_set *bset)
2544 struct isl_basic_map *bmap_domain;
2549 isl_assert(bset->ctx, isl_space_match(bmap->dim, isl_dim_param,
2550 bset->dim, isl_dim_param), goto error);
2552 if (isl_space_dim(bset->dim, isl_dim_set) != 0)
2553 isl_assert(bset->ctx,
2554 isl_basic_map_compatible_domain(bmap, bset), goto error);
2556 bmap = isl_basic_map_cow(bmap);
2559 bmap = isl_basic_map_extend_space(bmap, isl_space_copy(bmap->dim),
2560 bset->n_div, bset->n_eq, bset->n_ineq);
2561 bmap_domain = isl_basic_map_from_domain(bset);
2562 bmap = add_constraints(bmap, bmap_domain, 0, 0);
2564 bmap = isl_basic_map_simplify(bmap);
2565 return isl_basic_map_finalize(bmap);
2567 isl_basic_map_free(bmap);
2568 isl_basic_set_free(bset);
2572 struct isl_basic_map *isl_basic_map_intersect_range(
2573 struct isl_basic_map *bmap, struct isl_basic_set *bset)
2575 struct isl_basic_map *bmap_range;
2580 isl_assert(bset->ctx, isl_space_match(bmap->dim, isl_dim_param,
2581 bset->dim, isl_dim_param), goto error);
2583 if (isl_space_dim(bset->dim, isl_dim_set) != 0)
2584 isl_assert(bset->ctx,
2585 isl_basic_map_compatible_range(bmap, bset), goto error);
2587 if (isl_basic_set_is_universe(bset)) {
2588 isl_basic_set_free(bset);
2592 bmap = isl_basic_map_cow(bmap);
2595 bmap = isl_basic_map_extend_space(bmap, isl_space_copy(bmap->dim),
2596 bset->n_div, bset->n_eq, bset->n_ineq);
2597 bmap_range = isl_basic_map_from_basic_set(bset, isl_space_copy(bset->dim));
2598 bmap = add_constraints(bmap, bmap_range, 0, 0);
2600 bmap = isl_basic_map_simplify(bmap);
2601 return isl_basic_map_finalize(bmap);
2603 isl_basic_map_free(bmap);
2604 isl_basic_set_free(bset);
2608 int isl_basic_map_contains(struct isl_basic_map *bmap, struct isl_vec *vec)
2614 total = 1 + isl_basic_map_total_dim(bmap);
2615 if (total != vec->size)
2620 for (i = 0; i < bmap->n_eq; ++i) {
2621 isl_seq_inner_product(vec->el, bmap->eq[i], total, &s);
2622 if (!isl_int_is_zero(s)) {
2628 for (i = 0; i < bmap->n_ineq; ++i) {
2629 isl_seq_inner_product(vec->el, bmap->ineq[i], total, &s);
2630 if (isl_int_is_neg(s)) {
2641 int isl_basic_set_contains(struct isl_basic_set *bset, struct isl_vec *vec)
2643 return isl_basic_map_contains((struct isl_basic_map *)bset, vec);
2646 struct isl_basic_map *isl_basic_map_intersect(
2647 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2649 struct isl_vec *sample = NULL;
2651 if (!bmap1 || !bmap2)
2654 isl_assert(bmap1->ctx, isl_space_match(bmap1->dim, isl_dim_param,
2655 bmap2->dim, isl_dim_param), goto error);
2656 if (isl_space_dim(bmap1->dim, isl_dim_all) ==
2657 isl_space_dim(bmap1->dim, isl_dim_param) &&
2658 isl_space_dim(bmap2->dim, isl_dim_all) !=
2659 isl_space_dim(bmap2->dim, isl_dim_param))
2660 return isl_basic_map_intersect(bmap2, bmap1);
2662 if (isl_space_dim(bmap2->dim, isl_dim_all) !=
2663 isl_space_dim(bmap2->dim, isl_dim_param))
2664 isl_assert(bmap1->ctx,
2665 isl_space_is_equal(bmap1->dim, bmap2->dim), goto error);
2667 if (bmap1->sample &&
2668 isl_basic_map_contains(bmap1, bmap1->sample) > 0 &&
2669 isl_basic_map_contains(bmap2, bmap1->sample) > 0)
2670 sample = isl_vec_copy(bmap1->sample);
2671 else if (bmap2->sample &&
2672 isl_basic_map_contains(bmap1, bmap2->sample) > 0 &&
2673 isl_basic_map_contains(bmap2, bmap2->sample) > 0)
2674 sample = isl_vec_copy(bmap2->sample);
2676 bmap1 = isl_basic_map_cow(bmap1);
2679 bmap1 = isl_basic_map_extend_space(bmap1, isl_space_copy(bmap1->dim),
2680 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
2681 bmap1 = add_constraints(bmap1, bmap2, 0, 0);
2684 isl_vec_free(sample);
2686 isl_vec_free(bmap1->sample);
2687 bmap1->sample = sample;
2690 bmap1 = isl_basic_map_simplify(bmap1);
2691 return isl_basic_map_finalize(bmap1);
2694 isl_vec_free(sample);
2695 isl_basic_map_free(bmap1);
2696 isl_basic_map_free(bmap2);
2700 struct isl_basic_set *isl_basic_set_intersect(
2701 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
2703 return (struct isl_basic_set *)
2704 isl_basic_map_intersect(
2705 (struct isl_basic_map *)bset1,
2706 (struct isl_basic_map *)bset2);
2709 __isl_give isl_basic_set *isl_basic_set_intersect_params(
2710 __isl_take isl_basic_set *bset1, __isl_take isl_basic_set *bset2)
2712 return isl_basic_set_intersect(bset1, bset2);
2715 /* Special case of isl_map_intersect, where both map1 and map2
2716 * are convex, without any divs and such that either map1 or map2
2717 * contains a single constraint. This constraint is then simply
2718 * added to the other map.
2720 static __isl_give isl_map *map_intersect_add_constraint(
2721 __isl_take isl_map *map1, __isl_take isl_map *map2)
2723 isl_assert(map1->ctx, map1->n == 1, goto error);
2724 isl_assert(map2->ctx, map1->n == 1, goto error);
2725 isl_assert(map1->ctx, map1->p[0]->n_div == 0, goto error);
2726 isl_assert(map2->ctx, map1->p[0]->n_div == 0, goto error);
2728 if (map2->p[0]->n_eq + map2->p[0]->n_ineq != 1)
2729 return isl_map_intersect(map2, map1);
2731 isl_assert(map2->ctx,
2732 map2->p[0]->n_eq + map2->p[0]->n_ineq == 1, goto error);
2734 map1 = isl_map_cow(map1);
2737 if (isl_map_plain_is_empty(map1)) {
2741 map1->p[0] = isl_basic_map_cow(map1->p[0]);
2742 if (map2->p[0]->n_eq == 1)
2743 map1->p[0] = isl_basic_map_add_eq(map1->p[0], map2->p[0]->eq[0]);
2745 map1->p[0] = isl_basic_map_add_ineq(map1->p[0],
2746 map2->p[0]->ineq[0]);
2748 map1->p[0] = isl_basic_map_simplify(map1->p[0]);
2749 map1->p[0] = isl_basic_map_finalize(map1->p[0]);
2753 if (isl_basic_map_plain_is_empty(map1->p[0])) {
2754 isl_basic_map_free(map1->p[0]);
2767 /* map2 may be either a parameter domain or a map living in the same
2770 static __isl_give isl_map *map_intersect_internal(__isl_take isl_map *map1,
2771 __isl_take isl_map *map2)
2774 struct isl_map *result;
2780 if (isl_map_plain_is_empty(map1) &&
2781 isl_space_is_equal(map1->dim, map2->dim)) {
2785 if (isl_map_plain_is_empty(map2) &&
2786 isl_space_is_equal(map1->dim, map2->dim)) {
2791 if (map1->n == 1 && map2->n == 1 &&
2792 map1->p[0]->n_div == 0 && map2->p[0]->n_div == 0 &&
2793 isl_space_is_equal(map1->dim, map2->dim) &&
2794 (map1->p[0]->n_eq + map1->p[0]->n_ineq == 1 ||
2795 map2->p[0]->n_eq + map2->p[0]->n_ineq == 1))
2796 return map_intersect_add_constraint(map1, map2);
2798 if (isl_space_dim(map2->dim, isl_dim_all) !=
2799 isl_space_dim(map2->dim, isl_dim_param))
2800 isl_assert(map1->ctx,
2801 isl_space_is_equal(map1->dim, map2->dim), goto error);
2803 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
2804 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
2805 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
2807 result = isl_map_alloc_space(isl_space_copy(map1->dim),
2808 map1->n * map2->n, flags);
2811 for (i = 0; i < map1->n; ++i)
2812 for (j = 0; j < map2->n; ++j) {
2813 struct isl_basic_map *part;
2814 part = isl_basic_map_intersect(
2815 isl_basic_map_copy(map1->p[i]),
2816 isl_basic_map_copy(map2->p[j]));
2817 if (isl_basic_map_is_empty(part))
2818 isl_basic_map_free(part);
2820 result = isl_map_add_basic_map(result, part);
2833 static __isl_give isl_map *map_intersect(__isl_take isl_map *map1,
2834 __isl_take isl_map *map2)
2838 if (!isl_space_is_equal(map1->dim, map2->dim))
2839 isl_die(isl_map_get_ctx(map1), isl_error_invalid,
2840 "spaces don't match", goto error);
2841 return map_intersect_internal(map1, map2);
2848 __isl_give isl_map *isl_map_intersect(__isl_take isl_map *map1,
2849 __isl_take isl_map *map2)
2851 return isl_map_align_params_map_map_and(map1, map2, &map_intersect);
2854 struct isl_set *isl_set_intersect(struct isl_set *set1, struct isl_set *set2)
2856 return (struct isl_set *)
2857 isl_map_intersect((struct isl_map *)set1,
2858 (struct isl_map *)set2);
2861 /* map_intersect_internal accepts intersections
2862 * with parameter domains, so we can just call that function.
2864 static __isl_give isl_map *map_intersect_params(__isl_take isl_map *map,
2865 __isl_take isl_set *params)
2867 return map_intersect_internal(map, params);
2870 __isl_give isl_map *isl_map_intersect_params(__isl_take isl_map *map1,
2871 __isl_take isl_map *map2)
2873 return isl_map_align_params_map_map_and(map1, map2, &map_intersect_params);
2876 __isl_give isl_set *isl_set_intersect_params(__isl_take isl_set *set,
2877 __isl_take isl_set *params)
2879 return isl_map_intersect_params(set, params);
2882 struct isl_basic_map *isl_basic_map_reverse(struct isl_basic_map *bmap)
2885 struct isl_basic_set *bset;
2890 bmap = isl_basic_map_cow(bmap);
2893 dim = isl_space_reverse(isl_space_copy(bmap->dim));
2894 in = isl_basic_map_n_in(bmap);
2895 bset = isl_basic_set_from_basic_map(bmap);
2896 bset = isl_basic_set_swap_vars(bset, in);
2897 return isl_basic_map_from_basic_set(bset, dim);
2900 static __isl_give isl_basic_map *basic_map_space_reset(
2901 __isl_take isl_basic_map *bmap, enum isl_dim_type type)
2905 if (!isl_space_is_named_or_nested(bmap->dim, type))
2908 space = isl_basic_map_get_space(bmap);
2909 space = isl_space_reset(space, type);
2910 bmap = isl_basic_map_reset_space(bmap, space);
2914 __isl_give isl_basic_map *isl_basic_map_insert_dims(
2915 __isl_take isl_basic_map *bmap, enum isl_dim_type type,
2916 unsigned pos, unsigned n)
2919 struct isl_basic_map *res;
2920 struct isl_dim_map *dim_map;
2921 unsigned total, off;
2922 enum isl_dim_type t;
2925 return basic_map_space_reset(bmap, type);
2930 res_dim = isl_space_insert_dims(isl_basic_map_get_space(bmap), type, pos, n);
2932 total = isl_basic_map_total_dim(bmap) + n;
2933 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2935 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
2937 isl_dim_map_dim(dim_map, bmap->dim, t, off);
2939 unsigned size = isl_basic_map_dim(bmap, t);
2940 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2942 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2943 pos, size - pos, off + pos + n);
2945 off += isl_space_dim(res_dim, t);
2947 isl_dim_map_div(dim_map, bmap, off);
2949 res = isl_basic_map_alloc_space(res_dim,
2950 bmap->n_div, bmap->n_eq, bmap->n_ineq);
2951 if (isl_basic_map_is_rational(bmap))
2952 res = isl_basic_map_set_rational(res);
2953 if (isl_basic_map_plain_is_empty(bmap)) {
2954 isl_basic_map_free(bmap);
2955 return isl_basic_map_set_to_empty(res);
2957 res = isl_basic_map_add_constraints_dim_map(res, bmap, dim_map);
2958 return isl_basic_map_finalize(res);
2961 __isl_give isl_basic_set *isl_basic_set_insert_dims(
2962 __isl_take isl_basic_set *bset,
2963 enum isl_dim_type type, unsigned pos, unsigned n)
2965 return isl_basic_map_insert_dims(bset, type, pos, n);
2968 __isl_give isl_basic_map *isl_basic_map_add(__isl_take isl_basic_map *bmap,
2969 enum isl_dim_type type, unsigned n)
2973 return isl_basic_map_insert_dims(bmap, type,
2974 isl_basic_map_dim(bmap, type), n);
2977 __isl_give isl_basic_set *isl_basic_set_add(__isl_take isl_basic_set *bset,
2978 enum isl_dim_type type, unsigned n)
2982 isl_assert(bset->ctx, type != isl_dim_in, goto error);
2983 return (isl_basic_set *)isl_basic_map_add((isl_basic_map *)bset, type, n);
2985 isl_basic_set_free(bset);
2989 static __isl_give isl_map *map_space_reset(__isl_take isl_map *map,
2990 enum isl_dim_type type)
2994 if (!map || !isl_space_is_named_or_nested(map->dim, type))
2997 space = isl_map_get_space(map);
2998 space = isl_space_reset(space, type);
2999 map = isl_map_reset_space(map, space);
3003 __isl_give isl_map *isl_map_insert_dims(__isl_take isl_map *map,
3004 enum isl_dim_type type, unsigned pos, unsigned n)
3009 return map_space_reset(map, type);
3011 map = isl_map_cow(map);
3015 map->dim = isl_space_insert_dims(map->dim, type, pos, n);
3019 for (i = 0; i < map->n; ++i) {
3020 map->p[i] = isl_basic_map_insert_dims(map->p[i], type, pos, n);
3031 __isl_give isl_set *isl_set_insert_dims(__isl_take isl_set *set,
3032 enum isl_dim_type type, unsigned pos, unsigned n)
3034 return isl_map_insert_dims(set, type, pos, n);
3037 __isl_give isl_map *isl_map_add_dims(__isl_take isl_map *map,
3038 enum isl_dim_type type, unsigned n)
3042 return isl_map_insert_dims(map, type, isl_map_dim(map, type), n);
3045 __isl_give isl_set *isl_set_add_dims(__isl_take isl_set *set,
3046 enum isl_dim_type type, unsigned n)
3050 isl_assert(set->ctx, type != isl_dim_in, goto error);
3051 return (isl_set *)isl_map_add_dims((isl_map *)set, type, n);
3057 __isl_give isl_basic_map *isl_basic_map_move_dims(
3058 __isl_take isl_basic_map *bmap,
3059 enum isl_dim_type dst_type, unsigned dst_pos,
3060 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
3062 struct isl_dim_map *dim_map;
3063 struct isl_basic_map *res;
3064 enum isl_dim_type t;
3065 unsigned total, off;
3072 isl_assert(bmap->ctx, src_pos + n <= isl_basic_map_dim(bmap, src_type),
3075 if (dst_type == src_type && dst_pos == src_pos)
3078 isl_assert(bmap->ctx, dst_type != src_type, goto error);
3080 if (pos(bmap->dim, dst_type) + dst_pos ==
3081 pos(bmap->dim, src_type) + src_pos +
3082 ((src_type < dst_type) ? n : 0)) {
3083 bmap = isl_basic_map_cow(bmap);
3087 bmap->dim = isl_space_move_dims(bmap->dim, dst_type, dst_pos,
3088 src_type, src_pos, n);
3092 bmap = isl_basic_map_finalize(bmap);
3097 total = isl_basic_map_total_dim(bmap);
3098 dim_map = isl_dim_map_alloc(bmap->ctx, total);
3101 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
3102 unsigned size = isl_space_dim(bmap->dim, t);
3103 if (t == dst_type) {
3104 isl_dim_map_dim_range(dim_map, bmap->dim, t,
3107 isl_dim_map_dim_range(dim_map, bmap->dim, src_type,
3110 isl_dim_map_dim_range(dim_map, bmap->dim, t,
3111 dst_pos, size - dst_pos, off);
3112 off += size - dst_pos;
3113 } else if (t == src_type) {
3114 isl_dim_map_dim_range(dim_map, bmap->dim, t,
3117 isl_dim_map_dim_range(dim_map, bmap->dim, t,
3118 src_pos + n, size - src_pos - n, off);
3119 off += size - src_pos - n;
3121 isl_dim_map_dim(dim_map, bmap->dim, t, off);
3125 isl_dim_map_div(dim_map, bmap, off);
3127 res = isl_basic_map_alloc_space(isl_basic_map_get_space(bmap),
3128 bmap->n_div, bmap->n_eq, bmap->n_ineq);
3129 bmap = isl_basic_map_add_constraints_dim_map(res, bmap, dim_map);
3131 bmap->dim = isl_space_move_dims(bmap->dim, dst_type, dst_pos,
3132 src_type, src_pos, n);
3136 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
3137 bmap = isl_basic_map_gauss(bmap, NULL);
3138 bmap = isl_basic_map_finalize(bmap);
3142 isl_basic_map_free(bmap);
3146 __isl_give isl_basic_set *isl_basic_set_move_dims(__isl_take isl_basic_set *bset,
3147 enum isl_dim_type dst_type, unsigned dst_pos,
3148 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
3150 return (isl_basic_set *)isl_basic_map_move_dims(
3151 (isl_basic_map *)bset, dst_type, dst_pos, src_type, src_pos, n);
3154 __isl_give isl_set *isl_set_move_dims(__isl_take isl_set *set,
3155 enum isl_dim_type dst_type, unsigned dst_pos,
3156 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
3160 isl_assert(set->ctx, dst_type != isl_dim_in, goto error);
3161 return (isl_set *)isl_map_move_dims((isl_map *)set, dst_type, dst_pos,
3162 src_type, src_pos, n);
3168 __isl_give isl_map *isl_map_move_dims(__isl_take isl_map *map,
3169 enum isl_dim_type dst_type, unsigned dst_pos,
3170 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
3179 isl_assert(map->ctx, src_pos + n <= isl_map_dim(map, src_type),
3182 if (dst_type == src_type && dst_pos == src_pos)
3185 isl_assert(map->ctx, dst_type != src_type, goto error);
3187 map = isl_map_cow(map);
3191 map->dim = isl_space_move_dims(map->dim, dst_type, dst_pos, src_type, src_pos, n);
3195 for (i = 0; i < map->n; ++i) {
3196 map->p[i] = isl_basic_map_move_dims(map->p[i],
3198 src_type, src_pos, n);
3209 /* Move the specified dimensions to the last columns right before
3210 * the divs. Don't change the dimension specification of bmap.
3211 * That's the responsibility of the caller.
3213 static __isl_give isl_basic_map *move_last(__isl_take isl_basic_map *bmap,
3214 enum isl_dim_type type, unsigned first, unsigned n)
3216 struct isl_dim_map *dim_map;
3217 struct isl_basic_map *res;
3218 enum isl_dim_type t;
3219 unsigned total, off;
3223 if (pos(bmap->dim, type) + first + n ==
3224 1 + isl_space_dim(bmap->dim, isl_dim_all))
3227 total = isl_basic_map_total_dim(bmap);
3228 dim_map = isl_dim_map_alloc(bmap->ctx, total);
3231 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
3232 unsigned size = isl_space_dim(bmap->dim, t);
3234 isl_dim_map_dim_range(dim_map, bmap->dim, t,
3237 isl_dim_map_dim_range(dim_map, bmap->dim, t,
3238 first, n, total - bmap->n_div - n);
3239 isl_dim_map_dim_range(dim_map, bmap->dim, t,
3240 first + n, size - (first + n), off);
3241 off += size - (first + n);
3243 isl_dim_map_dim(dim_map, bmap->dim, t, off);
3247 isl_dim_map_div(dim_map, bmap, off + n);
3249 res = isl_basic_map_alloc_space(isl_basic_map_get_space(bmap),
3250 bmap->n_div, bmap->n_eq, bmap->n_ineq);
3251 res = isl_basic_map_add_constraints_dim_map(res, bmap, dim_map);
3255 /* Turn the n dimensions of type type, starting at first
3256 * into existentially quantified variables.
3258 __isl_give isl_basic_map *isl_basic_map_project_out(
3259 __isl_take isl_basic_map *bmap,
3260 enum isl_dim_type type, unsigned first, unsigned n)
3268 return basic_map_space_reset(bmap, type);
3273 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL))
3274 return isl_basic_map_remove_dims(bmap, type, first, n);
3276 isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
3279 bmap = move_last(bmap, type, first, n);
3280 bmap = isl_basic_map_cow(bmap);
3284 row_size = 1 + isl_space_dim(bmap->dim, isl_dim_all) + bmap->extra;
3285 old = bmap->block2.data;
3286 bmap->block2 = isl_blk_extend(bmap->ctx, bmap->block2,
3287 (bmap->extra + n) * (1 + row_size));
3288 if (!bmap->block2.data)
3290 new_div = isl_alloc_array(bmap->ctx, isl_int *, bmap->extra + n);
3293 for (i = 0; i < n; ++i) {
3294 new_div[i] = bmap->block2.data +
3295 (bmap->extra + i) * (1 + row_size);
3296 isl_seq_clr(new_div[i], 1 + row_size);
3298 for (i = 0; i < bmap->extra; ++i)
3299 new_div[n + i] = bmap->block2.data + (bmap->div[i] - old);
3301 bmap->div = new_div;
3305 bmap->dim = isl_space_drop_dims(bmap->dim, type, first, n);
3308 bmap = isl_basic_map_simplify(bmap);
3309 bmap = isl_basic_map_drop_redundant_divs(bmap);
3310 return isl_basic_map_finalize(bmap);
3312 isl_basic_map_free(bmap);
3316 /* Turn the n dimensions of type type, starting at first
3317 * into existentially quantified variables.
3319 struct isl_basic_set *isl_basic_set_project_out(struct isl_basic_set *bset,
3320 enum isl_dim_type type, unsigned first, unsigned n)
3322 return (isl_basic_set *)isl_basic_map_project_out(
3323 (isl_basic_map *)bset, type, first, n);
3326 /* Turn the n dimensions of type type, starting at first
3327 * into existentially quantified variables.
3329 __isl_give isl_map *isl_map_project_out(__isl_take isl_map *map,
3330 enum isl_dim_type type, unsigned first, unsigned n)
3338 return map_space_reset(map, type);
3340 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
3342 map = isl_map_cow(map);
3346 map->dim = isl_space_drop_dims(map->dim, type, first, n);
3350 for (i = 0; i < map->n; ++i) {
3351 map->p[i] = isl_basic_map_project_out(map->p[i], type, first, n);
3362 /* Turn the n dimensions of type type, starting at first
3363 * into existentially quantified variables.
3365 __isl_give isl_set *isl_set_project_out(__isl_take isl_set *set,
3366 enum isl_dim_type type, unsigned first, unsigned n)
3368 return (isl_set *)isl_map_project_out((isl_map *)set, type, first, n);
3371 static struct isl_basic_map *add_divs(struct isl_basic_map *bmap, unsigned n)
3375 for (i = 0; i < n; ++i) {
3376 j = isl_basic_map_alloc_div(bmap);
3379 isl_seq_clr(bmap->div[j], 1+1+isl_basic_map_total_dim(bmap));
3383 isl_basic_map_free(bmap);
3387 struct isl_basic_map *isl_basic_map_apply_range(
3388 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3390 isl_space *dim_result = NULL;
3391 struct isl_basic_map *bmap;
3392 unsigned n_in, n_out, n, nparam, total, pos;
3393 struct isl_dim_map *dim_map1, *dim_map2;
3395 if (!bmap1 || !bmap2)
3398 dim_result = isl_space_join(isl_space_copy(bmap1->dim),
3399 isl_space_copy(bmap2->dim));
3401 n_in = isl_basic_map_n_in(bmap1);
3402 n_out = isl_basic_map_n_out(bmap2);
3403 n = isl_basic_map_n_out(bmap1);
3404 nparam = isl_basic_map_n_param(bmap1);
3406 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + n;
3407 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
3408 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
3409 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
3410 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
3411 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
3412 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_in);
3413 isl_dim_map_div(dim_map1, bmap1, pos += n_out);
3414 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
3415 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
3416 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
3418 bmap = isl_basic_map_alloc_space(dim_result,
3419 bmap1->n_div + bmap2->n_div + n,
3420 bmap1->n_eq + bmap2->n_eq,
3421 bmap1->n_ineq + bmap2->n_ineq);
3422 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap1, dim_map1);
3423 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap2, dim_map2);
3424 bmap = add_divs(bmap, n);
3425 bmap = isl_basic_map_simplify(bmap);
3426 bmap = isl_basic_map_drop_redundant_divs(bmap);
3427 return isl_basic_map_finalize(bmap);
3429 isl_basic_map_free(bmap1);
3430 isl_basic_map_free(bmap2);
3434 struct isl_basic_set *isl_basic_set_apply(
3435 struct isl_basic_set *bset, struct isl_basic_map *bmap)
3440 isl_assert(bset->ctx, isl_basic_map_compatible_domain(bmap, bset),
3443 return (struct isl_basic_set *)
3444 isl_basic_map_apply_range((struct isl_basic_map *)bset, bmap);
3446 isl_basic_set_free(bset);
3447 isl_basic_map_free(bmap);
3451 struct isl_basic_map *isl_basic_map_apply_domain(
3452 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3454 if (!bmap1 || !bmap2)
3457 isl_assert(bmap1->ctx,
3458 isl_basic_map_n_in(bmap1) == isl_basic_map_n_in(bmap2), goto error);
3459 isl_assert(bmap1->ctx,
3460 isl_basic_map_n_param(bmap1) == isl_basic_map_n_param(bmap2),
3463 bmap1 = isl_basic_map_reverse(bmap1);
3464 bmap1 = isl_basic_map_apply_range(bmap1, bmap2);
3465 return isl_basic_map_reverse(bmap1);
3467 isl_basic_map_free(bmap1);
3468 isl_basic_map_free(bmap2);
3472 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
3473 * A \cap B -> f(A) + f(B)
3475 struct isl_basic_map *isl_basic_map_sum(
3476 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3478 unsigned n_in, n_out, nparam, total, pos;
3479 struct isl_basic_map *bmap = NULL;
3480 struct isl_dim_map *dim_map1, *dim_map2;
3483 if (!bmap1 || !bmap2)
3486 isl_assert(bmap1->ctx, isl_space_is_equal(bmap1->dim, bmap2->dim),
3489 nparam = isl_basic_map_n_param(bmap1);
3490 n_in = isl_basic_map_n_in(bmap1);
3491 n_out = isl_basic_map_n_out(bmap1);
3493 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + 2 * n_out;
3494 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
3495 dim_map2 = isl_dim_map_alloc(bmap2->ctx, total);
3496 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
3497 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos);
3498 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
3499 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
3500 isl_dim_map_div(dim_map1, bmap1, pos += n_in + n_out);
3501 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
3502 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
3503 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_out);
3505 bmap = isl_basic_map_alloc_space(isl_space_copy(bmap1->dim),
3506 bmap1->n_div + bmap2->n_div + 2 * n_out,
3507 bmap1->n_eq + bmap2->n_eq + n_out,
3508 bmap1->n_ineq + bmap2->n_ineq);
3509 for (i = 0; i < n_out; ++i) {
3510 int j = isl_basic_map_alloc_equality(bmap);
3513 isl_seq_clr(bmap->eq[j], 1+total);
3514 isl_int_set_si(bmap->eq[j][1+nparam+n_in+i], -1);
3515 isl_int_set_si(bmap->eq[j][1+pos+i], 1);
3516 isl_int_set_si(bmap->eq[j][1+pos-n_out+i], 1);
3518 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap1, dim_map1);
3519 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap2, dim_map2);
3520 bmap = add_divs(bmap, 2 * n_out);
3522 bmap = isl_basic_map_simplify(bmap);
3523 return isl_basic_map_finalize(bmap);
3525 isl_basic_map_free(bmap);
3526 isl_basic_map_free(bmap1);
3527 isl_basic_map_free(bmap2);
3531 /* Given two maps A -> f(A) and B -> g(B), construct a map
3532 * A \cap B -> f(A) + f(B)
3534 struct isl_map *isl_map_sum(struct isl_map *map1, struct isl_map *map2)
3536 struct isl_map *result;
3542 isl_assert(map1->ctx, isl_space_is_equal(map1->dim, map2->dim), goto error);
3544 result = isl_map_alloc_space(isl_space_copy(map1->dim),
3545 map1->n * map2->n, 0);
3548 for (i = 0; i < map1->n; ++i)
3549 for (j = 0; j < map2->n; ++j) {
3550 struct isl_basic_map *part;
3551 part = isl_basic_map_sum(
3552 isl_basic_map_copy(map1->p[i]),
3553 isl_basic_map_copy(map2->p[j]));
3554 if (isl_basic_map_is_empty(part))
3555 isl_basic_map_free(part);
3557 result = isl_map_add_basic_map(result, part);
3570 __isl_give isl_set *isl_set_sum(__isl_take isl_set *set1,
3571 __isl_take isl_set *set2)
3573 return (isl_set *)isl_map_sum((isl_map *)set1, (isl_map *)set2);
3576 /* Given a basic map A -> f(A), construct A -> -f(A).
3578 struct isl_basic_map *isl_basic_map_neg(struct isl_basic_map *bmap)
3583 bmap = isl_basic_map_cow(bmap);
3587 n = isl_basic_map_dim(bmap, isl_dim_out);
3588 off = isl_basic_map_offset(bmap, isl_dim_out);
3589 for (i = 0; i < bmap->n_eq; ++i)
3590 for (j = 0; j < n; ++j)
3591 isl_int_neg(bmap->eq[i][off+j], bmap->eq[i][off+j]);
3592 for (i = 0; i < bmap->n_ineq; ++i)
3593 for (j = 0; j < n; ++j)
3594 isl_int_neg(bmap->ineq[i][off+j], bmap->ineq[i][off+j]);
3595 for (i = 0; i < bmap->n_div; ++i)
3596 for (j = 0; j < n; ++j)
3597 isl_int_neg(bmap->div[i][1+off+j], bmap->div[i][1+off+j]);
3598 bmap = isl_basic_map_gauss(bmap, NULL);
3599 return isl_basic_map_finalize(bmap);
3602 __isl_give isl_basic_set *isl_basic_set_neg(__isl_take isl_basic_set *bset)
3604 return isl_basic_map_neg(bset);
3607 /* Given a map A -> f(A), construct A -> -f(A).
3609 struct isl_map *isl_map_neg(struct isl_map *map)
3613 map = isl_map_cow(map);
3617 for (i = 0; i < map->n; ++i) {
3618 map->p[i] = isl_basic_map_neg(map->p[i]);
3629 __isl_give isl_set *isl_set_neg(__isl_take isl_set *set)
3631 return (isl_set *)isl_map_neg((isl_map *)set);
3634 /* Given a basic map A -> f(A) and an integer d, construct a basic map
3635 * A -> floor(f(A)/d).
3637 struct isl_basic_map *isl_basic_map_floordiv(struct isl_basic_map *bmap,
3640 unsigned n_in, n_out, nparam, total, pos;
3641 struct isl_basic_map *result = NULL;
3642 struct isl_dim_map *dim_map;
3648 nparam = isl_basic_map_n_param(bmap);
3649 n_in = isl_basic_map_n_in(bmap);
3650 n_out = isl_basic_map_n_out(bmap);
3652 total = nparam + n_in + n_out + bmap->n_div + n_out;
3653 dim_map = isl_dim_map_alloc(bmap->ctx, total);
3654 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_param, pos = 0);
3655 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_in, pos += nparam);
3656 isl_dim_map_div(dim_map, bmap, pos += n_in + n_out);
3657 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_out, pos += bmap->n_div);
3659 result = isl_basic_map_alloc_space(isl_space_copy(bmap->dim),
3660 bmap->n_div + n_out,
3661 bmap->n_eq, bmap->n_ineq + 2 * n_out);
3662 result = isl_basic_map_add_constraints_dim_map(result, bmap, dim_map);
3663 result = add_divs(result, n_out);
3664 for (i = 0; i < n_out; ++i) {
3666 j = isl_basic_map_alloc_inequality(result);
3669 isl_seq_clr(result->ineq[j], 1+total);
3670 isl_int_neg(result->ineq[j][1+nparam+n_in+i], d);
3671 isl_int_set_si(result->ineq[j][1+pos+i], 1);
3672 j = isl_basic_map_alloc_inequality(result);
3675 isl_seq_clr(result->ineq[j], 1+total);
3676 isl_int_set(result->ineq[j][1+nparam+n_in+i], d);
3677 isl_int_set_si(result->ineq[j][1+pos+i], -1);
3678 isl_int_sub_ui(result->ineq[j][0], d, 1);
3681 result = isl_basic_map_simplify(result);
3682 return isl_basic_map_finalize(result);
3684 isl_basic_map_free(result);
3688 /* Given a map A -> f(A) and an integer d, construct a map
3689 * A -> floor(f(A)/d).
3691 struct isl_map *isl_map_floordiv(struct isl_map *map, isl_int d)
3695 map = isl_map_cow(map);
3699 ISL_F_CLR(map, ISL_MAP_DISJOINT);
3700 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3701 for (i = 0; i < map->n; ++i) {
3702 map->p[i] = isl_basic_map_floordiv(map->p[i], d);
3713 static struct isl_basic_map *var_equal(struct isl_basic_map *bmap, unsigned pos)
3719 i = isl_basic_map_alloc_equality(bmap);
3722 nparam = isl_basic_map_n_param(bmap);
3723 n_in = isl_basic_map_n_in(bmap);
3724 isl_seq_clr(bmap->eq[i], 1 + isl_basic_map_total_dim(bmap));
3725 isl_int_set_si(bmap->eq[i][1+nparam+pos], -1);
3726 isl_int_set_si(bmap->eq[i][1+nparam+n_in+pos], 1);
3727 return isl_basic_map_finalize(bmap);
3729 isl_basic_map_free(bmap);
3733 /* Add a constraints to "bmap" expressing i_pos < o_pos
3735 static struct isl_basic_map *var_less(struct isl_basic_map *bmap, unsigned pos)
3741 i = isl_basic_map_alloc_inequality(bmap);
3744 nparam = isl_basic_map_n_param(bmap);
3745 n_in = isl_basic_map_n_in(bmap);
3746 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
3747 isl_int_set_si(bmap->ineq[i][0], -1);
3748 isl_int_set_si(bmap->ineq[i][1+nparam+pos], -1);
3749 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], 1);
3750 return isl_basic_map_finalize(bmap);
3752 isl_basic_map_free(bmap);
3756 /* Add a constraint to "bmap" expressing i_pos <= o_pos
3758 static __isl_give isl_basic_map *var_less_or_equal(
3759 __isl_take isl_basic_map *bmap, unsigned pos)
3765 i = isl_basic_map_alloc_inequality(bmap);
3768 nparam = isl_basic_map_n_param(bmap);
3769 n_in = isl_basic_map_n_in(bmap);
3770 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
3771 isl_int_set_si(bmap->ineq[i][1+nparam+pos], -1);
3772 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], 1);
3773 return isl_basic_map_finalize(bmap);
3775 isl_basic_map_free(bmap);
3779 /* Add a constraints to "bmap" expressing i_pos > o_pos
3781 static struct isl_basic_map *var_more(struct isl_basic_map *bmap, unsigned pos)
3787 i = isl_basic_map_alloc_inequality(bmap);
3790 nparam = isl_basic_map_n_param(bmap);
3791 n_in = isl_basic_map_n_in(bmap);
3792 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
3793 isl_int_set_si(bmap->ineq[i][0], -1);
3794 isl_int_set_si(bmap->ineq[i][1+nparam+pos], 1);
3795 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], -1);
3796 return isl_basic_map_finalize(bmap);
3798 isl_basic_map_free(bmap);
3802 /* Add a constraint to "bmap" expressing i_pos >= o_pos
3804 static __isl_give isl_basic_map *var_more_or_equal(
3805 __isl_take isl_basic_map *bmap, unsigned pos)
3811 i = isl_basic_map_alloc_inequality(bmap);
3814 nparam = isl_basic_map_n_param(bmap);
3815 n_in = isl_basic_map_n_in(bmap);
3816 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
3817 isl_int_set_si(bmap->ineq[i][1+nparam+pos], 1);
3818 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], -1);
3819 return isl_basic_map_finalize(bmap);
3821 isl_basic_map_free(bmap);
3825 __isl_give isl_basic_map *isl_basic_map_equal(
3826 __isl_take isl_space *dim, unsigned n_equal)
3829 struct isl_basic_map *bmap;
3830 bmap = isl_basic_map_alloc_space(dim, 0, n_equal, 0);
3833 for (i = 0; i < n_equal && bmap; ++i)
3834 bmap = var_equal(bmap, i);
3835 return isl_basic_map_finalize(bmap);
3838 /* Return a relation on of dimension "dim" expressing i_[0..pos] << o_[0..pos]
3840 __isl_give isl_basic_map *isl_basic_map_less_at(__isl_take isl_space *dim,
3844 struct isl_basic_map *bmap;
3845 bmap = isl_basic_map_alloc_space(dim, 0, pos, 1);
3848 for (i = 0; i < pos && bmap; ++i)
3849 bmap = var_equal(bmap, i);
3851 bmap = var_less(bmap, pos);
3852 return isl_basic_map_finalize(bmap);
3855 /* Return a relation on of dimension "dim" expressing i_[0..pos] <<= o_[0..pos]
3857 __isl_give isl_basic_map *isl_basic_map_less_or_equal_at(
3858 __isl_take isl_space *dim, unsigned pos)
3861 isl_basic_map *bmap;
3863 bmap = isl_basic_map_alloc_space(dim, 0, pos, 1);
3864 for (i = 0; i < pos; ++i)
3865 bmap = var_equal(bmap, i);
3866 bmap = var_less_or_equal(bmap, pos);
3867 return isl_basic_map_finalize(bmap);
3870 /* Return a relation on pairs of sets of dimension "dim" expressing i_pos > o_pos
3872 __isl_give isl_basic_map *isl_basic_map_more_at(__isl_take isl_space *dim,
3876 struct isl_basic_map *bmap;
3877 bmap = isl_basic_map_alloc_space(dim, 0, pos, 1);
3880 for (i = 0; i < pos && bmap; ++i)
3881 bmap = var_equal(bmap, i);
3883 bmap = var_more(bmap, pos);
3884 return isl_basic_map_finalize(bmap);
3887 /* Return a relation on of dimension "dim" expressing i_[0..pos] >>= o_[0..pos]
3889 __isl_give isl_basic_map *isl_basic_map_more_or_equal_at(
3890 __isl_take isl_space *dim, unsigned pos)
3893 isl_basic_map *bmap;
3895 bmap = isl_basic_map_alloc_space(dim, 0, pos, 1);
3896 for (i = 0; i < pos; ++i)
3897 bmap = var_equal(bmap, i);
3898 bmap = var_more_or_equal(bmap, pos);
3899 return isl_basic_map_finalize(bmap);
3902 static __isl_give isl_map *map_lex_lte_first(__isl_take isl_space *dims,
3903 unsigned n, int equal)
3905 struct isl_map *map;
3908 if (n == 0 && equal)
3909 return isl_map_universe(dims);
3911 map = isl_map_alloc_space(isl_space_copy(dims), n, ISL_MAP_DISJOINT);
3913 for (i = 0; i + 1 < n; ++i)
3914 map = isl_map_add_basic_map(map,
3915 isl_basic_map_less_at(isl_space_copy(dims), i));
3918 map = isl_map_add_basic_map(map,
3919 isl_basic_map_less_or_equal_at(dims, n - 1));
3921 map = isl_map_add_basic_map(map,
3922 isl_basic_map_less_at(dims, n - 1));
3924 isl_space_free(dims);
3929 static __isl_give isl_map *map_lex_lte(__isl_take isl_space *dims, int equal)
3933 return map_lex_lte_first(dims, dims->n_out, equal);
3936 __isl_give isl_map *isl_map_lex_lt_first(__isl_take isl_space *dim, unsigned n)
3938 return map_lex_lte_first(dim, n, 0);
3941 __isl_give isl_map *isl_map_lex_le_first(__isl_take isl_space *dim, unsigned n)
3943 return map_lex_lte_first(dim, n, 1);
3946 __isl_give isl_map *isl_map_lex_lt(__isl_take isl_space *set_dim)
3948 return map_lex_lte(isl_space_map_from_set(set_dim), 0);
3951 __isl_give isl_map *isl_map_lex_le(__isl_take isl_space *set_dim)
3953 return map_lex_lte(isl_space_map_from_set(set_dim), 1);
3956 static __isl_give isl_map *map_lex_gte_first(__isl_take isl_space *dims,
3957 unsigned n, int equal)
3959 struct isl_map *map;
3962 if (n == 0 && equal)
3963 return isl_map_universe(dims);
3965 map = isl_map_alloc_space(isl_space_copy(dims), n, ISL_MAP_DISJOINT);
3967 for (i = 0; i + 1 < n; ++i)
3968 map = isl_map_add_basic_map(map,
3969 isl_basic_map_more_at(isl_space_copy(dims), i));
3972 map = isl_map_add_basic_map(map,
3973 isl_basic_map_more_or_equal_at(dims, n - 1));
3975 map = isl_map_add_basic_map(map,
3976 isl_basic_map_more_at(dims, n - 1));
3978 isl_space_free(dims);
3983 static __isl_give isl_map *map_lex_gte(__isl_take isl_space *dims, int equal)
3987 return map_lex_gte_first(dims, dims->n_out, equal);
3990 __isl_give isl_map *isl_map_lex_gt_first(__isl_take isl_space *dim, unsigned n)
3992 return map_lex_gte_first(dim, n, 0);
3995 __isl_give isl_map *isl_map_lex_ge_first(__isl_take isl_space *dim, unsigned n)
3997 return map_lex_gte_first(dim, n, 1);
4000 __isl_give isl_map *isl_map_lex_gt(__isl_take isl_space *set_dim)
4002 return map_lex_gte(isl_space_map_from_set(set_dim), 0);
4005 __isl_give isl_map *isl_map_lex_ge(__isl_take isl_space *set_dim)
4007 return map_lex_gte(isl_space_map_from_set(set_dim), 1);
4010 __isl_give isl_map *isl_set_lex_le_set(__isl_take isl_set *set1,
4011 __isl_take isl_set *set2)
4014 map = isl_map_lex_le(isl_set_get_space(set1));
4015 map = isl_map_intersect_domain(map, set1);
4016 map = isl_map_intersect_range(map, set2);
4020 __isl_give isl_map *isl_set_lex_lt_set(__isl_take isl_set *set1,
4021 __isl_take isl_set *set2)
4024 map = isl_map_lex_lt(isl_set_get_space(set1));
4025 map = isl_map_intersect_domain(map, set1);
4026 map = isl_map_intersect_range(map, set2);
4030 __isl_give isl_map *isl_set_lex_ge_set(__isl_take isl_set *set1,
4031 __isl_take isl_set *set2)
4034 map = isl_map_lex_ge(isl_set_get_space(set1));
4035 map = isl_map_intersect_domain(map, set1);
4036 map = isl_map_intersect_range(map, set2);
4040 __isl_give isl_map *isl_set_lex_gt_set(__isl_take isl_set *set1,
4041 __isl_take isl_set *set2)
4044 map = isl_map_lex_gt(isl_set_get_space(set1));
4045 map = isl_map_intersect_domain(map, set1);
4046 map = isl_map_intersect_range(map, set2);
4050 __isl_give isl_map *isl_map_lex_le_map(__isl_take isl_map *map1,
4051 __isl_take isl_map *map2)
4054 map = isl_map_lex_le(isl_space_range(isl_map_get_space(map1)));
4055 map = isl_map_apply_domain(map, isl_map_reverse(map1));
4056 map = isl_map_apply_range(map, isl_map_reverse(map2));
4060 __isl_give isl_map *isl_map_lex_lt_map(__isl_take isl_map *map1,
4061 __isl_take isl_map *map2)
4064 map = isl_map_lex_lt(isl_space_range(isl_map_get_space(map1)));
4065 map = isl_map_apply_domain(map, isl_map_reverse(map1));
4066 map = isl_map_apply_range(map, isl_map_reverse(map2));
4070 __isl_give isl_map *isl_map_lex_ge_map(__isl_take isl_map *map1,
4071 __isl_take isl_map *map2)
4074 map = isl_map_lex_ge(isl_space_range(isl_map_get_space(map1)));
4075 map = isl_map_apply_domain(map, isl_map_reverse(map1));
4076 map = isl_map_apply_range(map, isl_map_reverse(map2));
4080 __isl_give isl_map *isl_map_lex_gt_map(__isl_take isl_map *map1,
4081 __isl_take isl_map *map2)
4084 map = isl_map_lex_gt(isl_space_range(isl_map_get_space(map1)));
4085 map = isl_map_apply_domain(map, isl_map_reverse(map1));
4086 map = isl_map_apply_range(map, isl_map_reverse(map2));
4090 __isl_give isl_basic_map *isl_basic_map_from_basic_set(
4091 __isl_take isl_basic_set *bset, __isl_take isl_space *dim)
4093 struct isl_basic_map *bmap;
4095 bset = isl_basic_set_cow(bset);
4099 isl_assert(bset->ctx, isl_space_compatible(bset->dim, dim), goto error);
4100 isl_space_free(bset->dim);
4101 bmap = (struct isl_basic_map *) bset;
4103 return isl_basic_map_finalize(bmap);
4105 isl_basic_set_free(bset);
4106 isl_space_free(dim);
4110 struct isl_basic_set *isl_basic_set_from_basic_map(struct isl_basic_map *bmap)
4114 if (bmap->dim->n_in == 0)
4115 return (struct isl_basic_set *)bmap;
4116 bmap = isl_basic_map_cow(bmap);
4119 bmap->dim = isl_space_as_set_space(bmap->dim);
4122 bmap = isl_basic_map_finalize(bmap);
4123 return (struct isl_basic_set *)bmap;
4125 isl_basic_map_free(bmap);
4129 /* For a div d = floor(f/m), add the constraints
4132 * -(f-(n-1)) + m d >= 0
4134 * Note that the second constraint is the negation of
4138 int isl_basic_map_add_div_constraints_var(__isl_keep isl_basic_map *bmap,
4139 unsigned pos, isl_int *div)
4142 unsigned total = isl_basic_map_total_dim(bmap);
4144 i = isl_basic_map_alloc_inequality(bmap);
4147 isl_seq_cpy(bmap->ineq[i], div + 1, 1 + total);
4148 isl_int_neg(bmap->ineq[i][1 + pos], div[0]);
4150 j = isl_basic_map_alloc_inequality(bmap);
4153 isl_seq_neg(bmap->ineq[j], bmap->ineq[i], 1 + total);
4154 isl_int_add(bmap->ineq[j][0], bmap->ineq[j][0], bmap->ineq[j][1 + pos]);
4155 isl_int_sub_ui(bmap->ineq[j][0], bmap->ineq[j][0], 1);
4159 int isl_basic_set_add_div_constraints_var(__isl_keep isl_basic_set *bset,
4160 unsigned pos, isl_int *div)
4162 return isl_basic_map_add_div_constraints_var((isl_basic_map *)bset,
4166 int isl_basic_map_add_div_constraints(struct isl_basic_map *bmap, unsigned div)
4168 unsigned total = isl_basic_map_total_dim(bmap);
4169 unsigned div_pos = total - bmap->n_div + div;
4171 return isl_basic_map_add_div_constraints_var(bmap, div_pos,
4175 struct isl_basic_set *isl_basic_map_underlying_set(
4176 struct isl_basic_map *bmap)
4180 if (bmap->dim->nparam == 0 && bmap->dim->n_in == 0 &&
4182 !isl_space_is_named_or_nested(bmap->dim, isl_dim_in) &&
4183 !isl_space_is_named_or_nested(bmap->dim, isl_dim_out))
4184 return (struct isl_basic_set *)bmap;
4185 bmap = isl_basic_map_cow(bmap);
4188 bmap->dim = isl_space_underlying(bmap->dim, bmap->n_div);
4191 bmap->extra -= bmap->n_div;
4193 bmap = isl_basic_map_finalize(bmap);
4194 return (struct isl_basic_set *)bmap;
4199 __isl_give isl_basic_set *isl_basic_set_underlying_set(
4200 __isl_take isl_basic_set *bset)
4202 return isl_basic_map_underlying_set((isl_basic_map *)bset);
4205 struct isl_basic_map *isl_basic_map_overlying_set(
4206 struct isl_basic_set *bset, struct isl_basic_map *like)
4208 struct isl_basic_map *bmap;
4209 struct isl_ctx *ctx;
4216 isl_assert(ctx, bset->n_div == 0, goto error);
4217 isl_assert(ctx, isl_basic_set_n_param(bset) == 0, goto error);
4218 isl_assert(ctx, bset->dim->n_out == isl_basic_map_total_dim(like),
4220 if (isl_space_is_equal(bset->dim, like->dim) && like->n_div == 0) {
4221 isl_basic_map_free(like);
4222 return (struct isl_basic_map *)bset;
4224 bset = isl_basic_set_cow(bset);
4227 total = bset->dim->n_out + bset->extra;
4228 bmap = (struct isl_basic_map *)bset;
4229 isl_space_free(bmap->dim);
4230 bmap->dim = isl_space_copy(like->dim);
4233 bmap->n_div = like->n_div;
4234 bmap->extra += like->n_div;
4238 ltotal = total - bmap->extra + like->extra;
4241 bmap->block2 = isl_blk_extend(ctx, bmap->block2,
4242 bmap->extra * (1 + 1 + total));
4243 if (isl_blk_is_error(bmap->block2))
4245 div = isl_realloc_array(ctx, bmap->div, isl_int *, bmap->extra);
4249 for (i = 0; i < bmap->extra; ++i)
4250 bmap->div[i] = bmap->block2.data + i * (1 + 1 + total);
4251 for (i = 0; i < like->n_div; ++i) {
4252 isl_seq_cpy(bmap->div[i], like->div[i], 1 + 1 + ltotal);
4253 isl_seq_clr(bmap->div[i]+1+1+ltotal, total - ltotal);
4255 bmap = isl_basic_map_extend_constraints(bmap,
4256 0, 2 * like->n_div);
4257 for (i = 0; i < like->n_div; ++i) {
4258 if (isl_int_is_zero(bmap->div[i][0]))
4260 if (isl_basic_map_add_div_constraints(bmap, i) < 0)
4264 isl_basic_map_free(like);
4265 bmap = isl_basic_map_simplify(bmap);
4266 bmap = isl_basic_map_finalize(bmap);
4269 isl_basic_map_free(like);
4270 isl_basic_set_free(bset);
4274 struct isl_basic_set *isl_basic_set_from_underlying_set(
4275 struct isl_basic_set *bset, struct isl_basic_set *like)
4277 return (struct isl_basic_set *)
4278 isl_basic_map_overlying_set(bset, (struct isl_basic_map *)like);
4281 struct isl_set *isl_set_from_underlying_set(
4282 struct isl_set *set, struct isl_basic_set *like)
4288 isl_assert(set->ctx, set->dim->n_out == isl_basic_set_total_dim(like),
4290 if (isl_space_is_equal(set->dim, like->dim) && like->n_div == 0) {
4291 isl_basic_set_free(like);
4294 set = isl_set_cow(set);
4297 for (i = 0; i < set->n; ++i) {
4298 set->p[i] = isl_basic_set_from_underlying_set(set->p[i],
4299 isl_basic_set_copy(like));
4303 isl_space_free(set->dim);
4304 set->dim = isl_space_copy(like->dim);
4307 isl_basic_set_free(like);
4310 isl_basic_set_free(like);
4315 struct isl_set *isl_map_underlying_set(struct isl_map *map)
4319 map = isl_map_cow(map);
4322 map->dim = isl_space_cow(map->dim);
4326 for (i = 1; i < map->n; ++i)
4327 isl_assert(map->ctx, map->p[0]->n_div == map->p[i]->n_div,
4329 for (i = 0; i < map->n; ++i) {
4330 map->p[i] = (struct isl_basic_map *)
4331 isl_basic_map_underlying_set(map->p[i]);
4336 map->dim = isl_space_underlying(map->dim, 0);
4338 isl_space_free(map->dim);
4339 map->dim = isl_space_copy(map->p[0]->dim);
4343 return (struct isl_set *)map;
4349 struct isl_set *isl_set_to_underlying_set(struct isl_set *set)
4351 return (struct isl_set *)isl_map_underlying_set((struct isl_map *)set);
4354 __isl_give isl_basic_map *isl_basic_map_reset_space(
4355 __isl_take isl_basic_map *bmap, __isl_take isl_space *dim)
4357 bmap = isl_basic_map_cow(bmap);
4361 isl_space_free(bmap->dim);
4364 bmap = isl_basic_map_finalize(bmap);
4368 isl_basic_map_free(bmap);
4369 isl_space_free(dim);
4373 __isl_give isl_basic_set *isl_basic_set_reset_space(
4374 __isl_take isl_basic_set *bset, __isl_take isl_space *dim)
4376 return (isl_basic_set *)isl_basic_map_reset_space((isl_basic_map *)bset,
4380 __isl_give isl_map *isl_map_reset_space(__isl_take isl_map *map,
4381 __isl_take isl_space *dim)
4385 map = isl_map_cow(map);
4389 for (i = 0; i < map->n; ++i) {
4390 map->p[i] = isl_basic_map_reset_space(map->p[i],
4391 isl_space_copy(dim));
4395 isl_space_free(map->dim);
4401 isl_space_free(dim);
4405 __isl_give isl_set *isl_set_reset_space(__isl_take isl_set *set,
4406 __isl_take isl_space *dim)
4408 return (struct isl_set *) isl_map_reset_space((struct isl_map *)set, dim);
4411 /* Compute the parameter domain of the given basic set.
4413 __isl_give isl_basic_set *isl_basic_set_params(__isl_take isl_basic_set *bset)
4418 if (isl_basic_set_is_params(bset))
4421 n = isl_basic_set_dim(bset, isl_dim_set);
4422 bset = isl_basic_set_project_out(bset, isl_dim_set, 0, n);
4423 space = isl_basic_set_get_space(bset);
4424 space = isl_space_params(space);
4425 bset = isl_basic_set_reset_space(bset, space);
4429 /* Compute the parameter domain of the given set.
4431 __isl_give isl_set *isl_set_params(__isl_take isl_set *set)
4436 if (isl_set_is_params(set))
4439 n = isl_set_dim(set, isl_dim_set);
4440 set = isl_set_project_out(set, isl_dim_set, 0, n);
4441 space = isl_set_get_space(set);
4442 space = isl_space_params(space);
4443 set = isl_set_reset_space(set, space);
4447 /* Construct a zero-dimensional set with the given parameter domain.
4449 __isl_give isl_set *isl_set_from_params(__isl_take isl_set *set)
4452 space = isl_set_get_space(set);
4453 space = isl_space_set_from_params(space);
4454 set = isl_set_reset_space(set, space);
4458 /* Compute the parameter domain of the given map.
4460 __isl_give isl_set *isl_map_params(__isl_take isl_map *map)
4465 n = isl_map_dim(map, isl_dim_in);
4466 map = isl_map_project_out(map, isl_dim_in, 0, n);
4467 n = isl_map_dim(map, isl_dim_out);
4468 map = isl_map_project_out(map, isl_dim_out, 0, n);
4469 space = isl_map_get_space(map);
4470 space = isl_space_params(space);
4471 map = isl_map_reset_space(map, space);
4475 struct isl_basic_set *isl_basic_map_domain(struct isl_basic_map *bmap)
4478 struct isl_basic_set *domain;
4484 dim = isl_space_domain(isl_basic_map_get_space(bmap));
4486 n_in = isl_basic_map_n_in(bmap);
4487 n_out = isl_basic_map_n_out(bmap);
4488 domain = isl_basic_set_from_basic_map(bmap);
4489 domain = isl_basic_set_project_out(domain, isl_dim_set, n_in, n_out);
4491 domain = isl_basic_set_reset_space(domain, dim);
4496 int isl_basic_map_may_be_set(__isl_keep isl_basic_map *bmap)
4500 return isl_space_may_be_set(bmap->dim);
4503 /* Is this basic map actually a set?
4504 * Users should never call this function. Outside of isl,
4505 * the type should indicate whether something is a set or a map.
4507 int isl_basic_map_is_set(__isl_keep isl_basic_map *bmap)
4511 return isl_space_is_set(bmap->dim);
4514 struct isl_basic_set *isl_basic_map_range(struct isl_basic_map *bmap)
4518 if (isl_basic_map_is_set(bmap))
4520 return isl_basic_map_domain(isl_basic_map_reverse(bmap));
4523 __isl_give isl_basic_map *isl_basic_map_domain_map(
4524 __isl_take isl_basic_map *bmap)
4528 isl_basic_map *domain;
4529 int nparam, n_in, n_out;
4532 nparam = isl_basic_map_dim(bmap, isl_dim_param);
4533 n_in = isl_basic_map_dim(bmap, isl_dim_in);
4534 n_out = isl_basic_map_dim(bmap, isl_dim_out);
4536 dim = isl_space_from_range(isl_space_domain(isl_basic_map_get_space(bmap)));
4537 domain = isl_basic_map_universe(dim);
4539 bmap = isl_basic_map_from_domain(isl_basic_map_wrap(bmap));
4540 bmap = isl_basic_map_apply_range(bmap, domain);
4541 bmap = isl_basic_map_extend_constraints(bmap, n_in, 0);
4543 total = isl_basic_map_total_dim(bmap);
4545 for (i = 0; i < n_in; ++i) {
4546 k = isl_basic_map_alloc_equality(bmap);
4549 isl_seq_clr(bmap->eq[k], 1 + total);
4550 isl_int_set_si(bmap->eq[k][1 + nparam + i], -1);
4551 isl_int_set_si(bmap->eq[k][1 + nparam + n_in + n_out + i], 1);
4554 bmap = isl_basic_map_gauss(bmap, NULL);
4555 return isl_basic_map_finalize(bmap);
4557 isl_basic_map_free(bmap);
4561 __isl_give isl_basic_map *isl_basic_map_range_map(
4562 __isl_take isl_basic_map *bmap)
4566 isl_basic_map *range;
4567 int nparam, n_in, n_out;
4570 nparam = isl_basic_map_dim(bmap, isl_dim_param);
4571 n_in = isl_basic_map_dim(bmap, isl_dim_in);
4572 n_out = isl_basic_map_dim(bmap, isl_dim_out);
4574 dim = isl_space_from_range(isl_space_range(isl_basic_map_get_space(bmap)));
4575 range = isl_basic_map_universe(dim);
4577 bmap = isl_basic_map_from_domain(isl_basic_map_wrap(bmap));
4578 bmap = isl_basic_map_apply_range(bmap, range);
4579 bmap = isl_basic_map_extend_constraints(bmap, n_out, 0);
4581 total = isl_basic_map_total_dim(bmap);
4583 for (i = 0; i < n_out; ++i) {
4584 k = isl_basic_map_alloc_equality(bmap);
4587 isl_seq_clr(bmap->eq[k], 1 + total);
4588 isl_int_set_si(bmap->eq[k][1 + nparam + n_in + i], -1);
4589 isl_int_set_si(bmap->eq[k][1 + nparam + n_in + n_out + i], 1);
4592 bmap = isl_basic_map_gauss(bmap, NULL);
4593 return isl_basic_map_finalize(bmap);
4595 isl_basic_map_free(bmap);
4599 int isl_map_may_be_set(__isl_keep isl_map *map)
4603 return isl_space_may_be_set(map->dim);
4606 /* Is this map actually a set?
4607 * Users should never call this function. Outside of isl,
4608 * the type should indicate whether something is a set or a map.
4610 int isl_map_is_set(__isl_keep isl_map *map)
4614 return isl_space_is_set(map->dim);
4617 struct isl_set *isl_map_range(struct isl_map *map)
4620 struct isl_set *set;
4624 if (isl_map_is_set(map))
4625 return (isl_set *)map;
4627 map = isl_map_cow(map);
4631 set = (struct isl_set *) map;
4632 set->dim = isl_space_range(set->dim);
4635 for (i = 0; i < map->n; ++i) {
4636 set->p[i] = isl_basic_map_range(map->p[i]);
4640 ISL_F_CLR(set, ISL_MAP_DISJOINT);
4641 ISL_F_CLR(set, ISL_SET_NORMALIZED);
4648 __isl_give isl_map *isl_map_domain_map(__isl_take isl_map *map)
4651 isl_space *domain_dim;
4653 map = isl_map_cow(map);
4657 domain_dim = isl_space_from_range(isl_space_domain(isl_map_get_space(map)));
4658 map->dim = isl_space_from_domain(isl_space_wrap(map->dim));
4659 map->dim = isl_space_join(map->dim, domain_dim);
4662 for (i = 0; i < map->n; ++i) {
4663 map->p[i] = isl_basic_map_domain_map(map->p[i]);
4667 ISL_F_CLR(map, ISL_MAP_DISJOINT);
4668 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4675 __isl_give isl_map *isl_map_range_map(__isl_take isl_map *map)
4678 isl_space *range_dim;
4680 map = isl_map_cow(map);
4684 range_dim = isl_space_range(isl_map_get_space(map));
4685 range_dim = isl_space_from_range(range_dim);
4686 map->dim = isl_space_from_domain(isl_space_wrap(map->dim));
4687 map->dim = isl_space_join(map->dim, range_dim);
4690 for (i = 0; i < map->n; ++i) {
4691 map->p[i] = isl_basic_map_range_map(map->p[i]);
4695 ISL_F_CLR(map, ISL_MAP_DISJOINT);
4696 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4703 __isl_give isl_map *isl_map_from_set(__isl_take isl_set *set,
4704 __isl_take isl_space *dim)
4707 struct isl_map *map = NULL;
4709 set = isl_set_cow(set);
4712 isl_assert(set->ctx, isl_space_compatible(set->dim, dim), goto error);
4713 map = (struct isl_map *)set;
4714 for (i = 0; i < set->n; ++i) {
4715 map->p[i] = isl_basic_map_from_basic_set(
4716 set->p[i], isl_space_copy(dim));
4720 isl_space_free(map->dim);
4724 isl_space_free(dim);
4729 __isl_give isl_basic_map *isl_basic_map_from_domain(
4730 __isl_take isl_basic_set *bset)
4732 return isl_basic_map_reverse(isl_basic_map_from_range(bset));
4735 __isl_give isl_basic_map *isl_basic_map_from_range(
4736 __isl_take isl_basic_set *bset)
4739 space = isl_basic_set_get_space(bset);
4740 space = isl_space_from_range(space);
4741 bset = isl_basic_set_reset_space(bset, space);
4742 return (isl_basic_map *)bset;
4745 struct isl_map *isl_map_from_range(struct isl_set *set)
4748 space = isl_set_get_space(set);
4749 space = isl_space_from_range(space);
4750 set = isl_set_reset_space(set, space);
4751 return (struct isl_map *)set;
4754 __isl_give isl_map *isl_map_from_domain(__isl_take isl_set *set)
4756 return isl_map_reverse(isl_map_from_range(set));
4759 __isl_give isl_basic_map *isl_basic_map_from_domain_and_range(
4760 __isl_take isl_basic_set *domain, __isl_take isl_basic_set *range)
4762 return isl_basic_map_apply_range(isl_basic_map_reverse(domain), range);
4765 __isl_give isl_map *isl_map_from_domain_and_range(__isl_take isl_set *domain,
4766 __isl_take isl_set *range)
4768 return isl_map_apply_range(isl_map_reverse(domain), range);
4771 struct isl_set *isl_set_from_map(struct isl_map *map)
4774 struct isl_set *set = NULL;
4778 map = isl_map_cow(map);
4781 map->dim = isl_space_as_set_space(map->dim);
4784 set = (struct isl_set *)map;
4785 for (i = 0; i < map->n; ++i) {
4786 set->p[i] = isl_basic_set_from_basic_map(map->p[i]);
4796 __isl_give isl_map *isl_map_alloc_space(__isl_take isl_space *dim, int n,
4799 struct isl_map *map;
4804 isl_die(dim->ctx, isl_error_internal,
4805 "negative number of basic maps", goto error);
4806 map = isl_alloc(dim->ctx, struct isl_map,
4807 sizeof(struct isl_map) +
4808 (n - 1) * sizeof(struct isl_basic_map *));
4812 map->ctx = dim->ctx;
4813 isl_ctx_ref(map->ctx);
4821 isl_space_free(dim);
4825 struct isl_map *isl_map_alloc(struct isl_ctx *ctx,
4826 unsigned nparam, unsigned in, unsigned out, int n,
4829 struct isl_map *map;
4832 dims = isl_space_alloc(ctx, nparam, in, out);
4836 map = isl_map_alloc_space(dims, n, flags);
4840 __isl_give isl_basic_map *isl_basic_map_empty(__isl_take isl_space *dim)
4842 struct isl_basic_map *bmap;
4843 bmap = isl_basic_map_alloc_space(dim, 0, 1, 0);
4844 bmap = isl_basic_map_set_to_empty(bmap);
4848 __isl_give isl_basic_set *isl_basic_set_empty(__isl_take isl_space *dim)
4850 struct isl_basic_set *bset;
4851 bset = isl_basic_set_alloc_space(dim, 0, 1, 0);
4852 bset = isl_basic_set_set_to_empty(bset);
4856 struct isl_basic_map *isl_basic_map_empty_like(struct isl_basic_map *model)
4858 struct isl_basic_map *bmap;
4861 bmap = isl_basic_map_alloc_space(isl_space_copy(model->dim), 0, 1, 0);
4862 bmap = isl_basic_map_set_to_empty(bmap);
4866 struct isl_basic_map *isl_basic_map_empty_like_map(struct isl_map *model)
4868 struct isl_basic_map *bmap;
4871 bmap = isl_basic_map_alloc_space(isl_space_copy(model->dim), 0, 1, 0);
4872 bmap = isl_basic_map_set_to_empty(bmap);
4876 struct isl_basic_set *isl_basic_set_empty_like(struct isl_basic_set *model)
4878 struct isl_basic_set *bset;
4881 bset = isl_basic_set_alloc_space(isl_space_copy(model->dim), 0, 1, 0);
4882 bset = isl_basic_set_set_to_empty(bset);
4886 __isl_give isl_basic_map *isl_basic_map_universe(__isl_take isl_space *dim)
4888 struct isl_basic_map *bmap;
4889 bmap = isl_basic_map_alloc_space(dim, 0, 0, 0);
4890 bmap = isl_basic_map_finalize(bmap);
4894 __isl_give isl_basic_set *isl_basic_set_universe(__isl_take isl_space *dim)
4896 struct isl_basic_set *bset;
4897 bset = isl_basic_set_alloc_space(dim, 0, 0, 0);
4898 bset = isl_basic_set_finalize(bset);
4902 __isl_give isl_basic_map *isl_basic_map_nat_universe(__isl_take isl_space *dim)
4905 unsigned total = isl_space_dim(dim, isl_dim_all);
4906 isl_basic_map *bmap;
4908 bmap= isl_basic_map_alloc_space(dim, 0, 0, total);
4909 for (i = 0; i < total; ++i) {
4910 int k = isl_basic_map_alloc_inequality(bmap);
4913 isl_seq_clr(bmap->ineq[k], 1 + total);
4914 isl_int_set_si(bmap->ineq[k][1 + i], 1);
4918 isl_basic_map_free(bmap);
4922 __isl_give isl_basic_set *isl_basic_set_nat_universe(__isl_take isl_space *dim)
4924 return isl_basic_map_nat_universe(dim);
4927 __isl_give isl_map *isl_map_nat_universe(__isl_take isl_space *dim)
4929 return isl_map_from_basic_map(isl_basic_map_nat_universe(dim));
4932 __isl_give isl_set *isl_set_nat_universe(__isl_take isl_space *dim)
4934 return isl_map_nat_universe(dim);
4937 __isl_give isl_basic_map *isl_basic_map_universe_like(
4938 __isl_keep isl_basic_map *model)
4942 return isl_basic_map_alloc_space(isl_space_copy(model->dim), 0, 0, 0);
4945 struct isl_basic_set *isl_basic_set_universe_like(struct isl_basic_set *model)
4949 return isl_basic_set_alloc_space(isl_space_copy(model->dim), 0, 0, 0);
4952 __isl_give isl_basic_set *isl_basic_set_universe_like_set(
4953 __isl_keep isl_set *model)
4957 return isl_basic_set_alloc_space(isl_space_copy(model->dim), 0, 0, 0);
4960 __isl_give isl_map *isl_map_empty(__isl_take isl_space *dim)
4962 return isl_map_alloc_space(dim, 0, ISL_MAP_DISJOINT);
4965 struct isl_map *isl_map_empty_like(struct isl_map *model)
4969 return isl_map_alloc_space(isl_space_copy(model->dim), 0, ISL_MAP_DISJOINT);
4972 struct isl_map *isl_map_empty_like_basic_map(struct isl_basic_map *model)
4976 return isl_map_alloc_space(isl_space_copy(model->dim), 0, ISL_MAP_DISJOINT);
4979 __isl_give isl_set *isl_set_empty(__isl_take isl_space *dim)
4981 return isl_set_alloc_space(dim, 0, ISL_MAP_DISJOINT);
4984 struct isl_set *isl_set_empty_like(struct isl_set *model)
4988 return isl_set_empty(isl_space_copy(model->dim));
4991 __isl_give isl_map *isl_map_universe(__isl_take isl_space *dim)
4993 struct isl_map *map;
4996 map = isl_map_alloc_space(isl_space_copy(dim), 1, ISL_MAP_DISJOINT);
4997 map = isl_map_add_basic_map(map, isl_basic_map_universe(dim));
5001 __isl_give isl_set *isl_set_universe(__isl_take isl_space *dim)
5003 struct isl_set *set;
5006 set = isl_set_alloc_space(isl_space_copy(dim), 1, ISL_MAP_DISJOINT);
5007 set = isl_set_add_basic_set(set, isl_basic_set_universe(dim));
5011 __isl_give isl_set *isl_set_universe_like(__isl_keep isl_set *model)
5015 return isl_set_universe(isl_space_copy(model->dim));
5018 struct isl_map *isl_map_dup(struct isl_map *map)
5021 struct isl_map *dup;
5025 dup = isl_map_alloc_space(isl_space_copy(map->dim), map->n, map->flags);
5026 for (i = 0; i < map->n; ++i)
5027 dup = isl_map_add_basic_map(dup, isl_basic_map_copy(map->p[i]));
5031 __isl_give isl_map *isl_map_add_basic_map(__isl_take isl_map *map,
5032 __isl_take isl_basic_map *bmap)
5036 if (isl_basic_map_plain_is_empty(bmap)) {
5037 isl_basic_map_free(bmap);
5040 isl_assert(map->ctx, isl_space_is_equal(map->dim, bmap->dim), goto error);
5041 isl_assert(map->ctx, map->n < map->size, goto error);
5042 map->p[map->n] = bmap;
5044 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
5050 isl_basic_map_free(bmap);
5054 void isl_map_free(struct isl_map *map)
5064 isl_ctx_deref(map->ctx);
5065 for (i = 0; i < map->n; ++i)
5066 isl_basic_map_free(map->p[i]);
5067 isl_space_free(map->dim);
5071 struct isl_map *isl_map_extend(struct isl_map *base,
5072 unsigned nparam, unsigned n_in, unsigned n_out)
5076 base = isl_map_cow(base);
5080 base->dim = isl_space_extend(base->dim, nparam, n_in, n_out);
5083 for (i = 0; i < base->n; ++i) {
5084 base->p[i] = isl_basic_map_extend_space(base->p[i],
5085 isl_space_copy(base->dim), 0, 0, 0);
5095 struct isl_set *isl_set_extend(struct isl_set *base,
5096 unsigned nparam, unsigned dim)
5098 return (struct isl_set *)isl_map_extend((struct isl_map *)base,
5102 static struct isl_basic_map *isl_basic_map_fix_pos_si(
5103 struct isl_basic_map *bmap, unsigned pos, int value)
5107 bmap = isl_basic_map_cow(bmap);
5108 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
5109 j = isl_basic_map_alloc_equality(bmap);
5112 isl_seq_clr(bmap->eq[j] + 1, isl_basic_map_total_dim(bmap));
5113 isl_int_set_si(bmap->eq[j][pos], -1);
5114 isl_int_set_si(bmap->eq[j][0], value);
5115 bmap = isl_basic_map_simplify(bmap);
5116 return isl_basic_map_finalize(bmap);
5118 isl_basic_map_free(bmap);
5122 static __isl_give isl_basic_map *isl_basic_map_fix_pos(
5123 __isl_take isl_basic_map *bmap, unsigned pos, isl_int value)
5127 bmap = isl_basic_map_cow(bmap);
5128 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
5129 j = isl_basic_map_alloc_equality(bmap);
5132 isl_seq_clr(bmap->eq[j] + 1, isl_basic_map_total_dim(bmap));
5133 isl_int_set_si(bmap->eq[j][pos], -1);
5134 isl_int_set(bmap->eq[j][0], value);
5135 bmap = isl_basic_map_simplify(bmap);
5136 return isl_basic_map_finalize(bmap);
5138 isl_basic_map_free(bmap);
5142 struct isl_basic_map *isl_basic_map_fix_si(struct isl_basic_map *bmap,
5143 enum isl_dim_type type, unsigned pos, int value)
5147 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
5148 return isl_basic_map_fix_pos_si(bmap,
5149 isl_basic_map_offset(bmap, type) + pos, value);
5151 isl_basic_map_free(bmap);
5155 __isl_give isl_basic_map *isl_basic_map_fix(__isl_take isl_basic_map *bmap,
5156 enum isl_dim_type type, unsigned pos, isl_int value)
5160 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
5161 return isl_basic_map_fix_pos(bmap,
5162 isl_basic_map_offset(bmap, type) + pos, value);
5164 isl_basic_map_free(bmap);
5168 struct isl_basic_set *isl_basic_set_fix_si(struct isl_basic_set *bset,
5169 enum isl_dim_type type, unsigned pos, int value)
5171 return (struct isl_basic_set *)
5172 isl_basic_map_fix_si((struct isl_basic_map *)bset,
5176 __isl_give isl_basic_set *isl_basic_set_fix(__isl_take isl_basic_set *bset,
5177 enum isl_dim_type type, unsigned pos, isl_int value)
5179 return (struct isl_basic_set *)
5180 isl_basic_map_fix((struct isl_basic_map *)bset,
5184 struct isl_basic_map *isl_basic_map_fix_input_si(struct isl_basic_map *bmap,
5185 unsigned input, int value)
5187 return isl_basic_map_fix_si(bmap, isl_dim_in, input, value);
5190 struct isl_basic_set *isl_basic_set_fix_dim_si(struct isl_basic_set *bset,
5191 unsigned dim, int value)
5193 return (struct isl_basic_set *)
5194 isl_basic_map_fix_si((struct isl_basic_map *)bset,
5195 isl_dim_set, dim, value);
5198 static int remove_if_empty(__isl_keep isl_map *map, int i)
5200 int empty = isl_basic_map_plain_is_empty(map->p[i]);
5207 isl_basic_map_free(map->p[i]);
5208 if (i != map->n - 1) {
5209 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
5210 map->p[i] = map->p[map->n - 1];
5217 struct isl_map *isl_map_fix_si(struct isl_map *map,
5218 enum isl_dim_type type, unsigned pos, int value)
5222 map = isl_map_cow(map);
5226 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
5227 for (i = map->n - 1; i >= 0; --i) {
5228 map->p[i] = isl_basic_map_fix_si(map->p[i], type, pos, value);
5229 if (remove_if_empty(map, i) < 0)
5232 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
5239 __isl_give isl_set *isl_set_fix_si(__isl_take isl_set *set,
5240 enum isl_dim_type type, unsigned pos, int value)
5242 return (struct isl_set *)
5243 isl_map_fix_si((struct isl_map *)set, type, pos, value);
5246 __isl_give isl_map *isl_map_fix(__isl_take isl_map *map,
5247 enum isl_dim_type type, unsigned pos, isl_int value)
5251 map = isl_map_cow(map);
5255 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
5256 for (i = 0; i < map->n; ++i) {
5257 map->p[i] = isl_basic_map_fix(map->p[i], type, pos, value);
5261 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
5268 __isl_give isl_set *isl_set_fix(__isl_take isl_set *set,
5269 enum isl_dim_type type, unsigned pos, isl_int value)
5271 return (struct isl_set *)isl_map_fix((isl_map *)set, type, pos, value);
5274 struct isl_map *isl_map_fix_input_si(struct isl_map *map,
5275 unsigned input, int value)
5277 return isl_map_fix_si(map, isl_dim_in, input, value);
5280 struct isl_set *isl_set_fix_dim_si(struct isl_set *set, unsigned dim, int value)
5282 return (struct isl_set *)
5283 isl_map_fix_si((struct isl_map *)set, isl_dim_set, dim, value);
5286 static __isl_give isl_basic_map *basic_map_bound_si(
5287 __isl_take isl_basic_map *bmap,
5288 enum isl_dim_type type, unsigned pos, int value, int upper)
5294 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
5295 pos += isl_basic_map_offset(bmap, type);
5296 bmap = isl_basic_map_cow(bmap);
5297 bmap = isl_basic_map_extend_constraints(bmap, 0, 1);
5298 j = isl_basic_map_alloc_inequality(bmap);
5301 isl_seq_clr(bmap->ineq[j], 1 + isl_basic_map_total_dim(bmap));
5303 isl_int_set_si(bmap->ineq[j][pos], -1);
5304 isl_int_set_si(bmap->ineq[j][0], value);
5306 isl_int_set_si(bmap->ineq[j][pos], 1);
5307 isl_int_set_si(bmap->ineq[j][0], -value);
5309 bmap = isl_basic_map_simplify(bmap);
5310 return isl_basic_map_finalize(bmap);
5312 isl_basic_map_free(bmap);
5316 __isl_give isl_basic_map *isl_basic_map_lower_bound_si(
5317 __isl_take isl_basic_map *bmap,
5318 enum isl_dim_type type, unsigned pos, int value)
5320 return basic_map_bound_si(bmap, type, pos, value, 0);
5323 struct isl_basic_set *isl_basic_set_lower_bound_dim(struct isl_basic_set *bset,
5324 unsigned dim, isl_int value)
5328 bset = isl_basic_set_cow(bset);
5329 bset = isl_basic_set_extend_constraints(bset, 0, 1);
5330 j = isl_basic_set_alloc_inequality(bset);
5333 isl_seq_clr(bset->ineq[j], 1 + isl_basic_set_total_dim(bset));
5334 isl_int_set_si(bset->ineq[j][1 + isl_basic_set_n_param(bset) + dim], 1);
5335 isl_int_neg(bset->ineq[j][0], value);
5336 bset = isl_basic_set_simplify(bset);
5337 return isl_basic_set_finalize(bset);
5339 isl_basic_set_free(bset);
5343 static __isl_give isl_map *map_bound_si(__isl_take isl_map *map,
5344 enum isl_dim_type type, unsigned pos, int value, int upper)
5348 map = isl_map_cow(map);
5352 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
5353 for (i = 0; i < map->n; ++i) {
5354 map->p[i] = basic_map_bound_si(map->p[i],
5355 type, pos, value, upper);
5359 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
5366 __isl_give isl_map *isl_map_lower_bound_si(__isl_take isl_map *map,
5367 enum isl_dim_type type, unsigned pos, int value)
5369 return map_bound_si(map, type, pos, value, 0);
5372 __isl_give isl_map *isl_map_upper_bound_si(__isl_take isl_map *map,
5373 enum isl_dim_type type, unsigned pos, int value)
5375 return map_bound_si(map, type, pos, value, 1);
5378 __isl_give isl_set *isl_set_lower_bound_si(__isl_take isl_set *set,
5379 enum isl_dim_type type, unsigned pos, int value)
5381 return (struct isl_set *)
5382 isl_map_lower_bound_si((struct isl_map *)set, type, pos, value);
5385 __isl_give isl_set *isl_set_upper_bound_si(__isl_take isl_set *set,
5386 enum isl_dim_type type, unsigned pos, int value)
5388 return isl_map_upper_bound_si(set, type, pos, value);
5391 /* Bound the given variable of "bmap" from below (or above is "upper"
5392 * is set) to "value".
5394 static __isl_give isl_basic_map *basic_map_bound(
5395 __isl_take isl_basic_map *bmap,
5396 enum isl_dim_type type, unsigned pos, isl_int value, int upper)
5402 if (pos >= isl_basic_map_dim(bmap, type))
5403 isl_die(bmap->ctx, isl_error_invalid,
5404 "index out of bounds", goto error);
5405 pos += isl_basic_map_offset(bmap, type);
5406 bmap = isl_basic_map_cow(bmap);
5407 bmap = isl_basic_map_extend_constraints(bmap, 0, 1);
5408 j = isl_basic_map_alloc_inequality(bmap);
5411 isl_seq_clr(bmap->ineq[j], 1 + isl_basic_map_total_dim(bmap));
5413 isl_int_set_si(bmap->ineq[j][pos], -1);
5414 isl_int_set(bmap->ineq[j][0], value);
5416 isl_int_set_si(bmap->ineq[j][pos], 1);
5417 isl_int_neg(bmap->ineq[j][0], value);
5419 bmap = isl_basic_map_simplify(bmap);
5420 return isl_basic_map_finalize(bmap);
5422 isl_basic_map_free(bmap);
5426 /* Bound the given variable of "map" from below (or above is "upper"
5427 * is set) to "value".
5429 static __isl_give isl_map *map_bound(__isl_take isl_map *map,
5430 enum isl_dim_type type, unsigned pos, isl_int value, int upper)
5434 map = isl_map_cow(map);
5438 if (pos >= isl_map_dim(map, type))
5439 isl_die(map->ctx, isl_error_invalid,
5440 "index out of bounds", goto error);
5441 for (i = map->n - 1; i >= 0; --i) {
5442 map->p[i] = basic_map_bound(map->p[i], type, pos, value, upper);
5443 if (remove_if_empty(map, i) < 0)
5446 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
5453 __isl_give isl_map *isl_map_lower_bound(__isl_take isl_map *map,
5454 enum isl_dim_type type, unsigned pos, isl_int value)
5456 return map_bound(map, type, pos, value, 0);
5459 __isl_give isl_map *isl_map_upper_bound(__isl_take isl_map *map,
5460 enum isl_dim_type type, unsigned pos, isl_int value)
5462 return map_bound(map, type, pos, value, 1);
5465 __isl_give isl_set *isl_set_lower_bound(__isl_take isl_set *set,
5466 enum isl_dim_type type, unsigned pos, isl_int value)
5468 return isl_map_lower_bound(set, type, pos, value);
5471 __isl_give isl_set *isl_set_upper_bound(__isl_take isl_set *set,
5472 enum isl_dim_type type, unsigned pos, isl_int value)
5474 return isl_map_upper_bound(set, type, pos, value);
5477 struct isl_set *isl_set_lower_bound_dim(struct isl_set *set, unsigned dim,
5482 set = isl_set_cow(set);
5486 isl_assert(set->ctx, dim < isl_set_n_dim(set), goto error);
5487 for (i = 0; i < set->n; ++i) {
5488 set->p[i] = isl_basic_set_lower_bound_dim(set->p[i], dim, value);
5498 struct isl_map *isl_map_reverse(struct isl_map *map)
5502 map = isl_map_cow(map);
5506 map->dim = isl_space_reverse(map->dim);
5509 for (i = 0; i < map->n; ++i) {
5510 map->p[i] = isl_basic_map_reverse(map->p[i]);
5514 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
5521 static struct isl_map *isl_basic_map_partial_lexopt(
5522 struct isl_basic_map *bmap, struct isl_basic_set *dom,
5523 struct isl_set **empty, int max)
5527 if (bmap->ctx->opt->pip == ISL_PIP_PIP)
5528 return isl_pip_basic_map_lexopt(bmap, dom, empty, max);
5530 return isl_tab_basic_map_partial_lexopt(bmap, dom, empty, max);
5532 isl_basic_map_free(bmap);
5533 isl_basic_set_free(dom);
5539 struct isl_map *isl_basic_map_partial_lexmax(
5540 struct isl_basic_map *bmap, struct isl_basic_set *dom,
5541 struct isl_set **empty)
5543 return isl_basic_map_partial_lexopt(bmap, dom, empty, 1);
5546 struct isl_map *isl_basic_map_partial_lexmin(
5547 struct isl_basic_map *bmap, struct isl_basic_set *dom,
5548 struct isl_set **empty)
5550 return isl_basic_map_partial_lexopt(bmap, dom, empty, 0);
5553 struct isl_set *isl_basic_set_partial_lexmin(
5554 struct isl_basic_set *bset, struct isl_basic_set *dom,
5555 struct isl_set **empty)
5557 return (struct isl_set *)
5558 isl_basic_map_partial_lexmin((struct isl_basic_map *)bset,
5562 struct isl_set *isl_basic_set_partial_lexmax(
5563 struct isl_basic_set *bset, struct isl_basic_set *dom,
5564 struct isl_set **empty)
5566 return (struct isl_set *)
5567 isl_basic_map_partial_lexmax((struct isl_basic_map *)bset,
5571 __isl_give isl_pw_multi_aff *isl_basic_map_partial_lexmin_pw_multi_aff(
5572 __isl_take isl_basic_map *bmap, __isl_take isl_basic_set *dom,
5573 __isl_give isl_set **empty)
5575 return isl_basic_map_partial_lexopt_pw_multi_aff(bmap, dom, empty, 0);
5578 __isl_give isl_pw_multi_aff *isl_basic_map_partial_lexmax_pw_multi_aff(
5579 __isl_take isl_basic_map *bmap, __isl_take isl_basic_set *dom,
5580 __isl_give isl_set **empty)
5582 return isl_basic_map_partial_lexopt_pw_multi_aff(bmap, dom, empty, 1);
5585 __isl_give isl_pw_multi_aff *isl_basic_set_partial_lexmin_pw_multi_aff(
5586 __isl_take isl_basic_set *bset, __isl_take isl_basic_set *dom,
5587 __isl_give isl_set **empty)
5589 return isl_basic_map_partial_lexmin_pw_multi_aff(bset, dom, empty);
5592 __isl_give isl_pw_multi_aff *isl_basic_set_partial_lexmax_pw_multi_aff(
5593 __isl_take isl_basic_set *bset, __isl_take isl_basic_set *dom,
5594 __isl_give isl_set **empty)
5596 return isl_basic_map_partial_lexmax_pw_multi_aff(bset, dom, empty);
5599 __isl_give isl_pw_multi_aff *isl_basic_map_lexopt_pw_multi_aff(
5600 __isl_take isl_basic_map *bmap, int max)
5602 isl_basic_set *dom = NULL;
5603 isl_space *dom_space;
5607 dom_space = isl_space_domain(isl_space_copy(bmap->dim));
5608 dom = isl_basic_set_universe(dom_space);
5609 return isl_basic_map_partial_lexopt_pw_multi_aff(bmap, dom, NULL, max);
5611 isl_basic_map_free(bmap);
5615 __isl_give isl_pw_multi_aff *isl_basic_map_lexmin_pw_multi_aff(
5616 __isl_take isl_basic_map *bmap)
5618 return isl_basic_map_lexopt_pw_multi_aff(bmap, 0);
5621 /* Given a basic map "bmap", compute the lexicographically minimal
5622 * (or maximal) image element for each domain element in dom.
5623 * Set *empty to those elements in dom that do not have an image element.
5625 * We first make sure the basic sets in dom are disjoint and then
5626 * simply collect the results over each of the basic sets separately.
5627 * We could probably improve the efficiency a bit by moving the union
5628 * domain down into the parametric integer programming.
5630 static __isl_give isl_map *basic_map_partial_lexopt(
5631 __isl_take isl_basic_map *bmap, __isl_take isl_set *dom,
5632 __isl_give isl_set **empty, int max)
5635 struct isl_map *res;
5637 dom = isl_set_make_disjoint(dom);
5641 if (isl_set_plain_is_empty(dom)) {
5642 res = isl_map_empty_like_basic_map(bmap);
5643 *empty = isl_set_empty_like(dom);
5645 isl_basic_map_free(bmap);
5649 res = isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap),
5650 isl_basic_set_copy(dom->p[0]), empty, max);
5652 for (i = 1; i < dom->n; ++i) {
5653 struct isl_map *res_i;
5654 struct isl_set *empty_i;
5656 res_i = isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap),
5657 isl_basic_set_copy(dom->p[i]), &empty_i, max);
5659 res = isl_map_union_disjoint(res, res_i);
5660 *empty = isl_set_union_disjoint(*empty, empty_i);
5664 isl_basic_map_free(bmap);
5669 isl_basic_map_free(bmap);
5673 /* Given a map "map", compute the lexicographically minimal
5674 * (or maximal) image element for each domain element in dom.
5675 * Set *empty to those elements in dom that do not have an image element.
5677 * We first compute the lexicographically minimal or maximal element
5678 * in the first basic map. This results in a partial solution "res"
5679 * and a subset "todo" of dom that still need to be handled.
5680 * We then consider each of the remaining maps in "map" and successively
5681 * improve both "res" and "todo".
5683 * Let res^k and todo^k be the results after k steps and let i = k + 1.
5684 * Assume we are computing the lexicographical maximum.
5685 * We first compute the lexicographically maximal element in basic map i.
5686 * This results in a partial solution res_i and a subset todo_i.
5687 * Then we combine these results with those obtain for the first k basic maps
5688 * to obtain a result that is valid for the first k+1 basic maps.
5689 * In particular, the set where there is no solution is the set where
5690 * there is no solution for the first k basic maps and also no solution
5691 * for the ith basic map, i.e.,
5693 * todo^i = todo^k * todo_i
5695 * On dom(res^k) * dom(res_i), we need to pick the larger of the two
5696 * solutions, arbitrarily breaking ties in favor of res^k.
5697 * That is, when res^k(a) >= res_i(a), we pick res^k and
5698 * when res^k(a) < res_i(a), we pick res_i. (Here, ">=" and "<" denote
5699 * the lexicographic order.)
5700 * In practice, we compute
5702 * res^k * (res_i . "<=")
5706 * res_i * (res^k . "<")
5708 * Finally, we consider the symmetric difference of dom(res^k) and dom(res_i),
5709 * where only one of res^k and res_i provides a solution and we simply pick
5716 * Note that we only compute these intersections when dom(res^k) intersects
5717 * dom(res_i). Otherwise, the only effect of these intersections is to
5718 * potentially break up res^k and res_i into smaller pieces.
5719 * We want to avoid such splintering as much as possible.
5720 * In fact, an earlier implementation of this function would look for
5721 * better results in the domain of res^k and for extra results in todo^k,
5722 * but this would always result in a splintering according to todo^k,
5723 * even when the domain of basic map i is disjoint from the domains of
5724 * the previous basic maps.
5726 static __isl_give isl_map *isl_map_partial_lexopt_aligned(
5727 __isl_take isl_map *map, __isl_take isl_set *dom,
5728 __isl_give isl_set **empty, int max)
5731 struct isl_map *res;
5732 struct isl_set *todo;
5737 if (isl_map_plain_is_empty(map)) {
5745 res = basic_map_partial_lexopt(isl_basic_map_copy(map->p[0]),
5746 isl_set_copy(dom), &todo, max);
5748 for (i = 1; i < map->n; ++i) {
5752 isl_space *dim = isl_space_range(isl_map_get_space(res));
5754 res_i = basic_map_partial_lexopt(isl_basic_map_copy(map->p[i]),
5755 isl_set_copy(dom), &todo_i, max);
5758 lt = isl_map_lex_lt(isl_space_copy(dim));
5759 le = isl_map_lex_le(dim);
5761 lt = isl_map_lex_gt(isl_space_copy(dim));
5762 le = isl_map_lex_ge(dim);
5764 lt = isl_map_apply_range(isl_map_copy(res), lt);
5765 lt = isl_map_intersect(lt, isl_map_copy(res_i));
5766 le = isl_map_apply_range(isl_map_copy(res_i), le);
5767 le = isl_map_intersect(le, isl_map_copy(res));
5769 if (!isl_map_is_empty(lt) || !isl_map_is_empty(le)) {
5770 res = isl_map_intersect_domain(res,
5771 isl_set_copy(todo_i));
5772 res_i = isl_map_intersect_domain(res_i,
5773 isl_set_copy(todo));
5776 res = isl_map_union_disjoint(res, res_i);
5777 res = isl_map_union_disjoint(res, lt);
5778 res = isl_map_union_disjoint(res, le);
5780 todo = isl_set_intersect(todo, todo_i);
5800 /* Given a map "map", compute the lexicographically minimal
5801 * (or maximal) image element for each domain element in dom.
5802 * Set *empty to those elements in dom that do not have an image element.
5804 * Align parameters if needed and then call isl_map_partial_lexopt_aligned.
5806 static __isl_give isl_map *isl_map_partial_lexopt(
5807 __isl_take isl_map *map, __isl_take isl_set *dom,
5808 __isl_give isl_set **empty, int max)
5812 if (isl_space_match(map->dim, isl_dim_param, dom->dim, isl_dim_param))
5813 return isl_map_partial_lexopt_aligned(map, dom, empty, max);
5814 if (!isl_space_has_named_params(map->dim) ||
5815 !isl_space_has_named_params(dom->dim))
5816 isl_die(map->ctx, isl_error_invalid,
5817 "unaligned unnamed parameters", goto error);
5818 map = isl_map_align_params(map, isl_map_get_space(dom));
5819 dom = isl_map_align_params(dom, isl_map_get_space(map));
5820 return isl_map_partial_lexopt_aligned(map, dom, empty, max);
5829 __isl_give isl_map *isl_map_partial_lexmax(
5830 __isl_take isl_map *map, __isl_take isl_set *dom,
5831 __isl_give isl_set **empty)
5833 return isl_map_partial_lexopt(map, dom, empty, 1);
5836 __isl_give isl_map *isl_map_partial_lexmin(
5837 __isl_take isl_map *map, __isl_take isl_set *dom,
5838 __isl_give isl_set **empty)
5840 return isl_map_partial_lexopt(map, dom, empty, 0);
5843 __isl_give isl_set *isl_set_partial_lexmin(
5844 __isl_take isl_set *set, __isl_take isl_set *dom,
5845 __isl_give isl_set **empty)
5847 return (struct isl_set *)
5848 isl_map_partial_lexmin((struct isl_map *)set,
5852 __isl_give isl_set *isl_set_partial_lexmax(
5853 __isl_take isl_set *set, __isl_take isl_set *dom,
5854 __isl_give isl_set **empty)
5856 return (struct isl_set *)
5857 isl_map_partial_lexmax((struct isl_map *)set,
5861 __isl_give isl_map *isl_basic_map_lexopt(__isl_take isl_basic_map *bmap, int max)
5863 struct isl_basic_set *dom = NULL;
5868 dom_dim = isl_space_domain(isl_space_copy(bmap->dim));
5869 dom = isl_basic_set_universe(dom_dim);
5870 return isl_basic_map_partial_lexopt(bmap, dom, NULL, max);
5872 isl_basic_map_free(bmap);
5876 __isl_give isl_map *isl_basic_map_lexmin(__isl_take isl_basic_map *bmap)
5878 return isl_basic_map_lexopt(bmap, 0);
5881 __isl_give isl_map *isl_basic_map_lexmax(__isl_take isl_basic_map *bmap)
5883 return isl_basic_map_lexopt(bmap, 1);
5886 __isl_give isl_set *isl_basic_set_lexmin(__isl_take isl_basic_set *bset)
5888 return (isl_set *)isl_basic_map_lexmin((isl_basic_map *)bset);
5891 __isl_give isl_set *isl_basic_set_lexmax(__isl_take isl_basic_set *bset)
5893 return (isl_set *)isl_basic_map_lexmax((isl_basic_map *)bset);
5896 __isl_give isl_map *isl_map_lexopt(__isl_take isl_map *map, int max)
5898 struct isl_set *dom = NULL;
5903 dom_dim = isl_space_domain(isl_space_copy(map->dim));
5904 dom = isl_set_universe(dom_dim);
5905 return isl_map_partial_lexopt(map, dom, NULL, max);
5911 __isl_give isl_map *isl_map_lexmin(__isl_take isl_map *map)
5913 return isl_map_lexopt(map, 0);
5916 __isl_give isl_map *isl_map_lexmax(__isl_take isl_map *map)
5918 return isl_map_lexopt(map, 1);
5921 __isl_give isl_set *isl_set_lexmin(__isl_take isl_set *set)
5923 return (isl_set *)isl_map_lexmin((isl_map *)set);
5926 __isl_give isl_set *isl_set_lexmax(__isl_take isl_set *set)
5928 return (isl_set *)isl_map_lexmax((isl_map *)set);
5931 /* Extract the first and only affine expression from list
5932 * and then add it to *pwaff with the given dom.
5933 * This domain is known to be disjoint from other domains
5934 * because of the way isl_basic_map_foreach_lexmax works.
5936 static int update_dim_opt(__isl_take isl_basic_set *dom,
5937 __isl_take isl_aff_list *list, void *user)
5939 isl_ctx *ctx = isl_basic_set_get_ctx(dom);
5941 isl_pw_aff **pwaff = user;
5942 isl_pw_aff *pwaff_i;
5944 if (isl_aff_list_n_aff(list) != 1)
5945 isl_die(ctx, isl_error_internal,
5946 "expecting single element list", goto error);
5948 aff = isl_aff_list_get_aff(list, 0);
5949 pwaff_i = isl_pw_aff_alloc(isl_set_from_basic_set(dom), aff);
5951 *pwaff = isl_pw_aff_add_disjoint(*pwaff, pwaff_i);
5953 isl_aff_list_free(list);
5957 isl_basic_set_free(dom);
5958 isl_aff_list_free(list);
5962 /* Given a basic map with one output dimension, compute the minimum or
5963 * maximum of that dimension as an isl_pw_aff.
5965 * The isl_pw_aff is constructed by having isl_basic_map_foreach_lexopt
5966 * call update_dim_opt on each leaf of the result.
5968 static __isl_give isl_pw_aff *basic_map_dim_opt(__isl_keep isl_basic_map *bmap,
5971 isl_space *dim = isl_basic_map_get_space(bmap);
5975 dim = isl_space_from_domain(isl_space_domain(dim));
5976 dim = isl_space_add_dims(dim, isl_dim_out, 1);
5977 pwaff = isl_pw_aff_empty(dim);
5979 r = isl_basic_map_foreach_lexopt(bmap, max, &update_dim_opt, &pwaff);
5981 return isl_pw_aff_free(pwaff);
5986 /* Compute the minimum or maximum of the given output dimension
5987 * as a function of the parameters and the input dimensions,
5988 * but independently of the other output dimensions.
5990 * We first project out the other output dimension and then compute
5991 * the "lexicographic" maximum in each basic map, combining the results
5992 * using isl_pw_aff_union_max.
5994 static __isl_give isl_pw_aff *map_dim_opt(__isl_take isl_map *map, int pos,
6001 n_out = isl_map_dim(map, isl_dim_out);
6002 map = isl_map_project_out(map, isl_dim_out, pos + 1, n_out - (pos + 1));
6003 map = isl_map_project_out(map, isl_dim_out, 0, pos);
6008 isl_space *dim = isl_map_get_space(map);
6009 dim = isl_space_domain(isl_space_from_range(dim));
6011 return isl_pw_aff_empty(dim);
6014 pwaff = basic_map_dim_opt(map->p[0], max);
6015 for (i = 1; i < map->n; ++i) {
6016 isl_pw_aff *pwaff_i;
6018 pwaff_i = basic_map_dim_opt(map->p[i], max);
6019 pwaff = isl_pw_aff_union_opt(pwaff, pwaff_i, max);
6027 /* Compute the maximum of the given output dimension as a function of the
6028 * parameters and input dimensions, but independently of
6029 * the other output dimensions.
6031 __isl_give isl_pw_aff *isl_map_dim_max(__isl_take isl_map *map, int pos)
6033 return map_dim_opt(map, pos, 1);
6036 /* Compute the minimum or maximum of the given set dimension
6037 * as a function of the parameters,
6038 * but independently of the other set dimensions.
6040 static __isl_give isl_pw_aff *set_dim_opt(__isl_take isl_set *set, int pos,
6043 return map_dim_opt(set, pos, max);
6046 /* Compute the maximum of the given set dimension as a function of the
6047 * parameters, but independently of the other set dimensions.
6049 __isl_give isl_pw_aff *isl_set_dim_max(__isl_take isl_set *set, int pos)
6051 return set_dim_opt(set, pos, 1);
6054 /* Compute the minimum of the given set dimension as a function of the
6055 * parameters, but independently of the other set dimensions.
6057 __isl_give isl_pw_aff *isl_set_dim_min(__isl_take isl_set *set, int pos)
6059 return set_dim_opt(set, pos, 0);
6062 /* Apply a preimage specified by "mat" on the parameters of "bset".
6063 * bset is assumed to have only parameters and divs.
6065 static struct isl_basic_set *basic_set_parameter_preimage(
6066 struct isl_basic_set *bset, struct isl_mat *mat)
6073 bset->dim = isl_space_cow(bset->dim);
6077 nparam = isl_basic_set_dim(bset, isl_dim_param);
6079 isl_assert(bset->ctx, mat->n_row == 1 + nparam, goto error);
6081 bset->dim->nparam = 0;
6082 bset->dim->n_out = nparam;
6083 bset = isl_basic_set_preimage(bset, mat);
6085 bset->dim->nparam = bset->dim->n_out;
6086 bset->dim->n_out = 0;
6091 isl_basic_set_free(bset);
6095 /* Apply a preimage specified by "mat" on the parameters of "set".
6096 * set is assumed to have only parameters and divs.
6098 static struct isl_set *set_parameter_preimage(
6099 struct isl_set *set, struct isl_mat *mat)
6101 isl_space *dim = NULL;
6107 dim = isl_space_copy(set->dim);
6108 dim = isl_space_cow(dim);
6112 nparam = isl_set_dim(set, isl_dim_param);
6114 isl_assert(set->ctx, mat->n_row == 1 + nparam, goto error);
6117 dim->n_out = nparam;
6118 isl_set_reset_space(set, dim);
6119 set = isl_set_preimage(set, mat);
6122 dim = isl_space_copy(set->dim);
6123 dim = isl_space_cow(dim);
6126 dim->nparam = dim->n_out;
6128 isl_set_reset_space(set, dim);
6131 isl_space_free(dim);
6138 /* Intersect the basic set "bset" with the affine space specified by the
6139 * equalities in "eq".
6141 static struct isl_basic_set *basic_set_append_equalities(
6142 struct isl_basic_set *bset, struct isl_mat *eq)
6150 bset = isl_basic_set_extend_space(bset, isl_space_copy(bset->dim), 0,
6155 len = 1 + isl_space_dim(bset->dim, isl_dim_all) + bset->extra;
6156 for (i = 0; i < eq->n_row; ++i) {
6157 k = isl_basic_set_alloc_equality(bset);
6160 isl_seq_cpy(bset->eq[k], eq->row[i], eq->n_col);
6161 isl_seq_clr(bset->eq[k] + eq->n_col, len - eq->n_col);
6165 bset = isl_basic_set_gauss(bset, NULL);
6166 bset = isl_basic_set_finalize(bset);
6171 isl_basic_set_free(bset);
6175 /* Intersect the set "set" with the affine space specified by the
6176 * equalities in "eq".
6178 static struct isl_set *set_append_equalities(struct isl_set *set,
6186 for (i = 0; i < set->n; ++i) {
6187 set->p[i] = basic_set_append_equalities(set->p[i],
6200 /* Project the given basic set onto its parameter domain, possibly introducing
6201 * new, explicit, existential variables in the constraints.
6202 * The input has parameters and (possibly implicit) existential variables.
6203 * The output has the same parameters, but only
6204 * explicit existentially quantified variables.
6206 * The actual projection is performed by pip, but pip doesn't seem
6207 * to like equalities very much, so we first remove the equalities
6208 * among the parameters by performing a variable compression on
6209 * the parameters. Afterward, an inverse transformation is performed
6210 * and the equalities among the parameters are inserted back in.
6212 static struct isl_set *parameter_compute_divs(struct isl_basic_set *bset)
6216 struct isl_mat *T, *T2;
6217 struct isl_set *set;
6218 unsigned nparam, n_div;
6220 bset = isl_basic_set_cow(bset);
6224 if (bset->n_eq == 0)
6225 return isl_basic_set_lexmin(bset);
6227 isl_basic_set_gauss(bset, NULL);
6229 nparam = isl_basic_set_dim(bset, isl_dim_param);
6230 n_div = isl_basic_set_dim(bset, isl_dim_div);
6232 for (i = 0, j = n_div - 1; i < bset->n_eq && j >= 0; --j) {
6233 if (!isl_int_is_zero(bset->eq[i][1 + nparam + j]))
6236 if (i == bset->n_eq)
6237 return isl_basic_set_lexmin(bset);
6239 eq = isl_mat_sub_alloc6(bset->ctx, bset->eq, i, bset->n_eq - i,
6241 eq = isl_mat_cow(eq);
6242 T = isl_mat_variable_compression(isl_mat_copy(eq), &T2);
6243 if (T && T->n_col == 0) {
6247 bset = isl_basic_set_set_to_empty(bset);
6248 return isl_set_from_basic_set(bset);
6250 bset = basic_set_parameter_preimage(bset, T);
6252 set = isl_basic_set_lexmin(bset);
6253 set = set_parameter_preimage(set, T2);
6254 set = set_append_equalities(set, eq);
6258 /* Compute an explicit representation for all the existentially
6259 * quantified variables.
6260 * The input and output dimensions are first turned into parameters.
6261 * compute_divs then returns a map with the same parameters and
6262 * no input or output dimensions and the dimension specification
6263 * is reset to that of the input.
6265 static struct isl_map *compute_divs(struct isl_basic_map *bmap)
6267 struct isl_basic_set *bset;
6268 struct isl_set *set;
6269 struct isl_map *map;
6270 isl_space *dim, *orig_dim = NULL;
6275 bmap = isl_basic_map_cow(bmap);
6279 nparam = isl_basic_map_dim(bmap, isl_dim_param);
6280 n_in = isl_basic_map_dim(bmap, isl_dim_in);
6281 n_out = isl_basic_map_dim(bmap, isl_dim_out);
6282 dim = isl_space_set_alloc(bmap->ctx, nparam + n_in + n_out, 0);
6286 orig_dim = bmap->dim;
6288 bset = (struct isl_basic_set *)bmap;
6290 set = parameter_compute_divs(bset);
6291 map = (struct isl_map *)set;
6292 map = isl_map_reset_space(map, orig_dim);
6296 isl_basic_map_free(bmap);
6300 int isl_basic_map_divs_known(__isl_keep isl_basic_map *bmap)
6308 off = isl_space_dim(bmap->dim, isl_dim_all);
6309 for (i = 0; i < bmap->n_div; ++i) {
6310 if (isl_int_is_zero(bmap->div[i][0]))
6312 isl_assert(bmap->ctx, isl_int_is_zero(bmap->div[i][1+1+off+i]),
6318 static int map_divs_known(__isl_keep isl_map *map)
6325 for (i = 0; i < map->n; ++i) {
6326 int known = isl_basic_map_divs_known(map->p[i]);
6334 /* If bmap contains any unknown divs, then compute explicit
6335 * expressions for them. However, this computation may be
6336 * quite expensive, so first try to remove divs that aren't
6339 struct isl_map *isl_basic_map_compute_divs(struct isl_basic_map *bmap)
6342 struct isl_map *map;
6344 known = isl_basic_map_divs_known(bmap);
6348 return isl_map_from_basic_map(bmap);
6350 bmap = isl_basic_map_drop_redundant_divs(bmap);
6352 known = isl_basic_map_divs_known(bmap);
6356 return isl_map_from_basic_map(bmap);
6358 map = compute_divs(bmap);
6361 isl_basic_map_free(bmap);
6365 struct isl_map *isl_map_compute_divs(struct isl_map *map)
6369 struct isl_map *res;
6376 known = map_divs_known(map);
6384 res = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[0]));
6385 for (i = 1 ; i < map->n; ++i) {
6387 r2 = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[i]));
6388 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT))
6389 res = isl_map_union_disjoint(res, r2);
6391 res = isl_map_union(res, r2);
6398 struct isl_set *isl_basic_set_compute_divs(struct isl_basic_set *bset)
6400 return (struct isl_set *)
6401 isl_basic_map_compute_divs((struct isl_basic_map *)bset);
6404 struct isl_set *isl_set_compute_divs(struct isl_set *set)
6406 return (struct isl_set *)
6407 isl_map_compute_divs((struct isl_map *)set);
6410 struct isl_set *isl_map_domain(struct isl_map *map)
6413 struct isl_set *set;
6418 map = isl_map_cow(map);
6422 set = (struct isl_set *)map;
6423 set->dim = isl_space_domain(set->dim);
6426 for (i = 0; i < map->n; ++i) {
6427 set->p[i] = isl_basic_map_domain(map->p[i]);
6431 ISL_F_CLR(set, ISL_MAP_DISJOINT);
6432 ISL_F_CLR(set, ISL_SET_NORMALIZED);
6439 static __isl_give isl_map *map_union_disjoint(__isl_take isl_map *map1,
6440 __isl_take isl_map *map2)
6444 struct isl_map *map = NULL;
6458 isl_assert(map1->ctx, isl_space_is_equal(map1->dim, map2->dim), goto error);
6460 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
6461 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
6462 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
6464 map = isl_map_alloc_space(isl_space_copy(map1->dim),
6465 map1->n + map2->n, flags);
6468 for (i = 0; i < map1->n; ++i) {
6469 map = isl_map_add_basic_map(map,
6470 isl_basic_map_copy(map1->p[i]));
6474 for (i = 0; i < map2->n; ++i) {
6475 map = isl_map_add_basic_map(map,
6476 isl_basic_map_copy(map2->p[i]));
6490 __isl_give isl_map *isl_map_union_disjoint(__isl_take isl_map *map1,
6491 __isl_take isl_map *map2)
6493 return isl_map_align_params_map_map_and(map1, map2, &map_union_disjoint);
6496 struct isl_map *isl_map_union(struct isl_map *map1, struct isl_map *map2)
6498 map1 = isl_map_union_disjoint(map1, map2);
6502 ISL_F_CLR(map1, ISL_MAP_DISJOINT);
6506 struct isl_set *isl_set_union_disjoint(
6507 struct isl_set *set1, struct isl_set *set2)
6509 return (struct isl_set *)
6510 isl_map_union_disjoint(
6511 (struct isl_map *)set1, (struct isl_map *)set2);
6514 struct isl_set *isl_set_union(struct isl_set *set1, struct isl_set *set2)
6516 return (struct isl_set *)
6517 isl_map_union((struct isl_map *)set1, (struct isl_map *)set2);
6520 static __isl_give isl_map *map_intersect_range(__isl_take isl_map *map,
6521 __isl_take isl_set *set)
6524 struct isl_map *result;
6530 if (!isl_space_match(map->dim, isl_dim_param, set->dim, isl_dim_param))
6531 isl_die(set->ctx, isl_error_invalid,
6532 "parameters don't match", goto error);
6534 if (isl_space_dim(set->dim, isl_dim_set) != 0 &&
6535 !isl_map_compatible_range(map, set))
6536 isl_die(set->ctx, isl_error_invalid,
6537 "incompatible spaces", goto error);
6539 if (isl_set_plain_is_universe(set)) {
6544 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT) &&
6545 ISL_F_ISSET(set, ISL_MAP_DISJOINT))
6546 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
6548 result = isl_map_alloc_space(isl_space_copy(map->dim),
6549 map->n * set->n, flags);
6552 for (i = 0; i < map->n; ++i)
6553 for (j = 0; j < set->n; ++j) {
6554 result = isl_map_add_basic_map(result,
6555 isl_basic_map_intersect_range(
6556 isl_basic_map_copy(map->p[i]),
6557 isl_basic_set_copy(set->p[j])));
6570 __isl_give isl_map *isl_map_intersect_range(__isl_take isl_map *map,
6571 __isl_take isl_set *set)
6573 return isl_map_align_params_map_map_and(map, set, &map_intersect_range);
6576 struct isl_map *isl_map_intersect_domain(
6577 struct isl_map *map, struct isl_set *set)
6579 return isl_map_reverse(
6580 isl_map_intersect_range(isl_map_reverse(map), set));
6583 static __isl_give isl_map *map_apply_domain(__isl_take isl_map *map1,
6584 __isl_take isl_map *map2)
6588 map1 = isl_map_reverse(map1);
6589 map1 = isl_map_apply_range(map1, map2);
6590 return isl_map_reverse(map1);
6597 __isl_give isl_map *isl_map_apply_domain(__isl_take isl_map *map1,
6598 __isl_take isl_map *map2)
6600 return isl_map_align_params_map_map_and(map1, map2, &map_apply_domain);
6603 static __isl_give isl_map *map_apply_range(__isl_take isl_map *map1,
6604 __isl_take isl_map *map2)
6606 isl_space *dim_result;
6607 struct isl_map *result;
6613 dim_result = isl_space_join(isl_space_copy(map1->dim),
6614 isl_space_copy(map2->dim));
6616 result = isl_map_alloc_space(dim_result, map1->n * map2->n, 0);
6619 for (i = 0; i < map1->n; ++i)
6620 for (j = 0; j < map2->n; ++j) {
6621 result = isl_map_add_basic_map(result,
6622 isl_basic_map_apply_range(
6623 isl_basic_map_copy(map1->p[i]),
6624 isl_basic_map_copy(map2->p[j])));
6630 if (result && result->n <= 1)
6631 ISL_F_SET(result, ISL_MAP_DISJOINT);
6639 __isl_give isl_map *isl_map_apply_range(__isl_take isl_map *map1,
6640 __isl_take isl_map *map2)
6642 return isl_map_align_params_map_map_and(map1, map2, &map_apply_range);
6646 * returns range - domain
6648 struct isl_basic_set *isl_basic_map_deltas(struct isl_basic_map *bmap)
6650 isl_space *dims, *target_dim;
6651 struct isl_basic_set *bset;
6658 isl_assert(bmap->ctx, isl_space_tuple_match(bmap->dim, isl_dim_in,
6659 bmap->dim, isl_dim_out),
6661 target_dim = isl_space_domain(isl_basic_map_get_space(bmap));
6662 dim = isl_basic_map_n_in(bmap);
6663 nparam = isl_basic_map_n_param(bmap);
6664 bset = isl_basic_set_from_basic_map(bmap);
6665 bset = isl_basic_set_cow(bset);
6666 dims = isl_basic_set_get_space(bset);
6667 dims = isl_space_add_dims(dims, isl_dim_set, dim);
6668 bset = isl_basic_set_extend_space(bset, dims, 0, dim, 0);
6669 bset = isl_basic_set_swap_vars(bset, 2*dim);
6670 for (i = 0; i < dim; ++i) {
6671 int j = isl_basic_map_alloc_equality(
6672 (struct isl_basic_map *)bset);
6675 isl_seq_clr(bset->eq[j], 1 + isl_basic_set_total_dim(bset));
6676 isl_int_set_si(bset->eq[j][1+nparam+i], 1);
6677 isl_int_set_si(bset->eq[j][1+nparam+dim+i], 1);
6678 isl_int_set_si(bset->eq[j][1+nparam+2*dim+i], -1);
6680 bset = isl_basic_set_project_out(bset, isl_dim_set, dim, 2*dim);
6681 bset = isl_basic_set_reset_space(bset, target_dim);
6684 isl_basic_map_free(bmap);
6689 * returns range - domain
6691 __isl_give isl_set *isl_map_deltas(__isl_take isl_map *map)
6695 struct isl_set *result;
6700 isl_assert(map->ctx, isl_space_tuple_match(map->dim, isl_dim_in,
6701 map->dim, isl_dim_out),
6703 dim = isl_map_get_space(map);
6704 dim = isl_space_domain(dim);
6705 result = isl_set_alloc_space(dim, map->n, 0);
6708 for (i = 0; i < map->n; ++i)
6709 result = isl_set_add_basic_set(result,
6710 isl_basic_map_deltas(isl_basic_map_copy(map->p[i])));
6719 * returns [domain -> range] -> range - domain
6721 __isl_give isl_basic_map *isl_basic_map_deltas_map(
6722 __isl_take isl_basic_map *bmap)
6726 isl_basic_map *domain;
6730 if (!isl_space_tuple_match(bmap->dim, isl_dim_in, bmap->dim, isl_dim_out))
6731 isl_die(bmap->ctx, isl_error_invalid,
6732 "domain and range don't match", goto error);
6734 nparam = isl_basic_map_dim(bmap, isl_dim_param);
6735 n = isl_basic_map_dim(bmap, isl_dim_in);
6737 dim = isl_space_from_range(isl_space_domain(isl_basic_map_get_space(bmap)));
6738 domain = isl_basic_map_universe(dim);
6740 bmap = isl_basic_map_from_domain(isl_basic_map_wrap(bmap));
6741 bmap = isl_basic_map_apply_range(bmap, domain);
6742 bmap = isl_basic_map_extend_constraints(bmap, n, 0);
6744 total = isl_basic_map_total_dim(bmap);
6746 for (i = 0; i < n; ++i) {
6747 k = isl_basic_map_alloc_equality(bmap);
6750 isl_seq_clr(bmap->eq[k], 1 + total);
6751 isl_int_set_si(bmap->eq[k][1 + nparam + i], 1);
6752 isl_int_set_si(bmap->eq[k][1 + nparam + n + i], -1);
6753 isl_int_set_si(bmap->eq[k][1 + nparam + n + n + i], 1);
6756 bmap = isl_basic_map_gauss(bmap, NULL);
6757 return isl_basic_map_finalize(bmap);
6759 isl_basic_map_free(bmap);
6764 * returns [domain -> range] -> range - domain
6766 __isl_give isl_map *isl_map_deltas_map(__isl_take isl_map *map)
6769 isl_space *domain_dim;
6774 if (!isl_space_tuple_match(map->dim, isl_dim_in, map->dim, isl_dim_out))
6775 isl_die(map->ctx, isl_error_invalid,
6776 "domain and range don't match", goto error);
6778 map = isl_map_cow(map);
6782 domain_dim = isl_space_from_range(isl_space_domain(isl_map_get_space(map)));
6783 map->dim = isl_space_from_domain(isl_space_wrap(map->dim));
6784 map->dim = isl_space_join(map->dim, domain_dim);
6787 for (i = 0; i < map->n; ++i) {
6788 map->p[i] = isl_basic_map_deltas_map(map->p[i]);
6792 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
6799 __isl_give struct isl_basic_map *basic_map_identity(__isl_take isl_space *dims)
6801 struct isl_basic_map *bmap;
6809 nparam = dims->nparam;
6811 bmap = isl_basic_map_alloc_space(dims, 0, dim, 0);
6815 for (i = 0; i < dim; ++i) {
6816 int j = isl_basic_map_alloc_equality(bmap);
6819 isl_seq_clr(bmap->eq[j], 1 + isl_basic_map_total_dim(bmap));
6820 isl_int_set_si(bmap->eq[j][1+nparam+i], 1);
6821 isl_int_set_si(bmap->eq[j][1+nparam+dim+i], -1);
6823 return isl_basic_map_finalize(bmap);
6825 isl_basic_map_free(bmap);
6829 __isl_give isl_basic_map *isl_basic_map_identity(__isl_take isl_space *dim)
6833 if (dim->n_in != dim->n_out)
6834 isl_die(dim->ctx, isl_error_invalid,
6835 "number of input and output dimensions needs to be "
6836 "the same", goto error);
6837 return basic_map_identity(dim);
6839 isl_space_free(dim);
6843 struct isl_basic_map *isl_basic_map_identity_like(struct isl_basic_map *model)
6845 if (!model || !model->dim)
6847 return isl_basic_map_identity(isl_space_copy(model->dim));
6850 __isl_give isl_map *isl_map_identity(__isl_take isl_space *dim)
6852 return isl_map_from_basic_map(isl_basic_map_identity(dim));
6855 struct isl_map *isl_map_identity_like(struct isl_map *model)
6857 if (!model || !model->dim)
6859 return isl_map_identity(isl_space_copy(model->dim));
6862 struct isl_map *isl_map_identity_like_basic_map(struct isl_basic_map *model)
6864 if (!model || !model->dim)
6866 return isl_map_identity(isl_space_copy(model->dim));
6869 __isl_give isl_map *isl_set_identity(__isl_take isl_set *set)
6871 isl_space *dim = isl_set_get_space(set);
6873 id = isl_map_identity(isl_space_map_from_set(dim));
6874 return isl_map_intersect_range(id, set);
6877 /* Construct a basic set with all set dimensions having only non-negative
6880 __isl_give isl_basic_set *isl_basic_set_positive_orthant(
6881 __isl_take isl_space *space)
6886 struct isl_basic_set *bset;
6890 nparam = space->nparam;
6892 bset = isl_basic_set_alloc_space(space, 0, 0, dim);
6895 for (i = 0; i < dim; ++i) {
6896 int k = isl_basic_set_alloc_inequality(bset);
6899 isl_seq_clr(bset->ineq[k], 1 + isl_basic_set_total_dim(bset));
6900 isl_int_set_si(bset->ineq[k][1 + nparam + i], 1);
6904 isl_basic_set_free(bset);
6908 /* Construct the half-space x_pos >= 0.
6910 static __isl_give isl_basic_set *nonneg_halfspace(__isl_take isl_space *dim,
6914 isl_basic_set *nonneg;
6916 nonneg = isl_basic_set_alloc_space(dim, 0, 0, 1);
6917 k = isl_basic_set_alloc_inequality(nonneg);
6920 isl_seq_clr(nonneg->ineq[k], 1 + isl_basic_set_total_dim(nonneg));
6921 isl_int_set_si(nonneg->ineq[k][pos], 1);
6923 return isl_basic_set_finalize(nonneg);
6925 isl_basic_set_free(nonneg);
6929 /* Construct the half-space x_pos <= -1.
6931 static __isl_give isl_basic_set *neg_halfspace(__isl_take isl_space *dim, int pos)
6936 neg = isl_basic_set_alloc_space(dim, 0, 0, 1);
6937 k = isl_basic_set_alloc_inequality(neg);
6940 isl_seq_clr(neg->ineq[k], 1 + isl_basic_set_total_dim(neg));
6941 isl_int_set_si(neg->ineq[k][0], -1);
6942 isl_int_set_si(neg->ineq[k][pos], -1);
6944 return isl_basic_set_finalize(neg);
6946 isl_basic_set_free(neg);
6950 __isl_give isl_set *isl_set_split_dims(__isl_take isl_set *set,
6951 enum isl_dim_type type, unsigned first, unsigned n)
6954 isl_basic_set *nonneg;
6962 isl_assert(set->ctx, first + n <= isl_set_dim(set, type), goto error);
6964 for (i = 0; i < n; ++i) {
6965 nonneg = nonneg_halfspace(isl_set_get_space(set),
6966 pos(set->dim, type) + first + i);
6967 neg = neg_halfspace(isl_set_get_space(set),
6968 pos(set->dim, type) + first + i);
6970 set = isl_set_intersect(set, isl_basic_set_union(nonneg, neg));
6979 static int foreach_orthant(__isl_take isl_set *set, int *signs, int first,
6980 int len, int (*fn)(__isl_take isl_set *orthant, int *signs, void *user),
6987 if (isl_set_plain_is_empty(set)) {
6992 return fn(set, signs, user);
6995 half = isl_set_from_basic_set(nonneg_halfspace(isl_set_get_space(set),
6997 half = isl_set_intersect(half, isl_set_copy(set));
6998 if (foreach_orthant(half, signs, first + 1, len, fn, user) < 0)
7002 half = isl_set_from_basic_set(neg_halfspace(isl_set_get_space(set),
7004 half = isl_set_intersect(half, set);
7005 return foreach_orthant(half, signs, first + 1, len, fn, user);
7011 /* Call "fn" on the intersections of "set" with each of the orthants
7012 * (except for obviously empty intersections). The orthant is identified
7013 * by the signs array, with each entry having value 1 or -1 according
7014 * to the sign of the corresponding variable.
7016 int isl_set_foreach_orthant(__isl_keep isl_set *set,
7017 int (*fn)(__isl_take isl_set *orthant, int *signs, void *user),
7027 if (isl_set_plain_is_empty(set))
7030 nparam = isl_set_dim(set, isl_dim_param);
7031 nvar = isl_set_dim(set, isl_dim_set);
7033 signs = isl_alloc_array(set->ctx, int, nparam + nvar);
7035 r = foreach_orthant(isl_set_copy(set), signs, 0, nparam + nvar,
7043 int isl_set_is_equal(struct isl_set *set1, struct isl_set *set2)
7045 return isl_map_is_equal((struct isl_map *)set1, (struct isl_map *)set2);
7048 int isl_basic_map_is_subset(
7049 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
7052 struct isl_map *map1;
7053 struct isl_map *map2;
7055 if (!bmap1 || !bmap2)
7058 map1 = isl_map_from_basic_map(isl_basic_map_copy(bmap1));
7059 map2 = isl_map_from_basic_map(isl_basic_map_copy(bmap2));
7061 is_subset = isl_map_is_subset(map1, map2);
7069 int isl_basic_set_is_subset(__isl_keep isl_basic_set *bset1,
7070 __isl_keep isl_basic_set *bset2)
7072 return isl_basic_map_is_subset(bset1, bset2);
7075 int isl_basic_map_is_equal(
7076 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
7080 if (!bmap1 || !bmap2)
7082 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
7085 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
7089 int isl_basic_set_is_equal(
7090 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
7092 return isl_basic_map_is_equal(
7093 (struct isl_basic_map *)bset1, (struct isl_basic_map *)bset2);
7096 int isl_map_is_empty(struct isl_map *map)
7103 for (i = 0; i < map->n; ++i) {
7104 is_empty = isl_basic_map_is_empty(map->p[i]);
7113 int isl_map_plain_is_empty(__isl_keep isl_map *map)
7115 return map ? map->n == 0 : -1;
7118 int isl_map_fast_is_empty(__isl_keep isl_map *map)
7120 return isl_map_plain_is_empty(map);
7123 int isl_set_plain_is_empty(struct isl_set *set)
7125 return set ? set->n == 0 : -1;
7128 int isl_set_fast_is_empty(__isl_keep isl_set *set)
7130 return isl_set_plain_is_empty(set);
7133 int isl_set_is_empty(struct isl_set *set)
7135 return isl_map_is_empty((struct isl_map *)set);
7138 int isl_map_has_equal_space(__isl_keep isl_map *map1, __isl_keep isl_map *map2)
7143 return isl_space_is_equal(map1->dim, map2->dim);
7146 int isl_set_has_equal_space(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
7151 return isl_space_is_equal(set1->dim, set2->dim);
7154 static int map_is_equal(__isl_keep isl_map *map1, __isl_keep isl_map *map2)
7160 is_subset = isl_map_is_subset(map1, map2);
7163 is_subset = isl_map_is_subset(map2, map1);
7167 int isl_map_is_equal(__isl_keep isl_map *map1, __isl_keep isl_map *map2)
7169 return isl_map_align_params_map_map_and_test(map1, map2, &map_is_equal);
7172 int isl_basic_map_is_strict_subset(
7173 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
7177 if (!bmap1 || !bmap2)
7179 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
7182 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
7183 if (is_subset == -1)
7188 int isl_map_is_strict_subset(struct isl_map *map1, struct isl_map *map2)
7194 is_subset = isl_map_is_subset(map1, map2);
7197 is_subset = isl_map_is_subset(map2, map1);
7198 if (is_subset == -1)
7203 int isl_set_is_strict_subset(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
7205 return isl_map_is_strict_subset((isl_map *)set1, (isl_map *)set2);
7208 int isl_basic_map_is_universe(struct isl_basic_map *bmap)
7212 return bmap->n_eq == 0 && bmap->n_ineq == 0;
7215 int isl_basic_set_is_universe(struct isl_basic_set *bset)
7219 return bset->n_eq == 0 && bset->n_ineq == 0;
7222 int isl_map_plain_is_universe(__isl_keep isl_map *map)
7229 for (i = 0; i < map->n; ++i) {
7230 int r = isl_basic_map_is_universe(map->p[i]);
7238 int isl_set_plain_is_universe(__isl_keep isl_set *set)
7240 return isl_map_plain_is_universe((isl_map *) set);
7243 int isl_set_fast_is_universe(__isl_keep isl_set *set)
7245 return isl_set_plain_is_universe(set);
7248 int isl_basic_map_is_empty(struct isl_basic_map *bmap)
7250 struct isl_basic_set *bset = NULL;
7251 struct isl_vec *sample = NULL;
7258 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY))
7261 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL)) {
7262 struct isl_basic_map *copy = isl_basic_map_copy(bmap);
7263 copy = isl_basic_map_remove_redundancies(copy);
7264 empty = ISL_F_ISSET(copy, ISL_BASIC_MAP_EMPTY);
7265 isl_basic_map_free(copy);
7269 total = 1 + isl_basic_map_total_dim(bmap);
7270 if (bmap->sample && bmap->sample->size == total) {
7271 int contains = isl_basic_map_contains(bmap, bmap->sample);
7277 isl_vec_free(bmap->sample);
7278 bmap->sample = NULL;
7279 bset = isl_basic_map_underlying_set(isl_basic_map_copy(bmap));
7282 sample = isl_basic_set_sample_vec(bset);
7285 empty = sample->size == 0;
7286 isl_vec_free(bmap->sample);
7287 bmap->sample = sample;
7289 ISL_F_SET(bmap, ISL_BASIC_MAP_EMPTY);
7294 int isl_basic_map_plain_is_empty(__isl_keep isl_basic_map *bmap)
7298 return ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY);
7301 int isl_basic_map_fast_is_empty(__isl_keep isl_basic_map *bmap)
7303 return isl_basic_map_plain_is_empty(bmap);
7306 int isl_basic_set_plain_is_empty(__isl_keep isl_basic_set *bset)
7310 return ISL_F_ISSET(bset, ISL_BASIC_SET_EMPTY);
7313 int isl_basic_set_fast_is_empty(__isl_keep isl_basic_set *bset)
7315 return isl_basic_set_plain_is_empty(bset);
7318 int isl_basic_set_is_empty(struct isl_basic_set *bset)
7320 return isl_basic_map_is_empty((struct isl_basic_map *)bset);
7323 struct isl_map *isl_basic_map_union(
7324 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
7326 struct isl_map *map;
7327 if (!bmap1 || !bmap2)
7330 isl_assert(bmap1->ctx, isl_space_is_equal(bmap1->dim, bmap2->dim), goto error);
7332 map = isl_map_alloc_space(isl_space_copy(bmap1->dim), 2, 0);
7335 map = isl_map_add_basic_map(map, bmap1);
7336 map = isl_map_add_basic_map(map, bmap2);
7339 isl_basic_map_free(bmap1);
7340 isl_basic_map_free(bmap2);
7344 struct isl_set *isl_basic_set_union(
7345 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
7347 return (struct isl_set *)isl_basic_map_union(
7348 (struct isl_basic_map *)bset1,
7349 (struct isl_basic_map *)bset2);
7352 /* Order divs such that any div only depends on previous divs */
7353 struct isl_basic_map *isl_basic_map_order_divs(struct isl_basic_map *bmap)
7361 off = isl_space_dim(bmap->dim, isl_dim_all);
7363 for (i = 0; i < bmap->n_div; ++i) {
7365 if (isl_int_is_zero(bmap->div[i][0]))
7367 pos = isl_seq_first_non_zero(bmap->div[i]+1+1+off+i,
7371 isl_basic_map_swap_div(bmap, i, i + pos);
7377 struct isl_basic_set *isl_basic_set_order_divs(struct isl_basic_set *bset)
7379 return (struct isl_basic_set *)
7380 isl_basic_map_order_divs((struct isl_basic_map *)bset);
7383 __isl_give isl_map *isl_map_order_divs(__isl_take isl_map *map)
7390 for (i = 0; i < map->n; ++i) {
7391 map->p[i] = isl_basic_map_order_divs(map->p[i]);
7402 /* Apply the expansion computed by isl_merge_divs.
7403 * The expansion itself is given by "exp" while the resulting
7404 * list of divs is given by "div".
7406 __isl_give isl_basic_set *isl_basic_set_expand_divs(
7407 __isl_take isl_basic_set *bset, __isl_take isl_mat *div, int *exp)
7412 bset = isl_basic_set_cow(bset);
7416 if (div->n_row < bset->n_div)
7417 isl_die(isl_mat_get_ctx(div), isl_error_invalid,
7418 "not an expansion", goto error);
7420 bset = isl_basic_map_extend_space(bset, isl_space_copy(bset->dim),
7421 div->n_row - bset->n_div, 0,
7422 2 * (div->n_row - bset->n_div));
7424 n_div = bset->n_div;
7425 for (i = n_div; i < div->n_row; ++i)
7426 if (isl_basic_set_alloc_div(bset) < 0)
7430 for (i = div->n_row - 1; i >= 0; --i) {
7431 if (j >= 0 && exp[j] == i) {
7433 isl_basic_map_swap_div(bset, i, j);
7436 isl_seq_cpy(bset->div[i], div->row[i], div->n_col);
7437 if (isl_basic_map_add_div_constraints(bset, i) < 0)
7445 isl_basic_set_free(bset);
7450 /* Look for a div in dst that corresponds to the div "div" in src.
7451 * The divs before "div" in src and dst are assumed to be the same.
7453 * Returns -1 if no corresponding div was found and the position
7454 * of the corresponding div in dst otherwise.
7456 static int find_div(struct isl_basic_map *dst,
7457 struct isl_basic_map *src, unsigned div)
7461 unsigned total = isl_space_dim(src->dim, isl_dim_all);
7463 isl_assert(dst->ctx, div <= dst->n_div, return -1);
7464 for (i = div; i < dst->n_div; ++i)
7465 if (isl_seq_eq(dst->div[i], src->div[div], 1+1+total+div) &&
7466 isl_seq_first_non_zero(dst->div[i]+1+1+total+div,
7467 dst->n_div - div) == -1)
7472 struct isl_basic_map *isl_basic_map_align_divs(
7473 struct isl_basic_map *dst, struct isl_basic_map *src)
7476 unsigned total = isl_space_dim(src->dim, isl_dim_all);
7481 if (src->n_div == 0)
7484 for (i = 0; i < src->n_div; ++i)
7485 isl_assert(src->ctx, !isl_int_is_zero(src->div[i][0]), goto error);
7487 src = isl_basic_map_order_divs(src);
7488 dst = isl_basic_map_cow(dst);
7489 dst = isl_basic_map_extend_space(dst, isl_space_copy(dst->dim),
7490 src->n_div, 0, 2 * src->n_div);
7493 for (i = 0; i < src->n_div; ++i) {
7494 int j = find_div(dst, src, i);
7496 j = isl_basic_map_alloc_div(dst);
7499 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total+i);
7500 isl_seq_clr(dst->div[j]+1+1+total+i, dst->n_div - i);
7501 if (isl_basic_map_add_div_constraints(dst, j) < 0)
7505 isl_basic_map_swap_div(dst, i, j);
7509 isl_basic_map_free(dst);
7513 struct isl_basic_set *isl_basic_set_align_divs(
7514 struct isl_basic_set *dst, struct isl_basic_set *src)
7516 return (struct isl_basic_set *)isl_basic_map_align_divs(
7517 (struct isl_basic_map *)dst, (struct isl_basic_map *)src);
7520 struct isl_map *isl_map_align_divs(struct isl_map *map)
7528 map = isl_map_compute_divs(map);
7529 map = isl_map_cow(map);
7533 for (i = 1; i < map->n; ++i)
7534 map->p[0] = isl_basic_map_align_divs(map->p[0], map->p[i]);
7535 for (i = 1; i < map->n; ++i)
7536 map->p[i] = isl_basic_map_align_divs(map->p[i], map->p[0]);
7538 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
7542 struct isl_set *isl_set_align_divs(struct isl_set *set)
7544 return (struct isl_set *)isl_map_align_divs((struct isl_map *)set);
7547 static __isl_give isl_set *set_apply( __isl_take isl_set *set,
7548 __isl_take isl_map *map)
7552 isl_assert(set->ctx, isl_map_compatible_domain(map, set), goto error);
7553 map = isl_map_intersect_domain(map, set);
7554 set = isl_map_range(map);
7562 __isl_give isl_set *isl_set_apply( __isl_take isl_set *set,
7563 __isl_take isl_map *map)
7565 return isl_map_align_params_map_map_and(set, map, &set_apply);
7568 /* There is no need to cow as removing empty parts doesn't change
7569 * the meaning of the set.
7571 struct isl_map *isl_map_remove_empty_parts(struct isl_map *map)
7578 for (i = map->n - 1; i >= 0; --i)
7579 remove_if_empty(map, i);
7584 struct isl_set *isl_set_remove_empty_parts(struct isl_set *set)
7586 return (struct isl_set *)
7587 isl_map_remove_empty_parts((struct isl_map *)set);
7590 struct isl_basic_map *isl_map_copy_basic_map(struct isl_map *map)
7592 struct isl_basic_map *bmap;
7593 if (!map || map->n == 0)
7595 bmap = map->p[map->n-1];
7596 isl_assert(map->ctx, ISL_F_ISSET(bmap, ISL_BASIC_SET_FINAL), return NULL);
7597 return isl_basic_map_copy(bmap);
7600 struct isl_basic_set *isl_set_copy_basic_set(struct isl_set *set)
7602 return (struct isl_basic_set *)
7603 isl_map_copy_basic_map((struct isl_map *)set);
7606 __isl_give isl_map *isl_map_drop_basic_map(__isl_take isl_map *map,
7607 __isl_keep isl_basic_map *bmap)
7613 for (i = map->n-1; i >= 0; --i) {
7614 if (map->p[i] != bmap)
7616 map = isl_map_cow(map);
7619 isl_basic_map_free(map->p[i]);
7620 if (i != map->n-1) {
7621 ISL_F_CLR(map, ISL_SET_NORMALIZED);
7622 map->p[i] = map->p[map->n-1];
7633 struct isl_set *isl_set_drop_basic_set(struct isl_set *set,
7634 struct isl_basic_set *bset)
7636 return (struct isl_set *)isl_map_drop_basic_map((struct isl_map *)set,
7637 (struct isl_basic_map *)bset);
7640 /* Given two basic sets bset1 and bset2, compute the maximal difference
7641 * between the values of dimension pos in bset1 and those in bset2
7642 * for any common value of the parameters and dimensions preceding pos.
7644 static enum isl_lp_result basic_set_maximal_difference_at(
7645 __isl_keep isl_basic_set *bset1, __isl_keep isl_basic_set *bset2,
7646 int pos, isl_int *opt)
7649 struct isl_basic_map *bmap1 = NULL;
7650 struct isl_basic_map *bmap2 = NULL;
7651 struct isl_ctx *ctx;
7652 struct isl_vec *obj;
7655 unsigned dim1, dim2;
7656 enum isl_lp_result res;
7658 if (!bset1 || !bset2)
7659 return isl_lp_error;
7661 nparam = isl_basic_set_n_param(bset1);
7662 dim1 = isl_basic_set_n_dim(bset1);
7663 dim2 = isl_basic_set_n_dim(bset2);
7664 dims = isl_space_alloc(bset1->ctx, nparam, pos, dim1 - pos);
7665 bmap1 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset1), dims);
7666 dims = isl_space_alloc(bset2->ctx, nparam, pos, dim2 - pos);
7667 bmap2 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset2), dims);
7668 if (!bmap1 || !bmap2)
7670 bmap1 = isl_basic_map_cow(bmap1);
7671 bmap1 = isl_basic_map_extend(bmap1, nparam,
7672 pos, (dim1 - pos) + (dim2 - pos),
7673 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
7674 bmap1 = add_constraints(bmap1, bmap2, 0, dim1 - pos);
7677 total = isl_basic_map_total_dim(bmap1);
7679 obj = isl_vec_alloc(ctx, 1 + total);
7680 isl_seq_clr(obj->block.data, 1 + total);
7681 isl_int_set_si(obj->block.data[1+nparam+pos], 1);
7682 isl_int_set_si(obj->block.data[1+nparam+pos+(dim1-pos)], -1);
7685 res = isl_basic_map_solve_lp(bmap1, 1, obj->block.data, ctx->one,
7687 isl_basic_map_free(bmap1);
7691 isl_basic_map_free(bmap1);
7692 isl_basic_map_free(bmap2);
7693 return isl_lp_error;
7696 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
7697 * for any common value of the parameters and dimensions preceding pos
7698 * in both basic sets, the values of dimension pos in bset1 are
7699 * smaller or larger than those in bset2.
7702 * 1 if bset1 follows bset2
7703 * -1 if bset1 precedes bset2
7704 * 0 if bset1 and bset2 are incomparable
7705 * -2 if some error occurred.
7707 int isl_basic_set_compare_at(struct isl_basic_set *bset1,
7708 struct isl_basic_set *bset2, int pos)
7711 enum isl_lp_result res;
7716 res = basic_set_maximal_difference_at(bset1, bset2, pos, &opt);
7718 if (res == isl_lp_empty)
7720 else if ((res == isl_lp_ok && isl_int_is_pos(opt)) ||
7721 res == isl_lp_unbounded)
7723 else if (res == isl_lp_ok && isl_int_is_neg(opt))
7732 /* Given two basic sets bset1 and bset2, check whether
7733 * for any common value of the parameters and dimensions preceding pos
7734 * there is a value of dimension pos in bset1 that is larger
7735 * than a value of the same dimension in bset2.
7738 * 1 if there exists such a pair
7739 * 0 if there is no such pair, but there is a pair of equal values
7741 * -2 if some error occurred.
7743 int isl_basic_set_follows_at(__isl_keep isl_basic_set *bset1,
7744 __isl_keep isl_basic_set *bset2, int pos)
7747 enum isl_lp_result res;
7752 res = basic_set_maximal_difference_at(bset1, bset2, pos, &opt);
7754 if (res == isl_lp_empty)
7756 else if ((res == isl_lp_ok && isl_int_is_pos(opt)) ||
7757 res == isl_lp_unbounded)
7759 else if (res == isl_lp_ok && isl_int_is_neg(opt))
7761 else if (res == isl_lp_ok)
7770 /* Given two sets set1 and set2, check whether
7771 * for any common value of the parameters and dimensions preceding pos
7772 * there is a value of dimension pos in set1 that is larger
7773 * than a value of the same dimension in set2.
7776 * 1 if there exists such a pair
7777 * 0 if there is no such pair, but there is a pair of equal values
7779 * -2 if some error occurred.
7781 int isl_set_follows_at(__isl_keep isl_set *set1,
7782 __isl_keep isl_set *set2, int pos)
7790 for (i = 0; i < set1->n; ++i)
7791 for (j = 0; j < set2->n; ++j) {
7793 f = isl_basic_set_follows_at(set1->p[i], set2->p[j], pos);
7794 if (f == 1 || f == -2)
7803 static int isl_basic_map_plain_has_fixed_var(__isl_keep isl_basic_map *bmap,
7804 unsigned pos, isl_int *val)
7812 total = isl_basic_map_total_dim(bmap);
7813 for (i = 0, d = total-1; i < bmap->n_eq && d+1 > pos; ++i) {
7814 for (; d+1 > pos; --d)
7815 if (!isl_int_is_zero(bmap->eq[i][1+d]))
7819 if (isl_seq_first_non_zero(bmap->eq[i]+1, d) != -1)
7821 if (isl_seq_first_non_zero(bmap->eq[i]+1+d+1, total-d-1) != -1)
7823 if (!isl_int_is_one(bmap->eq[i][1+d]))
7826 isl_int_neg(*val, bmap->eq[i][0]);
7832 static int isl_map_plain_has_fixed_var(__isl_keep isl_map *map,
7833 unsigned pos, isl_int *val)
7845 return isl_basic_map_plain_has_fixed_var(map->p[0], pos, val);
7848 fixed = isl_basic_map_plain_has_fixed_var(map->p[0], pos, &v);
7849 for (i = 1; fixed == 1 && i < map->n; ++i) {
7850 fixed = isl_basic_map_plain_has_fixed_var(map->p[i], pos, &tmp);
7851 if (fixed == 1 && isl_int_ne(tmp, v))
7855 isl_int_set(*val, v);
7861 static int isl_basic_set_plain_has_fixed_var(__isl_keep isl_basic_set *bset,
7862 unsigned pos, isl_int *val)
7864 return isl_basic_map_plain_has_fixed_var((struct isl_basic_map *)bset,
7868 static int isl_set_plain_has_fixed_var(__isl_keep isl_set *set, unsigned pos,
7871 return isl_map_plain_has_fixed_var((struct isl_map *)set, pos, val);
7874 int isl_basic_map_plain_is_fixed(__isl_keep isl_basic_map *bmap,
7875 enum isl_dim_type type, unsigned pos, isl_int *val)
7877 if (pos >= isl_basic_map_dim(bmap, type))
7879 return isl_basic_map_plain_has_fixed_var(bmap,
7880 isl_basic_map_offset(bmap, type) - 1 + pos, val);
7883 int isl_map_plain_is_fixed(__isl_keep isl_map *map,
7884 enum isl_dim_type type, unsigned pos, isl_int *val)
7886 if (pos >= isl_map_dim(map, type))
7888 return isl_map_plain_has_fixed_var(map,
7889 map_offset(map, type) - 1 + pos, val);
7892 int isl_set_plain_is_fixed(__isl_keep isl_set *set,
7893 enum isl_dim_type type, unsigned pos, isl_int *val)
7895 return isl_map_plain_is_fixed(set, type, pos, val);
7898 int isl_map_fast_is_fixed(__isl_keep isl_map *map,
7899 enum isl_dim_type type, unsigned pos, isl_int *val)
7901 return isl_map_plain_is_fixed(map, type, pos, val);
7904 /* Check if dimension dim has fixed value and if so and if val is not NULL,
7905 * then return this fixed value in *val.
7907 int isl_basic_set_plain_dim_is_fixed(__isl_keep isl_basic_set *bset,
7908 unsigned dim, isl_int *val)
7910 return isl_basic_set_plain_has_fixed_var(bset,
7911 isl_basic_set_n_param(bset) + dim, val);
7914 /* Check if dimension dim has fixed value and if so and if val is not NULL,
7915 * then return this fixed value in *val.
7917 int isl_set_plain_dim_is_fixed(__isl_keep isl_set *set,
7918 unsigned dim, isl_int *val)
7920 return isl_set_plain_has_fixed_var(set, isl_set_n_param(set) + dim, val);
7923 int isl_set_fast_dim_is_fixed(__isl_keep isl_set *set,
7924 unsigned dim, isl_int *val)
7926 return isl_set_plain_dim_is_fixed(set, dim, val);
7929 /* Check if input variable in has fixed value and if so and if val is not NULL,
7930 * then return this fixed value in *val.
7932 int isl_map_plain_input_is_fixed(__isl_keep isl_map *map,
7933 unsigned in, isl_int *val)
7935 return isl_map_plain_has_fixed_var(map, isl_map_n_param(map) + in, val);
7938 /* Check if dimension dim has an (obvious) fixed lower bound and if so
7939 * and if val is not NULL, then return this lower bound in *val.
7941 int isl_basic_set_plain_dim_has_fixed_lower_bound(
7942 __isl_keep isl_basic_set *bset, unsigned dim, isl_int *val)
7944 int i, i_eq = -1, i_ineq = -1;
7951 total = isl_basic_set_total_dim(bset);
7952 nparam = isl_basic_set_n_param(bset);
7953 for (i = 0; i < bset->n_eq; ++i) {
7954 if (isl_int_is_zero(bset->eq[i][1+nparam+dim]))
7960 for (i = 0; i < bset->n_ineq; ++i) {
7961 if (!isl_int_is_pos(bset->ineq[i][1+nparam+dim]))
7963 if (i_eq != -1 || i_ineq != -1)
7967 if (i_eq == -1 && i_ineq == -1)
7969 c = i_eq != -1 ? bset->eq[i_eq] : bset->ineq[i_ineq];
7970 /* The coefficient should always be one due to normalization. */
7971 if (!isl_int_is_one(c[1+nparam+dim]))
7973 if (isl_seq_first_non_zero(c+1, nparam+dim) != -1)
7975 if (isl_seq_first_non_zero(c+1+nparam+dim+1,
7976 total - nparam - dim - 1) != -1)
7979 isl_int_neg(*val, c[0]);
7983 int isl_set_plain_dim_has_fixed_lower_bound(__isl_keep isl_set *set,
7984 unsigned dim, isl_int *val)
7996 return isl_basic_set_plain_dim_has_fixed_lower_bound(set->p[0],
8000 fixed = isl_basic_set_plain_dim_has_fixed_lower_bound(set->p[0],
8002 for (i = 1; fixed == 1 && i < set->n; ++i) {
8003 fixed = isl_basic_set_plain_dim_has_fixed_lower_bound(set->p[i],
8005 if (fixed == 1 && isl_int_ne(tmp, v))
8009 isl_int_set(*val, v);
8020 /* uset_gist depends on constraints without existentially quantified
8021 * variables sorting first.
8023 static int qsort_constraint_cmp(const void *p1, const void *p2)
8025 const struct constraint *c1 = (const struct constraint *)p1;
8026 const struct constraint *c2 = (const struct constraint *)p2;
8028 unsigned size = isl_min(c1->size, c2->size);
8030 l1 = isl_seq_last_non_zero(c1->c, size);
8031 l2 = isl_seq_last_non_zero(c2->c, size);
8036 return isl_seq_cmp(c1->c, c2->c, size);
8039 static struct isl_basic_map *isl_basic_map_sort_constraints(
8040 struct isl_basic_map *bmap)
8043 struct constraint *c;
8048 total = isl_basic_map_total_dim(bmap);
8049 c = isl_alloc_array(bmap->ctx, struct constraint, bmap->n_ineq);
8052 for (i = 0; i < bmap->n_ineq; ++i) {
8054 c[i].c = bmap->ineq[i];
8056 qsort(c, bmap->n_ineq, sizeof(struct constraint), qsort_constraint_cmp);
8057 for (i = 0; i < bmap->n_ineq; ++i)
8058 bmap->ineq[i] = c[i].c;
8062 isl_basic_map_free(bmap);
8066 __isl_give isl_basic_set *isl_basic_set_sort_constraints(
8067 __isl_take isl_basic_set *bset)
8069 return (struct isl_basic_set *)isl_basic_map_sort_constraints(
8070 (struct isl_basic_map *)bset);
8073 struct isl_basic_map *isl_basic_map_normalize(struct isl_basic_map *bmap)
8077 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_NORMALIZED))
8079 bmap = isl_basic_map_remove_redundancies(bmap);
8080 bmap = isl_basic_map_sort_constraints(bmap);
8081 ISL_F_SET(bmap, ISL_BASIC_MAP_NORMALIZED);
8085 struct isl_basic_set *isl_basic_set_normalize(struct isl_basic_set *bset)
8087 return (struct isl_basic_set *)isl_basic_map_normalize(
8088 (struct isl_basic_map *)bset);
8091 int isl_basic_map_plain_cmp(const __isl_keep isl_basic_map *bmap1,
8092 const __isl_keep isl_basic_map *bmap2)
8099 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_RATIONAL) !=
8100 ISL_F_ISSET(bmap2, ISL_BASIC_MAP_RATIONAL))
8101 return ISL_F_ISSET(bmap1, ISL_BASIC_MAP_RATIONAL) ? -1 : 1;
8102 if (isl_basic_map_n_param(bmap1) != isl_basic_map_n_param(bmap2))
8103 return isl_basic_map_n_param(bmap1) - isl_basic_map_n_param(bmap2);
8104 if (isl_basic_map_n_in(bmap1) != isl_basic_map_n_in(bmap2))
8105 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
8106 if (isl_basic_map_n_out(bmap1) != isl_basic_map_n_out(bmap2))
8107 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
8108 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY) &&
8109 ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
8111 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY))
8113 if (ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
8115 if (bmap1->n_eq != bmap2->n_eq)
8116 return bmap1->n_eq - bmap2->n_eq;
8117 if (bmap1->n_ineq != bmap2->n_ineq)
8118 return bmap1->n_ineq - bmap2->n_ineq;
8119 if (bmap1->n_div != bmap2->n_div)
8120 return bmap1->n_div - bmap2->n_div;
8121 total = isl_basic_map_total_dim(bmap1);
8122 for (i = 0; i < bmap1->n_eq; ++i) {
8123 cmp = isl_seq_cmp(bmap1->eq[i], bmap2->eq[i], 1+total);
8127 for (i = 0; i < bmap1->n_ineq; ++i) {
8128 cmp = isl_seq_cmp(bmap1->ineq[i], bmap2->ineq[i], 1+total);
8132 for (i = 0; i < bmap1->n_div; ++i) {
8133 cmp = isl_seq_cmp(bmap1->div[i], bmap2->div[i], 1+1+total);
8140 int isl_basic_set_plain_cmp(const __isl_keep isl_basic_set *bset1,
8141 const __isl_keep isl_basic_set *bset2)
8143 return isl_basic_map_plain_cmp(bset1, bset2);
8146 int isl_set_plain_cmp(const __isl_keep isl_set *set1,
8147 const __isl_keep isl_set *set2)
8153 if (set1->n != set2->n)
8154 return set1->n - set2->n;
8156 for (i = 0; i < set1->n; ++i) {
8157 cmp = isl_basic_set_plain_cmp(set1->p[i], set2->p[i]);
8165 int isl_basic_map_plain_is_equal(__isl_keep isl_basic_map *bmap1,
8166 __isl_keep isl_basic_map *bmap2)
8168 return isl_basic_map_plain_cmp(bmap1, bmap2) == 0;
8171 int isl_basic_set_plain_is_equal(__isl_keep isl_basic_set *bset1,
8172 __isl_keep isl_basic_set *bset2)
8174 return isl_basic_map_plain_is_equal((isl_basic_map *)bset1,
8175 (isl_basic_map *)bset2);
8178 static int qsort_bmap_cmp(const void *p1, const void *p2)
8180 const struct isl_basic_map *bmap1 = *(const struct isl_basic_map **)p1;
8181 const struct isl_basic_map *bmap2 = *(const struct isl_basic_map **)p2;
8183 return isl_basic_map_plain_cmp(bmap1, bmap2);
8186 /* We normalize in place, but if anything goes wrong we need
8187 * to return NULL, so we need to make sure we don't change the
8188 * meaning of any possible other copies of map.
8190 struct isl_map *isl_map_normalize(struct isl_map *map)
8193 struct isl_basic_map *bmap;
8197 if (ISL_F_ISSET(map, ISL_MAP_NORMALIZED))
8199 for (i = 0; i < map->n; ++i) {
8200 bmap = isl_basic_map_normalize(isl_basic_map_copy(map->p[i]));
8203 isl_basic_map_free(map->p[i]);
8206 qsort(map->p, map->n, sizeof(struct isl_basic_map *), qsort_bmap_cmp);
8207 ISL_F_SET(map, ISL_MAP_NORMALIZED);
8208 map = isl_map_remove_empty_parts(map);
8211 for (i = map->n - 1; i >= 1; --i) {
8212 if (!isl_basic_map_plain_is_equal(map->p[i-1], map->p[i]))
8214 isl_basic_map_free(map->p[i-1]);
8215 for (j = i; j < map->n; ++j)
8216 map->p[j-1] = map->p[j];
8226 struct isl_set *isl_set_normalize(struct isl_set *set)
8228 return (struct isl_set *)isl_map_normalize((struct isl_map *)set);
8231 int isl_map_plain_is_equal(__isl_keep isl_map *map1, __isl_keep isl_map *map2)
8241 if (!isl_space_is_equal(map1->dim, map2->dim))
8244 map1 = isl_map_copy(map1);
8245 map2 = isl_map_copy(map2);
8246 map1 = isl_map_normalize(map1);
8247 map2 = isl_map_normalize(map2);
8250 equal = map1->n == map2->n;
8251 for (i = 0; equal && i < map1->n; ++i) {
8252 equal = isl_basic_map_plain_is_equal(map1->p[i], map2->p[i]);
8265 int isl_map_fast_is_equal(__isl_keep isl_map *map1, __isl_keep isl_map *map2)
8267 return isl_map_plain_is_equal(map1, map2);
8270 int isl_set_plain_is_equal(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
8272 return isl_map_plain_is_equal((struct isl_map *)set1,
8273 (struct isl_map *)set2);
8276 int isl_set_fast_is_equal(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
8278 return isl_set_plain_is_equal(set1, set2);
8281 /* Return an interval that ranges from min to max (inclusive)
8283 struct isl_basic_set *isl_basic_set_interval(struct isl_ctx *ctx,
8284 isl_int min, isl_int max)
8287 struct isl_basic_set *bset = NULL;
8289 bset = isl_basic_set_alloc(ctx, 0, 1, 0, 0, 2);
8293 k = isl_basic_set_alloc_inequality(bset);
8296 isl_int_set_si(bset->ineq[k][1], 1);
8297 isl_int_neg(bset->ineq[k][0], min);
8299 k = isl_basic_set_alloc_inequality(bset);
8302 isl_int_set_si(bset->ineq[k][1], -1);
8303 isl_int_set(bset->ineq[k][0], max);
8307 isl_basic_set_free(bset);
8311 /* Return the Cartesian product of the basic sets in list (in the given order).
8313 __isl_give isl_basic_set *isl_basic_set_list_product(
8314 __isl_take struct isl_basic_set_list *list)
8322 struct isl_basic_set *product = NULL;
8326 isl_assert(list->ctx, list->n > 0, goto error);
8327 isl_assert(list->ctx, list->p[0], goto error);
8328 nparam = isl_basic_set_n_param(list->p[0]);
8329 dim = isl_basic_set_n_dim(list->p[0]);
8330 extra = list->p[0]->n_div;
8331 n_eq = list->p[0]->n_eq;
8332 n_ineq = list->p[0]->n_ineq;
8333 for (i = 1; i < list->n; ++i) {
8334 isl_assert(list->ctx, list->p[i], goto error);
8335 isl_assert(list->ctx,
8336 nparam == isl_basic_set_n_param(list->p[i]), goto error);
8337 dim += isl_basic_set_n_dim(list->p[i]);
8338 extra += list->p[i]->n_div;
8339 n_eq += list->p[i]->n_eq;
8340 n_ineq += list->p[i]->n_ineq;
8342 product = isl_basic_set_alloc(list->ctx, nparam, dim, extra,
8347 for (i = 0; i < list->n; ++i) {
8348 isl_basic_set_add_constraints(product,
8349 isl_basic_set_copy(list->p[i]), dim);
8350 dim += isl_basic_set_n_dim(list->p[i]);
8352 isl_basic_set_list_free(list);
8355 isl_basic_set_free(product);
8356 isl_basic_set_list_free(list);
8360 struct isl_basic_map *isl_basic_map_product(
8361 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
8363 isl_space *dim_result = NULL;
8364 struct isl_basic_map *bmap;
8365 unsigned in1, in2, out1, out2, nparam, total, pos;
8366 struct isl_dim_map *dim_map1, *dim_map2;
8368 if (!bmap1 || !bmap2)
8371 isl_assert(bmap1->ctx, isl_space_match(bmap1->dim, isl_dim_param,
8372 bmap2->dim, isl_dim_param), goto error);
8373 dim_result = isl_space_product(isl_space_copy(bmap1->dim),
8374 isl_space_copy(bmap2->dim));
8376 in1 = isl_basic_map_n_in(bmap1);
8377 in2 = isl_basic_map_n_in(bmap2);
8378 out1 = isl_basic_map_n_out(bmap1);
8379 out2 = isl_basic_map_n_out(bmap2);
8380 nparam = isl_basic_map_n_param(bmap1);
8382 total = nparam + in1 + in2 + out1 + out2 + bmap1->n_div + bmap2->n_div;
8383 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
8384 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
8385 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
8386 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
8387 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
8388 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos += in1);
8389 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += in2);
8390 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += out1);
8391 isl_dim_map_div(dim_map1, bmap1, pos += out2);
8392 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
8394 bmap = isl_basic_map_alloc_space(dim_result,
8395 bmap1->n_div + bmap2->n_div,
8396 bmap1->n_eq + bmap2->n_eq,
8397 bmap1->n_ineq + bmap2->n_ineq);
8398 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap1, dim_map1);
8399 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap2, dim_map2);
8400 bmap = isl_basic_map_simplify(bmap);
8401 return isl_basic_map_finalize(bmap);
8403 isl_basic_map_free(bmap1);
8404 isl_basic_map_free(bmap2);
8408 __isl_give isl_basic_map *isl_basic_map_flat_product(
8409 __isl_take isl_basic_map *bmap1, __isl_take isl_basic_map *bmap2)
8411 isl_basic_map *prod;
8413 prod = isl_basic_map_product(bmap1, bmap2);
8414 prod = isl_basic_map_flatten(prod);
8418 __isl_give isl_basic_set *isl_basic_set_flat_product(
8419 __isl_take isl_basic_set *bset1, __isl_take isl_basic_set *bset2)
8421 return isl_basic_map_flat_range_product(bset1, bset2);
8424 __isl_give isl_basic_map *isl_basic_map_domain_product(
8425 __isl_take isl_basic_map *bmap1, __isl_take isl_basic_map *bmap2)
8427 isl_space *space_result = NULL;
8428 isl_basic_map *bmap;
8429 unsigned in1, in2, out, nparam, total, pos;
8430 struct isl_dim_map *dim_map1, *dim_map2;
8432 if (!bmap1 || !bmap2)
8435 space_result = isl_space_domain_product(isl_space_copy(bmap1->dim),
8436 isl_space_copy(bmap2->dim));
8438 in1 = isl_basic_map_dim(bmap1, isl_dim_in);
8439 in2 = isl_basic_map_dim(bmap2, isl_dim_in);
8440 out = isl_basic_map_dim(bmap1, isl_dim_out);
8441 nparam = isl_basic_map_dim(bmap1, isl_dim_param);
8443 total = nparam + in1 + in2 + out + bmap1->n_div + bmap2->n_div;
8444 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
8445 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
8446 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
8447 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
8448 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
8449 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos += in1);
8450 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += in2);
8451 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos);
8452 isl_dim_map_div(dim_map1, bmap1, pos += out);
8453 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
8455 bmap = isl_basic_map_alloc_space(space_result,
8456 bmap1->n_div + bmap2->n_div,
8457 bmap1->n_eq + bmap2->n_eq,
8458 bmap1->n_ineq + bmap2->n_ineq);
8459 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap1, dim_map1);
8460 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap2, dim_map2);
8461 bmap = isl_basic_map_simplify(bmap);
8462 return isl_basic_map_finalize(bmap);
8464 isl_basic_map_free(bmap1);
8465 isl_basic_map_free(bmap2);
8469 __isl_give isl_basic_map *isl_basic_map_range_product(
8470 __isl_take isl_basic_map *bmap1, __isl_take isl_basic_map *bmap2)
8472 isl_space *dim_result = NULL;
8473 isl_basic_map *bmap;
8474 unsigned in, out1, out2, nparam, total, pos;
8475 struct isl_dim_map *dim_map1, *dim_map2;
8477 if (!bmap1 || !bmap2)
8480 if (!isl_space_match(bmap1->dim, isl_dim_param,
8481 bmap2->dim, isl_dim_param))
8482 isl_die(isl_basic_map_get_ctx(bmap1), isl_error_invalid,
8483 "parameters don't match", goto error);
8485 dim_result = isl_space_range_product(isl_space_copy(bmap1->dim),
8486 isl_space_copy(bmap2->dim));
8488 in = isl_basic_map_dim(bmap1, isl_dim_in);
8489 out1 = isl_basic_map_n_out(bmap1);
8490 out2 = isl_basic_map_n_out(bmap2);
8491 nparam = isl_basic_map_n_param(bmap1);
8493 total = nparam + in + out1 + out2 + bmap1->n_div + bmap2->n_div;
8494 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
8495 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
8496 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
8497 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
8498 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
8499 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
8500 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += in);
8501 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += out1);
8502 isl_dim_map_div(dim_map1, bmap1, pos += out2);
8503 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
8505 bmap = isl_basic_map_alloc_space(dim_result,
8506 bmap1->n_div + bmap2->n_div,
8507 bmap1->n_eq + bmap2->n_eq,
8508 bmap1->n_ineq + bmap2->n_ineq);
8509 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap1, dim_map1);
8510 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap2, dim_map2);
8511 bmap = isl_basic_map_simplify(bmap);
8512 return isl_basic_map_finalize(bmap);
8514 isl_basic_map_free(bmap1);
8515 isl_basic_map_free(bmap2);
8519 __isl_give isl_basic_map *isl_basic_map_flat_range_product(
8520 __isl_take isl_basic_map *bmap1, __isl_take isl_basic_map *bmap2)
8522 isl_basic_map *prod;
8524 prod = isl_basic_map_range_product(bmap1, bmap2);
8525 prod = isl_basic_map_flatten_range(prod);
8529 static __isl_give isl_map *map_product(__isl_take isl_map *map1,
8530 __isl_take isl_map *map2,
8531 __isl_give isl_space *(*dim_product)(__isl_take isl_space *left,
8532 __isl_take isl_space *right),
8533 __isl_give isl_basic_map *(*basic_map_product)(
8534 __isl_take isl_basic_map *left, __isl_take isl_basic_map *right))
8537 struct isl_map *result;
8543 isl_assert(map1->ctx, isl_space_match(map1->dim, isl_dim_param,
8544 map2->dim, isl_dim_param), goto error);
8546 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
8547 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
8548 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
8550 result = isl_map_alloc_space(dim_product(isl_space_copy(map1->dim),
8551 isl_space_copy(map2->dim)),
8552 map1->n * map2->n, flags);
8555 for (i = 0; i < map1->n; ++i)
8556 for (j = 0; j < map2->n; ++j) {
8557 struct isl_basic_map *part;
8558 part = basic_map_product(isl_basic_map_copy(map1->p[i]),
8559 isl_basic_map_copy(map2->p[j]));
8560 if (isl_basic_map_is_empty(part))
8561 isl_basic_map_free(part);
8563 result = isl_map_add_basic_map(result, part);
8576 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> [B -> D]
8578 static __isl_give isl_map *map_product_aligned(__isl_take isl_map *map1,
8579 __isl_take isl_map *map2)
8581 return map_product(map1, map2, &isl_space_product, &isl_basic_map_product);
8584 __isl_give isl_map *isl_map_product(__isl_take isl_map *map1,
8585 __isl_take isl_map *map2)
8587 return isl_map_align_params_map_map_and(map1, map2, &map_product_aligned);
8590 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
8592 __isl_give isl_map *isl_map_flat_product(__isl_take isl_map *map1,
8593 __isl_take isl_map *map2)
8597 prod = isl_map_product(map1, map2);
8598 prod = isl_map_flatten(prod);
8602 /* Given two set A and B, construct its Cartesian product A x B.
8604 struct isl_set *isl_set_product(struct isl_set *set1, struct isl_set *set2)
8606 return isl_map_range_product(set1, set2);
8609 __isl_give isl_set *isl_set_flat_product(__isl_take isl_set *set1,
8610 __isl_take isl_set *set2)
8612 return isl_map_flat_range_product(set1, set2);
8615 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> (B * D)
8617 static __isl_give isl_map *map_domain_product_aligned(__isl_take isl_map *map1,
8618 __isl_take isl_map *map2)
8620 return map_product(map1, map2, &isl_space_domain_product,
8621 &isl_basic_map_domain_product);
8624 /* Given two maps A -> B and C -> D, construct a map (A * C) -> [B -> D]
8626 static __isl_give isl_map *map_range_product_aligned(__isl_take isl_map *map1,
8627 __isl_take isl_map *map2)
8629 return map_product(map1, map2, &isl_space_range_product,
8630 &isl_basic_map_range_product);
8633 __isl_give isl_map *isl_map_domain_product(__isl_take isl_map *map1,
8634 __isl_take isl_map *map2)
8636 return isl_map_align_params_map_map_and(map1, map2,
8637 &map_domain_product_aligned);
8640 __isl_give isl_map *isl_map_range_product(__isl_take isl_map *map1,
8641 __isl_take isl_map *map2)
8643 return isl_map_align_params_map_map_and(map1, map2,
8644 &map_range_product_aligned);
8647 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B * D)
8649 __isl_give isl_map *isl_map_flat_domain_product(__isl_take isl_map *map1,
8650 __isl_take isl_map *map2)
8654 prod = isl_map_domain_product(map1, map2);
8655 prod = isl_map_flatten_domain(prod);
8659 /* Given two maps A -> B and C -> D, construct a map (A * C) -> (B, D)
8661 __isl_give isl_map *isl_map_flat_range_product(__isl_take isl_map *map1,
8662 __isl_take isl_map *map2)
8666 prod = isl_map_range_product(map1, map2);
8667 prod = isl_map_flatten_range(prod);
8671 uint32_t isl_basic_map_get_hash(__isl_keep isl_basic_map *bmap)
8674 uint32_t hash = isl_hash_init();
8679 bmap = isl_basic_map_copy(bmap);
8680 bmap = isl_basic_map_normalize(bmap);
8683 total = isl_basic_map_total_dim(bmap);
8684 isl_hash_byte(hash, bmap->n_eq & 0xFF);
8685 for (i = 0; i < bmap->n_eq; ++i) {
8687 c_hash = isl_seq_get_hash(bmap->eq[i], 1 + total);
8688 isl_hash_hash(hash, c_hash);
8690 isl_hash_byte(hash, bmap->n_ineq & 0xFF);
8691 for (i = 0; i < bmap->n_ineq; ++i) {
8693 c_hash = isl_seq_get_hash(bmap->ineq[i], 1 + total);
8694 isl_hash_hash(hash, c_hash);
8696 isl_hash_byte(hash, bmap->n_div & 0xFF);
8697 for (i = 0; i < bmap->n_div; ++i) {
8699 if (isl_int_is_zero(bmap->div[i][0]))
8701 isl_hash_byte(hash, i & 0xFF);
8702 c_hash = isl_seq_get_hash(bmap->div[i], 1 + 1 + total);
8703 isl_hash_hash(hash, c_hash);
8705 isl_basic_map_free(bmap);
8709 uint32_t isl_basic_set_get_hash(__isl_keep isl_basic_set *bset)
8711 return isl_basic_map_get_hash((isl_basic_map *)bset);
8714 uint32_t isl_map_get_hash(__isl_keep isl_map *map)
8721 map = isl_map_copy(map);
8722 map = isl_map_normalize(map);
8726 hash = isl_hash_init();
8727 for (i = 0; i < map->n; ++i) {
8729 bmap_hash = isl_basic_map_get_hash(map->p[i]);
8730 isl_hash_hash(hash, bmap_hash);
8738 uint32_t isl_set_get_hash(__isl_keep isl_set *set)
8740 return isl_map_get_hash((isl_map *)set);
8743 /* Check if the value for dimension dim is completely determined
8744 * by the values of the other parameters and variables.
8745 * That is, check if dimension dim is involved in an equality.
8747 int isl_basic_set_dim_is_unique(struct isl_basic_set *bset, unsigned dim)
8754 nparam = isl_basic_set_n_param(bset);
8755 for (i = 0; i < bset->n_eq; ++i)
8756 if (!isl_int_is_zero(bset->eq[i][1 + nparam + dim]))
8761 /* Check if the value for dimension dim is completely determined
8762 * by the values of the other parameters and variables.
8763 * That is, check if dimension dim is involved in an equality
8764 * for each of the subsets.
8766 int isl_set_dim_is_unique(struct isl_set *set, unsigned dim)
8772 for (i = 0; i < set->n; ++i) {
8774 unique = isl_basic_set_dim_is_unique(set->p[i], dim);
8781 int isl_set_n_basic_set(__isl_keep isl_set *set)
8783 return set ? set->n : 0;
8786 int isl_map_foreach_basic_map(__isl_keep isl_map *map,
8787 int (*fn)(__isl_take isl_basic_map *bmap, void *user), void *user)
8794 for (i = 0; i < map->n; ++i)
8795 if (fn(isl_basic_map_copy(map->p[i]), user) < 0)
8801 int isl_set_foreach_basic_set(__isl_keep isl_set *set,
8802 int (*fn)(__isl_take isl_basic_set *bset, void *user), void *user)
8809 for (i = 0; i < set->n; ++i)
8810 if (fn(isl_basic_set_copy(set->p[i]), user) < 0)
8816 __isl_give isl_basic_set *isl_basic_set_lift(__isl_take isl_basic_set *bset)
8823 bset = isl_basic_set_cow(bset);
8827 dim = isl_basic_set_get_space(bset);
8828 dim = isl_space_lift(dim, bset->n_div);
8831 isl_space_free(bset->dim);
8833 bset->extra -= bset->n_div;
8836 bset = isl_basic_set_finalize(bset);
8840 isl_basic_set_free(bset);
8844 __isl_give isl_set *isl_set_lift(__isl_take isl_set *set)
8850 set = isl_set_align_divs(set);
8855 set = isl_set_cow(set);
8859 n_div = set->p[0]->n_div;
8860 dim = isl_set_get_space(set);
8861 dim = isl_space_lift(dim, n_div);
8864 isl_space_free(set->dim);
8867 for (i = 0; i < set->n; ++i) {
8868 set->p[i] = isl_basic_set_lift(set->p[i]);
8879 __isl_give isl_map *isl_set_lifting(__isl_take isl_set *set)
8882 struct isl_basic_map *bmap;
8889 set = isl_set_align_divs(set);
8894 dim = isl_set_get_space(set);
8895 if (set->n == 0 || set->p[0]->n_div == 0) {
8897 return isl_map_identity(isl_space_map_from_set(dim));
8900 n_div = set->p[0]->n_div;
8901 dim = isl_space_map_from_set(dim);
8902 n_param = isl_space_dim(dim, isl_dim_param);
8903 n_set = isl_space_dim(dim, isl_dim_in);
8904 dim = isl_space_extend(dim, n_param, n_set, n_set + n_div);
8905 bmap = isl_basic_map_alloc_space(dim, 0, n_set, 2 * n_div);
8906 for (i = 0; i < n_set; ++i)
8907 bmap = var_equal(bmap, i);
8909 total = n_param + n_set + n_set + n_div;
8910 for (i = 0; i < n_div; ++i) {
8911 k = isl_basic_map_alloc_inequality(bmap);
8914 isl_seq_cpy(bmap->ineq[k], set->p[0]->div[i]+1, 1+n_param);
8915 isl_seq_clr(bmap->ineq[k]+1+n_param, n_set);
8916 isl_seq_cpy(bmap->ineq[k]+1+n_param+n_set,
8917 set->p[0]->div[i]+1+1+n_param, n_set + n_div);
8918 isl_int_neg(bmap->ineq[k][1+n_param+n_set+n_set+i],
8919 set->p[0]->div[i][0]);
8921 l = isl_basic_map_alloc_inequality(bmap);
8924 isl_seq_neg(bmap->ineq[l], bmap->ineq[k], 1 + total);
8925 isl_int_add(bmap->ineq[l][0], bmap->ineq[l][0],
8926 set->p[0]->div[i][0]);
8927 isl_int_sub_ui(bmap->ineq[l][0], bmap->ineq[l][0], 1);
8931 bmap = isl_basic_map_simplify(bmap);
8932 bmap = isl_basic_map_finalize(bmap);
8933 return isl_map_from_basic_map(bmap);
8936 isl_basic_map_free(bmap);
8940 int isl_basic_set_size(__isl_keep isl_basic_set *bset)
8948 dim = isl_basic_set_total_dim(bset);
8949 size += bset->n_eq * (1 + dim);
8950 size += bset->n_ineq * (1 + dim);
8951 size += bset->n_div * (2 + dim);
8956 int isl_set_size(__isl_keep isl_set *set)
8964 for (i = 0; i < set->n; ++i)
8965 size += isl_basic_set_size(set->p[i]);
8970 /* Check if there is any lower bound (if lower == 0) and/or upper
8971 * bound (if upper == 0) on the specified dim.
8973 static int basic_map_dim_is_bounded(__isl_keep isl_basic_map *bmap,
8974 enum isl_dim_type type, unsigned pos, int lower, int upper)
8981 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), return -1);
8983 pos += isl_basic_map_offset(bmap, type);
8985 for (i = 0; i < bmap->n_div; ++i) {
8986 if (isl_int_is_zero(bmap->div[i][0]))
8988 if (!isl_int_is_zero(bmap->div[i][1 + pos]))
8992 for (i = 0; i < bmap->n_eq; ++i)
8993 if (!isl_int_is_zero(bmap->eq[i][pos]))
8996 for (i = 0; i < bmap->n_ineq; ++i) {
8997 int sgn = isl_int_sgn(bmap->ineq[i][pos]);
9004 return lower && upper;
9007 int isl_basic_map_dim_is_bounded(__isl_keep isl_basic_map *bmap,
9008 enum isl_dim_type type, unsigned pos)
9010 return basic_map_dim_is_bounded(bmap, type, pos, 0, 0);
9013 int isl_basic_map_dim_has_lower_bound(__isl_keep isl_basic_map *bmap,
9014 enum isl_dim_type type, unsigned pos)
9016 return basic_map_dim_is_bounded(bmap, type, pos, 0, 1);
9019 int isl_basic_map_dim_has_upper_bound(__isl_keep isl_basic_map *bmap,
9020 enum isl_dim_type type, unsigned pos)
9022 return basic_map_dim_is_bounded(bmap, type, pos, 1, 0);
9025 int isl_map_dim_is_bounded(__isl_keep isl_map *map,
9026 enum isl_dim_type type, unsigned pos)
9033 for (i = 0; i < map->n; ++i) {
9035 bounded = isl_basic_map_dim_is_bounded(map->p[i], type, pos);
9036 if (bounded < 0 || !bounded)
9043 /* Return 1 if the specified dim is involved in both an upper bound
9044 * and a lower bound.
9046 int isl_set_dim_is_bounded(__isl_keep isl_set *set,
9047 enum isl_dim_type type, unsigned pos)
9049 return isl_map_dim_is_bounded((isl_map *)set, type, pos);
9052 static int has_bound(__isl_keep isl_map *map,
9053 enum isl_dim_type type, unsigned pos,
9054 int (*fn)(__isl_keep isl_basic_map *bmap,
9055 enum isl_dim_type type, unsigned pos))
9062 for (i = 0; i < map->n; ++i) {
9064 bounded = fn(map->p[i], type, pos);
9065 if (bounded < 0 || bounded)
9072 /* Return 1 if the specified dim is involved in any lower bound.
9074 int isl_set_dim_has_lower_bound(__isl_keep isl_set *set,
9075 enum isl_dim_type type, unsigned pos)
9077 return has_bound(set, type, pos, &isl_basic_map_dim_has_lower_bound);
9080 /* Return 1 if the specified dim is involved in any upper bound.
9082 int isl_set_dim_has_upper_bound(__isl_keep isl_set *set,
9083 enum isl_dim_type type, unsigned pos)
9085 return has_bound(set, type, pos, &isl_basic_map_dim_has_upper_bound);
9088 /* For each of the "n" variables starting at "first", determine
9089 * the sign of the variable and put the results in the first "n"
9090 * elements of the array "signs".
9092 * 1 means that the variable is non-negative
9093 * -1 means that the variable is non-positive
9094 * 0 means the variable attains both positive and negative values.
9096 int isl_basic_set_vars_get_sign(__isl_keep isl_basic_set *bset,
9097 unsigned first, unsigned n, int *signs)
9099 isl_vec *bound = NULL;
9100 struct isl_tab *tab = NULL;
9101 struct isl_tab_undo *snap;
9104 if (!bset || !signs)
9107 bound = isl_vec_alloc(bset->ctx, 1 + isl_basic_set_total_dim(bset));
9108 tab = isl_tab_from_basic_set(bset, 0);
9112 isl_seq_clr(bound->el, bound->size);
9113 isl_int_set_si(bound->el[0], -1);
9115 snap = isl_tab_snap(tab);
9116 for (i = 0; i < n; ++i) {
9119 isl_int_set_si(bound->el[1 + first + i], -1);
9120 if (isl_tab_add_ineq(tab, bound->el) < 0)
9123 isl_int_set_si(bound->el[1 + first + i], 0);
9124 if (isl_tab_rollback(tab, snap) < 0)
9132 isl_int_set_si(bound->el[1 + first + i], 1);
9133 if (isl_tab_add_ineq(tab, bound->el) < 0)
9136 isl_int_set_si(bound->el[1 + first + i], 0);
9137 if (isl_tab_rollback(tab, snap) < 0)
9140 signs[i] = empty ? -1 : 0;
9144 isl_vec_free(bound);
9148 isl_vec_free(bound);
9152 int isl_basic_set_dims_get_sign(__isl_keep isl_basic_set *bset,
9153 enum isl_dim_type type, unsigned first, unsigned n, int *signs)
9155 if (!bset || !signs)
9157 isl_assert(bset->ctx, first + n <= isl_basic_set_dim(bset, type),
9160 first += pos(bset->dim, type) - 1;
9161 return isl_basic_set_vars_get_sign(bset, first, n, signs);
9164 /* Check if the given basic map is obviously single-valued.
9165 * In particular, for each output dimension, check that there is
9166 * an equality that defines the output dimension in terms of
9167 * earlier dimensions.
9169 int isl_basic_map_plain_is_single_valued(__isl_keep isl_basic_map *bmap)
9179 total = 1 + isl_basic_map_total_dim(bmap);
9180 n_out = isl_basic_map_dim(bmap, isl_dim_out);
9181 o_out = isl_basic_map_offset(bmap, isl_dim_out);
9183 for (i = 0; i < n_out; ++i) {
9184 for (j = 0; j < bmap->n_eq; ++j) {
9185 if (isl_int_is_zero(bmap->eq[j][o_out + i]))
9187 if (isl_seq_first_non_zero(bmap->eq[j] + o_out + i + 1,
9188 total - (o_out + i + 1)) == -1)
9191 if (j >= bmap->n_eq)
9198 /* Check if the given basic map is single-valued.
9203 * and check if the result is a subset of the identity mapping.
9205 int isl_basic_map_is_single_valued(__isl_keep isl_basic_map *bmap)
9208 isl_basic_map *test;
9212 sv = isl_basic_map_plain_is_single_valued(bmap);
9216 test = isl_basic_map_reverse(isl_basic_map_copy(bmap));
9217 test = isl_basic_map_apply_range(test, isl_basic_map_copy(bmap));
9219 space = isl_basic_map_get_space(bmap);
9220 space = isl_space_map_from_set(isl_space_range(space));
9221 id = isl_basic_map_identity(space);
9223 sv = isl_basic_map_is_subset(test, id);
9225 isl_basic_map_free(test);
9226 isl_basic_map_free(id);
9231 /* Check if the given map is obviously single-valued.
9233 int isl_map_plain_is_single_valued(__isl_keep isl_map *map)
9242 return isl_basic_map_plain_is_single_valued(map->p[0]);
9245 /* Check if the given map is single-valued.
9250 * and check if the result is a subset of the identity mapping.
9252 int isl_map_is_single_valued(__isl_keep isl_map *map)
9259 sv = isl_map_plain_is_single_valued(map);
9263 test = isl_map_reverse(isl_map_copy(map));
9264 test = isl_map_apply_range(test, isl_map_copy(map));
9266 dim = isl_space_map_from_set(isl_space_range(isl_map_get_space(map)));
9267 id = isl_map_identity(dim);
9269 sv = isl_map_is_subset(test, id);
9277 int isl_map_is_injective(__isl_keep isl_map *map)
9281 map = isl_map_copy(map);
9282 map = isl_map_reverse(map);
9283 in = isl_map_is_single_valued(map);
9289 /* Check if the given map is obviously injective.
9291 int isl_map_plain_is_injective(__isl_keep isl_map *map)
9295 map = isl_map_copy(map);
9296 map = isl_map_reverse(map);
9297 in = isl_map_plain_is_single_valued(map);
9303 int isl_map_is_bijective(__isl_keep isl_map *map)
9307 sv = isl_map_is_single_valued(map);
9311 return isl_map_is_injective(map);
9314 int isl_set_is_singleton(__isl_keep isl_set *set)
9316 return isl_map_is_single_valued((isl_map *)set);
9319 int isl_map_is_translation(__isl_keep isl_map *map)
9324 delta = isl_map_deltas(isl_map_copy(map));
9325 ok = isl_set_is_singleton(delta);
9326 isl_set_free(delta);
9331 static int unique(isl_int *p, unsigned pos, unsigned len)
9333 if (isl_seq_first_non_zero(p, pos) != -1)
9335 if (isl_seq_first_non_zero(p + pos + 1, len - pos - 1) != -1)
9340 int isl_basic_set_is_box(__isl_keep isl_basic_set *bset)
9349 if (isl_basic_set_dim(bset, isl_dim_div) != 0)
9352 nvar = isl_basic_set_dim(bset, isl_dim_set);
9353 ovar = isl_space_offset(bset->dim, isl_dim_set);
9354 for (j = 0; j < nvar; ++j) {
9355 int lower = 0, upper = 0;
9356 for (i = 0; i < bset->n_eq; ++i) {
9357 if (isl_int_is_zero(bset->eq[i][1 + ovar + j]))
9359 if (!unique(bset->eq[i] + 1 + ovar, j, nvar))
9365 for (i = 0; i < bset->n_ineq; ++i) {
9366 if (isl_int_is_zero(bset->ineq[i][1 + ovar + j]))
9368 if (!unique(bset->ineq[i] + 1 + ovar, j, nvar))
9370 if (isl_int_is_pos(bset->ineq[i][1 + ovar + j]))
9375 if (!lower || !upper)
9382 int isl_set_is_box(__isl_keep isl_set *set)
9389 return isl_basic_set_is_box(set->p[0]);
9392 int isl_basic_set_is_wrapping(__isl_keep isl_basic_set *bset)
9397 return isl_space_is_wrapping(bset->dim);
9400 int isl_set_is_wrapping(__isl_keep isl_set *set)
9405 return isl_space_is_wrapping(set->dim);
9408 __isl_give isl_basic_set *isl_basic_map_wrap(__isl_take isl_basic_map *bmap)
9410 bmap = isl_basic_map_cow(bmap);
9414 bmap->dim = isl_space_wrap(bmap->dim);
9418 bmap = isl_basic_map_finalize(bmap);
9420 return (isl_basic_set *)bmap;
9422 isl_basic_map_free(bmap);
9426 __isl_give isl_set *isl_map_wrap(__isl_take isl_map *map)
9430 map = isl_map_cow(map);
9434 for (i = 0; i < map->n; ++i) {
9435 map->p[i] = (isl_basic_map *)isl_basic_map_wrap(map->p[i]);
9439 map->dim = isl_space_wrap(map->dim);
9443 return (isl_set *)map;
9449 __isl_give isl_basic_map *isl_basic_set_unwrap(__isl_take isl_basic_set *bset)
9451 bset = isl_basic_set_cow(bset);
9455 bset->dim = isl_space_unwrap(bset->dim);
9459 bset = isl_basic_set_finalize(bset);
9461 return (isl_basic_map *)bset;
9463 isl_basic_set_free(bset);
9467 __isl_give isl_map *isl_set_unwrap(__isl_take isl_set *set)
9474 if (!isl_set_is_wrapping(set))
9475 isl_die(set->ctx, isl_error_invalid, "not a wrapping set",
9478 set = isl_set_cow(set);
9482 for (i = 0; i < set->n; ++i) {
9483 set->p[i] = (isl_basic_set *)isl_basic_set_unwrap(set->p[i]);
9488 set->dim = isl_space_unwrap(set->dim);
9492 return (isl_map *)set;
9498 __isl_give isl_basic_map *isl_basic_map_reset(__isl_take isl_basic_map *bmap,
9499 enum isl_dim_type type)
9504 if (!isl_space_is_named_or_nested(bmap->dim, type))
9507 bmap = isl_basic_map_cow(bmap);
9511 bmap->dim = isl_space_reset(bmap->dim, type);
9515 bmap = isl_basic_map_finalize(bmap);
9519 isl_basic_map_free(bmap);
9523 __isl_give isl_map *isl_map_reset(__isl_take isl_map *map,
9524 enum isl_dim_type type)
9531 if (!isl_space_is_named_or_nested(map->dim, type))
9534 map = isl_map_cow(map);
9538 for (i = 0; i < map->n; ++i) {
9539 map->p[i] = isl_basic_map_reset(map->p[i], type);
9543 map->dim = isl_space_reset(map->dim, type);
9553 __isl_give isl_basic_map *isl_basic_map_flatten(__isl_take isl_basic_map *bmap)
9558 if (!bmap->dim->nested[0] && !bmap->dim->nested[1])
9561 bmap = isl_basic_map_cow(bmap);
9565 bmap->dim = isl_space_flatten(bmap->dim);
9569 bmap = isl_basic_map_finalize(bmap);
9573 isl_basic_map_free(bmap);
9577 __isl_give isl_basic_set *isl_basic_set_flatten(__isl_take isl_basic_set *bset)
9579 return (isl_basic_set *)isl_basic_map_flatten((isl_basic_map *)bset);
9582 __isl_give isl_basic_map *isl_basic_map_flatten_domain(
9583 __isl_take isl_basic_map *bmap)
9588 if (!bmap->dim->nested[0])
9591 bmap = isl_basic_map_cow(bmap);
9595 bmap->dim = isl_space_flatten_domain(bmap->dim);
9599 bmap = isl_basic_map_finalize(bmap);
9603 isl_basic_map_free(bmap);
9607 __isl_give isl_basic_map *isl_basic_map_flatten_range(
9608 __isl_take isl_basic_map *bmap)
9613 if (!bmap->dim->nested[1])
9616 bmap = isl_basic_map_cow(bmap);
9620 bmap->dim = isl_space_flatten_range(bmap->dim);
9624 bmap = isl_basic_map_finalize(bmap);
9628 isl_basic_map_free(bmap);
9632 __isl_give isl_map *isl_map_flatten(__isl_take isl_map *map)
9639 if (!map->dim->nested[0] && !map->dim->nested[1])
9642 map = isl_map_cow(map);
9646 for (i = 0; i < map->n; ++i) {
9647 map->p[i] = isl_basic_map_flatten(map->p[i]);
9651 map->dim = isl_space_flatten(map->dim);
9661 __isl_give isl_set *isl_set_flatten(__isl_take isl_set *set)
9663 return (isl_set *)isl_map_flatten((isl_map *)set);
9666 __isl_give isl_map *isl_set_flatten_map(__isl_take isl_set *set)
9668 isl_space *dim, *flat_dim;
9671 dim = isl_set_get_space(set);
9672 flat_dim = isl_space_flatten(isl_space_copy(dim));
9673 map = isl_map_identity(isl_space_join(isl_space_reverse(dim), flat_dim));
9674 map = isl_map_intersect_domain(map, set);
9679 __isl_give isl_map *isl_map_flatten_domain(__isl_take isl_map *map)
9686 if (!map->dim->nested[0])
9689 map = isl_map_cow(map);
9693 for (i = 0; i < map->n; ++i) {
9694 map->p[i] = isl_basic_map_flatten_domain(map->p[i]);
9698 map->dim = isl_space_flatten_domain(map->dim);
9708 __isl_give isl_map *isl_map_flatten_range(__isl_take isl_map *map)
9715 if (!map->dim->nested[1])
9718 map = isl_map_cow(map);
9722 for (i = 0; i < map->n; ++i) {
9723 map->p[i] = isl_basic_map_flatten_range(map->p[i]);
9727 map->dim = isl_space_flatten_range(map->dim);
9737 /* Reorder the dimensions of "bmap" according to the given dim_map
9738 * and set the dimension specification to "dim".
9740 __isl_give isl_basic_map *isl_basic_map_realign(__isl_take isl_basic_map *bmap,
9741 __isl_take isl_space *dim, __isl_take struct isl_dim_map *dim_map)
9746 bmap = isl_basic_map_cow(bmap);
9747 if (!bmap || !dim || !dim_map)
9750 flags = bmap->flags;
9751 ISL_FL_CLR(flags, ISL_BASIC_MAP_FINAL);
9752 ISL_FL_CLR(flags, ISL_BASIC_MAP_NORMALIZED);
9753 ISL_FL_CLR(flags, ISL_BASIC_MAP_NORMALIZED_DIVS);
9754 res = isl_basic_map_alloc_space(dim,
9755 bmap->n_div, bmap->n_eq, bmap->n_ineq);
9756 res = isl_basic_map_add_constraints_dim_map(res, bmap, dim_map);
9759 res = isl_basic_map_finalize(res);
9763 isl_basic_map_free(bmap);
9764 isl_space_free(dim);
9768 /* Reorder the dimensions of "map" according to given reordering.
9770 __isl_give isl_map *isl_map_realign(__isl_take isl_map *map,
9771 __isl_take isl_reordering *r)
9774 struct isl_dim_map *dim_map;
9776 map = isl_map_cow(map);
9777 dim_map = isl_dim_map_from_reordering(r);
9778 if (!map || !r || !dim_map)
9781 for (i = 0; i < map->n; ++i) {
9782 struct isl_dim_map *dim_map_i;
9784 dim_map_i = isl_dim_map_extend(dim_map, map->p[i]);
9786 map->p[i] = isl_basic_map_realign(map->p[i],
9787 isl_space_copy(r->dim), dim_map_i);
9793 map = isl_map_reset_space(map, isl_space_copy(r->dim));
9795 isl_reordering_free(r);
9801 isl_reordering_free(r);
9805 __isl_give isl_set *isl_set_realign(__isl_take isl_set *set,
9806 __isl_take isl_reordering *r)
9808 return (isl_set *)isl_map_realign((isl_map *)set, r);
9811 __isl_give isl_map *isl_map_align_params(__isl_take isl_map *map,
9812 __isl_take isl_space *model)
9819 ctx = isl_space_get_ctx(model);
9820 if (!isl_space_has_named_params(model))
9821 isl_die(ctx, isl_error_invalid,
9822 "model has unnamed parameters", goto error);
9823 if (!isl_space_has_named_params(map->dim))
9824 isl_die(ctx, isl_error_invalid,
9825 "relation has unnamed parameters", goto error);
9826 if (!isl_space_match(map->dim, isl_dim_param, model, isl_dim_param)) {
9827 isl_reordering *exp;
9829 model = isl_space_drop_dims(model, isl_dim_in,
9830 0, isl_space_dim(model, isl_dim_in));
9831 model = isl_space_drop_dims(model, isl_dim_out,
9832 0, isl_space_dim(model, isl_dim_out));
9833 exp = isl_parameter_alignment_reordering(map->dim, model);
9834 exp = isl_reordering_extend_space(exp, isl_map_get_space(map));
9835 map = isl_map_realign(map, exp);
9838 isl_space_free(model);
9841 isl_space_free(model);
9846 __isl_give isl_set *isl_set_align_params(__isl_take isl_set *set,
9847 __isl_take isl_space *model)
9849 return isl_map_align_params(set, model);
9852 /* Align the parameters of "bmap" to those of "model", introducing
9853 * additional parameters if needed.
9855 __isl_give isl_basic_map *isl_basic_map_align_params(
9856 __isl_take isl_basic_map *bmap, __isl_take isl_space *model)
9860 if (!bmap || !model)
9863 ctx = isl_space_get_ctx(model);
9864 if (!isl_space_has_named_params(model))
9865 isl_die(ctx, isl_error_invalid,
9866 "model has unnamed parameters", goto error);
9867 if (!isl_space_has_named_params(bmap->dim))
9868 isl_die(ctx, isl_error_invalid,
9869 "relation has unnamed parameters", goto error);
9870 if (!isl_space_match(bmap->dim, isl_dim_param, model, isl_dim_param)) {
9871 isl_reordering *exp;
9872 struct isl_dim_map *dim_map;
9874 model = isl_space_drop_dims(model, isl_dim_in,
9875 0, isl_space_dim(model, isl_dim_in));
9876 model = isl_space_drop_dims(model, isl_dim_out,
9877 0, isl_space_dim(model, isl_dim_out));
9878 exp = isl_parameter_alignment_reordering(bmap->dim, model);
9879 exp = isl_reordering_extend_space(exp,
9880 isl_basic_map_get_space(bmap));
9881 dim_map = isl_dim_map_from_reordering(exp);
9882 bmap = isl_basic_map_realign(bmap,
9883 exp ? isl_space_copy(exp->dim) : NULL,
9884 isl_dim_map_extend(dim_map, bmap));
9885 isl_reordering_free(exp);
9889 isl_space_free(model);
9892 isl_space_free(model);
9893 isl_basic_map_free(bmap);
9897 /* Align the parameters of "bset" to those of "model", introducing
9898 * additional parameters if needed.
9900 __isl_give isl_basic_set *isl_basic_set_align_params(
9901 __isl_take isl_basic_set *bset, __isl_take isl_space *model)
9903 return isl_basic_map_align_params(bset, model);
9906 __isl_give isl_mat *isl_basic_map_equalities_matrix(
9907 __isl_keep isl_basic_map *bmap, enum isl_dim_type c1,
9908 enum isl_dim_type c2, enum isl_dim_type c3,
9909 enum isl_dim_type c4, enum isl_dim_type c5)
9911 enum isl_dim_type c[5] = { c1, c2, c3, c4, c5 };
9912 struct isl_mat *mat;
9918 mat = isl_mat_alloc(bmap->ctx, bmap->n_eq,
9919 isl_basic_map_total_dim(bmap) + 1);
9922 for (i = 0; i < bmap->n_eq; ++i)
9923 for (j = 0, pos = 0; j < 5; ++j) {
9924 int off = isl_basic_map_offset(bmap, c[j]);
9925 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
9926 isl_int_set(mat->row[i][pos],
9927 bmap->eq[i][off + k]);
9935 __isl_give isl_mat *isl_basic_map_inequalities_matrix(
9936 __isl_keep isl_basic_map *bmap, enum isl_dim_type c1,
9937 enum isl_dim_type c2, enum isl_dim_type c3,
9938 enum isl_dim_type c4, enum isl_dim_type c5)
9940 enum isl_dim_type c[5] = { c1, c2, c3, c4, c5 };
9941 struct isl_mat *mat;
9947 mat = isl_mat_alloc(bmap->ctx, bmap->n_ineq,
9948 isl_basic_map_total_dim(bmap) + 1);
9951 for (i = 0; i < bmap->n_ineq; ++i)
9952 for (j = 0, pos = 0; j < 5; ++j) {
9953 int off = isl_basic_map_offset(bmap, c[j]);
9954 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
9955 isl_int_set(mat->row[i][pos],
9956 bmap->ineq[i][off + k]);
9964 __isl_give isl_basic_map *isl_basic_map_from_constraint_matrices(
9965 __isl_take isl_space *dim,
9966 __isl_take isl_mat *eq, __isl_take isl_mat *ineq, enum isl_dim_type c1,
9967 enum isl_dim_type c2, enum isl_dim_type c3,
9968 enum isl_dim_type c4, enum isl_dim_type c5)
9970 enum isl_dim_type c[5] = { c1, c2, c3, c4, c5 };
9971 isl_basic_map *bmap;
9977 if (!dim || !eq || !ineq)
9980 if (eq->n_col != ineq->n_col)
9981 isl_die(dim->ctx, isl_error_invalid,
9982 "equalities and inequalities matrices should have "
9983 "same number of columns", goto error);
9985 total = 1 + isl_space_dim(dim, isl_dim_all);
9987 if (eq->n_col < total)
9988 isl_die(dim->ctx, isl_error_invalid,
9989 "number of columns too small", goto error);
9991 extra = eq->n_col - total;
9993 bmap = isl_basic_map_alloc_space(isl_space_copy(dim), extra,
9994 eq->n_row, ineq->n_row);
9997 for (i = 0; i < extra; ++i) {
9998 k = isl_basic_map_alloc_div(bmap);
10001 isl_int_set_si(bmap->div[k][0], 0);
10003 for (i = 0; i < eq->n_row; ++i) {
10004 l = isl_basic_map_alloc_equality(bmap);
10007 for (j = 0, pos = 0; j < 5; ++j) {
10008 int off = isl_basic_map_offset(bmap, c[j]);
10009 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
10010 isl_int_set(bmap->eq[l][off + k],
10016 for (i = 0; i < ineq->n_row; ++i) {
10017 l = isl_basic_map_alloc_inequality(bmap);
10020 for (j = 0, pos = 0; j < 5; ++j) {
10021 int off = isl_basic_map_offset(bmap, c[j]);
10022 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
10023 isl_int_set(bmap->ineq[l][off + k],
10024 ineq->row[i][pos]);
10030 isl_space_free(dim);
10032 isl_mat_free(ineq);
10036 isl_space_free(dim);
10038 isl_mat_free(ineq);
10042 __isl_give isl_mat *isl_basic_set_equalities_matrix(
10043 __isl_keep isl_basic_set *bset, enum isl_dim_type c1,
10044 enum isl_dim_type c2, enum isl_dim_type c3, enum isl_dim_type c4)
10046 return isl_basic_map_equalities_matrix((isl_basic_map *)bset,
10047 c1, c2, c3, c4, isl_dim_in);
10050 __isl_give isl_mat *isl_basic_set_inequalities_matrix(
10051 __isl_keep isl_basic_set *bset, enum isl_dim_type c1,
10052 enum isl_dim_type c2, enum isl_dim_type c3, enum isl_dim_type c4)
10054 return isl_basic_map_inequalities_matrix((isl_basic_map *)bset,
10055 c1, c2, c3, c4, isl_dim_in);
10058 __isl_give isl_basic_set *isl_basic_set_from_constraint_matrices(
10059 __isl_take isl_space *dim,
10060 __isl_take isl_mat *eq, __isl_take isl_mat *ineq, enum isl_dim_type c1,
10061 enum isl_dim_type c2, enum isl_dim_type c3, enum isl_dim_type c4)
10063 return (isl_basic_set*)
10064 isl_basic_map_from_constraint_matrices(dim, eq, ineq,
10065 c1, c2, c3, c4, isl_dim_in);
10068 int isl_basic_map_can_zip(__isl_keep isl_basic_map *bmap)
10073 return isl_space_can_zip(bmap->dim);
10076 int isl_map_can_zip(__isl_keep isl_map *map)
10081 return isl_space_can_zip(map->dim);
10084 /* Given a basic map (A -> B) -> (C -> D), return the corresponding basic map
10085 * (A -> C) -> (B -> D).
10087 __isl_give isl_basic_map *isl_basic_map_zip(__isl_take isl_basic_map *bmap)
10096 if (!isl_basic_map_can_zip(bmap))
10097 isl_die(bmap->ctx, isl_error_invalid,
10098 "basic map cannot be zipped", goto error);
10099 pos = isl_basic_map_offset(bmap, isl_dim_in) +
10100 isl_space_dim(bmap->dim->nested[0], isl_dim_in);
10101 n1 = isl_space_dim(bmap->dim->nested[0], isl_dim_out);
10102 n2 = isl_space_dim(bmap->dim->nested[1], isl_dim_in);
10103 bmap = isl_basic_map_cow(bmap);
10104 bmap = isl_basic_map_swap_vars(bmap, pos, n1, n2);
10107 bmap->dim = isl_space_zip(bmap->dim);
10112 isl_basic_map_free(bmap);
10116 /* Given a map (A -> B) -> (C -> D), return the corresponding map
10117 * (A -> C) -> (B -> D).
10119 __isl_give isl_map *isl_map_zip(__isl_take isl_map *map)
10126 if (!isl_map_can_zip(map))
10127 isl_die(map->ctx, isl_error_invalid, "map cannot be zipped",
10130 map = isl_map_cow(map);
10134 for (i = 0; i < map->n; ++i) {
10135 map->p[i] = isl_basic_map_zip(map->p[i]);
10140 map->dim = isl_space_zip(map->dim);
10150 /* Can we apply isl_basic_map_curry to "bmap"?
10151 * That is, does it have a nested relation in its domain?
10153 int isl_basic_map_can_curry(__isl_keep isl_basic_map *bmap)
10158 return isl_space_can_curry(bmap->dim);
10161 /* Can we apply isl_map_curry to "map"?
10162 * That is, does it have a nested relation in its domain?
10164 int isl_map_can_curry(__isl_keep isl_map *map)
10169 return isl_space_can_curry(map->dim);
10172 /* Given a basic map (A -> B) -> C, return the corresponding basic map
10175 __isl_give isl_basic_map *isl_basic_map_curry(__isl_take isl_basic_map *bmap)
10181 if (!isl_basic_map_can_curry(bmap))
10182 isl_die(bmap->ctx, isl_error_invalid,
10183 "basic map cannot be curried", goto error);
10184 bmap->dim = isl_space_curry(bmap->dim);
10189 isl_basic_map_free(bmap);
10193 /* Given a map (A -> B) -> C, return the corresponding map
10196 __isl_give isl_map *isl_map_curry(__isl_take isl_map *map)
10203 if (!isl_map_can_curry(map))
10204 isl_die(map->ctx, isl_error_invalid, "map cannot be curried",
10207 map = isl_map_cow(map);
10211 for (i = 0; i < map->n; ++i) {
10212 map->p[i] = isl_basic_map_curry(map->p[i]);
10217 map->dim = isl_space_curry(map->dim);
10227 /* Construct a basic map mapping the domain of the affine expression
10228 * to a one-dimensional range prescribed by the affine expression.
10230 __isl_give isl_basic_map *isl_basic_map_from_aff(__isl_take isl_aff *aff)
10234 isl_local_space *ls;
10235 isl_basic_map *bmap;
10240 ls = isl_aff_get_local_space(aff);
10241 bmap = isl_basic_map_from_local_space(ls);
10242 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
10243 k = isl_basic_map_alloc_equality(bmap);
10247 pos = isl_basic_map_offset(bmap, isl_dim_out);
10248 isl_seq_cpy(bmap->eq[k], aff->v->el + 1, pos);
10249 isl_int_neg(bmap->eq[k][pos], aff->v->el[0]);
10250 isl_seq_cpy(bmap->eq[k] + pos + 1, aff->v->el + 1 + pos,
10251 aff->v->size - (pos + 1));
10254 bmap = isl_basic_map_finalize(bmap);
10258 isl_basic_map_free(bmap);
10262 /* Construct a map mapping the domain of the affine expression
10263 * to a one-dimensional range prescribed by the affine expression.
10265 __isl_give isl_map *isl_map_from_aff(__isl_take isl_aff *aff)
10267 isl_basic_map *bmap;
10269 bmap = isl_basic_map_from_aff(aff);
10270 return isl_map_from_basic_map(bmap);
10273 /* Construct a basic map mapping the domain the multi-affine expression
10274 * to its range, with each dimension in the range equated to the
10275 * corresponding affine expression.
10277 __isl_give isl_basic_map *isl_basic_map_from_multi_aff(
10278 __isl_take isl_multi_aff *maff)
10282 isl_basic_map *bmap;
10287 if (isl_space_dim(maff->space, isl_dim_out) != maff->n)
10288 isl_die(isl_multi_aff_get_ctx(maff), isl_error_internal,
10289 "invalid space", return isl_multi_aff_free(maff));
10291 space = isl_space_domain(isl_multi_aff_get_space(maff));
10292 bmap = isl_basic_map_universe(isl_space_from_domain(space));
10294 for (i = 0; i < maff->n; ++i) {
10296 isl_basic_map *bmap_i;
10298 aff = isl_aff_copy(maff->p[i]);
10299 bmap_i = isl_basic_map_from_aff(aff);
10301 bmap = isl_basic_map_flat_range_product(bmap, bmap_i);
10304 bmap = isl_basic_map_reset_space(bmap, isl_multi_aff_get_space(maff));
10306 isl_multi_aff_free(maff);
10310 /* Construct a map mapping the domain the multi-affine expression
10311 * to its range, with each dimension in the range equated to the
10312 * corresponding affine expression.
10314 __isl_give isl_map *isl_map_from_multi_aff(__isl_take isl_multi_aff *maff)
10316 isl_basic_map *bmap;
10318 bmap = isl_basic_map_from_multi_aff(maff);
10319 return isl_map_from_basic_map(bmap);
10322 /* Construct a basic map mapping a domain in the given space to
10323 * to an n-dimensional range, with n the number of elements in the list,
10324 * where each coordinate in the range is prescribed by the
10325 * corresponding affine expression.
10326 * The domains of all affine expressions in the list are assumed to match
10329 __isl_give isl_basic_map *isl_basic_map_from_aff_list(
10330 __isl_take isl_space *domain_dim, __isl_take isl_aff_list *list)
10334 isl_basic_map *bmap;
10339 dim = isl_space_from_domain(domain_dim);
10340 bmap = isl_basic_map_universe(dim);
10342 for (i = 0; i < list->n; ++i) {
10344 isl_basic_map *bmap_i;
10346 aff = isl_aff_copy(list->p[i]);
10347 bmap_i = isl_basic_map_from_aff(aff);
10349 bmap = isl_basic_map_flat_range_product(bmap, bmap_i);
10352 isl_aff_list_free(list);
10356 __isl_give isl_set *isl_set_equate(__isl_take isl_set *set,
10357 enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2)
10359 return isl_map_equate(set, type1, pos1, type2, pos2);
10362 /* Construct a basic map where the given dimensions are equal to each other.
10364 static __isl_give isl_basic_map *equator(__isl_take isl_space *space,
10365 enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2)
10367 isl_basic_map *bmap = NULL;
10373 if (pos1 >= isl_space_dim(space, type1))
10374 isl_die(isl_space_get_ctx(space), isl_error_invalid,
10375 "index out of bounds", goto error);
10376 if (pos2 >= isl_space_dim(space, type2))
10377 isl_die(isl_space_get_ctx(space), isl_error_invalid,
10378 "index out of bounds", goto error);
10380 if (type1 == type2 && pos1 == pos2)
10381 return isl_basic_map_universe(space);
10383 bmap = isl_basic_map_alloc_space(isl_space_copy(space), 0, 1, 0);
10384 i = isl_basic_map_alloc_equality(bmap);
10387 isl_seq_clr(bmap->eq[i], 1 + isl_basic_map_total_dim(bmap));
10388 pos1 += isl_basic_map_offset(bmap, type1);
10389 pos2 += isl_basic_map_offset(bmap, type2);
10390 isl_int_set_si(bmap->eq[i][pos1], -1);
10391 isl_int_set_si(bmap->eq[i][pos2], 1);
10392 bmap = isl_basic_map_finalize(bmap);
10393 isl_space_free(space);
10396 isl_space_free(space);
10397 isl_basic_map_free(bmap);
10401 /* Add a constraint imposing that the given two dimensions are equal.
10403 __isl_give isl_basic_map *isl_basic_map_equate(__isl_take isl_basic_map *bmap,
10404 enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2)
10408 eq = equator(isl_basic_map_get_space(bmap), type1, pos1, type2, pos2);
10410 bmap = isl_basic_map_intersect(bmap, eq);
10415 /* Add a constraint imposing that the given two dimensions are equal.
10417 __isl_give isl_map *isl_map_equate(__isl_take isl_map *map,
10418 enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2)
10420 isl_basic_map *bmap;
10422 bmap = equator(isl_map_get_space(map), type1, pos1, type2, pos2);
10424 map = isl_map_intersect(map, isl_map_from_basic_map(bmap));
10429 /* Add a constraint imposing that the given two dimensions have opposite values.
10431 __isl_give isl_map *isl_map_oppose(__isl_take isl_map *map,
10432 enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2)
10434 isl_basic_map *bmap = NULL;
10440 if (pos1 >= isl_map_dim(map, type1))
10441 isl_die(map->ctx, isl_error_invalid,
10442 "index out of bounds", goto error);
10443 if (pos2 >= isl_map_dim(map, type2))
10444 isl_die(map->ctx, isl_error_invalid,
10445 "index out of bounds", goto error);
10447 bmap = isl_basic_map_alloc_space(isl_map_get_space(map), 0, 1, 0);
10448 i = isl_basic_map_alloc_equality(bmap);
10451 isl_seq_clr(bmap->eq[i], 1 + isl_basic_map_total_dim(bmap));
10452 pos1 += isl_basic_map_offset(bmap, type1);
10453 pos2 += isl_basic_map_offset(bmap, type2);
10454 isl_int_set_si(bmap->eq[i][pos1], 1);
10455 isl_int_set_si(bmap->eq[i][pos2], 1);
10456 bmap = isl_basic_map_finalize(bmap);
10458 map = isl_map_intersect(map, isl_map_from_basic_map(bmap));
10462 isl_basic_map_free(bmap);
10467 /* Add a constraint imposing that the value of the first dimension is
10468 * greater than that of the second.
10470 __isl_give isl_map *isl_map_order_gt(__isl_take isl_map *map,
10471 enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2)
10473 isl_basic_map *bmap = NULL;
10479 if (pos1 >= isl_map_dim(map, type1))
10480 isl_die(map->ctx, isl_error_invalid,
10481 "index out of bounds", goto error);
10482 if (pos2 >= isl_map_dim(map, type2))
10483 isl_die(map->ctx, isl_error_invalid,
10484 "index out of bounds", goto error);
10486 if (type1 == type2 && pos1 == pos2) {
10487 isl_space *space = isl_map_get_space(map);
10489 return isl_map_empty(space);
10492 bmap = isl_basic_map_alloc_space(isl_map_get_space(map), 0, 0, 1);
10493 i = isl_basic_map_alloc_inequality(bmap);
10496 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
10497 pos1 += isl_basic_map_offset(bmap, type1);
10498 pos2 += isl_basic_map_offset(bmap, type2);
10499 isl_int_set_si(bmap->ineq[i][pos1], 1);
10500 isl_int_set_si(bmap->ineq[i][pos2], -1);
10501 isl_int_set_si(bmap->ineq[i][0], -1);
10502 bmap = isl_basic_map_finalize(bmap);
10504 map = isl_map_intersect(map, isl_map_from_basic_map(bmap));
10508 isl_basic_map_free(bmap);
10513 /* Add a constraint imposing that the value of the first dimension is
10514 * smaller than that of the second.
10516 __isl_give isl_map *isl_map_order_lt(__isl_take isl_map *map,
10517 enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2)
10519 return isl_map_order_gt(map, type2, pos2, type1, pos1);
10522 __isl_give isl_aff *isl_basic_map_get_div(__isl_keep isl_basic_map *bmap,
10526 isl_local_space *ls;
10531 if (!isl_basic_map_divs_known(bmap))
10532 isl_die(isl_basic_map_get_ctx(bmap), isl_error_invalid,
10533 "some divs are unknown", return NULL);
10535 ls = isl_basic_map_get_local_space(bmap);
10536 div = isl_local_space_get_div(ls, pos);
10537 isl_local_space_free(ls);
10542 __isl_give isl_aff *isl_basic_set_get_div(__isl_keep isl_basic_set *bset,
10545 return isl_basic_map_get_div(bset, pos);
10548 /* Plug in "subs" for dimension "type", "pos" of "bset".
10550 * Let i be the dimension to replace and let "subs" be of the form
10554 * Any integer division with a non-zero coefficient for i,
10556 * floor((a i + g)/m)
10560 * floor((a f + d g)/(m d))
10562 * Constraints of the form
10570 __isl_give isl_basic_set *isl_basic_set_substitute(
10571 __isl_take isl_basic_set *bset,
10572 enum isl_dim_type type, unsigned pos, __isl_keep isl_aff *subs)
10578 if (bset && isl_basic_set_plain_is_empty(bset))
10581 bset = isl_basic_set_cow(bset);
10582 if (!bset || !subs)
10585 ctx = isl_basic_set_get_ctx(bset);
10586 if (!isl_space_is_equal(bset->dim, subs->ls->dim))
10587 isl_die(ctx, isl_error_invalid,
10588 "spaces don't match", goto error);
10589 if (isl_local_space_dim(subs->ls, isl_dim_div) != 0)
10590 isl_die(ctx, isl_error_unsupported,
10591 "cannot handle divs yet", goto error);
10593 pos += isl_basic_set_offset(bset, type);
10597 for (i = 0; i < bset->n_eq; ++i) {
10598 if (isl_int_is_zero(bset->eq[i][pos]))
10600 isl_int_set(v, bset->eq[i][pos]);
10601 isl_int_set_si(bset->eq[i][pos], 0);
10602 isl_seq_combine(bset->eq[i], subs->v->el[0], bset->eq[i],
10603 v, subs->v->el + 1, subs->v->size - 1);
10606 for (i = 0; i < bset->n_ineq; ++i) {
10607 if (isl_int_is_zero(bset->ineq[i][pos]))
10609 isl_int_set(v, bset->ineq[i][pos]);
10610 isl_int_set_si(bset->ineq[i][pos], 0);
10611 isl_seq_combine(bset->ineq[i], subs->v->el[0], bset->ineq[i],
10612 v, subs->v->el + 1, subs->v->size - 1);
10615 for (i = 0; i < bset->n_div; ++i) {
10616 if (isl_int_is_zero(bset->div[i][1 + pos]))
10618 isl_int_set(v, bset->div[i][1 + pos]);
10619 isl_int_set_si(bset->div[i][1 + pos], 0);
10620 isl_seq_combine(bset->div[i] + 1,
10621 subs->v->el[0], bset->div[i] + 1,
10622 v, subs->v->el + 1, subs->v->size - 1);
10623 isl_int_mul(bset->div[i][0], bset->div[i][0], subs->v->el[0]);
10628 bset = isl_basic_set_simplify(bset);
10629 return isl_basic_set_finalize(bset);
10631 isl_basic_set_free(bset);
10635 /* Plug in "subs" for dimension "type", "pos" of "set".
10637 __isl_give isl_set *isl_set_substitute(__isl_take isl_set *set,
10638 enum isl_dim_type type, unsigned pos, __isl_keep isl_aff *subs)
10642 if (set && isl_set_plain_is_empty(set))
10645 set = isl_set_cow(set);
10649 for (i = set->n - 1; i >= 0; --i) {
10650 set->p[i] = isl_basic_set_substitute(set->p[i], type, pos, subs);
10651 if (remove_if_empty(set, i) < 0)