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>
34 static unsigned n(__isl_keep isl_space *dim, enum isl_dim_type type)
37 case isl_dim_param: return dim->nparam;
38 case isl_dim_in: return dim->n_in;
39 case isl_dim_out: return dim->n_out;
40 case isl_dim_all: return dim->nparam + dim->n_in + dim->n_out;
45 static unsigned pos(__isl_keep isl_space *dim, enum isl_dim_type type)
48 case isl_dim_param: return 1;
49 case isl_dim_in: return 1 + dim->nparam;
50 case isl_dim_out: return 1 + dim->nparam + dim->n_in;
55 unsigned isl_basic_map_dim(__isl_keep isl_basic_map *bmap,
56 enum isl_dim_type type)
61 case isl_dim_cst: return 1;
64 case isl_dim_out: return isl_space_dim(bmap->dim, type);
65 case isl_dim_div: return bmap->n_div;
66 case isl_dim_all: return isl_basic_map_total_dim(bmap);
71 unsigned isl_map_dim(__isl_keep isl_map *map, enum isl_dim_type type)
73 return map ? n(map->dim, type) : 0;
76 unsigned isl_set_dim(__isl_keep isl_set *set, enum isl_dim_type type)
78 return set ? n(set->dim, type) : 0;
81 unsigned isl_basic_map_offset(struct isl_basic_map *bmap,
82 enum isl_dim_type type)
84 isl_space *dim = bmap->dim;
86 case isl_dim_cst: return 0;
87 case isl_dim_param: return 1;
88 case isl_dim_in: return 1 + dim->nparam;
89 case isl_dim_out: return 1 + dim->nparam + dim->n_in;
90 case isl_dim_div: return 1 + dim->nparam + dim->n_in + dim->n_out;
95 unsigned isl_basic_set_offset(struct isl_basic_set *bset,
96 enum isl_dim_type type)
98 return isl_basic_map_offset(bset, type);
101 static unsigned map_offset(struct isl_map *map, enum isl_dim_type type)
103 return pos(map->dim, type);
106 unsigned isl_basic_set_dim(__isl_keep isl_basic_set *bset,
107 enum isl_dim_type type)
109 return isl_basic_map_dim(bset, type);
112 unsigned isl_basic_set_n_dim(__isl_keep isl_basic_set *bset)
114 return isl_basic_set_dim(bset, isl_dim_set);
117 unsigned isl_basic_set_n_param(__isl_keep isl_basic_set *bset)
119 return isl_basic_set_dim(bset, isl_dim_param);
122 unsigned isl_basic_set_total_dim(const struct isl_basic_set *bset)
124 return isl_space_dim(bset->dim, isl_dim_all) + bset->n_div;
127 unsigned isl_set_n_dim(__isl_keep isl_set *set)
129 return isl_set_dim(set, isl_dim_set);
132 unsigned isl_set_n_param(__isl_keep isl_set *set)
134 return isl_set_dim(set, isl_dim_param);
137 unsigned isl_basic_map_n_in(const struct isl_basic_map *bmap)
139 return bmap ? bmap->dim->n_in : 0;
142 unsigned isl_basic_map_n_out(const struct isl_basic_map *bmap)
144 return bmap ? bmap->dim->n_out : 0;
147 unsigned isl_basic_map_n_param(const struct isl_basic_map *bmap)
149 return bmap ? bmap->dim->nparam : 0;
152 unsigned isl_basic_map_n_div(const struct isl_basic_map *bmap)
154 return bmap ? bmap->n_div : 0;
157 unsigned isl_basic_map_total_dim(const struct isl_basic_map *bmap)
159 return bmap ? isl_space_dim(bmap->dim, isl_dim_all) + bmap->n_div : 0;
162 unsigned isl_map_n_in(const struct isl_map *map)
164 return map ? map->dim->n_in : 0;
167 unsigned isl_map_n_out(const struct isl_map *map)
169 return map ? map->dim->n_out : 0;
172 unsigned isl_map_n_param(const struct isl_map *map)
174 return map ? map->dim->nparam : 0;
177 int isl_map_compatible_domain(struct isl_map *map, struct isl_set *set)
182 m = isl_space_match(map->dim, isl_dim_param, set->dim, isl_dim_param);
185 return isl_space_tuple_match(map->dim, isl_dim_in, set->dim, isl_dim_set);
188 int isl_basic_map_compatible_domain(struct isl_basic_map *bmap,
189 struct isl_basic_set *bset)
194 m = isl_space_match(bmap->dim, isl_dim_param, bset->dim, isl_dim_param);
197 return isl_space_tuple_match(bmap->dim, isl_dim_in, bset->dim, isl_dim_set);
200 int isl_map_compatible_range(__isl_keep isl_map *map, __isl_keep isl_set *set)
205 m = isl_space_match(map->dim, isl_dim_param, set->dim, isl_dim_param);
208 return isl_space_tuple_match(map->dim, isl_dim_out, set->dim, isl_dim_set);
211 int isl_basic_map_compatible_range(struct isl_basic_map *bmap,
212 struct isl_basic_set *bset)
217 m = isl_space_match(bmap->dim, isl_dim_param, bset->dim, isl_dim_param);
220 return isl_space_tuple_match(bmap->dim, isl_dim_out, bset->dim, isl_dim_set);
223 isl_ctx *isl_basic_map_get_ctx(__isl_keep isl_basic_map *bmap)
225 return bmap ? bmap->ctx : NULL;
228 isl_ctx *isl_basic_set_get_ctx(__isl_keep isl_basic_set *bset)
230 return bset ? bset->ctx : NULL;
233 isl_ctx *isl_map_get_ctx(__isl_keep isl_map *map)
235 return map ? map->ctx : NULL;
238 isl_ctx *isl_set_get_ctx(__isl_keep isl_set *set)
240 return set ? set->ctx : NULL;
243 __isl_give isl_space *isl_basic_map_get_space(__isl_keep isl_basic_map *bmap)
247 return isl_space_copy(bmap->dim);
250 __isl_give isl_space *isl_basic_set_get_space(__isl_keep isl_basic_set *bset)
254 return isl_space_copy(bset->dim);
257 __isl_give isl_local_space *isl_basic_map_get_local_space(
258 __isl_keep isl_basic_map *bmap)
267 total = isl_basic_map_total_dim(bmap);
268 ls = isl_local_space_alloc(isl_space_copy(bmap->dim), bmap->n_div);
272 for (i = 0; i < bmap->n_div; ++i)
273 isl_seq_cpy(ls->div->row[i], bmap->div[i], 2 + total);
278 __isl_give isl_local_space *isl_basic_set_get_local_space(
279 __isl_keep isl_basic_set *bset)
281 return isl_basic_map_get_local_space(bset);
284 __isl_give isl_basic_map *isl_basic_map_from_local_space(
285 __isl_take isl_local_space *ls)
294 n_div = isl_local_space_dim(ls, isl_dim_div);
295 bmap = isl_basic_map_alloc_space(isl_local_space_get_space(ls),
296 n_div, 0, 2 * n_div);
298 for (i = 0; i < n_div; ++i)
299 if (isl_basic_map_alloc_div(bmap) < 0)
302 for (i = 0; i < n_div; ++i) {
303 isl_seq_cpy(bmap->div[i], ls->div->row[i], ls->div->n_col);
304 if (isl_basic_map_add_div_constraints(bmap, i) < 0)
308 isl_local_space_free(ls);
311 isl_local_space_free(ls);
312 isl_basic_map_free(bmap);
316 __isl_give isl_basic_set *isl_basic_set_from_local_space(
317 __isl_take isl_local_space *ls)
319 return isl_basic_map_from_local_space(ls);
322 __isl_give isl_space *isl_map_get_space(__isl_keep isl_map *map)
326 return isl_space_copy(map->dim);
329 __isl_give isl_space *isl_set_get_space(__isl_keep isl_set *set)
333 return isl_space_copy(set->dim);
336 __isl_give isl_basic_map *isl_basic_map_set_tuple_name(
337 __isl_take isl_basic_map *bmap, enum isl_dim_type type, const char *s)
339 bmap = isl_basic_map_cow(bmap);
342 bmap->dim = isl_space_set_tuple_name(bmap->dim, type, s);
345 bmap = isl_basic_map_finalize(bmap);
348 isl_basic_map_free(bmap);
352 __isl_give isl_basic_set *isl_basic_set_set_tuple_name(
353 __isl_take isl_basic_set *bset, const char *s)
355 return isl_basic_map_set_tuple_name(bset, isl_dim_set, s);
358 const char *isl_basic_map_get_tuple_name(__isl_keep isl_basic_map *bmap,
359 enum isl_dim_type type)
361 return bmap ? isl_space_get_tuple_name(bmap->dim, type) : NULL;
364 __isl_give isl_map *isl_map_set_tuple_name(__isl_take isl_map *map,
365 enum isl_dim_type type, const char *s)
369 map = isl_map_cow(map);
373 map->dim = isl_space_set_tuple_name(map->dim, type, s);
377 for (i = 0; i < map->n; ++i) {
378 map->p[i] = isl_basic_map_set_tuple_name(map->p[i], type, s);
389 const char *isl_map_get_tuple_name(__isl_keep isl_map *map,
390 enum isl_dim_type type)
392 return map ? isl_space_get_tuple_name(map->dim, type) : NULL;
395 __isl_give isl_set *isl_set_set_tuple_name(__isl_take isl_set *set,
398 return (isl_set *)isl_map_set_tuple_name((isl_map *)set, isl_dim_set, s);
401 __isl_give isl_map *isl_map_set_tuple_id(__isl_take isl_map *map,
402 enum isl_dim_type type, __isl_take isl_id *id)
404 map = isl_map_cow(map);
406 return isl_id_free(id);
408 map->dim = isl_space_set_tuple_id(map->dim, type, id);
410 return isl_map_reset_space(map, isl_space_copy(map->dim));
413 __isl_give isl_set *isl_set_set_tuple_id(__isl_take isl_set *set,
414 __isl_take isl_id *id)
416 return isl_map_set_tuple_id(set, isl_dim_set, id);
419 __isl_give isl_map *isl_map_reset_tuple_id(__isl_take isl_map *map,
420 enum isl_dim_type type)
422 map = isl_map_cow(map);
426 map->dim = isl_space_reset_tuple_id(map->dim, type);
428 return isl_map_reset_space(map, isl_space_copy(map->dim));
431 __isl_give isl_set *isl_set_reset_tuple_id(__isl_take isl_set *set)
433 return isl_map_reset_tuple_id(set, isl_dim_set);
436 int isl_map_has_tuple_id(__isl_keep isl_map *map, enum isl_dim_type type)
438 return map ? isl_space_has_tuple_id(map->dim, type) : -1;
441 __isl_give isl_id *isl_map_get_tuple_id(__isl_keep isl_map *map,
442 enum isl_dim_type type)
444 return map ? isl_space_get_tuple_id(map->dim, type) : NULL;
447 int isl_set_has_tuple_id(__isl_keep isl_set *set)
449 return isl_map_has_tuple_id(set, isl_dim_set);
452 __isl_give isl_id *isl_set_get_tuple_id(__isl_keep isl_set *set)
454 return isl_map_get_tuple_id(set, isl_dim_set);
457 const char *isl_basic_set_get_tuple_name(__isl_keep isl_basic_set *bset)
459 return bset ? isl_space_get_tuple_name(bset->dim, isl_dim_set) : NULL;
462 const char *isl_set_get_tuple_name(__isl_keep isl_set *set)
464 return set ? isl_space_get_tuple_name(set->dim, isl_dim_set) : NULL;
467 const char *isl_basic_map_get_dim_name(__isl_keep isl_basic_map *bmap,
468 enum isl_dim_type type, unsigned pos)
470 return bmap ? isl_space_get_dim_name(bmap->dim, type, pos) : NULL;
473 const char *isl_basic_set_get_dim_name(__isl_keep isl_basic_set *bset,
474 enum isl_dim_type type, unsigned pos)
476 return bset ? isl_space_get_dim_name(bset->dim, type, pos) : NULL;
479 const char *isl_map_get_dim_name(__isl_keep isl_map *map,
480 enum isl_dim_type type, unsigned pos)
482 return map ? isl_space_get_dim_name(map->dim, type, pos) : NULL;
485 const char *isl_set_get_dim_name(__isl_keep isl_set *set,
486 enum isl_dim_type type, unsigned pos)
488 return set ? isl_space_get_dim_name(set->dim, type, pos) : NULL;
491 __isl_give isl_basic_map *isl_basic_map_set_dim_name(
492 __isl_take isl_basic_map *bmap,
493 enum isl_dim_type type, unsigned pos, const char *s)
497 bmap->dim = isl_space_set_dim_name(bmap->dim, type, pos, s);
502 isl_basic_map_free(bmap);
506 __isl_give isl_map *isl_map_set_dim_name(__isl_take isl_map *map,
507 enum isl_dim_type type, unsigned pos, const char *s)
514 map->dim = isl_space_set_dim_name(map->dim, type, pos, s);
518 for (i = 0; i < map->n; ++i) {
519 map->p[i] = isl_basic_map_set_dim_name(map->p[i], type, pos, s);
530 __isl_give isl_basic_set *isl_basic_set_set_dim_name(
531 __isl_take isl_basic_set *bset,
532 enum isl_dim_type type, unsigned pos, const char *s)
534 return (isl_basic_set *)isl_basic_map_set_dim_name(
535 (isl_basic_map *)bset, type, pos, s);
538 __isl_give isl_set *isl_set_set_dim_name(__isl_take isl_set *set,
539 enum isl_dim_type type, unsigned pos, const char *s)
541 return (isl_set *)isl_map_set_dim_name((isl_map *)set, type, pos, s);
544 int isl_map_has_dim_id(__isl_keep isl_map *map,
545 enum isl_dim_type type, unsigned pos)
547 return map ? isl_space_has_dim_id(map->dim, type, pos) : -1;
550 __isl_give isl_id *isl_map_get_dim_id(__isl_keep isl_map *map,
551 enum isl_dim_type type, unsigned pos)
553 return map ? isl_space_get_dim_id(map->dim, type, pos) : NULL;
556 int isl_set_has_dim_id(__isl_keep isl_set *set,
557 enum isl_dim_type type, unsigned pos)
559 return isl_map_has_dim_id(set, type, pos);
562 __isl_give isl_id *isl_set_get_dim_id(__isl_keep isl_set *set,
563 enum isl_dim_type type, unsigned pos)
565 return isl_map_get_dim_id(set, type, pos);
568 __isl_give isl_map *isl_map_set_dim_id(__isl_take isl_map *map,
569 enum isl_dim_type type, unsigned pos, __isl_take isl_id *id)
571 map = isl_map_cow(map);
573 return isl_id_free(id);
575 map->dim = isl_space_set_dim_id(map->dim, type, pos, id);
577 return isl_map_reset_space(map, isl_space_copy(map->dim));
580 __isl_give isl_set *isl_set_set_dim_id(__isl_take isl_set *set,
581 enum isl_dim_type type, unsigned pos, __isl_take isl_id *id)
583 return isl_map_set_dim_id(set, type, pos, id);
586 int isl_map_find_dim_by_id(__isl_keep isl_map *map, enum isl_dim_type type,
587 __isl_keep isl_id *id)
591 return isl_space_find_dim_by_id(map->dim, type, id);
594 int isl_set_find_dim_by_id(__isl_keep isl_set *set, enum isl_dim_type type,
595 __isl_keep isl_id *id)
597 return isl_map_find_dim_by_id(set, type, id);
600 int isl_map_find_dim_by_name(__isl_keep isl_map *map, enum isl_dim_type type,
605 return isl_space_find_dim_by_name(map->dim, type, name);
608 int isl_basic_map_is_rational(__isl_keep isl_basic_map *bmap)
612 return ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL);
615 int isl_basic_set_is_rational(__isl_keep isl_basic_set *bset)
617 return isl_basic_map_is_rational(bset);
620 /* Is this basic set a parameter domain?
622 int isl_basic_set_is_params(__isl_keep isl_basic_set *bset)
626 return isl_space_is_params(bset->dim);
629 /* Is this set a parameter domain?
631 int isl_set_is_params(__isl_keep isl_set *set)
635 return isl_space_is_params(set->dim);
638 /* Is this map actually a parameter domain?
639 * Users should never call this function. Outside of isl,
640 * a map can never be a parameter domain.
642 int isl_map_is_params(__isl_keep isl_map *map)
646 return isl_space_is_params(map->dim);
649 static struct isl_basic_map *basic_map_init(struct isl_ctx *ctx,
650 struct isl_basic_map *bmap, unsigned extra,
651 unsigned n_eq, unsigned n_ineq)
654 size_t row_size = 1 + isl_space_dim(bmap->dim, isl_dim_all) + extra;
659 bmap->block = isl_blk_alloc(ctx, (n_ineq + n_eq) * row_size);
660 if (isl_blk_is_error(bmap->block))
663 bmap->ineq = isl_alloc_array(ctx, isl_int *, n_ineq + n_eq);
668 bmap->block2 = isl_blk_empty();
671 bmap->block2 = isl_blk_alloc(ctx, extra * (1 + row_size));
672 if (isl_blk_is_error(bmap->block2))
675 bmap->div = isl_alloc_array(ctx, isl_int *, extra);
680 for (i = 0; i < n_ineq + n_eq; ++i)
681 bmap->ineq[i] = bmap->block.data + i * row_size;
683 for (i = 0; i < extra; ++i)
684 bmap->div[i] = bmap->block2.data + i * (1 + row_size);
688 bmap->c_size = n_eq + n_ineq;
689 bmap->eq = bmap->ineq + n_ineq;
698 isl_basic_map_free(bmap);
702 struct isl_basic_set *isl_basic_set_alloc(struct isl_ctx *ctx,
703 unsigned nparam, unsigned dim, unsigned extra,
704 unsigned n_eq, unsigned n_ineq)
706 struct isl_basic_map *bmap;
709 space = isl_space_set_alloc(ctx, nparam, dim);
713 bmap = isl_basic_map_alloc_space(space, extra, n_eq, n_ineq);
714 return (struct isl_basic_set *)bmap;
717 struct isl_basic_set *isl_basic_set_alloc_space(__isl_take isl_space *dim,
718 unsigned extra, unsigned n_eq, unsigned n_ineq)
720 struct isl_basic_map *bmap;
723 isl_assert(dim->ctx, dim->n_in == 0, goto error);
724 bmap = isl_basic_map_alloc_space(dim, extra, n_eq, n_ineq);
725 return (struct isl_basic_set *)bmap;
731 struct isl_basic_map *isl_basic_map_alloc_space(__isl_take isl_space *dim,
732 unsigned extra, unsigned n_eq, unsigned n_ineq)
734 struct isl_basic_map *bmap;
738 bmap = isl_calloc_type(dim->ctx, struct isl_basic_map);
743 return basic_map_init(dim->ctx, bmap, extra, n_eq, n_ineq);
749 struct isl_basic_map *isl_basic_map_alloc(struct isl_ctx *ctx,
750 unsigned nparam, unsigned in, unsigned out, unsigned extra,
751 unsigned n_eq, unsigned n_ineq)
753 struct isl_basic_map *bmap;
756 dim = isl_space_alloc(ctx, nparam, in, out);
760 bmap = isl_basic_map_alloc_space(dim, extra, n_eq, n_ineq);
764 static void dup_constraints(
765 struct isl_basic_map *dst, struct isl_basic_map *src)
768 unsigned total = isl_basic_map_total_dim(src);
770 for (i = 0; i < src->n_eq; ++i) {
771 int j = isl_basic_map_alloc_equality(dst);
772 isl_seq_cpy(dst->eq[j], src->eq[i], 1+total);
775 for (i = 0; i < src->n_ineq; ++i) {
776 int j = isl_basic_map_alloc_inequality(dst);
777 isl_seq_cpy(dst->ineq[j], src->ineq[i], 1+total);
780 for (i = 0; i < src->n_div; ++i) {
781 int j = isl_basic_map_alloc_div(dst);
782 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total);
784 ISL_F_SET(dst, ISL_BASIC_SET_FINAL);
787 struct isl_basic_map *isl_basic_map_dup(struct isl_basic_map *bmap)
789 struct isl_basic_map *dup;
793 dup = isl_basic_map_alloc_space(isl_space_copy(bmap->dim),
794 bmap->n_div, bmap->n_eq, bmap->n_ineq);
797 dup_constraints(dup, bmap);
798 dup->flags = bmap->flags;
799 dup->sample = isl_vec_copy(bmap->sample);
803 struct isl_basic_set *isl_basic_set_dup(struct isl_basic_set *bset)
805 struct isl_basic_map *dup;
807 dup = isl_basic_map_dup((struct isl_basic_map *)bset);
808 return (struct isl_basic_set *)dup;
811 struct isl_basic_set *isl_basic_set_copy(struct isl_basic_set *bset)
816 if (ISL_F_ISSET(bset, ISL_BASIC_SET_FINAL)) {
820 return isl_basic_set_dup(bset);
823 struct isl_set *isl_set_copy(struct isl_set *set)
832 struct isl_basic_map *isl_basic_map_copy(struct isl_basic_map *bmap)
837 if (ISL_F_ISSET(bmap, ISL_BASIC_SET_FINAL)) {
841 bmap = isl_basic_map_dup(bmap);
843 ISL_F_SET(bmap, ISL_BASIC_SET_FINAL);
847 struct isl_map *isl_map_copy(struct isl_map *map)
856 void isl_basic_map_free(struct isl_basic_map *bmap)
864 isl_ctx_deref(bmap->ctx);
866 isl_blk_free(bmap->ctx, bmap->block2);
868 isl_blk_free(bmap->ctx, bmap->block);
869 isl_vec_free(bmap->sample);
870 isl_space_free(bmap->dim);
874 void isl_basic_set_free(struct isl_basic_set *bset)
876 isl_basic_map_free((struct isl_basic_map *)bset);
879 static int room_for_con(struct isl_basic_map *bmap, unsigned n)
881 return bmap->n_eq + bmap->n_ineq + n <= bmap->c_size;
884 __isl_give isl_map *isl_map_align_params_map_map_and(
885 __isl_take isl_map *map1, __isl_take isl_map *map2,
886 __isl_give isl_map *(*fn)(__isl_take isl_map *map1,
887 __isl_take isl_map *map2))
891 if (isl_space_match(map1->dim, isl_dim_param, map2->dim, isl_dim_param))
892 return fn(map1, map2);
893 if (!isl_space_has_named_params(map1->dim) ||
894 !isl_space_has_named_params(map2->dim))
895 isl_die(map1->ctx, isl_error_invalid,
896 "unaligned unnamed parameters", goto error);
897 map1 = isl_map_align_params(map1, isl_map_get_space(map2));
898 map2 = isl_map_align_params(map2, isl_map_get_space(map1));
899 return fn(map1, map2);
906 static int align_params_map_map_and_test(__isl_keep isl_map *map1,
907 __isl_keep isl_map *map2,
908 int (*fn)(__isl_keep isl_map *map1, __isl_keep isl_map *map2))
914 if (isl_space_match(map1->dim, isl_dim_param, map2->dim, isl_dim_param))
915 return fn(map1, map2);
916 if (!isl_space_has_named_params(map1->dim) ||
917 !isl_space_has_named_params(map2->dim))
918 isl_die(map1->ctx, isl_error_invalid,
919 "unaligned unnamed parameters", return -1);
920 map1 = isl_map_copy(map1);
921 map2 = isl_map_copy(map2);
922 map1 = isl_map_align_params(map1, isl_map_get_space(map2));
923 map2 = isl_map_align_params(map2, isl_map_get_space(map1));
930 int isl_basic_map_alloc_equality(struct isl_basic_map *bmap)
936 isl_assert(ctx, room_for_con(bmap, 1), return -1);
937 isl_assert(ctx, (bmap->eq - bmap->ineq) + bmap->n_eq <= bmap->c_size,
939 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
940 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
941 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_IMPLICIT);
942 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
943 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
944 if ((bmap->eq - bmap->ineq) + bmap->n_eq == bmap->c_size) {
946 int j = isl_basic_map_alloc_inequality(bmap);
950 bmap->ineq[j] = bmap->ineq[bmap->n_ineq - 1];
951 bmap->ineq[bmap->n_ineq - 1] = bmap->eq[-1];
958 isl_seq_clr(bmap->eq[bmap->n_eq] + 1 + isl_basic_map_total_dim(bmap),
959 bmap->extra - bmap->n_div);
963 int isl_basic_set_alloc_equality(struct isl_basic_set *bset)
965 return isl_basic_map_alloc_equality((struct isl_basic_map *)bset);
968 int isl_basic_map_free_equality(struct isl_basic_map *bmap, unsigned n)
972 isl_assert(bmap->ctx, n <= bmap->n_eq, return -1);
977 int isl_basic_set_free_equality(struct isl_basic_set *bset, unsigned n)
979 return isl_basic_map_free_equality((struct isl_basic_map *)bset, n);
982 int isl_basic_map_drop_equality(struct isl_basic_map *bmap, unsigned pos)
987 isl_assert(bmap->ctx, pos < bmap->n_eq, return -1);
989 if (pos != bmap->n_eq - 1) {
991 bmap->eq[pos] = bmap->eq[bmap->n_eq - 1];
992 bmap->eq[bmap->n_eq - 1] = t;
998 int isl_basic_set_drop_equality(struct isl_basic_set *bset, unsigned pos)
1000 return isl_basic_map_drop_equality((struct isl_basic_map *)bset, pos);
1003 void isl_basic_map_inequality_to_equality(
1004 struct isl_basic_map *bmap, unsigned pos)
1008 t = bmap->ineq[pos];
1009 bmap->ineq[pos] = bmap->ineq[bmap->n_ineq - 1];
1010 bmap->ineq[bmap->n_ineq - 1] = bmap->eq[-1];
1015 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
1016 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1017 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
1018 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
1021 static int room_for_ineq(struct isl_basic_map *bmap, unsigned n)
1023 return bmap->n_ineq + n <= bmap->eq - bmap->ineq;
1026 int isl_basic_map_alloc_inequality(struct isl_basic_map *bmap)
1028 struct isl_ctx *ctx;
1032 isl_assert(ctx, room_for_ineq(bmap, 1), return -1);
1033 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_IMPLICIT);
1034 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
1035 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1036 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
1037 isl_seq_clr(bmap->ineq[bmap->n_ineq] +
1038 1 + isl_basic_map_total_dim(bmap),
1039 bmap->extra - bmap->n_div);
1040 return bmap->n_ineq++;
1043 int isl_basic_set_alloc_inequality(struct isl_basic_set *bset)
1045 return isl_basic_map_alloc_inequality((struct isl_basic_map *)bset);
1048 int isl_basic_map_free_inequality(struct isl_basic_map *bmap, unsigned n)
1052 isl_assert(bmap->ctx, n <= bmap->n_ineq, return -1);
1057 int isl_basic_set_free_inequality(struct isl_basic_set *bset, unsigned n)
1059 return isl_basic_map_free_inequality((struct isl_basic_map *)bset, n);
1062 int isl_basic_map_drop_inequality(struct isl_basic_map *bmap, unsigned pos)
1067 isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
1069 if (pos != bmap->n_ineq - 1) {
1070 t = bmap->ineq[pos];
1071 bmap->ineq[pos] = bmap->ineq[bmap->n_ineq - 1];
1072 bmap->ineq[bmap->n_ineq - 1] = t;
1073 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1079 int isl_basic_set_drop_inequality(struct isl_basic_set *bset, unsigned pos)
1081 return isl_basic_map_drop_inequality((struct isl_basic_map *)bset, pos);
1084 __isl_give isl_basic_map *isl_basic_map_add_eq(__isl_take isl_basic_map *bmap,
1089 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
1092 k = isl_basic_map_alloc_equality(bmap);
1095 isl_seq_cpy(bmap->eq[k], eq, 1 + isl_basic_map_total_dim(bmap));
1098 isl_basic_map_free(bmap);
1102 __isl_give isl_basic_set *isl_basic_set_add_eq(__isl_take isl_basic_set *bset,
1105 return (isl_basic_set *)
1106 isl_basic_map_add_eq((isl_basic_map *)bset, eq);
1109 __isl_give isl_basic_map *isl_basic_map_add_ineq(__isl_take isl_basic_map *bmap,
1114 bmap = isl_basic_map_extend_constraints(bmap, 0, 1);
1117 k = isl_basic_map_alloc_inequality(bmap);
1120 isl_seq_cpy(bmap->ineq[k], ineq, 1 + isl_basic_map_total_dim(bmap));
1123 isl_basic_map_free(bmap);
1127 __isl_give isl_basic_set *isl_basic_set_add_ineq(__isl_take isl_basic_set *bset,
1130 return (isl_basic_set *)
1131 isl_basic_map_add_ineq((isl_basic_map *)bset, ineq);
1134 int isl_basic_map_alloc_div(struct isl_basic_map *bmap)
1138 isl_assert(bmap->ctx, bmap->n_div < bmap->extra, return -1);
1139 isl_seq_clr(bmap->div[bmap->n_div] +
1140 1 + 1 + isl_basic_map_total_dim(bmap),
1141 bmap->extra - bmap->n_div);
1142 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
1143 return bmap->n_div++;
1146 int isl_basic_set_alloc_div(struct isl_basic_set *bset)
1148 return isl_basic_map_alloc_div((struct isl_basic_map *)bset);
1151 int isl_basic_map_free_div(struct isl_basic_map *bmap, unsigned n)
1155 isl_assert(bmap->ctx, n <= bmap->n_div, return -1);
1160 int isl_basic_set_free_div(struct isl_basic_set *bset, unsigned n)
1162 return isl_basic_map_free_div((struct isl_basic_map *)bset, n);
1165 /* Copy constraint from src to dst, putting the vars of src at offset
1166 * dim_off in dst and the divs of src at offset div_off in dst.
1167 * If both sets are actually map, then dim_off applies to the input
1170 static void copy_constraint(struct isl_basic_map *dst_map, isl_int *dst,
1171 struct isl_basic_map *src_map, isl_int *src,
1172 unsigned in_off, unsigned out_off, unsigned div_off)
1174 unsigned src_nparam = isl_basic_map_n_param(src_map);
1175 unsigned dst_nparam = isl_basic_map_n_param(dst_map);
1176 unsigned src_in = isl_basic_map_n_in(src_map);
1177 unsigned dst_in = isl_basic_map_n_in(dst_map);
1178 unsigned src_out = isl_basic_map_n_out(src_map);
1179 unsigned dst_out = isl_basic_map_n_out(dst_map);
1180 isl_int_set(dst[0], src[0]);
1181 isl_seq_cpy(dst+1, src+1, isl_min(dst_nparam, src_nparam));
1182 if (dst_nparam > src_nparam)
1183 isl_seq_clr(dst+1+src_nparam,
1184 dst_nparam - src_nparam);
1185 isl_seq_clr(dst+1+dst_nparam, in_off);
1186 isl_seq_cpy(dst+1+dst_nparam+in_off,
1188 isl_min(dst_in-in_off, src_in));
1189 if (dst_in-in_off > src_in)
1190 isl_seq_clr(dst+1+dst_nparam+in_off+src_in,
1191 dst_in - in_off - src_in);
1192 isl_seq_clr(dst+1+dst_nparam+dst_in, out_off);
1193 isl_seq_cpy(dst+1+dst_nparam+dst_in+out_off,
1194 src+1+src_nparam+src_in,
1195 isl_min(dst_out-out_off, src_out));
1196 if (dst_out-out_off > src_out)
1197 isl_seq_clr(dst+1+dst_nparam+dst_in+out_off+src_out,
1198 dst_out - out_off - src_out);
1199 isl_seq_clr(dst+1+dst_nparam+dst_in+dst_out, div_off);
1200 isl_seq_cpy(dst+1+dst_nparam+dst_in+dst_out+div_off,
1201 src+1+src_nparam+src_in+src_out,
1202 isl_min(dst_map->extra-div_off, src_map->n_div));
1203 if (dst_map->n_div-div_off > src_map->n_div)
1204 isl_seq_clr(dst+1+dst_nparam+dst_in+dst_out+
1205 div_off+src_map->n_div,
1206 dst_map->n_div - div_off - src_map->n_div);
1209 static void copy_div(struct isl_basic_map *dst_map, isl_int *dst,
1210 struct isl_basic_map *src_map, isl_int *src,
1211 unsigned in_off, unsigned out_off, unsigned div_off)
1213 isl_int_set(dst[0], src[0]);
1214 copy_constraint(dst_map, dst+1, src_map, src+1, in_off, out_off, div_off);
1217 static struct isl_basic_map *add_constraints(struct isl_basic_map *bmap1,
1218 struct isl_basic_map *bmap2, unsigned i_pos, unsigned o_pos)
1223 if (!bmap1 || !bmap2)
1226 div_off = bmap1->n_div;
1228 for (i = 0; i < bmap2->n_eq; ++i) {
1229 int i1 = isl_basic_map_alloc_equality(bmap1);
1232 copy_constraint(bmap1, bmap1->eq[i1], bmap2, bmap2->eq[i],
1233 i_pos, o_pos, div_off);
1236 for (i = 0; i < bmap2->n_ineq; ++i) {
1237 int i1 = isl_basic_map_alloc_inequality(bmap1);
1240 copy_constraint(bmap1, bmap1->ineq[i1], bmap2, bmap2->ineq[i],
1241 i_pos, o_pos, div_off);
1244 for (i = 0; i < bmap2->n_div; ++i) {
1245 int i1 = isl_basic_map_alloc_div(bmap1);
1248 copy_div(bmap1, bmap1->div[i1], bmap2, bmap2->div[i],
1249 i_pos, o_pos, div_off);
1252 isl_basic_map_free(bmap2);
1257 isl_basic_map_free(bmap1);
1258 isl_basic_map_free(bmap2);
1262 struct isl_basic_set *isl_basic_set_add_constraints(struct isl_basic_set *bset1,
1263 struct isl_basic_set *bset2, unsigned pos)
1265 return (struct isl_basic_set *)
1266 add_constraints((struct isl_basic_map *)bset1,
1267 (struct isl_basic_map *)bset2, 0, pos);
1270 struct isl_basic_map *isl_basic_map_extend_space(struct isl_basic_map *base,
1271 __isl_take isl_space *dim, unsigned extra,
1272 unsigned n_eq, unsigned n_ineq)
1274 struct isl_basic_map *ext;
1284 dims_ok = isl_space_is_equal(base->dim, dim) &&
1285 base->extra >= base->n_div + extra;
1287 if (dims_ok && room_for_con(base, n_eq + n_ineq) &&
1288 room_for_ineq(base, n_ineq)) {
1289 isl_space_free(dim);
1293 isl_assert(base->ctx, base->dim->nparam <= dim->nparam, goto error);
1294 isl_assert(base->ctx, base->dim->n_in <= dim->n_in, goto error);
1295 isl_assert(base->ctx, base->dim->n_out <= dim->n_out, goto error);
1296 extra += base->extra;
1298 n_ineq += base->n_ineq;
1300 ext = isl_basic_map_alloc_space(dim, extra, n_eq, n_ineq);
1306 ext->sample = isl_vec_copy(base->sample);
1307 flags = base->flags;
1308 ext = add_constraints(ext, base, 0, 0);
1311 ISL_F_CLR(ext, ISL_BASIC_SET_FINAL);
1317 isl_space_free(dim);
1318 isl_basic_map_free(base);
1322 struct isl_basic_set *isl_basic_set_extend_space(struct isl_basic_set *base,
1323 __isl_take isl_space *dim, unsigned extra,
1324 unsigned n_eq, unsigned n_ineq)
1326 return (struct isl_basic_set *)
1327 isl_basic_map_extend_space((struct isl_basic_map *)base, dim,
1328 extra, n_eq, n_ineq);
1331 struct isl_basic_map *isl_basic_map_extend_constraints(
1332 struct isl_basic_map *base, unsigned n_eq, unsigned n_ineq)
1336 return isl_basic_map_extend_space(base, isl_space_copy(base->dim),
1340 struct isl_basic_map *isl_basic_map_extend(struct isl_basic_map *base,
1341 unsigned nparam, unsigned n_in, unsigned n_out, unsigned extra,
1342 unsigned n_eq, unsigned n_ineq)
1344 struct isl_basic_map *bmap;
1349 dim = isl_space_alloc(base->ctx, nparam, n_in, n_out);
1353 bmap = isl_basic_map_extend_space(base, dim, extra, n_eq, n_ineq);
1356 isl_basic_map_free(base);
1360 struct isl_basic_set *isl_basic_set_extend(struct isl_basic_set *base,
1361 unsigned nparam, unsigned dim, unsigned extra,
1362 unsigned n_eq, unsigned n_ineq)
1364 return (struct isl_basic_set *)
1365 isl_basic_map_extend((struct isl_basic_map *)base,
1366 nparam, 0, dim, extra, n_eq, n_ineq);
1369 struct isl_basic_set *isl_basic_set_extend_constraints(
1370 struct isl_basic_set *base, unsigned n_eq, unsigned n_ineq)
1372 return (struct isl_basic_set *)
1373 isl_basic_map_extend_constraints((struct isl_basic_map *)base,
1377 struct isl_basic_set *isl_basic_set_cow(struct isl_basic_set *bset)
1379 return (struct isl_basic_set *)
1380 isl_basic_map_cow((struct isl_basic_map *)bset);
1383 struct isl_basic_map *isl_basic_map_cow(struct isl_basic_map *bmap)
1388 if (bmap->ref > 1) {
1390 bmap = isl_basic_map_dup(bmap);
1393 ISL_F_CLR(bmap, ISL_BASIC_SET_FINAL);
1397 struct isl_set *isl_set_cow(struct isl_set *set)
1405 return isl_set_dup(set);
1408 struct isl_map *isl_map_cow(struct isl_map *map)
1416 return isl_map_dup(map);
1419 static void swap_vars(struct isl_blk blk, isl_int *a,
1420 unsigned a_len, unsigned b_len)
1422 isl_seq_cpy(blk.data, a+a_len, b_len);
1423 isl_seq_cpy(blk.data+b_len, a, a_len);
1424 isl_seq_cpy(a, blk.data, b_len+a_len);
1427 static __isl_give isl_basic_map *isl_basic_map_swap_vars(
1428 __isl_take isl_basic_map *bmap, unsigned pos, unsigned n1, unsigned n2)
1436 isl_assert(bmap->ctx,
1437 pos + n1 + n2 <= 1 + isl_basic_map_total_dim(bmap), goto error);
1439 if (n1 == 0 || n2 == 0)
1442 bmap = isl_basic_map_cow(bmap);
1446 blk = isl_blk_alloc(bmap->ctx, n1 + n2);
1447 if (isl_blk_is_error(blk))
1450 for (i = 0; i < bmap->n_eq; ++i)
1452 bmap->eq[i] + pos, n1, n2);
1454 for (i = 0; i < bmap->n_ineq; ++i)
1456 bmap->ineq[i] + pos, n1, n2);
1458 for (i = 0; i < bmap->n_div; ++i)
1460 bmap->div[i]+1 + pos, n1, n2);
1462 isl_blk_free(bmap->ctx, blk);
1464 ISL_F_CLR(bmap, ISL_BASIC_SET_NORMALIZED);
1465 bmap = isl_basic_map_gauss(bmap, NULL);
1466 return isl_basic_map_finalize(bmap);
1468 isl_basic_map_free(bmap);
1472 static __isl_give isl_basic_set *isl_basic_set_swap_vars(
1473 __isl_take isl_basic_set *bset, unsigned n)
1478 nparam = isl_basic_set_n_param(bset);
1479 dim = isl_basic_set_n_dim(bset);
1480 isl_assert(bset->ctx, n <= dim, goto error);
1482 return isl_basic_map_swap_vars(bset, 1 + nparam, n, dim - n);
1484 isl_basic_set_free(bset);
1488 struct isl_basic_map *isl_basic_map_set_to_empty(struct isl_basic_map *bmap)
1494 total = isl_basic_map_total_dim(bmap);
1495 isl_basic_map_free_div(bmap, bmap->n_div);
1496 isl_basic_map_free_inequality(bmap, bmap->n_ineq);
1498 isl_basic_map_free_equality(bmap, bmap->n_eq-1);
1500 i = isl_basic_map_alloc_equality(bmap);
1504 isl_int_set_si(bmap->eq[i][0], 1);
1505 isl_seq_clr(bmap->eq[i]+1, total);
1506 ISL_F_SET(bmap, ISL_BASIC_MAP_EMPTY);
1507 isl_vec_free(bmap->sample);
1508 bmap->sample = NULL;
1509 return isl_basic_map_finalize(bmap);
1511 isl_basic_map_free(bmap);
1515 struct isl_basic_set *isl_basic_set_set_to_empty(struct isl_basic_set *bset)
1517 return (struct isl_basic_set *)
1518 isl_basic_map_set_to_empty((struct isl_basic_map *)bset);
1521 void isl_basic_map_swap_div(struct isl_basic_map *bmap, int a, int b)
1524 unsigned off = isl_space_dim(bmap->dim, isl_dim_all);
1525 isl_int *t = bmap->div[a];
1526 bmap->div[a] = bmap->div[b];
1529 for (i = 0; i < bmap->n_eq; ++i)
1530 isl_int_swap(bmap->eq[i][1+off+a], bmap->eq[i][1+off+b]);
1532 for (i = 0; i < bmap->n_ineq; ++i)
1533 isl_int_swap(bmap->ineq[i][1+off+a], bmap->ineq[i][1+off+b]);
1535 for (i = 0; i < bmap->n_div; ++i)
1536 isl_int_swap(bmap->div[i][1+1+off+a], bmap->div[i][1+1+off+b]);
1537 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1540 /* Eliminate the specified n dimensions starting at first from the
1541 * constraints using Fourier-Motzkin. The dimensions themselves
1544 __isl_give isl_map *isl_map_eliminate(__isl_take isl_map *map,
1545 enum isl_dim_type type, unsigned first, unsigned n)
1554 map = isl_map_cow(map);
1557 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
1558 first += pos(map->dim, type) - 1;
1560 for (i = 0; i < map->n; ++i) {
1561 map->p[i] = isl_basic_map_eliminate_vars(map->p[i], first, n);
1571 /* Eliminate the specified n dimensions starting at first from the
1572 * constraints using Fourier-Motzkin. The dimensions themselves
1575 __isl_give isl_set *isl_set_eliminate(__isl_take isl_set *set,
1576 enum isl_dim_type type, unsigned first, unsigned n)
1578 return (isl_set *)isl_map_eliminate((isl_map *)set, type, first, n);
1581 /* Eliminate the specified n dimensions starting at first from the
1582 * constraints using Fourier-Motzkin. The dimensions themselves
1585 __isl_give isl_set *isl_set_eliminate_dims(__isl_take isl_set *set,
1586 unsigned first, unsigned n)
1588 return isl_set_eliminate(set, isl_dim_set, first, n);
1591 __isl_give isl_basic_map *isl_basic_map_remove_divs(
1592 __isl_take isl_basic_map *bmap)
1596 bmap = isl_basic_map_eliminate_vars(bmap,
1597 isl_space_dim(bmap->dim, isl_dim_all), bmap->n_div);
1601 return isl_basic_map_finalize(bmap);
1604 __isl_give isl_basic_set *isl_basic_set_remove_divs(
1605 __isl_take isl_basic_set *bset)
1607 return (struct isl_basic_set *)isl_basic_map_remove_divs(
1608 (struct isl_basic_map *)bset);
1611 __isl_give isl_map *isl_map_remove_divs(__isl_take isl_map *map)
1620 map = isl_map_cow(map);
1624 for (i = 0; i < map->n; ++i) {
1625 map->p[i] = isl_basic_map_remove_divs(map->p[i]);
1635 __isl_give isl_set *isl_set_remove_divs(__isl_take isl_set *set)
1637 return isl_map_remove_divs(set);
1640 struct isl_basic_map *isl_basic_map_remove_dims(struct isl_basic_map *bmap,
1641 enum isl_dim_type type, unsigned first, unsigned n)
1645 isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
1647 if (n == 0 && !isl_space_is_named_or_nested(bmap->dim, type))
1649 bmap = isl_basic_map_eliminate_vars(bmap,
1650 isl_basic_map_offset(bmap, type) - 1 + first, n);
1653 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY) && type == isl_dim_div)
1655 bmap = isl_basic_map_drop(bmap, type, first, n);
1658 isl_basic_map_free(bmap);
1662 /* Return true if the definition of the given div (recursively) involves
1663 * any of the given variables.
1665 static int div_involves_vars(__isl_keep isl_basic_map *bmap, int div,
1666 unsigned first, unsigned n)
1669 unsigned div_offset = isl_basic_map_offset(bmap, isl_dim_div);
1671 if (isl_int_is_zero(bmap->div[div][0]))
1673 if (isl_seq_first_non_zero(bmap->div[div] + 1 + first, n) >= 0)
1676 for (i = bmap->n_div - 1; i >= 0; --i) {
1677 if (isl_int_is_zero(bmap->div[div][1 + div_offset + i]))
1679 if (div_involves_vars(bmap, i, first, n))
1686 /* Remove all divs (recursively) involving any of the given dimensions
1687 * in their definitions.
1689 __isl_give isl_basic_map *isl_basic_map_remove_divs_involving_dims(
1690 __isl_take isl_basic_map *bmap,
1691 enum isl_dim_type type, unsigned first, unsigned n)
1697 isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
1699 first += isl_basic_map_offset(bmap, type);
1701 for (i = bmap->n_div - 1; i >= 0; --i) {
1702 if (!div_involves_vars(bmap, i, first, n))
1704 bmap = isl_basic_map_remove_dims(bmap, isl_dim_div, i, 1);
1712 isl_basic_map_free(bmap);
1716 __isl_give isl_map *isl_map_remove_divs_involving_dims(__isl_take isl_map *map,
1717 enum isl_dim_type type, unsigned first, unsigned n)
1726 map = isl_map_cow(map);
1730 for (i = 0; i < map->n; ++i) {
1731 map->p[i] = isl_basic_map_remove_divs_involving_dims(map->p[i],
1742 __isl_give isl_set *isl_set_remove_divs_involving_dims(__isl_take isl_set *set,
1743 enum isl_dim_type type, unsigned first, unsigned n)
1745 return (isl_set *)isl_map_remove_divs_involving_dims((isl_map *)set,
1749 int isl_basic_map_involves_dims(__isl_keep isl_basic_map *bmap,
1750 enum isl_dim_type type, unsigned first, unsigned n)
1757 if (first + n > isl_basic_map_dim(bmap, type))
1758 isl_die(bmap->ctx, isl_error_invalid,
1759 "index out of bounds", return -1);
1761 first += isl_basic_map_offset(bmap, type);
1762 for (i = 0; i < bmap->n_eq; ++i)
1763 if (isl_seq_first_non_zero(bmap->eq[i] + first, n) >= 0)
1765 for (i = 0; i < bmap->n_ineq; ++i)
1766 if (isl_seq_first_non_zero(bmap->ineq[i] + first, n) >= 0)
1772 int isl_map_involves_dims(__isl_keep isl_map *map,
1773 enum isl_dim_type type, unsigned first, unsigned n)
1780 if (first + n > isl_map_dim(map, type))
1781 isl_die(map->ctx, isl_error_invalid,
1782 "index out of bounds", return -1);
1784 for (i = 0; i < map->n; ++i) {
1785 int involves = isl_basic_map_involves_dims(map->p[i],
1787 if (involves < 0 || involves)
1794 int isl_basic_set_involves_dims(__isl_keep isl_basic_set *bset,
1795 enum isl_dim_type type, unsigned first, unsigned n)
1797 return isl_basic_map_involves_dims(bset, type, first, n);
1800 int isl_set_involves_dims(__isl_keep isl_set *set,
1801 enum isl_dim_type type, unsigned first, unsigned n)
1803 return isl_map_involves_dims(set, type, first, n);
1806 /* Return true if the definition of the given div is unknown or depends
1809 static int div_is_unknown(__isl_keep isl_basic_map *bmap, int div)
1812 unsigned div_offset = isl_basic_map_offset(bmap, isl_dim_div);
1814 if (isl_int_is_zero(bmap->div[div][0]))
1817 for (i = bmap->n_div - 1; i >= 0; --i) {
1818 if (isl_int_is_zero(bmap->div[div][1 + div_offset + i]))
1820 if (div_is_unknown(bmap, i))
1827 /* Remove all divs that are unknown or defined in terms of unknown divs.
1829 __isl_give isl_basic_map *isl_basic_map_remove_unknown_divs(
1830 __isl_take isl_basic_map *bmap)
1837 for (i = bmap->n_div - 1; i >= 0; --i) {
1838 if (!div_is_unknown(bmap, i))
1840 bmap = isl_basic_map_remove_dims(bmap, isl_dim_div, i, 1);
1846 __isl_give isl_map *isl_map_remove_unknown_divs(__isl_take isl_map *map)
1855 map = isl_map_cow(map);
1859 for (i = 0; i < map->n; ++i) {
1860 map->p[i] = isl_basic_map_remove_unknown_divs(map->p[i]);
1870 __isl_give isl_set *isl_set_remove_unknown_divs(__isl_take isl_set *set)
1872 return (isl_set *)isl_map_remove_unknown_divs((isl_map *)set);
1875 __isl_give isl_basic_set *isl_basic_set_remove_dims(
1876 __isl_take isl_basic_set *bset,
1877 enum isl_dim_type type, unsigned first, unsigned n)
1879 return (isl_basic_set *)
1880 isl_basic_map_remove_dims((isl_basic_map *)bset, type, first, n);
1883 struct isl_map *isl_map_remove_dims(struct isl_map *map,
1884 enum isl_dim_type type, unsigned first, unsigned n)
1891 map = isl_map_cow(map);
1894 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
1896 for (i = 0; i < map->n; ++i) {
1897 map->p[i] = isl_basic_map_eliminate_vars(map->p[i],
1898 isl_basic_map_offset(map->p[i], type) - 1 + first, n);
1902 map = isl_map_drop(map, type, first, n);
1909 __isl_give isl_set *isl_set_remove_dims(__isl_take isl_set *bset,
1910 enum isl_dim_type type, unsigned first, unsigned n)
1912 return (isl_set *)isl_map_remove_dims((isl_map *)bset, type, first, n);
1915 /* Project out n inputs starting at first using Fourier-Motzkin */
1916 struct isl_map *isl_map_remove_inputs(struct isl_map *map,
1917 unsigned first, unsigned n)
1919 return isl_map_remove_dims(map, isl_dim_in, first, n);
1922 static void dump_term(struct isl_basic_map *bmap,
1923 isl_int c, int pos, FILE *out)
1926 unsigned in = isl_basic_map_n_in(bmap);
1927 unsigned dim = in + isl_basic_map_n_out(bmap);
1928 unsigned nparam = isl_basic_map_n_param(bmap);
1930 isl_int_print(out, c, 0);
1932 if (!isl_int_is_one(c))
1933 isl_int_print(out, c, 0);
1934 if (pos < 1 + nparam) {
1935 name = isl_space_get_dim_name(bmap->dim,
1936 isl_dim_param, pos - 1);
1938 fprintf(out, "%s", name);
1940 fprintf(out, "p%d", pos - 1);
1941 } else if (pos < 1 + nparam + in)
1942 fprintf(out, "i%d", pos - 1 - nparam);
1943 else if (pos < 1 + nparam + dim)
1944 fprintf(out, "o%d", pos - 1 - nparam - in);
1946 fprintf(out, "e%d", pos - 1 - nparam - dim);
1950 static void dump_constraint_sign(struct isl_basic_map *bmap, isl_int *c,
1951 int sign, FILE *out)
1955 unsigned len = 1 + isl_basic_map_total_dim(bmap);
1959 for (i = 0, first = 1; i < len; ++i) {
1960 if (isl_int_sgn(c[i]) * sign <= 0)
1963 fprintf(out, " + ");
1965 isl_int_abs(v, c[i]);
1966 dump_term(bmap, v, i, out);
1973 static void dump_constraint(struct isl_basic_map *bmap, isl_int *c,
1974 const char *op, FILE *out, int indent)
1978 fprintf(out, "%*s", indent, "");
1980 dump_constraint_sign(bmap, c, 1, out);
1981 fprintf(out, " %s ", op);
1982 dump_constraint_sign(bmap, c, -1, out);
1986 for (i = bmap->n_div; i < bmap->extra; ++i) {
1987 if (isl_int_is_zero(c[1+isl_space_dim(bmap->dim, isl_dim_all)+i]))
1989 fprintf(out, "%*s", indent, "");
1990 fprintf(out, "ERROR: unused div coefficient not zero\n");
1995 static void dump_constraints(struct isl_basic_map *bmap,
1996 isl_int **c, unsigned n,
1997 const char *op, FILE *out, int indent)
2001 for (i = 0; i < n; ++i)
2002 dump_constraint(bmap, c[i], op, out, indent);
2005 static void dump_affine(struct isl_basic_map *bmap, isl_int *exp, FILE *out)
2009 unsigned total = isl_basic_map_total_dim(bmap);
2011 for (j = 0; j < 1 + total; ++j) {
2012 if (isl_int_is_zero(exp[j]))
2014 if (!first && isl_int_is_pos(exp[j]))
2016 dump_term(bmap, exp[j], j, out);
2021 static void dump(struct isl_basic_map *bmap, FILE *out, int indent)
2025 dump_constraints(bmap, bmap->eq, bmap->n_eq, "=", out, indent);
2026 dump_constraints(bmap, bmap->ineq, bmap->n_ineq, ">=", out, indent);
2028 for (i = 0; i < bmap->n_div; ++i) {
2029 fprintf(out, "%*s", indent, "");
2030 fprintf(out, "e%d = [(", i);
2031 dump_affine(bmap, bmap->div[i]+1, out);
2033 isl_int_print(out, bmap->div[i][0], 0);
2034 fprintf(out, "]\n");
2038 void isl_basic_set_print_internal(struct isl_basic_set *bset,
2039 FILE *out, int indent)
2042 fprintf(out, "null basic set\n");
2046 fprintf(out, "%*s", indent, "");
2047 fprintf(out, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n",
2048 bset->ref, bset->dim->nparam, bset->dim->n_out,
2049 bset->extra, bset->flags);
2050 dump((struct isl_basic_map *)bset, out, indent);
2053 void isl_basic_map_print_internal(struct isl_basic_map *bmap,
2054 FILE *out, int indent)
2057 fprintf(out, "null basic map\n");
2061 fprintf(out, "%*s", indent, "");
2062 fprintf(out, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, "
2063 "flags: %x, n_name: %d\n",
2065 bmap->dim->nparam, bmap->dim->n_in, bmap->dim->n_out,
2066 bmap->extra, bmap->flags, bmap->dim->n_id);
2067 dump(bmap, out, indent);
2070 int isl_inequality_negate(struct isl_basic_map *bmap, unsigned pos)
2075 total = isl_basic_map_total_dim(bmap);
2076 isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
2077 isl_seq_neg(bmap->ineq[pos], bmap->ineq[pos], 1 + total);
2078 isl_int_sub_ui(bmap->ineq[pos][0], bmap->ineq[pos][0], 1);
2079 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
2083 __isl_give isl_set *isl_set_alloc_space(__isl_take isl_space *dim, int n,
2086 struct isl_set *set;
2090 isl_assert(dim->ctx, dim->n_in == 0, goto error);
2091 isl_assert(dim->ctx, n >= 0, goto error);
2092 set = isl_alloc(dim->ctx, struct isl_set,
2093 sizeof(struct isl_set) +
2094 (n - 1) * sizeof(struct isl_basic_set *));
2098 set->ctx = dim->ctx;
2099 isl_ctx_ref(set->ctx);
2107 isl_space_free(dim);
2111 struct isl_set *isl_set_alloc(struct isl_ctx *ctx,
2112 unsigned nparam, unsigned dim, int n, unsigned flags)
2114 struct isl_set *set;
2117 dims = isl_space_alloc(ctx, nparam, 0, dim);
2121 set = isl_set_alloc_space(dims, n, flags);
2125 /* Make sure "map" has room for at least "n" more basic maps.
2127 struct isl_map *isl_map_grow(struct isl_map *map, int n)
2130 struct isl_map *grown = NULL;
2134 isl_assert(map->ctx, n >= 0, goto error);
2135 if (map->n + n <= map->size)
2137 grown = isl_map_alloc_space(isl_map_get_space(map), map->n + n, map->flags);
2140 for (i = 0; i < map->n; ++i) {
2141 grown->p[i] = isl_basic_map_copy(map->p[i]);
2149 isl_map_free(grown);
2154 /* Make sure "set" has room for at least "n" more basic sets.
2156 struct isl_set *isl_set_grow(struct isl_set *set, int n)
2158 return (struct isl_set *)isl_map_grow((struct isl_map *)set, n);
2161 struct isl_set *isl_set_dup(struct isl_set *set)
2164 struct isl_set *dup;
2169 dup = isl_set_alloc_space(isl_space_copy(set->dim), set->n, set->flags);
2172 for (i = 0; i < set->n; ++i)
2173 dup = isl_set_add_basic_set(dup, isl_basic_set_copy(set->p[i]));
2177 struct isl_set *isl_set_from_basic_set(struct isl_basic_set *bset)
2179 return isl_map_from_basic_map(bset);
2182 struct isl_map *isl_map_from_basic_map(struct isl_basic_map *bmap)
2184 struct isl_map *map;
2189 map = isl_map_alloc_space(isl_space_copy(bmap->dim), 1, ISL_MAP_DISJOINT);
2190 return isl_map_add_basic_map(map, bmap);
2193 __isl_give isl_set *isl_set_add_basic_set(__isl_take isl_set *set,
2194 __isl_take isl_basic_set *bset)
2196 return (struct isl_set *)isl_map_add_basic_map((struct isl_map *)set,
2197 (struct isl_basic_map *)bset);
2200 void isl_set_free(struct isl_set *set)
2210 isl_ctx_deref(set->ctx);
2211 for (i = 0; i < set->n; ++i)
2212 isl_basic_set_free(set->p[i]);
2213 isl_space_free(set->dim);
2217 void isl_set_print_internal(struct isl_set *set, FILE *out, int indent)
2222 fprintf(out, "null set\n");
2226 fprintf(out, "%*s", indent, "");
2227 fprintf(out, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
2228 set->ref, set->n, set->dim->nparam, set->dim->n_out,
2230 for (i = 0; i < set->n; ++i) {
2231 fprintf(out, "%*s", indent, "");
2232 fprintf(out, "basic set %d:\n", i);
2233 isl_basic_set_print_internal(set->p[i], out, indent+4);
2237 void isl_map_print_internal(struct isl_map *map, FILE *out, int indent)
2242 fprintf(out, "null map\n");
2246 fprintf(out, "%*s", indent, "");
2247 fprintf(out, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, "
2248 "flags: %x, n_name: %d\n",
2249 map->ref, map->n, map->dim->nparam, map->dim->n_in,
2250 map->dim->n_out, map->flags, map->dim->n_id);
2251 for (i = 0; i < map->n; ++i) {
2252 fprintf(out, "%*s", indent, "");
2253 fprintf(out, "basic map %d:\n", i);
2254 isl_basic_map_print_internal(map->p[i], out, indent+4);
2258 struct isl_basic_map *isl_basic_map_intersect_domain(
2259 struct isl_basic_map *bmap, struct isl_basic_set *bset)
2261 struct isl_basic_map *bmap_domain;
2266 isl_assert(bset->ctx, isl_space_match(bmap->dim, isl_dim_param,
2267 bset->dim, isl_dim_param), goto error);
2269 if (isl_space_dim(bset->dim, isl_dim_set) != 0)
2270 isl_assert(bset->ctx,
2271 isl_basic_map_compatible_domain(bmap, bset), goto error);
2273 bmap = isl_basic_map_cow(bmap);
2276 bmap = isl_basic_map_extend_space(bmap, isl_space_copy(bmap->dim),
2277 bset->n_div, bset->n_eq, bset->n_ineq);
2278 bmap_domain = isl_basic_map_from_domain(bset);
2279 bmap = add_constraints(bmap, bmap_domain, 0, 0);
2281 bmap = isl_basic_map_simplify(bmap);
2282 return isl_basic_map_finalize(bmap);
2284 isl_basic_map_free(bmap);
2285 isl_basic_set_free(bset);
2289 struct isl_basic_map *isl_basic_map_intersect_range(
2290 struct isl_basic_map *bmap, struct isl_basic_set *bset)
2292 struct isl_basic_map *bmap_range;
2297 isl_assert(bset->ctx, isl_space_match(bmap->dim, isl_dim_param,
2298 bset->dim, isl_dim_param), goto error);
2300 if (isl_space_dim(bset->dim, isl_dim_set) != 0)
2301 isl_assert(bset->ctx,
2302 isl_basic_map_compatible_range(bmap, bset), goto error);
2304 if (isl_basic_set_is_universe(bset)) {
2305 isl_basic_set_free(bset);
2309 bmap = isl_basic_map_cow(bmap);
2312 bmap = isl_basic_map_extend_space(bmap, isl_space_copy(bmap->dim),
2313 bset->n_div, bset->n_eq, bset->n_ineq);
2314 bmap_range = isl_basic_map_from_basic_set(bset, isl_space_copy(bset->dim));
2315 bmap = add_constraints(bmap, bmap_range, 0, 0);
2317 bmap = isl_basic_map_simplify(bmap);
2318 return isl_basic_map_finalize(bmap);
2320 isl_basic_map_free(bmap);
2321 isl_basic_set_free(bset);
2325 int isl_basic_map_contains(struct isl_basic_map *bmap, struct isl_vec *vec)
2331 total = 1 + isl_basic_map_total_dim(bmap);
2332 if (total != vec->size)
2337 for (i = 0; i < bmap->n_eq; ++i) {
2338 isl_seq_inner_product(vec->el, bmap->eq[i], total, &s);
2339 if (!isl_int_is_zero(s)) {
2345 for (i = 0; i < bmap->n_ineq; ++i) {
2346 isl_seq_inner_product(vec->el, bmap->ineq[i], total, &s);
2347 if (isl_int_is_neg(s)) {
2358 int isl_basic_set_contains(struct isl_basic_set *bset, struct isl_vec *vec)
2360 return isl_basic_map_contains((struct isl_basic_map *)bset, vec);
2363 struct isl_basic_map *isl_basic_map_intersect(
2364 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2366 struct isl_vec *sample = NULL;
2368 if (!bmap1 || !bmap2)
2371 isl_assert(bmap1->ctx, isl_space_match(bmap1->dim, isl_dim_param,
2372 bmap2->dim, isl_dim_param), goto error);
2373 if (isl_space_dim(bmap1->dim, isl_dim_all) ==
2374 isl_space_dim(bmap1->dim, isl_dim_param) &&
2375 isl_space_dim(bmap2->dim, isl_dim_all) !=
2376 isl_space_dim(bmap2->dim, isl_dim_param))
2377 return isl_basic_map_intersect(bmap2, bmap1);
2379 if (isl_space_dim(bmap2->dim, isl_dim_all) !=
2380 isl_space_dim(bmap2->dim, isl_dim_param))
2381 isl_assert(bmap1->ctx,
2382 isl_space_is_equal(bmap1->dim, bmap2->dim), goto error);
2384 if (bmap1->sample &&
2385 isl_basic_map_contains(bmap1, bmap1->sample) > 0 &&
2386 isl_basic_map_contains(bmap2, bmap1->sample) > 0)
2387 sample = isl_vec_copy(bmap1->sample);
2388 else if (bmap2->sample &&
2389 isl_basic_map_contains(bmap1, bmap2->sample) > 0 &&
2390 isl_basic_map_contains(bmap2, bmap2->sample) > 0)
2391 sample = isl_vec_copy(bmap2->sample);
2393 bmap1 = isl_basic_map_cow(bmap1);
2396 bmap1 = isl_basic_map_extend_space(bmap1, isl_space_copy(bmap1->dim),
2397 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
2398 bmap1 = add_constraints(bmap1, bmap2, 0, 0);
2401 isl_vec_free(sample);
2403 isl_vec_free(bmap1->sample);
2404 bmap1->sample = sample;
2407 bmap1 = isl_basic_map_simplify(bmap1);
2408 return isl_basic_map_finalize(bmap1);
2411 isl_vec_free(sample);
2412 isl_basic_map_free(bmap1);
2413 isl_basic_map_free(bmap2);
2417 struct isl_basic_set *isl_basic_set_intersect(
2418 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
2420 return (struct isl_basic_set *)
2421 isl_basic_map_intersect(
2422 (struct isl_basic_map *)bset1,
2423 (struct isl_basic_map *)bset2);
2426 /* Special case of isl_map_intersect, where both map1 and map2
2427 * are convex, without any divs and such that either map1 or map2
2428 * contains a single constraint. This constraint is then simply
2429 * added to the other map.
2431 static __isl_give isl_map *map_intersect_add_constraint(
2432 __isl_take isl_map *map1, __isl_take isl_map *map2)
2434 isl_assert(map1->ctx, map1->n == 1, goto error);
2435 isl_assert(map2->ctx, map1->n == 1, goto error);
2436 isl_assert(map1->ctx, map1->p[0]->n_div == 0, goto error);
2437 isl_assert(map2->ctx, map1->p[0]->n_div == 0, goto error);
2439 if (map2->p[0]->n_eq + map2->p[0]->n_ineq != 1)
2440 return isl_map_intersect(map2, map1);
2442 isl_assert(map2->ctx,
2443 map2->p[0]->n_eq + map2->p[0]->n_ineq == 1, goto error);
2445 map1 = isl_map_cow(map1);
2448 if (isl_map_plain_is_empty(map1)) {
2452 map1->p[0] = isl_basic_map_cow(map1->p[0]);
2453 if (map2->p[0]->n_eq == 1)
2454 map1->p[0] = isl_basic_map_add_eq(map1->p[0], map2->p[0]->eq[0]);
2456 map1->p[0] = isl_basic_map_add_ineq(map1->p[0],
2457 map2->p[0]->ineq[0]);
2459 map1->p[0] = isl_basic_map_simplify(map1->p[0]);
2460 map1->p[0] = isl_basic_map_finalize(map1->p[0]);
2464 if (isl_basic_map_plain_is_empty(map1->p[0])) {
2465 isl_basic_map_free(map1->p[0]);
2478 static __isl_give isl_map *map_intersect(__isl_take isl_map *map1,
2479 __isl_take isl_map *map2)
2482 struct isl_map *result;
2488 if (isl_map_plain_is_empty(map1) &&
2489 isl_space_is_equal(map1->dim, map2->dim)) {
2493 if (isl_map_plain_is_empty(map2) &&
2494 isl_space_is_equal(map1->dim, map2->dim)) {
2499 if (map1->n == 1 && map2->n == 1 &&
2500 map1->p[0]->n_div == 0 && map2->p[0]->n_div == 0 &&
2501 isl_space_is_equal(map1->dim, map2->dim) &&
2502 (map1->p[0]->n_eq + map1->p[0]->n_ineq == 1 ||
2503 map2->p[0]->n_eq + map2->p[0]->n_ineq == 1))
2504 return map_intersect_add_constraint(map1, map2);
2505 if (isl_map_is_params(map1) && !isl_map_is_params(map2))
2506 return isl_map_intersect(map2, map1);
2507 if (isl_space_dim(map1->dim, isl_dim_all) ==
2508 isl_space_dim(map1->dim, isl_dim_param) &&
2509 isl_space_dim(map2->dim, isl_dim_all) !=
2510 isl_space_dim(map2->dim, isl_dim_param))
2511 return isl_map_intersect(map2, map1);
2513 if (isl_space_dim(map2->dim, isl_dim_all) !=
2514 isl_space_dim(map2->dim, isl_dim_param))
2515 isl_assert(map1->ctx,
2516 isl_space_is_equal(map1->dim, map2->dim), goto error);
2518 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
2519 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
2520 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
2522 result = isl_map_alloc_space(isl_space_copy(map1->dim),
2523 map1->n * map2->n, flags);
2526 for (i = 0; i < map1->n; ++i)
2527 for (j = 0; j < map2->n; ++j) {
2528 struct isl_basic_map *part;
2529 part = isl_basic_map_intersect(
2530 isl_basic_map_copy(map1->p[i]),
2531 isl_basic_map_copy(map2->p[j]));
2532 if (isl_basic_map_is_empty(part))
2533 isl_basic_map_free(part);
2535 result = isl_map_add_basic_map(result, part);
2548 __isl_give isl_map *isl_map_intersect(__isl_take isl_map *map1,
2549 __isl_take isl_map *map2)
2551 return isl_map_align_params_map_map_and(map1, map2, &map_intersect);
2554 struct isl_set *isl_set_intersect(struct isl_set *set1, struct isl_set *set2)
2556 return (struct isl_set *)
2557 isl_map_intersect((struct isl_map *)set1,
2558 (struct isl_map *)set2);
2561 /* The current implementation of isl_map_intersect accepts intersections
2562 * with parameter domains, so we can just call that for now.
2564 static __isl_give isl_map *map_intersect_params(__isl_take isl_map *map,
2565 __isl_take isl_set *params)
2567 return isl_map_intersect(map, params);
2570 __isl_give isl_map *isl_map_intersect_params(__isl_take isl_map *map1,
2571 __isl_take isl_map *map2)
2573 return isl_map_align_params_map_map_and(map1, map2, &map_intersect_params);
2576 __isl_give isl_set *isl_set_intersect_params(__isl_take isl_set *set,
2577 __isl_take isl_set *params)
2579 return isl_map_intersect_params(set, params);
2582 struct isl_basic_map *isl_basic_map_reverse(struct isl_basic_map *bmap)
2585 struct isl_basic_set *bset;
2590 bmap = isl_basic_map_cow(bmap);
2593 dim = isl_space_reverse(isl_space_copy(bmap->dim));
2594 in = isl_basic_map_n_in(bmap);
2595 bset = isl_basic_set_from_basic_map(bmap);
2596 bset = isl_basic_set_swap_vars(bset, in);
2597 return isl_basic_map_from_basic_set(bset, dim);
2600 static __isl_give isl_basic_map *basic_map_space_reset(
2601 __isl_take isl_basic_map *bmap, enum isl_dim_type type)
2605 if (!isl_space_is_named_or_nested(bmap->dim, type))
2608 space = isl_basic_map_get_space(bmap);
2609 space = isl_space_reset(space, type);
2610 bmap = isl_basic_map_reset_space(bmap, space);
2614 __isl_give isl_basic_map *isl_basic_map_insert(__isl_take isl_basic_map *bmap,
2615 enum isl_dim_type type, unsigned pos, unsigned n)
2618 struct isl_basic_map *res;
2619 struct isl_dim_map *dim_map;
2620 unsigned total, off;
2621 enum isl_dim_type t;
2624 return basic_map_space_reset(bmap, type);
2629 res_dim = isl_space_insert_dims(isl_basic_map_get_space(bmap), type, pos, n);
2631 total = isl_basic_map_total_dim(bmap) + n;
2632 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2634 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
2636 isl_dim_map_dim(dim_map, bmap->dim, t, off);
2638 unsigned size = isl_basic_map_dim(bmap, t);
2639 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2641 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2642 pos, size - pos, off + pos + n);
2644 off += isl_space_dim(res_dim, t);
2646 isl_dim_map_div(dim_map, bmap, off);
2648 res = isl_basic_map_alloc_space(res_dim,
2649 bmap->n_div, bmap->n_eq, bmap->n_ineq);
2650 if (isl_basic_map_is_rational(bmap))
2651 res = isl_basic_map_set_rational(res);
2652 res = isl_basic_map_add_constraints_dim_map(res, bmap, dim_map);
2653 return isl_basic_map_finalize(res);
2656 __isl_give isl_basic_map *isl_basic_map_add(__isl_take isl_basic_map *bmap,
2657 enum isl_dim_type type, unsigned n)
2661 return isl_basic_map_insert(bmap, type,
2662 isl_basic_map_dim(bmap, type), n);
2665 __isl_give isl_basic_set *isl_basic_set_add(__isl_take isl_basic_set *bset,
2666 enum isl_dim_type type, unsigned n)
2670 isl_assert(bset->ctx, type != isl_dim_in, goto error);
2671 return (isl_basic_set *)isl_basic_map_add((isl_basic_map *)bset, type, n);
2673 isl_basic_set_free(bset);
2677 static __isl_give isl_map *map_space_reset(__isl_take isl_map *map,
2678 enum isl_dim_type type)
2682 if (!isl_space_is_named_or_nested(map->dim, type))
2685 space = isl_map_get_space(map);
2686 space = isl_space_reset(space, type);
2687 map = isl_map_reset_space(map, space);
2691 __isl_give isl_map *isl_map_insert_dims(__isl_take isl_map *map,
2692 enum isl_dim_type type, unsigned pos, unsigned n)
2697 return map_space_reset(map, type);
2699 map = isl_map_cow(map);
2703 map->dim = isl_space_insert_dims(map->dim, type, pos, n);
2707 for (i = 0; i < map->n; ++i) {
2708 map->p[i] = isl_basic_map_insert(map->p[i], type, pos, n);
2719 __isl_give isl_set *isl_set_insert_dims(__isl_take isl_set *set,
2720 enum isl_dim_type type, unsigned pos, unsigned n)
2722 return isl_map_insert_dims(set, type, pos, n);
2725 __isl_give isl_map *isl_map_add_dims(__isl_take isl_map *map,
2726 enum isl_dim_type type, unsigned n)
2730 return isl_map_insert_dims(map, type, isl_map_dim(map, type), n);
2733 __isl_give isl_set *isl_set_add_dims(__isl_take isl_set *set,
2734 enum isl_dim_type type, unsigned n)
2738 isl_assert(set->ctx, type != isl_dim_in, goto error);
2739 return (isl_set *)isl_map_add_dims((isl_map *)set, type, n);
2745 __isl_give isl_basic_map *isl_basic_map_move_dims(
2746 __isl_take isl_basic_map *bmap,
2747 enum isl_dim_type dst_type, unsigned dst_pos,
2748 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2750 struct isl_dim_map *dim_map;
2751 struct isl_basic_map *res;
2752 enum isl_dim_type t;
2753 unsigned total, off;
2760 isl_assert(bmap->ctx, src_pos + n <= isl_basic_map_dim(bmap, src_type),
2763 if (dst_type == src_type && dst_pos == src_pos)
2766 isl_assert(bmap->ctx, dst_type != src_type, goto error);
2768 if (pos(bmap->dim, dst_type) + dst_pos ==
2769 pos(bmap->dim, src_type) + src_pos +
2770 ((src_type < dst_type) ? n : 0)) {
2771 bmap = isl_basic_map_cow(bmap);
2775 bmap->dim = isl_space_move_dims(bmap->dim, dst_type, dst_pos,
2776 src_type, src_pos, n);
2780 bmap = isl_basic_map_finalize(bmap);
2785 total = isl_basic_map_total_dim(bmap);
2786 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2789 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
2790 unsigned size = isl_space_dim(bmap->dim, t);
2791 if (t == dst_type) {
2792 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2795 isl_dim_map_dim_range(dim_map, bmap->dim, src_type,
2798 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2799 dst_pos, size - dst_pos, off);
2800 off += size - dst_pos;
2801 } else if (t == src_type) {
2802 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2805 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2806 src_pos + n, size - src_pos - n, off);
2807 off += size - src_pos - n;
2809 isl_dim_map_dim(dim_map, bmap->dim, t, off);
2813 isl_dim_map_div(dim_map, bmap, off);
2815 res = isl_basic_map_alloc_space(isl_basic_map_get_space(bmap),
2816 bmap->n_div, bmap->n_eq, bmap->n_ineq);
2817 bmap = isl_basic_map_add_constraints_dim_map(res, bmap, dim_map);
2819 bmap->dim = isl_space_move_dims(bmap->dim, dst_type, dst_pos,
2820 src_type, src_pos, n);
2824 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
2825 bmap = isl_basic_map_gauss(bmap, NULL);
2826 bmap = isl_basic_map_finalize(bmap);
2830 isl_basic_map_free(bmap);
2834 __isl_give isl_basic_set *isl_basic_set_move_dims(__isl_take isl_basic_set *bset,
2835 enum isl_dim_type dst_type, unsigned dst_pos,
2836 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2838 return (isl_basic_set *)isl_basic_map_move_dims(
2839 (isl_basic_map *)bset, dst_type, dst_pos, src_type, src_pos, n);
2842 __isl_give isl_set *isl_set_move_dims(__isl_take isl_set *set,
2843 enum isl_dim_type dst_type, unsigned dst_pos,
2844 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2848 isl_assert(set->ctx, dst_type != isl_dim_in, goto error);
2849 return (isl_set *)isl_map_move_dims((isl_map *)set, dst_type, dst_pos,
2850 src_type, src_pos, n);
2856 __isl_give isl_map *isl_map_move_dims(__isl_take isl_map *map,
2857 enum isl_dim_type dst_type, unsigned dst_pos,
2858 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2867 isl_assert(map->ctx, src_pos + n <= isl_map_dim(map, src_type),
2870 if (dst_type == src_type && dst_pos == src_pos)
2873 isl_assert(map->ctx, dst_type != src_type, goto error);
2875 map = isl_map_cow(map);
2879 map->dim = isl_space_move_dims(map->dim, dst_type, dst_pos, src_type, src_pos, n);
2883 for (i = 0; i < map->n; ++i) {
2884 map->p[i] = isl_basic_map_move_dims(map->p[i],
2886 src_type, src_pos, n);
2897 /* Move the specified dimensions to the last columns right before
2898 * the divs. Don't change the dimension specification of bmap.
2899 * That's the responsibility of the caller.
2901 static __isl_give isl_basic_map *move_last(__isl_take isl_basic_map *bmap,
2902 enum isl_dim_type type, unsigned first, unsigned n)
2904 struct isl_dim_map *dim_map;
2905 struct isl_basic_map *res;
2906 enum isl_dim_type t;
2907 unsigned total, off;
2911 if (pos(bmap->dim, type) + first + n ==
2912 1 + isl_space_dim(bmap->dim, isl_dim_all))
2915 total = isl_basic_map_total_dim(bmap);
2916 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2919 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
2920 unsigned size = isl_space_dim(bmap->dim, t);
2922 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2925 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2926 first, n, total - bmap->n_div - n);
2927 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2928 first + n, size - (first + n), off);
2929 off += size - (first + n);
2931 isl_dim_map_dim(dim_map, bmap->dim, t, off);
2935 isl_dim_map_div(dim_map, bmap, off + n);
2937 res = isl_basic_map_alloc_space(isl_basic_map_get_space(bmap),
2938 bmap->n_div, bmap->n_eq, bmap->n_ineq);
2939 res = isl_basic_map_add_constraints_dim_map(res, bmap, dim_map);
2943 /* Turn the n dimensions of type type, starting at first
2944 * into existentially quantified variables.
2946 __isl_give isl_basic_map *isl_basic_map_project_out(
2947 __isl_take isl_basic_map *bmap,
2948 enum isl_dim_type type, unsigned first, unsigned n)
2961 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL))
2962 return isl_basic_map_remove_dims(bmap, type, first, n);
2964 isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
2967 bmap = move_last(bmap, type, first, n);
2968 bmap = isl_basic_map_cow(bmap);
2972 row_size = 1 + isl_space_dim(bmap->dim, isl_dim_all) + bmap->extra;
2973 old = bmap->block2.data;
2974 bmap->block2 = isl_blk_extend(bmap->ctx, bmap->block2,
2975 (bmap->extra + n) * (1 + row_size));
2976 if (!bmap->block2.data)
2978 new_div = isl_alloc_array(bmap->ctx, isl_int *, bmap->extra + n);
2981 for (i = 0; i < n; ++i) {
2982 new_div[i] = bmap->block2.data +
2983 (bmap->extra + i) * (1 + row_size);
2984 isl_seq_clr(new_div[i], 1 + row_size);
2986 for (i = 0; i < bmap->extra; ++i)
2987 new_div[n + i] = bmap->block2.data + (bmap->div[i] - old);
2989 bmap->div = new_div;
2993 bmap->dim = isl_space_drop_dims(bmap->dim, type, first, n);
2996 bmap = isl_basic_map_simplify(bmap);
2997 bmap = isl_basic_map_drop_redundant_divs(bmap);
2998 return isl_basic_map_finalize(bmap);
3000 isl_basic_map_free(bmap);
3004 /* Turn the n dimensions of type type, starting at first
3005 * into existentially quantified variables.
3007 struct isl_basic_set *isl_basic_set_project_out(struct isl_basic_set *bset,
3008 enum isl_dim_type type, unsigned first, unsigned n)
3010 return (isl_basic_set *)isl_basic_map_project_out(
3011 (isl_basic_map *)bset, type, first, n);
3014 /* Turn the n dimensions of type type, starting at first
3015 * into existentially quantified variables.
3017 __isl_give isl_map *isl_map_project_out(__isl_take isl_map *map,
3018 enum isl_dim_type type, unsigned first, unsigned n)
3028 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
3030 map = isl_map_cow(map);
3034 map->dim = isl_space_drop_dims(map->dim, type, first, n);
3038 for (i = 0; i < map->n; ++i) {
3039 map->p[i] = isl_basic_map_project_out(map->p[i], type, first, n);
3050 /* Turn the n dimensions of type type, starting at first
3051 * into existentially quantified variables.
3053 __isl_give isl_set *isl_set_project_out(__isl_take isl_set *set,
3054 enum isl_dim_type type, unsigned first, unsigned n)
3056 return (isl_set *)isl_map_project_out((isl_map *)set, type, first, n);
3059 static struct isl_basic_map *add_divs(struct isl_basic_map *bmap, unsigned n)
3063 for (i = 0; i < n; ++i) {
3064 j = isl_basic_map_alloc_div(bmap);
3067 isl_seq_clr(bmap->div[j], 1+1+isl_basic_map_total_dim(bmap));
3071 isl_basic_map_free(bmap);
3075 struct isl_basic_map *isl_basic_map_apply_range(
3076 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3078 isl_space *dim_result = NULL;
3079 struct isl_basic_map *bmap;
3080 unsigned n_in, n_out, n, nparam, total, pos;
3081 struct isl_dim_map *dim_map1, *dim_map2;
3083 if (!bmap1 || !bmap2)
3086 dim_result = isl_space_join(isl_space_copy(bmap1->dim),
3087 isl_space_copy(bmap2->dim));
3089 n_in = isl_basic_map_n_in(bmap1);
3090 n_out = isl_basic_map_n_out(bmap2);
3091 n = isl_basic_map_n_out(bmap1);
3092 nparam = isl_basic_map_n_param(bmap1);
3094 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + n;
3095 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
3096 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
3097 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
3098 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
3099 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
3100 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_in);
3101 isl_dim_map_div(dim_map1, bmap1, pos += n_out);
3102 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
3103 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
3104 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
3106 bmap = isl_basic_map_alloc_space(dim_result,
3107 bmap1->n_div + bmap2->n_div + n,
3108 bmap1->n_eq + bmap2->n_eq,
3109 bmap1->n_ineq + bmap2->n_ineq);
3110 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap1, dim_map1);
3111 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap2, dim_map2);
3112 bmap = add_divs(bmap, n);
3113 bmap = isl_basic_map_simplify(bmap);
3114 bmap = isl_basic_map_drop_redundant_divs(bmap);
3115 return isl_basic_map_finalize(bmap);
3117 isl_basic_map_free(bmap1);
3118 isl_basic_map_free(bmap2);
3122 struct isl_basic_set *isl_basic_set_apply(
3123 struct isl_basic_set *bset, struct isl_basic_map *bmap)
3128 isl_assert(bset->ctx, isl_basic_map_compatible_domain(bmap, bset),
3131 return (struct isl_basic_set *)
3132 isl_basic_map_apply_range((struct isl_basic_map *)bset, bmap);
3134 isl_basic_set_free(bset);
3135 isl_basic_map_free(bmap);
3139 struct isl_basic_map *isl_basic_map_apply_domain(
3140 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3142 if (!bmap1 || !bmap2)
3145 isl_assert(bmap1->ctx,
3146 isl_basic_map_n_in(bmap1) == isl_basic_map_n_in(bmap2), goto error);
3147 isl_assert(bmap1->ctx,
3148 isl_basic_map_n_param(bmap1) == isl_basic_map_n_param(bmap2),
3151 bmap1 = isl_basic_map_reverse(bmap1);
3152 bmap1 = isl_basic_map_apply_range(bmap1, bmap2);
3153 return isl_basic_map_reverse(bmap1);
3155 isl_basic_map_free(bmap1);
3156 isl_basic_map_free(bmap2);
3160 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
3161 * A \cap B -> f(A) + f(B)
3163 struct isl_basic_map *isl_basic_map_sum(
3164 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3166 unsigned n_in, n_out, nparam, total, pos;
3167 struct isl_basic_map *bmap = NULL;
3168 struct isl_dim_map *dim_map1, *dim_map2;
3171 if (!bmap1 || !bmap2)
3174 isl_assert(bmap1->ctx, isl_space_is_equal(bmap1->dim, bmap2->dim),
3177 nparam = isl_basic_map_n_param(bmap1);
3178 n_in = isl_basic_map_n_in(bmap1);
3179 n_out = isl_basic_map_n_out(bmap1);
3181 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + 2 * n_out;
3182 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
3183 dim_map2 = isl_dim_map_alloc(bmap2->ctx, total);
3184 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
3185 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos);
3186 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
3187 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
3188 isl_dim_map_div(dim_map1, bmap1, pos += n_in + n_out);
3189 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
3190 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
3191 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_out);
3193 bmap = isl_basic_map_alloc_space(isl_space_copy(bmap1->dim),
3194 bmap1->n_div + bmap2->n_div + 2 * n_out,
3195 bmap1->n_eq + bmap2->n_eq + n_out,
3196 bmap1->n_ineq + bmap2->n_ineq);
3197 for (i = 0; i < n_out; ++i) {
3198 int j = isl_basic_map_alloc_equality(bmap);
3201 isl_seq_clr(bmap->eq[j], 1+total);
3202 isl_int_set_si(bmap->eq[j][1+nparam+n_in+i], -1);
3203 isl_int_set_si(bmap->eq[j][1+pos+i], 1);
3204 isl_int_set_si(bmap->eq[j][1+pos-n_out+i], 1);
3206 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap1, dim_map1);
3207 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap2, dim_map2);
3208 bmap = add_divs(bmap, 2 * n_out);
3210 bmap = isl_basic_map_simplify(bmap);
3211 return isl_basic_map_finalize(bmap);
3213 isl_basic_map_free(bmap);
3214 isl_basic_map_free(bmap1);
3215 isl_basic_map_free(bmap2);
3219 /* Given two maps A -> f(A) and B -> g(B), construct a map
3220 * A \cap B -> f(A) + f(B)
3222 struct isl_map *isl_map_sum(struct isl_map *map1, struct isl_map *map2)
3224 struct isl_map *result;
3230 isl_assert(map1->ctx, isl_space_is_equal(map1->dim, map2->dim), goto error);
3232 result = isl_map_alloc_space(isl_space_copy(map1->dim),
3233 map1->n * map2->n, 0);
3236 for (i = 0; i < map1->n; ++i)
3237 for (j = 0; j < map2->n; ++j) {
3238 struct isl_basic_map *part;
3239 part = isl_basic_map_sum(
3240 isl_basic_map_copy(map1->p[i]),
3241 isl_basic_map_copy(map2->p[j]));
3242 if (isl_basic_map_is_empty(part))
3243 isl_basic_map_free(part);
3245 result = isl_map_add_basic_map(result, part);
3258 __isl_give isl_set *isl_set_sum(__isl_take isl_set *set1,
3259 __isl_take isl_set *set2)
3261 return (isl_set *)isl_map_sum((isl_map *)set1, (isl_map *)set2);
3264 /* Given a basic map A -> f(A), construct A -> -f(A).
3266 struct isl_basic_map *isl_basic_map_neg(struct isl_basic_map *bmap)
3271 bmap = isl_basic_map_cow(bmap);
3275 n = isl_basic_map_dim(bmap, isl_dim_out);
3276 off = isl_basic_map_offset(bmap, isl_dim_out);
3277 for (i = 0; i < bmap->n_eq; ++i)
3278 for (j = 0; j < n; ++j)
3279 isl_int_neg(bmap->eq[i][off+j], bmap->eq[i][off+j]);
3280 for (i = 0; i < bmap->n_ineq; ++i)
3281 for (j = 0; j < n; ++j)
3282 isl_int_neg(bmap->ineq[i][off+j], bmap->ineq[i][off+j]);
3283 for (i = 0; i < bmap->n_div; ++i)
3284 for (j = 0; j < n; ++j)
3285 isl_int_neg(bmap->div[i][1+off+j], bmap->div[i][1+off+j]);
3286 bmap = isl_basic_map_gauss(bmap, NULL);
3287 return isl_basic_map_finalize(bmap);
3290 __isl_give isl_basic_set *isl_basic_set_neg(__isl_take isl_basic_set *bset)
3292 return isl_basic_map_neg(bset);
3295 /* Given a map A -> f(A), construct A -> -f(A).
3297 struct isl_map *isl_map_neg(struct isl_map *map)
3301 map = isl_map_cow(map);
3305 for (i = 0; i < map->n; ++i) {
3306 map->p[i] = isl_basic_map_neg(map->p[i]);
3317 __isl_give isl_set *isl_set_neg(__isl_take isl_set *set)
3319 return (isl_set *)isl_map_neg((isl_map *)set);
3322 /* Given a basic map A -> f(A) and an integer d, construct a basic map
3323 * A -> floor(f(A)/d).
3325 struct isl_basic_map *isl_basic_map_floordiv(struct isl_basic_map *bmap,
3328 unsigned n_in, n_out, nparam, total, pos;
3329 struct isl_basic_map *result = NULL;
3330 struct isl_dim_map *dim_map;
3336 nparam = isl_basic_map_n_param(bmap);
3337 n_in = isl_basic_map_n_in(bmap);
3338 n_out = isl_basic_map_n_out(bmap);
3340 total = nparam + n_in + n_out + bmap->n_div + n_out;
3341 dim_map = isl_dim_map_alloc(bmap->ctx, total);
3342 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_param, pos = 0);
3343 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_in, pos += nparam);
3344 isl_dim_map_div(dim_map, bmap, pos += n_in + n_out);
3345 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_out, pos += bmap->n_div);
3347 result = isl_basic_map_alloc_space(isl_space_copy(bmap->dim),
3348 bmap->n_div + n_out,
3349 bmap->n_eq, bmap->n_ineq + 2 * n_out);
3350 result = isl_basic_map_add_constraints_dim_map(result, bmap, dim_map);
3351 result = add_divs(result, n_out);
3352 for (i = 0; i < n_out; ++i) {
3354 j = isl_basic_map_alloc_inequality(result);
3357 isl_seq_clr(result->ineq[j], 1+total);
3358 isl_int_neg(result->ineq[j][1+nparam+n_in+i], d);
3359 isl_int_set_si(result->ineq[j][1+pos+i], 1);
3360 j = isl_basic_map_alloc_inequality(result);
3363 isl_seq_clr(result->ineq[j], 1+total);
3364 isl_int_set(result->ineq[j][1+nparam+n_in+i], d);
3365 isl_int_set_si(result->ineq[j][1+pos+i], -1);
3366 isl_int_sub_ui(result->ineq[j][0], d, 1);
3369 result = isl_basic_map_simplify(result);
3370 return isl_basic_map_finalize(result);
3372 isl_basic_map_free(result);
3376 /* Given a map A -> f(A) and an integer d, construct a map
3377 * A -> floor(f(A)/d).
3379 struct isl_map *isl_map_floordiv(struct isl_map *map, isl_int d)
3383 map = isl_map_cow(map);
3387 ISL_F_CLR(map, ISL_MAP_DISJOINT);
3388 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3389 for (i = 0; i < map->n; ++i) {
3390 map->p[i] = isl_basic_map_floordiv(map->p[i], d);
3401 static struct isl_basic_map *var_equal(struct isl_basic_map *bmap, unsigned pos)
3407 i = isl_basic_map_alloc_equality(bmap);
3410 nparam = isl_basic_map_n_param(bmap);
3411 n_in = isl_basic_map_n_in(bmap);
3412 isl_seq_clr(bmap->eq[i], 1 + isl_basic_map_total_dim(bmap));
3413 isl_int_set_si(bmap->eq[i][1+nparam+pos], -1);
3414 isl_int_set_si(bmap->eq[i][1+nparam+n_in+pos], 1);
3415 return isl_basic_map_finalize(bmap);
3417 isl_basic_map_free(bmap);
3421 /* Add a constraints to "bmap" expressing i_pos < o_pos
3423 static struct isl_basic_map *var_less(struct isl_basic_map *bmap, unsigned pos)
3429 i = isl_basic_map_alloc_inequality(bmap);
3432 nparam = isl_basic_map_n_param(bmap);
3433 n_in = isl_basic_map_n_in(bmap);
3434 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
3435 isl_int_set_si(bmap->ineq[i][0], -1);
3436 isl_int_set_si(bmap->ineq[i][1+nparam+pos], -1);
3437 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], 1);
3438 return isl_basic_map_finalize(bmap);
3440 isl_basic_map_free(bmap);
3444 /* Add a constraint to "bmap" expressing i_pos <= o_pos
3446 static __isl_give isl_basic_map *var_less_or_equal(
3447 __isl_take isl_basic_map *bmap, unsigned pos)
3453 i = isl_basic_map_alloc_inequality(bmap);
3456 nparam = isl_basic_map_n_param(bmap);
3457 n_in = isl_basic_map_n_in(bmap);
3458 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
3459 isl_int_set_si(bmap->ineq[i][1+nparam+pos], -1);
3460 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], 1);
3461 return isl_basic_map_finalize(bmap);
3463 isl_basic_map_free(bmap);
3467 /* Add a constraints to "bmap" expressing i_pos > o_pos
3469 static struct isl_basic_map *var_more(struct isl_basic_map *bmap, unsigned pos)
3475 i = isl_basic_map_alloc_inequality(bmap);
3478 nparam = isl_basic_map_n_param(bmap);
3479 n_in = isl_basic_map_n_in(bmap);
3480 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
3481 isl_int_set_si(bmap->ineq[i][0], -1);
3482 isl_int_set_si(bmap->ineq[i][1+nparam+pos], 1);
3483 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], -1);
3484 return isl_basic_map_finalize(bmap);
3486 isl_basic_map_free(bmap);
3490 /* Add a constraint to "bmap" expressing i_pos >= o_pos
3492 static __isl_give isl_basic_map *var_more_or_equal(
3493 __isl_take isl_basic_map *bmap, unsigned pos)
3499 i = isl_basic_map_alloc_inequality(bmap);
3502 nparam = isl_basic_map_n_param(bmap);
3503 n_in = isl_basic_map_n_in(bmap);
3504 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
3505 isl_int_set_si(bmap->ineq[i][1+nparam+pos], 1);
3506 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], -1);
3507 return isl_basic_map_finalize(bmap);
3509 isl_basic_map_free(bmap);
3513 __isl_give isl_basic_map *isl_basic_map_equal(
3514 __isl_take isl_space *dim, unsigned n_equal)
3517 struct isl_basic_map *bmap;
3518 bmap = isl_basic_map_alloc_space(dim, 0, n_equal, 0);
3521 for (i = 0; i < n_equal && bmap; ++i)
3522 bmap = var_equal(bmap, i);
3523 return isl_basic_map_finalize(bmap);
3526 /* Return a relation on of dimension "dim" expressing i_[0..pos] << o_[0..pos]
3528 __isl_give isl_basic_map *isl_basic_map_less_at(__isl_take isl_space *dim,
3532 struct isl_basic_map *bmap;
3533 bmap = isl_basic_map_alloc_space(dim, 0, pos, 1);
3536 for (i = 0; i < pos && bmap; ++i)
3537 bmap = var_equal(bmap, i);
3539 bmap = var_less(bmap, pos);
3540 return isl_basic_map_finalize(bmap);
3543 /* Return a relation on of dimension "dim" expressing i_[0..pos] <<= o_[0..pos]
3545 __isl_give isl_basic_map *isl_basic_map_less_or_equal_at(
3546 __isl_take isl_space *dim, unsigned pos)
3549 isl_basic_map *bmap;
3551 bmap = isl_basic_map_alloc_space(dim, 0, pos, 1);
3552 for (i = 0; i < pos; ++i)
3553 bmap = var_equal(bmap, i);
3554 bmap = var_less_or_equal(bmap, pos);
3555 return isl_basic_map_finalize(bmap);
3558 /* Return a relation on pairs of sets of dimension "dim" expressing i_pos > o_pos
3560 __isl_give isl_basic_map *isl_basic_map_more_at(__isl_take isl_space *dim,
3564 struct isl_basic_map *bmap;
3565 bmap = isl_basic_map_alloc_space(dim, 0, pos, 1);
3568 for (i = 0; i < pos && bmap; ++i)
3569 bmap = var_equal(bmap, i);
3571 bmap = var_more(bmap, pos);
3572 return isl_basic_map_finalize(bmap);
3575 /* Return a relation on of dimension "dim" expressing i_[0..pos] >>= o_[0..pos]
3577 __isl_give isl_basic_map *isl_basic_map_more_or_equal_at(
3578 __isl_take isl_space *dim, unsigned pos)
3581 isl_basic_map *bmap;
3583 bmap = isl_basic_map_alloc_space(dim, 0, pos, 1);
3584 for (i = 0; i < pos; ++i)
3585 bmap = var_equal(bmap, i);
3586 bmap = var_more_or_equal(bmap, pos);
3587 return isl_basic_map_finalize(bmap);
3590 static __isl_give isl_map *map_lex_lte_first(__isl_take isl_space *dims,
3591 unsigned n, int equal)
3593 struct isl_map *map;
3596 if (n == 0 && equal)
3597 return isl_map_universe(dims);
3599 map = isl_map_alloc_space(isl_space_copy(dims), n, ISL_MAP_DISJOINT);
3601 for (i = 0; i + 1 < n; ++i)
3602 map = isl_map_add_basic_map(map,
3603 isl_basic_map_less_at(isl_space_copy(dims), i));
3606 map = isl_map_add_basic_map(map,
3607 isl_basic_map_less_or_equal_at(dims, n - 1));
3609 map = isl_map_add_basic_map(map,
3610 isl_basic_map_less_at(dims, n - 1));
3612 isl_space_free(dims);
3617 static __isl_give isl_map *map_lex_lte(__isl_take isl_space *dims, int equal)
3621 return map_lex_lte_first(dims, dims->n_out, equal);
3624 __isl_give isl_map *isl_map_lex_lt_first(__isl_take isl_space *dim, unsigned n)
3626 return map_lex_lte_first(dim, n, 0);
3629 __isl_give isl_map *isl_map_lex_le_first(__isl_take isl_space *dim, unsigned n)
3631 return map_lex_lte_first(dim, n, 1);
3634 __isl_give isl_map *isl_map_lex_lt(__isl_take isl_space *set_dim)
3636 return map_lex_lte(isl_space_map_from_set(set_dim), 0);
3639 __isl_give isl_map *isl_map_lex_le(__isl_take isl_space *set_dim)
3641 return map_lex_lte(isl_space_map_from_set(set_dim), 1);
3644 static __isl_give isl_map *map_lex_gte_first(__isl_take isl_space *dims,
3645 unsigned n, int equal)
3647 struct isl_map *map;
3650 if (n == 0 && equal)
3651 return isl_map_universe(dims);
3653 map = isl_map_alloc_space(isl_space_copy(dims), n, ISL_MAP_DISJOINT);
3655 for (i = 0; i + 1 < n; ++i)
3656 map = isl_map_add_basic_map(map,
3657 isl_basic_map_more_at(isl_space_copy(dims), i));
3660 map = isl_map_add_basic_map(map,
3661 isl_basic_map_more_or_equal_at(dims, n - 1));
3663 map = isl_map_add_basic_map(map,
3664 isl_basic_map_more_at(dims, n - 1));
3666 isl_space_free(dims);
3671 static __isl_give isl_map *map_lex_gte(__isl_take isl_space *dims, int equal)
3675 return map_lex_gte_first(dims, dims->n_out, equal);
3678 __isl_give isl_map *isl_map_lex_gt_first(__isl_take isl_space *dim, unsigned n)
3680 return map_lex_gte_first(dim, n, 0);
3683 __isl_give isl_map *isl_map_lex_ge_first(__isl_take isl_space *dim, unsigned n)
3685 return map_lex_gte_first(dim, n, 1);
3688 __isl_give isl_map *isl_map_lex_gt(__isl_take isl_space *set_dim)
3690 return map_lex_gte(isl_space_map_from_set(set_dim), 0);
3693 __isl_give isl_map *isl_map_lex_ge(__isl_take isl_space *set_dim)
3695 return map_lex_gte(isl_space_map_from_set(set_dim), 1);
3698 __isl_give isl_map *isl_set_lex_le_set(__isl_take isl_set *set1,
3699 __isl_take isl_set *set2)
3702 map = isl_map_lex_le(isl_set_get_space(set1));
3703 map = isl_map_intersect_domain(map, set1);
3704 map = isl_map_intersect_range(map, set2);
3708 __isl_give isl_map *isl_set_lex_lt_set(__isl_take isl_set *set1,
3709 __isl_take isl_set *set2)
3712 map = isl_map_lex_lt(isl_set_get_space(set1));
3713 map = isl_map_intersect_domain(map, set1);
3714 map = isl_map_intersect_range(map, set2);
3718 __isl_give isl_map *isl_set_lex_ge_set(__isl_take isl_set *set1,
3719 __isl_take isl_set *set2)
3722 map = isl_map_lex_ge(isl_set_get_space(set1));
3723 map = isl_map_intersect_domain(map, set1);
3724 map = isl_map_intersect_range(map, set2);
3728 __isl_give isl_map *isl_set_lex_gt_set(__isl_take isl_set *set1,
3729 __isl_take isl_set *set2)
3732 map = isl_map_lex_gt(isl_set_get_space(set1));
3733 map = isl_map_intersect_domain(map, set1);
3734 map = isl_map_intersect_range(map, set2);
3738 __isl_give isl_map *isl_map_lex_le_map(__isl_take isl_map *map1,
3739 __isl_take isl_map *map2)
3742 map = isl_map_lex_le(isl_space_range(isl_map_get_space(map1)));
3743 map = isl_map_apply_domain(map, isl_map_reverse(map1));
3744 map = isl_map_apply_range(map, isl_map_reverse(map2));
3748 __isl_give isl_map *isl_map_lex_lt_map(__isl_take isl_map *map1,
3749 __isl_take isl_map *map2)
3752 map = isl_map_lex_lt(isl_space_range(isl_map_get_space(map1)));
3753 map = isl_map_apply_domain(map, isl_map_reverse(map1));
3754 map = isl_map_apply_range(map, isl_map_reverse(map2));
3758 __isl_give isl_map *isl_map_lex_ge_map(__isl_take isl_map *map1,
3759 __isl_take isl_map *map2)
3762 map = isl_map_lex_ge(isl_space_range(isl_map_get_space(map1)));
3763 map = isl_map_apply_domain(map, isl_map_reverse(map1));
3764 map = isl_map_apply_range(map, isl_map_reverse(map2));
3768 __isl_give isl_map *isl_map_lex_gt_map(__isl_take isl_map *map1,
3769 __isl_take isl_map *map2)
3772 map = isl_map_lex_gt(isl_space_range(isl_map_get_space(map1)));
3773 map = isl_map_apply_domain(map, isl_map_reverse(map1));
3774 map = isl_map_apply_range(map, isl_map_reverse(map2));
3778 __isl_give isl_basic_map *isl_basic_map_from_basic_set(
3779 __isl_take isl_basic_set *bset, __isl_take isl_space *dim)
3781 struct isl_basic_map *bmap;
3783 bset = isl_basic_set_cow(bset);
3787 isl_assert(bset->ctx, isl_space_compatible(bset->dim, dim), goto error);
3788 isl_space_free(bset->dim);
3789 bmap = (struct isl_basic_map *) bset;
3791 return isl_basic_map_finalize(bmap);
3793 isl_basic_set_free(bset);
3794 isl_space_free(dim);
3798 struct isl_basic_set *isl_basic_set_from_basic_map(struct isl_basic_map *bmap)
3802 if (bmap->dim->n_in == 0)
3803 return (struct isl_basic_set *)bmap;
3804 bmap = isl_basic_map_cow(bmap);
3807 bmap->dim = isl_space_as_set_space(bmap->dim);
3810 bmap = isl_basic_map_finalize(bmap);
3811 return (struct isl_basic_set *)bmap;
3813 isl_basic_map_free(bmap);
3817 /* For a div d = floor(f/m), add the constraints
3820 * -(f-(n-1)) + m d >= 0
3822 * Note that the second constraint is the negation of
3826 int isl_basic_map_add_div_constraints_var(__isl_keep isl_basic_map *bmap,
3827 unsigned pos, isl_int *div)
3830 unsigned total = isl_basic_map_total_dim(bmap);
3832 i = isl_basic_map_alloc_inequality(bmap);
3835 isl_seq_cpy(bmap->ineq[i], div + 1, 1 + total);
3836 isl_int_neg(bmap->ineq[i][1 + pos], div[0]);
3838 j = isl_basic_map_alloc_inequality(bmap);
3841 isl_seq_neg(bmap->ineq[j], bmap->ineq[i], 1 + total);
3842 isl_int_add(bmap->ineq[j][0], bmap->ineq[j][0], bmap->ineq[j][1 + pos]);
3843 isl_int_sub_ui(bmap->ineq[j][0], bmap->ineq[j][0], 1);
3847 int isl_basic_set_add_div_constraints_var(__isl_keep isl_basic_set *bset,
3848 unsigned pos, isl_int *div)
3850 return isl_basic_map_add_div_constraints_var((isl_basic_map *)bset,
3854 int isl_basic_map_add_div_constraints(struct isl_basic_map *bmap, unsigned div)
3856 unsigned total = isl_basic_map_total_dim(bmap);
3857 unsigned div_pos = total - bmap->n_div + div;
3859 return isl_basic_map_add_div_constraints_var(bmap, div_pos,
3863 struct isl_basic_set *isl_basic_map_underlying_set(
3864 struct isl_basic_map *bmap)
3868 if (bmap->dim->nparam == 0 && bmap->dim->n_in == 0 &&
3870 !isl_space_is_named_or_nested(bmap->dim, isl_dim_in) &&
3871 !isl_space_is_named_or_nested(bmap->dim, isl_dim_out))
3872 return (struct isl_basic_set *)bmap;
3873 bmap = isl_basic_map_cow(bmap);
3876 bmap->dim = isl_space_underlying(bmap->dim, bmap->n_div);
3879 bmap->extra -= bmap->n_div;
3881 bmap = isl_basic_map_finalize(bmap);
3882 return (struct isl_basic_set *)bmap;
3887 __isl_give isl_basic_set *isl_basic_set_underlying_set(
3888 __isl_take isl_basic_set *bset)
3890 return isl_basic_map_underlying_set((isl_basic_map *)bset);
3893 struct isl_basic_map *isl_basic_map_overlying_set(
3894 struct isl_basic_set *bset, struct isl_basic_map *like)
3896 struct isl_basic_map *bmap;
3897 struct isl_ctx *ctx;
3904 isl_assert(ctx, bset->n_div == 0, goto error);
3905 isl_assert(ctx, isl_basic_set_n_param(bset) == 0, goto error);
3906 isl_assert(ctx, bset->dim->n_out == isl_basic_map_total_dim(like),
3908 if (isl_space_is_equal(bset->dim, like->dim) && like->n_div == 0) {
3909 isl_basic_map_free(like);
3910 return (struct isl_basic_map *)bset;
3912 bset = isl_basic_set_cow(bset);
3915 total = bset->dim->n_out + bset->extra;
3916 bmap = (struct isl_basic_map *)bset;
3917 isl_space_free(bmap->dim);
3918 bmap->dim = isl_space_copy(like->dim);
3921 bmap->n_div = like->n_div;
3922 bmap->extra += like->n_div;
3926 ltotal = total - bmap->extra + like->extra;
3929 bmap->block2 = isl_blk_extend(ctx, bmap->block2,
3930 bmap->extra * (1 + 1 + total));
3931 if (isl_blk_is_error(bmap->block2))
3933 div = isl_realloc_array(ctx, bmap->div, isl_int *, bmap->extra);
3937 for (i = 0; i < bmap->extra; ++i)
3938 bmap->div[i] = bmap->block2.data + i * (1 + 1 + total);
3939 for (i = 0; i < like->n_div; ++i) {
3940 isl_seq_cpy(bmap->div[i], like->div[i], 1 + 1 + ltotal);
3941 isl_seq_clr(bmap->div[i]+1+1+ltotal, total - ltotal);
3943 bmap = isl_basic_map_extend_constraints(bmap,
3944 0, 2 * like->n_div);
3945 for (i = 0; i < like->n_div; ++i) {
3946 if (isl_int_is_zero(bmap->div[i][0]))
3948 if (isl_basic_map_add_div_constraints(bmap, i) < 0)
3952 isl_basic_map_free(like);
3953 bmap = isl_basic_map_simplify(bmap);
3954 bmap = isl_basic_map_finalize(bmap);
3957 isl_basic_map_free(like);
3958 isl_basic_set_free(bset);
3962 struct isl_basic_set *isl_basic_set_from_underlying_set(
3963 struct isl_basic_set *bset, struct isl_basic_set *like)
3965 return (struct isl_basic_set *)
3966 isl_basic_map_overlying_set(bset, (struct isl_basic_map *)like);
3969 struct isl_set *isl_set_from_underlying_set(
3970 struct isl_set *set, struct isl_basic_set *like)
3976 isl_assert(set->ctx, set->dim->n_out == isl_basic_set_total_dim(like),
3978 if (isl_space_is_equal(set->dim, like->dim) && like->n_div == 0) {
3979 isl_basic_set_free(like);
3982 set = isl_set_cow(set);
3985 for (i = 0; i < set->n; ++i) {
3986 set->p[i] = isl_basic_set_from_underlying_set(set->p[i],
3987 isl_basic_set_copy(like));
3991 isl_space_free(set->dim);
3992 set->dim = isl_space_copy(like->dim);
3995 isl_basic_set_free(like);
3998 isl_basic_set_free(like);
4003 struct isl_set *isl_map_underlying_set(struct isl_map *map)
4007 map = isl_map_cow(map);
4010 map->dim = isl_space_cow(map->dim);
4014 for (i = 1; i < map->n; ++i)
4015 isl_assert(map->ctx, map->p[0]->n_div == map->p[i]->n_div,
4017 for (i = 0; i < map->n; ++i) {
4018 map->p[i] = (struct isl_basic_map *)
4019 isl_basic_map_underlying_set(map->p[i]);
4024 map->dim = isl_space_underlying(map->dim, 0);
4026 isl_space_free(map->dim);
4027 map->dim = isl_space_copy(map->p[0]->dim);
4031 return (struct isl_set *)map;
4037 struct isl_set *isl_set_to_underlying_set(struct isl_set *set)
4039 return (struct isl_set *)isl_map_underlying_set((struct isl_map *)set);
4042 __isl_give isl_basic_map *isl_basic_map_reset_space(
4043 __isl_take isl_basic_map *bmap, __isl_take isl_space *dim)
4045 bmap = isl_basic_map_cow(bmap);
4049 isl_space_free(bmap->dim);
4052 bmap = isl_basic_map_finalize(bmap);
4056 isl_basic_map_free(bmap);
4057 isl_space_free(dim);
4061 __isl_give isl_basic_set *isl_basic_set_reset_space(
4062 __isl_take isl_basic_set *bset, __isl_take isl_space *dim)
4064 return (isl_basic_set *)isl_basic_map_reset_space((isl_basic_map *)bset,
4068 __isl_give isl_map *isl_map_reset_space(__isl_take isl_map *map,
4069 __isl_take isl_space *dim)
4073 map = isl_map_cow(map);
4077 for (i = 0; i < map->n; ++i) {
4078 map->p[i] = isl_basic_map_reset_space(map->p[i],
4079 isl_space_copy(dim));
4083 isl_space_free(map->dim);
4089 isl_space_free(dim);
4093 __isl_give isl_set *isl_set_reset_space(__isl_take isl_set *set,
4094 __isl_take isl_space *dim)
4096 return (struct isl_set *) isl_map_reset_space((struct isl_map *)set, dim);
4099 /* Compute the parameter domain of the given basic set.
4101 __isl_give isl_basic_set *isl_basic_set_params(__isl_take isl_basic_set *bset)
4106 if (isl_basic_set_is_params(bset))
4109 n = isl_basic_set_dim(bset, isl_dim_set);
4110 bset = isl_basic_set_project_out(bset, isl_dim_set, 0, n);
4111 space = isl_basic_set_get_space(bset);
4112 space = isl_space_params(space);
4113 bset = isl_basic_set_reset_space(bset, space);
4117 /* Compute the parameter domain of the given set.
4119 __isl_give isl_set *isl_set_params(__isl_take isl_set *set)
4124 if (isl_set_is_params(set))
4127 n = isl_set_dim(set, isl_dim_set);
4128 set = isl_set_project_out(set, isl_dim_set, 0, n);
4129 space = isl_set_get_space(set);
4130 space = isl_space_params(space);
4131 set = isl_set_reset_space(set, space);
4135 /* Construct a zero-dimensional set with the given parameter domain.
4137 __isl_give isl_set *isl_set_from_params(__isl_take isl_set *set)
4140 space = isl_set_get_space(set);
4141 space = isl_space_set_from_params(space);
4142 set = isl_set_reset_space(set, space);
4146 /* Compute the parameter domain of the given map.
4148 __isl_give isl_set *isl_map_params(__isl_take isl_map *map)
4153 n = isl_map_dim(map, isl_dim_in);
4154 map = isl_map_project_out(map, isl_dim_in, 0, n);
4155 n = isl_map_dim(map, isl_dim_out);
4156 map = isl_map_project_out(map, isl_dim_out, 0, n);
4157 space = isl_map_get_space(map);
4158 space = isl_space_params(space);
4159 map = isl_map_reset_space(map, space);
4163 struct isl_basic_set *isl_basic_map_domain(struct isl_basic_map *bmap)
4166 struct isl_basic_set *domain;
4172 dim = isl_space_domain(isl_basic_map_get_space(bmap));
4174 n_in = isl_basic_map_n_in(bmap);
4175 n_out = isl_basic_map_n_out(bmap);
4176 domain = isl_basic_set_from_basic_map(bmap);
4177 domain = isl_basic_set_project_out(domain, isl_dim_set, n_in, n_out);
4179 domain = isl_basic_set_reset_space(domain, dim);
4184 int isl_basic_map_may_be_set(__isl_keep isl_basic_map *bmap)
4188 return isl_space_may_be_set(bmap->dim);
4191 /* Is this basic map actually a set?
4192 * Users should never call this function. Outside of isl,
4193 * the type should indicate whether something is a set or a map.
4195 int isl_basic_map_is_set(__isl_keep isl_basic_map *bmap)
4199 return isl_space_is_set(bmap->dim);
4202 struct isl_basic_set *isl_basic_map_range(struct isl_basic_map *bmap)
4206 if (isl_basic_map_is_set(bmap))
4208 return isl_basic_map_domain(isl_basic_map_reverse(bmap));
4211 __isl_give isl_basic_map *isl_basic_map_domain_map(
4212 __isl_take isl_basic_map *bmap)
4216 isl_basic_map *domain;
4217 int nparam, n_in, n_out;
4220 nparam = isl_basic_map_dim(bmap, isl_dim_param);
4221 n_in = isl_basic_map_dim(bmap, isl_dim_in);
4222 n_out = isl_basic_map_dim(bmap, isl_dim_out);
4224 dim = isl_space_from_range(isl_space_domain(isl_basic_map_get_space(bmap)));
4225 domain = isl_basic_map_universe(dim);
4227 bmap = isl_basic_map_from_domain(isl_basic_map_wrap(bmap));
4228 bmap = isl_basic_map_apply_range(bmap, domain);
4229 bmap = isl_basic_map_extend_constraints(bmap, n_in, 0);
4231 total = isl_basic_map_total_dim(bmap);
4233 for (i = 0; i < n_in; ++i) {
4234 k = isl_basic_map_alloc_equality(bmap);
4237 isl_seq_clr(bmap->eq[k], 1 + total);
4238 isl_int_set_si(bmap->eq[k][1 + nparam + i], -1);
4239 isl_int_set_si(bmap->eq[k][1 + nparam + n_in + n_out + i], 1);
4242 bmap = isl_basic_map_gauss(bmap, NULL);
4243 return isl_basic_map_finalize(bmap);
4245 isl_basic_map_free(bmap);
4249 __isl_give isl_basic_map *isl_basic_map_range_map(
4250 __isl_take isl_basic_map *bmap)
4254 isl_basic_map *range;
4255 int nparam, n_in, n_out;
4258 nparam = isl_basic_map_dim(bmap, isl_dim_param);
4259 n_in = isl_basic_map_dim(bmap, isl_dim_in);
4260 n_out = isl_basic_map_dim(bmap, isl_dim_out);
4262 dim = isl_space_from_range(isl_space_range(isl_basic_map_get_space(bmap)));
4263 range = isl_basic_map_universe(dim);
4265 bmap = isl_basic_map_from_domain(isl_basic_map_wrap(bmap));
4266 bmap = isl_basic_map_apply_range(bmap, range);
4267 bmap = isl_basic_map_extend_constraints(bmap, n_out, 0);
4269 total = isl_basic_map_total_dim(bmap);
4271 for (i = 0; i < n_out; ++i) {
4272 k = isl_basic_map_alloc_equality(bmap);
4275 isl_seq_clr(bmap->eq[k], 1 + total);
4276 isl_int_set_si(bmap->eq[k][1 + nparam + n_in + i], -1);
4277 isl_int_set_si(bmap->eq[k][1 + nparam + n_in + n_out + i], 1);
4280 bmap = isl_basic_map_gauss(bmap, NULL);
4281 return isl_basic_map_finalize(bmap);
4283 isl_basic_map_free(bmap);
4287 int isl_map_may_be_set(__isl_keep isl_map *map)
4291 return isl_space_may_be_set(map->dim);
4294 /* Is this map actually a set?
4295 * Users should never call this function. Outside of isl,
4296 * the type should indicate whether something is a set or a map.
4298 int isl_map_is_set(__isl_keep isl_map *map)
4302 return isl_space_is_set(map->dim);
4305 struct isl_set *isl_map_range(struct isl_map *map)
4308 struct isl_set *set;
4312 if (isl_map_is_set(map))
4313 return (isl_set *)map;
4315 map = isl_map_cow(map);
4319 set = (struct isl_set *) map;
4320 set->dim = isl_space_range(set->dim);
4323 for (i = 0; i < map->n; ++i) {
4324 set->p[i] = isl_basic_map_range(map->p[i]);
4328 ISL_F_CLR(set, ISL_MAP_DISJOINT);
4329 ISL_F_CLR(set, ISL_SET_NORMALIZED);
4336 __isl_give isl_map *isl_map_domain_map(__isl_take isl_map *map)
4339 isl_space *domain_dim;
4341 map = isl_map_cow(map);
4345 domain_dim = isl_space_from_range(isl_space_domain(isl_map_get_space(map)));
4346 map->dim = isl_space_from_domain(isl_space_wrap(map->dim));
4347 map->dim = isl_space_join(map->dim, domain_dim);
4350 for (i = 0; i < map->n; ++i) {
4351 map->p[i] = isl_basic_map_domain_map(map->p[i]);
4355 ISL_F_CLR(map, ISL_MAP_DISJOINT);
4356 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4363 __isl_give isl_map *isl_map_range_map(__isl_take isl_map *map)
4366 isl_space *range_dim;
4368 map = isl_map_cow(map);
4372 range_dim = isl_space_range(isl_map_get_space(map));
4373 range_dim = isl_space_from_range(range_dim);
4374 map->dim = isl_space_from_domain(isl_space_wrap(map->dim));
4375 map->dim = isl_space_join(map->dim, range_dim);
4378 for (i = 0; i < map->n; ++i) {
4379 map->p[i] = isl_basic_map_range_map(map->p[i]);
4383 ISL_F_CLR(map, ISL_MAP_DISJOINT);
4384 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4391 __isl_give isl_map *isl_map_from_set(__isl_take isl_set *set,
4392 __isl_take isl_space *dim)
4395 struct isl_map *map = NULL;
4397 set = isl_set_cow(set);
4400 isl_assert(set->ctx, isl_space_compatible(set->dim, dim), goto error);
4401 map = (struct isl_map *)set;
4402 for (i = 0; i < set->n; ++i) {
4403 map->p[i] = isl_basic_map_from_basic_set(
4404 set->p[i], isl_space_copy(dim));
4408 isl_space_free(map->dim);
4412 isl_space_free(dim);
4417 __isl_give isl_basic_map *isl_basic_map_from_domain(
4418 __isl_take isl_basic_set *bset)
4420 return isl_basic_map_reverse(isl_basic_map_from_range(bset));
4423 __isl_give isl_basic_map *isl_basic_map_from_range(
4424 __isl_take isl_basic_set *bset)
4427 space = isl_basic_set_get_space(bset);
4428 space = isl_space_from_range(space);
4429 bset = isl_basic_set_reset_space(bset, space);
4430 return (isl_basic_map *)bset;
4433 struct isl_map *isl_map_from_range(struct isl_set *set)
4436 space = isl_set_get_space(set);
4437 space = isl_space_from_range(space);
4438 set = isl_set_reset_space(set, space);
4439 return (struct isl_map *)set;
4442 __isl_give isl_map *isl_map_from_domain(__isl_take isl_set *set)
4444 return isl_map_reverse(isl_map_from_range(set));
4447 __isl_give isl_basic_map *isl_basic_map_from_domain_and_range(
4448 __isl_take isl_basic_set *domain, __isl_take isl_basic_set *range)
4450 return isl_basic_map_apply_range(isl_basic_map_reverse(domain), range);
4453 __isl_give isl_map *isl_map_from_domain_and_range(__isl_take isl_set *domain,
4454 __isl_take isl_set *range)
4456 return isl_map_apply_range(isl_map_reverse(domain), range);
4459 struct isl_set *isl_set_from_map(struct isl_map *map)
4462 struct isl_set *set = NULL;
4466 map = isl_map_cow(map);
4469 map->dim = isl_space_as_set_space(map->dim);
4472 set = (struct isl_set *)map;
4473 for (i = 0; i < map->n; ++i) {
4474 set->p[i] = isl_basic_set_from_basic_map(map->p[i]);
4484 __isl_give isl_map *isl_map_alloc_space(__isl_take isl_space *dim, int n,
4487 struct isl_map *map;
4491 isl_assert(dim->ctx, n >= 0, return NULL);
4492 map = isl_alloc(dim->ctx, struct isl_map,
4493 sizeof(struct isl_map) +
4494 (n - 1) * sizeof(struct isl_basic_map *));
4498 map->ctx = dim->ctx;
4499 isl_ctx_ref(map->ctx);
4507 isl_space_free(dim);
4511 struct isl_map *isl_map_alloc(struct isl_ctx *ctx,
4512 unsigned nparam, unsigned in, unsigned out, int n,
4515 struct isl_map *map;
4518 dims = isl_space_alloc(ctx, nparam, in, out);
4522 map = isl_map_alloc_space(dims, n, flags);
4526 __isl_give isl_basic_map *isl_basic_map_empty(__isl_take isl_space *dim)
4528 struct isl_basic_map *bmap;
4529 bmap = isl_basic_map_alloc_space(dim, 0, 1, 0);
4530 bmap = isl_basic_map_set_to_empty(bmap);
4534 __isl_give isl_basic_set *isl_basic_set_empty(__isl_take isl_space *dim)
4536 struct isl_basic_set *bset;
4537 bset = isl_basic_set_alloc_space(dim, 0, 1, 0);
4538 bset = isl_basic_set_set_to_empty(bset);
4542 struct isl_basic_map *isl_basic_map_empty_like(struct isl_basic_map *model)
4544 struct isl_basic_map *bmap;
4547 bmap = isl_basic_map_alloc_space(isl_space_copy(model->dim), 0, 1, 0);
4548 bmap = isl_basic_map_set_to_empty(bmap);
4552 struct isl_basic_map *isl_basic_map_empty_like_map(struct isl_map *model)
4554 struct isl_basic_map *bmap;
4557 bmap = isl_basic_map_alloc_space(isl_space_copy(model->dim), 0, 1, 0);
4558 bmap = isl_basic_map_set_to_empty(bmap);
4562 struct isl_basic_set *isl_basic_set_empty_like(struct isl_basic_set *model)
4564 struct isl_basic_set *bset;
4567 bset = isl_basic_set_alloc_space(isl_space_copy(model->dim), 0, 1, 0);
4568 bset = isl_basic_set_set_to_empty(bset);
4572 __isl_give isl_basic_map *isl_basic_map_universe(__isl_take isl_space *dim)
4574 struct isl_basic_map *bmap;
4575 bmap = isl_basic_map_alloc_space(dim, 0, 0, 0);
4576 bmap = isl_basic_map_finalize(bmap);
4580 __isl_give isl_basic_set *isl_basic_set_universe(__isl_take isl_space *dim)
4582 struct isl_basic_set *bset;
4583 bset = isl_basic_set_alloc_space(dim, 0, 0, 0);
4584 bset = isl_basic_set_finalize(bset);
4588 __isl_give isl_basic_map *isl_basic_map_nat_universe(__isl_take isl_space *dim)
4591 unsigned total = isl_space_dim(dim, isl_dim_all);
4592 isl_basic_map *bmap;
4594 bmap= isl_basic_map_alloc_space(dim, 0, 0, total);
4595 for (i = 0; i < total; ++i) {
4596 int k = isl_basic_map_alloc_inequality(bmap);
4599 isl_seq_clr(bmap->ineq[k], 1 + total);
4600 isl_int_set_si(bmap->ineq[k][1 + i], 1);
4604 isl_basic_map_free(bmap);
4608 __isl_give isl_basic_set *isl_basic_set_nat_universe(__isl_take isl_space *dim)
4610 return isl_basic_map_nat_universe(dim);
4613 __isl_give isl_map *isl_map_nat_universe(__isl_take isl_space *dim)
4615 return isl_map_from_basic_map(isl_basic_map_nat_universe(dim));
4618 __isl_give isl_set *isl_set_nat_universe(__isl_take isl_space *dim)
4620 return isl_map_nat_universe(dim);
4623 __isl_give isl_basic_map *isl_basic_map_universe_like(
4624 __isl_keep isl_basic_map *model)
4628 return isl_basic_map_alloc_space(isl_space_copy(model->dim), 0, 0, 0);
4631 struct isl_basic_set *isl_basic_set_universe_like(struct isl_basic_set *model)
4635 return isl_basic_set_alloc_space(isl_space_copy(model->dim), 0, 0, 0);
4638 __isl_give isl_basic_set *isl_basic_set_universe_like_set(
4639 __isl_keep isl_set *model)
4643 return isl_basic_set_alloc_space(isl_space_copy(model->dim), 0, 0, 0);
4646 __isl_give isl_map *isl_map_empty(__isl_take isl_space *dim)
4648 return isl_map_alloc_space(dim, 0, ISL_MAP_DISJOINT);
4651 struct isl_map *isl_map_empty_like(struct isl_map *model)
4655 return isl_map_alloc_space(isl_space_copy(model->dim), 0, ISL_MAP_DISJOINT);
4658 struct isl_map *isl_map_empty_like_basic_map(struct isl_basic_map *model)
4662 return isl_map_alloc_space(isl_space_copy(model->dim), 0, ISL_MAP_DISJOINT);
4665 __isl_give isl_set *isl_set_empty(__isl_take isl_space *dim)
4667 return isl_set_alloc_space(dim, 0, ISL_MAP_DISJOINT);
4670 struct isl_set *isl_set_empty_like(struct isl_set *model)
4674 return isl_set_empty(isl_space_copy(model->dim));
4677 __isl_give isl_map *isl_map_universe(__isl_take isl_space *dim)
4679 struct isl_map *map;
4682 map = isl_map_alloc_space(isl_space_copy(dim), 1, ISL_MAP_DISJOINT);
4683 map = isl_map_add_basic_map(map, isl_basic_map_universe(dim));
4687 __isl_give isl_set *isl_set_universe(__isl_take isl_space *dim)
4689 struct isl_set *set;
4692 set = isl_set_alloc_space(isl_space_copy(dim), 1, ISL_MAP_DISJOINT);
4693 set = isl_set_add_basic_set(set, isl_basic_set_universe(dim));
4697 __isl_give isl_set *isl_set_universe_like(__isl_keep isl_set *model)
4701 return isl_set_universe(isl_space_copy(model->dim));
4704 struct isl_map *isl_map_dup(struct isl_map *map)
4707 struct isl_map *dup;
4711 dup = isl_map_alloc_space(isl_space_copy(map->dim), map->n, map->flags);
4712 for (i = 0; i < map->n; ++i)
4713 dup = isl_map_add_basic_map(dup, isl_basic_map_copy(map->p[i]));
4717 __isl_give isl_map *isl_map_add_basic_map(__isl_take isl_map *map,
4718 __isl_take isl_basic_map *bmap)
4722 if (isl_basic_map_plain_is_empty(bmap)) {
4723 isl_basic_map_free(bmap);
4726 isl_assert(map->ctx, isl_space_is_equal(map->dim, bmap->dim), goto error);
4727 isl_assert(map->ctx, map->n < map->size, goto error);
4728 map->p[map->n] = bmap;
4730 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4736 isl_basic_map_free(bmap);
4740 void isl_map_free(struct isl_map *map)
4750 isl_ctx_deref(map->ctx);
4751 for (i = 0; i < map->n; ++i)
4752 isl_basic_map_free(map->p[i]);
4753 isl_space_free(map->dim);
4757 struct isl_map *isl_map_extend(struct isl_map *base,
4758 unsigned nparam, unsigned n_in, unsigned n_out)
4762 base = isl_map_cow(base);
4766 base->dim = isl_space_extend(base->dim, nparam, n_in, n_out);
4769 for (i = 0; i < base->n; ++i) {
4770 base->p[i] = isl_basic_map_extend_space(base->p[i],
4771 isl_space_copy(base->dim), 0, 0, 0);
4781 struct isl_set *isl_set_extend(struct isl_set *base,
4782 unsigned nparam, unsigned dim)
4784 return (struct isl_set *)isl_map_extend((struct isl_map *)base,
4788 static struct isl_basic_map *isl_basic_map_fix_pos_si(
4789 struct isl_basic_map *bmap, unsigned pos, int value)
4793 bmap = isl_basic_map_cow(bmap);
4794 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
4795 j = isl_basic_map_alloc_equality(bmap);
4798 isl_seq_clr(bmap->eq[j] + 1, isl_basic_map_total_dim(bmap));
4799 isl_int_set_si(bmap->eq[j][pos], -1);
4800 isl_int_set_si(bmap->eq[j][0], value);
4801 bmap = isl_basic_map_simplify(bmap);
4802 return isl_basic_map_finalize(bmap);
4804 isl_basic_map_free(bmap);
4808 static __isl_give isl_basic_map *isl_basic_map_fix_pos(
4809 __isl_take isl_basic_map *bmap, unsigned pos, isl_int value)
4813 bmap = isl_basic_map_cow(bmap);
4814 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
4815 j = isl_basic_map_alloc_equality(bmap);
4818 isl_seq_clr(bmap->eq[j] + 1, isl_basic_map_total_dim(bmap));
4819 isl_int_set_si(bmap->eq[j][pos], -1);
4820 isl_int_set(bmap->eq[j][0], value);
4821 bmap = isl_basic_map_simplify(bmap);
4822 return isl_basic_map_finalize(bmap);
4824 isl_basic_map_free(bmap);
4828 struct isl_basic_map *isl_basic_map_fix_si(struct isl_basic_map *bmap,
4829 enum isl_dim_type type, unsigned pos, int value)
4833 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
4834 return isl_basic_map_fix_pos_si(bmap,
4835 isl_basic_map_offset(bmap, type) + pos, value);
4837 isl_basic_map_free(bmap);
4841 __isl_give isl_basic_map *isl_basic_map_fix(__isl_take isl_basic_map *bmap,
4842 enum isl_dim_type type, unsigned pos, isl_int value)
4846 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
4847 return isl_basic_map_fix_pos(bmap,
4848 isl_basic_map_offset(bmap, type) + pos, value);
4850 isl_basic_map_free(bmap);
4854 struct isl_basic_set *isl_basic_set_fix_si(struct isl_basic_set *bset,
4855 enum isl_dim_type type, unsigned pos, int value)
4857 return (struct isl_basic_set *)
4858 isl_basic_map_fix_si((struct isl_basic_map *)bset,
4862 __isl_give isl_basic_set *isl_basic_set_fix(__isl_take isl_basic_set *bset,
4863 enum isl_dim_type type, unsigned pos, isl_int value)
4865 return (struct isl_basic_set *)
4866 isl_basic_map_fix((struct isl_basic_map *)bset,
4870 struct isl_basic_map *isl_basic_map_fix_input_si(struct isl_basic_map *bmap,
4871 unsigned input, int value)
4873 return isl_basic_map_fix_si(bmap, isl_dim_in, input, value);
4876 struct isl_basic_set *isl_basic_set_fix_dim_si(struct isl_basic_set *bset,
4877 unsigned dim, int value)
4879 return (struct isl_basic_set *)
4880 isl_basic_map_fix_si((struct isl_basic_map *)bset,
4881 isl_dim_set, dim, value);
4884 struct isl_map *isl_map_fix_si(struct isl_map *map,
4885 enum isl_dim_type type, unsigned pos, int value)
4889 map = isl_map_cow(map);
4893 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
4894 for (i = 0; i < map->n; ++i) {
4895 map->p[i] = isl_basic_map_fix_si(map->p[i], type, pos, value);
4899 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4906 __isl_give isl_set *isl_set_fix_si(__isl_take isl_set *set,
4907 enum isl_dim_type type, unsigned pos, int value)
4909 return (struct isl_set *)
4910 isl_map_fix_si((struct isl_map *)set, type, pos, value);
4913 __isl_give isl_map *isl_map_fix(__isl_take isl_map *map,
4914 enum isl_dim_type type, unsigned pos, isl_int value)
4918 map = isl_map_cow(map);
4922 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
4923 for (i = 0; i < map->n; ++i) {
4924 map->p[i] = isl_basic_map_fix(map->p[i], type, pos, value);
4928 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4935 __isl_give isl_set *isl_set_fix(__isl_take isl_set *set,
4936 enum isl_dim_type type, unsigned pos, isl_int value)
4938 return (struct isl_set *)isl_map_fix((isl_map *)set, type, pos, value);
4941 struct isl_map *isl_map_fix_input_si(struct isl_map *map,
4942 unsigned input, int value)
4944 return isl_map_fix_si(map, isl_dim_in, input, value);
4947 struct isl_set *isl_set_fix_dim_si(struct isl_set *set, unsigned dim, int value)
4949 return (struct isl_set *)
4950 isl_map_fix_si((struct isl_map *)set, isl_dim_set, dim, value);
4953 __isl_give isl_basic_map *isl_basic_map_lower_bound_si(
4954 __isl_take isl_basic_map *bmap,
4955 enum isl_dim_type type, unsigned pos, int value)
4961 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
4962 pos += isl_basic_map_offset(bmap, type);
4963 bmap = isl_basic_map_cow(bmap);
4964 bmap = isl_basic_map_extend_constraints(bmap, 0, 1);
4965 j = isl_basic_map_alloc_inequality(bmap);
4968 isl_seq_clr(bmap->ineq[j], 1 + isl_basic_map_total_dim(bmap));
4969 isl_int_set_si(bmap->ineq[j][pos], 1);
4970 isl_int_set_si(bmap->ineq[j][0], -value);
4971 bmap = isl_basic_map_simplify(bmap);
4972 return isl_basic_map_finalize(bmap);
4974 isl_basic_map_free(bmap);
4978 struct isl_basic_set *isl_basic_set_lower_bound_dim(struct isl_basic_set *bset,
4979 unsigned dim, isl_int value)
4983 bset = isl_basic_set_cow(bset);
4984 bset = isl_basic_set_extend_constraints(bset, 0, 1);
4985 j = isl_basic_set_alloc_inequality(bset);
4988 isl_seq_clr(bset->ineq[j], 1 + isl_basic_set_total_dim(bset));
4989 isl_int_set_si(bset->ineq[j][1 + isl_basic_set_n_param(bset) + dim], 1);
4990 isl_int_neg(bset->ineq[j][0], value);
4991 bset = isl_basic_set_simplify(bset);
4992 return isl_basic_set_finalize(bset);
4994 isl_basic_set_free(bset);
4998 __isl_give isl_map *isl_map_lower_bound_si(__isl_take 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 = 0; i < map->n; ++i) {
5009 map->p[i] = isl_basic_map_lower_bound_si(map->p[i],
5014 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
5021 __isl_give isl_set *isl_set_lower_bound_si(__isl_take isl_set *set,
5022 enum isl_dim_type type, unsigned pos, int value)
5024 return (struct isl_set *)
5025 isl_map_lower_bound_si((struct isl_map *)set, type, pos, value);
5028 struct isl_set *isl_set_lower_bound_dim(struct isl_set *set, unsigned dim,
5033 set = isl_set_cow(set);
5037 isl_assert(set->ctx, dim < isl_set_n_dim(set), goto error);
5038 for (i = 0; i < set->n; ++i) {
5039 set->p[i] = isl_basic_set_lower_bound_dim(set->p[i], dim, value);
5049 struct isl_map *isl_map_reverse(struct isl_map *map)
5053 map = isl_map_cow(map);
5057 map->dim = isl_space_reverse(map->dim);
5060 for (i = 0; i < map->n; ++i) {
5061 map->p[i] = isl_basic_map_reverse(map->p[i]);
5065 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
5072 static struct isl_map *isl_basic_map_partial_lexopt(
5073 struct isl_basic_map *bmap, struct isl_basic_set *dom,
5074 struct isl_set **empty, int max)
5078 if (bmap->ctx->opt->pip == ISL_PIP_PIP)
5079 return isl_pip_basic_map_lexopt(bmap, dom, empty, max);
5081 return isl_tab_basic_map_partial_lexopt(bmap, dom, empty, max);
5083 isl_basic_map_free(bmap);
5084 isl_basic_set_free(dom);
5090 struct isl_map *isl_basic_map_partial_lexmax(
5091 struct isl_basic_map *bmap, struct isl_basic_set *dom,
5092 struct isl_set **empty)
5094 return isl_basic_map_partial_lexopt(bmap, dom, empty, 1);
5097 struct isl_map *isl_basic_map_partial_lexmin(
5098 struct isl_basic_map *bmap, struct isl_basic_set *dom,
5099 struct isl_set **empty)
5101 return isl_basic_map_partial_lexopt(bmap, dom, empty, 0);
5104 struct isl_set *isl_basic_set_partial_lexmin(
5105 struct isl_basic_set *bset, struct isl_basic_set *dom,
5106 struct isl_set **empty)
5108 return (struct isl_set *)
5109 isl_basic_map_partial_lexmin((struct isl_basic_map *)bset,
5113 struct isl_set *isl_basic_set_partial_lexmax(
5114 struct isl_basic_set *bset, struct isl_basic_set *dom,
5115 struct isl_set **empty)
5117 return (struct isl_set *)
5118 isl_basic_map_partial_lexmax((struct isl_basic_map *)bset,
5122 /* Given a basic map "bmap", compute the lexicographically minimal
5123 * (or maximal) image element for each domain element in dom.
5124 * Set *empty to those elements in dom that do not have an image element.
5126 * We first make sure the basic sets in dom are disjoint and then
5127 * simply collect the results over each of the basic sets separately.
5128 * We could probably improve the efficiency a bit by moving the union
5129 * domain down into the parametric integer programming.
5131 static __isl_give isl_map *basic_map_partial_lexopt(
5132 __isl_take isl_basic_map *bmap, __isl_take isl_set *dom,
5133 __isl_give isl_set **empty, int max)
5136 struct isl_map *res;
5138 dom = isl_set_make_disjoint(dom);
5142 if (isl_set_plain_is_empty(dom)) {
5143 res = isl_map_empty_like_basic_map(bmap);
5144 *empty = isl_set_empty_like(dom);
5146 isl_basic_map_free(bmap);
5150 res = isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap),
5151 isl_basic_set_copy(dom->p[0]), empty, max);
5153 for (i = 1; i < dom->n; ++i) {
5154 struct isl_map *res_i;
5155 struct isl_set *empty_i;
5157 res_i = isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap),
5158 isl_basic_set_copy(dom->p[i]), &empty_i, max);
5160 res = isl_map_union_disjoint(res, res_i);
5161 *empty = isl_set_union_disjoint(*empty, empty_i);
5165 isl_basic_map_free(bmap);
5170 isl_basic_map_free(bmap);
5174 /* Given a map "map", compute the lexicographically minimal
5175 * (or maximal) image element for each domain element in dom.
5176 * Set *empty to those elements in dom that do not have an image element.
5178 * We first compute the lexicographically minimal or maximal element
5179 * in the first basic map. This results in a partial solution "res"
5180 * and a subset "todo" of dom that still need to be handled.
5181 * We then consider each of the remaining maps in "map" and successively
5182 * improve both "res" and "todo".
5184 * Let res^k and todo^k be the results after k steps and let i = k + 1.
5185 * Assume we are computing the lexicographical maximum.
5186 * We first compute the lexicographically maximal element in basic map i.
5187 * This results in a partial solution res_i and a subset todo_i.
5188 * Then we combine these results with those obtain for the first k basic maps
5189 * to obtain a result that is valid for the first k+1 basic maps.
5190 * In particular, the set where there is no solution is the set where
5191 * there is no solution for the first k basic maps and also no solution
5192 * for the ith basic map, i.e.,
5194 * todo^i = todo^k * todo_i
5196 * On dom(res^k) * dom(res_i), we need to pick the larger of the two
5197 * solutions, arbitrarily breaking ties in favor of res^k.
5198 * That is, when res^k(a) >= res_i(a), we pick res^k and
5199 * when res^k(a) < res_i(a), we pick res_i. (Here, ">=" and "<" denote
5200 * the lexicographic order.)
5201 * In practice, we compute
5203 * res^k * (res_i . "<=")
5207 * res_i * (res^k . "<")
5209 * Finally, we consider the symmetric difference of dom(res^k) and dom(res_i),
5210 * where only one of res^k and res_i provides a solution and we simply pick
5217 * Note that we only compute these intersections when dom(res^k) intersects
5218 * dom(res_i). Otherwise, the only effect of these intersections is to
5219 * potentially break up res^k and res_i into smaller pieces.
5220 * We want to avoid such splintering as much as possible.
5221 * In fact, an earlier implementation of this function would look for
5222 * better results in the domain of res^k and for extra results in todo^k,
5223 * but this would always result in a splintering according to todo^k,
5224 * even when the domain of basic map i is disjoint from the domains of
5225 * the previous basic maps.
5227 static __isl_give isl_map *isl_map_partial_lexopt_aligned(
5228 __isl_take isl_map *map, __isl_take isl_set *dom,
5229 __isl_give isl_set **empty, int max)
5232 struct isl_map *res;
5233 struct isl_set *todo;
5238 if (isl_map_plain_is_empty(map)) {
5246 res = basic_map_partial_lexopt(isl_basic_map_copy(map->p[0]),
5247 isl_set_copy(dom), &todo, max);
5249 for (i = 1; i < map->n; ++i) {
5253 isl_space *dim = isl_space_range(isl_map_get_space(res));
5255 res_i = basic_map_partial_lexopt(isl_basic_map_copy(map->p[i]),
5256 isl_set_copy(dom), &todo_i, max);
5259 lt = isl_map_lex_lt(isl_space_copy(dim));
5260 le = isl_map_lex_le(dim);
5262 lt = isl_map_lex_gt(isl_space_copy(dim));
5263 le = isl_map_lex_ge(dim);
5265 lt = isl_map_apply_range(isl_map_copy(res), lt);
5266 lt = isl_map_intersect(lt, isl_map_copy(res_i));
5267 le = isl_map_apply_range(isl_map_copy(res_i), le);
5268 le = isl_map_intersect(le, isl_map_copy(res));
5270 if (!isl_map_is_empty(lt) || !isl_map_is_empty(le)) {
5271 res = isl_map_intersect_domain(res,
5272 isl_set_copy(todo_i));
5273 res_i = isl_map_intersect_domain(res_i,
5274 isl_set_copy(todo));
5277 res = isl_map_union_disjoint(res, res_i);
5278 res = isl_map_union_disjoint(res, lt);
5279 res = isl_map_union_disjoint(res, le);
5281 todo = isl_set_intersect(todo, todo_i);
5301 /* Given a map "map", compute the lexicographically minimal
5302 * (or maximal) image element for each domain element in dom.
5303 * Set *empty to those elements in dom that do not have an image element.
5305 * Align parameters if needed and then call isl_map_partial_lexopt_aligned.
5307 static __isl_give isl_map *isl_map_partial_lexopt(
5308 __isl_take isl_map *map, __isl_take isl_set *dom,
5309 __isl_give isl_set **empty, int max)
5313 if (isl_space_match(map->dim, isl_dim_param, dom->dim, isl_dim_param))
5314 return isl_map_partial_lexopt_aligned(map, dom, empty, max);
5315 if (!isl_space_has_named_params(map->dim) ||
5316 !isl_space_has_named_params(dom->dim))
5317 isl_die(map->ctx, isl_error_invalid,
5318 "unaligned unnamed parameters", goto error);
5319 map = isl_map_align_params(map, isl_map_get_space(dom));
5320 dom = isl_map_align_params(dom, isl_map_get_space(map));
5321 return isl_map_partial_lexopt_aligned(map, dom, empty, max);
5330 __isl_give isl_map *isl_map_partial_lexmax(
5331 __isl_take isl_map *map, __isl_take isl_set *dom,
5332 __isl_give isl_set **empty)
5334 return isl_map_partial_lexopt(map, dom, empty, 1);
5337 __isl_give isl_map *isl_map_partial_lexmin(
5338 __isl_take isl_map *map, __isl_take isl_set *dom,
5339 __isl_give isl_set **empty)
5341 return isl_map_partial_lexopt(map, dom, empty, 0);
5344 __isl_give isl_set *isl_set_partial_lexmin(
5345 __isl_take isl_set *set, __isl_take isl_set *dom,
5346 __isl_give isl_set **empty)
5348 return (struct isl_set *)
5349 isl_map_partial_lexmin((struct isl_map *)set,
5353 __isl_give isl_set *isl_set_partial_lexmax(
5354 __isl_take isl_set *set, __isl_take isl_set *dom,
5355 __isl_give isl_set **empty)
5357 return (struct isl_set *)
5358 isl_map_partial_lexmax((struct isl_map *)set,
5362 __isl_give isl_map *isl_basic_map_lexopt(__isl_take isl_basic_map *bmap, int max)
5364 struct isl_basic_set *dom = NULL;
5369 dom_dim = isl_space_domain(isl_space_copy(bmap->dim));
5370 dom = isl_basic_set_universe(dom_dim);
5371 return isl_basic_map_partial_lexopt(bmap, dom, NULL, max);
5373 isl_basic_map_free(bmap);
5377 __isl_give isl_map *isl_basic_map_lexmin(__isl_take isl_basic_map *bmap)
5379 return isl_basic_map_lexopt(bmap, 0);
5382 __isl_give isl_map *isl_basic_map_lexmax(__isl_take isl_basic_map *bmap)
5384 return isl_basic_map_lexopt(bmap, 1);
5387 __isl_give isl_set *isl_basic_set_lexmin(__isl_take isl_basic_set *bset)
5389 return (isl_set *)isl_basic_map_lexmin((isl_basic_map *)bset);
5392 __isl_give isl_set *isl_basic_set_lexmax(__isl_take isl_basic_set *bset)
5394 return (isl_set *)isl_basic_map_lexmax((isl_basic_map *)bset);
5397 __isl_give isl_map *isl_map_lexopt(__isl_take isl_map *map, int max)
5399 struct isl_set *dom = NULL;
5404 dom_dim = isl_space_domain(isl_space_copy(map->dim));
5405 dom = isl_set_universe(dom_dim);
5406 return isl_map_partial_lexopt(map, dom, NULL, max);
5412 __isl_give isl_map *isl_map_lexmin(__isl_take isl_map *map)
5414 return isl_map_lexopt(map, 0);
5417 __isl_give isl_map *isl_map_lexmax(__isl_take isl_map *map)
5419 return isl_map_lexopt(map, 1);
5422 __isl_give isl_set *isl_set_lexmin(__isl_take isl_set *set)
5424 return (isl_set *)isl_map_lexmin((isl_map *)set);
5427 __isl_give isl_set *isl_set_lexmax(__isl_take isl_set *set)
5429 return (isl_set *)isl_map_lexmax((isl_map *)set);
5432 /* Construct a map that equates the two given dimensions in the given space.
5434 static __isl_give isl_map *equate(__isl_take isl_space *dim,
5435 enum isl_dim_type src_type, int src_pos,
5436 enum isl_dim_type dst_type, int dst_pos)
5438 isl_basic_map *bmap;
5441 bmap = isl_basic_map_alloc_space(dim, 0, 1, 0);
5442 k = isl_basic_map_alloc_equality(bmap);
5445 isl_seq_clr(bmap->eq[k], 1 + isl_basic_map_total_dim(bmap));
5446 src_pos += isl_basic_map_offset(bmap, src_type);
5447 dst_pos += isl_basic_map_offset(bmap, dst_type);
5448 isl_int_set_si(bmap->eq[k][src_pos], 1);
5449 isl_int_set_si(bmap->eq[k][dst_pos], -1);
5451 return isl_map_from_basic_map(bmap);
5453 isl_basic_map_free(bmap);
5457 /* Extract the first and only affine expression from list
5458 * and then add it to *pwaff with the given dom.
5459 * This domain is known to be disjoint from other domains
5460 * because of the way isl_basic_set_foreach_lexmax works.
5462 static int update_dim_opt(__isl_take isl_basic_set *dom,
5463 __isl_take isl_aff_list *list, void *user)
5465 isl_ctx *ctx = isl_basic_set_get_ctx(dom);
5467 isl_pw_aff **pwaff = user;
5468 isl_pw_aff *pwaff_i;
5470 if (isl_aff_list_n_aff(list) != 1)
5471 isl_die(ctx, isl_error_internal,
5472 "expecting single element list", goto error);
5474 aff = isl_aff_list_get_aff(list, 0);
5475 pwaff_i = isl_pw_aff_alloc(isl_set_from_basic_set(dom), aff);
5477 *pwaff = isl_pw_aff_add_disjoint(*pwaff, pwaff_i);
5479 isl_aff_list_free(list);
5483 isl_basic_set_free(dom);
5484 isl_aff_list_free(list);
5488 /* Given a one-dimensional basic set, compute the minimum or maximum of that
5489 * dimension as an isl_pw_aff.
5491 * The isl_pw_aff is constructed by having isl_basic_set_foreach_lexopt
5492 * call update_dim_opt on each leaf of the result.
5494 static __isl_give isl_pw_aff *basic_set_dim_opt(__isl_keep isl_basic_set *bset,
5497 isl_space *dim = isl_basic_set_get_space(bset);
5501 dim = isl_space_params(dim);
5502 dim = isl_space_add_dims(dim, isl_dim_set, 1);
5503 pwaff = isl_pw_aff_empty(dim);
5505 r = isl_basic_set_foreach_lexopt(bset, max, &update_dim_opt, &pwaff);
5507 return isl_pw_aff_free(pwaff);
5512 /* Compute the minimum or maximum of the given set dimension
5513 * as a function of the parameters, but independently of
5514 * the other set dimensions.
5516 * We first project the set onto the given dimension and then compute
5517 * the "lexicographic" maximum in each basic set, combining the results
5518 * using isl_pw_aff_union_max.
5520 static __isl_give isl_pw_aff *set_dim_opt(__isl_take isl_set *set, int pos,
5527 map = isl_map_from_domain(set);
5528 map = isl_map_add_dims(map, isl_dim_out, 1);
5529 map = isl_map_intersect(map,
5530 equate(isl_map_get_space(map), isl_dim_in, pos,
5532 set = isl_map_range(map);
5537 isl_space *dim = isl_set_get_space(set);
5538 dim = isl_space_domain(isl_space_from_range(dim));
5540 return isl_pw_aff_empty(dim);
5543 pwaff = basic_set_dim_opt(set->p[0], max);
5544 for (i = 1; i < set->n; ++i) {
5545 isl_pw_aff *pwaff_i;
5547 pwaff_i = basic_set_dim_opt(set->p[i], max);
5548 pwaff = isl_pw_aff_union_opt(pwaff, pwaff_i, max);
5556 /* Compute the maximum of the given set dimension as a function of the
5557 * parameters, but independently of the other set dimensions.
5559 __isl_give isl_pw_aff *isl_set_dim_max(__isl_take isl_set *set, int pos)
5561 return set_dim_opt(set, pos, 1);
5564 /* Compute the minimum of the given set dimension as a function of the
5565 * parameters, but independently of the other set dimensions.
5567 __isl_give isl_pw_aff *isl_set_dim_min(__isl_take isl_set *set, int pos)
5569 return set_dim_opt(set, pos, 0);
5572 /* Apply a preimage specified by "mat" on the parameters of "bset".
5573 * bset is assumed to have only parameters and divs.
5575 static struct isl_basic_set *basic_set_parameter_preimage(
5576 struct isl_basic_set *bset, struct isl_mat *mat)
5583 bset->dim = isl_space_cow(bset->dim);
5587 nparam = isl_basic_set_dim(bset, isl_dim_param);
5589 isl_assert(bset->ctx, mat->n_row == 1 + nparam, goto error);
5591 bset->dim->nparam = 0;
5592 bset->dim->n_out = nparam;
5593 bset = isl_basic_set_preimage(bset, mat);
5595 bset->dim->nparam = bset->dim->n_out;
5596 bset->dim->n_out = 0;
5601 isl_basic_set_free(bset);
5605 /* Apply a preimage specified by "mat" on the parameters of "set".
5606 * set is assumed to have only parameters and divs.
5608 static struct isl_set *set_parameter_preimage(
5609 struct isl_set *set, struct isl_mat *mat)
5611 isl_space *dim = NULL;
5617 dim = isl_space_copy(set->dim);
5618 dim = isl_space_cow(dim);
5622 nparam = isl_set_dim(set, isl_dim_param);
5624 isl_assert(set->ctx, mat->n_row == 1 + nparam, goto error);
5627 dim->n_out = nparam;
5628 isl_set_reset_space(set, dim);
5629 set = isl_set_preimage(set, mat);
5632 dim = isl_space_copy(set->dim);
5633 dim = isl_space_cow(dim);
5636 dim->nparam = dim->n_out;
5638 isl_set_reset_space(set, dim);
5641 isl_space_free(dim);
5648 /* Intersect the basic set "bset" with the affine space specified by the
5649 * equalities in "eq".
5651 static struct isl_basic_set *basic_set_append_equalities(
5652 struct isl_basic_set *bset, struct isl_mat *eq)
5660 bset = isl_basic_set_extend_space(bset, isl_space_copy(bset->dim), 0,
5665 len = 1 + isl_space_dim(bset->dim, isl_dim_all) + bset->extra;
5666 for (i = 0; i < eq->n_row; ++i) {
5667 k = isl_basic_set_alloc_equality(bset);
5670 isl_seq_cpy(bset->eq[k], eq->row[i], eq->n_col);
5671 isl_seq_clr(bset->eq[k] + eq->n_col, len - eq->n_col);
5675 bset = isl_basic_set_gauss(bset, NULL);
5676 bset = isl_basic_set_finalize(bset);
5681 isl_basic_set_free(bset);
5685 /* Intersect the set "set" with the affine space specified by the
5686 * equalities in "eq".
5688 static struct isl_set *set_append_equalities(struct isl_set *set,
5696 for (i = 0; i < set->n; ++i) {
5697 set->p[i] = basic_set_append_equalities(set->p[i],
5710 /* Project the given basic set onto its parameter domain, possibly introducing
5711 * new, explicit, existential variables in the constraints.
5712 * The input has parameters and (possibly implicit) existential variables.
5713 * The output has the same parameters, but only
5714 * explicit existentially quantified variables.
5716 * The actual projection is performed by pip, but pip doesn't seem
5717 * to like equalities very much, so we first remove the equalities
5718 * among the parameters by performing a variable compression on
5719 * the parameters. Afterward, an inverse transformation is performed
5720 * and the equalities among the parameters are inserted back in.
5722 static struct isl_set *parameter_compute_divs(struct isl_basic_set *bset)
5726 struct isl_mat *T, *T2;
5727 struct isl_set *set;
5728 unsigned nparam, n_div;
5730 bset = isl_basic_set_cow(bset);
5734 if (bset->n_eq == 0)
5735 return isl_basic_set_lexmin(bset);
5737 isl_basic_set_gauss(bset, NULL);
5739 nparam = isl_basic_set_dim(bset, isl_dim_param);
5740 n_div = isl_basic_set_dim(bset, isl_dim_div);
5742 for (i = 0, j = n_div - 1; i < bset->n_eq && j >= 0; --j) {
5743 if (!isl_int_is_zero(bset->eq[i][1 + nparam + j]))
5746 if (i == bset->n_eq)
5747 return isl_basic_set_lexmin(bset);
5749 eq = isl_mat_sub_alloc6(bset->ctx, bset->eq, i, bset->n_eq - i,
5751 eq = isl_mat_cow(eq);
5752 T = isl_mat_variable_compression(isl_mat_copy(eq), &T2);
5753 if (T && T->n_col == 0) {
5757 bset = isl_basic_set_set_to_empty(bset);
5758 return isl_set_from_basic_set(bset);
5760 bset = basic_set_parameter_preimage(bset, T);
5762 set = isl_basic_set_lexmin(bset);
5763 set = set_parameter_preimage(set, T2);
5764 set = set_append_equalities(set, eq);
5768 /* Compute an explicit representation for all the existentially
5769 * quantified variables.
5770 * The input and output dimensions are first turned into parameters.
5771 * compute_divs then returns a map with the same parameters and
5772 * no input or output dimensions and the dimension specification
5773 * is reset to that of the input.
5775 static struct isl_map *compute_divs(struct isl_basic_map *bmap)
5777 struct isl_basic_set *bset;
5778 struct isl_set *set;
5779 struct isl_map *map;
5780 isl_space *dim, *orig_dim = NULL;
5785 bmap = isl_basic_map_cow(bmap);
5789 nparam = isl_basic_map_dim(bmap, isl_dim_param);
5790 n_in = isl_basic_map_dim(bmap, isl_dim_in);
5791 n_out = isl_basic_map_dim(bmap, isl_dim_out);
5792 dim = isl_space_set_alloc(bmap->ctx, nparam + n_in + n_out, 0);
5796 orig_dim = bmap->dim;
5798 bset = (struct isl_basic_set *)bmap;
5800 set = parameter_compute_divs(bset);
5801 map = (struct isl_map *)set;
5802 map = isl_map_reset_space(map, orig_dim);
5806 isl_basic_map_free(bmap);
5810 int isl_basic_map_divs_known(__isl_keep isl_basic_map *bmap)
5818 off = isl_space_dim(bmap->dim, isl_dim_all);
5819 for (i = 0; i < bmap->n_div; ++i) {
5820 if (isl_int_is_zero(bmap->div[i][0]))
5822 isl_assert(bmap->ctx, isl_int_is_zero(bmap->div[i][1+1+off+i]),
5828 static int map_divs_known(__isl_keep isl_map *map)
5835 for (i = 0; i < map->n; ++i) {
5836 int known = isl_basic_map_divs_known(map->p[i]);
5844 /* If bmap contains any unknown divs, then compute explicit
5845 * expressions for them. However, this computation may be
5846 * quite expensive, so first try to remove divs that aren't
5849 struct isl_map *isl_basic_map_compute_divs(struct isl_basic_map *bmap)
5852 struct isl_map *map;
5854 known = isl_basic_map_divs_known(bmap);
5858 return isl_map_from_basic_map(bmap);
5860 bmap = isl_basic_map_drop_redundant_divs(bmap);
5862 known = isl_basic_map_divs_known(bmap);
5866 return isl_map_from_basic_map(bmap);
5868 map = compute_divs(bmap);
5871 isl_basic_map_free(bmap);
5875 struct isl_map *isl_map_compute_divs(struct isl_map *map)
5879 struct isl_map *res;
5886 known = map_divs_known(map);
5894 res = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[0]));
5895 for (i = 1 ; i < map->n; ++i) {
5897 r2 = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[i]));
5898 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT))
5899 res = isl_map_union_disjoint(res, r2);
5901 res = isl_map_union(res, r2);
5908 struct isl_set *isl_basic_set_compute_divs(struct isl_basic_set *bset)
5910 return (struct isl_set *)
5911 isl_basic_map_compute_divs((struct isl_basic_map *)bset);
5914 struct isl_set *isl_set_compute_divs(struct isl_set *set)
5916 return (struct isl_set *)
5917 isl_map_compute_divs((struct isl_map *)set);
5920 struct isl_set *isl_map_domain(struct isl_map *map)
5923 struct isl_set *set;
5928 map = isl_map_cow(map);
5932 set = (struct isl_set *)map;
5933 set->dim = isl_space_domain(set->dim);
5936 for (i = 0; i < map->n; ++i) {
5937 set->p[i] = isl_basic_map_domain(map->p[i]);
5941 ISL_F_CLR(set, ISL_MAP_DISJOINT);
5942 ISL_F_CLR(set, ISL_SET_NORMALIZED);
5949 static __isl_give isl_map *map_union_disjoint(__isl_take isl_map *map1,
5950 __isl_take isl_map *map2)
5954 struct isl_map *map = NULL;
5968 isl_assert(map1->ctx, isl_space_is_equal(map1->dim, map2->dim), goto error);
5970 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
5971 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
5972 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
5974 map = isl_map_alloc_space(isl_space_copy(map1->dim),
5975 map1->n + map2->n, flags);
5978 for (i = 0; i < map1->n; ++i) {
5979 map = isl_map_add_basic_map(map,
5980 isl_basic_map_copy(map1->p[i]));
5984 for (i = 0; i < map2->n; ++i) {
5985 map = isl_map_add_basic_map(map,
5986 isl_basic_map_copy(map2->p[i]));
6000 __isl_give isl_map *isl_map_union_disjoint(__isl_take isl_map *map1,
6001 __isl_take isl_map *map2)
6003 return isl_map_align_params_map_map_and(map1, map2, &map_union_disjoint);
6006 struct isl_map *isl_map_union(struct isl_map *map1, struct isl_map *map2)
6008 map1 = isl_map_union_disjoint(map1, map2);
6012 ISL_F_CLR(map1, ISL_MAP_DISJOINT);
6016 struct isl_set *isl_set_union_disjoint(
6017 struct isl_set *set1, struct isl_set *set2)
6019 return (struct isl_set *)
6020 isl_map_union_disjoint(
6021 (struct isl_map *)set1, (struct isl_map *)set2);
6024 struct isl_set *isl_set_union(struct isl_set *set1, struct isl_set *set2)
6026 return (struct isl_set *)
6027 isl_map_union((struct isl_map *)set1, (struct isl_map *)set2);
6030 static __isl_give isl_map *map_intersect_range(__isl_take isl_map *map,
6031 __isl_take isl_set *set)
6034 struct isl_map *result;
6040 if (!isl_space_match(map->dim, isl_dim_param, set->dim, isl_dim_param))
6041 isl_die(set->ctx, isl_error_invalid,
6042 "parameters don't match", goto error);
6044 if (isl_space_dim(set->dim, isl_dim_set) != 0 &&
6045 !isl_map_compatible_range(map, set))
6046 isl_die(set->ctx, isl_error_invalid,
6047 "incompatible spaces", goto error);
6049 if (isl_set_plain_is_universe(set)) {
6054 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT) &&
6055 ISL_F_ISSET(set, ISL_MAP_DISJOINT))
6056 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
6058 result = isl_map_alloc_space(isl_space_copy(map->dim),
6059 map->n * set->n, flags);
6062 for (i = 0; i < map->n; ++i)
6063 for (j = 0; j < set->n; ++j) {
6064 result = isl_map_add_basic_map(result,
6065 isl_basic_map_intersect_range(
6066 isl_basic_map_copy(map->p[i]),
6067 isl_basic_set_copy(set->p[j])));
6080 __isl_give isl_map *isl_map_intersect_range(__isl_take isl_map *map,
6081 __isl_take isl_set *set)
6083 return isl_map_align_params_map_map_and(map, set, &map_intersect_range);
6086 struct isl_map *isl_map_intersect_domain(
6087 struct isl_map *map, struct isl_set *set)
6089 return isl_map_reverse(
6090 isl_map_intersect_range(isl_map_reverse(map), set));
6093 static __isl_give isl_map *map_apply_domain(__isl_take isl_map *map1,
6094 __isl_take isl_map *map2)
6098 map1 = isl_map_reverse(map1);
6099 map1 = isl_map_apply_range(map1, map2);
6100 return isl_map_reverse(map1);
6107 __isl_give isl_map *isl_map_apply_domain(__isl_take isl_map *map1,
6108 __isl_take isl_map *map2)
6110 return isl_map_align_params_map_map_and(map1, map2, &map_apply_domain);
6113 static __isl_give isl_map *map_apply_range(__isl_take isl_map *map1,
6114 __isl_take isl_map *map2)
6116 isl_space *dim_result;
6117 struct isl_map *result;
6123 dim_result = isl_space_join(isl_space_copy(map1->dim),
6124 isl_space_copy(map2->dim));
6126 result = isl_map_alloc_space(dim_result, map1->n * map2->n, 0);
6129 for (i = 0; i < map1->n; ++i)
6130 for (j = 0; j < map2->n; ++j) {
6131 result = isl_map_add_basic_map(result,
6132 isl_basic_map_apply_range(
6133 isl_basic_map_copy(map1->p[i]),
6134 isl_basic_map_copy(map2->p[j])));
6140 if (result && result->n <= 1)
6141 ISL_F_SET(result, ISL_MAP_DISJOINT);
6149 __isl_give isl_map *isl_map_apply_range(__isl_take isl_map *map1,
6150 __isl_take isl_map *map2)
6152 return isl_map_align_params_map_map_and(map1, map2, &map_apply_range);
6156 * returns range - domain
6158 struct isl_basic_set *isl_basic_map_deltas(struct isl_basic_map *bmap)
6160 isl_space *dims, *target_dim;
6161 struct isl_basic_set *bset;
6168 isl_assert(bmap->ctx, isl_space_tuple_match(bmap->dim, isl_dim_in,
6169 bmap->dim, isl_dim_out),
6171 target_dim = isl_space_domain(isl_basic_map_get_space(bmap));
6172 dim = isl_basic_map_n_in(bmap);
6173 nparam = isl_basic_map_n_param(bmap);
6174 bset = isl_basic_set_from_basic_map(bmap);
6175 bset = isl_basic_set_cow(bset);
6176 dims = isl_basic_set_get_space(bset);
6177 dims = isl_space_add_dims(dims, isl_dim_set, dim);
6178 bset = isl_basic_set_extend_space(bset, dims, 0, dim, 0);
6179 bset = isl_basic_set_swap_vars(bset, 2*dim);
6180 for (i = 0; i < dim; ++i) {
6181 int j = isl_basic_map_alloc_equality(
6182 (struct isl_basic_map *)bset);
6185 isl_seq_clr(bset->eq[j], 1 + isl_basic_set_total_dim(bset));
6186 isl_int_set_si(bset->eq[j][1+nparam+i], 1);
6187 isl_int_set_si(bset->eq[j][1+nparam+dim+i], 1);
6188 isl_int_set_si(bset->eq[j][1+nparam+2*dim+i], -1);
6190 bset = isl_basic_set_project_out(bset, isl_dim_set, dim, 2*dim);
6191 bset = isl_basic_set_reset_space(bset, target_dim);
6194 isl_basic_map_free(bmap);
6199 * returns range - domain
6201 struct isl_set *isl_map_deltas(struct isl_map *map)
6205 struct isl_set *result;
6210 isl_assert(map->ctx, isl_space_tuple_match(map->dim, isl_dim_in,
6211 map->dim, isl_dim_out),
6213 dim = isl_map_get_space(map);
6214 dim = isl_space_domain(dim);
6215 result = isl_set_alloc_space(dim, map->n, 0);
6218 for (i = 0; i < map->n; ++i)
6219 result = isl_set_add_basic_set(result,
6220 isl_basic_map_deltas(isl_basic_map_copy(map->p[i])));
6229 * returns [domain -> range] -> range - domain
6231 __isl_give isl_basic_map *isl_basic_map_deltas_map(
6232 __isl_take isl_basic_map *bmap)
6236 isl_basic_map *domain;
6240 if (!isl_space_tuple_match(bmap->dim, isl_dim_in, bmap->dim, isl_dim_out))
6241 isl_die(bmap->ctx, isl_error_invalid,
6242 "domain and range don't match", goto error);
6244 nparam = isl_basic_map_dim(bmap, isl_dim_param);
6245 n = isl_basic_map_dim(bmap, isl_dim_in);
6247 dim = isl_space_from_range(isl_space_domain(isl_basic_map_get_space(bmap)));
6248 domain = isl_basic_map_universe(dim);
6250 bmap = isl_basic_map_from_domain(isl_basic_map_wrap(bmap));
6251 bmap = isl_basic_map_apply_range(bmap, domain);
6252 bmap = isl_basic_map_extend_constraints(bmap, n, 0);
6254 total = isl_basic_map_total_dim(bmap);
6256 for (i = 0; i < n; ++i) {
6257 k = isl_basic_map_alloc_equality(bmap);
6260 isl_seq_clr(bmap->eq[k], 1 + total);
6261 isl_int_set_si(bmap->eq[k][1 + nparam + i], 1);
6262 isl_int_set_si(bmap->eq[k][1 + nparam + n + i], -1);
6263 isl_int_set_si(bmap->eq[k][1 + nparam + n + n + i], 1);
6266 bmap = isl_basic_map_gauss(bmap, NULL);
6267 return isl_basic_map_finalize(bmap);
6269 isl_basic_map_free(bmap);
6274 * returns [domain -> range] -> range - domain
6276 __isl_give isl_map *isl_map_deltas_map(__isl_take isl_map *map)
6279 isl_space *domain_dim;
6284 if (!isl_space_tuple_match(map->dim, isl_dim_in, map->dim, isl_dim_out))
6285 isl_die(map->ctx, isl_error_invalid,
6286 "domain and range don't match", goto error);
6288 map = isl_map_cow(map);
6292 domain_dim = isl_space_from_range(isl_space_domain(isl_map_get_space(map)));
6293 map->dim = isl_space_from_domain(isl_space_wrap(map->dim));
6294 map->dim = isl_space_join(map->dim, domain_dim);
6297 for (i = 0; i < map->n; ++i) {
6298 map->p[i] = isl_basic_map_deltas_map(map->p[i]);
6302 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
6309 __isl_give struct isl_basic_map *basic_map_identity(__isl_take isl_space *dims)
6311 struct isl_basic_map *bmap;
6319 nparam = dims->nparam;
6321 bmap = isl_basic_map_alloc_space(dims, 0, dim, 0);
6325 for (i = 0; i < dim; ++i) {
6326 int j = isl_basic_map_alloc_equality(bmap);
6329 isl_seq_clr(bmap->eq[j], 1 + isl_basic_map_total_dim(bmap));
6330 isl_int_set_si(bmap->eq[j][1+nparam+i], 1);
6331 isl_int_set_si(bmap->eq[j][1+nparam+dim+i], -1);
6333 return isl_basic_map_finalize(bmap);
6335 isl_basic_map_free(bmap);
6339 __isl_give isl_basic_map *isl_basic_map_identity(__isl_take isl_space *dim)
6343 if (dim->n_in != dim->n_out)
6344 isl_die(dim->ctx, isl_error_invalid,
6345 "number of input and output dimensions needs to be "
6346 "the same", goto error);
6347 return basic_map_identity(dim);
6349 isl_space_free(dim);
6353 struct isl_basic_map *isl_basic_map_identity_like(struct isl_basic_map *model)
6355 if (!model || !model->dim)
6357 return isl_basic_map_identity(isl_space_copy(model->dim));
6360 __isl_give isl_map *isl_map_identity(__isl_take isl_space *dim)
6362 return isl_map_from_basic_map(isl_basic_map_identity(dim));
6365 struct isl_map *isl_map_identity_like(struct isl_map *model)
6367 if (!model || !model->dim)
6369 return isl_map_identity(isl_space_copy(model->dim));
6372 struct isl_map *isl_map_identity_like_basic_map(struct isl_basic_map *model)
6374 if (!model || !model->dim)
6376 return isl_map_identity(isl_space_copy(model->dim));
6379 __isl_give isl_map *isl_set_identity(__isl_take isl_set *set)
6381 isl_space *dim = isl_set_get_space(set);
6383 id = isl_map_identity(isl_space_map_from_set(dim));
6384 return isl_map_intersect_range(id, set);
6387 /* Construct a basic set with all set dimensions having only non-negative
6390 __isl_give isl_basic_set *isl_basic_set_positive_orthant(
6391 __isl_take isl_space *space)
6396 struct isl_basic_set *bset;
6400 nparam = space->nparam;
6402 bset = isl_basic_set_alloc_space(space, 0, 0, dim);
6405 for (i = 0; i < dim; ++i) {
6406 int k = isl_basic_set_alloc_inequality(bset);
6409 isl_seq_clr(bset->ineq[k], 1 + isl_basic_set_total_dim(bset));
6410 isl_int_set_si(bset->ineq[k][1 + nparam + i], 1);
6414 isl_basic_set_free(bset);
6418 /* Construct the half-space x_pos >= 0.
6420 static __isl_give isl_basic_set *nonneg_halfspace(__isl_take isl_space *dim,
6424 isl_basic_set *nonneg;
6426 nonneg = isl_basic_set_alloc_space(dim, 0, 0, 1);
6427 k = isl_basic_set_alloc_inequality(nonneg);
6430 isl_seq_clr(nonneg->ineq[k], 1 + isl_basic_set_total_dim(nonneg));
6431 isl_int_set_si(nonneg->ineq[k][pos], 1);
6433 return isl_basic_set_finalize(nonneg);
6435 isl_basic_set_free(nonneg);
6439 /* Construct the half-space x_pos <= -1.
6441 static __isl_give isl_basic_set *neg_halfspace(__isl_take isl_space *dim, int pos)
6446 neg = isl_basic_set_alloc_space(dim, 0, 0, 1);
6447 k = isl_basic_set_alloc_inequality(neg);
6450 isl_seq_clr(neg->ineq[k], 1 + isl_basic_set_total_dim(neg));
6451 isl_int_set_si(neg->ineq[k][0], -1);
6452 isl_int_set_si(neg->ineq[k][pos], -1);
6454 return isl_basic_set_finalize(neg);
6456 isl_basic_set_free(neg);
6460 __isl_give isl_set *isl_set_split_dims(__isl_take isl_set *set,
6461 enum isl_dim_type type, unsigned first, unsigned n)
6464 isl_basic_set *nonneg;
6472 isl_assert(set->ctx, first + n <= isl_set_dim(set, type), goto error);
6474 for (i = 0; i < n; ++i) {
6475 nonneg = nonneg_halfspace(isl_set_get_space(set),
6476 pos(set->dim, type) + first + i);
6477 neg = neg_halfspace(isl_set_get_space(set),
6478 pos(set->dim, type) + first + i);
6480 set = isl_set_intersect(set, isl_basic_set_union(nonneg, neg));
6489 static int foreach_orthant(__isl_take isl_set *set, int *signs, int first,
6490 int len, int (*fn)(__isl_take isl_set *orthant, int *signs, void *user),
6497 if (isl_set_plain_is_empty(set)) {
6502 return fn(set, signs, user);
6505 half = isl_set_from_basic_set(nonneg_halfspace(isl_set_get_space(set),
6507 half = isl_set_intersect(half, isl_set_copy(set));
6508 if (foreach_orthant(half, signs, first + 1, len, fn, user) < 0)
6512 half = isl_set_from_basic_set(neg_halfspace(isl_set_get_space(set),
6514 half = isl_set_intersect(half, set);
6515 return foreach_orthant(half, signs, first + 1, len, fn, user);
6521 /* Call "fn" on the intersections of "set" with each of the orthants
6522 * (except for obviously empty intersections). The orthant is identified
6523 * by the signs array, with each entry having value 1 or -1 according
6524 * to the sign of the corresponding variable.
6526 int isl_set_foreach_orthant(__isl_keep isl_set *set,
6527 int (*fn)(__isl_take isl_set *orthant, int *signs, void *user),
6537 if (isl_set_plain_is_empty(set))
6540 nparam = isl_set_dim(set, isl_dim_param);
6541 nvar = isl_set_dim(set, isl_dim_set);
6543 signs = isl_alloc_array(set->ctx, int, nparam + nvar);
6545 r = foreach_orthant(isl_set_copy(set), signs, 0, nparam + nvar,
6553 int isl_set_is_equal(struct isl_set *set1, struct isl_set *set2)
6555 return isl_map_is_equal((struct isl_map *)set1, (struct isl_map *)set2);
6558 int isl_basic_map_is_subset(
6559 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
6562 struct isl_map *map1;
6563 struct isl_map *map2;
6565 if (!bmap1 || !bmap2)
6568 map1 = isl_map_from_basic_map(isl_basic_map_copy(bmap1));
6569 map2 = isl_map_from_basic_map(isl_basic_map_copy(bmap2));
6571 is_subset = isl_map_is_subset(map1, map2);
6579 int isl_basic_map_is_equal(
6580 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
6584 if (!bmap1 || !bmap2)
6586 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
6589 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
6593 int isl_basic_set_is_equal(
6594 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
6596 return isl_basic_map_is_equal(
6597 (struct isl_basic_map *)bset1, (struct isl_basic_map *)bset2);
6600 int isl_map_is_empty(struct isl_map *map)
6607 for (i = 0; i < map->n; ++i) {
6608 is_empty = isl_basic_map_is_empty(map->p[i]);
6617 int isl_map_plain_is_empty(__isl_keep isl_map *map)
6619 return map ? map->n == 0 : -1;
6622 int isl_map_fast_is_empty(__isl_keep isl_map *map)
6624 return isl_map_plain_is_empty(map);
6627 int isl_set_plain_is_empty(struct isl_set *set)
6629 return set ? set->n == 0 : -1;
6632 int isl_set_fast_is_empty(__isl_keep isl_set *set)
6634 return isl_set_plain_is_empty(set);
6637 int isl_set_is_empty(struct isl_set *set)
6639 return isl_map_is_empty((struct isl_map *)set);
6642 int isl_map_has_equal_space(__isl_keep isl_map *map1, __isl_keep isl_map *map2)
6647 return isl_space_is_equal(map1->dim, map2->dim);
6650 int isl_set_has_equal_space(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
6655 return isl_space_is_equal(set1->dim, set2->dim);
6658 static int map_is_equal(__isl_keep isl_map *map1, __isl_keep isl_map *map2)
6664 is_subset = isl_map_is_subset(map1, map2);
6667 is_subset = isl_map_is_subset(map2, map1);
6671 int isl_map_is_equal(__isl_keep isl_map *map1, __isl_keep isl_map *map2)
6673 return align_params_map_map_and_test(map1, map2, &map_is_equal);
6676 int isl_basic_map_is_strict_subset(
6677 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
6681 if (!bmap1 || !bmap2)
6683 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
6686 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
6687 if (is_subset == -1)
6692 int isl_map_is_strict_subset(struct isl_map *map1, struct isl_map *map2)
6698 is_subset = isl_map_is_subset(map1, map2);
6701 is_subset = isl_map_is_subset(map2, map1);
6702 if (is_subset == -1)
6707 int isl_set_is_strict_subset(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
6709 return isl_map_is_strict_subset((isl_map *)set1, (isl_map *)set2);
6712 int isl_basic_map_is_universe(struct isl_basic_map *bmap)
6716 return bmap->n_eq == 0 && bmap->n_ineq == 0;
6719 int isl_basic_set_is_universe(struct isl_basic_set *bset)
6723 return bset->n_eq == 0 && bset->n_ineq == 0;
6726 int isl_map_plain_is_universe(__isl_keep isl_map *map)
6733 for (i = 0; i < map->n; ++i) {
6734 int r = isl_basic_map_is_universe(map->p[i]);
6742 int isl_set_plain_is_universe(__isl_keep isl_set *set)
6744 return isl_map_plain_is_universe((isl_map *) set);
6747 int isl_set_fast_is_universe(__isl_keep isl_set *set)
6749 return isl_set_plain_is_universe(set);
6752 int isl_basic_map_is_empty(struct isl_basic_map *bmap)
6754 struct isl_basic_set *bset = NULL;
6755 struct isl_vec *sample = NULL;
6762 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY))
6765 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL)) {
6766 struct isl_basic_map *copy = isl_basic_map_copy(bmap);
6767 copy = isl_basic_map_remove_redundancies(copy);
6768 empty = ISL_F_ISSET(copy, ISL_BASIC_MAP_EMPTY);
6769 isl_basic_map_free(copy);
6773 total = 1 + isl_basic_map_total_dim(bmap);
6774 if (bmap->sample && bmap->sample->size == total) {
6775 int contains = isl_basic_map_contains(bmap, bmap->sample);
6781 isl_vec_free(bmap->sample);
6782 bmap->sample = NULL;
6783 bset = isl_basic_map_underlying_set(isl_basic_map_copy(bmap));
6786 sample = isl_basic_set_sample_vec(bset);
6789 empty = sample->size == 0;
6790 isl_vec_free(bmap->sample);
6791 bmap->sample = sample;
6793 ISL_F_SET(bmap, ISL_BASIC_MAP_EMPTY);
6798 int isl_basic_map_plain_is_empty(__isl_keep isl_basic_map *bmap)
6802 return ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY);
6805 int isl_basic_map_fast_is_empty(__isl_keep isl_basic_map *bmap)
6807 return isl_basic_map_plain_is_empty(bmap);
6810 int isl_basic_set_plain_is_empty(__isl_keep isl_basic_set *bset)
6814 return ISL_F_ISSET(bset, ISL_BASIC_SET_EMPTY);
6817 int isl_basic_set_fast_is_empty(__isl_keep isl_basic_set *bset)
6819 return isl_basic_set_plain_is_empty(bset);
6822 int isl_basic_set_is_empty(struct isl_basic_set *bset)
6824 return isl_basic_map_is_empty((struct isl_basic_map *)bset);
6827 struct isl_map *isl_basic_map_union(
6828 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
6830 struct isl_map *map;
6831 if (!bmap1 || !bmap2)
6834 isl_assert(bmap1->ctx, isl_space_is_equal(bmap1->dim, bmap2->dim), goto error);
6836 map = isl_map_alloc_space(isl_space_copy(bmap1->dim), 2, 0);
6839 map = isl_map_add_basic_map(map, bmap1);
6840 map = isl_map_add_basic_map(map, bmap2);
6843 isl_basic_map_free(bmap1);
6844 isl_basic_map_free(bmap2);
6848 struct isl_set *isl_basic_set_union(
6849 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
6851 return (struct isl_set *)isl_basic_map_union(
6852 (struct isl_basic_map *)bset1,
6853 (struct isl_basic_map *)bset2);
6856 /* Order divs such that any div only depends on previous divs */
6857 struct isl_basic_map *isl_basic_map_order_divs(struct isl_basic_map *bmap)
6865 off = isl_space_dim(bmap->dim, isl_dim_all);
6867 for (i = 0; i < bmap->n_div; ++i) {
6869 if (isl_int_is_zero(bmap->div[i][0]))
6871 pos = isl_seq_first_non_zero(bmap->div[i]+1+1+off+i,
6875 isl_basic_map_swap_div(bmap, i, i + pos);
6881 struct isl_basic_set *isl_basic_set_order_divs(struct isl_basic_set *bset)
6883 return (struct isl_basic_set *)
6884 isl_basic_map_order_divs((struct isl_basic_map *)bset);
6887 __isl_give isl_map *isl_map_order_divs(__isl_take isl_map *map)
6894 for (i = 0; i < map->n; ++i) {
6895 map->p[i] = isl_basic_map_order_divs(map->p[i]);
6906 /* Apply the expansion computed by isl_merge_divs.
6907 * The expansion itself is given by "exp" while the resulting
6908 * list of divs is given by "div".
6910 __isl_give isl_basic_set *isl_basic_set_expand_divs(
6911 __isl_take isl_basic_set *bset, __isl_take isl_mat *div, int *exp)
6916 bset = isl_basic_set_cow(bset);
6920 if (div->n_row < bset->n_div)
6921 isl_die(isl_mat_get_ctx(div), isl_error_invalid,
6922 "not an expansion", goto error);
6924 bset = isl_basic_map_extend_space(bset, isl_space_copy(bset->dim),
6925 div->n_row - bset->n_div, 0,
6926 2 * (div->n_row - bset->n_div));
6928 n_div = bset->n_div;
6929 for (i = n_div; i < div->n_row; ++i)
6930 if (isl_basic_set_alloc_div(bset) < 0)
6934 for (i = div->n_row - 1; i >= 0; --i) {
6935 if (j >= 0 && exp[j] == i) {
6937 isl_basic_map_swap_div(bset, i, j);
6940 isl_seq_cpy(bset->div[i], div->row[i], div->n_col);
6941 if (isl_basic_map_add_div_constraints(bset, i) < 0)
6949 isl_basic_set_free(bset);
6954 /* Look for a div in dst that corresponds to the div "div" in src.
6955 * The divs before "div" in src and dst are assumed to be the same.
6957 * Returns -1 if no corresponding div was found and the position
6958 * of the corresponding div in dst otherwise.
6960 static int find_div(struct isl_basic_map *dst,
6961 struct isl_basic_map *src, unsigned div)
6965 unsigned total = isl_space_dim(src->dim, isl_dim_all);
6967 isl_assert(dst->ctx, div <= dst->n_div, return -1);
6968 for (i = div; i < dst->n_div; ++i)
6969 if (isl_seq_eq(dst->div[i], src->div[div], 1+1+total+div) &&
6970 isl_seq_first_non_zero(dst->div[i]+1+1+total+div,
6971 dst->n_div - div) == -1)
6976 struct isl_basic_map *isl_basic_map_align_divs(
6977 struct isl_basic_map *dst, struct isl_basic_map *src)
6980 unsigned total = isl_space_dim(src->dim, isl_dim_all);
6985 if (src->n_div == 0)
6988 for (i = 0; i < src->n_div; ++i)
6989 isl_assert(src->ctx, !isl_int_is_zero(src->div[i][0]), goto error);
6991 src = isl_basic_map_order_divs(src);
6992 dst = isl_basic_map_cow(dst);
6993 dst = isl_basic_map_extend_space(dst, isl_space_copy(dst->dim),
6994 src->n_div, 0, 2 * src->n_div);
6997 for (i = 0; i < src->n_div; ++i) {
6998 int j = find_div(dst, src, i);
7000 j = isl_basic_map_alloc_div(dst);
7003 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total+i);
7004 isl_seq_clr(dst->div[j]+1+1+total+i, dst->n_div - i);
7005 if (isl_basic_map_add_div_constraints(dst, j) < 0)
7009 isl_basic_map_swap_div(dst, i, j);
7013 isl_basic_map_free(dst);
7017 struct isl_basic_set *isl_basic_set_align_divs(
7018 struct isl_basic_set *dst, struct isl_basic_set *src)
7020 return (struct isl_basic_set *)isl_basic_map_align_divs(
7021 (struct isl_basic_map *)dst, (struct isl_basic_map *)src);
7024 struct isl_map *isl_map_align_divs(struct isl_map *map)
7032 map = isl_map_compute_divs(map);
7033 map = isl_map_cow(map);
7037 for (i = 1; i < map->n; ++i)
7038 map->p[0] = isl_basic_map_align_divs(map->p[0], map->p[i]);
7039 for (i = 1; i < map->n; ++i)
7040 map->p[i] = isl_basic_map_align_divs(map->p[i], map->p[0]);
7042 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
7046 struct isl_set *isl_set_align_divs(struct isl_set *set)
7048 return (struct isl_set *)isl_map_align_divs((struct isl_map *)set);
7051 static __isl_give isl_set *set_apply( __isl_take isl_set *set,
7052 __isl_take isl_map *map)
7056 isl_assert(set->ctx, isl_map_compatible_domain(map, set), goto error);
7057 map = isl_map_intersect_domain(map, set);
7058 set = isl_map_range(map);
7066 __isl_give isl_set *isl_set_apply( __isl_take isl_set *set,
7067 __isl_take isl_map *map)
7069 return isl_map_align_params_map_map_and(set, map, &set_apply);
7072 /* There is no need to cow as removing empty parts doesn't change
7073 * the meaning of the set.
7075 struct isl_map *isl_map_remove_empty_parts(struct isl_map *map)
7082 for (i = map->n-1; i >= 0; --i) {
7083 if (!ISL_F_ISSET(map->p[i], ISL_BASIC_MAP_EMPTY))
7085 isl_basic_map_free(map->p[i]);
7086 if (i != map->n-1) {
7087 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
7088 map->p[i] = map->p[map->n-1];
7096 struct isl_set *isl_set_remove_empty_parts(struct isl_set *set)
7098 return (struct isl_set *)
7099 isl_map_remove_empty_parts((struct isl_map *)set);
7102 struct isl_basic_map *isl_map_copy_basic_map(struct isl_map *map)
7104 struct isl_basic_map *bmap;
7105 if (!map || map->n == 0)
7107 bmap = map->p[map->n-1];
7108 isl_assert(map->ctx, ISL_F_ISSET(bmap, ISL_BASIC_SET_FINAL), return NULL);
7109 return isl_basic_map_copy(bmap);
7112 struct isl_basic_set *isl_set_copy_basic_set(struct isl_set *set)
7114 return (struct isl_basic_set *)
7115 isl_map_copy_basic_map((struct isl_map *)set);
7118 __isl_give isl_map *isl_map_drop_basic_map(__isl_take isl_map *map,
7119 __isl_keep isl_basic_map *bmap)
7125 for (i = map->n-1; i >= 0; --i) {
7126 if (map->p[i] != bmap)
7128 map = isl_map_cow(map);
7131 isl_basic_map_free(map->p[i]);
7132 if (i != map->n-1) {
7133 ISL_F_CLR(map, ISL_SET_NORMALIZED);
7134 map->p[i] = map->p[map->n-1];
7145 struct isl_set *isl_set_drop_basic_set(struct isl_set *set,
7146 struct isl_basic_set *bset)
7148 return (struct isl_set *)isl_map_drop_basic_map((struct isl_map *)set,
7149 (struct isl_basic_map *)bset);
7152 /* Given two basic sets bset1 and bset2, compute the maximal difference
7153 * between the values of dimension pos in bset1 and those in bset2
7154 * for any common value of the parameters and dimensions preceding pos.
7156 static enum isl_lp_result basic_set_maximal_difference_at(
7157 __isl_keep isl_basic_set *bset1, __isl_keep isl_basic_set *bset2,
7158 int pos, isl_int *opt)
7161 struct isl_basic_map *bmap1 = NULL;
7162 struct isl_basic_map *bmap2 = NULL;
7163 struct isl_ctx *ctx;
7164 struct isl_vec *obj;
7167 unsigned dim1, dim2;
7168 enum isl_lp_result res;
7170 if (!bset1 || !bset2)
7171 return isl_lp_error;
7173 nparam = isl_basic_set_n_param(bset1);
7174 dim1 = isl_basic_set_n_dim(bset1);
7175 dim2 = isl_basic_set_n_dim(bset2);
7176 dims = isl_space_alloc(bset1->ctx, nparam, pos, dim1 - pos);
7177 bmap1 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset1), dims);
7178 dims = isl_space_alloc(bset2->ctx, nparam, pos, dim2 - pos);
7179 bmap2 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset2), dims);
7180 if (!bmap1 || !bmap2)
7182 bmap1 = isl_basic_map_cow(bmap1);
7183 bmap1 = isl_basic_map_extend(bmap1, nparam,
7184 pos, (dim1 - pos) + (dim2 - pos),
7185 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
7186 bmap1 = add_constraints(bmap1, bmap2, 0, dim1 - pos);
7189 total = isl_basic_map_total_dim(bmap1);
7191 obj = isl_vec_alloc(ctx, 1 + total);
7192 isl_seq_clr(obj->block.data, 1 + total);
7193 isl_int_set_si(obj->block.data[1+nparam+pos], 1);
7194 isl_int_set_si(obj->block.data[1+nparam+pos+(dim1-pos)], -1);
7197 res = isl_basic_map_solve_lp(bmap1, 1, obj->block.data, ctx->one,
7199 isl_basic_map_free(bmap1);
7203 isl_basic_map_free(bmap1);
7204 isl_basic_map_free(bmap2);
7205 return isl_lp_error;
7208 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
7209 * for any common value of the parameters and dimensions preceding pos
7210 * in both basic sets, the values of dimension pos in bset1 are
7211 * smaller or larger than those in bset2.
7214 * 1 if bset1 follows bset2
7215 * -1 if bset1 precedes bset2
7216 * 0 if bset1 and bset2 are incomparable
7217 * -2 if some error occurred.
7219 int isl_basic_set_compare_at(struct isl_basic_set *bset1,
7220 struct isl_basic_set *bset2, int pos)
7223 enum isl_lp_result res;
7228 res = basic_set_maximal_difference_at(bset1, bset2, pos, &opt);
7230 if (res == isl_lp_empty)
7232 else if ((res == isl_lp_ok && isl_int_is_pos(opt)) ||
7233 res == isl_lp_unbounded)
7235 else if (res == isl_lp_ok && isl_int_is_neg(opt))
7244 /* Given two basic sets bset1 and bset2, check whether
7245 * for any common value of the parameters and dimensions preceding pos
7246 * there is a value of dimension pos in bset1 that is larger
7247 * than a value of the same dimension in bset2.
7250 * 1 if there exists such a pair
7251 * 0 if there is no such pair, but there is a pair of equal values
7253 * -2 if some error occurred.
7255 int isl_basic_set_follows_at(__isl_keep isl_basic_set *bset1,
7256 __isl_keep isl_basic_set *bset2, int pos)
7259 enum isl_lp_result res;
7264 res = basic_set_maximal_difference_at(bset1, bset2, pos, &opt);
7266 if (res == isl_lp_empty)
7268 else if ((res == isl_lp_ok && isl_int_is_pos(opt)) ||
7269 res == isl_lp_unbounded)
7271 else if (res == isl_lp_ok && isl_int_is_neg(opt))
7273 else if (res == isl_lp_ok)
7282 /* Given two sets set1 and set2, check whether
7283 * for any common value of the parameters and dimensions preceding pos
7284 * there is a value of dimension pos in set1 that is larger
7285 * than a value of the same dimension in set2.
7288 * 1 if there exists such a pair
7289 * 0 if there is no such pair, but there is a pair of equal values
7291 * -2 if some error occurred.
7293 int isl_set_follows_at(__isl_keep isl_set *set1,
7294 __isl_keep isl_set *set2, int pos)
7302 for (i = 0; i < set1->n; ++i)
7303 for (j = 0; j < set2->n; ++j) {
7305 f = isl_basic_set_follows_at(set1->p[i], set2->p[j], pos);
7306 if (f == 1 || f == -2)
7315 static int isl_basic_map_plain_has_fixed_var(__isl_keep isl_basic_map *bmap,
7316 unsigned pos, isl_int *val)
7324 total = isl_basic_map_total_dim(bmap);
7325 for (i = 0, d = total-1; i < bmap->n_eq && d+1 > pos; ++i) {
7326 for (; d+1 > pos; --d)
7327 if (!isl_int_is_zero(bmap->eq[i][1+d]))
7331 if (isl_seq_first_non_zero(bmap->eq[i]+1, d) != -1)
7333 if (isl_seq_first_non_zero(bmap->eq[i]+1+d+1, total-d-1) != -1)
7335 if (!isl_int_is_one(bmap->eq[i][1+d]))
7338 isl_int_neg(*val, bmap->eq[i][0]);
7344 static int isl_map_plain_has_fixed_var(__isl_keep isl_map *map,
7345 unsigned pos, isl_int *val)
7357 return isl_basic_map_plain_has_fixed_var(map->p[0], pos, val);
7360 fixed = isl_basic_map_plain_has_fixed_var(map->p[0], pos, &v);
7361 for (i = 1; fixed == 1 && i < map->n; ++i) {
7362 fixed = isl_basic_map_plain_has_fixed_var(map->p[i], pos, &tmp);
7363 if (fixed == 1 && isl_int_ne(tmp, v))
7367 isl_int_set(*val, v);
7373 static int isl_basic_set_plain_has_fixed_var(__isl_keep isl_basic_set *bset,
7374 unsigned pos, isl_int *val)
7376 return isl_basic_map_plain_has_fixed_var((struct isl_basic_map *)bset,
7380 static int isl_set_plain_has_fixed_var(__isl_keep isl_set *set, unsigned pos,
7383 return isl_map_plain_has_fixed_var((struct isl_map *)set, pos, val);
7386 int isl_basic_map_plain_is_fixed(__isl_keep isl_basic_map *bmap,
7387 enum isl_dim_type type, unsigned pos, isl_int *val)
7389 if (pos >= isl_basic_map_dim(bmap, type))
7391 return isl_basic_map_plain_has_fixed_var(bmap,
7392 isl_basic_map_offset(bmap, type) - 1 + pos, val);
7395 int isl_map_plain_is_fixed(__isl_keep isl_map *map,
7396 enum isl_dim_type type, unsigned pos, isl_int *val)
7398 if (pos >= isl_map_dim(map, type))
7400 return isl_map_plain_has_fixed_var(map,
7401 map_offset(map, type) - 1 + pos, val);
7404 int isl_set_plain_is_fixed(__isl_keep isl_set *set,
7405 enum isl_dim_type type, unsigned pos, isl_int *val)
7407 return isl_map_plain_is_fixed(set, type, pos, val);
7410 int isl_map_fast_is_fixed(__isl_keep isl_map *map,
7411 enum isl_dim_type type, unsigned pos, isl_int *val)
7413 return isl_map_plain_is_fixed(map, type, pos, val);
7416 /* Check if dimension dim has fixed value and if so and if val is not NULL,
7417 * then return this fixed value in *val.
7419 int isl_basic_set_plain_dim_is_fixed(__isl_keep isl_basic_set *bset,
7420 unsigned dim, isl_int *val)
7422 return isl_basic_set_plain_has_fixed_var(bset,
7423 isl_basic_set_n_param(bset) + dim, val);
7426 /* Check if dimension dim has fixed value and if so and if val is not NULL,
7427 * then return this fixed value in *val.
7429 int isl_set_plain_dim_is_fixed(__isl_keep isl_set *set,
7430 unsigned dim, isl_int *val)
7432 return isl_set_plain_has_fixed_var(set, isl_set_n_param(set) + dim, val);
7435 int isl_set_fast_dim_is_fixed(__isl_keep isl_set *set,
7436 unsigned dim, isl_int *val)
7438 return isl_set_plain_dim_is_fixed(set, dim, val);
7441 /* Check if input variable in has fixed value and if so and if val is not NULL,
7442 * then return this fixed value in *val.
7444 int isl_map_plain_input_is_fixed(__isl_keep isl_map *map,
7445 unsigned in, isl_int *val)
7447 return isl_map_plain_has_fixed_var(map, isl_map_n_param(map) + in, val);
7450 /* Check if dimension dim has an (obvious) fixed lower bound and if so
7451 * and if val is not NULL, then return this lower bound in *val.
7453 int isl_basic_set_plain_dim_has_fixed_lower_bound(
7454 __isl_keep isl_basic_set *bset, unsigned dim, isl_int *val)
7456 int i, i_eq = -1, i_ineq = -1;
7463 total = isl_basic_set_total_dim(bset);
7464 nparam = isl_basic_set_n_param(bset);
7465 for (i = 0; i < bset->n_eq; ++i) {
7466 if (isl_int_is_zero(bset->eq[i][1+nparam+dim]))
7472 for (i = 0; i < bset->n_ineq; ++i) {
7473 if (!isl_int_is_pos(bset->ineq[i][1+nparam+dim]))
7475 if (i_eq != -1 || i_ineq != -1)
7479 if (i_eq == -1 && i_ineq == -1)
7481 c = i_eq != -1 ? bset->eq[i_eq] : bset->ineq[i_ineq];
7482 /* The coefficient should always be one due to normalization. */
7483 if (!isl_int_is_one(c[1+nparam+dim]))
7485 if (isl_seq_first_non_zero(c+1, nparam+dim) != -1)
7487 if (isl_seq_first_non_zero(c+1+nparam+dim+1,
7488 total - nparam - dim - 1) != -1)
7491 isl_int_neg(*val, c[0]);
7495 int isl_set_plain_dim_has_fixed_lower_bound(__isl_keep isl_set *set,
7496 unsigned dim, isl_int *val)
7508 return isl_basic_set_plain_dim_has_fixed_lower_bound(set->p[0],
7512 fixed = isl_basic_set_plain_dim_has_fixed_lower_bound(set->p[0],
7514 for (i = 1; fixed == 1 && i < set->n; ++i) {
7515 fixed = isl_basic_set_plain_dim_has_fixed_lower_bound(set->p[i],
7517 if (fixed == 1 && isl_int_ne(tmp, v))
7521 isl_int_set(*val, v);
7532 /* uset_gist depends on constraints without existentially quantified
7533 * variables sorting first.
7535 static int qsort_constraint_cmp(const void *p1, const void *p2)
7537 const struct constraint *c1 = (const struct constraint *)p1;
7538 const struct constraint *c2 = (const struct constraint *)p2;
7540 unsigned size = isl_min(c1->size, c2->size);
7542 l1 = isl_seq_last_non_zero(c1->c, size);
7543 l2 = isl_seq_last_non_zero(c2->c, size);
7548 return isl_seq_cmp(c1->c, c2->c, size);
7551 static struct isl_basic_map *isl_basic_map_sort_constraints(
7552 struct isl_basic_map *bmap)
7555 struct constraint *c;
7560 total = isl_basic_map_total_dim(bmap);
7561 c = isl_alloc_array(bmap->ctx, struct constraint, bmap->n_ineq);
7564 for (i = 0; i < bmap->n_ineq; ++i) {
7566 c[i].c = bmap->ineq[i];
7568 qsort(c, bmap->n_ineq, sizeof(struct constraint), qsort_constraint_cmp);
7569 for (i = 0; i < bmap->n_ineq; ++i)
7570 bmap->ineq[i] = c[i].c;
7574 isl_basic_map_free(bmap);
7578 __isl_give isl_basic_set *isl_basic_set_sort_constraints(
7579 __isl_take isl_basic_set *bset)
7581 return (struct isl_basic_set *)isl_basic_map_sort_constraints(
7582 (struct isl_basic_map *)bset);
7585 struct isl_basic_map *isl_basic_map_normalize(struct isl_basic_map *bmap)
7589 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_NORMALIZED))
7591 bmap = isl_basic_map_remove_redundancies(bmap);
7592 bmap = isl_basic_map_sort_constraints(bmap);
7593 ISL_F_SET(bmap, ISL_BASIC_MAP_NORMALIZED);
7597 struct isl_basic_set *isl_basic_set_normalize(struct isl_basic_set *bset)
7599 return (struct isl_basic_set *)isl_basic_map_normalize(
7600 (struct isl_basic_map *)bset);
7603 int isl_basic_map_plain_cmp(const __isl_keep isl_basic_map *bmap1,
7604 const __isl_keep isl_basic_map *bmap2)
7611 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_RATIONAL) !=
7612 ISL_F_ISSET(bmap2, ISL_BASIC_MAP_RATIONAL))
7613 return ISL_F_ISSET(bmap1, ISL_BASIC_MAP_RATIONAL) ? -1 : 1;
7614 if (isl_basic_map_n_param(bmap1) != isl_basic_map_n_param(bmap2))
7615 return isl_basic_map_n_param(bmap1) - isl_basic_map_n_param(bmap2);
7616 if (isl_basic_map_n_in(bmap1) != isl_basic_map_n_in(bmap2))
7617 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
7618 if (isl_basic_map_n_out(bmap1) != isl_basic_map_n_out(bmap2))
7619 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
7620 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY) &&
7621 ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
7623 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY))
7625 if (ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
7627 if (bmap1->n_eq != bmap2->n_eq)
7628 return bmap1->n_eq - bmap2->n_eq;
7629 if (bmap1->n_ineq != bmap2->n_ineq)
7630 return bmap1->n_ineq - bmap2->n_ineq;
7631 if (bmap1->n_div != bmap2->n_div)
7632 return bmap1->n_div - bmap2->n_div;
7633 total = isl_basic_map_total_dim(bmap1);
7634 for (i = 0; i < bmap1->n_eq; ++i) {
7635 cmp = isl_seq_cmp(bmap1->eq[i], bmap2->eq[i], 1+total);
7639 for (i = 0; i < bmap1->n_ineq; ++i) {
7640 cmp = isl_seq_cmp(bmap1->ineq[i], bmap2->ineq[i], 1+total);
7644 for (i = 0; i < bmap1->n_div; ++i) {
7645 cmp = isl_seq_cmp(bmap1->div[i], bmap2->div[i], 1+1+total);
7652 int isl_basic_set_plain_cmp(const __isl_keep isl_basic_set *bset1,
7653 const __isl_keep isl_basic_set *bset2)
7655 return isl_basic_map_plain_cmp(bset1, bset2);
7658 int isl_set_plain_cmp(const __isl_keep isl_set *set1,
7659 const __isl_keep isl_set *set2)
7665 if (set1->n != set2->n)
7666 return set1->n - set2->n;
7668 for (i = 0; i < set1->n; ++i) {
7669 cmp = isl_basic_set_plain_cmp(set1->p[i], set2->p[i]);
7677 int isl_basic_map_plain_is_equal(__isl_keep isl_basic_map *bmap1,
7678 __isl_keep isl_basic_map *bmap2)
7680 return isl_basic_map_plain_cmp(bmap1, bmap2) == 0;
7683 int isl_basic_set_plain_is_equal(__isl_keep isl_basic_set *bset1,
7684 __isl_keep isl_basic_set *bset2)
7686 return isl_basic_map_plain_is_equal((isl_basic_map *)bset1,
7687 (isl_basic_map *)bset2);
7690 static int qsort_bmap_cmp(const void *p1, const void *p2)
7692 const struct isl_basic_map *bmap1 = *(const struct isl_basic_map **)p1;
7693 const struct isl_basic_map *bmap2 = *(const struct isl_basic_map **)p2;
7695 return isl_basic_map_plain_cmp(bmap1, bmap2);
7698 /* We normalize in place, but if anything goes wrong we need
7699 * to return NULL, so we need to make sure we don't change the
7700 * meaning of any possible other copies of map.
7702 struct isl_map *isl_map_normalize(struct isl_map *map)
7705 struct isl_basic_map *bmap;
7709 if (ISL_F_ISSET(map, ISL_MAP_NORMALIZED))
7711 for (i = 0; i < map->n; ++i) {
7712 bmap = isl_basic_map_normalize(isl_basic_map_copy(map->p[i]));
7715 isl_basic_map_free(map->p[i]);
7718 qsort(map->p, map->n, sizeof(struct isl_basic_map *), qsort_bmap_cmp);
7719 ISL_F_SET(map, ISL_MAP_NORMALIZED);
7720 map = isl_map_remove_empty_parts(map);
7723 for (i = map->n - 1; i >= 1; --i) {
7724 if (!isl_basic_map_plain_is_equal(map->p[i-1], map->p[i]))
7726 isl_basic_map_free(map->p[i-1]);
7727 for (j = i; j < map->n; ++j)
7728 map->p[j-1] = map->p[j];
7738 struct isl_set *isl_set_normalize(struct isl_set *set)
7740 return (struct isl_set *)isl_map_normalize((struct isl_map *)set);
7743 int isl_map_plain_is_equal(__isl_keep isl_map *map1, __isl_keep isl_map *map2)
7753 if (!isl_space_is_equal(map1->dim, map2->dim))
7756 map1 = isl_map_copy(map1);
7757 map2 = isl_map_copy(map2);
7758 map1 = isl_map_normalize(map1);
7759 map2 = isl_map_normalize(map2);
7762 equal = map1->n == map2->n;
7763 for (i = 0; equal && i < map1->n; ++i) {
7764 equal = isl_basic_map_plain_is_equal(map1->p[i], map2->p[i]);
7777 int isl_map_fast_is_equal(__isl_keep isl_map *map1, __isl_keep isl_map *map2)
7779 return isl_map_plain_is_equal(map1, map2);
7782 int isl_set_plain_is_equal(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
7784 return isl_map_plain_is_equal((struct isl_map *)set1,
7785 (struct isl_map *)set2);
7788 int isl_set_fast_is_equal(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
7790 return isl_set_plain_is_equal(set1, set2);
7793 /* Return an interval that ranges from min to max (inclusive)
7795 struct isl_basic_set *isl_basic_set_interval(struct isl_ctx *ctx,
7796 isl_int min, isl_int max)
7799 struct isl_basic_set *bset = NULL;
7801 bset = isl_basic_set_alloc(ctx, 0, 1, 0, 0, 2);
7805 k = isl_basic_set_alloc_inequality(bset);
7808 isl_int_set_si(bset->ineq[k][1], 1);
7809 isl_int_neg(bset->ineq[k][0], min);
7811 k = isl_basic_set_alloc_inequality(bset);
7814 isl_int_set_si(bset->ineq[k][1], -1);
7815 isl_int_set(bset->ineq[k][0], max);
7819 isl_basic_set_free(bset);
7823 /* Return the Cartesian product of the basic sets in list (in the given order).
7825 __isl_give isl_basic_set *isl_basic_set_list_product(
7826 __isl_take struct isl_basic_set_list *list)
7834 struct isl_basic_set *product = NULL;
7838 isl_assert(list->ctx, list->n > 0, goto error);
7839 isl_assert(list->ctx, list->p[0], goto error);
7840 nparam = isl_basic_set_n_param(list->p[0]);
7841 dim = isl_basic_set_n_dim(list->p[0]);
7842 extra = list->p[0]->n_div;
7843 n_eq = list->p[0]->n_eq;
7844 n_ineq = list->p[0]->n_ineq;
7845 for (i = 1; i < list->n; ++i) {
7846 isl_assert(list->ctx, list->p[i], goto error);
7847 isl_assert(list->ctx,
7848 nparam == isl_basic_set_n_param(list->p[i]), goto error);
7849 dim += isl_basic_set_n_dim(list->p[i]);
7850 extra += list->p[i]->n_div;
7851 n_eq += list->p[i]->n_eq;
7852 n_ineq += list->p[i]->n_ineq;
7854 product = isl_basic_set_alloc(list->ctx, nparam, dim, extra,
7859 for (i = 0; i < list->n; ++i) {
7860 isl_basic_set_add_constraints(product,
7861 isl_basic_set_copy(list->p[i]), dim);
7862 dim += isl_basic_set_n_dim(list->p[i]);
7864 isl_basic_set_list_free(list);
7867 isl_basic_set_free(product);
7868 isl_basic_set_list_free(list);
7872 struct isl_basic_map *isl_basic_map_product(
7873 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
7875 isl_space *dim_result = NULL;
7876 struct isl_basic_map *bmap;
7877 unsigned in1, in2, out1, out2, nparam, total, pos;
7878 struct isl_dim_map *dim_map1, *dim_map2;
7880 if (!bmap1 || !bmap2)
7883 isl_assert(bmap1->ctx, isl_space_match(bmap1->dim, isl_dim_param,
7884 bmap2->dim, isl_dim_param), goto error);
7885 dim_result = isl_space_product(isl_space_copy(bmap1->dim),
7886 isl_space_copy(bmap2->dim));
7888 in1 = isl_basic_map_n_in(bmap1);
7889 in2 = isl_basic_map_n_in(bmap2);
7890 out1 = isl_basic_map_n_out(bmap1);
7891 out2 = isl_basic_map_n_out(bmap2);
7892 nparam = isl_basic_map_n_param(bmap1);
7894 total = nparam + in1 + in2 + out1 + out2 + bmap1->n_div + bmap2->n_div;
7895 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
7896 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
7897 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
7898 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
7899 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
7900 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos += in1);
7901 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += in2);
7902 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += out1);
7903 isl_dim_map_div(dim_map1, bmap1, pos += out2);
7904 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
7906 bmap = isl_basic_map_alloc_space(dim_result,
7907 bmap1->n_div + bmap2->n_div,
7908 bmap1->n_eq + bmap2->n_eq,
7909 bmap1->n_ineq + bmap2->n_ineq);
7910 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap1, dim_map1);
7911 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap2, dim_map2);
7912 bmap = isl_basic_map_simplify(bmap);
7913 return isl_basic_map_finalize(bmap);
7915 isl_basic_map_free(bmap1);
7916 isl_basic_map_free(bmap2);
7920 __isl_give isl_basic_map *isl_basic_map_flat_product(
7921 __isl_take isl_basic_map *bmap1, __isl_take isl_basic_map *bmap2)
7923 isl_basic_map *prod;
7925 prod = isl_basic_map_product(bmap1, bmap2);
7926 prod = isl_basic_map_flatten(prod);
7930 __isl_give isl_basic_set *isl_basic_set_flat_product(
7931 __isl_take isl_basic_set *bset1, __isl_take isl_basic_set *bset2)
7933 return isl_basic_map_flat_range_product(bset1, bset2);
7936 __isl_give isl_basic_map *isl_basic_map_domain_product(
7937 __isl_take isl_basic_map *bmap1, __isl_take isl_basic_map *bmap2)
7939 isl_space *space_result = NULL;
7940 isl_basic_map *bmap;
7941 unsigned in1, in2, out, nparam, total, pos;
7942 struct isl_dim_map *dim_map1, *dim_map2;
7944 if (!bmap1 || !bmap2)
7947 space_result = isl_space_domain_product(isl_space_copy(bmap1->dim),
7948 isl_space_copy(bmap2->dim));
7950 in1 = isl_basic_map_dim(bmap1, isl_dim_in);
7951 in2 = isl_basic_map_dim(bmap2, isl_dim_in);
7952 out = isl_basic_map_dim(bmap1, isl_dim_out);
7953 nparam = isl_basic_map_dim(bmap1, isl_dim_param);
7955 total = nparam + in1 + in2 + out + bmap1->n_div + bmap2->n_div;
7956 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
7957 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
7958 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
7959 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
7960 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
7961 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos += in1);
7962 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += in2);
7963 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos);
7964 isl_dim_map_div(dim_map1, bmap1, pos += out);
7965 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
7967 bmap = isl_basic_map_alloc_space(space_result,
7968 bmap1->n_div + bmap2->n_div,
7969 bmap1->n_eq + bmap2->n_eq,
7970 bmap1->n_ineq + bmap2->n_ineq);
7971 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap1, dim_map1);
7972 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap2, dim_map2);
7973 bmap = isl_basic_map_simplify(bmap);
7974 return isl_basic_map_finalize(bmap);
7976 isl_basic_map_free(bmap1);
7977 isl_basic_map_free(bmap2);
7981 __isl_give isl_basic_map *isl_basic_map_range_product(
7982 __isl_take isl_basic_map *bmap1, __isl_take isl_basic_map *bmap2)
7984 isl_space *dim_result = NULL;
7985 isl_basic_map *bmap;
7986 unsigned in, out1, out2, nparam, total, pos;
7987 struct isl_dim_map *dim_map1, *dim_map2;
7989 if (!bmap1 || !bmap2)
7992 dim_result = isl_space_range_product(isl_space_copy(bmap1->dim),
7993 isl_space_copy(bmap2->dim));
7995 in = isl_basic_map_dim(bmap1, isl_dim_in);
7996 out1 = isl_basic_map_n_out(bmap1);
7997 out2 = isl_basic_map_n_out(bmap2);
7998 nparam = isl_basic_map_n_param(bmap1);
8000 total = nparam + in + out1 + out2 + bmap1->n_div + bmap2->n_div;
8001 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
8002 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
8003 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
8004 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
8005 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
8006 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
8007 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += in);
8008 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += out1);
8009 isl_dim_map_div(dim_map1, bmap1, pos += out2);
8010 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
8012 bmap = isl_basic_map_alloc_space(dim_result,
8013 bmap1->n_div + bmap2->n_div,
8014 bmap1->n_eq + bmap2->n_eq,
8015 bmap1->n_ineq + bmap2->n_ineq);
8016 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap1, dim_map1);
8017 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap2, dim_map2);
8018 bmap = isl_basic_map_simplify(bmap);
8019 return isl_basic_map_finalize(bmap);
8021 isl_basic_map_free(bmap1);
8022 isl_basic_map_free(bmap2);
8026 __isl_give isl_basic_map *isl_basic_map_flat_range_product(
8027 __isl_take isl_basic_map *bmap1, __isl_take isl_basic_map *bmap2)
8029 isl_basic_map *prod;
8031 prod = isl_basic_map_range_product(bmap1, bmap2);
8032 prod = isl_basic_map_flatten_range(prod);
8036 static __isl_give isl_map *map_product(__isl_take isl_map *map1,
8037 __isl_take isl_map *map2,
8038 __isl_give isl_space *(*dim_product)(__isl_take isl_space *left,
8039 __isl_take isl_space *right),
8040 __isl_give isl_basic_map *(*basic_map_product)(
8041 __isl_take isl_basic_map *left, __isl_take isl_basic_map *right))
8044 struct isl_map *result;
8050 isl_assert(map1->ctx, isl_space_match(map1->dim, isl_dim_param,
8051 map2->dim, isl_dim_param), goto error);
8053 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
8054 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
8055 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
8057 result = isl_map_alloc_space(dim_product(isl_space_copy(map1->dim),
8058 isl_space_copy(map2->dim)),
8059 map1->n * map2->n, flags);
8062 for (i = 0; i < map1->n; ++i)
8063 for (j = 0; j < map2->n; ++j) {
8064 struct isl_basic_map *part;
8065 part = basic_map_product(isl_basic_map_copy(map1->p[i]),
8066 isl_basic_map_copy(map2->p[j]));
8067 if (isl_basic_map_is_empty(part))
8068 isl_basic_map_free(part);
8070 result = isl_map_add_basic_map(result, part);
8083 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> [B -> D]
8085 static __isl_give isl_map *map_product_aligned(__isl_take isl_map *map1,
8086 __isl_take isl_map *map2)
8088 return map_product(map1, map2, &isl_space_product, &isl_basic_map_product);
8091 __isl_give isl_map *isl_map_product(__isl_take isl_map *map1,
8092 __isl_take isl_map *map2)
8094 return isl_map_align_params_map_map_and(map1, map2, &map_product_aligned);
8097 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
8099 __isl_give isl_map *isl_map_flat_product(__isl_take isl_map *map1,
8100 __isl_take isl_map *map2)
8104 prod = isl_map_product(map1, map2);
8105 prod = isl_map_flatten(prod);
8109 /* Given two set A and B, construct its Cartesian product A x B.
8111 struct isl_set *isl_set_product(struct isl_set *set1, struct isl_set *set2)
8113 return isl_map_range_product(set1, set2);
8116 __isl_give isl_set *isl_set_flat_product(__isl_take isl_set *set1,
8117 __isl_take isl_set *set2)
8119 return isl_map_flat_range_product(set1, set2);
8122 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> (B * D)
8124 static __isl_give isl_map *map_domain_product_aligned(__isl_take isl_map *map1,
8125 __isl_take isl_map *map2)
8127 return map_product(map1, map2, &isl_space_domain_product,
8128 &isl_basic_map_domain_product);
8131 /* Given two maps A -> B and C -> D, construct a map (A * C) -> [B -> D]
8133 static __isl_give isl_map *map_range_product_aligned(__isl_take isl_map *map1,
8134 __isl_take isl_map *map2)
8136 return map_product(map1, map2, &isl_space_range_product,
8137 &isl_basic_map_range_product);
8140 __isl_give isl_map *isl_map_domain_product(__isl_take isl_map *map1,
8141 __isl_take isl_map *map2)
8143 return isl_map_align_params_map_map_and(map1, map2,
8144 &map_domain_product_aligned);
8147 __isl_give isl_map *isl_map_range_product(__isl_take isl_map *map1,
8148 __isl_take isl_map *map2)
8150 return isl_map_align_params_map_map_and(map1, map2,
8151 &map_range_product_aligned);
8154 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B * D)
8156 __isl_give isl_map *isl_map_flat_domain_product(__isl_take isl_map *map1,
8157 __isl_take isl_map *map2)
8161 prod = isl_map_domain_product(map1, map2);
8162 prod = isl_map_flatten_domain(prod);
8166 /* Given two maps A -> B and C -> D, construct a map (A * C) -> (B, D)
8168 __isl_give isl_map *isl_map_flat_range_product(__isl_take isl_map *map1,
8169 __isl_take isl_map *map2)
8173 prod = isl_map_range_product(map1, map2);
8174 prod = isl_map_flatten_range(prod);
8178 uint32_t isl_basic_map_get_hash(__isl_keep isl_basic_map *bmap)
8181 uint32_t hash = isl_hash_init();
8186 bmap = isl_basic_map_copy(bmap);
8187 bmap = isl_basic_map_normalize(bmap);
8190 total = isl_basic_map_total_dim(bmap);
8191 isl_hash_byte(hash, bmap->n_eq & 0xFF);
8192 for (i = 0; i < bmap->n_eq; ++i) {
8194 c_hash = isl_seq_get_hash(bmap->eq[i], 1 + total);
8195 isl_hash_hash(hash, c_hash);
8197 isl_hash_byte(hash, bmap->n_ineq & 0xFF);
8198 for (i = 0; i < bmap->n_ineq; ++i) {
8200 c_hash = isl_seq_get_hash(bmap->ineq[i], 1 + total);
8201 isl_hash_hash(hash, c_hash);
8203 isl_hash_byte(hash, bmap->n_div & 0xFF);
8204 for (i = 0; i < bmap->n_div; ++i) {
8206 if (isl_int_is_zero(bmap->div[i][0]))
8208 isl_hash_byte(hash, i & 0xFF);
8209 c_hash = isl_seq_get_hash(bmap->div[i], 1 + 1 + total);
8210 isl_hash_hash(hash, c_hash);
8212 isl_basic_map_free(bmap);
8216 uint32_t isl_basic_set_get_hash(__isl_keep isl_basic_set *bset)
8218 return isl_basic_map_get_hash((isl_basic_map *)bset);
8221 uint32_t isl_map_get_hash(__isl_keep isl_map *map)
8228 map = isl_map_copy(map);
8229 map = isl_map_normalize(map);
8233 hash = isl_hash_init();
8234 for (i = 0; i < map->n; ++i) {
8236 bmap_hash = isl_basic_map_get_hash(map->p[i]);
8237 isl_hash_hash(hash, bmap_hash);
8245 uint32_t isl_set_get_hash(__isl_keep isl_set *set)
8247 return isl_map_get_hash((isl_map *)set);
8250 /* Check if the value for dimension dim is completely determined
8251 * by the values of the other parameters and variables.
8252 * That is, check if dimension dim is involved in an equality.
8254 int isl_basic_set_dim_is_unique(struct isl_basic_set *bset, unsigned dim)
8261 nparam = isl_basic_set_n_param(bset);
8262 for (i = 0; i < bset->n_eq; ++i)
8263 if (!isl_int_is_zero(bset->eq[i][1 + nparam + dim]))
8268 /* Check if the value for dimension dim is completely determined
8269 * by the values of the other parameters and variables.
8270 * That is, check if dimension dim is involved in an equality
8271 * for each of the subsets.
8273 int isl_set_dim_is_unique(struct isl_set *set, unsigned dim)
8279 for (i = 0; i < set->n; ++i) {
8281 unique = isl_basic_set_dim_is_unique(set->p[i], dim);
8288 int isl_set_n_basic_set(__isl_keep isl_set *set)
8290 return set ? set->n : 0;
8293 int isl_map_foreach_basic_map(__isl_keep isl_map *map,
8294 int (*fn)(__isl_take isl_basic_map *bmap, void *user), void *user)
8301 for (i = 0; i < map->n; ++i)
8302 if (fn(isl_basic_map_copy(map->p[i]), user) < 0)
8308 int isl_set_foreach_basic_set(__isl_keep isl_set *set,
8309 int (*fn)(__isl_take isl_basic_set *bset, void *user), void *user)
8316 for (i = 0; i < set->n; ++i)
8317 if (fn(isl_basic_set_copy(set->p[i]), user) < 0)
8323 __isl_give isl_basic_set *isl_basic_set_lift(__isl_take isl_basic_set *bset)
8330 bset = isl_basic_set_cow(bset);
8334 dim = isl_basic_set_get_space(bset);
8335 dim = isl_space_lift(dim, bset->n_div);
8338 isl_space_free(bset->dim);
8340 bset->extra -= bset->n_div;
8343 bset = isl_basic_set_finalize(bset);
8347 isl_basic_set_free(bset);
8351 __isl_give isl_set *isl_set_lift(__isl_take isl_set *set)
8357 set = isl_set_align_divs(set);
8362 set = isl_set_cow(set);
8366 n_div = set->p[0]->n_div;
8367 dim = isl_set_get_space(set);
8368 dim = isl_space_lift(dim, n_div);
8371 isl_space_free(set->dim);
8374 for (i = 0; i < set->n; ++i) {
8375 set->p[i] = isl_basic_set_lift(set->p[i]);
8386 __isl_give isl_map *isl_set_lifting(__isl_take isl_set *set)
8389 struct isl_basic_map *bmap;
8396 set = isl_set_align_divs(set);
8401 dim = isl_set_get_space(set);
8402 if (set->n == 0 || set->p[0]->n_div == 0) {
8404 return isl_map_identity(isl_space_map_from_set(dim));
8407 n_div = set->p[0]->n_div;
8408 dim = isl_space_map_from_set(dim);
8409 n_param = isl_space_dim(dim, isl_dim_param);
8410 n_set = isl_space_dim(dim, isl_dim_in);
8411 dim = isl_space_extend(dim, n_param, n_set, n_set + n_div);
8412 bmap = isl_basic_map_alloc_space(dim, 0, n_set, 2 * n_div);
8413 for (i = 0; i < n_set; ++i)
8414 bmap = var_equal(bmap, i);
8416 total = n_param + n_set + n_set + n_div;
8417 for (i = 0; i < n_div; ++i) {
8418 k = isl_basic_map_alloc_inequality(bmap);
8421 isl_seq_cpy(bmap->ineq[k], set->p[0]->div[i]+1, 1+n_param);
8422 isl_seq_clr(bmap->ineq[k]+1+n_param, n_set);
8423 isl_seq_cpy(bmap->ineq[k]+1+n_param+n_set,
8424 set->p[0]->div[i]+1+1+n_param, n_set + n_div);
8425 isl_int_neg(bmap->ineq[k][1+n_param+n_set+n_set+i],
8426 set->p[0]->div[i][0]);
8428 l = isl_basic_map_alloc_inequality(bmap);
8431 isl_seq_neg(bmap->ineq[l], bmap->ineq[k], 1 + total);
8432 isl_int_add(bmap->ineq[l][0], bmap->ineq[l][0],
8433 set->p[0]->div[i][0]);
8434 isl_int_sub_ui(bmap->ineq[l][0], bmap->ineq[l][0], 1);
8438 bmap = isl_basic_map_simplify(bmap);
8439 bmap = isl_basic_map_finalize(bmap);
8440 return isl_map_from_basic_map(bmap);
8443 isl_basic_map_free(bmap);
8447 int isl_basic_set_size(__isl_keep isl_basic_set *bset)
8455 dim = isl_basic_set_total_dim(bset);
8456 size += bset->n_eq * (1 + dim);
8457 size += bset->n_ineq * (1 + dim);
8458 size += bset->n_div * (2 + dim);
8463 int isl_set_size(__isl_keep isl_set *set)
8471 for (i = 0; i < set->n; ++i)
8472 size += isl_basic_set_size(set->p[i]);
8477 /* Check if there is any lower bound (if lower == 0) and/or upper
8478 * bound (if upper == 0) on the specified dim.
8480 static int basic_map_dim_is_bounded(__isl_keep isl_basic_map *bmap,
8481 enum isl_dim_type type, unsigned pos, int lower, int upper)
8488 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), return -1);
8490 pos += isl_basic_map_offset(bmap, type);
8492 for (i = 0; i < bmap->n_div; ++i) {
8493 if (isl_int_is_zero(bmap->div[i][0]))
8495 if (!isl_int_is_zero(bmap->div[i][1 + pos]))
8499 for (i = 0; i < bmap->n_eq; ++i)
8500 if (!isl_int_is_zero(bmap->eq[i][pos]))
8503 for (i = 0; i < bmap->n_ineq; ++i) {
8504 int sgn = isl_int_sgn(bmap->ineq[i][pos]);
8511 return lower && upper;
8514 int isl_basic_map_dim_is_bounded(__isl_keep isl_basic_map *bmap,
8515 enum isl_dim_type type, unsigned pos)
8517 return basic_map_dim_is_bounded(bmap, type, pos, 0, 0);
8520 int isl_basic_map_dim_has_lower_bound(__isl_keep isl_basic_map *bmap,
8521 enum isl_dim_type type, unsigned pos)
8523 return basic_map_dim_is_bounded(bmap, type, pos, 0, 1);
8526 int isl_basic_map_dim_has_upper_bound(__isl_keep isl_basic_map *bmap,
8527 enum isl_dim_type type, unsigned pos)
8529 return basic_map_dim_is_bounded(bmap, type, pos, 1, 0);
8532 int isl_map_dim_is_bounded(__isl_keep isl_map *map,
8533 enum isl_dim_type type, unsigned pos)
8540 for (i = 0; i < map->n; ++i) {
8542 bounded = isl_basic_map_dim_is_bounded(map->p[i], type, pos);
8543 if (bounded < 0 || !bounded)
8550 /* Return 1 if the specified dim is involved in both an upper bound
8551 * and a lower bound.
8553 int isl_set_dim_is_bounded(__isl_keep isl_set *set,
8554 enum isl_dim_type type, unsigned pos)
8556 return isl_map_dim_is_bounded((isl_map *)set, type, pos);
8559 static int has_bound(__isl_keep isl_map *map,
8560 enum isl_dim_type type, unsigned pos,
8561 int (*fn)(__isl_keep isl_basic_map *bmap,
8562 enum isl_dim_type type, unsigned pos))
8569 for (i = 0; i < map->n; ++i) {
8571 bounded = fn(map->p[i], type, pos);
8572 if (bounded < 0 || bounded)
8579 /* Return 1 if the specified dim is involved in any lower bound.
8581 int isl_set_dim_has_lower_bound(__isl_keep isl_set *set,
8582 enum isl_dim_type type, unsigned pos)
8584 return has_bound(set, type, pos, &isl_basic_map_dim_has_lower_bound);
8587 /* Return 1 if the specified dim is involved in any upper bound.
8589 int isl_set_dim_has_upper_bound(__isl_keep isl_set *set,
8590 enum isl_dim_type type, unsigned pos)
8592 return has_bound(set, type, pos, &isl_basic_map_dim_has_upper_bound);
8595 /* For each of the "n" variables starting at "first", determine
8596 * the sign of the variable and put the results in the first "n"
8597 * elements of the array "signs".
8599 * 1 means that the variable is non-negative
8600 * -1 means that the variable is non-positive
8601 * 0 means the variable attains both positive and negative values.
8603 int isl_basic_set_vars_get_sign(__isl_keep isl_basic_set *bset,
8604 unsigned first, unsigned n, int *signs)
8606 isl_vec *bound = NULL;
8607 struct isl_tab *tab = NULL;
8608 struct isl_tab_undo *snap;
8611 if (!bset || !signs)
8614 bound = isl_vec_alloc(bset->ctx, 1 + isl_basic_set_total_dim(bset));
8615 tab = isl_tab_from_basic_set(bset);
8619 isl_seq_clr(bound->el, bound->size);
8620 isl_int_set_si(bound->el[0], -1);
8622 snap = isl_tab_snap(tab);
8623 for (i = 0; i < n; ++i) {
8626 isl_int_set_si(bound->el[1 + first + i], -1);
8627 if (isl_tab_add_ineq(tab, bound->el) < 0)
8630 isl_int_set_si(bound->el[1 + first + i], 0);
8631 if (isl_tab_rollback(tab, snap) < 0)
8639 isl_int_set_si(bound->el[1 + first + i], 1);
8640 if (isl_tab_add_ineq(tab, bound->el) < 0)
8643 isl_int_set_si(bound->el[1 + first + i], 0);
8644 if (isl_tab_rollback(tab, snap) < 0)
8647 signs[i] = empty ? -1 : 0;
8651 isl_vec_free(bound);
8655 isl_vec_free(bound);
8659 int isl_basic_set_dims_get_sign(__isl_keep isl_basic_set *bset,
8660 enum isl_dim_type type, unsigned first, unsigned n, int *signs)
8662 if (!bset || !signs)
8664 isl_assert(bset->ctx, first + n <= isl_basic_set_dim(bset, type),
8667 first += pos(bset->dim, type) - 1;
8668 return isl_basic_set_vars_get_sign(bset, first, n, signs);
8671 /* Check if the given basic map is obviously single-valued.
8672 * In particular, for each output dimension, check that there is
8673 * an equality that defines the output dimension in terms of
8674 * earlier dimensions.
8676 int isl_basic_map_plain_is_single_valued(__isl_keep isl_basic_map *bmap)
8686 total = 1 + isl_basic_map_total_dim(bmap);
8687 n_out = isl_basic_map_dim(bmap, isl_dim_out);
8688 o_out = isl_basic_map_offset(bmap, isl_dim_out);
8690 for (i = 0; i < n_out; ++i) {
8691 for (j = 0; j < bmap->n_eq; ++j) {
8692 if (isl_int_is_zero(bmap->eq[j][o_out + i]))
8694 if (isl_seq_first_non_zero(bmap->eq[j] + o_out + i + 1,
8695 total - (o_out + i + 1)) == -1)
8698 if (j >= bmap->n_eq)
8705 /* Check if the given map is obviously single-valued.
8707 int isl_map_plain_is_single_valued(__isl_keep isl_map *map)
8716 return isl_basic_map_plain_is_single_valued(map->p[0]);
8719 /* Check if the given map is single-valued.
8724 * and check if the result is a subset of the identity mapping.
8726 int isl_map_is_single_valued(__isl_keep isl_map *map)
8733 sv = isl_map_plain_is_single_valued(map);
8737 test = isl_map_reverse(isl_map_copy(map));
8738 test = isl_map_apply_range(test, isl_map_copy(map));
8740 dim = isl_space_map_from_set(isl_space_range(isl_map_get_space(map)));
8741 id = isl_map_identity(dim);
8743 sv = isl_map_is_subset(test, id);
8751 int isl_map_is_injective(__isl_keep isl_map *map)
8755 map = isl_map_copy(map);
8756 map = isl_map_reverse(map);
8757 in = isl_map_is_single_valued(map);
8763 /* Check if the given map is obviously injective.
8765 int isl_map_plain_is_injective(__isl_keep isl_map *map)
8769 map = isl_map_copy(map);
8770 map = isl_map_reverse(map);
8771 in = isl_map_plain_is_single_valued(map);
8777 int isl_map_is_bijective(__isl_keep isl_map *map)
8781 sv = isl_map_is_single_valued(map);
8785 return isl_map_is_injective(map);
8788 int isl_set_is_singleton(__isl_keep isl_set *set)
8790 return isl_map_is_single_valued((isl_map *)set);
8793 int isl_map_is_translation(__isl_keep isl_map *map)
8798 delta = isl_map_deltas(isl_map_copy(map));
8799 ok = isl_set_is_singleton(delta);
8800 isl_set_free(delta);
8805 static int unique(isl_int *p, unsigned pos, unsigned len)
8807 if (isl_seq_first_non_zero(p, pos) != -1)
8809 if (isl_seq_first_non_zero(p + pos + 1, len - pos - 1) != -1)
8814 int isl_basic_set_is_box(__isl_keep isl_basic_set *bset)
8823 if (isl_basic_set_dim(bset, isl_dim_div) != 0)
8826 nvar = isl_basic_set_dim(bset, isl_dim_set);
8827 ovar = isl_space_offset(bset->dim, isl_dim_set);
8828 for (j = 0; j < nvar; ++j) {
8829 int lower = 0, upper = 0;
8830 for (i = 0; i < bset->n_eq; ++i) {
8831 if (isl_int_is_zero(bset->eq[i][1 + ovar + j]))
8833 if (!unique(bset->eq[i] + 1 + ovar, j, nvar))
8839 for (i = 0; i < bset->n_ineq; ++i) {
8840 if (isl_int_is_zero(bset->ineq[i][1 + ovar + j]))
8842 if (!unique(bset->ineq[i] + 1 + ovar, j, nvar))
8844 if (isl_int_is_pos(bset->ineq[i][1 + ovar + j]))
8849 if (!lower || !upper)
8856 int isl_set_is_box(__isl_keep isl_set *set)
8863 return isl_basic_set_is_box(set->p[0]);
8866 int isl_basic_set_is_wrapping(__isl_keep isl_basic_set *bset)
8871 return isl_space_is_wrapping(bset->dim);
8874 int isl_set_is_wrapping(__isl_keep isl_set *set)
8879 return isl_space_is_wrapping(set->dim);
8882 __isl_give isl_basic_set *isl_basic_map_wrap(__isl_take isl_basic_map *bmap)
8884 bmap = isl_basic_map_cow(bmap);
8888 bmap->dim = isl_space_wrap(bmap->dim);
8892 bmap = isl_basic_map_finalize(bmap);
8894 return (isl_basic_set *)bmap;
8896 isl_basic_map_free(bmap);
8900 __isl_give isl_set *isl_map_wrap(__isl_take isl_map *map)
8904 map = isl_map_cow(map);
8908 for (i = 0; i < map->n; ++i) {
8909 map->p[i] = (isl_basic_map *)isl_basic_map_wrap(map->p[i]);
8913 map->dim = isl_space_wrap(map->dim);
8917 return (isl_set *)map;
8923 __isl_give isl_basic_map *isl_basic_set_unwrap(__isl_take isl_basic_set *bset)
8925 bset = isl_basic_set_cow(bset);
8929 bset->dim = isl_space_unwrap(bset->dim);
8933 bset = isl_basic_set_finalize(bset);
8935 return (isl_basic_map *)bset;
8937 isl_basic_set_free(bset);
8941 __isl_give isl_map *isl_set_unwrap(__isl_take isl_set *set)
8948 if (!isl_set_is_wrapping(set))
8949 isl_die(set->ctx, isl_error_invalid, "not a wrapping set",
8952 set = isl_set_cow(set);
8956 for (i = 0; i < set->n; ++i) {
8957 set->p[i] = (isl_basic_set *)isl_basic_set_unwrap(set->p[i]);
8962 set->dim = isl_space_unwrap(set->dim);
8966 return (isl_map *)set;
8972 __isl_give isl_basic_map *isl_basic_map_reset(__isl_take isl_basic_map *bmap,
8973 enum isl_dim_type type)
8978 if (!isl_space_is_named_or_nested(bmap->dim, type))
8981 bmap = isl_basic_map_cow(bmap);
8985 bmap->dim = isl_space_reset(bmap->dim, type);
8989 bmap = isl_basic_map_finalize(bmap);
8993 isl_basic_map_free(bmap);
8997 __isl_give isl_map *isl_map_reset(__isl_take isl_map *map,
8998 enum isl_dim_type type)
9005 if (!isl_space_is_named_or_nested(map->dim, type))
9008 map = isl_map_cow(map);
9012 for (i = 0; i < map->n; ++i) {
9013 map->p[i] = isl_basic_map_reset(map->p[i], type);
9017 map->dim = isl_space_reset(map->dim, type);
9027 __isl_give isl_basic_map *isl_basic_map_flatten(__isl_take isl_basic_map *bmap)
9032 if (!bmap->dim->nested[0] && !bmap->dim->nested[1])
9035 bmap = isl_basic_map_cow(bmap);
9039 bmap->dim = isl_space_flatten(bmap->dim);
9043 bmap = isl_basic_map_finalize(bmap);
9047 isl_basic_map_free(bmap);
9051 __isl_give isl_basic_set *isl_basic_set_flatten(__isl_take isl_basic_set *bset)
9053 return (isl_basic_set *)isl_basic_map_flatten((isl_basic_map *)bset);
9056 __isl_give isl_basic_map *isl_basic_map_flatten_domain(
9057 __isl_take isl_basic_map *bmap)
9062 if (!bmap->dim->nested[0])
9065 bmap = isl_basic_map_cow(bmap);
9069 bmap->dim = isl_space_flatten_domain(bmap->dim);
9073 bmap = isl_basic_map_finalize(bmap);
9077 isl_basic_map_free(bmap);
9081 __isl_give isl_basic_map *isl_basic_map_flatten_range(
9082 __isl_take isl_basic_map *bmap)
9087 if (!bmap->dim->nested[1])
9090 bmap = isl_basic_map_cow(bmap);
9094 bmap->dim = isl_space_flatten_range(bmap->dim);
9098 bmap = isl_basic_map_finalize(bmap);
9102 isl_basic_map_free(bmap);
9106 __isl_give isl_map *isl_map_flatten(__isl_take isl_map *map)
9113 if (!map->dim->nested[0] && !map->dim->nested[1])
9116 map = isl_map_cow(map);
9120 for (i = 0; i < map->n; ++i) {
9121 map->p[i] = isl_basic_map_flatten(map->p[i]);
9125 map->dim = isl_space_flatten(map->dim);
9135 __isl_give isl_set *isl_set_flatten(__isl_take isl_set *set)
9137 return (isl_set *)isl_map_flatten((isl_map *)set);
9140 __isl_give isl_map *isl_set_flatten_map(__isl_take isl_set *set)
9142 isl_space *dim, *flat_dim;
9145 dim = isl_set_get_space(set);
9146 flat_dim = isl_space_flatten(isl_space_copy(dim));
9147 map = isl_map_identity(isl_space_join(isl_space_reverse(dim), flat_dim));
9148 map = isl_map_intersect_domain(map, set);
9153 __isl_give isl_map *isl_map_flatten_domain(__isl_take isl_map *map)
9160 if (!map->dim->nested[0])
9163 map = isl_map_cow(map);
9167 for (i = 0; i < map->n; ++i) {
9168 map->p[i] = isl_basic_map_flatten_domain(map->p[i]);
9172 map->dim = isl_space_flatten_domain(map->dim);
9182 __isl_give isl_map *isl_map_flatten_range(__isl_take isl_map *map)
9189 if (!map->dim->nested[1])
9192 map = isl_map_cow(map);
9196 for (i = 0; i < map->n; ++i) {
9197 map->p[i] = isl_basic_map_flatten_range(map->p[i]);
9201 map->dim = isl_space_flatten_range(map->dim);
9211 /* Reorder the dimensions of "bmap" according to the given dim_map
9212 * and set the dimension specification to "dim".
9214 __isl_give isl_basic_map *isl_basic_map_realign(__isl_take isl_basic_map *bmap,
9215 __isl_take isl_space *dim, __isl_take struct isl_dim_map *dim_map)
9219 bmap = isl_basic_map_cow(bmap);
9220 if (!bmap || !dim || !dim_map)
9223 res = isl_basic_map_alloc_space(dim,
9224 bmap->n_div, bmap->n_eq, bmap->n_ineq);
9225 res = isl_basic_map_add_constraints_dim_map(res, bmap, dim_map);
9226 res = isl_basic_map_finalize(res);
9230 isl_basic_map_free(bmap);
9231 isl_space_free(dim);
9235 /* Reorder the dimensions of "map" according to given reordering.
9237 __isl_give isl_map *isl_map_realign(__isl_take isl_map *map,
9238 __isl_take isl_reordering *r)
9241 struct isl_dim_map *dim_map;
9243 map = isl_map_cow(map);
9244 dim_map = isl_dim_map_from_reordering(r);
9245 if (!map || !r || !dim_map)
9248 for (i = 0; i < map->n; ++i) {
9249 struct isl_dim_map *dim_map_i;
9251 dim_map_i = isl_dim_map_extend(dim_map, map->p[i]);
9253 map->p[i] = isl_basic_map_realign(map->p[i],
9254 isl_space_copy(r->dim), dim_map_i);
9260 map = isl_map_reset_space(map, isl_space_copy(r->dim));
9262 isl_reordering_free(r);
9268 isl_reordering_free(r);
9272 __isl_give isl_set *isl_set_realign(__isl_take isl_set *set,
9273 __isl_take isl_reordering *r)
9275 return (isl_set *)isl_map_realign((isl_map *)set, r);
9278 __isl_give isl_map *isl_map_align_params(__isl_take isl_map *map,
9279 __isl_take isl_space *model)
9286 ctx = isl_space_get_ctx(model);
9287 if (!isl_space_has_named_params(model))
9288 isl_die(ctx, isl_error_invalid,
9289 "model has unnamed parameters", goto error);
9290 if (!isl_space_has_named_params(map->dim))
9291 isl_die(ctx, isl_error_invalid,
9292 "relation has unnamed parameters", goto error);
9293 if (!isl_space_match(map->dim, isl_dim_param, model, isl_dim_param)) {
9294 isl_reordering *exp;
9296 model = isl_space_drop_dims(model, isl_dim_in,
9297 0, isl_space_dim(model, isl_dim_in));
9298 model = isl_space_drop_dims(model, isl_dim_out,
9299 0, isl_space_dim(model, isl_dim_out));
9300 exp = isl_parameter_alignment_reordering(map->dim, model);
9301 exp = isl_reordering_extend_space(exp, isl_map_get_space(map));
9302 map = isl_map_realign(map, exp);
9305 isl_space_free(model);
9308 isl_space_free(model);
9313 __isl_give isl_set *isl_set_align_params(__isl_take isl_set *set,
9314 __isl_take isl_space *model)
9316 return isl_map_align_params(set, model);
9319 __isl_give isl_mat *isl_basic_map_equalities_matrix(
9320 __isl_keep isl_basic_map *bmap, enum isl_dim_type c1,
9321 enum isl_dim_type c2, enum isl_dim_type c3,
9322 enum isl_dim_type c4, enum isl_dim_type c5)
9324 enum isl_dim_type c[5] = { c1, c2, c3, c4, c5 };
9325 struct isl_mat *mat;
9331 mat = isl_mat_alloc(bmap->ctx, bmap->n_eq,
9332 isl_basic_map_total_dim(bmap) + 1);
9335 for (i = 0; i < bmap->n_eq; ++i)
9336 for (j = 0, pos = 0; j < 5; ++j) {
9337 int off = isl_basic_map_offset(bmap, c[j]);
9338 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
9339 isl_int_set(mat->row[i][pos],
9340 bmap->eq[i][off + k]);
9348 __isl_give isl_mat *isl_basic_map_inequalities_matrix(
9349 __isl_keep isl_basic_map *bmap, enum isl_dim_type c1,
9350 enum isl_dim_type c2, enum isl_dim_type c3,
9351 enum isl_dim_type c4, enum isl_dim_type c5)
9353 enum isl_dim_type c[5] = { c1, c2, c3, c4, c5 };
9354 struct isl_mat *mat;
9360 mat = isl_mat_alloc(bmap->ctx, bmap->n_ineq,
9361 isl_basic_map_total_dim(bmap) + 1);
9364 for (i = 0; i < bmap->n_ineq; ++i)
9365 for (j = 0, pos = 0; j < 5; ++j) {
9366 int off = isl_basic_map_offset(bmap, c[j]);
9367 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
9368 isl_int_set(mat->row[i][pos],
9369 bmap->ineq[i][off + k]);
9377 __isl_give isl_basic_map *isl_basic_map_from_constraint_matrices(
9378 __isl_take isl_space *dim,
9379 __isl_take isl_mat *eq, __isl_take isl_mat *ineq, enum isl_dim_type c1,
9380 enum isl_dim_type c2, enum isl_dim_type c3,
9381 enum isl_dim_type c4, enum isl_dim_type c5)
9383 enum isl_dim_type c[5] = { c1, c2, c3, c4, c5 };
9384 isl_basic_map *bmap;
9390 if (!dim || !eq || !ineq)
9393 if (eq->n_col != ineq->n_col)
9394 isl_die(dim->ctx, isl_error_invalid,
9395 "equalities and inequalities matrices should have "
9396 "same number of columns", goto error);
9398 total = 1 + isl_space_dim(dim, isl_dim_all);
9400 if (eq->n_col < total)
9401 isl_die(dim->ctx, isl_error_invalid,
9402 "number of columns too small", goto error);
9404 extra = eq->n_col - total;
9406 bmap = isl_basic_map_alloc_space(isl_space_copy(dim), extra,
9407 eq->n_row, ineq->n_row);
9410 for (i = 0; i < extra; ++i) {
9411 k = isl_basic_map_alloc_div(bmap);
9414 isl_int_set_si(bmap->div[k][0], 0);
9416 for (i = 0; i < eq->n_row; ++i) {
9417 l = isl_basic_map_alloc_equality(bmap);
9420 for (j = 0, pos = 0; j < 5; ++j) {
9421 int off = isl_basic_map_offset(bmap, c[j]);
9422 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
9423 isl_int_set(bmap->eq[l][off + k],
9429 for (i = 0; i < ineq->n_row; ++i) {
9430 l = isl_basic_map_alloc_inequality(bmap);
9433 for (j = 0, pos = 0; j < 5; ++j) {
9434 int off = isl_basic_map_offset(bmap, c[j]);
9435 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
9436 isl_int_set(bmap->ineq[l][off + k],
9443 isl_space_free(dim);
9449 isl_space_free(dim);
9455 __isl_give isl_mat *isl_basic_set_equalities_matrix(
9456 __isl_keep isl_basic_set *bset, enum isl_dim_type c1,
9457 enum isl_dim_type c2, enum isl_dim_type c3, enum isl_dim_type c4)
9459 return isl_basic_map_equalities_matrix((isl_basic_map *)bset,
9460 c1, c2, c3, c4, isl_dim_in);
9463 __isl_give isl_mat *isl_basic_set_inequalities_matrix(
9464 __isl_keep isl_basic_set *bset, enum isl_dim_type c1,
9465 enum isl_dim_type c2, enum isl_dim_type c3, enum isl_dim_type c4)
9467 return isl_basic_map_inequalities_matrix((isl_basic_map *)bset,
9468 c1, c2, c3, c4, isl_dim_in);
9471 __isl_give isl_basic_set *isl_basic_set_from_constraint_matrices(
9472 __isl_take isl_space *dim,
9473 __isl_take isl_mat *eq, __isl_take isl_mat *ineq, enum isl_dim_type c1,
9474 enum isl_dim_type c2, enum isl_dim_type c3, enum isl_dim_type c4)
9476 return (isl_basic_set*)
9477 isl_basic_map_from_constraint_matrices(dim, eq, ineq,
9478 c1, c2, c3, c4, isl_dim_in);
9481 int isl_basic_map_can_zip(__isl_keep isl_basic_map *bmap)
9486 return isl_space_can_zip(bmap->dim);
9489 int isl_map_can_zip(__isl_keep isl_map *map)
9494 return isl_space_can_zip(map->dim);
9497 /* Given a basic map (A -> B) -> (C -> D), return the corresponding basic map
9498 * (A -> C) -> (B -> D).
9500 __isl_give isl_basic_map *isl_basic_map_zip(__isl_take isl_basic_map *bmap)
9509 if (!isl_basic_map_can_zip(bmap))
9510 isl_die(bmap->ctx, isl_error_invalid,
9511 "basic map cannot be zipped", goto error);
9512 pos = isl_basic_map_offset(bmap, isl_dim_in) +
9513 isl_space_dim(bmap->dim->nested[0], isl_dim_in);
9514 n1 = isl_space_dim(bmap->dim->nested[0], isl_dim_out);
9515 n2 = isl_space_dim(bmap->dim->nested[1], isl_dim_in);
9516 bmap = isl_basic_map_swap_vars(bmap, pos, n1, n2);
9519 bmap->dim = isl_space_zip(bmap->dim);
9524 isl_basic_map_free(bmap);
9528 /* Given a map (A -> B) -> (C -> D), return the corresponding map
9529 * (A -> C) -> (B -> D).
9531 __isl_give isl_map *isl_map_zip(__isl_take isl_map *map)
9538 if (!isl_map_can_zip(map))
9539 isl_die(map->ctx, isl_error_invalid, "map cannot be zipped",
9542 map = isl_map_cow(map);
9546 for (i = 0; i < map->n; ++i) {
9547 map->p[i] = isl_basic_map_zip(map->p[i]);
9552 map->dim = isl_space_zip(map->dim);
9562 /* Construct a basic map mapping the domain of the affine expression
9563 * to a one-dimensional range prescribed by the affine expression.
9565 __isl_give isl_basic_map *isl_basic_map_from_aff(__isl_take isl_aff *aff)
9569 isl_local_space *ls;
9570 isl_basic_map *bmap;
9575 ls = isl_aff_get_local_space(aff);
9576 bmap = isl_basic_map_from_local_space(ls);
9577 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
9578 k = isl_basic_map_alloc_equality(bmap);
9582 pos = isl_basic_map_offset(bmap, isl_dim_out);
9583 isl_seq_cpy(bmap->eq[k], aff->v->el + 1, pos);
9584 isl_int_neg(bmap->eq[k][pos], aff->v->el[0]);
9585 isl_seq_cpy(bmap->eq[k] + pos + 1, aff->v->el + 1 + pos,
9586 aff->v->size - (pos + 1));
9589 bmap = isl_basic_map_finalize(bmap);
9593 isl_basic_map_free(bmap);
9597 /* Construct a basic map mapping a domain in the given space to
9598 * to an n-dimensional range, with n the number of elements in the list,
9599 * where each coordinate in the range is prescribed by the
9600 * corresponding affine expression.
9601 * The domains of all affine expressions in the list are assumed to match
9604 __isl_give isl_basic_map *isl_basic_map_from_aff_list(
9605 __isl_take isl_space *domain_dim, __isl_take isl_aff_list *list)
9609 isl_basic_map *bmap;
9614 dim = isl_space_from_domain(domain_dim);
9615 bmap = isl_basic_map_universe(dim);
9617 for (i = 0; i < list->n; ++i) {
9619 isl_basic_map *bmap_i;
9621 aff = isl_aff_copy(list->p[i]);
9622 bmap_i = isl_basic_map_from_aff(aff);
9624 bmap = isl_basic_map_flat_range_product(bmap, bmap_i);
9627 isl_aff_list_free(list);
9631 __isl_give isl_set *isl_set_equate(__isl_take isl_set *set,
9632 enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2)
9634 return isl_map_equate(set, type1, pos1, type2, pos2);
9637 /* Add a constraint imposing that the given two dimensions are equal.
9639 __isl_give isl_map *isl_map_equate(__isl_take isl_map *map,
9640 enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2)
9642 isl_basic_map *bmap = NULL;
9648 if (pos1 >= isl_map_dim(map, type1))
9649 isl_die(map->ctx, isl_error_invalid,
9650 "index out of bounds", goto error);
9651 if (pos2 >= isl_map_dim(map, type2))
9652 isl_die(map->ctx, isl_error_invalid,
9653 "index out of bounds", goto error);
9655 bmap = isl_basic_map_alloc_space(isl_map_get_space(map), 0, 1, 0);
9656 i = isl_basic_map_alloc_equality(bmap);
9659 isl_seq_clr(bmap->eq[i], 1 + isl_basic_map_total_dim(bmap));
9660 pos1 += isl_basic_map_offset(bmap, type1);
9661 pos2 += isl_basic_map_offset(bmap, type2);
9662 isl_int_set_si(bmap->eq[i][pos1], -1);
9663 isl_int_set_si(bmap->eq[i][pos2], 1);
9664 bmap = isl_basic_map_finalize(bmap);
9666 map = isl_map_intersect(map, isl_map_from_basic_map(bmap));
9670 isl_basic_map_free(bmap);
9675 /* Add a constraint imposing that the given two dimensions have opposite values.
9677 __isl_give isl_map *isl_map_oppose(__isl_take isl_map *map,
9678 enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2)
9680 isl_basic_map *bmap = NULL;
9686 if (pos1 >= isl_map_dim(map, type1))
9687 isl_die(map->ctx, isl_error_invalid,
9688 "index out of bounds", goto error);
9689 if (pos2 >= isl_map_dim(map, type2))
9690 isl_die(map->ctx, isl_error_invalid,
9691 "index out of bounds", goto error);
9693 bmap = isl_basic_map_alloc_space(isl_map_get_space(map), 0, 1, 0);
9694 i = isl_basic_map_alloc_equality(bmap);
9697 isl_seq_clr(bmap->eq[i], 1 + isl_basic_map_total_dim(bmap));
9698 pos1 += isl_basic_map_offset(bmap, type1);
9699 pos2 += isl_basic_map_offset(bmap, type2);
9700 isl_int_set_si(bmap->eq[i][pos1], 1);
9701 isl_int_set_si(bmap->eq[i][pos2], 1);
9702 bmap = isl_basic_map_finalize(bmap);
9704 map = isl_map_intersect(map, isl_map_from_basic_map(bmap));
9708 isl_basic_map_free(bmap);
9713 __isl_give isl_aff *isl_basic_map_get_div(__isl_keep isl_basic_map *bmap,
9717 isl_local_space *ls;
9722 if (!isl_basic_map_divs_known(bmap))
9723 isl_die(isl_basic_map_get_ctx(bmap), isl_error_invalid,
9724 "some divs are unknown", return NULL);
9726 ls = isl_basic_map_get_local_space(bmap);
9727 div = isl_local_space_get_div(ls, pos);
9728 isl_local_space_free(ls);
9733 __isl_give isl_aff *isl_basic_set_get_div(__isl_keep isl_basic_set *bset,
9736 return isl_basic_map_get_div(bset, pos);