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_dim_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(struct isl_dim *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(struct isl_dim *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_dim_size(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 struct isl_dim *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_dim_total(bset->dim) + 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_dim_total(bmap->dim) + 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_dim_match(map->dim, isl_dim_param, set->dim, isl_dim_param);
185 return isl_dim_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_dim_match(bmap->dim, isl_dim_param, bset->dim, isl_dim_param);
197 return isl_dim_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_dim_match(map->dim, isl_dim_param, set->dim, isl_dim_param);
208 return isl_dim_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_dim_match(bmap->dim, isl_dim_param, bset->dim, isl_dim_param);
220 return isl_dim_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 struct isl_dim *isl_basic_map_get_dim(struct isl_basic_map *bmap)
247 return isl_dim_copy(bmap->dim);
250 struct isl_dim *isl_basic_set_get_dim(struct isl_basic_set *bset)
254 return isl_dim_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_dim_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_dim(isl_local_space_get_dim(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 struct isl_dim *isl_map_get_dim(struct isl_map *map)
326 return isl_dim_copy(map->dim);
329 struct isl_dim *isl_set_get_dim(struct isl_set *set)
333 return isl_dim_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_dim_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_dim_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_dim_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_dim_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_dim_set_tuple_id(map->dim, type, id);
410 return isl_map_reset_dim(map, isl_dim_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_dim_reset_tuple_id(map->dim, type);
428 return isl_map_reset_dim(map, isl_dim_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_dim_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_dim_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_dim_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_dim_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_dim_get_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_dim_get_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_dim_get_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_dim_get_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_dim_set_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_dim_set_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_dim_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_dim_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_dim_set_dim_id(map->dim, type, pos, id);
577 return isl_map_reset_dim(map, isl_dim_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_dim_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 static struct isl_basic_map *basic_map_init(struct isl_ctx *ctx,
613 struct isl_basic_map *bmap, unsigned extra,
614 unsigned n_eq, unsigned n_ineq)
617 size_t row_size = 1 + isl_dim_total(bmap->dim) + extra;
622 bmap->block = isl_blk_alloc(ctx, (n_ineq + n_eq) * row_size);
623 if (isl_blk_is_error(bmap->block))
626 bmap->ineq = isl_alloc_array(ctx, isl_int *, n_ineq + n_eq);
631 bmap->block2 = isl_blk_empty();
634 bmap->block2 = isl_blk_alloc(ctx, extra * (1 + row_size));
635 if (isl_blk_is_error(bmap->block2))
638 bmap->div = isl_alloc_array(ctx, isl_int *, extra);
643 for (i = 0; i < n_ineq + n_eq; ++i)
644 bmap->ineq[i] = bmap->block.data + i * row_size;
646 for (i = 0; i < extra; ++i)
647 bmap->div[i] = bmap->block2.data + i * (1 + row_size);
651 bmap->c_size = n_eq + n_ineq;
652 bmap->eq = bmap->ineq + n_ineq;
661 isl_basic_map_free(bmap);
665 struct isl_basic_set *isl_basic_set_alloc(struct isl_ctx *ctx,
666 unsigned nparam, unsigned dim, unsigned extra,
667 unsigned n_eq, unsigned n_ineq)
669 struct isl_basic_map *bmap;
670 bmap = isl_basic_map_alloc(ctx, nparam, 0, dim, extra, n_eq, n_ineq);
671 return (struct isl_basic_set *)bmap;
674 struct isl_basic_set *isl_basic_set_alloc_dim(struct isl_dim *dim,
675 unsigned extra, unsigned n_eq, unsigned n_ineq)
677 struct isl_basic_map *bmap;
680 isl_assert(dim->ctx, dim->n_in == 0, goto error);
681 bmap = isl_basic_map_alloc_dim(dim, extra, n_eq, n_ineq);
682 return (struct isl_basic_set *)bmap;
688 struct isl_basic_map *isl_basic_map_alloc_dim(struct isl_dim *dim,
689 unsigned extra, unsigned n_eq, unsigned n_ineq)
691 struct isl_basic_map *bmap;
695 bmap = isl_calloc_type(dim->ctx, struct isl_basic_map);
700 return basic_map_init(dim->ctx, bmap, extra, n_eq, n_ineq);
706 struct isl_basic_map *isl_basic_map_alloc(struct isl_ctx *ctx,
707 unsigned nparam, unsigned in, unsigned out, unsigned extra,
708 unsigned n_eq, unsigned n_ineq)
710 struct isl_basic_map *bmap;
713 dim = isl_dim_alloc(ctx, nparam, in, out);
717 bmap = isl_basic_map_alloc_dim(dim, extra, n_eq, n_ineq);
721 static void dup_constraints(
722 struct isl_basic_map *dst, struct isl_basic_map *src)
725 unsigned total = isl_basic_map_total_dim(src);
727 for (i = 0; i < src->n_eq; ++i) {
728 int j = isl_basic_map_alloc_equality(dst);
729 isl_seq_cpy(dst->eq[j], src->eq[i], 1+total);
732 for (i = 0; i < src->n_ineq; ++i) {
733 int j = isl_basic_map_alloc_inequality(dst);
734 isl_seq_cpy(dst->ineq[j], src->ineq[i], 1+total);
737 for (i = 0; i < src->n_div; ++i) {
738 int j = isl_basic_map_alloc_div(dst);
739 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total);
741 ISL_F_SET(dst, ISL_BASIC_SET_FINAL);
744 struct isl_basic_map *isl_basic_map_dup(struct isl_basic_map *bmap)
746 struct isl_basic_map *dup;
750 dup = isl_basic_map_alloc_dim(isl_dim_copy(bmap->dim),
751 bmap->n_div, bmap->n_eq, bmap->n_ineq);
754 dup_constraints(dup, bmap);
755 dup->flags = bmap->flags;
756 dup->sample = isl_vec_copy(bmap->sample);
760 struct isl_basic_set *isl_basic_set_dup(struct isl_basic_set *bset)
762 struct isl_basic_map *dup;
764 dup = isl_basic_map_dup((struct isl_basic_map *)bset);
765 return (struct isl_basic_set *)dup;
768 struct isl_basic_set *isl_basic_set_copy(struct isl_basic_set *bset)
773 if (ISL_F_ISSET(bset, ISL_BASIC_SET_FINAL)) {
777 return isl_basic_set_dup(bset);
780 struct isl_set *isl_set_copy(struct isl_set *set)
789 struct isl_basic_map *isl_basic_map_copy(struct isl_basic_map *bmap)
794 if (ISL_F_ISSET(bmap, ISL_BASIC_SET_FINAL)) {
798 bmap = isl_basic_map_dup(bmap);
800 ISL_F_SET(bmap, ISL_BASIC_SET_FINAL);
804 struct isl_map *isl_map_copy(struct isl_map *map)
813 void isl_basic_map_free(struct isl_basic_map *bmap)
821 isl_ctx_deref(bmap->ctx);
823 isl_blk_free(bmap->ctx, bmap->block2);
825 isl_blk_free(bmap->ctx, bmap->block);
826 isl_vec_free(bmap->sample);
827 isl_dim_free(bmap->dim);
831 void isl_basic_set_free(struct isl_basic_set *bset)
833 isl_basic_map_free((struct isl_basic_map *)bset);
836 static int room_for_con(struct isl_basic_map *bmap, unsigned n)
838 return bmap->n_eq + bmap->n_ineq + n <= bmap->c_size;
841 __isl_give isl_map *isl_map_align_params_map_map_and(
842 __isl_take isl_map *map1, __isl_take isl_map *map2,
843 __isl_give isl_map *(*fn)(__isl_take isl_map *map1,
844 __isl_take isl_map *map2))
848 if (isl_dim_match(map1->dim, isl_dim_param, map2->dim, isl_dim_param))
849 return fn(map1, map2);
850 if (!isl_dim_has_named_params(map1->dim) ||
851 !isl_dim_has_named_params(map2->dim))
852 isl_die(map1->ctx, isl_error_invalid,
853 "unaligned unnamed parameters", goto error);
854 map1 = isl_map_align_params(map1, isl_map_get_dim(map2));
855 map2 = isl_map_align_params(map2, isl_map_get_dim(map1));
856 return fn(map1, map2);
863 static int align_params_map_map_and_test(__isl_keep isl_map *map1,
864 __isl_keep isl_map *map2,
865 int (*fn)(__isl_keep isl_map *map1, __isl_keep isl_map *map2))
871 if (isl_dim_match(map1->dim, isl_dim_param, map2->dim, isl_dim_param))
872 return fn(map1, map2);
873 if (!isl_dim_has_named_params(map1->dim) ||
874 !isl_dim_has_named_params(map2->dim))
875 isl_die(map1->ctx, isl_error_invalid,
876 "unaligned unnamed parameters", return -1);
877 map1 = isl_map_copy(map1);
878 map2 = isl_map_copy(map2);
879 map1 = isl_map_align_params(map1, isl_map_get_dim(map2));
880 map2 = isl_map_align_params(map2, isl_map_get_dim(map1));
887 int isl_basic_map_alloc_equality(struct isl_basic_map *bmap)
893 isl_assert(ctx, room_for_con(bmap, 1), return -1);
894 isl_assert(ctx, (bmap->eq - bmap->ineq) + bmap->n_eq <= bmap->c_size,
896 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
897 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
898 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_IMPLICIT);
899 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
900 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
901 if ((bmap->eq - bmap->ineq) + bmap->n_eq == bmap->c_size) {
903 int j = isl_basic_map_alloc_inequality(bmap);
907 bmap->ineq[j] = bmap->ineq[bmap->n_ineq - 1];
908 bmap->ineq[bmap->n_ineq - 1] = bmap->eq[-1];
915 isl_seq_clr(bmap->eq[bmap->n_eq] + 1 + isl_basic_map_total_dim(bmap),
916 bmap->extra - bmap->n_div);
920 int isl_basic_set_alloc_equality(struct isl_basic_set *bset)
922 return isl_basic_map_alloc_equality((struct isl_basic_map *)bset);
925 int isl_basic_map_free_equality(struct isl_basic_map *bmap, unsigned n)
929 isl_assert(bmap->ctx, n <= bmap->n_eq, return -1);
934 int isl_basic_set_free_equality(struct isl_basic_set *bset, unsigned n)
936 return isl_basic_map_free_equality((struct isl_basic_map *)bset, n);
939 int isl_basic_map_drop_equality(struct isl_basic_map *bmap, unsigned pos)
944 isl_assert(bmap->ctx, pos < bmap->n_eq, return -1);
946 if (pos != bmap->n_eq - 1) {
948 bmap->eq[pos] = bmap->eq[bmap->n_eq - 1];
949 bmap->eq[bmap->n_eq - 1] = t;
955 int isl_basic_set_drop_equality(struct isl_basic_set *bset, unsigned pos)
957 return isl_basic_map_drop_equality((struct isl_basic_map *)bset, pos);
960 void isl_basic_map_inequality_to_equality(
961 struct isl_basic_map *bmap, unsigned pos)
966 bmap->ineq[pos] = bmap->ineq[bmap->n_ineq - 1];
967 bmap->ineq[bmap->n_ineq - 1] = bmap->eq[-1];
972 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
973 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
974 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
975 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
978 static int room_for_ineq(struct isl_basic_map *bmap, unsigned n)
980 return bmap->n_ineq + n <= bmap->eq - bmap->ineq;
983 int isl_basic_map_alloc_inequality(struct isl_basic_map *bmap)
989 isl_assert(ctx, room_for_ineq(bmap, 1), return -1);
990 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_IMPLICIT);
991 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
992 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
993 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
994 isl_seq_clr(bmap->ineq[bmap->n_ineq] +
995 1 + isl_basic_map_total_dim(bmap),
996 bmap->extra - bmap->n_div);
997 return bmap->n_ineq++;
1000 int isl_basic_set_alloc_inequality(struct isl_basic_set *bset)
1002 return isl_basic_map_alloc_inequality((struct isl_basic_map *)bset);
1005 int isl_basic_map_free_inequality(struct isl_basic_map *bmap, unsigned n)
1009 isl_assert(bmap->ctx, n <= bmap->n_ineq, return -1);
1014 int isl_basic_set_free_inequality(struct isl_basic_set *bset, unsigned n)
1016 return isl_basic_map_free_inequality((struct isl_basic_map *)bset, n);
1019 int isl_basic_map_drop_inequality(struct isl_basic_map *bmap, unsigned pos)
1024 isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
1026 if (pos != bmap->n_ineq - 1) {
1027 t = bmap->ineq[pos];
1028 bmap->ineq[pos] = bmap->ineq[bmap->n_ineq - 1];
1029 bmap->ineq[bmap->n_ineq - 1] = t;
1030 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1036 int isl_basic_set_drop_inequality(struct isl_basic_set *bset, unsigned pos)
1038 return isl_basic_map_drop_inequality((struct isl_basic_map *)bset, pos);
1041 __isl_give isl_basic_map *isl_basic_map_add_eq(__isl_take isl_basic_map *bmap,
1046 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
1049 k = isl_basic_map_alloc_equality(bmap);
1052 isl_seq_cpy(bmap->eq[k], eq, 1 + isl_basic_map_total_dim(bmap));
1055 isl_basic_map_free(bmap);
1059 __isl_give isl_basic_set *isl_basic_set_add_eq(__isl_take isl_basic_set *bset,
1062 return (isl_basic_set *)
1063 isl_basic_map_add_eq((isl_basic_map *)bset, eq);
1066 __isl_give isl_basic_map *isl_basic_map_add_ineq(__isl_take isl_basic_map *bmap,
1071 bmap = isl_basic_map_extend_constraints(bmap, 0, 1);
1074 k = isl_basic_map_alloc_inequality(bmap);
1077 isl_seq_cpy(bmap->ineq[k], ineq, 1 + isl_basic_map_total_dim(bmap));
1080 isl_basic_map_free(bmap);
1084 __isl_give isl_basic_set *isl_basic_set_add_ineq(__isl_take isl_basic_set *bset,
1087 return (isl_basic_set *)
1088 isl_basic_map_add_ineq((isl_basic_map *)bset, ineq);
1091 int isl_basic_map_alloc_div(struct isl_basic_map *bmap)
1095 isl_assert(bmap->ctx, bmap->n_div < bmap->extra, return -1);
1096 isl_seq_clr(bmap->div[bmap->n_div] +
1097 1 + 1 + isl_basic_map_total_dim(bmap),
1098 bmap->extra - bmap->n_div);
1099 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
1100 return bmap->n_div++;
1103 int isl_basic_set_alloc_div(struct isl_basic_set *bset)
1105 return isl_basic_map_alloc_div((struct isl_basic_map *)bset);
1108 int isl_basic_map_free_div(struct isl_basic_map *bmap, unsigned n)
1112 isl_assert(bmap->ctx, n <= bmap->n_div, return -1);
1117 int isl_basic_set_free_div(struct isl_basic_set *bset, unsigned n)
1119 return isl_basic_map_free_div((struct isl_basic_map *)bset, n);
1122 /* Copy constraint from src to dst, putting the vars of src at offset
1123 * dim_off in dst and the divs of src at offset div_off in dst.
1124 * If both sets are actually map, then dim_off applies to the input
1127 static void copy_constraint(struct isl_basic_map *dst_map, isl_int *dst,
1128 struct isl_basic_map *src_map, isl_int *src,
1129 unsigned in_off, unsigned out_off, unsigned div_off)
1131 unsigned src_nparam = isl_basic_map_n_param(src_map);
1132 unsigned dst_nparam = isl_basic_map_n_param(dst_map);
1133 unsigned src_in = isl_basic_map_n_in(src_map);
1134 unsigned dst_in = isl_basic_map_n_in(dst_map);
1135 unsigned src_out = isl_basic_map_n_out(src_map);
1136 unsigned dst_out = isl_basic_map_n_out(dst_map);
1137 isl_int_set(dst[0], src[0]);
1138 isl_seq_cpy(dst+1, src+1, isl_min(dst_nparam, src_nparam));
1139 if (dst_nparam > src_nparam)
1140 isl_seq_clr(dst+1+src_nparam,
1141 dst_nparam - src_nparam);
1142 isl_seq_clr(dst+1+dst_nparam, in_off);
1143 isl_seq_cpy(dst+1+dst_nparam+in_off,
1145 isl_min(dst_in-in_off, src_in));
1146 if (dst_in-in_off > src_in)
1147 isl_seq_clr(dst+1+dst_nparam+in_off+src_in,
1148 dst_in - in_off - src_in);
1149 isl_seq_clr(dst+1+dst_nparam+dst_in, out_off);
1150 isl_seq_cpy(dst+1+dst_nparam+dst_in+out_off,
1151 src+1+src_nparam+src_in,
1152 isl_min(dst_out-out_off, src_out));
1153 if (dst_out-out_off > src_out)
1154 isl_seq_clr(dst+1+dst_nparam+dst_in+out_off+src_out,
1155 dst_out - out_off - src_out);
1156 isl_seq_clr(dst+1+dst_nparam+dst_in+dst_out, div_off);
1157 isl_seq_cpy(dst+1+dst_nparam+dst_in+dst_out+div_off,
1158 src+1+src_nparam+src_in+src_out,
1159 isl_min(dst_map->extra-div_off, src_map->n_div));
1160 if (dst_map->n_div-div_off > src_map->n_div)
1161 isl_seq_clr(dst+1+dst_nparam+dst_in+dst_out+
1162 div_off+src_map->n_div,
1163 dst_map->n_div - div_off - src_map->n_div);
1166 static void copy_div(struct isl_basic_map *dst_map, isl_int *dst,
1167 struct isl_basic_map *src_map, isl_int *src,
1168 unsigned in_off, unsigned out_off, unsigned div_off)
1170 isl_int_set(dst[0], src[0]);
1171 copy_constraint(dst_map, dst+1, src_map, src+1, in_off, out_off, div_off);
1174 static struct isl_basic_map *add_constraints(struct isl_basic_map *bmap1,
1175 struct isl_basic_map *bmap2, unsigned i_pos, unsigned o_pos)
1180 if (!bmap1 || !bmap2)
1183 div_off = bmap1->n_div;
1185 for (i = 0; i < bmap2->n_eq; ++i) {
1186 int i1 = isl_basic_map_alloc_equality(bmap1);
1189 copy_constraint(bmap1, bmap1->eq[i1], bmap2, bmap2->eq[i],
1190 i_pos, o_pos, div_off);
1193 for (i = 0; i < bmap2->n_ineq; ++i) {
1194 int i1 = isl_basic_map_alloc_inequality(bmap1);
1197 copy_constraint(bmap1, bmap1->ineq[i1], bmap2, bmap2->ineq[i],
1198 i_pos, o_pos, div_off);
1201 for (i = 0; i < bmap2->n_div; ++i) {
1202 int i1 = isl_basic_map_alloc_div(bmap1);
1205 copy_div(bmap1, bmap1->div[i1], bmap2, bmap2->div[i],
1206 i_pos, o_pos, div_off);
1209 isl_basic_map_free(bmap2);
1214 isl_basic_map_free(bmap1);
1215 isl_basic_map_free(bmap2);
1219 struct isl_basic_set *isl_basic_set_add_constraints(struct isl_basic_set *bset1,
1220 struct isl_basic_set *bset2, unsigned pos)
1222 return (struct isl_basic_set *)
1223 add_constraints((struct isl_basic_map *)bset1,
1224 (struct isl_basic_map *)bset2, 0, pos);
1227 struct isl_basic_map *isl_basic_map_extend_dim(struct isl_basic_map *base,
1228 struct isl_dim *dim, unsigned extra,
1229 unsigned n_eq, unsigned n_ineq)
1231 struct isl_basic_map *ext;
1241 dims_ok = isl_dim_equal(base->dim, dim) &&
1242 base->extra >= base->n_div + extra;
1244 if (dims_ok && room_for_con(base, n_eq + n_ineq) &&
1245 room_for_ineq(base, n_ineq)) {
1250 isl_assert(base->ctx, base->dim->nparam <= dim->nparam, goto error);
1251 isl_assert(base->ctx, base->dim->n_in <= dim->n_in, goto error);
1252 isl_assert(base->ctx, base->dim->n_out <= dim->n_out, goto error);
1253 extra += base->extra;
1255 n_ineq += base->n_ineq;
1257 ext = isl_basic_map_alloc_dim(dim, extra, n_eq, n_ineq);
1263 ext->sample = isl_vec_copy(base->sample);
1264 flags = base->flags;
1265 ext = add_constraints(ext, base, 0, 0);
1268 ISL_F_CLR(ext, ISL_BASIC_SET_FINAL);
1275 isl_basic_map_free(base);
1279 struct isl_basic_set *isl_basic_set_extend_dim(struct isl_basic_set *base,
1280 struct isl_dim *dim, unsigned extra,
1281 unsigned n_eq, unsigned n_ineq)
1283 return (struct isl_basic_set *)
1284 isl_basic_map_extend_dim((struct isl_basic_map *)base, dim,
1285 extra, n_eq, n_ineq);
1288 struct isl_basic_map *isl_basic_map_extend_constraints(
1289 struct isl_basic_map *base, unsigned n_eq, unsigned n_ineq)
1293 return isl_basic_map_extend_dim(base, isl_dim_copy(base->dim),
1297 struct isl_basic_map *isl_basic_map_extend(struct isl_basic_map *base,
1298 unsigned nparam, unsigned n_in, unsigned n_out, unsigned extra,
1299 unsigned n_eq, unsigned n_ineq)
1301 struct isl_basic_map *bmap;
1302 struct isl_dim *dim;
1306 dim = isl_dim_alloc(base->ctx, nparam, n_in, n_out);
1310 bmap = isl_basic_map_extend_dim(base, dim, extra, n_eq, n_ineq);
1313 isl_basic_map_free(base);
1317 struct isl_basic_set *isl_basic_set_extend(struct isl_basic_set *base,
1318 unsigned nparam, unsigned dim, unsigned extra,
1319 unsigned n_eq, unsigned n_ineq)
1321 return (struct isl_basic_set *)
1322 isl_basic_map_extend((struct isl_basic_map *)base,
1323 nparam, 0, dim, extra, n_eq, n_ineq);
1326 struct isl_basic_set *isl_basic_set_extend_constraints(
1327 struct isl_basic_set *base, unsigned n_eq, unsigned n_ineq)
1329 return (struct isl_basic_set *)
1330 isl_basic_map_extend_constraints((struct isl_basic_map *)base,
1334 struct isl_basic_set *isl_basic_set_cow(struct isl_basic_set *bset)
1336 return (struct isl_basic_set *)
1337 isl_basic_map_cow((struct isl_basic_map *)bset);
1340 struct isl_basic_map *isl_basic_map_cow(struct isl_basic_map *bmap)
1345 if (bmap->ref > 1) {
1347 bmap = isl_basic_map_dup(bmap);
1350 ISL_F_CLR(bmap, ISL_BASIC_SET_FINAL);
1354 struct isl_set *isl_set_cow(struct isl_set *set)
1362 return isl_set_dup(set);
1365 struct isl_map *isl_map_cow(struct isl_map *map)
1373 return isl_map_dup(map);
1376 static void swap_vars(struct isl_blk blk, isl_int *a,
1377 unsigned a_len, unsigned b_len)
1379 isl_seq_cpy(blk.data, a+a_len, b_len);
1380 isl_seq_cpy(blk.data+b_len, a, a_len);
1381 isl_seq_cpy(a, blk.data, b_len+a_len);
1384 static __isl_give isl_basic_map *isl_basic_map_swap_vars(
1385 __isl_take isl_basic_map *bmap, unsigned pos, unsigned n1, unsigned n2)
1393 isl_assert(bmap->ctx,
1394 pos + n1 + n2 <= 1 + isl_basic_map_total_dim(bmap), goto error);
1396 if (n1 == 0 || n2 == 0)
1399 bmap = isl_basic_map_cow(bmap);
1403 blk = isl_blk_alloc(bmap->ctx, n1 + n2);
1404 if (isl_blk_is_error(blk))
1407 for (i = 0; i < bmap->n_eq; ++i)
1409 bmap->eq[i] + pos, n1, n2);
1411 for (i = 0; i < bmap->n_ineq; ++i)
1413 bmap->ineq[i] + pos, n1, n2);
1415 for (i = 0; i < bmap->n_div; ++i)
1417 bmap->div[i]+1 + pos, n1, n2);
1419 isl_blk_free(bmap->ctx, blk);
1421 ISL_F_CLR(bmap, ISL_BASIC_SET_NORMALIZED);
1422 bmap = isl_basic_map_gauss(bmap, NULL);
1423 return isl_basic_map_finalize(bmap);
1425 isl_basic_map_free(bmap);
1429 static __isl_give isl_basic_set *isl_basic_set_swap_vars(
1430 __isl_take isl_basic_set *bset, unsigned n)
1435 nparam = isl_basic_set_n_param(bset);
1436 dim = isl_basic_set_n_dim(bset);
1437 isl_assert(bset->ctx, n <= dim, goto error);
1439 return isl_basic_map_swap_vars(bset, 1 + nparam, n, dim - n);
1441 isl_basic_set_free(bset);
1445 struct isl_basic_map *isl_basic_map_set_to_empty(struct isl_basic_map *bmap)
1451 total = isl_basic_map_total_dim(bmap);
1452 isl_basic_map_free_div(bmap, bmap->n_div);
1453 isl_basic_map_free_inequality(bmap, bmap->n_ineq);
1455 isl_basic_map_free_equality(bmap, bmap->n_eq-1);
1457 i = isl_basic_map_alloc_equality(bmap);
1461 isl_int_set_si(bmap->eq[i][0], 1);
1462 isl_seq_clr(bmap->eq[i]+1, total);
1463 ISL_F_SET(bmap, ISL_BASIC_MAP_EMPTY);
1464 isl_vec_free(bmap->sample);
1465 bmap->sample = NULL;
1466 return isl_basic_map_finalize(bmap);
1468 isl_basic_map_free(bmap);
1472 struct isl_basic_set *isl_basic_set_set_to_empty(struct isl_basic_set *bset)
1474 return (struct isl_basic_set *)
1475 isl_basic_map_set_to_empty((struct isl_basic_map *)bset);
1478 void isl_basic_map_swap_div(struct isl_basic_map *bmap, int a, int b)
1481 unsigned off = isl_dim_total(bmap->dim);
1482 isl_int *t = bmap->div[a];
1483 bmap->div[a] = bmap->div[b];
1486 for (i = 0; i < bmap->n_eq; ++i)
1487 isl_int_swap(bmap->eq[i][1+off+a], bmap->eq[i][1+off+b]);
1489 for (i = 0; i < bmap->n_ineq; ++i)
1490 isl_int_swap(bmap->ineq[i][1+off+a], bmap->ineq[i][1+off+b]);
1492 for (i = 0; i < bmap->n_div; ++i)
1493 isl_int_swap(bmap->div[i][1+1+off+a], bmap->div[i][1+1+off+b]);
1494 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1497 /* Eliminate the specified n dimensions starting at first from the
1498 * constraints using Fourier-Motzkin. The dimensions themselves
1501 __isl_give isl_map *isl_map_eliminate(__isl_take isl_map *map,
1502 enum isl_dim_type type, unsigned first, unsigned n)
1511 map = isl_map_cow(map);
1514 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
1515 first += pos(map->dim, type) - 1;
1517 for (i = 0; i < map->n; ++i) {
1518 map->p[i] = isl_basic_map_eliminate_vars(map->p[i], first, n);
1528 /* Eliminate the specified n dimensions starting at first from the
1529 * constraints using Fourier-Motzkin. The dimensions themselves
1532 __isl_give isl_set *isl_set_eliminate(__isl_take isl_set *set,
1533 enum isl_dim_type type, unsigned first, unsigned n)
1535 return (isl_set *)isl_map_eliminate((isl_map *)set, type, first, n);
1538 /* Eliminate the specified n dimensions starting at first from the
1539 * constraints using Fourier-Motzkin. The dimensions themselves
1542 __isl_give isl_set *isl_set_eliminate_dims(__isl_take isl_set *set,
1543 unsigned first, unsigned n)
1545 return isl_set_eliminate(set, isl_dim_set, first, n);
1548 __isl_give isl_basic_map *isl_basic_map_remove_divs(
1549 __isl_take isl_basic_map *bmap)
1553 bmap = isl_basic_map_eliminate_vars(bmap, isl_dim_total(bmap->dim),
1558 return isl_basic_map_finalize(bmap);
1561 __isl_give isl_basic_set *isl_basic_set_remove_divs(
1562 __isl_take isl_basic_set *bset)
1564 return (struct isl_basic_set *)isl_basic_map_remove_divs(
1565 (struct isl_basic_map *)bset);
1568 __isl_give isl_map *isl_map_remove_divs(__isl_take isl_map *map)
1577 map = isl_map_cow(map);
1581 for (i = 0; i < map->n; ++i) {
1582 map->p[i] = isl_basic_map_remove_divs(map->p[i]);
1592 __isl_give isl_set *isl_set_remove_divs(__isl_take isl_set *set)
1594 return isl_map_remove_divs(set);
1597 struct isl_basic_map *isl_basic_map_remove_dims(struct isl_basic_map *bmap,
1598 enum isl_dim_type type, unsigned first, unsigned n)
1602 isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
1604 if (n == 0 && !isl_dim_is_named_or_nested(bmap->dim, type))
1606 bmap = isl_basic_map_eliminate_vars(bmap,
1607 isl_basic_map_offset(bmap, type) - 1 + first, n);
1610 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY) && type == isl_dim_div)
1612 bmap = isl_basic_map_drop(bmap, type, first, n);
1615 isl_basic_map_free(bmap);
1619 /* Return true if the definition of the given div (recursively) involves
1620 * any of the given variables.
1622 static int div_involves_vars(__isl_keep isl_basic_map *bmap, int div,
1623 unsigned first, unsigned n)
1626 unsigned div_offset = isl_basic_map_offset(bmap, isl_dim_div);
1628 if (isl_int_is_zero(bmap->div[div][0]))
1630 if (isl_seq_first_non_zero(bmap->div[div] + 1 + first, n) >= 0)
1633 for (i = bmap->n_div - 1; i >= 0; --i) {
1634 if (isl_int_is_zero(bmap->div[div][1 + div_offset + i]))
1636 if (div_involves_vars(bmap, i, first, n))
1643 /* Remove all divs (recursively) involving any of the given dimensions
1644 * in their definitions.
1646 __isl_give isl_basic_map *isl_basic_map_remove_divs_involving_dims(
1647 __isl_take isl_basic_map *bmap,
1648 enum isl_dim_type type, unsigned first, unsigned n)
1654 isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
1656 first += isl_basic_map_offset(bmap, type);
1658 for (i = bmap->n_div - 1; i >= 0; --i) {
1659 if (!div_involves_vars(bmap, i, first, n))
1661 bmap = isl_basic_map_remove_dims(bmap, isl_dim_div, i, 1);
1669 isl_basic_map_free(bmap);
1673 __isl_give isl_map *isl_map_remove_divs_involving_dims(__isl_take isl_map *map,
1674 enum isl_dim_type type, unsigned first, unsigned n)
1683 map = isl_map_cow(map);
1687 for (i = 0; i < map->n; ++i) {
1688 map->p[i] = isl_basic_map_remove_divs_involving_dims(map->p[i],
1699 __isl_give isl_set *isl_set_remove_divs_involving_dims(__isl_take isl_set *set,
1700 enum isl_dim_type type, unsigned first, unsigned n)
1702 return (isl_set *)isl_map_remove_divs_involving_dims((isl_map *)set,
1706 int isl_basic_map_involves_dims(__isl_keep isl_basic_map *bmap,
1707 enum isl_dim_type type, unsigned first, unsigned n)
1714 if (first + n > isl_basic_map_dim(bmap, type))
1715 isl_die(bmap->ctx, isl_error_invalid,
1716 "index out of bounds", return -1);
1718 first += isl_basic_map_offset(bmap, type);
1719 for (i = 0; i < bmap->n_eq; ++i)
1720 if (isl_seq_first_non_zero(bmap->eq[i] + first, n) >= 0)
1722 for (i = 0; i < bmap->n_ineq; ++i)
1723 if (isl_seq_first_non_zero(bmap->ineq[i] + first, n) >= 0)
1729 int isl_map_involves_dims(__isl_keep isl_map *map,
1730 enum isl_dim_type type, unsigned first, unsigned n)
1737 if (first + n > isl_map_dim(map, type))
1738 isl_die(map->ctx, isl_error_invalid,
1739 "index out of bounds", return -1);
1741 for (i = 0; i < map->n; ++i) {
1742 int involves = isl_basic_map_involves_dims(map->p[i],
1744 if (involves < 0 || !involves)
1751 int isl_basic_set_involves_dims(__isl_keep isl_basic_set *bset,
1752 enum isl_dim_type type, unsigned first, unsigned n)
1754 return isl_basic_map_involves_dims(bset, type, first, n);
1757 int isl_set_involves_dims(__isl_keep isl_set *set,
1758 enum isl_dim_type type, unsigned first, unsigned n)
1760 return isl_map_involves_dims(set, type, first, n);
1763 /* Return true if the definition of the given div is unknown or depends
1766 static int div_is_unknown(__isl_keep isl_basic_map *bmap, int div)
1769 unsigned div_offset = isl_basic_map_offset(bmap, isl_dim_div);
1771 if (isl_int_is_zero(bmap->div[div][0]))
1774 for (i = bmap->n_div - 1; i >= 0; --i) {
1775 if (isl_int_is_zero(bmap->div[div][1 + div_offset + i]))
1777 if (div_is_unknown(bmap, i))
1784 /* Remove all divs that are unknown or defined in terms of unknown divs.
1786 __isl_give isl_basic_map *isl_basic_map_remove_unknown_divs(
1787 __isl_take isl_basic_map *bmap)
1794 for (i = bmap->n_div - 1; i >= 0; --i) {
1795 if (!div_is_unknown(bmap, i))
1797 bmap = isl_basic_map_remove_dims(bmap, isl_dim_div, i, 1);
1803 __isl_give isl_map *isl_map_remove_unknown_divs(__isl_take isl_map *map)
1812 map = isl_map_cow(map);
1816 for (i = 0; i < map->n; ++i) {
1817 map->p[i] = isl_basic_map_remove_unknown_divs(map->p[i]);
1827 __isl_give isl_set *isl_set_remove_unknown_divs(__isl_take isl_set *set)
1829 return (isl_set *)isl_map_remove_unknown_divs((isl_map *)set);
1832 __isl_give isl_basic_set *isl_basic_set_remove_dims(
1833 __isl_take isl_basic_set *bset,
1834 enum isl_dim_type type, unsigned first, unsigned n)
1836 return (isl_basic_set *)
1837 isl_basic_map_remove_dims((isl_basic_map *)bset, type, first, n);
1840 struct isl_map *isl_map_remove_dims(struct isl_map *map,
1841 enum isl_dim_type type, unsigned first, unsigned n)
1848 map = isl_map_cow(map);
1851 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
1853 for (i = 0; i < map->n; ++i) {
1854 map->p[i] = isl_basic_map_eliminate_vars(map->p[i],
1855 isl_basic_map_offset(map->p[i], type) - 1 + first, n);
1859 map = isl_map_drop(map, type, first, n);
1866 __isl_give isl_set *isl_set_remove_dims(__isl_take isl_set *bset,
1867 enum isl_dim_type type, unsigned first, unsigned n)
1869 return (isl_set *)isl_map_remove_dims((isl_map *)bset, type, first, n);
1872 /* Project out n inputs starting at first using Fourier-Motzkin */
1873 struct isl_map *isl_map_remove_inputs(struct isl_map *map,
1874 unsigned first, unsigned n)
1876 return isl_map_remove_dims(map, isl_dim_in, first, n);
1879 static void dump_term(struct isl_basic_map *bmap,
1880 isl_int c, int pos, FILE *out)
1883 unsigned in = isl_basic_map_n_in(bmap);
1884 unsigned dim = in + isl_basic_map_n_out(bmap);
1885 unsigned nparam = isl_basic_map_n_param(bmap);
1887 isl_int_print(out, c, 0);
1889 if (!isl_int_is_one(c))
1890 isl_int_print(out, c, 0);
1891 if (pos < 1 + nparam) {
1892 name = isl_dim_get_name(bmap->dim,
1893 isl_dim_param, pos - 1);
1895 fprintf(out, "%s", name);
1897 fprintf(out, "p%d", pos - 1);
1898 } else if (pos < 1 + nparam + in)
1899 fprintf(out, "i%d", pos - 1 - nparam);
1900 else if (pos < 1 + nparam + dim)
1901 fprintf(out, "o%d", pos - 1 - nparam - in);
1903 fprintf(out, "e%d", pos - 1 - nparam - dim);
1907 static void dump_constraint_sign(struct isl_basic_map *bmap, isl_int *c,
1908 int sign, FILE *out)
1912 unsigned len = 1 + isl_basic_map_total_dim(bmap);
1916 for (i = 0, first = 1; i < len; ++i) {
1917 if (isl_int_sgn(c[i]) * sign <= 0)
1920 fprintf(out, " + ");
1922 isl_int_abs(v, c[i]);
1923 dump_term(bmap, v, i, out);
1930 static void dump_constraint(struct isl_basic_map *bmap, isl_int *c,
1931 const char *op, FILE *out, int indent)
1935 fprintf(out, "%*s", indent, "");
1937 dump_constraint_sign(bmap, c, 1, out);
1938 fprintf(out, " %s ", op);
1939 dump_constraint_sign(bmap, c, -1, out);
1943 for (i = bmap->n_div; i < bmap->extra; ++i) {
1944 if (isl_int_is_zero(c[1+isl_dim_total(bmap->dim)+i]))
1946 fprintf(out, "%*s", indent, "");
1947 fprintf(out, "ERROR: unused div coefficient not zero\n");
1952 static void dump_constraints(struct isl_basic_map *bmap,
1953 isl_int **c, unsigned n,
1954 const char *op, FILE *out, int indent)
1958 for (i = 0; i < n; ++i)
1959 dump_constraint(bmap, c[i], op, out, indent);
1962 static void dump_affine(struct isl_basic_map *bmap, isl_int *exp, FILE *out)
1966 unsigned total = isl_basic_map_total_dim(bmap);
1968 for (j = 0; j < 1 + total; ++j) {
1969 if (isl_int_is_zero(exp[j]))
1971 if (!first && isl_int_is_pos(exp[j]))
1973 dump_term(bmap, exp[j], j, out);
1978 static void dump(struct isl_basic_map *bmap, FILE *out, int indent)
1982 dump_constraints(bmap, bmap->eq, bmap->n_eq, "=", out, indent);
1983 dump_constraints(bmap, bmap->ineq, bmap->n_ineq, ">=", out, indent);
1985 for (i = 0; i < bmap->n_div; ++i) {
1986 fprintf(out, "%*s", indent, "");
1987 fprintf(out, "e%d = [(", i);
1988 dump_affine(bmap, bmap->div[i]+1, out);
1990 isl_int_print(out, bmap->div[i][0], 0);
1991 fprintf(out, "]\n");
1995 void isl_basic_set_print_internal(struct isl_basic_set *bset,
1996 FILE *out, int indent)
1999 fprintf(out, "null basic set\n");
2003 fprintf(out, "%*s", indent, "");
2004 fprintf(out, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n",
2005 bset->ref, bset->dim->nparam, bset->dim->n_out,
2006 bset->extra, bset->flags);
2007 dump((struct isl_basic_map *)bset, out, indent);
2010 void isl_basic_map_print_internal(struct isl_basic_map *bmap,
2011 FILE *out, int indent)
2014 fprintf(out, "null basic map\n");
2018 fprintf(out, "%*s", indent, "");
2019 fprintf(out, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, "
2020 "flags: %x, n_name: %d\n",
2022 bmap->dim->nparam, bmap->dim->n_in, bmap->dim->n_out,
2023 bmap->extra, bmap->flags, bmap->dim->n_id);
2024 dump(bmap, out, indent);
2027 int isl_inequality_negate(struct isl_basic_map *bmap, unsigned pos)
2032 total = isl_basic_map_total_dim(bmap);
2033 isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
2034 isl_seq_neg(bmap->ineq[pos], bmap->ineq[pos], 1 + total);
2035 isl_int_sub_ui(bmap->ineq[pos][0], bmap->ineq[pos][0], 1);
2036 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
2040 struct isl_set *isl_set_alloc_dim(struct isl_dim *dim, int n, unsigned flags)
2042 struct isl_set *set;
2046 isl_assert(dim->ctx, dim->n_in == 0, goto error);
2047 isl_assert(dim->ctx, n >= 0, goto error);
2048 set = isl_alloc(dim->ctx, struct isl_set,
2049 sizeof(struct isl_set) +
2050 (n - 1) * sizeof(struct isl_basic_set *));
2054 set->ctx = dim->ctx;
2055 isl_ctx_ref(set->ctx);
2067 struct isl_set *isl_set_alloc(struct isl_ctx *ctx,
2068 unsigned nparam, unsigned dim, int n, unsigned flags)
2070 struct isl_set *set;
2071 struct isl_dim *dims;
2073 dims = isl_dim_alloc(ctx, nparam, 0, dim);
2077 set = isl_set_alloc_dim(dims, n, flags);
2081 /* Make sure "map" has room for at least "n" more basic maps.
2083 struct isl_map *isl_map_grow(struct isl_map *map, int n)
2086 struct isl_map *grown = NULL;
2090 isl_assert(map->ctx, n >= 0, goto error);
2091 if (map->n + n <= map->size)
2093 grown = isl_map_alloc_dim(isl_map_get_dim(map), map->n + n, map->flags);
2096 for (i = 0; i < map->n; ++i) {
2097 grown->p[i] = isl_basic_map_copy(map->p[i]);
2105 isl_map_free(grown);
2110 /* Make sure "set" has room for at least "n" more basic sets.
2112 struct isl_set *isl_set_grow(struct isl_set *set, int n)
2114 return (struct isl_set *)isl_map_grow((struct isl_map *)set, n);
2117 struct isl_set *isl_set_dup(struct isl_set *set)
2120 struct isl_set *dup;
2125 dup = isl_set_alloc_dim(isl_dim_copy(set->dim), set->n, set->flags);
2128 for (i = 0; i < set->n; ++i)
2129 dup = isl_set_add_basic_set(dup, isl_basic_set_copy(set->p[i]));
2133 struct isl_set *isl_set_from_basic_set(struct isl_basic_set *bset)
2135 return isl_map_from_basic_map(bset);
2138 struct isl_map *isl_map_from_basic_map(struct isl_basic_map *bmap)
2140 struct isl_map *map;
2145 map = isl_map_alloc_dim(isl_dim_copy(bmap->dim), 1, ISL_MAP_DISJOINT);
2146 return isl_map_add_basic_map(map, bmap);
2149 __isl_give isl_set *isl_set_add_basic_set(__isl_take isl_set *set,
2150 __isl_take isl_basic_set *bset)
2152 return (struct isl_set *)isl_map_add_basic_map((struct isl_map *)set,
2153 (struct isl_basic_map *)bset);
2156 void isl_set_free(struct isl_set *set)
2166 isl_ctx_deref(set->ctx);
2167 for (i = 0; i < set->n; ++i)
2168 isl_basic_set_free(set->p[i]);
2169 isl_dim_free(set->dim);
2173 void isl_set_print_internal(struct isl_set *set, FILE *out, int indent)
2178 fprintf(out, "null set\n");
2182 fprintf(out, "%*s", indent, "");
2183 fprintf(out, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
2184 set->ref, set->n, set->dim->nparam, set->dim->n_out,
2186 for (i = 0; i < set->n; ++i) {
2187 fprintf(out, "%*s", indent, "");
2188 fprintf(out, "basic set %d:\n", i);
2189 isl_basic_set_print_internal(set->p[i], out, indent+4);
2193 void isl_map_print_internal(struct isl_map *map, FILE *out, int indent)
2198 fprintf(out, "null map\n");
2202 fprintf(out, "%*s", indent, "");
2203 fprintf(out, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, "
2204 "flags: %x, n_name: %d\n",
2205 map->ref, map->n, map->dim->nparam, map->dim->n_in,
2206 map->dim->n_out, map->flags, map->dim->n_id);
2207 for (i = 0; i < map->n; ++i) {
2208 fprintf(out, "%*s", indent, "");
2209 fprintf(out, "basic map %d:\n", i);
2210 isl_basic_map_print_internal(map->p[i], out, indent+4);
2214 struct isl_basic_map *isl_basic_map_intersect_domain(
2215 struct isl_basic_map *bmap, struct isl_basic_set *bset)
2217 struct isl_basic_map *bmap_domain;
2222 isl_assert(bset->ctx, isl_dim_match(bmap->dim, isl_dim_param,
2223 bset->dim, isl_dim_param), goto error);
2225 if (isl_dim_size(bset->dim, isl_dim_set) != 0)
2226 isl_assert(bset->ctx,
2227 isl_basic_map_compatible_domain(bmap, bset), goto error);
2229 bmap = isl_basic_map_cow(bmap);
2232 bmap = isl_basic_map_extend_dim(bmap, isl_dim_copy(bmap->dim),
2233 bset->n_div, bset->n_eq, bset->n_ineq);
2234 bmap_domain = isl_basic_map_from_domain(bset);
2235 bmap = add_constraints(bmap, bmap_domain, 0, 0);
2237 bmap = isl_basic_map_simplify(bmap);
2238 return isl_basic_map_finalize(bmap);
2240 isl_basic_map_free(bmap);
2241 isl_basic_set_free(bset);
2245 struct isl_basic_map *isl_basic_map_intersect_range(
2246 struct isl_basic_map *bmap, struct isl_basic_set *bset)
2248 struct isl_basic_map *bmap_range;
2253 isl_assert(bset->ctx, isl_dim_match(bmap->dim, isl_dim_param,
2254 bset->dim, isl_dim_param), goto error);
2256 if (isl_dim_size(bset->dim, isl_dim_set) != 0)
2257 isl_assert(bset->ctx,
2258 isl_basic_map_compatible_range(bmap, bset), goto error);
2260 if (isl_basic_set_is_universe(bset)) {
2261 isl_basic_set_free(bset);
2265 bmap = isl_basic_map_cow(bmap);
2268 bmap = isl_basic_map_extend_dim(bmap, isl_dim_copy(bmap->dim),
2269 bset->n_div, bset->n_eq, bset->n_ineq);
2270 bmap_range = isl_basic_map_from_basic_set(bset, isl_dim_copy(bset->dim));
2271 bmap = add_constraints(bmap, bmap_range, 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 int isl_basic_map_contains(struct isl_basic_map *bmap, struct isl_vec *vec)
2287 total = 1 + isl_basic_map_total_dim(bmap);
2288 if (total != vec->size)
2293 for (i = 0; i < bmap->n_eq; ++i) {
2294 isl_seq_inner_product(vec->el, bmap->eq[i], total, &s);
2295 if (!isl_int_is_zero(s)) {
2301 for (i = 0; i < bmap->n_ineq; ++i) {
2302 isl_seq_inner_product(vec->el, bmap->ineq[i], total, &s);
2303 if (isl_int_is_neg(s)) {
2314 int isl_basic_set_contains(struct isl_basic_set *bset, struct isl_vec *vec)
2316 return isl_basic_map_contains((struct isl_basic_map *)bset, vec);
2319 struct isl_basic_map *isl_basic_map_intersect(
2320 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2322 struct isl_vec *sample = NULL;
2324 if (!bmap1 || !bmap2)
2327 isl_assert(bmap1->ctx, isl_dim_match(bmap1->dim, isl_dim_param,
2328 bmap2->dim, isl_dim_param), goto error);
2329 if (isl_dim_total(bmap1->dim) ==
2330 isl_dim_size(bmap1->dim, isl_dim_param) &&
2331 isl_dim_total(bmap2->dim) !=
2332 isl_dim_size(bmap2->dim, isl_dim_param))
2333 return isl_basic_map_intersect(bmap2, bmap1);
2335 if (isl_dim_total(bmap2->dim) !=
2336 isl_dim_size(bmap2->dim, isl_dim_param))
2337 isl_assert(bmap1->ctx,
2338 isl_dim_equal(bmap1->dim, bmap2->dim), goto error);
2340 if (bmap1->sample &&
2341 isl_basic_map_contains(bmap1, bmap1->sample) > 0 &&
2342 isl_basic_map_contains(bmap2, bmap1->sample) > 0)
2343 sample = isl_vec_copy(bmap1->sample);
2344 else if (bmap2->sample &&
2345 isl_basic_map_contains(bmap1, bmap2->sample) > 0 &&
2346 isl_basic_map_contains(bmap2, bmap2->sample) > 0)
2347 sample = isl_vec_copy(bmap2->sample);
2349 bmap1 = isl_basic_map_cow(bmap1);
2352 bmap1 = isl_basic_map_extend_dim(bmap1, isl_dim_copy(bmap1->dim),
2353 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
2354 bmap1 = add_constraints(bmap1, bmap2, 0, 0);
2357 isl_vec_free(sample);
2359 isl_vec_free(bmap1->sample);
2360 bmap1->sample = sample;
2363 bmap1 = isl_basic_map_simplify(bmap1);
2364 return isl_basic_map_finalize(bmap1);
2367 isl_vec_free(sample);
2368 isl_basic_map_free(bmap1);
2369 isl_basic_map_free(bmap2);
2373 struct isl_basic_set *isl_basic_set_intersect(
2374 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
2376 return (struct isl_basic_set *)
2377 isl_basic_map_intersect(
2378 (struct isl_basic_map *)bset1,
2379 (struct isl_basic_map *)bset2);
2382 /* Special case of isl_map_intersect, where both map1 and map2
2383 * are convex, without any divs and such that either map1 or map2
2384 * contains a single constraint. This constraint is then simply
2385 * added to the other map.
2387 static __isl_give isl_map *map_intersect_add_constraint(
2388 __isl_take isl_map *map1, __isl_take isl_map *map2)
2390 isl_assert(map1->ctx, map1->n == 1, goto error);
2391 isl_assert(map2->ctx, map1->n == 1, goto error);
2392 isl_assert(map1->ctx, map1->p[0]->n_div == 0, goto error);
2393 isl_assert(map2->ctx, map1->p[0]->n_div == 0, goto error);
2395 if (map2->p[0]->n_eq + map2->p[0]->n_ineq != 1)
2396 return isl_map_intersect(map2, map1);
2398 isl_assert(map2->ctx,
2399 map2->p[0]->n_eq + map2->p[0]->n_ineq == 1, goto error);
2401 map1 = isl_map_cow(map1);
2404 if (isl_map_plain_is_empty(map1)) {
2408 map1->p[0] = isl_basic_map_cow(map1->p[0]);
2409 if (map2->p[0]->n_eq == 1)
2410 map1->p[0] = isl_basic_map_add_eq(map1->p[0], map2->p[0]->eq[0]);
2412 map1->p[0] = isl_basic_map_add_ineq(map1->p[0],
2413 map2->p[0]->ineq[0]);
2415 map1->p[0] = isl_basic_map_simplify(map1->p[0]);
2416 map1->p[0] = isl_basic_map_finalize(map1->p[0]);
2420 if (isl_basic_map_plain_is_empty(map1->p[0])) {
2421 isl_basic_map_free(map1->p[0]);
2434 static __isl_give isl_map *map_intersect(__isl_take isl_map *map1,
2435 __isl_take isl_map *map2)
2438 struct isl_map *result;
2444 if (isl_map_plain_is_empty(map1) &&
2445 isl_dim_equal(map1->dim, map2->dim)) {
2449 if (isl_map_plain_is_empty(map2) &&
2450 isl_dim_equal(map1->dim, map2->dim)) {
2455 if (map1->n == 1 && map2->n == 1 &&
2456 map1->p[0]->n_div == 0 && map2->p[0]->n_div == 0 &&
2457 isl_dim_equal(map1->dim, map2->dim) &&
2458 (map1->p[0]->n_eq + map1->p[0]->n_ineq == 1 ||
2459 map2->p[0]->n_eq + map2->p[0]->n_ineq == 1))
2460 return map_intersect_add_constraint(map1, map2);
2461 if (isl_dim_total(map1->dim) ==
2462 isl_dim_size(map1->dim, isl_dim_param) &&
2463 isl_dim_total(map2->dim) != isl_dim_size(map2->dim, isl_dim_param))
2464 return isl_map_intersect(map2, map1);
2466 if (isl_dim_total(map2->dim) != isl_dim_size(map2->dim, isl_dim_param))
2467 isl_assert(map1->ctx,
2468 isl_dim_equal(map1->dim, map2->dim), goto error);
2470 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
2471 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
2472 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
2474 result = isl_map_alloc_dim(isl_dim_copy(map1->dim),
2475 map1->n * map2->n, flags);
2478 for (i = 0; i < map1->n; ++i)
2479 for (j = 0; j < map2->n; ++j) {
2480 struct isl_basic_map *part;
2481 part = isl_basic_map_intersect(
2482 isl_basic_map_copy(map1->p[i]),
2483 isl_basic_map_copy(map2->p[j]));
2484 if (isl_basic_map_is_empty(part))
2485 isl_basic_map_free(part);
2487 result = isl_map_add_basic_map(result, part);
2500 __isl_give isl_map *isl_map_intersect(__isl_take isl_map *map1,
2501 __isl_take isl_map *map2)
2503 return isl_map_align_params_map_map_and(map1, map2, &map_intersect);
2506 struct isl_set *isl_set_intersect(struct isl_set *set1, struct isl_set *set2)
2508 return (struct isl_set *)
2509 isl_map_intersect((struct isl_map *)set1,
2510 (struct isl_map *)set2);
2513 /* The current implementation of isl_map_intersect accepts intersections
2514 * with parameter domains, so we can just call that for now.
2516 static __isl_give isl_map *map_intersect_params(__isl_take isl_map *map,
2517 __isl_take isl_set *params)
2519 return isl_map_intersect(map, params);
2522 __isl_give isl_map *isl_map_intersect_params(__isl_take isl_map *map1,
2523 __isl_take isl_map *map2)
2525 return isl_map_align_params_map_map_and(map1, map2, &map_intersect_params);
2528 __isl_give isl_set *isl_set_intersect_params(__isl_take isl_set *set,
2529 __isl_take isl_set *params)
2531 return isl_map_intersect_params(set, params);
2534 struct isl_basic_map *isl_basic_map_reverse(struct isl_basic_map *bmap)
2536 struct isl_dim *dim;
2537 struct isl_basic_set *bset;
2542 bmap = isl_basic_map_cow(bmap);
2545 dim = isl_dim_reverse(isl_dim_copy(bmap->dim));
2546 in = isl_basic_map_n_in(bmap);
2547 bset = isl_basic_set_from_basic_map(bmap);
2548 bset = isl_basic_set_swap_vars(bset, in);
2549 return isl_basic_map_from_basic_set(bset, dim);
2552 __isl_give isl_basic_map *isl_basic_map_insert(__isl_take isl_basic_map *bmap,
2553 enum isl_dim_type type, unsigned pos, unsigned n)
2555 struct isl_dim *res_dim;
2556 struct isl_basic_map *res;
2557 struct isl_dim_map *dim_map;
2558 unsigned total, off;
2559 enum isl_dim_type t;
2567 res_dim = isl_dim_insert(isl_basic_map_get_dim(bmap), type, pos, n);
2569 total = isl_basic_map_total_dim(bmap) + n;
2570 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2572 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
2574 isl_dim_map_dim(dim_map, bmap->dim, t, off);
2576 unsigned size = isl_basic_map_dim(bmap, t);
2577 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2579 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2580 pos, size - pos, off + pos + n);
2582 off += isl_dim_size(res_dim, t);
2584 isl_dim_map_div(dim_map, bmap, off);
2586 res = isl_basic_map_alloc_dim(res_dim,
2587 bmap->n_div, bmap->n_eq, bmap->n_ineq);
2588 if (isl_basic_map_is_rational(bmap))
2589 res = isl_basic_map_set_rational(res);
2590 res = isl_basic_map_add_constraints_dim_map(res, bmap, dim_map);
2591 return isl_basic_map_finalize(res);
2594 __isl_give isl_basic_map *isl_basic_map_add(__isl_take isl_basic_map *bmap,
2595 enum isl_dim_type type, unsigned n)
2599 return isl_basic_map_insert(bmap, type,
2600 isl_basic_map_dim(bmap, type), n);
2603 __isl_give isl_basic_set *isl_basic_set_add(__isl_take isl_basic_set *bset,
2604 enum isl_dim_type type, unsigned n)
2608 isl_assert(bset->ctx, type != isl_dim_in, goto error);
2609 return (isl_basic_set *)isl_basic_map_add((isl_basic_map *)bset, type, n);
2611 isl_basic_set_free(bset);
2615 __isl_give isl_map *isl_map_insert_dims(__isl_take isl_map *map,
2616 enum isl_dim_type type, unsigned pos, unsigned n)
2623 map = isl_map_cow(map);
2627 map->dim = isl_dim_insert(map->dim, type, pos, n);
2631 for (i = 0; i < map->n; ++i) {
2632 map->p[i] = isl_basic_map_insert(map->p[i], type, pos, n);
2643 __isl_give isl_set *isl_set_insert_dims(__isl_take isl_set *set,
2644 enum isl_dim_type type, unsigned pos, unsigned n)
2646 return isl_map_insert_dims(set, type, pos, n);
2649 __isl_give isl_map *isl_map_add_dims(__isl_take isl_map *map,
2650 enum isl_dim_type type, unsigned n)
2654 return isl_map_insert_dims(map, type, isl_map_dim(map, type), n);
2657 __isl_give isl_set *isl_set_add_dims(__isl_take isl_set *set,
2658 enum isl_dim_type type, unsigned n)
2662 isl_assert(set->ctx, type != isl_dim_in, goto error);
2663 return (isl_set *)isl_map_add_dims((isl_map *)set, type, n);
2669 __isl_give isl_basic_map *isl_basic_map_move_dims(
2670 __isl_take isl_basic_map *bmap,
2671 enum isl_dim_type dst_type, unsigned dst_pos,
2672 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2674 struct isl_dim_map *dim_map;
2675 struct isl_basic_map *res;
2676 enum isl_dim_type t;
2677 unsigned total, off;
2684 isl_assert(bmap->ctx, src_pos + n <= isl_basic_map_dim(bmap, src_type),
2687 if (dst_type == src_type && dst_pos == src_pos)
2690 isl_assert(bmap->ctx, dst_type != src_type, goto error);
2692 if (pos(bmap->dim, dst_type) + dst_pos ==
2693 pos(bmap->dim, src_type) + src_pos +
2694 ((src_type < dst_type) ? n : 0)) {
2695 bmap = isl_basic_map_cow(bmap);
2699 bmap->dim = isl_dim_move(bmap->dim, dst_type, dst_pos,
2700 src_type, src_pos, n);
2704 bmap = isl_basic_map_finalize(bmap);
2709 total = isl_basic_map_total_dim(bmap);
2710 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2713 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
2714 unsigned size = isl_dim_size(bmap->dim, t);
2715 if (t == dst_type) {
2716 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2719 isl_dim_map_dim_range(dim_map, bmap->dim, src_type,
2722 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2723 dst_pos, size - dst_pos, off);
2724 off += size - dst_pos;
2725 } else if (t == src_type) {
2726 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2729 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2730 src_pos + n, size - src_pos - n, off);
2731 off += size - src_pos - n;
2733 isl_dim_map_dim(dim_map, bmap->dim, t, off);
2737 isl_dim_map_div(dim_map, bmap, off);
2739 res = isl_basic_map_alloc_dim(isl_basic_map_get_dim(bmap),
2740 bmap->n_div, bmap->n_eq, bmap->n_ineq);
2741 bmap = isl_basic_map_add_constraints_dim_map(res, bmap, dim_map);
2743 bmap->dim = isl_dim_move(bmap->dim, dst_type, dst_pos,
2744 src_type, src_pos, n);
2748 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
2749 bmap = isl_basic_map_gauss(bmap, NULL);
2750 bmap = isl_basic_map_finalize(bmap);
2754 isl_basic_map_free(bmap);
2758 __isl_give isl_basic_set *isl_basic_set_move_dims(__isl_take isl_basic_set *bset,
2759 enum isl_dim_type dst_type, unsigned dst_pos,
2760 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2762 return (isl_basic_set *)isl_basic_map_move_dims(
2763 (isl_basic_map *)bset, dst_type, dst_pos, src_type, src_pos, n);
2766 __isl_give isl_set *isl_set_move_dims(__isl_take isl_set *set,
2767 enum isl_dim_type dst_type, unsigned dst_pos,
2768 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2772 isl_assert(set->ctx, dst_type != isl_dim_in, goto error);
2773 return (isl_set *)isl_map_move_dims((isl_map *)set, dst_type, dst_pos,
2774 src_type, src_pos, n);
2780 __isl_give isl_map *isl_map_move_dims(__isl_take isl_map *map,
2781 enum isl_dim_type dst_type, unsigned dst_pos,
2782 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2791 isl_assert(map->ctx, src_pos + n <= isl_map_dim(map, src_type),
2794 if (dst_type == src_type && dst_pos == src_pos)
2797 isl_assert(map->ctx, dst_type != src_type, goto error);
2799 map = isl_map_cow(map);
2803 map->dim = isl_dim_move(map->dim, dst_type, dst_pos, src_type, src_pos, n);
2807 for (i = 0; i < map->n; ++i) {
2808 map->p[i] = isl_basic_map_move_dims(map->p[i],
2810 src_type, src_pos, n);
2821 /* Move the specified dimensions to the last columns right before
2822 * the divs. Don't change the dimension specification of bmap.
2823 * That's the responsibility of the caller.
2825 static __isl_give isl_basic_map *move_last(__isl_take isl_basic_map *bmap,
2826 enum isl_dim_type type, unsigned first, unsigned n)
2828 struct isl_dim_map *dim_map;
2829 struct isl_basic_map *res;
2830 enum isl_dim_type t;
2831 unsigned total, off;
2835 if (pos(bmap->dim, type) + first + n == 1 + isl_dim_total(bmap->dim))
2838 total = isl_basic_map_total_dim(bmap);
2839 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2842 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
2843 unsigned size = isl_dim_size(bmap->dim, t);
2845 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2848 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2849 first, n, total - bmap->n_div - n);
2850 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2851 first + n, size - (first + n), off);
2852 off += size - (first + n);
2854 isl_dim_map_dim(dim_map, bmap->dim, t, off);
2858 isl_dim_map_div(dim_map, bmap, off + n);
2860 res = isl_basic_map_alloc_dim(isl_basic_map_get_dim(bmap),
2861 bmap->n_div, bmap->n_eq, bmap->n_ineq);
2862 res = isl_basic_map_add_constraints_dim_map(res, bmap, dim_map);
2866 /* Turn the n dimensions of type type, starting at first
2867 * into existentially quantified variables.
2869 __isl_give isl_basic_map *isl_basic_map_project_out(
2870 __isl_take isl_basic_map *bmap,
2871 enum isl_dim_type type, unsigned first, unsigned n)
2884 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL))
2885 return isl_basic_map_remove_dims(bmap, type, first, n);
2887 isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
2890 bmap = move_last(bmap, type, first, n);
2891 bmap = isl_basic_map_cow(bmap);
2895 row_size = 1 + isl_dim_total(bmap->dim) + bmap->extra;
2896 old = bmap->block2.data;
2897 bmap->block2 = isl_blk_extend(bmap->ctx, bmap->block2,
2898 (bmap->extra + n) * (1 + row_size));
2899 if (!bmap->block2.data)
2901 new_div = isl_alloc_array(bmap->ctx, isl_int *, bmap->extra + n);
2904 for (i = 0; i < n; ++i) {
2905 new_div[i] = bmap->block2.data +
2906 (bmap->extra + i) * (1 + row_size);
2907 isl_seq_clr(new_div[i], 1 + row_size);
2909 for (i = 0; i < bmap->extra; ++i)
2910 new_div[n + i] = bmap->block2.data + (bmap->div[i] - old);
2912 bmap->div = new_div;
2916 bmap->dim = isl_dim_drop(bmap->dim, type, first, n);
2919 bmap = isl_basic_map_simplify(bmap);
2920 bmap = isl_basic_map_drop_redundant_divs(bmap);
2921 return isl_basic_map_finalize(bmap);
2923 isl_basic_map_free(bmap);
2927 /* Turn the n dimensions of type type, starting at first
2928 * into existentially quantified variables.
2930 struct isl_basic_set *isl_basic_set_project_out(struct isl_basic_set *bset,
2931 enum isl_dim_type type, unsigned first, unsigned n)
2933 return (isl_basic_set *)isl_basic_map_project_out(
2934 (isl_basic_map *)bset, type, first, n);
2937 /* Turn the n dimensions of type type, starting at first
2938 * into existentially quantified variables.
2940 __isl_give isl_map *isl_map_project_out(__isl_take isl_map *map,
2941 enum isl_dim_type type, unsigned first, unsigned n)
2951 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
2953 map = isl_map_cow(map);
2957 map->dim = isl_dim_drop(map->dim, type, first, n);
2961 for (i = 0; i < map->n; ++i) {
2962 map->p[i] = isl_basic_map_project_out(map->p[i], type, first, n);
2973 /* Turn the n dimensions of type type, starting at first
2974 * into existentially quantified variables.
2976 __isl_give isl_set *isl_set_project_out(__isl_take isl_set *set,
2977 enum isl_dim_type type, unsigned first, unsigned n)
2979 return (isl_set *)isl_map_project_out((isl_map *)set, type, first, n);
2982 static struct isl_basic_map *add_divs(struct isl_basic_map *bmap, unsigned n)
2986 for (i = 0; i < n; ++i) {
2987 j = isl_basic_map_alloc_div(bmap);
2990 isl_seq_clr(bmap->div[j], 1+1+isl_basic_map_total_dim(bmap));
2994 isl_basic_map_free(bmap);
2998 struct isl_basic_map *isl_basic_map_apply_range(
2999 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3001 struct isl_dim *dim_result = NULL;
3002 struct isl_basic_map *bmap;
3003 unsigned n_in, n_out, n, nparam, total, pos;
3004 struct isl_dim_map *dim_map1, *dim_map2;
3006 if (!bmap1 || !bmap2)
3009 dim_result = isl_dim_join(isl_dim_copy(bmap1->dim),
3010 isl_dim_copy(bmap2->dim));
3012 n_in = isl_basic_map_n_in(bmap1);
3013 n_out = isl_basic_map_n_out(bmap2);
3014 n = isl_basic_map_n_out(bmap1);
3015 nparam = isl_basic_map_n_param(bmap1);
3017 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + n;
3018 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
3019 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
3020 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
3021 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
3022 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
3023 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_in);
3024 isl_dim_map_div(dim_map1, bmap1, pos += n_out);
3025 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
3026 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
3027 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
3029 bmap = isl_basic_map_alloc_dim(dim_result,
3030 bmap1->n_div + bmap2->n_div + n,
3031 bmap1->n_eq + bmap2->n_eq,
3032 bmap1->n_ineq + bmap2->n_ineq);
3033 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap1, dim_map1);
3034 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap2, dim_map2);
3035 bmap = add_divs(bmap, n);
3036 bmap = isl_basic_map_simplify(bmap);
3037 bmap = isl_basic_map_drop_redundant_divs(bmap);
3038 return isl_basic_map_finalize(bmap);
3040 isl_basic_map_free(bmap1);
3041 isl_basic_map_free(bmap2);
3045 struct isl_basic_set *isl_basic_set_apply(
3046 struct isl_basic_set *bset, struct isl_basic_map *bmap)
3051 isl_assert(bset->ctx, isl_basic_map_compatible_domain(bmap, bset),
3054 return (struct isl_basic_set *)
3055 isl_basic_map_apply_range((struct isl_basic_map *)bset, bmap);
3057 isl_basic_set_free(bset);
3058 isl_basic_map_free(bmap);
3062 struct isl_basic_map *isl_basic_map_apply_domain(
3063 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3065 if (!bmap1 || !bmap2)
3068 isl_assert(bmap1->ctx,
3069 isl_basic_map_n_in(bmap1) == isl_basic_map_n_in(bmap2), goto error);
3070 isl_assert(bmap1->ctx,
3071 isl_basic_map_n_param(bmap1) == isl_basic_map_n_param(bmap2),
3074 bmap1 = isl_basic_map_reverse(bmap1);
3075 bmap1 = isl_basic_map_apply_range(bmap1, bmap2);
3076 return isl_basic_map_reverse(bmap1);
3078 isl_basic_map_free(bmap1);
3079 isl_basic_map_free(bmap2);
3083 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
3084 * A \cap B -> f(A) + f(B)
3086 struct isl_basic_map *isl_basic_map_sum(
3087 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3089 unsigned n_in, n_out, nparam, total, pos;
3090 struct isl_basic_map *bmap = NULL;
3091 struct isl_dim_map *dim_map1, *dim_map2;
3094 if (!bmap1 || !bmap2)
3097 isl_assert(bmap1->ctx, isl_dim_equal(bmap1->dim, bmap2->dim),
3100 nparam = isl_basic_map_n_param(bmap1);
3101 n_in = isl_basic_map_n_in(bmap1);
3102 n_out = isl_basic_map_n_out(bmap1);
3104 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + 2 * n_out;
3105 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
3106 dim_map2 = isl_dim_map_alloc(bmap2->ctx, total);
3107 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
3108 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos);
3109 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
3110 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
3111 isl_dim_map_div(dim_map1, bmap1, pos += n_in + n_out);
3112 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
3113 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
3114 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_out);
3116 bmap = isl_basic_map_alloc_dim(isl_dim_copy(bmap1->dim),
3117 bmap1->n_div + bmap2->n_div + 2 * n_out,
3118 bmap1->n_eq + bmap2->n_eq + n_out,
3119 bmap1->n_ineq + bmap2->n_ineq);
3120 for (i = 0; i < n_out; ++i) {
3121 int j = isl_basic_map_alloc_equality(bmap);
3124 isl_seq_clr(bmap->eq[j], 1+total);
3125 isl_int_set_si(bmap->eq[j][1+nparam+n_in+i], -1);
3126 isl_int_set_si(bmap->eq[j][1+pos+i], 1);
3127 isl_int_set_si(bmap->eq[j][1+pos-n_out+i], 1);
3129 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap1, dim_map1);
3130 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap2, dim_map2);
3131 bmap = add_divs(bmap, 2 * n_out);
3133 bmap = isl_basic_map_simplify(bmap);
3134 return isl_basic_map_finalize(bmap);
3136 isl_basic_map_free(bmap);
3137 isl_basic_map_free(bmap1);
3138 isl_basic_map_free(bmap2);
3142 /* Given two maps A -> f(A) and B -> g(B), construct a map
3143 * A \cap B -> f(A) + f(B)
3145 struct isl_map *isl_map_sum(struct isl_map *map1, struct isl_map *map2)
3147 struct isl_map *result;
3153 isl_assert(map1->ctx, isl_dim_equal(map1->dim, map2->dim), goto error);
3155 result = isl_map_alloc_dim(isl_dim_copy(map1->dim),
3156 map1->n * map2->n, 0);
3159 for (i = 0; i < map1->n; ++i)
3160 for (j = 0; j < map2->n; ++j) {
3161 struct isl_basic_map *part;
3162 part = isl_basic_map_sum(
3163 isl_basic_map_copy(map1->p[i]),
3164 isl_basic_map_copy(map2->p[j]));
3165 if (isl_basic_map_is_empty(part))
3166 isl_basic_map_free(part);
3168 result = isl_map_add_basic_map(result, part);
3181 __isl_give isl_set *isl_set_sum(__isl_take isl_set *set1,
3182 __isl_take isl_set *set2)
3184 return (isl_set *)isl_map_sum((isl_map *)set1, (isl_map *)set2);
3187 /* Given a basic map A -> f(A), construct A -> -f(A).
3189 struct isl_basic_map *isl_basic_map_neg(struct isl_basic_map *bmap)
3194 bmap = isl_basic_map_cow(bmap);
3198 n = isl_basic_map_dim(bmap, isl_dim_out);
3199 off = isl_basic_map_offset(bmap, isl_dim_out);
3200 for (i = 0; i < bmap->n_eq; ++i)
3201 for (j = 0; j < n; ++j)
3202 isl_int_neg(bmap->eq[i][off+j], bmap->eq[i][off+j]);
3203 for (i = 0; i < bmap->n_ineq; ++i)
3204 for (j = 0; j < n; ++j)
3205 isl_int_neg(bmap->ineq[i][off+j], bmap->ineq[i][off+j]);
3206 for (i = 0; i < bmap->n_div; ++i)
3207 for (j = 0; j < n; ++j)
3208 isl_int_neg(bmap->div[i][1+off+j], bmap->div[i][1+off+j]);
3209 return isl_basic_map_finalize(bmap);
3212 __isl_give isl_basic_set *isl_basic_set_neg(__isl_take isl_basic_set *bset)
3214 return isl_basic_map_neg(bset);
3217 /* Given a map A -> f(A), construct A -> -f(A).
3219 struct isl_map *isl_map_neg(struct isl_map *map)
3223 map = isl_map_cow(map);
3227 for (i = 0; i < map->n; ++i) {
3228 map->p[i] = isl_basic_map_neg(map->p[i]);
3239 __isl_give isl_set *isl_set_neg(__isl_take isl_set *set)
3241 return (isl_set *)isl_map_neg((isl_map *)set);
3244 /* Given a basic map A -> f(A) and an integer d, construct a basic map
3245 * A -> floor(f(A)/d).
3247 struct isl_basic_map *isl_basic_map_floordiv(struct isl_basic_map *bmap,
3250 unsigned n_in, n_out, nparam, total, pos;
3251 struct isl_basic_map *result = NULL;
3252 struct isl_dim_map *dim_map;
3258 nparam = isl_basic_map_n_param(bmap);
3259 n_in = isl_basic_map_n_in(bmap);
3260 n_out = isl_basic_map_n_out(bmap);
3262 total = nparam + n_in + n_out + bmap->n_div + n_out;
3263 dim_map = isl_dim_map_alloc(bmap->ctx, total);
3264 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_param, pos = 0);
3265 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_in, pos += nparam);
3266 isl_dim_map_div(dim_map, bmap, pos += n_in + n_out);
3267 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_out, pos += bmap->n_div);
3269 result = isl_basic_map_alloc_dim(isl_dim_copy(bmap->dim),
3270 bmap->n_div + n_out,
3271 bmap->n_eq, bmap->n_ineq + 2 * n_out);
3272 result = isl_basic_map_add_constraints_dim_map(result, bmap, dim_map);
3273 result = add_divs(result, n_out);
3274 for (i = 0; i < n_out; ++i) {
3276 j = isl_basic_map_alloc_inequality(result);
3279 isl_seq_clr(result->ineq[j], 1+total);
3280 isl_int_neg(result->ineq[j][1+nparam+n_in+i], d);
3281 isl_int_set_si(result->ineq[j][1+pos+i], 1);
3282 j = isl_basic_map_alloc_inequality(result);
3285 isl_seq_clr(result->ineq[j], 1+total);
3286 isl_int_set(result->ineq[j][1+nparam+n_in+i], d);
3287 isl_int_set_si(result->ineq[j][1+pos+i], -1);
3288 isl_int_sub_ui(result->ineq[j][0], d, 1);
3291 result = isl_basic_map_simplify(result);
3292 return isl_basic_map_finalize(result);
3294 isl_basic_map_free(result);
3298 /* Given a map A -> f(A) and an integer d, construct a map
3299 * A -> floor(f(A)/d).
3301 struct isl_map *isl_map_floordiv(struct isl_map *map, isl_int d)
3305 map = isl_map_cow(map);
3309 ISL_F_CLR(map, ISL_MAP_DISJOINT);
3310 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3311 for (i = 0; i < map->n; ++i) {
3312 map->p[i] = isl_basic_map_floordiv(map->p[i], d);
3323 static struct isl_basic_map *var_equal(struct isl_basic_map *bmap, unsigned pos)
3329 i = isl_basic_map_alloc_equality(bmap);
3332 nparam = isl_basic_map_n_param(bmap);
3333 n_in = isl_basic_map_n_in(bmap);
3334 isl_seq_clr(bmap->eq[i], 1 + isl_basic_map_total_dim(bmap));
3335 isl_int_set_si(bmap->eq[i][1+nparam+pos], -1);
3336 isl_int_set_si(bmap->eq[i][1+nparam+n_in+pos], 1);
3337 return isl_basic_map_finalize(bmap);
3339 isl_basic_map_free(bmap);
3343 /* Add a constraints to "bmap" expressing i_pos < o_pos
3345 static struct isl_basic_map *var_less(struct isl_basic_map *bmap, unsigned pos)
3351 i = isl_basic_map_alloc_inequality(bmap);
3354 nparam = isl_basic_map_n_param(bmap);
3355 n_in = isl_basic_map_n_in(bmap);
3356 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
3357 isl_int_set_si(bmap->ineq[i][0], -1);
3358 isl_int_set_si(bmap->ineq[i][1+nparam+pos], -1);
3359 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], 1);
3360 return isl_basic_map_finalize(bmap);
3362 isl_basic_map_free(bmap);
3366 /* Add a constraint to "bmap" expressing i_pos <= o_pos
3368 static __isl_give isl_basic_map *var_less_or_equal(
3369 __isl_take isl_basic_map *bmap, unsigned pos)
3375 i = isl_basic_map_alloc_inequality(bmap);
3378 nparam = isl_basic_map_n_param(bmap);
3379 n_in = isl_basic_map_n_in(bmap);
3380 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
3381 isl_int_set_si(bmap->ineq[i][1+nparam+pos], -1);
3382 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], 1);
3383 return isl_basic_map_finalize(bmap);
3385 isl_basic_map_free(bmap);
3389 /* Add a constraints to "bmap" expressing i_pos > o_pos
3391 static struct isl_basic_map *var_more(struct isl_basic_map *bmap, unsigned pos)
3397 i = isl_basic_map_alloc_inequality(bmap);
3400 nparam = isl_basic_map_n_param(bmap);
3401 n_in = isl_basic_map_n_in(bmap);
3402 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
3403 isl_int_set_si(bmap->ineq[i][0], -1);
3404 isl_int_set_si(bmap->ineq[i][1+nparam+pos], 1);
3405 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], -1);
3406 return isl_basic_map_finalize(bmap);
3408 isl_basic_map_free(bmap);
3412 /* Add a constraint to "bmap" expressing i_pos >= o_pos
3414 static __isl_give isl_basic_map *var_more_or_equal(
3415 __isl_take 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][1+nparam+pos], 1);
3428 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], -1);
3429 return isl_basic_map_finalize(bmap);
3431 isl_basic_map_free(bmap);
3435 struct isl_basic_map *isl_basic_map_equal(struct isl_dim *dim, unsigned n_equal)
3438 struct isl_basic_map *bmap;
3439 bmap = isl_basic_map_alloc_dim(dim, 0, n_equal, 0);
3442 for (i = 0; i < n_equal && bmap; ++i)
3443 bmap = var_equal(bmap, i);
3444 return isl_basic_map_finalize(bmap);
3447 /* Return a relation on of dimension "dim" expressing i_[0..pos] << o_[0..pos]
3449 struct isl_basic_map *isl_basic_map_less_at(struct isl_dim *dim, unsigned pos)
3452 struct isl_basic_map *bmap;
3453 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
3456 for (i = 0; i < pos && bmap; ++i)
3457 bmap = var_equal(bmap, i);
3459 bmap = var_less(bmap, pos);
3460 return isl_basic_map_finalize(bmap);
3463 /* Return a relation on of dimension "dim" expressing i_[0..pos] <<= o_[0..pos]
3465 __isl_give isl_basic_map *isl_basic_map_less_or_equal_at(
3466 __isl_take isl_dim *dim, unsigned pos)
3469 isl_basic_map *bmap;
3471 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
3472 for (i = 0; i < pos; ++i)
3473 bmap = var_equal(bmap, i);
3474 bmap = var_less_or_equal(bmap, pos);
3475 return isl_basic_map_finalize(bmap);
3478 /* Return a relation on pairs of sets of dimension "dim" expressing i_pos > o_pos
3480 struct isl_basic_map *isl_basic_map_more_at(struct isl_dim *dim, unsigned pos)
3483 struct isl_basic_map *bmap;
3484 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
3487 for (i = 0; i < pos && bmap; ++i)
3488 bmap = var_equal(bmap, i);
3490 bmap = var_more(bmap, pos);
3491 return isl_basic_map_finalize(bmap);
3494 /* Return a relation on of dimension "dim" expressing i_[0..pos] >>= o_[0..pos]
3496 __isl_give isl_basic_map *isl_basic_map_more_or_equal_at(
3497 __isl_take isl_dim *dim, unsigned pos)
3500 isl_basic_map *bmap;
3502 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
3503 for (i = 0; i < pos; ++i)
3504 bmap = var_equal(bmap, i);
3505 bmap = var_more_or_equal(bmap, pos);
3506 return isl_basic_map_finalize(bmap);
3509 static __isl_give isl_map *map_lex_lte_first(__isl_take isl_dim *dims,
3510 unsigned n, int equal)
3512 struct isl_map *map;
3515 if (n == 0 && equal)
3516 return isl_map_universe(dims);
3518 map = isl_map_alloc_dim(isl_dim_copy(dims), n, ISL_MAP_DISJOINT);
3520 for (i = 0; i + 1 < n; ++i)
3521 map = isl_map_add_basic_map(map,
3522 isl_basic_map_less_at(isl_dim_copy(dims), i));
3525 map = isl_map_add_basic_map(map,
3526 isl_basic_map_less_or_equal_at(dims, n - 1));
3528 map = isl_map_add_basic_map(map,
3529 isl_basic_map_less_at(dims, n - 1));
3536 static __isl_give isl_map *map_lex_lte(__isl_take isl_dim *dims, int equal)
3540 return map_lex_lte_first(dims, dims->n_out, equal);
3543 __isl_give isl_map *isl_map_lex_lt_first(__isl_take isl_dim *dim, unsigned n)
3545 return map_lex_lte_first(dim, n, 0);
3548 __isl_give isl_map *isl_map_lex_le_first(__isl_take isl_dim *dim, unsigned n)
3550 return map_lex_lte_first(dim, n, 1);
3553 __isl_give isl_map *isl_map_lex_lt(__isl_take isl_dim *set_dim)
3555 return map_lex_lte(isl_dim_map_from_set(set_dim), 0);
3558 __isl_give isl_map *isl_map_lex_le(__isl_take isl_dim *set_dim)
3560 return map_lex_lte(isl_dim_map_from_set(set_dim), 1);
3563 static __isl_give isl_map *map_lex_gte_first(__isl_take isl_dim *dims,
3564 unsigned n, int equal)
3566 struct isl_map *map;
3569 if (n == 0 && equal)
3570 return isl_map_universe(dims);
3572 map = isl_map_alloc_dim(isl_dim_copy(dims), n, ISL_MAP_DISJOINT);
3574 for (i = 0; i + 1 < n; ++i)
3575 map = isl_map_add_basic_map(map,
3576 isl_basic_map_more_at(isl_dim_copy(dims), i));
3579 map = isl_map_add_basic_map(map,
3580 isl_basic_map_more_or_equal_at(dims, n - 1));
3582 map = isl_map_add_basic_map(map,
3583 isl_basic_map_more_at(dims, n - 1));
3590 static __isl_give isl_map *map_lex_gte(__isl_take isl_dim *dims, int equal)
3594 return map_lex_gte_first(dims, dims->n_out, equal);
3597 __isl_give isl_map *isl_map_lex_gt_first(__isl_take isl_dim *dim, unsigned n)
3599 return map_lex_gte_first(dim, n, 0);
3602 __isl_give isl_map *isl_map_lex_ge_first(__isl_take isl_dim *dim, unsigned n)
3604 return map_lex_gte_first(dim, n, 1);
3607 __isl_give isl_map *isl_map_lex_gt(__isl_take isl_dim *set_dim)
3609 return map_lex_gte(isl_dim_map_from_set(set_dim), 0);
3612 __isl_give isl_map *isl_map_lex_ge(__isl_take isl_dim *set_dim)
3614 return map_lex_gte(isl_dim_map_from_set(set_dim), 1);
3617 __isl_give isl_map *isl_set_lex_le_set(__isl_take isl_set *set1,
3618 __isl_take isl_set *set2)
3621 map = isl_map_lex_le(isl_set_get_dim(set1));
3622 map = isl_map_intersect_domain(map, set1);
3623 map = isl_map_intersect_range(map, set2);
3627 __isl_give isl_map *isl_set_lex_lt_set(__isl_take isl_set *set1,
3628 __isl_take isl_set *set2)
3631 map = isl_map_lex_lt(isl_set_get_dim(set1));
3632 map = isl_map_intersect_domain(map, set1);
3633 map = isl_map_intersect_range(map, set2);
3637 __isl_give isl_map *isl_set_lex_ge_set(__isl_take isl_set *set1,
3638 __isl_take isl_set *set2)
3641 map = isl_map_lex_ge(isl_set_get_dim(set1));
3642 map = isl_map_intersect_domain(map, set1);
3643 map = isl_map_intersect_range(map, set2);
3647 __isl_give isl_map *isl_set_lex_gt_set(__isl_take isl_set *set1,
3648 __isl_take isl_set *set2)
3651 map = isl_map_lex_gt(isl_set_get_dim(set1));
3652 map = isl_map_intersect_domain(map, set1);
3653 map = isl_map_intersect_range(map, set2);
3657 __isl_give isl_map *isl_map_lex_le_map(__isl_take isl_map *map1,
3658 __isl_take isl_map *map2)
3661 map = isl_map_lex_le(isl_dim_range(isl_map_get_dim(map1)));
3662 map = isl_map_apply_domain(map, isl_map_reverse(map1));
3663 map = isl_map_apply_range(map, isl_map_reverse(map2));
3667 __isl_give isl_map *isl_map_lex_lt_map(__isl_take isl_map *map1,
3668 __isl_take isl_map *map2)
3671 map = isl_map_lex_lt(isl_dim_range(isl_map_get_dim(map1)));
3672 map = isl_map_apply_domain(map, isl_map_reverse(map1));
3673 map = isl_map_apply_range(map, isl_map_reverse(map2));
3677 __isl_give isl_map *isl_map_lex_ge_map(__isl_take isl_map *map1,
3678 __isl_take isl_map *map2)
3681 map = isl_map_lex_ge(isl_dim_range(isl_map_get_dim(map1)));
3682 map = isl_map_apply_domain(map, isl_map_reverse(map1));
3683 map = isl_map_apply_range(map, isl_map_reverse(map2));
3687 __isl_give isl_map *isl_map_lex_gt_map(__isl_take isl_map *map1,
3688 __isl_take isl_map *map2)
3691 map = isl_map_lex_gt(isl_dim_range(isl_map_get_dim(map1)));
3692 map = isl_map_apply_domain(map, isl_map_reverse(map1));
3693 map = isl_map_apply_range(map, isl_map_reverse(map2));
3697 struct isl_basic_map *isl_basic_map_from_basic_set(
3698 struct isl_basic_set *bset, struct isl_dim *dim)
3700 struct isl_basic_map *bmap;
3702 bset = isl_basic_set_cow(bset);
3706 isl_assert(bset->ctx, isl_dim_compatible(bset->dim, dim), goto error);
3707 isl_dim_free(bset->dim);
3708 bmap = (struct isl_basic_map *) bset;
3710 return isl_basic_map_finalize(bmap);
3712 isl_basic_set_free(bset);
3717 struct isl_basic_set *isl_basic_set_from_basic_map(struct isl_basic_map *bmap)
3721 if (bmap->dim->n_in == 0)
3722 return (struct isl_basic_set *)bmap;
3723 bmap = isl_basic_map_cow(bmap);
3726 bmap->dim = isl_dim_as_set_dim(bmap->dim);
3729 bmap = isl_basic_map_finalize(bmap);
3730 return (struct isl_basic_set *)bmap;
3732 isl_basic_map_free(bmap);
3736 /* For a div d = floor(f/m), add the constraints
3739 * -(f-(n-1)) + m d >= 0
3741 * Note that the second constraint is the negation of
3745 int isl_basic_map_add_div_constraints_var(__isl_keep isl_basic_map *bmap,
3746 unsigned pos, isl_int *div)
3749 unsigned total = isl_basic_map_total_dim(bmap);
3751 i = isl_basic_map_alloc_inequality(bmap);
3754 isl_seq_cpy(bmap->ineq[i], div + 1, 1 + total);
3755 isl_int_neg(bmap->ineq[i][1 + pos], div[0]);
3757 j = isl_basic_map_alloc_inequality(bmap);
3760 isl_seq_neg(bmap->ineq[j], bmap->ineq[i], 1 + total);
3761 isl_int_add(bmap->ineq[j][0], bmap->ineq[j][0], bmap->ineq[j][1 + pos]);
3762 isl_int_sub_ui(bmap->ineq[j][0], bmap->ineq[j][0], 1);
3766 int isl_basic_set_add_div_constraints_var(__isl_keep isl_basic_set *bset,
3767 unsigned pos, isl_int *div)
3769 return isl_basic_map_add_div_constraints_var((isl_basic_map *)bset,
3773 int isl_basic_map_add_div_constraints(struct isl_basic_map *bmap, unsigned div)
3775 unsigned total = isl_basic_map_total_dim(bmap);
3776 unsigned div_pos = total - bmap->n_div + div;
3778 return isl_basic_map_add_div_constraints_var(bmap, div_pos,
3782 struct isl_basic_set *isl_basic_map_underlying_set(
3783 struct isl_basic_map *bmap)
3787 if (bmap->dim->nparam == 0 && bmap->dim->n_in == 0 &&
3789 !isl_dim_is_named_or_nested(bmap->dim, isl_dim_in) &&
3790 !isl_dim_is_named_or_nested(bmap->dim, isl_dim_out))
3791 return (struct isl_basic_set *)bmap;
3792 bmap = isl_basic_map_cow(bmap);
3795 bmap->dim = isl_dim_underlying(bmap->dim, bmap->n_div);
3798 bmap->extra -= bmap->n_div;
3800 bmap = isl_basic_map_finalize(bmap);
3801 return (struct isl_basic_set *)bmap;
3806 __isl_give isl_basic_set *isl_basic_set_underlying_set(
3807 __isl_take isl_basic_set *bset)
3809 return isl_basic_map_underlying_set((isl_basic_map *)bset);
3812 struct isl_basic_map *isl_basic_map_overlying_set(
3813 struct isl_basic_set *bset, struct isl_basic_map *like)
3815 struct isl_basic_map *bmap;
3816 struct isl_ctx *ctx;
3823 isl_assert(ctx, bset->n_div == 0, goto error);
3824 isl_assert(ctx, isl_basic_set_n_param(bset) == 0, goto error);
3825 isl_assert(ctx, bset->dim->n_out == isl_basic_map_total_dim(like),
3827 if (isl_dim_equal(bset->dim, like->dim) && like->n_div == 0) {
3828 isl_basic_map_free(like);
3829 return (struct isl_basic_map *)bset;
3831 bset = isl_basic_set_cow(bset);
3834 total = bset->dim->n_out + bset->extra;
3835 bmap = (struct isl_basic_map *)bset;
3836 isl_dim_free(bmap->dim);
3837 bmap->dim = isl_dim_copy(like->dim);
3840 bmap->n_div = like->n_div;
3841 bmap->extra += like->n_div;
3845 ltotal = total - bmap->extra + like->extra;
3848 bmap->block2 = isl_blk_extend(ctx, bmap->block2,
3849 bmap->extra * (1 + 1 + total));
3850 if (isl_blk_is_error(bmap->block2))
3852 div = isl_realloc_array(ctx, bmap->div, isl_int *, bmap->extra);
3856 for (i = 0; i < bmap->extra; ++i)
3857 bmap->div[i] = bmap->block2.data + i * (1 + 1 + total);
3858 for (i = 0; i < like->n_div; ++i) {
3859 isl_seq_cpy(bmap->div[i], like->div[i], 1 + 1 + ltotal);
3860 isl_seq_clr(bmap->div[i]+1+1+ltotal, total - ltotal);
3862 bmap = isl_basic_map_extend_constraints(bmap,
3863 0, 2 * like->n_div);
3864 for (i = 0; i < like->n_div; ++i) {
3865 if (isl_int_is_zero(bmap->div[i][0]))
3867 if (isl_basic_map_add_div_constraints(bmap, i) < 0)
3871 isl_basic_map_free(like);
3872 bmap = isl_basic_map_simplify(bmap);
3873 bmap = isl_basic_map_finalize(bmap);
3876 isl_basic_map_free(like);
3877 isl_basic_set_free(bset);
3881 struct isl_basic_set *isl_basic_set_from_underlying_set(
3882 struct isl_basic_set *bset, struct isl_basic_set *like)
3884 return (struct isl_basic_set *)
3885 isl_basic_map_overlying_set(bset, (struct isl_basic_map *)like);
3888 struct isl_set *isl_set_from_underlying_set(
3889 struct isl_set *set, struct isl_basic_set *like)
3895 isl_assert(set->ctx, set->dim->n_out == isl_basic_set_total_dim(like),
3897 if (isl_dim_equal(set->dim, like->dim) && like->n_div == 0) {
3898 isl_basic_set_free(like);
3901 set = isl_set_cow(set);
3904 for (i = 0; i < set->n; ++i) {
3905 set->p[i] = isl_basic_set_from_underlying_set(set->p[i],
3906 isl_basic_set_copy(like));
3910 isl_dim_free(set->dim);
3911 set->dim = isl_dim_copy(like->dim);
3914 isl_basic_set_free(like);
3917 isl_basic_set_free(like);
3922 struct isl_set *isl_map_underlying_set(struct isl_map *map)
3926 map = isl_map_cow(map);
3929 map->dim = isl_dim_cow(map->dim);
3933 for (i = 1; i < map->n; ++i)
3934 isl_assert(map->ctx, map->p[0]->n_div == map->p[i]->n_div,
3936 for (i = 0; i < map->n; ++i) {
3937 map->p[i] = (struct isl_basic_map *)
3938 isl_basic_map_underlying_set(map->p[i]);
3943 map->dim = isl_dim_underlying(map->dim, 0);
3945 isl_dim_free(map->dim);
3946 map->dim = isl_dim_copy(map->p[0]->dim);
3950 return (struct isl_set *)map;
3956 struct isl_set *isl_set_to_underlying_set(struct isl_set *set)
3958 return (struct isl_set *)isl_map_underlying_set((struct isl_map *)set);
3961 __isl_give isl_basic_map *isl_basic_map_reset_dim(
3962 __isl_take isl_basic_map *bmap, __isl_take isl_dim *dim)
3964 bmap = isl_basic_map_cow(bmap);
3968 isl_dim_free(bmap->dim);
3971 bmap = isl_basic_map_finalize(bmap);
3975 isl_basic_map_free(bmap);
3980 __isl_give isl_basic_set *isl_basic_set_reset_dim(
3981 __isl_take isl_basic_set *bset, __isl_take isl_dim *dim)
3983 return (isl_basic_set *)isl_basic_map_reset_dim((isl_basic_map *)bset,
3987 __isl_give isl_map *isl_map_reset_dim(__isl_take isl_map *map,
3988 __isl_take isl_dim *dim)
3992 map = isl_map_cow(map);
3996 for (i = 0; i < map->n; ++i) {
3997 map->p[i] = isl_basic_map_reset_dim(map->p[i],
4002 isl_dim_free(map->dim);
4012 __isl_give isl_set *isl_set_reset_dim(__isl_take isl_set *set,
4013 __isl_take isl_dim *dim)
4015 return (struct isl_set *) isl_map_reset_dim((struct isl_map *)set, dim);
4018 struct isl_basic_set *isl_basic_map_domain(struct isl_basic_map *bmap)
4021 struct isl_basic_set *domain;
4027 dim = isl_dim_domain(isl_basic_map_get_dim(bmap));
4029 n_in = isl_basic_map_n_in(bmap);
4030 n_out = isl_basic_map_n_out(bmap);
4031 domain = isl_basic_set_from_basic_map(bmap);
4032 domain = isl_basic_set_project_out(domain, isl_dim_set, n_in, n_out);
4034 domain = isl_basic_set_reset_dim(domain, dim);
4039 int isl_basic_map_may_be_set(__isl_keep isl_basic_map *bmap)
4043 return isl_dim_may_be_set(bmap->dim);
4046 struct isl_basic_set *isl_basic_map_range(struct isl_basic_map *bmap)
4050 if (isl_basic_map_may_be_set(bmap))
4052 return isl_basic_map_domain(isl_basic_map_reverse(bmap));
4055 __isl_give isl_basic_map *isl_basic_map_domain_map(
4056 __isl_take isl_basic_map *bmap)
4060 isl_basic_map *domain;
4061 int nparam, n_in, n_out;
4064 nparam = isl_basic_map_dim(bmap, isl_dim_param);
4065 n_in = isl_basic_map_dim(bmap, isl_dim_in);
4066 n_out = isl_basic_map_dim(bmap, isl_dim_out);
4068 dim = isl_dim_from_range(isl_dim_domain(isl_basic_map_get_dim(bmap)));
4069 domain = isl_basic_map_universe(dim);
4071 bmap = isl_basic_map_from_domain(isl_basic_map_wrap(bmap));
4072 bmap = isl_basic_map_apply_range(bmap, domain);
4073 bmap = isl_basic_map_extend_constraints(bmap, n_in, 0);
4075 total = isl_basic_map_total_dim(bmap);
4077 for (i = 0; i < n_in; ++i) {
4078 k = isl_basic_map_alloc_equality(bmap);
4081 isl_seq_clr(bmap->eq[k], 1 + total);
4082 isl_int_set_si(bmap->eq[k][1 + nparam + i], -1);
4083 isl_int_set_si(bmap->eq[k][1 + nparam + n_in + n_out + i], 1);
4086 bmap = isl_basic_map_gauss(bmap, NULL);
4087 return isl_basic_map_finalize(bmap);
4089 isl_basic_map_free(bmap);
4093 __isl_give isl_basic_map *isl_basic_map_range_map(
4094 __isl_take isl_basic_map *bmap)
4098 isl_basic_map *range;
4099 int nparam, n_in, n_out;
4102 nparam = isl_basic_map_dim(bmap, isl_dim_param);
4103 n_in = isl_basic_map_dim(bmap, isl_dim_in);
4104 n_out = isl_basic_map_dim(bmap, isl_dim_out);
4106 dim = isl_dim_from_range(isl_dim_range(isl_basic_map_get_dim(bmap)));
4107 range = isl_basic_map_universe(dim);
4109 bmap = isl_basic_map_from_domain(isl_basic_map_wrap(bmap));
4110 bmap = isl_basic_map_apply_range(bmap, range);
4111 bmap = isl_basic_map_extend_constraints(bmap, n_out, 0);
4113 total = isl_basic_map_total_dim(bmap);
4115 for (i = 0; i < n_out; ++i) {
4116 k = isl_basic_map_alloc_equality(bmap);
4119 isl_seq_clr(bmap->eq[k], 1 + total);
4120 isl_int_set_si(bmap->eq[k][1 + nparam + n_in + i], -1);
4121 isl_int_set_si(bmap->eq[k][1 + nparam + n_in + n_out + i], 1);
4124 bmap = isl_basic_map_gauss(bmap, NULL);
4125 return isl_basic_map_finalize(bmap);
4127 isl_basic_map_free(bmap);
4131 int isl_map_may_be_set(__isl_keep isl_map *map)
4135 return isl_dim_may_be_set(map->dim);
4138 struct isl_set *isl_map_range(struct isl_map *map)
4141 struct isl_set *set;
4145 if (isl_map_may_be_set(map))
4146 return (isl_set *)map;
4148 map = isl_map_cow(map);
4152 set = (struct isl_set *) map;
4153 set->dim = isl_dim_drop_inputs(set->dim, 0, set->dim->n_in);
4156 for (i = 0; i < map->n; ++i) {
4157 set->p[i] = isl_basic_map_range(map->p[i]);
4161 ISL_F_CLR(set, ISL_MAP_DISJOINT);
4162 ISL_F_CLR(set, ISL_SET_NORMALIZED);
4169 __isl_give isl_map *isl_map_domain_map(__isl_take isl_map *map)
4172 isl_dim *domain_dim;
4174 map = isl_map_cow(map);
4178 domain_dim = isl_dim_from_range(isl_dim_domain(isl_map_get_dim(map)));
4179 map->dim = isl_dim_from_domain(isl_dim_wrap(map->dim));
4180 map->dim = isl_dim_join(map->dim, domain_dim);
4183 for (i = 0; i < map->n; ++i) {
4184 map->p[i] = isl_basic_map_domain_map(map->p[i]);
4188 ISL_F_CLR(map, ISL_MAP_DISJOINT);
4189 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4196 __isl_give isl_map *isl_map_range_map(__isl_take isl_map *map)
4201 map = isl_map_cow(map);
4205 range_dim = isl_dim_range(isl_map_get_dim(map));
4206 map->dim = isl_dim_from_domain(isl_dim_wrap(map->dim));
4207 map->dim = isl_dim_join(map->dim, range_dim);
4210 for (i = 0; i < map->n; ++i) {
4211 map->p[i] = isl_basic_map_range_map(map->p[i]);
4215 ISL_F_CLR(map, ISL_MAP_DISJOINT);
4216 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4223 struct isl_map *isl_map_from_set(struct isl_set *set, struct isl_dim *dim)
4226 struct isl_map *map = NULL;
4228 set = isl_set_cow(set);
4231 isl_assert(set->ctx, isl_dim_compatible(set->dim, dim), goto error);
4232 map = (struct isl_map *)set;
4233 for (i = 0; i < set->n; ++i) {
4234 map->p[i] = isl_basic_map_from_basic_set(
4235 set->p[i], isl_dim_copy(dim));
4239 isl_dim_free(map->dim);
4248 __isl_give isl_basic_map *isl_basic_map_from_domain(
4249 __isl_take isl_basic_set *bset)
4251 return isl_basic_map_reverse(isl_basic_map_from_range(bset));
4254 __isl_give isl_basic_map *isl_basic_map_from_range(
4255 __isl_take isl_basic_set *bset)
4257 return (isl_basic_map *)bset;
4260 struct isl_map *isl_map_from_range(struct isl_set *set)
4262 return (struct isl_map *)set;
4265 __isl_give isl_map *isl_map_from_domain(__isl_take isl_set *set)
4267 return isl_map_reverse(isl_map_from_range(set));
4270 __isl_give isl_basic_map *isl_basic_map_from_domain_and_range(
4271 __isl_take isl_basic_set *domain, __isl_take isl_basic_set *range)
4273 return isl_basic_map_apply_range(isl_basic_map_from_domain(domain),
4274 isl_basic_map_from_range(range));
4277 __isl_give isl_map *isl_map_from_domain_and_range(__isl_take isl_set *domain,
4278 __isl_take isl_set *range)
4280 return isl_map_apply_range(isl_map_from_domain(domain),
4281 isl_map_from_range(range));
4284 struct isl_set *isl_set_from_map(struct isl_map *map)
4287 struct isl_set *set = NULL;
4291 map = isl_map_cow(map);
4294 map->dim = isl_dim_as_set_dim(map->dim);
4297 set = (struct isl_set *)map;
4298 for (i = 0; i < map->n; ++i) {
4299 set->p[i] = isl_basic_set_from_basic_map(map->p[i]);
4309 struct isl_map *isl_map_alloc_dim(struct isl_dim *dim, int n, unsigned flags)
4311 struct isl_map *map;
4315 isl_assert(dim->ctx, n >= 0, return NULL);
4316 map = isl_alloc(dim->ctx, struct isl_map,
4317 sizeof(struct isl_map) +
4318 (n - 1) * sizeof(struct isl_basic_map *));
4322 map->ctx = dim->ctx;
4323 isl_ctx_ref(map->ctx);
4335 struct isl_map *isl_map_alloc(struct isl_ctx *ctx,
4336 unsigned nparam, unsigned in, unsigned out, int n,
4339 struct isl_map *map;
4340 struct isl_dim *dims;
4342 dims = isl_dim_alloc(ctx, nparam, in, out);
4346 map = isl_map_alloc_dim(dims, n, flags);
4350 struct isl_basic_map *isl_basic_map_empty(struct isl_dim *dim)
4352 struct isl_basic_map *bmap;
4353 bmap = isl_basic_map_alloc_dim(dim, 0, 1, 0);
4354 bmap = isl_basic_map_set_to_empty(bmap);
4358 struct isl_basic_set *isl_basic_set_empty(struct isl_dim *dim)
4360 struct isl_basic_set *bset;
4361 bset = isl_basic_set_alloc_dim(dim, 0, 1, 0);
4362 bset = isl_basic_set_set_to_empty(bset);
4366 struct isl_basic_map *isl_basic_map_empty_like(struct isl_basic_map *model)
4368 struct isl_basic_map *bmap;
4371 bmap = isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
4372 bmap = isl_basic_map_set_to_empty(bmap);
4376 struct isl_basic_map *isl_basic_map_empty_like_map(struct isl_map *model)
4378 struct isl_basic_map *bmap;
4381 bmap = isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
4382 bmap = isl_basic_map_set_to_empty(bmap);
4386 struct isl_basic_set *isl_basic_set_empty_like(struct isl_basic_set *model)
4388 struct isl_basic_set *bset;
4391 bset = isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
4392 bset = isl_basic_set_set_to_empty(bset);
4396 struct isl_basic_map *isl_basic_map_universe(struct isl_dim *dim)
4398 struct isl_basic_map *bmap;
4399 bmap = isl_basic_map_alloc_dim(dim, 0, 0, 0);
4400 bmap = isl_basic_map_finalize(bmap);
4404 struct isl_basic_set *isl_basic_set_universe(struct isl_dim *dim)
4406 struct isl_basic_set *bset;
4407 bset = isl_basic_set_alloc_dim(dim, 0, 0, 0);
4408 bset = isl_basic_set_finalize(bset);
4412 __isl_give isl_basic_map *isl_basic_map_nat_universe(__isl_take isl_dim *dim)
4415 unsigned total = isl_dim_total(dim);
4416 isl_basic_map *bmap;
4418 bmap= isl_basic_map_alloc_dim(dim, 0, 0, total);
4419 for (i = 0; i < total; ++i) {
4420 int k = isl_basic_map_alloc_inequality(bmap);
4423 isl_seq_clr(bmap->ineq[k], 1 + total);
4424 isl_int_set_si(bmap->ineq[k][1 + i], 1);
4428 isl_basic_map_free(bmap);
4432 __isl_give isl_basic_set *isl_basic_set_nat_universe(__isl_take isl_dim *dim)
4434 return isl_basic_map_nat_universe(dim);
4437 __isl_give isl_map *isl_map_nat_universe(__isl_take isl_dim *dim)
4439 return isl_map_from_basic_map(isl_basic_map_nat_universe(dim));
4442 __isl_give isl_set *isl_set_nat_universe(__isl_take isl_dim *dim)
4444 return isl_map_nat_universe(dim);
4447 __isl_give isl_basic_map *isl_basic_map_universe_like(
4448 __isl_keep isl_basic_map *model)
4452 return isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
4455 struct isl_basic_set *isl_basic_set_universe_like(struct isl_basic_set *model)
4459 return isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
4462 __isl_give isl_basic_set *isl_basic_set_universe_like_set(
4463 __isl_keep isl_set *model)
4467 return isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
4470 struct isl_map *isl_map_empty(struct isl_dim *dim)
4472 return isl_map_alloc_dim(dim, 0, ISL_MAP_DISJOINT);
4475 struct isl_map *isl_map_empty_like(struct isl_map *model)
4479 return isl_map_alloc_dim(isl_dim_copy(model->dim), 0, ISL_MAP_DISJOINT);
4482 struct isl_map *isl_map_empty_like_basic_map(struct isl_basic_map *model)
4486 return isl_map_alloc_dim(isl_dim_copy(model->dim), 0, ISL_MAP_DISJOINT);
4489 struct isl_set *isl_set_empty(struct isl_dim *dim)
4491 return isl_set_alloc_dim(dim, 0, ISL_MAP_DISJOINT);
4494 struct isl_set *isl_set_empty_like(struct isl_set *model)
4498 return isl_set_empty(isl_dim_copy(model->dim));
4501 struct isl_map *isl_map_universe(struct isl_dim *dim)
4503 struct isl_map *map;
4506 map = isl_map_alloc_dim(isl_dim_copy(dim), 1, ISL_MAP_DISJOINT);
4507 map = isl_map_add_basic_map(map, isl_basic_map_universe(dim));
4511 struct isl_set *isl_set_universe(struct isl_dim *dim)
4513 struct isl_set *set;
4516 set = isl_set_alloc_dim(isl_dim_copy(dim), 1, ISL_MAP_DISJOINT);
4517 set = isl_set_add_basic_set(set, isl_basic_set_universe(dim));
4521 __isl_give isl_set *isl_set_universe_like(__isl_keep isl_set *model)
4525 return isl_set_universe(isl_dim_copy(model->dim));
4528 struct isl_map *isl_map_dup(struct isl_map *map)
4531 struct isl_map *dup;
4535 dup = isl_map_alloc_dim(isl_dim_copy(map->dim), map->n, map->flags);
4536 for (i = 0; i < map->n; ++i)
4537 dup = isl_map_add_basic_map(dup, isl_basic_map_copy(map->p[i]));
4541 __isl_give isl_map *isl_map_add_basic_map(__isl_take isl_map *map,
4542 __isl_take isl_basic_map *bmap)
4546 if (isl_basic_map_plain_is_empty(bmap)) {
4547 isl_basic_map_free(bmap);
4550 isl_assert(map->ctx, isl_dim_equal(map->dim, bmap->dim), goto error);
4551 isl_assert(map->ctx, map->n < map->size, goto error);
4552 map->p[map->n] = bmap;
4554 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4560 isl_basic_map_free(bmap);
4564 void isl_map_free(struct isl_map *map)
4574 isl_ctx_deref(map->ctx);
4575 for (i = 0; i < map->n; ++i)
4576 isl_basic_map_free(map->p[i]);
4577 isl_dim_free(map->dim);
4581 struct isl_map *isl_map_extend(struct isl_map *base,
4582 unsigned nparam, unsigned n_in, unsigned n_out)
4586 base = isl_map_cow(base);
4590 base->dim = isl_dim_extend(base->dim, nparam, n_in, n_out);
4593 for (i = 0; i < base->n; ++i) {
4594 base->p[i] = isl_basic_map_extend_dim(base->p[i],
4595 isl_dim_copy(base->dim), 0, 0, 0);
4605 struct isl_set *isl_set_extend(struct isl_set *base,
4606 unsigned nparam, unsigned dim)
4608 return (struct isl_set *)isl_map_extend((struct isl_map *)base,
4612 static struct isl_basic_map *isl_basic_map_fix_pos_si(
4613 struct isl_basic_map *bmap, unsigned pos, int value)
4617 bmap = isl_basic_map_cow(bmap);
4618 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
4619 j = isl_basic_map_alloc_equality(bmap);
4622 isl_seq_clr(bmap->eq[j] + 1, isl_basic_map_total_dim(bmap));
4623 isl_int_set_si(bmap->eq[j][pos], -1);
4624 isl_int_set_si(bmap->eq[j][0], value);
4625 bmap = isl_basic_map_simplify(bmap);
4626 return isl_basic_map_finalize(bmap);
4628 isl_basic_map_free(bmap);
4632 static __isl_give isl_basic_map *isl_basic_map_fix_pos(
4633 __isl_take isl_basic_map *bmap, unsigned pos, isl_int value)
4637 bmap = isl_basic_map_cow(bmap);
4638 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
4639 j = isl_basic_map_alloc_equality(bmap);
4642 isl_seq_clr(bmap->eq[j] + 1, isl_basic_map_total_dim(bmap));
4643 isl_int_set_si(bmap->eq[j][pos], -1);
4644 isl_int_set(bmap->eq[j][0], value);
4645 bmap = isl_basic_map_simplify(bmap);
4646 return isl_basic_map_finalize(bmap);
4648 isl_basic_map_free(bmap);
4652 struct isl_basic_map *isl_basic_map_fix_si(struct isl_basic_map *bmap,
4653 enum isl_dim_type type, unsigned pos, int value)
4657 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
4658 return isl_basic_map_fix_pos_si(bmap,
4659 isl_basic_map_offset(bmap, type) + pos, value);
4661 isl_basic_map_free(bmap);
4665 __isl_give isl_basic_map *isl_basic_map_fix(__isl_take isl_basic_map *bmap,
4666 enum isl_dim_type type, unsigned pos, isl_int value)
4670 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
4671 return isl_basic_map_fix_pos(bmap,
4672 isl_basic_map_offset(bmap, type) + pos, value);
4674 isl_basic_map_free(bmap);
4678 struct isl_basic_set *isl_basic_set_fix_si(struct isl_basic_set *bset,
4679 enum isl_dim_type type, unsigned pos, int value)
4681 return (struct isl_basic_set *)
4682 isl_basic_map_fix_si((struct isl_basic_map *)bset,
4686 __isl_give isl_basic_set *isl_basic_set_fix(__isl_take isl_basic_set *bset,
4687 enum isl_dim_type type, unsigned pos, isl_int value)
4689 return (struct isl_basic_set *)
4690 isl_basic_map_fix((struct isl_basic_map *)bset,
4694 struct isl_basic_map *isl_basic_map_fix_input_si(struct isl_basic_map *bmap,
4695 unsigned input, int value)
4697 return isl_basic_map_fix_si(bmap, isl_dim_in, input, value);
4700 struct isl_basic_set *isl_basic_set_fix_dim_si(struct isl_basic_set *bset,
4701 unsigned dim, int value)
4703 return (struct isl_basic_set *)
4704 isl_basic_map_fix_si((struct isl_basic_map *)bset,
4705 isl_dim_set, dim, value);
4708 struct isl_map *isl_map_fix_si(struct isl_map *map,
4709 enum isl_dim_type type, unsigned pos, int value)
4713 map = isl_map_cow(map);
4717 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
4718 for (i = 0; i < map->n; ++i) {
4719 map->p[i] = isl_basic_map_fix_si(map->p[i], type, pos, value);
4723 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4730 __isl_give isl_set *isl_set_fix_si(__isl_take isl_set *set,
4731 enum isl_dim_type type, unsigned pos, int value)
4733 return (struct isl_set *)
4734 isl_map_fix_si((struct isl_map *)set, type, pos, value);
4737 __isl_give isl_map *isl_map_fix(__isl_take isl_map *map,
4738 enum isl_dim_type type, unsigned pos, isl_int value)
4742 map = isl_map_cow(map);
4746 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
4747 for (i = 0; i < map->n; ++i) {
4748 map->p[i] = isl_basic_map_fix(map->p[i], type, pos, value);
4752 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4759 __isl_give isl_set *isl_set_fix(__isl_take isl_set *set,
4760 enum isl_dim_type type, unsigned pos, isl_int value)
4762 return (struct isl_set *)isl_map_fix((isl_map *)set, type, pos, value);
4765 struct isl_map *isl_map_fix_input_si(struct isl_map *map,
4766 unsigned input, int value)
4768 return isl_map_fix_si(map, isl_dim_in, input, value);
4771 struct isl_set *isl_set_fix_dim_si(struct isl_set *set, unsigned dim, int value)
4773 return (struct isl_set *)
4774 isl_map_fix_si((struct isl_map *)set, isl_dim_set, dim, value);
4777 __isl_give isl_basic_map *isl_basic_map_lower_bound_si(
4778 __isl_take isl_basic_map *bmap,
4779 enum isl_dim_type type, unsigned pos, int value)
4785 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
4786 pos += isl_basic_map_offset(bmap, type);
4787 bmap = isl_basic_map_cow(bmap);
4788 bmap = isl_basic_map_extend_constraints(bmap, 0, 1);
4789 j = isl_basic_map_alloc_inequality(bmap);
4792 isl_seq_clr(bmap->ineq[j], 1 + isl_basic_map_total_dim(bmap));
4793 isl_int_set_si(bmap->ineq[j][pos], 1);
4794 isl_int_set_si(bmap->ineq[j][0], -value);
4795 bmap = isl_basic_map_simplify(bmap);
4796 return isl_basic_map_finalize(bmap);
4798 isl_basic_map_free(bmap);
4802 struct isl_basic_set *isl_basic_set_lower_bound_dim(struct isl_basic_set *bset,
4803 unsigned dim, isl_int value)
4807 bset = isl_basic_set_cow(bset);
4808 bset = isl_basic_set_extend_constraints(bset, 0, 1);
4809 j = isl_basic_set_alloc_inequality(bset);
4812 isl_seq_clr(bset->ineq[j], 1 + isl_basic_set_total_dim(bset));
4813 isl_int_set_si(bset->ineq[j][1 + isl_basic_set_n_param(bset) + dim], 1);
4814 isl_int_neg(bset->ineq[j][0], value);
4815 bset = isl_basic_set_simplify(bset);
4816 return isl_basic_set_finalize(bset);
4818 isl_basic_set_free(bset);
4822 __isl_give isl_map *isl_map_lower_bound_si(__isl_take isl_map *map,
4823 enum isl_dim_type type, unsigned pos, int value)
4827 map = isl_map_cow(map);
4831 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
4832 for (i = 0; i < map->n; ++i) {
4833 map->p[i] = isl_basic_map_lower_bound_si(map->p[i],
4838 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4845 __isl_give isl_set *isl_set_lower_bound_si(__isl_take isl_set *set,
4846 enum isl_dim_type type, unsigned pos, int value)
4848 return (struct isl_set *)
4849 isl_map_lower_bound_si((struct isl_map *)set, type, pos, value);
4852 struct isl_set *isl_set_lower_bound_dim(struct isl_set *set, unsigned dim,
4857 set = isl_set_cow(set);
4861 isl_assert(set->ctx, dim < isl_set_n_dim(set), goto error);
4862 for (i = 0; i < set->n; ++i) {
4863 set->p[i] = isl_basic_set_lower_bound_dim(set->p[i], dim, value);
4873 struct isl_map *isl_map_reverse(struct isl_map *map)
4877 map = isl_map_cow(map);
4881 map->dim = isl_dim_reverse(map->dim);
4884 for (i = 0; i < map->n; ++i) {
4885 map->p[i] = isl_basic_map_reverse(map->p[i]);
4889 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4896 static struct isl_map *isl_basic_map_partial_lexopt(
4897 struct isl_basic_map *bmap, struct isl_basic_set *dom,
4898 struct isl_set **empty, int max)
4902 if (bmap->ctx->opt->pip == ISL_PIP_PIP)
4903 return isl_pip_basic_map_lexopt(bmap, dom, empty, max);
4905 return isl_tab_basic_map_partial_lexopt(bmap, dom, empty, max);
4907 isl_basic_map_free(bmap);
4908 isl_basic_set_free(dom);
4914 struct isl_map *isl_basic_map_partial_lexmax(
4915 struct isl_basic_map *bmap, struct isl_basic_set *dom,
4916 struct isl_set **empty)
4918 return isl_basic_map_partial_lexopt(bmap, dom, empty, 1);
4921 struct isl_map *isl_basic_map_partial_lexmin(
4922 struct isl_basic_map *bmap, struct isl_basic_set *dom,
4923 struct isl_set **empty)
4925 return isl_basic_map_partial_lexopt(bmap, dom, empty, 0);
4928 struct isl_set *isl_basic_set_partial_lexmin(
4929 struct isl_basic_set *bset, struct isl_basic_set *dom,
4930 struct isl_set **empty)
4932 return (struct isl_set *)
4933 isl_basic_map_partial_lexmin((struct isl_basic_map *)bset,
4937 struct isl_set *isl_basic_set_partial_lexmax(
4938 struct isl_basic_set *bset, struct isl_basic_set *dom,
4939 struct isl_set **empty)
4941 return (struct isl_set *)
4942 isl_basic_map_partial_lexmax((struct isl_basic_map *)bset,
4946 /* Given a basic map "bmap", compute the lexicographically minimal
4947 * (or maximal) image element for each domain element in dom.
4948 * Set *empty to those elements in dom that do not have an image element.
4950 * We first make sure the basic sets in dom are disjoint and then
4951 * simply collect the results over each of the basic sets separately.
4952 * We could probably improve the efficiency a bit by moving the union
4953 * domain down into the parametric integer programming.
4955 static __isl_give isl_map *basic_map_partial_lexopt(
4956 __isl_take isl_basic_map *bmap, __isl_take isl_set *dom,
4957 __isl_give isl_set **empty, int max)
4960 struct isl_map *res;
4962 dom = isl_set_make_disjoint(dom);
4966 if (isl_set_plain_is_empty(dom)) {
4967 res = isl_map_empty_like_basic_map(bmap);
4968 *empty = isl_set_empty_like(dom);
4970 isl_basic_map_free(bmap);
4974 res = isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap),
4975 isl_basic_set_copy(dom->p[0]), empty, max);
4977 for (i = 1; i < dom->n; ++i) {
4978 struct isl_map *res_i;
4979 struct isl_set *empty_i;
4981 res_i = isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap),
4982 isl_basic_set_copy(dom->p[i]), &empty_i, max);
4984 res = isl_map_union_disjoint(res, res_i);
4985 *empty = isl_set_union_disjoint(*empty, empty_i);
4989 isl_basic_map_free(bmap);
4994 isl_basic_map_free(bmap);
4998 /* Given a map "map", compute the lexicographically minimal
4999 * (or maximal) image element for each domain element in dom.
5000 * Set *empty to those elements in dom that do not have an image element.
5002 * We first compute the lexicographically minimal or maximal element
5003 * in the first basic map. This results in a partial solution "res"
5004 * and a subset "todo" of dom that still need to be handled.
5005 * We then consider each of the remaining maps in "map" and successively
5006 * improve both "res" and "todo".
5008 * Let res^k and todo^k be the results after k steps and let i = k + 1.
5009 * Assume we are computing the lexicographical maximum.
5010 * We first compute the lexicographically maximal element in basic map i.
5011 * This results in a partial solution res_i and a subset todo_i.
5012 * Then we combine these results with those obtain for the first k basic maps
5013 * to obtain a result that is valid for the first k+1 basic maps.
5014 * In particular, the set where there is no solution is the set where
5015 * there is no solution for the first k basic maps and also no solution
5016 * for the ith basic map, i.e.,
5018 * todo^i = todo^k * todo_i
5020 * On dom(res^k) * dom(res_i), we need to pick the larger of the two
5021 * solutions, arbitrarily breaking ties in favor of res^k.
5022 * That is, when res^k(a) >= res_i(a), we pick res^k and
5023 * when res^k(a) < res_i(a), we pick res_i. (Here, ">=" and "<" denote
5024 * the lexicographic order.)
5025 * In practice, we compute
5027 * res^k * (res_i . "<=")
5031 * res_i * (res^k . "<")
5033 * Finally, we consider the symmetric difference of dom(res^k) and dom(res_i),
5034 * where only one of res^k and res_i provides a solution and we simply pick
5041 * Note that we only compute these intersections when dom(res^k) intersects
5042 * dom(res_i). Otherwise, the only effect of these intersections is to
5043 * potentially break up res^k and res_i into smaller pieces.
5044 * We want to avoid such splintering as much as possible.
5045 * In fact, an earlier implementation of this function would look for
5046 * better results in the domain of res^k and for extra results in todo^k,
5047 * but this would always result in a splintering according to todo^k,
5048 * even when the domain of basic map i is disjoint from the domains of
5049 * the previous basic maps.
5051 static __isl_give isl_map *isl_map_partial_lexopt(
5052 __isl_take isl_map *map, __isl_take isl_set *dom,
5053 __isl_give isl_set **empty, int max)
5056 struct isl_map *res;
5057 struct isl_set *todo;
5062 if (isl_map_plain_is_empty(map)) {
5070 res = basic_map_partial_lexopt(isl_basic_map_copy(map->p[0]),
5071 isl_set_copy(dom), &todo, max);
5073 for (i = 1; i < map->n; ++i) {
5077 isl_dim *dim = isl_dim_range(isl_map_get_dim(res));
5079 res_i = basic_map_partial_lexopt(isl_basic_map_copy(map->p[i]),
5080 isl_set_copy(dom), &todo_i, max);
5083 lt = isl_map_lex_lt(isl_dim_copy(dim));
5084 le = isl_map_lex_le(dim);
5086 lt = isl_map_lex_gt(isl_dim_copy(dim));
5087 le = isl_map_lex_ge(dim);
5089 lt = isl_map_apply_range(isl_map_copy(res), lt);
5090 lt = isl_map_intersect(lt, isl_map_copy(res_i));
5091 le = isl_map_apply_range(isl_map_copy(res_i), le);
5092 le = isl_map_intersect(le, isl_map_copy(res));
5094 if (!isl_map_is_empty(lt) || !isl_map_is_empty(le)) {
5095 res = isl_map_intersect_domain(res,
5096 isl_set_copy(todo_i));
5097 res_i = isl_map_intersect_domain(res_i,
5098 isl_set_copy(todo));
5101 res = isl_map_union_disjoint(res, res_i);
5102 res = isl_map_union_disjoint(res, lt);
5103 res = isl_map_union_disjoint(res, le);
5105 todo = isl_set_intersect(todo, todo_i);
5125 __isl_give isl_map *isl_map_partial_lexmax(
5126 __isl_take isl_map *map, __isl_take isl_set *dom,
5127 __isl_give isl_set **empty)
5129 return isl_map_partial_lexopt(map, dom, empty, 1);
5132 __isl_give isl_map *isl_map_partial_lexmin(
5133 __isl_take isl_map *map, __isl_take isl_set *dom,
5134 __isl_give isl_set **empty)
5136 return isl_map_partial_lexopt(map, dom, empty, 0);
5139 __isl_give isl_set *isl_set_partial_lexmin(
5140 __isl_take isl_set *set, __isl_take isl_set *dom,
5141 __isl_give isl_set **empty)
5143 return (struct isl_set *)
5144 isl_map_partial_lexmin((struct isl_map *)set,
5148 __isl_give isl_set *isl_set_partial_lexmax(
5149 __isl_take isl_set *set, __isl_take isl_set *dom,
5150 __isl_give isl_set **empty)
5152 return (struct isl_set *)
5153 isl_map_partial_lexmax((struct isl_map *)set,
5157 __isl_give isl_map *isl_basic_map_lexopt(__isl_take isl_basic_map *bmap, int max)
5159 struct isl_basic_set *dom = NULL;
5160 struct isl_dim *dom_dim;
5164 dom_dim = isl_dim_domain(isl_dim_copy(bmap->dim));
5165 dom = isl_basic_set_universe(dom_dim);
5166 return isl_basic_map_partial_lexopt(bmap, dom, NULL, max);
5168 isl_basic_map_free(bmap);
5172 __isl_give isl_map *isl_basic_map_lexmin(__isl_take isl_basic_map *bmap)
5174 return isl_basic_map_lexopt(bmap, 0);
5177 __isl_give isl_map *isl_basic_map_lexmax(__isl_take isl_basic_map *bmap)
5179 return isl_basic_map_lexopt(bmap, 1);
5182 __isl_give isl_set *isl_basic_set_lexmin(__isl_take isl_basic_set *bset)
5184 return (isl_set *)isl_basic_map_lexmin((isl_basic_map *)bset);
5187 __isl_give isl_set *isl_basic_set_lexmax(__isl_take isl_basic_set *bset)
5189 return (isl_set *)isl_basic_map_lexmax((isl_basic_map *)bset);
5192 __isl_give isl_map *isl_map_lexopt(__isl_take isl_map *map, int max)
5194 struct isl_set *dom = NULL;
5195 struct isl_dim *dom_dim;
5199 dom_dim = isl_dim_domain(isl_dim_copy(map->dim));
5200 dom = isl_set_universe(dom_dim);
5201 return isl_map_partial_lexopt(map, dom, NULL, max);
5207 __isl_give isl_map *isl_map_lexmin(__isl_take isl_map *map)
5209 return isl_map_lexopt(map, 0);
5212 __isl_give isl_map *isl_map_lexmax(__isl_take isl_map *map)
5214 return isl_map_lexopt(map, 1);
5217 __isl_give isl_set *isl_set_lexmin(__isl_take isl_set *set)
5219 return (isl_set *)isl_map_lexmin((isl_map *)set);
5222 __isl_give isl_set *isl_set_lexmax(__isl_take isl_set *set)
5224 return (isl_set *)isl_map_lexmax((isl_map *)set);
5227 /* Construct a map that equates the two given dimensions in the given space.
5229 static __isl_give isl_map *equate(__isl_take isl_dim *dim,
5230 enum isl_dim_type src_type, int src_pos,
5231 enum isl_dim_type dst_type, int dst_pos)
5233 isl_basic_map *bmap;
5236 bmap = isl_basic_map_alloc_dim(dim, 0, 1, 0);
5237 k = isl_basic_map_alloc_equality(bmap);
5240 isl_seq_clr(bmap->eq[k], 1 + isl_basic_map_total_dim(bmap));
5241 src_pos += isl_basic_map_offset(bmap, src_type);
5242 dst_pos += isl_basic_map_offset(bmap, dst_type);
5243 isl_int_set_si(bmap->eq[k][src_pos], 1);
5244 isl_int_set_si(bmap->eq[k][dst_pos], -1);
5246 return isl_map_from_basic_map(bmap);
5248 isl_basic_map_free(bmap);
5252 /* Extract the first and only affine expression from list
5253 * and then add it to *pwaff with the given dom.
5254 * This domain is known to be disjoint from other domains
5255 * because of the way isl_basic_set_foreach_lexmax works.
5257 static int update_dim_max(__isl_take isl_basic_set *dom,
5258 __isl_take isl_aff_list *list, void *user)
5260 isl_ctx *ctx = isl_basic_set_get_ctx(dom);
5262 isl_pw_aff **pwaff = user;
5263 isl_pw_aff *pwaff_i;
5265 if (isl_aff_list_n_aff(list) != 1)
5266 isl_die(ctx, isl_error_internal,
5267 "expecting single element list", goto error);
5269 aff = isl_aff_list_get_aff(list, 0);
5270 pwaff_i = isl_pw_aff_alloc(isl_set_from_basic_set(dom), aff);
5272 *pwaff = isl_pw_aff_add_disjoint(*pwaff, pwaff_i);
5274 isl_aff_list_free(list);
5278 isl_basic_set_free(dom);
5279 isl_aff_list_free(list);
5283 /* Given a one-dimensional basic set, compute the maximum of that
5284 * dimension as an isl_pw_aff.
5286 * The isl_pw_aff is constructed by having isl_basic_set_foreach_lexmax
5287 * call update_dim_max on each leaf of the result.
5289 static __isl_give isl_pw_aff *basic_set_dim_max(__isl_keep isl_basic_set *bset)
5291 isl_dim *dim = isl_basic_set_get_dim(bset);
5295 dim = isl_dim_domain(isl_dim_from_range(dim));
5296 pwaff = isl_pw_aff_empty(dim);
5298 r = isl_basic_set_foreach_lexmax(bset, &update_dim_max, &pwaff);
5300 return isl_pw_aff_free(pwaff);
5305 /* Compute the maximum of the given set dimension as a function of the
5306 * parameters, but independently of the other set dimensions.
5308 * We first project the set onto the given dimension and then compute
5309 * the "lexicographic" maximum in each basic set, combining the results
5310 * using isl_pw_aff_union_max.
5312 __isl_give isl_pw_aff *isl_set_dim_max(__isl_take isl_set *set, int pos)
5318 map = isl_map_from_domain(set);
5319 map = isl_map_add_dims(map, isl_dim_out, 1);
5320 map = isl_map_intersect(map,
5321 equate(isl_map_get_dim(map), isl_dim_in, pos,
5323 set = isl_map_range(map);
5328 isl_dim *dim = isl_set_get_dim(set);
5329 dim = isl_dim_domain(isl_dim_from_range(dim));
5331 return isl_pw_aff_empty(dim);
5334 pwaff = basic_set_dim_max(set->p[0]);
5335 for (i = 1; i < set->n; ++i) {
5336 isl_pw_aff *pwaff_i;
5338 pwaff_i = basic_set_dim_max(set->p[i]);
5339 pwaff = isl_pw_aff_union_max(pwaff, pwaff_i);
5347 /* Apply a preimage specified by "mat" on the parameters of "bset".
5348 * bset is assumed to have only parameters and divs.
5350 static struct isl_basic_set *basic_set_parameter_preimage(
5351 struct isl_basic_set *bset, struct isl_mat *mat)
5358 bset->dim = isl_dim_cow(bset->dim);
5362 nparam = isl_basic_set_dim(bset, isl_dim_param);
5364 isl_assert(bset->ctx, mat->n_row == 1 + nparam, goto error);
5366 bset->dim->nparam = 0;
5367 bset->dim->n_out = nparam;
5368 bset = isl_basic_set_preimage(bset, mat);
5370 bset->dim->nparam = bset->dim->n_out;
5371 bset->dim->n_out = 0;
5376 isl_basic_set_free(bset);
5380 /* Apply a preimage specified by "mat" on the parameters of "set".
5381 * set is assumed to have only parameters and divs.
5383 static struct isl_set *set_parameter_preimage(
5384 struct isl_set *set, struct isl_mat *mat)
5386 struct isl_dim *dim = NULL;
5392 dim = isl_dim_copy(set->dim);
5393 dim = isl_dim_cow(dim);
5397 nparam = isl_set_dim(set, isl_dim_param);
5399 isl_assert(set->ctx, mat->n_row == 1 + nparam, goto error);
5402 dim->n_out = nparam;
5403 isl_set_reset_dim(set, dim);
5404 set = isl_set_preimage(set, mat);
5407 dim = isl_dim_copy(set->dim);
5408 dim = isl_dim_cow(dim);
5411 dim->nparam = dim->n_out;
5413 isl_set_reset_dim(set, dim);
5423 /* Intersect the basic set "bset" with the affine space specified by the
5424 * equalities in "eq".
5426 static struct isl_basic_set *basic_set_append_equalities(
5427 struct isl_basic_set *bset, struct isl_mat *eq)
5435 bset = isl_basic_set_extend_dim(bset, isl_dim_copy(bset->dim), 0,
5440 len = 1 + isl_dim_total(bset->dim) + bset->extra;
5441 for (i = 0; i < eq->n_row; ++i) {
5442 k = isl_basic_set_alloc_equality(bset);
5445 isl_seq_cpy(bset->eq[k], eq->row[i], eq->n_col);
5446 isl_seq_clr(bset->eq[k] + eq->n_col, len - eq->n_col);
5450 bset = isl_basic_set_gauss(bset, NULL);
5451 bset = isl_basic_set_finalize(bset);
5456 isl_basic_set_free(bset);
5460 /* Intersect the set "set" with the affine space specified by the
5461 * equalities in "eq".
5463 static struct isl_set *set_append_equalities(struct isl_set *set,
5471 for (i = 0; i < set->n; ++i) {
5472 set->p[i] = basic_set_append_equalities(set->p[i],
5485 /* Project the given basic set onto its parameter domain, possibly introducing
5486 * new, explicit, existential variables in the constraints.
5487 * The input has parameters and (possibly implicit) existential variables.
5488 * The output has the same parameters, but only
5489 * explicit existentially quantified variables.
5491 * The actual projection is performed by pip, but pip doesn't seem
5492 * to like equalities very much, so we first remove the equalities
5493 * among the parameters by performing a variable compression on
5494 * the parameters. Afterward, an inverse transformation is performed
5495 * and the equalities among the parameters are inserted back in.
5497 static struct isl_set *parameter_compute_divs(struct isl_basic_set *bset)
5501 struct isl_mat *T, *T2;
5502 struct isl_set *set;
5503 unsigned nparam, n_div;
5505 bset = isl_basic_set_cow(bset);
5509 if (bset->n_eq == 0)
5510 return isl_basic_set_lexmin(bset);
5512 isl_basic_set_gauss(bset, NULL);
5514 nparam = isl_basic_set_dim(bset, isl_dim_param);
5515 n_div = isl_basic_set_dim(bset, isl_dim_div);
5517 for (i = 0, j = n_div - 1; i < bset->n_eq && j >= 0; --j) {
5518 if (!isl_int_is_zero(bset->eq[i][1 + nparam + j]))
5521 if (i == bset->n_eq)
5522 return isl_basic_set_lexmin(bset);
5524 eq = isl_mat_sub_alloc6(bset->ctx, bset->eq, i, bset->n_eq - i,
5526 eq = isl_mat_cow(eq);
5527 T = isl_mat_variable_compression(isl_mat_copy(eq), &T2);
5528 if (T && T->n_col == 0) {
5532 bset = isl_basic_set_set_to_empty(bset);
5533 return isl_set_from_basic_set(bset);
5535 bset = basic_set_parameter_preimage(bset, T);
5537 set = isl_basic_set_lexmin(bset);
5538 set = set_parameter_preimage(set, T2);
5539 set = set_append_equalities(set, eq);
5543 /* Compute an explicit representation for all the existentially
5544 * quantified variables.
5545 * The input and output dimensions are first turned into parameters.
5546 * compute_divs then returns a map with the same parameters and
5547 * no input or output dimensions and the dimension specification
5548 * is reset to that of the input.
5550 static struct isl_map *compute_divs(struct isl_basic_map *bmap)
5552 struct isl_basic_set *bset;
5553 struct isl_set *set;
5554 struct isl_map *map;
5555 struct isl_dim *dim, *orig_dim = NULL;
5560 bmap = isl_basic_map_cow(bmap);
5564 nparam = isl_basic_map_dim(bmap, isl_dim_param);
5565 n_in = isl_basic_map_dim(bmap, isl_dim_in);
5566 n_out = isl_basic_map_dim(bmap, isl_dim_out);
5567 dim = isl_dim_set_alloc(bmap->ctx, nparam + n_in + n_out, 0);
5571 orig_dim = bmap->dim;
5573 bset = (struct isl_basic_set *)bmap;
5575 set = parameter_compute_divs(bset);
5576 map = (struct isl_map *)set;
5577 map = isl_map_reset_dim(map, orig_dim);
5581 isl_basic_map_free(bmap);
5585 int isl_basic_map_divs_known(__isl_keep isl_basic_map *bmap)
5593 off = isl_dim_total(bmap->dim);
5594 for (i = 0; i < bmap->n_div; ++i) {
5595 if (isl_int_is_zero(bmap->div[i][0]))
5597 isl_assert(bmap->ctx, isl_int_is_zero(bmap->div[i][1+1+off+i]),
5603 static int map_divs_known(__isl_keep isl_map *map)
5610 for (i = 0; i < map->n; ++i) {
5611 int known = isl_basic_map_divs_known(map->p[i]);
5619 /* If bmap contains any unknown divs, then compute explicit
5620 * expressions for them. However, this computation may be
5621 * quite expensive, so first try to remove divs that aren't
5624 struct isl_map *isl_basic_map_compute_divs(struct isl_basic_map *bmap)
5627 struct isl_map *map;
5629 known = isl_basic_map_divs_known(bmap);
5633 return isl_map_from_basic_map(bmap);
5635 bmap = isl_basic_map_drop_redundant_divs(bmap);
5637 known = isl_basic_map_divs_known(bmap);
5641 return isl_map_from_basic_map(bmap);
5643 map = compute_divs(bmap);
5646 isl_basic_map_free(bmap);
5650 struct isl_map *isl_map_compute_divs(struct isl_map *map)
5654 struct isl_map *res;
5661 known = map_divs_known(map);
5669 res = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[0]));
5670 for (i = 1 ; i < map->n; ++i) {
5672 r2 = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[i]));
5673 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT))
5674 res = isl_map_union_disjoint(res, r2);
5676 res = isl_map_union(res, r2);
5683 struct isl_set *isl_basic_set_compute_divs(struct isl_basic_set *bset)
5685 return (struct isl_set *)
5686 isl_basic_map_compute_divs((struct isl_basic_map *)bset);
5689 struct isl_set *isl_set_compute_divs(struct isl_set *set)
5691 return (struct isl_set *)
5692 isl_map_compute_divs((struct isl_map *)set);
5695 struct isl_set *isl_map_domain(struct isl_map *map)
5698 struct isl_set *set;
5703 map = isl_map_cow(map);
5707 set = (struct isl_set *)map;
5708 set->dim = isl_dim_domain(set->dim);
5711 for (i = 0; i < map->n; ++i) {
5712 set->p[i] = isl_basic_map_domain(map->p[i]);
5716 ISL_F_CLR(set, ISL_MAP_DISJOINT);
5717 ISL_F_CLR(set, ISL_SET_NORMALIZED);
5724 static __isl_give isl_map *map_union_disjoint(__isl_take isl_map *map1,
5725 __isl_take isl_map *map2)
5729 struct isl_map *map = NULL;
5743 isl_assert(map1->ctx, isl_dim_equal(map1->dim, map2->dim), goto error);
5745 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
5746 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
5747 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
5749 map = isl_map_alloc_dim(isl_dim_copy(map1->dim),
5750 map1->n + map2->n, flags);
5753 for (i = 0; i < map1->n; ++i) {
5754 map = isl_map_add_basic_map(map,
5755 isl_basic_map_copy(map1->p[i]));
5759 for (i = 0; i < map2->n; ++i) {
5760 map = isl_map_add_basic_map(map,
5761 isl_basic_map_copy(map2->p[i]));
5775 __isl_give isl_map *isl_map_union_disjoint(__isl_take isl_map *map1,
5776 __isl_take isl_map *map2)
5778 return isl_map_align_params_map_map_and(map1, map2, &map_union_disjoint);
5781 struct isl_map *isl_map_union(struct isl_map *map1, struct isl_map *map2)
5783 map1 = isl_map_union_disjoint(map1, map2);
5787 ISL_F_CLR(map1, ISL_MAP_DISJOINT);
5791 struct isl_set *isl_set_union_disjoint(
5792 struct isl_set *set1, struct isl_set *set2)
5794 return (struct isl_set *)
5795 isl_map_union_disjoint(
5796 (struct isl_map *)set1, (struct isl_map *)set2);
5799 struct isl_set *isl_set_union(struct isl_set *set1, struct isl_set *set2)
5801 return (struct isl_set *)
5802 isl_map_union((struct isl_map *)set1, (struct isl_map *)set2);
5805 static __isl_give isl_map *map_intersect_range(__isl_take isl_map *map,
5806 __isl_take isl_set *set)
5809 struct isl_map *result;
5815 if (!isl_dim_match(map->dim, isl_dim_param, set->dim, isl_dim_param))
5816 isl_die(set->ctx, isl_error_invalid,
5817 "parameters don't match", goto error);
5819 if (isl_dim_size(set->dim, isl_dim_set) != 0 &&
5820 !isl_map_compatible_range(map, set))
5821 isl_die(set->ctx, isl_error_invalid,
5822 "incompatible spaces", goto error);
5824 if (isl_set_plain_is_universe(set)) {
5829 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT) &&
5830 ISL_F_ISSET(set, ISL_MAP_DISJOINT))
5831 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
5833 result = isl_map_alloc_dim(isl_dim_copy(map->dim),
5834 map->n * set->n, flags);
5837 for (i = 0; i < map->n; ++i)
5838 for (j = 0; j < set->n; ++j) {
5839 result = isl_map_add_basic_map(result,
5840 isl_basic_map_intersect_range(
5841 isl_basic_map_copy(map->p[i]),
5842 isl_basic_set_copy(set->p[j])));
5855 __isl_give isl_map *isl_map_intersect_range(__isl_take isl_map *map,
5856 __isl_take isl_set *set)
5858 return isl_map_align_params_map_map_and(map, set, &map_intersect_range);
5861 struct isl_map *isl_map_intersect_domain(
5862 struct isl_map *map, struct isl_set *set)
5864 return isl_map_reverse(
5865 isl_map_intersect_range(isl_map_reverse(map), set));
5868 static __isl_give isl_map *map_apply_domain(__isl_take isl_map *map1,
5869 __isl_take isl_map *map2)
5873 map1 = isl_map_reverse(map1);
5874 map1 = isl_map_apply_range(map1, map2);
5875 return isl_map_reverse(map1);
5882 __isl_give isl_map *isl_map_apply_domain(__isl_take isl_map *map1,
5883 __isl_take isl_map *map2)
5885 return isl_map_align_params_map_map_and(map1, map2, &map_apply_domain);
5888 static __isl_give isl_map *map_apply_range(__isl_take isl_map *map1,
5889 __isl_take isl_map *map2)
5891 struct isl_dim *dim_result;
5892 struct isl_map *result;
5898 dim_result = isl_dim_join(isl_dim_copy(map1->dim),
5899 isl_dim_copy(map2->dim));
5901 result = isl_map_alloc_dim(dim_result, map1->n * map2->n, 0);
5904 for (i = 0; i < map1->n; ++i)
5905 for (j = 0; j < map2->n; ++j) {
5906 result = isl_map_add_basic_map(result,
5907 isl_basic_map_apply_range(
5908 isl_basic_map_copy(map1->p[i]),
5909 isl_basic_map_copy(map2->p[j])));
5915 if (result && result->n <= 1)
5916 ISL_F_SET(result, ISL_MAP_DISJOINT);
5924 __isl_give isl_map *isl_map_apply_range(__isl_take isl_map *map1,
5925 __isl_take isl_map *map2)
5927 return isl_map_align_params_map_map_and(map1, map2, &map_apply_range);
5931 * returns range - domain
5933 struct isl_basic_set *isl_basic_map_deltas(struct isl_basic_map *bmap)
5935 isl_dim *dims, *target_dim;
5936 struct isl_basic_set *bset;
5943 isl_assert(bmap->ctx, isl_dim_tuple_match(bmap->dim, isl_dim_in,
5944 bmap->dim, isl_dim_out),
5946 target_dim = isl_dim_domain(isl_basic_map_get_dim(bmap));
5947 dim = isl_basic_map_n_in(bmap);
5948 nparam = isl_basic_map_n_param(bmap);
5949 bset = isl_basic_set_from_basic_map(bmap);
5950 bset = isl_basic_set_cow(bset);
5951 dims = isl_basic_set_get_dim(bset);
5952 dims = isl_dim_add(dims, isl_dim_set, dim);
5953 bset = isl_basic_set_extend_dim(bset, dims, 0, dim, 0);
5954 bset = isl_basic_set_swap_vars(bset, 2*dim);
5955 for (i = 0; i < dim; ++i) {
5956 int j = isl_basic_map_alloc_equality(
5957 (struct isl_basic_map *)bset);
5960 isl_seq_clr(bset->eq[j], 1 + isl_basic_set_total_dim(bset));
5961 isl_int_set_si(bset->eq[j][1+nparam+i], 1);
5962 isl_int_set_si(bset->eq[j][1+nparam+dim+i], 1);
5963 isl_int_set_si(bset->eq[j][1+nparam+2*dim+i], -1);
5965 bset = isl_basic_set_project_out(bset, isl_dim_set, dim, 2*dim);
5966 bset = isl_basic_set_reset_dim(bset, target_dim);
5969 isl_basic_map_free(bmap);
5974 * returns range - domain
5976 struct isl_set *isl_map_deltas(struct isl_map *map)
5980 struct isl_set *result;
5985 isl_assert(map->ctx, isl_dim_tuple_match(map->dim, isl_dim_in,
5986 map->dim, isl_dim_out),
5988 dim = isl_map_get_dim(map);
5989 dim = isl_dim_domain(dim);
5990 result = isl_set_alloc_dim(dim, map->n, 0);
5993 for (i = 0; i < map->n; ++i)
5994 result = isl_set_add_basic_set(result,
5995 isl_basic_map_deltas(isl_basic_map_copy(map->p[i])));
6004 * returns [domain -> range] -> range - domain
6006 __isl_give isl_basic_map *isl_basic_map_deltas_map(
6007 __isl_take isl_basic_map *bmap)
6011 isl_basic_map *domain;
6015 if (!isl_dim_tuple_match(bmap->dim, isl_dim_in, bmap->dim, isl_dim_out))
6016 isl_die(bmap->ctx, isl_error_invalid,
6017 "domain and range don't match", goto error);
6019 nparam = isl_basic_map_dim(bmap, isl_dim_param);
6020 n = isl_basic_map_dim(bmap, isl_dim_in);
6022 dim = isl_dim_from_range(isl_dim_domain(isl_basic_map_get_dim(bmap)));
6023 domain = isl_basic_map_universe(dim);
6025 bmap = isl_basic_map_from_domain(isl_basic_map_wrap(bmap));
6026 bmap = isl_basic_map_apply_range(bmap, domain);
6027 bmap = isl_basic_map_extend_constraints(bmap, n, 0);
6029 total = isl_basic_map_total_dim(bmap);
6031 for (i = 0; i < n; ++i) {
6032 k = isl_basic_map_alloc_equality(bmap);
6035 isl_seq_clr(bmap->eq[k], 1 + total);
6036 isl_int_set_si(bmap->eq[k][1 + nparam + i], 1);
6037 isl_int_set_si(bmap->eq[k][1 + nparam + n + i], -1);
6038 isl_int_set_si(bmap->eq[k][1 + nparam + n + n + i], 1);
6041 bmap = isl_basic_map_gauss(bmap, NULL);
6042 return isl_basic_map_finalize(bmap);
6044 isl_basic_map_free(bmap);
6049 * returns [domain -> range] -> range - domain
6051 __isl_give isl_map *isl_map_deltas_map(__isl_take isl_map *map)
6054 isl_dim *domain_dim;
6059 if (!isl_dim_tuple_match(map->dim, isl_dim_in, map->dim, isl_dim_out))
6060 isl_die(map->ctx, isl_error_invalid,
6061 "domain and range don't match", goto error);
6063 map = isl_map_cow(map);
6067 domain_dim = isl_dim_from_range(isl_dim_domain(isl_map_get_dim(map)));
6068 map->dim = isl_dim_from_domain(isl_dim_wrap(map->dim));
6069 map->dim = isl_dim_join(map->dim, domain_dim);
6072 for (i = 0; i < map->n; ++i) {
6073 map->p[i] = isl_basic_map_deltas_map(map->p[i]);
6077 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
6084 static struct isl_basic_map *basic_map_identity(struct isl_dim *dims)
6086 struct isl_basic_map *bmap;
6094 nparam = dims->nparam;
6096 bmap = isl_basic_map_alloc_dim(dims, 0, dim, 0);
6100 for (i = 0; i < dim; ++i) {
6101 int j = isl_basic_map_alloc_equality(bmap);
6104 isl_seq_clr(bmap->eq[j], 1 + isl_basic_map_total_dim(bmap));
6105 isl_int_set_si(bmap->eq[j][1+nparam+i], 1);
6106 isl_int_set_si(bmap->eq[j][1+nparam+dim+i], -1);
6108 return isl_basic_map_finalize(bmap);
6110 isl_basic_map_free(bmap);
6114 __isl_give isl_basic_map *isl_basic_map_identity(__isl_take isl_dim *dim)
6118 if (dim->n_in != dim->n_out)
6119 isl_die(dim->ctx, isl_error_invalid,
6120 "number of input and output dimensions needs to be "
6121 "the same", goto error);
6122 return basic_map_identity(dim);
6128 struct isl_basic_map *isl_basic_map_identity_like(struct isl_basic_map *model)
6130 if (!model || !model->dim)
6132 return isl_basic_map_identity(isl_dim_copy(model->dim));
6135 __isl_give isl_map *isl_map_identity(__isl_take isl_dim *dim)
6137 return isl_map_from_basic_map(isl_basic_map_identity(dim));
6140 struct isl_map *isl_map_identity_like(struct isl_map *model)
6142 if (!model || !model->dim)
6144 return isl_map_identity(isl_dim_copy(model->dim));
6147 struct isl_map *isl_map_identity_like_basic_map(struct isl_basic_map *model)
6149 if (!model || !model->dim)
6151 return isl_map_identity(isl_dim_copy(model->dim));
6154 __isl_give isl_map *isl_set_identity(__isl_take isl_set *set)
6156 isl_dim *dim = isl_set_get_dim(set);
6158 id = isl_map_identity(isl_dim_map_from_set(dim));
6159 return isl_map_intersect_range(id, set);
6162 /* Construct a basic set with all set dimensions having only non-negative
6165 struct isl_basic_set *isl_basic_set_positive_orthant(struct isl_dim *dims)
6170 struct isl_basic_set *bset;
6174 nparam = dims->nparam;
6176 bset = isl_basic_set_alloc_dim(dims, 0, 0, dim);
6179 for (i = 0; i < dim; ++i) {
6180 int k = isl_basic_set_alloc_inequality(bset);
6183 isl_seq_clr(bset->ineq[k], 1 + isl_basic_set_total_dim(bset));
6184 isl_int_set_si(bset->ineq[k][1 + nparam + i], 1);
6188 isl_basic_set_free(bset);
6192 /* Construct the half-space x_pos >= 0.
6194 static __isl_give isl_basic_set *nonneg_halfspace(__isl_take isl_dim *dim,
6198 isl_basic_set *nonneg;
6200 nonneg = isl_basic_set_alloc_dim(dim, 0, 0, 1);
6201 k = isl_basic_set_alloc_inequality(nonneg);
6204 isl_seq_clr(nonneg->ineq[k], 1 + isl_basic_set_total_dim(nonneg));
6205 isl_int_set_si(nonneg->ineq[k][pos], 1);
6207 return isl_basic_set_finalize(nonneg);
6209 isl_basic_set_free(nonneg);
6213 /* Construct the half-space x_pos <= -1.
6215 static __isl_give isl_basic_set *neg_halfspace(__isl_take isl_dim *dim, int pos)
6220 neg = isl_basic_set_alloc_dim(dim, 0, 0, 1);
6221 k = isl_basic_set_alloc_inequality(neg);
6224 isl_seq_clr(neg->ineq[k], 1 + isl_basic_set_total_dim(neg));
6225 isl_int_set_si(neg->ineq[k][0], -1);
6226 isl_int_set_si(neg->ineq[k][pos], -1);
6228 return isl_basic_set_finalize(neg);
6230 isl_basic_set_free(neg);
6234 __isl_give isl_set *isl_set_split_dims(__isl_take isl_set *set,
6235 enum isl_dim_type type, unsigned first, unsigned n)
6238 isl_basic_set *nonneg;
6246 isl_assert(set->ctx, first + n <= isl_set_dim(set, type), goto error);
6248 for (i = 0; i < n; ++i) {
6249 nonneg = nonneg_halfspace(isl_set_get_dim(set),
6250 pos(set->dim, type) + first + i);
6251 neg = neg_halfspace(isl_set_get_dim(set),
6252 pos(set->dim, type) + first + i);
6254 set = isl_set_intersect(set, isl_basic_set_union(nonneg, neg));
6263 static int foreach_orthant(__isl_take isl_set *set, int *signs, int first,
6264 int len, int (*fn)(__isl_take isl_set *orthant, int *signs, void *user),
6271 if (isl_set_plain_is_empty(set)) {
6276 return fn(set, signs, user);
6279 half = isl_set_from_basic_set(nonneg_halfspace(isl_set_get_dim(set),
6281 half = isl_set_intersect(half, isl_set_copy(set));
6282 if (foreach_orthant(half, signs, first + 1, len, fn, user) < 0)
6286 half = isl_set_from_basic_set(neg_halfspace(isl_set_get_dim(set),
6288 half = isl_set_intersect(half, set);
6289 return foreach_orthant(half, signs, first + 1, len, fn, user);
6295 /* Call "fn" on the intersections of "set" with each of the orthants
6296 * (except for obviously empty intersections). The orthant is identified
6297 * by the signs array, with each entry having value 1 or -1 according
6298 * to the sign of the corresponding variable.
6300 int isl_set_foreach_orthant(__isl_keep isl_set *set,
6301 int (*fn)(__isl_take isl_set *orthant, int *signs, void *user),
6311 if (isl_set_plain_is_empty(set))
6314 nparam = isl_set_dim(set, isl_dim_param);
6315 nvar = isl_set_dim(set, isl_dim_set);
6317 signs = isl_alloc_array(set->ctx, int, nparam + nvar);
6319 r = foreach_orthant(isl_set_copy(set), signs, 0, nparam + nvar,
6327 int isl_set_is_equal(struct isl_set *set1, struct isl_set *set2)
6329 return isl_map_is_equal((struct isl_map *)set1, (struct isl_map *)set2);
6332 int isl_basic_map_is_subset(
6333 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
6336 struct isl_map *map1;
6337 struct isl_map *map2;
6339 if (!bmap1 || !bmap2)
6342 map1 = isl_map_from_basic_map(isl_basic_map_copy(bmap1));
6343 map2 = isl_map_from_basic_map(isl_basic_map_copy(bmap2));
6345 is_subset = isl_map_is_subset(map1, map2);
6353 int isl_basic_map_is_equal(
6354 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
6358 if (!bmap1 || !bmap2)
6360 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
6363 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
6367 int isl_basic_set_is_equal(
6368 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
6370 return isl_basic_map_is_equal(
6371 (struct isl_basic_map *)bset1, (struct isl_basic_map *)bset2);
6374 int isl_map_is_empty(struct isl_map *map)
6381 for (i = 0; i < map->n; ++i) {
6382 is_empty = isl_basic_map_is_empty(map->p[i]);
6391 int isl_map_plain_is_empty(__isl_keep isl_map *map)
6393 return map ? map->n == 0 : -1;
6396 int isl_map_fast_is_empty(__isl_keep isl_map *map)
6398 return isl_map_plain_is_empty(map);
6401 int isl_set_plain_is_empty(struct isl_set *set)
6403 return set ? set->n == 0 : -1;
6406 int isl_set_fast_is_empty(__isl_keep isl_set *set)
6408 return isl_set_plain_is_empty(set);
6411 int isl_set_is_empty(struct isl_set *set)
6413 return isl_map_is_empty((struct isl_map *)set);
6416 int isl_map_has_equal_dim(__isl_keep isl_map *map1, __isl_keep isl_map *map2)
6421 return isl_dim_equal(map1->dim, map2->dim);
6424 int isl_set_has_equal_dim(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
6429 return isl_dim_equal(set1->dim, set2->dim);
6432 static int map_is_equal(__isl_keep isl_map *map1, __isl_keep isl_map *map2)
6438 is_subset = isl_map_is_subset(map1, map2);
6441 is_subset = isl_map_is_subset(map2, map1);
6445 int isl_map_is_equal(__isl_keep isl_map *map1, __isl_keep isl_map *map2)
6447 return align_params_map_map_and_test(map1, map2, &map_is_equal);
6450 int isl_basic_map_is_strict_subset(
6451 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
6455 if (!bmap1 || !bmap2)
6457 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
6460 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
6461 if (is_subset == -1)
6466 int isl_map_is_strict_subset(struct isl_map *map1, struct isl_map *map2)
6472 is_subset = isl_map_is_subset(map1, map2);
6475 is_subset = isl_map_is_subset(map2, map1);
6476 if (is_subset == -1)
6481 int isl_set_is_strict_subset(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
6483 return isl_map_is_strict_subset((isl_map *)set1, (isl_map *)set2);
6486 int isl_basic_map_is_universe(struct isl_basic_map *bmap)
6490 return bmap->n_eq == 0 && bmap->n_ineq == 0;
6493 int isl_basic_set_is_universe(struct isl_basic_set *bset)
6497 return bset->n_eq == 0 && bset->n_ineq == 0;
6500 int isl_map_plain_is_universe(__isl_keep isl_map *map)
6507 for (i = 0; i < map->n; ++i) {
6508 int r = isl_basic_map_is_universe(map->p[i]);
6516 int isl_set_plain_is_universe(__isl_keep isl_set *set)
6518 return isl_map_plain_is_universe((isl_map *) set);
6521 int isl_set_fast_is_universe(__isl_keep isl_set *set)
6523 return isl_set_plain_is_universe(set);
6526 int isl_basic_map_is_empty(struct isl_basic_map *bmap)
6528 struct isl_basic_set *bset = NULL;
6529 struct isl_vec *sample = NULL;
6536 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY))
6539 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL)) {
6540 struct isl_basic_map *copy = isl_basic_map_copy(bmap);
6541 copy = isl_basic_map_remove_redundancies(copy);
6542 empty = ISL_F_ISSET(copy, ISL_BASIC_MAP_EMPTY);
6543 isl_basic_map_free(copy);
6547 total = 1 + isl_basic_map_total_dim(bmap);
6548 if (bmap->sample && bmap->sample->size == total) {
6549 int contains = isl_basic_map_contains(bmap, bmap->sample);
6555 isl_vec_free(bmap->sample);
6556 bmap->sample = NULL;
6557 bset = isl_basic_map_underlying_set(isl_basic_map_copy(bmap));
6560 sample = isl_basic_set_sample_vec(bset);
6563 empty = sample->size == 0;
6564 isl_vec_free(bmap->sample);
6565 bmap->sample = sample;
6567 ISL_F_SET(bmap, ISL_BASIC_MAP_EMPTY);
6572 int isl_basic_map_plain_is_empty(__isl_keep isl_basic_map *bmap)
6576 return ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY);
6579 int isl_basic_map_fast_is_empty(__isl_keep isl_basic_map *bmap)
6581 return isl_basic_map_plain_is_empty(bmap);
6584 int isl_basic_set_plain_is_empty(__isl_keep isl_basic_set *bset)
6588 return ISL_F_ISSET(bset, ISL_BASIC_SET_EMPTY);
6591 int isl_basic_set_fast_is_empty(__isl_keep isl_basic_set *bset)
6593 return isl_basic_set_plain_is_empty(bset);
6596 int isl_basic_set_is_empty(struct isl_basic_set *bset)
6598 return isl_basic_map_is_empty((struct isl_basic_map *)bset);
6601 struct isl_map *isl_basic_map_union(
6602 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
6604 struct isl_map *map;
6605 if (!bmap1 || !bmap2)
6608 isl_assert(bmap1->ctx, isl_dim_equal(bmap1->dim, bmap2->dim), goto error);
6610 map = isl_map_alloc_dim(isl_dim_copy(bmap1->dim), 2, 0);
6613 map = isl_map_add_basic_map(map, bmap1);
6614 map = isl_map_add_basic_map(map, bmap2);
6617 isl_basic_map_free(bmap1);
6618 isl_basic_map_free(bmap2);
6622 struct isl_set *isl_basic_set_union(
6623 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
6625 return (struct isl_set *)isl_basic_map_union(
6626 (struct isl_basic_map *)bset1,
6627 (struct isl_basic_map *)bset2);
6630 /* Order divs such that any div only depends on previous divs */
6631 struct isl_basic_map *isl_basic_map_order_divs(struct isl_basic_map *bmap)
6639 off = isl_dim_total(bmap->dim);
6641 for (i = 0; i < bmap->n_div; ++i) {
6643 if (isl_int_is_zero(bmap->div[i][0]))
6645 pos = isl_seq_first_non_zero(bmap->div[i]+1+1+off+i,
6649 isl_basic_map_swap_div(bmap, i, i + pos);
6655 struct isl_basic_set *isl_basic_set_order_divs(struct isl_basic_set *bset)
6657 return (struct isl_basic_set *)
6658 isl_basic_map_order_divs((struct isl_basic_map *)bset);
6661 __isl_give isl_map *isl_map_order_divs(__isl_take isl_map *map)
6668 for (i = 0; i < map->n; ++i) {
6669 map->p[i] = isl_basic_map_order_divs(map->p[i]);
6680 /* Apply the expansion computed by isl_merge_divs.
6681 * The expansion itself is given by "exp" while the resulting
6682 * list of divs is given by "div".
6684 __isl_give isl_basic_set *isl_basic_set_expand_divs(
6685 __isl_take isl_basic_set *bset, __isl_take isl_mat *div, int *exp)
6690 bset = isl_basic_set_cow(bset);
6694 if (div->n_row < bset->n_div)
6695 isl_die(isl_mat_get_ctx(div), isl_error_invalid,
6696 "not an expansion", goto error);
6698 bset = isl_basic_map_extend_dim(bset, isl_dim_copy(bset->dim),
6699 div->n_row - bset->n_div, 0,
6700 2 * (div->n_row - bset->n_div));
6702 n_div = bset->n_div;
6703 for (i = n_div; i < div->n_row; ++i)
6704 if (isl_basic_set_alloc_div(bset) < 0)
6708 for (i = div->n_row - 1; i >= 0; --i) {
6709 if (j >= 0 && exp[j] == i) {
6711 isl_basic_map_swap_div(bset, i, j);
6714 isl_seq_cpy(bset->div[i], div->row[i], div->n_col);
6715 if (isl_basic_map_add_div_constraints(bset, i) < 0)
6723 isl_basic_set_free(bset);
6728 /* Look for a div in dst that corresponds to the div "div" in src.
6729 * The divs before "div" in src and dst are assumed to be the same.
6731 * Returns -1 if no corresponding div was found and the position
6732 * of the corresponding div in dst otherwise.
6734 static int find_div(struct isl_basic_map *dst,
6735 struct isl_basic_map *src, unsigned div)
6739 unsigned total = isl_dim_total(src->dim);
6741 isl_assert(dst->ctx, div <= dst->n_div, return -1);
6742 for (i = div; i < dst->n_div; ++i)
6743 if (isl_seq_eq(dst->div[i], src->div[div], 1+1+total+div) &&
6744 isl_seq_first_non_zero(dst->div[i]+1+1+total+div,
6745 dst->n_div - div) == -1)
6750 struct isl_basic_map *isl_basic_map_align_divs(
6751 struct isl_basic_map *dst, struct isl_basic_map *src)
6754 unsigned total = isl_dim_total(src->dim);
6759 if (src->n_div == 0)
6762 for (i = 0; i < src->n_div; ++i)
6763 isl_assert(src->ctx, !isl_int_is_zero(src->div[i][0]), goto error);
6765 src = isl_basic_map_order_divs(src);
6766 dst = isl_basic_map_cow(dst);
6767 dst = isl_basic_map_extend_dim(dst, isl_dim_copy(dst->dim),
6768 src->n_div, 0, 2 * src->n_div);
6771 for (i = 0; i < src->n_div; ++i) {
6772 int j = find_div(dst, src, i);
6774 j = isl_basic_map_alloc_div(dst);
6777 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total+i);
6778 isl_seq_clr(dst->div[j]+1+1+total+i, dst->n_div - i);
6779 if (isl_basic_map_add_div_constraints(dst, j) < 0)
6783 isl_basic_map_swap_div(dst, i, j);
6787 isl_basic_map_free(dst);
6791 struct isl_basic_set *isl_basic_set_align_divs(
6792 struct isl_basic_set *dst, struct isl_basic_set *src)
6794 return (struct isl_basic_set *)isl_basic_map_align_divs(
6795 (struct isl_basic_map *)dst, (struct isl_basic_map *)src);
6798 struct isl_map *isl_map_align_divs(struct isl_map *map)
6806 map = isl_map_compute_divs(map);
6807 map = isl_map_cow(map);
6811 for (i = 1; i < map->n; ++i)
6812 map->p[0] = isl_basic_map_align_divs(map->p[0], map->p[i]);
6813 for (i = 1; i < map->n; ++i)
6814 map->p[i] = isl_basic_map_align_divs(map->p[i], map->p[0]);
6816 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
6820 struct isl_set *isl_set_align_divs(struct isl_set *set)
6822 return (struct isl_set *)isl_map_align_divs((struct isl_map *)set);
6825 static __isl_give isl_set *set_apply( __isl_take isl_set *set,
6826 __isl_take isl_map *map)
6830 isl_assert(set->ctx, isl_map_compatible_domain(map, set), goto error);
6831 map = isl_map_intersect_domain(map, set);
6832 set = isl_map_range(map);
6840 __isl_give isl_set *isl_set_apply( __isl_take isl_set *set,
6841 __isl_take isl_map *map)
6843 return isl_map_align_params_map_map_and(set, map, &set_apply);
6846 /* There is no need to cow as removing empty parts doesn't change
6847 * the meaning of the set.
6849 struct isl_map *isl_map_remove_empty_parts(struct isl_map *map)
6856 for (i = map->n-1; i >= 0; --i) {
6857 if (!ISL_F_ISSET(map->p[i], ISL_BASIC_MAP_EMPTY))
6859 isl_basic_map_free(map->p[i]);
6860 if (i != map->n-1) {
6861 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
6862 map->p[i] = map->p[map->n-1];
6870 struct isl_set *isl_set_remove_empty_parts(struct isl_set *set)
6872 return (struct isl_set *)
6873 isl_map_remove_empty_parts((struct isl_map *)set);
6876 struct isl_basic_map *isl_map_copy_basic_map(struct isl_map *map)
6878 struct isl_basic_map *bmap;
6879 if (!map || map->n == 0)
6881 bmap = map->p[map->n-1];
6882 isl_assert(map->ctx, ISL_F_ISSET(bmap, ISL_BASIC_SET_FINAL), return NULL);
6883 return isl_basic_map_copy(bmap);
6886 struct isl_basic_set *isl_set_copy_basic_set(struct isl_set *set)
6888 return (struct isl_basic_set *)
6889 isl_map_copy_basic_map((struct isl_map *)set);
6892 __isl_give isl_map *isl_map_drop_basic_map(__isl_take isl_map *map,
6893 __isl_keep isl_basic_map *bmap)
6899 for (i = map->n-1; i >= 0; --i) {
6900 if (map->p[i] != bmap)
6902 map = isl_map_cow(map);
6905 isl_basic_map_free(map->p[i]);
6906 if (i != map->n-1) {
6907 ISL_F_CLR(map, ISL_SET_NORMALIZED);
6908 map->p[i] = map->p[map->n-1];
6919 struct isl_set *isl_set_drop_basic_set(struct isl_set *set,
6920 struct isl_basic_set *bset)
6922 return (struct isl_set *)isl_map_drop_basic_map((struct isl_map *)set,
6923 (struct isl_basic_map *)bset);
6926 /* Given two basic sets bset1 and bset2, compute the maximal difference
6927 * between the values of dimension pos in bset1 and those in bset2
6928 * for any common value of the parameters and dimensions preceding pos.
6930 static enum isl_lp_result basic_set_maximal_difference_at(
6931 __isl_keep isl_basic_set *bset1, __isl_keep isl_basic_set *bset2,
6932 int pos, isl_int *opt)
6934 struct isl_dim *dims;
6935 struct isl_basic_map *bmap1 = NULL;
6936 struct isl_basic_map *bmap2 = NULL;
6937 struct isl_ctx *ctx;
6938 struct isl_vec *obj;
6941 unsigned dim1, dim2;
6942 enum isl_lp_result res;
6944 if (!bset1 || !bset2)
6945 return isl_lp_error;
6947 nparam = isl_basic_set_n_param(bset1);
6948 dim1 = isl_basic_set_n_dim(bset1);
6949 dim2 = isl_basic_set_n_dim(bset2);
6950 dims = isl_dim_alloc(bset1->ctx, nparam, pos, dim1 - pos);
6951 bmap1 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset1), dims);
6952 dims = isl_dim_alloc(bset2->ctx, nparam, pos, dim2 - pos);
6953 bmap2 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset2), dims);
6954 if (!bmap1 || !bmap2)
6956 bmap1 = isl_basic_map_cow(bmap1);
6957 bmap1 = isl_basic_map_extend(bmap1, nparam,
6958 pos, (dim1 - pos) + (dim2 - pos),
6959 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
6960 bmap1 = add_constraints(bmap1, bmap2, 0, dim1 - pos);
6963 total = isl_basic_map_total_dim(bmap1);
6965 obj = isl_vec_alloc(ctx, 1 + total);
6966 isl_seq_clr(obj->block.data, 1 + total);
6967 isl_int_set_si(obj->block.data[1+nparam+pos], 1);
6968 isl_int_set_si(obj->block.data[1+nparam+pos+(dim1-pos)], -1);
6971 res = isl_basic_map_solve_lp(bmap1, 1, obj->block.data, ctx->one,
6973 isl_basic_map_free(bmap1);
6977 isl_basic_map_free(bmap1);
6978 isl_basic_map_free(bmap2);
6979 return isl_lp_error;
6982 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
6983 * for any common value of the parameters and dimensions preceding pos
6984 * in both basic sets, the values of dimension pos in bset1 are
6985 * smaller or larger than those in bset2.
6988 * 1 if bset1 follows bset2
6989 * -1 if bset1 precedes bset2
6990 * 0 if bset1 and bset2 are incomparable
6991 * -2 if some error occurred.
6993 int isl_basic_set_compare_at(struct isl_basic_set *bset1,
6994 struct isl_basic_set *bset2, int pos)
6997 enum isl_lp_result res;
7002 res = basic_set_maximal_difference_at(bset1, bset2, pos, &opt);
7004 if (res == isl_lp_empty)
7006 else if ((res == isl_lp_ok && isl_int_is_pos(opt)) ||
7007 res == isl_lp_unbounded)
7009 else if (res == isl_lp_ok && isl_int_is_neg(opt))
7018 /* Given two basic sets bset1 and bset2, check whether
7019 * for any common value of the parameters and dimensions preceding pos
7020 * there is a value of dimension pos in bset1 that is larger
7021 * than a value of the same dimension in bset2.
7024 * 1 if there exists such a pair
7025 * 0 if there is no such pair, but there is a pair of equal values
7027 * -2 if some error occurred.
7029 int isl_basic_set_follows_at(__isl_keep isl_basic_set *bset1,
7030 __isl_keep isl_basic_set *bset2, int pos)
7033 enum isl_lp_result res;
7038 res = basic_set_maximal_difference_at(bset1, bset2, pos, &opt);
7040 if (res == isl_lp_empty)
7042 else if ((res == isl_lp_ok && isl_int_is_pos(opt)) ||
7043 res == isl_lp_unbounded)
7045 else if (res == isl_lp_ok && isl_int_is_neg(opt))
7047 else if (res == isl_lp_ok)
7056 /* Given two sets set1 and set2, check whether
7057 * for any common value of the parameters and dimensions preceding pos
7058 * there is a value of dimension pos in set1 that is larger
7059 * than a value of the same dimension in set2.
7062 * 1 if there exists such a pair
7063 * 0 if there is no such pair, but there is a pair of equal values
7065 * -2 if some error occurred.
7067 int isl_set_follows_at(__isl_keep isl_set *set1,
7068 __isl_keep isl_set *set2, int pos)
7076 for (i = 0; i < set1->n; ++i)
7077 for (j = 0; j < set2->n; ++j) {
7079 f = isl_basic_set_follows_at(set1->p[i], set2->p[j], pos);
7080 if (f == 1 || f == -2)
7089 static int isl_basic_map_plain_has_fixed_var(__isl_keep isl_basic_map *bmap,
7090 unsigned pos, isl_int *val)
7098 total = isl_basic_map_total_dim(bmap);
7099 for (i = 0, d = total-1; i < bmap->n_eq && d+1 > pos; ++i) {
7100 for (; d+1 > pos; --d)
7101 if (!isl_int_is_zero(bmap->eq[i][1+d]))
7105 if (isl_seq_first_non_zero(bmap->eq[i]+1, d) != -1)
7107 if (isl_seq_first_non_zero(bmap->eq[i]+1+d+1, total-d-1) != -1)
7109 if (!isl_int_is_one(bmap->eq[i][1+d]))
7112 isl_int_neg(*val, bmap->eq[i][0]);
7118 static int isl_map_plain_has_fixed_var(__isl_keep isl_map *map,
7119 unsigned pos, isl_int *val)
7131 return isl_basic_map_plain_has_fixed_var(map->p[0], pos, val);
7134 fixed = isl_basic_map_plain_has_fixed_var(map->p[0], pos, &v);
7135 for (i = 1; fixed == 1 && i < map->n; ++i) {
7136 fixed = isl_basic_map_plain_has_fixed_var(map->p[i], pos, &tmp);
7137 if (fixed == 1 && isl_int_ne(tmp, v))
7141 isl_int_set(*val, v);
7147 static int isl_basic_set_plain_has_fixed_var(__isl_keep isl_basic_set *bset,
7148 unsigned pos, isl_int *val)
7150 return isl_basic_map_plain_has_fixed_var((struct isl_basic_map *)bset,
7154 static int isl_set_plain_has_fixed_var(__isl_keep isl_set *set, unsigned pos,
7157 return isl_map_plain_has_fixed_var((struct isl_map *)set, pos, val);
7160 int isl_basic_map_plain_is_fixed(__isl_keep isl_basic_map *bmap,
7161 enum isl_dim_type type, unsigned pos, isl_int *val)
7163 if (pos >= isl_basic_map_dim(bmap, type))
7165 return isl_basic_map_plain_has_fixed_var(bmap,
7166 isl_basic_map_offset(bmap, type) - 1 + pos, val);
7169 int isl_map_plain_is_fixed(__isl_keep isl_map *map,
7170 enum isl_dim_type type, unsigned pos, isl_int *val)
7172 if (pos >= isl_map_dim(map, type))
7174 return isl_map_plain_has_fixed_var(map,
7175 map_offset(map, type) - 1 + pos, val);
7178 int isl_map_fast_is_fixed(__isl_keep isl_map *map,
7179 enum isl_dim_type type, unsigned pos, isl_int *val)
7181 return isl_map_plain_is_fixed(map, type, pos, val);
7184 /* Check if dimension dim has fixed value and if so and if val is not NULL,
7185 * then return this fixed value in *val.
7187 int isl_basic_set_plain_dim_is_fixed(__isl_keep isl_basic_set *bset,
7188 unsigned dim, isl_int *val)
7190 return isl_basic_set_plain_has_fixed_var(bset,
7191 isl_basic_set_n_param(bset) + dim, val);
7194 /* Check if dimension dim has fixed value and if so and if val is not NULL,
7195 * then return this fixed value in *val.
7197 int isl_set_plain_dim_is_fixed(__isl_keep isl_set *set,
7198 unsigned dim, isl_int *val)
7200 return isl_set_plain_has_fixed_var(set, isl_set_n_param(set) + dim, val);
7203 int isl_set_fast_dim_is_fixed(__isl_keep isl_set *set,
7204 unsigned dim, isl_int *val)
7206 return isl_set_plain_dim_is_fixed(set, dim, val);
7209 /* Check if input variable in has fixed value and if so and if val is not NULL,
7210 * then return this fixed value in *val.
7212 int isl_map_plain_input_is_fixed(__isl_keep isl_map *map,
7213 unsigned in, isl_int *val)
7215 return isl_map_plain_has_fixed_var(map, isl_map_n_param(map) + in, val);
7218 /* Check if dimension dim has an (obvious) fixed lower bound and if so
7219 * and if val is not NULL, then return this lower bound in *val.
7221 int isl_basic_set_plain_dim_has_fixed_lower_bound(
7222 __isl_keep isl_basic_set *bset, unsigned dim, isl_int *val)
7224 int i, i_eq = -1, i_ineq = -1;
7231 total = isl_basic_set_total_dim(bset);
7232 nparam = isl_basic_set_n_param(bset);
7233 for (i = 0; i < bset->n_eq; ++i) {
7234 if (isl_int_is_zero(bset->eq[i][1+nparam+dim]))
7240 for (i = 0; i < bset->n_ineq; ++i) {
7241 if (!isl_int_is_pos(bset->ineq[i][1+nparam+dim]))
7243 if (i_eq != -1 || i_ineq != -1)
7247 if (i_eq == -1 && i_ineq == -1)
7249 c = i_eq != -1 ? bset->eq[i_eq] : bset->ineq[i_ineq];
7250 /* The coefficient should always be one due to normalization. */
7251 if (!isl_int_is_one(c[1+nparam+dim]))
7253 if (isl_seq_first_non_zero(c+1, nparam+dim) != -1)
7255 if (isl_seq_first_non_zero(c+1+nparam+dim+1,
7256 total - nparam - dim - 1) != -1)
7259 isl_int_neg(*val, c[0]);
7263 int isl_set_plain_dim_has_fixed_lower_bound(__isl_keep isl_set *set,
7264 unsigned dim, isl_int *val)
7276 return isl_basic_set_plain_dim_has_fixed_lower_bound(set->p[0],
7280 fixed = isl_basic_set_plain_dim_has_fixed_lower_bound(set->p[0],
7282 for (i = 1; fixed == 1 && i < set->n; ++i) {
7283 fixed = isl_basic_set_plain_dim_has_fixed_lower_bound(set->p[i],
7285 if (fixed == 1 && isl_int_ne(tmp, v))
7289 isl_int_set(*val, v);
7300 /* uset_gist depends on constraints without existentially quantified
7301 * variables sorting first.
7303 static int qsort_constraint_cmp(const void *p1, const void *p2)
7305 const struct constraint *c1 = (const struct constraint *)p1;
7306 const struct constraint *c2 = (const struct constraint *)p2;
7308 unsigned size = isl_min(c1->size, c2->size);
7310 l1 = isl_seq_last_non_zero(c1->c, size);
7311 l2 = isl_seq_last_non_zero(c2->c, size);
7316 return isl_seq_cmp(c1->c, c2->c, size);
7319 static struct isl_basic_map *isl_basic_map_sort_constraints(
7320 struct isl_basic_map *bmap)
7323 struct constraint *c;
7328 total = isl_basic_map_total_dim(bmap);
7329 c = isl_alloc_array(bmap->ctx, struct constraint, bmap->n_ineq);
7332 for (i = 0; i < bmap->n_ineq; ++i) {
7334 c[i].c = bmap->ineq[i];
7336 qsort(c, bmap->n_ineq, sizeof(struct constraint), qsort_constraint_cmp);
7337 for (i = 0; i < bmap->n_ineq; ++i)
7338 bmap->ineq[i] = c[i].c;
7342 isl_basic_map_free(bmap);
7346 __isl_give isl_basic_set *isl_basic_set_sort_constraints(
7347 __isl_take isl_basic_set *bset)
7349 return (struct isl_basic_set *)isl_basic_map_sort_constraints(
7350 (struct isl_basic_map *)bset);
7353 struct isl_basic_map *isl_basic_map_normalize(struct isl_basic_map *bmap)
7357 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_NORMALIZED))
7359 bmap = isl_basic_map_remove_redundancies(bmap);
7360 bmap = isl_basic_map_sort_constraints(bmap);
7361 ISL_F_SET(bmap, ISL_BASIC_MAP_NORMALIZED);
7365 struct isl_basic_set *isl_basic_set_normalize(struct isl_basic_set *bset)
7367 return (struct isl_basic_set *)isl_basic_map_normalize(
7368 (struct isl_basic_map *)bset);
7371 int isl_basic_map_plain_cmp(const __isl_keep isl_basic_map *bmap1,
7372 const __isl_keep isl_basic_map *bmap2)
7379 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_RATIONAL) !=
7380 ISL_F_ISSET(bmap2, ISL_BASIC_MAP_RATIONAL))
7381 return ISL_F_ISSET(bmap1, ISL_BASIC_MAP_RATIONAL) ? -1 : 1;
7382 if (isl_basic_map_n_param(bmap1) != isl_basic_map_n_param(bmap2))
7383 return isl_basic_map_n_param(bmap1) - isl_basic_map_n_param(bmap2);
7384 if (isl_basic_map_n_in(bmap1) != isl_basic_map_n_in(bmap2))
7385 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
7386 if (isl_basic_map_n_out(bmap1) != isl_basic_map_n_out(bmap2))
7387 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
7388 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY) &&
7389 ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
7391 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY))
7393 if (ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
7395 if (bmap1->n_eq != bmap2->n_eq)
7396 return bmap1->n_eq - bmap2->n_eq;
7397 if (bmap1->n_ineq != bmap2->n_ineq)
7398 return bmap1->n_ineq - bmap2->n_ineq;
7399 if (bmap1->n_div != bmap2->n_div)
7400 return bmap1->n_div - bmap2->n_div;
7401 total = isl_basic_map_total_dim(bmap1);
7402 for (i = 0; i < bmap1->n_eq; ++i) {
7403 cmp = isl_seq_cmp(bmap1->eq[i], bmap2->eq[i], 1+total);
7407 for (i = 0; i < bmap1->n_ineq; ++i) {
7408 cmp = isl_seq_cmp(bmap1->ineq[i], bmap2->ineq[i], 1+total);
7412 for (i = 0; i < bmap1->n_div; ++i) {
7413 cmp = isl_seq_cmp(bmap1->div[i], bmap2->div[i], 1+1+total);
7420 int isl_basic_map_plain_is_equal(__isl_keep isl_basic_map *bmap1,
7421 __isl_keep isl_basic_map *bmap2)
7423 return isl_basic_map_plain_cmp(bmap1, bmap2) == 0;
7426 int isl_basic_set_plain_is_equal(__isl_keep isl_basic_set *bset1,
7427 __isl_keep isl_basic_set *bset2)
7429 return isl_basic_map_plain_is_equal((isl_basic_map *)bset1,
7430 (isl_basic_map *)bset2);
7433 static int qsort_bmap_cmp(const void *p1, const void *p2)
7435 const struct isl_basic_map *bmap1 = *(const struct isl_basic_map **)p1;
7436 const struct isl_basic_map *bmap2 = *(const struct isl_basic_map **)p2;
7438 return isl_basic_map_plain_cmp(bmap1, bmap2);
7441 /* We normalize in place, but if anything goes wrong we need
7442 * to return NULL, so we need to make sure we don't change the
7443 * meaning of any possible other copies of map.
7445 struct isl_map *isl_map_normalize(struct isl_map *map)
7448 struct isl_basic_map *bmap;
7452 if (ISL_F_ISSET(map, ISL_MAP_NORMALIZED))
7454 for (i = 0; i < map->n; ++i) {
7455 bmap = isl_basic_map_normalize(isl_basic_map_copy(map->p[i]));
7458 isl_basic_map_free(map->p[i]);
7461 qsort(map->p, map->n, sizeof(struct isl_basic_map *), qsort_bmap_cmp);
7462 ISL_F_SET(map, ISL_MAP_NORMALIZED);
7463 map = isl_map_remove_empty_parts(map);
7466 for (i = map->n - 1; i >= 1; --i) {
7467 if (!isl_basic_map_plain_is_equal(map->p[i-1], map->p[i]))
7469 isl_basic_map_free(map->p[i-1]);
7470 for (j = i; j < map->n; ++j)
7471 map->p[j-1] = map->p[j];
7481 struct isl_set *isl_set_normalize(struct isl_set *set)
7483 return (struct isl_set *)isl_map_normalize((struct isl_map *)set);
7486 int isl_map_plain_is_equal(__isl_keep isl_map *map1, __isl_keep isl_map *map2)
7496 if (!isl_dim_equal(map1->dim, map2->dim))
7499 map1 = isl_map_copy(map1);
7500 map2 = isl_map_copy(map2);
7501 map1 = isl_map_normalize(map1);
7502 map2 = isl_map_normalize(map2);
7505 equal = map1->n == map2->n;
7506 for (i = 0; equal && i < map1->n; ++i) {
7507 equal = isl_basic_map_plain_is_equal(map1->p[i], map2->p[i]);
7520 int isl_map_fast_is_equal(__isl_keep isl_map *map1, __isl_keep isl_map *map2)
7522 return isl_map_plain_is_equal(map1, map2);
7525 int isl_set_plain_is_equal(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
7527 return isl_map_plain_is_equal((struct isl_map *)set1,
7528 (struct isl_map *)set2);
7531 int isl_set_fast_is_equal(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
7533 return isl_set_plain_is_equal(set1, set2);
7536 /* Return an interval that ranges from min to max (inclusive)
7538 struct isl_basic_set *isl_basic_set_interval(struct isl_ctx *ctx,
7539 isl_int min, isl_int max)
7542 struct isl_basic_set *bset = NULL;
7544 bset = isl_basic_set_alloc(ctx, 0, 1, 0, 0, 2);
7548 k = isl_basic_set_alloc_inequality(bset);
7551 isl_int_set_si(bset->ineq[k][1], 1);
7552 isl_int_neg(bset->ineq[k][0], min);
7554 k = isl_basic_set_alloc_inequality(bset);
7557 isl_int_set_si(bset->ineq[k][1], -1);
7558 isl_int_set(bset->ineq[k][0], max);
7562 isl_basic_set_free(bset);
7566 /* Return the Cartesian product of the basic sets in list (in the given order).
7568 __isl_give isl_basic_set *isl_basic_set_list_product(
7569 __isl_take struct isl_basic_set_list *list)
7577 struct isl_basic_set *product = NULL;
7581 isl_assert(list->ctx, list->n > 0, goto error);
7582 isl_assert(list->ctx, list->p[0], goto error);
7583 nparam = isl_basic_set_n_param(list->p[0]);
7584 dim = isl_basic_set_n_dim(list->p[0]);
7585 extra = list->p[0]->n_div;
7586 n_eq = list->p[0]->n_eq;
7587 n_ineq = list->p[0]->n_ineq;
7588 for (i = 1; i < list->n; ++i) {
7589 isl_assert(list->ctx, list->p[i], goto error);
7590 isl_assert(list->ctx,
7591 nparam == isl_basic_set_n_param(list->p[i]), goto error);
7592 dim += isl_basic_set_n_dim(list->p[i]);
7593 extra += list->p[i]->n_div;
7594 n_eq += list->p[i]->n_eq;
7595 n_ineq += list->p[i]->n_ineq;
7597 product = isl_basic_set_alloc(list->ctx, nparam, dim, extra,
7602 for (i = 0; i < list->n; ++i) {
7603 isl_basic_set_add_constraints(product,
7604 isl_basic_set_copy(list->p[i]), dim);
7605 dim += isl_basic_set_n_dim(list->p[i]);
7607 isl_basic_set_list_free(list);
7610 isl_basic_set_free(product);
7611 isl_basic_set_list_free(list);
7615 struct isl_basic_map *isl_basic_map_product(
7616 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
7618 struct isl_dim *dim_result = NULL;
7619 struct isl_basic_map *bmap;
7620 unsigned in1, in2, out1, out2, nparam, total, pos;
7621 struct isl_dim_map *dim_map1, *dim_map2;
7623 if (!bmap1 || !bmap2)
7626 isl_assert(bmap1->ctx, isl_dim_match(bmap1->dim, isl_dim_param,
7627 bmap2->dim, isl_dim_param), goto error);
7628 dim_result = isl_dim_product(isl_dim_copy(bmap1->dim),
7629 isl_dim_copy(bmap2->dim));
7631 in1 = isl_basic_map_n_in(bmap1);
7632 in2 = isl_basic_map_n_in(bmap2);
7633 out1 = isl_basic_map_n_out(bmap1);
7634 out2 = isl_basic_map_n_out(bmap2);
7635 nparam = isl_basic_map_n_param(bmap1);
7637 total = nparam + in1 + in2 + out1 + out2 + bmap1->n_div + bmap2->n_div;
7638 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
7639 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
7640 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
7641 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
7642 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
7643 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos += in1);
7644 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += in2);
7645 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += out1);
7646 isl_dim_map_div(dim_map1, bmap1, pos += out2);
7647 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
7649 bmap = isl_basic_map_alloc_dim(dim_result,
7650 bmap1->n_div + bmap2->n_div,
7651 bmap1->n_eq + bmap2->n_eq,
7652 bmap1->n_ineq + bmap2->n_ineq);
7653 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap1, dim_map1);
7654 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap2, dim_map2);
7655 bmap = isl_basic_map_simplify(bmap);
7656 return isl_basic_map_finalize(bmap);
7658 isl_basic_map_free(bmap1);
7659 isl_basic_map_free(bmap2);
7663 __isl_give isl_basic_map *isl_basic_map_flat_product(
7664 __isl_take isl_basic_map *bmap1, __isl_take isl_basic_map *bmap2)
7666 isl_basic_map *prod;
7668 prod = isl_basic_map_product(bmap1, bmap2);
7669 prod = isl_basic_map_flatten(prod);
7673 __isl_give isl_basic_set *isl_basic_set_flat_product(
7674 __isl_take isl_basic_set *bset1, __isl_take isl_basic_set *bset2)
7676 return isl_basic_map_flat_product(bset1, bset2);
7679 __isl_give isl_basic_map *isl_basic_map_range_product(
7680 __isl_take isl_basic_map *bmap1, __isl_take isl_basic_map *bmap2)
7682 isl_dim *dim_result = NULL;
7683 isl_basic_map *bmap;
7684 unsigned in, out1, out2, nparam, total, pos;
7685 struct isl_dim_map *dim_map1, *dim_map2;
7687 if (!bmap1 || !bmap2)
7690 dim_result = isl_dim_range_product(isl_dim_copy(bmap1->dim),
7691 isl_dim_copy(bmap2->dim));
7693 in = isl_basic_map_dim(bmap1, isl_dim_in);
7694 out1 = isl_basic_map_n_out(bmap1);
7695 out2 = isl_basic_map_n_out(bmap2);
7696 nparam = isl_basic_map_n_param(bmap1);
7698 total = nparam + in + out1 + out2 + bmap1->n_div + bmap2->n_div;
7699 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
7700 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
7701 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
7702 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
7703 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
7704 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
7705 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += in);
7706 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += out1);
7707 isl_dim_map_div(dim_map1, bmap1, pos += out2);
7708 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
7710 bmap = isl_basic_map_alloc_dim(dim_result,
7711 bmap1->n_div + bmap2->n_div,
7712 bmap1->n_eq + bmap2->n_eq,
7713 bmap1->n_ineq + bmap2->n_ineq);
7714 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap1, dim_map1);
7715 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap2, dim_map2);
7716 bmap = isl_basic_map_simplify(bmap);
7717 return isl_basic_map_finalize(bmap);
7719 isl_basic_map_free(bmap1);
7720 isl_basic_map_free(bmap2);
7724 __isl_give isl_basic_map *isl_basic_map_flat_range_product(
7725 __isl_take isl_basic_map *bmap1, __isl_take isl_basic_map *bmap2)
7727 isl_basic_map *prod;
7729 prod = isl_basic_map_range_product(bmap1, bmap2);
7730 prod = isl_basic_map_flatten_range(prod);
7734 static __isl_give isl_map *map_product(__isl_take isl_map *map1,
7735 __isl_take isl_map *map2,
7736 __isl_give isl_dim *(*dim_product)(__isl_take isl_dim *left,
7737 __isl_take isl_dim *right),
7738 __isl_give isl_basic_map *(*basic_map_product)(
7739 __isl_take isl_basic_map *left, __isl_take isl_basic_map *right))
7742 struct isl_map *result;
7748 isl_assert(map1->ctx, isl_dim_match(map1->dim, isl_dim_param,
7749 map2->dim, isl_dim_param), goto error);
7751 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
7752 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
7753 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
7755 result = isl_map_alloc_dim(dim_product(isl_dim_copy(map1->dim),
7756 isl_dim_copy(map2->dim)),
7757 map1->n * map2->n, flags);
7760 for (i = 0; i < map1->n; ++i)
7761 for (j = 0; j < map2->n; ++j) {
7762 struct isl_basic_map *part;
7763 part = basic_map_product(isl_basic_map_copy(map1->p[i]),
7764 isl_basic_map_copy(map2->p[j]));
7765 if (isl_basic_map_is_empty(part))
7766 isl_basic_map_free(part);
7768 result = isl_map_add_basic_map(result, part);
7781 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> [B -> D]
7783 static __isl_give isl_map *map_product_aligned(__isl_take isl_map *map1,
7784 __isl_take isl_map *map2)
7786 return map_product(map1, map2, &isl_dim_product, &isl_basic_map_product);
7789 __isl_give isl_map *isl_map_product(__isl_take isl_map *map1,
7790 __isl_take isl_map *map2)
7792 return isl_map_align_params_map_map_and(map1, map2, &map_product_aligned);
7795 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
7797 __isl_give isl_map *isl_map_flat_product(__isl_take isl_map *map1,
7798 __isl_take isl_map *map2)
7802 prod = isl_map_product(map1, map2);
7803 prod = isl_map_flatten(prod);
7807 /* Given two set A and B, construct its Cartesian product A x B.
7809 struct isl_set *isl_set_product(struct isl_set *set1, struct isl_set *set2)
7811 return isl_map_range_product(set1, set2);
7814 __isl_give isl_set *isl_set_flat_product(__isl_take isl_set *set1,
7815 __isl_take isl_set *set2)
7817 return (isl_set *)isl_map_flat_product((isl_map *)set1, (isl_map *)set2);
7820 /* Given two maps A -> B and C -> D, construct a map (A * C) -> [B -> D]
7822 static __isl_give isl_map *map_range_product_aligned(__isl_take isl_map *map1,
7823 __isl_take isl_map *map2)
7825 return map_product(map1, map2, &isl_dim_range_product,
7826 &isl_basic_map_range_product);
7829 __isl_give isl_map *isl_map_range_product(__isl_take isl_map *map1,
7830 __isl_take isl_map *map2)
7832 return isl_map_align_params_map_map_and(map1, map2,
7833 &map_range_product_aligned);
7836 /* Given two maps A -> B and C -> D, construct a map (A * C) -> (B, D)
7838 __isl_give isl_map *isl_map_flat_range_product(__isl_take isl_map *map1,
7839 __isl_take isl_map *map2)
7843 prod = isl_map_range_product(map1, map2);
7844 prod = isl_map_flatten_range(prod);
7848 uint32_t isl_basic_map_get_hash(__isl_keep isl_basic_map *bmap)
7851 uint32_t hash = isl_hash_init();
7856 bmap = isl_basic_map_copy(bmap);
7857 bmap = isl_basic_map_normalize(bmap);
7860 total = isl_basic_map_total_dim(bmap);
7861 isl_hash_byte(hash, bmap->n_eq & 0xFF);
7862 for (i = 0; i < bmap->n_eq; ++i) {
7864 c_hash = isl_seq_get_hash(bmap->eq[i], 1 + total);
7865 isl_hash_hash(hash, c_hash);
7867 isl_hash_byte(hash, bmap->n_ineq & 0xFF);
7868 for (i = 0; i < bmap->n_ineq; ++i) {
7870 c_hash = isl_seq_get_hash(bmap->ineq[i], 1 + total);
7871 isl_hash_hash(hash, c_hash);
7873 isl_hash_byte(hash, bmap->n_div & 0xFF);
7874 for (i = 0; i < bmap->n_div; ++i) {
7876 if (isl_int_is_zero(bmap->div[i][0]))
7878 isl_hash_byte(hash, i & 0xFF);
7879 c_hash = isl_seq_get_hash(bmap->div[i], 1 + 1 + total);
7880 isl_hash_hash(hash, c_hash);
7882 isl_basic_map_free(bmap);
7886 uint32_t isl_basic_set_get_hash(__isl_keep isl_basic_set *bset)
7888 return isl_basic_map_get_hash((isl_basic_map *)bset);
7891 uint32_t isl_map_get_hash(__isl_keep isl_map *map)
7898 map = isl_map_copy(map);
7899 map = isl_map_normalize(map);
7903 hash = isl_hash_init();
7904 for (i = 0; i < map->n; ++i) {
7906 bmap_hash = isl_basic_map_get_hash(map->p[i]);
7907 isl_hash_hash(hash, bmap_hash);
7915 uint32_t isl_set_get_hash(__isl_keep isl_set *set)
7917 return isl_map_get_hash((isl_map *)set);
7920 /* Check if the value for dimension dim is completely determined
7921 * by the values of the other parameters and variables.
7922 * That is, check if dimension dim is involved in an equality.
7924 int isl_basic_set_dim_is_unique(struct isl_basic_set *bset, unsigned dim)
7931 nparam = isl_basic_set_n_param(bset);
7932 for (i = 0; i < bset->n_eq; ++i)
7933 if (!isl_int_is_zero(bset->eq[i][1 + nparam + dim]))
7938 /* Check if the value for dimension dim is completely determined
7939 * by the values of the other parameters and variables.
7940 * That is, check if dimension dim is involved in an equality
7941 * for each of the subsets.
7943 int isl_set_dim_is_unique(struct isl_set *set, unsigned dim)
7949 for (i = 0; i < set->n; ++i) {
7951 unique = isl_basic_set_dim_is_unique(set->p[i], dim);
7958 int isl_set_n_basic_set(__isl_keep isl_set *set)
7960 return set ? set->n : 0;
7963 int isl_map_foreach_basic_map(__isl_keep isl_map *map,
7964 int (*fn)(__isl_take isl_basic_map *bmap, void *user), void *user)
7971 for (i = 0; i < map->n; ++i)
7972 if (fn(isl_basic_map_copy(map->p[i]), user) < 0)
7978 int isl_set_foreach_basic_set(__isl_keep isl_set *set,
7979 int (*fn)(__isl_take isl_basic_set *bset, void *user), void *user)
7986 for (i = 0; i < set->n; ++i)
7987 if (fn(isl_basic_set_copy(set->p[i]), user) < 0)
7993 __isl_give isl_basic_set *isl_basic_set_lift(__isl_take isl_basic_set *bset)
7995 struct isl_dim *dim;
8000 bset = isl_basic_set_cow(bset);
8004 dim = isl_basic_set_get_dim(bset);
8005 dim = isl_dim_lift(dim, bset->n_div);
8008 isl_dim_free(bset->dim);
8010 bset->extra -= bset->n_div;
8013 bset = isl_basic_set_finalize(bset);
8017 isl_basic_set_free(bset);
8021 __isl_give isl_set *isl_set_lift(__isl_take isl_set *set)
8024 struct isl_dim *dim;
8027 set = isl_set_align_divs(set);
8032 set = isl_set_cow(set);
8036 n_div = set->p[0]->n_div;
8037 dim = isl_set_get_dim(set);
8038 dim = isl_dim_lift(dim, n_div);
8041 isl_dim_free(set->dim);
8044 for (i = 0; i < set->n; ++i) {
8045 set->p[i] = isl_basic_set_lift(set->p[i]);
8056 __isl_give isl_map *isl_set_lifting(__isl_take isl_set *set)
8058 struct isl_dim *dim;
8059 struct isl_basic_map *bmap;
8066 set = isl_set_align_divs(set);
8071 dim = isl_set_get_dim(set);
8072 if (set->n == 0 || set->p[0]->n_div == 0) {
8074 return isl_map_identity(isl_dim_map_from_set(dim));
8077 n_div = set->p[0]->n_div;
8078 dim = isl_dim_map_from_set(dim);
8079 n_param = isl_dim_size(dim, isl_dim_param);
8080 n_set = isl_dim_size(dim, isl_dim_in);
8081 dim = isl_dim_extend(dim, n_param, n_set, n_set + n_div);
8082 bmap = isl_basic_map_alloc_dim(dim, 0, n_set, 2 * n_div);
8083 for (i = 0; i < n_set; ++i)
8084 bmap = var_equal(bmap, i);
8086 total = n_param + n_set + n_set + n_div;
8087 for (i = 0; i < n_div; ++i) {
8088 k = isl_basic_map_alloc_inequality(bmap);
8091 isl_seq_cpy(bmap->ineq[k], set->p[0]->div[i]+1, 1+n_param);
8092 isl_seq_clr(bmap->ineq[k]+1+n_param, n_set);
8093 isl_seq_cpy(bmap->ineq[k]+1+n_param+n_set,
8094 set->p[0]->div[i]+1+1+n_param, n_set + n_div);
8095 isl_int_neg(bmap->ineq[k][1+n_param+n_set+n_set+i],
8096 set->p[0]->div[i][0]);
8098 l = isl_basic_map_alloc_inequality(bmap);
8101 isl_seq_neg(bmap->ineq[l], bmap->ineq[k], 1 + total);
8102 isl_int_add(bmap->ineq[l][0], bmap->ineq[l][0],
8103 set->p[0]->div[i][0]);
8104 isl_int_sub_ui(bmap->ineq[l][0], bmap->ineq[l][0], 1);
8108 bmap = isl_basic_map_simplify(bmap);
8109 bmap = isl_basic_map_finalize(bmap);
8110 return isl_map_from_basic_map(bmap);
8113 isl_basic_map_free(bmap);
8117 int isl_basic_set_size(__isl_keep isl_basic_set *bset)
8125 dim = isl_basic_set_total_dim(bset);
8126 size += bset->n_eq * (1 + dim);
8127 size += bset->n_ineq * (1 + dim);
8128 size += bset->n_div * (2 + dim);
8133 int isl_set_size(__isl_keep isl_set *set)
8141 for (i = 0; i < set->n; ++i)
8142 size += isl_basic_set_size(set->p[i]);
8147 /* Check if there is any lower bound (if lower == 0) and/or upper
8148 * bound (if upper == 0) on the specified dim.
8150 static int basic_map_dim_is_bounded(__isl_keep isl_basic_map *bmap,
8151 enum isl_dim_type type, unsigned pos, int lower, int upper)
8158 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), return -1);
8160 pos += isl_basic_map_offset(bmap, type);
8162 for (i = 0; i < bmap->n_div; ++i) {
8163 if (isl_int_is_zero(bmap->div[i][0]))
8165 if (!isl_int_is_zero(bmap->div[i][1 + pos]))
8169 for (i = 0; i < bmap->n_eq; ++i)
8170 if (!isl_int_is_zero(bmap->eq[i][pos]))
8173 for (i = 0; i < bmap->n_ineq; ++i) {
8174 int sgn = isl_int_sgn(bmap->ineq[i][pos]);
8181 return lower && upper;
8184 int isl_basic_map_dim_is_bounded(__isl_keep isl_basic_map *bmap,
8185 enum isl_dim_type type, unsigned pos)
8187 return basic_map_dim_is_bounded(bmap, type, pos, 0, 0);
8190 int isl_basic_map_dim_has_lower_bound(__isl_keep isl_basic_map *bmap,
8191 enum isl_dim_type type, unsigned pos)
8193 return basic_map_dim_is_bounded(bmap, type, pos, 0, 1);
8196 int isl_basic_map_dim_has_upper_bound(__isl_keep isl_basic_map *bmap,
8197 enum isl_dim_type type, unsigned pos)
8199 return basic_map_dim_is_bounded(bmap, type, pos, 1, 0);
8202 int isl_map_dim_is_bounded(__isl_keep isl_map *map,
8203 enum isl_dim_type type, unsigned pos)
8210 for (i = 0; i < map->n; ++i) {
8212 bounded = isl_basic_map_dim_is_bounded(map->p[i], type, pos);
8213 if (bounded < 0 || !bounded)
8220 /* Return 1 if the specified dim is involved in both an upper bound
8221 * and a lower bound.
8223 int isl_set_dim_is_bounded(__isl_keep isl_set *set,
8224 enum isl_dim_type type, unsigned pos)
8226 return isl_map_dim_is_bounded((isl_map *)set, type, pos);
8229 static int has_bound(__isl_keep isl_map *map,
8230 enum isl_dim_type type, unsigned pos,
8231 int (*fn)(__isl_keep isl_basic_map *bmap,
8232 enum isl_dim_type type, unsigned pos))
8239 for (i = 0; i < map->n; ++i) {
8241 bounded = fn(map->p[i], type, pos);
8242 if (bounded < 0 || bounded)
8249 /* Return 1 if the specified dim is involved in any lower bound.
8251 int isl_set_dim_has_lower_bound(__isl_keep isl_set *set,
8252 enum isl_dim_type type, unsigned pos)
8254 return has_bound(set, type, pos, &isl_basic_map_dim_has_lower_bound);
8257 /* Return 1 if the specified dim is involved in any upper bound.
8259 int isl_set_dim_has_upper_bound(__isl_keep isl_set *set,
8260 enum isl_dim_type type, unsigned pos)
8262 return has_bound(set, type, pos, &isl_basic_map_dim_has_upper_bound);
8265 /* For each of the "n" variables starting at "first", determine
8266 * the sign of the variable and put the results in the first "n"
8267 * elements of the array "signs".
8269 * 1 means that the variable is non-negative
8270 * -1 means that the variable is non-positive
8271 * 0 means the variable attains both positive and negative values.
8273 int isl_basic_set_vars_get_sign(__isl_keep isl_basic_set *bset,
8274 unsigned first, unsigned n, int *signs)
8276 isl_vec *bound = NULL;
8277 struct isl_tab *tab = NULL;
8278 struct isl_tab_undo *snap;
8281 if (!bset || !signs)
8284 bound = isl_vec_alloc(bset->ctx, 1 + isl_basic_set_total_dim(bset));
8285 tab = isl_tab_from_basic_set(bset);
8289 isl_seq_clr(bound->el, bound->size);
8290 isl_int_set_si(bound->el[0], -1);
8292 snap = isl_tab_snap(tab);
8293 for (i = 0; i < n; ++i) {
8296 isl_int_set_si(bound->el[1 + first + i], -1);
8297 if (isl_tab_add_ineq(tab, bound->el) < 0)
8300 isl_int_set_si(bound->el[1 + first + i], 0);
8301 if (isl_tab_rollback(tab, snap) < 0)
8309 isl_int_set_si(bound->el[1 + first + i], 1);
8310 if (isl_tab_add_ineq(tab, bound->el) < 0)
8313 isl_int_set_si(bound->el[1 + first + i], 0);
8314 if (isl_tab_rollback(tab, snap) < 0)
8317 signs[i] = empty ? -1 : 0;
8321 isl_vec_free(bound);
8325 isl_vec_free(bound);
8329 int isl_basic_set_dims_get_sign(__isl_keep isl_basic_set *bset,
8330 enum isl_dim_type type, unsigned first, unsigned n, int *signs)
8332 if (!bset || !signs)
8334 isl_assert(bset->ctx, first + n <= isl_basic_set_dim(bset, type),
8337 first += pos(bset->dim, type) - 1;
8338 return isl_basic_set_vars_get_sign(bset, first, n, signs);
8341 /* Check if the given basic map is obviously single-valued.
8342 * In particular, for each output dimension, check that there is
8343 * an equality that defines the output dimension in terms of
8344 * earlier dimensions.
8346 int isl_basic_map_plain_is_single_valued(__isl_keep isl_basic_map *bmap)
8356 total = 1 + isl_basic_map_total_dim(bmap);
8357 n_out = isl_basic_map_dim(bmap, isl_dim_out);
8358 o_out = isl_basic_map_offset(bmap, isl_dim_out);
8360 for (i = 0; i < n_out; ++i) {
8361 for (j = 0; j < bmap->n_eq; ++j) {
8362 if (isl_int_is_zero(bmap->eq[j][o_out + i]))
8364 if (isl_seq_first_non_zero(bmap->eq[j] + o_out + i + 1,
8365 total - (o_out + i + 1)) == -1)
8368 if (j >= bmap->n_eq)
8375 /* Check if the given map is obviously single-valued.
8377 int isl_map_plain_is_single_valued(__isl_keep isl_map *map)
8386 return isl_basic_map_plain_is_single_valued(map->p[0]);
8389 /* Check if the given map is single-valued.
8394 * and check if the result is a subset of the identity mapping.
8396 int isl_map_is_single_valued(__isl_keep isl_map *map)
8403 sv = isl_map_plain_is_single_valued(map);
8407 test = isl_map_reverse(isl_map_copy(map));
8408 test = isl_map_apply_range(test, isl_map_copy(map));
8410 dim = isl_dim_map_from_set(isl_dim_range(isl_map_get_dim(map)));
8411 id = isl_map_identity(dim);
8413 sv = isl_map_is_subset(test, id);
8421 int isl_map_is_injective(__isl_keep isl_map *map)
8425 map = isl_map_copy(map);
8426 map = isl_map_reverse(map);
8427 in = isl_map_is_single_valued(map);
8433 /* Check if the given map is obviously injective.
8435 int isl_map_plain_is_injective(__isl_keep isl_map *map)
8439 map = isl_map_copy(map);
8440 map = isl_map_reverse(map);
8441 in = isl_map_plain_is_single_valued(map);
8447 int isl_map_is_bijective(__isl_keep isl_map *map)
8451 sv = isl_map_is_single_valued(map);
8455 return isl_map_is_injective(map);
8458 int isl_set_is_singleton(__isl_keep isl_set *set)
8460 return isl_map_is_single_valued((isl_map *)set);
8463 int isl_map_is_translation(__isl_keep isl_map *map)
8468 delta = isl_map_deltas(isl_map_copy(map));
8469 ok = isl_set_is_singleton(delta);
8470 isl_set_free(delta);
8475 static int unique(isl_int *p, unsigned pos, unsigned len)
8477 if (isl_seq_first_non_zero(p, pos) != -1)
8479 if (isl_seq_first_non_zero(p + pos + 1, len - pos - 1) != -1)
8484 int isl_basic_set_is_box(__isl_keep isl_basic_set *bset)
8493 if (isl_basic_set_dim(bset, isl_dim_div) != 0)
8496 nvar = isl_basic_set_dim(bset, isl_dim_set);
8497 ovar = isl_dim_offset(bset->dim, isl_dim_set);
8498 for (j = 0; j < nvar; ++j) {
8499 int lower = 0, upper = 0;
8500 for (i = 0; i < bset->n_eq; ++i) {
8501 if (isl_int_is_zero(bset->eq[i][1 + ovar + j]))
8503 if (!unique(bset->eq[i] + 1 + ovar, j, nvar))
8509 for (i = 0; i < bset->n_ineq; ++i) {
8510 if (isl_int_is_zero(bset->ineq[i][1 + ovar + j]))
8512 if (!unique(bset->ineq[i] + 1 + ovar, j, nvar))
8514 if (isl_int_is_pos(bset->ineq[i][1 + ovar + j]))
8519 if (!lower || !upper)
8526 int isl_set_is_box(__isl_keep isl_set *set)
8533 return isl_basic_set_is_box(set->p[0]);
8536 int isl_basic_set_is_wrapping(__isl_keep isl_basic_set *bset)
8541 return isl_dim_is_wrapping(bset->dim);
8544 int isl_set_is_wrapping(__isl_keep isl_set *set)
8549 return isl_dim_is_wrapping(set->dim);
8552 __isl_give isl_basic_set *isl_basic_map_wrap(__isl_take isl_basic_map *bmap)
8554 bmap = isl_basic_map_cow(bmap);
8558 bmap->dim = isl_dim_wrap(bmap->dim);
8562 bmap = isl_basic_map_finalize(bmap);
8564 return (isl_basic_set *)bmap;
8566 isl_basic_map_free(bmap);
8570 __isl_give isl_set *isl_map_wrap(__isl_take isl_map *map)
8574 map = isl_map_cow(map);
8578 for (i = 0; i < map->n; ++i) {
8579 map->p[i] = (isl_basic_map *)isl_basic_map_wrap(map->p[i]);
8583 map->dim = isl_dim_wrap(map->dim);
8587 return (isl_set *)map;
8593 __isl_give isl_basic_map *isl_basic_set_unwrap(__isl_take isl_basic_set *bset)
8595 bset = isl_basic_set_cow(bset);
8599 bset->dim = isl_dim_unwrap(bset->dim);
8603 bset = isl_basic_set_finalize(bset);
8605 return (isl_basic_map *)bset;
8607 isl_basic_set_free(bset);
8611 __isl_give isl_map *isl_set_unwrap(__isl_take isl_set *set)
8618 if (!isl_set_is_wrapping(set))
8619 isl_die(set->ctx, isl_error_invalid, "not a wrapping set",
8622 set = isl_set_cow(set);
8626 for (i = 0; i < set->n; ++i) {
8627 set->p[i] = (isl_basic_set *)isl_basic_set_unwrap(set->p[i]);
8632 set->dim = isl_dim_unwrap(set->dim);
8636 return (isl_map *)set;
8642 __isl_give isl_basic_map *isl_basic_map_reset(__isl_take isl_basic_map *bmap,
8643 enum isl_dim_type type)
8648 if (!isl_dim_is_named_or_nested(bmap->dim, type))
8651 bmap = isl_basic_map_cow(bmap);
8655 bmap->dim = isl_dim_reset(bmap->dim, type);
8659 bmap = isl_basic_map_finalize(bmap);
8663 isl_basic_map_free(bmap);
8667 __isl_give isl_map *isl_map_reset(__isl_take isl_map *map,
8668 enum isl_dim_type type)
8675 if (!isl_dim_is_named_or_nested(map->dim, type))
8678 map = isl_map_cow(map);
8682 for (i = 0; i < map->n; ++i) {
8683 map->p[i] = isl_basic_map_reset(map->p[i], type);
8687 map->dim = isl_dim_reset(map->dim, type);
8697 __isl_give isl_basic_map *isl_basic_map_flatten(__isl_take isl_basic_map *bmap)
8702 if (!bmap->dim->nested[0] && !bmap->dim->nested[1])
8705 bmap = isl_basic_map_cow(bmap);
8709 bmap->dim = isl_dim_flatten(bmap->dim);
8713 bmap = isl_basic_map_finalize(bmap);
8717 isl_basic_map_free(bmap);
8721 __isl_give isl_basic_set *isl_basic_set_flatten(__isl_take isl_basic_set *bset)
8723 return (isl_basic_set *)isl_basic_map_flatten((isl_basic_map *)bset);
8726 __isl_give isl_basic_map *isl_basic_map_flatten_range(
8727 __isl_take isl_basic_map *bmap)
8732 if (!bmap->dim->nested[1])
8735 bmap = isl_basic_map_cow(bmap);
8739 bmap->dim = isl_dim_flatten_range(bmap->dim);
8743 bmap = isl_basic_map_finalize(bmap);
8747 isl_basic_map_free(bmap);
8751 __isl_give isl_map *isl_map_flatten(__isl_take isl_map *map)
8758 if (!map->dim->nested[0] && !map->dim->nested[1])
8761 map = isl_map_cow(map);
8765 for (i = 0; i < map->n; ++i) {
8766 map->p[i] = isl_basic_map_flatten(map->p[i]);
8770 map->dim = isl_dim_flatten(map->dim);
8780 __isl_give isl_set *isl_set_flatten(__isl_take isl_set *set)
8782 return (isl_set *)isl_map_flatten((isl_map *)set);
8785 __isl_give isl_map *isl_set_flatten_map(__isl_take isl_set *set)
8787 isl_dim *dim, *flat_dim;
8790 dim = isl_set_get_dim(set);
8791 flat_dim = isl_dim_flatten(isl_dim_copy(dim));
8792 map = isl_map_identity(isl_dim_join(isl_dim_reverse(dim), flat_dim));
8793 map = isl_map_intersect_domain(map, set);
8798 __isl_give isl_map *isl_map_flatten_range(__isl_take isl_map *map)
8805 if (!map->dim->nested[1])
8808 map = isl_map_cow(map);
8812 for (i = 0; i < map->n; ++i) {
8813 map->p[i] = isl_basic_map_flatten_range(map->p[i]);
8817 map->dim = isl_dim_flatten_range(map->dim);
8827 /* Reorder the dimensions of "bmap" according to the given dim_map
8828 * and set the dimension specification to "dim".
8830 __isl_give isl_basic_map *isl_basic_map_realign(__isl_take isl_basic_map *bmap,
8831 __isl_take isl_dim *dim, __isl_take struct isl_dim_map *dim_map)
8835 bmap = isl_basic_map_cow(bmap);
8836 if (!bmap || !dim || !dim_map)
8839 res = isl_basic_map_alloc_dim(dim,
8840 bmap->n_div, bmap->n_eq, bmap->n_ineq);
8841 res = isl_basic_map_add_constraints_dim_map(res, bmap, dim_map);
8842 res = isl_basic_map_finalize(res);
8846 isl_basic_map_free(bmap);
8851 /* Reorder the dimensions of "map" according to given reordering.
8853 __isl_give isl_map *isl_map_realign(__isl_take isl_map *map,
8854 __isl_take isl_reordering *r)
8857 struct isl_dim_map *dim_map;
8859 map = isl_map_cow(map);
8860 dim_map = isl_dim_map_from_reordering(r);
8861 if (!map || !r || !dim_map)
8864 for (i = 0; i < map->n; ++i) {
8865 struct isl_dim_map *dim_map_i;
8867 dim_map_i = isl_dim_map_extend(dim_map, map->p[i]);
8869 map->p[i] = isl_basic_map_realign(map->p[i],
8870 isl_dim_copy(r->dim), dim_map_i);
8876 map = isl_map_reset_dim(map, isl_dim_copy(r->dim));
8878 isl_reordering_free(r);
8884 isl_reordering_free(r);
8888 __isl_give isl_set *isl_set_realign(__isl_take isl_set *set,
8889 __isl_take isl_reordering *r)
8891 return (isl_set *)isl_map_realign((isl_map *)set, r);
8894 __isl_give isl_map *isl_map_align_params(__isl_take isl_map *map,
8895 __isl_take isl_dim *model)
8902 ctx = isl_dim_get_ctx(model);
8903 if (!isl_dim_has_named_params(model))
8904 isl_die(ctx, isl_error_invalid,
8905 "model has unnamed parameters", goto error);
8906 if (!isl_dim_has_named_params(map->dim))
8907 isl_die(ctx, isl_error_invalid,
8908 "relation has unnamed parameters", goto error);
8909 if (!isl_dim_match(map->dim, isl_dim_param, model, isl_dim_param)) {
8910 isl_reordering *exp;
8912 model = isl_dim_drop(model, isl_dim_in,
8913 0, isl_dim_size(model, isl_dim_in));
8914 model = isl_dim_drop(model, isl_dim_out,
8915 0, isl_dim_size(model, isl_dim_out));
8916 exp = isl_parameter_alignment_reordering(map->dim, model);
8917 exp = isl_reordering_extend_dim(exp, isl_map_get_dim(map));
8918 map = isl_map_realign(map, exp);
8921 isl_dim_free(model);
8924 isl_dim_free(model);
8929 __isl_give isl_set *isl_set_align_params(__isl_take isl_set *set,
8930 __isl_take isl_dim *model)
8932 return isl_map_align_params(set, model);
8935 __isl_give isl_mat *isl_basic_map_equalities_matrix(
8936 __isl_keep isl_basic_map *bmap, enum isl_dim_type c1,
8937 enum isl_dim_type c2, enum isl_dim_type c3,
8938 enum isl_dim_type c4, enum isl_dim_type c5)
8940 enum isl_dim_type c[5] = { c1, c2, c3, c4, c5 };
8941 struct isl_mat *mat;
8947 mat = isl_mat_alloc(bmap->ctx, bmap->n_eq,
8948 isl_basic_map_total_dim(bmap) + 1);
8951 for (i = 0; i < bmap->n_eq; ++i)
8952 for (j = 0, pos = 0; j < 5; ++j) {
8953 int off = isl_basic_map_offset(bmap, c[j]);
8954 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
8955 isl_int_set(mat->row[i][pos],
8956 bmap->eq[i][off + k]);
8964 __isl_give isl_mat *isl_basic_map_inequalities_matrix(
8965 __isl_keep isl_basic_map *bmap, enum isl_dim_type c1,
8966 enum isl_dim_type c2, enum isl_dim_type c3,
8967 enum isl_dim_type c4, enum isl_dim_type c5)
8969 enum isl_dim_type c[5] = { c1, c2, c3, c4, c5 };
8970 struct isl_mat *mat;
8976 mat = isl_mat_alloc(bmap->ctx, bmap->n_ineq,
8977 isl_basic_map_total_dim(bmap) + 1);
8980 for (i = 0; i < bmap->n_ineq; ++i)
8981 for (j = 0, pos = 0; j < 5; ++j) {
8982 int off = isl_basic_map_offset(bmap, c[j]);
8983 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
8984 isl_int_set(mat->row[i][pos],
8985 bmap->ineq[i][off + k]);
8993 __isl_give isl_basic_map *isl_basic_map_from_constraint_matrices(
8994 __isl_take isl_dim *dim,
8995 __isl_take isl_mat *eq, __isl_take isl_mat *ineq, enum isl_dim_type c1,
8996 enum isl_dim_type c2, enum isl_dim_type c3,
8997 enum isl_dim_type c4, enum isl_dim_type c5)
8999 enum isl_dim_type c[5] = { c1, c2, c3, c4, c5 };
9000 isl_basic_map *bmap;
9006 if (!dim || !eq || !ineq)
9009 if (eq->n_col != ineq->n_col)
9010 isl_die(dim->ctx, isl_error_invalid,
9011 "equalities and inequalities matrices should have "
9012 "same number of columns", goto error);
9014 total = 1 + isl_dim_total(dim);
9016 if (eq->n_col < total)
9017 isl_die(dim->ctx, isl_error_invalid,
9018 "number of columns too small", goto error);
9020 extra = eq->n_col - total;
9022 bmap = isl_basic_map_alloc_dim(isl_dim_copy(dim), extra,
9023 eq->n_row, ineq->n_row);
9026 for (i = 0; i < extra; ++i) {
9027 k = isl_basic_map_alloc_div(bmap);
9030 isl_int_set_si(bmap->div[k][0], 0);
9032 for (i = 0; i < eq->n_row; ++i) {
9033 l = isl_basic_map_alloc_equality(bmap);
9036 for (j = 0, pos = 0; j < 5; ++j) {
9037 int off = isl_basic_map_offset(bmap, c[j]);
9038 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
9039 isl_int_set(bmap->eq[l][off + k],
9045 for (i = 0; i < ineq->n_row; ++i) {
9046 l = isl_basic_map_alloc_inequality(bmap);
9049 for (j = 0, pos = 0; j < 5; ++j) {
9050 int off = isl_basic_map_offset(bmap, c[j]);
9051 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
9052 isl_int_set(bmap->ineq[l][off + k],
9071 __isl_give isl_mat *isl_basic_set_equalities_matrix(
9072 __isl_keep isl_basic_set *bset, enum isl_dim_type c1,
9073 enum isl_dim_type c2, enum isl_dim_type c3, enum isl_dim_type c4)
9075 return isl_basic_map_equalities_matrix((isl_basic_map *)bset,
9076 c1, c2, c3, c4, isl_dim_in);
9079 __isl_give isl_mat *isl_basic_set_inequalities_matrix(
9080 __isl_keep isl_basic_set *bset, enum isl_dim_type c1,
9081 enum isl_dim_type c2, enum isl_dim_type c3, enum isl_dim_type c4)
9083 return isl_basic_map_inequalities_matrix((isl_basic_map *)bset,
9084 c1, c2, c3, c4, isl_dim_in);
9087 __isl_give isl_basic_set *isl_basic_set_from_constraint_matrices(
9088 __isl_take isl_dim *dim,
9089 __isl_take isl_mat *eq, __isl_take isl_mat *ineq, enum isl_dim_type c1,
9090 enum isl_dim_type c2, enum isl_dim_type c3, enum isl_dim_type c4)
9092 return (isl_basic_set*)
9093 isl_basic_map_from_constraint_matrices(dim, eq, ineq,
9094 c1, c2, c3, c4, isl_dim_in);
9097 int isl_basic_map_can_zip(__isl_keep isl_basic_map *bmap)
9102 return isl_dim_can_zip(bmap->dim);
9105 int isl_map_can_zip(__isl_keep isl_map *map)
9110 return isl_dim_can_zip(map->dim);
9113 /* Given a basic map (A -> B) -> (C -> D), return the corresponding basic map
9114 * (A -> C) -> (B -> D).
9116 __isl_give isl_basic_map *isl_basic_map_zip(__isl_take isl_basic_map *bmap)
9125 if (!isl_basic_map_can_zip(bmap))
9126 isl_die(bmap->ctx, isl_error_invalid,
9127 "basic map cannot be zipped", goto error);
9128 pos = isl_basic_map_offset(bmap, isl_dim_in) +
9129 isl_dim_size(bmap->dim->nested[0], isl_dim_in);
9130 n1 = isl_dim_size(bmap->dim->nested[0], isl_dim_out);
9131 n2 = isl_dim_size(bmap->dim->nested[1], isl_dim_in);
9132 bmap = isl_basic_map_swap_vars(bmap, pos, n1, n2);
9135 bmap->dim = isl_dim_zip(bmap->dim);
9140 isl_basic_map_free(bmap);
9144 /* Given a map (A -> B) -> (C -> D), return the corresponding map
9145 * (A -> C) -> (B -> D).
9147 __isl_give isl_map *isl_map_zip(__isl_take isl_map *map)
9154 if (!isl_map_can_zip(map))
9155 isl_die(map->ctx, isl_error_invalid, "map cannot be zipped",
9158 map = isl_map_cow(map);
9162 for (i = 0; i < map->n; ++i) {
9163 map->p[i] = isl_basic_map_zip(map->p[i]);
9168 map->dim = isl_dim_zip(map->dim);
9178 /* Construct a basic map mapping the domain of the affine expression
9179 * to a one-dimensional range prescribed by the affine expression.
9181 __isl_give isl_basic_map *isl_basic_map_from_aff(__isl_take isl_aff *aff)
9185 isl_local_space *ls;
9186 isl_basic_map *bmap;
9191 ls = isl_aff_get_local_space(aff);
9192 ls = isl_local_space_from_domain(ls);
9193 ls = isl_local_space_add_dims(ls, isl_dim_out, 1);
9194 bmap = isl_basic_map_from_local_space(ls);
9195 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
9196 k = isl_basic_map_alloc_equality(bmap);
9200 pos = isl_basic_map_offset(bmap, isl_dim_out);
9201 isl_seq_cpy(bmap->eq[k], aff->v->el + 1, pos);
9202 isl_int_neg(bmap->eq[k][pos], aff->v->el[0]);
9203 isl_seq_cpy(bmap->eq[k] + pos + 1, aff->v->el + 1 + pos,
9204 aff->v->size - (pos + 1));
9207 bmap = isl_basic_map_finalize(bmap);
9211 isl_basic_map_free(bmap);
9215 /* Construct a basic map mapping a domain in the given space to
9216 * to an n-dimensional range, with n the number of elements in the list,
9217 * where each coordinate in the range is prescribed by the
9218 * corresponding affine expression.
9219 * The domains of all affine expressions in the list are assumed to match
9222 __isl_give isl_basic_map *isl_basic_map_from_aff_list(
9223 __isl_take isl_dim *domain_dim, __isl_take isl_aff_list *list)
9227 isl_basic_map *bmap;
9232 dim = isl_dim_from_domain(domain_dim);
9233 bmap = isl_basic_map_universe(dim);
9235 for (i = 0; i < list->n; ++i) {
9237 isl_basic_map *bmap_i;
9239 aff = isl_aff_copy(list->p[i]);
9240 bmap_i = isl_basic_map_from_aff(aff);
9242 bmap = isl_basic_map_flat_range_product(bmap, bmap_i);
9245 isl_aff_list_free(list);
9249 __isl_give isl_set *isl_set_equate(__isl_take isl_set *set,
9250 enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2)
9252 return isl_map_equate(set, type1, pos1, type2, pos2);
9255 /* Add a constraint imposing that the given two dimensions are equal.
9257 __isl_give isl_map *isl_map_equate(__isl_take isl_map *map,
9258 enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2)
9260 isl_basic_map *bmap = NULL;
9266 if (pos1 >= isl_map_dim(map, type1))
9267 isl_die(map->ctx, isl_error_invalid,
9268 "index out of bounds", goto error);
9269 if (pos2 >= isl_map_dim(map, type2))
9270 isl_die(map->ctx, isl_error_invalid,
9271 "index out of bounds", goto error);
9273 bmap = isl_basic_map_alloc_dim(isl_map_get_dim(map), 0, 1, 0);
9274 i = isl_basic_map_alloc_equality(bmap);
9277 isl_seq_clr(bmap->eq[i], 1 + isl_basic_map_total_dim(bmap));
9278 pos1 += isl_basic_map_offset(bmap, type1);
9279 pos2 += isl_basic_map_offset(bmap, type2);
9280 isl_int_set_si(bmap->eq[i][pos1], -1);
9281 isl_int_set_si(bmap->eq[i][pos2], 1);
9282 bmap = isl_basic_map_finalize(bmap);
9284 map = isl_map_intersect(map, isl_map_from_basic_map(bmap));
9288 isl_basic_map_free(bmap);
9293 /* Add a constraint imposing that the given two dimensions have opposite values.
9295 __isl_give isl_map *isl_map_oppose(__isl_take isl_map *map,
9296 enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2)
9298 isl_basic_map *bmap = NULL;
9304 if (pos1 >= isl_map_dim(map, type1))
9305 isl_die(map->ctx, isl_error_invalid,
9306 "index out of bounds", goto error);
9307 if (pos2 >= isl_map_dim(map, type2))
9308 isl_die(map->ctx, isl_error_invalid,
9309 "index out of bounds", goto error);
9311 bmap = isl_basic_map_alloc_dim(isl_map_get_dim(map), 0, 1, 0);
9312 i = isl_basic_map_alloc_equality(bmap);
9315 isl_seq_clr(bmap->eq[i], 1 + isl_basic_map_total_dim(bmap));
9316 pos1 += isl_basic_map_offset(bmap, type1);
9317 pos2 += isl_basic_map_offset(bmap, type2);
9318 isl_int_set_si(bmap->eq[i][pos1], 1);
9319 isl_int_set_si(bmap->eq[i][pos2], 1);
9320 bmap = isl_basic_map_finalize(bmap);
9322 map = isl_map_intersect(map, isl_map_from_basic_map(bmap));
9326 isl_basic_map_free(bmap);