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_basic_map_is_rational(__isl_keep isl_basic_map *bmap)
604 return ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL);
607 int isl_basic_set_is_rational(__isl_keep isl_basic_set *bset)
609 return isl_basic_map_is_rational(bset);
612 /* Is this basic set a parameter domain?
614 int isl_basic_set_is_params(__isl_keep isl_basic_set *bset)
618 return isl_space_is_params(bset->dim);
621 /* Is this set a parameter domain?
623 int isl_set_is_params(__isl_keep isl_set *set)
627 return isl_space_is_params(set->dim);
630 /* Is this map actually a parameter domain?
631 * Users should never call this function. Outside of isl,
632 * a map can never be a parameter domain.
634 int isl_map_is_params(__isl_keep isl_map *map)
638 return isl_space_is_params(map->dim);
641 static struct isl_basic_map *basic_map_init(struct isl_ctx *ctx,
642 struct isl_basic_map *bmap, unsigned extra,
643 unsigned n_eq, unsigned n_ineq)
646 size_t row_size = 1 + isl_space_dim(bmap->dim, isl_dim_all) + extra;
651 bmap->block = isl_blk_alloc(ctx, (n_ineq + n_eq) * row_size);
652 if (isl_blk_is_error(bmap->block))
655 bmap->ineq = isl_alloc_array(ctx, isl_int *, n_ineq + n_eq);
660 bmap->block2 = isl_blk_empty();
663 bmap->block2 = isl_blk_alloc(ctx, extra * (1 + row_size));
664 if (isl_blk_is_error(bmap->block2))
667 bmap->div = isl_alloc_array(ctx, isl_int *, extra);
672 for (i = 0; i < n_ineq + n_eq; ++i)
673 bmap->ineq[i] = bmap->block.data + i * row_size;
675 for (i = 0; i < extra; ++i)
676 bmap->div[i] = bmap->block2.data + i * (1 + row_size);
680 bmap->c_size = n_eq + n_ineq;
681 bmap->eq = bmap->ineq + n_ineq;
690 isl_basic_map_free(bmap);
694 struct isl_basic_set *isl_basic_set_alloc(struct isl_ctx *ctx,
695 unsigned nparam, unsigned dim, unsigned extra,
696 unsigned n_eq, unsigned n_ineq)
698 struct isl_basic_map *bmap;
701 space = isl_space_set_alloc(ctx, nparam, dim);
705 bmap = isl_basic_map_alloc_space(space, extra, n_eq, n_ineq);
706 return (struct isl_basic_set *)bmap;
709 struct isl_basic_set *isl_basic_set_alloc_space(__isl_take isl_space *dim,
710 unsigned extra, unsigned n_eq, unsigned n_ineq)
712 struct isl_basic_map *bmap;
715 isl_assert(dim->ctx, dim->n_in == 0, goto error);
716 bmap = isl_basic_map_alloc_space(dim, extra, n_eq, n_ineq);
717 return (struct isl_basic_set *)bmap;
723 struct isl_basic_map *isl_basic_map_alloc_space(__isl_take isl_space *dim,
724 unsigned extra, unsigned n_eq, unsigned n_ineq)
726 struct isl_basic_map *bmap;
730 bmap = isl_calloc_type(dim->ctx, struct isl_basic_map);
735 return basic_map_init(dim->ctx, bmap, extra, n_eq, n_ineq);
741 struct isl_basic_map *isl_basic_map_alloc(struct isl_ctx *ctx,
742 unsigned nparam, unsigned in, unsigned out, unsigned extra,
743 unsigned n_eq, unsigned n_ineq)
745 struct isl_basic_map *bmap;
748 dim = isl_space_alloc(ctx, nparam, in, out);
752 bmap = isl_basic_map_alloc_space(dim, extra, n_eq, n_ineq);
756 static void dup_constraints(
757 struct isl_basic_map *dst, struct isl_basic_map *src)
760 unsigned total = isl_basic_map_total_dim(src);
762 for (i = 0; i < src->n_eq; ++i) {
763 int j = isl_basic_map_alloc_equality(dst);
764 isl_seq_cpy(dst->eq[j], src->eq[i], 1+total);
767 for (i = 0; i < src->n_ineq; ++i) {
768 int j = isl_basic_map_alloc_inequality(dst);
769 isl_seq_cpy(dst->ineq[j], src->ineq[i], 1+total);
772 for (i = 0; i < src->n_div; ++i) {
773 int j = isl_basic_map_alloc_div(dst);
774 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total);
776 ISL_F_SET(dst, ISL_BASIC_SET_FINAL);
779 struct isl_basic_map *isl_basic_map_dup(struct isl_basic_map *bmap)
781 struct isl_basic_map *dup;
785 dup = isl_basic_map_alloc_space(isl_space_copy(bmap->dim),
786 bmap->n_div, bmap->n_eq, bmap->n_ineq);
789 dup_constraints(dup, bmap);
790 dup->flags = bmap->flags;
791 dup->sample = isl_vec_copy(bmap->sample);
795 struct isl_basic_set *isl_basic_set_dup(struct isl_basic_set *bset)
797 struct isl_basic_map *dup;
799 dup = isl_basic_map_dup((struct isl_basic_map *)bset);
800 return (struct isl_basic_set *)dup;
803 struct isl_basic_set *isl_basic_set_copy(struct isl_basic_set *bset)
808 if (ISL_F_ISSET(bset, ISL_BASIC_SET_FINAL)) {
812 return isl_basic_set_dup(bset);
815 struct isl_set *isl_set_copy(struct isl_set *set)
824 struct isl_basic_map *isl_basic_map_copy(struct isl_basic_map *bmap)
829 if (ISL_F_ISSET(bmap, ISL_BASIC_SET_FINAL)) {
833 bmap = isl_basic_map_dup(bmap);
835 ISL_F_SET(bmap, ISL_BASIC_SET_FINAL);
839 struct isl_map *isl_map_copy(struct isl_map *map)
848 void isl_basic_map_free(struct isl_basic_map *bmap)
856 isl_ctx_deref(bmap->ctx);
858 isl_blk_free(bmap->ctx, bmap->block2);
860 isl_blk_free(bmap->ctx, bmap->block);
861 isl_vec_free(bmap->sample);
862 isl_space_free(bmap->dim);
866 void isl_basic_set_free(struct isl_basic_set *bset)
868 isl_basic_map_free((struct isl_basic_map *)bset);
871 static int room_for_con(struct isl_basic_map *bmap, unsigned n)
873 return bmap->n_eq + bmap->n_ineq + n <= bmap->c_size;
876 __isl_give isl_map *isl_map_align_params_map_map_and(
877 __isl_take isl_map *map1, __isl_take isl_map *map2,
878 __isl_give isl_map *(*fn)(__isl_take isl_map *map1,
879 __isl_take isl_map *map2))
883 if (isl_space_match(map1->dim, isl_dim_param, map2->dim, isl_dim_param))
884 return fn(map1, map2);
885 if (!isl_space_has_named_params(map1->dim) ||
886 !isl_space_has_named_params(map2->dim))
887 isl_die(map1->ctx, isl_error_invalid,
888 "unaligned unnamed parameters", goto error);
889 map1 = isl_map_align_params(map1, isl_map_get_space(map2));
890 map2 = isl_map_align_params(map2, isl_map_get_space(map1));
891 return fn(map1, map2);
898 static int align_params_map_map_and_test(__isl_keep isl_map *map1,
899 __isl_keep isl_map *map2,
900 int (*fn)(__isl_keep isl_map *map1, __isl_keep isl_map *map2))
906 if (isl_space_match(map1->dim, isl_dim_param, map2->dim, isl_dim_param))
907 return fn(map1, map2);
908 if (!isl_space_has_named_params(map1->dim) ||
909 !isl_space_has_named_params(map2->dim))
910 isl_die(map1->ctx, isl_error_invalid,
911 "unaligned unnamed parameters", return -1);
912 map1 = isl_map_copy(map1);
913 map2 = isl_map_copy(map2);
914 map1 = isl_map_align_params(map1, isl_map_get_space(map2));
915 map2 = isl_map_align_params(map2, isl_map_get_space(map1));
922 int isl_basic_map_alloc_equality(struct isl_basic_map *bmap)
928 isl_assert(ctx, room_for_con(bmap, 1), return -1);
929 isl_assert(ctx, (bmap->eq - bmap->ineq) + bmap->n_eq <= bmap->c_size,
931 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
932 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
933 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_IMPLICIT);
934 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
935 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
936 if ((bmap->eq - bmap->ineq) + bmap->n_eq == bmap->c_size) {
938 int j = isl_basic_map_alloc_inequality(bmap);
942 bmap->ineq[j] = bmap->ineq[bmap->n_ineq - 1];
943 bmap->ineq[bmap->n_ineq - 1] = bmap->eq[-1];
950 isl_seq_clr(bmap->eq[bmap->n_eq] + 1 + isl_basic_map_total_dim(bmap),
951 bmap->extra - bmap->n_div);
955 int isl_basic_set_alloc_equality(struct isl_basic_set *bset)
957 return isl_basic_map_alloc_equality((struct isl_basic_map *)bset);
960 int isl_basic_map_free_equality(struct isl_basic_map *bmap, unsigned n)
964 isl_assert(bmap->ctx, n <= bmap->n_eq, return -1);
969 int isl_basic_set_free_equality(struct isl_basic_set *bset, unsigned n)
971 return isl_basic_map_free_equality((struct isl_basic_map *)bset, n);
974 int isl_basic_map_drop_equality(struct isl_basic_map *bmap, unsigned pos)
979 isl_assert(bmap->ctx, pos < bmap->n_eq, return -1);
981 if (pos != bmap->n_eq - 1) {
983 bmap->eq[pos] = bmap->eq[bmap->n_eq - 1];
984 bmap->eq[bmap->n_eq - 1] = t;
990 int isl_basic_set_drop_equality(struct isl_basic_set *bset, unsigned pos)
992 return isl_basic_map_drop_equality((struct isl_basic_map *)bset, pos);
995 void isl_basic_map_inequality_to_equality(
996 struct isl_basic_map *bmap, unsigned pos)
1000 t = bmap->ineq[pos];
1001 bmap->ineq[pos] = bmap->ineq[bmap->n_ineq - 1];
1002 bmap->ineq[bmap->n_ineq - 1] = bmap->eq[-1];
1007 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
1008 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1009 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
1010 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
1013 static int room_for_ineq(struct isl_basic_map *bmap, unsigned n)
1015 return bmap->n_ineq + n <= bmap->eq - bmap->ineq;
1018 int isl_basic_map_alloc_inequality(struct isl_basic_map *bmap)
1020 struct isl_ctx *ctx;
1024 isl_assert(ctx, room_for_ineq(bmap, 1), return -1);
1025 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_IMPLICIT);
1026 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
1027 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1028 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
1029 isl_seq_clr(bmap->ineq[bmap->n_ineq] +
1030 1 + isl_basic_map_total_dim(bmap),
1031 bmap->extra - bmap->n_div);
1032 return bmap->n_ineq++;
1035 int isl_basic_set_alloc_inequality(struct isl_basic_set *bset)
1037 return isl_basic_map_alloc_inequality((struct isl_basic_map *)bset);
1040 int isl_basic_map_free_inequality(struct isl_basic_map *bmap, unsigned n)
1044 isl_assert(bmap->ctx, n <= bmap->n_ineq, return -1);
1049 int isl_basic_set_free_inequality(struct isl_basic_set *bset, unsigned n)
1051 return isl_basic_map_free_inequality((struct isl_basic_map *)bset, n);
1054 int isl_basic_map_drop_inequality(struct isl_basic_map *bmap, unsigned pos)
1059 isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
1061 if (pos != bmap->n_ineq - 1) {
1062 t = bmap->ineq[pos];
1063 bmap->ineq[pos] = bmap->ineq[bmap->n_ineq - 1];
1064 bmap->ineq[bmap->n_ineq - 1] = t;
1065 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1071 int isl_basic_set_drop_inequality(struct isl_basic_set *bset, unsigned pos)
1073 return isl_basic_map_drop_inequality((struct isl_basic_map *)bset, pos);
1076 __isl_give isl_basic_map *isl_basic_map_add_eq(__isl_take isl_basic_map *bmap,
1081 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
1084 k = isl_basic_map_alloc_equality(bmap);
1087 isl_seq_cpy(bmap->eq[k], eq, 1 + isl_basic_map_total_dim(bmap));
1090 isl_basic_map_free(bmap);
1094 __isl_give isl_basic_set *isl_basic_set_add_eq(__isl_take isl_basic_set *bset,
1097 return (isl_basic_set *)
1098 isl_basic_map_add_eq((isl_basic_map *)bset, eq);
1101 __isl_give isl_basic_map *isl_basic_map_add_ineq(__isl_take isl_basic_map *bmap,
1106 bmap = isl_basic_map_extend_constraints(bmap, 0, 1);
1109 k = isl_basic_map_alloc_inequality(bmap);
1112 isl_seq_cpy(bmap->ineq[k], ineq, 1 + isl_basic_map_total_dim(bmap));
1115 isl_basic_map_free(bmap);
1119 __isl_give isl_basic_set *isl_basic_set_add_ineq(__isl_take isl_basic_set *bset,
1122 return (isl_basic_set *)
1123 isl_basic_map_add_ineq((isl_basic_map *)bset, ineq);
1126 int isl_basic_map_alloc_div(struct isl_basic_map *bmap)
1130 isl_assert(bmap->ctx, bmap->n_div < bmap->extra, return -1);
1131 isl_seq_clr(bmap->div[bmap->n_div] +
1132 1 + 1 + isl_basic_map_total_dim(bmap),
1133 bmap->extra - bmap->n_div);
1134 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
1135 return bmap->n_div++;
1138 int isl_basic_set_alloc_div(struct isl_basic_set *bset)
1140 return isl_basic_map_alloc_div((struct isl_basic_map *)bset);
1143 int isl_basic_map_free_div(struct isl_basic_map *bmap, unsigned n)
1147 isl_assert(bmap->ctx, n <= bmap->n_div, return -1);
1152 int isl_basic_set_free_div(struct isl_basic_set *bset, unsigned n)
1154 return isl_basic_map_free_div((struct isl_basic_map *)bset, n);
1157 /* Copy constraint from src to dst, putting the vars of src at offset
1158 * dim_off in dst and the divs of src at offset div_off in dst.
1159 * If both sets are actually map, then dim_off applies to the input
1162 static void copy_constraint(struct isl_basic_map *dst_map, isl_int *dst,
1163 struct isl_basic_map *src_map, isl_int *src,
1164 unsigned in_off, unsigned out_off, unsigned div_off)
1166 unsigned src_nparam = isl_basic_map_n_param(src_map);
1167 unsigned dst_nparam = isl_basic_map_n_param(dst_map);
1168 unsigned src_in = isl_basic_map_n_in(src_map);
1169 unsigned dst_in = isl_basic_map_n_in(dst_map);
1170 unsigned src_out = isl_basic_map_n_out(src_map);
1171 unsigned dst_out = isl_basic_map_n_out(dst_map);
1172 isl_int_set(dst[0], src[0]);
1173 isl_seq_cpy(dst+1, src+1, isl_min(dst_nparam, src_nparam));
1174 if (dst_nparam > src_nparam)
1175 isl_seq_clr(dst+1+src_nparam,
1176 dst_nparam - src_nparam);
1177 isl_seq_clr(dst+1+dst_nparam, in_off);
1178 isl_seq_cpy(dst+1+dst_nparam+in_off,
1180 isl_min(dst_in-in_off, src_in));
1181 if (dst_in-in_off > src_in)
1182 isl_seq_clr(dst+1+dst_nparam+in_off+src_in,
1183 dst_in - in_off - src_in);
1184 isl_seq_clr(dst+1+dst_nparam+dst_in, out_off);
1185 isl_seq_cpy(dst+1+dst_nparam+dst_in+out_off,
1186 src+1+src_nparam+src_in,
1187 isl_min(dst_out-out_off, src_out));
1188 if (dst_out-out_off > src_out)
1189 isl_seq_clr(dst+1+dst_nparam+dst_in+out_off+src_out,
1190 dst_out - out_off - src_out);
1191 isl_seq_clr(dst+1+dst_nparam+dst_in+dst_out, div_off);
1192 isl_seq_cpy(dst+1+dst_nparam+dst_in+dst_out+div_off,
1193 src+1+src_nparam+src_in+src_out,
1194 isl_min(dst_map->extra-div_off, src_map->n_div));
1195 if (dst_map->n_div-div_off > src_map->n_div)
1196 isl_seq_clr(dst+1+dst_nparam+dst_in+dst_out+
1197 div_off+src_map->n_div,
1198 dst_map->n_div - div_off - src_map->n_div);
1201 static void copy_div(struct isl_basic_map *dst_map, isl_int *dst,
1202 struct isl_basic_map *src_map, isl_int *src,
1203 unsigned in_off, unsigned out_off, unsigned div_off)
1205 isl_int_set(dst[0], src[0]);
1206 copy_constraint(dst_map, dst+1, src_map, src+1, in_off, out_off, div_off);
1209 static struct isl_basic_map *add_constraints(struct isl_basic_map *bmap1,
1210 struct isl_basic_map *bmap2, unsigned i_pos, unsigned o_pos)
1215 if (!bmap1 || !bmap2)
1218 div_off = bmap1->n_div;
1220 for (i = 0; i < bmap2->n_eq; ++i) {
1221 int i1 = isl_basic_map_alloc_equality(bmap1);
1224 copy_constraint(bmap1, bmap1->eq[i1], bmap2, bmap2->eq[i],
1225 i_pos, o_pos, div_off);
1228 for (i = 0; i < bmap2->n_ineq; ++i) {
1229 int i1 = isl_basic_map_alloc_inequality(bmap1);
1232 copy_constraint(bmap1, bmap1->ineq[i1], bmap2, bmap2->ineq[i],
1233 i_pos, o_pos, div_off);
1236 for (i = 0; i < bmap2->n_div; ++i) {
1237 int i1 = isl_basic_map_alloc_div(bmap1);
1240 copy_div(bmap1, bmap1->div[i1], bmap2, bmap2->div[i],
1241 i_pos, o_pos, div_off);
1244 isl_basic_map_free(bmap2);
1249 isl_basic_map_free(bmap1);
1250 isl_basic_map_free(bmap2);
1254 struct isl_basic_set *isl_basic_set_add_constraints(struct isl_basic_set *bset1,
1255 struct isl_basic_set *bset2, unsigned pos)
1257 return (struct isl_basic_set *)
1258 add_constraints((struct isl_basic_map *)bset1,
1259 (struct isl_basic_map *)bset2, 0, pos);
1262 struct isl_basic_map *isl_basic_map_extend_space(struct isl_basic_map *base,
1263 __isl_take isl_space *dim, unsigned extra,
1264 unsigned n_eq, unsigned n_ineq)
1266 struct isl_basic_map *ext;
1276 dims_ok = isl_space_is_equal(base->dim, dim) &&
1277 base->extra >= base->n_div + extra;
1279 if (dims_ok && room_for_con(base, n_eq + n_ineq) &&
1280 room_for_ineq(base, n_ineq)) {
1281 isl_space_free(dim);
1285 isl_assert(base->ctx, base->dim->nparam <= dim->nparam, goto error);
1286 isl_assert(base->ctx, base->dim->n_in <= dim->n_in, goto error);
1287 isl_assert(base->ctx, base->dim->n_out <= dim->n_out, goto error);
1288 extra += base->extra;
1290 n_ineq += base->n_ineq;
1292 ext = isl_basic_map_alloc_space(dim, extra, n_eq, n_ineq);
1298 ext->sample = isl_vec_copy(base->sample);
1299 flags = base->flags;
1300 ext = add_constraints(ext, base, 0, 0);
1303 ISL_F_CLR(ext, ISL_BASIC_SET_FINAL);
1309 isl_space_free(dim);
1310 isl_basic_map_free(base);
1314 struct isl_basic_set *isl_basic_set_extend_space(struct isl_basic_set *base,
1315 __isl_take isl_space *dim, unsigned extra,
1316 unsigned n_eq, unsigned n_ineq)
1318 return (struct isl_basic_set *)
1319 isl_basic_map_extend_space((struct isl_basic_map *)base, dim,
1320 extra, n_eq, n_ineq);
1323 struct isl_basic_map *isl_basic_map_extend_constraints(
1324 struct isl_basic_map *base, unsigned n_eq, unsigned n_ineq)
1328 return isl_basic_map_extend_space(base, isl_space_copy(base->dim),
1332 struct isl_basic_map *isl_basic_map_extend(struct isl_basic_map *base,
1333 unsigned nparam, unsigned n_in, unsigned n_out, unsigned extra,
1334 unsigned n_eq, unsigned n_ineq)
1336 struct isl_basic_map *bmap;
1341 dim = isl_space_alloc(base->ctx, nparam, n_in, n_out);
1345 bmap = isl_basic_map_extend_space(base, dim, extra, n_eq, n_ineq);
1348 isl_basic_map_free(base);
1352 struct isl_basic_set *isl_basic_set_extend(struct isl_basic_set *base,
1353 unsigned nparam, unsigned dim, unsigned extra,
1354 unsigned n_eq, unsigned n_ineq)
1356 return (struct isl_basic_set *)
1357 isl_basic_map_extend((struct isl_basic_map *)base,
1358 nparam, 0, dim, extra, n_eq, n_ineq);
1361 struct isl_basic_set *isl_basic_set_extend_constraints(
1362 struct isl_basic_set *base, unsigned n_eq, unsigned n_ineq)
1364 return (struct isl_basic_set *)
1365 isl_basic_map_extend_constraints((struct isl_basic_map *)base,
1369 struct isl_basic_set *isl_basic_set_cow(struct isl_basic_set *bset)
1371 return (struct isl_basic_set *)
1372 isl_basic_map_cow((struct isl_basic_map *)bset);
1375 struct isl_basic_map *isl_basic_map_cow(struct isl_basic_map *bmap)
1380 if (bmap->ref > 1) {
1382 bmap = isl_basic_map_dup(bmap);
1385 ISL_F_CLR(bmap, ISL_BASIC_SET_FINAL);
1389 struct isl_set *isl_set_cow(struct isl_set *set)
1397 return isl_set_dup(set);
1400 struct isl_map *isl_map_cow(struct isl_map *map)
1408 return isl_map_dup(map);
1411 static void swap_vars(struct isl_blk blk, isl_int *a,
1412 unsigned a_len, unsigned b_len)
1414 isl_seq_cpy(blk.data, a+a_len, b_len);
1415 isl_seq_cpy(blk.data+b_len, a, a_len);
1416 isl_seq_cpy(a, blk.data, b_len+a_len);
1419 static __isl_give isl_basic_map *isl_basic_map_swap_vars(
1420 __isl_take isl_basic_map *bmap, unsigned pos, unsigned n1, unsigned n2)
1428 isl_assert(bmap->ctx,
1429 pos + n1 + n2 <= 1 + isl_basic_map_total_dim(bmap), goto error);
1431 if (n1 == 0 || n2 == 0)
1434 bmap = isl_basic_map_cow(bmap);
1438 blk = isl_blk_alloc(bmap->ctx, n1 + n2);
1439 if (isl_blk_is_error(blk))
1442 for (i = 0; i < bmap->n_eq; ++i)
1444 bmap->eq[i] + pos, n1, n2);
1446 for (i = 0; i < bmap->n_ineq; ++i)
1448 bmap->ineq[i] + pos, n1, n2);
1450 for (i = 0; i < bmap->n_div; ++i)
1452 bmap->div[i]+1 + pos, n1, n2);
1454 isl_blk_free(bmap->ctx, blk);
1456 ISL_F_CLR(bmap, ISL_BASIC_SET_NORMALIZED);
1457 bmap = isl_basic_map_gauss(bmap, NULL);
1458 return isl_basic_map_finalize(bmap);
1460 isl_basic_map_free(bmap);
1464 static __isl_give isl_basic_set *isl_basic_set_swap_vars(
1465 __isl_take isl_basic_set *bset, unsigned n)
1470 nparam = isl_basic_set_n_param(bset);
1471 dim = isl_basic_set_n_dim(bset);
1472 isl_assert(bset->ctx, n <= dim, goto error);
1474 return isl_basic_map_swap_vars(bset, 1 + nparam, n, dim - n);
1476 isl_basic_set_free(bset);
1480 struct isl_basic_map *isl_basic_map_set_to_empty(struct isl_basic_map *bmap)
1486 total = isl_basic_map_total_dim(bmap);
1487 isl_basic_map_free_div(bmap, bmap->n_div);
1488 isl_basic_map_free_inequality(bmap, bmap->n_ineq);
1490 isl_basic_map_free_equality(bmap, bmap->n_eq-1);
1492 i = isl_basic_map_alloc_equality(bmap);
1496 isl_int_set_si(bmap->eq[i][0], 1);
1497 isl_seq_clr(bmap->eq[i]+1, total);
1498 ISL_F_SET(bmap, ISL_BASIC_MAP_EMPTY);
1499 isl_vec_free(bmap->sample);
1500 bmap->sample = NULL;
1501 return isl_basic_map_finalize(bmap);
1503 isl_basic_map_free(bmap);
1507 struct isl_basic_set *isl_basic_set_set_to_empty(struct isl_basic_set *bset)
1509 return (struct isl_basic_set *)
1510 isl_basic_map_set_to_empty((struct isl_basic_map *)bset);
1513 void isl_basic_map_swap_div(struct isl_basic_map *bmap, int a, int b)
1516 unsigned off = isl_space_dim(bmap->dim, isl_dim_all);
1517 isl_int *t = bmap->div[a];
1518 bmap->div[a] = bmap->div[b];
1521 for (i = 0; i < bmap->n_eq; ++i)
1522 isl_int_swap(bmap->eq[i][1+off+a], bmap->eq[i][1+off+b]);
1524 for (i = 0; i < bmap->n_ineq; ++i)
1525 isl_int_swap(bmap->ineq[i][1+off+a], bmap->ineq[i][1+off+b]);
1527 for (i = 0; i < bmap->n_div; ++i)
1528 isl_int_swap(bmap->div[i][1+1+off+a], bmap->div[i][1+1+off+b]);
1529 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1532 /* Eliminate the specified n dimensions starting at first from the
1533 * constraints using Fourier-Motzkin. The dimensions themselves
1536 __isl_give isl_map *isl_map_eliminate(__isl_take isl_map *map,
1537 enum isl_dim_type type, unsigned first, unsigned n)
1546 map = isl_map_cow(map);
1549 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
1550 first += pos(map->dim, type) - 1;
1552 for (i = 0; i < map->n; ++i) {
1553 map->p[i] = isl_basic_map_eliminate_vars(map->p[i], first, n);
1563 /* Eliminate the specified n dimensions starting at first from the
1564 * constraints using Fourier-Motzkin. The dimensions themselves
1567 __isl_give isl_set *isl_set_eliminate(__isl_take isl_set *set,
1568 enum isl_dim_type type, unsigned first, unsigned n)
1570 return (isl_set *)isl_map_eliminate((isl_map *)set, type, first, n);
1573 /* Eliminate the specified n dimensions starting at first from the
1574 * constraints using Fourier-Motzkin. The dimensions themselves
1577 __isl_give isl_set *isl_set_eliminate_dims(__isl_take isl_set *set,
1578 unsigned first, unsigned n)
1580 return isl_set_eliminate(set, isl_dim_set, first, n);
1583 __isl_give isl_basic_map *isl_basic_map_remove_divs(
1584 __isl_take isl_basic_map *bmap)
1588 bmap = isl_basic_map_eliminate_vars(bmap,
1589 isl_space_dim(bmap->dim, isl_dim_all), bmap->n_div);
1593 return isl_basic_map_finalize(bmap);
1596 __isl_give isl_basic_set *isl_basic_set_remove_divs(
1597 __isl_take isl_basic_set *bset)
1599 return (struct isl_basic_set *)isl_basic_map_remove_divs(
1600 (struct isl_basic_map *)bset);
1603 __isl_give isl_map *isl_map_remove_divs(__isl_take isl_map *map)
1612 map = isl_map_cow(map);
1616 for (i = 0; i < map->n; ++i) {
1617 map->p[i] = isl_basic_map_remove_divs(map->p[i]);
1627 __isl_give isl_set *isl_set_remove_divs(__isl_take isl_set *set)
1629 return isl_map_remove_divs(set);
1632 struct isl_basic_map *isl_basic_map_remove_dims(struct isl_basic_map *bmap,
1633 enum isl_dim_type type, unsigned first, unsigned n)
1637 isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
1639 if (n == 0 && !isl_space_is_named_or_nested(bmap->dim, type))
1641 bmap = isl_basic_map_eliminate_vars(bmap,
1642 isl_basic_map_offset(bmap, type) - 1 + first, n);
1645 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY) && type == isl_dim_div)
1647 bmap = isl_basic_map_drop(bmap, type, first, n);
1650 isl_basic_map_free(bmap);
1654 /* Return true if the definition of the given div (recursively) involves
1655 * any of the given variables.
1657 static int div_involves_vars(__isl_keep isl_basic_map *bmap, int div,
1658 unsigned first, unsigned n)
1661 unsigned div_offset = isl_basic_map_offset(bmap, isl_dim_div);
1663 if (isl_int_is_zero(bmap->div[div][0]))
1665 if (isl_seq_first_non_zero(bmap->div[div] + 1 + first, n) >= 0)
1668 for (i = bmap->n_div - 1; i >= 0; --i) {
1669 if (isl_int_is_zero(bmap->div[div][1 + div_offset + i]))
1671 if (div_involves_vars(bmap, i, first, n))
1678 /* Remove all divs (recursively) involving any of the given dimensions
1679 * in their definitions.
1681 __isl_give isl_basic_map *isl_basic_map_remove_divs_involving_dims(
1682 __isl_take isl_basic_map *bmap,
1683 enum isl_dim_type type, unsigned first, unsigned n)
1689 isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
1691 first += isl_basic_map_offset(bmap, type);
1693 for (i = bmap->n_div - 1; i >= 0; --i) {
1694 if (!div_involves_vars(bmap, i, first, n))
1696 bmap = isl_basic_map_remove_dims(bmap, isl_dim_div, i, 1);
1704 isl_basic_map_free(bmap);
1708 __isl_give isl_map *isl_map_remove_divs_involving_dims(__isl_take isl_map *map,
1709 enum isl_dim_type type, unsigned first, unsigned n)
1718 map = isl_map_cow(map);
1722 for (i = 0; i < map->n; ++i) {
1723 map->p[i] = isl_basic_map_remove_divs_involving_dims(map->p[i],
1734 __isl_give isl_set *isl_set_remove_divs_involving_dims(__isl_take isl_set *set,
1735 enum isl_dim_type type, unsigned first, unsigned n)
1737 return (isl_set *)isl_map_remove_divs_involving_dims((isl_map *)set,
1741 int isl_basic_map_involves_dims(__isl_keep isl_basic_map *bmap,
1742 enum isl_dim_type type, unsigned first, unsigned n)
1749 if (first + n > isl_basic_map_dim(bmap, type))
1750 isl_die(bmap->ctx, isl_error_invalid,
1751 "index out of bounds", return -1);
1753 first += isl_basic_map_offset(bmap, type);
1754 for (i = 0; i < bmap->n_eq; ++i)
1755 if (isl_seq_first_non_zero(bmap->eq[i] + first, n) >= 0)
1757 for (i = 0; i < bmap->n_ineq; ++i)
1758 if (isl_seq_first_non_zero(bmap->ineq[i] + first, n) >= 0)
1764 int isl_map_involves_dims(__isl_keep isl_map *map,
1765 enum isl_dim_type type, unsigned first, unsigned n)
1772 if (first + n > isl_map_dim(map, type))
1773 isl_die(map->ctx, isl_error_invalid,
1774 "index out of bounds", return -1);
1776 for (i = 0; i < map->n; ++i) {
1777 int involves = isl_basic_map_involves_dims(map->p[i],
1779 if (involves < 0 || involves)
1786 int isl_basic_set_involves_dims(__isl_keep isl_basic_set *bset,
1787 enum isl_dim_type type, unsigned first, unsigned n)
1789 return isl_basic_map_involves_dims(bset, type, first, n);
1792 int isl_set_involves_dims(__isl_keep isl_set *set,
1793 enum isl_dim_type type, unsigned first, unsigned n)
1795 return isl_map_involves_dims(set, type, first, n);
1798 /* Return true if the definition of the given div is unknown or depends
1801 static int div_is_unknown(__isl_keep isl_basic_map *bmap, int div)
1804 unsigned div_offset = isl_basic_map_offset(bmap, isl_dim_div);
1806 if (isl_int_is_zero(bmap->div[div][0]))
1809 for (i = bmap->n_div - 1; i >= 0; --i) {
1810 if (isl_int_is_zero(bmap->div[div][1 + div_offset + i]))
1812 if (div_is_unknown(bmap, i))
1819 /* Remove all divs that are unknown or defined in terms of unknown divs.
1821 __isl_give isl_basic_map *isl_basic_map_remove_unknown_divs(
1822 __isl_take isl_basic_map *bmap)
1829 for (i = bmap->n_div - 1; i >= 0; --i) {
1830 if (!div_is_unknown(bmap, i))
1832 bmap = isl_basic_map_remove_dims(bmap, isl_dim_div, i, 1);
1838 __isl_give isl_map *isl_map_remove_unknown_divs(__isl_take isl_map *map)
1847 map = isl_map_cow(map);
1851 for (i = 0; i < map->n; ++i) {
1852 map->p[i] = isl_basic_map_remove_unknown_divs(map->p[i]);
1862 __isl_give isl_set *isl_set_remove_unknown_divs(__isl_take isl_set *set)
1864 return (isl_set *)isl_map_remove_unknown_divs((isl_map *)set);
1867 __isl_give isl_basic_set *isl_basic_set_remove_dims(
1868 __isl_take isl_basic_set *bset,
1869 enum isl_dim_type type, unsigned first, unsigned n)
1871 return (isl_basic_set *)
1872 isl_basic_map_remove_dims((isl_basic_map *)bset, type, first, n);
1875 struct isl_map *isl_map_remove_dims(struct isl_map *map,
1876 enum isl_dim_type type, unsigned first, unsigned n)
1883 map = isl_map_cow(map);
1886 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
1888 for (i = 0; i < map->n; ++i) {
1889 map->p[i] = isl_basic_map_eliminate_vars(map->p[i],
1890 isl_basic_map_offset(map->p[i], type) - 1 + first, n);
1894 map = isl_map_drop(map, type, first, n);
1901 __isl_give isl_set *isl_set_remove_dims(__isl_take isl_set *bset,
1902 enum isl_dim_type type, unsigned first, unsigned n)
1904 return (isl_set *)isl_map_remove_dims((isl_map *)bset, type, first, n);
1907 /* Project out n inputs starting at first using Fourier-Motzkin */
1908 struct isl_map *isl_map_remove_inputs(struct isl_map *map,
1909 unsigned first, unsigned n)
1911 return isl_map_remove_dims(map, isl_dim_in, first, n);
1914 static void dump_term(struct isl_basic_map *bmap,
1915 isl_int c, int pos, FILE *out)
1918 unsigned in = isl_basic_map_n_in(bmap);
1919 unsigned dim = in + isl_basic_map_n_out(bmap);
1920 unsigned nparam = isl_basic_map_n_param(bmap);
1922 isl_int_print(out, c, 0);
1924 if (!isl_int_is_one(c))
1925 isl_int_print(out, c, 0);
1926 if (pos < 1 + nparam) {
1927 name = isl_space_get_dim_name(bmap->dim,
1928 isl_dim_param, pos - 1);
1930 fprintf(out, "%s", name);
1932 fprintf(out, "p%d", pos - 1);
1933 } else if (pos < 1 + nparam + in)
1934 fprintf(out, "i%d", pos - 1 - nparam);
1935 else if (pos < 1 + nparam + dim)
1936 fprintf(out, "o%d", pos - 1 - nparam - in);
1938 fprintf(out, "e%d", pos - 1 - nparam - dim);
1942 static void dump_constraint_sign(struct isl_basic_map *bmap, isl_int *c,
1943 int sign, FILE *out)
1947 unsigned len = 1 + isl_basic_map_total_dim(bmap);
1951 for (i = 0, first = 1; i < len; ++i) {
1952 if (isl_int_sgn(c[i]) * sign <= 0)
1955 fprintf(out, " + ");
1957 isl_int_abs(v, c[i]);
1958 dump_term(bmap, v, i, out);
1965 static void dump_constraint(struct isl_basic_map *bmap, isl_int *c,
1966 const char *op, FILE *out, int indent)
1970 fprintf(out, "%*s", indent, "");
1972 dump_constraint_sign(bmap, c, 1, out);
1973 fprintf(out, " %s ", op);
1974 dump_constraint_sign(bmap, c, -1, out);
1978 for (i = bmap->n_div; i < bmap->extra; ++i) {
1979 if (isl_int_is_zero(c[1+isl_space_dim(bmap->dim, isl_dim_all)+i]))
1981 fprintf(out, "%*s", indent, "");
1982 fprintf(out, "ERROR: unused div coefficient not zero\n");
1987 static void dump_constraints(struct isl_basic_map *bmap,
1988 isl_int **c, unsigned n,
1989 const char *op, FILE *out, int indent)
1993 for (i = 0; i < n; ++i)
1994 dump_constraint(bmap, c[i], op, out, indent);
1997 static void dump_affine(struct isl_basic_map *bmap, isl_int *exp, FILE *out)
2001 unsigned total = isl_basic_map_total_dim(bmap);
2003 for (j = 0; j < 1 + total; ++j) {
2004 if (isl_int_is_zero(exp[j]))
2006 if (!first && isl_int_is_pos(exp[j]))
2008 dump_term(bmap, exp[j], j, out);
2013 static void dump(struct isl_basic_map *bmap, FILE *out, int indent)
2017 dump_constraints(bmap, bmap->eq, bmap->n_eq, "=", out, indent);
2018 dump_constraints(bmap, bmap->ineq, bmap->n_ineq, ">=", out, indent);
2020 for (i = 0; i < bmap->n_div; ++i) {
2021 fprintf(out, "%*s", indent, "");
2022 fprintf(out, "e%d = [(", i);
2023 dump_affine(bmap, bmap->div[i]+1, out);
2025 isl_int_print(out, bmap->div[i][0], 0);
2026 fprintf(out, "]\n");
2030 void isl_basic_set_print_internal(struct isl_basic_set *bset,
2031 FILE *out, int indent)
2034 fprintf(out, "null basic set\n");
2038 fprintf(out, "%*s", indent, "");
2039 fprintf(out, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n",
2040 bset->ref, bset->dim->nparam, bset->dim->n_out,
2041 bset->extra, bset->flags);
2042 dump((struct isl_basic_map *)bset, out, indent);
2045 void isl_basic_map_print_internal(struct isl_basic_map *bmap,
2046 FILE *out, int indent)
2049 fprintf(out, "null basic map\n");
2053 fprintf(out, "%*s", indent, "");
2054 fprintf(out, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, "
2055 "flags: %x, n_name: %d\n",
2057 bmap->dim->nparam, bmap->dim->n_in, bmap->dim->n_out,
2058 bmap->extra, bmap->flags, bmap->dim->n_id);
2059 dump(bmap, out, indent);
2062 int isl_inequality_negate(struct isl_basic_map *bmap, unsigned pos)
2067 total = isl_basic_map_total_dim(bmap);
2068 isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
2069 isl_seq_neg(bmap->ineq[pos], bmap->ineq[pos], 1 + total);
2070 isl_int_sub_ui(bmap->ineq[pos][0], bmap->ineq[pos][0], 1);
2071 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
2075 __isl_give isl_set *isl_set_alloc_space(__isl_take isl_space *dim, int n,
2078 struct isl_set *set;
2082 isl_assert(dim->ctx, dim->n_in == 0, goto error);
2083 isl_assert(dim->ctx, n >= 0, goto error);
2084 set = isl_alloc(dim->ctx, struct isl_set,
2085 sizeof(struct isl_set) +
2086 (n - 1) * sizeof(struct isl_basic_set *));
2090 set->ctx = dim->ctx;
2091 isl_ctx_ref(set->ctx);
2099 isl_space_free(dim);
2103 struct isl_set *isl_set_alloc(struct isl_ctx *ctx,
2104 unsigned nparam, unsigned dim, int n, unsigned flags)
2106 struct isl_set *set;
2109 dims = isl_space_alloc(ctx, nparam, 0, dim);
2113 set = isl_set_alloc_space(dims, n, flags);
2117 /* Make sure "map" has room for at least "n" more basic maps.
2119 struct isl_map *isl_map_grow(struct isl_map *map, int n)
2122 struct isl_map *grown = NULL;
2126 isl_assert(map->ctx, n >= 0, goto error);
2127 if (map->n + n <= map->size)
2129 grown = isl_map_alloc_space(isl_map_get_space(map), map->n + n, map->flags);
2132 for (i = 0; i < map->n; ++i) {
2133 grown->p[i] = isl_basic_map_copy(map->p[i]);
2141 isl_map_free(grown);
2146 /* Make sure "set" has room for at least "n" more basic sets.
2148 struct isl_set *isl_set_grow(struct isl_set *set, int n)
2150 return (struct isl_set *)isl_map_grow((struct isl_map *)set, n);
2153 struct isl_set *isl_set_dup(struct isl_set *set)
2156 struct isl_set *dup;
2161 dup = isl_set_alloc_space(isl_space_copy(set->dim), set->n, set->flags);
2164 for (i = 0; i < set->n; ++i)
2165 dup = isl_set_add_basic_set(dup, isl_basic_set_copy(set->p[i]));
2169 struct isl_set *isl_set_from_basic_set(struct isl_basic_set *bset)
2171 return isl_map_from_basic_map(bset);
2174 struct isl_map *isl_map_from_basic_map(struct isl_basic_map *bmap)
2176 struct isl_map *map;
2181 map = isl_map_alloc_space(isl_space_copy(bmap->dim), 1, ISL_MAP_DISJOINT);
2182 return isl_map_add_basic_map(map, bmap);
2185 __isl_give isl_set *isl_set_add_basic_set(__isl_take isl_set *set,
2186 __isl_take isl_basic_set *bset)
2188 return (struct isl_set *)isl_map_add_basic_map((struct isl_map *)set,
2189 (struct isl_basic_map *)bset);
2192 void isl_set_free(struct isl_set *set)
2202 isl_ctx_deref(set->ctx);
2203 for (i = 0; i < set->n; ++i)
2204 isl_basic_set_free(set->p[i]);
2205 isl_space_free(set->dim);
2209 void isl_set_print_internal(struct isl_set *set, FILE *out, int indent)
2214 fprintf(out, "null set\n");
2218 fprintf(out, "%*s", indent, "");
2219 fprintf(out, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
2220 set->ref, set->n, set->dim->nparam, set->dim->n_out,
2222 for (i = 0; i < set->n; ++i) {
2223 fprintf(out, "%*s", indent, "");
2224 fprintf(out, "basic set %d:\n", i);
2225 isl_basic_set_print_internal(set->p[i], out, indent+4);
2229 void isl_map_print_internal(struct isl_map *map, FILE *out, int indent)
2234 fprintf(out, "null map\n");
2238 fprintf(out, "%*s", indent, "");
2239 fprintf(out, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, "
2240 "flags: %x, n_name: %d\n",
2241 map->ref, map->n, map->dim->nparam, map->dim->n_in,
2242 map->dim->n_out, map->flags, map->dim->n_id);
2243 for (i = 0; i < map->n; ++i) {
2244 fprintf(out, "%*s", indent, "");
2245 fprintf(out, "basic map %d:\n", i);
2246 isl_basic_map_print_internal(map->p[i], out, indent+4);
2250 struct isl_basic_map *isl_basic_map_intersect_domain(
2251 struct isl_basic_map *bmap, struct isl_basic_set *bset)
2253 struct isl_basic_map *bmap_domain;
2258 isl_assert(bset->ctx, isl_space_match(bmap->dim, isl_dim_param,
2259 bset->dim, isl_dim_param), goto error);
2261 if (isl_space_dim(bset->dim, isl_dim_set) != 0)
2262 isl_assert(bset->ctx,
2263 isl_basic_map_compatible_domain(bmap, bset), goto error);
2265 bmap = isl_basic_map_cow(bmap);
2268 bmap = isl_basic_map_extend_space(bmap, isl_space_copy(bmap->dim),
2269 bset->n_div, bset->n_eq, bset->n_ineq);
2270 bmap_domain = isl_basic_map_from_domain(bset);
2271 bmap = add_constraints(bmap, bmap_domain, 0, 0);
2273 bmap = isl_basic_map_simplify(bmap);
2274 return isl_basic_map_finalize(bmap);
2276 isl_basic_map_free(bmap);
2277 isl_basic_set_free(bset);
2281 struct isl_basic_map *isl_basic_map_intersect_range(
2282 struct isl_basic_map *bmap, struct isl_basic_set *bset)
2284 struct isl_basic_map *bmap_range;
2289 isl_assert(bset->ctx, isl_space_match(bmap->dim, isl_dim_param,
2290 bset->dim, isl_dim_param), goto error);
2292 if (isl_space_dim(bset->dim, isl_dim_set) != 0)
2293 isl_assert(bset->ctx,
2294 isl_basic_map_compatible_range(bmap, bset), goto error);
2296 if (isl_basic_set_is_universe(bset)) {
2297 isl_basic_set_free(bset);
2301 bmap = isl_basic_map_cow(bmap);
2304 bmap = isl_basic_map_extend_space(bmap, isl_space_copy(bmap->dim),
2305 bset->n_div, bset->n_eq, bset->n_ineq);
2306 bmap_range = isl_basic_map_from_basic_set(bset, isl_space_copy(bset->dim));
2307 bmap = add_constraints(bmap, bmap_range, 0, 0);
2309 bmap = isl_basic_map_simplify(bmap);
2310 return isl_basic_map_finalize(bmap);
2312 isl_basic_map_free(bmap);
2313 isl_basic_set_free(bset);
2317 int isl_basic_map_contains(struct isl_basic_map *bmap, struct isl_vec *vec)
2323 total = 1 + isl_basic_map_total_dim(bmap);
2324 if (total != vec->size)
2329 for (i = 0; i < bmap->n_eq; ++i) {
2330 isl_seq_inner_product(vec->el, bmap->eq[i], total, &s);
2331 if (!isl_int_is_zero(s)) {
2337 for (i = 0; i < bmap->n_ineq; ++i) {
2338 isl_seq_inner_product(vec->el, bmap->ineq[i], total, &s);
2339 if (isl_int_is_neg(s)) {
2350 int isl_basic_set_contains(struct isl_basic_set *bset, struct isl_vec *vec)
2352 return isl_basic_map_contains((struct isl_basic_map *)bset, vec);
2355 struct isl_basic_map *isl_basic_map_intersect(
2356 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2358 struct isl_vec *sample = NULL;
2360 if (!bmap1 || !bmap2)
2363 isl_assert(bmap1->ctx, isl_space_match(bmap1->dim, isl_dim_param,
2364 bmap2->dim, isl_dim_param), goto error);
2365 if (isl_space_dim(bmap1->dim, isl_dim_all) ==
2366 isl_space_dim(bmap1->dim, isl_dim_param) &&
2367 isl_space_dim(bmap2->dim, isl_dim_all) !=
2368 isl_space_dim(bmap2->dim, isl_dim_param))
2369 return isl_basic_map_intersect(bmap2, bmap1);
2371 if (isl_space_dim(bmap2->dim, isl_dim_all) !=
2372 isl_space_dim(bmap2->dim, isl_dim_param))
2373 isl_assert(bmap1->ctx,
2374 isl_space_is_equal(bmap1->dim, bmap2->dim), goto error);
2376 if (bmap1->sample &&
2377 isl_basic_map_contains(bmap1, bmap1->sample) > 0 &&
2378 isl_basic_map_contains(bmap2, bmap1->sample) > 0)
2379 sample = isl_vec_copy(bmap1->sample);
2380 else if (bmap2->sample &&
2381 isl_basic_map_contains(bmap1, bmap2->sample) > 0 &&
2382 isl_basic_map_contains(bmap2, bmap2->sample) > 0)
2383 sample = isl_vec_copy(bmap2->sample);
2385 bmap1 = isl_basic_map_cow(bmap1);
2388 bmap1 = isl_basic_map_extend_space(bmap1, isl_space_copy(bmap1->dim),
2389 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
2390 bmap1 = add_constraints(bmap1, bmap2, 0, 0);
2393 isl_vec_free(sample);
2395 isl_vec_free(bmap1->sample);
2396 bmap1->sample = sample;
2399 bmap1 = isl_basic_map_simplify(bmap1);
2400 return isl_basic_map_finalize(bmap1);
2403 isl_vec_free(sample);
2404 isl_basic_map_free(bmap1);
2405 isl_basic_map_free(bmap2);
2409 struct isl_basic_set *isl_basic_set_intersect(
2410 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
2412 return (struct isl_basic_set *)
2413 isl_basic_map_intersect(
2414 (struct isl_basic_map *)bset1,
2415 (struct isl_basic_map *)bset2);
2418 /* Special case of isl_map_intersect, where both map1 and map2
2419 * are convex, without any divs and such that either map1 or map2
2420 * contains a single constraint. This constraint is then simply
2421 * added to the other map.
2423 static __isl_give isl_map *map_intersect_add_constraint(
2424 __isl_take isl_map *map1, __isl_take isl_map *map2)
2426 isl_assert(map1->ctx, map1->n == 1, goto error);
2427 isl_assert(map2->ctx, map1->n == 1, goto error);
2428 isl_assert(map1->ctx, map1->p[0]->n_div == 0, goto error);
2429 isl_assert(map2->ctx, map1->p[0]->n_div == 0, goto error);
2431 if (map2->p[0]->n_eq + map2->p[0]->n_ineq != 1)
2432 return isl_map_intersect(map2, map1);
2434 isl_assert(map2->ctx,
2435 map2->p[0]->n_eq + map2->p[0]->n_ineq == 1, goto error);
2437 map1 = isl_map_cow(map1);
2440 if (isl_map_plain_is_empty(map1)) {
2444 map1->p[0] = isl_basic_map_cow(map1->p[0]);
2445 if (map2->p[0]->n_eq == 1)
2446 map1->p[0] = isl_basic_map_add_eq(map1->p[0], map2->p[0]->eq[0]);
2448 map1->p[0] = isl_basic_map_add_ineq(map1->p[0],
2449 map2->p[0]->ineq[0]);
2451 map1->p[0] = isl_basic_map_simplify(map1->p[0]);
2452 map1->p[0] = isl_basic_map_finalize(map1->p[0]);
2456 if (isl_basic_map_plain_is_empty(map1->p[0])) {
2457 isl_basic_map_free(map1->p[0]);
2470 static __isl_give isl_map *map_intersect(__isl_take isl_map *map1,
2471 __isl_take isl_map *map2)
2474 struct isl_map *result;
2480 if (isl_map_plain_is_empty(map1) &&
2481 isl_space_is_equal(map1->dim, map2->dim)) {
2485 if (isl_map_plain_is_empty(map2) &&
2486 isl_space_is_equal(map1->dim, map2->dim)) {
2491 if (map1->n == 1 && map2->n == 1 &&
2492 map1->p[0]->n_div == 0 && map2->p[0]->n_div == 0 &&
2493 isl_space_is_equal(map1->dim, map2->dim) &&
2494 (map1->p[0]->n_eq + map1->p[0]->n_ineq == 1 ||
2495 map2->p[0]->n_eq + map2->p[0]->n_ineq == 1))
2496 return map_intersect_add_constraint(map1, map2);
2497 if (isl_map_is_params(map1) && !isl_map_is_params(map2))
2498 return isl_map_intersect(map2, map1);
2499 if (isl_space_dim(map1->dim, isl_dim_all) ==
2500 isl_space_dim(map1->dim, isl_dim_param) &&
2501 isl_space_dim(map2->dim, isl_dim_all) !=
2502 isl_space_dim(map2->dim, isl_dim_param))
2503 return isl_map_intersect(map2, map1);
2505 if (isl_space_dim(map2->dim, isl_dim_all) !=
2506 isl_space_dim(map2->dim, isl_dim_param))
2507 isl_assert(map1->ctx,
2508 isl_space_is_equal(map1->dim, map2->dim), goto error);
2510 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
2511 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
2512 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
2514 result = isl_map_alloc_space(isl_space_copy(map1->dim),
2515 map1->n * map2->n, flags);
2518 for (i = 0; i < map1->n; ++i)
2519 for (j = 0; j < map2->n; ++j) {
2520 struct isl_basic_map *part;
2521 part = isl_basic_map_intersect(
2522 isl_basic_map_copy(map1->p[i]),
2523 isl_basic_map_copy(map2->p[j]));
2524 if (isl_basic_map_is_empty(part))
2525 isl_basic_map_free(part);
2527 result = isl_map_add_basic_map(result, part);
2540 __isl_give isl_map *isl_map_intersect(__isl_take isl_map *map1,
2541 __isl_take isl_map *map2)
2543 return isl_map_align_params_map_map_and(map1, map2, &map_intersect);
2546 struct isl_set *isl_set_intersect(struct isl_set *set1, struct isl_set *set2)
2548 return (struct isl_set *)
2549 isl_map_intersect((struct isl_map *)set1,
2550 (struct isl_map *)set2);
2553 /* The current implementation of isl_map_intersect accepts intersections
2554 * with parameter domains, so we can just call that for now.
2556 static __isl_give isl_map *map_intersect_params(__isl_take isl_map *map,
2557 __isl_take isl_set *params)
2559 return isl_map_intersect(map, params);
2562 __isl_give isl_map *isl_map_intersect_params(__isl_take isl_map *map1,
2563 __isl_take isl_map *map2)
2565 return isl_map_align_params_map_map_and(map1, map2, &map_intersect_params);
2568 __isl_give isl_set *isl_set_intersect_params(__isl_take isl_set *set,
2569 __isl_take isl_set *params)
2571 return isl_map_intersect_params(set, params);
2574 struct isl_basic_map *isl_basic_map_reverse(struct isl_basic_map *bmap)
2577 struct isl_basic_set *bset;
2582 bmap = isl_basic_map_cow(bmap);
2585 dim = isl_space_reverse(isl_space_copy(bmap->dim));
2586 in = isl_basic_map_n_in(bmap);
2587 bset = isl_basic_set_from_basic_map(bmap);
2588 bset = isl_basic_set_swap_vars(bset, in);
2589 return isl_basic_map_from_basic_set(bset, dim);
2592 static __isl_give isl_basic_map *basic_map_space_reset(
2593 __isl_take isl_basic_map *bmap, enum isl_dim_type type)
2597 if (!isl_space_is_named_or_nested(bmap->dim, type))
2600 space = isl_basic_map_get_space(bmap);
2601 space = isl_space_reset(space, type);
2602 bmap = isl_basic_map_reset_space(bmap, space);
2606 __isl_give isl_basic_map *isl_basic_map_insert(__isl_take isl_basic_map *bmap,
2607 enum isl_dim_type type, unsigned pos, unsigned n)
2610 struct isl_basic_map *res;
2611 struct isl_dim_map *dim_map;
2612 unsigned total, off;
2613 enum isl_dim_type t;
2616 return basic_map_space_reset(bmap, type);
2621 res_dim = isl_space_insert_dims(isl_basic_map_get_space(bmap), type, pos, n);
2623 total = isl_basic_map_total_dim(bmap) + n;
2624 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2626 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
2628 isl_dim_map_dim(dim_map, bmap->dim, t, off);
2630 unsigned size = isl_basic_map_dim(bmap, t);
2631 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2633 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2634 pos, size - pos, off + pos + n);
2636 off += isl_space_dim(res_dim, t);
2638 isl_dim_map_div(dim_map, bmap, off);
2640 res = isl_basic_map_alloc_space(res_dim,
2641 bmap->n_div, bmap->n_eq, bmap->n_ineq);
2642 if (isl_basic_map_is_rational(bmap))
2643 res = isl_basic_map_set_rational(res);
2644 res = isl_basic_map_add_constraints_dim_map(res, bmap, dim_map);
2645 return isl_basic_map_finalize(res);
2648 __isl_give isl_basic_map *isl_basic_map_add(__isl_take isl_basic_map *bmap,
2649 enum isl_dim_type type, unsigned n)
2653 return isl_basic_map_insert(bmap, type,
2654 isl_basic_map_dim(bmap, type), n);
2657 __isl_give isl_basic_set *isl_basic_set_add(__isl_take isl_basic_set *bset,
2658 enum isl_dim_type type, unsigned n)
2662 isl_assert(bset->ctx, type != isl_dim_in, goto error);
2663 return (isl_basic_set *)isl_basic_map_add((isl_basic_map *)bset, type, n);
2665 isl_basic_set_free(bset);
2669 static __isl_give isl_map *map_space_reset(__isl_take isl_map *map,
2670 enum isl_dim_type type)
2674 if (!isl_space_is_named_or_nested(map->dim, type))
2677 space = isl_map_get_space(map);
2678 space = isl_space_reset(space, type);
2679 map = isl_map_reset_space(map, space);
2683 __isl_give isl_map *isl_map_insert_dims(__isl_take isl_map *map,
2684 enum isl_dim_type type, unsigned pos, unsigned n)
2689 return map_space_reset(map, type);
2691 map = isl_map_cow(map);
2695 map->dim = isl_space_insert_dims(map->dim, type, pos, n);
2699 for (i = 0; i < map->n; ++i) {
2700 map->p[i] = isl_basic_map_insert(map->p[i], type, pos, n);
2711 __isl_give isl_set *isl_set_insert_dims(__isl_take isl_set *set,
2712 enum isl_dim_type type, unsigned pos, unsigned n)
2714 return isl_map_insert_dims(set, type, pos, n);
2717 __isl_give isl_map *isl_map_add_dims(__isl_take isl_map *map,
2718 enum isl_dim_type type, unsigned n)
2722 return isl_map_insert_dims(map, type, isl_map_dim(map, type), n);
2725 __isl_give isl_set *isl_set_add_dims(__isl_take isl_set *set,
2726 enum isl_dim_type type, unsigned n)
2730 isl_assert(set->ctx, type != isl_dim_in, goto error);
2731 return (isl_set *)isl_map_add_dims((isl_map *)set, type, n);
2737 __isl_give isl_basic_map *isl_basic_map_move_dims(
2738 __isl_take isl_basic_map *bmap,
2739 enum isl_dim_type dst_type, unsigned dst_pos,
2740 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2742 struct isl_dim_map *dim_map;
2743 struct isl_basic_map *res;
2744 enum isl_dim_type t;
2745 unsigned total, off;
2752 isl_assert(bmap->ctx, src_pos + n <= isl_basic_map_dim(bmap, src_type),
2755 if (dst_type == src_type && dst_pos == src_pos)
2758 isl_assert(bmap->ctx, dst_type != src_type, goto error);
2760 if (pos(bmap->dim, dst_type) + dst_pos ==
2761 pos(bmap->dim, src_type) + src_pos +
2762 ((src_type < dst_type) ? n : 0)) {
2763 bmap = isl_basic_map_cow(bmap);
2767 bmap->dim = isl_space_move_dims(bmap->dim, dst_type, dst_pos,
2768 src_type, src_pos, n);
2772 bmap = isl_basic_map_finalize(bmap);
2777 total = isl_basic_map_total_dim(bmap);
2778 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2781 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
2782 unsigned size = isl_space_dim(bmap->dim, t);
2783 if (t == dst_type) {
2784 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2787 isl_dim_map_dim_range(dim_map, bmap->dim, src_type,
2790 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2791 dst_pos, size - dst_pos, off);
2792 off += size - dst_pos;
2793 } else if (t == src_type) {
2794 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2797 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2798 src_pos + n, size - src_pos - n, off);
2799 off += size - src_pos - n;
2801 isl_dim_map_dim(dim_map, bmap->dim, t, off);
2805 isl_dim_map_div(dim_map, bmap, off);
2807 res = isl_basic_map_alloc_space(isl_basic_map_get_space(bmap),
2808 bmap->n_div, bmap->n_eq, bmap->n_ineq);
2809 bmap = isl_basic_map_add_constraints_dim_map(res, bmap, dim_map);
2811 bmap->dim = isl_space_move_dims(bmap->dim, dst_type, dst_pos,
2812 src_type, src_pos, n);
2816 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
2817 bmap = isl_basic_map_gauss(bmap, NULL);
2818 bmap = isl_basic_map_finalize(bmap);
2822 isl_basic_map_free(bmap);
2826 __isl_give isl_basic_set *isl_basic_set_move_dims(__isl_take isl_basic_set *bset,
2827 enum isl_dim_type dst_type, unsigned dst_pos,
2828 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2830 return (isl_basic_set *)isl_basic_map_move_dims(
2831 (isl_basic_map *)bset, dst_type, dst_pos, src_type, src_pos, n);
2834 __isl_give isl_set *isl_set_move_dims(__isl_take isl_set *set,
2835 enum isl_dim_type dst_type, unsigned dst_pos,
2836 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2840 isl_assert(set->ctx, dst_type != isl_dim_in, goto error);
2841 return (isl_set *)isl_map_move_dims((isl_map *)set, dst_type, dst_pos,
2842 src_type, src_pos, n);
2848 __isl_give isl_map *isl_map_move_dims(__isl_take isl_map *map,
2849 enum isl_dim_type dst_type, unsigned dst_pos,
2850 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2859 isl_assert(map->ctx, src_pos + n <= isl_map_dim(map, src_type),
2862 if (dst_type == src_type && dst_pos == src_pos)
2865 isl_assert(map->ctx, dst_type != src_type, goto error);
2867 map = isl_map_cow(map);
2871 map->dim = isl_space_move_dims(map->dim, dst_type, dst_pos, src_type, src_pos, n);
2875 for (i = 0; i < map->n; ++i) {
2876 map->p[i] = isl_basic_map_move_dims(map->p[i],
2878 src_type, src_pos, n);
2889 /* Move the specified dimensions to the last columns right before
2890 * the divs. Don't change the dimension specification of bmap.
2891 * That's the responsibility of the caller.
2893 static __isl_give isl_basic_map *move_last(__isl_take isl_basic_map *bmap,
2894 enum isl_dim_type type, unsigned first, unsigned n)
2896 struct isl_dim_map *dim_map;
2897 struct isl_basic_map *res;
2898 enum isl_dim_type t;
2899 unsigned total, off;
2903 if (pos(bmap->dim, type) + first + n ==
2904 1 + isl_space_dim(bmap->dim, isl_dim_all))
2907 total = isl_basic_map_total_dim(bmap);
2908 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2911 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
2912 unsigned size = isl_space_dim(bmap->dim, t);
2914 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2917 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2918 first, n, total - bmap->n_div - n);
2919 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2920 first + n, size - (first + n), off);
2921 off += size - (first + n);
2923 isl_dim_map_dim(dim_map, bmap->dim, t, off);
2927 isl_dim_map_div(dim_map, bmap, off + n);
2929 res = isl_basic_map_alloc_space(isl_basic_map_get_space(bmap),
2930 bmap->n_div, bmap->n_eq, bmap->n_ineq);
2931 res = isl_basic_map_add_constraints_dim_map(res, bmap, dim_map);
2935 /* Turn the n dimensions of type type, starting at first
2936 * into existentially quantified variables.
2938 __isl_give isl_basic_map *isl_basic_map_project_out(
2939 __isl_take isl_basic_map *bmap,
2940 enum isl_dim_type type, unsigned first, unsigned n)
2953 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL))
2954 return isl_basic_map_remove_dims(bmap, type, first, n);
2956 isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
2959 bmap = move_last(bmap, type, first, n);
2960 bmap = isl_basic_map_cow(bmap);
2964 row_size = 1 + isl_space_dim(bmap->dim, isl_dim_all) + bmap->extra;
2965 old = bmap->block2.data;
2966 bmap->block2 = isl_blk_extend(bmap->ctx, bmap->block2,
2967 (bmap->extra + n) * (1 + row_size));
2968 if (!bmap->block2.data)
2970 new_div = isl_alloc_array(bmap->ctx, isl_int *, bmap->extra + n);
2973 for (i = 0; i < n; ++i) {
2974 new_div[i] = bmap->block2.data +
2975 (bmap->extra + i) * (1 + row_size);
2976 isl_seq_clr(new_div[i], 1 + row_size);
2978 for (i = 0; i < bmap->extra; ++i)
2979 new_div[n + i] = bmap->block2.data + (bmap->div[i] - old);
2981 bmap->div = new_div;
2985 bmap->dim = isl_space_drop_dims(bmap->dim, type, first, n);
2988 bmap = isl_basic_map_simplify(bmap);
2989 bmap = isl_basic_map_drop_redundant_divs(bmap);
2990 return isl_basic_map_finalize(bmap);
2992 isl_basic_map_free(bmap);
2996 /* Turn the n dimensions of type type, starting at first
2997 * into existentially quantified variables.
2999 struct isl_basic_set *isl_basic_set_project_out(struct isl_basic_set *bset,
3000 enum isl_dim_type type, unsigned first, unsigned n)
3002 return (isl_basic_set *)isl_basic_map_project_out(
3003 (isl_basic_map *)bset, type, first, n);
3006 /* Turn the n dimensions of type type, starting at first
3007 * into existentially quantified variables.
3009 __isl_give isl_map *isl_map_project_out(__isl_take isl_map *map,
3010 enum isl_dim_type type, unsigned first, unsigned n)
3020 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
3022 map = isl_map_cow(map);
3026 map->dim = isl_space_drop_dims(map->dim, type, first, n);
3030 for (i = 0; i < map->n; ++i) {
3031 map->p[i] = isl_basic_map_project_out(map->p[i], type, first, n);
3042 /* Turn the n dimensions of type type, starting at first
3043 * into existentially quantified variables.
3045 __isl_give isl_set *isl_set_project_out(__isl_take isl_set *set,
3046 enum isl_dim_type type, unsigned first, unsigned n)
3048 return (isl_set *)isl_map_project_out((isl_map *)set, type, first, n);
3051 static struct isl_basic_map *add_divs(struct isl_basic_map *bmap, unsigned n)
3055 for (i = 0; i < n; ++i) {
3056 j = isl_basic_map_alloc_div(bmap);
3059 isl_seq_clr(bmap->div[j], 1+1+isl_basic_map_total_dim(bmap));
3063 isl_basic_map_free(bmap);
3067 struct isl_basic_map *isl_basic_map_apply_range(
3068 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3070 isl_space *dim_result = NULL;
3071 struct isl_basic_map *bmap;
3072 unsigned n_in, n_out, n, nparam, total, pos;
3073 struct isl_dim_map *dim_map1, *dim_map2;
3075 if (!bmap1 || !bmap2)
3078 dim_result = isl_space_join(isl_space_copy(bmap1->dim),
3079 isl_space_copy(bmap2->dim));
3081 n_in = isl_basic_map_n_in(bmap1);
3082 n_out = isl_basic_map_n_out(bmap2);
3083 n = isl_basic_map_n_out(bmap1);
3084 nparam = isl_basic_map_n_param(bmap1);
3086 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + n;
3087 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
3088 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
3089 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
3090 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
3091 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
3092 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_in);
3093 isl_dim_map_div(dim_map1, bmap1, pos += n_out);
3094 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
3095 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
3096 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
3098 bmap = isl_basic_map_alloc_space(dim_result,
3099 bmap1->n_div + bmap2->n_div + n,
3100 bmap1->n_eq + bmap2->n_eq,
3101 bmap1->n_ineq + bmap2->n_ineq);
3102 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap1, dim_map1);
3103 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap2, dim_map2);
3104 bmap = add_divs(bmap, n);
3105 bmap = isl_basic_map_simplify(bmap);
3106 bmap = isl_basic_map_drop_redundant_divs(bmap);
3107 return isl_basic_map_finalize(bmap);
3109 isl_basic_map_free(bmap1);
3110 isl_basic_map_free(bmap2);
3114 struct isl_basic_set *isl_basic_set_apply(
3115 struct isl_basic_set *bset, struct isl_basic_map *bmap)
3120 isl_assert(bset->ctx, isl_basic_map_compatible_domain(bmap, bset),
3123 return (struct isl_basic_set *)
3124 isl_basic_map_apply_range((struct isl_basic_map *)bset, bmap);
3126 isl_basic_set_free(bset);
3127 isl_basic_map_free(bmap);
3131 struct isl_basic_map *isl_basic_map_apply_domain(
3132 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3134 if (!bmap1 || !bmap2)
3137 isl_assert(bmap1->ctx,
3138 isl_basic_map_n_in(bmap1) == isl_basic_map_n_in(bmap2), goto error);
3139 isl_assert(bmap1->ctx,
3140 isl_basic_map_n_param(bmap1) == isl_basic_map_n_param(bmap2),
3143 bmap1 = isl_basic_map_reverse(bmap1);
3144 bmap1 = isl_basic_map_apply_range(bmap1, bmap2);
3145 return isl_basic_map_reverse(bmap1);
3147 isl_basic_map_free(bmap1);
3148 isl_basic_map_free(bmap2);
3152 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
3153 * A \cap B -> f(A) + f(B)
3155 struct isl_basic_map *isl_basic_map_sum(
3156 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3158 unsigned n_in, n_out, nparam, total, pos;
3159 struct isl_basic_map *bmap = NULL;
3160 struct isl_dim_map *dim_map1, *dim_map2;
3163 if (!bmap1 || !bmap2)
3166 isl_assert(bmap1->ctx, isl_space_is_equal(bmap1->dim, bmap2->dim),
3169 nparam = isl_basic_map_n_param(bmap1);
3170 n_in = isl_basic_map_n_in(bmap1);
3171 n_out = isl_basic_map_n_out(bmap1);
3173 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + 2 * n_out;
3174 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
3175 dim_map2 = isl_dim_map_alloc(bmap2->ctx, total);
3176 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
3177 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos);
3178 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
3179 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
3180 isl_dim_map_div(dim_map1, bmap1, pos += n_in + n_out);
3181 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
3182 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
3183 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_out);
3185 bmap = isl_basic_map_alloc_space(isl_space_copy(bmap1->dim),
3186 bmap1->n_div + bmap2->n_div + 2 * n_out,
3187 bmap1->n_eq + bmap2->n_eq + n_out,
3188 bmap1->n_ineq + bmap2->n_ineq);
3189 for (i = 0; i < n_out; ++i) {
3190 int j = isl_basic_map_alloc_equality(bmap);
3193 isl_seq_clr(bmap->eq[j], 1+total);
3194 isl_int_set_si(bmap->eq[j][1+nparam+n_in+i], -1);
3195 isl_int_set_si(bmap->eq[j][1+pos+i], 1);
3196 isl_int_set_si(bmap->eq[j][1+pos-n_out+i], 1);
3198 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap1, dim_map1);
3199 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap2, dim_map2);
3200 bmap = add_divs(bmap, 2 * n_out);
3202 bmap = isl_basic_map_simplify(bmap);
3203 return isl_basic_map_finalize(bmap);
3205 isl_basic_map_free(bmap);
3206 isl_basic_map_free(bmap1);
3207 isl_basic_map_free(bmap2);
3211 /* Given two maps A -> f(A) and B -> g(B), construct a map
3212 * A \cap B -> f(A) + f(B)
3214 struct isl_map *isl_map_sum(struct isl_map *map1, struct isl_map *map2)
3216 struct isl_map *result;
3222 isl_assert(map1->ctx, isl_space_is_equal(map1->dim, map2->dim), goto error);
3224 result = isl_map_alloc_space(isl_space_copy(map1->dim),
3225 map1->n * map2->n, 0);
3228 for (i = 0; i < map1->n; ++i)
3229 for (j = 0; j < map2->n; ++j) {
3230 struct isl_basic_map *part;
3231 part = isl_basic_map_sum(
3232 isl_basic_map_copy(map1->p[i]),
3233 isl_basic_map_copy(map2->p[j]));
3234 if (isl_basic_map_is_empty(part))
3235 isl_basic_map_free(part);
3237 result = isl_map_add_basic_map(result, part);
3250 __isl_give isl_set *isl_set_sum(__isl_take isl_set *set1,
3251 __isl_take isl_set *set2)
3253 return (isl_set *)isl_map_sum((isl_map *)set1, (isl_map *)set2);
3256 /* Given a basic map A -> f(A), construct A -> -f(A).
3258 struct isl_basic_map *isl_basic_map_neg(struct isl_basic_map *bmap)
3263 bmap = isl_basic_map_cow(bmap);
3267 n = isl_basic_map_dim(bmap, isl_dim_out);
3268 off = isl_basic_map_offset(bmap, isl_dim_out);
3269 for (i = 0; i < bmap->n_eq; ++i)
3270 for (j = 0; j < n; ++j)
3271 isl_int_neg(bmap->eq[i][off+j], bmap->eq[i][off+j]);
3272 for (i = 0; i < bmap->n_ineq; ++i)
3273 for (j = 0; j < n; ++j)
3274 isl_int_neg(bmap->ineq[i][off+j], bmap->ineq[i][off+j]);
3275 for (i = 0; i < bmap->n_div; ++i)
3276 for (j = 0; j < n; ++j)
3277 isl_int_neg(bmap->div[i][1+off+j], bmap->div[i][1+off+j]);
3278 bmap = isl_basic_map_gauss(bmap, NULL);
3279 return isl_basic_map_finalize(bmap);
3282 __isl_give isl_basic_set *isl_basic_set_neg(__isl_take isl_basic_set *bset)
3284 return isl_basic_map_neg(bset);
3287 /* Given a map A -> f(A), construct A -> -f(A).
3289 struct isl_map *isl_map_neg(struct isl_map *map)
3293 map = isl_map_cow(map);
3297 for (i = 0; i < map->n; ++i) {
3298 map->p[i] = isl_basic_map_neg(map->p[i]);
3309 __isl_give isl_set *isl_set_neg(__isl_take isl_set *set)
3311 return (isl_set *)isl_map_neg((isl_map *)set);
3314 /* Given a basic map A -> f(A) and an integer d, construct a basic map
3315 * A -> floor(f(A)/d).
3317 struct isl_basic_map *isl_basic_map_floordiv(struct isl_basic_map *bmap,
3320 unsigned n_in, n_out, nparam, total, pos;
3321 struct isl_basic_map *result = NULL;
3322 struct isl_dim_map *dim_map;
3328 nparam = isl_basic_map_n_param(bmap);
3329 n_in = isl_basic_map_n_in(bmap);
3330 n_out = isl_basic_map_n_out(bmap);
3332 total = nparam + n_in + n_out + bmap->n_div + n_out;
3333 dim_map = isl_dim_map_alloc(bmap->ctx, total);
3334 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_param, pos = 0);
3335 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_in, pos += nparam);
3336 isl_dim_map_div(dim_map, bmap, pos += n_in + n_out);
3337 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_out, pos += bmap->n_div);
3339 result = isl_basic_map_alloc_space(isl_space_copy(bmap->dim),
3340 bmap->n_div + n_out,
3341 bmap->n_eq, bmap->n_ineq + 2 * n_out);
3342 result = isl_basic_map_add_constraints_dim_map(result, bmap, dim_map);
3343 result = add_divs(result, n_out);
3344 for (i = 0; i < n_out; ++i) {
3346 j = isl_basic_map_alloc_inequality(result);
3349 isl_seq_clr(result->ineq[j], 1+total);
3350 isl_int_neg(result->ineq[j][1+nparam+n_in+i], d);
3351 isl_int_set_si(result->ineq[j][1+pos+i], 1);
3352 j = isl_basic_map_alloc_inequality(result);
3355 isl_seq_clr(result->ineq[j], 1+total);
3356 isl_int_set(result->ineq[j][1+nparam+n_in+i], d);
3357 isl_int_set_si(result->ineq[j][1+pos+i], -1);
3358 isl_int_sub_ui(result->ineq[j][0], d, 1);
3361 result = isl_basic_map_simplify(result);
3362 return isl_basic_map_finalize(result);
3364 isl_basic_map_free(result);
3368 /* Given a map A -> f(A) and an integer d, construct a map
3369 * A -> floor(f(A)/d).
3371 struct isl_map *isl_map_floordiv(struct isl_map *map, isl_int d)
3375 map = isl_map_cow(map);
3379 ISL_F_CLR(map, ISL_MAP_DISJOINT);
3380 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3381 for (i = 0; i < map->n; ++i) {
3382 map->p[i] = isl_basic_map_floordiv(map->p[i], d);
3393 static struct isl_basic_map *var_equal(struct isl_basic_map *bmap, unsigned pos)
3399 i = isl_basic_map_alloc_equality(bmap);
3402 nparam = isl_basic_map_n_param(bmap);
3403 n_in = isl_basic_map_n_in(bmap);
3404 isl_seq_clr(bmap->eq[i], 1 + isl_basic_map_total_dim(bmap));
3405 isl_int_set_si(bmap->eq[i][1+nparam+pos], -1);
3406 isl_int_set_si(bmap->eq[i][1+nparam+n_in+pos], 1);
3407 return isl_basic_map_finalize(bmap);
3409 isl_basic_map_free(bmap);
3413 /* Add a constraints to "bmap" expressing i_pos < o_pos
3415 static struct isl_basic_map *var_less(struct isl_basic_map *bmap, unsigned pos)
3421 i = isl_basic_map_alloc_inequality(bmap);
3424 nparam = isl_basic_map_n_param(bmap);
3425 n_in = isl_basic_map_n_in(bmap);
3426 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
3427 isl_int_set_si(bmap->ineq[i][0], -1);
3428 isl_int_set_si(bmap->ineq[i][1+nparam+pos], -1);
3429 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], 1);
3430 return isl_basic_map_finalize(bmap);
3432 isl_basic_map_free(bmap);
3436 /* Add a constraint to "bmap" expressing i_pos <= o_pos
3438 static __isl_give isl_basic_map *var_less_or_equal(
3439 __isl_take isl_basic_map *bmap, unsigned pos)
3445 i = isl_basic_map_alloc_inequality(bmap);
3448 nparam = isl_basic_map_n_param(bmap);
3449 n_in = isl_basic_map_n_in(bmap);
3450 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
3451 isl_int_set_si(bmap->ineq[i][1+nparam+pos], -1);
3452 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], 1);
3453 return isl_basic_map_finalize(bmap);
3455 isl_basic_map_free(bmap);
3459 /* Add a constraints to "bmap" expressing i_pos > o_pos
3461 static struct isl_basic_map *var_more(struct isl_basic_map *bmap, unsigned pos)
3467 i = isl_basic_map_alloc_inequality(bmap);
3470 nparam = isl_basic_map_n_param(bmap);
3471 n_in = isl_basic_map_n_in(bmap);
3472 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
3473 isl_int_set_si(bmap->ineq[i][0], -1);
3474 isl_int_set_si(bmap->ineq[i][1+nparam+pos], 1);
3475 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], -1);
3476 return isl_basic_map_finalize(bmap);
3478 isl_basic_map_free(bmap);
3482 /* Add a constraint to "bmap" expressing i_pos >= o_pos
3484 static __isl_give isl_basic_map *var_more_or_equal(
3485 __isl_take isl_basic_map *bmap, unsigned pos)
3491 i = isl_basic_map_alloc_inequality(bmap);
3494 nparam = isl_basic_map_n_param(bmap);
3495 n_in = isl_basic_map_n_in(bmap);
3496 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
3497 isl_int_set_si(bmap->ineq[i][1+nparam+pos], 1);
3498 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], -1);
3499 return isl_basic_map_finalize(bmap);
3501 isl_basic_map_free(bmap);
3505 __isl_give isl_basic_map *isl_basic_map_equal(
3506 __isl_take isl_space *dim, unsigned n_equal)
3509 struct isl_basic_map *bmap;
3510 bmap = isl_basic_map_alloc_space(dim, 0, n_equal, 0);
3513 for (i = 0; i < n_equal && bmap; ++i)
3514 bmap = var_equal(bmap, i);
3515 return isl_basic_map_finalize(bmap);
3518 /* Return a relation on of dimension "dim" expressing i_[0..pos] << o_[0..pos]
3520 __isl_give isl_basic_map *isl_basic_map_less_at(__isl_take isl_space *dim,
3524 struct isl_basic_map *bmap;
3525 bmap = isl_basic_map_alloc_space(dim, 0, pos, 1);
3528 for (i = 0; i < pos && bmap; ++i)
3529 bmap = var_equal(bmap, i);
3531 bmap = var_less(bmap, pos);
3532 return isl_basic_map_finalize(bmap);
3535 /* Return a relation on of dimension "dim" expressing i_[0..pos] <<= o_[0..pos]
3537 __isl_give isl_basic_map *isl_basic_map_less_or_equal_at(
3538 __isl_take isl_space *dim, unsigned pos)
3541 isl_basic_map *bmap;
3543 bmap = isl_basic_map_alloc_space(dim, 0, pos, 1);
3544 for (i = 0; i < pos; ++i)
3545 bmap = var_equal(bmap, i);
3546 bmap = var_less_or_equal(bmap, pos);
3547 return isl_basic_map_finalize(bmap);
3550 /* Return a relation on pairs of sets of dimension "dim" expressing i_pos > o_pos
3552 __isl_give isl_basic_map *isl_basic_map_more_at(__isl_take isl_space *dim,
3556 struct isl_basic_map *bmap;
3557 bmap = isl_basic_map_alloc_space(dim, 0, pos, 1);
3560 for (i = 0; i < pos && bmap; ++i)
3561 bmap = var_equal(bmap, i);
3563 bmap = var_more(bmap, pos);
3564 return isl_basic_map_finalize(bmap);
3567 /* Return a relation on of dimension "dim" expressing i_[0..pos] >>= o_[0..pos]
3569 __isl_give isl_basic_map *isl_basic_map_more_or_equal_at(
3570 __isl_take isl_space *dim, unsigned pos)
3573 isl_basic_map *bmap;
3575 bmap = isl_basic_map_alloc_space(dim, 0, pos, 1);
3576 for (i = 0; i < pos; ++i)
3577 bmap = var_equal(bmap, i);
3578 bmap = var_more_or_equal(bmap, pos);
3579 return isl_basic_map_finalize(bmap);
3582 static __isl_give isl_map *map_lex_lte_first(__isl_take isl_space *dims,
3583 unsigned n, int equal)
3585 struct isl_map *map;
3588 if (n == 0 && equal)
3589 return isl_map_universe(dims);
3591 map = isl_map_alloc_space(isl_space_copy(dims), n, ISL_MAP_DISJOINT);
3593 for (i = 0; i + 1 < n; ++i)
3594 map = isl_map_add_basic_map(map,
3595 isl_basic_map_less_at(isl_space_copy(dims), i));
3598 map = isl_map_add_basic_map(map,
3599 isl_basic_map_less_or_equal_at(dims, n - 1));
3601 map = isl_map_add_basic_map(map,
3602 isl_basic_map_less_at(dims, n - 1));
3604 isl_space_free(dims);
3609 static __isl_give isl_map *map_lex_lte(__isl_take isl_space *dims, int equal)
3613 return map_lex_lte_first(dims, dims->n_out, equal);
3616 __isl_give isl_map *isl_map_lex_lt_first(__isl_take isl_space *dim, unsigned n)
3618 return map_lex_lte_first(dim, n, 0);
3621 __isl_give isl_map *isl_map_lex_le_first(__isl_take isl_space *dim, unsigned n)
3623 return map_lex_lte_first(dim, n, 1);
3626 __isl_give isl_map *isl_map_lex_lt(__isl_take isl_space *set_dim)
3628 return map_lex_lte(isl_space_map_from_set(set_dim), 0);
3631 __isl_give isl_map *isl_map_lex_le(__isl_take isl_space *set_dim)
3633 return map_lex_lte(isl_space_map_from_set(set_dim), 1);
3636 static __isl_give isl_map *map_lex_gte_first(__isl_take isl_space *dims,
3637 unsigned n, int equal)
3639 struct isl_map *map;
3642 if (n == 0 && equal)
3643 return isl_map_universe(dims);
3645 map = isl_map_alloc_space(isl_space_copy(dims), n, ISL_MAP_DISJOINT);
3647 for (i = 0; i + 1 < n; ++i)
3648 map = isl_map_add_basic_map(map,
3649 isl_basic_map_more_at(isl_space_copy(dims), i));
3652 map = isl_map_add_basic_map(map,
3653 isl_basic_map_more_or_equal_at(dims, n - 1));
3655 map = isl_map_add_basic_map(map,
3656 isl_basic_map_more_at(dims, n - 1));
3658 isl_space_free(dims);
3663 static __isl_give isl_map *map_lex_gte(__isl_take isl_space *dims, int equal)
3667 return map_lex_gte_first(dims, dims->n_out, equal);
3670 __isl_give isl_map *isl_map_lex_gt_first(__isl_take isl_space *dim, unsigned n)
3672 return map_lex_gte_first(dim, n, 0);
3675 __isl_give isl_map *isl_map_lex_ge_first(__isl_take isl_space *dim, unsigned n)
3677 return map_lex_gte_first(dim, n, 1);
3680 __isl_give isl_map *isl_map_lex_gt(__isl_take isl_space *set_dim)
3682 return map_lex_gte(isl_space_map_from_set(set_dim), 0);
3685 __isl_give isl_map *isl_map_lex_ge(__isl_take isl_space *set_dim)
3687 return map_lex_gte(isl_space_map_from_set(set_dim), 1);
3690 __isl_give isl_map *isl_set_lex_le_set(__isl_take isl_set *set1,
3691 __isl_take isl_set *set2)
3694 map = isl_map_lex_le(isl_set_get_space(set1));
3695 map = isl_map_intersect_domain(map, set1);
3696 map = isl_map_intersect_range(map, set2);
3700 __isl_give isl_map *isl_set_lex_lt_set(__isl_take isl_set *set1,
3701 __isl_take isl_set *set2)
3704 map = isl_map_lex_lt(isl_set_get_space(set1));
3705 map = isl_map_intersect_domain(map, set1);
3706 map = isl_map_intersect_range(map, set2);
3710 __isl_give isl_map *isl_set_lex_ge_set(__isl_take isl_set *set1,
3711 __isl_take isl_set *set2)
3714 map = isl_map_lex_ge(isl_set_get_space(set1));
3715 map = isl_map_intersect_domain(map, set1);
3716 map = isl_map_intersect_range(map, set2);
3720 __isl_give isl_map *isl_set_lex_gt_set(__isl_take isl_set *set1,
3721 __isl_take isl_set *set2)
3724 map = isl_map_lex_gt(isl_set_get_space(set1));
3725 map = isl_map_intersect_domain(map, set1);
3726 map = isl_map_intersect_range(map, set2);
3730 __isl_give isl_map *isl_map_lex_le_map(__isl_take isl_map *map1,
3731 __isl_take isl_map *map2)
3734 map = isl_map_lex_le(isl_space_range(isl_map_get_space(map1)));
3735 map = isl_map_apply_domain(map, isl_map_reverse(map1));
3736 map = isl_map_apply_range(map, isl_map_reverse(map2));
3740 __isl_give isl_map *isl_map_lex_lt_map(__isl_take isl_map *map1,
3741 __isl_take isl_map *map2)
3744 map = isl_map_lex_lt(isl_space_range(isl_map_get_space(map1)));
3745 map = isl_map_apply_domain(map, isl_map_reverse(map1));
3746 map = isl_map_apply_range(map, isl_map_reverse(map2));
3750 __isl_give isl_map *isl_map_lex_ge_map(__isl_take isl_map *map1,
3751 __isl_take isl_map *map2)
3754 map = isl_map_lex_ge(isl_space_range(isl_map_get_space(map1)));
3755 map = isl_map_apply_domain(map, isl_map_reverse(map1));
3756 map = isl_map_apply_range(map, isl_map_reverse(map2));
3760 __isl_give isl_map *isl_map_lex_gt_map(__isl_take isl_map *map1,
3761 __isl_take isl_map *map2)
3764 map = isl_map_lex_gt(isl_space_range(isl_map_get_space(map1)));
3765 map = isl_map_apply_domain(map, isl_map_reverse(map1));
3766 map = isl_map_apply_range(map, isl_map_reverse(map2));
3770 __isl_give isl_basic_map *isl_basic_map_from_basic_set(
3771 __isl_take isl_basic_set *bset, __isl_take isl_space *dim)
3773 struct isl_basic_map *bmap;
3775 bset = isl_basic_set_cow(bset);
3779 isl_assert(bset->ctx, isl_space_compatible(bset->dim, dim), goto error);
3780 isl_space_free(bset->dim);
3781 bmap = (struct isl_basic_map *) bset;
3783 return isl_basic_map_finalize(bmap);
3785 isl_basic_set_free(bset);
3786 isl_space_free(dim);
3790 struct isl_basic_set *isl_basic_set_from_basic_map(struct isl_basic_map *bmap)
3794 if (bmap->dim->n_in == 0)
3795 return (struct isl_basic_set *)bmap;
3796 bmap = isl_basic_map_cow(bmap);
3799 bmap->dim = isl_space_as_set_space(bmap->dim);
3802 bmap = isl_basic_map_finalize(bmap);
3803 return (struct isl_basic_set *)bmap;
3805 isl_basic_map_free(bmap);
3809 /* For a div d = floor(f/m), add the constraints
3812 * -(f-(n-1)) + m d >= 0
3814 * Note that the second constraint is the negation of
3818 int isl_basic_map_add_div_constraints_var(__isl_keep isl_basic_map *bmap,
3819 unsigned pos, isl_int *div)
3822 unsigned total = isl_basic_map_total_dim(bmap);
3824 i = isl_basic_map_alloc_inequality(bmap);
3827 isl_seq_cpy(bmap->ineq[i], div + 1, 1 + total);
3828 isl_int_neg(bmap->ineq[i][1 + pos], div[0]);
3830 j = isl_basic_map_alloc_inequality(bmap);
3833 isl_seq_neg(bmap->ineq[j], bmap->ineq[i], 1 + total);
3834 isl_int_add(bmap->ineq[j][0], bmap->ineq[j][0], bmap->ineq[j][1 + pos]);
3835 isl_int_sub_ui(bmap->ineq[j][0], bmap->ineq[j][0], 1);
3839 int isl_basic_set_add_div_constraints_var(__isl_keep isl_basic_set *bset,
3840 unsigned pos, isl_int *div)
3842 return isl_basic_map_add_div_constraints_var((isl_basic_map *)bset,
3846 int isl_basic_map_add_div_constraints(struct isl_basic_map *bmap, unsigned div)
3848 unsigned total = isl_basic_map_total_dim(bmap);
3849 unsigned div_pos = total - bmap->n_div + div;
3851 return isl_basic_map_add_div_constraints_var(bmap, div_pos,
3855 struct isl_basic_set *isl_basic_map_underlying_set(
3856 struct isl_basic_map *bmap)
3860 if (bmap->dim->nparam == 0 && bmap->dim->n_in == 0 &&
3862 !isl_space_is_named_or_nested(bmap->dim, isl_dim_in) &&
3863 !isl_space_is_named_or_nested(bmap->dim, isl_dim_out))
3864 return (struct isl_basic_set *)bmap;
3865 bmap = isl_basic_map_cow(bmap);
3868 bmap->dim = isl_space_underlying(bmap->dim, bmap->n_div);
3871 bmap->extra -= bmap->n_div;
3873 bmap = isl_basic_map_finalize(bmap);
3874 return (struct isl_basic_set *)bmap;
3879 __isl_give isl_basic_set *isl_basic_set_underlying_set(
3880 __isl_take isl_basic_set *bset)
3882 return isl_basic_map_underlying_set((isl_basic_map *)bset);
3885 struct isl_basic_map *isl_basic_map_overlying_set(
3886 struct isl_basic_set *bset, struct isl_basic_map *like)
3888 struct isl_basic_map *bmap;
3889 struct isl_ctx *ctx;
3896 isl_assert(ctx, bset->n_div == 0, goto error);
3897 isl_assert(ctx, isl_basic_set_n_param(bset) == 0, goto error);
3898 isl_assert(ctx, bset->dim->n_out == isl_basic_map_total_dim(like),
3900 if (isl_space_is_equal(bset->dim, like->dim) && like->n_div == 0) {
3901 isl_basic_map_free(like);
3902 return (struct isl_basic_map *)bset;
3904 bset = isl_basic_set_cow(bset);
3907 total = bset->dim->n_out + bset->extra;
3908 bmap = (struct isl_basic_map *)bset;
3909 isl_space_free(bmap->dim);
3910 bmap->dim = isl_space_copy(like->dim);
3913 bmap->n_div = like->n_div;
3914 bmap->extra += like->n_div;
3918 ltotal = total - bmap->extra + like->extra;
3921 bmap->block2 = isl_blk_extend(ctx, bmap->block2,
3922 bmap->extra * (1 + 1 + total));
3923 if (isl_blk_is_error(bmap->block2))
3925 div = isl_realloc_array(ctx, bmap->div, isl_int *, bmap->extra);
3929 for (i = 0; i < bmap->extra; ++i)
3930 bmap->div[i] = bmap->block2.data + i * (1 + 1 + total);
3931 for (i = 0; i < like->n_div; ++i) {
3932 isl_seq_cpy(bmap->div[i], like->div[i], 1 + 1 + ltotal);
3933 isl_seq_clr(bmap->div[i]+1+1+ltotal, total - ltotal);
3935 bmap = isl_basic_map_extend_constraints(bmap,
3936 0, 2 * like->n_div);
3937 for (i = 0; i < like->n_div; ++i) {
3938 if (isl_int_is_zero(bmap->div[i][0]))
3940 if (isl_basic_map_add_div_constraints(bmap, i) < 0)
3944 isl_basic_map_free(like);
3945 bmap = isl_basic_map_simplify(bmap);
3946 bmap = isl_basic_map_finalize(bmap);
3949 isl_basic_map_free(like);
3950 isl_basic_set_free(bset);
3954 struct isl_basic_set *isl_basic_set_from_underlying_set(
3955 struct isl_basic_set *bset, struct isl_basic_set *like)
3957 return (struct isl_basic_set *)
3958 isl_basic_map_overlying_set(bset, (struct isl_basic_map *)like);
3961 struct isl_set *isl_set_from_underlying_set(
3962 struct isl_set *set, struct isl_basic_set *like)
3968 isl_assert(set->ctx, set->dim->n_out == isl_basic_set_total_dim(like),
3970 if (isl_space_is_equal(set->dim, like->dim) && like->n_div == 0) {
3971 isl_basic_set_free(like);
3974 set = isl_set_cow(set);
3977 for (i = 0; i < set->n; ++i) {
3978 set->p[i] = isl_basic_set_from_underlying_set(set->p[i],
3979 isl_basic_set_copy(like));
3983 isl_space_free(set->dim);
3984 set->dim = isl_space_copy(like->dim);
3987 isl_basic_set_free(like);
3990 isl_basic_set_free(like);
3995 struct isl_set *isl_map_underlying_set(struct isl_map *map)
3999 map = isl_map_cow(map);
4002 map->dim = isl_space_cow(map->dim);
4006 for (i = 1; i < map->n; ++i)
4007 isl_assert(map->ctx, map->p[0]->n_div == map->p[i]->n_div,
4009 for (i = 0; i < map->n; ++i) {
4010 map->p[i] = (struct isl_basic_map *)
4011 isl_basic_map_underlying_set(map->p[i]);
4016 map->dim = isl_space_underlying(map->dim, 0);
4018 isl_space_free(map->dim);
4019 map->dim = isl_space_copy(map->p[0]->dim);
4023 return (struct isl_set *)map;
4029 struct isl_set *isl_set_to_underlying_set(struct isl_set *set)
4031 return (struct isl_set *)isl_map_underlying_set((struct isl_map *)set);
4034 __isl_give isl_basic_map *isl_basic_map_reset_space(
4035 __isl_take isl_basic_map *bmap, __isl_take isl_space *dim)
4037 bmap = isl_basic_map_cow(bmap);
4041 isl_space_free(bmap->dim);
4044 bmap = isl_basic_map_finalize(bmap);
4048 isl_basic_map_free(bmap);
4049 isl_space_free(dim);
4053 __isl_give isl_basic_set *isl_basic_set_reset_space(
4054 __isl_take isl_basic_set *bset, __isl_take isl_space *dim)
4056 return (isl_basic_set *)isl_basic_map_reset_space((isl_basic_map *)bset,
4060 __isl_give isl_map *isl_map_reset_space(__isl_take isl_map *map,
4061 __isl_take isl_space *dim)
4065 map = isl_map_cow(map);
4069 for (i = 0; i < map->n; ++i) {
4070 map->p[i] = isl_basic_map_reset_space(map->p[i],
4071 isl_space_copy(dim));
4075 isl_space_free(map->dim);
4081 isl_space_free(dim);
4085 __isl_give isl_set *isl_set_reset_space(__isl_take isl_set *set,
4086 __isl_take isl_space *dim)
4088 return (struct isl_set *) isl_map_reset_space((struct isl_map *)set, dim);
4091 /* Compute the parameter domain of the given basic set.
4093 __isl_give isl_basic_set *isl_basic_set_params(__isl_take isl_basic_set *bset)
4098 if (isl_basic_set_is_params(bset))
4101 n = isl_basic_set_dim(bset, isl_dim_set);
4102 bset = isl_basic_set_project_out(bset, isl_dim_set, 0, n);
4103 space = isl_basic_set_get_space(bset);
4104 space = isl_space_params(space);
4105 bset = isl_basic_set_reset_space(bset, space);
4109 /* Compute the parameter domain of the given set.
4111 __isl_give isl_set *isl_set_params(__isl_take isl_set *set)
4116 if (isl_set_is_params(set))
4119 n = isl_set_dim(set, isl_dim_set);
4120 set = isl_set_project_out(set, isl_dim_set, 0, n);
4121 space = isl_set_get_space(set);
4122 space = isl_space_params(space);
4123 set = isl_set_reset_space(set, space);
4127 /* Construct a zero-dimensional set with the given parameter domain.
4129 __isl_give isl_set *isl_set_from_params(__isl_take isl_set *set)
4132 space = isl_set_get_space(set);
4133 space = isl_space_set_from_params(space);
4134 set = isl_set_reset_space(set, space);
4138 /* Compute the parameter domain of the given map.
4140 __isl_give isl_set *isl_map_params(__isl_take isl_map *map)
4145 n = isl_map_dim(map, isl_dim_in);
4146 map = isl_map_project_out(map, isl_dim_in, 0, n);
4147 n = isl_map_dim(map, isl_dim_out);
4148 map = isl_map_project_out(map, isl_dim_out, 0, n);
4149 space = isl_map_get_space(map);
4150 space = isl_space_params(space);
4151 map = isl_map_reset_space(map, space);
4155 struct isl_basic_set *isl_basic_map_domain(struct isl_basic_map *bmap)
4158 struct isl_basic_set *domain;
4164 dim = isl_space_domain(isl_basic_map_get_space(bmap));
4166 n_in = isl_basic_map_n_in(bmap);
4167 n_out = isl_basic_map_n_out(bmap);
4168 domain = isl_basic_set_from_basic_map(bmap);
4169 domain = isl_basic_set_project_out(domain, isl_dim_set, n_in, n_out);
4171 domain = isl_basic_set_reset_space(domain, dim);
4176 int isl_basic_map_may_be_set(__isl_keep isl_basic_map *bmap)
4180 return isl_space_may_be_set(bmap->dim);
4183 /* Is this basic map actually a set?
4184 * Users should never call this function. Outside of isl,
4185 * the type should indicate whether something is a set or a map.
4187 int isl_basic_map_is_set(__isl_keep isl_basic_map *bmap)
4191 return isl_space_is_set(bmap->dim);
4194 struct isl_basic_set *isl_basic_map_range(struct isl_basic_map *bmap)
4198 if (isl_basic_map_is_set(bmap))
4200 return isl_basic_map_domain(isl_basic_map_reverse(bmap));
4203 __isl_give isl_basic_map *isl_basic_map_domain_map(
4204 __isl_take isl_basic_map *bmap)
4208 isl_basic_map *domain;
4209 int nparam, n_in, n_out;
4212 nparam = isl_basic_map_dim(bmap, isl_dim_param);
4213 n_in = isl_basic_map_dim(bmap, isl_dim_in);
4214 n_out = isl_basic_map_dim(bmap, isl_dim_out);
4216 dim = isl_space_from_range(isl_space_domain(isl_basic_map_get_space(bmap)));
4217 domain = isl_basic_map_universe(dim);
4219 bmap = isl_basic_map_from_domain(isl_basic_map_wrap(bmap));
4220 bmap = isl_basic_map_apply_range(bmap, domain);
4221 bmap = isl_basic_map_extend_constraints(bmap, n_in, 0);
4223 total = isl_basic_map_total_dim(bmap);
4225 for (i = 0; i < n_in; ++i) {
4226 k = isl_basic_map_alloc_equality(bmap);
4229 isl_seq_clr(bmap->eq[k], 1 + total);
4230 isl_int_set_si(bmap->eq[k][1 + nparam + i], -1);
4231 isl_int_set_si(bmap->eq[k][1 + nparam + n_in + n_out + i], 1);
4234 bmap = isl_basic_map_gauss(bmap, NULL);
4235 return isl_basic_map_finalize(bmap);
4237 isl_basic_map_free(bmap);
4241 __isl_give isl_basic_map *isl_basic_map_range_map(
4242 __isl_take isl_basic_map *bmap)
4246 isl_basic_map *range;
4247 int nparam, n_in, n_out;
4250 nparam = isl_basic_map_dim(bmap, isl_dim_param);
4251 n_in = isl_basic_map_dim(bmap, isl_dim_in);
4252 n_out = isl_basic_map_dim(bmap, isl_dim_out);
4254 dim = isl_space_from_range(isl_space_range(isl_basic_map_get_space(bmap)));
4255 range = isl_basic_map_universe(dim);
4257 bmap = isl_basic_map_from_domain(isl_basic_map_wrap(bmap));
4258 bmap = isl_basic_map_apply_range(bmap, range);
4259 bmap = isl_basic_map_extend_constraints(bmap, n_out, 0);
4261 total = isl_basic_map_total_dim(bmap);
4263 for (i = 0; i < n_out; ++i) {
4264 k = isl_basic_map_alloc_equality(bmap);
4267 isl_seq_clr(bmap->eq[k], 1 + total);
4268 isl_int_set_si(bmap->eq[k][1 + nparam + n_in + i], -1);
4269 isl_int_set_si(bmap->eq[k][1 + nparam + n_in + n_out + i], 1);
4272 bmap = isl_basic_map_gauss(bmap, NULL);
4273 return isl_basic_map_finalize(bmap);
4275 isl_basic_map_free(bmap);
4279 int isl_map_may_be_set(__isl_keep isl_map *map)
4283 return isl_space_may_be_set(map->dim);
4286 /* Is this map actually a set?
4287 * Users should never call this function. Outside of isl,
4288 * the type should indicate whether something is a set or a map.
4290 int isl_map_is_set(__isl_keep isl_map *map)
4294 return isl_space_is_set(map->dim);
4297 struct isl_set *isl_map_range(struct isl_map *map)
4300 struct isl_set *set;
4304 if (isl_map_is_set(map))
4305 return (isl_set *)map;
4307 map = isl_map_cow(map);
4311 set = (struct isl_set *) map;
4312 set->dim = isl_space_range(set->dim);
4315 for (i = 0; i < map->n; ++i) {
4316 set->p[i] = isl_basic_map_range(map->p[i]);
4320 ISL_F_CLR(set, ISL_MAP_DISJOINT);
4321 ISL_F_CLR(set, ISL_SET_NORMALIZED);
4328 __isl_give isl_map *isl_map_domain_map(__isl_take isl_map *map)
4331 isl_space *domain_dim;
4333 map = isl_map_cow(map);
4337 domain_dim = isl_space_from_range(isl_space_domain(isl_map_get_space(map)));
4338 map->dim = isl_space_from_domain(isl_space_wrap(map->dim));
4339 map->dim = isl_space_join(map->dim, domain_dim);
4342 for (i = 0; i < map->n; ++i) {
4343 map->p[i] = isl_basic_map_domain_map(map->p[i]);
4347 ISL_F_CLR(map, ISL_MAP_DISJOINT);
4348 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4355 __isl_give isl_map *isl_map_range_map(__isl_take isl_map *map)
4358 isl_space *range_dim;
4360 map = isl_map_cow(map);
4364 range_dim = isl_space_range(isl_map_get_space(map));
4365 range_dim = isl_space_from_range(range_dim);
4366 map->dim = isl_space_from_domain(isl_space_wrap(map->dim));
4367 map->dim = isl_space_join(map->dim, range_dim);
4370 for (i = 0; i < map->n; ++i) {
4371 map->p[i] = isl_basic_map_range_map(map->p[i]);
4375 ISL_F_CLR(map, ISL_MAP_DISJOINT);
4376 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4383 __isl_give isl_map *isl_map_from_set(__isl_take isl_set *set,
4384 __isl_take isl_space *dim)
4387 struct isl_map *map = NULL;
4389 set = isl_set_cow(set);
4392 isl_assert(set->ctx, isl_space_compatible(set->dim, dim), goto error);
4393 map = (struct isl_map *)set;
4394 for (i = 0; i < set->n; ++i) {
4395 map->p[i] = isl_basic_map_from_basic_set(
4396 set->p[i], isl_space_copy(dim));
4400 isl_space_free(map->dim);
4404 isl_space_free(dim);
4409 __isl_give isl_basic_map *isl_basic_map_from_domain(
4410 __isl_take isl_basic_set *bset)
4412 return isl_basic_map_reverse(isl_basic_map_from_range(bset));
4415 __isl_give isl_basic_map *isl_basic_map_from_range(
4416 __isl_take isl_basic_set *bset)
4419 space = isl_basic_set_get_space(bset);
4420 space = isl_space_from_range(space);
4421 bset = isl_basic_set_reset_space(bset, space);
4422 return (isl_basic_map *)bset;
4425 struct isl_map *isl_map_from_range(struct isl_set *set)
4428 space = isl_set_get_space(set);
4429 space = isl_space_from_range(space);
4430 set = isl_set_reset_space(set, space);
4431 return (struct isl_map *)set;
4434 __isl_give isl_map *isl_map_from_domain(__isl_take isl_set *set)
4436 return isl_map_reverse(isl_map_from_range(set));
4439 __isl_give isl_basic_map *isl_basic_map_from_domain_and_range(
4440 __isl_take isl_basic_set *domain, __isl_take isl_basic_set *range)
4442 return isl_basic_map_apply_range(isl_basic_map_reverse(domain), range);
4445 __isl_give isl_map *isl_map_from_domain_and_range(__isl_take isl_set *domain,
4446 __isl_take isl_set *range)
4448 return isl_map_apply_range(isl_map_reverse(domain), range);
4451 struct isl_set *isl_set_from_map(struct isl_map *map)
4454 struct isl_set *set = NULL;
4458 map = isl_map_cow(map);
4461 map->dim = isl_space_as_set_space(map->dim);
4464 set = (struct isl_set *)map;
4465 for (i = 0; i < map->n; ++i) {
4466 set->p[i] = isl_basic_set_from_basic_map(map->p[i]);
4476 __isl_give isl_map *isl_map_alloc_space(__isl_take isl_space *dim, int n,
4479 struct isl_map *map;
4483 isl_assert(dim->ctx, n >= 0, return NULL);
4484 map = isl_alloc(dim->ctx, struct isl_map,
4485 sizeof(struct isl_map) +
4486 (n - 1) * sizeof(struct isl_basic_map *));
4490 map->ctx = dim->ctx;
4491 isl_ctx_ref(map->ctx);
4499 isl_space_free(dim);
4503 struct isl_map *isl_map_alloc(struct isl_ctx *ctx,
4504 unsigned nparam, unsigned in, unsigned out, int n,
4507 struct isl_map *map;
4510 dims = isl_space_alloc(ctx, nparam, in, out);
4514 map = isl_map_alloc_space(dims, n, flags);
4518 __isl_give isl_basic_map *isl_basic_map_empty(__isl_take isl_space *dim)
4520 struct isl_basic_map *bmap;
4521 bmap = isl_basic_map_alloc_space(dim, 0, 1, 0);
4522 bmap = isl_basic_map_set_to_empty(bmap);
4526 __isl_give isl_basic_set *isl_basic_set_empty(__isl_take isl_space *dim)
4528 struct isl_basic_set *bset;
4529 bset = isl_basic_set_alloc_space(dim, 0, 1, 0);
4530 bset = isl_basic_set_set_to_empty(bset);
4534 struct isl_basic_map *isl_basic_map_empty_like(struct isl_basic_map *model)
4536 struct isl_basic_map *bmap;
4539 bmap = isl_basic_map_alloc_space(isl_space_copy(model->dim), 0, 1, 0);
4540 bmap = isl_basic_map_set_to_empty(bmap);
4544 struct isl_basic_map *isl_basic_map_empty_like_map(struct isl_map *model)
4546 struct isl_basic_map *bmap;
4549 bmap = isl_basic_map_alloc_space(isl_space_copy(model->dim), 0, 1, 0);
4550 bmap = isl_basic_map_set_to_empty(bmap);
4554 struct isl_basic_set *isl_basic_set_empty_like(struct isl_basic_set *model)
4556 struct isl_basic_set *bset;
4559 bset = isl_basic_set_alloc_space(isl_space_copy(model->dim), 0, 1, 0);
4560 bset = isl_basic_set_set_to_empty(bset);
4564 __isl_give isl_basic_map *isl_basic_map_universe(__isl_take isl_space *dim)
4566 struct isl_basic_map *bmap;
4567 bmap = isl_basic_map_alloc_space(dim, 0, 0, 0);
4568 bmap = isl_basic_map_finalize(bmap);
4572 __isl_give isl_basic_set *isl_basic_set_universe(__isl_take isl_space *dim)
4574 struct isl_basic_set *bset;
4575 bset = isl_basic_set_alloc_space(dim, 0, 0, 0);
4576 bset = isl_basic_set_finalize(bset);
4580 __isl_give isl_basic_map *isl_basic_map_nat_universe(__isl_take isl_space *dim)
4583 unsigned total = isl_space_dim(dim, isl_dim_all);
4584 isl_basic_map *bmap;
4586 bmap= isl_basic_map_alloc_space(dim, 0, 0, total);
4587 for (i = 0; i < total; ++i) {
4588 int k = isl_basic_map_alloc_inequality(bmap);
4591 isl_seq_clr(bmap->ineq[k], 1 + total);
4592 isl_int_set_si(bmap->ineq[k][1 + i], 1);
4596 isl_basic_map_free(bmap);
4600 __isl_give isl_basic_set *isl_basic_set_nat_universe(__isl_take isl_space *dim)
4602 return isl_basic_map_nat_universe(dim);
4605 __isl_give isl_map *isl_map_nat_universe(__isl_take isl_space *dim)
4607 return isl_map_from_basic_map(isl_basic_map_nat_universe(dim));
4610 __isl_give isl_set *isl_set_nat_universe(__isl_take isl_space *dim)
4612 return isl_map_nat_universe(dim);
4615 __isl_give isl_basic_map *isl_basic_map_universe_like(
4616 __isl_keep isl_basic_map *model)
4620 return isl_basic_map_alloc_space(isl_space_copy(model->dim), 0, 0, 0);
4623 struct isl_basic_set *isl_basic_set_universe_like(struct isl_basic_set *model)
4627 return isl_basic_set_alloc_space(isl_space_copy(model->dim), 0, 0, 0);
4630 __isl_give isl_basic_set *isl_basic_set_universe_like_set(
4631 __isl_keep isl_set *model)
4635 return isl_basic_set_alloc_space(isl_space_copy(model->dim), 0, 0, 0);
4638 __isl_give isl_map *isl_map_empty(__isl_take isl_space *dim)
4640 return isl_map_alloc_space(dim, 0, ISL_MAP_DISJOINT);
4643 struct isl_map *isl_map_empty_like(struct isl_map *model)
4647 return isl_map_alloc_space(isl_space_copy(model->dim), 0, ISL_MAP_DISJOINT);
4650 struct isl_map *isl_map_empty_like_basic_map(struct isl_basic_map *model)
4654 return isl_map_alloc_space(isl_space_copy(model->dim), 0, ISL_MAP_DISJOINT);
4657 __isl_give isl_set *isl_set_empty(__isl_take isl_space *dim)
4659 return isl_set_alloc_space(dim, 0, ISL_MAP_DISJOINT);
4662 struct isl_set *isl_set_empty_like(struct isl_set *model)
4666 return isl_set_empty(isl_space_copy(model->dim));
4669 __isl_give isl_map *isl_map_universe(__isl_take isl_space *dim)
4671 struct isl_map *map;
4674 map = isl_map_alloc_space(isl_space_copy(dim), 1, ISL_MAP_DISJOINT);
4675 map = isl_map_add_basic_map(map, isl_basic_map_universe(dim));
4679 __isl_give isl_set *isl_set_universe(__isl_take isl_space *dim)
4681 struct isl_set *set;
4684 set = isl_set_alloc_space(isl_space_copy(dim), 1, ISL_MAP_DISJOINT);
4685 set = isl_set_add_basic_set(set, isl_basic_set_universe(dim));
4689 __isl_give isl_set *isl_set_universe_like(__isl_keep isl_set *model)
4693 return isl_set_universe(isl_space_copy(model->dim));
4696 struct isl_map *isl_map_dup(struct isl_map *map)
4699 struct isl_map *dup;
4703 dup = isl_map_alloc_space(isl_space_copy(map->dim), map->n, map->flags);
4704 for (i = 0; i < map->n; ++i)
4705 dup = isl_map_add_basic_map(dup, isl_basic_map_copy(map->p[i]));
4709 __isl_give isl_map *isl_map_add_basic_map(__isl_take isl_map *map,
4710 __isl_take isl_basic_map *bmap)
4714 if (isl_basic_map_plain_is_empty(bmap)) {
4715 isl_basic_map_free(bmap);
4718 isl_assert(map->ctx, isl_space_is_equal(map->dim, bmap->dim), goto error);
4719 isl_assert(map->ctx, map->n < map->size, goto error);
4720 map->p[map->n] = bmap;
4722 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4728 isl_basic_map_free(bmap);
4732 void isl_map_free(struct isl_map *map)
4742 isl_ctx_deref(map->ctx);
4743 for (i = 0; i < map->n; ++i)
4744 isl_basic_map_free(map->p[i]);
4745 isl_space_free(map->dim);
4749 struct isl_map *isl_map_extend(struct isl_map *base,
4750 unsigned nparam, unsigned n_in, unsigned n_out)
4754 base = isl_map_cow(base);
4758 base->dim = isl_space_extend(base->dim, nparam, n_in, n_out);
4761 for (i = 0; i < base->n; ++i) {
4762 base->p[i] = isl_basic_map_extend_space(base->p[i],
4763 isl_space_copy(base->dim), 0, 0, 0);
4773 struct isl_set *isl_set_extend(struct isl_set *base,
4774 unsigned nparam, unsigned dim)
4776 return (struct isl_set *)isl_map_extend((struct isl_map *)base,
4780 static struct isl_basic_map *isl_basic_map_fix_pos_si(
4781 struct isl_basic_map *bmap, unsigned pos, int value)
4785 bmap = isl_basic_map_cow(bmap);
4786 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
4787 j = isl_basic_map_alloc_equality(bmap);
4790 isl_seq_clr(bmap->eq[j] + 1, isl_basic_map_total_dim(bmap));
4791 isl_int_set_si(bmap->eq[j][pos], -1);
4792 isl_int_set_si(bmap->eq[j][0], value);
4793 bmap = isl_basic_map_simplify(bmap);
4794 return isl_basic_map_finalize(bmap);
4796 isl_basic_map_free(bmap);
4800 static __isl_give isl_basic_map *isl_basic_map_fix_pos(
4801 __isl_take isl_basic_map *bmap, unsigned pos, isl_int value)
4805 bmap = isl_basic_map_cow(bmap);
4806 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
4807 j = isl_basic_map_alloc_equality(bmap);
4810 isl_seq_clr(bmap->eq[j] + 1, isl_basic_map_total_dim(bmap));
4811 isl_int_set_si(bmap->eq[j][pos], -1);
4812 isl_int_set(bmap->eq[j][0], value);
4813 bmap = isl_basic_map_simplify(bmap);
4814 return isl_basic_map_finalize(bmap);
4816 isl_basic_map_free(bmap);
4820 struct isl_basic_map *isl_basic_map_fix_si(struct isl_basic_map *bmap,
4821 enum isl_dim_type type, unsigned pos, int value)
4825 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
4826 return isl_basic_map_fix_pos_si(bmap,
4827 isl_basic_map_offset(bmap, type) + pos, value);
4829 isl_basic_map_free(bmap);
4833 __isl_give isl_basic_map *isl_basic_map_fix(__isl_take isl_basic_map *bmap,
4834 enum isl_dim_type type, unsigned pos, isl_int value)
4838 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
4839 return isl_basic_map_fix_pos(bmap,
4840 isl_basic_map_offset(bmap, type) + pos, value);
4842 isl_basic_map_free(bmap);
4846 struct isl_basic_set *isl_basic_set_fix_si(struct isl_basic_set *bset,
4847 enum isl_dim_type type, unsigned pos, int value)
4849 return (struct isl_basic_set *)
4850 isl_basic_map_fix_si((struct isl_basic_map *)bset,
4854 __isl_give isl_basic_set *isl_basic_set_fix(__isl_take isl_basic_set *bset,
4855 enum isl_dim_type type, unsigned pos, isl_int value)
4857 return (struct isl_basic_set *)
4858 isl_basic_map_fix((struct isl_basic_map *)bset,
4862 struct isl_basic_map *isl_basic_map_fix_input_si(struct isl_basic_map *bmap,
4863 unsigned input, int value)
4865 return isl_basic_map_fix_si(bmap, isl_dim_in, input, value);
4868 struct isl_basic_set *isl_basic_set_fix_dim_si(struct isl_basic_set *bset,
4869 unsigned dim, int value)
4871 return (struct isl_basic_set *)
4872 isl_basic_map_fix_si((struct isl_basic_map *)bset,
4873 isl_dim_set, dim, value);
4876 struct isl_map *isl_map_fix_si(struct isl_map *map,
4877 enum isl_dim_type type, unsigned pos, int value)
4881 map = isl_map_cow(map);
4885 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
4886 for (i = 0; i < map->n; ++i) {
4887 map->p[i] = isl_basic_map_fix_si(map->p[i], type, pos, value);
4891 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4898 __isl_give isl_set *isl_set_fix_si(__isl_take isl_set *set,
4899 enum isl_dim_type type, unsigned pos, int value)
4901 return (struct isl_set *)
4902 isl_map_fix_si((struct isl_map *)set, type, pos, value);
4905 __isl_give isl_map *isl_map_fix(__isl_take isl_map *map,
4906 enum isl_dim_type type, unsigned pos, isl_int value)
4910 map = isl_map_cow(map);
4914 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
4915 for (i = 0; i < map->n; ++i) {
4916 map->p[i] = isl_basic_map_fix(map->p[i], type, pos, value);
4920 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4927 __isl_give isl_set *isl_set_fix(__isl_take isl_set *set,
4928 enum isl_dim_type type, unsigned pos, isl_int value)
4930 return (struct isl_set *)isl_map_fix((isl_map *)set, type, pos, value);
4933 struct isl_map *isl_map_fix_input_si(struct isl_map *map,
4934 unsigned input, int value)
4936 return isl_map_fix_si(map, isl_dim_in, input, value);
4939 struct isl_set *isl_set_fix_dim_si(struct isl_set *set, unsigned dim, int value)
4941 return (struct isl_set *)
4942 isl_map_fix_si((struct isl_map *)set, isl_dim_set, dim, value);
4945 __isl_give isl_basic_map *isl_basic_map_lower_bound_si(
4946 __isl_take isl_basic_map *bmap,
4947 enum isl_dim_type type, unsigned pos, int value)
4953 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
4954 pos += isl_basic_map_offset(bmap, type);
4955 bmap = isl_basic_map_cow(bmap);
4956 bmap = isl_basic_map_extend_constraints(bmap, 0, 1);
4957 j = isl_basic_map_alloc_inequality(bmap);
4960 isl_seq_clr(bmap->ineq[j], 1 + isl_basic_map_total_dim(bmap));
4961 isl_int_set_si(bmap->ineq[j][pos], 1);
4962 isl_int_set_si(bmap->ineq[j][0], -value);
4963 bmap = isl_basic_map_simplify(bmap);
4964 return isl_basic_map_finalize(bmap);
4966 isl_basic_map_free(bmap);
4970 struct isl_basic_set *isl_basic_set_lower_bound_dim(struct isl_basic_set *bset,
4971 unsigned dim, isl_int value)
4975 bset = isl_basic_set_cow(bset);
4976 bset = isl_basic_set_extend_constraints(bset, 0, 1);
4977 j = isl_basic_set_alloc_inequality(bset);
4980 isl_seq_clr(bset->ineq[j], 1 + isl_basic_set_total_dim(bset));
4981 isl_int_set_si(bset->ineq[j][1 + isl_basic_set_n_param(bset) + dim], 1);
4982 isl_int_neg(bset->ineq[j][0], value);
4983 bset = isl_basic_set_simplify(bset);
4984 return isl_basic_set_finalize(bset);
4986 isl_basic_set_free(bset);
4990 __isl_give isl_map *isl_map_lower_bound_si(__isl_take isl_map *map,
4991 enum isl_dim_type type, unsigned pos, int value)
4995 map = isl_map_cow(map);
4999 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
5000 for (i = 0; i < map->n; ++i) {
5001 map->p[i] = isl_basic_map_lower_bound_si(map->p[i],
5006 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
5013 __isl_give isl_set *isl_set_lower_bound_si(__isl_take isl_set *set,
5014 enum isl_dim_type type, unsigned pos, int value)
5016 return (struct isl_set *)
5017 isl_map_lower_bound_si((struct isl_map *)set, type, pos, value);
5020 struct isl_set *isl_set_lower_bound_dim(struct isl_set *set, unsigned dim,
5025 set = isl_set_cow(set);
5029 isl_assert(set->ctx, dim < isl_set_n_dim(set), goto error);
5030 for (i = 0; i < set->n; ++i) {
5031 set->p[i] = isl_basic_set_lower_bound_dim(set->p[i], dim, value);
5041 struct isl_map *isl_map_reverse(struct isl_map *map)
5045 map = isl_map_cow(map);
5049 map->dim = isl_space_reverse(map->dim);
5052 for (i = 0; i < map->n; ++i) {
5053 map->p[i] = isl_basic_map_reverse(map->p[i]);
5057 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
5064 static struct isl_map *isl_basic_map_partial_lexopt(
5065 struct isl_basic_map *bmap, struct isl_basic_set *dom,
5066 struct isl_set **empty, int max)
5070 if (bmap->ctx->opt->pip == ISL_PIP_PIP)
5071 return isl_pip_basic_map_lexopt(bmap, dom, empty, max);
5073 return isl_tab_basic_map_partial_lexopt(bmap, dom, empty, max);
5075 isl_basic_map_free(bmap);
5076 isl_basic_set_free(dom);
5082 struct isl_map *isl_basic_map_partial_lexmax(
5083 struct isl_basic_map *bmap, struct isl_basic_set *dom,
5084 struct isl_set **empty)
5086 return isl_basic_map_partial_lexopt(bmap, dom, empty, 1);
5089 struct isl_map *isl_basic_map_partial_lexmin(
5090 struct isl_basic_map *bmap, struct isl_basic_set *dom,
5091 struct isl_set **empty)
5093 return isl_basic_map_partial_lexopt(bmap, dom, empty, 0);
5096 struct isl_set *isl_basic_set_partial_lexmin(
5097 struct isl_basic_set *bset, struct isl_basic_set *dom,
5098 struct isl_set **empty)
5100 return (struct isl_set *)
5101 isl_basic_map_partial_lexmin((struct isl_basic_map *)bset,
5105 struct isl_set *isl_basic_set_partial_lexmax(
5106 struct isl_basic_set *bset, struct isl_basic_set *dom,
5107 struct isl_set **empty)
5109 return (struct isl_set *)
5110 isl_basic_map_partial_lexmax((struct isl_basic_map *)bset,
5114 /* Given a basic map "bmap", compute the lexicographically minimal
5115 * (or maximal) image element for each domain element in dom.
5116 * Set *empty to those elements in dom that do not have an image element.
5118 * We first make sure the basic sets in dom are disjoint and then
5119 * simply collect the results over each of the basic sets separately.
5120 * We could probably improve the efficiency a bit by moving the union
5121 * domain down into the parametric integer programming.
5123 static __isl_give isl_map *basic_map_partial_lexopt(
5124 __isl_take isl_basic_map *bmap, __isl_take isl_set *dom,
5125 __isl_give isl_set **empty, int max)
5128 struct isl_map *res;
5130 dom = isl_set_make_disjoint(dom);
5134 if (isl_set_plain_is_empty(dom)) {
5135 res = isl_map_empty_like_basic_map(bmap);
5136 *empty = isl_set_empty_like(dom);
5138 isl_basic_map_free(bmap);
5142 res = isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap),
5143 isl_basic_set_copy(dom->p[0]), empty, max);
5145 for (i = 1; i < dom->n; ++i) {
5146 struct isl_map *res_i;
5147 struct isl_set *empty_i;
5149 res_i = isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap),
5150 isl_basic_set_copy(dom->p[i]), &empty_i, max);
5152 res = isl_map_union_disjoint(res, res_i);
5153 *empty = isl_set_union_disjoint(*empty, empty_i);
5157 isl_basic_map_free(bmap);
5162 isl_basic_map_free(bmap);
5166 /* Given a map "map", compute the lexicographically minimal
5167 * (or maximal) image element for each domain element in dom.
5168 * Set *empty to those elements in dom that do not have an image element.
5170 * We first compute the lexicographically minimal or maximal element
5171 * in the first basic map. This results in a partial solution "res"
5172 * and a subset "todo" of dom that still need to be handled.
5173 * We then consider each of the remaining maps in "map" and successively
5174 * improve both "res" and "todo".
5176 * Let res^k and todo^k be the results after k steps and let i = k + 1.
5177 * Assume we are computing the lexicographical maximum.
5178 * We first compute the lexicographically maximal element in basic map i.
5179 * This results in a partial solution res_i and a subset todo_i.
5180 * Then we combine these results with those obtain for the first k basic maps
5181 * to obtain a result that is valid for the first k+1 basic maps.
5182 * In particular, the set where there is no solution is the set where
5183 * there is no solution for the first k basic maps and also no solution
5184 * for the ith basic map, i.e.,
5186 * todo^i = todo^k * todo_i
5188 * On dom(res^k) * dom(res_i), we need to pick the larger of the two
5189 * solutions, arbitrarily breaking ties in favor of res^k.
5190 * That is, when res^k(a) >= res_i(a), we pick res^k and
5191 * when res^k(a) < res_i(a), we pick res_i. (Here, ">=" and "<" denote
5192 * the lexicographic order.)
5193 * In practice, we compute
5195 * res^k * (res_i . "<=")
5199 * res_i * (res^k . "<")
5201 * Finally, we consider the symmetric difference of dom(res^k) and dom(res_i),
5202 * where only one of res^k and res_i provides a solution and we simply pick
5209 * Note that we only compute these intersections when dom(res^k) intersects
5210 * dom(res_i). Otherwise, the only effect of these intersections is to
5211 * potentially break up res^k and res_i into smaller pieces.
5212 * We want to avoid such splintering as much as possible.
5213 * In fact, an earlier implementation of this function would look for
5214 * better results in the domain of res^k and for extra results in todo^k,
5215 * but this would always result in a splintering according to todo^k,
5216 * even when the domain of basic map i is disjoint from the domains of
5217 * the previous basic maps.
5219 static __isl_give isl_map *isl_map_partial_lexopt_aligned(
5220 __isl_take isl_map *map, __isl_take isl_set *dom,
5221 __isl_give isl_set **empty, int max)
5224 struct isl_map *res;
5225 struct isl_set *todo;
5230 if (isl_map_plain_is_empty(map)) {
5238 res = basic_map_partial_lexopt(isl_basic_map_copy(map->p[0]),
5239 isl_set_copy(dom), &todo, max);
5241 for (i = 1; i < map->n; ++i) {
5245 isl_space *dim = isl_space_range(isl_map_get_space(res));
5247 res_i = basic_map_partial_lexopt(isl_basic_map_copy(map->p[i]),
5248 isl_set_copy(dom), &todo_i, max);
5251 lt = isl_map_lex_lt(isl_space_copy(dim));
5252 le = isl_map_lex_le(dim);
5254 lt = isl_map_lex_gt(isl_space_copy(dim));
5255 le = isl_map_lex_ge(dim);
5257 lt = isl_map_apply_range(isl_map_copy(res), lt);
5258 lt = isl_map_intersect(lt, isl_map_copy(res_i));
5259 le = isl_map_apply_range(isl_map_copy(res_i), le);
5260 le = isl_map_intersect(le, isl_map_copy(res));
5262 if (!isl_map_is_empty(lt) || !isl_map_is_empty(le)) {
5263 res = isl_map_intersect_domain(res,
5264 isl_set_copy(todo_i));
5265 res_i = isl_map_intersect_domain(res_i,
5266 isl_set_copy(todo));
5269 res = isl_map_union_disjoint(res, res_i);
5270 res = isl_map_union_disjoint(res, lt);
5271 res = isl_map_union_disjoint(res, le);
5273 todo = isl_set_intersect(todo, todo_i);
5293 /* Given a map "map", compute the lexicographically minimal
5294 * (or maximal) image element for each domain element in dom.
5295 * Set *empty to those elements in dom that do not have an image element.
5297 * Align parameters if needed and then call isl_map_partial_lexopt_aligned.
5299 static __isl_give isl_map *isl_map_partial_lexopt(
5300 __isl_take isl_map *map, __isl_take isl_set *dom,
5301 __isl_give isl_set **empty, int max)
5305 if (isl_space_match(map->dim, isl_dim_param, dom->dim, isl_dim_param))
5306 return isl_map_partial_lexopt_aligned(map, dom, empty, max);
5307 if (!isl_space_has_named_params(map->dim) ||
5308 !isl_space_has_named_params(dom->dim))
5309 isl_die(map->ctx, isl_error_invalid,
5310 "unaligned unnamed parameters", goto error);
5311 map = isl_map_align_params(map, isl_map_get_space(dom));
5312 dom = isl_map_align_params(dom, isl_map_get_space(map));
5313 return isl_map_partial_lexopt_aligned(map, dom, empty, max);
5322 __isl_give isl_map *isl_map_partial_lexmax(
5323 __isl_take isl_map *map, __isl_take isl_set *dom,
5324 __isl_give isl_set **empty)
5326 return isl_map_partial_lexopt(map, dom, empty, 1);
5329 __isl_give isl_map *isl_map_partial_lexmin(
5330 __isl_take isl_map *map, __isl_take isl_set *dom,
5331 __isl_give isl_set **empty)
5333 return isl_map_partial_lexopt(map, dom, empty, 0);
5336 __isl_give isl_set *isl_set_partial_lexmin(
5337 __isl_take isl_set *set, __isl_take isl_set *dom,
5338 __isl_give isl_set **empty)
5340 return (struct isl_set *)
5341 isl_map_partial_lexmin((struct isl_map *)set,
5345 __isl_give isl_set *isl_set_partial_lexmax(
5346 __isl_take isl_set *set, __isl_take isl_set *dom,
5347 __isl_give isl_set **empty)
5349 return (struct isl_set *)
5350 isl_map_partial_lexmax((struct isl_map *)set,
5354 __isl_give isl_map *isl_basic_map_lexopt(__isl_take isl_basic_map *bmap, int max)
5356 struct isl_basic_set *dom = NULL;
5361 dom_dim = isl_space_domain(isl_space_copy(bmap->dim));
5362 dom = isl_basic_set_universe(dom_dim);
5363 return isl_basic_map_partial_lexopt(bmap, dom, NULL, max);
5365 isl_basic_map_free(bmap);
5369 __isl_give isl_map *isl_basic_map_lexmin(__isl_take isl_basic_map *bmap)
5371 return isl_basic_map_lexopt(bmap, 0);
5374 __isl_give isl_map *isl_basic_map_lexmax(__isl_take isl_basic_map *bmap)
5376 return isl_basic_map_lexopt(bmap, 1);
5379 __isl_give isl_set *isl_basic_set_lexmin(__isl_take isl_basic_set *bset)
5381 return (isl_set *)isl_basic_map_lexmin((isl_basic_map *)bset);
5384 __isl_give isl_set *isl_basic_set_lexmax(__isl_take isl_basic_set *bset)
5386 return (isl_set *)isl_basic_map_lexmax((isl_basic_map *)bset);
5389 __isl_give isl_map *isl_map_lexopt(__isl_take isl_map *map, int max)
5391 struct isl_set *dom = NULL;
5396 dom_dim = isl_space_domain(isl_space_copy(map->dim));
5397 dom = isl_set_universe(dom_dim);
5398 return isl_map_partial_lexopt(map, dom, NULL, max);
5404 __isl_give isl_map *isl_map_lexmin(__isl_take isl_map *map)
5406 return isl_map_lexopt(map, 0);
5409 __isl_give isl_map *isl_map_lexmax(__isl_take isl_map *map)
5411 return isl_map_lexopt(map, 1);
5414 __isl_give isl_set *isl_set_lexmin(__isl_take isl_set *set)
5416 return (isl_set *)isl_map_lexmin((isl_map *)set);
5419 __isl_give isl_set *isl_set_lexmax(__isl_take isl_set *set)
5421 return (isl_set *)isl_map_lexmax((isl_map *)set);
5424 /* Construct a map that equates the two given dimensions in the given space.
5426 static __isl_give isl_map *equate(__isl_take isl_space *dim,
5427 enum isl_dim_type src_type, int src_pos,
5428 enum isl_dim_type dst_type, int dst_pos)
5430 isl_basic_map *bmap;
5433 bmap = isl_basic_map_alloc_space(dim, 0, 1, 0);
5434 k = isl_basic_map_alloc_equality(bmap);
5437 isl_seq_clr(bmap->eq[k], 1 + isl_basic_map_total_dim(bmap));
5438 src_pos += isl_basic_map_offset(bmap, src_type);
5439 dst_pos += isl_basic_map_offset(bmap, dst_type);
5440 isl_int_set_si(bmap->eq[k][src_pos], 1);
5441 isl_int_set_si(bmap->eq[k][dst_pos], -1);
5443 return isl_map_from_basic_map(bmap);
5445 isl_basic_map_free(bmap);
5449 /* Extract the first and only affine expression from list
5450 * and then add it to *pwaff with the given dom.
5451 * This domain is known to be disjoint from other domains
5452 * because of the way isl_basic_set_foreach_lexmax works.
5454 static int update_dim_opt(__isl_take isl_basic_set *dom,
5455 __isl_take isl_aff_list *list, void *user)
5457 isl_ctx *ctx = isl_basic_set_get_ctx(dom);
5459 isl_pw_aff **pwaff = user;
5460 isl_pw_aff *pwaff_i;
5462 if (isl_aff_list_n_aff(list) != 1)
5463 isl_die(ctx, isl_error_internal,
5464 "expecting single element list", goto error);
5466 aff = isl_aff_list_get_aff(list, 0);
5467 pwaff_i = isl_pw_aff_alloc(isl_set_from_basic_set(dom), aff);
5469 *pwaff = isl_pw_aff_add_disjoint(*pwaff, pwaff_i);
5471 isl_aff_list_free(list);
5475 isl_basic_set_free(dom);
5476 isl_aff_list_free(list);
5480 /* Given a one-dimensional basic set, compute the minimum or maximum of that
5481 * dimension as an isl_pw_aff.
5483 * The isl_pw_aff is constructed by having isl_basic_set_foreach_lexopt
5484 * call update_dim_opt on each leaf of the result.
5486 static __isl_give isl_pw_aff *basic_set_dim_opt(__isl_keep isl_basic_set *bset,
5489 isl_space *dim = isl_basic_set_get_space(bset);
5493 dim = isl_space_params(dim);
5494 dim = isl_space_add_dims(dim, isl_dim_set, 1);
5495 pwaff = isl_pw_aff_empty(dim);
5497 r = isl_basic_set_foreach_lexopt(bset, max, &update_dim_opt, &pwaff);
5499 return isl_pw_aff_free(pwaff);
5504 /* Compute the minimum or maximum of the given set dimension
5505 * as a function of the parameters, but independently of
5506 * the other set dimensions.
5508 * We first project the set onto the given dimension and then compute
5509 * the "lexicographic" maximum in each basic set, combining the results
5510 * using isl_pw_aff_union_max.
5512 static __isl_give isl_pw_aff *set_dim_opt(__isl_take isl_set *set, int pos,
5519 map = isl_map_from_domain(set);
5520 map = isl_map_add_dims(map, isl_dim_out, 1);
5521 map = isl_map_intersect(map,
5522 equate(isl_map_get_space(map), isl_dim_in, pos,
5524 set = isl_map_range(map);
5529 isl_space *dim = isl_set_get_space(set);
5530 dim = isl_space_domain(isl_space_from_range(dim));
5532 return isl_pw_aff_empty(dim);
5535 pwaff = basic_set_dim_opt(set->p[0], max);
5536 for (i = 1; i < set->n; ++i) {
5537 isl_pw_aff *pwaff_i;
5539 pwaff_i = basic_set_dim_opt(set->p[i], max);
5540 pwaff = isl_pw_aff_union_opt(pwaff, pwaff_i, max);
5548 /* Compute the maximum of the given set dimension as a function of the
5549 * parameters, but independently of the other set dimensions.
5551 __isl_give isl_pw_aff *isl_set_dim_max(__isl_take isl_set *set, int pos)
5553 return set_dim_opt(set, pos, 1);
5556 /* Compute the minimum 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_min(__isl_take isl_set *set, int pos)
5561 return set_dim_opt(set, pos, 0);
5564 /* Apply a preimage specified by "mat" on the parameters of "bset".
5565 * bset is assumed to have only parameters and divs.
5567 static struct isl_basic_set *basic_set_parameter_preimage(
5568 struct isl_basic_set *bset, struct isl_mat *mat)
5575 bset->dim = isl_space_cow(bset->dim);
5579 nparam = isl_basic_set_dim(bset, isl_dim_param);
5581 isl_assert(bset->ctx, mat->n_row == 1 + nparam, goto error);
5583 bset->dim->nparam = 0;
5584 bset->dim->n_out = nparam;
5585 bset = isl_basic_set_preimage(bset, mat);
5587 bset->dim->nparam = bset->dim->n_out;
5588 bset->dim->n_out = 0;
5593 isl_basic_set_free(bset);
5597 /* Apply a preimage specified by "mat" on the parameters of "set".
5598 * set is assumed to have only parameters and divs.
5600 static struct isl_set *set_parameter_preimage(
5601 struct isl_set *set, struct isl_mat *mat)
5603 isl_space *dim = NULL;
5609 dim = isl_space_copy(set->dim);
5610 dim = isl_space_cow(dim);
5614 nparam = isl_set_dim(set, isl_dim_param);
5616 isl_assert(set->ctx, mat->n_row == 1 + nparam, goto error);
5619 dim->n_out = nparam;
5620 isl_set_reset_space(set, dim);
5621 set = isl_set_preimage(set, mat);
5624 dim = isl_space_copy(set->dim);
5625 dim = isl_space_cow(dim);
5628 dim->nparam = dim->n_out;
5630 isl_set_reset_space(set, dim);
5633 isl_space_free(dim);
5640 /* Intersect the basic set "bset" with the affine space specified by the
5641 * equalities in "eq".
5643 static struct isl_basic_set *basic_set_append_equalities(
5644 struct isl_basic_set *bset, struct isl_mat *eq)
5652 bset = isl_basic_set_extend_space(bset, isl_space_copy(bset->dim), 0,
5657 len = 1 + isl_space_dim(bset->dim, isl_dim_all) + bset->extra;
5658 for (i = 0; i < eq->n_row; ++i) {
5659 k = isl_basic_set_alloc_equality(bset);
5662 isl_seq_cpy(bset->eq[k], eq->row[i], eq->n_col);
5663 isl_seq_clr(bset->eq[k] + eq->n_col, len - eq->n_col);
5667 bset = isl_basic_set_gauss(bset, NULL);
5668 bset = isl_basic_set_finalize(bset);
5673 isl_basic_set_free(bset);
5677 /* Intersect the set "set" with the affine space specified by the
5678 * equalities in "eq".
5680 static struct isl_set *set_append_equalities(struct isl_set *set,
5688 for (i = 0; i < set->n; ++i) {
5689 set->p[i] = basic_set_append_equalities(set->p[i],
5702 /* Project the given basic set onto its parameter domain, possibly introducing
5703 * new, explicit, existential variables in the constraints.
5704 * The input has parameters and (possibly implicit) existential variables.
5705 * The output has the same parameters, but only
5706 * explicit existentially quantified variables.
5708 * The actual projection is performed by pip, but pip doesn't seem
5709 * to like equalities very much, so we first remove the equalities
5710 * among the parameters by performing a variable compression on
5711 * the parameters. Afterward, an inverse transformation is performed
5712 * and the equalities among the parameters are inserted back in.
5714 static struct isl_set *parameter_compute_divs(struct isl_basic_set *bset)
5718 struct isl_mat *T, *T2;
5719 struct isl_set *set;
5720 unsigned nparam, n_div;
5722 bset = isl_basic_set_cow(bset);
5726 if (bset->n_eq == 0)
5727 return isl_basic_set_lexmin(bset);
5729 isl_basic_set_gauss(bset, NULL);
5731 nparam = isl_basic_set_dim(bset, isl_dim_param);
5732 n_div = isl_basic_set_dim(bset, isl_dim_div);
5734 for (i = 0, j = n_div - 1; i < bset->n_eq && j >= 0; --j) {
5735 if (!isl_int_is_zero(bset->eq[i][1 + nparam + j]))
5738 if (i == bset->n_eq)
5739 return isl_basic_set_lexmin(bset);
5741 eq = isl_mat_sub_alloc6(bset->ctx, bset->eq, i, bset->n_eq - i,
5743 eq = isl_mat_cow(eq);
5744 T = isl_mat_variable_compression(isl_mat_copy(eq), &T2);
5745 if (T && T->n_col == 0) {
5749 bset = isl_basic_set_set_to_empty(bset);
5750 return isl_set_from_basic_set(bset);
5752 bset = basic_set_parameter_preimage(bset, T);
5754 set = isl_basic_set_lexmin(bset);
5755 set = set_parameter_preimage(set, T2);
5756 set = set_append_equalities(set, eq);
5760 /* Compute an explicit representation for all the existentially
5761 * quantified variables.
5762 * The input and output dimensions are first turned into parameters.
5763 * compute_divs then returns a map with the same parameters and
5764 * no input or output dimensions and the dimension specification
5765 * is reset to that of the input.
5767 static struct isl_map *compute_divs(struct isl_basic_map *bmap)
5769 struct isl_basic_set *bset;
5770 struct isl_set *set;
5771 struct isl_map *map;
5772 isl_space *dim, *orig_dim = NULL;
5777 bmap = isl_basic_map_cow(bmap);
5781 nparam = isl_basic_map_dim(bmap, isl_dim_param);
5782 n_in = isl_basic_map_dim(bmap, isl_dim_in);
5783 n_out = isl_basic_map_dim(bmap, isl_dim_out);
5784 dim = isl_space_set_alloc(bmap->ctx, nparam + n_in + n_out, 0);
5788 orig_dim = bmap->dim;
5790 bset = (struct isl_basic_set *)bmap;
5792 set = parameter_compute_divs(bset);
5793 map = (struct isl_map *)set;
5794 map = isl_map_reset_space(map, orig_dim);
5798 isl_basic_map_free(bmap);
5802 int isl_basic_map_divs_known(__isl_keep isl_basic_map *bmap)
5810 off = isl_space_dim(bmap->dim, isl_dim_all);
5811 for (i = 0; i < bmap->n_div; ++i) {
5812 if (isl_int_is_zero(bmap->div[i][0]))
5814 isl_assert(bmap->ctx, isl_int_is_zero(bmap->div[i][1+1+off+i]),
5820 static int map_divs_known(__isl_keep isl_map *map)
5827 for (i = 0; i < map->n; ++i) {
5828 int known = isl_basic_map_divs_known(map->p[i]);
5836 /* If bmap contains any unknown divs, then compute explicit
5837 * expressions for them. However, this computation may be
5838 * quite expensive, so first try to remove divs that aren't
5841 struct isl_map *isl_basic_map_compute_divs(struct isl_basic_map *bmap)
5844 struct isl_map *map;
5846 known = isl_basic_map_divs_known(bmap);
5850 return isl_map_from_basic_map(bmap);
5852 bmap = isl_basic_map_drop_redundant_divs(bmap);
5854 known = isl_basic_map_divs_known(bmap);
5858 return isl_map_from_basic_map(bmap);
5860 map = compute_divs(bmap);
5863 isl_basic_map_free(bmap);
5867 struct isl_map *isl_map_compute_divs(struct isl_map *map)
5871 struct isl_map *res;
5878 known = map_divs_known(map);
5886 res = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[0]));
5887 for (i = 1 ; i < map->n; ++i) {
5889 r2 = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[i]));
5890 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT))
5891 res = isl_map_union_disjoint(res, r2);
5893 res = isl_map_union(res, r2);
5900 struct isl_set *isl_basic_set_compute_divs(struct isl_basic_set *bset)
5902 return (struct isl_set *)
5903 isl_basic_map_compute_divs((struct isl_basic_map *)bset);
5906 struct isl_set *isl_set_compute_divs(struct isl_set *set)
5908 return (struct isl_set *)
5909 isl_map_compute_divs((struct isl_map *)set);
5912 struct isl_set *isl_map_domain(struct isl_map *map)
5915 struct isl_set *set;
5920 map = isl_map_cow(map);
5924 set = (struct isl_set *)map;
5925 set->dim = isl_space_domain(set->dim);
5928 for (i = 0; i < map->n; ++i) {
5929 set->p[i] = isl_basic_map_domain(map->p[i]);
5933 ISL_F_CLR(set, ISL_MAP_DISJOINT);
5934 ISL_F_CLR(set, ISL_SET_NORMALIZED);
5941 static __isl_give isl_map *map_union_disjoint(__isl_take isl_map *map1,
5942 __isl_take isl_map *map2)
5946 struct isl_map *map = NULL;
5960 isl_assert(map1->ctx, isl_space_is_equal(map1->dim, map2->dim), goto error);
5962 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
5963 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
5964 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
5966 map = isl_map_alloc_space(isl_space_copy(map1->dim),
5967 map1->n + map2->n, flags);
5970 for (i = 0; i < map1->n; ++i) {
5971 map = isl_map_add_basic_map(map,
5972 isl_basic_map_copy(map1->p[i]));
5976 for (i = 0; i < map2->n; ++i) {
5977 map = isl_map_add_basic_map(map,
5978 isl_basic_map_copy(map2->p[i]));
5992 __isl_give isl_map *isl_map_union_disjoint(__isl_take isl_map *map1,
5993 __isl_take isl_map *map2)
5995 return isl_map_align_params_map_map_and(map1, map2, &map_union_disjoint);
5998 struct isl_map *isl_map_union(struct isl_map *map1, struct isl_map *map2)
6000 map1 = isl_map_union_disjoint(map1, map2);
6004 ISL_F_CLR(map1, ISL_MAP_DISJOINT);
6008 struct isl_set *isl_set_union_disjoint(
6009 struct isl_set *set1, struct isl_set *set2)
6011 return (struct isl_set *)
6012 isl_map_union_disjoint(
6013 (struct isl_map *)set1, (struct isl_map *)set2);
6016 struct isl_set *isl_set_union(struct isl_set *set1, struct isl_set *set2)
6018 return (struct isl_set *)
6019 isl_map_union((struct isl_map *)set1, (struct isl_map *)set2);
6022 static __isl_give isl_map *map_intersect_range(__isl_take isl_map *map,
6023 __isl_take isl_set *set)
6026 struct isl_map *result;
6032 if (!isl_space_match(map->dim, isl_dim_param, set->dim, isl_dim_param))
6033 isl_die(set->ctx, isl_error_invalid,
6034 "parameters don't match", goto error);
6036 if (isl_space_dim(set->dim, isl_dim_set) != 0 &&
6037 !isl_map_compatible_range(map, set))
6038 isl_die(set->ctx, isl_error_invalid,
6039 "incompatible spaces", goto error);
6041 if (isl_set_plain_is_universe(set)) {
6046 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT) &&
6047 ISL_F_ISSET(set, ISL_MAP_DISJOINT))
6048 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
6050 result = isl_map_alloc_space(isl_space_copy(map->dim),
6051 map->n * set->n, flags);
6054 for (i = 0; i < map->n; ++i)
6055 for (j = 0; j < set->n; ++j) {
6056 result = isl_map_add_basic_map(result,
6057 isl_basic_map_intersect_range(
6058 isl_basic_map_copy(map->p[i]),
6059 isl_basic_set_copy(set->p[j])));
6072 __isl_give isl_map *isl_map_intersect_range(__isl_take isl_map *map,
6073 __isl_take isl_set *set)
6075 return isl_map_align_params_map_map_and(map, set, &map_intersect_range);
6078 struct isl_map *isl_map_intersect_domain(
6079 struct isl_map *map, struct isl_set *set)
6081 return isl_map_reverse(
6082 isl_map_intersect_range(isl_map_reverse(map), set));
6085 static __isl_give isl_map *map_apply_domain(__isl_take isl_map *map1,
6086 __isl_take isl_map *map2)
6090 map1 = isl_map_reverse(map1);
6091 map1 = isl_map_apply_range(map1, map2);
6092 return isl_map_reverse(map1);
6099 __isl_give isl_map *isl_map_apply_domain(__isl_take isl_map *map1,
6100 __isl_take isl_map *map2)
6102 return isl_map_align_params_map_map_and(map1, map2, &map_apply_domain);
6105 static __isl_give isl_map *map_apply_range(__isl_take isl_map *map1,
6106 __isl_take isl_map *map2)
6108 isl_space *dim_result;
6109 struct isl_map *result;
6115 dim_result = isl_space_join(isl_space_copy(map1->dim),
6116 isl_space_copy(map2->dim));
6118 result = isl_map_alloc_space(dim_result, map1->n * map2->n, 0);
6121 for (i = 0; i < map1->n; ++i)
6122 for (j = 0; j < map2->n; ++j) {
6123 result = isl_map_add_basic_map(result,
6124 isl_basic_map_apply_range(
6125 isl_basic_map_copy(map1->p[i]),
6126 isl_basic_map_copy(map2->p[j])));
6132 if (result && result->n <= 1)
6133 ISL_F_SET(result, ISL_MAP_DISJOINT);
6141 __isl_give isl_map *isl_map_apply_range(__isl_take isl_map *map1,
6142 __isl_take isl_map *map2)
6144 return isl_map_align_params_map_map_and(map1, map2, &map_apply_range);
6148 * returns range - domain
6150 struct isl_basic_set *isl_basic_map_deltas(struct isl_basic_map *bmap)
6152 isl_space *dims, *target_dim;
6153 struct isl_basic_set *bset;
6160 isl_assert(bmap->ctx, isl_space_tuple_match(bmap->dim, isl_dim_in,
6161 bmap->dim, isl_dim_out),
6163 target_dim = isl_space_domain(isl_basic_map_get_space(bmap));
6164 dim = isl_basic_map_n_in(bmap);
6165 nparam = isl_basic_map_n_param(bmap);
6166 bset = isl_basic_set_from_basic_map(bmap);
6167 bset = isl_basic_set_cow(bset);
6168 dims = isl_basic_set_get_space(bset);
6169 dims = isl_space_add_dims(dims, isl_dim_set, dim);
6170 bset = isl_basic_set_extend_space(bset, dims, 0, dim, 0);
6171 bset = isl_basic_set_swap_vars(bset, 2*dim);
6172 for (i = 0; i < dim; ++i) {
6173 int j = isl_basic_map_alloc_equality(
6174 (struct isl_basic_map *)bset);
6177 isl_seq_clr(bset->eq[j], 1 + isl_basic_set_total_dim(bset));
6178 isl_int_set_si(bset->eq[j][1+nparam+i], 1);
6179 isl_int_set_si(bset->eq[j][1+nparam+dim+i], 1);
6180 isl_int_set_si(bset->eq[j][1+nparam+2*dim+i], -1);
6182 bset = isl_basic_set_project_out(bset, isl_dim_set, dim, 2*dim);
6183 bset = isl_basic_set_reset_space(bset, target_dim);
6186 isl_basic_map_free(bmap);
6191 * returns range - domain
6193 struct isl_set *isl_map_deltas(struct isl_map *map)
6197 struct isl_set *result;
6202 isl_assert(map->ctx, isl_space_tuple_match(map->dim, isl_dim_in,
6203 map->dim, isl_dim_out),
6205 dim = isl_map_get_space(map);
6206 dim = isl_space_domain(dim);
6207 result = isl_set_alloc_space(dim, map->n, 0);
6210 for (i = 0; i < map->n; ++i)
6211 result = isl_set_add_basic_set(result,
6212 isl_basic_map_deltas(isl_basic_map_copy(map->p[i])));
6221 * returns [domain -> range] -> range - domain
6223 __isl_give isl_basic_map *isl_basic_map_deltas_map(
6224 __isl_take isl_basic_map *bmap)
6228 isl_basic_map *domain;
6232 if (!isl_space_tuple_match(bmap->dim, isl_dim_in, bmap->dim, isl_dim_out))
6233 isl_die(bmap->ctx, isl_error_invalid,
6234 "domain and range don't match", goto error);
6236 nparam = isl_basic_map_dim(bmap, isl_dim_param);
6237 n = isl_basic_map_dim(bmap, isl_dim_in);
6239 dim = isl_space_from_range(isl_space_domain(isl_basic_map_get_space(bmap)));
6240 domain = isl_basic_map_universe(dim);
6242 bmap = isl_basic_map_from_domain(isl_basic_map_wrap(bmap));
6243 bmap = isl_basic_map_apply_range(bmap, domain);
6244 bmap = isl_basic_map_extend_constraints(bmap, n, 0);
6246 total = isl_basic_map_total_dim(bmap);
6248 for (i = 0; i < n; ++i) {
6249 k = isl_basic_map_alloc_equality(bmap);
6252 isl_seq_clr(bmap->eq[k], 1 + total);
6253 isl_int_set_si(bmap->eq[k][1 + nparam + i], 1);
6254 isl_int_set_si(bmap->eq[k][1 + nparam + n + i], -1);
6255 isl_int_set_si(bmap->eq[k][1 + nparam + n + n + i], 1);
6258 bmap = isl_basic_map_gauss(bmap, NULL);
6259 return isl_basic_map_finalize(bmap);
6261 isl_basic_map_free(bmap);
6266 * returns [domain -> range] -> range - domain
6268 __isl_give isl_map *isl_map_deltas_map(__isl_take isl_map *map)
6271 isl_space *domain_dim;
6276 if (!isl_space_tuple_match(map->dim, isl_dim_in, map->dim, isl_dim_out))
6277 isl_die(map->ctx, isl_error_invalid,
6278 "domain and range don't match", goto error);
6280 map = isl_map_cow(map);
6284 domain_dim = isl_space_from_range(isl_space_domain(isl_map_get_space(map)));
6285 map->dim = isl_space_from_domain(isl_space_wrap(map->dim));
6286 map->dim = isl_space_join(map->dim, domain_dim);
6289 for (i = 0; i < map->n; ++i) {
6290 map->p[i] = isl_basic_map_deltas_map(map->p[i]);
6294 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
6301 __isl_give struct isl_basic_map *basic_map_identity(__isl_take isl_space *dims)
6303 struct isl_basic_map *bmap;
6311 nparam = dims->nparam;
6313 bmap = isl_basic_map_alloc_space(dims, 0, dim, 0);
6317 for (i = 0; i < dim; ++i) {
6318 int j = isl_basic_map_alloc_equality(bmap);
6321 isl_seq_clr(bmap->eq[j], 1 + isl_basic_map_total_dim(bmap));
6322 isl_int_set_si(bmap->eq[j][1+nparam+i], 1);
6323 isl_int_set_si(bmap->eq[j][1+nparam+dim+i], -1);
6325 return isl_basic_map_finalize(bmap);
6327 isl_basic_map_free(bmap);
6331 __isl_give isl_basic_map *isl_basic_map_identity(__isl_take isl_space *dim)
6335 if (dim->n_in != dim->n_out)
6336 isl_die(dim->ctx, isl_error_invalid,
6337 "number of input and output dimensions needs to be "
6338 "the same", goto error);
6339 return basic_map_identity(dim);
6341 isl_space_free(dim);
6345 struct isl_basic_map *isl_basic_map_identity_like(struct isl_basic_map *model)
6347 if (!model || !model->dim)
6349 return isl_basic_map_identity(isl_space_copy(model->dim));
6352 __isl_give isl_map *isl_map_identity(__isl_take isl_space *dim)
6354 return isl_map_from_basic_map(isl_basic_map_identity(dim));
6357 struct isl_map *isl_map_identity_like(struct isl_map *model)
6359 if (!model || !model->dim)
6361 return isl_map_identity(isl_space_copy(model->dim));
6364 struct isl_map *isl_map_identity_like_basic_map(struct isl_basic_map *model)
6366 if (!model || !model->dim)
6368 return isl_map_identity(isl_space_copy(model->dim));
6371 __isl_give isl_map *isl_set_identity(__isl_take isl_set *set)
6373 isl_space *dim = isl_set_get_space(set);
6375 id = isl_map_identity(isl_space_map_from_set(dim));
6376 return isl_map_intersect_range(id, set);
6379 /* Construct a basic set with all set dimensions having only non-negative
6382 __isl_give isl_basic_set *isl_basic_set_positive_orthant(
6383 __isl_take isl_space *space)
6388 struct isl_basic_set *bset;
6392 nparam = space->nparam;
6394 bset = isl_basic_set_alloc_space(space, 0, 0, dim);
6397 for (i = 0; i < dim; ++i) {
6398 int k = isl_basic_set_alloc_inequality(bset);
6401 isl_seq_clr(bset->ineq[k], 1 + isl_basic_set_total_dim(bset));
6402 isl_int_set_si(bset->ineq[k][1 + nparam + i], 1);
6406 isl_basic_set_free(bset);
6410 /* Construct the half-space x_pos >= 0.
6412 static __isl_give isl_basic_set *nonneg_halfspace(__isl_take isl_space *dim,
6416 isl_basic_set *nonneg;
6418 nonneg = isl_basic_set_alloc_space(dim, 0, 0, 1);
6419 k = isl_basic_set_alloc_inequality(nonneg);
6422 isl_seq_clr(nonneg->ineq[k], 1 + isl_basic_set_total_dim(nonneg));
6423 isl_int_set_si(nonneg->ineq[k][pos], 1);
6425 return isl_basic_set_finalize(nonneg);
6427 isl_basic_set_free(nonneg);
6431 /* Construct the half-space x_pos <= -1.
6433 static __isl_give isl_basic_set *neg_halfspace(__isl_take isl_space *dim, int pos)
6438 neg = isl_basic_set_alloc_space(dim, 0, 0, 1);
6439 k = isl_basic_set_alloc_inequality(neg);
6442 isl_seq_clr(neg->ineq[k], 1 + isl_basic_set_total_dim(neg));
6443 isl_int_set_si(neg->ineq[k][0], -1);
6444 isl_int_set_si(neg->ineq[k][pos], -1);
6446 return isl_basic_set_finalize(neg);
6448 isl_basic_set_free(neg);
6452 __isl_give isl_set *isl_set_split_dims(__isl_take isl_set *set,
6453 enum isl_dim_type type, unsigned first, unsigned n)
6456 isl_basic_set *nonneg;
6464 isl_assert(set->ctx, first + n <= isl_set_dim(set, type), goto error);
6466 for (i = 0; i < n; ++i) {
6467 nonneg = nonneg_halfspace(isl_set_get_space(set),
6468 pos(set->dim, type) + first + i);
6469 neg = neg_halfspace(isl_set_get_space(set),
6470 pos(set->dim, type) + first + i);
6472 set = isl_set_intersect(set, isl_basic_set_union(nonneg, neg));
6481 static int foreach_orthant(__isl_take isl_set *set, int *signs, int first,
6482 int len, int (*fn)(__isl_take isl_set *orthant, int *signs, void *user),
6489 if (isl_set_plain_is_empty(set)) {
6494 return fn(set, signs, user);
6497 half = isl_set_from_basic_set(nonneg_halfspace(isl_set_get_space(set),
6499 half = isl_set_intersect(half, isl_set_copy(set));
6500 if (foreach_orthant(half, signs, first + 1, len, fn, user) < 0)
6504 half = isl_set_from_basic_set(neg_halfspace(isl_set_get_space(set),
6506 half = isl_set_intersect(half, set);
6507 return foreach_orthant(half, signs, first + 1, len, fn, user);
6513 /* Call "fn" on the intersections of "set" with each of the orthants
6514 * (except for obviously empty intersections). The orthant is identified
6515 * by the signs array, with each entry having value 1 or -1 according
6516 * to the sign of the corresponding variable.
6518 int isl_set_foreach_orthant(__isl_keep isl_set *set,
6519 int (*fn)(__isl_take isl_set *orthant, int *signs, void *user),
6529 if (isl_set_plain_is_empty(set))
6532 nparam = isl_set_dim(set, isl_dim_param);
6533 nvar = isl_set_dim(set, isl_dim_set);
6535 signs = isl_alloc_array(set->ctx, int, nparam + nvar);
6537 r = foreach_orthant(isl_set_copy(set), signs, 0, nparam + nvar,
6545 int isl_set_is_equal(struct isl_set *set1, struct isl_set *set2)
6547 return isl_map_is_equal((struct isl_map *)set1, (struct isl_map *)set2);
6550 int isl_basic_map_is_subset(
6551 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
6554 struct isl_map *map1;
6555 struct isl_map *map2;
6557 if (!bmap1 || !bmap2)
6560 map1 = isl_map_from_basic_map(isl_basic_map_copy(bmap1));
6561 map2 = isl_map_from_basic_map(isl_basic_map_copy(bmap2));
6563 is_subset = isl_map_is_subset(map1, map2);
6571 int isl_basic_map_is_equal(
6572 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
6576 if (!bmap1 || !bmap2)
6578 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
6581 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
6585 int isl_basic_set_is_equal(
6586 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
6588 return isl_basic_map_is_equal(
6589 (struct isl_basic_map *)bset1, (struct isl_basic_map *)bset2);
6592 int isl_map_is_empty(struct isl_map *map)
6599 for (i = 0; i < map->n; ++i) {
6600 is_empty = isl_basic_map_is_empty(map->p[i]);
6609 int isl_map_plain_is_empty(__isl_keep isl_map *map)
6611 return map ? map->n == 0 : -1;
6614 int isl_map_fast_is_empty(__isl_keep isl_map *map)
6616 return isl_map_plain_is_empty(map);
6619 int isl_set_plain_is_empty(struct isl_set *set)
6621 return set ? set->n == 0 : -1;
6624 int isl_set_fast_is_empty(__isl_keep isl_set *set)
6626 return isl_set_plain_is_empty(set);
6629 int isl_set_is_empty(struct isl_set *set)
6631 return isl_map_is_empty((struct isl_map *)set);
6634 int isl_map_has_equal_space(__isl_keep isl_map *map1, __isl_keep isl_map *map2)
6639 return isl_space_is_equal(map1->dim, map2->dim);
6642 int isl_set_has_equal_space(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
6647 return isl_space_is_equal(set1->dim, set2->dim);
6650 static int map_is_equal(__isl_keep isl_map *map1, __isl_keep isl_map *map2)
6656 is_subset = isl_map_is_subset(map1, map2);
6659 is_subset = isl_map_is_subset(map2, map1);
6663 int isl_map_is_equal(__isl_keep isl_map *map1, __isl_keep isl_map *map2)
6665 return align_params_map_map_and_test(map1, map2, &map_is_equal);
6668 int isl_basic_map_is_strict_subset(
6669 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
6673 if (!bmap1 || !bmap2)
6675 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
6678 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
6679 if (is_subset == -1)
6684 int isl_map_is_strict_subset(struct isl_map *map1, struct isl_map *map2)
6690 is_subset = isl_map_is_subset(map1, map2);
6693 is_subset = isl_map_is_subset(map2, map1);
6694 if (is_subset == -1)
6699 int isl_set_is_strict_subset(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
6701 return isl_map_is_strict_subset((isl_map *)set1, (isl_map *)set2);
6704 int isl_basic_map_is_universe(struct isl_basic_map *bmap)
6708 return bmap->n_eq == 0 && bmap->n_ineq == 0;
6711 int isl_basic_set_is_universe(struct isl_basic_set *bset)
6715 return bset->n_eq == 0 && bset->n_ineq == 0;
6718 int isl_map_plain_is_universe(__isl_keep isl_map *map)
6725 for (i = 0; i < map->n; ++i) {
6726 int r = isl_basic_map_is_universe(map->p[i]);
6734 int isl_set_plain_is_universe(__isl_keep isl_set *set)
6736 return isl_map_plain_is_universe((isl_map *) set);
6739 int isl_set_fast_is_universe(__isl_keep isl_set *set)
6741 return isl_set_plain_is_universe(set);
6744 int isl_basic_map_is_empty(struct isl_basic_map *bmap)
6746 struct isl_basic_set *bset = NULL;
6747 struct isl_vec *sample = NULL;
6754 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY))
6757 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL)) {
6758 struct isl_basic_map *copy = isl_basic_map_copy(bmap);
6759 copy = isl_basic_map_remove_redundancies(copy);
6760 empty = ISL_F_ISSET(copy, ISL_BASIC_MAP_EMPTY);
6761 isl_basic_map_free(copy);
6765 total = 1 + isl_basic_map_total_dim(bmap);
6766 if (bmap->sample && bmap->sample->size == total) {
6767 int contains = isl_basic_map_contains(bmap, bmap->sample);
6773 isl_vec_free(bmap->sample);
6774 bmap->sample = NULL;
6775 bset = isl_basic_map_underlying_set(isl_basic_map_copy(bmap));
6778 sample = isl_basic_set_sample_vec(bset);
6781 empty = sample->size == 0;
6782 isl_vec_free(bmap->sample);
6783 bmap->sample = sample;
6785 ISL_F_SET(bmap, ISL_BASIC_MAP_EMPTY);
6790 int isl_basic_map_plain_is_empty(__isl_keep isl_basic_map *bmap)
6794 return ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY);
6797 int isl_basic_map_fast_is_empty(__isl_keep isl_basic_map *bmap)
6799 return isl_basic_map_plain_is_empty(bmap);
6802 int isl_basic_set_plain_is_empty(__isl_keep isl_basic_set *bset)
6806 return ISL_F_ISSET(bset, ISL_BASIC_SET_EMPTY);
6809 int isl_basic_set_fast_is_empty(__isl_keep isl_basic_set *bset)
6811 return isl_basic_set_plain_is_empty(bset);
6814 int isl_basic_set_is_empty(struct isl_basic_set *bset)
6816 return isl_basic_map_is_empty((struct isl_basic_map *)bset);
6819 struct isl_map *isl_basic_map_union(
6820 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
6822 struct isl_map *map;
6823 if (!bmap1 || !bmap2)
6826 isl_assert(bmap1->ctx, isl_space_is_equal(bmap1->dim, bmap2->dim), goto error);
6828 map = isl_map_alloc_space(isl_space_copy(bmap1->dim), 2, 0);
6831 map = isl_map_add_basic_map(map, bmap1);
6832 map = isl_map_add_basic_map(map, bmap2);
6835 isl_basic_map_free(bmap1);
6836 isl_basic_map_free(bmap2);
6840 struct isl_set *isl_basic_set_union(
6841 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
6843 return (struct isl_set *)isl_basic_map_union(
6844 (struct isl_basic_map *)bset1,
6845 (struct isl_basic_map *)bset2);
6848 /* Order divs such that any div only depends on previous divs */
6849 struct isl_basic_map *isl_basic_map_order_divs(struct isl_basic_map *bmap)
6857 off = isl_space_dim(bmap->dim, isl_dim_all);
6859 for (i = 0; i < bmap->n_div; ++i) {
6861 if (isl_int_is_zero(bmap->div[i][0]))
6863 pos = isl_seq_first_non_zero(bmap->div[i]+1+1+off+i,
6867 isl_basic_map_swap_div(bmap, i, i + pos);
6873 struct isl_basic_set *isl_basic_set_order_divs(struct isl_basic_set *bset)
6875 return (struct isl_basic_set *)
6876 isl_basic_map_order_divs((struct isl_basic_map *)bset);
6879 __isl_give isl_map *isl_map_order_divs(__isl_take isl_map *map)
6886 for (i = 0; i < map->n; ++i) {
6887 map->p[i] = isl_basic_map_order_divs(map->p[i]);
6898 /* Apply the expansion computed by isl_merge_divs.
6899 * The expansion itself is given by "exp" while the resulting
6900 * list of divs is given by "div".
6902 __isl_give isl_basic_set *isl_basic_set_expand_divs(
6903 __isl_take isl_basic_set *bset, __isl_take isl_mat *div, int *exp)
6908 bset = isl_basic_set_cow(bset);
6912 if (div->n_row < bset->n_div)
6913 isl_die(isl_mat_get_ctx(div), isl_error_invalid,
6914 "not an expansion", goto error);
6916 bset = isl_basic_map_extend_space(bset, isl_space_copy(bset->dim),
6917 div->n_row - bset->n_div, 0,
6918 2 * (div->n_row - bset->n_div));
6920 n_div = bset->n_div;
6921 for (i = n_div; i < div->n_row; ++i)
6922 if (isl_basic_set_alloc_div(bset) < 0)
6926 for (i = div->n_row - 1; i >= 0; --i) {
6927 if (j >= 0 && exp[j] == i) {
6929 isl_basic_map_swap_div(bset, i, j);
6932 isl_seq_cpy(bset->div[i], div->row[i], div->n_col);
6933 if (isl_basic_map_add_div_constraints(bset, i) < 0)
6941 isl_basic_set_free(bset);
6946 /* Look for a div in dst that corresponds to the div "div" in src.
6947 * The divs before "div" in src and dst are assumed to be the same.
6949 * Returns -1 if no corresponding div was found and the position
6950 * of the corresponding div in dst otherwise.
6952 static int find_div(struct isl_basic_map *dst,
6953 struct isl_basic_map *src, unsigned div)
6957 unsigned total = isl_space_dim(src->dim, isl_dim_all);
6959 isl_assert(dst->ctx, div <= dst->n_div, return -1);
6960 for (i = div; i < dst->n_div; ++i)
6961 if (isl_seq_eq(dst->div[i], src->div[div], 1+1+total+div) &&
6962 isl_seq_first_non_zero(dst->div[i]+1+1+total+div,
6963 dst->n_div - div) == -1)
6968 struct isl_basic_map *isl_basic_map_align_divs(
6969 struct isl_basic_map *dst, struct isl_basic_map *src)
6972 unsigned total = isl_space_dim(src->dim, isl_dim_all);
6977 if (src->n_div == 0)
6980 for (i = 0; i < src->n_div; ++i)
6981 isl_assert(src->ctx, !isl_int_is_zero(src->div[i][0]), goto error);
6983 src = isl_basic_map_order_divs(src);
6984 dst = isl_basic_map_cow(dst);
6985 dst = isl_basic_map_extend_space(dst, isl_space_copy(dst->dim),
6986 src->n_div, 0, 2 * src->n_div);
6989 for (i = 0; i < src->n_div; ++i) {
6990 int j = find_div(dst, src, i);
6992 j = isl_basic_map_alloc_div(dst);
6995 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total+i);
6996 isl_seq_clr(dst->div[j]+1+1+total+i, dst->n_div - i);
6997 if (isl_basic_map_add_div_constraints(dst, j) < 0)
7001 isl_basic_map_swap_div(dst, i, j);
7005 isl_basic_map_free(dst);
7009 struct isl_basic_set *isl_basic_set_align_divs(
7010 struct isl_basic_set *dst, struct isl_basic_set *src)
7012 return (struct isl_basic_set *)isl_basic_map_align_divs(
7013 (struct isl_basic_map *)dst, (struct isl_basic_map *)src);
7016 struct isl_map *isl_map_align_divs(struct isl_map *map)
7024 map = isl_map_compute_divs(map);
7025 map = isl_map_cow(map);
7029 for (i = 1; i < map->n; ++i)
7030 map->p[0] = isl_basic_map_align_divs(map->p[0], map->p[i]);
7031 for (i = 1; i < map->n; ++i)
7032 map->p[i] = isl_basic_map_align_divs(map->p[i], map->p[0]);
7034 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
7038 struct isl_set *isl_set_align_divs(struct isl_set *set)
7040 return (struct isl_set *)isl_map_align_divs((struct isl_map *)set);
7043 static __isl_give isl_set *set_apply( __isl_take isl_set *set,
7044 __isl_take isl_map *map)
7048 isl_assert(set->ctx, isl_map_compatible_domain(map, set), goto error);
7049 map = isl_map_intersect_domain(map, set);
7050 set = isl_map_range(map);
7058 __isl_give isl_set *isl_set_apply( __isl_take isl_set *set,
7059 __isl_take isl_map *map)
7061 return isl_map_align_params_map_map_and(set, map, &set_apply);
7064 /* There is no need to cow as removing empty parts doesn't change
7065 * the meaning of the set.
7067 struct isl_map *isl_map_remove_empty_parts(struct isl_map *map)
7074 for (i = map->n-1; i >= 0; --i) {
7075 if (!ISL_F_ISSET(map->p[i], ISL_BASIC_MAP_EMPTY))
7077 isl_basic_map_free(map->p[i]);
7078 if (i != map->n-1) {
7079 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
7080 map->p[i] = map->p[map->n-1];
7088 struct isl_set *isl_set_remove_empty_parts(struct isl_set *set)
7090 return (struct isl_set *)
7091 isl_map_remove_empty_parts((struct isl_map *)set);
7094 struct isl_basic_map *isl_map_copy_basic_map(struct isl_map *map)
7096 struct isl_basic_map *bmap;
7097 if (!map || map->n == 0)
7099 bmap = map->p[map->n-1];
7100 isl_assert(map->ctx, ISL_F_ISSET(bmap, ISL_BASIC_SET_FINAL), return NULL);
7101 return isl_basic_map_copy(bmap);
7104 struct isl_basic_set *isl_set_copy_basic_set(struct isl_set *set)
7106 return (struct isl_basic_set *)
7107 isl_map_copy_basic_map((struct isl_map *)set);
7110 __isl_give isl_map *isl_map_drop_basic_map(__isl_take isl_map *map,
7111 __isl_keep isl_basic_map *bmap)
7117 for (i = map->n-1; i >= 0; --i) {
7118 if (map->p[i] != bmap)
7120 map = isl_map_cow(map);
7123 isl_basic_map_free(map->p[i]);
7124 if (i != map->n-1) {
7125 ISL_F_CLR(map, ISL_SET_NORMALIZED);
7126 map->p[i] = map->p[map->n-1];
7137 struct isl_set *isl_set_drop_basic_set(struct isl_set *set,
7138 struct isl_basic_set *bset)
7140 return (struct isl_set *)isl_map_drop_basic_map((struct isl_map *)set,
7141 (struct isl_basic_map *)bset);
7144 /* Given two basic sets bset1 and bset2, compute the maximal difference
7145 * between the values of dimension pos in bset1 and those in bset2
7146 * for any common value of the parameters and dimensions preceding pos.
7148 static enum isl_lp_result basic_set_maximal_difference_at(
7149 __isl_keep isl_basic_set *bset1, __isl_keep isl_basic_set *bset2,
7150 int pos, isl_int *opt)
7153 struct isl_basic_map *bmap1 = NULL;
7154 struct isl_basic_map *bmap2 = NULL;
7155 struct isl_ctx *ctx;
7156 struct isl_vec *obj;
7159 unsigned dim1, dim2;
7160 enum isl_lp_result res;
7162 if (!bset1 || !bset2)
7163 return isl_lp_error;
7165 nparam = isl_basic_set_n_param(bset1);
7166 dim1 = isl_basic_set_n_dim(bset1);
7167 dim2 = isl_basic_set_n_dim(bset2);
7168 dims = isl_space_alloc(bset1->ctx, nparam, pos, dim1 - pos);
7169 bmap1 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset1), dims);
7170 dims = isl_space_alloc(bset2->ctx, nparam, pos, dim2 - pos);
7171 bmap2 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset2), dims);
7172 if (!bmap1 || !bmap2)
7174 bmap1 = isl_basic_map_cow(bmap1);
7175 bmap1 = isl_basic_map_extend(bmap1, nparam,
7176 pos, (dim1 - pos) + (dim2 - pos),
7177 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
7178 bmap1 = add_constraints(bmap1, bmap2, 0, dim1 - pos);
7181 total = isl_basic_map_total_dim(bmap1);
7183 obj = isl_vec_alloc(ctx, 1 + total);
7184 isl_seq_clr(obj->block.data, 1 + total);
7185 isl_int_set_si(obj->block.data[1+nparam+pos], 1);
7186 isl_int_set_si(obj->block.data[1+nparam+pos+(dim1-pos)], -1);
7189 res = isl_basic_map_solve_lp(bmap1, 1, obj->block.data, ctx->one,
7191 isl_basic_map_free(bmap1);
7195 isl_basic_map_free(bmap1);
7196 isl_basic_map_free(bmap2);
7197 return isl_lp_error;
7200 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
7201 * for any common value of the parameters and dimensions preceding pos
7202 * in both basic sets, the values of dimension pos in bset1 are
7203 * smaller or larger than those in bset2.
7206 * 1 if bset1 follows bset2
7207 * -1 if bset1 precedes bset2
7208 * 0 if bset1 and bset2 are incomparable
7209 * -2 if some error occurred.
7211 int isl_basic_set_compare_at(struct isl_basic_set *bset1,
7212 struct isl_basic_set *bset2, int pos)
7215 enum isl_lp_result res;
7220 res = basic_set_maximal_difference_at(bset1, bset2, pos, &opt);
7222 if (res == isl_lp_empty)
7224 else if ((res == isl_lp_ok && isl_int_is_pos(opt)) ||
7225 res == isl_lp_unbounded)
7227 else if (res == isl_lp_ok && isl_int_is_neg(opt))
7236 /* Given two basic sets bset1 and bset2, check whether
7237 * for any common value of the parameters and dimensions preceding pos
7238 * there is a value of dimension pos in bset1 that is larger
7239 * than a value of the same dimension in bset2.
7242 * 1 if there exists such a pair
7243 * 0 if there is no such pair, but there is a pair of equal values
7245 * -2 if some error occurred.
7247 int isl_basic_set_follows_at(__isl_keep isl_basic_set *bset1,
7248 __isl_keep isl_basic_set *bset2, int pos)
7251 enum isl_lp_result res;
7256 res = basic_set_maximal_difference_at(bset1, bset2, pos, &opt);
7258 if (res == isl_lp_empty)
7260 else if ((res == isl_lp_ok && isl_int_is_pos(opt)) ||
7261 res == isl_lp_unbounded)
7263 else if (res == isl_lp_ok && isl_int_is_neg(opt))
7265 else if (res == isl_lp_ok)
7274 /* Given two sets set1 and set2, check whether
7275 * for any common value of the parameters and dimensions preceding pos
7276 * there is a value of dimension pos in set1 that is larger
7277 * than a value of the same dimension in set2.
7280 * 1 if there exists such a pair
7281 * 0 if there is no such pair, but there is a pair of equal values
7283 * -2 if some error occurred.
7285 int isl_set_follows_at(__isl_keep isl_set *set1,
7286 __isl_keep isl_set *set2, int pos)
7294 for (i = 0; i < set1->n; ++i)
7295 for (j = 0; j < set2->n; ++j) {
7297 f = isl_basic_set_follows_at(set1->p[i], set2->p[j], pos);
7298 if (f == 1 || f == -2)
7307 static int isl_basic_map_plain_has_fixed_var(__isl_keep isl_basic_map *bmap,
7308 unsigned pos, isl_int *val)
7316 total = isl_basic_map_total_dim(bmap);
7317 for (i = 0, d = total-1; i < bmap->n_eq && d+1 > pos; ++i) {
7318 for (; d+1 > pos; --d)
7319 if (!isl_int_is_zero(bmap->eq[i][1+d]))
7323 if (isl_seq_first_non_zero(bmap->eq[i]+1, d) != -1)
7325 if (isl_seq_first_non_zero(bmap->eq[i]+1+d+1, total-d-1) != -1)
7327 if (!isl_int_is_one(bmap->eq[i][1+d]))
7330 isl_int_neg(*val, bmap->eq[i][0]);
7336 static int isl_map_plain_has_fixed_var(__isl_keep isl_map *map,
7337 unsigned pos, isl_int *val)
7349 return isl_basic_map_plain_has_fixed_var(map->p[0], pos, val);
7352 fixed = isl_basic_map_plain_has_fixed_var(map->p[0], pos, &v);
7353 for (i = 1; fixed == 1 && i < map->n; ++i) {
7354 fixed = isl_basic_map_plain_has_fixed_var(map->p[i], pos, &tmp);
7355 if (fixed == 1 && isl_int_ne(tmp, v))
7359 isl_int_set(*val, v);
7365 static int isl_basic_set_plain_has_fixed_var(__isl_keep isl_basic_set *bset,
7366 unsigned pos, isl_int *val)
7368 return isl_basic_map_plain_has_fixed_var((struct isl_basic_map *)bset,
7372 static int isl_set_plain_has_fixed_var(__isl_keep isl_set *set, unsigned pos,
7375 return isl_map_plain_has_fixed_var((struct isl_map *)set, pos, val);
7378 int isl_basic_map_plain_is_fixed(__isl_keep isl_basic_map *bmap,
7379 enum isl_dim_type type, unsigned pos, isl_int *val)
7381 if (pos >= isl_basic_map_dim(bmap, type))
7383 return isl_basic_map_plain_has_fixed_var(bmap,
7384 isl_basic_map_offset(bmap, type) - 1 + pos, val);
7387 int isl_map_plain_is_fixed(__isl_keep isl_map *map,
7388 enum isl_dim_type type, unsigned pos, isl_int *val)
7390 if (pos >= isl_map_dim(map, type))
7392 return isl_map_plain_has_fixed_var(map,
7393 map_offset(map, type) - 1 + pos, val);
7396 int isl_set_plain_is_fixed(__isl_keep isl_set *set,
7397 enum isl_dim_type type, unsigned pos, isl_int *val)
7399 return isl_map_plain_is_fixed(set, type, pos, val);
7402 int isl_map_fast_is_fixed(__isl_keep isl_map *map,
7403 enum isl_dim_type type, unsigned pos, isl_int *val)
7405 return isl_map_plain_is_fixed(map, type, pos, val);
7408 /* Check if dimension dim has fixed value and if so and if val is not NULL,
7409 * then return this fixed value in *val.
7411 int isl_basic_set_plain_dim_is_fixed(__isl_keep isl_basic_set *bset,
7412 unsigned dim, isl_int *val)
7414 return isl_basic_set_plain_has_fixed_var(bset,
7415 isl_basic_set_n_param(bset) + dim, val);
7418 /* Check if dimension dim has fixed value and if so and if val is not NULL,
7419 * then return this fixed value in *val.
7421 int isl_set_plain_dim_is_fixed(__isl_keep isl_set *set,
7422 unsigned dim, isl_int *val)
7424 return isl_set_plain_has_fixed_var(set, isl_set_n_param(set) + dim, val);
7427 int isl_set_fast_dim_is_fixed(__isl_keep isl_set *set,
7428 unsigned dim, isl_int *val)
7430 return isl_set_plain_dim_is_fixed(set, dim, val);
7433 /* Check if input variable in has fixed value and if so and if val is not NULL,
7434 * then return this fixed value in *val.
7436 int isl_map_plain_input_is_fixed(__isl_keep isl_map *map,
7437 unsigned in, isl_int *val)
7439 return isl_map_plain_has_fixed_var(map, isl_map_n_param(map) + in, val);
7442 /* Check if dimension dim has an (obvious) fixed lower bound and if so
7443 * and if val is not NULL, then return this lower bound in *val.
7445 int isl_basic_set_plain_dim_has_fixed_lower_bound(
7446 __isl_keep isl_basic_set *bset, unsigned dim, isl_int *val)
7448 int i, i_eq = -1, i_ineq = -1;
7455 total = isl_basic_set_total_dim(bset);
7456 nparam = isl_basic_set_n_param(bset);
7457 for (i = 0; i < bset->n_eq; ++i) {
7458 if (isl_int_is_zero(bset->eq[i][1+nparam+dim]))
7464 for (i = 0; i < bset->n_ineq; ++i) {
7465 if (!isl_int_is_pos(bset->ineq[i][1+nparam+dim]))
7467 if (i_eq != -1 || i_ineq != -1)
7471 if (i_eq == -1 && i_ineq == -1)
7473 c = i_eq != -1 ? bset->eq[i_eq] : bset->ineq[i_ineq];
7474 /* The coefficient should always be one due to normalization. */
7475 if (!isl_int_is_one(c[1+nparam+dim]))
7477 if (isl_seq_first_non_zero(c+1, nparam+dim) != -1)
7479 if (isl_seq_first_non_zero(c+1+nparam+dim+1,
7480 total - nparam - dim - 1) != -1)
7483 isl_int_neg(*val, c[0]);
7487 int isl_set_plain_dim_has_fixed_lower_bound(__isl_keep isl_set *set,
7488 unsigned dim, isl_int *val)
7500 return isl_basic_set_plain_dim_has_fixed_lower_bound(set->p[0],
7504 fixed = isl_basic_set_plain_dim_has_fixed_lower_bound(set->p[0],
7506 for (i = 1; fixed == 1 && i < set->n; ++i) {
7507 fixed = isl_basic_set_plain_dim_has_fixed_lower_bound(set->p[i],
7509 if (fixed == 1 && isl_int_ne(tmp, v))
7513 isl_int_set(*val, v);
7524 /* uset_gist depends on constraints without existentially quantified
7525 * variables sorting first.
7527 static int qsort_constraint_cmp(const void *p1, const void *p2)
7529 const struct constraint *c1 = (const struct constraint *)p1;
7530 const struct constraint *c2 = (const struct constraint *)p2;
7532 unsigned size = isl_min(c1->size, c2->size);
7534 l1 = isl_seq_last_non_zero(c1->c, size);
7535 l2 = isl_seq_last_non_zero(c2->c, size);
7540 return isl_seq_cmp(c1->c, c2->c, size);
7543 static struct isl_basic_map *isl_basic_map_sort_constraints(
7544 struct isl_basic_map *bmap)
7547 struct constraint *c;
7552 total = isl_basic_map_total_dim(bmap);
7553 c = isl_alloc_array(bmap->ctx, struct constraint, bmap->n_ineq);
7556 for (i = 0; i < bmap->n_ineq; ++i) {
7558 c[i].c = bmap->ineq[i];
7560 qsort(c, bmap->n_ineq, sizeof(struct constraint), qsort_constraint_cmp);
7561 for (i = 0; i < bmap->n_ineq; ++i)
7562 bmap->ineq[i] = c[i].c;
7566 isl_basic_map_free(bmap);
7570 __isl_give isl_basic_set *isl_basic_set_sort_constraints(
7571 __isl_take isl_basic_set *bset)
7573 return (struct isl_basic_set *)isl_basic_map_sort_constraints(
7574 (struct isl_basic_map *)bset);
7577 struct isl_basic_map *isl_basic_map_normalize(struct isl_basic_map *bmap)
7581 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_NORMALIZED))
7583 bmap = isl_basic_map_remove_redundancies(bmap);
7584 bmap = isl_basic_map_sort_constraints(bmap);
7585 ISL_F_SET(bmap, ISL_BASIC_MAP_NORMALIZED);
7589 struct isl_basic_set *isl_basic_set_normalize(struct isl_basic_set *bset)
7591 return (struct isl_basic_set *)isl_basic_map_normalize(
7592 (struct isl_basic_map *)bset);
7595 int isl_basic_map_plain_cmp(const __isl_keep isl_basic_map *bmap1,
7596 const __isl_keep isl_basic_map *bmap2)
7603 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_RATIONAL) !=
7604 ISL_F_ISSET(bmap2, ISL_BASIC_MAP_RATIONAL))
7605 return ISL_F_ISSET(bmap1, ISL_BASIC_MAP_RATIONAL) ? -1 : 1;
7606 if (isl_basic_map_n_param(bmap1) != isl_basic_map_n_param(bmap2))
7607 return isl_basic_map_n_param(bmap1) - isl_basic_map_n_param(bmap2);
7608 if (isl_basic_map_n_in(bmap1) != isl_basic_map_n_in(bmap2))
7609 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
7610 if (isl_basic_map_n_out(bmap1) != isl_basic_map_n_out(bmap2))
7611 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
7612 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY) &&
7613 ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
7615 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY))
7617 if (ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
7619 if (bmap1->n_eq != bmap2->n_eq)
7620 return bmap1->n_eq - bmap2->n_eq;
7621 if (bmap1->n_ineq != bmap2->n_ineq)
7622 return bmap1->n_ineq - bmap2->n_ineq;
7623 if (bmap1->n_div != bmap2->n_div)
7624 return bmap1->n_div - bmap2->n_div;
7625 total = isl_basic_map_total_dim(bmap1);
7626 for (i = 0; i < bmap1->n_eq; ++i) {
7627 cmp = isl_seq_cmp(bmap1->eq[i], bmap2->eq[i], 1+total);
7631 for (i = 0; i < bmap1->n_ineq; ++i) {
7632 cmp = isl_seq_cmp(bmap1->ineq[i], bmap2->ineq[i], 1+total);
7636 for (i = 0; i < bmap1->n_div; ++i) {
7637 cmp = isl_seq_cmp(bmap1->div[i], bmap2->div[i], 1+1+total);
7644 int isl_basic_set_plain_cmp(const __isl_keep isl_basic_set *bset1,
7645 const __isl_keep isl_basic_set *bset2)
7647 return isl_basic_map_plain_cmp(bset1, bset2);
7650 int isl_set_plain_cmp(const __isl_keep isl_set *set1,
7651 const __isl_keep isl_set *set2)
7657 if (set1->n != set2->n)
7658 return set1->n - set2->n;
7660 for (i = 0; i < set1->n; ++i) {
7661 cmp = isl_basic_set_plain_cmp(set1->p[i], set2->p[i]);
7669 int isl_basic_map_plain_is_equal(__isl_keep isl_basic_map *bmap1,
7670 __isl_keep isl_basic_map *bmap2)
7672 return isl_basic_map_plain_cmp(bmap1, bmap2) == 0;
7675 int isl_basic_set_plain_is_equal(__isl_keep isl_basic_set *bset1,
7676 __isl_keep isl_basic_set *bset2)
7678 return isl_basic_map_plain_is_equal((isl_basic_map *)bset1,
7679 (isl_basic_map *)bset2);
7682 static int qsort_bmap_cmp(const void *p1, const void *p2)
7684 const struct isl_basic_map *bmap1 = *(const struct isl_basic_map **)p1;
7685 const struct isl_basic_map *bmap2 = *(const struct isl_basic_map **)p2;
7687 return isl_basic_map_plain_cmp(bmap1, bmap2);
7690 /* We normalize in place, but if anything goes wrong we need
7691 * to return NULL, so we need to make sure we don't change the
7692 * meaning of any possible other copies of map.
7694 struct isl_map *isl_map_normalize(struct isl_map *map)
7697 struct isl_basic_map *bmap;
7701 if (ISL_F_ISSET(map, ISL_MAP_NORMALIZED))
7703 for (i = 0; i < map->n; ++i) {
7704 bmap = isl_basic_map_normalize(isl_basic_map_copy(map->p[i]));
7707 isl_basic_map_free(map->p[i]);
7710 qsort(map->p, map->n, sizeof(struct isl_basic_map *), qsort_bmap_cmp);
7711 ISL_F_SET(map, ISL_MAP_NORMALIZED);
7712 map = isl_map_remove_empty_parts(map);
7715 for (i = map->n - 1; i >= 1; --i) {
7716 if (!isl_basic_map_plain_is_equal(map->p[i-1], map->p[i]))
7718 isl_basic_map_free(map->p[i-1]);
7719 for (j = i; j < map->n; ++j)
7720 map->p[j-1] = map->p[j];
7730 struct isl_set *isl_set_normalize(struct isl_set *set)
7732 return (struct isl_set *)isl_map_normalize((struct isl_map *)set);
7735 int isl_map_plain_is_equal(__isl_keep isl_map *map1, __isl_keep isl_map *map2)
7745 if (!isl_space_is_equal(map1->dim, map2->dim))
7748 map1 = isl_map_copy(map1);
7749 map2 = isl_map_copy(map2);
7750 map1 = isl_map_normalize(map1);
7751 map2 = isl_map_normalize(map2);
7754 equal = map1->n == map2->n;
7755 for (i = 0; equal && i < map1->n; ++i) {
7756 equal = isl_basic_map_plain_is_equal(map1->p[i], map2->p[i]);
7769 int isl_map_fast_is_equal(__isl_keep isl_map *map1, __isl_keep isl_map *map2)
7771 return isl_map_plain_is_equal(map1, map2);
7774 int isl_set_plain_is_equal(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
7776 return isl_map_plain_is_equal((struct isl_map *)set1,
7777 (struct isl_map *)set2);
7780 int isl_set_fast_is_equal(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
7782 return isl_set_plain_is_equal(set1, set2);
7785 /* Return an interval that ranges from min to max (inclusive)
7787 struct isl_basic_set *isl_basic_set_interval(struct isl_ctx *ctx,
7788 isl_int min, isl_int max)
7791 struct isl_basic_set *bset = NULL;
7793 bset = isl_basic_set_alloc(ctx, 0, 1, 0, 0, 2);
7797 k = isl_basic_set_alloc_inequality(bset);
7800 isl_int_set_si(bset->ineq[k][1], 1);
7801 isl_int_neg(bset->ineq[k][0], min);
7803 k = isl_basic_set_alloc_inequality(bset);
7806 isl_int_set_si(bset->ineq[k][1], -1);
7807 isl_int_set(bset->ineq[k][0], max);
7811 isl_basic_set_free(bset);
7815 /* Return the Cartesian product of the basic sets in list (in the given order).
7817 __isl_give isl_basic_set *isl_basic_set_list_product(
7818 __isl_take struct isl_basic_set_list *list)
7826 struct isl_basic_set *product = NULL;
7830 isl_assert(list->ctx, list->n > 0, goto error);
7831 isl_assert(list->ctx, list->p[0], goto error);
7832 nparam = isl_basic_set_n_param(list->p[0]);
7833 dim = isl_basic_set_n_dim(list->p[0]);
7834 extra = list->p[0]->n_div;
7835 n_eq = list->p[0]->n_eq;
7836 n_ineq = list->p[0]->n_ineq;
7837 for (i = 1; i < list->n; ++i) {
7838 isl_assert(list->ctx, list->p[i], goto error);
7839 isl_assert(list->ctx,
7840 nparam == isl_basic_set_n_param(list->p[i]), goto error);
7841 dim += isl_basic_set_n_dim(list->p[i]);
7842 extra += list->p[i]->n_div;
7843 n_eq += list->p[i]->n_eq;
7844 n_ineq += list->p[i]->n_ineq;
7846 product = isl_basic_set_alloc(list->ctx, nparam, dim, extra,
7851 for (i = 0; i < list->n; ++i) {
7852 isl_basic_set_add_constraints(product,
7853 isl_basic_set_copy(list->p[i]), dim);
7854 dim += isl_basic_set_n_dim(list->p[i]);
7856 isl_basic_set_list_free(list);
7859 isl_basic_set_free(product);
7860 isl_basic_set_list_free(list);
7864 struct isl_basic_map *isl_basic_map_product(
7865 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
7867 isl_space *dim_result = NULL;
7868 struct isl_basic_map *bmap;
7869 unsigned in1, in2, out1, out2, nparam, total, pos;
7870 struct isl_dim_map *dim_map1, *dim_map2;
7872 if (!bmap1 || !bmap2)
7875 isl_assert(bmap1->ctx, isl_space_match(bmap1->dim, isl_dim_param,
7876 bmap2->dim, isl_dim_param), goto error);
7877 dim_result = isl_space_product(isl_space_copy(bmap1->dim),
7878 isl_space_copy(bmap2->dim));
7880 in1 = isl_basic_map_n_in(bmap1);
7881 in2 = isl_basic_map_n_in(bmap2);
7882 out1 = isl_basic_map_n_out(bmap1);
7883 out2 = isl_basic_map_n_out(bmap2);
7884 nparam = isl_basic_map_n_param(bmap1);
7886 total = nparam + in1 + in2 + out1 + out2 + bmap1->n_div + bmap2->n_div;
7887 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
7888 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
7889 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
7890 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
7891 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
7892 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos += in1);
7893 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += in2);
7894 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += out1);
7895 isl_dim_map_div(dim_map1, bmap1, pos += out2);
7896 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
7898 bmap = isl_basic_map_alloc_space(dim_result,
7899 bmap1->n_div + bmap2->n_div,
7900 bmap1->n_eq + bmap2->n_eq,
7901 bmap1->n_ineq + bmap2->n_ineq);
7902 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap1, dim_map1);
7903 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap2, dim_map2);
7904 bmap = isl_basic_map_simplify(bmap);
7905 return isl_basic_map_finalize(bmap);
7907 isl_basic_map_free(bmap1);
7908 isl_basic_map_free(bmap2);
7912 __isl_give isl_basic_map *isl_basic_map_flat_product(
7913 __isl_take isl_basic_map *bmap1, __isl_take isl_basic_map *bmap2)
7915 isl_basic_map *prod;
7917 prod = isl_basic_map_product(bmap1, bmap2);
7918 prod = isl_basic_map_flatten(prod);
7922 __isl_give isl_basic_set *isl_basic_set_flat_product(
7923 __isl_take isl_basic_set *bset1, __isl_take isl_basic_set *bset2)
7925 return isl_basic_map_flat_range_product(bset1, bset2);
7928 __isl_give isl_basic_map *isl_basic_map_domain_product(
7929 __isl_take isl_basic_map *bmap1, __isl_take isl_basic_map *bmap2)
7931 isl_space *space_result = NULL;
7932 isl_basic_map *bmap;
7933 unsigned in1, in2, out, nparam, total, pos;
7934 struct isl_dim_map *dim_map1, *dim_map2;
7936 if (!bmap1 || !bmap2)
7939 space_result = isl_space_domain_product(isl_space_copy(bmap1->dim),
7940 isl_space_copy(bmap2->dim));
7942 in1 = isl_basic_map_dim(bmap1, isl_dim_in);
7943 in2 = isl_basic_map_dim(bmap2, isl_dim_in);
7944 out = isl_basic_map_dim(bmap1, isl_dim_out);
7945 nparam = isl_basic_map_dim(bmap1, isl_dim_param);
7947 total = nparam + in1 + in2 + out + bmap1->n_div + bmap2->n_div;
7948 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
7949 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
7950 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
7951 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
7952 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
7953 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos += in1);
7954 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += in2);
7955 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos);
7956 isl_dim_map_div(dim_map1, bmap1, pos += out);
7957 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
7959 bmap = isl_basic_map_alloc_space(space_result,
7960 bmap1->n_div + bmap2->n_div,
7961 bmap1->n_eq + bmap2->n_eq,
7962 bmap1->n_ineq + bmap2->n_ineq);
7963 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap1, dim_map1);
7964 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap2, dim_map2);
7965 bmap = isl_basic_map_simplify(bmap);
7966 return isl_basic_map_finalize(bmap);
7968 isl_basic_map_free(bmap1);
7969 isl_basic_map_free(bmap2);
7973 __isl_give isl_basic_map *isl_basic_map_range_product(
7974 __isl_take isl_basic_map *bmap1, __isl_take isl_basic_map *bmap2)
7976 isl_space *dim_result = NULL;
7977 isl_basic_map *bmap;
7978 unsigned in, out1, out2, nparam, total, pos;
7979 struct isl_dim_map *dim_map1, *dim_map2;
7981 if (!bmap1 || !bmap2)
7984 dim_result = isl_space_range_product(isl_space_copy(bmap1->dim),
7985 isl_space_copy(bmap2->dim));
7987 in = isl_basic_map_dim(bmap1, isl_dim_in);
7988 out1 = isl_basic_map_n_out(bmap1);
7989 out2 = isl_basic_map_n_out(bmap2);
7990 nparam = isl_basic_map_n_param(bmap1);
7992 total = nparam + in + out1 + out2 + bmap1->n_div + bmap2->n_div;
7993 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
7994 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
7995 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
7996 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
7997 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
7998 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
7999 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += in);
8000 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += out1);
8001 isl_dim_map_div(dim_map1, bmap1, pos += out2);
8002 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
8004 bmap = isl_basic_map_alloc_space(dim_result,
8005 bmap1->n_div + bmap2->n_div,
8006 bmap1->n_eq + bmap2->n_eq,
8007 bmap1->n_ineq + bmap2->n_ineq);
8008 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap1, dim_map1);
8009 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap2, dim_map2);
8010 bmap = isl_basic_map_simplify(bmap);
8011 return isl_basic_map_finalize(bmap);
8013 isl_basic_map_free(bmap1);
8014 isl_basic_map_free(bmap2);
8018 __isl_give isl_basic_map *isl_basic_map_flat_range_product(
8019 __isl_take isl_basic_map *bmap1, __isl_take isl_basic_map *bmap2)
8021 isl_basic_map *prod;
8023 prod = isl_basic_map_range_product(bmap1, bmap2);
8024 prod = isl_basic_map_flatten_range(prod);
8028 static __isl_give isl_map *map_product(__isl_take isl_map *map1,
8029 __isl_take isl_map *map2,
8030 __isl_give isl_space *(*dim_product)(__isl_take isl_space *left,
8031 __isl_take isl_space *right),
8032 __isl_give isl_basic_map *(*basic_map_product)(
8033 __isl_take isl_basic_map *left, __isl_take isl_basic_map *right))
8036 struct isl_map *result;
8042 isl_assert(map1->ctx, isl_space_match(map1->dim, isl_dim_param,
8043 map2->dim, isl_dim_param), goto error);
8045 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
8046 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
8047 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
8049 result = isl_map_alloc_space(dim_product(isl_space_copy(map1->dim),
8050 isl_space_copy(map2->dim)),
8051 map1->n * map2->n, flags);
8054 for (i = 0; i < map1->n; ++i)
8055 for (j = 0; j < map2->n; ++j) {
8056 struct isl_basic_map *part;
8057 part = basic_map_product(isl_basic_map_copy(map1->p[i]),
8058 isl_basic_map_copy(map2->p[j]));
8059 if (isl_basic_map_is_empty(part))
8060 isl_basic_map_free(part);
8062 result = isl_map_add_basic_map(result, part);
8075 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> [B -> D]
8077 static __isl_give isl_map *map_product_aligned(__isl_take isl_map *map1,
8078 __isl_take isl_map *map2)
8080 return map_product(map1, map2, &isl_space_product, &isl_basic_map_product);
8083 __isl_give isl_map *isl_map_product(__isl_take isl_map *map1,
8084 __isl_take isl_map *map2)
8086 return isl_map_align_params_map_map_and(map1, map2, &map_product_aligned);
8089 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
8091 __isl_give isl_map *isl_map_flat_product(__isl_take isl_map *map1,
8092 __isl_take isl_map *map2)
8096 prod = isl_map_product(map1, map2);
8097 prod = isl_map_flatten(prod);
8101 /* Given two set A and B, construct its Cartesian product A x B.
8103 struct isl_set *isl_set_product(struct isl_set *set1, struct isl_set *set2)
8105 return isl_map_range_product(set1, set2);
8108 __isl_give isl_set *isl_set_flat_product(__isl_take isl_set *set1,
8109 __isl_take isl_set *set2)
8111 return isl_map_flat_range_product(set1, set2);
8114 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> (B * D)
8116 static __isl_give isl_map *map_domain_product_aligned(__isl_take isl_map *map1,
8117 __isl_take isl_map *map2)
8119 return map_product(map1, map2, &isl_space_domain_product,
8120 &isl_basic_map_domain_product);
8123 /* Given two maps A -> B and C -> D, construct a map (A * C) -> [B -> D]
8125 static __isl_give isl_map *map_range_product_aligned(__isl_take isl_map *map1,
8126 __isl_take isl_map *map2)
8128 return map_product(map1, map2, &isl_space_range_product,
8129 &isl_basic_map_range_product);
8132 __isl_give isl_map *isl_map_domain_product(__isl_take isl_map *map1,
8133 __isl_take isl_map *map2)
8135 return isl_map_align_params_map_map_and(map1, map2,
8136 &map_domain_product_aligned);
8139 __isl_give isl_map *isl_map_range_product(__isl_take isl_map *map1,
8140 __isl_take isl_map *map2)
8142 return isl_map_align_params_map_map_and(map1, map2,
8143 &map_range_product_aligned);
8146 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B * D)
8148 __isl_give isl_map *isl_map_flat_domain_product(__isl_take isl_map *map1,
8149 __isl_take isl_map *map2)
8153 prod = isl_map_domain_product(map1, map2);
8154 prod = isl_map_flatten_domain(prod);
8158 /* Given two maps A -> B and C -> D, construct a map (A * C) -> (B, D)
8160 __isl_give isl_map *isl_map_flat_range_product(__isl_take isl_map *map1,
8161 __isl_take isl_map *map2)
8165 prod = isl_map_range_product(map1, map2);
8166 prod = isl_map_flatten_range(prod);
8170 uint32_t isl_basic_map_get_hash(__isl_keep isl_basic_map *bmap)
8173 uint32_t hash = isl_hash_init();
8178 bmap = isl_basic_map_copy(bmap);
8179 bmap = isl_basic_map_normalize(bmap);
8182 total = isl_basic_map_total_dim(bmap);
8183 isl_hash_byte(hash, bmap->n_eq & 0xFF);
8184 for (i = 0; i < bmap->n_eq; ++i) {
8186 c_hash = isl_seq_get_hash(bmap->eq[i], 1 + total);
8187 isl_hash_hash(hash, c_hash);
8189 isl_hash_byte(hash, bmap->n_ineq & 0xFF);
8190 for (i = 0; i < bmap->n_ineq; ++i) {
8192 c_hash = isl_seq_get_hash(bmap->ineq[i], 1 + total);
8193 isl_hash_hash(hash, c_hash);
8195 isl_hash_byte(hash, bmap->n_div & 0xFF);
8196 for (i = 0; i < bmap->n_div; ++i) {
8198 if (isl_int_is_zero(bmap->div[i][0]))
8200 isl_hash_byte(hash, i & 0xFF);
8201 c_hash = isl_seq_get_hash(bmap->div[i], 1 + 1 + total);
8202 isl_hash_hash(hash, c_hash);
8204 isl_basic_map_free(bmap);
8208 uint32_t isl_basic_set_get_hash(__isl_keep isl_basic_set *bset)
8210 return isl_basic_map_get_hash((isl_basic_map *)bset);
8213 uint32_t isl_map_get_hash(__isl_keep isl_map *map)
8220 map = isl_map_copy(map);
8221 map = isl_map_normalize(map);
8225 hash = isl_hash_init();
8226 for (i = 0; i < map->n; ++i) {
8228 bmap_hash = isl_basic_map_get_hash(map->p[i]);
8229 isl_hash_hash(hash, bmap_hash);
8237 uint32_t isl_set_get_hash(__isl_keep isl_set *set)
8239 return isl_map_get_hash((isl_map *)set);
8242 /* Check if the value for dimension dim is completely determined
8243 * by the values of the other parameters and variables.
8244 * That is, check if dimension dim is involved in an equality.
8246 int isl_basic_set_dim_is_unique(struct isl_basic_set *bset, unsigned dim)
8253 nparam = isl_basic_set_n_param(bset);
8254 for (i = 0; i < bset->n_eq; ++i)
8255 if (!isl_int_is_zero(bset->eq[i][1 + nparam + dim]))
8260 /* Check if the value for dimension dim is completely determined
8261 * by the values of the other parameters and variables.
8262 * That is, check if dimension dim is involved in an equality
8263 * for each of the subsets.
8265 int isl_set_dim_is_unique(struct isl_set *set, unsigned dim)
8271 for (i = 0; i < set->n; ++i) {
8273 unique = isl_basic_set_dim_is_unique(set->p[i], dim);
8280 int isl_set_n_basic_set(__isl_keep isl_set *set)
8282 return set ? set->n : 0;
8285 int isl_map_foreach_basic_map(__isl_keep isl_map *map,
8286 int (*fn)(__isl_take isl_basic_map *bmap, void *user), void *user)
8293 for (i = 0; i < map->n; ++i)
8294 if (fn(isl_basic_map_copy(map->p[i]), user) < 0)
8300 int isl_set_foreach_basic_set(__isl_keep isl_set *set,
8301 int (*fn)(__isl_take isl_basic_set *bset, void *user), void *user)
8308 for (i = 0; i < set->n; ++i)
8309 if (fn(isl_basic_set_copy(set->p[i]), user) < 0)
8315 __isl_give isl_basic_set *isl_basic_set_lift(__isl_take isl_basic_set *bset)
8322 bset = isl_basic_set_cow(bset);
8326 dim = isl_basic_set_get_space(bset);
8327 dim = isl_space_lift(dim, bset->n_div);
8330 isl_space_free(bset->dim);
8332 bset->extra -= bset->n_div;
8335 bset = isl_basic_set_finalize(bset);
8339 isl_basic_set_free(bset);
8343 __isl_give isl_set *isl_set_lift(__isl_take isl_set *set)
8349 set = isl_set_align_divs(set);
8354 set = isl_set_cow(set);
8358 n_div = set->p[0]->n_div;
8359 dim = isl_set_get_space(set);
8360 dim = isl_space_lift(dim, n_div);
8363 isl_space_free(set->dim);
8366 for (i = 0; i < set->n; ++i) {
8367 set->p[i] = isl_basic_set_lift(set->p[i]);
8378 __isl_give isl_map *isl_set_lifting(__isl_take isl_set *set)
8381 struct isl_basic_map *bmap;
8388 set = isl_set_align_divs(set);
8393 dim = isl_set_get_space(set);
8394 if (set->n == 0 || set->p[0]->n_div == 0) {
8396 return isl_map_identity(isl_space_map_from_set(dim));
8399 n_div = set->p[0]->n_div;
8400 dim = isl_space_map_from_set(dim);
8401 n_param = isl_space_dim(dim, isl_dim_param);
8402 n_set = isl_space_dim(dim, isl_dim_in);
8403 dim = isl_space_extend(dim, n_param, n_set, n_set + n_div);
8404 bmap = isl_basic_map_alloc_space(dim, 0, n_set, 2 * n_div);
8405 for (i = 0; i < n_set; ++i)
8406 bmap = var_equal(bmap, i);
8408 total = n_param + n_set + n_set + n_div;
8409 for (i = 0; i < n_div; ++i) {
8410 k = isl_basic_map_alloc_inequality(bmap);
8413 isl_seq_cpy(bmap->ineq[k], set->p[0]->div[i]+1, 1+n_param);
8414 isl_seq_clr(bmap->ineq[k]+1+n_param, n_set);
8415 isl_seq_cpy(bmap->ineq[k]+1+n_param+n_set,
8416 set->p[0]->div[i]+1+1+n_param, n_set + n_div);
8417 isl_int_neg(bmap->ineq[k][1+n_param+n_set+n_set+i],
8418 set->p[0]->div[i][0]);
8420 l = isl_basic_map_alloc_inequality(bmap);
8423 isl_seq_neg(bmap->ineq[l], bmap->ineq[k], 1 + total);
8424 isl_int_add(bmap->ineq[l][0], bmap->ineq[l][0],
8425 set->p[0]->div[i][0]);
8426 isl_int_sub_ui(bmap->ineq[l][0], bmap->ineq[l][0], 1);
8430 bmap = isl_basic_map_simplify(bmap);
8431 bmap = isl_basic_map_finalize(bmap);
8432 return isl_map_from_basic_map(bmap);
8435 isl_basic_map_free(bmap);
8439 int isl_basic_set_size(__isl_keep isl_basic_set *bset)
8447 dim = isl_basic_set_total_dim(bset);
8448 size += bset->n_eq * (1 + dim);
8449 size += bset->n_ineq * (1 + dim);
8450 size += bset->n_div * (2 + dim);
8455 int isl_set_size(__isl_keep isl_set *set)
8463 for (i = 0; i < set->n; ++i)
8464 size += isl_basic_set_size(set->p[i]);
8469 /* Check if there is any lower bound (if lower == 0) and/or upper
8470 * bound (if upper == 0) on the specified dim.
8472 static int basic_map_dim_is_bounded(__isl_keep isl_basic_map *bmap,
8473 enum isl_dim_type type, unsigned pos, int lower, int upper)
8480 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), return -1);
8482 pos += isl_basic_map_offset(bmap, type);
8484 for (i = 0; i < bmap->n_div; ++i) {
8485 if (isl_int_is_zero(bmap->div[i][0]))
8487 if (!isl_int_is_zero(bmap->div[i][1 + pos]))
8491 for (i = 0; i < bmap->n_eq; ++i)
8492 if (!isl_int_is_zero(bmap->eq[i][pos]))
8495 for (i = 0; i < bmap->n_ineq; ++i) {
8496 int sgn = isl_int_sgn(bmap->ineq[i][pos]);
8503 return lower && upper;
8506 int isl_basic_map_dim_is_bounded(__isl_keep isl_basic_map *bmap,
8507 enum isl_dim_type type, unsigned pos)
8509 return basic_map_dim_is_bounded(bmap, type, pos, 0, 0);
8512 int isl_basic_map_dim_has_lower_bound(__isl_keep isl_basic_map *bmap,
8513 enum isl_dim_type type, unsigned pos)
8515 return basic_map_dim_is_bounded(bmap, type, pos, 0, 1);
8518 int isl_basic_map_dim_has_upper_bound(__isl_keep isl_basic_map *bmap,
8519 enum isl_dim_type type, unsigned pos)
8521 return basic_map_dim_is_bounded(bmap, type, pos, 1, 0);
8524 int isl_map_dim_is_bounded(__isl_keep isl_map *map,
8525 enum isl_dim_type type, unsigned pos)
8532 for (i = 0; i < map->n; ++i) {
8534 bounded = isl_basic_map_dim_is_bounded(map->p[i], type, pos);
8535 if (bounded < 0 || !bounded)
8542 /* Return 1 if the specified dim is involved in both an upper bound
8543 * and a lower bound.
8545 int isl_set_dim_is_bounded(__isl_keep isl_set *set,
8546 enum isl_dim_type type, unsigned pos)
8548 return isl_map_dim_is_bounded((isl_map *)set, type, pos);
8551 static int has_bound(__isl_keep isl_map *map,
8552 enum isl_dim_type type, unsigned pos,
8553 int (*fn)(__isl_keep isl_basic_map *bmap,
8554 enum isl_dim_type type, unsigned pos))
8561 for (i = 0; i < map->n; ++i) {
8563 bounded = fn(map->p[i], type, pos);
8564 if (bounded < 0 || bounded)
8571 /* Return 1 if the specified dim is involved in any lower bound.
8573 int isl_set_dim_has_lower_bound(__isl_keep isl_set *set,
8574 enum isl_dim_type type, unsigned pos)
8576 return has_bound(set, type, pos, &isl_basic_map_dim_has_lower_bound);
8579 /* Return 1 if the specified dim is involved in any upper bound.
8581 int isl_set_dim_has_upper_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_upper_bound);
8587 /* For each of the "n" variables starting at "first", determine
8588 * the sign of the variable and put the results in the first "n"
8589 * elements of the array "signs".
8591 * 1 means that the variable is non-negative
8592 * -1 means that the variable is non-positive
8593 * 0 means the variable attains both positive and negative values.
8595 int isl_basic_set_vars_get_sign(__isl_keep isl_basic_set *bset,
8596 unsigned first, unsigned n, int *signs)
8598 isl_vec *bound = NULL;
8599 struct isl_tab *tab = NULL;
8600 struct isl_tab_undo *snap;
8603 if (!bset || !signs)
8606 bound = isl_vec_alloc(bset->ctx, 1 + isl_basic_set_total_dim(bset));
8607 tab = isl_tab_from_basic_set(bset);
8611 isl_seq_clr(bound->el, bound->size);
8612 isl_int_set_si(bound->el[0], -1);
8614 snap = isl_tab_snap(tab);
8615 for (i = 0; i < n; ++i) {
8618 isl_int_set_si(bound->el[1 + first + i], -1);
8619 if (isl_tab_add_ineq(tab, bound->el) < 0)
8622 isl_int_set_si(bound->el[1 + first + i], 0);
8623 if (isl_tab_rollback(tab, snap) < 0)
8631 isl_int_set_si(bound->el[1 + first + i], 1);
8632 if (isl_tab_add_ineq(tab, bound->el) < 0)
8635 isl_int_set_si(bound->el[1 + first + i], 0);
8636 if (isl_tab_rollback(tab, snap) < 0)
8639 signs[i] = empty ? -1 : 0;
8643 isl_vec_free(bound);
8647 isl_vec_free(bound);
8651 int isl_basic_set_dims_get_sign(__isl_keep isl_basic_set *bset,
8652 enum isl_dim_type type, unsigned first, unsigned n, int *signs)
8654 if (!bset || !signs)
8656 isl_assert(bset->ctx, first + n <= isl_basic_set_dim(bset, type),
8659 first += pos(bset->dim, type) - 1;
8660 return isl_basic_set_vars_get_sign(bset, first, n, signs);
8663 /* Check if the given basic map is obviously single-valued.
8664 * In particular, for each output dimension, check that there is
8665 * an equality that defines the output dimension in terms of
8666 * earlier dimensions.
8668 int isl_basic_map_plain_is_single_valued(__isl_keep isl_basic_map *bmap)
8678 total = 1 + isl_basic_map_total_dim(bmap);
8679 n_out = isl_basic_map_dim(bmap, isl_dim_out);
8680 o_out = isl_basic_map_offset(bmap, isl_dim_out);
8682 for (i = 0; i < n_out; ++i) {
8683 for (j = 0; j < bmap->n_eq; ++j) {
8684 if (isl_int_is_zero(bmap->eq[j][o_out + i]))
8686 if (isl_seq_first_non_zero(bmap->eq[j] + o_out + i + 1,
8687 total - (o_out + i + 1)) == -1)
8690 if (j >= bmap->n_eq)
8697 /* Check if the given map is obviously single-valued.
8699 int isl_map_plain_is_single_valued(__isl_keep isl_map *map)
8708 return isl_basic_map_plain_is_single_valued(map->p[0]);
8711 /* Check if the given map is single-valued.
8716 * and check if the result is a subset of the identity mapping.
8718 int isl_map_is_single_valued(__isl_keep isl_map *map)
8725 sv = isl_map_plain_is_single_valued(map);
8729 test = isl_map_reverse(isl_map_copy(map));
8730 test = isl_map_apply_range(test, isl_map_copy(map));
8732 dim = isl_space_map_from_set(isl_space_range(isl_map_get_space(map)));
8733 id = isl_map_identity(dim);
8735 sv = isl_map_is_subset(test, id);
8743 int isl_map_is_injective(__isl_keep isl_map *map)
8747 map = isl_map_copy(map);
8748 map = isl_map_reverse(map);
8749 in = isl_map_is_single_valued(map);
8755 /* Check if the given map is obviously injective.
8757 int isl_map_plain_is_injective(__isl_keep isl_map *map)
8761 map = isl_map_copy(map);
8762 map = isl_map_reverse(map);
8763 in = isl_map_plain_is_single_valued(map);
8769 int isl_map_is_bijective(__isl_keep isl_map *map)
8773 sv = isl_map_is_single_valued(map);
8777 return isl_map_is_injective(map);
8780 int isl_set_is_singleton(__isl_keep isl_set *set)
8782 return isl_map_is_single_valued((isl_map *)set);
8785 int isl_map_is_translation(__isl_keep isl_map *map)
8790 delta = isl_map_deltas(isl_map_copy(map));
8791 ok = isl_set_is_singleton(delta);
8792 isl_set_free(delta);
8797 static int unique(isl_int *p, unsigned pos, unsigned len)
8799 if (isl_seq_first_non_zero(p, pos) != -1)
8801 if (isl_seq_first_non_zero(p + pos + 1, len - pos - 1) != -1)
8806 int isl_basic_set_is_box(__isl_keep isl_basic_set *bset)
8815 if (isl_basic_set_dim(bset, isl_dim_div) != 0)
8818 nvar = isl_basic_set_dim(bset, isl_dim_set);
8819 ovar = isl_space_offset(bset->dim, isl_dim_set);
8820 for (j = 0; j < nvar; ++j) {
8821 int lower = 0, upper = 0;
8822 for (i = 0; i < bset->n_eq; ++i) {
8823 if (isl_int_is_zero(bset->eq[i][1 + ovar + j]))
8825 if (!unique(bset->eq[i] + 1 + ovar, j, nvar))
8831 for (i = 0; i < bset->n_ineq; ++i) {
8832 if (isl_int_is_zero(bset->ineq[i][1 + ovar + j]))
8834 if (!unique(bset->ineq[i] + 1 + ovar, j, nvar))
8836 if (isl_int_is_pos(bset->ineq[i][1 + ovar + j]))
8841 if (!lower || !upper)
8848 int isl_set_is_box(__isl_keep isl_set *set)
8855 return isl_basic_set_is_box(set->p[0]);
8858 int isl_basic_set_is_wrapping(__isl_keep isl_basic_set *bset)
8863 return isl_space_is_wrapping(bset->dim);
8866 int isl_set_is_wrapping(__isl_keep isl_set *set)
8871 return isl_space_is_wrapping(set->dim);
8874 __isl_give isl_basic_set *isl_basic_map_wrap(__isl_take isl_basic_map *bmap)
8876 bmap = isl_basic_map_cow(bmap);
8880 bmap->dim = isl_space_wrap(bmap->dim);
8884 bmap = isl_basic_map_finalize(bmap);
8886 return (isl_basic_set *)bmap;
8888 isl_basic_map_free(bmap);
8892 __isl_give isl_set *isl_map_wrap(__isl_take isl_map *map)
8896 map = isl_map_cow(map);
8900 for (i = 0; i < map->n; ++i) {
8901 map->p[i] = (isl_basic_map *)isl_basic_map_wrap(map->p[i]);
8905 map->dim = isl_space_wrap(map->dim);
8909 return (isl_set *)map;
8915 __isl_give isl_basic_map *isl_basic_set_unwrap(__isl_take isl_basic_set *bset)
8917 bset = isl_basic_set_cow(bset);
8921 bset->dim = isl_space_unwrap(bset->dim);
8925 bset = isl_basic_set_finalize(bset);
8927 return (isl_basic_map *)bset;
8929 isl_basic_set_free(bset);
8933 __isl_give isl_map *isl_set_unwrap(__isl_take isl_set *set)
8940 if (!isl_set_is_wrapping(set))
8941 isl_die(set->ctx, isl_error_invalid, "not a wrapping set",
8944 set = isl_set_cow(set);
8948 for (i = 0; i < set->n; ++i) {
8949 set->p[i] = (isl_basic_set *)isl_basic_set_unwrap(set->p[i]);
8954 set->dim = isl_space_unwrap(set->dim);
8958 return (isl_map *)set;
8964 __isl_give isl_basic_map *isl_basic_map_reset(__isl_take isl_basic_map *bmap,
8965 enum isl_dim_type type)
8970 if (!isl_space_is_named_or_nested(bmap->dim, type))
8973 bmap = isl_basic_map_cow(bmap);
8977 bmap->dim = isl_space_reset(bmap->dim, type);
8981 bmap = isl_basic_map_finalize(bmap);
8985 isl_basic_map_free(bmap);
8989 __isl_give isl_map *isl_map_reset(__isl_take isl_map *map,
8990 enum isl_dim_type type)
8997 if (!isl_space_is_named_or_nested(map->dim, type))
9000 map = isl_map_cow(map);
9004 for (i = 0; i < map->n; ++i) {
9005 map->p[i] = isl_basic_map_reset(map->p[i], type);
9009 map->dim = isl_space_reset(map->dim, type);
9019 __isl_give isl_basic_map *isl_basic_map_flatten(__isl_take isl_basic_map *bmap)
9024 if (!bmap->dim->nested[0] && !bmap->dim->nested[1])
9027 bmap = isl_basic_map_cow(bmap);
9031 bmap->dim = isl_space_flatten(bmap->dim);
9035 bmap = isl_basic_map_finalize(bmap);
9039 isl_basic_map_free(bmap);
9043 __isl_give isl_basic_set *isl_basic_set_flatten(__isl_take isl_basic_set *bset)
9045 return (isl_basic_set *)isl_basic_map_flatten((isl_basic_map *)bset);
9048 __isl_give isl_basic_map *isl_basic_map_flatten_domain(
9049 __isl_take isl_basic_map *bmap)
9054 if (!bmap->dim->nested[0])
9057 bmap = isl_basic_map_cow(bmap);
9061 bmap->dim = isl_space_flatten_domain(bmap->dim);
9065 bmap = isl_basic_map_finalize(bmap);
9069 isl_basic_map_free(bmap);
9073 __isl_give isl_basic_map *isl_basic_map_flatten_range(
9074 __isl_take isl_basic_map *bmap)
9079 if (!bmap->dim->nested[1])
9082 bmap = isl_basic_map_cow(bmap);
9086 bmap->dim = isl_space_flatten_range(bmap->dim);
9090 bmap = isl_basic_map_finalize(bmap);
9094 isl_basic_map_free(bmap);
9098 __isl_give isl_map *isl_map_flatten(__isl_take isl_map *map)
9105 if (!map->dim->nested[0] && !map->dim->nested[1])
9108 map = isl_map_cow(map);
9112 for (i = 0; i < map->n; ++i) {
9113 map->p[i] = isl_basic_map_flatten(map->p[i]);
9117 map->dim = isl_space_flatten(map->dim);
9127 __isl_give isl_set *isl_set_flatten(__isl_take isl_set *set)
9129 return (isl_set *)isl_map_flatten((isl_map *)set);
9132 __isl_give isl_map *isl_set_flatten_map(__isl_take isl_set *set)
9134 isl_space *dim, *flat_dim;
9137 dim = isl_set_get_space(set);
9138 flat_dim = isl_space_flatten(isl_space_copy(dim));
9139 map = isl_map_identity(isl_space_join(isl_space_reverse(dim), flat_dim));
9140 map = isl_map_intersect_domain(map, set);
9145 __isl_give isl_map *isl_map_flatten_domain(__isl_take isl_map *map)
9152 if (!map->dim->nested[0])
9155 map = isl_map_cow(map);
9159 for (i = 0; i < map->n; ++i) {
9160 map->p[i] = isl_basic_map_flatten_domain(map->p[i]);
9164 map->dim = isl_space_flatten_domain(map->dim);
9174 __isl_give isl_map *isl_map_flatten_range(__isl_take isl_map *map)
9181 if (!map->dim->nested[1])
9184 map = isl_map_cow(map);
9188 for (i = 0; i < map->n; ++i) {
9189 map->p[i] = isl_basic_map_flatten_range(map->p[i]);
9193 map->dim = isl_space_flatten_range(map->dim);
9203 /* Reorder the dimensions of "bmap" according to the given dim_map
9204 * and set the dimension specification to "dim".
9206 __isl_give isl_basic_map *isl_basic_map_realign(__isl_take isl_basic_map *bmap,
9207 __isl_take isl_space *dim, __isl_take struct isl_dim_map *dim_map)
9211 bmap = isl_basic_map_cow(bmap);
9212 if (!bmap || !dim || !dim_map)
9215 res = isl_basic_map_alloc_space(dim,
9216 bmap->n_div, bmap->n_eq, bmap->n_ineq);
9217 res = isl_basic_map_add_constraints_dim_map(res, bmap, dim_map);
9218 res = isl_basic_map_finalize(res);
9222 isl_basic_map_free(bmap);
9223 isl_space_free(dim);
9227 /* Reorder the dimensions of "map" according to given reordering.
9229 __isl_give isl_map *isl_map_realign(__isl_take isl_map *map,
9230 __isl_take isl_reordering *r)
9233 struct isl_dim_map *dim_map;
9235 map = isl_map_cow(map);
9236 dim_map = isl_dim_map_from_reordering(r);
9237 if (!map || !r || !dim_map)
9240 for (i = 0; i < map->n; ++i) {
9241 struct isl_dim_map *dim_map_i;
9243 dim_map_i = isl_dim_map_extend(dim_map, map->p[i]);
9245 map->p[i] = isl_basic_map_realign(map->p[i],
9246 isl_space_copy(r->dim), dim_map_i);
9252 map = isl_map_reset_space(map, isl_space_copy(r->dim));
9254 isl_reordering_free(r);
9260 isl_reordering_free(r);
9264 __isl_give isl_set *isl_set_realign(__isl_take isl_set *set,
9265 __isl_take isl_reordering *r)
9267 return (isl_set *)isl_map_realign((isl_map *)set, r);
9270 __isl_give isl_map *isl_map_align_params(__isl_take isl_map *map,
9271 __isl_take isl_space *model)
9278 ctx = isl_space_get_ctx(model);
9279 if (!isl_space_has_named_params(model))
9280 isl_die(ctx, isl_error_invalid,
9281 "model has unnamed parameters", goto error);
9282 if (!isl_space_has_named_params(map->dim))
9283 isl_die(ctx, isl_error_invalid,
9284 "relation has unnamed parameters", goto error);
9285 if (!isl_space_match(map->dim, isl_dim_param, model, isl_dim_param)) {
9286 isl_reordering *exp;
9288 model = isl_space_drop_dims(model, isl_dim_in,
9289 0, isl_space_dim(model, isl_dim_in));
9290 model = isl_space_drop_dims(model, isl_dim_out,
9291 0, isl_space_dim(model, isl_dim_out));
9292 exp = isl_parameter_alignment_reordering(map->dim, model);
9293 exp = isl_reordering_extend_space(exp, isl_map_get_space(map));
9294 map = isl_map_realign(map, exp);
9297 isl_space_free(model);
9300 isl_space_free(model);
9305 __isl_give isl_set *isl_set_align_params(__isl_take isl_set *set,
9306 __isl_take isl_space *model)
9308 return isl_map_align_params(set, model);
9311 __isl_give isl_mat *isl_basic_map_equalities_matrix(
9312 __isl_keep isl_basic_map *bmap, enum isl_dim_type c1,
9313 enum isl_dim_type c2, enum isl_dim_type c3,
9314 enum isl_dim_type c4, enum isl_dim_type c5)
9316 enum isl_dim_type c[5] = { c1, c2, c3, c4, c5 };
9317 struct isl_mat *mat;
9323 mat = isl_mat_alloc(bmap->ctx, bmap->n_eq,
9324 isl_basic_map_total_dim(bmap) + 1);
9327 for (i = 0; i < bmap->n_eq; ++i)
9328 for (j = 0, pos = 0; j < 5; ++j) {
9329 int off = isl_basic_map_offset(bmap, c[j]);
9330 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
9331 isl_int_set(mat->row[i][pos],
9332 bmap->eq[i][off + k]);
9340 __isl_give isl_mat *isl_basic_map_inequalities_matrix(
9341 __isl_keep isl_basic_map *bmap, enum isl_dim_type c1,
9342 enum isl_dim_type c2, enum isl_dim_type c3,
9343 enum isl_dim_type c4, enum isl_dim_type c5)
9345 enum isl_dim_type c[5] = { c1, c2, c3, c4, c5 };
9346 struct isl_mat *mat;
9352 mat = isl_mat_alloc(bmap->ctx, bmap->n_ineq,
9353 isl_basic_map_total_dim(bmap) + 1);
9356 for (i = 0; i < bmap->n_ineq; ++i)
9357 for (j = 0, pos = 0; j < 5; ++j) {
9358 int off = isl_basic_map_offset(bmap, c[j]);
9359 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
9360 isl_int_set(mat->row[i][pos],
9361 bmap->ineq[i][off + k]);
9369 __isl_give isl_basic_map *isl_basic_map_from_constraint_matrices(
9370 __isl_take isl_space *dim,
9371 __isl_take isl_mat *eq, __isl_take isl_mat *ineq, enum isl_dim_type c1,
9372 enum isl_dim_type c2, enum isl_dim_type c3,
9373 enum isl_dim_type c4, enum isl_dim_type c5)
9375 enum isl_dim_type c[5] = { c1, c2, c3, c4, c5 };
9376 isl_basic_map *bmap;
9382 if (!dim || !eq || !ineq)
9385 if (eq->n_col != ineq->n_col)
9386 isl_die(dim->ctx, isl_error_invalid,
9387 "equalities and inequalities matrices should have "
9388 "same number of columns", goto error);
9390 total = 1 + isl_space_dim(dim, isl_dim_all);
9392 if (eq->n_col < total)
9393 isl_die(dim->ctx, isl_error_invalid,
9394 "number of columns too small", goto error);
9396 extra = eq->n_col - total;
9398 bmap = isl_basic_map_alloc_space(isl_space_copy(dim), extra,
9399 eq->n_row, ineq->n_row);
9402 for (i = 0; i < extra; ++i) {
9403 k = isl_basic_map_alloc_div(bmap);
9406 isl_int_set_si(bmap->div[k][0], 0);
9408 for (i = 0; i < eq->n_row; ++i) {
9409 l = isl_basic_map_alloc_equality(bmap);
9412 for (j = 0, pos = 0; j < 5; ++j) {
9413 int off = isl_basic_map_offset(bmap, c[j]);
9414 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
9415 isl_int_set(bmap->eq[l][off + k],
9421 for (i = 0; i < ineq->n_row; ++i) {
9422 l = isl_basic_map_alloc_inequality(bmap);
9425 for (j = 0, pos = 0; j < 5; ++j) {
9426 int off = isl_basic_map_offset(bmap, c[j]);
9427 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
9428 isl_int_set(bmap->ineq[l][off + k],
9435 isl_space_free(dim);
9441 isl_space_free(dim);
9447 __isl_give isl_mat *isl_basic_set_equalities_matrix(
9448 __isl_keep isl_basic_set *bset, enum isl_dim_type c1,
9449 enum isl_dim_type c2, enum isl_dim_type c3, enum isl_dim_type c4)
9451 return isl_basic_map_equalities_matrix((isl_basic_map *)bset,
9452 c1, c2, c3, c4, isl_dim_in);
9455 __isl_give isl_mat *isl_basic_set_inequalities_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_inequalities_matrix((isl_basic_map *)bset,
9460 c1, c2, c3, c4, isl_dim_in);
9463 __isl_give isl_basic_set *isl_basic_set_from_constraint_matrices(
9464 __isl_take isl_space *dim,
9465 __isl_take isl_mat *eq, __isl_take isl_mat *ineq, enum isl_dim_type c1,
9466 enum isl_dim_type c2, enum isl_dim_type c3, enum isl_dim_type c4)
9468 return (isl_basic_set*)
9469 isl_basic_map_from_constraint_matrices(dim, eq, ineq,
9470 c1, c2, c3, c4, isl_dim_in);
9473 int isl_basic_map_can_zip(__isl_keep isl_basic_map *bmap)
9478 return isl_space_can_zip(bmap->dim);
9481 int isl_map_can_zip(__isl_keep isl_map *map)
9486 return isl_space_can_zip(map->dim);
9489 /* Given a basic map (A -> B) -> (C -> D), return the corresponding basic map
9490 * (A -> C) -> (B -> D).
9492 __isl_give isl_basic_map *isl_basic_map_zip(__isl_take isl_basic_map *bmap)
9501 if (!isl_basic_map_can_zip(bmap))
9502 isl_die(bmap->ctx, isl_error_invalid,
9503 "basic map cannot be zipped", goto error);
9504 pos = isl_basic_map_offset(bmap, isl_dim_in) +
9505 isl_space_dim(bmap->dim->nested[0], isl_dim_in);
9506 n1 = isl_space_dim(bmap->dim->nested[0], isl_dim_out);
9507 n2 = isl_space_dim(bmap->dim->nested[1], isl_dim_in);
9508 bmap = isl_basic_map_swap_vars(bmap, pos, n1, n2);
9511 bmap->dim = isl_space_zip(bmap->dim);
9516 isl_basic_map_free(bmap);
9520 /* Given a map (A -> B) -> (C -> D), return the corresponding map
9521 * (A -> C) -> (B -> D).
9523 __isl_give isl_map *isl_map_zip(__isl_take isl_map *map)
9530 if (!isl_map_can_zip(map))
9531 isl_die(map->ctx, isl_error_invalid, "map cannot be zipped",
9534 map = isl_map_cow(map);
9538 for (i = 0; i < map->n; ++i) {
9539 map->p[i] = isl_basic_map_zip(map->p[i]);
9544 map->dim = isl_space_zip(map->dim);
9554 /* Construct a basic map mapping the domain of the affine expression
9555 * to a one-dimensional range prescribed by the affine expression.
9557 __isl_give isl_basic_map *isl_basic_map_from_aff(__isl_take isl_aff *aff)
9561 isl_local_space *ls;
9562 isl_basic_map *bmap;
9567 ls = isl_aff_get_local_space(aff);
9568 bmap = isl_basic_map_from_local_space(ls);
9569 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
9570 k = isl_basic_map_alloc_equality(bmap);
9574 pos = isl_basic_map_offset(bmap, isl_dim_out);
9575 isl_seq_cpy(bmap->eq[k], aff->v->el + 1, pos);
9576 isl_int_neg(bmap->eq[k][pos], aff->v->el[0]);
9577 isl_seq_cpy(bmap->eq[k] + pos + 1, aff->v->el + 1 + pos,
9578 aff->v->size - (pos + 1));
9581 bmap = isl_basic_map_finalize(bmap);
9585 isl_basic_map_free(bmap);
9589 /* Construct a basic map mapping a domain in the given space to
9590 * to an n-dimensional range, with n the number of elements in the list,
9591 * where each coordinate in the range is prescribed by the
9592 * corresponding affine expression.
9593 * The domains of all affine expressions in the list are assumed to match
9596 __isl_give isl_basic_map *isl_basic_map_from_aff_list(
9597 __isl_take isl_space *domain_dim, __isl_take isl_aff_list *list)
9601 isl_basic_map *bmap;
9606 dim = isl_space_from_domain(domain_dim);
9607 bmap = isl_basic_map_universe(dim);
9609 for (i = 0; i < list->n; ++i) {
9611 isl_basic_map *bmap_i;
9613 aff = isl_aff_copy(list->p[i]);
9614 bmap_i = isl_basic_map_from_aff(aff);
9616 bmap = isl_basic_map_flat_range_product(bmap, bmap_i);
9619 isl_aff_list_free(list);
9623 __isl_give isl_set *isl_set_equate(__isl_take isl_set *set,
9624 enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2)
9626 return isl_map_equate(set, type1, pos1, type2, pos2);
9629 /* Add a constraint imposing that the given two dimensions are equal.
9631 __isl_give isl_map *isl_map_equate(__isl_take isl_map *map,
9632 enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2)
9634 isl_basic_map *bmap = NULL;
9640 if (pos1 >= isl_map_dim(map, type1))
9641 isl_die(map->ctx, isl_error_invalid,
9642 "index out of bounds", goto error);
9643 if (pos2 >= isl_map_dim(map, type2))
9644 isl_die(map->ctx, isl_error_invalid,
9645 "index out of bounds", goto error);
9647 bmap = isl_basic_map_alloc_space(isl_map_get_space(map), 0, 1, 0);
9648 i = isl_basic_map_alloc_equality(bmap);
9651 isl_seq_clr(bmap->eq[i], 1 + isl_basic_map_total_dim(bmap));
9652 pos1 += isl_basic_map_offset(bmap, type1);
9653 pos2 += isl_basic_map_offset(bmap, type2);
9654 isl_int_set_si(bmap->eq[i][pos1], -1);
9655 isl_int_set_si(bmap->eq[i][pos2], 1);
9656 bmap = isl_basic_map_finalize(bmap);
9658 map = isl_map_intersect(map, isl_map_from_basic_map(bmap));
9662 isl_basic_map_free(bmap);
9667 /* Add a constraint imposing that the given two dimensions have opposite values.
9669 __isl_give isl_map *isl_map_oppose(__isl_take isl_map *map,
9670 enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2)
9672 isl_basic_map *bmap = NULL;
9678 if (pos1 >= isl_map_dim(map, type1))
9679 isl_die(map->ctx, isl_error_invalid,
9680 "index out of bounds", goto error);
9681 if (pos2 >= isl_map_dim(map, type2))
9682 isl_die(map->ctx, isl_error_invalid,
9683 "index out of bounds", goto error);
9685 bmap = isl_basic_map_alloc_space(isl_map_get_space(map), 0, 1, 0);
9686 i = isl_basic_map_alloc_equality(bmap);
9689 isl_seq_clr(bmap->eq[i], 1 + isl_basic_map_total_dim(bmap));
9690 pos1 += isl_basic_map_offset(bmap, type1);
9691 pos2 += isl_basic_map_offset(bmap, type2);
9692 isl_int_set_si(bmap->eq[i][pos1], 1);
9693 isl_int_set_si(bmap->eq[i][pos2], 1);
9694 bmap = isl_basic_map_finalize(bmap);
9696 map = isl_map_intersect(map, isl_map_from_basic_map(bmap));
9700 isl_basic_map_free(bmap);
9705 __isl_give isl_aff *isl_basic_map_get_div(__isl_keep isl_basic_map *bmap,
9709 isl_local_space *ls;
9714 if (!isl_basic_map_divs_known(bmap))
9715 isl_die(isl_basic_map_get_ctx(bmap), isl_error_invalid,
9716 "some divs are unknown", return NULL);
9718 ls = isl_basic_map_get_local_space(bmap);
9719 div = isl_local_space_get_div(ls, pos);
9720 isl_local_space_free(ls);
9725 __isl_give isl_aff *isl_basic_set_get_div(__isl_keep isl_basic_set *bset,
9728 return isl_basic_map_get_div(bset, pos);