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 static __isl_give isl_basic_map *basic_map_space_reset(
2553 __isl_take isl_basic_map *bmap, enum isl_dim_type type)
2557 if (!isl_dim_is_named_or_nested(bmap->dim, type))
2560 space = isl_basic_map_get_dim(bmap);
2561 space = isl_dim_reset(space, type);
2562 bmap = isl_basic_map_reset_dim(bmap, space);
2566 __isl_give isl_basic_map *isl_basic_map_insert(__isl_take isl_basic_map *bmap,
2567 enum isl_dim_type type, unsigned pos, unsigned n)
2569 struct isl_dim *res_dim;
2570 struct isl_basic_map *res;
2571 struct isl_dim_map *dim_map;
2572 unsigned total, off;
2573 enum isl_dim_type t;
2576 return basic_map_space_reset(bmap, type);
2581 res_dim = isl_dim_insert(isl_basic_map_get_dim(bmap), type, pos, n);
2583 total = isl_basic_map_total_dim(bmap) + n;
2584 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2586 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
2588 isl_dim_map_dim(dim_map, bmap->dim, t, off);
2590 unsigned size = isl_basic_map_dim(bmap, t);
2591 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2593 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2594 pos, size - pos, off + pos + n);
2596 off += isl_dim_size(res_dim, t);
2598 isl_dim_map_div(dim_map, bmap, off);
2600 res = isl_basic_map_alloc_dim(res_dim,
2601 bmap->n_div, bmap->n_eq, bmap->n_ineq);
2602 if (isl_basic_map_is_rational(bmap))
2603 res = isl_basic_map_set_rational(res);
2604 res = isl_basic_map_add_constraints_dim_map(res, bmap, dim_map);
2605 return isl_basic_map_finalize(res);
2608 __isl_give isl_basic_map *isl_basic_map_add(__isl_take isl_basic_map *bmap,
2609 enum isl_dim_type type, unsigned n)
2613 return isl_basic_map_insert(bmap, type,
2614 isl_basic_map_dim(bmap, type), n);
2617 __isl_give isl_basic_set *isl_basic_set_add(__isl_take isl_basic_set *bset,
2618 enum isl_dim_type type, unsigned n)
2622 isl_assert(bset->ctx, type != isl_dim_in, goto error);
2623 return (isl_basic_set *)isl_basic_map_add((isl_basic_map *)bset, type, n);
2625 isl_basic_set_free(bset);
2629 static __isl_give isl_map *map_space_reset(__isl_take isl_map *map,
2630 enum isl_dim_type type)
2634 if (!isl_dim_is_named_or_nested(map->dim, type))
2637 space = isl_map_get_dim(map);
2638 space = isl_dim_reset(space, type);
2639 map = isl_map_reset_dim(map, space);
2643 __isl_give isl_map *isl_map_insert_dims(__isl_take isl_map *map,
2644 enum isl_dim_type type, unsigned pos, unsigned n)
2649 return map_space_reset(map, type);
2651 map = isl_map_cow(map);
2655 map->dim = isl_dim_insert(map->dim, type, pos, n);
2659 for (i = 0; i < map->n; ++i) {
2660 map->p[i] = isl_basic_map_insert(map->p[i], type, pos, n);
2671 __isl_give isl_set *isl_set_insert_dims(__isl_take isl_set *set,
2672 enum isl_dim_type type, unsigned pos, unsigned n)
2674 return isl_map_insert_dims(set, type, pos, n);
2677 __isl_give isl_map *isl_map_add_dims(__isl_take isl_map *map,
2678 enum isl_dim_type type, unsigned n)
2682 return isl_map_insert_dims(map, type, isl_map_dim(map, type), n);
2685 __isl_give isl_set *isl_set_add_dims(__isl_take isl_set *set,
2686 enum isl_dim_type type, unsigned n)
2690 isl_assert(set->ctx, type != isl_dim_in, goto error);
2691 return (isl_set *)isl_map_add_dims((isl_map *)set, type, n);
2697 __isl_give isl_basic_map *isl_basic_map_move_dims(
2698 __isl_take isl_basic_map *bmap,
2699 enum isl_dim_type dst_type, unsigned dst_pos,
2700 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2702 struct isl_dim_map *dim_map;
2703 struct isl_basic_map *res;
2704 enum isl_dim_type t;
2705 unsigned total, off;
2712 isl_assert(bmap->ctx, src_pos + n <= isl_basic_map_dim(bmap, src_type),
2715 if (dst_type == src_type && dst_pos == src_pos)
2718 isl_assert(bmap->ctx, dst_type != src_type, goto error);
2720 if (pos(bmap->dim, dst_type) + dst_pos ==
2721 pos(bmap->dim, src_type) + src_pos +
2722 ((src_type < dst_type) ? n : 0)) {
2723 bmap = isl_basic_map_cow(bmap);
2727 bmap->dim = isl_dim_move(bmap->dim, dst_type, dst_pos,
2728 src_type, src_pos, n);
2732 bmap = isl_basic_map_finalize(bmap);
2737 total = isl_basic_map_total_dim(bmap);
2738 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2741 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
2742 unsigned size = isl_dim_size(bmap->dim, t);
2743 if (t == dst_type) {
2744 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2747 isl_dim_map_dim_range(dim_map, bmap->dim, src_type,
2750 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2751 dst_pos, size - dst_pos, off);
2752 off += size - dst_pos;
2753 } else if (t == src_type) {
2754 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2757 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2758 src_pos + n, size - src_pos - n, off);
2759 off += size - src_pos - n;
2761 isl_dim_map_dim(dim_map, bmap->dim, t, off);
2765 isl_dim_map_div(dim_map, bmap, off);
2767 res = isl_basic_map_alloc_dim(isl_basic_map_get_dim(bmap),
2768 bmap->n_div, bmap->n_eq, bmap->n_ineq);
2769 bmap = isl_basic_map_add_constraints_dim_map(res, bmap, dim_map);
2771 bmap->dim = isl_dim_move(bmap->dim, dst_type, dst_pos,
2772 src_type, src_pos, n);
2776 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
2777 bmap = isl_basic_map_gauss(bmap, NULL);
2778 bmap = isl_basic_map_finalize(bmap);
2782 isl_basic_map_free(bmap);
2786 __isl_give isl_basic_set *isl_basic_set_move_dims(__isl_take isl_basic_set *bset,
2787 enum isl_dim_type dst_type, unsigned dst_pos,
2788 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2790 return (isl_basic_set *)isl_basic_map_move_dims(
2791 (isl_basic_map *)bset, dst_type, dst_pos, src_type, src_pos, n);
2794 __isl_give isl_set *isl_set_move_dims(__isl_take isl_set *set,
2795 enum isl_dim_type dst_type, unsigned dst_pos,
2796 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2800 isl_assert(set->ctx, dst_type != isl_dim_in, goto error);
2801 return (isl_set *)isl_map_move_dims((isl_map *)set, dst_type, dst_pos,
2802 src_type, src_pos, n);
2808 __isl_give isl_map *isl_map_move_dims(__isl_take isl_map *map,
2809 enum isl_dim_type dst_type, unsigned dst_pos,
2810 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2819 isl_assert(map->ctx, src_pos + n <= isl_map_dim(map, src_type),
2822 if (dst_type == src_type && dst_pos == src_pos)
2825 isl_assert(map->ctx, dst_type != src_type, goto error);
2827 map = isl_map_cow(map);
2831 map->dim = isl_dim_move(map->dim, dst_type, dst_pos, src_type, src_pos, n);
2835 for (i = 0; i < map->n; ++i) {
2836 map->p[i] = isl_basic_map_move_dims(map->p[i],
2838 src_type, src_pos, n);
2849 /* Move the specified dimensions to the last columns right before
2850 * the divs. Don't change the dimension specification of bmap.
2851 * That's the responsibility of the caller.
2853 static __isl_give isl_basic_map *move_last(__isl_take isl_basic_map *bmap,
2854 enum isl_dim_type type, unsigned first, unsigned n)
2856 struct isl_dim_map *dim_map;
2857 struct isl_basic_map *res;
2858 enum isl_dim_type t;
2859 unsigned total, off;
2863 if (pos(bmap->dim, type) + first + n == 1 + isl_dim_total(bmap->dim))
2866 total = isl_basic_map_total_dim(bmap);
2867 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2870 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
2871 unsigned size = isl_dim_size(bmap->dim, t);
2873 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2876 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2877 first, n, total - bmap->n_div - n);
2878 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2879 first + n, size - (first + n), off);
2880 off += size - (first + n);
2882 isl_dim_map_dim(dim_map, bmap->dim, t, off);
2886 isl_dim_map_div(dim_map, bmap, off + n);
2888 res = isl_basic_map_alloc_dim(isl_basic_map_get_dim(bmap),
2889 bmap->n_div, bmap->n_eq, bmap->n_ineq);
2890 res = isl_basic_map_add_constraints_dim_map(res, bmap, dim_map);
2894 /* Turn the n dimensions of type type, starting at first
2895 * into existentially quantified variables.
2897 __isl_give isl_basic_map *isl_basic_map_project_out(
2898 __isl_take isl_basic_map *bmap,
2899 enum isl_dim_type type, unsigned first, unsigned n)
2912 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL))
2913 return isl_basic_map_remove_dims(bmap, type, first, n);
2915 isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
2918 bmap = move_last(bmap, type, first, n);
2919 bmap = isl_basic_map_cow(bmap);
2923 row_size = 1 + isl_dim_total(bmap->dim) + bmap->extra;
2924 old = bmap->block2.data;
2925 bmap->block2 = isl_blk_extend(bmap->ctx, bmap->block2,
2926 (bmap->extra + n) * (1 + row_size));
2927 if (!bmap->block2.data)
2929 new_div = isl_alloc_array(bmap->ctx, isl_int *, bmap->extra + n);
2932 for (i = 0; i < n; ++i) {
2933 new_div[i] = bmap->block2.data +
2934 (bmap->extra + i) * (1 + row_size);
2935 isl_seq_clr(new_div[i], 1 + row_size);
2937 for (i = 0; i < bmap->extra; ++i)
2938 new_div[n + i] = bmap->block2.data + (bmap->div[i] - old);
2940 bmap->div = new_div;
2944 bmap->dim = isl_dim_drop(bmap->dim, type, first, n);
2947 bmap = isl_basic_map_simplify(bmap);
2948 bmap = isl_basic_map_drop_redundant_divs(bmap);
2949 return isl_basic_map_finalize(bmap);
2951 isl_basic_map_free(bmap);
2955 /* Turn the n dimensions of type type, starting at first
2956 * into existentially quantified variables.
2958 struct isl_basic_set *isl_basic_set_project_out(struct isl_basic_set *bset,
2959 enum isl_dim_type type, unsigned first, unsigned n)
2961 return (isl_basic_set *)isl_basic_map_project_out(
2962 (isl_basic_map *)bset, type, first, n);
2965 /* Turn the n dimensions of type type, starting at first
2966 * into existentially quantified variables.
2968 __isl_give isl_map *isl_map_project_out(__isl_take isl_map *map,
2969 enum isl_dim_type type, unsigned first, unsigned n)
2979 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
2981 map = isl_map_cow(map);
2985 map->dim = isl_dim_drop(map->dim, type, first, n);
2989 for (i = 0; i < map->n; ++i) {
2990 map->p[i] = isl_basic_map_project_out(map->p[i], type, first, n);
3001 /* Turn the n dimensions of type type, starting at first
3002 * into existentially quantified variables.
3004 __isl_give isl_set *isl_set_project_out(__isl_take isl_set *set,
3005 enum isl_dim_type type, unsigned first, unsigned n)
3007 return (isl_set *)isl_map_project_out((isl_map *)set, type, first, n);
3010 static struct isl_basic_map *add_divs(struct isl_basic_map *bmap, unsigned n)
3014 for (i = 0; i < n; ++i) {
3015 j = isl_basic_map_alloc_div(bmap);
3018 isl_seq_clr(bmap->div[j], 1+1+isl_basic_map_total_dim(bmap));
3022 isl_basic_map_free(bmap);
3026 struct isl_basic_map *isl_basic_map_apply_range(
3027 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3029 struct isl_dim *dim_result = NULL;
3030 struct isl_basic_map *bmap;
3031 unsigned n_in, n_out, n, nparam, total, pos;
3032 struct isl_dim_map *dim_map1, *dim_map2;
3034 if (!bmap1 || !bmap2)
3037 dim_result = isl_dim_join(isl_dim_copy(bmap1->dim),
3038 isl_dim_copy(bmap2->dim));
3040 n_in = isl_basic_map_n_in(bmap1);
3041 n_out = isl_basic_map_n_out(bmap2);
3042 n = isl_basic_map_n_out(bmap1);
3043 nparam = isl_basic_map_n_param(bmap1);
3045 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + n;
3046 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
3047 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
3048 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
3049 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
3050 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
3051 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_in);
3052 isl_dim_map_div(dim_map1, bmap1, pos += n_out);
3053 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
3054 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
3055 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
3057 bmap = isl_basic_map_alloc_dim(dim_result,
3058 bmap1->n_div + bmap2->n_div + n,
3059 bmap1->n_eq + bmap2->n_eq,
3060 bmap1->n_ineq + bmap2->n_ineq);
3061 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap1, dim_map1);
3062 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap2, dim_map2);
3063 bmap = add_divs(bmap, n);
3064 bmap = isl_basic_map_simplify(bmap);
3065 bmap = isl_basic_map_drop_redundant_divs(bmap);
3066 return isl_basic_map_finalize(bmap);
3068 isl_basic_map_free(bmap1);
3069 isl_basic_map_free(bmap2);
3073 struct isl_basic_set *isl_basic_set_apply(
3074 struct isl_basic_set *bset, struct isl_basic_map *bmap)
3079 isl_assert(bset->ctx, isl_basic_map_compatible_domain(bmap, bset),
3082 return (struct isl_basic_set *)
3083 isl_basic_map_apply_range((struct isl_basic_map *)bset, bmap);
3085 isl_basic_set_free(bset);
3086 isl_basic_map_free(bmap);
3090 struct isl_basic_map *isl_basic_map_apply_domain(
3091 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3093 if (!bmap1 || !bmap2)
3096 isl_assert(bmap1->ctx,
3097 isl_basic_map_n_in(bmap1) == isl_basic_map_n_in(bmap2), goto error);
3098 isl_assert(bmap1->ctx,
3099 isl_basic_map_n_param(bmap1) == isl_basic_map_n_param(bmap2),
3102 bmap1 = isl_basic_map_reverse(bmap1);
3103 bmap1 = isl_basic_map_apply_range(bmap1, bmap2);
3104 return isl_basic_map_reverse(bmap1);
3106 isl_basic_map_free(bmap1);
3107 isl_basic_map_free(bmap2);
3111 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
3112 * A \cap B -> f(A) + f(B)
3114 struct isl_basic_map *isl_basic_map_sum(
3115 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3117 unsigned n_in, n_out, nparam, total, pos;
3118 struct isl_basic_map *bmap = NULL;
3119 struct isl_dim_map *dim_map1, *dim_map2;
3122 if (!bmap1 || !bmap2)
3125 isl_assert(bmap1->ctx, isl_dim_equal(bmap1->dim, bmap2->dim),
3128 nparam = isl_basic_map_n_param(bmap1);
3129 n_in = isl_basic_map_n_in(bmap1);
3130 n_out = isl_basic_map_n_out(bmap1);
3132 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + 2 * n_out;
3133 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
3134 dim_map2 = isl_dim_map_alloc(bmap2->ctx, total);
3135 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
3136 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos);
3137 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
3138 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
3139 isl_dim_map_div(dim_map1, bmap1, pos += n_in + n_out);
3140 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
3141 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
3142 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_out);
3144 bmap = isl_basic_map_alloc_dim(isl_dim_copy(bmap1->dim),
3145 bmap1->n_div + bmap2->n_div + 2 * n_out,
3146 bmap1->n_eq + bmap2->n_eq + n_out,
3147 bmap1->n_ineq + bmap2->n_ineq);
3148 for (i = 0; i < n_out; ++i) {
3149 int j = isl_basic_map_alloc_equality(bmap);
3152 isl_seq_clr(bmap->eq[j], 1+total);
3153 isl_int_set_si(bmap->eq[j][1+nparam+n_in+i], -1);
3154 isl_int_set_si(bmap->eq[j][1+pos+i], 1);
3155 isl_int_set_si(bmap->eq[j][1+pos-n_out+i], 1);
3157 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap1, dim_map1);
3158 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap2, dim_map2);
3159 bmap = add_divs(bmap, 2 * n_out);
3161 bmap = isl_basic_map_simplify(bmap);
3162 return isl_basic_map_finalize(bmap);
3164 isl_basic_map_free(bmap);
3165 isl_basic_map_free(bmap1);
3166 isl_basic_map_free(bmap2);
3170 /* Given two maps A -> f(A) and B -> g(B), construct a map
3171 * A \cap B -> f(A) + f(B)
3173 struct isl_map *isl_map_sum(struct isl_map *map1, struct isl_map *map2)
3175 struct isl_map *result;
3181 isl_assert(map1->ctx, isl_dim_equal(map1->dim, map2->dim), goto error);
3183 result = isl_map_alloc_dim(isl_dim_copy(map1->dim),
3184 map1->n * map2->n, 0);
3187 for (i = 0; i < map1->n; ++i)
3188 for (j = 0; j < map2->n; ++j) {
3189 struct isl_basic_map *part;
3190 part = isl_basic_map_sum(
3191 isl_basic_map_copy(map1->p[i]),
3192 isl_basic_map_copy(map2->p[j]));
3193 if (isl_basic_map_is_empty(part))
3194 isl_basic_map_free(part);
3196 result = isl_map_add_basic_map(result, part);
3209 __isl_give isl_set *isl_set_sum(__isl_take isl_set *set1,
3210 __isl_take isl_set *set2)
3212 return (isl_set *)isl_map_sum((isl_map *)set1, (isl_map *)set2);
3215 /* Given a basic map A -> f(A), construct A -> -f(A).
3217 struct isl_basic_map *isl_basic_map_neg(struct isl_basic_map *bmap)
3222 bmap = isl_basic_map_cow(bmap);
3226 n = isl_basic_map_dim(bmap, isl_dim_out);
3227 off = isl_basic_map_offset(bmap, isl_dim_out);
3228 for (i = 0; i < bmap->n_eq; ++i)
3229 for (j = 0; j < n; ++j)
3230 isl_int_neg(bmap->eq[i][off+j], bmap->eq[i][off+j]);
3231 for (i = 0; i < bmap->n_ineq; ++i)
3232 for (j = 0; j < n; ++j)
3233 isl_int_neg(bmap->ineq[i][off+j], bmap->ineq[i][off+j]);
3234 for (i = 0; i < bmap->n_div; ++i)
3235 for (j = 0; j < n; ++j)
3236 isl_int_neg(bmap->div[i][1+off+j], bmap->div[i][1+off+j]);
3237 bmap = isl_basic_map_gauss(bmap, NULL);
3238 return isl_basic_map_finalize(bmap);
3241 __isl_give isl_basic_set *isl_basic_set_neg(__isl_take isl_basic_set *bset)
3243 return isl_basic_map_neg(bset);
3246 /* Given a map A -> f(A), construct A -> -f(A).
3248 struct isl_map *isl_map_neg(struct isl_map *map)
3252 map = isl_map_cow(map);
3256 for (i = 0; i < map->n; ++i) {
3257 map->p[i] = isl_basic_map_neg(map->p[i]);
3268 __isl_give isl_set *isl_set_neg(__isl_take isl_set *set)
3270 return (isl_set *)isl_map_neg((isl_map *)set);
3273 /* Given a basic map A -> f(A) and an integer d, construct a basic map
3274 * A -> floor(f(A)/d).
3276 struct isl_basic_map *isl_basic_map_floordiv(struct isl_basic_map *bmap,
3279 unsigned n_in, n_out, nparam, total, pos;
3280 struct isl_basic_map *result = NULL;
3281 struct isl_dim_map *dim_map;
3287 nparam = isl_basic_map_n_param(bmap);
3288 n_in = isl_basic_map_n_in(bmap);
3289 n_out = isl_basic_map_n_out(bmap);
3291 total = nparam + n_in + n_out + bmap->n_div + n_out;
3292 dim_map = isl_dim_map_alloc(bmap->ctx, total);
3293 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_param, pos = 0);
3294 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_in, pos += nparam);
3295 isl_dim_map_div(dim_map, bmap, pos += n_in + n_out);
3296 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_out, pos += bmap->n_div);
3298 result = isl_basic_map_alloc_dim(isl_dim_copy(bmap->dim),
3299 bmap->n_div + n_out,
3300 bmap->n_eq, bmap->n_ineq + 2 * n_out);
3301 result = isl_basic_map_add_constraints_dim_map(result, bmap, dim_map);
3302 result = add_divs(result, n_out);
3303 for (i = 0; i < n_out; ++i) {
3305 j = isl_basic_map_alloc_inequality(result);
3308 isl_seq_clr(result->ineq[j], 1+total);
3309 isl_int_neg(result->ineq[j][1+nparam+n_in+i], d);
3310 isl_int_set_si(result->ineq[j][1+pos+i], 1);
3311 j = isl_basic_map_alloc_inequality(result);
3314 isl_seq_clr(result->ineq[j], 1+total);
3315 isl_int_set(result->ineq[j][1+nparam+n_in+i], d);
3316 isl_int_set_si(result->ineq[j][1+pos+i], -1);
3317 isl_int_sub_ui(result->ineq[j][0], d, 1);
3320 result = isl_basic_map_simplify(result);
3321 return isl_basic_map_finalize(result);
3323 isl_basic_map_free(result);
3327 /* Given a map A -> f(A) and an integer d, construct a map
3328 * A -> floor(f(A)/d).
3330 struct isl_map *isl_map_floordiv(struct isl_map *map, isl_int d)
3334 map = isl_map_cow(map);
3338 ISL_F_CLR(map, ISL_MAP_DISJOINT);
3339 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3340 for (i = 0; i < map->n; ++i) {
3341 map->p[i] = isl_basic_map_floordiv(map->p[i], d);
3352 static struct isl_basic_map *var_equal(struct isl_basic_map *bmap, unsigned pos)
3358 i = isl_basic_map_alloc_equality(bmap);
3361 nparam = isl_basic_map_n_param(bmap);
3362 n_in = isl_basic_map_n_in(bmap);
3363 isl_seq_clr(bmap->eq[i], 1 + isl_basic_map_total_dim(bmap));
3364 isl_int_set_si(bmap->eq[i][1+nparam+pos], -1);
3365 isl_int_set_si(bmap->eq[i][1+nparam+n_in+pos], 1);
3366 return isl_basic_map_finalize(bmap);
3368 isl_basic_map_free(bmap);
3372 /* Add a constraints to "bmap" expressing i_pos < o_pos
3374 static struct isl_basic_map *var_less(struct isl_basic_map *bmap, unsigned pos)
3380 i = isl_basic_map_alloc_inequality(bmap);
3383 nparam = isl_basic_map_n_param(bmap);
3384 n_in = isl_basic_map_n_in(bmap);
3385 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
3386 isl_int_set_si(bmap->ineq[i][0], -1);
3387 isl_int_set_si(bmap->ineq[i][1+nparam+pos], -1);
3388 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], 1);
3389 return isl_basic_map_finalize(bmap);
3391 isl_basic_map_free(bmap);
3395 /* Add a constraint to "bmap" expressing i_pos <= o_pos
3397 static __isl_give isl_basic_map *var_less_or_equal(
3398 __isl_take isl_basic_map *bmap, unsigned pos)
3404 i = isl_basic_map_alloc_inequality(bmap);
3407 nparam = isl_basic_map_n_param(bmap);
3408 n_in = isl_basic_map_n_in(bmap);
3409 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
3410 isl_int_set_si(bmap->ineq[i][1+nparam+pos], -1);
3411 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], 1);
3412 return isl_basic_map_finalize(bmap);
3414 isl_basic_map_free(bmap);
3418 /* Add a constraints to "bmap" expressing i_pos > o_pos
3420 static struct isl_basic_map *var_more(struct isl_basic_map *bmap, unsigned pos)
3426 i = isl_basic_map_alloc_inequality(bmap);
3429 nparam = isl_basic_map_n_param(bmap);
3430 n_in = isl_basic_map_n_in(bmap);
3431 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
3432 isl_int_set_si(bmap->ineq[i][0], -1);
3433 isl_int_set_si(bmap->ineq[i][1+nparam+pos], 1);
3434 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], -1);
3435 return isl_basic_map_finalize(bmap);
3437 isl_basic_map_free(bmap);
3441 /* Add a constraint to "bmap" expressing i_pos >= o_pos
3443 static __isl_give isl_basic_map *var_more_or_equal(
3444 __isl_take isl_basic_map *bmap, unsigned pos)
3450 i = isl_basic_map_alloc_inequality(bmap);
3453 nparam = isl_basic_map_n_param(bmap);
3454 n_in = isl_basic_map_n_in(bmap);
3455 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
3456 isl_int_set_si(bmap->ineq[i][1+nparam+pos], 1);
3457 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], -1);
3458 return isl_basic_map_finalize(bmap);
3460 isl_basic_map_free(bmap);
3464 struct isl_basic_map *isl_basic_map_equal(struct isl_dim *dim, unsigned n_equal)
3467 struct isl_basic_map *bmap;
3468 bmap = isl_basic_map_alloc_dim(dim, 0, n_equal, 0);
3471 for (i = 0; i < n_equal && bmap; ++i)
3472 bmap = var_equal(bmap, i);
3473 return isl_basic_map_finalize(bmap);
3476 /* Return a relation on of dimension "dim" expressing i_[0..pos] << o_[0..pos]
3478 struct isl_basic_map *isl_basic_map_less_at(struct isl_dim *dim, unsigned pos)
3481 struct isl_basic_map *bmap;
3482 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
3485 for (i = 0; i < pos && bmap; ++i)
3486 bmap = var_equal(bmap, i);
3488 bmap = var_less(bmap, pos);
3489 return isl_basic_map_finalize(bmap);
3492 /* Return a relation on of dimension "dim" expressing i_[0..pos] <<= o_[0..pos]
3494 __isl_give isl_basic_map *isl_basic_map_less_or_equal_at(
3495 __isl_take isl_dim *dim, unsigned pos)
3498 isl_basic_map *bmap;
3500 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
3501 for (i = 0; i < pos; ++i)
3502 bmap = var_equal(bmap, i);
3503 bmap = var_less_or_equal(bmap, pos);
3504 return isl_basic_map_finalize(bmap);
3507 /* Return a relation on pairs of sets of dimension "dim" expressing i_pos > o_pos
3509 struct isl_basic_map *isl_basic_map_more_at(struct isl_dim *dim, unsigned pos)
3512 struct isl_basic_map *bmap;
3513 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
3516 for (i = 0; i < pos && bmap; ++i)
3517 bmap = var_equal(bmap, i);
3519 bmap = var_more(bmap, pos);
3520 return isl_basic_map_finalize(bmap);
3523 /* Return a relation on of dimension "dim" expressing i_[0..pos] >>= o_[0..pos]
3525 __isl_give isl_basic_map *isl_basic_map_more_or_equal_at(
3526 __isl_take isl_dim *dim, unsigned pos)
3529 isl_basic_map *bmap;
3531 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
3532 for (i = 0; i < pos; ++i)
3533 bmap = var_equal(bmap, i);
3534 bmap = var_more_or_equal(bmap, pos);
3535 return isl_basic_map_finalize(bmap);
3538 static __isl_give isl_map *map_lex_lte_first(__isl_take isl_dim *dims,
3539 unsigned n, int equal)
3541 struct isl_map *map;
3544 if (n == 0 && equal)
3545 return isl_map_universe(dims);
3547 map = isl_map_alloc_dim(isl_dim_copy(dims), n, ISL_MAP_DISJOINT);
3549 for (i = 0; i + 1 < n; ++i)
3550 map = isl_map_add_basic_map(map,
3551 isl_basic_map_less_at(isl_dim_copy(dims), i));
3554 map = isl_map_add_basic_map(map,
3555 isl_basic_map_less_or_equal_at(dims, n - 1));
3557 map = isl_map_add_basic_map(map,
3558 isl_basic_map_less_at(dims, n - 1));
3565 static __isl_give isl_map *map_lex_lte(__isl_take isl_dim *dims, int equal)
3569 return map_lex_lte_first(dims, dims->n_out, equal);
3572 __isl_give isl_map *isl_map_lex_lt_first(__isl_take isl_dim *dim, unsigned n)
3574 return map_lex_lte_first(dim, n, 0);
3577 __isl_give isl_map *isl_map_lex_le_first(__isl_take isl_dim *dim, unsigned n)
3579 return map_lex_lte_first(dim, n, 1);
3582 __isl_give isl_map *isl_map_lex_lt(__isl_take isl_dim *set_dim)
3584 return map_lex_lte(isl_dim_map_from_set(set_dim), 0);
3587 __isl_give isl_map *isl_map_lex_le(__isl_take isl_dim *set_dim)
3589 return map_lex_lte(isl_dim_map_from_set(set_dim), 1);
3592 static __isl_give isl_map *map_lex_gte_first(__isl_take isl_dim *dims,
3593 unsigned n, int equal)
3595 struct isl_map *map;
3598 if (n == 0 && equal)
3599 return isl_map_universe(dims);
3601 map = isl_map_alloc_dim(isl_dim_copy(dims), n, ISL_MAP_DISJOINT);
3603 for (i = 0; i + 1 < n; ++i)
3604 map = isl_map_add_basic_map(map,
3605 isl_basic_map_more_at(isl_dim_copy(dims), i));
3608 map = isl_map_add_basic_map(map,
3609 isl_basic_map_more_or_equal_at(dims, n - 1));
3611 map = isl_map_add_basic_map(map,
3612 isl_basic_map_more_at(dims, n - 1));
3619 static __isl_give isl_map *map_lex_gte(__isl_take isl_dim *dims, int equal)
3623 return map_lex_gte_first(dims, dims->n_out, equal);
3626 __isl_give isl_map *isl_map_lex_gt_first(__isl_take isl_dim *dim, unsigned n)
3628 return map_lex_gte_first(dim, n, 0);
3631 __isl_give isl_map *isl_map_lex_ge_first(__isl_take isl_dim *dim, unsigned n)
3633 return map_lex_gte_first(dim, n, 1);
3636 __isl_give isl_map *isl_map_lex_gt(__isl_take isl_dim *set_dim)
3638 return map_lex_gte(isl_dim_map_from_set(set_dim), 0);
3641 __isl_give isl_map *isl_map_lex_ge(__isl_take isl_dim *set_dim)
3643 return map_lex_gte(isl_dim_map_from_set(set_dim), 1);
3646 __isl_give isl_map *isl_set_lex_le_set(__isl_take isl_set *set1,
3647 __isl_take isl_set *set2)
3650 map = isl_map_lex_le(isl_set_get_dim(set1));
3651 map = isl_map_intersect_domain(map, set1);
3652 map = isl_map_intersect_range(map, set2);
3656 __isl_give isl_map *isl_set_lex_lt_set(__isl_take isl_set *set1,
3657 __isl_take isl_set *set2)
3660 map = isl_map_lex_lt(isl_set_get_dim(set1));
3661 map = isl_map_intersect_domain(map, set1);
3662 map = isl_map_intersect_range(map, set2);
3666 __isl_give isl_map *isl_set_lex_ge_set(__isl_take isl_set *set1,
3667 __isl_take isl_set *set2)
3670 map = isl_map_lex_ge(isl_set_get_dim(set1));
3671 map = isl_map_intersect_domain(map, set1);
3672 map = isl_map_intersect_range(map, set2);
3676 __isl_give isl_map *isl_set_lex_gt_set(__isl_take isl_set *set1,
3677 __isl_take isl_set *set2)
3680 map = isl_map_lex_gt(isl_set_get_dim(set1));
3681 map = isl_map_intersect_domain(map, set1);
3682 map = isl_map_intersect_range(map, set2);
3686 __isl_give isl_map *isl_map_lex_le_map(__isl_take isl_map *map1,
3687 __isl_take isl_map *map2)
3690 map = isl_map_lex_le(isl_dim_range(isl_map_get_dim(map1)));
3691 map = isl_map_apply_domain(map, isl_map_reverse(map1));
3692 map = isl_map_apply_range(map, isl_map_reverse(map2));
3696 __isl_give isl_map *isl_map_lex_lt_map(__isl_take isl_map *map1,
3697 __isl_take isl_map *map2)
3700 map = isl_map_lex_lt(isl_dim_range(isl_map_get_dim(map1)));
3701 map = isl_map_apply_domain(map, isl_map_reverse(map1));
3702 map = isl_map_apply_range(map, isl_map_reverse(map2));
3706 __isl_give isl_map *isl_map_lex_ge_map(__isl_take isl_map *map1,
3707 __isl_take isl_map *map2)
3710 map = isl_map_lex_ge(isl_dim_range(isl_map_get_dim(map1)));
3711 map = isl_map_apply_domain(map, isl_map_reverse(map1));
3712 map = isl_map_apply_range(map, isl_map_reverse(map2));
3716 __isl_give isl_map *isl_map_lex_gt_map(__isl_take isl_map *map1,
3717 __isl_take isl_map *map2)
3720 map = isl_map_lex_gt(isl_dim_range(isl_map_get_dim(map1)));
3721 map = isl_map_apply_domain(map, isl_map_reverse(map1));
3722 map = isl_map_apply_range(map, isl_map_reverse(map2));
3726 struct isl_basic_map *isl_basic_map_from_basic_set(
3727 struct isl_basic_set *bset, struct isl_dim *dim)
3729 struct isl_basic_map *bmap;
3731 bset = isl_basic_set_cow(bset);
3735 isl_assert(bset->ctx, isl_dim_compatible(bset->dim, dim), goto error);
3736 isl_dim_free(bset->dim);
3737 bmap = (struct isl_basic_map *) bset;
3739 return isl_basic_map_finalize(bmap);
3741 isl_basic_set_free(bset);
3746 struct isl_basic_set *isl_basic_set_from_basic_map(struct isl_basic_map *bmap)
3750 if (bmap->dim->n_in == 0)
3751 return (struct isl_basic_set *)bmap;
3752 bmap = isl_basic_map_cow(bmap);
3755 bmap->dim = isl_dim_as_set_dim(bmap->dim);
3758 bmap = isl_basic_map_finalize(bmap);
3759 return (struct isl_basic_set *)bmap;
3761 isl_basic_map_free(bmap);
3765 /* For a div d = floor(f/m), add the constraints
3768 * -(f-(n-1)) + m d >= 0
3770 * Note that the second constraint is the negation of
3774 int isl_basic_map_add_div_constraints_var(__isl_keep isl_basic_map *bmap,
3775 unsigned pos, isl_int *div)
3778 unsigned total = isl_basic_map_total_dim(bmap);
3780 i = isl_basic_map_alloc_inequality(bmap);
3783 isl_seq_cpy(bmap->ineq[i], div + 1, 1 + total);
3784 isl_int_neg(bmap->ineq[i][1 + pos], div[0]);
3786 j = isl_basic_map_alloc_inequality(bmap);
3789 isl_seq_neg(bmap->ineq[j], bmap->ineq[i], 1 + total);
3790 isl_int_add(bmap->ineq[j][0], bmap->ineq[j][0], bmap->ineq[j][1 + pos]);
3791 isl_int_sub_ui(bmap->ineq[j][0], bmap->ineq[j][0], 1);
3795 int isl_basic_set_add_div_constraints_var(__isl_keep isl_basic_set *bset,
3796 unsigned pos, isl_int *div)
3798 return isl_basic_map_add_div_constraints_var((isl_basic_map *)bset,
3802 int isl_basic_map_add_div_constraints(struct isl_basic_map *bmap, unsigned div)
3804 unsigned total = isl_basic_map_total_dim(bmap);
3805 unsigned div_pos = total - bmap->n_div + div;
3807 return isl_basic_map_add_div_constraints_var(bmap, div_pos,
3811 struct isl_basic_set *isl_basic_map_underlying_set(
3812 struct isl_basic_map *bmap)
3816 if (bmap->dim->nparam == 0 && bmap->dim->n_in == 0 &&
3818 !isl_dim_is_named_or_nested(bmap->dim, isl_dim_in) &&
3819 !isl_dim_is_named_or_nested(bmap->dim, isl_dim_out))
3820 return (struct isl_basic_set *)bmap;
3821 bmap = isl_basic_map_cow(bmap);
3824 bmap->dim = isl_dim_underlying(bmap->dim, bmap->n_div);
3827 bmap->extra -= bmap->n_div;
3829 bmap = isl_basic_map_finalize(bmap);
3830 return (struct isl_basic_set *)bmap;
3835 __isl_give isl_basic_set *isl_basic_set_underlying_set(
3836 __isl_take isl_basic_set *bset)
3838 return isl_basic_map_underlying_set((isl_basic_map *)bset);
3841 struct isl_basic_map *isl_basic_map_overlying_set(
3842 struct isl_basic_set *bset, struct isl_basic_map *like)
3844 struct isl_basic_map *bmap;
3845 struct isl_ctx *ctx;
3852 isl_assert(ctx, bset->n_div == 0, goto error);
3853 isl_assert(ctx, isl_basic_set_n_param(bset) == 0, goto error);
3854 isl_assert(ctx, bset->dim->n_out == isl_basic_map_total_dim(like),
3856 if (isl_dim_equal(bset->dim, like->dim) && like->n_div == 0) {
3857 isl_basic_map_free(like);
3858 return (struct isl_basic_map *)bset;
3860 bset = isl_basic_set_cow(bset);
3863 total = bset->dim->n_out + bset->extra;
3864 bmap = (struct isl_basic_map *)bset;
3865 isl_dim_free(bmap->dim);
3866 bmap->dim = isl_dim_copy(like->dim);
3869 bmap->n_div = like->n_div;
3870 bmap->extra += like->n_div;
3874 ltotal = total - bmap->extra + like->extra;
3877 bmap->block2 = isl_blk_extend(ctx, bmap->block2,
3878 bmap->extra * (1 + 1 + total));
3879 if (isl_blk_is_error(bmap->block2))
3881 div = isl_realloc_array(ctx, bmap->div, isl_int *, bmap->extra);
3885 for (i = 0; i < bmap->extra; ++i)
3886 bmap->div[i] = bmap->block2.data + i * (1 + 1 + total);
3887 for (i = 0; i < like->n_div; ++i) {
3888 isl_seq_cpy(bmap->div[i], like->div[i], 1 + 1 + ltotal);
3889 isl_seq_clr(bmap->div[i]+1+1+ltotal, total - ltotal);
3891 bmap = isl_basic_map_extend_constraints(bmap,
3892 0, 2 * like->n_div);
3893 for (i = 0; i < like->n_div; ++i) {
3894 if (isl_int_is_zero(bmap->div[i][0]))
3896 if (isl_basic_map_add_div_constraints(bmap, i) < 0)
3900 isl_basic_map_free(like);
3901 bmap = isl_basic_map_simplify(bmap);
3902 bmap = isl_basic_map_finalize(bmap);
3905 isl_basic_map_free(like);
3906 isl_basic_set_free(bset);
3910 struct isl_basic_set *isl_basic_set_from_underlying_set(
3911 struct isl_basic_set *bset, struct isl_basic_set *like)
3913 return (struct isl_basic_set *)
3914 isl_basic_map_overlying_set(bset, (struct isl_basic_map *)like);
3917 struct isl_set *isl_set_from_underlying_set(
3918 struct isl_set *set, struct isl_basic_set *like)
3924 isl_assert(set->ctx, set->dim->n_out == isl_basic_set_total_dim(like),
3926 if (isl_dim_equal(set->dim, like->dim) && like->n_div == 0) {
3927 isl_basic_set_free(like);
3930 set = isl_set_cow(set);
3933 for (i = 0; i < set->n; ++i) {
3934 set->p[i] = isl_basic_set_from_underlying_set(set->p[i],
3935 isl_basic_set_copy(like));
3939 isl_dim_free(set->dim);
3940 set->dim = isl_dim_copy(like->dim);
3943 isl_basic_set_free(like);
3946 isl_basic_set_free(like);
3951 struct isl_set *isl_map_underlying_set(struct isl_map *map)
3955 map = isl_map_cow(map);
3958 map->dim = isl_dim_cow(map->dim);
3962 for (i = 1; i < map->n; ++i)
3963 isl_assert(map->ctx, map->p[0]->n_div == map->p[i]->n_div,
3965 for (i = 0; i < map->n; ++i) {
3966 map->p[i] = (struct isl_basic_map *)
3967 isl_basic_map_underlying_set(map->p[i]);
3972 map->dim = isl_dim_underlying(map->dim, 0);
3974 isl_dim_free(map->dim);
3975 map->dim = isl_dim_copy(map->p[0]->dim);
3979 return (struct isl_set *)map;
3985 struct isl_set *isl_set_to_underlying_set(struct isl_set *set)
3987 return (struct isl_set *)isl_map_underlying_set((struct isl_map *)set);
3990 __isl_give isl_basic_map *isl_basic_map_reset_dim(
3991 __isl_take isl_basic_map *bmap, __isl_take isl_dim *dim)
3993 bmap = isl_basic_map_cow(bmap);
3997 isl_dim_free(bmap->dim);
4000 bmap = isl_basic_map_finalize(bmap);
4004 isl_basic_map_free(bmap);
4009 __isl_give isl_basic_set *isl_basic_set_reset_dim(
4010 __isl_take isl_basic_set *bset, __isl_take isl_dim *dim)
4012 return (isl_basic_set *)isl_basic_map_reset_dim((isl_basic_map *)bset,
4016 __isl_give isl_map *isl_map_reset_dim(__isl_take isl_map *map,
4017 __isl_take isl_dim *dim)
4021 map = isl_map_cow(map);
4025 for (i = 0; i < map->n; ++i) {
4026 map->p[i] = isl_basic_map_reset_dim(map->p[i],
4031 isl_dim_free(map->dim);
4041 __isl_give isl_set *isl_set_reset_dim(__isl_take isl_set *set,
4042 __isl_take isl_dim *dim)
4044 return (struct isl_set *) isl_map_reset_dim((struct isl_map *)set, dim);
4047 struct isl_basic_set *isl_basic_map_domain(struct isl_basic_map *bmap)
4050 struct isl_basic_set *domain;
4056 dim = isl_dim_domain(isl_basic_map_get_dim(bmap));
4058 n_in = isl_basic_map_n_in(bmap);
4059 n_out = isl_basic_map_n_out(bmap);
4060 domain = isl_basic_set_from_basic_map(bmap);
4061 domain = isl_basic_set_project_out(domain, isl_dim_set, n_in, n_out);
4063 domain = isl_basic_set_reset_dim(domain, dim);
4068 int isl_basic_map_may_be_set(__isl_keep isl_basic_map *bmap)
4072 return isl_dim_may_be_set(bmap->dim);
4075 struct isl_basic_set *isl_basic_map_range(struct isl_basic_map *bmap)
4079 if (isl_basic_map_may_be_set(bmap))
4081 return isl_basic_map_domain(isl_basic_map_reverse(bmap));
4084 __isl_give isl_basic_map *isl_basic_map_domain_map(
4085 __isl_take isl_basic_map *bmap)
4089 isl_basic_map *domain;
4090 int nparam, n_in, n_out;
4093 nparam = isl_basic_map_dim(bmap, isl_dim_param);
4094 n_in = isl_basic_map_dim(bmap, isl_dim_in);
4095 n_out = isl_basic_map_dim(bmap, isl_dim_out);
4097 dim = isl_dim_from_range(isl_dim_domain(isl_basic_map_get_dim(bmap)));
4098 domain = isl_basic_map_universe(dim);
4100 bmap = isl_basic_map_from_domain(isl_basic_map_wrap(bmap));
4101 bmap = isl_basic_map_apply_range(bmap, domain);
4102 bmap = isl_basic_map_extend_constraints(bmap, n_in, 0);
4104 total = isl_basic_map_total_dim(bmap);
4106 for (i = 0; i < n_in; ++i) {
4107 k = isl_basic_map_alloc_equality(bmap);
4110 isl_seq_clr(bmap->eq[k], 1 + total);
4111 isl_int_set_si(bmap->eq[k][1 + nparam + i], -1);
4112 isl_int_set_si(bmap->eq[k][1 + nparam + n_in + n_out + i], 1);
4115 bmap = isl_basic_map_gauss(bmap, NULL);
4116 return isl_basic_map_finalize(bmap);
4118 isl_basic_map_free(bmap);
4122 __isl_give isl_basic_map *isl_basic_map_range_map(
4123 __isl_take isl_basic_map *bmap)
4127 isl_basic_map *range;
4128 int nparam, n_in, n_out;
4131 nparam = isl_basic_map_dim(bmap, isl_dim_param);
4132 n_in = isl_basic_map_dim(bmap, isl_dim_in);
4133 n_out = isl_basic_map_dim(bmap, isl_dim_out);
4135 dim = isl_dim_from_range(isl_dim_range(isl_basic_map_get_dim(bmap)));
4136 range = isl_basic_map_universe(dim);
4138 bmap = isl_basic_map_from_domain(isl_basic_map_wrap(bmap));
4139 bmap = isl_basic_map_apply_range(bmap, range);
4140 bmap = isl_basic_map_extend_constraints(bmap, n_out, 0);
4142 total = isl_basic_map_total_dim(bmap);
4144 for (i = 0; i < n_out; ++i) {
4145 k = isl_basic_map_alloc_equality(bmap);
4148 isl_seq_clr(bmap->eq[k], 1 + total);
4149 isl_int_set_si(bmap->eq[k][1 + nparam + n_in + i], -1);
4150 isl_int_set_si(bmap->eq[k][1 + nparam + n_in + n_out + i], 1);
4153 bmap = isl_basic_map_gauss(bmap, NULL);
4154 return isl_basic_map_finalize(bmap);
4156 isl_basic_map_free(bmap);
4160 int isl_map_may_be_set(__isl_keep isl_map *map)
4164 return isl_dim_may_be_set(map->dim);
4167 struct isl_set *isl_map_range(struct isl_map *map)
4170 struct isl_set *set;
4174 if (isl_map_may_be_set(map))
4175 return (isl_set *)map;
4177 map = isl_map_cow(map);
4181 set = (struct isl_set *) map;
4182 set->dim = isl_dim_drop_inputs(set->dim, 0, set->dim->n_in);
4185 for (i = 0; i < map->n; ++i) {
4186 set->p[i] = isl_basic_map_range(map->p[i]);
4190 ISL_F_CLR(set, ISL_MAP_DISJOINT);
4191 ISL_F_CLR(set, ISL_SET_NORMALIZED);
4198 __isl_give isl_map *isl_map_domain_map(__isl_take isl_map *map)
4201 isl_dim *domain_dim;
4203 map = isl_map_cow(map);
4207 domain_dim = isl_dim_from_range(isl_dim_domain(isl_map_get_dim(map)));
4208 map->dim = isl_dim_from_domain(isl_dim_wrap(map->dim));
4209 map->dim = isl_dim_join(map->dim, domain_dim);
4212 for (i = 0; i < map->n; ++i) {
4213 map->p[i] = isl_basic_map_domain_map(map->p[i]);
4217 ISL_F_CLR(map, ISL_MAP_DISJOINT);
4218 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4225 __isl_give isl_map *isl_map_range_map(__isl_take isl_map *map)
4230 map = isl_map_cow(map);
4234 range_dim = isl_dim_range(isl_map_get_dim(map));
4235 map->dim = isl_dim_from_domain(isl_dim_wrap(map->dim));
4236 map->dim = isl_dim_join(map->dim, range_dim);
4239 for (i = 0; i < map->n; ++i) {
4240 map->p[i] = isl_basic_map_range_map(map->p[i]);
4244 ISL_F_CLR(map, ISL_MAP_DISJOINT);
4245 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4252 struct isl_map *isl_map_from_set(struct isl_set *set, struct isl_dim *dim)
4255 struct isl_map *map = NULL;
4257 set = isl_set_cow(set);
4260 isl_assert(set->ctx, isl_dim_compatible(set->dim, dim), goto error);
4261 map = (struct isl_map *)set;
4262 for (i = 0; i < set->n; ++i) {
4263 map->p[i] = isl_basic_map_from_basic_set(
4264 set->p[i], isl_dim_copy(dim));
4268 isl_dim_free(map->dim);
4277 __isl_give isl_basic_map *isl_basic_map_from_domain(
4278 __isl_take isl_basic_set *bset)
4280 return isl_basic_map_reverse(isl_basic_map_from_range(bset));
4283 __isl_give isl_basic_map *isl_basic_map_from_range(
4284 __isl_take isl_basic_set *bset)
4286 return (isl_basic_map *)bset;
4289 struct isl_map *isl_map_from_range(struct isl_set *set)
4291 return (struct isl_map *)set;
4294 __isl_give isl_map *isl_map_from_domain(__isl_take isl_set *set)
4296 return isl_map_reverse(isl_map_from_range(set));
4299 __isl_give isl_basic_map *isl_basic_map_from_domain_and_range(
4300 __isl_take isl_basic_set *domain, __isl_take isl_basic_set *range)
4302 return isl_basic_map_apply_range(isl_basic_map_from_domain(domain),
4303 isl_basic_map_from_range(range));
4306 __isl_give isl_map *isl_map_from_domain_and_range(__isl_take isl_set *domain,
4307 __isl_take isl_set *range)
4309 return isl_map_apply_range(isl_map_from_domain(domain),
4310 isl_map_from_range(range));
4313 struct isl_set *isl_set_from_map(struct isl_map *map)
4316 struct isl_set *set = NULL;
4320 map = isl_map_cow(map);
4323 map->dim = isl_dim_as_set_dim(map->dim);
4326 set = (struct isl_set *)map;
4327 for (i = 0; i < map->n; ++i) {
4328 set->p[i] = isl_basic_set_from_basic_map(map->p[i]);
4338 struct isl_map *isl_map_alloc_dim(struct isl_dim *dim, int n, unsigned flags)
4340 struct isl_map *map;
4344 isl_assert(dim->ctx, n >= 0, return NULL);
4345 map = isl_alloc(dim->ctx, struct isl_map,
4346 sizeof(struct isl_map) +
4347 (n - 1) * sizeof(struct isl_basic_map *));
4351 map->ctx = dim->ctx;
4352 isl_ctx_ref(map->ctx);
4364 struct isl_map *isl_map_alloc(struct isl_ctx *ctx,
4365 unsigned nparam, unsigned in, unsigned out, int n,
4368 struct isl_map *map;
4369 struct isl_dim *dims;
4371 dims = isl_dim_alloc(ctx, nparam, in, out);
4375 map = isl_map_alloc_dim(dims, n, flags);
4379 struct isl_basic_map *isl_basic_map_empty(struct isl_dim *dim)
4381 struct isl_basic_map *bmap;
4382 bmap = isl_basic_map_alloc_dim(dim, 0, 1, 0);
4383 bmap = isl_basic_map_set_to_empty(bmap);
4387 struct isl_basic_set *isl_basic_set_empty(struct isl_dim *dim)
4389 struct isl_basic_set *bset;
4390 bset = isl_basic_set_alloc_dim(dim, 0, 1, 0);
4391 bset = isl_basic_set_set_to_empty(bset);
4395 struct isl_basic_map *isl_basic_map_empty_like(struct isl_basic_map *model)
4397 struct isl_basic_map *bmap;
4400 bmap = isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
4401 bmap = isl_basic_map_set_to_empty(bmap);
4405 struct isl_basic_map *isl_basic_map_empty_like_map(struct isl_map *model)
4407 struct isl_basic_map *bmap;
4410 bmap = isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
4411 bmap = isl_basic_map_set_to_empty(bmap);
4415 struct isl_basic_set *isl_basic_set_empty_like(struct isl_basic_set *model)
4417 struct isl_basic_set *bset;
4420 bset = isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
4421 bset = isl_basic_set_set_to_empty(bset);
4425 struct isl_basic_map *isl_basic_map_universe(struct isl_dim *dim)
4427 struct isl_basic_map *bmap;
4428 bmap = isl_basic_map_alloc_dim(dim, 0, 0, 0);
4429 bmap = isl_basic_map_finalize(bmap);
4433 struct isl_basic_set *isl_basic_set_universe(struct isl_dim *dim)
4435 struct isl_basic_set *bset;
4436 bset = isl_basic_set_alloc_dim(dim, 0, 0, 0);
4437 bset = isl_basic_set_finalize(bset);
4441 __isl_give isl_basic_map *isl_basic_map_nat_universe(__isl_take isl_dim *dim)
4444 unsigned total = isl_dim_total(dim);
4445 isl_basic_map *bmap;
4447 bmap= isl_basic_map_alloc_dim(dim, 0, 0, total);
4448 for (i = 0; i < total; ++i) {
4449 int k = isl_basic_map_alloc_inequality(bmap);
4452 isl_seq_clr(bmap->ineq[k], 1 + total);
4453 isl_int_set_si(bmap->ineq[k][1 + i], 1);
4457 isl_basic_map_free(bmap);
4461 __isl_give isl_basic_set *isl_basic_set_nat_universe(__isl_take isl_dim *dim)
4463 return isl_basic_map_nat_universe(dim);
4466 __isl_give isl_map *isl_map_nat_universe(__isl_take isl_dim *dim)
4468 return isl_map_from_basic_map(isl_basic_map_nat_universe(dim));
4471 __isl_give isl_set *isl_set_nat_universe(__isl_take isl_dim *dim)
4473 return isl_map_nat_universe(dim);
4476 __isl_give isl_basic_map *isl_basic_map_universe_like(
4477 __isl_keep isl_basic_map *model)
4481 return isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
4484 struct isl_basic_set *isl_basic_set_universe_like(struct isl_basic_set *model)
4488 return isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
4491 __isl_give isl_basic_set *isl_basic_set_universe_like_set(
4492 __isl_keep isl_set *model)
4496 return isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
4499 struct isl_map *isl_map_empty(struct isl_dim *dim)
4501 return isl_map_alloc_dim(dim, 0, ISL_MAP_DISJOINT);
4504 struct isl_map *isl_map_empty_like(struct isl_map *model)
4508 return isl_map_alloc_dim(isl_dim_copy(model->dim), 0, ISL_MAP_DISJOINT);
4511 struct isl_map *isl_map_empty_like_basic_map(struct isl_basic_map *model)
4515 return isl_map_alloc_dim(isl_dim_copy(model->dim), 0, ISL_MAP_DISJOINT);
4518 struct isl_set *isl_set_empty(struct isl_dim *dim)
4520 return isl_set_alloc_dim(dim, 0, ISL_MAP_DISJOINT);
4523 struct isl_set *isl_set_empty_like(struct isl_set *model)
4527 return isl_set_empty(isl_dim_copy(model->dim));
4530 struct isl_map *isl_map_universe(struct isl_dim *dim)
4532 struct isl_map *map;
4535 map = isl_map_alloc_dim(isl_dim_copy(dim), 1, ISL_MAP_DISJOINT);
4536 map = isl_map_add_basic_map(map, isl_basic_map_universe(dim));
4540 struct isl_set *isl_set_universe(struct isl_dim *dim)
4542 struct isl_set *set;
4545 set = isl_set_alloc_dim(isl_dim_copy(dim), 1, ISL_MAP_DISJOINT);
4546 set = isl_set_add_basic_set(set, isl_basic_set_universe(dim));
4550 __isl_give isl_set *isl_set_universe_like(__isl_keep isl_set *model)
4554 return isl_set_universe(isl_dim_copy(model->dim));
4557 struct isl_map *isl_map_dup(struct isl_map *map)
4560 struct isl_map *dup;
4564 dup = isl_map_alloc_dim(isl_dim_copy(map->dim), map->n, map->flags);
4565 for (i = 0; i < map->n; ++i)
4566 dup = isl_map_add_basic_map(dup, isl_basic_map_copy(map->p[i]));
4570 __isl_give isl_map *isl_map_add_basic_map(__isl_take isl_map *map,
4571 __isl_take isl_basic_map *bmap)
4575 if (isl_basic_map_plain_is_empty(bmap)) {
4576 isl_basic_map_free(bmap);
4579 isl_assert(map->ctx, isl_dim_equal(map->dim, bmap->dim), goto error);
4580 isl_assert(map->ctx, map->n < map->size, goto error);
4581 map->p[map->n] = bmap;
4583 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4589 isl_basic_map_free(bmap);
4593 void isl_map_free(struct isl_map *map)
4603 isl_ctx_deref(map->ctx);
4604 for (i = 0; i < map->n; ++i)
4605 isl_basic_map_free(map->p[i]);
4606 isl_dim_free(map->dim);
4610 struct isl_map *isl_map_extend(struct isl_map *base,
4611 unsigned nparam, unsigned n_in, unsigned n_out)
4615 base = isl_map_cow(base);
4619 base->dim = isl_dim_extend(base->dim, nparam, n_in, n_out);
4622 for (i = 0; i < base->n; ++i) {
4623 base->p[i] = isl_basic_map_extend_dim(base->p[i],
4624 isl_dim_copy(base->dim), 0, 0, 0);
4634 struct isl_set *isl_set_extend(struct isl_set *base,
4635 unsigned nparam, unsigned dim)
4637 return (struct isl_set *)isl_map_extend((struct isl_map *)base,
4641 static struct isl_basic_map *isl_basic_map_fix_pos_si(
4642 struct isl_basic_map *bmap, unsigned pos, int value)
4646 bmap = isl_basic_map_cow(bmap);
4647 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
4648 j = isl_basic_map_alloc_equality(bmap);
4651 isl_seq_clr(bmap->eq[j] + 1, isl_basic_map_total_dim(bmap));
4652 isl_int_set_si(bmap->eq[j][pos], -1);
4653 isl_int_set_si(bmap->eq[j][0], value);
4654 bmap = isl_basic_map_simplify(bmap);
4655 return isl_basic_map_finalize(bmap);
4657 isl_basic_map_free(bmap);
4661 static __isl_give isl_basic_map *isl_basic_map_fix_pos(
4662 __isl_take isl_basic_map *bmap, unsigned pos, isl_int value)
4666 bmap = isl_basic_map_cow(bmap);
4667 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
4668 j = isl_basic_map_alloc_equality(bmap);
4671 isl_seq_clr(bmap->eq[j] + 1, isl_basic_map_total_dim(bmap));
4672 isl_int_set_si(bmap->eq[j][pos], -1);
4673 isl_int_set(bmap->eq[j][0], value);
4674 bmap = isl_basic_map_simplify(bmap);
4675 return isl_basic_map_finalize(bmap);
4677 isl_basic_map_free(bmap);
4681 struct isl_basic_map *isl_basic_map_fix_si(struct isl_basic_map *bmap,
4682 enum isl_dim_type type, unsigned pos, int value)
4686 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
4687 return isl_basic_map_fix_pos_si(bmap,
4688 isl_basic_map_offset(bmap, type) + pos, value);
4690 isl_basic_map_free(bmap);
4694 __isl_give isl_basic_map *isl_basic_map_fix(__isl_take isl_basic_map *bmap,
4695 enum isl_dim_type type, unsigned pos, isl_int value)
4699 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
4700 return isl_basic_map_fix_pos(bmap,
4701 isl_basic_map_offset(bmap, type) + pos, value);
4703 isl_basic_map_free(bmap);
4707 struct isl_basic_set *isl_basic_set_fix_si(struct isl_basic_set *bset,
4708 enum isl_dim_type type, unsigned pos, int value)
4710 return (struct isl_basic_set *)
4711 isl_basic_map_fix_si((struct isl_basic_map *)bset,
4715 __isl_give isl_basic_set *isl_basic_set_fix(__isl_take isl_basic_set *bset,
4716 enum isl_dim_type type, unsigned pos, isl_int value)
4718 return (struct isl_basic_set *)
4719 isl_basic_map_fix((struct isl_basic_map *)bset,
4723 struct isl_basic_map *isl_basic_map_fix_input_si(struct isl_basic_map *bmap,
4724 unsigned input, int value)
4726 return isl_basic_map_fix_si(bmap, isl_dim_in, input, value);
4729 struct isl_basic_set *isl_basic_set_fix_dim_si(struct isl_basic_set *bset,
4730 unsigned dim, int value)
4732 return (struct isl_basic_set *)
4733 isl_basic_map_fix_si((struct isl_basic_map *)bset,
4734 isl_dim_set, dim, value);
4737 struct isl_map *isl_map_fix_si(struct isl_map *map,
4738 enum isl_dim_type type, unsigned pos, 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_si(map->p[i], type, pos, value);
4752 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4759 __isl_give isl_set *isl_set_fix_si(__isl_take isl_set *set,
4760 enum isl_dim_type type, unsigned pos, int value)
4762 return (struct isl_set *)
4763 isl_map_fix_si((struct isl_map *)set, type, pos, value);
4766 __isl_give isl_map *isl_map_fix(__isl_take isl_map *map,
4767 enum isl_dim_type type, unsigned pos, isl_int value)
4771 map = isl_map_cow(map);
4775 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
4776 for (i = 0; i < map->n; ++i) {
4777 map->p[i] = isl_basic_map_fix(map->p[i], type, pos, value);
4781 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4788 __isl_give isl_set *isl_set_fix(__isl_take isl_set *set,
4789 enum isl_dim_type type, unsigned pos, isl_int value)
4791 return (struct isl_set *)isl_map_fix((isl_map *)set, type, pos, value);
4794 struct isl_map *isl_map_fix_input_si(struct isl_map *map,
4795 unsigned input, int value)
4797 return isl_map_fix_si(map, isl_dim_in, input, value);
4800 struct isl_set *isl_set_fix_dim_si(struct isl_set *set, unsigned dim, int value)
4802 return (struct isl_set *)
4803 isl_map_fix_si((struct isl_map *)set, isl_dim_set, dim, value);
4806 __isl_give isl_basic_map *isl_basic_map_lower_bound_si(
4807 __isl_take isl_basic_map *bmap,
4808 enum isl_dim_type type, unsigned pos, int value)
4814 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
4815 pos += isl_basic_map_offset(bmap, type);
4816 bmap = isl_basic_map_cow(bmap);
4817 bmap = isl_basic_map_extend_constraints(bmap, 0, 1);
4818 j = isl_basic_map_alloc_inequality(bmap);
4821 isl_seq_clr(bmap->ineq[j], 1 + isl_basic_map_total_dim(bmap));
4822 isl_int_set_si(bmap->ineq[j][pos], 1);
4823 isl_int_set_si(bmap->ineq[j][0], -value);
4824 bmap = isl_basic_map_simplify(bmap);
4825 return isl_basic_map_finalize(bmap);
4827 isl_basic_map_free(bmap);
4831 struct isl_basic_set *isl_basic_set_lower_bound_dim(struct isl_basic_set *bset,
4832 unsigned dim, isl_int value)
4836 bset = isl_basic_set_cow(bset);
4837 bset = isl_basic_set_extend_constraints(bset, 0, 1);
4838 j = isl_basic_set_alloc_inequality(bset);
4841 isl_seq_clr(bset->ineq[j], 1 + isl_basic_set_total_dim(bset));
4842 isl_int_set_si(bset->ineq[j][1 + isl_basic_set_n_param(bset) + dim], 1);
4843 isl_int_neg(bset->ineq[j][0], value);
4844 bset = isl_basic_set_simplify(bset);
4845 return isl_basic_set_finalize(bset);
4847 isl_basic_set_free(bset);
4851 __isl_give isl_map *isl_map_lower_bound_si(__isl_take isl_map *map,
4852 enum isl_dim_type type, unsigned pos, int value)
4856 map = isl_map_cow(map);
4860 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
4861 for (i = 0; i < map->n; ++i) {
4862 map->p[i] = isl_basic_map_lower_bound_si(map->p[i],
4867 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4874 __isl_give isl_set *isl_set_lower_bound_si(__isl_take isl_set *set,
4875 enum isl_dim_type type, unsigned pos, int value)
4877 return (struct isl_set *)
4878 isl_map_lower_bound_si((struct isl_map *)set, type, pos, value);
4881 struct isl_set *isl_set_lower_bound_dim(struct isl_set *set, unsigned dim,
4886 set = isl_set_cow(set);
4890 isl_assert(set->ctx, dim < isl_set_n_dim(set), goto error);
4891 for (i = 0; i < set->n; ++i) {
4892 set->p[i] = isl_basic_set_lower_bound_dim(set->p[i], dim, value);
4902 struct isl_map *isl_map_reverse(struct isl_map *map)
4906 map = isl_map_cow(map);
4910 map->dim = isl_dim_reverse(map->dim);
4913 for (i = 0; i < map->n; ++i) {
4914 map->p[i] = isl_basic_map_reverse(map->p[i]);
4918 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4925 static struct isl_map *isl_basic_map_partial_lexopt(
4926 struct isl_basic_map *bmap, struct isl_basic_set *dom,
4927 struct isl_set **empty, int max)
4931 if (bmap->ctx->opt->pip == ISL_PIP_PIP)
4932 return isl_pip_basic_map_lexopt(bmap, dom, empty, max);
4934 return isl_tab_basic_map_partial_lexopt(bmap, dom, empty, max);
4936 isl_basic_map_free(bmap);
4937 isl_basic_set_free(dom);
4943 struct isl_map *isl_basic_map_partial_lexmax(
4944 struct isl_basic_map *bmap, struct isl_basic_set *dom,
4945 struct isl_set **empty)
4947 return isl_basic_map_partial_lexopt(bmap, dom, empty, 1);
4950 struct isl_map *isl_basic_map_partial_lexmin(
4951 struct isl_basic_map *bmap, struct isl_basic_set *dom,
4952 struct isl_set **empty)
4954 return isl_basic_map_partial_lexopt(bmap, dom, empty, 0);
4957 struct isl_set *isl_basic_set_partial_lexmin(
4958 struct isl_basic_set *bset, struct isl_basic_set *dom,
4959 struct isl_set **empty)
4961 return (struct isl_set *)
4962 isl_basic_map_partial_lexmin((struct isl_basic_map *)bset,
4966 struct isl_set *isl_basic_set_partial_lexmax(
4967 struct isl_basic_set *bset, struct isl_basic_set *dom,
4968 struct isl_set **empty)
4970 return (struct isl_set *)
4971 isl_basic_map_partial_lexmax((struct isl_basic_map *)bset,
4975 /* Given a basic map "bmap", compute the lexicographically minimal
4976 * (or maximal) image element for each domain element in dom.
4977 * Set *empty to those elements in dom that do not have an image element.
4979 * We first make sure the basic sets in dom are disjoint and then
4980 * simply collect the results over each of the basic sets separately.
4981 * We could probably improve the efficiency a bit by moving the union
4982 * domain down into the parametric integer programming.
4984 static __isl_give isl_map *basic_map_partial_lexopt(
4985 __isl_take isl_basic_map *bmap, __isl_take isl_set *dom,
4986 __isl_give isl_set **empty, int max)
4989 struct isl_map *res;
4991 dom = isl_set_make_disjoint(dom);
4995 if (isl_set_plain_is_empty(dom)) {
4996 res = isl_map_empty_like_basic_map(bmap);
4997 *empty = isl_set_empty_like(dom);
4999 isl_basic_map_free(bmap);
5003 res = isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap),
5004 isl_basic_set_copy(dom->p[0]), empty, max);
5006 for (i = 1; i < dom->n; ++i) {
5007 struct isl_map *res_i;
5008 struct isl_set *empty_i;
5010 res_i = isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap),
5011 isl_basic_set_copy(dom->p[i]), &empty_i, max);
5013 res = isl_map_union_disjoint(res, res_i);
5014 *empty = isl_set_union_disjoint(*empty, empty_i);
5018 isl_basic_map_free(bmap);
5023 isl_basic_map_free(bmap);
5027 /* Given a map "map", compute the lexicographically minimal
5028 * (or maximal) image element for each domain element in dom.
5029 * Set *empty to those elements in dom that do not have an image element.
5031 * We first compute the lexicographically minimal or maximal element
5032 * in the first basic map. This results in a partial solution "res"
5033 * and a subset "todo" of dom that still need to be handled.
5034 * We then consider each of the remaining maps in "map" and successively
5035 * improve both "res" and "todo".
5037 * Let res^k and todo^k be the results after k steps and let i = k + 1.
5038 * Assume we are computing the lexicographical maximum.
5039 * We first compute the lexicographically maximal element in basic map i.
5040 * This results in a partial solution res_i and a subset todo_i.
5041 * Then we combine these results with those obtain for the first k basic maps
5042 * to obtain a result that is valid for the first k+1 basic maps.
5043 * In particular, the set where there is no solution is the set where
5044 * there is no solution for the first k basic maps and also no solution
5045 * for the ith basic map, i.e.,
5047 * todo^i = todo^k * todo_i
5049 * On dom(res^k) * dom(res_i), we need to pick the larger of the two
5050 * solutions, arbitrarily breaking ties in favor of res^k.
5051 * That is, when res^k(a) >= res_i(a), we pick res^k and
5052 * when res^k(a) < res_i(a), we pick res_i. (Here, ">=" and "<" denote
5053 * the lexicographic order.)
5054 * In practice, we compute
5056 * res^k * (res_i . "<=")
5060 * res_i * (res^k . "<")
5062 * Finally, we consider the symmetric difference of dom(res^k) and dom(res_i),
5063 * where only one of res^k and res_i provides a solution and we simply pick
5070 * Note that we only compute these intersections when dom(res^k) intersects
5071 * dom(res_i). Otherwise, the only effect of these intersections is to
5072 * potentially break up res^k and res_i into smaller pieces.
5073 * We want to avoid such splintering as much as possible.
5074 * In fact, an earlier implementation of this function would look for
5075 * better results in the domain of res^k and for extra results in todo^k,
5076 * but this would always result in a splintering according to todo^k,
5077 * even when the domain of basic map i is disjoint from the domains of
5078 * the previous basic maps.
5080 static __isl_give isl_map *isl_map_partial_lexopt(
5081 __isl_take isl_map *map, __isl_take isl_set *dom,
5082 __isl_give isl_set **empty, int max)
5085 struct isl_map *res;
5086 struct isl_set *todo;
5091 if (isl_map_plain_is_empty(map)) {
5099 res = basic_map_partial_lexopt(isl_basic_map_copy(map->p[0]),
5100 isl_set_copy(dom), &todo, max);
5102 for (i = 1; i < map->n; ++i) {
5106 isl_dim *dim = isl_dim_range(isl_map_get_dim(res));
5108 res_i = basic_map_partial_lexopt(isl_basic_map_copy(map->p[i]),
5109 isl_set_copy(dom), &todo_i, max);
5112 lt = isl_map_lex_lt(isl_dim_copy(dim));
5113 le = isl_map_lex_le(dim);
5115 lt = isl_map_lex_gt(isl_dim_copy(dim));
5116 le = isl_map_lex_ge(dim);
5118 lt = isl_map_apply_range(isl_map_copy(res), lt);
5119 lt = isl_map_intersect(lt, isl_map_copy(res_i));
5120 le = isl_map_apply_range(isl_map_copy(res_i), le);
5121 le = isl_map_intersect(le, isl_map_copy(res));
5123 if (!isl_map_is_empty(lt) || !isl_map_is_empty(le)) {
5124 res = isl_map_intersect_domain(res,
5125 isl_set_copy(todo_i));
5126 res_i = isl_map_intersect_domain(res_i,
5127 isl_set_copy(todo));
5130 res = isl_map_union_disjoint(res, res_i);
5131 res = isl_map_union_disjoint(res, lt);
5132 res = isl_map_union_disjoint(res, le);
5134 todo = isl_set_intersect(todo, todo_i);
5154 __isl_give isl_map *isl_map_partial_lexmax(
5155 __isl_take isl_map *map, __isl_take isl_set *dom,
5156 __isl_give isl_set **empty)
5158 return isl_map_partial_lexopt(map, dom, empty, 1);
5161 __isl_give isl_map *isl_map_partial_lexmin(
5162 __isl_take isl_map *map, __isl_take isl_set *dom,
5163 __isl_give isl_set **empty)
5165 return isl_map_partial_lexopt(map, dom, empty, 0);
5168 __isl_give isl_set *isl_set_partial_lexmin(
5169 __isl_take isl_set *set, __isl_take isl_set *dom,
5170 __isl_give isl_set **empty)
5172 return (struct isl_set *)
5173 isl_map_partial_lexmin((struct isl_map *)set,
5177 __isl_give isl_set *isl_set_partial_lexmax(
5178 __isl_take isl_set *set, __isl_take isl_set *dom,
5179 __isl_give isl_set **empty)
5181 return (struct isl_set *)
5182 isl_map_partial_lexmax((struct isl_map *)set,
5186 __isl_give isl_map *isl_basic_map_lexopt(__isl_take isl_basic_map *bmap, int max)
5188 struct isl_basic_set *dom = NULL;
5189 struct isl_dim *dom_dim;
5193 dom_dim = isl_dim_domain(isl_dim_copy(bmap->dim));
5194 dom = isl_basic_set_universe(dom_dim);
5195 return isl_basic_map_partial_lexopt(bmap, dom, NULL, max);
5197 isl_basic_map_free(bmap);
5201 __isl_give isl_map *isl_basic_map_lexmin(__isl_take isl_basic_map *bmap)
5203 return isl_basic_map_lexopt(bmap, 0);
5206 __isl_give isl_map *isl_basic_map_lexmax(__isl_take isl_basic_map *bmap)
5208 return isl_basic_map_lexopt(bmap, 1);
5211 __isl_give isl_set *isl_basic_set_lexmin(__isl_take isl_basic_set *bset)
5213 return (isl_set *)isl_basic_map_lexmin((isl_basic_map *)bset);
5216 __isl_give isl_set *isl_basic_set_lexmax(__isl_take isl_basic_set *bset)
5218 return (isl_set *)isl_basic_map_lexmax((isl_basic_map *)bset);
5221 __isl_give isl_map *isl_map_lexopt(__isl_take isl_map *map, int max)
5223 struct isl_set *dom = NULL;
5224 struct isl_dim *dom_dim;
5228 dom_dim = isl_dim_domain(isl_dim_copy(map->dim));
5229 dom = isl_set_universe(dom_dim);
5230 return isl_map_partial_lexopt(map, dom, NULL, max);
5236 __isl_give isl_map *isl_map_lexmin(__isl_take isl_map *map)
5238 return isl_map_lexopt(map, 0);
5241 __isl_give isl_map *isl_map_lexmax(__isl_take isl_map *map)
5243 return isl_map_lexopt(map, 1);
5246 __isl_give isl_set *isl_set_lexmin(__isl_take isl_set *set)
5248 return (isl_set *)isl_map_lexmin((isl_map *)set);
5251 __isl_give isl_set *isl_set_lexmax(__isl_take isl_set *set)
5253 return (isl_set *)isl_map_lexmax((isl_map *)set);
5256 /* Construct a map that equates the two given dimensions in the given space.
5258 static __isl_give isl_map *equate(__isl_take isl_dim *dim,
5259 enum isl_dim_type src_type, int src_pos,
5260 enum isl_dim_type dst_type, int dst_pos)
5262 isl_basic_map *bmap;
5265 bmap = isl_basic_map_alloc_dim(dim, 0, 1, 0);
5266 k = isl_basic_map_alloc_equality(bmap);
5269 isl_seq_clr(bmap->eq[k], 1 + isl_basic_map_total_dim(bmap));
5270 src_pos += isl_basic_map_offset(bmap, src_type);
5271 dst_pos += isl_basic_map_offset(bmap, dst_type);
5272 isl_int_set_si(bmap->eq[k][src_pos], 1);
5273 isl_int_set_si(bmap->eq[k][dst_pos], -1);
5275 return isl_map_from_basic_map(bmap);
5277 isl_basic_map_free(bmap);
5281 /* Extract the first and only affine expression from list
5282 * and then add it to *pwaff with the given dom.
5283 * This domain is known to be disjoint from other domains
5284 * because of the way isl_basic_set_foreach_lexmax works.
5286 static int update_dim_opt(__isl_take isl_basic_set *dom,
5287 __isl_take isl_aff_list *list, void *user)
5289 isl_ctx *ctx = isl_basic_set_get_ctx(dom);
5291 isl_pw_aff **pwaff = user;
5292 isl_pw_aff *pwaff_i;
5294 if (isl_aff_list_n_aff(list) != 1)
5295 isl_die(ctx, isl_error_internal,
5296 "expecting single element list", goto error);
5298 aff = isl_aff_list_get_aff(list, 0);
5299 pwaff_i = isl_pw_aff_alloc(isl_set_from_basic_set(dom), aff);
5301 *pwaff = isl_pw_aff_add_disjoint(*pwaff, pwaff_i);
5303 isl_aff_list_free(list);
5307 isl_basic_set_free(dom);
5308 isl_aff_list_free(list);
5312 /* Given a one-dimensional basic set, compute the minimum or maximum of that
5313 * dimension as an isl_pw_aff.
5315 * The isl_pw_aff is constructed by having isl_basic_set_foreach_lexopt
5316 * call update_dim_opt on each leaf of the result.
5318 static __isl_give isl_pw_aff *basic_set_dim_opt(__isl_keep isl_basic_set *bset,
5321 isl_dim *dim = isl_basic_set_get_dim(bset);
5325 dim = isl_dim_domain(isl_dim_from_range(dim));
5326 pwaff = isl_pw_aff_empty(dim);
5328 r = isl_basic_set_foreach_lexopt(bset, max, &update_dim_opt, &pwaff);
5330 return isl_pw_aff_free(pwaff);
5335 /* Compute the minimum or maximum of the given set dimension
5336 * as a function of the parameters, but independently of
5337 * the other set dimensions.
5339 * We first project the set onto the given dimension and then compute
5340 * the "lexicographic" maximum in each basic set, combining the results
5341 * using isl_pw_aff_union_max.
5343 static __isl_give isl_pw_aff *set_dim_opt(__isl_take isl_set *set, int pos,
5350 map = isl_map_from_domain(set);
5351 map = isl_map_add_dims(map, isl_dim_out, 1);
5352 map = isl_map_intersect(map,
5353 equate(isl_map_get_dim(map), isl_dim_in, pos,
5355 set = isl_map_range(map);
5360 isl_dim *dim = isl_set_get_dim(set);
5361 dim = isl_dim_domain(isl_dim_from_range(dim));
5363 return isl_pw_aff_empty(dim);
5366 pwaff = basic_set_dim_opt(set->p[0], max);
5367 for (i = 1; i < set->n; ++i) {
5368 isl_pw_aff *pwaff_i;
5370 pwaff_i = basic_set_dim_opt(set->p[i], max);
5371 pwaff = isl_pw_aff_union_opt(pwaff, pwaff_i, max);
5379 /* Compute the maximum of the given set dimension as a function of the
5380 * parameters, but independently of the other set dimensions.
5382 __isl_give isl_pw_aff *isl_set_dim_max(__isl_take isl_set *set, int pos)
5384 return set_dim_opt(set, pos, 1);
5387 /* Compute the minimum of the given set dimension as a function of the
5388 * parameters, but independently of the other set dimensions.
5390 __isl_give isl_pw_aff *isl_set_dim_min(__isl_take isl_set *set, int pos)
5392 return set_dim_opt(set, pos, 0);
5395 /* Apply a preimage specified by "mat" on the parameters of "bset".
5396 * bset is assumed to have only parameters and divs.
5398 static struct isl_basic_set *basic_set_parameter_preimage(
5399 struct isl_basic_set *bset, struct isl_mat *mat)
5406 bset->dim = isl_dim_cow(bset->dim);
5410 nparam = isl_basic_set_dim(bset, isl_dim_param);
5412 isl_assert(bset->ctx, mat->n_row == 1 + nparam, goto error);
5414 bset->dim->nparam = 0;
5415 bset->dim->n_out = nparam;
5416 bset = isl_basic_set_preimage(bset, mat);
5418 bset->dim->nparam = bset->dim->n_out;
5419 bset->dim->n_out = 0;
5424 isl_basic_set_free(bset);
5428 /* Apply a preimage specified by "mat" on the parameters of "set".
5429 * set is assumed to have only parameters and divs.
5431 static struct isl_set *set_parameter_preimage(
5432 struct isl_set *set, struct isl_mat *mat)
5434 struct isl_dim *dim = NULL;
5440 dim = isl_dim_copy(set->dim);
5441 dim = isl_dim_cow(dim);
5445 nparam = isl_set_dim(set, isl_dim_param);
5447 isl_assert(set->ctx, mat->n_row == 1 + nparam, goto error);
5450 dim->n_out = nparam;
5451 isl_set_reset_dim(set, dim);
5452 set = isl_set_preimage(set, mat);
5455 dim = isl_dim_copy(set->dim);
5456 dim = isl_dim_cow(dim);
5459 dim->nparam = dim->n_out;
5461 isl_set_reset_dim(set, dim);
5471 /* Intersect the basic set "bset" with the affine space specified by the
5472 * equalities in "eq".
5474 static struct isl_basic_set *basic_set_append_equalities(
5475 struct isl_basic_set *bset, struct isl_mat *eq)
5483 bset = isl_basic_set_extend_dim(bset, isl_dim_copy(bset->dim), 0,
5488 len = 1 + isl_dim_total(bset->dim) + bset->extra;
5489 for (i = 0; i < eq->n_row; ++i) {
5490 k = isl_basic_set_alloc_equality(bset);
5493 isl_seq_cpy(bset->eq[k], eq->row[i], eq->n_col);
5494 isl_seq_clr(bset->eq[k] + eq->n_col, len - eq->n_col);
5498 bset = isl_basic_set_gauss(bset, NULL);
5499 bset = isl_basic_set_finalize(bset);
5504 isl_basic_set_free(bset);
5508 /* Intersect the set "set" with the affine space specified by the
5509 * equalities in "eq".
5511 static struct isl_set *set_append_equalities(struct isl_set *set,
5519 for (i = 0; i < set->n; ++i) {
5520 set->p[i] = basic_set_append_equalities(set->p[i],
5533 /* Project the given basic set onto its parameter domain, possibly introducing
5534 * new, explicit, existential variables in the constraints.
5535 * The input has parameters and (possibly implicit) existential variables.
5536 * The output has the same parameters, but only
5537 * explicit existentially quantified variables.
5539 * The actual projection is performed by pip, but pip doesn't seem
5540 * to like equalities very much, so we first remove the equalities
5541 * among the parameters by performing a variable compression on
5542 * the parameters. Afterward, an inverse transformation is performed
5543 * and the equalities among the parameters are inserted back in.
5545 static struct isl_set *parameter_compute_divs(struct isl_basic_set *bset)
5549 struct isl_mat *T, *T2;
5550 struct isl_set *set;
5551 unsigned nparam, n_div;
5553 bset = isl_basic_set_cow(bset);
5557 if (bset->n_eq == 0)
5558 return isl_basic_set_lexmin(bset);
5560 isl_basic_set_gauss(bset, NULL);
5562 nparam = isl_basic_set_dim(bset, isl_dim_param);
5563 n_div = isl_basic_set_dim(bset, isl_dim_div);
5565 for (i = 0, j = n_div - 1; i < bset->n_eq && j >= 0; --j) {
5566 if (!isl_int_is_zero(bset->eq[i][1 + nparam + j]))
5569 if (i == bset->n_eq)
5570 return isl_basic_set_lexmin(bset);
5572 eq = isl_mat_sub_alloc6(bset->ctx, bset->eq, i, bset->n_eq - i,
5574 eq = isl_mat_cow(eq);
5575 T = isl_mat_variable_compression(isl_mat_copy(eq), &T2);
5576 if (T && T->n_col == 0) {
5580 bset = isl_basic_set_set_to_empty(bset);
5581 return isl_set_from_basic_set(bset);
5583 bset = basic_set_parameter_preimage(bset, T);
5585 set = isl_basic_set_lexmin(bset);
5586 set = set_parameter_preimage(set, T2);
5587 set = set_append_equalities(set, eq);
5591 /* Compute an explicit representation for all the existentially
5592 * quantified variables.
5593 * The input and output dimensions are first turned into parameters.
5594 * compute_divs then returns a map with the same parameters and
5595 * no input or output dimensions and the dimension specification
5596 * is reset to that of the input.
5598 static struct isl_map *compute_divs(struct isl_basic_map *bmap)
5600 struct isl_basic_set *bset;
5601 struct isl_set *set;
5602 struct isl_map *map;
5603 struct isl_dim *dim, *orig_dim = NULL;
5608 bmap = isl_basic_map_cow(bmap);
5612 nparam = isl_basic_map_dim(bmap, isl_dim_param);
5613 n_in = isl_basic_map_dim(bmap, isl_dim_in);
5614 n_out = isl_basic_map_dim(bmap, isl_dim_out);
5615 dim = isl_dim_set_alloc(bmap->ctx, nparam + n_in + n_out, 0);
5619 orig_dim = bmap->dim;
5621 bset = (struct isl_basic_set *)bmap;
5623 set = parameter_compute_divs(bset);
5624 map = (struct isl_map *)set;
5625 map = isl_map_reset_dim(map, orig_dim);
5629 isl_basic_map_free(bmap);
5633 int isl_basic_map_divs_known(__isl_keep isl_basic_map *bmap)
5641 off = isl_dim_total(bmap->dim);
5642 for (i = 0; i < bmap->n_div; ++i) {
5643 if (isl_int_is_zero(bmap->div[i][0]))
5645 isl_assert(bmap->ctx, isl_int_is_zero(bmap->div[i][1+1+off+i]),
5651 static int map_divs_known(__isl_keep isl_map *map)
5658 for (i = 0; i < map->n; ++i) {
5659 int known = isl_basic_map_divs_known(map->p[i]);
5667 /* If bmap contains any unknown divs, then compute explicit
5668 * expressions for them. However, this computation may be
5669 * quite expensive, so first try to remove divs that aren't
5672 struct isl_map *isl_basic_map_compute_divs(struct isl_basic_map *bmap)
5675 struct isl_map *map;
5677 known = isl_basic_map_divs_known(bmap);
5681 return isl_map_from_basic_map(bmap);
5683 bmap = isl_basic_map_drop_redundant_divs(bmap);
5685 known = isl_basic_map_divs_known(bmap);
5689 return isl_map_from_basic_map(bmap);
5691 map = compute_divs(bmap);
5694 isl_basic_map_free(bmap);
5698 struct isl_map *isl_map_compute_divs(struct isl_map *map)
5702 struct isl_map *res;
5709 known = map_divs_known(map);
5717 res = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[0]));
5718 for (i = 1 ; i < map->n; ++i) {
5720 r2 = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[i]));
5721 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT))
5722 res = isl_map_union_disjoint(res, r2);
5724 res = isl_map_union(res, r2);
5731 struct isl_set *isl_basic_set_compute_divs(struct isl_basic_set *bset)
5733 return (struct isl_set *)
5734 isl_basic_map_compute_divs((struct isl_basic_map *)bset);
5737 struct isl_set *isl_set_compute_divs(struct isl_set *set)
5739 return (struct isl_set *)
5740 isl_map_compute_divs((struct isl_map *)set);
5743 struct isl_set *isl_map_domain(struct isl_map *map)
5746 struct isl_set *set;
5751 map = isl_map_cow(map);
5755 set = (struct isl_set *)map;
5756 set->dim = isl_dim_domain(set->dim);
5759 for (i = 0; i < map->n; ++i) {
5760 set->p[i] = isl_basic_map_domain(map->p[i]);
5764 ISL_F_CLR(set, ISL_MAP_DISJOINT);
5765 ISL_F_CLR(set, ISL_SET_NORMALIZED);
5772 static __isl_give isl_map *map_union_disjoint(__isl_take isl_map *map1,
5773 __isl_take isl_map *map2)
5777 struct isl_map *map = NULL;
5791 isl_assert(map1->ctx, isl_dim_equal(map1->dim, map2->dim), goto error);
5793 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
5794 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
5795 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
5797 map = isl_map_alloc_dim(isl_dim_copy(map1->dim),
5798 map1->n + map2->n, flags);
5801 for (i = 0; i < map1->n; ++i) {
5802 map = isl_map_add_basic_map(map,
5803 isl_basic_map_copy(map1->p[i]));
5807 for (i = 0; i < map2->n; ++i) {
5808 map = isl_map_add_basic_map(map,
5809 isl_basic_map_copy(map2->p[i]));
5823 __isl_give isl_map *isl_map_union_disjoint(__isl_take isl_map *map1,
5824 __isl_take isl_map *map2)
5826 return isl_map_align_params_map_map_and(map1, map2, &map_union_disjoint);
5829 struct isl_map *isl_map_union(struct isl_map *map1, struct isl_map *map2)
5831 map1 = isl_map_union_disjoint(map1, map2);
5835 ISL_F_CLR(map1, ISL_MAP_DISJOINT);
5839 struct isl_set *isl_set_union_disjoint(
5840 struct isl_set *set1, struct isl_set *set2)
5842 return (struct isl_set *)
5843 isl_map_union_disjoint(
5844 (struct isl_map *)set1, (struct isl_map *)set2);
5847 struct isl_set *isl_set_union(struct isl_set *set1, struct isl_set *set2)
5849 return (struct isl_set *)
5850 isl_map_union((struct isl_map *)set1, (struct isl_map *)set2);
5853 static __isl_give isl_map *map_intersect_range(__isl_take isl_map *map,
5854 __isl_take isl_set *set)
5857 struct isl_map *result;
5863 if (!isl_dim_match(map->dim, isl_dim_param, set->dim, isl_dim_param))
5864 isl_die(set->ctx, isl_error_invalid,
5865 "parameters don't match", goto error);
5867 if (isl_dim_size(set->dim, isl_dim_set) != 0 &&
5868 !isl_map_compatible_range(map, set))
5869 isl_die(set->ctx, isl_error_invalid,
5870 "incompatible spaces", goto error);
5872 if (isl_set_plain_is_universe(set)) {
5877 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT) &&
5878 ISL_F_ISSET(set, ISL_MAP_DISJOINT))
5879 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
5881 result = isl_map_alloc_dim(isl_dim_copy(map->dim),
5882 map->n * set->n, flags);
5885 for (i = 0; i < map->n; ++i)
5886 for (j = 0; j < set->n; ++j) {
5887 result = isl_map_add_basic_map(result,
5888 isl_basic_map_intersect_range(
5889 isl_basic_map_copy(map->p[i]),
5890 isl_basic_set_copy(set->p[j])));
5903 __isl_give isl_map *isl_map_intersect_range(__isl_take isl_map *map,
5904 __isl_take isl_set *set)
5906 return isl_map_align_params_map_map_and(map, set, &map_intersect_range);
5909 struct isl_map *isl_map_intersect_domain(
5910 struct isl_map *map, struct isl_set *set)
5912 return isl_map_reverse(
5913 isl_map_intersect_range(isl_map_reverse(map), set));
5916 static __isl_give isl_map *map_apply_domain(__isl_take isl_map *map1,
5917 __isl_take isl_map *map2)
5921 map1 = isl_map_reverse(map1);
5922 map1 = isl_map_apply_range(map1, map2);
5923 return isl_map_reverse(map1);
5930 __isl_give isl_map *isl_map_apply_domain(__isl_take isl_map *map1,
5931 __isl_take isl_map *map2)
5933 return isl_map_align_params_map_map_and(map1, map2, &map_apply_domain);
5936 static __isl_give isl_map *map_apply_range(__isl_take isl_map *map1,
5937 __isl_take isl_map *map2)
5939 struct isl_dim *dim_result;
5940 struct isl_map *result;
5946 dim_result = isl_dim_join(isl_dim_copy(map1->dim),
5947 isl_dim_copy(map2->dim));
5949 result = isl_map_alloc_dim(dim_result, map1->n * map2->n, 0);
5952 for (i = 0; i < map1->n; ++i)
5953 for (j = 0; j < map2->n; ++j) {
5954 result = isl_map_add_basic_map(result,
5955 isl_basic_map_apply_range(
5956 isl_basic_map_copy(map1->p[i]),
5957 isl_basic_map_copy(map2->p[j])));
5963 if (result && result->n <= 1)
5964 ISL_F_SET(result, ISL_MAP_DISJOINT);
5972 __isl_give isl_map *isl_map_apply_range(__isl_take isl_map *map1,
5973 __isl_take isl_map *map2)
5975 return isl_map_align_params_map_map_and(map1, map2, &map_apply_range);
5979 * returns range - domain
5981 struct isl_basic_set *isl_basic_map_deltas(struct isl_basic_map *bmap)
5983 isl_dim *dims, *target_dim;
5984 struct isl_basic_set *bset;
5991 isl_assert(bmap->ctx, isl_dim_tuple_match(bmap->dim, isl_dim_in,
5992 bmap->dim, isl_dim_out),
5994 target_dim = isl_dim_domain(isl_basic_map_get_dim(bmap));
5995 dim = isl_basic_map_n_in(bmap);
5996 nparam = isl_basic_map_n_param(bmap);
5997 bset = isl_basic_set_from_basic_map(bmap);
5998 bset = isl_basic_set_cow(bset);
5999 dims = isl_basic_set_get_dim(bset);
6000 dims = isl_dim_add(dims, isl_dim_set, dim);
6001 bset = isl_basic_set_extend_dim(bset, dims, 0, dim, 0);
6002 bset = isl_basic_set_swap_vars(bset, 2*dim);
6003 for (i = 0; i < dim; ++i) {
6004 int j = isl_basic_map_alloc_equality(
6005 (struct isl_basic_map *)bset);
6008 isl_seq_clr(bset->eq[j], 1 + isl_basic_set_total_dim(bset));
6009 isl_int_set_si(bset->eq[j][1+nparam+i], 1);
6010 isl_int_set_si(bset->eq[j][1+nparam+dim+i], 1);
6011 isl_int_set_si(bset->eq[j][1+nparam+2*dim+i], -1);
6013 bset = isl_basic_set_project_out(bset, isl_dim_set, dim, 2*dim);
6014 bset = isl_basic_set_reset_dim(bset, target_dim);
6017 isl_basic_map_free(bmap);
6022 * returns range - domain
6024 struct isl_set *isl_map_deltas(struct isl_map *map)
6028 struct isl_set *result;
6033 isl_assert(map->ctx, isl_dim_tuple_match(map->dim, isl_dim_in,
6034 map->dim, isl_dim_out),
6036 dim = isl_map_get_dim(map);
6037 dim = isl_dim_domain(dim);
6038 result = isl_set_alloc_dim(dim, map->n, 0);
6041 for (i = 0; i < map->n; ++i)
6042 result = isl_set_add_basic_set(result,
6043 isl_basic_map_deltas(isl_basic_map_copy(map->p[i])));
6052 * returns [domain -> range] -> range - domain
6054 __isl_give isl_basic_map *isl_basic_map_deltas_map(
6055 __isl_take isl_basic_map *bmap)
6059 isl_basic_map *domain;
6063 if (!isl_dim_tuple_match(bmap->dim, isl_dim_in, bmap->dim, isl_dim_out))
6064 isl_die(bmap->ctx, isl_error_invalid,
6065 "domain and range don't match", goto error);
6067 nparam = isl_basic_map_dim(bmap, isl_dim_param);
6068 n = isl_basic_map_dim(bmap, isl_dim_in);
6070 dim = isl_dim_from_range(isl_dim_domain(isl_basic_map_get_dim(bmap)));
6071 domain = isl_basic_map_universe(dim);
6073 bmap = isl_basic_map_from_domain(isl_basic_map_wrap(bmap));
6074 bmap = isl_basic_map_apply_range(bmap, domain);
6075 bmap = isl_basic_map_extend_constraints(bmap, n, 0);
6077 total = isl_basic_map_total_dim(bmap);
6079 for (i = 0; i < n; ++i) {
6080 k = isl_basic_map_alloc_equality(bmap);
6083 isl_seq_clr(bmap->eq[k], 1 + total);
6084 isl_int_set_si(bmap->eq[k][1 + nparam + i], 1);
6085 isl_int_set_si(bmap->eq[k][1 + nparam + n + i], -1);
6086 isl_int_set_si(bmap->eq[k][1 + nparam + n + n + i], 1);
6089 bmap = isl_basic_map_gauss(bmap, NULL);
6090 return isl_basic_map_finalize(bmap);
6092 isl_basic_map_free(bmap);
6097 * returns [domain -> range] -> range - domain
6099 __isl_give isl_map *isl_map_deltas_map(__isl_take isl_map *map)
6102 isl_dim *domain_dim;
6107 if (!isl_dim_tuple_match(map->dim, isl_dim_in, map->dim, isl_dim_out))
6108 isl_die(map->ctx, isl_error_invalid,
6109 "domain and range don't match", goto error);
6111 map = isl_map_cow(map);
6115 domain_dim = isl_dim_from_range(isl_dim_domain(isl_map_get_dim(map)));
6116 map->dim = isl_dim_from_domain(isl_dim_wrap(map->dim));
6117 map->dim = isl_dim_join(map->dim, domain_dim);
6120 for (i = 0; i < map->n; ++i) {
6121 map->p[i] = isl_basic_map_deltas_map(map->p[i]);
6125 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
6132 static struct isl_basic_map *basic_map_identity(struct isl_dim *dims)
6134 struct isl_basic_map *bmap;
6142 nparam = dims->nparam;
6144 bmap = isl_basic_map_alloc_dim(dims, 0, dim, 0);
6148 for (i = 0; i < dim; ++i) {
6149 int j = isl_basic_map_alloc_equality(bmap);
6152 isl_seq_clr(bmap->eq[j], 1 + isl_basic_map_total_dim(bmap));
6153 isl_int_set_si(bmap->eq[j][1+nparam+i], 1);
6154 isl_int_set_si(bmap->eq[j][1+nparam+dim+i], -1);
6156 return isl_basic_map_finalize(bmap);
6158 isl_basic_map_free(bmap);
6162 __isl_give isl_basic_map *isl_basic_map_identity(__isl_take isl_dim *dim)
6166 if (dim->n_in != dim->n_out)
6167 isl_die(dim->ctx, isl_error_invalid,
6168 "number of input and output dimensions needs to be "
6169 "the same", goto error);
6170 return basic_map_identity(dim);
6176 struct isl_basic_map *isl_basic_map_identity_like(struct isl_basic_map *model)
6178 if (!model || !model->dim)
6180 return isl_basic_map_identity(isl_dim_copy(model->dim));
6183 __isl_give isl_map *isl_map_identity(__isl_take isl_dim *dim)
6185 return isl_map_from_basic_map(isl_basic_map_identity(dim));
6188 struct isl_map *isl_map_identity_like(struct isl_map *model)
6190 if (!model || !model->dim)
6192 return isl_map_identity(isl_dim_copy(model->dim));
6195 struct isl_map *isl_map_identity_like_basic_map(struct isl_basic_map *model)
6197 if (!model || !model->dim)
6199 return isl_map_identity(isl_dim_copy(model->dim));
6202 __isl_give isl_map *isl_set_identity(__isl_take isl_set *set)
6204 isl_dim *dim = isl_set_get_dim(set);
6206 id = isl_map_identity(isl_dim_map_from_set(dim));
6207 return isl_map_intersect_range(id, set);
6210 /* Construct a basic set with all set dimensions having only non-negative
6213 struct isl_basic_set *isl_basic_set_positive_orthant(struct isl_dim *dims)
6218 struct isl_basic_set *bset;
6222 nparam = dims->nparam;
6224 bset = isl_basic_set_alloc_dim(dims, 0, 0, dim);
6227 for (i = 0; i < dim; ++i) {
6228 int k = isl_basic_set_alloc_inequality(bset);
6231 isl_seq_clr(bset->ineq[k], 1 + isl_basic_set_total_dim(bset));
6232 isl_int_set_si(bset->ineq[k][1 + nparam + i], 1);
6236 isl_basic_set_free(bset);
6240 /* Construct the half-space x_pos >= 0.
6242 static __isl_give isl_basic_set *nonneg_halfspace(__isl_take isl_dim *dim,
6246 isl_basic_set *nonneg;
6248 nonneg = isl_basic_set_alloc_dim(dim, 0, 0, 1);
6249 k = isl_basic_set_alloc_inequality(nonneg);
6252 isl_seq_clr(nonneg->ineq[k], 1 + isl_basic_set_total_dim(nonneg));
6253 isl_int_set_si(nonneg->ineq[k][pos], 1);
6255 return isl_basic_set_finalize(nonneg);
6257 isl_basic_set_free(nonneg);
6261 /* Construct the half-space x_pos <= -1.
6263 static __isl_give isl_basic_set *neg_halfspace(__isl_take isl_dim *dim, int pos)
6268 neg = isl_basic_set_alloc_dim(dim, 0, 0, 1);
6269 k = isl_basic_set_alloc_inequality(neg);
6272 isl_seq_clr(neg->ineq[k], 1 + isl_basic_set_total_dim(neg));
6273 isl_int_set_si(neg->ineq[k][0], -1);
6274 isl_int_set_si(neg->ineq[k][pos], -1);
6276 return isl_basic_set_finalize(neg);
6278 isl_basic_set_free(neg);
6282 __isl_give isl_set *isl_set_split_dims(__isl_take isl_set *set,
6283 enum isl_dim_type type, unsigned first, unsigned n)
6286 isl_basic_set *nonneg;
6294 isl_assert(set->ctx, first + n <= isl_set_dim(set, type), goto error);
6296 for (i = 0; i < n; ++i) {
6297 nonneg = nonneg_halfspace(isl_set_get_dim(set),
6298 pos(set->dim, type) + first + i);
6299 neg = neg_halfspace(isl_set_get_dim(set),
6300 pos(set->dim, type) + first + i);
6302 set = isl_set_intersect(set, isl_basic_set_union(nonneg, neg));
6311 static int foreach_orthant(__isl_take isl_set *set, int *signs, int first,
6312 int len, int (*fn)(__isl_take isl_set *orthant, int *signs, void *user),
6319 if (isl_set_plain_is_empty(set)) {
6324 return fn(set, signs, user);
6327 half = isl_set_from_basic_set(nonneg_halfspace(isl_set_get_dim(set),
6329 half = isl_set_intersect(half, isl_set_copy(set));
6330 if (foreach_orthant(half, signs, first + 1, len, fn, user) < 0)
6334 half = isl_set_from_basic_set(neg_halfspace(isl_set_get_dim(set),
6336 half = isl_set_intersect(half, set);
6337 return foreach_orthant(half, signs, first + 1, len, fn, user);
6343 /* Call "fn" on the intersections of "set" with each of the orthants
6344 * (except for obviously empty intersections). The orthant is identified
6345 * by the signs array, with each entry having value 1 or -1 according
6346 * to the sign of the corresponding variable.
6348 int isl_set_foreach_orthant(__isl_keep isl_set *set,
6349 int (*fn)(__isl_take isl_set *orthant, int *signs, void *user),
6359 if (isl_set_plain_is_empty(set))
6362 nparam = isl_set_dim(set, isl_dim_param);
6363 nvar = isl_set_dim(set, isl_dim_set);
6365 signs = isl_alloc_array(set->ctx, int, nparam + nvar);
6367 r = foreach_orthant(isl_set_copy(set), signs, 0, nparam + nvar,
6375 int isl_set_is_equal(struct isl_set *set1, struct isl_set *set2)
6377 return isl_map_is_equal((struct isl_map *)set1, (struct isl_map *)set2);
6380 int isl_basic_map_is_subset(
6381 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
6384 struct isl_map *map1;
6385 struct isl_map *map2;
6387 if (!bmap1 || !bmap2)
6390 map1 = isl_map_from_basic_map(isl_basic_map_copy(bmap1));
6391 map2 = isl_map_from_basic_map(isl_basic_map_copy(bmap2));
6393 is_subset = isl_map_is_subset(map1, map2);
6401 int isl_basic_map_is_equal(
6402 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
6406 if (!bmap1 || !bmap2)
6408 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
6411 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
6415 int isl_basic_set_is_equal(
6416 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
6418 return isl_basic_map_is_equal(
6419 (struct isl_basic_map *)bset1, (struct isl_basic_map *)bset2);
6422 int isl_map_is_empty(struct isl_map *map)
6429 for (i = 0; i < map->n; ++i) {
6430 is_empty = isl_basic_map_is_empty(map->p[i]);
6439 int isl_map_plain_is_empty(__isl_keep isl_map *map)
6441 return map ? map->n == 0 : -1;
6444 int isl_map_fast_is_empty(__isl_keep isl_map *map)
6446 return isl_map_plain_is_empty(map);
6449 int isl_set_plain_is_empty(struct isl_set *set)
6451 return set ? set->n == 0 : -1;
6454 int isl_set_fast_is_empty(__isl_keep isl_set *set)
6456 return isl_set_plain_is_empty(set);
6459 int isl_set_is_empty(struct isl_set *set)
6461 return isl_map_is_empty((struct isl_map *)set);
6464 int isl_map_has_equal_dim(__isl_keep isl_map *map1, __isl_keep isl_map *map2)
6469 return isl_dim_equal(map1->dim, map2->dim);
6472 int isl_set_has_equal_dim(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
6477 return isl_dim_equal(set1->dim, set2->dim);
6480 static int map_is_equal(__isl_keep isl_map *map1, __isl_keep isl_map *map2)
6486 is_subset = isl_map_is_subset(map1, map2);
6489 is_subset = isl_map_is_subset(map2, map1);
6493 int isl_map_is_equal(__isl_keep isl_map *map1, __isl_keep isl_map *map2)
6495 return align_params_map_map_and_test(map1, map2, &map_is_equal);
6498 int isl_basic_map_is_strict_subset(
6499 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
6503 if (!bmap1 || !bmap2)
6505 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
6508 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
6509 if (is_subset == -1)
6514 int isl_map_is_strict_subset(struct isl_map *map1, struct isl_map *map2)
6520 is_subset = isl_map_is_subset(map1, map2);
6523 is_subset = isl_map_is_subset(map2, map1);
6524 if (is_subset == -1)
6529 int isl_set_is_strict_subset(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
6531 return isl_map_is_strict_subset((isl_map *)set1, (isl_map *)set2);
6534 int isl_basic_map_is_universe(struct isl_basic_map *bmap)
6538 return bmap->n_eq == 0 && bmap->n_ineq == 0;
6541 int isl_basic_set_is_universe(struct isl_basic_set *bset)
6545 return bset->n_eq == 0 && bset->n_ineq == 0;
6548 int isl_map_plain_is_universe(__isl_keep isl_map *map)
6555 for (i = 0; i < map->n; ++i) {
6556 int r = isl_basic_map_is_universe(map->p[i]);
6564 int isl_set_plain_is_universe(__isl_keep isl_set *set)
6566 return isl_map_plain_is_universe((isl_map *) set);
6569 int isl_set_fast_is_universe(__isl_keep isl_set *set)
6571 return isl_set_plain_is_universe(set);
6574 int isl_basic_map_is_empty(struct isl_basic_map *bmap)
6576 struct isl_basic_set *bset = NULL;
6577 struct isl_vec *sample = NULL;
6584 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY))
6587 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL)) {
6588 struct isl_basic_map *copy = isl_basic_map_copy(bmap);
6589 copy = isl_basic_map_remove_redundancies(copy);
6590 empty = ISL_F_ISSET(copy, ISL_BASIC_MAP_EMPTY);
6591 isl_basic_map_free(copy);
6595 total = 1 + isl_basic_map_total_dim(bmap);
6596 if (bmap->sample && bmap->sample->size == total) {
6597 int contains = isl_basic_map_contains(bmap, bmap->sample);
6603 isl_vec_free(bmap->sample);
6604 bmap->sample = NULL;
6605 bset = isl_basic_map_underlying_set(isl_basic_map_copy(bmap));
6608 sample = isl_basic_set_sample_vec(bset);
6611 empty = sample->size == 0;
6612 isl_vec_free(bmap->sample);
6613 bmap->sample = sample;
6615 ISL_F_SET(bmap, ISL_BASIC_MAP_EMPTY);
6620 int isl_basic_map_plain_is_empty(__isl_keep isl_basic_map *bmap)
6624 return ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY);
6627 int isl_basic_map_fast_is_empty(__isl_keep isl_basic_map *bmap)
6629 return isl_basic_map_plain_is_empty(bmap);
6632 int isl_basic_set_plain_is_empty(__isl_keep isl_basic_set *bset)
6636 return ISL_F_ISSET(bset, ISL_BASIC_SET_EMPTY);
6639 int isl_basic_set_fast_is_empty(__isl_keep isl_basic_set *bset)
6641 return isl_basic_set_plain_is_empty(bset);
6644 int isl_basic_set_is_empty(struct isl_basic_set *bset)
6646 return isl_basic_map_is_empty((struct isl_basic_map *)bset);
6649 struct isl_map *isl_basic_map_union(
6650 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
6652 struct isl_map *map;
6653 if (!bmap1 || !bmap2)
6656 isl_assert(bmap1->ctx, isl_dim_equal(bmap1->dim, bmap2->dim), goto error);
6658 map = isl_map_alloc_dim(isl_dim_copy(bmap1->dim), 2, 0);
6661 map = isl_map_add_basic_map(map, bmap1);
6662 map = isl_map_add_basic_map(map, bmap2);
6665 isl_basic_map_free(bmap1);
6666 isl_basic_map_free(bmap2);
6670 struct isl_set *isl_basic_set_union(
6671 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
6673 return (struct isl_set *)isl_basic_map_union(
6674 (struct isl_basic_map *)bset1,
6675 (struct isl_basic_map *)bset2);
6678 /* Order divs such that any div only depends on previous divs */
6679 struct isl_basic_map *isl_basic_map_order_divs(struct isl_basic_map *bmap)
6687 off = isl_dim_total(bmap->dim);
6689 for (i = 0; i < bmap->n_div; ++i) {
6691 if (isl_int_is_zero(bmap->div[i][0]))
6693 pos = isl_seq_first_non_zero(bmap->div[i]+1+1+off+i,
6697 isl_basic_map_swap_div(bmap, i, i + pos);
6703 struct isl_basic_set *isl_basic_set_order_divs(struct isl_basic_set *bset)
6705 return (struct isl_basic_set *)
6706 isl_basic_map_order_divs((struct isl_basic_map *)bset);
6709 __isl_give isl_map *isl_map_order_divs(__isl_take isl_map *map)
6716 for (i = 0; i < map->n; ++i) {
6717 map->p[i] = isl_basic_map_order_divs(map->p[i]);
6728 /* Apply the expansion computed by isl_merge_divs.
6729 * The expansion itself is given by "exp" while the resulting
6730 * list of divs is given by "div".
6732 __isl_give isl_basic_set *isl_basic_set_expand_divs(
6733 __isl_take isl_basic_set *bset, __isl_take isl_mat *div, int *exp)
6738 bset = isl_basic_set_cow(bset);
6742 if (div->n_row < bset->n_div)
6743 isl_die(isl_mat_get_ctx(div), isl_error_invalid,
6744 "not an expansion", goto error);
6746 bset = isl_basic_map_extend_dim(bset, isl_dim_copy(bset->dim),
6747 div->n_row - bset->n_div, 0,
6748 2 * (div->n_row - bset->n_div));
6750 n_div = bset->n_div;
6751 for (i = n_div; i < div->n_row; ++i)
6752 if (isl_basic_set_alloc_div(bset) < 0)
6756 for (i = div->n_row - 1; i >= 0; --i) {
6757 if (j >= 0 && exp[j] == i) {
6759 isl_basic_map_swap_div(bset, i, j);
6762 isl_seq_cpy(bset->div[i], div->row[i], div->n_col);
6763 if (isl_basic_map_add_div_constraints(bset, i) < 0)
6771 isl_basic_set_free(bset);
6776 /* Look for a div in dst that corresponds to the div "div" in src.
6777 * The divs before "div" in src and dst are assumed to be the same.
6779 * Returns -1 if no corresponding div was found and the position
6780 * of the corresponding div in dst otherwise.
6782 static int find_div(struct isl_basic_map *dst,
6783 struct isl_basic_map *src, unsigned div)
6787 unsigned total = isl_dim_total(src->dim);
6789 isl_assert(dst->ctx, div <= dst->n_div, return -1);
6790 for (i = div; i < dst->n_div; ++i)
6791 if (isl_seq_eq(dst->div[i], src->div[div], 1+1+total+div) &&
6792 isl_seq_first_non_zero(dst->div[i]+1+1+total+div,
6793 dst->n_div - div) == -1)
6798 struct isl_basic_map *isl_basic_map_align_divs(
6799 struct isl_basic_map *dst, struct isl_basic_map *src)
6802 unsigned total = isl_dim_total(src->dim);
6807 if (src->n_div == 0)
6810 for (i = 0; i < src->n_div; ++i)
6811 isl_assert(src->ctx, !isl_int_is_zero(src->div[i][0]), goto error);
6813 src = isl_basic_map_order_divs(src);
6814 dst = isl_basic_map_cow(dst);
6815 dst = isl_basic_map_extend_dim(dst, isl_dim_copy(dst->dim),
6816 src->n_div, 0, 2 * src->n_div);
6819 for (i = 0; i < src->n_div; ++i) {
6820 int j = find_div(dst, src, i);
6822 j = isl_basic_map_alloc_div(dst);
6825 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total+i);
6826 isl_seq_clr(dst->div[j]+1+1+total+i, dst->n_div - i);
6827 if (isl_basic_map_add_div_constraints(dst, j) < 0)
6831 isl_basic_map_swap_div(dst, i, j);
6835 isl_basic_map_free(dst);
6839 struct isl_basic_set *isl_basic_set_align_divs(
6840 struct isl_basic_set *dst, struct isl_basic_set *src)
6842 return (struct isl_basic_set *)isl_basic_map_align_divs(
6843 (struct isl_basic_map *)dst, (struct isl_basic_map *)src);
6846 struct isl_map *isl_map_align_divs(struct isl_map *map)
6854 map = isl_map_compute_divs(map);
6855 map = isl_map_cow(map);
6859 for (i = 1; i < map->n; ++i)
6860 map->p[0] = isl_basic_map_align_divs(map->p[0], map->p[i]);
6861 for (i = 1; i < map->n; ++i)
6862 map->p[i] = isl_basic_map_align_divs(map->p[i], map->p[0]);
6864 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
6868 struct isl_set *isl_set_align_divs(struct isl_set *set)
6870 return (struct isl_set *)isl_map_align_divs((struct isl_map *)set);
6873 static __isl_give isl_set *set_apply( __isl_take isl_set *set,
6874 __isl_take isl_map *map)
6878 isl_assert(set->ctx, isl_map_compatible_domain(map, set), goto error);
6879 map = isl_map_intersect_domain(map, set);
6880 set = isl_map_range(map);
6888 __isl_give isl_set *isl_set_apply( __isl_take isl_set *set,
6889 __isl_take isl_map *map)
6891 return isl_map_align_params_map_map_and(set, map, &set_apply);
6894 /* There is no need to cow as removing empty parts doesn't change
6895 * the meaning of the set.
6897 struct isl_map *isl_map_remove_empty_parts(struct isl_map *map)
6904 for (i = map->n-1; i >= 0; --i) {
6905 if (!ISL_F_ISSET(map->p[i], ISL_BASIC_MAP_EMPTY))
6907 isl_basic_map_free(map->p[i]);
6908 if (i != map->n-1) {
6909 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
6910 map->p[i] = map->p[map->n-1];
6918 struct isl_set *isl_set_remove_empty_parts(struct isl_set *set)
6920 return (struct isl_set *)
6921 isl_map_remove_empty_parts((struct isl_map *)set);
6924 struct isl_basic_map *isl_map_copy_basic_map(struct isl_map *map)
6926 struct isl_basic_map *bmap;
6927 if (!map || map->n == 0)
6929 bmap = map->p[map->n-1];
6930 isl_assert(map->ctx, ISL_F_ISSET(bmap, ISL_BASIC_SET_FINAL), return NULL);
6931 return isl_basic_map_copy(bmap);
6934 struct isl_basic_set *isl_set_copy_basic_set(struct isl_set *set)
6936 return (struct isl_basic_set *)
6937 isl_map_copy_basic_map((struct isl_map *)set);
6940 __isl_give isl_map *isl_map_drop_basic_map(__isl_take isl_map *map,
6941 __isl_keep isl_basic_map *bmap)
6947 for (i = map->n-1; i >= 0; --i) {
6948 if (map->p[i] != bmap)
6950 map = isl_map_cow(map);
6953 isl_basic_map_free(map->p[i]);
6954 if (i != map->n-1) {
6955 ISL_F_CLR(map, ISL_SET_NORMALIZED);
6956 map->p[i] = map->p[map->n-1];
6967 struct isl_set *isl_set_drop_basic_set(struct isl_set *set,
6968 struct isl_basic_set *bset)
6970 return (struct isl_set *)isl_map_drop_basic_map((struct isl_map *)set,
6971 (struct isl_basic_map *)bset);
6974 /* Given two basic sets bset1 and bset2, compute the maximal difference
6975 * between the values of dimension pos in bset1 and those in bset2
6976 * for any common value of the parameters and dimensions preceding pos.
6978 static enum isl_lp_result basic_set_maximal_difference_at(
6979 __isl_keep isl_basic_set *bset1, __isl_keep isl_basic_set *bset2,
6980 int pos, isl_int *opt)
6982 struct isl_dim *dims;
6983 struct isl_basic_map *bmap1 = NULL;
6984 struct isl_basic_map *bmap2 = NULL;
6985 struct isl_ctx *ctx;
6986 struct isl_vec *obj;
6989 unsigned dim1, dim2;
6990 enum isl_lp_result res;
6992 if (!bset1 || !bset2)
6993 return isl_lp_error;
6995 nparam = isl_basic_set_n_param(bset1);
6996 dim1 = isl_basic_set_n_dim(bset1);
6997 dim2 = isl_basic_set_n_dim(bset2);
6998 dims = isl_dim_alloc(bset1->ctx, nparam, pos, dim1 - pos);
6999 bmap1 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset1), dims);
7000 dims = isl_dim_alloc(bset2->ctx, nparam, pos, dim2 - pos);
7001 bmap2 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset2), dims);
7002 if (!bmap1 || !bmap2)
7004 bmap1 = isl_basic_map_cow(bmap1);
7005 bmap1 = isl_basic_map_extend(bmap1, nparam,
7006 pos, (dim1 - pos) + (dim2 - pos),
7007 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
7008 bmap1 = add_constraints(bmap1, bmap2, 0, dim1 - pos);
7011 total = isl_basic_map_total_dim(bmap1);
7013 obj = isl_vec_alloc(ctx, 1 + total);
7014 isl_seq_clr(obj->block.data, 1 + total);
7015 isl_int_set_si(obj->block.data[1+nparam+pos], 1);
7016 isl_int_set_si(obj->block.data[1+nparam+pos+(dim1-pos)], -1);
7019 res = isl_basic_map_solve_lp(bmap1, 1, obj->block.data, ctx->one,
7021 isl_basic_map_free(bmap1);
7025 isl_basic_map_free(bmap1);
7026 isl_basic_map_free(bmap2);
7027 return isl_lp_error;
7030 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
7031 * for any common value of the parameters and dimensions preceding pos
7032 * in both basic sets, the values of dimension pos in bset1 are
7033 * smaller or larger than those in bset2.
7036 * 1 if bset1 follows bset2
7037 * -1 if bset1 precedes bset2
7038 * 0 if bset1 and bset2 are incomparable
7039 * -2 if some error occurred.
7041 int isl_basic_set_compare_at(struct isl_basic_set *bset1,
7042 struct isl_basic_set *bset2, int pos)
7045 enum isl_lp_result res;
7050 res = basic_set_maximal_difference_at(bset1, bset2, pos, &opt);
7052 if (res == isl_lp_empty)
7054 else if ((res == isl_lp_ok && isl_int_is_pos(opt)) ||
7055 res == isl_lp_unbounded)
7057 else if (res == isl_lp_ok && isl_int_is_neg(opt))
7066 /* Given two basic sets bset1 and bset2, check whether
7067 * for any common value of the parameters and dimensions preceding pos
7068 * there is a value of dimension pos in bset1 that is larger
7069 * than a value of the same dimension in bset2.
7072 * 1 if there exists such a pair
7073 * 0 if there is no such pair, but there is a pair of equal values
7075 * -2 if some error occurred.
7077 int isl_basic_set_follows_at(__isl_keep isl_basic_set *bset1,
7078 __isl_keep isl_basic_set *bset2, int pos)
7081 enum isl_lp_result res;
7086 res = basic_set_maximal_difference_at(bset1, bset2, pos, &opt);
7088 if (res == isl_lp_empty)
7090 else if ((res == isl_lp_ok && isl_int_is_pos(opt)) ||
7091 res == isl_lp_unbounded)
7093 else if (res == isl_lp_ok && isl_int_is_neg(opt))
7095 else if (res == isl_lp_ok)
7104 /* Given two sets set1 and set2, check whether
7105 * for any common value of the parameters and dimensions preceding pos
7106 * there is a value of dimension pos in set1 that is larger
7107 * than a value of the same dimension in set2.
7110 * 1 if there exists such a pair
7111 * 0 if there is no such pair, but there is a pair of equal values
7113 * -2 if some error occurred.
7115 int isl_set_follows_at(__isl_keep isl_set *set1,
7116 __isl_keep isl_set *set2, int pos)
7124 for (i = 0; i < set1->n; ++i)
7125 for (j = 0; j < set2->n; ++j) {
7127 f = isl_basic_set_follows_at(set1->p[i], set2->p[j], pos);
7128 if (f == 1 || f == -2)
7137 static int isl_basic_map_plain_has_fixed_var(__isl_keep isl_basic_map *bmap,
7138 unsigned pos, isl_int *val)
7146 total = isl_basic_map_total_dim(bmap);
7147 for (i = 0, d = total-1; i < bmap->n_eq && d+1 > pos; ++i) {
7148 for (; d+1 > pos; --d)
7149 if (!isl_int_is_zero(bmap->eq[i][1+d]))
7153 if (isl_seq_first_non_zero(bmap->eq[i]+1, d) != -1)
7155 if (isl_seq_first_non_zero(bmap->eq[i]+1+d+1, total-d-1) != -1)
7157 if (!isl_int_is_one(bmap->eq[i][1+d]))
7160 isl_int_neg(*val, bmap->eq[i][0]);
7166 static int isl_map_plain_has_fixed_var(__isl_keep isl_map *map,
7167 unsigned pos, isl_int *val)
7179 return isl_basic_map_plain_has_fixed_var(map->p[0], pos, val);
7182 fixed = isl_basic_map_plain_has_fixed_var(map->p[0], pos, &v);
7183 for (i = 1; fixed == 1 && i < map->n; ++i) {
7184 fixed = isl_basic_map_plain_has_fixed_var(map->p[i], pos, &tmp);
7185 if (fixed == 1 && isl_int_ne(tmp, v))
7189 isl_int_set(*val, v);
7195 static int isl_basic_set_plain_has_fixed_var(__isl_keep isl_basic_set *bset,
7196 unsigned pos, isl_int *val)
7198 return isl_basic_map_plain_has_fixed_var((struct isl_basic_map *)bset,
7202 static int isl_set_plain_has_fixed_var(__isl_keep isl_set *set, unsigned pos,
7205 return isl_map_plain_has_fixed_var((struct isl_map *)set, pos, val);
7208 int isl_basic_map_plain_is_fixed(__isl_keep isl_basic_map *bmap,
7209 enum isl_dim_type type, unsigned pos, isl_int *val)
7211 if (pos >= isl_basic_map_dim(bmap, type))
7213 return isl_basic_map_plain_has_fixed_var(bmap,
7214 isl_basic_map_offset(bmap, type) - 1 + pos, val);
7217 int isl_map_plain_is_fixed(__isl_keep isl_map *map,
7218 enum isl_dim_type type, unsigned pos, isl_int *val)
7220 if (pos >= isl_map_dim(map, type))
7222 return isl_map_plain_has_fixed_var(map,
7223 map_offset(map, type) - 1 + pos, val);
7226 int isl_map_fast_is_fixed(__isl_keep isl_map *map,
7227 enum isl_dim_type type, unsigned pos, isl_int *val)
7229 return isl_map_plain_is_fixed(map, type, pos, val);
7232 /* Check if dimension dim has fixed value and if so and if val is not NULL,
7233 * then return this fixed value in *val.
7235 int isl_basic_set_plain_dim_is_fixed(__isl_keep isl_basic_set *bset,
7236 unsigned dim, isl_int *val)
7238 return isl_basic_set_plain_has_fixed_var(bset,
7239 isl_basic_set_n_param(bset) + dim, val);
7242 /* Check if dimension dim has fixed value and if so and if val is not NULL,
7243 * then return this fixed value in *val.
7245 int isl_set_plain_dim_is_fixed(__isl_keep isl_set *set,
7246 unsigned dim, isl_int *val)
7248 return isl_set_plain_has_fixed_var(set, isl_set_n_param(set) + dim, val);
7251 int isl_set_fast_dim_is_fixed(__isl_keep isl_set *set,
7252 unsigned dim, isl_int *val)
7254 return isl_set_plain_dim_is_fixed(set, dim, val);
7257 /* Check if input variable in has fixed value and if so and if val is not NULL,
7258 * then return this fixed value in *val.
7260 int isl_map_plain_input_is_fixed(__isl_keep isl_map *map,
7261 unsigned in, isl_int *val)
7263 return isl_map_plain_has_fixed_var(map, isl_map_n_param(map) + in, val);
7266 /* Check if dimension dim has an (obvious) fixed lower bound and if so
7267 * and if val is not NULL, then return this lower bound in *val.
7269 int isl_basic_set_plain_dim_has_fixed_lower_bound(
7270 __isl_keep isl_basic_set *bset, unsigned dim, isl_int *val)
7272 int i, i_eq = -1, i_ineq = -1;
7279 total = isl_basic_set_total_dim(bset);
7280 nparam = isl_basic_set_n_param(bset);
7281 for (i = 0; i < bset->n_eq; ++i) {
7282 if (isl_int_is_zero(bset->eq[i][1+nparam+dim]))
7288 for (i = 0; i < bset->n_ineq; ++i) {
7289 if (!isl_int_is_pos(bset->ineq[i][1+nparam+dim]))
7291 if (i_eq != -1 || i_ineq != -1)
7295 if (i_eq == -1 && i_ineq == -1)
7297 c = i_eq != -1 ? bset->eq[i_eq] : bset->ineq[i_ineq];
7298 /* The coefficient should always be one due to normalization. */
7299 if (!isl_int_is_one(c[1+nparam+dim]))
7301 if (isl_seq_first_non_zero(c+1, nparam+dim) != -1)
7303 if (isl_seq_first_non_zero(c+1+nparam+dim+1,
7304 total - nparam - dim - 1) != -1)
7307 isl_int_neg(*val, c[0]);
7311 int isl_set_plain_dim_has_fixed_lower_bound(__isl_keep isl_set *set,
7312 unsigned dim, isl_int *val)
7324 return isl_basic_set_plain_dim_has_fixed_lower_bound(set->p[0],
7328 fixed = isl_basic_set_plain_dim_has_fixed_lower_bound(set->p[0],
7330 for (i = 1; fixed == 1 && i < set->n; ++i) {
7331 fixed = isl_basic_set_plain_dim_has_fixed_lower_bound(set->p[i],
7333 if (fixed == 1 && isl_int_ne(tmp, v))
7337 isl_int_set(*val, v);
7348 /* uset_gist depends on constraints without existentially quantified
7349 * variables sorting first.
7351 static int qsort_constraint_cmp(const void *p1, const void *p2)
7353 const struct constraint *c1 = (const struct constraint *)p1;
7354 const struct constraint *c2 = (const struct constraint *)p2;
7356 unsigned size = isl_min(c1->size, c2->size);
7358 l1 = isl_seq_last_non_zero(c1->c, size);
7359 l2 = isl_seq_last_non_zero(c2->c, size);
7364 return isl_seq_cmp(c1->c, c2->c, size);
7367 static struct isl_basic_map *isl_basic_map_sort_constraints(
7368 struct isl_basic_map *bmap)
7371 struct constraint *c;
7376 total = isl_basic_map_total_dim(bmap);
7377 c = isl_alloc_array(bmap->ctx, struct constraint, bmap->n_ineq);
7380 for (i = 0; i < bmap->n_ineq; ++i) {
7382 c[i].c = bmap->ineq[i];
7384 qsort(c, bmap->n_ineq, sizeof(struct constraint), qsort_constraint_cmp);
7385 for (i = 0; i < bmap->n_ineq; ++i)
7386 bmap->ineq[i] = c[i].c;
7390 isl_basic_map_free(bmap);
7394 __isl_give isl_basic_set *isl_basic_set_sort_constraints(
7395 __isl_take isl_basic_set *bset)
7397 return (struct isl_basic_set *)isl_basic_map_sort_constraints(
7398 (struct isl_basic_map *)bset);
7401 struct isl_basic_map *isl_basic_map_normalize(struct isl_basic_map *bmap)
7405 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_NORMALIZED))
7407 bmap = isl_basic_map_remove_redundancies(bmap);
7408 bmap = isl_basic_map_sort_constraints(bmap);
7409 ISL_F_SET(bmap, ISL_BASIC_MAP_NORMALIZED);
7413 struct isl_basic_set *isl_basic_set_normalize(struct isl_basic_set *bset)
7415 return (struct isl_basic_set *)isl_basic_map_normalize(
7416 (struct isl_basic_map *)bset);
7419 int isl_basic_map_plain_cmp(const __isl_keep isl_basic_map *bmap1,
7420 const __isl_keep isl_basic_map *bmap2)
7427 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_RATIONAL) !=
7428 ISL_F_ISSET(bmap2, ISL_BASIC_MAP_RATIONAL))
7429 return ISL_F_ISSET(bmap1, ISL_BASIC_MAP_RATIONAL) ? -1 : 1;
7430 if (isl_basic_map_n_param(bmap1) != isl_basic_map_n_param(bmap2))
7431 return isl_basic_map_n_param(bmap1) - isl_basic_map_n_param(bmap2);
7432 if (isl_basic_map_n_in(bmap1) != isl_basic_map_n_in(bmap2))
7433 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
7434 if (isl_basic_map_n_out(bmap1) != isl_basic_map_n_out(bmap2))
7435 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
7436 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY) &&
7437 ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
7439 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY))
7441 if (ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
7443 if (bmap1->n_eq != bmap2->n_eq)
7444 return bmap1->n_eq - bmap2->n_eq;
7445 if (bmap1->n_ineq != bmap2->n_ineq)
7446 return bmap1->n_ineq - bmap2->n_ineq;
7447 if (bmap1->n_div != bmap2->n_div)
7448 return bmap1->n_div - bmap2->n_div;
7449 total = isl_basic_map_total_dim(bmap1);
7450 for (i = 0; i < bmap1->n_eq; ++i) {
7451 cmp = isl_seq_cmp(bmap1->eq[i], bmap2->eq[i], 1+total);
7455 for (i = 0; i < bmap1->n_ineq; ++i) {
7456 cmp = isl_seq_cmp(bmap1->ineq[i], bmap2->ineq[i], 1+total);
7460 for (i = 0; i < bmap1->n_div; ++i) {
7461 cmp = isl_seq_cmp(bmap1->div[i], bmap2->div[i], 1+1+total);
7468 int isl_basic_map_plain_is_equal(__isl_keep isl_basic_map *bmap1,
7469 __isl_keep isl_basic_map *bmap2)
7471 return isl_basic_map_plain_cmp(bmap1, bmap2) == 0;
7474 int isl_basic_set_plain_is_equal(__isl_keep isl_basic_set *bset1,
7475 __isl_keep isl_basic_set *bset2)
7477 return isl_basic_map_plain_is_equal((isl_basic_map *)bset1,
7478 (isl_basic_map *)bset2);
7481 static int qsort_bmap_cmp(const void *p1, const void *p2)
7483 const struct isl_basic_map *bmap1 = *(const struct isl_basic_map **)p1;
7484 const struct isl_basic_map *bmap2 = *(const struct isl_basic_map **)p2;
7486 return isl_basic_map_plain_cmp(bmap1, bmap2);
7489 /* We normalize in place, but if anything goes wrong we need
7490 * to return NULL, so we need to make sure we don't change the
7491 * meaning of any possible other copies of map.
7493 struct isl_map *isl_map_normalize(struct isl_map *map)
7496 struct isl_basic_map *bmap;
7500 if (ISL_F_ISSET(map, ISL_MAP_NORMALIZED))
7502 for (i = 0; i < map->n; ++i) {
7503 bmap = isl_basic_map_normalize(isl_basic_map_copy(map->p[i]));
7506 isl_basic_map_free(map->p[i]);
7509 qsort(map->p, map->n, sizeof(struct isl_basic_map *), qsort_bmap_cmp);
7510 ISL_F_SET(map, ISL_MAP_NORMALIZED);
7511 map = isl_map_remove_empty_parts(map);
7514 for (i = map->n - 1; i >= 1; --i) {
7515 if (!isl_basic_map_plain_is_equal(map->p[i-1], map->p[i]))
7517 isl_basic_map_free(map->p[i-1]);
7518 for (j = i; j < map->n; ++j)
7519 map->p[j-1] = map->p[j];
7529 struct isl_set *isl_set_normalize(struct isl_set *set)
7531 return (struct isl_set *)isl_map_normalize((struct isl_map *)set);
7534 int isl_map_plain_is_equal(__isl_keep isl_map *map1, __isl_keep isl_map *map2)
7544 if (!isl_dim_equal(map1->dim, map2->dim))
7547 map1 = isl_map_copy(map1);
7548 map2 = isl_map_copy(map2);
7549 map1 = isl_map_normalize(map1);
7550 map2 = isl_map_normalize(map2);
7553 equal = map1->n == map2->n;
7554 for (i = 0; equal && i < map1->n; ++i) {
7555 equal = isl_basic_map_plain_is_equal(map1->p[i], map2->p[i]);
7568 int isl_map_fast_is_equal(__isl_keep isl_map *map1, __isl_keep isl_map *map2)
7570 return isl_map_plain_is_equal(map1, map2);
7573 int isl_set_plain_is_equal(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
7575 return isl_map_plain_is_equal((struct isl_map *)set1,
7576 (struct isl_map *)set2);
7579 int isl_set_fast_is_equal(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
7581 return isl_set_plain_is_equal(set1, set2);
7584 /* Return an interval that ranges from min to max (inclusive)
7586 struct isl_basic_set *isl_basic_set_interval(struct isl_ctx *ctx,
7587 isl_int min, isl_int max)
7590 struct isl_basic_set *bset = NULL;
7592 bset = isl_basic_set_alloc(ctx, 0, 1, 0, 0, 2);
7596 k = isl_basic_set_alloc_inequality(bset);
7599 isl_int_set_si(bset->ineq[k][1], 1);
7600 isl_int_neg(bset->ineq[k][0], min);
7602 k = isl_basic_set_alloc_inequality(bset);
7605 isl_int_set_si(bset->ineq[k][1], -1);
7606 isl_int_set(bset->ineq[k][0], max);
7610 isl_basic_set_free(bset);
7614 /* Return the Cartesian product of the basic sets in list (in the given order).
7616 __isl_give isl_basic_set *isl_basic_set_list_product(
7617 __isl_take struct isl_basic_set_list *list)
7625 struct isl_basic_set *product = NULL;
7629 isl_assert(list->ctx, list->n > 0, goto error);
7630 isl_assert(list->ctx, list->p[0], goto error);
7631 nparam = isl_basic_set_n_param(list->p[0]);
7632 dim = isl_basic_set_n_dim(list->p[0]);
7633 extra = list->p[0]->n_div;
7634 n_eq = list->p[0]->n_eq;
7635 n_ineq = list->p[0]->n_ineq;
7636 for (i = 1; i < list->n; ++i) {
7637 isl_assert(list->ctx, list->p[i], goto error);
7638 isl_assert(list->ctx,
7639 nparam == isl_basic_set_n_param(list->p[i]), goto error);
7640 dim += isl_basic_set_n_dim(list->p[i]);
7641 extra += list->p[i]->n_div;
7642 n_eq += list->p[i]->n_eq;
7643 n_ineq += list->p[i]->n_ineq;
7645 product = isl_basic_set_alloc(list->ctx, nparam, dim, extra,
7650 for (i = 0; i < list->n; ++i) {
7651 isl_basic_set_add_constraints(product,
7652 isl_basic_set_copy(list->p[i]), dim);
7653 dim += isl_basic_set_n_dim(list->p[i]);
7655 isl_basic_set_list_free(list);
7658 isl_basic_set_free(product);
7659 isl_basic_set_list_free(list);
7663 struct isl_basic_map *isl_basic_map_product(
7664 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
7666 struct isl_dim *dim_result = NULL;
7667 struct isl_basic_map *bmap;
7668 unsigned in1, in2, out1, out2, nparam, total, pos;
7669 struct isl_dim_map *dim_map1, *dim_map2;
7671 if (!bmap1 || !bmap2)
7674 isl_assert(bmap1->ctx, isl_dim_match(bmap1->dim, isl_dim_param,
7675 bmap2->dim, isl_dim_param), goto error);
7676 dim_result = isl_dim_product(isl_dim_copy(bmap1->dim),
7677 isl_dim_copy(bmap2->dim));
7679 in1 = isl_basic_map_n_in(bmap1);
7680 in2 = isl_basic_map_n_in(bmap2);
7681 out1 = isl_basic_map_n_out(bmap1);
7682 out2 = isl_basic_map_n_out(bmap2);
7683 nparam = isl_basic_map_n_param(bmap1);
7685 total = nparam + in1 + in2 + out1 + out2 + bmap1->n_div + bmap2->n_div;
7686 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
7687 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
7688 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
7689 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
7690 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
7691 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos += in1);
7692 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += in2);
7693 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += out1);
7694 isl_dim_map_div(dim_map1, bmap1, pos += out2);
7695 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
7697 bmap = isl_basic_map_alloc_dim(dim_result,
7698 bmap1->n_div + bmap2->n_div,
7699 bmap1->n_eq + bmap2->n_eq,
7700 bmap1->n_ineq + bmap2->n_ineq);
7701 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap1, dim_map1);
7702 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap2, dim_map2);
7703 bmap = isl_basic_map_simplify(bmap);
7704 return isl_basic_map_finalize(bmap);
7706 isl_basic_map_free(bmap1);
7707 isl_basic_map_free(bmap2);
7711 __isl_give isl_basic_map *isl_basic_map_flat_product(
7712 __isl_take isl_basic_map *bmap1, __isl_take isl_basic_map *bmap2)
7714 isl_basic_map *prod;
7716 prod = isl_basic_map_product(bmap1, bmap2);
7717 prod = isl_basic_map_flatten(prod);
7721 __isl_give isl_basic_set *isl_basic_set_flat_product(
7722 __isl_take isl_basic_set *bset1, __isl_take isl_basic_set *bset2)
7724 return isl_basic_map_flat_range_product(bset1, bset2);
7727 __isl_give isl_basic_map *isl_basic_map_range_product(
7728 __isl_take isl_basic_map *bmap1, __isl_take isl_basic_map *bmap2)
7730 isl_dim *dim_result = NULL;
7731 isl_basic_map *bmap;
7732 unsigned in, out1, out2, nparam, total, pos;
7733 struct isl_dim_map *dim_map1, *dim_map2;
7735 if (!bmap1 || !bmap2)
7738 dim_result = isl_dim_range_product(isl_dim_copy(bmap1->dim),
7739 isl_dim_copy(bmap2->dim));
7741 in = isl_basic_map_dim(bmap1, isl_dim_in);
7742 out1 = isl_basic_map_n_out(bmap1);
7743 out2 = isl_basic_map_n_out(bmap2);
7744 nparam = isl_basic_map_n_param(bmap1);
7746 total = nparam + in + out1 + out2 + bmap1->n_div + bmap2->n_div;
7747 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
7748 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
7749 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
7750 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
7751 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
7752 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
7753 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += in);
7754 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += out1);
7755 isl_dim_map_div(dim_map1, bmap1, pos += out2);
7756 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
7758 bmap = isl_basic_map_alloc_dim(dim_result,
7759 bmap1->n_div + bmap2->n_div,
7760 bmap1->n_eq + bmap2->n_eq,
7761 bmap1->n_ineq + bmap2->n_ineq);
7762 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap1, dim_map1);
7763 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap2, dim_map2);
7764 bmap = isl_basic_map_simplify(bmap);
7765 return isl_basic_map_finalize(bmap);
7767 isl_basic_map_free(bmap1);
7768 isl_basic_map_free(bmap2);
7772 __isl_give isl_basic_map *isl_basic_map_flat_range_product(
7773 __isl_take isl_basic_map *bmap1, __isl_take isl_basic_map *bmap2)
7775 isl_basic_map *prod;
7777 prod = isl_basic_map_range_product(bmap1, bmap2);
7778 prod = isl_basic_map_flatten_range(prod);
7782 static __isl_give isl_map *map_product(__isl_take isl_map *map1,
7783 __isl_take isl_map *map2,
7784 __isl_give isl_dim *(*dim_product)(__isl_take isl_dim *left,
7785 __isl_take isl_dim *right),
7786 __isl_give isl_basic_map *(*basic_map_product)(
7787 __isl_take isl_basic_map *left, __isl_take isl_basic_map *right))
7790 struct isl_map *result;
7796 isl_assert(map1->ctx, isl_dim_match(map1->dim, isl_dim_param,
7797 map2->dim, isl_dim_param), goto error);
7799 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
7800 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
7801 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
7803 result = isl_map_alloc_dim(dim_product(isl_dim_copy(map1->dim),
7804 isl_dim_copy(map2->dim)),
7805 map1->n * map2->n, flags);
7808 for (i = 0; i < map1->n; ++i)
7809 for (j = 0; j < map2->n; ++j) {
7810 struct isl_basic_map *part;
7811 part = basic_map_product(isl_basic_map_copy(map1->p[i]),
7812 isl_basic_map_copy(map2->p[j]));
7813 if (isl_basic_map_is_empty(part))
7814 isl_basic_map_free(part);
7816 result = isl_map_add_basic_map(result, part);
7829 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> [B -> D]
7831 static __isl_give isl_map *map_product_aligned(__isl_take isl_map *map1,
7832 __isl_take isl_map *map2)
7834 return map_product(map1, map2, &isl_dim_product, &isl_basic_map_product);
7837 __isl_give isl_map *isl_map_product(__isl_take isl_map *map1,
7838 __isl_take isl_map *map2)
7840 return isl_map_align_params_map_map_and(map1, map2, &map_product_aligned);
7843 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
7845 __isl_give isl_map *isl_map_flat_product(__isl_take isl_map *map1,
7846 __isl_take isl_map *map2)
7850 prod = isl_map_product(map1, map2);
7851 prod = isl_map_flatten(prod);
7855 /* Given two set A and B, construct its Cartesian product A x B.
7857 struct isl_set *isl_set_product(struct isl_set *set1, struct isl_set *set2)
7859 return isl_map_range_product(set1, set2);
7862 __isl_give isl_set *isl_set_flat_product(__isl_take isl_set *set1,
7863 __isl_take isl_set *set2)
7865 return isl_map_flat_range_product(set1, set2);
7868 /* Given two maps A -> B and C -> D, construct a map (A * C) -> [B -> D]
7870 static __isl_give isl_map *map_range_product_aligned(__isl_take isl_map *map1,
7871 __isl_take isl_map *map2)
7873 return map_product(map1, map2, &isl_dim_range_product,
7874 &isl_basic_map_range_product);
7877 __isl_give isl_map *isl_map_range_product(__isl_take isl_map *map1,
7878 __isl_take isl_map *map2)
7880 return isl_map_align_params_map_map_and(map1, map2,
7881 &map_range_product_aligned);
7884 /* Given two maps A -> B and C -> D, construct a map (A * C) -> (B, D)
7886 __isl_give isl_map *isl_map_flat_range_product(__isl_take isl_map *map1,
7887 __isl_take isl_map *map2)
7891 prod = isl_map_range_product(map1, map2);
7892 prod = isl_map_flatten_range(prod);
7896 uint32_t isl_basic_map_get_hash(__isl_keep isl_basic_map *bmap)
7899 uint32_t hash = isl_hash_init();
7904 bmap = isl_basic_map_copy(bmap);
7905 bmap = isl_basic_map_normalize(bmap);
7908 total = isl_basic_map_total_dim(bmap);
7909 isl_hash_byte(hash, bmap->n_eq & 0xFF);
7910 for (i = 0; i < bmap->n_eq; ++i) {
7912 c_hash = isl_seq_get_hash(bmap->eq[i], 1 + total);
7913 isl_hash_hash(hash, c_hash);
7915 isl_hash_byte(hash, bmap->n_ineq & 0xFF);
7916 for (i = 0; i < bmap->n_ineq; ++i) {
7918 c_hash = isl_seq_get_hash(bmap->ineq[i], 1 + total);
7919 isl_hash_hash(hash, c_hash);
7921 isl_hash_byte(hash, bmap->n_div & 0xFF);
7922 for (i = 0; i < bmap->n_div; ++i) {
7924 if (isl_int_is_zero(bmap->div[i][0]))
7926 isl_hash_byte(hash, i & 0xFF);
7927 c_hash = isl_seq_get_hash(bmap->div[i], 1 + 1 + total);
7928 isl_hash_hash(hash, c_hash);
7930 isl_basic_map_free(bmap);
7934 uint32_t isl_basic_set_get_hash(__isl_keep isl_basic_set *bset)
7936 return isl_basic_map_get_hash((isl_basic_map *)bset);
7939 uint32_t isl_map_get_hash(__isl_keep isl_map *map)
7946 map = isl_map_copy(map);
7947 map = isl_map_normalize(map);
7951 hash = isl_hash_init();
7952 for (i = 0; i < map->n; ++i) {
7954 bmap_hash = isl_basic_map_get_hash(map->p[i]);
7955 isl_hash_hash(hash, bmap_hash);
7963 uint32_t isl_set_get_hash(__isl_keep isl_set *set)
7965 return isl_map_get_hash((isl_map *)set);
7968 /* Check if the value for dimension dim is completely determined
7969 * by the values of the other parameters and variables.
7970 * That is, check if dimension dim is involved in an equality.
7972 int isl_basic_set_dim_is_unique(struct isl_basic_set *bset, unsigned dim)
7979 nparam = isl_basic_set_n_param(bset);
7980 for (i = 0; i < bset->n_eq; ++i)
7981 if (!isl_int_is_zero(bset->eq[i][1 + nparam + dim]))
7986 /* Check if the value for dimension dim is completely determined
7987 * by the values of the other parameters and variables.
7988 * That is, check if dimension dim is involved in an equality
7989 * for each of the subsets.
7991 int isl_set_dim_is_unique(struct isl_set *set, unsigned dim)
7997 for (i = 0; i < set->n; ++i) {
7999 unique = isl_basic_set_dim_is_unique(set->p[i], dim);
8006 int isl_set_n_basic_set(__isl_keep isl_set *set)
8008 return set ? set->n : 0;
8011 int isl_map_foreach_basic_map(__isl_keep isl_map *map,
8012 int (*fn)(__isl_take isl_basic_map *bmap, void *user), void *user)
8019 for (i = 0; i < map->n; ++i)
8020 if (fn(isl_basic_map_copy(map->p[i]), user) < 0)
8026 int isl_set_foreach_basic_set(__isl_keep isl_set *set,
8027 int (*fn)(__isl_take isl_basic_set *bset, void *user), void *user)
8034 for (i = 0; i < set->n; ++i)
8035 if (fn(isl_basic_set_copy(set->p[i]), user) < 0)
8041 __isl_give isl_basic_set *isl_basic_set_lift(__isl_take isl_basic_set *bset)
8043 struct isl_dim *dim;
8048 bset = isl_basic_set_cow(bset);
8052 dim = isl_basic_set_get_dim(bset);
8053 dim = isl_dim_lift(dim, bset->n_div);
8056 isl_dim_free(bset->dim);
8058 bset->extra -= bset->n_div;
8061 bset = isl_basic_set_finalize(bset);
8065 isl_basic_set_free(bset);
8069 __isl_give isl_set *isl_set_lift(__isl_take isl_set *set)
8072 struct isl_dim *dim;
8075 set = isl_set_align_divs(set);
8080 set = isl_set_cow(set);
8084 n_div = set->p[0]->n_div;
8085 dim = isl_set_get_dim(set);
8086 dim = isl_dim_lift(dim, n_div);
8089 isl_dim_free(set->dim);
8092 for (i = 0; i < set->n; ++i) {
8093 set->p[i] = isl_basic_set_lift(set->p[i]);
8104 __isl_give isl_map *isl_set_lifting(__isl_take isl_set *set)
8106 struct isl_dim *dim;
8107 struct isl_basic_map *bmap;
8114 set = isl_set_align_divs(set);
8119 dim = isl_set_get_dim(set);
8120 if (set->n == 0 || set->p[0]->n_div == 0) {
8122 return isl_map_identity(isl_dim_map_from_set(dim));
8125 n_div = set->p[0]->n_div;
8126 dim = isl_dim_map_from_set(dim);
8127 n_param = isl_dim_size(dim, isl_dim_param);
8128 n_set = isl_dim_size(dim, isl_dim_in);
8129 dim = isl_dim_extend(dim, n_param, n_set, n_set + n_div);
8130 bmap = isl_basic_map_alloc_dim(dim, 0, n_set, 2 * n_div);
8131 for (i = 0; i < n_set; ++i)
8132 bmap = var_equal(bmap, i);
8134 total = n_param + n_set + n_set + n_div;
8135 for (i = 0; i < n_div; ++i) {
8136 k = isl_basic_map_alloc_inequality(bmap);
8139 isl_seq_cpy(bmap->ineq[k], set->p[0]->div[i]+1, 1+n_param);
8140 isl_seq_clr(bmap->ineq[k]+1+n_param, n_set);
8141 isl_seq_cpy(bmap->ineq[k]+1+n_param+n_set,
8142 set->p[0]->div[i]+1+1+n_param, n_set + n_div);
8143 isl_int_neg(bmap->ineq[k][1+n_param+n_set+n_set+i],
8144 set->p[0]->div[i][0]);
8146 l = isl_basic_map_alloc_inequality(bmap);
8149 isl_seq_neg(bmap->ineq[l], bmap->ineq[k], 1 + total);
8150 isl_int_add(bmap->ineq[l][0], bmap->ineq[l][0],
8151 set->p[0]->div[i][0]);
8152 isl_int_sub_ui(bmap->ineq[l][0], bmap->ineq[l][0], 1);
8156 bmap = isl_basic_map_simplify(bmap);
8157 bmap = isl_basic_map_finalize(bmap);
8158 return isl_map_from_basic_map(bmap);
8161 isl_basic_map_free(bmap);
8165 int isl_basic_set_size(__isl_keep isl_basic_set *bset)
8173 dim = isl_basic_set_total_dim(bset);
8174 size += bset->n_eq * (1 + dim);
8175 size += bset->n_ineq * (1 + dim);
8176 size += bset->n_div * (2 + dim);
8181 int isl_set_size(__isl_keep isl_set *set)
8189 for (i = 0; i < set->n; ++i)
8190 size += isl_basic_set_size(set->p[i]);
8195 /* Check if there is any lower bound (if lower == 0) and/or upper
8196 * bound (if upper == 0) on the specified dim.
8198 static int basic_map_dim_is_bounded(__isl_keep isl_basic_map *bmap,
8199 enum isl_dim_type type, unsigned pos, int lower, int upper)
8206 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), return -1);
8208 pos += isl_basic_map_offset(bmap, type);
8210 for (i = 0; i < bmap->n_div; ++i) {
8211 if (isl_int_is_zero(bmap->div[i][0]))
8213 if (!isl_int_is_zero(bmap->div[i][1 + pos]))
8217 for (i = 0; i < bmap->n_eq; ++i)
8218 if (!isl_int_is_zero(bmap->eq[i][pos]))
8221 for (i = 0; i < bmap->n_ineq; ++i) {
8222 int sgn = isl_int_sgn(bmap->ineq[i][pos]);
8229 return lower && upper;
8232 int isl_basic_map_dim_is_bounded(__isl_keep isl_basic_map *bmap,
8233 enum isl_dim_type type, unsigned pos)
8235 return basic_map_dim_is_bounded(bmap, type, pos, 0, 0);
8238 int isl_basic_map_dim_has_lower_bound(__isl_keep isl_basic_map *bmap,
8239 enum isl_dim_type type, unsigned pos)
8241 return basic_map_dim_is_bounded(bmap, type, pos, 0, 1);
8244 int isl_basic_map_dim_has_upper_bound(__isl_keep isl_basic_map *bmap,
8245 enum isl_dim_type type, unsigned pos)
8247 return basic_map_dim_is_bounded(bmap, type, pos, 1, 0);
8250 int isl_map_dim_is_bounded(__isl_keep isl_map *map,
8251 enum isl_dim_type type, unsigned pos)
8258 for (i = 0; i < map->n; ++i) {
8260 bounded = isl_basic_map_dim_is_bounded(map->p[i], type, pos);
8261 if (bounded < 0 || !bounded)
8268 /* Return 1 if the specified dim is involved in both an upper bound
8269 * and a lower bound.
8271 int isl_set_dim_is_bounded(__isl_keep isl_set *set,
8272 enum isl_dim_type type, unsigned pos)
8274 return isl_map_dim_is_bounded((isl_map *)set, type, pos);
8277 static int has_bound(__isl_keep isl_map *map,
8278 enum isl_dim_type type, unsigned pos,
8279 int (*fn)(__isl_keep isl_basic_map *bmap,
8280 enum isl_dim_type type, unsigned pos))
8287 for (i = 0; i < map->n; ++i) {
8289 bounded = fn(map->p[i], type, pos);
8290 if (bounded < 0 || bounded)
8297 /* Return 1 if the specified dim is involved in any lower bound.
8299 int isl_set_dim_has_lower_bound(__isl_keep isl_set *set,
8300 enum isl_dim_type type, unsigned pos)
8302 return has_bound(set, type, pos, &isl_basic_map_dim_has_lower_bound);
8305 /* Return 1 if the specified dim is involved in any upper bound.
8307 int isl_set_dim_has_upper_bound(__isl_keep isl_set *set,
8308 enum isl_dim_type type, unsigned pos)
8310 return has_bound(set, type, pos, &isl_basic_map_dim_has_upper_bound);
8313 /* For each of the "n" variables starting at "first", determine
8314 * the sign of the variable and put the results in the first "n"
8315 * elements of the array "signs".
8317 * 1 means that the variable is non-negative
8318 * -1 means that the variable is non-positive
8319 * 0 means the variable attains both positive and negative values.
8321 int isl_basic_set_vars_get_sign(__isl_keep isl_basic_set *bset,
8322 unsigned first, unsigned n, int *signs)
8324 isl_vec *bound = NULL;
8325 struct isl_tab *tab = NULL;
8326 struct isl_tab_undo *snap;
8329 if (!bset || !signs)
8332 bound = isl_vec_alloc(bset->ctx, 1 + isl_basic_set_total_dim(bset));
8333 tab = isl_tab_from_basic_set(bset);
8337 isl_seq_clr(bound->el, bound->size);
8338 isl_int_set_si(bound->el[0], -1);
8340 snap = isl_tab_snap(tab);
8341 for (i = 0; i < n; ++i) {
8344 isl_int_set_si(bound->el[1 + first + i], -1);
8345 if (isl_tab_add_ineq(tab, bound->el) < 0)
8348 isl_int_set_si(bound->el[1 + first + i], 0);
8349 if (isl_tab_rollback(tab, snap) < 0)
8357 isl_int_set_si(bound->el[1 + first + i], 1);
8358 if (isl_tab_add_ineq(tab, bound->el) < 0)
8361 isl_int_set_si(bound->el[1 + first + i], 0);
8362 if (isl_tab_rollback(tab, snap) < 0)
8365 signs[i] = empty ? -1 : 0;
8369 isl_vec_free(bound);
8373 isl_vec_free(bound);
8377 int isl_basic_set_dims_get_sign(__isl_keep isl_basic_set *bset,
8378 enum isl_dim_type type, unsigned first, unsigned n, int *signs)
8380 if (!bset || !signs)
8382 isl_assert(bset->ctx, first + n <= isl_basic_set_dim(bset, type),
8385 first += pos(bset->dim, type) - 1;
8386 return isl_basic_set_vars_get_sign(bset, first, n, signs);
8389 /* Check if the given basic map is obviously single-valued.
8390 * In particular, for each output dimension, check that there is
8391 * an equality that defines the output dimension in terms of
8392 * earlier dimensions.
8394 int isl_basic_map_plain_is_single_valued(__isl_keep isl_basic_map *bmap)
8404 total = 1 + isl_basic_map_total_dim(bmap);
8405 n_out = isl_basic_map_dim(bmap, isl_dim_out);
8406 o_out = isl_basic_map_offset(bmap, isl_dim_out);
8408 for (i = 0; i < n_out; ++i) {
8409 for (j = 0; j < bmap->n_eq; ++j) {
8410 if (isl_int_is_zero(bmap->eq[j][o_out + i]))
8412 if (isl_seq_first_non_zero(bmap->eq[j] + o_out + i + 1,
8413 total - (o_out + i + 1)) == -1)
8416 if (j >= bmap->n_eq)
8423 /* Check if the given map is obviously single-valued.
8425 int isl_map_plain_is_single_valued(__isl_keep isl_map *map)
8434 return isl_basic_map_plain_is_single_valued(map->p[0]);
8437 /* Check if the given map is single-valued.
8442 * and check if the result is a subset of the identity mapping.
8444 int isl_map_is_single_valued(__isl_keep isl_map *map)
8451 sv = isl_map_plain_is_single_valued(map);
8455 test = isl_map_reverse(isl_map_copy(map));
8456 test = isl_map_apply_range(test, isl_map_copy(map));
8458 dim = isl_dim_map_from_set(isl_dim_range(isl_map_get_dim(map)));
8459 id = isl_map_identity(dim);
8461 sv = isl_map_is_subset(test, id);
8469 int isl_map_is_injective(__isl_keep isl_map *map)
8473 map = isl_map_copy(map);
8474 map = isl_map_reverse(map);
8475 in = isl_map_is_single_valued(map);
8481 /* Check if the given map is obviously injective.
8483 int isl_map_plain_is_injective(__isl_keep isl_map *map)
8487 map = isl_map_copy(map);
8488 map = isl_map_reverse(map);
8489 in = isl_map_plain_is_single_valued(map);
8495 int isl_map_is_bijective(__isl_keep isl_map *map)
8499 sv = isl_map_is_single_valued(map);
8503 return isl_map_is_injective(map);
8506 int isl_set_is_singleton(__isl_keep isl_set *set)
8508 return isl_map_is_single_valued((isl_map *)set);
8511 int isl_map_is_translation(__isl_keep isl_map *map)
8516 delta = isl_map_deltas(isl_map_copy(map));
8517 ok = isl_set_is_singleton(delta);
8518 isl_set_free(delta);
8523 static int unique(isl_int *p, unsigned pos, unsigned len)
8525 if (isl_seq_first_non_zero(p, pos) != -1)
8527 if (isl_seq_first_non_zero(p + pos + 1, len - pos - 1) != -1)
8532 int isl_basic_set_is_box(__isl_keep isl_basic_set *bset)
8541 if (isl_basic_set_dim(bset, isl_dim_div) != 0)
8544 nvar = isl_basic_set_dim(bset, isl_dim_set);
8545 ovar = isl_dim_offset(bset->dim, isl_dim_set);
8546 for (j = 0; j < nvar; ++j) {
8547 int lower = 0, upper = 0;
8548 for (i = 0; i < bset->n_eq; ++i) {
8549 if (isl_int_is_zero(bset->eq[i][1 + ovar + j]))
8551 if (!unique(bset->eq[i] + 1 + ovar, j, nvar))
8557 for (i = 0; i < bset->n_ineq; ++i) {
8558 if (isl_int_is_zero(bset->ineq[i][1 + ovar + j]))
8560 if (!unique(bset->ineq[i] + 1 + ovar, j, nvar))
8562 if (isl_int_is_pos(bset->ineq[i][1 + ovar + j]))
8567 if (!lower || !upper)
8574 int isl_set_is_box(__isl_keep isl_set *set)
8581 return isl_basic_set_is_box(set->p[0]);
8584 int isl_basic_set_is_wrapping(__isl_keep isl_basic_set *bset)
8589 return isl_dim_is_wrapping(bset->dim);
8592 int isl_set_is_wrapping(__isl_keep isl_set *set)
8597 return isl_dim_is_wrapping(set->dim);
8600 __isl_give isl_basic_set *isl_basic_map_wrap(__isl_take isl_basic_map *bmap)
8602 bmap = isl_basic_map_cow(bmap);
8606 bmap->dim = isl_dim_wrap(bmap->dim);
8610 bmap = isl_basic_map_finalize(bmap);
8612 return (isl_basic_set *)bmap;
8614 isl_basic_map_free(bmap);
8618 __isl_give isl_set *isl_map_wrap(__isl_take isl_map *map)
8622 map = isl_map_cow(map);
8626 for (i = 0; i < map->n; ++i) {
8627 map->p[i] = (isl_basic_map *)isl_basic_map_wrap(map->p[i]);
8631 map->dim = isl_dim_wrap(map->dim);
8635 return (isl_set *)map;
8641 __isl_give isl_basic_map *isl_basic_set_unwrap(__isl_take isl_basic_set *bset)
8643 bset = isl_basic_set_cow(bset);
8647 bset->dim = isl_dim_unwrap(bset->dim);
8651 bset = isl_basic_set_finalize(bset);
8653 return (isl_basic_map *)bset;
8655 isl_basic_set_free(bset);
8659 __isl_give isl_map *isl_set_unwrap(__isl_take isl_set *set)
8666 if (!isl_set_is_wrapping(set))
8667 isl_die(set->ctx, isl_error_invalid, "not a wrapping set",
8670 set = isl_set_cow(set);
8674 for (i = 0; i < set->n; ++i) {
8675 set->p[i] = (isl_basic_set *)isl_basic_set_unwrap(set->p[i]);
8680 set->dim = isl_dim_unwrap(set->dim);
8684 return (isl_map *)set;
8690 __isl_give isl_basic_map *isl_basic_map_reset(__isl_take isl_basic_map *bmap,
8691 enum isl_dim_type type)
8696 if (!isl_dim_is_named_or_nested(bmap->dim, type))
8699 bmap = isl_basic_map_cow(bmap);
8703 bmap->dim = isl_dim_reset(bmap->dim, type);
8707 bmap = isl_basic_map_finalize(bmap);
8711 isl_basic_map_free(bmap);
8715 __isl_give isl_map *isl_map_reset(__isl_take isl_map *map,
8716 enum isl_dim_type type)
8723 if (!isl_dim_is_named_or_nested(map->dim, type))
8726 map = isl_map_cow(map);
8730 for (i = 0; i < map->n; ++i) {
8731 map->p[i] = isl_basic_map_reset(map->p[i], type);
8735 map->dim = isl_dim_reset(map->dim, type);
8745 __isl_give isl_basic_map *isl_basic_map_flatten(__isl_take isl_basic_map *bmap)
8750 if (!bmap->dim->nested[0] && !bmap->dim->nested[1])
8753 bmap = isl_basic_map_cow(bmap);
8757 bmap->dim = isl_dim_flatten(bmap->dim);
8761 bmap = isl_basic_map_finalize(bmap);
8765 isl_basic_map_free(bmap);
8769 __isl_give isl_basic_set *isl_basic_set_flatten(__isl_take isl_basic_set *bset)
8771 return (isl_basic_set *)isl_basic_map_flatten((isl_basic_map *)bset);
8774 __isl_give isl_basic_map *isl_basic_map_flatten_range(
8775 __isl_take isl_basic_map *bmap)
8780 if (!bmap->dim->nested[1])
8783 bmap = isl_basic_map_cow(bmap);
8787 bmap->dim = isl_dim_flatten_range(bmap->dim);
8791 bmap = isl_basic_map_finalize(bmap);
8795 isl_basic_map_free(bmap);
8799 __isl_give isl_map *isl_map_flatten(__isl_take isl_map *map)
8806 if (!map->dim->nested[0] && !map->dim->nested[1])
8809 map = isl_map_cow(map);
8813 for (i = 0; i < map->n; ++i) {
8814 map->p[i] = isl_basic_map_flatten(map->p[i]);
8818 map->dim = isl_dim_flatten(map->dim);
8828 __isl_give isl_set *isl_set_flatten(__isl_take isl_set *set)
8830 return (isl_set *)isl_map_flatten((isl_map *)set);
8833 __isl_give isl_map *isl_set_flatten_map(__isl_take isl_set *set)
8835 isl_dim *dim, *flat_dim;
8838 dim = isl_set_get_dim(set);
8839 flat_dim = isl_dim_flatten(isl_dim_copy(dim));
8840 map = isl_map_identity(isl_dim_join(isl_dim_reverse(dim), flat_dim));
8841 map = isl_map_intersect_domain(map, set);
8846 __isl_give isl_map *isl_map_flatten_range(__isl_take isl_map *map)
8853 if (!map->dim->nested[1])
8856 map = isl_map_cow(map);
8860 for (i = 0; i < map->n; ++i) {
8861 map->p[i] = isl_basic_map_flatten_range(map->p[i]);
8865 map->dim = isl_dim_flatten_range(map->dim);
8875 /* Reorder the dimensions of "bmap" according to the given dim_map
8876 * and set the dimension specification to "dim".
8878 __isl_give isl_basic_map *isl_basic_map_realign(__isl_take isl_basic_map *bmap,
8879 __isl_take isl_dim *dim, __isl_take struct isl_dim_map *dim_map)
8883 bmap = isl_basic_map_cow(bmap);
8884 if (!bmap || !dim || !dim_map)
8887 res = isl_basic_map_alloc_dim(dim,
8888 bmap->n_div, bmap->n_eq, bmap->n_ineq);
8889 res = isl_basic_map_add_constraints_dim_map(res, bmap, dim_map);
8890 res = isl_basic_map_finalize(res);
8894 isl_basic_map_free(bmap);
8899 /* Reorder the dimensions of "map" according to given reordering.
8901 __isl_give isl_map *isl_map_realign(__isl_take isl_map *map,
8902 __isl_take isl_reordering *r)
8905 struct isl_dim_map *dim_map;
8907 map = isl_map_cow(map);
8908 dim_map = isl_dim_map_from_reordering(r);
8909 if (!map || !r || !dim_map)
8912 for (i = 0; i < map->n; ++i) {
8913 struct isl_dim_map *dim_map_i;
8915 dim_map_i = isl_dim_map_extend(dim_map, map->p[i]);
8917 map->p[i] = isl_basic_map_realign(map->p[i],
8918 isl_dim_copy(r->dim), dim_map_i);
8924 map = isl_map_reset_dim(map, isl_dim_copy(r->dim));
8926 isl_reordering_free(r);
8932 isl_reordering_free(r);
8936 __isl_give isl_set *isl_set_realign(__isl_take isl_set *set,
8937 __isl_take isl_reordering *r)
8939 return (isl_set *)isl_map_realign((isl_map *)set, r);
8942 __isl_give isl_map *isl_map_align_params(__isl_take isl_map *map,
8943 __isl_take isl_dim *model)
8950 ctx = isl_dim_get_ctx(model);
8951 if (!isl_dim_has_named_params(model))
8952 isl_die(ctx, isl_error_invalid,
8953 "model has unnamed parameters", goto error);
8954 if (!isl_dim_has_named_params(map->dim))
8955 isl_die(ctx, isl_error_invalid,
8956 "relation has unnamed parameters", goto error);
8957 if (!isl_dim_match(map->dim, isl_dim_param, model, isl_dim_param)) {
8958 isl_reordering *exp;
8960 model = isl_dim_drop(model, isl_dim_in,
8961 0, isl_dim_size(model, isl_dim_in));
8962 model = isl_dim_drop(model, isl_dim_out,
8963 0, isl_dim_size(model, isl_dim_out));
8964 exp = isl_parameter_alignment_reordering(map->dim, model);
8965 exp = isl_reordering_extend_dim(exp, isl_map_get_dim(map));
8966 map = isl_map_realign(map, exp);
8969 isl_dim_free(model);
8972 isl_dim_free(model);
8977 __isl_give isl_set *isl_set_align_params(__isl_take isl_set *set,
8978 __isl_take isl_dim *model)
8980 return isl_map_align_params(set, model);
8983 __isl_give isl_mat *isl_basic_map_equalities_matrix(
8984 __isl_keep isl_basic_map *bmap, enum isl_dim_type c1,
8985 enum isl_dim_type c2, enum isl_dim_type c3,
8986 enum isl_dim_type c4, enum isl_dim_type c5)
8988 enum isl_dim_type c[5] = { c1, c2, c3, c4, c5 };
8989 struct isl_mat *mat;
8995 mat = isl_mat_alloc(bmap->ctx, bmap->n_eq,
8996 isl_basic_map_total_dim(bmap) + 1);
8999 for (i = 0; i < bmap->n_eq; ++i)
9000 for (j = 0, pos = 0; j < 5; ++j) {
9001 int off = isl_basic_map_offset(bmap, c[j]);
9002 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
9003 isl_int_set(mat->row[i][pos],
9004 bmap->eq[i][off + k]);
9012 __isl_give isl_mat *isl_basic_map_inequalities_matrix(
9013 __isl_keep isl_basic_map *bmap, enum isl_dim_type c1,
9014 enum isl_dim_type c2, enum isl_dim_type c3,
9015 enum isl_dim_type c4, enum isl_dim_type c5)
9017 enum isl_dim_type c[5] = { c1, c2, c3, c4, c5 };
9018 struct isl_mat *mat;
9024 mat = isl_mat_alloc(bmap->ctx, bmap->n_ineq,
9025 isl_basic_map_total_dim(bmap) + 1);
9028 for (i = 0; i < bmap->n_ineq; ++i)
9029 for (j = 0, pos = 0; j < 5; ++j) {
9030 int off = isl_basic_map_offset(bmap, c[j]);
9031 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
9032 isl_int_set(mat->row[i][pos],
9033 bmap->ineq[i][off + k]);
9041 __isl_give isl_basic_map *isl_basic_map_from_constraint_matrices(
9042 __isl_take isl_dim *dim,
9043 __isl_take isl_mat *eq, __isl_take isl_mat *ineq, enum isl_dim_type c1,
9044 enum isl_dim_type c2, enum isl_dim_type c3,
9045 enum isl_dim_type c4, enum isl_dim_type c5)
9047 enum isl_dim_type c[5] = { c1, c2, c3, c4, c5 };
9048 isl_basic_map *bmap;
9054 if (!dim || !eq || !ineq)
9057 if (eq->n_col != ineq->n_col)
9058 isl_die(dim->ctx, isl_error_invalid,
9059 "equalities and inequalities matrices should have "
9060 "same number of columns", goto error);
9062 total = 1 + isl_dim_total(dim);
9064 if (eq->n_col < total)
9065 isl_die(dim->ctx, isl_error_invalid,
9066 "number of columns too small", goto error);
9068 extra = eq->n_col - total;
9070 bmap = isl_basic_map_alloc_dim(isl_dim_copy(dim), extra,
9071 eq->n_row, ineq->n_row);
9074 for (i = 0; i < extra; ++i) {
9075 k = isl_basic_map_alloc_div(bmap);
9078 isl_int_set_si(bmap->div[k][0], 0);
9080 for (i = 0; i < eq->n_row; ++i) {
9081 l = isl_basic_map_alloc_equality(bmap);
9084 for (j = 0, pos = 0; j < 5; ++j) {
9085 int off = isl_basic_map_offset(bmap, c[j]);
9086 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
9087 isl_int_set(bmap->eq[l][off + k],
9093 for (i = 0; i < ineq->n_row; ++i) {
9094 l = isl_basic_map_alloc_inequality(bmap);
9097 for (j = 0, pos = 0; j < 5; ++j) {
9098 int off = isl_basic_map_offset(bmap, c[j]);
9099 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
9100 isl_int_set(bmap->ineq[l][off + k],
9119 __isl_give isl_mat *isl_basic_set_equalities_matrix(
9120 __isl_keep isl_basic_set *bset, enum isl_dim_type c1,
9121 enum isl_dim_type c2, enum isl_dim_type c3, enum isl_dim_type c4)
9123 return isl_basic_map_equalities_matrix((isl_basic_map *)bset,
9124 c1, c2, c3, c4, isl_dim_in);
9127 __isl_give isl_mat *isl_basic_set_inequalities_matrix(
9128 __isl_keep isl_basic_set *bset, enum isl_dim_type c1,
9129 enum isl_dim_type c2, enum isl_dim_type c3, enum isl_dim_type c4)
9131 return isl_basic_map_inequalities_matrix((isl_basic_map *)bset,
9132 c1, c2, c3, c4, isl_dim_in);
9135 __isl_give isl_basic_set *isl_basic_set_from_constraint_matrices(
9136 __isl_take isl_dim *dim,
9137 __isl_take isl_mat *eq, __isl_take isl_mat *ineq, enum isl_dim_type c1,
9138 enum isl_dim_type c2, enum isl_dim_type c3, enum isl_dim_type c4)
9140 return (isl_basic_set*)
9141 isl_basic_map_from_constraint_matrices(dim, eq, ineq,
9142 c1, c2, c3, c4, isl_dim_in);
9145 int isl_basic_map_can_zip(__isl_keep isl_basic_map *bmap)
9150 return isl_dim_can_zip(bmap->dim);
9153 int isl_map_can_zip(__isl_keep isl_map *map)
9158 return isl_dim_can_zip(map->dim);
9161 /* Given a basic map (A -> B) -> (C -> D), return the corresponding basic map
9162 * (A -> C) -> (B -> D).
9164 __isl_give isl_basic_map *isl_basic_map_zip(__isl_take isl_basic_map *bmap)
9173 if (!isl_basic_map_can_zip(bmap))
9174 isl_die(bmap->ctx, isl_error_invalid,
9175 "basic map cannot be zipped", goto error);
9176 pos = isl_basic_map_offset(bmap, isl_dim_in) +
9177 isl_dim_size(bmap->dim->nested[0], isl_dim_in);
9178 n1 = isl_dim_size(bmap->dim->nested[0], isl_dim_out);
9179 n2 = isl_dim_size(bmap->dim->nested[1], isl_dim_in);
9180 bmap = isl_basic_map_swap_vars(bmap, pos, n1, n2);
9183 bmap->dim = isl_dim_zip(bmap->dim);
9188 isl_basic_map_free(bmap);
9192 /* Given a map (A -> B) -> (C -> D), return the corresponding map
9193 * (A -> C) -> (B -> D).
9195 __isl_give isl_map *isl_map_zip(__isl_take isl_map *map)
9202 if (!isl_map_can_zip(map))
9203 isl_die(map->ctx, isl_error_invalid, "map cannot be zipped",
9206 map = isl_map_cow(map);
9210 for (i = 0; i < map->n; ++i) {
9211 map->p[i] = isl_basic_map_zip(map->p[i]);
9216 map->dim = isl_dim_zip(map->dim);
9226 /* Construct a basic map mapping the domain of the affine expression
9227 * to a one-dimensional range prescribed by the affine expression.
9229 __isl_give isl_basic_map *isl_basic_map_from_aff(__isl_take isl_aff *aff)
9233 isl_local_space *ls;
9234 isl_basic_map *bmap;
9239 ls = isl_aff_get_local_space(aff);
9240 ls = isl_local_space_from_domain(ls);
9241 ls = isl_local_space_add_dims(ls, isl_dim_out, 1);
9242 bmap = isl_basic_map_from_local_space(ls);
9243 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
9244 k = isl_basic_map_alloc_equality(bmap);
9248 pos = isl_basic_map_offset(bmap, isl_dim_out);
9249 isl_seq_cpy(bmap->eq[k], aff->v->el + 1, pos);
9250 isl_int_neg(bmap->eq[k][pos], aff->v->el[0]);
9251 isl_seq_cpy(bmap->eq[k] + pos + 1, aff->v->el + 1 + pos,
9252 aff->v->size - (pos + 1));
9255 bmap = isl_basic_map_finalize(bmap);
9259 isl_basic_map_free(bmap);
9263 /* Construct a basic map mapping a domain in the given space to
9264 * to an n-dimensional range, with n the number of elements in the list,
9265 * where each coordinate in the range is prescribed by the
9266 * corresponding affine expression.
9267 * The domains of all affine expressions in the list are assumed to match
9270 __isl_give isl_basic_map *isl_basic_map_from_aff_list(
9271 __isl_take isl_dim *domain_dim, __isl_take isl_aff_list *list)
9275 isl_basic_map *bmap;
9280 dim = isl_dim_from_domain(domain_dim);
9281 bmap = isl_basic_map_universe(dim);
9283 for (i = 0; i < list->n; ++i) {
9285 isl_basic_map *bmap_i;
9287 aff = isl_aff_copy(list->p[i]);
9288 bmap_i = isl_basic_map_from_aff(aff);
9290 bmap = isl_basic_map_flat_range_product(bmap, bmap_i);
9293 isl_aff_list_free(list);
9297 __isl_give isl_set *isl_set_equate(__isl_take isl_set *set,
9298 enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2)
9300 return isl_map_equate(set, type1, pos1, type2, pos2);
9303 /* Add a constraint imposing that the given two dimensions are equal.
9305 __isl_give isl_map *isl_map_equate(__isl_take isl_map *map,
9306 enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2)
9308 isl_basic_map *bmap = NULL;
9314 if (pos1 >= isl_map_dim(map, type1))
9315 isl_die(map->ctx, isl_error_invalid,
9316 "index out of bounds", goto error);
9317 if (pos2 >= isl_map_dim(map, type2))
9318 isl_die(map->ctx, isl_error_invalid,
9319 "index out of bounds", goto error);
9321 bmap = isl_basic_map_alloc_dim(isl_map_get_dim(map), 0, 1, 0);
9322 i = isl_basic_map_alloc_equality(bmap);
9325 isl_seq_clr(bmap->eq[i], 1 + isl_basic_map_total_dim(bmap));
9326 pos1 += isl_basic_map_offset(bmap, type1);
9327 pos2 += isl_basic_map_offset(bmap, type2);
9328 isl_int_set_si(bmap->eq[i][pos1], -1);
9329 isl_int_set_si(bmap->eq[i][pos2], 1);
9330 bmap = isl_basic_map_finalize(bmap);
9332 map = isl_map_intersect(map, isl_map_from_basic_map(bmap));
9336 isl_basic_map_free(bmap);
9341 /* Add a constraint imposing that the given two dimensions have opposite values.
9343 __isl_give isl_map *isl_map_oppose(__isl_take isl_map *map,
9344 enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2)
9346 isl_basic_map *bmap = NULL;
9352 if (pos1 >= isl_map_dim(map, type1))
9353 isl_die(map->ctx, isl_error_invalid,
9354 "index out of bounds", goto error);
9355 if (pos2 >= isl_map_dim(map, type2))
9356 isl_die(map->ctx, isl_error_invalid,
9357 "index out of bounds", goto error);
9359 bmap = isl_basic_map_alloc_dim(isl_map_get_dim(map), 0, 1, 0);
9360 i = isl_basic_map_alloc_equality(bmap);
9363 isl_seq_clr(bmap->eq[i], 1 + isl_basic_map_total_dim(bmap));
9364 pos1 += isl_basic_map_offset(bmap, type1);
9365 pos2 += isl_basic_map_offset(bmap, type2);
9366 isl_int_set_si(bmap->eq[i][pos1], 1);
9367 isl_int_set_si(bmap->eq[i][pos2], 1);
9368 bmap = isl_basic_map_finalize(bmap);
9370 map = isl_map_intersect(map, isl_map_from_basic_map(bmap));
9374 isl_basic_map_free(bmap);