2 * Copyright 2008-2009 Katholieke Universiteit Leuven
3 * Copyright 2010 INRIA Saclay
5 * Use of this software is governed by the GNU LGPLv2.1 license
7 * Written by Sven Verdoolaege, K.U.Leuven, Departement
8 * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium
9 * and INRIA Saclay - Ile-de-France, Parc Club Orsay Universite,
10 * ZAC des vignes, 4 rue Jacques Monod, 91893 Orsay, France
14 #include <isl_ctx_private.h>
15 #include <isl_map_private.h>
17 #include "isl_space_private.h"
18 #include "isl_equalities.h"
19 #include <isl_list_private.h>
24 #include "isl_map_piplib.h"
25 #include <isl_reordering.h>
26 #include "isl_sample.h"
29 #include <isl_mat_private.h>
30 #include <isl_dim_map.h>
31 #include <isl_local_space_private.h>
32 #include <isl_aff_private.h>
33 #include <isl_options_private.h>
35 static unsigned n(__isl_keep isl_space *dim, enum isl_dim_type type)
38 case isl_dim_param: return dim->nparam;
39 case isl_dim_in: return dim->n_in;
40 case isl_dim_out: return dim->n_out;
41 case isl_dim_all: return dim->nparam + dim->n_in + dim->n_out;
46 static unsigned pos(__isl_keep isl_space *dim, enum isl_dim_type type)
49 case isl_dim_param: return 1;
50 case isl_dim_in: return 1 + dim->nparam;
51 case isl_dim_out: return 1 + dim->nparam + dim->n_in;
56 unsigned isl_basic_map_dim(__isl_keep isl_basic_map *bmap,
57 enum isl_dim_type type)
62 case isl_dim_cst: return 1;
65 case isl_dim_out: return isl_space_dim(bmap->dim, type);
66 case isl_dim_div: return bmap->n_div;
67 case isl_dim_all: return isl_basic_map_total_dim(bmap);
72 unsigned isl_map_dim(__isl_keep isl_map *map, enum isl_dim_type type)
74 return map ? n(map->dim, type) : 0;
77 unsigned isl_set_dim(__isl_keep isl_set *set, enum isl_dim_type type)
79 return set ? n(set->dim, type) : 0;
82 unsigned isl_basic_map_offset(struct isl_basic_map *bmap,
83 enum isl_dim_type type)
85 isl_space *dim = bmap->dim;
87 case isl_dim_cst: return 0;
88 case isl_dim_param: return 1;
89 case isl_dim_in: return 1 + dim->nparam;
90 case isl_dim_out: return 1 + dim->nparam + dim->n_in;
91 case isl_dim_div: return 1 + dim->nparam + dim->n_in + dim->n_out;
96 unsigned isl_basic_set_offset(struct isl_basic_set *bset,
97 enum isl_dim_type type)
99 return isl_basic_map_offset(bset, type);
102 static unsigned map_offset(struct isl_map *map, enum isl_dim_type type)
104 return pos(map->dim, type);
107 unsigned isl_basic_set_dim(__isl_keep isl_basic_set *bset,
108 enum isl_dim_type type)
110 return isl_basic_map_dim(bset, type);
113 unsigned isl_basic_set_n_dim(__isl_keep isl_basic_set *bset)
115 return isl_basic_set_dim(bset, isl_dim_set);
118 unsigned isl_basic_set_n_param(__isl_keep isl_basic_set *bset)
120 return isl_basic_set_dim(bset, isl_dim_param);
123 unsigned isl_basic_set_total_dim(const struct isl_basic_set *bset)
127 return isl_space_dim(bset->dim, isl_dim_all) + bset->n_div;
130 unsigned isl_set_n_dim(__isl_keep isl_set *set)
132 return isl_set_dim(set, isl_dim_set);
135 unsigned isl_set_n_param(__isl_keep isl_set *set)
137 return isl_set_dim(set, isl_dim_param);
140 unsigned isl_basic_map_n_in(const struct isl_basic_map *bmap)
142 return bmap ? bmap->dim->n_in : 0;
145 unsigned isl_basic_map_n_out(const struct isl_basic_map *bmap)
147 return bmap ? bmap->dim->n_out : 0;
150 unsigned isl_basic_map_n_param(const struct isl_basic_map *bmap)
152 return bmap ? bmap->dim->nparam : 0;
155 unsigned isl_basic_map_n_div(const struct isl_basic_map *bmap)
157 return bmap ? bmap->n_div : 0;
160 unsigned isl_basic_map_total_dim(const struct isl_basic_map *bmap)
162 return bmap ? isl_space_dim(bmap->dim, isl_dim_all) + bmap->n_div : 0;
165 unsigned isl_map_n_in(const struct isl_map *map)
167 return map ? map->dim->n_in : 0;
170 unsigned isl_map_n_out(const struct isl_map *map)
172 return map ? map->dim->n_out : 0;
175 unsigned isl_map_n_param(const struct isl_map *map)
177 return map ? map->dim->nparam : 0;
180 int isl_map_compatible_domain(struct isl_map *map, struct isl_set *set)
185 m = isl_space_match(map->dim, isl_dim_param, set->dim, isl_dim_param);
188 return isl_space_tuple_match(map->dim, isl_dim_in, set->dim, isl_dim_set);
191 int isl_basic_map_compatible_domain(struct isl_basic_map *bmap,
192 struct isl_basic_set *bset)
197 m = isl_space_match(bmap->dim, isl_dim_param, bset->dim, isl_dim_param);
200 return isl_space_tuple_match(bmap->dim, isl_dim_in, bset->dim, isl_dim_set);
203 int isl_map_compatible_range(__isl_keep isl_map *map, __isl_keep isl_set *set)
208 m = isl_space_match(map->dim, isl_dim_param, set->dim, isl_dim_param);
211 return isl_space_tuple_match(map->dim, isl_dim_out, set->dim, isl_dim_set);
214 int isl_basic_map_compatible_range(struct isl_basic_map *bmap,
215 struct isl_basic_set *bset)
220 m = isl_space_match(bmap->dim, isl_dim_param, bset->dim, isl_dim_param);
223 return isl_space_tuple_match(bmap->dim, isl_dim_out, bset->dim, isl_dim_set);
226 isl_ctx *isl_basic_map_get_ctx(__isl_keep isl_basic_map *bmap)
228 return bmap ? bmap->ctx : NULL;
231 isl_ctx *isl_basic_set_get_ctx(__isl_keep isl_basic_set *bset)
233 return bset ? bset->ctx : NULL;
236 isl_ctx *isl_map_get_ctx(__isl_keep isl_map *map)
238 return map ? map->ctx : NULL;
241 isl_ctx *isl_set_get_ctx(__isl_keep isl_set *set)
243 return set ? set->ctx : NULL;
246 __isl_give isl_space *isl_basic_map_get_space(__isl_keep isl_basic_map *bmap)
250 return isl_space_copy(bmap->dim);
253 __isl_give isl_space *isl_basic_set_get_space(__isl_keep isl_basic_set *bset)
257 return isl_space_copy(bset->dim);
260 /* Extract the divs in "bmap" as a matrix.
262 __isl_give isl_mat *isl_basic_map_get_divs(__isl_keep isl_basic_map *bmap)
273 ctx = isl_basic_map_get_ctx(bmap);
274 total = isl_space_dim(bmap->dim, isl_dim_all);
275 cols = 1 + 1 + total + bmap->n_div;
276 div = isl_mat_alloc(ctx, bmap->n_div, cols);
280 for (i = 0; i < bmap->n_div; ++i)
281 isl_seq_cpy(div->row[i], bmap->div[i], cols);
286 __isl_give isl_local_space *isl_basic_map_get_local_space(
287 __isl_keep isl_basic_map *bmap)
294 div = isl_basic_map_get_divs(bmap);
295 return isl_local_space_alloc_div(isl_space_copy(bmap->dim), div);
298 __isl_give isl_local_space *isl_basic_set_get_local_space(
299 __isl_keep isl_basic_set *bset)
301 return isl_basic_map_get_local_space(bset);
304 __isl_give isl_basic_map *isl_basic_map_from_local_space(
305 __isl_take isl_local_space *ls)
314 n_div = isl_local_space_dim(ls, isl_dim_div);
315 bmap = isl_basic_map_alloc_space(isl_local_space_get_space(ls),
316 n_div, 0, 2 * n_div);
318 for (i = 0; i < n_div; ++i)
319 if (isl_basic_map_alloc_div(bmap) < 0)
322 for (i = 0; i < n_div; ++i) {
323 isl_seq_cpy(bmap->div[i], ls->div->row[i], ls->div->n_col);
324 if (isl_basic_map_add_div_constraints(bmap, i) < 0)
328 isl_local_space_free(ls);
331 isl_local_space_free(ls);
332 isl_basic_map_free(bmap);
336 __isl_give isl_basic_set *isl_basic_set_from_local_space(
337 __isl_take isl_local_space *ls)
339 return isl_basic_map_from_local_space(ls);
342 __isl_give isl_space *isl_map_get_space(__isl_keep isl_map *map)
346 return isl_space_copy(map->dim);
349 __isl_give isl_space *isl_set_get_space(__isl_keep isl_set *set)
353 return isl_space_copy(set->dim);
356 __isl_give isl_basic_map *isl_basic_map_set_tuple_name(
357 __isl_take isl_basic_map *bmap, enum isl_dim_type type, const char *s)
359 bmap = isl_basic_map_cow(bmap);
362 bmap->dim = isl_space_set_tuple_name(bmap->dim, type, s);
365 bmap = isl_basic_map_finalize(bmap);
368 isl_basic_map_free(bmap);
372 __isl_give isl_basic_set *isl_basic_set_set_tuple_name(
373 __isl_take isl_basic_set *bset, const char *s)
375 return isl_basic_map_set_tuple_name(bset, isl_dim_set, s);
378 const char *isl_basic_map_get_tuple_name(__isl_keep isl_basic_map *bmap,
379 enum isl_dim_type type)
381 return bmap ? isl_space_get_tuple_name(bmap->dim, type) : NULL;
384 __isl_give isl_map *isl_map_set_tuple_name(__isl_take isl_map *map,
385 enum isl_dim_type type, const char *s)
389 map = isl_map_cow(map);
393 map->dim = isl_space_set_tuple_name(map->dim, type, s);
397 for (i = 0; i < map->n; ++i) {
398 map->p[i] = isl_basic_map_set_tuple_name(map->p[i], type, s);
409 const char *isl_map_get_tuple_name(__isl_keep isl_map *map,
410 enum isl_dim_type type)
412 return map ? isl_space_get_tuple_name(map->dim, type) : NULL;
415 __isl_give isl_set *isl_set_set_tuple_name(__isl_take isl_set *set,
418 return (isl_set *)isl_map_set_tuple_name((isl_map *)set, isl_dim_set, s);
421 __isl_give isl_map *isl_map_set_tuple_id(__isl_take isl_map *map,
422 enum isl_dim_type type, __isl_take isl_id *id)
424 map = isl_map_cow(map);
426 return isl_id_free(id);
428 map->dim = isl_space_set_tuple_id(map->dim, type, id);
430 return isl_map_reset_space(map, isl_space_copy(map->dim));
433 __isl_give isl_set *isl_set_set_tuple_id(__isl_take isl_set *set,
434 __isl_take isl_id *id)
436 return isl_map_set_tuple_id(set, isl_dim_set, id);
439 __isl_give isl_map *isl_map_reset_tuple_id(__isl_take isl_map *map,
440 enum isl_dim_type type)
442 map = isl_map_cow(map);
446 map->dim = isl_space_reset_tuple_id(map->dim, type);
448 return isl_map_reset_space(map, isl_space_copy(map->dim));
451 __isl_give isl_set *isl_set_reset_tuple_id(__isl_take isl_set *set)
453 return isl_map_reset_tuple_id(set, isl_dim_set);
456 int isl_map_has_tuple_id(__isl_keep isl_map *map, enum isl_dim_type type)
458 return map ? isl_space_has_tuple_id(map->dim, type) : -1;
461 __isl_give isl_id *isl_map_get_tuple_id(__isl_keep isl_map *map,
462 enum isl_dim_type type)
464 return map ? isl_space_get_tuple_id(map->dim, type) : NULL;
467 int isl_set_has_tuple_id(__isl_keep isl_set *set)
469 return isl_map_has_tuple_id(set, isl_dim_set);
472 __isl_give isl_id *isl_set_get_tuple_id(__isl_keep isl_set *set)
474 return isl_map_get_tuple_id(set, isl_dim_set);
477 /* Does the set tuple have a name?
479 int isl_set_has_tuple_name(__isl_keep isl_set *set)
481 return set ? isl_space_has_tuple_name(set->dim, isl_dim_set) : -1;
485 const char *isl_basic_set_get_tuple_name(__isl_keep isl_basic_set *bset)
487 return bset ? isl_space_get_tuple_name(bset->dim, isl_dim_set) : NULL;
490 const char *isl_set_get_tuple_name(__isl_keep isl_set *set)
492 return set ? isl_space_get_tuple_name(set->dim, isl_dim_set) : NULL;
495 const char *isl_basic_map_get_dim_name(__isl_keep isl_basic_map *bmap,
496 enum isl_dim_type type, unsigned pos)
498 return bmap ? isl_space_get_dim_name(bmap->dim, type, pos) : NULL;
501 const char *isl_basic_set_get_dim_name(__isl_keep isl_basic_set *bset,
502 enum isl_dim_type type, unsigned pos)
504 return bset ? isl_space_get_dim_name(bset->dim, type, pos) : NULL;
507 const char *isl_map_get_dim_name(__isl_keep isl_map *map,
508 enum isl_dim_type type, unsigned pos)
510 return map ? isl_space_get_dim_name(map->dim, type, pos) : NULL;
513 const char *isl_set_get_dim_name(__isl_keep isl_set *set,
514 enum isl_dim_type type, unsigned pos)
516 return set ? isl_space_get_dim_name(set->dim, type, pos) : NULL;
519 /* Does the given dimension have a name?
521 int isl_set_has_dim_name(__isl_keep isl_set *set,
522 enum isl_dim_type type, unsigned pos)
524 return set ? isl_space_has_dim_name(set->dim, type, pos) : -1;
527 __isl_give isl_basic_map *isl_basic_map_set_dim_name(
528 __isl_take isl_basic_map *bmap,
529 enum isl_dim_type type, unsigned pos, const char *s)
531 bmap = isl_basic_map_cow(bmap);
534 bmap->dim = isl_space_set_dim_name(bmap->dim, type, pos, s);
537 return isl_basic_map_finalize(bmap);
539 isl_basic_map_free(bmap);
543 __isl_give isl_map *isl_map_set_dim_name(__isl_take isl_map *map,
544 enum isl_dim_type type, unsigned pos, const char *s)
548 map = isl_map_cow(map);
552 map->dim = isl_space_set_dim_name(map->dim, type, pos, s);
556 for (i = 0; i < map->n; ++i) {
557 map->p[i] = isl_basic_map_set_dim_name(map->p[i], type, pos, s);
568 __isl_give isl_basic_set *isl_basic_set_set_dim_name(
569 __isl_take isl_basic_set *bset,
570 enum isl_dim_type type, unsigned pos, const char *s)
572 return (isl_basic_set *)isl_basic_map_set_dim_name(
573 (isl_basic_map *)bset, type, pos, s);
576 __isl_give isl_set *isl_set_set_dim_name(__isl_take isl_set *set,
577 enum isl_dim_type type, unsigned pos, const char *s)
579 return (isl_set *)isl_map_set_dim_name((isl_map *)set, type, pos, s);
582 int isl_basic_map_has_dim_id(__isl_keep isl_basic_map *bmap,
583 enum isl_dim_type type, unsigned pos)
585 return bmap ? isl_space_has_dim_id(bmap->dim, type, pos) : -1;
588 __isl_give isl_id *isl_basic_set_get_dim_id(__isl_keep isl_basic_set *bset,
589 enum isl_dim_type type, unsigned pos)
591 return bset ? isl_space_get_dim_id(bset->dim, type, pos) : NULL;
594 int isl_map_has_dim_id(__isl_keep isl_map *map,
595 enum isl_dim_type type, unsigned pos)
597 return map ? isl_space_has_dim_id(map->dim, type, pos) : -1;
600 __isl_give isl_id *isl_map_get_dim_id(__isl_keep isl_map *map,
601 enum isl_dim_type type, unsigned pos)
603 return map ? isl_space_get_dim_id(map->dim, type, pos) : NULL;
606 int isl_set_has_dim_id(__isl_keep isl_set *set,
607 enum isl_dim_type type, unsigned pos)
609 return isl_map_has_dim_id(set, type, pos);
612 __isl_give isl_id *isl_set_get_dim_id(__isl_keep isl_set *set,
613 enum isl_dim_type type, unsigned pos)
615 return isl_map_get_dim_id(set, type, pos);
618 __isl_give isl_map *isl_map_set_dim_id(__isl_take isl_map *map,
619 enum isl_dim_type type, unsigned pos, __isl_take isl_id *id)
621 map = isl_map_cow(map);
623 return isl_id_free(id);
625 map->dim = isl_space_set_dim_id(map->dim, type, pos, id);
627 return isl_map_reset_space(map, isl_space_copy(map->dim));
630 __isl_give isl_set *isl_set_set_dim_id(__isl_take isl_set *set,
631 enum isl_dim_type type, unsigned pos, __isl_take isl_id *id)
633 return isl_map_set_dim_id(set, type, pos, id);
636 int isl_map_find_dim_by_id(__isl_keep isl_map *map, enum isl_dim_type type,
637 __isl_keep isl_id *id)
641 return isl_space_find_dim_by_id(map->dim, type, id);
644 int isl_set_find_dim_by_id(__isl_keep isl_set *set, enum isl_dim_type type,
645 __isl_keep isl_id *id)
647 return isl_map_find_dim_by_id(set, type, id);
650 int isl_map_find_dim_by_name(__isl_keep isl_map *map, enum isl_dim_type type,
655 return isl_space_find_dim_by_name(map->dim, type, name);
658 int isl_set_find_dim_by_name(__isl_keep isl_set *set, enum isl_dim_type type,
661 return isl_map_find_dim_by_name(set, type, name);
664 int isl_basic_map_is_rational(__isl_keep isl_basic_map *bmap)
668 return ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL);
671 int isl_basic_set_is_rational(__isl_keep isl_basic_set *bset)
673 return isl_basic_map_is_rational(bset);
676 /* Is this basic set a parameter domain?
678 int isl_basic_set_is_params(__isl_keep isl_basic_set *bset)
682 return isl_space_is_params(bset->dim);
685 /* Is this set a parameter domain?
687 int isl_set_is_params(__isl_keep isl_set *set)
691 return isl_space_is_params(set->dim);
694 /* Is this map actually a parameter domain?
695 * Users should never call this function. Outside of isl,
696 * a map can never be a parameter domain.
698 int isl_map_is_params(__isl_keep isl_map *map)
702 return isl_space_is_params(map->dim);
705 static struct isl_basic_map *basic_map_init(struct isl_ctx *ctx,
706 struct isl_basic_map *bmap, unsigned extra,
707 unsigned n_eq, unsigned n_ineq)
710 size_t row_size = 1 + isl_space_dim(bmap->dim, isl_dim_all) + extra;
715 bmap->block = isl_blk_alloc(ctx, (n_ineq + n_eq) * row_size);
716 if (isl_blk_is_error(bmap->block))
719 bmap->ineq = isl_alloc_array(ctx, isl_int *, n_ineq + n_eq);
724 bmap->block2 = isl_blk_empty();
727 bmap->block2 = isl_blk_alloc(ctx, extra * (1 + row_size));
728 if (isl_blk_is_error(bmap->block2))
731 bmap->div = isl_alloc_array(ctx, isl_int *, extra);
736 for (i = 0; i < n_ineq + n_eq; ++i)
737 bmap->ineq[i] = bmap->block.data + i * row_size;
739 for (i = 0; i < extra; ++i)
740 bmap->div[i] = bmap->block2.data + i * (1 + row_size);
744 bmap->c_size = n_eq + n_ineq;
745 bmap->eq = bmap->ineq + n_ineq;
754 isl_basic_map_free(bmap);
758 struct isl_basic_set *isl_basic_set_alloc(struct isl_ctx *ctx,
759 unsigned nparam, unsigned dim, unsigned extra,
760 unsigned n_eq, unsigned n_ineq)
762 struct isl_basic_map *bmap;
765 space = isl_space_set_alloc(ctx, nparam, dim);
769 bmap = isl_basic_map_alloc_space(space, extra, n_eq, n_ineq);
770 return (struct isl_basic_set *)bmap;
773 struct isl_basic_set *isl_basic_set_alloc_space(__isl_take isl_space *dim,
774 unsigned extra, unsigned n_eq, unsigned n_ineq)
776 struct isl_basic_map *bmap;
779 isl_assert(dim->ctx, dim->n_in == 0, goto error);
780 bmap = isl_basic_map_alloc_space(dim, extra, n_eq, n_ineq);
781 return (struct isl_basic_set *)bmap;
787 struct isl_basic_map *isl_basic_map_alloc_space(__isl_take isl_space *dim,
788 unsigned extra, unsigned n_eq, unsigned n_ineq)
790 struct isl_basic_map *bmap;
794 bmap = isl_calloc_type(dim->ctx, struct isl_basic_map);
799 return basic_map_init(dim->ctx, bmap, extra, n_eq, n_ineq);
805 struct isl_basic_map *isl_basic_map_alloc(struct isl_ctx *ctx,
806 unsigned nparam, unsigned in, unsigned out, unsigned extra,
807 unsigned n_eq, unsigned n_ineq)
809 struct isl_basic_map *bmap;
812 dim = isl_space_alloc(ctx, nparam, in, out);
816 bmap = isl_basic_map_alloc_space(dim, extra, n_eq, n_ineq);
820 static void dup_constraints(
821 struct isl_basic_map *dst, struct isl_basic_map *src)
824 unsigned total = isl_basic_map_total_dim(src);
826 for (i = 0; i < src->n_eq; ++i) {
827 int j = isl_basic_map_alloc_equality(dst);
828 isl_seq_cpy(dst->eq[j], src->eq[i], 1+total);
831 for (i = 0; i < src->n_ineq; ++i) {
832 int j = isl_basic_map_alloc_inequality(dst);
833 isl_seq_cpy(dst->ineq[j], src->ineq[i], 1+total);
836 for (i = 0; i < src->n_div; ++i) {
837 int j = isl_basic_map_alloc_div(dst);
838 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total);
840 ISL_F_SET(dst, ISL_BASIC_SET_FINAL);
843 struct isl_basic_map *isl_basic_map_dup(struct isl_basic_map *bmap)
845 struct isl_basic_map *dup;
849 dup = isl_basic_map_alloc_space(isl_space_copy(bmap->dim),
850 bmap->n_div, bmap->n_eq, bmap->n_ineq);
853 dup_constraints(dup, bmap);
854 dup->flags = bmap->flags;
855 dup->sample = isl_vec_copy(bmap->sample);
859 struct isl_basic_set *isl_basic_set_dup(struct isl_basic_set *bset)
861 struct isl_basic_map *dup;
863 dup = isl_basic_map_dup((struct isl_basic_map *)bset);
864 return (struct isl_basic_set *)dup;
867 struct isl_basic_set *isl_basic_set_copy(struct isl_basic_set *bset)
872 if (ISL_F_ISSET(bset, ISL_BASIC_SET_FINAL)) {
876 return isl_basic_set_dup(bset);
879 struct isl_set *isl_set_copy(struct isl_set *set)
888 struct isl_basic_map *isl_basic_map_copy(struct isl_basic_map *bmap)
893 if (ISL_F_ISSET(bmap, ISL_BASIC_SET_FINAL)) {
897 bmap = isl_basic_map_dup(bmap);
899 ISL_F_SET(bmap, ISL_BASIC_SET_FINAL);
903 struct isl_map *isl_map_copy(struct isl_map *map)
912 void isl_basic_map_free(struct isl_basic_map *bmap)
920 isl_ctx_deref(bmap->ctx);
922 isl_blk_free(bmap->ctx, bmap->block2);
924 isl_blk_free(bmap->ctx, bmap->block);
925 isl_vec_free(bmap->sample);
926 isl_space_free(bmap->dim);
930 void isl_basic_set_free(struct isl_basic_set *bset)
932 isl_basic_map_free((struct isl_basic_map *)bset);
935 static int room_for_con(struct isl_basic_map *bmap, unsigned n)
937 return bmap->n_eq + bmap->n_ineq + n <= bmap->c_size;
940 __isl_give isl_map *isl_map_align_params_map_map_and(
941 __isl_take isl_map *map1, __isl_take isl_map *map2,
942 __isl_give isl_map *(*fn)(__isl_take isl_map *map1,
943 __isl_take isl_map *map2))
947 if (isl_space_match(map1->dim, isl_dim_param, map2->dim, isl_dim_param))
948 return fn(map1, map2);
949 if (!isl_space_has_named_params(map1->dim) ||
950 !isl_space_has_named_params(map2->dim))
951 isl_die(map1->ctx, isl_error_invalid,
952 "unaligned unnamed parameters", goto error);
953 map1 = isl_map_align_params(map1, isl_map_get_space(map2));
954 map2 = isl_map_align_params(map2, isl_map_get_space(map1));
955 return fn(map1, map2);
962 int isl_map_align_params_map_map_and_test(__isl_keep isl_map *map1,
963 __isl_keep isl_map *map2,
964 int (*fn)(__isl_keep isl_map *map1, __isl_keep isl_map *map2))
970 if (isl_space_match(map1->dim, isl_dim_param, map2->dim, isl_dim_param))
971 return fn(map1, map2);
972 if (!isl_space_has_named_params(map1->dim) ||
973 !isl_space_has_named_params(map2->dim))
974 isl_die(map1->ctx, isl_error_invalid,
975 "unaligned unnamed parameters", return -1);
976 map1 = isl_map_copy(map1);
977 map2 = isl_map_copy(map2);
978 map1 = isl_map_align_params(map1, isl_map_get_space(map2));
979 map2 = isl_map_align_params(map2, isl_map_get_space(map1));
986 int isl_basic_map_alloc_equality(struct isl_basic_map *bmap)
992 isl_assert(ctx, room_for_con(bmap, 1), return -1);
993 isl_assert(ctx, (bmap->eq - bmap->ineq) + bmap->n_eq <= bmap->c_size,
995 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
996 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
997 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_IMPLICIT);
998 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
999 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
1000 if ((bmap->eq - bmap->ineq) + bmap->n_eq == bmap->c_size) {
1002 int j = isl_basic_map_alloc_inequality(bmap);
1006 bmap->ineq[j] = bmap->ineq[bmap->n_ineq - 1];
1007 bmap->ineq[bmap->n_ineq - 1] = bmap->eq[-1];
1014 isl_seq_clr(bmap->eq[bmap->n_eq] + 1 + isl_basic_map_total_dim(bmap),
1015 bmap->extra - bmap->n_div);
1016 return bmap->n_eq++;
1019 int isl_basic_set_alloc_equality(struct isl_basic_set *bset)
1021 return isl_basic_map_alloc_equality((struct isl_basic_map *)bset);
1024 int isl_basic_map_free_equality(struct isl_basic_map *bmap, unsigned n)
1028 isl_assert(bmap->ctx, n <= bmap->n_eq, return -1);
1033 int isl_basic_set_free_equality(struct isl_basic_set *bset, unsigned n)
1035 return isl_basic_map_free_equality((struct isl_basic_map *)bset, n);
1038 int isl_basic_map_drop_equality(struct isl_basic_map *bmap, unsigned pos)
1043 isl_assert(bmap->ctx, pos < bmap->n_eq, return -1);
1045 if (pos != bmap->n_eq - 1) {
1047 bmap->eq[pos] = bmap->eq[bmap->n_eq - 1];
1048 bmap->eq[bmap->n_eq - 1] = t;
1054 int isl_basic_set_drop_equality(struct isl_basic_set *bset, unsigned pos)
1056 return isl_basic_map_drop_equality((struct isl_basic_map *)bset, pos);
1059 void isl_basic_map_inequality_to_equality(
1060 struct isl_basic_map *bmap, unsigned pos)
1064 t = bmap->ineq[pos];
1065 bmap->ineq[pos] = bmap->ineq[bmap->n_ineq - 1];
1066 bmap->ineq[bmap->n_ineq - 1] = bmap->eq[-1];
1071 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
1072 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1073 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
1074 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
1077 static int room_for_ineq(struct isl_basic_map *bmap, unsigned n)
1079 return bmap->n_ineq + n <= bmap->eq - bmap->ineq;
1082 int isl_basic_map_alloc_inequality(struct isl_basic_map *bmap)
1084 struct isl_ctx *ctx;
1088 isl_assert(ctx, room_for_ineq(bmap, 1), return -1);
1089 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_IMPLICIT);
1090 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
1091 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1092 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
1093 isl_seq_clr(bmap->ineq[bmap->n_ineq] +
1094 1 + isl_basic_map_total_dim(bmap),
1095 bmap->extra - bmap->n_div);
1096 return bmap->n_ineq++;
1099 int isl_basic_set_alloc_inequality(struct isl_basic_set *bset)
1101 return isl_basic_map_alloc_inequality((struct isl_basic_map *)bset);
1104 int isl_basic_map_free_inequality(struct isl_basic_map *bmap, unsigned n)
1108 isl_assert(bmap->ctx, n <= bmap->n_ineq, return -1);
1113 int isl_basic_set_free_inequality(struct isl_basic_set *bset, unsigned n)
1115 return isl_basic_map_free_inequality((struct isl_basic_map *)bset, n);
1118 int isl_basic_map_drop_inequality(struct isl_basic_map *bmap, unsigned pos)
1123 isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
1125 if (pos != bmap->n_ineq - 1) {
1126 t = bmap->ineq[pos];
1127 bmap->ineq[pos] = bmap->ineq[bmap->n_ineq - 1];
1128 bmap->ineq[bmap->n_ineq - 1] = t;
1129 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1135 int isl_basic_set_drop_inequality(struct isl_basic_set *bset, unsigned pos)
1137 return isl_basic_map_drop_inequality((struct isl_basic_map *)bset, pos);
1140 __isl_give isl_basic_map *isl_basic_map_add_eq(__isl_take isl_basic_map *bmap,
1145 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
1148 k = isl_basic_map_alloc_equality(bmap);
1151 isl_seq_cpy(bmap->eq[k], eq, 1 + isl_basic_map_total_dim(bmap));
1154 isl_basic_map_free(bmap);
1158 __isl_give isl_basic_set *isl_basic_set_add_eq(__isl_take isl_basic_set *bset,
1161 return (isl_basic_set *)
1162 isl_basic_map_add_eq((isl_basic_map *)bset, eq);
1165 __isl_give isl_basic_map *isl_basic_map_add_ineq(__isl_take isl_basic_map *bmap,
1170 bmap = isl_basic_map_extend_constraints(bmap, 0, 1);
1173 k = isl_basic_map_alloc_inequality(bmap);
1176 isl_seq_cpy(bmap->ineq[k], ineq, 1 + isl_basic_map_total_dim(bmap));
1179 isl_basic_map_free(bmap);
1183 __isl_give isl_basic_set *isl_basic_set_add_ineq(__isl_take isl_basic_set *bset,
1186 return (isl_basic_set *)
1187 isl_basic_map_add_ineq((isl_basic_map *)bset, ineq);
1190 int isl_basic_map_alloc_div(struct isl_basic_map *bmap)
1194 isl_assert(bmap->ctx, bmap->n_div < bmap->extra, return -1);
1195 isl_seq_clr(bmap->div[bmap->n_div] +
1196 1 + 1 + isl_basic_map_total_dim(bmap),
1197 bmap->extra - bmap->n_div);
1198 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
1199 return bmap->n_div++;
1202 int isl_basic_set_alloc_div(struct isl_basic_set *bset)
1204 return isl_basic_map_alloc_div((struct isl_basic_map *)bset);
1207 int isl_basic_map_free_div(struct isl_basic_map *bmap, unsigned n)
1211 isl_assert(bmap->ctx, n <= bmap->n_div, return -1);
1216 int isl_basic_set_free_div(struct isl_basic_set *bset, unsigned n)
1218 return isl_basic_map_free_div((struct isl_basic_map *)bset, n);
1221 /* Copy constraint from src to dst, putting the vars of src at offset
1222 * dim_off in dst and the divs of src at offset div_off in dst.
1223 * If both sets are actually map, then dim_off applies to the input
1226 static void copy_constraint(struct isl_basic_map *dst_map, isl_int *dst,
1227 struct isl_basic_map *src_map, isl_int *src,
1228 unsigned in_off, unsigned out_off, unsigned div_off)
1230 unsigned src_nparam = isl_basic_map_n_param(src_map);
1231 unsigned dst_nparam = isl_basic_map_n_param(dst_map);
1232 unsigned src_in = isl_basic_map_n_in(src_map);
1233 unsigned dst_in = isl_basic_map_n_in(dst_map);
1234 unsigned src_out = isl_basic_map_n_out(src_map);
1235 unsigned dst_out = isl_basic_map_n_out(dst_map);
1236 isl_int_set(dst[0], src[0]);
1237 isl_seq_cpy(dst+1, src+1, isl_min(dst_nparam, src_nparam));
1238 if (dst_nparam > src_nparam)
1239 isl_seq_clr(dst+1+src_nparam,
1240 dst_nparam - src_nparam);
1241 isl_seq_clr(dst+1+dst_nparam, in_off);
1242 isl_seq_cpy(dst+1+dst_nparam+in_off,
1244 isl_min(dst_in-in_off, src_in));
1245 if (dst_in-in_off > src_in)
1246 isl_seq_clr(dst+1+dst_nparam+in_off+src_in,
1247 dst_in - in_off - src_in);
1248 isl_seq_clr(dst+1+dst_nparam+dst_in, out_off);
1249 isl_seq_cpy(dst+1+dst_nparam+dst_in+out_off,
1250 src+1+src_nparam+src_in,
1251 isl_min(dst_out-out_off, src_out));
1252 if (dst_out-out_off > src_out)
1253 isl_seq_clr(dst+1+dst_nparam+dst_in+out_off+src_out,
1254 dst_out - out_off - src_out);
1255 isl_seq_clr(dst+1+dst_nparam+dst_in+dst_out, div_off);
1256 isl_seq_cpy(dst+1+dst_nparam+dst_in+dst_out+div_off,
1257 src+1+src_nparam+src_in+src_out,
1258 isl_min(dst_map->extra-div_off, src_map->n_div));
1259 if (dst_map->n_div-div_off > src_map->n_div)
1260 isl_seq_clr(dst+1+dst_nparam+dst_in+dst_out+
1261 div_off+src_map->n_div,
1262 dst_map->n_div - div_off - src_map->n_div);
1265 static void copy_div(struct isl_basic_map *dst_map, isl_int *dst,
1266 struct isl_basic_map *src_map, isl_int *src,
1267 unsigned in_off, unsigned out_off, unsigned div_off)
1269 isl_int_set(dst[0], src[0]);
1270 copy_constraint(dst_map, dst+1, src_map, src+1, in_off, out_off, div_off);
1273 static struct isl_basic_map *add_constraints(struct isl_basic_map *bmap1,
1274 struct isl_basic_map *bmap2, unsigned i_pos, unsigned o_pos)
1279 if (!bmap1 || !bmap2)
1282 div_off = bmap1->n_div;
1284 for (i = 0; i < bmap2->n_eq; ++i) {
1285 int i1 = isl_basic_map_alloc_equality(bmap1);
1288 copy_constraint(bmap1, bmap1->eq[i1], bmap2, bmap2->eq[i],
1289 i_pos, o_pos, div_off);
1292 for (i = 0; i < bmap2->n_ineq; ++i) {
1293 int i1 = isl_basic_map_alloc_inequality(bmap1);
1296 copy_constraint(bmap1, bmap1->ineq[i1], bmap2, bmap2->ineq[i],
1297 i_pos, o_pos, div_off);
1300 for (i = 0; i < bmap2->n_div; ++i) {
1301 int i1 = isl_basic_map_alloc_div(bmap1);
1304 copy_div(bmap1, bmap1->div[i1], bmap2, bmap2->div[i],
1305 i_pos, o_pos, div_off);
1308 isl_basic_map_free(bmap2);
1313 isl_basic_map_free(bmap1);
1314 isl_basic_map_free(bmap2);
1318 struct isl_basic_set *isl_basic_set_add_constraints(struct isl_basic_set *bset1,
1319 struct isl_basic_set *bset2, unsigned pos)
1321 return (struct isl_basic_set *)
1322 add_constraints((struct isl_basic_map *)bset1,
1323 (struct isl_basic_map *)bset2, 0, pos);
1326 struct isl_basic_map *isl_basic_map_extend_space(struct isl_basic_map *base,
1327 __isl_take isl_space *dim, unsigned extra,
1328 unsigned n_eq, unsigned n_ineq)
1330 struct isl_basic_map *ext;
1340 dims_ok = isl_space_is_equal(base->dim, dim) &&
1341 base->extra >= base->n_div + extra;
1343 if (dims_ok && room_for_con(base, n_eq + n_ineq) &&
1344 room_for_ineq(base, n_ineq)) {
1345 isl_space_free(dim);
1349 isl_assert(base->ctx, base->dim->nparam <= dim->nparam, goto error);
1350 isl_assert(base->ctx, base->dim->n_in <= dim->n_in, goto error);
1351 isl_assert(base->ctx, base->dim->n_out <= dim->n_out, goto error);
1352 extra += base->extra;
1354 n_ineq += base->n_ineq;
1356 ext = isl_basic_map_alloc_space(dim, extra, n_eq, n_ineq);
1362 ext->sample = isl_vec_copy(base->sample);
1363 flags = base->flags;
1364 ext = add_constraints(ext, base, 0, 0);
1367 ISL_F_CLR(ext, ISL_BASIC_SET_FINAL);
1373 isl_space_free(dim);
1374 isl_basic_map_free(base);
1378 struct isl_basic_set *isl_basic_set_extend_space(struct isl_basic_set *base,
1379 __isl_take isl_space *dim, unsigned extra,
1380 unsigned n_eq, unsigned n_ineq)
1382 return (struct isl_basic_set *)
1383 isl_basic_map_extend_space((struct isl_basic_map *)base, dim,
1384 extra, n_eq, n_ineq);
1387 struct isl_basic_map *isl_basic_map_extend_constraints(
1388 struct isl_basic_map *base, unsigned n_eq, unsigned n_ineq)
1392 return isl_basic_map_extend_space(base, isl_space_copy(base->dim),
1396 struct isl_basic_map *isl_basic_map_extend(struct isl_basic_map *base,
1397 unsigned nparam, unsigned n_in, unsigned n_out, unsigned extra,
1398 unsigned n_eq, unsigned n_ineq)
1400 struct isl_basic_map *bmap;
1405 dim = isl_space_alloc(base->ctx, nparam, n_in, n_out);
1409 bmap = isl_basic_map_extend_space(base, dim, extra, n_eq, n_ineq);
1412 isl_basic_map_free(base);
1416 struct isl_basic_set *isl_basic_set_extend(struct isl_basic_set *base,
1417 unsigned nparam, unsigned dim, unsigned extra,
1418 unsigned n_eq, unsigned n_ineq)
1420 return (struct isl_basic_set *)
1421 isl_basic_map_extend((struct isl_basic_map *)base,
1422 nparam, 0, dim, extra, n_eq, n_ineq);
1425 struct isl_basic_set *isl_basic_set_extend_constraints(
1426 struct isl_basic_set *base, unsigned n_eq, unsigned n_ineq)
1428 return (struct isl_basic_set *)
1429 isl_basic_map_extend_constraints((struct isl_basic_map *)base,
1433 struct isl_basic_set *isl_basic_set_cow(struct isl_basic_set *bset)
1435 return (struct isl_basic_set *)
1436 isl_basic_map_cow((struct isl_basic_map *)bset);
1439 struct isl_basic_map *isl_basic_map_cow(struct isl_basic_map *bmap)
1444 if (bmap->ref > 1) {
1446 bmap = isl_basic_map_dup(bmap);
1449 ISL_F_CLR(bmap, ISL_BASIC_SET_FINAL);
1453 struct isl_set *isl_set_cow(struct isl_set *set)
1461 return isl_set_dup(set);
1464 struct isl_map *isl_map_cow(struct isl_map *map)
1472 return isl_map_dup(map);
1475 static void swap_vars(struct isl_blk blk, isl_int *a,
1476 unsigned a_len, unsigned b_len)
1478 isl_seq_cpy(blk.data, a+a_len, b_len);
1479 isl_seq_cpy(blk.data+b_len, a, a_len);
1480 isl_seq_cpy(a, blk.data, b_len+a_len);
1483 static __isl_give isl_basic_map *isl_basic_map_swap_vars(
1484 __isl_take isl_basic_map *bmap, unsigned pos, unsigned n1, unsigned n2)
1492 isl_assert(bmap->ctx,
1493 pos + n1 + n2 <= 1 + isl_basic_map_total_dim(bmap), goto error);
1495 if (n1 == 0 || n2 == 0)
1498 bmap = isl_basic_map_cow(bmap);
1502 blk = isl_blk_alloc(bmap->ctx, n1 + n2);
1503 if (isl_blk_is_error(blk))
1506 for (i = 0; i < bmap->n_eq; ++i)
1508 bmap->eq[i] + pos, n1, n2);
1510 for (i = 0; i < bmap->n_ineq; ++i)
1512 bmap->ineq[i] + pos, n1, n2);
1514 for (i = 0; i < bmap->n_div; ++i)
1516 bmap->div[i]+1 + pos, n1, n2);
1518 isl_blk_free(bmap->ctx, blk);
1520 ISL_F_CLR(bmap, ISL_BASIC_SET_NORMALIZED);
1521 bmap = isl_basic_map_gauss(bmap, NULL);
1522 return isl_basic_map_finalize(bmap);
1524 isl_basic_map_free(bmap);
1528 static __isl_give isl_basic_set *isl_basic_set_swap_vars(
1529 __isl_take isl_basic_set *bset, unsigned n)
1534 nparam = isl_basic_set_n_param(bset);
1535 dim = isl_basic_set_n_dim(bset);
1536 isl_assert(bset->ctx, n <= dim, goto error);
1538 return isl_basic_map_swap_vars(bset, 1 + nparam, n, dim - n);
1540 isl_basic_set_free(bset);
1544 struct isl_basic_map *isl_basic_map_set_to_empty(struct isl_basic_map *bmap)
1550 total = isl_basic_map_total_dim(bmap);
1551 isl_basic_map_free_div(bmap, bmap->n_div);
1552 isl_basic_map_free_inequality(bmap, bmap->n_ineq);
1554 isl_basic_map_free_equality(bmap, bmap->n_eq-1);
1556 i = isl_basic_map_alloc_equality(bmap);
1560 isl_int_set_si(bmap->eq[i][0], 1);
1561 isl_seq_clr(bmap->eq[i]+1, total);
1562 ISL_F_SET(bmap, ISL_BASIC_MAP_EMPTY);
1563 isl_vec_free(bmap->sample);
1564 bmap->sample = NULL;
1565 return isl_basic_map_finalize(bmap);
1567 isl_basic_map_free(bmap);
1571 struct isl_basic_set *isl_basic_set_set_to_empty(struct isl_basic_set *bset)
1573 return (struct isl_basic_set *)
1574 isl_basic_map_set_to_empty((struct isl_basic_map *)bset);
1577 void isl_basic_map_swap_div(struct isl_basic_map *bmap, int a, int b)
1580 unsigned off = isl_space_dim(bmap->dim, isl_dim_all);
1581 isl_int *t = bmap->div[a];
1582 bmap->div[a] = bmap->div[b];
1585 for (i = 0; i < bmap->n_eq; ++i)
1586 isl_int_swap(bmap->eq[i][1+off+a], bmap->eq[i][1+off+b]);
1588 for (i = 0; i < bmap->n_ineq; ++i)
1589 isl_int_swap(bmap->ineq[i][1+off+a], bmap->ineq[i][1+off+b]);
1591 for (i = 0; i < bmap->n_div; ++i)
1592 isl_int_swap(bmap->div[i][1+1+off+a], bmap->div[i][1+1+off+b]);
1593 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1596 /* Eliminate the specified n dimensions starting at first from the
1597 * constraints, without removing the dimensions from the space.
1598 * If the set is rational, the dimensions are eliminated using Fourier-Motzkin.
1600 __isl_give isl_map *isl_map_eliminate(__isl_take isl_map *map,
1601 enum isl_dim_type type, unsigned first, unsigned n)
1610 if (first + n > isl_map_dim(map, type) || first + n < first)
1611 isl_die(map->ctx, isl_error_invalid,
1612 "index out of bounds", goto error);
1614 map = isl_map_cow(map);
1618 for (i = 0; i < map->n; ++i) {
1619 map->p[i] = isl_basic_map_eliminate(map->p[i], type, first, n);
1629 /* Eliminate the specified n dimensions starting at first from the
1630 * constraints, without removing the dimensions from the space.
1631 * If the set is rational, the dimensions are eliminated using Fourier-Motzkin.
1633 __isl_give isl_set *isl_set_eliminate(__isl_take isl_set *set,
1634 enum isl_dim_type type, unsigned first, unsigned n)
1636 return (isl_set *)isl_map_eliminate((isl_map *)set, 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_dims(__isl_take isl_set *set,
1644 unsigned first, unsigned n)
1646 return isl_set_eliminate(set, isl_dim_set, first, n);
1649 __isl_give isl_basic_map *isl_basic_map_remove_divs(
1650 __isl_take isl_basic_map *bmap)
1654 bmap = isl_basic_map_eliminate_vars(bmap,
1655 isl_space_dim(bmap->dim, isl_dim_all), bmap->n_div);
1659 return isl_basic_map_finalize(bmap);
1662 __isl_give isl_basic_set *isl_basic_set_remove_divs(
1663 __isl_take isl_basic_set *bset)
1665 return (struct isl_basic_set *)isl_basic_map_remove_divs(
1666 (struct isl_basic_map *)bset);
1669 __isl_give isl_map *isl_map_remove_divs(__isl_take isl_map *map)
1678 map = isl_map_cow(map);
1682 for (i = 0; i < map->n; ++i) {
1683 map->p[i] = isl_basic_map_remove_divs(map->p[i]);
1693 __isl_give isl_set *isl_set_remove_divs(__isl_take isl_set *set)
1695 return isl_map_remove_divs(set);
1698 struct isl_basic_map *isl_basic_map_remove_dims(struct isl_basic_map *bmap,
1699 enum isl_dim_type type, unsigned first, unsigned n)
1703 isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
1705 if (n == 0 && !isl_space_is_named_or_nested(bmap->dim, type))
1707 bmap = isl_basic_map_eliminate_vars(bmap,
1708 isl_basic_map_offset(bmap, type) - 1 + first, n);
1711 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY) && type == isl_dim_div)
1713 bmap = isl_basic_map_drop(bmap, type, first, n);
1716 isl_basic_map_free(bmap);
1720 /* Return true if the definition of the given div (recursively) involves
1721 * any of the given variables.
1723 static int div_involves_vars(__isl_keep isl_basic_map *bmap, int div,
1724 unsigned first, unsigned n)
1727 unsigned div_offset = isl_basic_map_offset(bmap, isl_dim_div);
1729 if (isl_int_is_zero(bmap->div[div][0]))
1731 if (isl_seq_first_non_zero(bmap->div[div] + 1 + first, n) >= 0)
1734 for (i = bmap->n_div - 1; i >= 0; --i) {
1735 if (isl_int_is_zero(bmap->div[div][1 + div_offset + i]))
1737 if (div_involves_vars(bmap, i, first, n))
1744 /* Remove all divs (recursively) involving any of the given dimensions
1745 * in their definitions.
1747 __isl_give isl_basic_map *isl_basic_map_remove_divs_involving_dims(
1748 __isl_take isl_basic_map *bmap,
1749 enum isl_dim_type type, unsigned first, unsigned n)
1755 isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
1757 first += isl_basic_map_offset(bmap, type);
1759 for (i = bmap->n_div - 1; i >= 0; --i) {
1760 if (!div_involves_vars(bmap, i, first, n))
1762 bmap = isl_basic_map_remove_dims(bmap, isl_dim_div, i, 1);
1770 isl_basic_map_free(bmap);
1774 __isl_give isl_map *isl_map_remove_divs_involving_dims(__isl_take isl_map *map,
1775 enum isl_dim_type type, unsigned first, unsigned n)
1784 map = isl_map_cow(map);
1788 for (i = 0; i < map->n; ++i) {
1789 map->p[i] = isl_basic_map_remove_divs_involving_dims(map->p[i],
1800 __isl_give isl_set *isl_set_remove_divs_involving_dims(__isl_take isl_set *set,
1801 enum isl_dim_type type, unsigned first, unsigned n)
1803 return (isl_set *)isl_map_remove_divs_involving_dims((isl_map *)set,
1807 /* Does the desciption of "bmap" depend on the specified dimensions?
1808 * We also check whether the dimensions appear in any of the div definitions.
1809 * In principle there is no need for this check. If the dimensions appear
1810 * in a div definition, they also appear in the defining constraints of that
1813 int isl_basic_map_involves_dims(__isl_keep isl_basic_map *bmap,
1814 enum isl_dim_type type, unsigned first, unsigned n)
1821 if (first + n > isl_basic_map_dim(bmap, type))
1822 isl_die(bmap->ctx, isl_error_invalid,
1823 "index out of bounds", return -1);
1825 first += isl_basic_map_offset(bmap, type);
1826 for (i = 0; i < bmap->n_eq; ++i)
1827 if (isl_seq_first_non_zero(bmap->eq[i] + first, n) >= 0)
1829 for (i = 0; i < bmap->n_ineq; ++i)
1830 if (isl_seq_first_non_zero(bmap->ineq[i] + first, n) >= 0)
1832 for (i = 0; i < bmap->n_div; ++i) {
1833 if (isl_int_is_zero(bmap->div[i][0]))
1835 if (isl_seq_first_non_zero(bmap->div[i] + 1 + first, n) >= 0)
1842 int isl_map_involves_dims(__isl_keep isl_map *map,
1843 enum isl_dim_type type, unsigned first, unsigned n)
1850 if (first + n > isl_map_dim(map, type))
1851 isl_die(map->ctx, isl_error_invalid,
1852 "index out of bounds", return -1);
1854 for (i = 0; i < map->n; ++i) {
1855 int involves = isl_basic_map_involves_dims(map->p[i],
1857 if (involves < 0 || involves)
1864 int isl_basic_set_involves_dims(__isl_keep isl_basic_set *bset,
1865 enum isl_dim_type type, unsigned first, unsigned n)
1867 return isl_basic_map_involves_dims(bset, type, first, n);
1870 int isl_set_involves_dims(__isl_keep isl_set *set,
1871 enum isl_dim_type type, unsigned first, unsigned n)
1873 return isl_map_involves_dims(set, type, first, n);
1876 /* Return true if the definition of the given div is unknown or depends
1879 static int div_is_unknown(__isl_keep isl_basic_map *bmap, int div)
1882 unsigned div_offset = isl_basic_map_offset(bmap, isl_dim_div);
1884 if (isl_int_is_zero(bmap->div[div][0]))
1887 for (i = bmap->n_div - 1; i >= 0; --i) {
1888 if (isl_int_is_zero(bmap->div[div][1 + div_offset + i]))
1890 if (div_is_unknown(bmap, i))
1897 /* Remove all divs that are unknown or defined in terms of unknown divs.
1899 __isl_give isl_basic_map *isl_basic_map_remove_unknown_divs(
1900 __isl_take isl_basic_map *bmap)
1907 for (i = bmap->n_div - 1; i >= 0; --i) {
1908 if (!div_is_unknown(bmap, i))
1910 bmap = isl_basic_map_remove_dims(bmap, isl_dim_div, i, 1);
1919 __isl_give isl_map *isl_map_remove_unknown_divs(__isl_take isl_map *map)
1928 map = isl_map_cow(map);
1932 for (i = 0; i < map->n; ++i) {
1933 map->p[i] = isl_basic_map_remove_unknown_divs(map->p[i]);
1943 __isl_give isl_set *isl_set_remove_unknown_divs(__isl_take isl_set *set)
1945 return (isl_set *)isl_map_remove_unknown_divs((isl_map *)set);
1948 __isl_give isl_basic_set *isl_basic_set_remove_dims(
1949 __isl_take isl_basic_set *bset,
1950 enum isl_dim_type type, unsigned first, unsigned n)
1952 return (isl_basic_set *)
1953 isl_basic_map_remove_dims((isl_basic_map *)bset, type, first, n);
1956 struct isl_map *isl_map_remove_dims(struct isl_map *map,
1957 enum isl_dim_type type, unsigned first, unsigned n)
1964 map = isl_map_cow(map);
1967 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
1969 for (i = 0; i < map->n; ++i) {
1970 map->p[i] = isl_basic_map_eliminate_vars(map->p[i],
1971 isl_basic_map_offset(map->p[i], type) - 1 + first, n);
1975 map = isl_map_drop(map, type, first, n);
1982 __isl_give isl_set *isl_set_remove_dims(__isl_take isl_set *bset,
1983 enum isl_dim_type type, unsigned first, unsigned n)
1985 return (isl_set *)isl_map_remove_dims((isl_map *)bset, type, first, n);
1988 /* Project out n inputs starting at first using Fourier-Motzkin */
1989 struct isl_map *isl_map_remove_inputs(struct isl_map *map,
1990 unsigned first, unsigned n)
1992 return isl_map_remove_dims(map, isl_dim_in, first, n);
1995 static void dump_term(struct isl_basic_map *bmap,
1996 isl_int c, int pos, FILE *out)
1999 unsigned in = isl_basic_map_n_in(bmap);
2000 unsigned dim = in + isl_basic_map_n_out(bmap);
2001 unsigned nparam = isl_basic_map_n_param(bmap);
2003 isl_int_print(out, c, 0);
2005 if (!isl_int_is_one(c))
2006 isl_int_print(out, c, 0);
2007 if (pos < 1 + nparam) {
2008 name = isl_space_get_dim_name(bmap->dim,
2009 isl_dim_param, pos - 1);
2011 fprintf(out, "%s", name);
2013 fprintf(out, "p%d", pos - 1);
2014 } else if (pos < 1 + nparam + in)
2015 fprintf(out, "i%d", pos - 1 - nparam);
2016 else if (pos < 1 + nparam + dim)
2017 fprintf(out, "o%d", pos - 1 - nparam - in);
2019 fprintf(out, "e%d", pos - 1 - nparam - dim);
2023 static void dump_constraint_sign(struct isl_basic_map *bmap, isl_int *c,
2024 int sign, FILE *out)
2028 unsigned len = 1 + isl_basic_map_total_dim(bmap);
2032 for (i = 0, first = 1; i < len; ++i) {
2033 if (isl_int_sgn(c[i]) * sign <= 0)
2036 fprintf(out, " + ");
2038 isl_int_abs(v, c[i]);
2039 dump_term(bmap, v, i, out);
2046 static void dump_constraint(struct isl_basic_map *bmap, isl_int *c,
2047 const char *op, FILE *out, int indent)
2051 fprintf(out, "%*s", indent, "");
2053 dump_constraint_sign(bmap, c, 1, out);
2054 fprintf(out, " %s ", op);
2055 dump_constraint_sign(bmap, c, -1, out);
2059 for (i = bmap->n_div; i < bmap->extra; ++i) {
2060 if (isl_int_is_zero(c[1+isl_space_dim(bmap->dim, isl_dim_all)+i]))
2062 fprintf(out, "%*s", indent, "");
2063 fprintf(out, "ERROR: unused div coefficient not zero\n");
2068 static void dump_constraints(struct isl_basic_map *bmap,
2069 isl_int **c, unsigned n,
2070 const char *op, FILE *out, int indent)
2074 for (i = 0; i < n; ++i)
2075 dump_constraint(bmap, c[i], op, out, indent);
2078 static void dump_affine(struct isl_basic_map *bmap, isl_int *exp, FILE *out)
2082 unsigned total = isl_basic_map_total_dim(bmap);
2084 for (j = 0; j < 1 + total; ++j) {
2085 if (isl_int_is_zero(exp[j]))
2087 if (!first && isl_int_is_pos(exp[j]))
2089 dump_term(bmap, exp[j], j, out);
2094 static void dump(struct isl_basic_map *bmap, FILE *out, int indent)
2098 dump_constraints(bmap, bmap->eq, bmap->n_eq, "=", out, indent);
2099 dump_constraints(bmap, bmap->ineq, bmap->n_ineq, ">=", out, indent);
2101 for (i = 0; i < bmap->n_div; ++i) {
2102 fprintf(out, "%*s", indent, "");
2103 fprintf(out, "e%d = [(", i);
2104 dump_affine(bmap, bmap->div[i]+1, out);
2106 isl_int_print(out, bmap->div[i][0], 0);
2107 fprintf(out, "]\n");
2111 void isl_basic_set_print_internal(struct isl_basic_set *bset,
2112 FILE *out, int indent)
2115 fprintf(out, "null basic set\n");
2119 fprintf(out, "%*s", indent, "");
2120 fprintf(out, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n",
2121 bset->ref, bset->dim->nparam, bset->dim->n_out,
2122 bset->extra, bset->flags);
2123 dump((struct isl_basic_map *)bset, out, indent);
2126 void isl_basic_map_print_internal(struct isl_basic_map *bmap,
2127 FILE *out, int indent)
2130 fprintf(out, "null basic map\n");
2134 fprintf(out, "%*s", indent, "");
2135 fprintf(out, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, "
2136 "flags: %x, n_name: %d\n",
2138 bmap->dim->nparam, bmap->dim->n_in, bmap->dim->n_out,
2139 bmap->extra, bmap->flags, bmap->dim->n_id);
2140 dump(bmap, out, indent);
2143 int isl_inequality_negate(struct isl_basic_map *bmap, unsigned pos)
2148 total = isl_basic_map_total_dim(bmap);
2149 isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
2150 isl_seq_neg(bmap->ineq[pos], bmap->ineq[pos], 1 + total);
2151 isl_int_sub_ui(bmap->ineq[pos][0], bmap->ineq[pos][0], 1);
2152 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
2156 __isl_give isl_set *isl_set_alloc_space(__isl_take isl_space *dim, int n,
2159 struct isl_set *set;
2163 isl_assert(dim->ctx, dim->n_in == 0, goto error);
2164 isl_assert(dim->ctx, n >= 0, goto error);
2165 set = isl_alloc(dim->ctx, struct isl_set,
2166 sizeof(struct isl_set) +
2167 (n - 1) * sizeof(struct isl_basic_set *));
2171 set->ctx = dim->ctx;
2172 isl_ctx_ref(set->ctx);
2180 isl_space_free(dim);
2184 struct isl_set *isl_set_alloc(struct isl_ctx *ctx,
2185 unsigned nparam, unsigned dim, int n, unsigned flags)
2187 struct isl_set *set;
2190 dims = isl_space_alloc(ctx, nparam, 0, dim);
2194 set = isl_set_alloc_space(dims, n, flags);
2198 /* Make sure "map" has room for at least "n" more basic maps.
2200 struct isl_map *isl_map_grow(struct isl_map *map, int n)
2203 struct isl_map *grown = NULL;
2207 isl_assert(map->ctx, n >= 0, goto error);
2208 if (map->n + n <= map->size)
2210 grown = isl_map_alloc_space(isl_map_get_space(map), map->n + n, map->flags);
2213 for (i = 0; i < map->n; ++i) {
2214 grown->p[i] = isl_basic_map_copy(map->p[i]);
2222 isl_map_free(grown);
2227 /* Make sure "set" has room for at least "n" more basic sets.
2229 struct isl_set *isl_set_grow(struct isl_set *set, int n)
2231 return (struct isl_set *)isl_map_grow((struct isl_map *)set, n);
2234 struct isl_set *isl_set_dup(struct isl_set *set)
2237 struct isl_set *dup;
2242 dup = isl_set_alloc_space(isl_space_copy(set->dim), set->n, set->flags);
2245 for (i = 0; i < set->n; ++i)
2246 dup = isl_set_add_basic_set(dup, isl_basic_set_copy(set->p[i]));
2250 struct isl_set *isl_set_from_basic_set(struct isl_basic_set *bset)
2252 return isl_map_from_basic_map(bset);
2255 struct isl_map *isl_map_from_basic_map(struct isl_basic_map *bmap)
2257 struct isl_map *map;
2262 map = isl_map_alloc_space(isl_space_copy(bmap->dim), 1, ISL_MAP_DISJOINT);
2263 return isl_map_add_basic_map(map, bmap);
2266 __isl_give isl_set *isl_set_add_basic_set(__isl_take isl_set *set,
2267 __isl_take isl_basic_set *bset)
2269 return (struct isl_set *)isl_map_add_basic_map((struct isl_map *)set,
2270 (struct isl_basic_map *)bset);
2273 void isl_set_free(struct isl_set *set)
2283 isl_ctx_deref(set->ctx);
2284 for (i = 0; i < set->n; ++i)
2285 isl_basic_set_free(set->p[i]);
2286 isl_space_free(set->dim);
2290 void isl_set_print_internal(struct isl_set *set, FILE *out, int indent)
2295 fprintf(out, "null set\n");
2299 fprintf(out, "%*s", indent, "");
2300 fprintf(out, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
2301 set->ref, set->n, set->dim->nparam, set->dim->n_out,
2303 for (i = 0; i < set->n; ++i) {
2304 fprintf(out, "%*s", indent, "");
2305 fprintf(out, "basic set %d:\n", i);
2306 isl_basic_set_print_internal(set->p[i], out, indent+4);
2310 void isl_map_print_internal(struct isl_map *map, FILE *out, int indent)
2315 fprintf(out, "null map\n");
2319 fprintf(out, "%*s", indent, "");
2320 fprintf(out, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, "
2321 "flags: %x, n_name: %d\n",
2322 map->ref, map->n, map->dim->nparam, map->dim->n_in,
2323 map->dim->n_out, map->flags, map->dim->n_id);
2324 for (i = 0; i < map->n; ++i) {
2325 fprintf(out, "%*s", indent, "");
2326 fprintf(out, "basic map %d:\n", i);
2327 isl_basic_map_print_internal(map->p[i], out, indent+4);
2331 struct isl_basic_map *isl_basic_map_intersect_domain(
2332 struct isl_basic_map *bmap, struct isl_basic_set *bset)
2334 struct isl_basic_map *bmap_domain;
2339 isl_assert(bset->ctx, isl_space_match(bmap->dim, isl_dim_param,
2340 bset->dim, isl_dim_param), goto error);
2342 if (isl_space_dim(bset->dim, isl_dim_set) != 0)
2343 isl_assert(bset->ctx,
2344 isl_basic_map_compatible_domain(bmap, bset), goto error);
2346 bmap = isl_basic_map_cow(bmap);
2349 bmap = isl_basic_map_extend_space(bmap, isl_space_copy(bmap->dim),
2350 bset->n_div, bset->n_eq, bset->n_ineq);
2351 bmap_domain = isl_basic_map_from_domain(bset);
2352 bmap = add_constraints(bmap, bmap_domain, 0, 0);
2354 bmap = isl_basic_map_simplify(bmap);
2355 return isl_basic_map_finalize(bmap);
2357 isl_basic_map_free(bmap);
2358 isl_basic_set_free(bset);
2362 struct isl_basic_map *isl_basic_map_intersect_range(
2363 struct isl_basic_map *bmap, struct isl_basic_set *bset)
2365 struct isl_basic_map *bmap_range;
2370 isl_assert(bset->ctx, isl_space_match(bmap->dim, isl_dim_param,
2371 bset->dim, isl_dim_param), goto error);
2373 if (isl_space_dim(bset->dim, isl_dim_set) != 0)
2374 isl_assert(bset->ctx,
2375 isl_basic_map_compatible_range(bmap, bset), goto error);
2377 if (isl_basic_set_is_universe(bset)) {
2378 isl_basic_set_free(bset);
2382 bmap = isl_basic_map_cow(bmap);
2385 bmap = isl_basic_map_extend_space(bmap, isl_space_copy(bmap->dim),
2386 bset->n_div, bset->n_eq, bset->n_ineq);
2387 bmap_range = isl_basic_map_from_basic_set(bset, isl_space_copy(bset->dim));
2388 bmap = add_constraints(bmap, bmap_range, 0, 0);
2390 bmap = isl_basic_map_simplify(bmap);
2391 return isl_basic_map_finalize(bmap);
2393 isl_basic_map_free(bmap);
2394 isl_basic_set_free(bset);
2398 int isl_basic_map_contains(struct isl_basic_map *bmap, struct isl_vec *vec)
2404 total = 1 + isl_basic_map_total_dim(bmap);
2405 if (total != vec->size)
2410 for (i = 0; i < bmap->n_eq; ++i) {
2411 isl_seq_inner_product(vec->el, bmap->eq[i], total, &s);
2412 if (!isl_int_is_zero(s)) {
2418 for (i = 0; i < bmap->n_ineq; ++i) {
2419 isl_seq_inner_product(vec->el, bmap->ineq[i], total, &s);
2420 if (isl_int_is_neg(s)) {
2431 int isl_basic_set_contains(struct isl_basic_set *bset, struct isl_vec *vec)
2433 return isl_basic_map_contains((struct isl_basic_map *)bset, vec);
2436 struct isl_basic_map *isl_basic_map_intersect(
2437 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2439 struct isl_vec *sample = NULL;
2441 if (!bmap1 || !bmap2)
2444 isl_assert(bmap1->ctx, isl_space_match(bmap1->dim, isl_dim_param,
2445 bmap2->dim, isl_dim_param), goto error);
2446 if (isl_space_dim(bmap1->dim, isl_dim_all) ==
2447 isl_space_dim(bmap1->dim, isl_dim_param) &&
2448 isl_space_dim(bmap2->dim, isl_dim_all) !=
2449 isl_space_dim(bmap2->dim, isl_dim_param))
2450 return isl_basic_map_intersect(bmap2, bmap1);
2452 if (isl_space_dim(bmap2->dim, isl_dim_all) !=
2453 isl_space_dim(bmap2->dim, isl_dim_param))
2454 isl_assert(bmap1->ctx,
2455 isl_space_is_equal(bmap1->dim, bmap2->dim), goto error);
2457 if (bmap1->sample &&
2458 isl_basic_map_contains(bmap1, bmap1->sample) > 0 &&
2459 isl_basic_map_contains(bmap2, bmap1->sample) > 0)
2460 sample = isl_vec_copy(bmap1->sample);
2461 else if (bmap2->sample &&
2462 isl_basic_map_contains(bmap1, bmap2->sample) > 0 &&
2463 isl_basic_map_contains(bmap2, bmap2->sample) > 0)
2464 sample = isl_vec_copy(bmap2->sample);
2466 bmap1 = isl_basic_map_cow(bmap1);
2469 bmap1 = isl_basic_map_extend_space(bmap1, isl_space_copy(bmap1->dim),
2470 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
2471 bmap1 = add_constraints(bmap1, bmap2, 0, 0);
2474 isl_vec_free(sample);
2476 isl_vec_free(bmap1->sample);
2477 bmap1->sample = sample;
2480 bmap1 = isl_basic_map_simplify(bmap1);
2481 return isl_basic_map_finalize(bmap1);
2484 isl_vec_free(sample);
2485 isl_basic_map_free(bmap1);
2486 isl_basic_map_free(bmap2);
2490 struct isl_basic_set *isl_basic_set_intersect(
2491 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
2493 return (struct isl_basic_set *)
2494 isl_basic_map_intersect(
2495 (struct isl_basic_map *)bset1,
2496 (struct isl_basic_map *)bset2);
2499 __isl_give isl_basic_set *isl_basic_set_intersect_params(
2500 __isl_take isl_basic_set *bset1, __isl_take isl_basic_set *bset2)
2502 return isl_basic_set_intersect(bset1, bset2);
2505 /* Special case of isl_map_intersect, where both map1 and map2
2506 * are convex, without any divs and such that either map1 or map2
2507 * contains a single constraint. This constraint is then simply
2508 * added to the other map.
2510 static __isl_give isl_map *map_intersect_add_constraint(
2511 __isl_take isl_map *map1, __isl_take isl_map *map2)
2513 isl_assert(map1->ctx, map1->n == 1, goto error);
2514 isl_assert(map2->ctx, map1->n == 1, goto error);
2515 isl_assert(map1->ctx, map1->p[0]->n_div == 0, goto error);
2516 isl_assert(map2->ctx, map1->p[0]->n_div == 0, goto error);
2518 if (map2->p[0]->n_eq + map2->p[0]->n_ineq != 1)
2519 return isl_map_intersect(map2, map1);
2521 isl_assert(map2->ctx,
2522 map2->p[0]->n_eq + map2->p[0]->n_ineq == 1, goto error);
2524 map1 = isl_map_cow(map1);
2527 if (isl_map_plain_is_empty(map1)) {
2531 map1->p[0] = isl_basic_map_cow(map1->p[0]);
2532 if (map2->p[0]->n_eq == 1)
2533 map1->p[0] = isl_basic_map_add_eq(map1->p[0], map2->p[0]->eq[0]);
2535 map1->p[0] = isl_basic_map_add_ineq(map1->p[0],
2536 map2->p[0]->ineq[0]);
2538 map1->p[0] = isl_basic_map_simplify(map1->p[0]);
2539 map1->p[0] = isl_basic_map_finalize(map1->p[0]);
2543 if (isl_basic_map_plain_is_empty(map1->p[0])) {
2544 isl_basic_map_free(map1->p[0]);
2557 /* map2 may be either a parameter domain or a map living in the same
2560 static __isl_give isl_map *map_intersect_internal(__isl_take isl_map *map1,
2561 __isl_take isl_map *map2)
2564 struct isl_map *result;
2570 if (isl_map_plain_is_empty(map1) &&
2571 isl_space_is_equal(map1->dim, map2->dim)) {
2575 if (isl_map_plain_is_empty(map2) &&
2576 isl_space_is_equal(map1->dim, map2->dim)) {
2581 if (map1->n == 1 && map2->n == 1 &&
2582 map1->p[0]->n_div == 0 && map2->p[0]->n_div == 0 &&
2583 isl_space_is_equal(map1->dim, map2->dim) &&
2584 (map1->p[0]->n_eq + map1->p[0]->n_ineq == 1 ||
2585 map2->p[0]->n_eq + map2->p[0]->n_ineq == 1))
2586 return map_intersect_add_constraint(map1, map2);
2588 if (isl_space_dim(map2->dim, isl_dim_all) !=
2589 isl_space_dim(map2->dim, isl_dim_param))
2590 isl_assert(map1->ctx,
2591 isl_space_is_equal(map1->dim, map2->dim), goto error);
2593 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
2594 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
2595 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
2597 result = isl_map_alloc_space(isl_space_copy(map1->dim),
2598 map1->n * map2->n, flags);
2601 for (i = 0; i < map1->n; ++i)
2602 for (j = 0; j < map2->n; ++j) {
2603 struct isl_basic_map *part;
2604 part = isl_basic_map_intersect(
2605 isl_basic_map_copy(map1->p[i]),
2606 isl_basic_map_copy(map2->p[j]));
2607 if (isl_basic_map_is_empty(part) < 0)
2609 result = isl_map_add_basic_map(result, part);
2622 static __isl_give isl_map *map_intersect(__isl_take isl_map *map1,
2623 __isl_take isl_map *map2)
2627 if (!isl_space_is_equal(map1->dim, map2->dim))
2628 isl_die(isl_map_get_ctx(map1), isl_error_invalid,
2629 "spaces don't match", goto error);
2630 return map_intersect_internal(map1, map2);
2637 __isl_give isl_map *isl_map_intersect(__isl_take isl_map *map1,
2638 __isl_take isl_map *map2)
2640 return isl_map_align_params_map_map_and(map1, map2, &map_intersect);
2643 struct isl_set *isl_set_intersect(struct isl_set *set1, struct isl_set *set2)
2645 return (struct isl_set *)
2646 isl_map_intersect((struct isl_map *)set1,
2647 (struct isl_map *)set2);
2650 /* map_intersect_internal accepts intersections
2651 * with parameter domains, so we can just call that function.
2653 static __isl_give isl_map *map_intersect_params(__isl_take isl_map *map,
2654 __isl_take isl_set *params)
2656 return map_intersect_internal(map, params);
2659 __isl_give isl_map *isl_map_intersect_params(__isl_take isl_map *map1,
2660 __isl_take isl_map *map2)
2662 return isl_map_align_params_map_map_and(map1, map2, &map_intersect_params);
2665 __isl_give isl_set *isl_set_intersect_params(__isl_take isl_set *set,
2666 __isl_take isl_set *params)
2668 return isl_map_intersect_params(set, params);
2671 struct isl_basic_map *isl_basic_map_reverse(struct isl_basic_map *bmap)
2674 struct isl_basic_set *bset;
2679 bmap = isl_basic_map_cow(bmap);
2682 dim = isl_space_reverse(isl_space_copy(bmap->dim));
2683 in = isl_basic_map_n_in(bmap);
2684 bset = isl_basic_set_from_basic_map(bmap);
2685 bset = isl_basic_set_swap_vars(bset, in);
2686 return isl_basic_map_from_basic_set(bset, dim);
2689 static __isl_give isl_basic_map *basic_map_space_reset(
2690 __isl_take isl_basic_map *bmap, enum isl_dim_type type)
2694 if (!isl_space_is_named_or_nested(bmap->dim, type))
2697 space = isl_basic_map_get_space(bmap);
2698 space = isl_space_reset(space, type);
2699 bmap = isl_basic_map_reset_space(bmap, space);
2703 __isl_give isl_basic_map *isl_basic_map_insert(__isl_take isl_basic_map *bmap,
2704 enum isl_dim_type type, unsigned pos, unsigned n)
2707 struct isl_basic_map *res;
2708 struct isl_dim_map *dim_map;
2709 unsigned total, off;
2710 enum isl_dim_type t;
2713 return basic_map_space_reset(bmap, type);
2718 res_dim = isl_space_insert_dims(isl_basic_map_get_space(bmap), type, pos, n);
2720 total = isl_basic_map_total_dim(bmap) + n;
2721 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2723 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
2725 isl_dim_map_dim(dim_map, bmap->dim, t, off);
2727 unsigned size = isl_basic_map_dim(bmap, t);
2728 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2730 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2731 pos, size - pos, off + pos + n);
2733 off += isl_space_dim(res_dim, t);
2735 isl_dim_map_div(dim_map, bmap, off);
2737 res = isl_basic_map_alloc_space(res_dim,
2738 bmap->n_div, bmap->n_eq, bmap->n_ineq);
2739 if (isl_basic_map_is_rational(bmap))
2740 res = isl_basic_map_set_rational(res);
2741 if (isl_basic_map_plain_is_empty(bmap)) {
2742 isl_basic_map_free(bmap);
2743 return isl_basic_map_set_to_empty(res);
2745 res = isl_basic_map_add_constraints_dim_map(res, bmap, dim_map);
2746 return isl_basic_map_finalize(res);
2749 __isl_give isl_basic_map *isl_basic_map_add(__isl_take isl_basic_map *bmap,
2750 enum isl_dim_type type, unsigned n)
2754 return isl_basic_map_insert(bmap, type,
2755 isl_basic_map_dim(bmap, type), n);
2758 __isl_give isl_basic_set *isl_basic_set_add(__isl_take isl_basic_set *bset,
2759 enum isl_dim_type type, unsigned n)
2763 isl_assert(bset->ctx, type != isl_dim_in, goto error);
2764 return (isl_basic_set *)isl_basic_map_add((isl_basic_map *)bset, type, n);
2766 isl_basic_set_free(bset);
2770 static __isl_give isl_map *map_space_reset(__isl_take isl_map *map,
2771 enum isl_dim_type type)
2775 if (!map || !isl_space_is_named_or_nested(map->dim, type))
2778 space = isl_map_get_space(map);
2779 space = isl_space_reset(space, type);
2780 map = isl_map_reset_space(map, space);
2784 __isl_give isl_map *isl_map_insert_dims(__isl_take isl_map *map,
2785 enum isl_dim_type type, unsigned pos, unsigned n)
2790 return map_space_reset(map, type);
2792 map = isl_map_cow(map);
2796 map->dim = isl_space_insert_dims(map->dim, type, pos, n);
2800 for (i = 0; i < map->n; ++i) {
2801 map->p[i] = isl_basic_map_insert(map->p[i], type, pos, n);
2812 __isl_give isl_set *isl_set_insert_dims(__isl_take isl_set *set,
2813 enum isl_dim_type type, unsigned pos, unsigned n)
2815 return isl_map_insert_dims(set, type, pos, n);
2818 __isl_give isl_map *isl_map_add_dims(__isl_take isl_map *map,
2819 enum isl_dim_type type, unsigned n)
2823 return isl_map_insert_dims(map, type, isl_map_dim(map, type), n);
2826 __isl_give isl_set *isl_set_add_dims(__isl_take isl_set *set,
2827 enum isl_dim_type type, unsigned n)
2831 isl_assert(set->ctx, type != isl_dim_in, goto error);
2832 return (isl_set *)isl_map_add_dims((isl_map *)set, type, n);
2838 __isl_give isl_basic_map *isl_basic_map_move_dims(
2839 __isl_take isl_basic_map *bmap,
2840 enum isl_dim_type dst_type, unsigned dst_pos,
2841 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2843 struct isl_dim_map *dim_map;
2844 struct isl_basic_map *res;
2845 enum isl_dim_type t;
2846 unsigned total, off;
2853 isl_assert(bmap->ctx, src_pos + n <= isl_basic_map_dim(bmap, src_type),
2856 if (dst_type == src_type && dst_pos == src_pos)
2859 isl_assert(bmap->ctx, dst_type != src_type, goto error);
2861 if (pos(bmap->dim, dst_type) + dst_pos ==
2862 pos(bmap->dim, src_type) + src_pos +
2863 ((src_type < dst_type) ? n : 0)) {
2864 bmap = isl_basic_map_cow(bmap);
2868 bmap->dim = isl_space_move_dims(bmap->dim, dst_type, dst_pos,
2869 src_type, src_pos, n);
2873 bmap = isl_basic_map_finalize(bmap);
2878 total = isl_basic_map_total_dim(bmap);
2879 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2882 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
2883 unsigned size = isl_space_dim(bmap->dim, t);
2884 if (t == dst_type) {
2885 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2888 isl_dim_map_dim_range(dim_map, bmap->dim, src_type,
2891 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2892 dst_pos, size - dst_pos, off);
2893 off += size - dst_pos;
2894 } else if (t == src_type) {
2895 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2898 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2899 src_pos + n, size - src_pos - n, off);
2900 off += size - src_pos - n;
2902 isl_dim_map_dim(dim_map, bmap->dim, t, off);
2906 isl_dim_map_div(dim_map, bmap, off);
2908 res = isl_basic_map_alloc_space(isl_basic_map_get_space(bmap),
2909 bmap->n_div, bmap->n_eq, bmap->n_ineq);
2910 bmap = isl_basic_map_add_constraints_dim_map(res, bmap, dim_map);
2912 bmap->dim = isl_space_move_dims(bmap->dim, dst_type, dst_pos,
2913 src_type, src_pos, n);
2917 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
2918 bmap = isl_basic_map_gauss(bmap, NULL);
2919 bmap = isl_basic_map_finalize(bmap);
2923 isl_basic_map_free(bmap);
2927 __isl_give isl_basic_set *isl_basic_set_move_dims(__isl_take isl_basic_set *bset,
2928 enum isl_dim_type dst_type, unsigned dst_pos,
2929 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2931 return (isl_basic_set *)isl_basic_map_move_dims(
2932 (isl_basic_map *)bset, dst_type, dst_pos, src_type, src_pos, n);
2935 __isl_give isl_set *isl_set_move_dims(__isl_take isl_set *set,
2936 enum isl_dim_type dst_type, unsigned dst_pos,
2937 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2941 isl_assert(set->ctx, dst_type != isl_dim_in, goto error);
2942 return (isl_set *)isl_map_move_dims((isl_map *)set, dst_type, dst_pos,
2943 src_type, src_pos, n);
2949 __isl_give isl_map *isl_map_move_dims(__isl_take isl_map *map,
2950 enum isl_dim_type dst_type, unsigned dst_pos,
2951 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2960 isl_assert(map->ctx, src_pos + n <= isl_map_dim(map, src_type),
2963 if (dst_type == src_type && dst_pos == src_pos)
2966 isl_assert(map->ctx, dst_type != src_type, goto error);
2968 map = isl_map_cow(map);
2972 map->dim = isl_space_move_dims(map->dim, dst_type, dst_pos, src_type, src_pos, n);
2976 for (i = 0; i < map->n; ++i) {
2977 map->p[i] = isl_basic_map_move_dims(map->p[i],
2979 src_type, src_pos, n);
2990 /* Move the specified dimensions to the last columns right before
2991 * the divs. Don't change the dimension specification of bmap.
2992 * That's the responsibility of the caller.
2994 static __isl_give isl_basic_map *move_last(__isl_take isl_basic_map *bmap,
2995 enum isl_dim_type type, unsigned first, unsigned n)
2997 struct isl_dim_map *dim_map;
2998 struct isl_basic_map *res;
2999 enum isl_dim_type t;
3000 unsigned total, off;
3004 if (pos(bmap->dim, type) + first + n ==
3005 1 + isl_space_dim(bmap->dim, isl_dim_all))
3008 total = isl_basic_map_total_dim(bmap);
3009 dim_map = isl_dim_map_alloc(bmap->ctx, total);
3012 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
3013 unsigned size = isl_space_dim(bmap->dim, t);
3015 isl_dim_map_dim_range(dim_map, bmap->dim, t,
3018 isl_dim_map_dim_range(dim_map, bmap->dim, t,
3019 first, n, total - bmap->n_div - n);
3020 isl_dim_map_dim_range(dim_map, bmap->dim, t,
3021 first + n, size - (first + n), off);
3022 off += size - (first + n);
3024 isl_dim_map_dim(dim_map, bmap->dim, t, off);
3028 isl_dim_map_div(dim_map, bmap, off + n);
3030 res = isl_basic_map_alloc_space(isl_basic_map_get_space(bmap),
3031 bmap->n_div, bmap->n_eq, bmap->n_ineq);
3032 res = isl_basic_map_add_constraints_dim_map(res, bmap, dim_map);
3036 /* Turn the n dimensions of type type, starting at first
3037 * into existentially quantified variables.
3039 __isl_give isl_basic_map *isl_basic_map_project_out(
3040 __isl_take isl_basic_map *bmap,
3041 enum isl_dim_type type, unsigned first, unsigned n)
3049 return basic_map_space_reset(bmap, type);
3054 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL))
3055 return isl_basic_map_remove_dims(bmap, type, first, n);
3057 isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
3060 bmap = move_last(bmap, type, first, n);
3061 bmap = isl_basic_map_cow(bmap);
3065 row_size = 1 + isl_space_dim(bmap->dim, isl_dim_all) + bmap->extra;
3066 old = bmap->block2.data;
3067 bmap->block2 = isl_blk_extend(bmap->ctx, bmap->block2,
3068 (bmap->extra + n) * (1 + row_size));
3069 if (!bmap->block2.data)
3071 new_div = isl_alloc_array(bmap->ctx, isl_int *, bmap->extra + n);
3074 for (i = 0; i < n; ++i) {
3075 new_div[i] = bmap->block2.data +
3076 (bmap->extra + i) * (1 + row_size);
3077 isl_seq_clr(new_div[i], 1 + row_size);
3079 for (i = 0; i < bmap->extra; ++i)
3080 new_div[n + i] = bmap->block2.data + (bmap->div[i] - old);
3082 bmap->div = new_div;
3086 bmap->dim = isl_space_drop_dims(bmap->dim, type, first, n);
3089 bmap = isl_basic_map_simplify(bmap);
3090 bmap = isl_basic_map_drop_redundant_divs(bmap);
3091 return isl_basic_map_finalize(bmap);
3093 isl_basic_map_free(bmap);
3097 /* Turn the n dimensions of type type, starting at first
3098 * into existentially quantified variables.
3100 struct isl_basic_set *isl_basic_set_project_out(struct isl_basic_set *bset,
3101 enum isl_dim_type type, unsigned first, unsigned n)
3103 return (isl_basic_set *)isl_basic_map_project_out(
3104 (isl_basic_map *)bset, type, first, n);
3107 /* Turn the n dimensions of type type, starting at first
3108 * into existentially quantified variables.
3110 __isl_give isl_map *isl_map_project_out(__isl_take isl_map *map,
3111 enum isl_dim_type type, unsigned first, unsigned n)
3119 return map_space_reset(map, type);
3121 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
3123 map = isl_map_cow(map);
3127 map->dim = isl_space_drop_dims(map->dim, type, first, n);
3131 for (i = 0; i < map->n; ++i) {
3132 map->p[i] = isl_basic_map_project_out(map->p[i], type, first, n);
3143 /* Turn the n dimensions of type type, starting at first
3144 * into existentially quantified variables.
3146 __isl_give isl_set *isl_set_project_out(__isl_take isl_set *set,
3147 enum isl_dim_type type, unsigned first, unsigned n)
3149 return (isl_set *)isl_map_project_out((isl_map *)set, type, first, n);
3152 static struct isl_basic_map *add_divs(struct isl_basic_map *bmap, unsigned n)
3156 for (i = 0; i < n; ++i) {
3157 j = isl_basic_map_alloc_div(bmap);
3160 isl_seq_clr(bmap->div[j], 1+1+isl_basic_map_total_dim(bmap));
3164 isl_basic_map_free(bmap);
3168 struct isl_basic_map *isl_basic_map_apply_range(
3169 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3171 isl_space *dim_result = NULL;
3172 struct isl_basic_map *bmap;
3173 unsigned n_in, n_out, n, nparam, total, pos;
3174 struct isl_dim_map *dim_map1, *dim_map2;
3176 if (!bmap1 || !bmap2)
3179 dim_result = isl_space_join(isl_space_copy(bmap1->dim),
3180 isl_space_copy(bmap2->dim));
3182 n_in = isl_basic_map_n_in(bmap1);
3183 n_out = isl_basic_map_n_out(bmap2);
3184 n = isl_basic_map_n_out(bmap1);
3185 nparam = isl_basic_map_n_param(bmap1);
3187 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + n;
3188 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
3189 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
3190 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
3191 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
3192 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
3193 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_in);
3194 isl_dim_map_div(dim_map1, bmap1, pos += n_out);
3195 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
3196 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
3197 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
3199 bmap = isl_basic_map_alloc_space(dim_result,
3200 bmap1->n_div + bmap2->n_div + n,
3201 bmap1->n_eq + bmap2->n_eq,
3202 bmap1->n_ineq + bmap2->n_ineq);
3203 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap1, dim_map1);
3204 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap2, dim_map2);
3205 bmap = add_divs(bmap, n);
3206 bmap = isl_basic_map_simplify(bmap);
3207 bmap = isl_basic_map_drop_redundant_divs(bmap);
3208 return isl_basic_map_finalize(bmap);
3210 isl_basic_map_free(bmap1);
3211 isl_basic_map_free(bmap2);
3215 struct isl_basic_set *isl_basic_set_apply(
3216 struct isl_basic_set *bset, struct isl_basic_map *bmap)
3221 isl_assert(bset->ctx, isl_basic_map_compatible_domain(bmap, bset),
3224 return (struct isl_basic_set *)
3225 isl_basic_map_apply_range((struct isl_basic_map *)bset, bmap);
3227 isl_basic_set_free(bset);
3228 isl_basic_map_free(bmap);
3232 struct isl_basic_map *isl_basic_map_apply_domain(
3233 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3235 if (!bmap1 || !bmap2)
3238 isl_assert(bmap1->ctx,
3239 isl_basic_map_n_in(bmap1) == isl_basic_map_n_in(bmap2), goto error);
3240 isl_assert(bmap1->ctx,
3241 isl_basic_map_n_param(bmap1) == isl_basic_map_n_param(bmap2),
3244 bmap1 = isl_basic_map_reverse(bmap1);
3245 bmap1 = isl_basic_map_apply_range(bmap1, bmap2);
3246 return isl_basic_map_reverse(bmap1);
3248 isl_basic_map_free(bmap1);
3249 isl_basic_map_free(bmap2);
3253 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
3254 * A \cap B -> f(A) + f(B)
3256 struct isl_basic_map *isl_basic_map_sum(
3257 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3259 unsigned n_in, n_out, nparam, total, pos;
3260 struct isl_basic_map *bmap = NULL;
3261 struct isl_dim_map *dim_map1, *dim_map2;
3264 if (!bmap1 || !bmap2)
3267 isl_assert(bmap1->ctx, isl_space_is_equal(bmap1->dim, bmap2->dim),
3270 nparam = isl_basic_map_n_param(bmap1);
3271 n_in = isl_basic_map_n_in(bmap1);
3272 n_out = isl_basic_map_n_out(bmap1);
3274 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + 2 * n_out;
3275 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
3276 dim_map2 = isl_dim_map_alloc(bmap2->ctx, total);
3277 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
3278 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos);
3279 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
3280 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
3281 isl_dim_map_div(dim_map1, bmap1, pos += n_in + n_out);
3282 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
3283 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
3284 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_out);
3286 bmap = isl_basic_map_alloc_space(isl_space_copy(bmap1->dim),
3287 bmap1->n_div + bmap2->n_div + 2 * n_out,
3288 bmap1->n_eq + bmap2->n_eq + n_out,
3289 bmap1->n_ineq + bmap2->n_ineq);
3290 for (i = 0; i < n_out; ++i) {
3291 int j = isl_basic_map_alloc_equality(bmap);
3294 isl_seq_clr(bmap->eq[j], 1+total);
3295 isl_int_set_si(bmap->eq[j][1+nparam+n_in+i], -1);
3296 isl_int_set_si(bmap->eq[j][1+pos+i], 1);
3297 isl_int_set_si(bmap->eq[j][1+pos-n_out+i], 1);
3299 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap1, dim_map1);
3300 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap2, dim_map2);
3301 bmap = add_divs(bmap, 2 * n_out);
3303 bmap = isl_basic_map_simplify(bmap);
3304 return isl_basic_map_finalize(bmap);
3306 isl_basic_map_free(bmap);
3307 isl_basic_map_free(bmap1);
3308 isl_basic_map_free(bmap2);
3312 /* Given two maps A -> f(A) and B -> g(B), construct a map
3313 * A \cap B -> f(A) + f(B)
3315 struct isl_map *isl_map_sum(struct isl_map *map1, struct isl_map *map2)
3317 struct isl_map *result;
3323 isl_assert(map1->ctx, isl_space_is_equal(map1->dim, map2->dim), goto error);
3325 result = isl_map_alloc_space(isl_space_copy(map1->dim),
3326 map1->n * map2->n, 0);
3329 for (i = 0; i < map1->n; ++i)
3330 for (j = 0; j < map2->n; ++j) {
3331 struct isl_basic_map *part;
3332 part = isl_basic_map_sum(
3333 isl_basic_map_copy(map1->p[i]),
3334 isl_basic_map_copy(map2->p[j]));
3335 if (isl_basic_map_is_empty(part))
3336 isl_basic_map_free(part);
3338 result = isl_map_add_basic_map(result, part);
3351 __isl_give isl_set *isl_set_sum(__isl_take isl_set *set1,
3352 __isl_take isl_set *set2)
3354 return (isl_set *)isl_map_sum((isl_map *)set1, (isl_map *)set2);
3357 /* Given a basic map A -> f(A), construct A -> -f(A).
3359 struct isl_basic_map *isl_basic_map_neg(struct isl_basic_map *bmap)
3364 bmap = isl_basic_map_cow(bmap);
3368 n = isl_basic_map_dim(bmap, isl_dim_out);
3369 off = isl_basic_map_offset(bmap, isl_dim_out);
3370 for (i = 0; i < bmap->n_eq; ++i)
3371 for (j = 0; j < n; ++j)
3372 isl_int_neg(bmap->eq[i][off+j], bmap->eq[i][off+j]);
3373 for (i = 0; i < bmap->n_ineq; ++i)
3374 for (j = 0; j < n; ++j)
3375 isl_int_neg(bmap->ineq[i][off+j], bmap->ineq[i][off+j]);
3376 for (i = 0; i < bmap->n_div; ++i)
3377 for (j = 0; j < n; ++j)
3378 isl_int_neg(bmap->div[i][1+off+j], bmap->div[i][1+off+j]);
3379 bmap = isl_basic_map_gauss(bmap, NULL);
3380 return isl_basic_map_finalize(bmap);
3383 __isl_give isl_basic_set *isl_basic_set_neg(__isl_take isl_basic_set *bset)
3385 return isl_basic_map_neg(bset);
3388 /* Given a map A -> f(A), construct A -> -f(A).
3390 struct isl_map *isl_map_neg(struct isl_map *map)
3394 map = isl_map_cow(map);
3398 for (i = 0; i < map->n; ++i) {
3399 map->p[i] = isl_basic_map_neg(map->p[i]);
3410 __isl_give isl_set *isl_set_neg(__isl_take isl_set *set)
3412 return (isl_set *)isl_map_neg((isl_map *)set);
3415 /* Given a basic map A -> f(A) and an integer d, construct a basic map
3416 * A -> floor(f(A)/d).
3418 struct isl_basic_map *isl_basic_map_floordiv(struct isl_basic_map *bmap,
3421 unsigned n_in, n_out, nparam, total, pos;
3422 struct isl_basic_map *result = NULL;
3423 struct isl_dim_map *dim_map;
3429 nparam = isl_basic_map_n_param(bmap);
3430 n_in = isl_basic_map_n_in(bmap);
3431 n_out = isl_basic_map_n_out(bmap);
3433 total = nparam + n_in + n_out + bmap->n_div + n_out;
3434 dim_map = isl_dim_map_alloc(bmap->ctx, total);
3435 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_param, pos = 0);
3436 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_in, pos += nparam);
3437 isl_dim_map_div(dim_map, bmap, pos += n_in + n_out);
3438 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_out, pos += bmap->n_div);
3440 result = isl_basic_map_alloc_space(isl_space_copy(bmap->dim),
3441 bmap->n_div + n_out,
3442 bmap->n_eq, bmap->n_ineq + 2 * n_out);
3443 result = isl_basic_map_add_constraints_dim_map(result, bmap, dim_map);
3444 result = add_divs(result, n_out);
3445 for (i = 0; i < n_out; ++i) {
3447 j = isl_basic_map_alloc_inequality(result);
3450 isl_seq_clr(result->ineq[j], 1+total);
3451 isl_int_neg(result->ineq[j][1+nparam+n_in+i], d);
3452 isl_int_set_si(result->ineq[j][1+pos+i], 1);
3453 j = isl_basic_map_alloc_inequality(result);
3456 isl_seq_clr(result->ineq[j], 1+total);
3457 isl_int_set(result->ineq[j][1+nparam+n_in+i], d);
3458 isl_int_set_si(result->ineq[j][1+pos+i], -1);
3459 isl_int_sub_ui(result->ineq[j][0], d, 1);
3462 result = isl_basic_map_simplify(result);
3463 return isl_basic_map_finalize(result);
3465 isl_basic_map_free(result);
3469 /* Given a map A -> f(A) and an integer d, construct a map
3470 * A -> floor(f(A)/d).
3472 struct isl_map *isl_map_floordiv(struct isl_map *map, isl_int d)
3476 map = isl_map_cow(map);
3480 ISL_F_CLR(map, ISL_MAP_DISJOINT);
3481 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3482 for (i = 0; i < map->n; ++i) {
3483 map->p[i] = isl_basic_map_floordiv(map->p[i], d);
3494 static struct isl_basic_map *var_equal(struct isl_basic_map *bmap, unsigned pos)
3500 i = isl_basic_map_alloc_equality(bmap);
3503 nparam = isl_basic_map_n_param(bmap);
3504 n_in = isl_basic_map_n_in(bmap);
3505 isl_seq_clr(bmap->eq[i], 1 + isl_basic_map_total_dim(bmap));
3506 isl_int_set_si(bmap->eq[i][1+nparam+pos], -1);
3507 isl_int_set_si(bmap->eq[i][1+nparam+n_in+pos], 1);
3508 return isl_basic_map_finalize(bmap);
3510 isl_basic_map_free(bmap);
3514 /* Add a constraints to "bmap" expressing i_pos < o_pos
3516 static struct isl_basic_map *var_less(struct isl_basic_map *bmap, unsigned pos)
3522 i = isl_basic_map_alloc_inequality(bmap);
3525 nparam = isl_basic_map_n_param(bmap);
3526 n_in = isl_basic_map_n_in(bmap);
3527 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
3528 isl_int_set_si(bmap->ineq[i][0], -1);
3529 isl_int_set_si(bmap->ineq[i][1+nparam+pos], -1);
3530 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], 1);
3531 return isl_basic_map_finalize(bmap);
3533 isl_basic_map_free(bmap);
3537 /* Add a constraint to "bmap" expressing i_pos <= o_pos
3539 static __isl_give isl_basic_map *var_less_or_equal(
3540 __isl_take isl_basic_map *bmap, unsigned pos)
3546 i = isl_basic_map_alloc_inequality(bmap);
3549 nparam = isl_basic_map_n_param(bmap);
3550 n_in = isl_basic_map_n_in(bmap);
3551 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
3552 isl_int_set_si(bmap->ineq[i][1+nparam+pos], -1);
3553 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], 1);
3554 return isl_basic_map_finalize(bmap);
3556 isl_basic_map_free(bmap);
3560 /* Add a constraints to "bmap" expressing i_pos > o_pos
3562 static struct isl_basic_map *var_more(struct isl_basic_map *bmap, unsigned pos)
3568 i = isl_basic_map_alloc_inequality(bmap);
3571 nparam = isl_basic_map_n_param(bmap);
3572 n_in = isl_basic_map_n_in(bmap);
3573 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
3574 isl_int_set_si(bmap->ineq[i][0], -1);
3575 isl_int_set_si(bmap->ineq[i][1+nparam+pos], 1);
3576 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], -1);
3577 return isl_basic_map_finalize(bmap);
3579 isl_basic_map_free(bmap);
3583 /* Add a constraint to "bmap" expressing i_pos >= o_pos
3585 static __isl_give isl_basic_map *var_more_or_equal(
3586 __isl_take isl_basic_map *bmap, unsigned pos)
3592 i = isl_basic_map_alloc_inequality(bmap);
3595 nparam = isl_basic_map_n_param(bmap);
3596 n_in = isl_basic_map_n_in(bmap);
3597 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
3598 isl_int_set_si(bmap->ineq[i][1+nparam+pos], 1);
3599 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], -1);
3600 return isl_basic_map_finalize(bmap);
3602 isl_basic_map_free(bmap);
3606 __isl_give isl_basic_map *isl_basic_map_equal(
3607 __isl_take isl_space *dim, unsigned n_equal)
3610 struct isl_basic_map *bmap;
3611 bmap = isl_basic_map_alloc_space(dim, 0, n_equal, 0);
3614 for (i = 0; i < n_equal && bmap; ++i)
3615 bmap = var_equal(bmap, i);
3616 return isl_basic_map_finalize(bmap);
3619 /* Return a relation on of dimension "dim" expressing i_[0..pos] << o_[0..pos]
3621 __isl_give isl_basic_map *isl_basic_map_less_at(__isl_take isl_space *dim,
3625 struct isl_basic_map *bmap;
3626 bmap = isl_basic_map_alloc_space(dim, 0, pos, 1);
3629 for (i = 0; i < pos && bmap; ++i)
3630 bmap = var_equal(bmap, i);
3632 bmap = var_less(bmap, pos);
3633 return isl_basic_map_finalize(bmap);
3636 /* Return a relation on of dimension "dim" expressing i_[0..pos] <<= o_[0..pos]
3638 __isl_give isl_basic_map *isl_basic_map_less_or_equal_at(
3639 __isl_take isl_space *dim, unsigned pos)
3642 isl_basic_map *bmap;
3644 bmap = isl_basic_map_alloc_space(dim, 0, pos, 1);
3645 for (i = 0; i < pos; ++i)
3646 bmap = var_equal(bmap, i);
3647 bmap = var_less_or_equal(bmap, pos);
3648 return isl_basic_map_finalize(bmap);
3651 /* Return a relation on pairs of sets of dimension "dim" expressing i_pos > o_pos
3653 __isl_give isl_basic_map *isl_basic_map_more_at(__isl_take isl_space *dim,
3657 struct isl_basic_map *bmap;
3658 bmap = isl_basic_map_alloc_space(dim, 0, pos, 1);
3661 for (i = 0; i < pos && bmap; ++i)
3662 bmap = var_equal(bmap, i);
3664 bmap = var_more(bmap, pos);
3665 return isl_basic_map_finalize(bmap);
3668 /* Return a relation on of dimension "dim" expressing i_[0..pos] >>= o_[0..pos]
3670 __isl_give isl_basic_map *isl_basic_map_more_or_equal_at(
3671 __isl_take isl_space *dim, unsigned pos)
3674 isl_basic_map *bmap;
3676 bmap = isl_basic_map_alloc_space(dim, 0, pos, 1);
3677 for (i = 0; i < pos; ++i)
3678 bmap = var_equal(bmap, i);
3679 bmap = var_more_or_equal(bmap, pos);
3680 return isl_basic_map_finalize(bmap);
3683 static __isl_give isl_map *map_lex_lte_first(__isl_take isl_space *dims,
3684 unsigned n, int equal)
3686 struct isl_map *map;
3689 if (n == 0 && equal)
3690 return isl_map_universe(dims);
3692 map = isl_map_alloc_space(isl_space_copy(dims), n, ISL_MAP_DISJOINT);
3694 for (i = 0; i + 1 < n; ++i)
3695 map = isl_map_add_basic_map(map,
3696 isl_basic_map_less_at(isl_space_copy(dims), i));
3699 map = isl_map_add_basic_map(map,
3700 isl_basic_map_less_or_equal_at(dims, n - 1));
3702 map = isl_map_add_basic_map(map,
3703 isl_basic_map_less_at(dims, n - 1));
3705 isl_space_free(dims);
3710 static __isl_give isl_map *map_lex_lte(__isl_take isl_space *dims, int equal)
3714 return map_lex_lte_first(dims, dims->n_out, equal);
3717 __isl_give isl_map *isl_map_lex_lt_first(__isl_take isl_space *dim, unsigned n)
3719 return map_lex_lte_first(dim, n, 0);
3722 __isl_give isl_map *isl_map_lex_le_first(__isl_take isl_space *dim, unsigned n)
3724 return map_lex_lte_first(dim, n, 1);
3727 __isl_give isl_map *isl_map_lex_lt(__isl_take isl_space *set_dim)
3729 return map_lex_lte(isl_space_map_from_set(set_dim), 0);
3732 __isl_give isl_map *isl_map_lex_le(__isl_take isl_space *set_dim)
3734 return map_lex_lte(isl_space_map_from_set(set_dim), 1);
3737 static __isl_give isl_map *map_lex_gte_first(__isl_take isl_space *dims,
3738 unsigned n, int equal)
3740 struct isl_map *map;
3743 if (n == 0 && equal)
3744 return isl_map_universe(dims);
3746 map = isl_map_alloc_space(isl_space_copy(dims), n, ISL_MAP_DISJOINT);
3748 for (i = 0; i + 1 < n; ++i)
3749 map = isl_map_add_basic_map(map,
3750 isl_basic_map_more_at(isl_space_copy(dims), i));
3753 map = isl_map_add_basic_map(map,
3754 isl_basic_map_more_or_equal_at(dims, n - 1));
3756 map = isl_map_add_basic_map(map,
3757 isl_basic_map_more_at(dims, n - 1));
3759 isl_space_free(dims);
3764 static __isl_give isl_map *map_lex_gte(__isl_take isl_space *dims, int equal)
3768 return map_lex_gte_first(dims, dims->n_out, equal);
3771 __isl_give isl_map *isl_map_lex_gt_first(__isl_take isl_space *dim, unsigned n)
3773 return map_lex_gte_first(dim, n, 0);
3776 __isl_give isl_map *isl_map_lex_ge_first(__isl_take isl_space *dim, unsigned n)
3778 return map_lex_gte_first(dim, n, 1);
3781 __isl_give isl_map *isl_map_lex_gt(__isl_take isl_space *set_dim)
3783 return map_lex_gte(isl_space_map_from_set(set_dim), 0);
3786 __isl_give isl_map *isl_map_lex_ge(__isl_take isl_space *set_dim)
3788 return map_lex_gte(isl_space_map_from_set(set_dim), 1);
3791 __isl_give isl_map *isl_set_lex_le_set(__isl_take isl_set *set1,
3792 __isl_take isl_set *set2)
3795 map = isl_map_lex_le(isl_set_get_space(set1));
3796 map = isl_map_intersect_domain(map, set1);
3797 map = isl_map_intersect_range(map, set2);
3801 __isl_give isl_map *isl_set_lex_lt_set(__isl_take isl_set *set1,
3802 __isl_take isl_set *set2)
3805 map = isl_map_lex_lt(isl_set_get_space(set1));
3806 map = isl_map_intersect_domain(map, set1);
3807 map = isl_map_intersect_range(map, set2);
3811 __isl_give isl_map *isl_set_lex_ge_set(__isl_take isl_set *set1,
3812 __isl_take isl_set *set2)
3815 map = isl_map_lex_ge(isl_set_get_space(set1));
3816 map = isl_map_intersect_domain(map, set1);
3817 map = isl_map_intersect_range(map, set2);
3821 __isl_give isl_map *isl_set_lex_gt_set(__isl_take isl_set *set1,
3822 __isl_take isl_set *set2)
3825 map = isl_map_lex_gt(isl_set_get_space(set1));
3826 map = isl_map_intersect_domain(map, set1);
3827 map = isl_map_intersect_range(map, set2);
3831 __isl_give isl_map *isl_map_lex_le_map(__isl_take isl_map *map1,
3832 __isl_take isl_map *map2)
3835 map = isl_map_lex_le(isl_space_range(isl_map_get_space(map1)));
3836 map = isl_map_apply_domain(map, isl_map_reverse(map1));
3837 map = isl_map_apply_range(map, isl_map_reverse(map2));
3841 __isl_give isl_map *isl_map_lex_lt_map(__isl_take isl_map *map1,
3842 __isl_take isl_map *map2)
3845 map = isl_map_lex_lt(isl_space_range(isl_map_get_space(map1)));
3846 map = isl_map_apply_domain(map, isl_map_reverse(map1));
3847 map = isl_map_apply_range(map, isl_map_reverse(map2));
3851 __isl_give isl_map *isl_map_lex_ge_map(__isl_take isl_map *map1,
3852 __isl_take isl_map *map2)
3855 map = isl_map_lex_ge(isl_space_range(isl_map_get_space(map1)));
3856 map = isl_map_apply_domain(map, isl_map_reverse(map1));
3857 map = isl_map_apply_range(map, isl_map_reverse(map2));
3861 __isl_give isl_map *isl_map_lex_gt_map(__isl_take isl_map *map1,
3862 __isl_take isl_map *map2)
3865 map = isl_map_lex_gt(isl_space_range(isl_map_get_space(map1)));
3866 map = isl_map_apply_domain(map, isl_map_reverse(map1));
3867 map = isl_map_apply_range(map, isl_map_reverse(map2));
3871 __isl_give isl_basic_map *isl_basic_map_from_basic_set(
3872 __isl_take isl_basic_set *bset, __isl_take isl_space *dim)
3874 struct isl_basic_map *bmap;
3876 bset = isl_basic_set_cow(bset);
3880 isl_assert(bset->ctx, isl_space_compatible(bset->dim, dim), goto error);
3881 isl_space_free(bset->dim);
3882 bmap = (struct isl_basic_map *) bset;
3884 return isl_basic_map_finalize(bmap);
3886 isl_basic_set_free(bset);
3887 isl_space_free(dim);
3891 struct isl_basic_set *isl_basic_set_from_basic_map(struct isl_basic_map *bmap)
3895 if (bmap->dim->n_in == 0)
3896 return (struct isl_basic_set *)bmap;
3897 bmap = isl_basic_map_cow(bmap);
3900 bmap->dim = isl_space_as_set_space(bmap->dim);
3903 bmap = isl_basic_map_finalize(bmap);
3904 return (struct isl_basic_set *)bmap;
3906 isl_basic_map_free(bmap);
3910 /* For a div d = floor(f/m), add the constraints
3913 * -(f-(n-1)) + m d >= 0
3915 * Note that the second constraint is the negation of
3919 int isl_basic_map_add_div_constraints_var(__isl_keep isl_basic_map *bmap,
3920 unsigned pos, isl_int *div)
3923 unsigned total = isl_basic_map_total_dim(bmap);
3925 i = isl_basic_map_alloc_inequality(bmap);
3928 isl_seq_cpy(bmap->ineq[i], div + 1, 1 + total);
3929 isl_int_neg(bmap->ineq[i][1 + pos], div[0]);
3931 j = isl_basic_map_alloc_inequality(bmap);
3934 isl_seq_neg(bmap->ineq[j], bmap->ineq[i], 1 + total);
3935 isl_int_add(bmap->ineq[j][0], bmap->ineq[j][0], bmap->ineq[j][1 + pos]);
3936 isl_int_sub_ui(bmap->ineq[j][0], bmap->ineq[j][0], 1);
3940 int isl_basic_set_add_div_constraints_var(__isl_keep isl_basic_set *bset,
3941 unsigned pos, isl_int *div)
3943 return isl_basic_map_add_div_constraints_var((isl_basic_map *)bset,
3947 int isl_basic_map_add_div_constraints(struct isl_basic_map *bmap, unsigned div)
3949 unsigned total = isl_basic_map_total_dim(bmap);
3950 unsigned div_pos = total - bmap->n_div + div;
3952 return isl_basic_map_add_div_constraints_var(bmap, div_pos,
3956 struct isl_basic_set *isl_basic_map_underlying_set(
3957 struct isl_basic_map *bmap)
3961 if (bmap->dim->nparam == 0 && bmap->dim->n_in == 0 &&
3963 !isl_space_is_named_or_nested(bmap->dim, isl_dim_in) &&
3964 !isl_space_is_named_or_nested(bmap->dim, isl_dim_out))
3965 return (struct isl_basic_set *)bmap;
3966 bmap = isl_basic_map_cow(bmap);
3969 bmap->dim = isl_space_underlying(bmap->dim, bmap->n_div);
3972 bmap->extra -= bmap->n_div;
3974 bmap = isl_basic_map_finalize(bmap);
3975 return (struct isl_basic_set *)bmap;
3980 __isl_give isl_basic_set *isl_basic_set_underlying_set(
3981 __isl_take isl_basic_set *bset)
3983 return isl_basic_map_underlying_set((isl_basic_map *)bset);
3986 struct isl_basic_map *isl_basic_map_overlying_set(
3987 struct isl_basic_set *bset, struct isl_basic_map *like)
3989 struct isl_basic_map *bmap;
3990 struct isl_ctx *ctx;
3997 isl_assert(ctx, bset->n_div == 0, goto error);
3998 isl_assert(ctx, isl_basic_set_n_param(bset) == 0, goto error);
3999 isl_assert(ctx, bset->dim->n_out == isl_basic_map_total_dim(like),
4001 if (isl_space_is_equal(bset->dim, like->dim) && like->n_div == 0) {
4002 isl_basic_map_free(like);
4003 return (struct isl_basic_map *)bset;
4005 bset = isl_basic_set_cow(bset);
4008 total = bset->dim->n_out + bset->extra;
4009 bmap = (struct isl_basic_map *)bset;
4010 isl_space_free(bmap->dim);
4011 bmap->dim = isl_space_copy(like->dim);
4014 bmap->n_div = like->n_div;
4015 bmap->extra += like->n_div;
4019 ltotal = total - bmap->extra + like->extra;
4022 bmap->block2 = isl_blk_extend(ctx, bmap->block2,
4023 bmap->extra * (1 + 1 + total));
4024 if (isl_blk_is_error(bmap->block2))
4026 div = isl_realloc_array(ctx, bmap->div, isl_int *, bmap->extra);
4030 for (i = 0; i < bmap->extra; ++i)
4031 bmap->div[i] = bmap->block2.data + i * (1 + 1 + total);
4032 for (i = 0; i < like->n_div; ++i) {
4033 isl_seq_cpy(bmap->div[i], like->div[i], 1 + 1 + ltotal);
4034 isl_seq_clr(bmap->div[i]+1+1+ltotal, total - ltotal);
4036 bmap = isl_basic_map_extend_constraints(bmap,
4037 0, 2 * like->n_div);
4038 for (i = 0; i < like->n_div; ++i) {
4039 if (isl_int_is_zero(bmap->div[i][0]))
4041 if (isl_basic_map_add_div_constraints(bmap, i) < 0)
4045 isl_basic_map_free(like);
4046 bmap = isl_basic_map_simplify(bmap);
4047 bmap = isl_basic_map_finalize(bmap);
4050 isl_basic_map_free(like);
4051 isl_basic_set_free(bset);
4055 struct isl_basic_set *isl_basic_set_from_underlying_set(
4056 struct isl_basic_set *bset, struct isl_basic_set *like)
4058 return (struct isl_basic_set *)
4059 isl_basic_map_overlying_set(bset, (struct isl_basic_map *)like);
4062 struct isl_set *isl_set_from_underlying_set(
4063 struct isl_set *set, struct isl_basic_set *like)
4069 isl_assert(set->ctx, set->dim->n_out == isl_basic_set_total_dim(like),
4071 if (isl_space_is_equal(set->dim, like->dim) && like->n_div == 0) {
4072 isl_basic_set_free(like);
4075 set = isl_set_cow(set);
4078 for (i = 0; i < set->n; ++i) {
4079 set->p[i] = isl_basic_set_from_underlying_set(set->p[i],
4080 isl_basic_set_copy(like));
4084 isl_space_free(set->dim);
4085 set->dim = isl_space_copy(like->dim);
4088 isl_basic_set_free(like);
4091 isl_basic_set_free(like);
4096 struct isl_set *isl_map_underlying_set(struct isl_map *map)
4100 map = isl_map_cow(map);
4103 map->dim = isl_space_cow(map->dim);
4107 for (i = 1; i < map->n; ++i)
4108 isl_assert(map->ctx, map->p[0]->n_div == map->p[i]->n_div,
4110 for (i = 0; i < map->n; ++i) {
4111 map->p[i] = (struct isl_basic_map *)
4112 isl_basic_map_underlying_set(map->p[i]);
4117 map->dim = isl_space_underlying(map->dim, 0);
4119 isl_space_free(map->dim);
4120 map->dim = isl_space_copy(map->p[0]->dim);
4124 return (struct isl_set *)map;
4130 struct isl_set *isl_set_to_underlying_set(struct isl_set *set)
4132 return (struct isl_set *)isl_map_underlying_set((struct isl_map *)set);
4135 __isl_give isl_basic_map *isl_basic_map_reset_space(
4136 __isl_take isl_basic_map *bmap, __isl_take isl_space *dim)
4138 bmap = isl_basic_map_cow(bmap);
4142 isl_space_free(bmap->dim);
4145 bmap = isl_basic_map_finalize(bmap);
4149 isl_basic_map_free(bmap);
4150 isl_space_free(dim);
4154 __isl_give isl_basic_set *isl_basic_set_reset_space(
4155 __isl_take isl_basic_set *bset, __isl_take isl_space *dim)
4157 return (isl_basic_set *)isl_basic_map_reset_space((isl_basic_map *)bset,
4161 __isl_give isl_map *isl_map_reset_space(__isl_take isl_map *map,
4162 __isl_take isl_space *dim)
4166 map = isl_map_cow(map);
4170 for (i = 0; i < map->n; ++i) {
4171 map->p[i] = isl_basic_map_reset_space(map->p[i],
4172 isl_space_copy(dim));
4176 isl_space_free(map->dim);
4182 isl_space_free(dim);
4186 __isl_give isl_set *isl_set_reset_space(__isl_take isl_set *set,
4187 __isl_take isl_space *dim)
4189 return (struct isl_set *) isl_map_reset_space((struct isl_map *)set, dim);
4192 /* Compute the parameter domain of the given basic set.
4194 __isl_give isl_basic_set *isl_basic_set_params(__isl_take isl_basic_set *bset)
4199 if (isl_basic_set_is_params(bset))
4202 n = isl_basic_set_dim(bset, isl_dim_set);
4203 bset = isl_basic_set_project_out(bset, isl_dim_set, 0, n);
4204 space = isl_basic_set_get_space(bset);
4205 space = isl_space_params(space);
4206 bset = isl_basic_set_reset_space(bset, space);
4210 /* Compute the parameter domain of the given set.
4212 __isl_give isl_set *isl_set_params(__isl_take isl_set *set)
4217 if (isl_set_is_params(set))
4220 n = isl_set_dim(set, isl_dim_set);
4221 set = isl_set_project_out(set, isl_dim_set, 0, n);
4222 space = isl_set_get_space(set);
4223 space = isl_space_params(space);
4224 set = isl_set_reset_space(set, space);
4228 /* Construct a zero-dimensional set with the given parameter domain.
4230 __isl_give isl_set *isl_set_from_params(__isl_take isl_set *set)
4233 space = isl_set_get_space(set);
4234 space = isl_space_set_from_params(space);
4235 set = isl_set_reset_space(set, space);
4239 /* Compute the parameter domain of the given map.
4241 __isl_give isl_set *isl_map_params(__isl_take isl_map *map)
4246 n = isl_map_dim(map, isl_dim_in);
4247 map = isl_map_project_out(map, isl_dim_in, 0, n);
4248 n = isl_map_dim(map, isl_dim_out);
4249 map = isl_map_project_out(map, isl_dim_out, 0, n);
4250 space = isl_map_get_space(map);
4251 space = isl_space_params(space);
4252 map = isl_map_reset_space(map, space);
4256 struct isl_basic_set *isl_basic_map_domain(struct isl_basic_map *bmap)
4259 struct isl_basic_set *domain;
4265 dim = isl_space_domain(isl_basic_map_get_space(bmap));
4267 n_in = isl_basic_map_n_in(bmap);
4268 n_out = isl_basic_map_n_out(bmap);
4269 domain = isl_basic_set_from_basic_map(bmap);
4270 domain = isl_basic_set_project_out(domain, isl_dim_set, n_in, n_out);
4272 domain = isl_basic_set_reset_space(domain, dim);
4277 int isl_basic_map_may_be_set(__isl_keep isl_basic_map *bmap)
4281 return isl_space_may_be_set(bmap->dim);
4284 /* Is this basic map actually a set?
4285 * Users should never call this function. Outside of isl,
4286 * the type should indicate whether something is a set or a map.
4288 int isl_basic_map_is_set(__isl_keep isl_basic_map *bmap)
4292 return isl_space_is_set(bmap->dim);
4295 struct isl_basic_set *isl_basic_map_range(struct isl_basic_map *bmap)
4299 if (isl_basic_map_is_set(bmap))
4301 return isl_basic_map_domain(isl_basic_map_reverse(bmap));
4304 __isl_give isl_basic_map *isl_basic_map_domain_map(
4305 __isl_take isl_basic_map *bmap)
4309 isl_basic_map *domain;
4310 int nparam, n_in, n_out;
4313 nparam = isl_basic_map_dim(bmap, isl_dim_param);
4314 n_in = isl_basic_map_dim(bmap, isl_dim_in);
4315 n_out = isl_basic_map_dim(bmap, isl_dim_out);
4317 dim = isl_space_from_range(isl_space_domain(isl_basic_map_get_space(bmap)));
4318 domain = isl_basic_map_universe(dim);
4320 bmap = isl_basic_map_from_domain(isl_basic_map_wrap(bmap));
4321 bmap = isl_basic_map_apply_range(bmap, domain);
4322 bmap = isl_basic_map_extend_constraints(bmap, n_in, 0);
4324 total = isl_basic_map_total_dim(bmap);
4326 for (i = 0; i < n_in; ++i) {
4327 k = isl_basic_map_alloc_equality(bmap);
4330 isl_seq_clr(bmap->eq[k], 1 + total);
4331 isl_int_set_si(bmap->eq[k][1 + nparam + i], -1);
4332 isl_int_set_si(bmap->eq[k][1 + nparam + n_in + n_out + i], 1);
4335 bmap = isl_basic_map_gauss(bmap, NULL);
4336 return isl_basic_map_finalize(bmap);
4338 isl_basic_map_free(bmap);
4342 __isl_give isl_basic_map *isl_basic_map_range_map(
4343 __isl_take isl_basic_map *bmap)
4347 isl_basic_map *range;
4348 int nparam, n_in, n_out;
4351 nparam = isl_basic_map_dim(bmap, isl_dim_param);
4352 n_in = isl_basic_map_dim(bmap, isl_dim_in);
4353 n_out = isl_basic_map_dim(bmap, isl_dim_out);
4355 dim = isl_space_from_range(isl_space_range(isl_basic_map_get_space(bmap)));
4356 range = isl_basic_map_universe(dim);
4358 bmap = isl_basic_map_from_domain(isl_basic_map_wrap(bmap));
4359 bmap = isl_basic_map_apply_range(bmap, range);
4360 bmap = isl_basic_map_extend_constraints(bmap, n_out, 0);
4362 total = isl_basic_map_total_dim(bmap);
4364 for (i = 0; i < n_out; ++i) {
4365 k = isl_basic_map_alloc_equality(bmap);
4368 isl_seq_clr(bmap->eq[k], 1 + total);
4369 isl_int_set_si(bmap->eq[k][1 + nparam + n_in + i], -1);
4370 isl_int_set_si(bmap->eq[k][1 + nparam + n_in + n_out + i], 1);
4373 bmap = isl_basic_map_gauss(bmap, NULL);
4374 return isl_basic_map_finalize(bmap);
4376 isl_basic_map_free(bmap);
4380 int isl_map_may_be_set(__isl_keep isl_map *map)
4384 return isl_space_may_be_set(map->dim);
4387 /* Is this map actually a set?
4388 * Users should never call this function. Outside of isl,
4389 * the type should indicate whether something is a set or a map.
4391 int isl_map_is_set(__isl_keep isl_map *map)
4395 return isl_space_is_set(map->dim);
4398 struct isl_set *isl_map_range(struct isl_map *map)
4401 struct isl_set *set;
4405 if (isl_map_is_set(map))
4406 return (isl_set *)map;
4408 map = isl_map_cow(map);
4412 set = (struct isl_set *) map;
4413 set->dim = isl_space_range(set->dim);
4416 for (i = 0; i < map->n; ++i) {
4417 set->p[i] = isl_basic_map_range(map->p[i]);
4421 ISL_F_CLR(set, ISL_MAP_DISJOINT);
4422 ISL_F_CLR(set, ISL_SET_NORMALIZED);
4429 __isl_give isl_map *isl_map_domain_map(__isl_take isl_map *map)
4432 isl_space *domain_dim;
4434 map = isl_map_cow(map);
4438 domain_dim = isl_space_from_range(isl_space_domain(isl_map_get_space(map)));
4439 map->dim = isl_space_from_domain(isl_space_wrap(map->dim));
4440 map->dim = isl_space_join(map->dim, domain_dim);
4443 for (i = 0; i < map->n; ++i) {
4444 map->p[i] = isl_basic_map_domain_map(map->p[i]);
4448 ISL_F_CLR(map, ISL_MAP_DISJOINT);
4449 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4456 __isl_give isl_map *isl_map_range_map(__isl_take isl_map *map)
4459 isl_space *range_dim;
4461 map = isl_map_cow(map);
4465 range_dim = isl_space_range(isl_map_get_space(map));
4466 range_dim = isl_space_from_range(range_dim);
4467 map->dim = isl_space_from_domain(isl_space_wrap(map->dim));
4468 map->dim = isl_space_join(map->dim, range_dim);
4471 for (i = 0; i < map->n; ++i) {
4472 map->p[i] = isl_basic_map_range_map(map->p[i]);
4476 ISL_F_CLR(map, ISL_MAP_DISJOINT);
4477 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4484 __isl_give isl_map *isl_map_from_set(__isl_take isl_set *set,
4485 __isl_take isl_space *dim)
4488 struct isl_map *map = NULL;
4490 set = isl_set_cow(set);
4493 isl_assert(set->ctx, isl_space_compatible(set->dim, dim), goto error);
4494 map = (struct isl_map *)set;
4495 for (i = 0; i < set->n; ++i) {
4496 map->p[i] = isl_basic_map_from_basic_set(
4497 set->p[i], isl_space_copy(dim));
4501 isl_space_free(map->dim);
4505 isl_space_free(dim);
4510 __isl_give isl_basic_map *isl_basic_map_from_domain(
4511 __isl_take isl_basic_set *bset)
4513 return isl_basic_map_reverse(isl_basic_map_from_range(bset));
4516 __isl_give isl_basic_map *isl_basic_map_from_range(
4517 __isl_take isl_basic_set *bset)
4520 space = isl_basic_set_get_space(bset);
4521 space = isl_space_from_range(space);
4522 bset = isl_basic_set_reset_space(bset, space);
4523 return (isl_basic_map *)bset;
4526 struct isl_map *isl_map_from_range(struct isl_set *set)
4529 space = isl_set_get_space(set);
4530 space = isl_space_from_range(space);
4531 set = isl_set_reset_space(set, space);
4532 return (struct isl_map *)set;
4535 __isl_give isl_map *isl_map_from_domain(__isl_take isl_set *set)
4537 return isl_map_reverse(isl_map_from_range(set));
4540 __isl_give isl_basic_map *isl_basic_map_from_domain_and_range(
4541 __isl_take isl_basic_set *domain, __isl_take isl_basic_set *range)
4543 return isl_basic_map_apply_range(isl_basic_map_reverse(domain), range);
4546 __isl_give isl_map *isl_map_from_domain_and_range(__isl_take isl_set *domain,
4547 __isl_take isl_set *range)
4549 return isl_map_apply_range(isl_map_reverse(domain), range);
4552 struct isl_set *isl_set_from_map(struct isl_map *map)
4555 struct isl_set *set = NULL;
4559 map = isl_map_cow(map);
4562 map->dim = isl_space_as_set_space(map->dim);
4565 set = (struct isl_set *)map;
4566 for (i = 0; i < map->n; ++i) {
4567 set->p[i] = isl_basic_set_from_basic_map(map->p[i]);
4577 __isl_give isl_map *isl_map_alloc_space(__isl_take isl_space *dim, int n,
4580 struct isl_map *map;
4585 isl_die(dim->ctx, isl_error_internal,
4586 "negative number of basic maps", goto error);
4587 map = isl_alloc(dim->ctx, struct isl_map,
4588 sizeof(struct isl_map) +
4589 (n - 1) * sizeof(struct isl_basic_map *));
4593 map->ctx = dim->ctx;
4594 isl_ctx_ref(map->ctx);
4602 isl_space_free(dim);
4606 struct isl_map *isl_map_alloc(struct isl_ctx *ctx,
4607 unsigned nparam, unsigned in, unsigned out, int n,
4610 struct isl_map *map;
4613 dims = isl_space_alloc(ctx, nparam, in, out);
4617 map = isl_map_alloc_space(dims, n, flags);
4621 __isl_give isl_basic_map *isl_basic_map_empty(__isl_take isl_space *dim)
4623 struct isl_basic_map *bmap;
4624 bmap = isl_basic_map_alloc_space(dim, 0, 1, 0);
4625 bmap = isl_basic_map_set_to_empty(bmap);
4629 __isl_give isl_basic_set *isl_basic_set_empty(__isl_take isl_space *dim)
4631 struct isl_basic_set *bset;
4632 bset = isl_basic_set_alloc_space(dim, 0, 1, 0);
4633 bset = isl_basic_set_set_to_empty(bset);
4637 struct isl_basic_map *isl_basic_map_empty_like(struct isl_basic_map *model)
4639 struct isl_basic_map *bmap;
4642 bmap = isl_basic_map_alloc_space(isl_space_copy(model->dim), 0, 1, 0);
4643 bmap = isl_basic_map_set_to_empty(bmap);
4647 struct isl_basic_map *isl_basic_map_empty_like_map(struct isl_map *model)
4649 struct isl_basic_map *bmap;
4652 bmap = isl_basic_map_alloc_space(isl_space_copy(model->dim), 0, 1, 0);
4653 bmap = isl_basic_map_set_to_empty(bmap);
4657 struct isl_basic_set *isl_basic_set_empty_like(struct isl_basic_set *model)
4659 struct isl_basic_set *bset;
4662 bset = isl_basic_set_alloc_space(isl_space_copy(model->dim), 0, 1, 0);
4663 bset = isl_basic_set_set_to_empty(bset);
4667 __isl_give isl_basic_map *isl_basic_map_universe(__isl_take isl_space *dim)
4669 struct isl_basic_map *bmap;
4670 bmap = isl_basic_map_alloc_space(dim, 0, 0, 0);
4671 bmap = isl_basic_map_finalize(bmap);
4675 __isl_give isl_basic_set *isl_basic_set_universe(__isl_take isl_space *dim)
4677 struct isl_basic_set *bset;
4678 bset = isl_basic_set_alloc_space(dim, 0, 0, 0);
4679 bset = isl_basic_set_finalize(bset);
4683 __isl_give isl_basic_map *isl_basic_map_nat_universe(__isl_take isl_space *dim)
4686 unsigned total = isl_space_dim(dim, isl_dim_all);
4687 isl_basic_map *bmap;
4689 bmap= isl_basic_map_alloc_space(dim, 0, 0, total);
4690 for (i = 0; i < total; ++i) {
4691 int k = isl_basic_map_alloc_inequality(bmap);
4694 isl_seq_clr(bmap->ineq[k], 1 + total);
4695 isl_int_set_si(bmap->ineq[k][1 + i], 1);
4699 isl_basic_map_free(bmap);
4703 __isl_give isl_basic_set *isl_basic_set_nat_universe(__isl_take isl_space *dim)
4705 return isl_basic_map_nat_universe(dim);
4708 __isl_give isl_map *isl_map_nat_universe(__isl_take isl_space *dim)
4710 return isl_map_from_basic_map(isl_basic_map_nat_universe(dim));
4713 __isl_give isl_set *isl_set_nat_universe(__isl_take isl_space *dim)
4715 return isl_map_nat_universe(dim);
4718 __isl_give isl_basic_map *isl_basic_map_universe_like(
4719 __isl_keep isl_basic_map *model)
4723 return isl_basic_map_alloc_space(isl_space_copy(model->dim), 0, 0, 0);
4726 struct isl_basic_set *isl_basic_set_universe_like(struct isl_basic_set *model)
4730 return isl_basic_set_alloc_space(isl_space_copy(model->dim), 0, 0, 0);
4733 __isl_give isl_basic_set *isl_basic_set_universe_like_set(
4734 __isl_keep isl_set *model)
4738 return isl_basic_set_alloc_space(isl_space_copy(model->dim), 0, 0, 0);
4741 __isl_give isl_map *isl_map_empty(__isl_take isl_space *dim)
4743 return isl_map_alloc_space(dim, 0, ISL_MAP_DISJOINT);
4746 struct isl_map *isl_map_empty_like(struct isl_map *model)
4750 return isl_map_alloc_space(isl_space_copy(model->dim), 0, ISL_MAP_DISJOINT);
4753 struct isl_map *isl_map_empty_like_basic_map(struct isl_basic_map *model)
4757 return isl_map_alloc_space(isl_space_copy(model->dim), 0, ISL_MAP_DISJOINT);
4760 __isl_give isl_set *isl_set_empty(__isl_take isl_space *dim)
4762 return isl_set_alloc_space(dim, 0, ISL_MAP_DISJOINT);
4765 struct isl_set *isl_set_empty_like(struct isl_set *model)
4769 return isl_set_empty(isl_space_copy(model->dim));
4772 __isl_give isl_map *isl_map_universe(__isl_take isl_space *dim)
4774 struct isl_map *map;
4777 map = isl_map_alloc_space(isl_space_copy(dim), 1, ISL_MAP_DISJOINT);
4778 map = isl_map_add_basic_map(map, isl_basic_map_universe(dim));
4782 __isl_give isl_set *isl_set_universe(__isl_take isl_space *dim)
4784 struct isl_set *set;
4787 set = isl_set_alloc_space(isl_space_copy(dim), 1, ISL_MAP_DISJOINT);
4788 set = isl_set_add_basic_set(set, isl_basic_set_universe(dim));
4792 __isl_give isl_set *isl_set_universe_like(__isl_keep isl_set *model)
4796 return isl_set_universe(isl_space_copy(model->dim));
4799 struct isl_map *isl_map_dup(struct isl_map *map)
4802 struct isl_map *dup;
4806 dup = isl_map_alloc_space(isl_space_copy(map->dim), map->n, map->flags);
4807 for (i = 0; i < map->n; ++i)
4808 dup = isl_map_add_basic_map(dup, isl_basic_map_copy(map->p[i]));
4812 __isl_give isl_map *isl_map_add_basic_map(__isl_take isl_map *map,
4813 __isl_take isl_basic_map *bmap)
4817 if (isl_basic_map_plain_is_empty(bmap)) {
4818 isl_basic_map_free(bmap);
4821 isl_assert(map->ctx, isl_space_is_equal(map->dim, bmap->dim), goto error);
4822 isl_assert(map->ctx, map->n < map->size, goto error);
4823 map->p[map->n] = bmap;
4825 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4831 isl_basic_map_free(bmap);
4835 void isl_map_free(struct isl_map *map)
4845 isl_ctx_deref(map->ctx);
4846 for (i = 0; i < map->n; ++i)
4847 isl_basic_map_free(map->p[i]);
4848 isl_space_free(map->dim);
4852 struct isl_map *isl_map_extend(struct isl_map *base,
4853 unsigned nparam, unsigned n_in, unsigned n_out)
4857 base = isl_map_cow(base);
4861 base->dim = isl_space_extend(base->dim, nparam, n_in, n_out);
4864 for (i = 0; i < base->n; ++i) {
4865 base->p[i] = isl_basic_map_extend_space(base->p[i],
4866 isl_space_copy(base->dim), 0, 0, 0);
4876 struct isl_set *isl_set_extend(struct isl_set *base,
4877 unsigned nparam, unsigned dim)
4879 return (struct isl_set *)isl_map_extend((struct isl_map *)base,
4883 static struct isl_basic_map *isl_basic_map_fix_pos_si(
4884 struct isl_basic_map *bmap, unsigned pos, int value)
4888 bmap = isl_basic_map_cow(bmap);
4889 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
4890 j = isl_basic_map_alloc_equality(bmap);
4893 isl_seq_clr(bmap->eq[j] + 1, isl_basic_map_total_dim(bmap));
4894 isl_int_set_si(bmap->eq[j][pos], -1);
4895 isl_int_set_si(bmap->eq[j][0], value);
4896 bmap = isl_basic_map_simplify(bmap);
4897 return isl_basic_map_finalize(bmap);
4899 isl_basic_map_free(bmap);
4903 static __isl_give isl_basic_map *isl_basic_map_fix_pos(
4904 __isl_take isl_basic_map *bmap, unsigned pos, isl_int value)
4908 bmap = isl_basic_map_cow(bmap);
4909 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
4910 j = isl_basic_map_alloc_equality(bmap);
4913 isl_seq_clr(bmap->eq[j] + 1, isl_basic_map_total_dim(bmap));
4914 isl_int_set_si(bmap->eq[j][pos], -1);
4915 isl_int_set(bmap->eq[j][0], value);
4916 bmap = isl_basic_map_simplify(bmap);
4917 return isl_basic_map_finalize(bmap);
4919 isl_basic_map_free(bmap);
4923 struct isl_basic_map *isl_basic_map_fix_si(struct isl_basic_map *bmap,
4924 enum isl_dim_type type, unsigned pos, int value)
4928 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
4929 return isl_basic_map_fix_pos_si(bmap,
4930 isl_basic_map_offset(bmap, type) + pos, value);
4932 isl_basic_map_free(bmap);
4936 __isl_give isl_basic_map *isl_basic_map_fix(__isl_take isl_basic_map *bmap,
4937 enum isl_dim_type type, unsigned pos, isl_int value)
4941 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
4942 return isl_basic_map_fix_pos(bmap,
4943 isl_basic_map_offset(bmap, type) + pos, value);
4945 isl_basic_map_free(bmap);
4949 struct isl_basic_set *isl_basic_set_fix_si(struct isl_basic_set *bset,
4950 enum isl_dim_type type, unsigned pos, int value)
4952 return (struct isl_basic_set *)
4953 isl_basic_map_fix_si((struct isl_basic_map *)bset,
4957 __isl_give isl_basic_set *isl_basic_set_fix(__isl_take isl_basic_set *bset,
4958 enum isl_dim_type type, unsigned pos, isl_int value)
4960 return (struct isl_basic_set *)
4961 isl_basic_map_fix((struct isl_basic_map *)bset,
4965 struct isl_basic_map *isl_basic_map_fix_input_si(struct isl_basic_map *bmap,
4966 unsigned input, int value)
4968 return isl_basic_map_fix_si(bmap, isl_dim_in, input, value);
4971 struct isl_basic_set *isl_basic_set_fix_dim_si(struct isl_basic_set *bset,
4972 unsigned dim, int value)
4974 return (struct isl_basic_set *)
4975 isl_basic_map_fix_si((struct isl_basic_map *)bset,
4976 isl_dim_set, dim, value);
4979 static int remove_if_empty(__isl_keep isl_map *map, int i)
4981 int empty = isl_basic_map_plain_is_empty(map->p[i]);
4988 isl_basic_map_free(map->p[i]);
4989 if (i != map->n - 1) {
4990 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4991 map->p[i] = map->p[map->n - 1];
4998 struct isl_map *isl_map_fix_si(struct isl_map *map,
4999 enum isl_dim_type type, unsigned pos, int value)
5003 map = isl_map_cow(map);
5007 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
5008 for (i = map->n - 1; i >= 0; --i) {
5009 map->p[i] = isl_basic_map_fix_si(map->p[i], type, pos, value);
5010 if (remove_if_empty(map, i) < 0)
5013 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
5020 __isl_give isl_set *isl_set_fix_si(__isl_take isl_set *set,
5021 enum isl_dim_type type, unsigned pos, int value)
5023 return (struct isl_set *)
5024 isl_map_fix_si((struct isl_map *)set, type, pos, value);
5027 __isl_give isl_map *isl_map_fix(__isl_take isl_map *map,
5028 enum isl_dim_type type, unsigned pos, isl_int value)
5032 map = isl_map_cow(map);
5036 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
5037 for (i = 0; i < map->n; ++i) {
5038 map->p[i] = isl_basic_map_fix(map->p[i], type, pos, value);
5042 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
5049 __isl_give isl_set *isl_set_fix(__isl_take isl_set *set,
5050 enum isl_dim_type type, unsigned pos, isl_int value)
5052 return (struct isl_set *)isl_map_fix((isl_map *)set, type, pos, value);
5055 struct isl_map *isl_map_fix_input_si(struct isl_map *map,
5056 unsigned input, int value)
5058 return isl_map_fix_si(map, isl_dim_in, input, value);
5061 struct isl_set *isl_set_fix_dim_si(struct isl_set *set, unsigned dim, int value)
5063 return (struct isl_set *)
5064 isl_map_fix_si((struct isl_map *)set, isl_dim_set, dim, value);
5067 static __isl_give isl_basic_map *basic_map_bound_si(
5068 __isl_take isl_basic_map *bmap,
5069 enum isl_dim_type type, unsigned pos, int value, int upper)
5075 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
5076 pos += isl_basic_map_offset(bmap, type);
5077 bmap = isl_basic_map_cow(bmap);
5078 bmap = isl_basic_map_extend_constraints(bmap, 0, 1);
5079 j = isl_basic_map_alloc_inequality(bmap);
5082 isl_seq_clr(bmap->ineq[j], 1 + isl_basic_map_total_dim(bmap));
5084 isl_int_set_si(bmap->ineq[j][pos], -1);
5085 isl_int_set_si(bmap->ineq[j][0], value);
5087 isl_int_set_si(bmap->ineq[j][pos], 1);
5088 isl_int_set_si(bmap->ineq[j][0], -value);
5090 bmap = isl_basic_map_simplify(bmap);
5091 return isl_basic_map_finalize(bmap);
5093 isl_basic_map_free(bmap);
5097 __isl_give isl_basic_map *isl_basic_map_lower_bound_si(
5098 __isl_take isl_basic_map *bmap,
5099 enum isl_dim_type type, unsigned pos, int value)
5101 return basic_map_bound_si(bmap, type, pos, value, 0);
5104 struct isl_basic_set *isl_basic_set_lower_bound_dim(struct isl_basic_set *bset,
5105 unsigned dim, isl_int value)
5109 bset = isl_basic_set_cow(bset);
5110 bset = isl_basic_set_extend_constraints(bset, 0, 1);
5111 j = isl_basic_set_alloc_inequality(bset);
5114 isl_seq_clr(bset->ineq[j], 1 + isl_basic_set_total_dim(bset));
5115 isl_int_set_si(bset->ineq[j][1 + isl_basic_set_n_param(bset) + dim], 1);
5116 isl_int_neg(bset->ineq[j][0], value);
5117 bset = isl_basic_set_simplify(bset);
5118 return isl_basic_set_finalize(bset);
5120 isl_basic_set_free(bset);
5124 static __isl_give isl_map *map_bound_si(__isl_take isl_map *map,
5125 enum isl_dim_type type, unsigned pos, int value, int upper)
5129 map = isl_map_cow(map);
5133 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
5134 for (i = 0; i < map->n; ++i) {
5135 map->p[i] = basic_map_bound_si(map->p[i],
5136 type, pos, value, upper);
5140 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
5147 __isl_give isl_map *isl_map_lower_bound_si(__isl_take isl_map *map,
5148 enum isl_dim_type type, unsigned pos, int value)
5150 return map_bound_si(map, type, pos, value, 0);
5153 __isl_give isl_map *isl_map_upper_bound_si(__isl_take isl_map *map,
5154 enum isl_dim_type type, unsigned pos, int value)
5156 return map_bound_si(map, type, pos, value, 1);
5159 __isl_give isl_set *isl_set_lower_bound_si(__isl_take isl_set *set,
5160 enum isl_dim_type type, unsigned pos, int value)
5162 return (struct isl_set *)
5163 isl_map_lower_bound_si((struct isl_map *)set, type, pos, value);
5166 __isl_give isl_set *isl_set_upper_bound_si(__isl_take isl_set *set,
5167 enum isl_dim_type type, unsigned pos, int value)
5169 return isl_map_upper_bound_si(set, type, pos, value);
5172 /* Bound the given variable of "bmap" from below (or above is "upper"
5173 * is set) to "value".
5175 static __isl_give isl_basic_map *basic_map_bound(
5176 __isl_take isl_basic_map *bmap,
5177 enum isl_dim_type type, unsigned pos, isl_int value, int upper)
5183 if (pos >= isl_basic_map_dim(bmap, type))
5184 isl_die(bmap->ctx, isl_error_invalid,
5185 "index out of bounds", goto error);
5186 pos += isl_basic_map_offset(bmap, type);
5187 bmap = isl_basic_map_cow(bmap);
5188 bmap = isl_basic_map_extend_constraints(bmap, 0, 1);
5189 j = isl_basic_map_alloc_inequality(bmap);
5192 isl_seq_clr(bmap->ineq[j], 1 + isl_basic_map_total_dim(bmap));
5194 isl_int_set_si(bmap->ineq[j][pos], -1);
5195 isl_int_set(bmap->ineq[j][0], value);
5197 isl_int_set_si(bmap->ineq[j][pos], 1);
5198 isl_int_neg(bmap->ineq[j][0], value);
5200 bmap = isl_basic_map_simplify(bmap);
5201 return isl_basic_map_finalize(bmap);
5203 isl_basic_map_free(bmap);
5207 /* Bound the given variable of "map" from below (or above is "upper"
5208 * is set) to "value".
5210 static __isl_give isl_map *map_bound(__isl_take isl_map *map,
5211 enum isl_dim_type type, unsigned pos, isl_int value, int upper)
5215 map = isl_map_cow(map);
5219 if (pos >= isl_map_dim(map, type))
5220 isl_die(map->ctx, isl_error_invalid,
5221 "index out of bounds", goto error);
5222 for (i = map->n - 1; i >= 0; --i) {
5223 map->p[i] = basic_map_bound(map->p[i], type, pos, value, upper);
5224 if (remove_if_empty(map, i) < 0)
5227 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
5234 __isl_give isl_map *isl_map_lower_bound(__isl_take isl_map *map,
5235 enum isl_dim_type type, unsigned pos, isl_int value)
5237 return map_bound(map, type, pos, value, 0);
5240 __isl_give isl_map *isl_map_upper_bound(__isl_take isl_map *map,
5241 enum isl_dim_type type, unsigned pos, isl_int value)
5243 return map_bound(map, type, pos, value, 1);
5246 __isl_give isl_set *isl_set_lower_bound(__isl_take isl_set *set,
5247 enum isl_dim_type type, unsigned pos, isl_int value)
5249 return isl_map_lower_bound(set, type, pos, value);
5252 __isl_give isl_set *isl_set_upper_bound(__isl_take isl_set *set,
5253 enum isl_dim_type type, unsigned pos, isl_int value)
5255 return isl_map_upper_bound(set, type, pos, value);
5258 struct isl_set *isl_set_lower_bound_dim(struct isl_set *set, unsigned dim,
5263 set = isl_set_cow(set);
5267 isl_assert(set->ctx, dim < isl_set_n_dim(set), goto error);
5268 for (i = 0; i < set->n; ++i) {
5269 set->p[i] = isl_basic_set_lower_bound_dim(set->p[i], dim, value);
5279 struct isl_map *isl_map_reverse(struct isl_map *map)
5283 map = isl_map_cow(map);
5287 map->dim = isl_space_reverse(map->dim);
5290 for (i = 0; i < map->n; ++i) {
5291 map->p[i] = isl_basic_map_reverse(map->p[i]);
5295 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
5302 static struct isl_map *isl_basic_map_partial_lexopt(
5303 struct isl_basic_map *bmap, struct isl_basic_set *dom,
5304 struct isl_set **empty, int max)
5308 if (bmap->ctx->opt->pip == ISL_PIP_PIP)
5309 return isl_pip_basic_map_lexopt(bmap, dom, empty, max);
5311 return isl_tab_basic_map_partial_lexopt(bmap, dom, empty, max);
5313 isl_basic_map_free(bmap);
5314 isl_basic_set_free(dom);
5320 struct isl_map *isl_basic_map_partial_lexmax(
5321 struct isl_basic_map *bmap, struct isl_basic_set *dom,
5322 struct isl_set **empty)
5324 return isl_basic_map_partial_lexopt(bmap, dom, empty, 1);
5327 struct isl_map *isl_basic_map_partial_lexmin(
5328 struct isl_basic_map *bmap, struct isl_basic_set *dom,
5329 struct isl_set **empty)
5331 return isl_basic_map_partial_lexopt(bmap, dom, empty, 0);
5334 struct isl_set *isl_basic_set_partial_lexmin(
5335 struct isl_basic_set *bset, struct isl_basic_set *dom,
5336 struct isl_set **empty)
5338 return (struct isl_set *)
5339 isl_basic_map_partial_lexmin((struct isl_basic_map *)bset,
5343 struct isl_set *isl_basic_set_partial_lexmax(
5344 struct isl_basic_set *bset, struct isl_basic_set *dom,
5345 struct isl_set **empty)
5347 return (struct isl_set *)
5348 isl_basic_map_partial_lexmax((struct isl_basic_map *)bset,
5352 __isl_give isl_pw_multi_aff *isl_basic_map_partial_lexmin_pw_multi_aff(
5353 __isl_take isl_basic_map *bmap, __isl_take isl_basic_set *dom,
5354 __isl_give isl_set **empty)
5356 return isl_basic_map_partial_lexopt_pw_multi_aff(bmap, dom, empty, 0);
5359 __isl_give isl_pw_multi_aff *isl_basic_map_partial_lexmax_pw_multi_aff(
5360 __isl_take isl_basic_map *bmap, __isl_take isl_basic_set *dom,
5361 __isl_give isl_set **empty)
5363 return isl_basic_map_partial_lexopt_pw_multi_aff(bmap, dom, empty, 1);
5366 __isl_give isl_pw_multi_aff *isl_basic_set_partial_lexmin_pw_multi_aff(
5367 __isl_take isl_basic_set *bset, __isl_take isl_basic_set *dom,
5368 __isl_give isl_set **empty)
5370 return isl_basic_map_partial_lexmin_pw_multi_aff(bset, dom, empty);
5373 __isl_give isl_pw_multi_aff *isl_basic_set_partial_lexmax_pw_multi_aff(
5374 __isl_take isl_basic_set *bset, __isl_take isl_basic_set *dom,
5375 __isl_give isl_set **empty)
5377 return isl_basic_map_partial_lexmax_pw_multi_aff(bset, dom, empty);
5380 __isl_give isl_pw_multi_aff *isl_basic_map_lexopt_pw_multi_aff(
5381 __isl_take isl_basic_map *bmap, int max)
5383 isl_basic_set *dom = NULL;
5384 isl_space *dom_space;
5388 dom_space = isl_space_domain(isl_space_copy(bmap->dim));
5389 dom = isl_basic_set_universe(dom_space);
5390 return isl_basic_map_partial_lexopt_pw_multi_aff(bmap, dom, NULL, max);
5392 isl_basic_map_free(bmap);
5396 __isl_give isl_pw_multi_aff *isl_basic_map_lexmin_pw_multi_aff(
5397 __isl_take isl_basic_map *bmap)
5399 return isl_basic_map_lexopt_pw_multi_aff(bmap, 0);
5402 /* Given a basic map "bmap", compute the lexicographically minimal
5403 * (or maximal) image element for each domain element in dom.
5404 * Set *empty to those elements in dom that do not have an image element.
5406 * We first make sure the basic sets in dom are disjoint and then
5407 * simply collect the results over each of the basic sets separately.
5408 * We could probably improve the efficiency a bit by moving the union
5409 * domain down into the parametric integer programming.
5411 static __isl_give isl_map *basic_map_partial_lexopt(
5412 __isl_take isl_basic_map *bmap, __isl_take isl_set *dom,
5413 __isl_give isl_set **empty, int max)
5416 struct isl_map *res;
5418 dom = isl_set_make_disjoint(dom);
5422 if (isl_set_plain_is_empty(dom)) {
5423 res = isl_map_empty_like_basic_map(bmap);
5424 *empty = isl_set_empty_like(dom);
5426 isl_basic_map_free(bmap);
5430 res = isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap),
5431 isl_basic_set_copy(dom->p[0]), empty, max);
5433 for (i = 1; i < dom->n; ++i) {
5434 struct isl_map *res_i;
5435 struct isl_set *empty_i;
5437 res_i = isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap),
5438 isl_basic_set_copy(dom->p[i]), &empty_i, max);
5440 res = isl_map_union_disjoint(res, res_i);
5441 *empty = isl_set_union_disjoint(*empty, empty_i);
5445 isl_basic_map_free(bmap);
5450 isl_basic_map_free(bmap);
5454 /* Given a map "map", compute the lexicographically minimal
5455 * (or maximal) image element for each domain element in dom.
5456 * Set *empty to those elements in dom that do not have an image element.
5458 * We first compute the lexicographically minimal or maximal element
5459 * in the first basic map. This results in a partial solution "res"
5460 * and a subset "todo" of dom that still need to be handled.
5461 * We then consider each of the remaining maps in "map" and successively
5462 * improve both "res" and "todo".
5464 * Let res^k and todo^k be the results after k steps and let i = k + 1.
5465 * Assume we are computing the lexicographical maximum.
5466 * We first compute the lexicographically maximal element in basic map i.
5467 * This results in a partial solution res_i and a subset todo_i.
5468 * Then we combine these results with those obtain for the first k basic maps
5469 * to obtain a result that is valid for the first k+1 basic maps.
5470 * In particular, the set where there is no solution is the set where
5471 * there is no solution for the first k basic maps and also no solution
5472 * for the ith basic map, i.e.,
5474 * todo^i = todo^k * todo_i
5476 * On dom(res^k) * dom(res_i), we need to pick the larger of the two
5477 * solutions, arbitrarily breaking ties in favor of res^k.
5478 * That is, when res^k(a) >= res_i(a), we pick res^k and
5479 * when res^k(a) < res_i(a), we pick res_i. (Here, ">=" and "<" denote
5480 * the lexicographic order.)
5481 * In practice, we compute
5483 * res^k * (res_i . "<=")
5487 * res_i * (res^k . "<")
5489 * Finally, we consider the symmetric difference of dom(res^k) and dom(res_i),
5490 * where only one of res^k and res_i provides a solution and we simply pick
5497 * Note that we only compute these intersections when dom(res^k) intersects
5498 * dom(res_i). Otherwise, the only effect of these intersections is to
5499 * potentially break up res^k and res_i into smaller pieces.
5500 * We want to avoid such splintering as much as possible.
5501 * In fact, an earlier implementation of this function would look for
5502 * better results in the domain of res^k and for extra results in todo^k,
5503 * but this would always result in a splintering according to todo^k,
5504 * even when the domain of basic map i is disjoint from the domains of
5505 * the previous basic maps.
5507 static __isl_give isl_map *isl_map_partial_lexopt_aligned(
5508 __isl_take isl_map *map, __isl_take isl_set *dom,
5509 __isl_give isl_set **empty, int max)
5512 struct isl_map *res;
5513 struct isl_set *todo;
5518 if (isl_map_plain_is_empty(map)) {
5526 res = basic_map_partial_lexopt(isl_basic_map_copy(map->p[0]),
5527 isl_set_copy(dom), &todo, max);
5529 for (i = 1; i < map->n; ++i) {
5533 isl_space *dim = isl_space_range(isl_map_get_space(res));
5535 res_i = basic_map_partial_lexopt(isl_basic_map_copy(map->p[i]),
5536 isl_set_copy(dom), &todo_i, max);
5539 lt = isl_map_lex_lt(isl_space_copy(dim));
5540 le = isl_map_lex_le(dim);
5542 lt = isl_map_lex_gt(isl_space_copy(dim));
5543 le = isl_map_lex_ge(dim);
5545 lt = isl_map_apply_range(isl_map_copy(res), lt);
5546 lt = isl_map_intersect(lt, isl_map_copy(res_i));
5547 le = isl_map_apply_range(isl_map_copy(res_i), le);
5548 le = isl_map_intersect(le, isl_map_copy(res));
5550 if (!isl_map_is_empty(lt) || !isl_map_is_empty(le)) {
5551 res = isl_map_intersect_domain(res,
5552 isl_set_copy(todo_i));
5553 res_i = isl_map_intersect_domain(res_i,
5554 isl_set_copy(todo));
5557 res = isl_map_union_disjoint(res, res_i);
5558 res = isl_map_union_disjoint(res, lt);
5559 res = isl_map_union_disjoint(res, le);
5561 todo = isl_set_intersect(todo, todo_i);
5581 /* Given a map "map", compute the lexicographically minimal
5582 * (or maximal) image element for each domain element in dom.
5583 * Set *empty to those elements in dom that do not have an image element.
5585 * Align parameters if needed and then call isl_map_partial_lexopt_aligned.
5587 static __isl_give isl_map *isl_map_partial_lexopt(
5588 __isl_take isl_map *map, __isl_take isl_set *dom,
5589 __isl_give isl_set **empty, int max)
5593 if (isl_space_match(map->dim, isl_dim_param, dom->dim, isl_dim_param))
5594 return isl_map_partial_lexopt_aligned(map, dom, empty, max);
5595 if (!isl_space_has_named_params(map->dim) ||
5596 !isl_space_has_named_params(dom->dim))
5597 isl_die(map->ctx, isl_error_invalid,
5598 "unaligned unnamed parameters", goto error);
5599 map = isl_map_align_params(map, isl_map_get_space(dom));
5600 dom = isl_map_align_params(dom, isl_map_get_space(map));
5601 return isl_map_partial_lexopt_aligned(map, dom, empty, max);
5610 __isl_give isl_map *isl_map_partial_lexmax(
5611 __isl_take isl_map *map, __isl_take isl_set *dom,
5612 __isl_give isl_set **empty)
5614 return isl_map_partial_lexopt(map, dom, empty, 1);
5617 __isl_give isl_map *isl_map_partial_lexmin(
5618 __isl_take isl_map *map, __isl_take isl_set *dom,
5619 __isl_give isl_set **empty)
5621 return isl_map_partial_lexopt(map, dom, empty, 0);
5624 __isl_give isl_set *isl_set_partial_lexmin(
5625 __isl_take isl_set *set, __isl_take isl_set *dom,
5626 __isl_give isl_set **empty)
5628 return (struct isl_set *)
5629 isl_map_partial_lexmin((struct isl_map *)set,
5633 __isl_give isl_set *isl_set_partial_lexmax(
5634 __isl_take isl_set *set, __isl_take isl_set *dom,
5635 __isl_give isl_set **empty)
5637 return (struct isl_set *)
5638 isl_map_partial_lexmax((struct isl_map *)set,
5642 __isl_give isl_map *isl_basic_map_lexopt(__isl_take isl_basic_map *bmap, int max)
5644 struct isl_basic_set *dom = NULL;
5649 dom_dim = isl_space_domain(isl_space_copy(bmap->dim));
5650 dom = isl_basic_set_universe(dom_dim);
5651 return isl_basic_map_partial_lexopt(bmap, dom, NULL, max);
5653 isl_basic_map_free(bmap);
5657 __isl_give isl_map *isl_basic_map_lexmin(__isl_take isl_basic_map *bmap)
5659 return isl_basic_map_lexopt(bmap, 0);
5662 __isl_give isl_map *isl_basic_map_lexmax(__isl_take isl_basic_map *bmap)
5664 return isl_basic_map_lexopt(bmap, 1);
5667 __isl_give isl_set *isl_basic_set_lexmin(__isl_take isl_basic_set *bset)
5669 return (isl_set *)isl_basic_map_lexmin((isl_basic_map *)bset);
5672 __isl_give isl_set *isl_basic_set_lexmax(__isl_take isl_basic_set *bset)
5674 return (isl_set *)isl_basic_map_lexmax((isl_basic_map *)bset);
5677 __isl_give isl_map *isl_map_lexopt(__isl_take isl_map *map, int max)
5679 struct isl_set *dom = NULL;
5684 dom_dim = isl_space_domain(isl_space_copy(map->dim));
5685 dom = isl_set_universe(dom_dim);
5686 return isl_map_partial_lexopt(map, dom, NULL, max);
5692 __isl_give isl_map *isl_map_lexmin(__isl_take isl_map *map)
5694 return isl_map_lexopt(map, 0);
5697 __isl_give isl_map *isl_map_lexmax(__isl_take isl_map *map)
5699 return isl_map_lexopt(map, 1);
5702 __isl_give isl_set *isl_set_lexmin(__isl_take isl_set *set)
5704 return (isl_set *)isl_map_lexmin((isl_map *)set);
5707 __isl_give isl_set *isl_set_lexmax(__isl_take isl_set *set)
5709 return (isl_set *)isl_map_lexmax((isl_map *)set);
5712 /* Extract the first and only affine expression from list
5713 * and then add it to *pwaff with the given dom.
5714 * This domain is known to be disjoint from other domains
5715 * because of the way isl_basic_map_foreach_lexmax works.
5717 static int update_dim_opt(__isl_take isl_basic_set *dom,
5718 __isl_take isl_aff_list *list, void *user)
5720 isl_ctx *ctx = isl_basic_set_get_ctx(dom);
5722 isl_pw_aff **pwaff = user;
5723 isl_pw_aff *pwaff_i;
5725 if (isl_aff_list_n_aff(list) != 1)
5726 isl_die(ctx, isl_error_internal,
5727 "expecting single element list", goto error);
5729 aff = isl_aff_list_get_aff(list, 0);
5730 pwaff_i = isl_pw_aff_alloc(isl_set_from_basic_set(dom), aff);
5732 *pwaff = isl_pw_aff_add_disjoint(*pwaff, pwaff_i);
5734 isl_aff_list_free(list);
5738 isl_basic_set_free(dom);
5739 isl_aff_list_free(list);
5743 /* Given a basic map with one output dimension, compute the minimum or
5744 * maximum of that dimension as an isl_pw_aff.
5746 * The isl_pw_aff is constructed by having isl_basic_map_foreach_lexopt
5747 * call update_dim_opt on each leaf of the result.
5749 static __isl_give isl_pw_aff *basic_map_dim_opt(__isl_keep isl_basic_map *bmap,
5752 isl_space *dim = isl_basic_map_get_space(bmap);
5756 dim = isl_space_from_domain(isl_space_domain(dim));
5757 dim = isl_space_add_dims(dim, isl_dim_out, 1);
5758 pwaff = isl_pw_aff_empty(dim);
5760 r = isl_basic_map_foreach_lexopt(bmap, max, &update_dim_opt, &pwaff);
5762 return isl_pw_aff_free(pwaff);
5767 /* Compute the minimum or maximum of the given output dimension
5768 * as a function of the parameters and the input dimensions,
5769 * but independently of the other output dimensions.
5771 * We first project out the other output dimension and then compute
5772 * the "lexicographic" maximum in each basic map, combining the results
5773 * using isl_pw_aff_union_max.
5775 static __isl_give isl_pw_aff *map_dim_opt(__isl_take isl_map *map, int pos,
5782 n_out = isl_map_dim(map, isl_dim_out);
5783 map = isl_map_project_out(map, isl_dim_out, pos + 1, n_out - (pos + 1));
5784 map = isl_map_project_out(map, isl_dim_out, 0, pos);
5789 isl_space *dim = isl_map_get_space(map);
5790 dim = isl_space_domain(isl_space_from_range(dim));
5792 return isl_pw_aff_empty(dim);
5795 pwaff = basic_map_dim_opt(map->p[0], max);
5796 for (i = 1; i < map->n; ++i) {
5797 isl_pw_aff *pwaff_i;
5799 pwaff_i = basic_map_dim_opt(map->p[i], max);
5800 pwaff = isl_pw_aff_union_opt(pwaff, pwaff_i, max);
5808 /* Compute the maximum of the given output dimension as a function of the
5809 * parameters and input dimensions, but independently of
5810 * the other output dimensions.
5812 __isl_give isl_pw_aff *isl_map_dim_max(__isl_take isl_map *map, int pos)
5814 return map_dim_opt(map, pos, 1);
5817 /* Compute the minimum or maximum of the given set dimension
5818 * as a function of the parameters,
5819 * but independently of the other set dimensions.
5821 static __isl_give isl_pw_aff *set_dim_opt(__isl_take isl_set *set, int pos,
5824 return map_dim_opt(set, pos, max);
5827 /* Compute the maximum of the given set dimension as a function of the
5828 * parameters, but independently of the other set dimensions.
5830 __isl_give isl_pw_aff *isl_set_dim_max(__isl_take isl_set *set, int pos)
5832 return set_dim_opt(set, pos, 1);
5835 /* Compute the minimum of the given set dimension as a function of the
5836 * parameters, but independently of the other set dimensions.
5838 __isl_give isl_pw_aff *isl_set_dim_min(__isl_take isl_set *set, int pos)
5840 return set_dim_opt(set, pos, 0);
5843 /* Apply a preimage specified by "mat" on the parameters of "bset".
5844 * bset is assumed to have only parameters and divs.
5846 static struct isl_basic_set *basic_set_parameter_preimage(
5847 struct isl_basic_set *bset, struct isl_mat *mat)
5854 bset->dim = isl_space_cow(bset->dim);
5858 nparam = isl_basic_set_dim(bset, isl_dim_param);
5860 isl_assert(bset->ctx, mat->n_row == 1 + nparam, goto error);
5862 bset->dim->nparam = 0;
5863 bset->dim->n_out = nparam;
5864 bset = isl_basic_set_preimage(bset, mat);
5866 bset->dim->nparam = bset->dim->n_out;
5867 bset->dim->n_out = 0;
5872 isl_basic_set_free(bset);
5876 /* Apply a preimage specified by "mat" on the parameters of "set".
5877 * set is assumed to have only parameters and divs.
5879 static struct isl_set *set_parameter_preimage(
5880 struct isl_set *set, struct isl_mat *mat)
5882 isl_space *dim = NULL;
5888 dim = isl_space_copy(set->dim);
5889 dim = isl_space_cow(dim);
5893 nparam = isl_set_dim(set, isl_dim_param);
5895 isl_assert(set->ctx, mat->n_row == 1 + nparam, goto error);
5898 dim->n_out = nparam;
5899 isl_set_reset_space(set, dim);
5900 set = isl_set_preimage(set, mat);
5903 dim = isl_space_copy(set->dim);
5904 dim = isl_space_cow(dim);
5907 dim->nparam = dim->n_out;
5909 isl_set_reset_space(set, dim);
5912 isl_space_free(dim);
5919 /* Intersect the basic set "bset" with the affine space specified by the
5920 * equalities in "eq".
5922 static struct isl_basic_set *basic_set_append_equalities(
5923 struct isl_basic_set *bset, struct isl_mat *eq)
5931 bset = isl_basic_set_extend_space(bset, isl_space_copy(bset->dim), 0,
5936 len = 1 + isl_space_dim(bset->dim, isl_dim_all) + bset->extra;
5937 for (i = 0; i < eq->n_row; ++i) {
5938 k = isl_basic_set_alloc_equality(bset);
5941 isl_seq_cpy(bset->eq[k], eq->row[i], eq->n_col);
5942 isl_seq_clr(bset->eq[k] + eq->n_col, len - eq->n_col);
5946 bset = isl_basic_set_gauss(bset, NULL);
5947 bset = isl_basic_set_finalize(bset);
5952 isl_basic_set_free(bset);
5956 /* Intersect the set "set" with the affine space specified by the
5957 * equalities in "eq".
5959 static struct isl_set *set_append_equalities(struct isl_set *set,
5967 for (i = 0; i < set->n; ++i) {
5968 set->p[i] = basic_set_append_equalities(set->p[i],
5981 /* Project the given basic set onto its parameter domain, possibly introducing
5982 * new, explicit, existential variables in the constraints.
5983 * The input has parameters and (possibly implicit) existential variables.
5984 * The output has the same parameters, but only
5985 * explicit existentially quantified variables.
5987 * The actual projection is performed by pip, but pip doesn't seem
5988 * to like equalities very much, so we first remove the equalities
5989 * among the parameters by performing a variable compression on
5990 * the parameters. Afterward, an inverse transformation is performed
5991 * and the equalities among the parameters are inserted back in.
5993 static struct isl_set *parameter_compute_divs(struct isl_basic_set *bset)
5997 struct isl_mat *T, *T2;
5998 struct isl_set *set;
5999 unsigned nparam, n_div;
6001 bset = isl_basic_set_cow(bset);
6005 if (bset->n_eq == 0)
6006 return isl_basic_set_lexmin(bset);
6008 isl_basic_set_gauss(bset, NULL);
6010 nparam = isl_basic_set_dim(bset, isl_dim_param);
6011 n_div = isl_basic_set_dim(bset, isl_dim_div);
6013 for (i = 0, j = n_div - 1; i < bset->n_eq && j >= 0; --j) {
6014 if (!isl_int_is_zero(bset->eq[i][1 + nparam + j]))
6017 if (i == bset->n_eq)
6018 return isl_basic_set_lexmin(bset);
6020 eq = isl_mat_sub_alloc6(bset->ctx, bset->eq, i, bset->n_eq - i,
6022 eq = isl_mat_cow(eq);
6023 T = isl_mat_variable_compression(isl_mat_copy(eq), &T2);
6024 if (T && T->n_col == 0) {
6028 bset = isl_basic_set_set_to_empty(bset);
6029 return isl_set_from_basic_set(bset);
6031 bset = basic_set_parameter_preimage(bset, T);
6033 set = isl_basic_set_lexmin(bset);
6034 set = set_parameter_preimage(set, T2);
6035 set = set_append_equalities(set, eq);
6039 /* Compute an explicit representation for all the existentially
6040 * quantified variables.
6041 * The input and output dimensions are first turned into parameters.
6042 * compute_divs then returns a map with the same parameters and
6043 * no input or output dimensions and the dimension specification
6044 * is reset to that of the input.
6046 static struct isl_map *compute_divs(struct isl_basic_map *bmap)
6048 struct isl_basic_set *bset;
6049 struct isl_set *set;
6050 struct isl_map *map;
6051 isl_space *dim, *orig_dim = NULL;
6056 bmap = isl_basic_map_cow(bmap);
6060 nparam = isl_basic_map_dim(bmap, isl_dim_param);
6061 n_in = isl_basic_map_dim(bmap, isl_dim_in);
6062 n_out = isl_basic_map_dim(bmap, isl_dim_out);
6063 dim = isl_space_set_alloc(bmap->ctx, nparam + n_in + n_out, 0);
6067 orig_dim = bmap->dim;
6069 bset = (struct isl_basic_set *)bmap;
6071 set = parameter_compute_divs(bset);
6072 map = (struct isl_map *)set;
6073 map = isl_map_reset_space(map, orig_dim);
6077 isl_basic_map_free(bmap);
6081 int isl_basic_map_divs_known(__isl_keep isl_basic_map *bmap)
6089 off = isl_space_dim(bmap->dim, isl_dim_all);
6090 for (i = 0; i < bmap->n_div; ++i) {
6091 if (isl_int_is_zero(bmap->div[i][0]))
6093 isl_assert(bmap->ctx, isl_int_is_zero(bmap->div[i][1+1+off+i]),
6099 static int map_divs_known(__isl_keep isl_map *map)
6106 for (i = 0; i < map->n; ++i) {
6107 int known = isl_basic_map_divs_known(map->p[i]);
6115 /* If bmap contains any unknown divs, then compute explicit
6116 * expressions for them. However, this computation may be
6117 * quite expensive, so first try to remove divs that aren't
6120 struct isl_map *isl_basic_map_compute_divs(struct isl_basic_map *bmap)
6123 struct isl_map *map;
6125 known = isl_basic_map_divs_known(bmap);
6129 return isl_map_from_basic_map(bmap);
6131 bmap = isl_basic_map_drop_redundant_divs(bmap);
6133 known = isl_basic_map_divs_known(bmap);
6137 return isl_map_from_basic_map(bmap);
6139 map = compute_divs(bmap);
6142 isl_basic_map_free(bmap);
6146 struct isl_map *isl_map_compute_divs(struct isl_map *map)
6150 struct isl_map *res;
6157 known = map_divs_known(map);
6165 res = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[0]));
6166 for (i = 1 ; i < map->n; ++i) {
6168 r2 = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[i]));
6169 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT))
6170 res = isl_map_union_disjoint(res, r2);
6172 res = isl_map_union(res, r2);
6179 struct isl_set *isl_basic_set_compute_divs(struct isl_basic_set *bset)
6181 return (struct isl_set *)
6182 isl_basic_map_compute_divs((struct isl_basic_map *)bset);
6185 struct isl_set *isl_set_compute_divs(struct isl_set *set)
6187 return (struct isl_set *)
6188 isl_map_compute_divs((struct isl_map *)set);
6191 struct isl_set *isl_map_domain(struct isl_map *map)
6194 struct isl_set *set;
6199 map = isl_map_cow(map);
6203 set = (struct isl_set *)map;
6204 set->dim = isl_space_domain(set->dim);
6207 for (i = 0; i < map->n; ++i) {
6208 set->p[i] = isl_basic_map_domain(map->p[i]);
6212 ISL_F_CLR(set, ISL_MAP_DISJOINT);
6213 ISL_F_CLR(set, ISL_SET_NORMALIZED);
6220 static __isl_give isl_map *map_union_disjoint(__isl_take isl_map *map1,
6221 __isl_take isl_map *map2)
6225 struct isl_map *map = NULL;
6239 isl_assert(map1->ctx, isl_space_is_equal(map1->dim, map2->dim), goto error);
6241 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
6242 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
6243 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
6245 map = isl_map_alloc_space(isl_space_copy(map1->dim),
6246 map1->n + map2->n, flags);
6249 for (i = 0; i < map1->n; ++i) {
6250 map = isl_map_add_basic_map(map,
6251 isl_basic_map_copy(map1->p[i]));
6255 for (i = 0; i < map2->n; ++i) {
6256 map = isl_map_add_basic_map(map,
6257 isl_basic_map_copy(map2->p[i]));
6271 __isl_give isl_map *isl_map_union_disjoint(__isl_take isl_map *map1,
6272 __isl_take isl_map *map2)
6274 return isl_map_align_params_map_map_and(map1, map2, &map_union_disjoint);
6277 struct isl_map *isl_map_union(struct isl_map *map1, struct isl_map *map2)
6279 map1 = isl_map_union_disjoint(map1, map2);
6283 ISL_F_CLR(map1, ISL_MAP_DISJOINT);
6287 struct isl_set *isl_set_union_disjoint(
6288 struct isl_set *set1, struct isl_set *set2)
6290 return (struct isl_set *)
6291 isl_map_union_disjoint(
6292 (struct isl_map *)set1, (struct isl_map *)set2);
6295 struct isl_set *isl_set_union(struct isl_set *set1, struct isl_set *set2)
6297 return (struct isl_set *)
6298 isl_map_union((struct isl_map *)set1, (struct isl_map *)set2);
6301 static __isl_give isl_map *map_intersect_range(__isl_take isl_map *map,
6302 __isl_take isl_set *set)
6305 struct isl_map *result;
6311 if (!isl_space_match(map->dim, isl_dim_param, set->dim, isl_dim_param))
6312 isl_die(set->ctx, isl_error_invalid,
6313 "parameters don't match", goto error);
6315 if (isl_space_dim(set->dim, isl_dim_set) != 0 &&
6316 !isl_map_compatible_range(map, set))
6317 isl_die(set->ctx, isl_error_invalid,
6318 "incompatible spaces", goto error);
6320 if (isl_set_plain_is_universe(set)) {
6325 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT) &&
6326 ISL_F_ISSET(set, ISL_MAP_DISJOINT))
6327 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
6329 result = isl_map_alloc_space(isl_space_copy(map->dim),
6330 map->n * set->n, flags);
6333 for (i = 0; i < map->n; ++i)
6334 for (j = 0; j < set->n; ++j) {
6335 result = isl_map_add_basic_map(result,
6336 isl_basic_map_intersect_range(
6337 isl_basic_map_copy(map->p[i]),
6338 isl_basic_set_copy(set->p[j])));
6351 __isl_give isl_map *isl_map_intersect_range(__isl_take isl_map *map,
6352 __isl_take isl_set *set)
6354 return isl_map_align_params_map_map_and(map, set, &map_intersect_range);
6357 struct isl_map *isl_map_intersect_domain(
6358 struct isl_map *map, struct isl_set *set)
6360 return isl_map_reverse(
6361 isl_map_intersect_range(isl_map_reverse(map), set));
6364 static __isl_give isl_map *map_apply_domain(__isl_take isl_map *map1,
6365 __isl_take isl_map *map2)
6369 map1 = isl_map_reverse(map1);
6370 map1 = isl_map_apply_range(map1, map2);
6371 return isl_map_reverse(map1);
6378 __isl_give isl_map *isl_map_apply_domain(__isl_take isl_map *map1,
6379 __isl_take isl_map *map2)
6381 return isl_map_align_params_map_map_and(map1, map2, &map_apply_domain);
6384 static __isl_give isl_map *map_apply_range(__isl_take isl_map *map1,
6385 __isl_take isl_map *map2)
6387 isl_space *dim_result;
6388 struct isl_map *result;
6394 dim_result = isl_space_join(isl_space_copy(map1->dim),
6395 isl_space_copy(map2->dim));
6397 result = isl_map_alloc_space(dim_result, map1->n * map2->n, 0);
6400 for (i = 0; i < map1->n; ++i)
6401 for (j = 0; j < map2->n; ++j) {
6402 result = isl_map_add_basic_map(result,
6403 isl_basic_map_apply_range(
6404 isl_basic_map_copy(map1->p[i]),
6405 isl_basic_map_copy(map2->p[j])));
6411 if (result && result->n <= 1)
6412 ISL_F_SET(result, ISL_MAP_DISJOINT);
6420 __isl_give isl_map *isl_map_apply_range(__isl_take isl_map *map1,
6421 __isl_take isl_map *map2)
6423 return isl_map_align_params_map_map_and(map1, map2, &map_apply_range);
6427 * returns range - domain
6429 struct isl_basic_set *isl_basic_map_deltas(struct isl_basic_map *bmap)
6431 isl_space *dims, *target_dim;
6432 struct isl_basic_set *bset;
6439 isl_assert(bmap->ctx, isl_space_tuple_match(bmap->dim, isl_dim_in,
6440 bmap->dim, isl_dim_out),
6442 target_dim = isl_space_domain(isl_basic_map_get_space(bmap));
6443 dim = isl_basic_map_n_in(bmap);
6444 nparam = isl_basic_map_n_param(bmap);
6445 bset = isl_basic_set_from_basic_map(bmap);
6446 bset = isl_basic_set_cow(bset);
6447 dims = isl_basic_set_get_space(bset);
6448 dims = isl_space_add_dims(dims, isl_dim_set, dim);
6449 bset = isl_basic_set_extend_space(bset, dims, 0, dim, 0);
6450 bset = isl_basic_set_swap_vars(bset, 2*dim);
6451 for (i = 0; i < dim; ++i) {
6452 int j = isl_basic_map_alloc_equality(
6453 (struct isl_basic_map *)bset);
6456 isl_seq_clr(bset->eq[j], 1 + isl_basic_set_total_dim(bset));
6457 isl_int_set_si(bset->eq[j][1+nparam+i], 1);
6458 isl_int_set_si(bset->eq[j][1+nparam+dim+i], 1);
6459 isl_int_set_si(bset->eq[j][1+nparam+2*dim+i], -1);
6461 bset = isl_basic_set_project_out(bset, isl_dim_set, dim, 2*dim);
6462 bset = isl_basic_set_reset_space(bset, target_dim);
6465 isl_basic_map_free(bmap);
6470 * returns range - domain
6472 __isl_give isl_set *isl_map_deltas(__isl_take isl_map *map)
6476 struct isl_set *result;
6481 isl_assert(map->ctx, isl_space_tuple_match(map->dim, isl_dim_in,
6482 map->dim, isl_dim_out),
6484 dim = isl_map_get_space(map);
6485 dim = isl_space_domain(dim);
6486 result = isl_set_alloc_space(dim, map->n, 0);
6489 for (i = 0; i < map->n; ++i)
6490 result = isl_set_add_basic_set(result,
6491 isl_basic_map_deltas(isl_basic_map_copy(map->p[i])));
6500 * returns [domain -> range] -> range - domain
6502 __isl_give isl_basic_map *isl_basic_map_deltas_map(
6503 __isl_take isl_basic_map *bmap)
6507 isl_basic_map *domain;
6511 if (!isl_space_tuple_match(bmap->dim, isl_dim_in, bmap->dim, isl_dim_out))
6512 isl_die(bmap->ctx, isl_error_invalid,
6513 "domain and range don't match", goto error);
6515 nparam = isl_basic_map_dim(bmap, isl_dim_param);
6516 n = isl_basic_map_dim(bmap, isl_dim_in);
6518 dim = isl_space_from_range(isl_space_domain(isl_basic_map_get_space(bmap)));
6519 domain = isl_basic_map_universe(dim);
6521 bmap = isl_basic_map_from_domain(isl_basic_map_wrap(bmap));
6522 bmap = isl_basic_map_apply_range(bmap, domain);
6523 bmap = isl_basic_map_extend_constraints(bmap, n, 0);
6525 total = isl_basic_map_total_dim(bmap);
6527 for (i = 0; i < n; ++i) {
6528 k = isl_basic_map_alloc_equality(bmap);
6531 isl_seq_clr(bmap->eq[k], 1 + total);
6532 isl_int_set_si(bmap->eq[k][1 + nparam + i], 1);
6533 isl_int_set_si(bmap->eq[k][1 + nparam + n + i], -1);
6534 isl_int_set_si(bmap->eq[k][1 + nparam + n + n + i], 1);
6537 bmap = isl_basic_map_gauss(bmap, NULL);
6538 return isl_basic_map_finalize(bmap);
6540 isl_basic_map_free(bmap);
6545 * returns [domain -> range] -> range - domain
6547 __isl_give isl_map *isl_map_deltas_map(__isl_take isl_map *map)
6550 isl_space *domain_dim;
6555 if (!isl_space_tuple_match(map->dim, isl_dim_in, map->dim, isl_dim_out))
6556 isl_die(map->ctx, isl_error_invalid,
6557 "domain and range don't match", goto error);
6559 map = isl_map_cow(map);
6563 domain_dim = isl_space_from_range(isl_space_domain(isl_map_get_space(map)));
6564 map->dim = isl_space_from_domain(isl_space_wrap(map->dim));
6565 map->dim = isl_space_join(map->dim, domain_dim);
6568 for (i = 0; i < map->n; ++i) {
6569 map->p[i] = isl_basic_map_deltas_map(map->p[i]);
6573 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
6580 __isl_give struct isl_basic_map *basic_map_identity(__isl_take isl_space *dims)
6582 struct isl_basic_map *bmap;
6590 nparam = dims->nparam;
6592 bmap = isl_basic_map_alloc_space(dims, 0, dim, 0);
6596 for (i = 0; i < dim; ++i) {
6597 int j = isl_basic_map_alloc_equality(bmap);
6600 isl_seq_clr(bmap->eq[j], 1 + isl_basic_map_total_dim(bmap));
6601 isl_int_set_si(bmap->eq[j][1+nparam+i], 1);
6602 isl_int_set_si(bmap->eq[j][1+nparam+dim+i], -1);
6604 return isl_basic_map_finalize(bmap);
6606 isl_basic_map_free(bmap);
6610 __isl_give isl_basic_map *isl_basic_map_identity(__isl_take isl_space *dim)
6614 if (dim->n_in != dim->n_out)
6615 isl_die(dim->ctx, isl_error_invalid,
6616 "number of input and output dimensions needs to be "
6617 "the same", goto error);
6618 return basic_map_identity(dim);
6620 isl_space_free(dim);
6624 struct isl_basic_map *isl_basic_map_identity_like(struct isl_basic_map *model)
6626 if (!model || !model->dim)
6628 return isl_basic_map_identity(isl_space_copy(model->dim));
6631 __isl_give isl_map *isl_map_identity(__isl_take isl_space *dim)
6633 return isl_map_from_basic_map(isl_basic_map_identity(dim));
6636 struct isl_map *isl_map_identity_like(struct isl_map *model)
6638 if (!model || !model->dim)
6640 return isl_map_identity(isl_space_copy(model->dim));
6643 struct isl_map *isl_map_identity_like_basic_map(struct isl_basic_map *model)
6645 if (!model || !model->dim)
6647 return isl_map_identity(isl_space_copy(model->dim));
6650 __isl_give isl_map *isl_set_identity(__isl_take isl_set *set)
6652 isl_space *dim = isl_set_get_space(set);
6654 id = isl_map_identity(isl_space_map_from_set(dim));
6655 return isl_map_intersect_range(id, set);
6658 /* Construct a basic set with all set dimensions having only non-negative
6661 __isl_give isl_basic_set *isl_basic_set_positive_orthant(
6662 __isl_take isl_space *space)
6667 struct isl_basic_set *bset;
6671 nparam = space->nparam;
6673 bset = isl_basic_set_alloc_space(space, 0, 0, dim);
6676 for (i = 0; i < dim; ++i) {
6677 int k = isl_basic_set_alloc_inequality(bset);
6680 isl_seq_clr(bset->ineq[k], 1 + isl_basic_set_total_dim(bset));
6681 isl_int_set_si(bset->ineq[k][1 + nparam + i], 1);
6685 isl_basic_set_free(bset);
6689 /* Construct the half-space x_pos >= 0.
6691 static __isl_give isl_basic_set *nonneg_halfspace(__isl_take isl_space *dim,
6695 isl_basic_set *nonneg;
6697 nonneg = isl_basic_set_alloc_space(dim, 0, 0, 1);
6698 k = isl_basic_set_alloc_inequality(nonneg);
6701 isl_seq_clr(nonneg->ineq[k], 1 + isl_basic_set_total_dim(nonneg));
6702 isl_int_set_si(nonneg->ineq[k][pos], 1);
6704 return isl_basic_set_finalize(nonneg);
6706 isl_basic_set_free(nonneg);
6710 /* Construct the half-space x_pos <= -1.
6712 static __isl_give isl_basic_set *neg_halfspace(__isl_take isl_space *dim, int pos)
6717 neg = isl_basic_set_alloc_space(dim, 0, 0, 1);
6718 k = isl_basic_set_alloc_inequality(neg);
6721 isl_seq_clr(neg->ineq[k], 1 + isl_basic_set_total_dim(neg));
6722 isl_int_set_si(neg->ineq[k][0], -1);
6723 isl_int_set_si(neg->ineq[k][pos], -1);
6725 return isl_basic_set_finalize(neg);
6727 isl_basic_set_free(neg);
6731 __isl_give isl_set *isl_set_split_dims(__isl_take isl_set *set,
6732 enum isl_dim_type type, unsigned first, unsigned n)
6735 isl_basic_set *nonneg;
6743 isl_assert(set->ctx, first + n <= isl_set_dim(set, type), goto error);
6745 for (i = 0; i < n; ++i) {
6746 nonneg = nonneg_halfspace(isl_set_get_space(set),
6747 pos(set->dim, type) + first + i);
6748 neg = neg_halfspace(isl_set_get_space(set),
6749 pos(set->dim, type) + first + i);
6751 set = isl_set_intersect(set, isl_basic_set_union(nonneg, neg));
6760 static int foreach_orthant(__isl_take isl_set *set, int *signs, int first,
6761 int len, int (*fn)(__isl_take isl_set *orthant, int *signs, void *user),
6768 if (isl_set_plain_is_empty(set)) {
6773 return fn(set, signs, user);
6776 half = isl_set_from_basic_set(nonneg_halfspace(isl_set_get_space(set),
6778 half = isl_set_intersect(half, isl_set_copy(set));
6779 if (foreach_orthant(half, signs, first + 1, len, fn, user) < 0)
6783 half = isl_set_from_basic_set(neg_halfspace(isl_set_get_space(set),
6785 half = isl_set_intersect(half, set);
6786 return foreach_orthant(half, signs, first + 1, len, fn, user);
6792 /* Call "fn" on the intersections of "set" with each of the orthants
6793 * (except for obviously empty intersections). The orthant is identified
6794 * by the signs array, with each entry having value 1 or -1 according
6795 * to the sign of the corresponding variable.
6797 int isl_set_foreach_orthant(__isl_keep isl_set *set,
6798 int (*fn)(__isl_take isl_set *orthant, int *signs, void *user),
6808 if (isl_set_plain_is_empty(set))
6811 nparam = isl_set_dim(set, isl_dim_param);
6812 nvar = isl_set_dim(set, isl_dim_set);
6814 signs = isl_alloc_array(set->ctx, int, nparam + nvar);
6816 r = foreach_orthant(isl_set_copy(set), signs, 0, nparam + nvar,
6824 int isl_set_is_equal(struct isl_set *set1, struct isl_set *set2)
6826 return isl_map_is_equal((struct isl_map *)set1, (struct isl_map *)set2);
6829 int isl_basic_map_is_subset(
6830 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
6833 struct isl_map *map1;
6834 struct isl_map *map2;
6836 if (!bmap1 || !bmap2)
6839 map1 = isl_map_from_basic_map(isl_basic_map_copy(bmap1));
6840 map2 = isl_map_from_basic_map(isl_basic_map_copy(bmap2));
6842 is_subset = isl_map_is_subset(map1, map2);
6850 int isl_basic_set_is_subset(__isl_keep isl_basic_set *bset1,
6851 __isl_keep isl_basic_set *bset2)
6853 return isl_basic_map_is_subset(bset1, bset2);
6856 int isl_basic_map_is_equal(
6857 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
6861 if (!bmap1 || !bmap2)
6863 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
6866 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
6870 int isl_basic_set_is_equal(
6871 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
6873 return isl_basic_map_is_equal(
6874 (struct isl_basic_map *)bset1, (struct isl_basic_map *)bset2);
6877 int isl_map_is_empty(struct isl_map *map)
6884 for (i = 0; i < map->n; ++i) {
6885 is_empty = isl_basic_map_is_empty(map->p[i]);
6894 int isl_map_plain_is_empty(__isl_keep isl_map *map)
6896 return map ? map->n == 0 : -1;
6899 int isl_map_fast_is_empty(__isl_keep isl_map *map)
6901 return isl_map_plain_is_empty(map);
6904 int isl_set_plain_is_empty(struct isl_set *set)
6906 return set ? set->n == 0 : -1;
6909 int isl_set_fast_is_empty(__isl_keep isl_set *set)
6911 return isl_set_plain_is_empty(set);
6914 int isl_set_is_empty(struct isl_set *set)
6916 return isl_map_is_empty((struct isl_map *)set);
6919 int isl_map_has_equal_space(__isl_keep isl_map *map1, __isl_keep isl_map *map2)
6924 return isl_space_is_equal(map1->dim, map2->dim);
6927 int isl_set_has_equal_space(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
6932 return isl_space_is_equal(set1->dim, set2->dim);
6935 static int map_is_equal(__isl_keep isl_map *map1, __isl_keep isl_map *map2)
6941 is_subset = isl_map_is_subset(map1, map2);
6944 is_subset = isl_map_is_subset(map2, map1);
6948 int isl_map_is_equal(__isl_keep isl_map *map1, __isl_keep isl_map *map2)
6950 return isl_map_align_params_map_map_and_test(map1, map2, &map_is_equal);
6953 int isl_basic_map_is_strict_subset(
6954 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
6958 if (!bmap1 || !bmap2)
6960 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
6963 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
6964 if (is_subset == -1)
6969 int isl_map_is_strict_subset(struct isl_map *map1, struct isl_map *map2)
6975 is_subset = isl_map_is_subset(map1, map2);
6978 is_subset = isl_map_is_subset(map2, map1);
6979 if (is_subset == -1)
6984 int isl_set_is_strict_subset(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
6986 return isl_map_is_strict_subset((isl_map *)set1, (isl_map *)set2);
6989 int isl_basic_map_is_universe(struct isl_basic_map *bmap)
6993 return bmap->n_eq == 0 && bmap->n_ineq == 0;
6996 int isl_basic_set_is_universe(struct isl_basic_set *bset)
7000 return bset->n_eq == 0 && bset->n_ineq == 0;
7003 int isl_map_plain_is_universe(__isl_keep isl_map *map)
7010 for (i = 0; i < map->n; ++i) {
7011 int r = isl_basic_map_is_universe(map->p[i]);
7019 int isl_set_plain_is_universe(__isl_keep isl_set *set)
7021 return isl_map_plain_is_universe((isl_map *) set);
7024 int isl_set_fast_is_universe(__isl_keep isl_set *set)
7026 return isl_set_plain_is_universe(set);
7029 int isl_basic_map_is_empty(struct isl_basic_map *bmap)
7031 struct isl_basic_set *bset = NULL;
7032 struct isl_vec *sample = NULL;
7039 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY))
7042 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL)) {
7043 struct isl_basic_map *copy = isl_basic_map_copy(bmap);
7044 copy = isl_basic_map_remove_redundancies(copy);
7045 empty = ISL_F_ISSET(copy, ISL_BASIC_MAP_EMPTY);
7046 isl_basic_map_free(copy);
7050 total = 1 + isl_basic_map_total_dim(bmap);
7051 if (bmap->sample && bmap->sample->size == total) {
7052 int contains = isl_basic_map_contains(bmap, bmap->sample);
7058 isl_vec_free(bmap->sample);
7059 bmap->sample = NULL;
7060 bset = isl_basic_map_underlying_set(isl_basic_map_copy(bmap));
7063 sample = isl_basic_set_sample_vec(bset);
7066 empty = sample->size == 0;
7067 isl_vec_free(bmap->sample);
7068 bmap->sample = sample;
7070 ISL_F_SET(bmap, ISL_BASIC_MAP_EMPTY);
7075 int isl_basic_map_plain_is_empty(__isl_keep isl_basic_map *bmap)
7079 return ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY);
7082 int isl_basic_map_fast_is_empty(__isl_keep isl_basic_map *bmap)
7084 return isl_basic_map_plain_is_empty(bmap);
7087 int isl_basic_set_plain_is_empty(__isl_keep isl_basic_set *bset)
7091 return ISL_F_ISSET(bset, ISL_BASIC_SET_EMPTY);
7094 int isl_basic_set_fast_is_empty(__isl_keep isl_basic_set *bset)
7096 return isl_basic_set_plain_is_empty(bset);
7099 int isl_basic_set_is_empty(struct isl_basic_set *bset)
7101 return isl_basic_map_is_empty((struct isl_basic_map *)bset);
7104 struct isl_map *isl_basic_map_union(
7105 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
7107 struct isl_map *map;
7108 if (!bmap1 || !bmap2)
7111 isl_assert(bmap1->ctx, isl_space_is_equal(bmap1->dim, bmap2->dim), goto error);
7113 map = isl_map_alloc_space(isl_space_copy(bmap1->dim), 2, 0);
7116 map = isl_map_add_basic_map(map, bmap1);
7117 map = isl_map_add_basic_map(map, bmap2);
7120 isl_basic_map_free(bmap1);
7121 isl_basic_map_free(bmap2);
7125 struct isl_set *isl_basic_set_union(
7126 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
7128 return (struct isl_set *)isl_basic_map_union(
7129 (struct isl_basic_map *)bset1,
7130 (struct isl_basic_map *)bset2);
7133 /* Order divs such that any div only depends on previous divs */
7134 struct isl_basic_map *isl_basic_map_order_divs(struct isl_basic_map *bmap)
7142 off = isl_space_dim(bmap->dim, isl_dim_all);
7144 for (i = 0; i < bmap->n_div; ++i) {
7146 if (isl_int_is_zero(bmap->div[i][0]))
7148 pos = isl_seq_first_non_zero(bmap->div[i]+1+1+off+i,
7152 isl_basic_map_swap_div(bmap, i, i + pos);
7158 struct isl_basic_set *isl_basic_set_order_divs(struct isl_basic_set *bset)
7160 return (struct isl_basic_set *)
7161 isl_basic_map_order_divs((struct isl_basic_map *)bset);
7164 __isl_give isl_map *isl_map_order_divs(__isl_take isl_map *map)
7171 for (i = 0; i < map->n; ++i) {
7172 map->p[i] = isl_basic_map_order_divs(map->p[i]);
7183 /* Apply the expansion computed by isl_merge_divs.
7184 * The expansion itself is given by "exp" while the resulting
7185 * list of divs is given by "div".
7187 __isl_give isl_basic_set *isl_basic_set_expand_divs(
7188 __isl_take isl_basic_set *bset, __isl_take isl_mat *div, int *exp)
7193 bset = isl_basic_set_cow(bset);
7197 if (div->n_row < bset->n_div)
7198 isl_die(isl_mat_get_ctx(div), isl_error_invalid,
7199 "not an expansion", goto error);
7201 bset = isl_basic_map_extend_space(bset, isl_space_copy(bset->dim),
7202 div->n_row - bset->n_div, 0,
7203 2 * (div->n_row - bset->n_div));
7205 n_div = bset->n_div;
7206 for (i = n_div; i < div->n_row; ++i)
7207 if (isl_basic_set_alloc_div(bset) < 0)
7211 for (i = div->n_row - 1; i >= 0; --i) {
7212 if (j >= 0 && exp[j] == i) {
7214 isl_basic_map_swap_div(bset, i, j);
7217 isl_seq_cpy(bset->div[i], div->row[i], div->n_col);
7218 if (isl_basic_map_add_div_constraints(bset, i) < 0)
7226 isl_basic_set_free(bset);
7231 /* Look for a div in dst that corresponds to the div "div" in src.
7232 * The divs before "div" in src and dst are assumed to be the same.
7234 * Returns -1 if no corresponding div was found and the position
7235 * of the corresponding div in dst otherwise.
7237 static int find_div(struct isl_basic_map *dst,
7238 struct isl_basic_map *src, unsigned div)
7242 unsigned total = isl_space_dim(src->dim, isl_dim_all);
7244 isl_assert(dst->ctx, div <= dst->n_div, return -1);
7245 for (i = div; i < dst->n_div; ++i)
7246 if (isl_seq_eq(dst->div[i], src->div[div], 1+1+total+div) &&
7247 isl_seq_first_non_zero(dst->div[i]+1+1+total+div,
7248 dst->n_div - div) == -1)
7253 struct isl_basic_map *isl_basic_map_align_divs(
7254 struct isl_basic_map *dst, struct isl_basic_map *src)
7257 unsigned total = isl_space_dim(src->dim, isl_dim_all);
7262 if (src->n_div == 0)
7265 for (i = 0; i < src->n_div; ++i)
7266 isl_assert(src->ctx, !isl_int_is_zero(src->div[i][0]), goto error);
7268 src = isl_basic_map_order_divs(src);
7269 dst = isl_basic_map_cow(dst);
7270 dst = isl_basic_map_extend_space(dst, isl_space_copy(dst->dim),
7271 src->n_div, 0, 2 * src->n_div);
7274 for (i = 0; i < src->n_div; ++i) {
7275 int j = find_div(dst, src, i);
7277 j = isl_basic_map_alloc_div(dst);
7280 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total+i);
7281 isl_seq_clr(dst->div[j]+1+1+total+i, dst->n_div - i);
7282 if (isl_basic_map_add_div_constraints(dst, j) < 0)
7286 isl_basic_map_swap_div(dst, i, j);
7290 isl_basic_map_free(dst);
7294 struct isl_basic_set *isl_basic_set_align_divs(
7295 struct isl_basic_set *dst, struct isl_basic_set *src)
7297 return (struct isl_basic_set *)isl_basic_map_align_divs(
7298 (struct isl_basic_map *)dst, (struct isl_basic_map *)src);
7301 struct isl_map *isl_map_align_divs(struct isl_map *map)
7309 map = isl_map_compute_divs(map);
7310 map = isl_map_cow(map);
7314 for (i = 1; i < map->n; ++i)
7315 map->p[0] = isl_basic_map_align_divs(map->p[0], map->p[i]);
7316 for (i = 1; i < map->n; ++i)
7317 map->p[i] = isl_basic_map_align_divs(map->p[i], map->p[0]);
7319 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
7323 struct isl_set *isl_set_align_divs(struct isl_set *set)
7325 return (struct isl_set *)isl_map_align_divs((struct isl_map *)set);
7328 static __isl_give isl_set *set_apply( __isl_take isl_set *set,
7329 __isl_take isl_map *map)
7333 isl_assert(set->ctx, isl_map_compatible_domain(map, set), goto error);
7334 map = isl_map_intersect_domain(map, set);
7335 set = isl_map_range(map);
7343 __isl_give isl_set *isl_set_apply( __isl_take isl_set *set,
7344 __isl_take isl_map *map)
7346 return isl_map_align_params_map_map_and(set, map, &set_apply);
7349 /* There is no need to cow as removing empty parts doesn't change
7350 * the meaning of the set.
7352 struct isl_map *isl_map_remove_empty_parts(struct isl_map *map)
7359 for (i = map->n - 1; i >= 0; --i)
7360 remove_if_empty(map, i);
7365 struct isl_set *isl_set_remove_empty_parts(struct isl_set *set)
7367 return (struct isl_set *)
7368 isl_map_remove_empty_parts((struct isl_map *)set);
7371 struct isl_basic_map *isl_map_copy_basic_map(struct isl_map *map)
7373 struct isl_basic_map *bmap;
7374 if (!map || map->n == 0)
7376 bmap = map->p[map->n-1];
7377 isl_assert(map->ctx, ISL_F_ISSET(bmap, ISL_BASIC_SET_FINAL), return NULL);
7378 return isl_basic_map_copy(bmap);
7381 struct isl_basic_set *isl_set_copy_basic_set(struct isl_set *set)
7383 return (struct isl_basic_set *)
7384 isl_map_copy_basic_map((struct isl_map *)set);
7387 __isl_give isl_map *isl_map_drop_basic_map(__isl_take isl_map *map,
7388 __isl_keep isl_basic_map *bmap)
7394 for (i = map->n-1; i >= 0; --i) {
7395 if (map->p[i] != bmap)
7397 map = isl_map_cow(map);
7400 isl_basic_map_free(map->p[i]);
7401 if (i != map->n-1) {
7402 ISL_F_CLR(map, ISL_SET_NORMALIZED);
7403 map->p[i] = map->p[map->n-1];
7414 struct isl_set *isl_set_drop_basic_set(struct isl_set *set,
7415 struct isl_basic_set *bset)
7417 return (struct isl_set *)isl_map_drop_basic_map((struct isl_map *)set,
7418 (struct isl_basic_map *)bset);
7421 /* Given two basic sets bset1 and bset2, compute the maximal difference
7422 * between the values of dimension pos in bset1 and those in bset2
7423 * for any common value of the parameters and dimensions preceding pos.
7425 static enum isl_lp_result basic_set_maximal_difference_at(
7426 __isl_keep isl_basic_set *bset1, __isl_keep isl_basic_set *bset2,
7427 int pos, isl_int *opt)
7430 struct isl_basic_map *bmap1 = NULL;
7431 struct isl_basic_map *bmap2 = NULL;
7432 struct isl_ctx *ctx;
7433 struct isl_vec *obj;
7436 unsigned dim1, dim2;
7437 enum isl_lp_result res;
7439 if (!bset1 || !bset2)
7440 return isl_lp_error;
7442 nparam = isl_basic_set_n_param(bset1);
7443 dim1 = isl_basic_set_n_dim(bset1);
7444 dim2 = isl_basic_set_n_dim(bset2);
7445 dims = isl_space_alloc(bset1->ctx, nparam, pos, dim1 - pos);
7446 bmap1 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset1), dims);
7447 dims = isl_space_alloc(bset2->ctx, nparam, pos, dim2 - pos);
7448 bmap2 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset2), dims);
7449 if (!bmap1 || !bmap2)
7451 bmap1 = isl_basic_map_cow(bmap1);
7452 bmap1 = isl_basic_map_extend(bmap1, nparam,
7453 pos, (dim1 - pos) + (dim2 - pos),
7454 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
7455 bmap1 = add_constraints(bmap1, bmap2, 0, dim1 - pos);
7458 total = isl_basic_map_total_dim(bmap1);
7460 obj = isl_vec_alloc(ctx, 1 + total);
7461 isl_seq_clr(obj->block.data, 1 + total);
7462 isl_int_set_si(obj->block.data[1+nparam+pos], 1);
7463 isl_int_set_si(obj->block.data[1+nparam+pos+(dim1-pos)], -1);
7466 res = isl_basic_map_solve_lp(bmap1, 1, obj->block.data, ctx->one,
7468 isl_basic_map_free(bmap1);
7472 isl_basic_map_free(bmap1);
7473 isl_basic_map_free(bmap2);
7474 return isl_lp_error;
7477 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
7478 * for any common value of the parameters and dimensions preceding pos
7479 * in both basic sets, the values of dimension pos in bset1 are
7480 * smaller or larger than those in bset2.
7483 * 1 if bset1 follows bset2
7484 * -1 if bset1 precedes bset2
7485 * 0 if bset1 and bset2 are incomparable
7486 * -2 if some error occurred.
7488 int isl_basic_set_compare_at(struct isl_basic_set *bset1,
7489 struct isl_basic_set *bset2, int pos)
7492 enum isl_lp_result res;
7497 res = basic_set_maximal_difference_at(bset1, bset2, pos, &opt);
7499 if (res == isl_lp_empty)
7501 else if ((res == isl_lp_ok && isl_int_is_pos(opt)) ||
7502 res == isl_lp_unbounded)
7504 else if (res == isl_lp_ok && isl_int_is_neg(opt))
7513 /* Given two basic sets bset1 and bset2, check whether
7514 * for any common value of the parameters and dimensions preceding pos
7515 * there is a value of dimension pos in bset1 that is larger
7516 * than a value of the same dimension in bset2.
7519 * 1 if there exists such a pair
7520 * 0 if there is no such pair, but there is a pair of equal values
7522 * -2 if some error occurred.
7524 int isl_basic_set_follows_at(__isl_keep isl_basic_set *bset1,
7525 __isl_keep isl_basic_set *bset2, int pos)
7528 enum isl_lp_result res;
7533 res = basic_set_maximal_difference_at(bset1, bset2, pos, &opt);
7535 if (res == isl_lp_empty)
7537 else if ((res == isl_lp_ok && isl_int_is_pos(opt)) ||
7538 res == isl_lp_unbounded)
7540 else if (res == isl_lp_ok && isl_int_is_neg(opt))
7542 else if (res == isl_lp_ok)
7551 /* Given two sets set1 and set2, check whether
7552 * for any common value of the parameters and dimensions preceding pos
7553 * there is a value of dimension pos in set1 that is larger
7554 * than a value of the same dimension in set2.
7557 * 1 if there exists such a pair
7558 * 0 if there is no such pair, but there is a pair of equal values
7560 * -2 if some error occurred.
7562 int isl_set_follows_at(__isl_keep isl_set *set1,
7563 __isl_keep isl_set *set2, int pos)
7571 for (i = 0; i < set1->n; ++i)
7572 for (j = 0; j < set2->n; ++j) {
7574 f = isl_basic_set_follows_at(set1->p[i], set2->p[j], pos);
7575 if (f == 1 || f == -2)
7584 static int isl_basic_map_plain_has_fixed_var(__isl_keep isl_basic_map *bmap,
7585 unsigned pos, isl_int *val)
7593 total = isl_basic_map_total_dim(bmap);
7594 for (i = 0, d = total-1; i < bmap->n_eq && d+1 > pos; ++i) {
7595 for (; d+1 > pos; --d)
7596 if (!isl_int_is_zero(bmap->eq[i][1+d]))
7600 if (isl_seq_first_non_zero(bmap->eq[i]+1, d) != -1)
7602 if (isl_seq_first_non_zero(bmap->eq[i]+1+d+1, total-d-1) != -1)
7604 if (!isl_int_is_one(bmap->eq[i][1+d]))
7607 isl_int_neg(*val, bmap->eq[i][0]);
7613 static int isl_map_plain_has_fixed_var(__isl_keep isl_map *map,
7614 unsigned pos, isl_int *val)
7626 return isl_basic_map_plain_has_fixed_var(map->p[0], pos, val);
7629 fixed = isl_basic_map_plain_has_fixed_var(map->p[0], pos, &v);
7630 for (i = 1; fixed == 1 && i < map->n; ++i) {
7631 fixed = isl_basic_map_plain_has_fixed_var(map->p[i], pos, &tmp);
7632 if (fixed == 1 && isl_int_ne(tmp, v))
7636 isl_int_set(*val, v);
7642 static int isl_basic_set_plain_has_fixed_var(__isl_keep isl_basic_set *bset,
7643 unsigned pos, isl_int *val)
7645 return isl_basic_map_plain_has_fixed_var((struct isl_basic_map *)bset,
7649 static int isl_set_plain_has_fixed_var(__isl_keep isl_set *set, unsigned pos,
7652 return isl_map_plain_has_fixed_var((struct isl_map *)set, pos, val);
7655 int isl_basic_map_plain_is_fixed(__isl_keep isl_basic_map *bmap,
7656 enum isl_dim_type type, unsigned pos, isl_int *val)
7658 if (pos >= isl_basic_map_dim(bmap, type))
7660 return isl_basic_map_plain_has_fixed_var(bmap,
7661 isl_basic_map_offset(bmap, type) - 1 + pos, val);
7664 int isl_map_plain_is_fixed(__isl_keep isl_map *map,
7665 enum isl_dim_type type, unsigned pos, isl_int *val)
7667 if (pos >= isl_map_dim(map, type))
7669 return isl_map_plain_has_fixed_var(map,
7670 map_offset(map, type) - 1 + pos, val);
7673 int isl_set_plain_is_fixed(__isl_keep isl_set *set,
7674 enum isl_dim_type type, unsigned pos, isl_int *val)
7676 return isl_map_plain_is_fixed(set, type, pos, val);
7679 int isl_map_fast_is_fixed(__isl_keep isl_map *map,
7680 enum isl_dim_type type, unsigned pos, isl_int *val)
7682 return isl_map_plain_is_fixed(map, type, pos, val);
7685 /* Check if dimension dim has fixed value and if so and if val is not NULL,
7686 * then return this fixed value in *val.
7688 int isl_basic_set_plain_dim_is_fixed(__isl_keep isl_basic_set *bset,
7689 unsigned dim, isl_int *val)
7691 return isl_basic_set_plain_has_fixed_var(bset,
7692 isl_basic_set_n_param(bset) + dim, val);
7695 /* Check if dimension dim has fixed value and if so and if val is not NULL,
7696 * then return this fixed value in *val.
7698 int isl_set_plain_dim_is_fixed(__isl_keep isl_set *set,
7699 unsigned dim, isl_int *val)
7701 return isl_set_plain_has_fixed_var(set, isl_set_n_param(set) + dim, val);
7704 int isl_set_fast_dim_is_fixed(__isl_keep isl_set *set,
7705 unsigned dim, isl_int *val)
7707 return isl_set_plain_dim_is_fixed(set, dim, val);
7710 /* Check if input variable in has fixed value and if so and if val is not NULL,
7711 * then return this fixed value in *val.
7713 int isl_map_plain_input_is_fixed(__isl_keep isl_map *map,
7714 unsigned in, isl_int *val)
7716 return isl_map_plain_has_fixed_var(map, isl_map_n_param(map) + in, val);
7719 /* Check if dimension dim has an (obvious) fixed lower bound and if so
7720 * and if val is not NULL, then return this lower bound in *val.
7722 int isl_basic_set_plain_dim_has_fixed_lower_bound(
7723 __isl_keep isl_basic_set *bset, unsigned dim, isl_int *val)
7725 int i, i_eq = -1, i_ineq = -1;
7732 total = isl_basic_set_total_dim(bset);
7733 nparam = isl_basic_set_n_param(bset);
7734 for (i = 0; i < bset->n_eq; ++i) {
7735 if (isl_int_is_zero(bset->eq[i][1+nparam+dim]))
7741 for (i = 0; i < bset->n_ineq; ++i) {
7742 if (!isl_int_is_pos(bset->ineq[i][1+nparam+dim]))
7744 if (i_eq != -1 || i_ineq != -1)
7748 if (i_eq == -1 && i_ineq == -1)
7750 c = i_eq != -1 ? bset->eq[i_eq] : bset->ineq[i_ineq];
7751 /* The coefficient should always be one due to normalization. */
7752 if (!isl_int_is_one(c[1+nparam+dim]))
7754 if (isl_seq_first_non_zero(c+1, nparam+dim) != -1)
7756 if (isl_seq_first_non_zero(c+1+nparam+dim+1,
7757 total - nparam - dim - 1) != -1)
7760 isl_int_neg(*val, c[0]);
7764 int isl_set_plain_dim_has_fixed_lower_bound(__isl_keep isl_set *set,
7765 unsigned dim, isl_int *val)
7777 return isl_basic_set_plain_dim_has_fixed_lower_bound(set->p[0],
7781 fixed = isl_basic_set_plain_dim_has_fixed_lower_bound(set->p[0],
7783 for (i = 1; fixed == 1 && i < set->n; ++i) {
7784 fixed = isl_basic_set_plain_dim_has_fixed_lower_bound(set->p[i],
7786 if (fixed == 1 && isl_int_ne(tmp, v))
7790 isl_int_set(*val, v);
7801 /* uset_gist depends on constraints without existentially quantified
7802 * variables sorting first.
7804 static int qsort_constraint_cmp(const void *p1, const void *p2)
7806 const struct constraint *c1 = (const struct constraint *)p1;
7807 const struct constraint *c2 = (const struct constraint *)p2;
7809 unsigned size = isl_min(c1->size, c2->size);
7811 l1 = isl_seq_last_non_zero(c1->c, size);
7812 l2 = isl_seq_last_non_zero(c2->c, size);
7817 return isl_seq_cmp(c1->c, c2->c, size);
7820 static struct isl_basic_map *isl_basic_map_sort_constraints(
7821 struct isl_basic_map *bmap)
7824 struct constraint *c;
7829 total = isl_basic_map_total_dim(bmap);
7830 c = isl_alloc_array(bmap->ctx, struct constraint, bmap->n_ineq);
7833 for (i = 0; i < bmap->n_ineq; ++i) {
7835 c[i].c = bmap->ineq[i];
7837 qsort(c, bmap->n_ineq, sizeof(struct constraint), qsort_constraint_cmp);
7838 for (i = 0; i < bmap->n_ineq; ++i)
7839 bmap->ineq[i] = c[i].c;
7843 isl_basic_map_free(bmap);
7847 __isl_give isl_basic_set *isl_basic_set_sort_constraints(
7848 __isl_take isl_basic_set *bset)
7850 return (struct isl_basic_set *)isl_basic_map_sort_constraints(
7851 (struct isl_basic_map *)bset);
7854 struct isl_basic_map *isl_basic_map_normalize(struct isl_basic_map *bmap)
7858 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_NORMALIZED))
7860 bmap = isl_basic_map_remove_redundancies(bmap);
7861 bmap = isl_basic_map_sort_constraints(bmap);
7862 ISL_F_SET(bmap, ISL_BASIC_MAP_NORMALIZED);
7866 struct isl_basic_set *isl_basic_set_normalize(struct isl_basic_set *bset)
7868 return (struct isl_basic_set *)isl_basic_map_normalize(
7869 (struct isl_basic_map *)bset);
7872 int isl_basic_map_plain_cmp(const __isl_keep isl_basic_map *bmap1,
7873 const __isl_keep isl_basic_map *bmap2)
7880 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_RATIONAL) !=
7881 ISL_F_ISSET(bmap2, ISL_BASIC_MAP_RATIONAL))
7882 return ISL_F_ISSET(bmap1, ISL_BASIC_MAP_RATIONAL) ? -1 : 1;
7883 if (isl_basic_map_n_param(bmap1) != isl_basic_map_n_param(bmap2))
7884 return isl_basic_map_n_param(bmap1) - isl_basic_map_n_param(bmap2);
7885 if (isl_basic_map_n_in(bmap1) != isl_basic_map_n_in(bmap2))
7886 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
7887 if (isl_basic_map_n_out(bmap1) != isl_basic_map_n_out(bmap2))
7888 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
7889 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY) &&
7890 ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
7892 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY))
7894 if (ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
7896 if (bmap1->n_eq != bmap2->n_eq)
7897 return bmap1->n_eq - bmap2->n_eq;
7898 if (bmap1->n_ineq != bmap2->n_ineq)
7899 return bmap1->n_ineq - bmap2->n_ineq;
7900 if (bmap1->n_div != bmap2->n_div)
7901 return bmap1->n_div - bmap2->n_div;
7902 total = isl_basic_map_total_dim(bmap1);
7903 for (i = 0; i < bmap1->n_eq; ++i) {
7904 cmp = isl_seq_cmp(bmap1->eq[i], bmap2->eq[i], 1+total);
7908 for (i = 0; i < bmap1->n_ineq; ++i) {
7909 cmp = isl_seq_cmp(bmap1->ineq[i], bmap2->ineq[i], 1+total);
7913 for (i = 0; i < bmap1->n_div; ++i) {
7914 cmp = isl_seq_cmp(bmap1->div[i], bmap2->div[i], 1+1+total);
7921 int isl_basic_set_plain_cmp(const __isl_keep isl_basic_set *bset1,
7922 const __isl_keep isl_basic_set *bset2)
7924 return isl_basic_map_plain_cmp(bset1, bset2);
7927 int isl_set_plain_cmp(const __isl_keep isl_set *set1,
7928 const __isl_keep isl_set *set2)
7934 if (set1->n != set2->n)
7935 return set1->n - set2->n;
7937 for (i = 0; i < set1->n; ++i) {
7938 cmp = isl_basic_set_plain_cmp(set1->p[i], set2->p[i]);
7946 int isl_basic_map_plain_is_equal(__isl_keep isl_basic_map *bmap1,
7947 __isl_keep isl_basic_map *bmap2)
7949 return isl_basic_map_plain_cmp(bmap1, bmap2) == 0;
7952 int isl_basic_set_plain_is_equal(__isl_keep isl_basic_set *bset1,
7953 __isl_keep isl_basic_set *bset2)
7955 return isl_basic_map_plain_is_equal((isl_basic_map *)bset1,
7956 (isl_basic_map *)bset2);
7959 static int qsort_bmap_cmp(const void *p1, const void *p2)
7961 const struct isl_basic_map *bmap1 = *(const struct isl_basic_map **)p1;
7962 const struct isl_basic_map *bmap2 = *(const struct isl_basic_map **)p2;
7964 return isl_basic_map_plain_cmp(bmap1, bmap2);
7967 /* We normalize in place, but if anything goes wrong we need
7968 * to return NULL, so we need to make sure we don't change the
7969 * meaning of any possible other copies of map.
7971 struct isl_map *isl_map_normalize(struct isl_map *map)
7974 struct isl_basic_map *bmap;
7978 if (ISL_F_ISSET(map, ISL_MAP_NORMALIZED))
7980 for (i = 0; i < map->n; ++i) {
7981 bmap = isl_basic_map_normalize(isl_basic_map_copy(map->p[i]));
7984 isl_basic_map_free(map->p[i]);
7987 qsort(map->p, map->n, sizeof(struct isl_basic_map *), qsort_bmap_cmp);
7988 ISL_F_SET(map, ISL_MAP_NORMALIZED);
7989 map = isl_map_remove_empty_parts(map);
7992 for (i = map->n - 1; i >= 1; --i) {
7993 if (!isl_basic_map_plain_is_equal(map->p[i-1], map->p[i]))
7995 isl_basic_map_free(map->p[i-1]);
7996 for (j = i; j < map->n; ++j)
7997 map->p[j-1] = map->p[j];
8007 struct isl_set *isl_set_normalize(struct isl_set *set)
8009 return (struct isl_set *)isl_map_normalize((struct isl_map *)set);
8012 int isl_map_plain_is_equal(__isl_keep isl_map *map1, __isl_keep isl_map *map2)
8022 if (!isl_space_is_equal(map1->dim, map2->dim))
8025 map1 = isl_map_copy(map1);
8026 map2 = isl_map_copy(map2);
8027 map1 = isl_map_normalize(map1);
8028 map2 = isl_map_normalize(map2);
8031 equal = map1->n == map2->n;
8032 for (i = 0; equal && i < map1->n; ++i) {
8033 equal = isl_basic_map_plain_is_equal(map1->p[i], map2->p[i]);
8046 int isl_map_fast_is_equal(__isl_keep isl_map *map1, __isl_keep isl_map *map2)
8048 return isl_map_plain_is_equal(map1, map2);
8051 int isl_set_plain_is_equal(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
8053 return isl_map_plain_is_equal((struct isl_map *)set1,
8054 (struct isl_map *)set2);
8057 int isl_set_fast_is_equal(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
8059 return isl_set_plain_is_equal(set1, set2);
8062 /* Return an interval that ranges from min to max (inclusive)
8064 struct isl_basic_set *isl_basic_set_interval(struct isl_ctx *ctx,
8065 isl_int min, isl_int max)
8068 struct isl_basic_set *bset = NULL;
8070 bset = isl_basic_set_alloc(ctx, 0, 1, 0, 0, 2);
8074 k = isl_basic_set_alloc_inequality(bset);
8077 isl_int_set_si(bset->ineq[k][1], 1);
8078 isl_int_neg(bset->ineq[k][0], min);
8080 k = isl_basic_set_alloc_inequality(bset);
8083 isl_int_set_si(bset->ineq[k][1], -1);
8084 isl_int_set(bset->ineq[k][0], max);
8088 isl_basic_set_free(bset);
8092 /* Return the Cartesian product of the basic sets in list (in the given order).
8094 __isl_give isl_basic_set *isl_basic_set_list_product(
8095 __isl_take struct isl_basic_set_list *list)
8103 struct isl_basic_set *product = NULL;
8107 isl_assert(list->ctx, list->n > 0, goto error);
8108 isl_assert(list->ctx, list->p[0], goto error);
8109 nparam = isl_basic_set_n_param(list->p[0]);
8110 dim = isl_basic_set_n_dim(list->p[0]);
8111 extra = list->p[0]->n_div;
8112 n_eq = list->p[0]->n_eq;
8113 n_ineq = list->p[0]->n_ineq;
8114 for (i = 1; i < list->n; ++i) {
8115 isl_assert(list->ctx, list->p[i], goto error);
8116 isl_assert(list->ctx,
8117 nparam == isl_basic_set_n_param(list->p[i]), goto error);
8118 dim += isl_basic_set_n_dim(list->p[i]);
8119 extra += list->p[i]->n_div;
8120 n_eq += list->p[i]->n_eq;
8121 n_ineq += list->p[i]->n_ineq;
8123 product = isl_basic_set_alloc(list->ctx, nparam, dim, extra,
8128 for (i = 0; i < list->n; ++i) {
8129 isl_basic_set_add_constraints(product,
8130 isl_basic_set_copy(list->p[i]), dim);
8131 dim += isl_basic_set_n_dim(list->p[i]);
8133 isl_basic_set_list_free(list);
8136 isl_basic_set_free(product);
8137 isl_basic_set_list_free(list);
8141 struct isl_basic_map *isl_basic_map_product(
8142 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
8144 isl_space *dim_result = NULL;
8145 struct isl_basic_map *bmap;
8146 unsigned in1, in2, out1, out2, nparam, total, pos;
8147 struct isl_dim_map *dim_map1, *dim_map2;
8149 if (!bmap1 || !bmap2)
8152 isl_assert(bmap1->ctx, isl_space_match(bmap1->dim, isl_dim_param,
8153 bmap2->dim, isl_dim_param), goto error);
8154 dim_result = isl_space_product(isl_space_copy(bmap1->dim),
8155 isl_space_copy(bmap2->dim));
8157 in1 = isl_basic_map_n_in(bmap1);
8158 in2 = isl_basic_map_n_in(bmap2);
8159 out1 = isl_basic_map_n_out(bmap1);
8160 out2 = isl_basic_map_n_out(bmap2);
8161 nparam = isl_basic_map_n_param(bmap1);
8163 total = nparam + in1 + in2 + out1 + out2 + bmap1->n_div + bmap2->n_div;
8164 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
8165 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
8166 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
8167 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
8168 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
8169 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos += in1);
8170 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += in2);
8171 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += out1);
8172 isl_dim_map_div(dim_map1, bmap1, pos += out2);
8173 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
8175 bmap = isl_basic_map_alloc_space(dim_result,
8176 bmap1->n_div + bmap2->n_div,
8177 bmap1->n_eq + bmap2->n_eq,
8178 bmap1->n_ineq + bmap2->n_ineq);
8179 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap1, dim_map1);
8180 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap2, dim_map2);
8181 bmap = isl_basic_map_simplify(bmap);
8182 return isl_basic_map_finalize(bmap);
8184 isl_basic_map_free(bmap1);
8185 isl_basic_map_free(bmap2);
8189 __isl_give isl_basic_map *isl_basic_map_flat_product(
8190 __isl_take isl_basic_map *bmap1, __isl_take isl_basic_map *bmap2)
8192 isl_basic_map *prod;
8194 prod = isl_basic_map_product(bmap1, bmap2);
8195 prod = isl_basic_map_flatten(prod);
8199 __isl_give isl_basic_set *isl_basic_set_flat_product(
8200 __isl_take isl_basic_set *bset1, __isl_take isl_basic_set *bset2)
8202 return isl_basic_map_flat_range_product(bset1, bset2);
8205 __isl_give isl_basic_map *isl_basic_map_domain_product(
8206 __isl_take isl_basic_map *bmap1, __isl_take isl_basic_map *bmap2)
8208 isl_space *space_result = NULL;
8209 isl_basic_map *bmap;
8210 unsigned in1, in2, out, nparam, total, pos;
8211 struct isl_dim_map *dim_map1, *dim_map2;
8213 if (!bmap1 || !bmap2)
8216 space_result = isl_space_domain_product(isl_space_copy(bmap1->dim),
8217 isl_space_copy(bmap2->dim));
8219 in1 = isl_basic_map_dim(bmap1, isl_dim_in);
8220 in2 = isl_basic_map_dim(bmap2, isl_dim_in);
8221 out = isl_basic_map_dim(bmap1, isl_dim_out);
8222 nparam = isl_basic_map_dim(bmap1, isl_dim_param);
8224 total = nparam + in1 + in2 + out + bmap1->n_div + bmap2->n_div;
8225 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
8226 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
8227 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
8228 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
8229 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
8230 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos += in1);
8231 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += in2);
8232 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos);
8233 isl_dim_map_div(dim_map1, bmap1, pos += out);
8234 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
8236 bmap = isl_basic_map_alloc_space(space_result,
8237 bmap1->n_div + bmap2->n_div,
8238 bmap1->n_eq + bmap2->n_eq,
8239 bmap1->n_ineq + bmap2->n_ineq);
8240 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap1, dim_map1);
8241 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap2, dim_map2);
8242 bmap = isl_basic_map_simplify(bmap);
8243 return isl_basic_map_finalize(bmap);
8245 isl_basic_map_free(bmap1);
8246 isl_basic_map_free(bmap2);
8250 __isl_give isl_basic_map *isl_basic_map_range_product(
8251 __isl_take isl_basic_map *bmap1, __isl_take isl_basic_map *bmap2)
8253 isl_space *dim_result = NULL;
8254 isl_basic_map *bmap;
8255 unsigned in, out1, out2, nparam, total, pos;
8256 struct isl_dim_map *dim_map1, *dim_map2;
8258 if (!bmap1 || !bmap2)
8261 dim_result = isl_space_range_product(isl_space_copy(bmap1->dim),
8262 isl_space_copy(bmap2->dim));
8264 in = isl_basic_map_dim(bmap1, isl_dim_in);
8265 out1 = isl_basic_map_n_out(bmap1);
8266 out2 = isl_basic_map_n_out(bmap2);
8267 nparam = isl_basic_map_n_param(bmap1);
8269 total = nparam + in + out1 + out2 + bmap1->n_div + bmap2->n_div;
8270 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
8271 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
8272 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
8273 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
8274 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
8275 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
8276 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += in);
8277 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += out1);
8278 isl_dim_map_div(dim_map1, bmap1, pos += out2);
8279 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
8281 bmap = isl_basic_map_alloc_space(dim_result,
8282 bmap1->n_div + bmap2->n_div,
8283 bmap1->n_eq + bmap2->n_eq,
8284 bmap1->n_ineq + bmap2->n_ineq);
8285 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap1, dim_map1);
8286 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap2, dim_map2);
8287 bmap = isl_basic_map_simplify(bmap);
8288 return isl_basic_map_finalize(bmap);
8290 isl_basic_map_free(bmap1);
8291 isl_basic_map_free(bmap2);
8295 __isl_give isl_basic_map *isl_basic_map_flat_range_product(
8296 __isl_take isl_basic_map *bmap1, __isl_take isl_basic_map *bmap2)
8298 isl_basic_map *prod;
8300 prod = isl_basic_map_range_product(bmap1, bmap2);
8301 prod = isl_basic_map_flatten_range(prod);
8305 static __isl_give isl_map *map_product(__isl_take isl_map *map1,
8306 __isl_take isl_map *map2,
8307 __isl_give isl_space *(*dim_product)(__isl_take isl_space *left,
8308 __isl_take isl_space *right),
8309 __isl_give isl_basic_map *(*basic_map_product)(
8310 __isl_take isl_basic_map *left, __isl_take isl_basic_map *right))
8313 struct isl_map *result;
8319 isl_assert(map1->ctx, isl_space_match(map1->dim, isl_dim_param,
8320 map2->dim, isl_dim_param), goto error);
8322 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
8323 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
8324 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
8326 result = isl_map_alloc_space(dim_product(isl_space_copy(map1->dim),
8327 isl_space_copy(map2->dim)),
8328 map1->n * map2->n, flags);
8331 for (i = 0; i < map1->n; ++i)
8332 for (j = 0; j < map2->n; ++j) {
8333 struct isl_basic_map *part;
8334 part = basic_map_product(isl_basic_map_copy(map1->p[i]),
8335 isl_basic_map_copy(map2->p[j]));
8336 if (isl_basic_map_is_empty(part))
8337 isl_basic_map_free(part);
8339 result = isl_map_add_basic_map(result, part);
8352 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> [B -> D]
8354 static __isl_give isl_map *map_product_aligned(__isl_take isl_map *map1,
8355 __isl_take isl_map *map2)
8357 return map_product(map1, map2, &isl_space_product, &isl_basic_map_product);
8360 __isl_give isl_map *isl_map_product(__isl_take isl_map *map1,
8361 __isl_take isl_map *map2)
8363 return isl_map_align_params_map_map_and(map1, map2, &map_product_aligned);
8366 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
8368 __isl_give isl_map *isl_map_flat_product(__isl_take isl_map *map1,
8369 __isl_take isl_map *map2)
8373 prod = isl_map_product(map1, map2);
8374 prod = isl_map_flatten(prod);
8378 /* Given two set A and B, construct its Cartesian product A x B.
8380 struct isl_set *isl_set_product(struct isl_set *set1, struct isl_set *set2)
8382 return isl_map_range_product(set1, set2);
8385 __isl_give isl_set *isl_set_flat_product(__isl_take isl_set *set1,
8386 __isl_take isl_set *set2)
8388 return isl_map_flat_range_product(set1, set2);
8391 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> (B * D)
8393 static __isl_give isl_map *map_domain_product_aligned(__isl_take isl_map *map1,
8394 __isl_take isl_map *map2)
8396 return map_product(map1, map2, &isl_space_domain_product,
8397 &isl_basic_map_domain_product);
8400 /* Given two maps A -> B and C -> D, construct a map (A * C) -> [B -> D]
8402 static __isl_give isl_map *map_range_product_aligned(__isl_take isl_map *map1,
8403 __isl_take isl_map *map2)
8405 return map_product(map1, map2, &isl_space_range_product,
8406 &isl_basic_map_range_product);
8409 __isl_give isl_map *isl_map_domain_product(__isl_take isl_map *map1,
8410 __isl_take isl_map *map2)
8412 return isl_map_align_params_map_map_and(map1, map2,
8413 &map_domain_product_aligned);
8416 __isl_give isl_map *isl_map_range_product(__isl_take isl_map *map1,
8417 __isl_take isl_map *map2)
8419 return isl_map_align_params_map_map_and(map1, map2,
8420 &map_range_product_aligned);
8423 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B * D)
8425 __isl_give isl_map *isl_map_flat_domain_product(__isl_take isl_map *map1,
8426 __isl_take isl_map *map2)
8430 prod = isl_map_domain_product(map1, map2);
8431 prod = isl_map_flatten_domain(prod);
8435 /* Given two maps A -> B and C -> D, construct a map (A * C) -> (B, D)
8437 __isl_give isl_map *isl_map_flat_range_product(__isl_take isl_map *map1,
8438 __isl_take isl_map *map2)
8442 prod = isl_map_range_product(map1, map2);
8443 prod = isl_map_flatten_range(prod);
8447 uint32_t isl_basic_map_get_hash(__isl_keep isl_basic_map *bmap)
8450 uint32_t hash = isl_hash_init();
8455 bmap = isl_basic_map_copy(bmap);
8456 bmap = isl_basic_map_normalize(bmap);
8459 total = isl_basic_map_total_dim(bmap);
8460 isl_hash_byte(hash, bmap->n_eq & 0xFF);
8461 for (i = 0; i < bmap->n_eq; ++i) {
8463 c_hash = isl_seq_get_hash(bmap->eq[i], 1 + total);
8464 isl_hash_hash(hash, c_hash);
8466 isl_hash_byte(hash, bmap->n_ineq & 0xFF);
8467 for (i = 0; i < bmap->n_ineq; ++i) {
8469 c_hash = isl_seq_get_hash(bmap->ineq[i], 1 + total);
8470 isl_hash_hash(hash, c_hash);
8472 isl_hash_byte(hash, bmap->n_div & 0xFF);
8473 for (i = 0; i < bmap->n_div; ++i) {
8475 if (isl_int_is_zero(bmap->div[i][0]))
8477 isl_hash_byte(hash, i & 0xFF);
8478 c_hash = isl_seq_get_hash(bmap->div[i], 1 + 1 + total);
8479 isl_hash_hash(hash, c_hash);
8481 isl_basic_map_free(bmap);
8485 uint32_t isl_basic_set_get_hash(__isl_keep isl_basic_set *bset)
8487 return isl_basic_map_get_hash((isl_basic_map *)bset);
8490 uint32_t isl_map_get_hash(__isl_keep isl_map *map)
8497 map = isl_map_copy(map);
8498 map = isl_map_normalize(map);
8502 hash = isl_hash_init();
8503 for (i = 0; i < map->n; ++i) {
8505 bmap_hash = isl_basic_map_get_hash(map->p[i]);
8506 isl_hash_hash(hash, bmap_hash);
8514 uint32_t isl_set_get_hash(__isl_keep isl_set *set)
8516 return isl_map_get_hash((isl_map *)set);
8519 /* Check if the value for dimension dim is completely determined
8520 * by the values of the other parameters and variables.
8521 * That is, check if dimension dim is involved in an equality.
8523 int isl_basic_set_dim_is_unique(struct isl_basic_set *bset, unsigned dim)
8530 nparam = isl_basic_set_n_param(bset);
8531 for (i = 0; i < bset->n_eq; ++i)
8532 if (!isl_int_is_zero(bset->eq[i][1 + nparam + dim]))
8537 /* Check if the value for dimension dim is completely determined
8538 * by the values of the other parameters and variables.
8539 * That is, check if dimension dim is involved in an equality
8540 * for each of the subsets.
8542 int isl_set_dim_is_unique(struct isl_set *set, unsigned dim)
8548 for (i = 0; i < set->n; ++i) {
8550 unique = isl_basic_set_dim_is_unique(set->p[i], dim);
8557 int isl_set_n_basic_set(__isl_keep isl_set *set)
8559 return set ? set->n : 0;
8562 int isl_map_foreach_basic_map(__isl_keep isl_map *map,
8563 int (*fn)(__isl_take isl_basic_map *bmap, void *user), void *user)
8570 for (i = 0; i < map->n; ++i)
8571 if (fn(isl_basic_map_copy(map->p[i]), user) < 0)
8577 int isl_set_foreach_basic_set(__isl_keep isl_set *set,
8578 int (*fn)(__isl_take isl_basic_set *bset, void *user), void *user)
8585 for (i = 0; i < set->n; ++i)
8586 if (fn(isl_basic_set_copy(set->p[i]), user) < 0)
8592 __isl_give isl_basic_set *isl_basic_set_lift(__isl_take isl_basic_set *bset)
8599 bset = isl_basic_set_cow(bset);
8603 dim = isl_basic_set_get_space(bset);
8604 dim = isl_space_lift(dim, bset->n_div);
8607 isl_space_free(bset->dim);
8609 bset->extra -= bset->n_div;
8612 bset = isl_basic_set_finalize(bset);
8616 isl_basic_set_free(bset);
8620 __isl_give isl_set *isl_set_lift(__isl_take isl_set *set)
8626 set = isl_set_align_divs(set);
8631 set = isl_set_cow(set);
8635 n_div = set->p[0]->n_div;
8636 dim = isl_set_get_space(set);
8637 dim = isl_space_lift(dim, n_div);
8640 isl_space_free(set->dim);
8643 for (i = 0; i < set->n; ++i) {
8644 set->p[i] = isl_basic_set_lift(set->p[i]);
8655 __isl_give isl_map *isl_set_lifting(__isl_take isl_set *set)
8658 struct isl_basic_map *bmap;
8665 set = isl_set_align_divs(set);
8670 dim = isl_set_get_space(set);
8671 if (set->n == 0 || set->p[0]->n_div == 0) {
8673 return isl_map_identity(isl_space_map_from_set(dim));
8676 n_div = set->p[0]->n_div;
8677 dim = isl_space_map_from_set(dim);
8678 n_param = isl_space_dim(dim, isl_dim_param);
8679 n_set = isl_space_dim(dim, isl_dim_in);
8680 dim = isl_space_extend(dim, n_param, n_set, n_set + n_div);
8681 bmap = isl_basic_map_alloc_space(dim, 0, n_set, 2 * n_div);
8682 for (i = 0; i < n_set; ++i)
8683 bmap = var_equal(bmap, i);
8685 total = n_param + n_set + n_set + n_div;
8686 for (i = 0; i < n_div; ++i) {
8687 k = isl_basic_map_alloc_inequality(bmap);
8690 isl_seq_cpy(bmap->ineq[k], set->p[0]->div[i]+1, 1+n_param);
8691 isl_seq_clr(bmap->ineq[k]+1+n_param, n_set);
8692 isl_seq_cpy(bmap->ineq[k]+1+n_param+n_set,
8693 set->p[0]->div[i]+1+1+n_param, n_set + n_div);
8694 isl_int_neg(bmap->ineq[k][1+n_param+n_set+n_set+i],
8695 set->p[0]->div[i][0]);
8697 l = isl_basic_map_alloc_inequality(bmap);
8700 isl_seq_neg(bmap->ineq[l], bmap->ineq[k], 1 + total);
8701 isl_int_add(bmap->ineq[l][0], bmap->ineq[l][0],
8702 set->p[0]->div[i][0]);
8703 isl_int_sub_ui(bmap->ineq[l][0], bmap->ineq[l][0], 1);
8707 bmap = isl_basic_map_simplify(bmap);
8708 bmap = isl_basic_map_finalize(bmap);
8709 return isl_map_from_basic_map(bmap);
8712 isl_basic_map_free(bmap);
8716 int isl_basic_set_size(__isl_keep isl_basic_set *bset)
8724 dim = isl_basic_set_total_dim(bset);
8725 size += bset->n_eq * (1 + dim);
8726 size += bset->n_ineq * (1 + dim);
8727 size += bset->n_div * (2 + dim);
8732 int isl_set_size(__isl_keep isl_set *set)
8740 for (i = 0; i < set->n; ++i)
8741 size += isl_basic_set_size(set->p[i]);
8746 /* Check if there is any lower bound (if lower == 0) and/or upper
8747 * bound (if upper == 0) on the specified dim.
8749 static int basic_map_dim_is_bounded(__isl_keep isl_basic_map *bmap,
8750 enum isl_dim_type type, unsigned pos, int lower, int upper)
8757 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), return -1);
8759 pos += isl_basic_map_offset(bmap, type);
8761 for (i = 0; i < bmap->n_div; ++i) {
8762 if (isl_int_is_zero(bmap->div[i][0]))
8764 if (!isl_int_is_zero(bmap->div[i][1 + pos]))
8768 for (i = 0; i < bmap->n_eq; ++i)
8769 if (!isl_int_is_zero(bmap->eq[i][pos]))
8772 for (i = 0; i < bmap->n_ineq; ++i) {
8773 int sgn = isl_int_sgn(bmap->ineq[i][pos]);
8780 return lower && upper;
8783 int isl_basic_map_dim_is_bounded(__isl_keep isl_basic_map *bmap,
8784 enum isl_dim_type type, unsigned pos)
8786 return basic_map_dim_is_bounded(bmap, type, pos, 0, 0);
8789 int isl_basic_map_dim_has_lower_bound(__isl_keep isl_basic_map *bmap,
8790 enum isl_dim_type type, unsigned pos)
8792 return basic_map_dim_is_bounded(bmap, type, pos, 0, 1);
8795 int isl_basic_map_dim_has_upper_bound(__isl_keep isl_basic_map *bmap,
8796 enum isl_dim_type type, unsigned pos)
8798 return basic_map_dim_is_bounded(bmap, type, pos, 1, 0);
8801 int isl_map_dim_is_bounded(__isl_keep isl_map *map,
8802 enum isl_dim_type type, unsigned pos)
8809 for (i = 0; i < map->n; ++i) {
8811 bounded = isl_basic_map_dim_is_bounded(map->p[i], type, pos);
8812 if (bounded < 0 || !bounded)
8819 /* Return 1 if the specified dim is involved in both an upper bound
8820 * and a lower bound.
8822 int isl_set_dim_is_bounded(__isl_keep isl_set *set,
8823 enum isl_dim_type type, unsigned pos)
8825 return isl_map_dim_is_bounded((isl_map *)set, type, pos);
8828 static int has_bound(__isl_keep isl_map *map,
8829 enum isl_dim_type type, unsigned pos,
8830 int (*fn)(__isl_keep isl_basic_map *bmap,
8831 enum isl_dim_type type, unsigned pos))
8838 for (i = 0; i < map->n; ++i) {
8840 bounded = fn(map->p[i], type, pos);
8841 if (bounded < 0 || bounded)
8848 /* Return 1 if the specified dim is involved in any lower bound.
8850 int isl_set_dim_has_lower_bound(__isl_keep isl_set *set,
8851 enum isl_dim_type type, unsigned pos)
8853 return has_bound(set, type, pos, &isl_basic_map_dim_has_lower_bound);
8856 /* Return 1 if the specified dim is involved in any upper bound.
8858 int isl_set_dim_has_upper_bound(__isl_keep isl_set *set,
8859 enum isl_dim_type type, unsigned pos)
8861 return has_bound(set, type, pos, &isl_basic_map_dim_has_upper_bound);
8864 /* For each of the "n" variables starting at "first", determine
8865 * the sign of the variable and put the results in the first "n"
8866 * elements of the array "signs".
8868 * 1 means that the variable is non-negative
8869 * -1 means that the variable is non-positive
8870 * 0 means the variable attains both positive and negative values.
8872 int isl_basic_set_vars_get_sign(__isl_keep isl_basic_set *bset,
8873 unsigned first, unsigned n, int *signs)
8875 isl_vec *bound = NULL;
8876 struct isl_tab *tab = NULL;
8877 struct isl_tab_undo *snap;
8880 if (!bset || !signs)
8883 bound = isl_vec_alloc(bset->ctx, 1 + isl_basic_set_total_dim(bset));
8884 tab = isl_tab_from_basic_set(bset, 0);
8888 isl_seq_clr(bound->el, bound->size);
8889 isl_int_set_si(bound->el[0], -1);
8891 snap = isl_tab_snap(tab);
8892 for (i = 0; i < n; ++i) {
8895 isl_int_set_si(bound->el[1 + first + i], -1);
8896 if (isl_tab_add_ineq(tab, bound->el) < 0)
8899 isl_int_set_si(bound->el[1 + first + i], 0);
8900 if (isl_tab_rollback(tab, snap) < 0)
8908 isl_int_set_si(bound->el[1 + first + i], 1);
8909 if (isl_tab_add_ineq(tab, bound->el) < 0)
8912 isl_int_set_si(bound->el[1 + first + i], 0);
8913 if (isl_tab_rollback(tab, snap) < 0)
8916 signs[i] = empty ? -1 : 0;
8920 isl_vec_free(bound);
8924 isl_vec_free(bound);
8928 int isl_basic_set_dims_get_sign(__isl_keep isl_basic_set *bset,
8929 enum isl_dim_type type, unsigned first, unsigned n, int *signs)
8931 if (!bset || !signs)
8933 isl_assert(bset->ctx, first + n <= isl_basic_set_dim(bset, type),
8936 first += pos(bset->dim, type) - 1;
8937 return isl_basic_set_vars_get_sign(bset, first, n, signs);
8940 /* Check if the given basic map is obviously single-valued.
8941 * In particular, for each output dimension, check that there is
8942 * an equality that defines the output dimension in terms of
8943 * earlier dimensions.
8945 int isl_basic_map_plain_is_single_valued(__isl_keep isl_basic_map *bmap)
8955 total = 1 + isl_basic_map_total_dim(bmap);
8956 n_out = isl_basic_map_dim(bmap, isl_dim_out);
8957 o_out = isl_basic_map_offset(bmap, isl_dim_out);
8959 for (i = 0; i < n_out; ++i) {
8960 for (j = 0; j < bmap->n_eq; ++j) {
8961 if (isl_int_is_zero(bmap->eq[j][o_out + i]))
8963 if (isl_seq_first_non_zero(bmap->eq[j] + o_out + i + 1,
8964 total - (o_out + i + 1)) == -1)
8967 if (j >= bmap->n_eq)
8974 /* Check if the given basic map is single-valued.
8979 * and check if the result is a subset of the identity mapping.
8981 int isl_basic_map_is_single_valued(__isl_keep isl_basic_map *bmap)
8984 isl_basic_map *test;
8988 sv = isl_basic_map_plain_is_single_valued(bmap);
8992 test = isl_basic_map_reverse(isl_basic_map_copy(bmap));
8993 test = isl_basic_map_apply_range(test, isl_basic_map_copy(bmap));
8995 space = isl_basic_map_get_space(bmap);
8996 space = isl_space_map_from_set(isl_space_range(space));
8997 id = isl_basic_map_identity(space);
8999 sv = isl_basic_map_is_subset(test, id);
9001 isl_basic_map_free(test);
9002 isl_basic_map_free(id);
9007 /* Check if the given map is obviously single-valued.
9009 int isl_map_plain_is_single_valued(__isl_keep isl_map *map)
9018 return isl_basic_map_plain_is_single_valued(map->p[0]);
9021 /* Check if the given map is single-valued.
9026 * and check if the result is a subset of the identity mapping.
9028 int isl_map_is_single_valued(__isl_keep isl_map *map)
9035 sv = isl_map_plain_is_single_valued(map);
9039 test = isl_map_reverse(isl_map_copy(map));
9040 test = isl_map_apply_range(test, isl_map_copy(map));
9042 dim = isl_space_map_from_set(isl_space_range(isl_map_get_space(map)));
9043 id = isl_map_identity(dim);
9045 sv = isl_map_is_subset(test, id);
9053 int isl_map_is_injective(__isl_keep isl_map *map)
9057 map = isl_map_copy(map);
9058 map = isl_map_reverse(map);
9059 in = isl_map_is_single_valued(map);
9065 /* Check if the given map is obviously injective.
9067 int isl_map_plain_is_injective(__isl_keep isl_map *map)
9071 map = isl_map_copy(map);
9072 map = isl_map_reverse(map);
9073 in = isl_map_plain_is_single_valued(map);
9079 int isl_map_is_bijective(__isl_keep isl_map *map)
9083 sv = isl_map_is_single_valued(map);
9087 return isl_map_is_injective(map);
9090 int isl_set_is_singleton(__isl_keep isl_set *set)
9092 return isl_map_is_single_valued((isl_map *)set);
9095 int isl_map_is_translation(__isl_keep isl_map *map)
9100 delta = isl_map_deltas(isl_map_copy(map));
9101 ok = isl_set_is_singleton(delta);
9102 isl_set_free(delta);
9107 static int unique(isl_int *p, unsigned pos, unsigned len)
9109 if (isl_seq_first_non_zero(p, pos) != -1)
9111 if (isl_seq_first_non_zero(p + pos + 1, len - pos - 1) != -1)
9116 int isl_basic_set_is_box(__isl_keep isl_basic_set *bset)
9125 if (isl_basic_set_dim(bset, isl_dim_div) != 0)
9128 nvar = isl_basic_set_dim(bset, isl_dim_set);
9129 ovar = isl_space_offset(bset->dim, isl_dim_set);
9130 for (j = 0; j < nvar; ++j) {
9131 int lower = 0, upper = 0;
9132 for (i = 0; i < bset->n_eq; ++i) {
9133 if (isl_int_is_zero(bset->eq[i][1 + ovar + j]))
9135 if (!unique(bset->eq[i] + 1 + ovar, j, nvar))
9141 for (i = 0; i < bset->n_ineq; ++i) {
9142 if (isl_int_is_zero(bset->ineq[i][1 + ovar + j]))
9144 if (!unique(bset->ineq[i] + 1 + ovar, j, nvar))
9146 if (isl_int_is_pos(bset->ineq[i][1 + ovar + j]))
9151 if (!lower || !upper)
9158 int isl_set_is_box(__isl_keep isl_set *set)
9165 return isl_basic_set_is_box(set->p[0]);
9168 int isl_basic_set_is_wrapping(__isl_keep isl_basic_set *bset)
9173 return isl_space_is_wrapping(bset->dim);
9176 int isl_set_is_wrapping(__isl_keep isl_set *set)
9181 return isl_space_is_wrapping(set->dim);
9184 __isl_give isl_basic_set *isl_basic_map_wrap(__isl_take isl_basic_map *bmap)
9186 bmap = isl_basic_map_cow(bmap);
9190 bmap->dim = isl_space_wrap(bmap->dim);
9194 bmap = isl_basic_map_finalize(bmap);
9196 return (isl_basic_set *)bmap;
9198 isl_basic_map_free(bmap);
9202 __isl_give isl_set *isl_map_wrap(__isl_take isl_map *map)
9206 map = isl_map_cow(map);
9210 for (i = 0; i < map->n; ++i) {
9211 map->p[i] = (isl_basic_map *)isl_basic_map_wrap(map->p[i]);
9215 map->dim = isl_space_wrap(map->dim);
9219 return (isl_set *)map;
9225 __isl_give isl_basic_map *isl_basic_set_unwrap(__isl_take isl_basic_set *bset)
9227 bset = isl_basic_set_cow(bset);
9231 bset->dim = isl_space_unwrap(bset->dim);
9235 bset = isl_basic_set_finalize(bset);
9237 return (isl_basic_map *)bset;
9239 isl_basic_set_free(bset);
9243 __isl_give isl_map *isl_set_unwrap(__isl_take isl_set *set)
9250 if (!isl_set_is_wrapping(set))
9251 isl_die(set->ctx, isl_error_invalid, "not a wrapping set",
9254 set = isl_set_cow(set);
9258 for (i = 0; i < set->n; ++i) {
9259 set->p[i] = (isl_basic_set *)isl_basic_set_unwrap(set->p[i]);
9264 set->dim = isl_space_unwrap(set->dim);
9268 return (isl_map *)set;
9274 __isl_give isl_basic_map *isl_basic_map_reset(__isl_take isl_basic_map *bmap,
9275 enum isl_dim_type type)
9280 if (!isl_space_is_named_or_nested(bmap->dim, type))
9283 bmap = isl_basic_map_cow(bmap);
9287 bmap->dim = isl_space_reset(bmap->dim, type);
9291 bmap = isl_basic_map_finalize(bmap);
9295 isl_basic_map_free(bmap);
9299 __isl_give isl_map *isl_map_reset(__isl_take isl_map *map,
9300 enum isl_dim_type type)
9307 if (!isl_space_is_named_or_nested(map->dim, type))
9310 map = isl_map_cow(map);
9314 for (i = 0; i < map->n; ++i) {
9315 map->p[i] = isl_basic_map_reset(map->p[i], type);
9319 map->dim = isl_space_reset(map->dim, type);
9329 __isl_give isl_basic_map *isl_basic_map_flatten(__isl_take isl_basic_map *bmap)
9334 if (!bmap->dim->nested[0] && !bmap->dim->nested[1])
9337 bmap = isl_basic_map_cow(bmap);
9341 bmap->dim = isl_space_flatten(bmap->dim);
9345 bmap = isl_basic_map_finalize(bmap);
9349 isl_basic_map_free(bmap);
9353 __isl_give isl_basic_set *isl_basic_set_flatten(__isl_take isl_basic_set *bset)
9355 return (isl_basic_set *)isl_basic_map_flatten((isl_basic_map *)bset);
9358 __isl_give isl_basic_map *isl_basic_map_flatten_domain(
9359 __isl_take isl_basic_map *bmap)
9364 if (!bmap->dim->nested[0])
9367 bmap = isl_basic_map_cow(bmap);
9371 bmap->dim = isl_space_flatten_domain(bmap->dim);
9375 bmap = isl_basic_map_finalize(bmap);
9379 isl_basic_map_free(bmap);
9383 __isl_give isl_basic_map *isl_basic_map_flatten_range(
9384 __isl_take isl_basic_map *bmap)
9389 if (!bmap->dim->nested[1])
9392 bmap = isl_basic_map_cow(bmap);
9396 bmap->dim = isl_space_flatten_range(bmap->dim);
9400 bmap = isl_basic_map_finalize(bmap);
9404 isl_basic_map_free(bmap);
9408 __isl_give isl_map *isl_map_flatten(__isl_take isl_map *map)
9415 if (!map->dim->nested[0] && !map->dim->nested[1])
9418 map = isl_map_cow(map);
9422 for (i = 0; i < map->n; ++i) {
9423 map->p[i] = isl_basic_map_flatten(map->p[i]);
9427 map->dim = isl_space_flatten(map->dim);
9437 __isl_give isl_set *isl_set_flatten(__isl_take isl_set *set)
9439 return (isl_set *)isl_map_flatten((isl_map *)set);
9442 __isl_give isl_map *isl_set_flatten_map(__isl_take isl_set *set)
9444 isl_space *dim, *flat_dim;
9447 dim = isl_set_get_space(set);
9448 flat_dim = isl_space_flatten(isl_space_copy(dim));
9449 map = isl_map_identity(isl_space_join(isl_space_reverse(dim), flat_dim));
9450 map = isl_map_intersect_domain(map, set);
9455 __isl_give isl_map *isl_map_flatten_domain(__isl_take isl_map *map)
9462 if (!map->dim->nested[0])
9465 map = isl_map_cow(map);
9469 for (i = 0; i < map->n; ++i) {
9470 map->p[i] = isl_basic_map_flatten_domain(map->p[i]);
9474 map->dim = isl_space_flatten_domain(map->dim);
9484 __isl_give isl_map *isl_map_flatten_range(__isl_take isl_map *map)
9491 if (!map->dim->nested[1])
9494 map = isl_map_cow(map);
9498 for (i = 0; i < map->n; ++i) {
9499 map->p[i] = isl_basic_map_flatten_range(map->p[i]);
9503 map->dim = isl_space_flatten_range(map->dim);
9513 /* Reorder the dimensions of "bmap" according to the given dim_map
9514 * and set the dimension specification to "dim".
9516 __isl_give isl_basic_map *isl_basic_map_realign(__isl_take isl_basic_map *bmap,
9517 __isl_take isl_space *dim, __isl_take struct isl_dim_map *dim_map)
9522 bmap = isl_basic_map_cow(bmap);
9523 if (!bmap || !dim || !dim_map)
9526 flags = bmap->flags;
9527 ISL_FL_CLR(flags, ISL_BASIC_MAP_FINAL);
9528 ISL_FL_CLR(flags, ISL_BASIC_MAP_NORMALIZED);
9529 ISL_FL_CLR(flags, ISL_BASIC_MAP_NORMALIZED_DIVS);
9530 res = isl_basic_map_alloc_space(dim,
9531 bmap->n_div, bmap->n_eq, bmap->n_ineq);
9532 res = isl_basic_map_add_constraints_dim_map(res, bmap, dim_map);
9535 res = isl_basic_map_finalize(res);
9539 isl_basic_map_free(bmap);
9540 isl_space_free(dim);
9544 /* Reorder the dimensions of "map" according to given reordering.
9546 __isl_give isl_map *isl_map_realign(__isl_take isl_map *map,
9547 __isl_take isl_reordering *r)
9550 struct isl_dim_map *dim_map;
9552 map = isl_map_cow(map);
9553 dim_map = isl_dim_map_from_reordering(r);
9554 if (!map || !r || !dim_map)
9557 for (i = 0; i < map->n; ++i) {
9558 struct isl_dim_map *dim_map_i;
9560 dim_map_i = isl_dim_map_extend(dim_map, map->p[i]);
9562 map->p[i] = isl_basic_map_realign(map->p[i],
9563 isl_space_copy(r->dim), dim_map_i);
9569 map = isl_map_reset_space(map, isl_space_copy(r->dim));
9571 isl_reordering_free(r);
9577 isl_reordering_free(r);
9581 __isl_give isl_set *isl_set_realign(__isl_take isl_set *set,
9582 __isl_take isl_reordering *r)
9584 return (isl_set *)isl_map_realign((isl_map *)set, r);
9587 __isl_give isl_map *isl_map_align_params(__isl_take isl_map *map,
9588 __isl_take isl_space *model)
9595 ctx = isl_space_get_ctx(model);
9596 if (!isl_space_has_named_params(model))
9597 isl_die(ctx, isl_error_invalid,
9598 "model has unnamed parameters", goto error);
9599 if (!isl_space_has_named_params(map->dim))
9600 isl_die(ctx, isl_error_invalid,
9601 "relation has unnamed parameters", goto error);
9602 if (!isl_space_match(map->dim, isl_dim_param, model, isl_dim_param)) {
9603 isl_reordering *exp;
9605 model = isl_space_drop_dims(model, isl_dim_in,
9606 0, isl_space_dim(model, isl_dim_in));
9607 model = isl_space_drop_dims(model, isl_dim_out,
9608 0, isl_space_dim(model, isl_dim_out));
9609 exp = isl_parameter_alignment_reordering(map->dim, model);
9610 exp = isl_reordering_extend_space(exp, isl_map_get_space(map));
9611 map = isl_map_realign(map, exp);
9614 isl_space_free(model);
9617 isl_space_free(model);
9622 __isl_give isl_set *isl_set_align_params(__isl_take isl_set *set,
9623 __isl_take isl_space *model)
9625 return isl_map_align_params(set, model);
9628 __isl_give isl_mat *isl_basic_map_equalities_matrix(
9629 __isl_keep isl_basic_map *bmap, enum isl_dim_type c1,
9630 enum isl_dim_type c2, enum isl_dim_type c3,
9631 enum isl_dim_type c4, enum isl_dim_type c5)
9633 enum isl_dim_type c[5] = { c1, c2, c3, c4, c5 };
9634 struct isl_mat *mat;
9640 mat = isl_mat_alloc(bmap->ctx, bmap->n_eq,
9641 isl_basic_map_total_dim(bmap) + 1);
9644 for (i = 0; i < bmap->n_eq; ++i)
9645 for (j = 0, pos = 0; j < 5; ++j) {
9646 int off = isl_basic_map_offset(bmap, c[j]);
9647 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
9648 isl_int_set(mat->row[i][pos],
9649 bmap->eq[i][off + k]);
9657 __isl_give isl_mat *isl_basic_map_inequalities_matrix(
9658 __isl_keep isl_basic_map *bmap, enum isl_dim_type c1,
9659 enum isl_dim_type c2, enum isl_dim_type c3,
9660 enum isl_dim_type c4, enum isl_dim_type c5)
9662 enum isl_dim_type c[5] = { c1, c2, c3, c4, c5 };
9663 struct isl_mat *mat;
9669 mat = isl_mat_alloc(bmap->ctx, bmap->n_ineq,
9670 isl_basic_map_total_dim(bmap) + 1);
9673 for (i = 0; i < bmap->n_ineq; ++i)
9674 for (j = 0, pos = 0; j < 5; ++j) {
9675 int off = isl_basic_map_offset(bmap, c[j]);
9676 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
9677 isl_int_set(mat->row[i][pos],
9678 bmap->ineq[i][off + k]);
9686 __isl_give isl_basic_map *isl_basic_map_from_constraint_matrices(
9687 __isl_take isl_space *dim,
9688 __isl_take isl_mat *eq, __isl_take isl_mat *ineq, enum isl_dim_type c1,
9689 enum isl_dim_type c2, enum isl_dim_type c3,
9690 enum isl_dim_type c4, enum isl_dim_type c5)
9692 enum isl_dim_type c[5] = { c1, c2, c3, c4, c5 };
9693 isl_basic_map *bmap;
9699 if (!dim || !eq || !ineq)
9702 if (eq->n_col != ineq->n_col)
9703 isl_die(dim->ctx, isl_error_invalid,
9704 "equalities and inequalities matrices should have "
9705 "same number of columns", goto error);
9707 total = 1 + isl_space_dim(dim, isl_dim_all);
9709 if (eq->n_col < total)
9710 isl_die(dim->ctx, isl_error_invalid,
9711 "number of columns too small", goto error);
9713 extra = eq->n_col - total;
9715 bmap = isl_basic_map_alloc_space(isl_space_copy(dim), extra,
9716 eq->n_row, ineq->n_row);
9719 for (i = 0; i < extra; ++i) {
9720 k = isl_basic_map_alloc_div(bmap);
9723 isl_int_set_si(bmap->div[k][0], 0);
9725 for (i = 0; i < eq->n_row; ++i) {
9726 l = isl_basic_map_alloc_equality(bmap);
9729 for (j = 0, pos = 0; j < 5; ++j) {
9730 int off = isl_basic_map_offset(bmap, c[j]);
9731 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
9732 isl_int_set(bmap->eq[l][off + k],
9738 for (i = 0; i < ineq->n_row; ++i) {
9739 l = isl_basic_map_alloc_inequality(bmap);
9742 for (j = 0, pos = 0; j < 5; ++j) {
9743 int off = isl_basic_map_offset(bmap, c[j]);
9744 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
9745 isl_int_set(bmap->ineq[l][off + k],
9752 isl_space_free(dim);
9758 isl_space_free(dim);
9764 __isl_give isl_mat *isl_basic_set_equalities_matrix(
9765 __isl_keep isl_basic_set *bset, enum isl_dim_type c1,
9766 enum isl_dim_type c2, enum isl_dim_type c3, enum isl_dim_type c4)
9768 return isl_basic_map_equalities_matrix((isl_basic_map *)bset,
9769 c1, c2, c3, c4, isl_dim_in);
9772 __isl_give isl_mat *isl_basic_set_inequalities_matrix(
9773 __isl_keep isl_basic_set *bset, enum isl_dim_type c1,
9774 enum isl_dim_type c2, enum isl_dim_type c3, enum isl_dim_type c4)
9776 return isl_basic_map_inequalities_matrix((isl_basic_map *)bset,
9777 c1, c2, c3, c4, isl_dim_in);
9780 __isl_give isl_basic_set *isl_basic_set_from_constraint_matrices(
9781 __isl_take isl_space *dim,
9782 __isl_take isl_mat *eq, __isl_take isl_mat *ineq, enum isl_dim_type c1,
9783 enum isl_dim_type c2, enum isl_dim_type c3, enum isl_dim_type c4)
9785 return (isl_basic_set*)
9786 isl_basic_map_from_constraint_matrices(dim, eq, ineq,
9787 c1, c2, c3, c4, isl_dim_in);
9790 int isl_basic_map_can_zip(__isl_keep isl_basic_map *bmap)
9795 return isl_space_can_zip(bmap->dim);
9798 int isl_map_can_zip(__isl_keep isl_map *map)
9803 return isl_space_can_zip(map->dim);
9806 /* Given a basic map (A -> B) -> (C -> D), return the corresponding basic map
9807 * (A -> C) -> (B -> D).
9809 __isl_give isl_basic_map *isl_basic_map_zip(__isl_take isl_basic_map *bmap)
9818 if (!isl_basic_map_can_zip(bmap))
9819 isl_die(bmap->ctx, isl_error_invalid,
9820 "basic map cannot be zipped", goto error);
9821 pos = isl_basic_map_offset(bmap, isl_dim_in) +
9822 isl_space_dim(bmap->dim->nested[0], isl_dim_in);
9823 n1 = isl_space_dim(bmap->dim->nested[0], isl_dim_out);
9824 n2 = isl_space_dim(bmap->dim->nested[1], isl_dim_in);
9825 bmap = isl_basic_map_cow(bmap);
9826 bmap = isl_basic_map_swap_vars(bmap, pos, n1, n2);
9829 bmap->dim = isl_space_zip(bmap->dim);
9834 isl_basic_map_free(bmap);
9838 /* Given a map (A -> B) -> (C -> D), return the corresponding map
9839 * (A -> C) -> (B -> D).
9841 __isl_give isl_map *isl_map_zip(__isl_take isl_map *map)
9848 if (!isl_map_can_zip(map))
9849 isl_die(map->ctx, isl_error_invalid, "map cannot be zipped",
9852 map = isl_map_cow(map);
9856 for (i = 0; i < map->n; ++i) {
9857 map->p[i] = isl_basic_map_zip(map->p[i]);
9862 map->dim = isl_space_zip(map->dim);
9872 /* Can we apply isl_basic_map_curry to "bmap"?
9873 * That is, does it have a nested relation in its domain?
9875 int isl_basic_map_can_curry(__isl_keep isl_basic_map *bmap)
9880 return isl_space_can_curry(bmap->dim);
9883 /* Can we apply isl_map_curry to "map"?
9884 * That is, does it have a nested relation in its domain?
9886 int isl_map_can_curry(__isl_keep isl_map *map)
9891 return isl_space_can_curry(map->dim);
9894 /* Given a basic map (A -> B) -> C, return the corresponding basic map
9897 __isl_give isl_basic_map *isl_basic_map_curry(__isl_take isl_basic_map *bmap)
9903 if (!isl_basic_map_can_curry(bmap))
9904 isl_die(bmap->ctx, isl_error_invalid,
9905 "basic map cannot be curried", goto error);
9906 bmap->dim = isl_space_curry(bmap->dim);
9911 isl_basic_map_free(bmap);
9915 /* Given a map (A -> B) -> C, return the corresponding map
9918 __isl_give isl_map *isl_map_curry(__isl_take isl_map *map)
9925 if (!isl_map_can_curry(map))
9926 isl_die(map->ctx, isl_error_invalid, "map cannot be curried",
9929 map = isl_map_cow(map);
9933 for (i = 0; i < map->n; ++i) {
9934 map->p[i] = isl_basic_map_curry(map->p[i]);
9939 map->dim = isl_space_curry(map->dim);
9949 /* Construct a basic map mapping the domain of the affine expression
9950 * to a one-dimensional range prescribed by the affine expression.
9952 __isl_give isl_basic_map *isl_basic_map_from_aff(__isl_take isl_aff *aff)
9956 isl_local_space *ls;
9957 isl_basic_map *bmap;
9962 ls = isl_aff_get_local_space(aff);
9963 bmap = isl_basic_map_from_local_space(ls);
9964 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
9965 k = isl_basic_map_alloc_equality(bmap);
9969 pos = isl_basic_map_offset(bmap, isl_dim_out);
9970 isl_seq_cpy(bmap->eq[k], aff->v->el + 1, pos);
9971 isl_int_neg(bmap->eq[k][pos], aff->v->el[0]);
9972 isl_seq_cpy(bmap->eq[k] + pos + 1, aff->v->el + 1 + pos,
9973 aff->v->size - (pos + 1));
9976 bmap = isl_basic_map_finalize(bmap);
9980 isl_basic_map_free(bmap);
9984 /* Construct a map mapping the domain of the affine expression
9985 * to a one-dimensional range prescribed by the affine expression.
9987 __isl_give isl_map *isl_map_from_aff(__isl_take isl_aff *aff)
9989 isl_basic_map *bmap;
9991 bmap = isl_basic_map_from_aff(aff);
9992 return isl_map_from_basic_map(bmap);
9995 /* Construct a basic map mapping the domain the multi-affine expression
9996 * to its range, with each dimension in the range equated to the
9997 * corresponding affine expression.
9999 __isl_give isl_basic_map *isl_basic_map_from_multi_aff(
10000 __isl_take isl_multi_aff *maff)
10004 isl_basic_map *bmap;
10009 if (isl_space_dim(maff->space, isl_dim_out) != maff->n)
10010 isl_die(isl_multi_aff_get_ctx(maff), isl_error_internal,
10011 "invalid space", return isl_multi_aff_free(maff));
10013 space = isl_space_domain(isl_multi_aff_get_space(maff));
10014 bmap = isl_basic_map_universe(isl_space_from_domain(space));
10016 for (i = 0; i < maff->n; ++i) {
10018 isl_basic_map *bmap_i;
10020 aff = isl_aff_copy(maff->p[i]);
10021 bmap_i = isl_basic_map_from_aff(aff);
10023 bmap = isl_basic_map_flat_range_product(bmap, bmap_i);
10026 bmap = isl_basic_map_reset_space(bmap, isl_multi_aff_get_space(maff));
10028 isl_multi_aff_free(maff);
10032 /* Construct a map mapping the domain the multi-affine expression
10033 * to its range, with each dimension in the range equated to the
10034 * corresponding affine expression.
10036 __isl_give isl_map *isl_map_from_multi_aff(__isl_take isl_multi_aff *maff)
10038 isl_basic_map *bmap;
10040 bmap = isl_basic_map_from_multi_aff(maff);
10041 return isl_map_from_basic_map(bmap);
10044 /* Construct a basic map mapping a domain in the given space to
10045 * to an n-dimensional range, with n the number of elements in the list,
10046 * where each coordinate in the range is prescribed by the
10047 * corresponding affine expression.
10048 * The domains of all affine expressions in the list are assumed to match
10051 __isl_give isl_basic_map *isl_basic_map_from_aff_list(
10052 __isl_take isl_space *domain_dim, __isl_take isl_aff_list *list)
10056 isl_basic_map *bmap;
10061 dim = isl_space_from_domain(domain_dim);
10062 bmap = isl_basic_map_universe(dim);
10064 for (i = 0; i < list->n; ++i) {
10066 isl_basic_map *bmap_i;
10068 aff = isl_aff_copy(list->p[i]);
10069 bmap_i = isl_basic_map_from_aff(aff);
10071 bmap = isl_basic_map_flat_range_product(bmap, bmap_i);
10074 isl_aff_list_free(list);
10078 __isl_give isl_set *isl_set_equate(__isl_take isl_set *set,
10079 enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2)
10081 return isl_map_equate(set, type1, pos1, type2, pos2);
10084 /* Construct a basic map where the given dimensions are equal to each other.
10086 static __isl_give isl_basic_map *equator(__isl_take isl_space *space,
10087 enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2)
10089 isl_basic_map *bmap = NULL;
10095 if (pos1 >= isl_space_dim(space, type1))
10096 isl_die(isl_space_get_ctx(space), isl_error_invalid,
10097 "index out of bounds", goto error);
10098 if (pos2 >= isl_space_dim(space, type2))
10099 isl_die(isl_space_get_ctx(space), isl_error_invalid,
10100 "index out of bounds", goto error);
10102 if (type1 == type2 && pos1 == pos2)
10103 return isl_basic_map_universe(space);
10105 bmap = isl_basic_map_alloc_space(isl_space_copy(space), 0, 1, 0);
10106 i = isl_basic_map_alloc_equality(bmap);
10109 isl_seq_clr(bmap->eq[i], 1 + isl_basic_map_total_dim(bmap));
10110 pos1 += isl_basic_map_offset(bmap, type1);
10111 pos2 += isl_basic_map_offset(bmap, type2);
10112 isl_int_set_si(bmap->eq[i][pos1], -1);
10113 isl_int_set_si(bmap->eq[i][pos2], 1);
10114 bmap = isl_basic_map_finalize(bmap);
10115 isl_space_free(space);
10118 isl_space_free(space);
10119 isl_basic_map_free(bmap);
10123 /* Add a constraint imposing that the given two dimensions are equal.
10125 __isl_give isl_basic_map *isl_basic_map_equate(__isl_take isl_basic_map *bmap,
10126 enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2)
10130 eq = equator(isl_basic_map_get_space(bmap), type1, pos1, type2, pos2);
10132 bmap = isl_basic_map_intersect(bmap, eq);
10137 /* Add a constraint imposing that the given two dimensions are equal.
10139 __isl_give isl_map *isl_map_equate(__isl_take isl_map *map,
10140 enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2)
10142 isl_basic_map *bmap;
10144 bmap = equator(isl_map_get_space(map), type1, pos1, type2, pos2);
10146 map = isl_map_intersect(map, isl_map_from_basic_map(bmap));
10151 /* Add a constraint imposing that the given two dimensions have opposite values.
10153 __isl_give isl_map *isl_map_oppose(__isl_take isl_map *map,
10154 enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2)
10156 isl_basic_map *bmap = NULL;
10162 if (pos1 >= isl_map_dim(map, type1))
10163 isl_die(map->ctx, isl_error_invalid,
10164 "index out of bounds", goto error);
10165 if (pos2 >= isl_map_dim(map, type2))
10166 isl_die(map->ctx, isl_error_invalid,
10167 "index out of bounds", goto error);
10169 bmap = isl_basic_map_alloc_space(isl_map_get_space(map), 0, 1, 0);
10170 i = isl_basic_map_alloc_equality(bmap);
10173 isl_seq_clr(bmap->eq[i], 1 + isl_basic_map_total_dim(bmap));
10174 pos1 += isl_basic_map_offset(bmap, type1);
10175 pos2 += isl_basic_map_offset(bmap, type2);
10176 isl_int_set_si(bmap->eq[i][pos1], 1);
10177 isl_int_set_si(bmap->eq[i][pos2], 1);
10178 bmap = isl_basic_map_finalize(bmap);
10180 map = isl_map_intersect(map, isl_map_from_basic_map(bmap));
10184 isl_basic_map_free(bmap);
10189 /* Add a constraint imposing that the value of the first dimension is
10190 * greater than that of the second.
10192 __isl_give isl_map *isl_map_order_gt(__isl_take isl_map *map,
10193 enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2)
10195 isl_basic_map *bmap = NULL;
10201 if (pos1 >= isl_map_dim(map, type1))
10202 isl_die(map->ctx, isl_error_invalid,
10203 "index out of bounds", goto error);
10204 if (pos2 >= isl_map_dim(map, type2))
10205 isl_die(map->ctx, isl_error_invalid,
10206 "index out of bounds", goto error);
10208 if (type1 == type2 && pos1 == pos2) {
10209 isl_space *space = isl_map_get_space(map);
10211 return isl_map_empty(space);
10214 bmap = isl_basic_map_alloc_space(isl_map_get_space(map), 0, 0, 1);
10215 i = isl_basic_map_alloc_inequality(bmap);
10218 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
10219 pos1 += isl_basic_map_offset(bmap, type1);
10220 pos2 += isl_basic_map_offset(bmap, type2);
10221 isl_int_set_si(bmap->ineq[i][pos1], 1);
10222 isl_int_set_si(bmap->ineq[i][pos2], -1);
10223 isl_int_set_si(bmap->ineq[i][0], -1);
10224 bmap = isl_basic_map_finalize(bmap);
10226 map = isl_map_intersect(map, isl_map_from_basic_map(bmap));
10230 isl_basic_map_free(bmap);
10235 /* Add a constraint imposing that the value of the first dimension is
10236 * smaller than that of the second.
10238 __isl_give isl_map *isl_map_order_lt(__isl_take isl_map *map,
10239 enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2)
10241 return isl_map_order_gt(map, type2, pos2, type1, pos1);
10244 __isl_give isl_aff *isl_basic_map_get_div(__isl_keep isl_basic_map *bmap,
10248 isl_local_space *ls;
10253 if (!isl_basic_map_divs_known(bmap))
10254 isl_die(isl_basic_map_get_ctx(bmap), isl_error_invalid,
10255 "some divs are unknown", return NULL);
10257 ls = isl_basic_map_get_local_space(bmap);
10258 div = isl_local_space_get_div(ls, pos);
10259 isl_local_space_free(ls);
10264 __isl_give isl_aff *isl_basic_set_get_div(__isl_keep isl_basic_set *bset,
10267 return isl_basic_map_get_div(bset, pos);
10270 /* Plug in "subs" for dimension "type", "pos" of "bset".
10272 * Let i be the dimension to replace and let "subs" be of the form
10276 * Any integer division with a non-zero coefficient for i,
10278 * floor((a i + g)/m)
10282 * floor((a f + d g)/(m d))
10284 * Constraints of the form
10292 __isl_give isl_basic_set *isl_basic_set_substitute(
10293 __isl_take isl_basic_set *bset,
10294 enum isl_dim_type type, unsigned pos, __isl_keep isl_aff *subs)
10300 if (bset && isl_basic_set_plain_is_empty(bset))
10303 bset = isl_basic_set_cow(bset);
10304 if (!bset || !subs)
10307 ctx = isl_basic_set_get_ctx(bset);
10308 if (!isl_space_is_equal(bset->dim, subs->ls->dim))
10309 isl_die(ctx, isl_error_invalid,
10310 "spaces don't match", goto error);
10311 if (isl_local_space_dim(subs->ls, isl_dim_div) != 0)
10312 isl_die(ctx, isl_error_unsupported,
10313 "cannot handle divs yet", goto error);
10315 pos += isl_basic_set_offset(bset, type);
10319 for (i = 0; i < bset->n_eq; ++i) {
10320 if (isl_int_is_zero(bset->eq[i][pos]))
10322 isl_int_set(v, bset->eq[i][pos]);
10323 isl_int_set_si(bset->eq[i][pos], 0);
10324 isl_seq_combine(bset->eq[i], subs->v->el[0], bset->eq[i],
10325 v, subs->v->el + 1, subs->v->size - 1);
10328 for (i = 0; i < bset->n_ineq; ++i) {
10329 if (isl_int_is_zero(bset->ineq[i][pos]))
10331 isl_int_set(v, bset->ineq[i][pos]);
10332 isl_int_set_si(bset->ineq[i][pos], 0);
10333 isl_seq_combine(bset->ineq[i], subs->v->el[0], bset->ineq[i],
10334 v, subs->v->el + 1, subs->v->size - 1);
10337 for (i = 0; i < bset->n_div; ++i) {
10338 if (isl_int_is_zero(bset->div[i][1 + pos]))
10340 isl_int_set(v, bset->div[i][1 + pos]);
10341 isl_int_set_si(bset->div[i][1 + pos], 0);
10342 isl_seq_combine(bset->div[i] + 1,
10343 subs->v->el[0], bset->div[i] + 1,
10344 v, subs->v->el + 1, subs->v->size - 1);
10345 isl_int_mul(bset->div[i][0], bset->div[i][0], subs->v->el[0]);
10350 bset = isl_basic_set_simplify(bset);
10351 return isl_basic_set_finalize(bset);
10353 isl_basic_set_free(bset);
10357 /* Plug in "subs" for dimension "type", "pos" of "set".
10359 __isl_give isl_set *isl_set_substitute(__isl_take isl_set *set,
10360 enum isl_dim_type type, unsigned pos, __isl_keep isl_aff *subs)
10364 if (set && isl_set_plain_is_empty(set))
10367 set = isl_set_cow(set);
10371 for (i = set->n - 1; i >= 0; --i) {
10372 set->p[i] = isl_basic_set_substitute(set->p[i], type, pos, subs);
10373 if (remove_if_empty(set, i) < 0)