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 __isl_give isl_id *isl_map_get_tuple_id(__isl_keep isl_map *map,
437 enum isl_dim_type type)
439 return map ? isl_dim_get_tuple_id(map->dim, type) : NULL;
442 __isl_give isl_id *isl_set_get_tuple_id(__isl_keep isl_set *set)
444 return isl_map_get_tuple_id(set, isl_dim_set);
447 const char *isl_basic_set_get_tuple_name(__isl_keep isl_basic_set *bset)
449 return bset ? isl_dim_get_tuple_name(bset->dim, isl_dim_set) : NULL;
452 const char *isl_set_get_tuple_name(__isl_keep isl_set *set)
454 return set ? isl_dim_get_tuple_name(set->dim, isl_dim_set) : NULL;
457 const char *isl_basic_map_get_dim_name(__isl_keep isl_basic_map *bmap,
458 enum isl_dim_type type, unsigned pos)
460 return bmap ? isl_dim_get_name(bmap->dim, type, pos) : NULL;
463 const char *isl_basic_set_get_dim_name(__isl_keep isl_basic_set *bset,
464 enum isl_dim_type type, unsigned pos)
466 return bset ? isl_dim_get_name(bset->dim, type, pos) : NULL;
469 const char *isl_map_get_dim_name(__isl_keep isl_map *map,
470 enum isl_dim_type type, unsigned pos)
472 return map ? isl_dim_get_name(map->dim, type, pos) : NULL;
475 const char *isl_set_get_dim_name(__isl_keep isl_set *set,
476 enum isl_dim_type type, unsigned pos)
478 return set ? isl_dim_get_name(set->dim, type, pos) : NULL;
481 __isl_give isl_basic_map *isl_basic_map_set_dim_name(
482 __isl_take isl_basic_map *bmap,
483 enum isl_dim_type type, unsigned pos, const char *s)
487 bmap->dim = isl_dim_set_name(bmap->dim, type, pos, s);
492 isl_basic_map_free(bmap);
496 __isl_give isl_map *isl_map_set_dim_name(__isl_take isl_map *map,
497 enum isl_dim_type type, unsigned pos, const char *s)
504 map->dim = isl_dim_set_name(map->dim, type, pos, s);
508 for (i = 0; i < map->n; ++i) {
509 map->p[i] = isl_basic_map_set_dim_name(map->p[i], type, pos, s);
520 __isl_give isl_basic_set *isl_basic_set_set_dim_name(
521 __isl_take isl_basic_set *bset,
522 enum isl_dim_type type, unsigned pos, const char *s)
524 return (isl_basic_set *)isl_basic_map_set_dim_name(
525 (isl_basic_map *)bset, type, pos, s);
528 __isl_give isl_set *isl_set_set_dim_name(__isl_take isl_set *set,
529 enum isl_dim_type type, unsigned pos, const char *s)
531 return (isl_set *)isl_map_set_dim_name((isl_map *)set, type, pos, s);
534 int isl_map_has_dim_id(__isl_keep isl_map *map,
535 enum isl_dim_type type, unsigned pos)
537 return map ? isl_dim_has_dim_id(map->dim, type, pos) : -1;
540 __isl_give isl_id *isl_map_get_dim_id(__isl_keep isl_map *map,
541 enum isl_dim_type type, unsigned pos)
543 return map ? isl_dim_get_dim_id(map->dim, type, pos) : NULL;
546 int isl_set_has_dim_id(__isl_keep isl_set *set,
547 enum isl_dim_type type, unsigned pos)
549 return isl_map_has_dim_id(set, type, pos);
552 __isl_give isl_id *isl_set_get_dim_id(__isl_keep isl_set *set,
553 enum isl_dim_type type, unsigned pos)
555 return isl_map_get_dim_id(set, type, pos);
558 __isl_give isl_map *isl_map_set_dim_id(__isl_take isl_map *map,
559 enum isl_dim_type type, unsigned pos, __isl_take isl_id *id)
561 map = isl_map_cow(map);
563 return isl_id_free(id);
565 map->dim = isl_dim_set_dim_id(map->dim, type, pos, id);
567 return isl_map_reset_dim(map, isl_dim_copy(map->dim));
570 __isl_give isl_set *isl_set_set_dim_id(__isl_take isl_set *set,
571 enum isl_dim_type type, unsigned pos, __isl_take isl_id *id)
573 return isl_map_set_dim_id(set, type, pos, id);
576 int isl_map_find_dim_by_id(__isl_keep isl_map *map, enum isl_dim_type type,
577 __isl_keep isl_id *id)
581 return isl_dim_find_dim_by_id(map->dim, type, id);
584 int isl_set_find_dim_by_id(__isl_keep isl_set *set, enum isl_dim_type type,
585 __isl_keep isl_id *id)
587 return isl_map_find_dim_by_id(set, type, id);
590 int isl_basic_map_is_rational(__isl_keep isl_basic_map *bmap)
594 return ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL);
597 int isl_basic_set_is_rational(__isl_keep isl_basic_set *bset)
599 return isl_basic_map_is_rational(bset);
602 static struct isl_basic_map *basic_map_init(struct isl_ctx *ctx,
603 struct isl_basic_map *bmap, unsigned extra,
604 unsigned n_eq, unsigned n_ineq)
607 size_t row_size = 1 + isl_dim_total(bmap->dim) + extra;
612 bmap->block = isl_blk_alloc(ctx, (n_ineq + n_eq) * row_size);
613 if (isl_blk_is_error(bmap->block))
616 bmap->ineq = isl_alloc_array(ctx, isl_int *, n_ineq + n_eq);
621 bmap->block2 = isl_blk_empty();
624 bmap->block2 = isl_blk_alloc(ctx, extra * (1 + row_size));
625 if (isl_blk_is_error(bmap->block2))
628 bmap->div = isl_alloc_array(ctx, isl_int *, extra);
633 for (i = 0; i < n_ineq + n_eq; ++i)
634 bmap->ineq[i] = bmap->block.data + i * row_size;
636 for (i = 0; i < extra; ++i)
637 bmap->div[i] = bmap->block2.data + i * (1 + row_size);
641 bmap->c_size = n_eq + n_ineq;
642 bmap->eq = bmap->ineq + n_ineq;
651 isl_basic_map_free(bmap);
655 struct isl_basic_set *isl_basic_set_alloc(struct isl_ctx *ctx,
656 unsigned nparam, unsigned dim, unsigned extra,
657 unsigned n_eq, unsigned n_ineq)
659 struct isl_basic_map *bmap;
660 bmap = isl_basic_map_alloc(ctx, nparam, 0, dim, extra, n_eq, n_ineq);
661 return (struct isl_basic_set *)bmap;
664 struct isl_basic_set *isl_basic_set_alloc_dim(struct isl_dim *dim,
665 unsigned extra, unsigned n_eq, unsigned n_ineq)
667 struct isl_basic_map *bmap;
670 isl_assert(dim->ctx, dim->n_in == 0, goto error);
671 bmap = isl_basic_map_alloc_dim(dim, extra, n_eq, n_ineq);
672 return (struct isl_basic_set *)bmap;
678 struct isl_basic_map *isl_basic_map_alloc_dim(struct isl_dim *dim,
679 unsigned extra, unsigned n_eq, unsigned n_ineq)
681 struct isl_basic_map *bmap;
685 bmap = isl_calloc_type(dim->ctx, struct isl_basic_map);
690 return basic_map_init(dim->ctx, bmap, extra, n_eq, n_ineq);
696 struct isl_basic_map *isl_basic_map_alloc(struct isl_ctx *ctx,
697 unsigned nparam, unsigned in, unsigned out, unsigned extra,
698 unsigned n_eq, unsigned n_ineq)
700 struct isl_basic_map *bmap;
703 dim = isl_dim_alloc(ctx, nparam, in, out);
707 bmap = isl_basic_map_alloc_dim(dim, extra, n_eq, n_ineq);
711 static void dup_constraints(
712 struct isl_basic_map *dst, struct isl_basic_map *src)
715 unsigned total = isl_basic_map_total_dim(src);
717 for (i = 0; i < src->n_eq; ++i) {
718 int j = isl_basic_map_alloc_equality(dst);
719 isl_seq_cpy(dst->eq[j], src->eq[i], 1+total);
722 for (i = 0; i < src->n_ineq; ++i) {
723 int j = isl_basic_map_alloc_inequality(dst);
724 isl_seq_cpy(dst->ineq[j], src->ineq[i], 1+total);
727 for (i = 0; i < src->n_div; ++i) {
728 int j = isl_basic_map_alloc_div(dst);
729 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total);
731 ISL_F_SET(dst, ISL_BASIC_SET_FINAL);
734 struct isl_basic_map *isl_basic_map_dup(struct isl_basic_map *bmap)
736 struct isl_basic_map *dup;
740 dup = isl_basic_map_alloc_dim(isl_dim_copy(bmap->dim),
741 bmap->n_div, bmap->n_eq, bmap->n_ineq);
744 dup_constraints(dup, bmap);
745 dup->flags = bmap->flags;
746 dup->sample = isl_vec_copy(bmap->sample);
750 struct isl_basic_set *isl_basic_set_dup(struct isl_basic_set *bset)
752 struct isl_basic_map *dup;
754 dup = isl_basic_map_dup((struct isl_basic_map *)bset);
755 return (struct isl_basic_set *)dup;
758 struct isl_basic_set *isl_basic_set_copy(struct isl_basic_set *bset)
763 if (ISL_F_ISSET(bset, ISL_BASIC_SET_FINAL)) {
767 return isl_basic_set_dup(bset);
770 struct isl_set *isl_set_copy(struct isl_set *set)
779 struct isl_basic_map *isl_basic_map_copy(struct isl_basic_map *bmap)
784 if (ISL_F_ISSET(bmap, ISL_BASIC_SET_FINAL)) {
788 bmap = isl_basic_map_dup(bmap);
790 ISL_F_SET(bmap, ISL_BASIC_SET_FINAL);
794 struct isl_map *isl_map_copy(struct isl_map *map)
803 void isl_basic_map_free(struct isl_basic_map *bmap)
811 isl_ctx_deref(bmap->ctx);
813 isl_blk_free(bmap->ctx, bmap->block2);
815 isl_blk_free(bmap->ctx, bmap->block);
816 isl_vec_free(bmap->sample);
817 isl_dim_free(bmap->dim);
821 void isl_basic_set_free(struct isl_basic_set *bset)
823 isl_basic_map_free((struct isl_basic_map *)bset);
826 static int room_for_con(struct isl_basic_map *bmap, unsigned n)
828 return bmap->n_eq + bmap->n_ineq + n <= bmap->c_size;
831 __isl_give isl_map *isl_map_align_params_map_map_and(
832 __isl_take isl_map *map1, __isl_take isl_map *map2,
833 __isl_give isl_map *(*fn)(__isl_take isl_map *map1,
834 __isl_take isl_map *map2))
838 if (isl_dim_match(map1->dim, isl_dim_param, map2->dim, isl_dim_param))
839 return fn(map1, map2);
840 if (!isl_dim_has_named_params(map1->dim) ||
841 !isl_dim_has_named_params(map2->dim))
842 isl_die(map1->ctx, isl_error_invalid,
843 "unaligned unnamed parameters", goto error);
844 map1 = isl_map_align_params(map1, isl_map_get_dim(map2));
845 map2 = isl_map_align_params(map2, isl_map_get_dim(map1));
846 return fn(map1, map2);
853 static int align_params_map_map_and_test(__isl_keep isl_map *map1,
854 __isl_keep isl_map *map2,
855 int (*fn)(__isl_keep isl_map *map1, __isl_keep isl_map *map2))
861 if (isl_dim_match(map1->dim, isl_dim_param, map2->dim, isl_dim_param))
862 return fn(map1, map2);
863 if (!isl_dim_has_named_params(map1->dim) ||
864 !isl_dim_has_named_params(map2->dim))
865 isl_die(map1->ctx, isl_error_invalid,
866 "unaligned unnamed parameters", return -1);
867 map1 = isl_map_copy(map1);
868 map2 = isl_map_copy(map2);
869 map1 = isl_map_align_params(map1, isl_map_get_dim(map2));
870 map2 = isl_map_align_params(map2, isl_map_get_dim(map1));
877 int isl_basic_map_alloc_equality(struct isl_basic_map *bmap)
883 isl_assert(ctx, room_for_con(bmap, 1), return -1);
884 isl_assert(ctx, (bmap->eq - bmap->ineq) + bmap->n_eq <= bmap->c_size,
886 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
887 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
888 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_IMPLICIT);
889 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
890 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
891 if ((bmap->eq - bmap->ineq) + bmap->n_eq == bmap->c_size) {
893 int j = isl_basic_map_alloc_inequality(bmap);
897 bmap->ineq[j] = bmap->ineq[bmap->n_ineq - 1];
898 bmap->ineq[bmap->n_ineq - 1] = bmap->eq[-1];
905 isl_seq_clr(bmap->eq[bmap->n_eq] + 1 + isl_basic_map_total_dim(bmap),
906 bmap->extra - bmap->n_div);
910 int isl_basic_set_alloc_equality(struct isl_basic_set *bset)
912 return isl_basic_map_alloc_equality((struct isl_basic_map *)bset);
915 int isl_basic_map_free_equality(struct isl_basic_map *bmap, unsigned n)
919 isl_assert(bmap->ctx, n <= bmap->n_eq, return -1);
924 int isl_basic_set_free_equality(struct isl_basic_set *bset, unsigned n)
926 return isl_basic_map_free_equality((struct isl_basic_map *)bset, n);
929 int isl_basic_map_drop_equality(struct isl_basic_map *bmap, unsigned pos)
934 isl_assert(bmap->ctx, pos < bmap->n_eq, return -1);
936 if (pos != bmap->n_eq - 1) {
938 bmap->eq[pos] = bmap->eq[bmap->n_eq - 1];
939 bmap->eq[bmap->n_eq - 1] = t;
945 int isl_basic_set_drop_equality(struct isl_basic_set *bset, unsigned pos)
947 return isl_basic_map_drop_equality((struct isl_basic_map *)bset, pos);
950 void isl_basic_map_inequality_to_equality(
951 struct isl_basic_map *bmap, unsigned pos)
956 bmap->ineq[pos] = bmap->ineq[bmap->n_ineq - 1];
957 bmap->ineq[bmap->n_ineq - 1] = bmap->eq[-1];
962 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
963 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
964 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
965 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
968 static int room_for_ineq(struct isl_basic_map *bmap, unsigned n)
970 return bmap->n_ineq + n <= bmap->eq - bmap->ineq;
973 int isl_basic_map_alloc_inequality(struct isl_basic_map *bmap)
979 isl_assert(ctx, room_for_ineq(bmap, 1), return -1);
980 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_IMPLICIT);
981 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
982 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
983 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
984 isl_seq_clr(bmap->ineq[bmap->n_ineq] +
985 1 + isl_basic_map_total_dim(bmap),
986 bmap->extra - bmap->n_div);
987 return bmap->n_ineq++;
990 int isl_basic_set_alloc_inequality(struct isl_basic_set *bset)
992 return isl_basic_map_alloc_inequality((struct isl_basic_map *)bset);
995 int isl_basic_map_free_inequality(struct isl_basic_map *bmap, unsigned n)
999 isl_assert(bmap->ctx, n <= bmap->n_ineq, return -1);
1004 int isl_basic_set_free_inequality(struct isl_basic_set *bset, unsigned n)
1006 return isl_basic_map_free_inequality((struct isl_basic_map *)bset, n);
1009 int isl_basic_map_drop_inequality(struct isl_basic_map *bmap, unsigned pos)
1014 isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
1016 if (pos != bmap->n_ineq - 1) {
1017 t = bmap->ineq[pos];
1018 bmap->ineq[pos] = bmap->ineq[bmap->n_ineq - 1];
1019 bmap->ineq[bmap->n_ineq - 1] = t;
1020 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1026 int isl_basic_set_drop_inequality(struct isl_basic_set *bset, unsigned pos)
1028 return isl_basic_map_drop_inequality((struct isl_basic_map *)bset, pos);
1031 __isl_give isl_basic_map *isl_basic_map_add_eq(__isl_take isl_basic_map *bmap,
1036 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
1039 k = isl_basic_map_alloc_equality(bmap);
1042 isl_seq_cpy(bmap->eq[k], eq, 1 + isl_basic_map_total_dim(bmap));
1045 isl_basic_map_free(bmap);
1049 __isl_give isl_basic_set *isl_basic_set_add_eq(__isl_take isl_basic_set *bset,
1052 return (isl_basic_set *)
1053 isl_basic_map_add_eq((isl_basic_map *)bset, eq);
1056 __isl_give isl_basic_map *isl_basic_map_add_ineq(__isl_take isl_basic_map *bmap,
1061 bmap = isl_basic_map_extend_constraints(bmap, 0, 1);
1064 k = isl_basic_map_alloc_inequality(bmap);
1067 isl_seq_cpy(bmap->ineq[k], ineq, 1 + isl_basic_map_total_dim(bmap));
1070 isl_basic_map_free(bmap);
1074 __isl_give isl_basic_set *isl_basic_set_add_ineq(__isl_take isl_basic_set *bset,
1077 return (isl_basic_set *)
1078 isl_basic_map_add_ineq((isl_basic_map *)bset, ineq);
1081 int isl_basic_map_alloc_div(struct isl_basic_map *bmap)
1085 isl_assert(bmap->ctx, bmap->n_div < bmap->extra, return -1);
1086 isl_seq_clr(bmap->div[bmap->n_div] +
1087 1 + 1 + isl_basic_map_total_dim(bmap),
1088 bmap->extra - bmap->n_div);
1089 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
1090 return bmap->n_div++;
1093 int isl_basic_set_alloc_div(struct isl_basic_set *bset)
1095 return isl_basic_map_alloc_div((struct isl_basic_map *)bset);
1098 int isl_basic_map_free_div(struct isl_basic_map *bmap, unsigned n)
1102 isl_assert(bmap->ctx, n <= bmap->n_div, return -1);
1107 int isl_basic_set_free_div(struct isl_basic_set *bset, unsigned n)
1109 return isl_basic_map_free_div((struct isl_basic_map *)bset, n);
1112 /* Copy constraint from src to dst, putting the vars of src at offset
1113 * dim_off in dst and the divs of src at offset div_off in dst.
1114 * If both sets are actually map, then dim_off applies to the input
1117 static void copy_constraint(struct isl_basic_map *dst_map, isl_int *dst,
1118 struct isl_basic_map *src_map, isl_int *src,
1119 unsigned in_off, unsigned out_off, unsigned div_off)
1121 unsigned src_nparam = isl_basic_map_n_param(src_map);
1122 unsigned dst_nparam = isl_basic_map_n_param(dst_map);
1123 unsigned src_in = isl_basic_map_n_in(src_map);
1124 unsigned dst_in = isl_basic_map_n_in(dst_map);
1125 unsigned src_out = isl_basic_map_n_out(src_map);
1126 unsigned dst_out = isl_basic_map_n_out(dst_map);
1127 isl_int_set(dst[0], src[0]);
1128 isl_seq_cpy(dst+1, src+1, isl_min(dst_nparam, src_nparam));
1129 if (dst_nparam > src_nparam)
1130 isl_seq_clr(dst+1+src_nparam,
1131 dst_nparam - src_nparam);
1132 isl_seq_clr(dst+1+dst_nparam, in_off);
1133 isl_seq_cpy(dst+1+dst_nparam+in_off,
1135 isl_min(dst_in-in_off, src_in));
1136 if (dst_in-in_off > src_in)
1137 isl_seq_clr(dst+1+dst_nparam+in_off+src_in,
1138 dst_in - in_off - src_in);
1139 isl_seq_clr(dst+1+dst_nparam+dst_in, out_off);
1140 isl_seq_cpy(dst+1+dst_nparam+dst_in+out_off,
1141 src+1+src_nparam+src_in,
1142 isl_min(dst_out-out_off, src_out));
1143 if (dst_out-out_off > src_out)
1144 isl_seq_clr(dst+1+dst_nparam+dst_in+out_off+src_out,
1145 dst_out - out_off - src_out);
1146 isl_seq_clr(dst+1+dst_nparam+dst_in+dst_out, div_off);
1147 isl_seq_cpy(dst+1+dst_nparam+dst_in+dst_out+div_off,
1148 src+1+src_nparam+src_in+src_out,
1149 isl_min(dst_map->extra-div_off, src_map->n_div));
1150 if (dst_map->n_div-div_off > src_map->n_div)
1151 isl_seq_clr(dst+1+dst_nparam+dst_in+dst_out+
1152 div_off+src_map->n_div,
1153 dst_map->n_div - div_off - src_map->n_div);
1156 static void copy_div(struct isl_basic_map *dst_map, isl_int *dst,
1157 struct isl_basic_map *src_map, isl_int *src,
1158 unsigned in_off, unsigned out_off, unsigned div_off)
1160 isl_int_set(dst[0], src[0]);
1161 copy_constraint(dst_map, dst+1, src_map, src+1, in_off, out_off, div_off);
1164 static struct isl_basic_map *add_constraints(struct isl_basic_map *bmap1,
1165 struct isl_basic_map *bmap2, unsigned i_pos, unsigned o_pos)
1170 if (!bmap1 || !bmap2)
1173 div_off = bmap1->n_div;
1175 for (i = 0; i < bmap2->n_eq; ++i) {
1176 int i1 = isl_basic_map_alloc_equality(bmap1);
1179 copy_constraint(bmap1, bmap1->eq[i1], bmap2, bmap2->eq[i],
1180 i_pos, o_pos, div_off);
1183 for (i = 0; i < bmap2->n_ineq; ++i) {
1184 int i1 = isl_basic_map_alloc_inequality(bmap1);
1187 copy_constraint(bmap1, bmap1->ineq[i1], bmap2, bmap2->ineq[i],
1188 i_pos, o_pos, div_off);
1191 for (i = 0; i < bmap2->n_div; ++i) {
1192 int i1 = isl_basic_map_alloc_div(bmap1);
1195 copy_div(bmap1, bmap1->div[i1], bmap2, bmap2->div[i],
1196 i_pos, o_pos, div_off);
1199 isl_basic_map_free(bmap2);
1204 isl_basic_map_free(bmap1);
1205 isl_basic_map_free(bmap2);
1209 struct isl_basic_set *isl_basic_set_add_constraints(struct isl_basic_set *bset1,
1210 struct isl_basic_set *bset2, unsigned pos)
1212 return (struct isl_basic_set *)
1213 add_constraints((struct isl_basic_map *)bset1,
1214 (struct isl_basic_map *)bset2, 0, pos);
1217 struct isl_basic_map *isl_basic_map_extend_dim(struct isl_basic_map *base,
1218 struct isl_dim *dim, unsigned extra,
1219 unsigned n_eq, unsigned n_ineq)
1221 struct isl_basic_map *ext;
1231 dims_ok = isl_dim_equal(base->dim, dim) &&
1232 base->extra >= base->n_div + extra;
1234 if (dims_ok && room_for_con(base, n_eq + n_ineq) &&
1235 room_for_ineq(base, n_ineq)) {
1240 isl_assert(base->ctx, base->dim->nparam <= dim->nparam, goto error);
1241 isl_assert(base->ctx, base->dim->n_in <= dim->n_in, goto error);
1242 isl_assert(base->ctx, base->dim->n_out <= dim->n_out, goto error);
1243 extra += base->extra;
1245 n_ineq += base->n_ineq;
1247 ext = isl_basic_map_alloc_dim(dim, extra, n_eq, n_ineq);
1253 ext->sample = isl_vec_copy(base->sample);
1254 flags = base->flags;
1255 ext = add_constraints(ext, base, 0, 0);
1258 ISL_F_CLR(ext, ISL_BASIC_SET_FINAL);
1265 isl_basic_map_free(base);
1269 struct isl_basic_set *isl_basic_set_extend_dim(struct isl_basic_set *base,
1270 struct isl_dim *dim, unsigned extra,
1271 unsigned n_eq, unsigned n_ineq)
1273 return (struct isl_basic_set *)
1274 isl_basic_map_extend_dim((struct isl_basic_map *)base, dim,
1275 extra, n_eq, n_ineq);
1278 struct isl_basic_map *isl_basic_map_extend_constraints(
1279 struct isl_basic_map *base, unsigned n_eq, unsigned n_ineq)
1283 return isl_basic_map_extend_dim(base, isl_dim_copy(base->dim),
1287 struct isl_basic_map *isl_basic_map_extend(struct isl_basic_map *base,
1288 unsigned nparam, unsigned n_in, unsigned n_out, unsigned extra,
1289 unsigned n_eq, unsigned n_ineq)
1291 struct isl_basic_map *bmap;
1292 struct isl_dim *dim;
1296 dim = isl_dim_alloc(base->ctx, nparam, n_in, n_out);
1300 bmap = isl_basic_map_extend_dim(base, dim, extra, n_eq, n_ineq);
1303 isl_basic_map_free(base);
1307 struct isl_basic_set *isl_basic_set_extend(struct isl_basic_set *base,
1308 unsigned nparam, unsigned dim, unsigned extra,
1309 unsigned n_eq, unsigned n_ineq)
1311 return (struct isl_basic_set *)
1312 isl_basic_map_extend((struct isl_basic_map *)base,
1313 nparam, 0, dim, extra, n_eq, n_ineq);
1316 struct isl_basic_set *isl_basic_set_extend_constraints(
1317 struct isl_basic_set *base, unsigned n_eq, unsigned n_ineq)
1319 return (struct isl_basic_set *)
1320 isl_basic_map_extend_constraints((struct isl_basic_map *)base,
1324 struct isl_basic_set *isl_basic_set_cow(struct isl_basic_set *bset)
1326 return (struct isl_basic_set *)
1327 isl_basic_map_cow((struct isl_basic_map *)bset);
1330 struct isl_basic_map *isl_basic_map_cow(struct isl_basic_map *bmap)
1335 if (bmap->ref > 1) {
1337 bmap = isl_basic_map_dup(bmap);
1340 ISL_F_CLR(bmap, ISL_BASIC_SET_FINAL);
1344 struct isl_set *isl_set_cow(struct isl_set *set)
1352 return isl_set_dup(set);
1355 struct isl_map *isl_map_cow(struct isl_map *map)
1363 return isl_map_dup(map);
1366 static void swap_vars(struct isl_blk blk, isl_int *a,
1367 unsigned a_len, unsigned b_len)
1369 isl_seq_cpy(blk.data, a+a_len, b_len);
1370 isl_seq_cpy(blk.data+b_len, a, a_len);
1371 isl_seq_cpy(a, blk.data, b_len+a_len);
1374 static __isl_give isl_basic_map *isl_basic_map_swap_vars(
1375 __isl_take isl_basic_map *bmap, unsigned pos, unsigned n1, unsigned n2)
1383 isl_assert(bmap->ctx,
1384 pos + n1 + n2 <= 1 + isl_basic_map_total_dim(bmap), goto error);
1386 if (n1 == 0 || n2 == 0)
1389 bmap = isl_basic_map_cow(bmap);
1393 blk = isl_blk_alloc(bmap->ctx, n1 + n2);
1394 if (isl_blk_is_error(blk))
1397 for (i = 0; i < bmap->n_eq; ++i)
1399 bmap->eq[i] + pos, n1, n2);
1401 for (i = 0; i < bmap->n_ineq; ++i)
1403 bmap->ineq[i] + pos, n1, n2);
1405 for (i = 0; i < bmap->n_div; ++i)
1407 bmap->div[i]+1 + pos, n1, n2);
1409 isl_blk_free(bmap->ctx, blk);
1411 ISL_F_CLR(bmap, ISL_BASIC_SET_NORMALIZED);
1412 bmap = isl_basic_map_gauss(bmap, NULL);
1413 return isl_basic_map_finalize(bmap);
1415 isl_basic_map_free(bmap);
1419 static __isl_give isl_basic_set *isl_basic_set_swap_vars(
1420 __isl_take isl_basic_set *bset, unsigned n)
1425 nparam = isl_basic_set_n_param(bset);
1426 dim = isl_basic_set_n_dim(bset);
1427 isl_assert(bset->ctx, n <= dim, goto error);
1429 return isl_basic_map_swap_vars(bset, 1 + nparam, n, dim - n);
1431 isl_basic_set_free(bset);
1435 struct isl_basic_map *isl_basic_map_set_to_empty(struct isl_basic_map *bmap)
1441 total = isl_basic_map_total_dim(bmap);
1442 isl_basic_map_free_div(bmap, bmap->n_div);
1443 isl_basic_map_free_inequality(bmap, bmap->n_ineq);
1445 isl_basic_map_free_equality(bmap, bmap->n_eq-1);
1447 i = isl_basic_map_alloc_equality(bmap);
1451 isl_int_set_si(bmap->eq[i][0], 1);
1452 isl_seq_clr(bmap->eq[i]+1, total);
1453 ISL_F_SET(bmap, ISL_BASIC_MAP_EMPTY);
1454 isl_vec_free(bmap->sample);
1455 bmap->sample = NULL;
1456 return isl_basic_map_finalize(bmap);
1458 isl_basic_map_free(bmap);
1462 struct isl_basic_set *isl_basic_set_set_to_empty(struct isl_basic_set *bset)
1464 return (struct isl_basic_set *)
1465 isl_basic_map_set_to_empty((struct isl_basic_map *)bset);
1468 void isl_basic_map_swap_div(struct isl_basic_map *bmap, int a, int b)
1471 unsigned off = isl_dim_total(bmap->dim);
1472 isl_int *t = bmap->div[a];
1473 bmap->div[a] = bmap->div[b];
1476 for (i = 0; i < bmap->n_eq; ++i)
1477 isl_int_swap(bmap->eq[i][1+off+a], bmap->eq[i][1+off+b]);
1479 for (i = 0; i < bmap->n_ineq; ++i)
1480 isl_int_swap(bmap->ineq[i][1+off+a], bmap->ineq[i][1+off+b]);
1482 for (i = 0; i < bmap->n_div; ++i)
1483 isl_int_swap(bmap->div[i][1+1+off+a], bmap->div[i][1+1+off+b]);
1484 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1487 /* Eliminate the specified n dimensions starting at first from the
1488 * constraints using Fourier-Motzkin. The dimensions themselves
1491 __isl_give isl_map *isl_map_eliminate(__isl_take isl_map *map,
1492 enum isl_dim_type type, unsigned first, unsigned n)
1501 map = isl_map_cow(map);
1504 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
1505 first += pos(map->dim, type) - 1;
1507 for (i = 0; i < map->n; ++i) {
1508 map->p[i] = isl_basic_map_eliminate_vars(map->p[i], first, n);
1518 /* Eliminate the specified n dimensions starting at first from the
1519 * constraints using Fourier-Motzkin. The dimensions themselves
1522 __isl_give isl_set *isl_set_eliminate(__isl_take isl_set *set,
1523 enum isl_dim_type type, unsigned first, unsigned n)
1525 return (isl_set *)isl_map_eliminate((isl_map *)set, type, 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_dims(__isl_take isl_set *set,
1533 unsigned first, unsigned n)
1535 return isl_set_eliminate(set, isl_dim_set, first, n);
1538 __isl_give isl_basic_map *isl_basic_map_remove_divs(
1539 __isl_take isl_basic_map *bmap)
1543 bmap = isl_basic_map_eliminate_vars(bmap, isl_dim_total(bmap->dim),
1548 return isl_basic_map_finalize(bmap);
1551 __isl_give isl_basic_set *isl_basic_set_remove_divs(
1552 __isl_take isl_basic_set *bset)
1554 return (struct isl_basic_set *)isl_basic_map_remove_divs(
1555 (struct isl_basic_map *)bset);
1558 __isl_give isl_map *isl_map_remove_divs(__isl_take isl_map *map)
1567 map = isl_map_cow(map);
1571 for (i = 0; i < map->n; ++i) {
1572 map->p[i] = isl_basic_map_remove_divs(map->p[i]);
1582 __isl_give isl_set *isl_set_remove_divs(__isl_take isl_set *set)
1584 return isl_map_remove_divs(set);
1587 struct isl_basic_map *isl_basic_map_remove_dims(struct isl_basic_map *bmap,
1588 enum isl_dim_type type, unsigned first, unsigned n)
1592 isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
1594 if (n == 0 && !isl_dim_is_named_or_nested(bmap->dim, type))
1596 bmap = isl_basic_map_eliminate_vars(bmap,
1597 isl_basic_map_offset(bmap, type) - 1 + first, n);
1600 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY) && type == isl_dim_div)
1602 bmap = isl_basic_map_drop(bmap, type, first, n);
1605 isl_basic_map_free(bmap);
1609 /* Return true if the definition of the given div (recursively) involves
1610 * any of the given variables.
1612 static int div_involves_vars(__isl_keep isl_basic_map *bmap, int div,
1613 unsigned first, unsigned n)
1616 unsigned div_offset = isl_basic_map_offset(bmap, isl_dim_div);
1618 if (isl_int_is_zero(bmap->div[div][0]))
1620 if (isl_seq_first_non_zero(bmap->div[div] + 1 + first, n) >= 0)
1623 for (i = bmap->n_div - 1; i >= 0; --i) {
1624 if (isl_int_is_zero(bmap->div[div][1 + div_offset + i]))
1626 if (div_involves_vars(bmap, i, first, n))
1633 /* Remove all divs (recursively) involving any of the given dimensions
1634 * in their definitions.
1636 __isl_give isl_basic_map *isl_basic_map_remove_divs_involving_dims(
1637 __isl_take isl_basic_map *bmap,
1638 enum isl_dim_type type, unsigned first, unsigned n)
1644 isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
1646 first += isl_basic_map_offset(bmap, type);
1648 for (i = bmap->n_div - 1; i >= 0; --i) {
1649 if (!div_involves_vars(bmap, i, first, n))
1651 bmap = isl_basic_map_remove_dims(bmap, isl_dim_div, i, 1);
1659 isl_basic_map_free(bmap);
1663 __isl_give isl_map *isl_map_remove_divs_involving_dims(__isl_take isl_map *map,
1664 enum isl_dim_type type, unsigned first, unsigned n)
1673 map = isl_map_cow(map);
1677 for (i = 0; i < map->n; ++i) {
1678 map->p[i] = isl_basic_map_remove_divs_involving_dims(map->p[i],
1689 __isl_give isl_set *isl_set_remove_divs_involving_dims(__isl_take isl_set *set,
1690 enum isl_dim_type type, unsigned first, unsigned n)
1692 return (isl_set *)isl_map_remove_divs_involving_dims((isl_map *)set,
1696 int isl_basic_map_involves_dims(__isl_keep isl_basic_map *bmap,
1697 enum isl_dim_type type, unsigned first, unsigned n)
1704 if (first + n > isl_basic_map_dim(bmap, type))
1705 isl_die(bmap->ctx, isl_error_invalid,
1706 "index out of bounds", return -1);
1708 first += isl_basic_map_offset(bmap, type);
1709 for (i = 0; i < bmap->n_eq; ++i)
1710 if (isl_seq_first_non_zero(bmap->eq[i] + first, n) >= 0)
1712 for (i = 0; i < bmap->n_ineq; ++i)
1713 if (isl_seq_first_non_zero(bmap->ineq[i] + first, n) >= 0)
1719 int isl_map_involves_dims(__isl_keep isl_map *map,
1720 enum isl_dim_type type, unsigned first, unsigned n)
1727 if (first + n > isl_map_dim(map, type))
1728 isl_die(map->ctx, isl_error_invalid,
1729 "index out of bounds", return -1);
1731 for (i = 0; i < map->n; ++i) {
1732 int involves = isl_basic_map_involves_dims(map->p[i],
1734 if (involves < 0 || !involves)
1741 int isl_basic_set_involves_dims(__isl_keep isl_basic_set *bset,
1742 enum isl_dim_type type, unsigned first, unsigned n)
1744 return isl_basic_map_involves_dims(bset, type, first, n);
1747 int isl_set_involves_dims(__isl_keep isl_set *set,
1748 enum isl_dim_type type, unsigned first, unsigned n)
1750 return isl_map_involves_dims(set, type, first, n);
1753 /* Return true if the definition of the given div is unknown or depends
1756 static int div_is_unknown(__isl_keep isl_basic_map *bmap, int div)
1759 unsigned div_offset = isl_basic_map_offset(bmap, isl_dim_div);
1761 if (isl_int_is_zero(bmap->div[div][0]))
1764 for (i = bmap->n_div - 1; i >= 0; --i) {
1765 if (isl_int_is_zero(bmap->div[div][1 + div_offset + i]))
1767 if (div_is_unknown(bmap, i))
1774 /* Remove all divs that are unknown or defined in terms of unknown divs.
1776 __isl_give isl_basic_map *isl_basic_map_remove_unknown_divs(
1777 __isl_take isl_basic_map *bmap)
1784 for (i = bmap->n_div - 1; i >= 0; --i) {
1785 if (!div_is_unknown(bmap, i))
1787 bmap = isl_basic_map_remove_dims(bmap, isl_dim_div, i, 1);
1793 __isl_give isl_map *isl_map_remove_unknown_divs(__isl_take isl_map *map)
1802 map = isl_map_cow(map);
1806 for (i = 0; i < map->n; ++i) {
1807 map->p[i] = isl_basic_map_remove_unknown_divs(map->p[i]);
1817 __isl_give isl_set *isl_set_remove_unknown_divs(__isl_take isl_set *set)
1819 return (isl_set *)isl_map_remove_unknown_divs((isl_map *)set);
1822 __isl_give isl_basic_set *isl_basic_set_remove_dims(
1823 __isl_take isl_basic_set *bset,
1824 enum isl_dim_type type, unsigned first, unsigned n)
1826 return (isl_basic_set *)
1827 isl_basic_map_remove_dims((isl_basic_map *)bset, type, first, n);
1830 struct isl_map *isl_map_remove_dims(struct isl_map *map,
1831 enum isl_dim_type type, unsigned first, unsigned n)
1838 map = isl_map_cow(map);
1841 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
1843 for (i = 0; i < map->n; ++i) {
1844 map->p[i] = isl_basic_map_eliminate_vars(map->p[i],
1845 isl_basic_map_offset(map->p[i], type) - 1 + first, n);
1849 map = isl_map_drop(map, type, first, n);
1856 __isl_give isl_set *isl_set_remove_dims(__isl_take isl_set *bset,
1857 enum isl_dim_type type, unsigned first, unsigned n)
1859 return (isl_set *)isl_map_remove_dims((isl_map *)bset, type, first, n);
1862 /* Project out n inputs starting at first using Fourier-Motzkin */
1863 struct isl_map *isl_map_remove_inputs(struct isl_map *map,
1864 unsigned first, unsigned n)
1866 return isl_map_remove_dims(map, isl_dim_in, first, n);
1869 static void dump_term(struct isl_basic_map *bmap,
1870 isl_int c, int pos, FILE *out)
1873 unsigned in = isl_basic_map_n_in(bmap);
1874 unsigned dim = in + isl_basic_map_n_out(bmap);
1875 unsigned nparam = isl_basic_map_n_param(bmap);
1877 isl_int_print(out, c, 0);
1879 if (!isl_int_is_one(c))
1880 isl_int_print(out, c, 0);
1881 if (pos < 1 + nparam) {
1882 name = isl_dim_get_name(bmap->dim,
1883 isl_dim_param, pos - 1);
1885 fprintf(out, "%s", name);
1887 fprintf(out, "p%d", pos - 1);
1888 } else if (pos < 1 + nparam + in)
1889 fprintf(out, "i%d", pos - 1 - nparam);
1890 else if (pos < 1 + nparam + dim)
1891 fprintf(out, "o%d", pos - 1 - nparam - in);
1893 fprintf(out, "e%d", pos - 1 - nparam - dim);
1897 static void dump_constraint_sign(struct isl_basic_map *bmap, isl_int *c,
1898 int sign, FILE *out)
1902 unsigned len = 1 + isl_basic_map_total_dim(bmap);
1906 for (i = 0, first = 1; i < len; ++i) {
1907 if (isl_int_sgn(c[i]) * sign <= 0)
1910 fprintf(out, " + ");
1912 isl_int_abs(v, c[i]);
1913 dump_term(bmap, v, i, out);
1920 static void dump_constraint(struct isl_basic_map *bmap, isl_int *c,
1921 const char *op, FILE *out, int indent)
1925 fprintf(out, "%*s", indent, "");
1927 dump_constraint_sign(bmap, c, 1, out);
1928 fprintf(out, " %s ", op);
1929 dump_constraint_sign(bmap, c, -1, out);
1933 for (i = bmap->n_div; i < bmap->extra; ++i) {
1934 if (isl_int_is_zero(c[1+isl_dim_total(bmap->dim)+i]))
1936 fprintf(out, "%*s", indent, "");
1937 fprintf(out, "ERROR: unused div coefficient not zero\n");
1942 static void dump_constraints(struct isl_basic_map *bmap,
1943 isl_int **c, unsigned n,
1944 const char *op, FILE *out, int indent)
1948 for (i = 0; i < n; ++i)
1949 dump_constraint(bmap, c[i], op, out, indent);
1952 static void dump_affine(struct isl_basic_map *bmap, isl_int *exp, FILE *out)
1956 unsigned total = isl_basic_map_total_dim(bmap);
1958 for (j = 0; j < 1 + total; ++j) {
1959 if (isl_int_is_zero(exp[j]))
1961 if (!first && isl_int_is_pos(exp[j]))
1963 dump_term(bmap, exp[j], j, out);
1968 static void dump(struct isl_basic_map *bmap, FILE *out, int indent)
1972 dump_constraints(bmap, bmap->eq, bmap->n_eq, "=", out, indent);
1973 dump_constraints(bmap, bmap->ineq, bmap->n_ineq, ">=", out, indent);
1975 for (i = 0; i < bmap->n_div; ++i) {
1976 fprintf(out, "%*s", indent, "");
1977 fprintf(out, "e%d = [(", i);
1978 dump_affine(bmap, bmap->div[i]+1, out);
1980 isl_int_print(out, bmap->div[i][0], 0);
1981 fprintf(out, "]\n");
1985 void isl_basic_set_print_internal(struct isl_basic_set *bset,
1986 FILE *out, int indent)
1989 fprintf(out, "null basic set\n");
1993 fprintf(out, "%*s", indent, "");
1994 fprintf(out, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n",
1995 bset->ref, bset->dim->nparam, bset->dim->n_out,
1996 bset->extra, bset->flags);
1997 dump((struct isl_basic_map *)bset, out, indent);
2000 void isl_basic_map_print_internal(struct isl_basic_map *bmap,
2001 FILE *out, int indent)
2004 fprintf(out, "null basic map\n");
2008 fprintf(out, "%*s", indent, "");
2009 fprintf(out, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, "
2010 "flags: %x, n_name: %d\n",
2012 bmap->dim->nparam, bmap->dim->n_in, bmap->dim->n_out,
2013 bmap->extra, bmap->flags, bmap->dim->n_id);
2014 dump(bmap, out, indent);
2017 int isl_inequality_negate(struct isl_basic_map *bmap, unsigned pos)
2022 total = isl_basic_map_total_dim(bmap);
2023 isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
2024 isl_seq_neg(bmap->ineq[pos], bmap->ineq[pos], 1 + total);
2025 isl_int_sub_ui(bmap->ineq[pos][0], bmap->ineq[pos][0], 1);
2026 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
2030 struct isl_set *isl_set_alloc_dim(struct isl_dim *dim, int n, unsigned flags)
2032 struct isl_set *set;
2036 isl_assert(dim->ctx, dim->n_in == 0, goto error);
2037 isl_assert(dim->ctx, n >= 0, goto error);
2038 set = isl_alloc(dim->ctx, struct isl_set,
2039 sizeof(struct isl_set) +
2040 (n - 1) * sizeof(struct isl_basic_set *));
2044 set->ctx = dim->ctx;
2045 isl_ctx_ref(set->ctx);
2057 struct isl_set *isl_set_alloc(struct isl_ctx *ctx,
2058 unsigned nparam, unsigned dim, int n, unsigned flags)
2060 struct isl_set *set;
2061 struct isl_dim *dims;
2063 dims = isl_dim_alloc(ctx, nparam, 0, dim);
2067 set = isl_set_alloc_dim(dims, n, flags);
2071 /* Make sure "map" has room for at least "n" more basic maps.
2073 struct isl_map *isl_map_grow(struct isl_map *map, int n)
2076 struct isl_map *grown = NULL;
2080 isl_assert(map->ctx, n >= 0, goto error);
2081 if (map->n + n <= map->size)
2083 grown = isl_map_alloc_dim(isl_map_get_dim(map), map->n + n, map->flags);
2086 for (i = 0; i < map->n; ++i) {
2087 grown->p[i] = isl_basic_map_copy(map->p[i]);
2095 isl_map_free(grown);
2100 /* Make sure "set" has room for at least "n" more basic sets.
2102 struct isl_set *isl_set_grow(struct isl_set *set, int n)
2104 return (struct isl_set *)isl_map_grow((struct isl_map *)set, n);
2107 struct isl_set *isl_set_dup(struct isl_set *set)
2110 struct isl_set *dup;
2115 dup = isl_set_alloc_dim(isl_dim_copy(set->dim), set->n, set->flags);
2118 for (i = 0; i < set->n; ++i)
2119 dup = isl_set_add_basic_set(dup, isl_basic_set_copy(set->p[i]));
2123 struct isl_set *isl_set_from_basic_set(struct isl_basic_set *bset)
2125 return isl_map_from_basic_map(bset);
2128 struct isl_map *isl_map_from_basic_map(struct isl_basic_map *bmap)
2130 struct isl_map *map;
2135 map = isl_map_alloc_dim(isl_dim_copy(bmap->dim), 1, ISL_MAP_DISJOINT);
2136 return isl_map_add_basic_map(map, bmap);
2139 __isl_give isl_set *isl_set_add_basic_set(__isl_take isl_set *set,
2140 __isl_take isl_basic_set *bset)
2142 return (struct isl_set *)isl_map_add_basic_map((struct isl_map *)set,
2143 (struct isl_basic_map *)bset);
2146 void isl_set_free(struct isl_set *set)
2156 isl_ctx_deref(set->ctx);
2157 for (i = 0; i < set->n; ++i)
2158 isl_basic_set_free(set->p[i]);
2159 isl_dim_free(set->dim);
2163 void isl_set_print_internal(struct isl_set *set, FILE *out, int indent)
2168 fprintf(out, "null set\n");
2172 fprintf(out, "%*s", indent, "");
2173 fprintf(out, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
2174 set->ref, set->n, set->dim->nparam, set->dim->n_out,
2176 for (i = 0; i < set->n; ++i) {
2177 fprintf(out, "%*s", indent, "");
2178 fprintf(out, "basic set %d:\n", i);
2179 isl_basic_set_print_internal(set->p[i], out, indent+4);
2183 void isl_map_print_internal(struct isl_map *map, FILE *out, int indent)
2188 fprintf(out, "null map\n");
2192 fprintf(out, "%*s", indent, "");
2193 fprintf(out, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, "
2194 "flags: %x, n_name: %d\n",
2195 map->ref, map->n, map->dim->nparam, map->dim->n_in,
2196 map->dim->n_out, map->flags, map->dim->n_id);
2197 for (i = 0; i < map->n; ++i) {
2198 fprintf(out, "%*s", indent, "");
2199 fprintf(out, "basic map %d:\n", i);
2200 isl_basic_map_print_internal(map->p[i], out, indent+4);
2204 struct isl_basic_map *isl_basic_map_intersect_domain(
2205 struct isl_basic_map *bmap, struct isl_basic_set *bset)
2207 struct isl_basic_map *bmap_domain;
2212 isl_assert(bset->ctx, isl_dim_match(bmap->dim, isl_dim_param,
2213 bset->dim, isl_dim_param), goto error);
2215 if (isl_dim_size(bset->dim, isl_dim_set) != 0)
2216 isl_assert(bset->ctx,
2217 isl_basic_map_compatible_domain(bmap, bset), goto error);
2219 bmap = isl_basic_map_cow(bmap);
2222 bmap = isl_basic_map_extend_dim(bmap, isl_dim_copy(bmap->dim),
2223 bset->n_div, bset->n_eq, bset->n_ineq);
2224 bmap_domain = isl_basic_map_from_domain(bset);
2225 bmap = add_constraints(bmap, bmap_domain, 0, 0);
2227 bmap = isl_basic_map_simplify(bmap);
2228 return isl_basic_map_finalize(bmap);
2230 isl_basic_map_free(bmap);
2231 isl_basic_set_free(bset);
2235 struct isl_basic_map *isl_basic_map_intersect_range(
2236 struct isl_basic_map *bmap, struct isl_basic_set *bset)
2238 struct isl_basic_map *bmap_range;
2243 isl_assert(bset->ctx, isl_dim_match(bmap->dim, isl_dim_param,
2244 bset->dim, isl_dim_param), goto error);
2246 if (isl_dim_size(bset->dim, isl_dim_set) != 0)
2247 isl_assert(bset->ctx,
2248 isl_basic_map_compatible_range(bmap, bset), goto error);
2250 if (isl_basic_set_is_universe(bset)) {
2251 isl_basic_set_free(bset);
2255 bmap = isl_basic_map_cow(bmap);
2258 bmap = isl_basic_map_extend_dim(bmap, isl_dim_copy(bmap->dim),
2259 bset->n_div, bset->n_eq, bset->n_ineq);
2260 bmap_range = isl_basic_map_from_basic_set(bset, isl_dim_copy(bset->dim));
2261 bmap = add_constraints(bmap, bmap_range, 0, 0);
2263 bmap = isl_basic_map_simplify(bmap);
2264 return isl_basic_map_finalize(bmap);
2266 isl_basic_map_free(bmap);
2267 isl_basic_set_free(bset);
2271 int isl_basic_map_contains(struct isl_basic_map *bmap, struct isl_vec *vec)
2277 total = 1 + isl_basic_map_total_dim(bmap);
2278 if (total != vec->size)
2283 for (i = 0; i < bmap->n_eq; ++i) {
2284 isl_seq_inner_product(vec->el, bmap->eq[i], total, &s);
2285 if (!isl_int_is_zero(s)) {
2291 for (i = 0; i < bmap->n_ineq; ++i) {
2292 isl_seq_inner_product(vec->el, bmap->ineq[i], total, &s);
2293 if (isl_int_is_neg(s)) {
2304 int isl_basic_set_contains(struct isl_basic_set *bset, struct isl_vec *vec)
2306 return isl_basic_map_contains((struct isl_basic_map *)bset, vec);
2309 struct isl_basic_map *isl_basic_map_intersect(
2310 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2312 struct isl_vec *sample = NULL;
2314 if (!bmap1 || !bmap2)
2317 isl_assert(bmap1->ctx, isl_dim_match(bmap1->dim, isl_dim_param,
2318 bmap2->dim, isl_dim_param), goto error);
2319 if (isl_dim_total(bmap1->dim) ==
2320 isl_dim_size(bmap1->dim, isl_dim_param) &&
2321 isl_dim_total(bmap2->dim) !=
2322 isl_dim_size(bmap2->dim, isl_dim_param))
2323 return isl_basic_map_intersect(bmap2, bmap1);
2325 if (isl_dim_total(bmap2->dim) !=
2326 isl_dim_size(bmap2->dim, isl_dim_param))
2327 isl_assert(bmap1->ctx,
2328 isl_dim_equal(bmap1->dim, bmap2->dim), goto error);
2330 if (bmap1->sample &&
2331 isl_basic_map_contains(bmap1, bmap1->sample) > 0 &&
2332 isl_basic_map_contains(bmap2, bmap1->sample) > 0)
2333 sample = isl_vec_copy(bmap1->sample);
2334 else if (bmap2->sample &&
2335 isl_basic_map_contains(bmap1, bmap2->sample) > 0 &&
2336 isl_basic_map_contains(bmap2, bmap2->sample) > 0)
2337 sample = isl_vec_copy(bmap2->sample);
2339 bmap1 = isl_basic_map_cow(bmap1);
2342 bmap1 = isl_basic_map_extend_dim(bmap1, isl_dim_copy(bmap1->dim),
2343 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
2344 bmap1 = add_constraints(bmap1, bmap2, 0, 0);
2347 isl_vec_free(sample);
2349 isl_vec_free(bmap1->sample);
2350 bmap1->sample = sample;
2353 bmap1 = isl_basic_map_simplify(bmap1);
2354 return isl_basic_map_finalize(bmap1);
2357 isl_vec_free(sample);
2358 isl_basic_map_free(bmap1);
2359 isl_basic_map_free(bmap2);
2363 struct isl_basic_set *isl_basic_set_intersect(
2364 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
2366 return (struct isl_basic_set *)
2367 isl_basic_map_intersect(
2368 (struct isl_basic_map *)bset1,
2369 (struct isl_basic_map *)bset2);
2372 /* Special case of isl_map_intersect, where both map1 and map2
2373 * are convex, without any divs and such that either map1 or map2
2374 * contains a single constraint. This constraint is then simply
2375 * added to the other map.
2377 static __isl_give isl_map *map_intersect_add_constraint(
2378 __isl_take isl_map *map1, __isl_take isl_map *map2)
2380 isl_assert(map1->ctx, map1->n == 1, goto error);
2381 isl_assert(map2->ctx, map1->n == 1, goto error);
2382 isl_assert(map1->ctx, map1->p[0]->n_div == 0, goto error);
2383 isl_assert(map2->ctx, map1->p[0]->n_div == 0, goto error);
2385 if (map2->p[0]->n_eq + map2->p[0]->n_ineq != 1)
2386 return isl_map_intersect(map2, map1);
2388 isl_assert(map2->ctx,
2389 map2->p[0]->n_eq + map2->p[0]->n_ineq == 1, goto error);
2391 map1 = isl_map_cow(map1);
2394 if (isl_map_plain_is_empty(map1)) {
2398 map1->p[0] = isl_basic_map_cow(map1->p[0]);
2399 if (map2->p[0]->n_eq == 1)
2400 map1->p[0] = isl_basic_map_add_eq(map1->p[0], map2->p[0]->eq[0]);
2402 map1->p[0] = isl_basic_map_add_ineq(map1->p[0],
2403 map2->p[0]->ineq[0]);
2405 map1->p[0] = isl_basic_map_simplify(map1->p[0]);
2406 map1->p[0] = isl_basic_map_finalize(map1->p[0]);
2410 if (isl_basic_map_plain_is_empty(map1->p[0])) {
2411 isl_basic_map_free(map1->p[0]);
2424 static __isl_give isl_map *map_intersect(__isl_take isl_map *map1,
2425 __isl_take isl_map *map2)
2428 struct isl_map *result;
2434 if (isl_map_plain_is_empty(map1) &&
2435 isl_dim_equal(map1->dim, map2->dim)) {
2439 if (isl_map_plain_is_empty(map2) &&
2440 isl_dim_equal(map1->dim, map2->dim)) {
2445 if (map1->n == 1 && map2->n == 1 &&
2446 map1->p[0]->n_div == 0 && map2->p[0]->n_div == 0 &&
2447 isl_dim_equal(map1->dim, map2->dim) &&
2448 (map1->p[0]->n_eq + map1->p[0]->n_ineq == 1 ||
2449 map2->p[0]->n_eq + map2->p[0]->n_ineq == 1))
2450 return map_intersect_add_constraint(map1, map2);
2451 if (isl_dim_total(map1->dim) ==
2452 isl_dim_size(map1->dim, isl_dim_param) &&
2453 isl_dim_total(map2->dim) != isl_dim_size(map2->dim, isl_dim_param))
2454 return isl_map_intersect(map2, map1);
2456 if (isl_dim_total(map2->dim) != isl_dim_size(map2->dim, isl_dim_param))
2457 isl_assert(map1->ctx,
2458 isl_dim_equal(map1->dim, map2->dim), goto error);
2460 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
2461 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
2462 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
2464 result = isl_map_alloc_dim(isl_dim_copy(map1->dim),
2465 map1->n * map2->n, flags);
2468 for (i = 0; i < map1->n; ++i)
2469 for (j = 0; j < map2->n; ++j) {
2470 struct isl_basic_map *part;
2471 part = isl_basic_map_intersect(
2472 isl_basic_map_copy(map1->p[i]),
2473 isl_basic_map_copy(map2->p[j]));
2474 if (isl_basic_map_is_empty(part))
2475 isl_basic_map_free(part);
2477 result = isl_map_add_basic_map(result, part);
2490 __isl_give isl_map *isl_map_intersect(__isl_take isl_map *map1,
2491 __isl_take isl_map *map2)
2493 return isl_map_align_params_map_map_and(map1, map2, &map_intersect);
2496 struct isl_set *isl_set_intersect(struct isl_set *set1, struct isl_set *set2)
2498 return (struct isl_set *)
2499 isl_map_intersect((struct isl_map *)set1,
2500 (struct isl_map *)set2);
2503 /* The current implementation of isl_map_intersect accepts intersections
2504 * with parameter domains, so we can just call that for now.
2506 static __isl_give isl_map *map_intersect_params(__isl_take isl_map *map,
2507 __isl_take isl_set *params)
2509 return isl_map_intersect(map, params);
2512 __isl_give isl_map *isl_map_intersect_params(__isl_take isl_map *map1,
2513 __isl_take isl_map *map2)
2515 return isl_map_align_params_map_map_and(map1, map2, &map_intersect_params);
2518 __isl_give isl_set *isl_set_intersect_params(__isl_take isl_set *set,
2519 __isl_take isl_set *params)
2521 return isl_map_intersect_params(set, params);
2524 struct isl_basic_map *isl_basic_map_reverse(struct isl_basic_map *bmap)
2526 struct isl_dim *dim;
2527 struct isl_basic_set *bset;
2532 bmap = isl_basic_map_cow(bmap);
2535 dim = isl_dim_reverse(isl_dim_copy(bmap->dim));
2536 in = isl_basic_map_n_in(bmap);
2537 bset = isl_basic_set_from_basic_map(bmap);
2538 bset = isl_basic_set_swap_vars(bset, in);
2539 return isl_basic_map_from_basic_set(bset, dim);
2542 __isl_give isl_basic_map *isl_basic_map_insert(__isl_take isl_basic_map *bmap,
2543 enum isl_dim_type type, unsigned pos, unsigned n)
2545 struct isl_dim *res_dim;
2546 struct isl_basic_map *res;
2547 struct isl_dim_map *dim_map;
2548 unsigned total, off;
2549 enum isl_dim_type t;
2557 res_dim = isl_dim_insert(isl_basic_map_get_dim(bmap), type, pos, n);
2559 total = isl_basic_map_total_dim(bmap) + n;
2560 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2562 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
2564 isl_dim_map_dim(dim_map, bmap->dim, t, off);
2566 unsigned size = isl_basic_map_dim(bmap, t);
2567 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2569 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2570 pos, size - pos, off + pos + n);
2572 off += isl_dim_size(res_dim, t);
2574 isl_dim_map_div(dim_map, bmap, off);
2576 res = isl_basic_map_alloc_dim(res_dim,
2577 bmap->n_div, bmap->n_eq, bmap->n_ineq);
2578 if (isl_basic_map_is_rational(bmap))
2579 res = isl_basic_map_set_rational(res);
2580 res = isl_basic_map_add_constraints_dim_map(res, bmap, dim_map);
2581 return isl_basic_map_finalize(res);
2584 __isl_give isl_basic_map *isl_basic_map_add(__isl_take isl_basic_map *bmap,
2585 enum isl_dim_type type, unsigned n)
2589 return isl_basic_map_insert(bmap, type,
2590 isl_basic_map_dim(bmap, type), n);
2593 __isl_give isl_basic_set *isl_basic_set_add(__isl_take isl_basic_set *bset,
2594 enum isl_dim_type type, unsigned n)
2598 isl_assert(bset->ctx, type != isl_dim_in, goto error);
2599 return (isl_basic_set *)isl_basic_map_add((isl_basic_map *)bset, type, n);
2601 isl_basic_set_free(bset);
2605 __isl_give isl_map *isl_map_insert_dims(__isl_take isl_map *map,
2606 enum isl_dim_type type, unsigned pos, unsigned n)
2613 map = isl_map_cow(map);
2617 map->dim = isl_dim_insert(map->dim, type, pos, n);
2621 for (i = 0; i < map->n; ++i) {
2622 map->p[i] = isl_basic_map_insert(map->p[i], type, pos, n);
2633 __isl_give isl_set *isl_set_insert_dims(__isl_take isl_set *set,
2634 enum isl_dim_type type, unsigned pos, unsigned n)
2636 return isl_map_insert_dims(set, type, pos, n);
2639 __isl_give isl_map *isl_map_add_dims(__isl_take isl_map *map,
2640 enum isl_dim_type type, unsigned n)
2644 return isl_map_insert_dims(map, type, isl_map_dim(map, type), n);
2647 __isl_give isl_set *isl_set_add_dims(__isl_take isl_set *set,
2648 enum isl_dim_type type, unsigned n)
2652 isl_assert(set->ctx, type != isl_dim_in, goto error);
2653 return (isl_set *)isl_map_add_dims((isl_map *)set, type, n);
2659 __isl_give isl_basic_map *isl_basic_map_move_dims(
2660 __isl_take isl_basic_map *bmap,
2661 enum isl_dim_type dst_type, unsigned dst_pos,
2662 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2664 struct isl_dim_map *dim_map;
2665 struct isl_basic_map *res;
2666 enum isl_dim_type t;
2667 unsigned total, off;
2674 isl_assert(bmap->ctx, src_pos + n <= isl_basic_map_dim(bmap, src_type),
2677 if (dst_type == src_type && dst_pos == src_pos)
2680 isl_assert(bmap->ctx, dst_type != src_type, goto error);
2682 if (pos(bmap->dim, dst_type) + dst_pos ==
2683 pos(bmap->dim, src_type) + src_pos +
2684 ((src_type < dst_type) ? n : 0)) {
2685 bmap = isl_basic_map_cow(bmap);
2689 bmap->dim = isl_dim_move(bmap->dim, dst_type, dst_pos,
2690 src_type, src_pos, n);
2694 bmap = isl_basic_map_finalize(bmap);
2699 total = isl_basic_map_total_dim(bmap);
2700 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2703 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
2704 unsigned size = isl_dim_size(bmap->dim, t);
2705 if (t == dst_type) {
2706 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2709 isl_dim_map_dim_range(dim_map, bmap->dim, src_type,
2712 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2713 dst_pos, size - dst_pos, off);
2714 off += size - dst_pos;
2715 } else if (t == src_type) {
2716 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2719 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2720 src_pos + n, size - src_pos - n, off);
2721 off += size - src_pos - n;
2723 isl_dim_map_dim(dim_map, bmap->dim, t, off);
2727 isl_dim_map_div(dim_map, bmap, off);
2729 res = isl_basic_map_alloc_dim(isl_basic_map_get_dim(bmap),
2730 bmap->n_div, bmap->n_eq, bmap->n_ineq);
2731 bmap = isl_basic_map_add_constraints_dim_map(res, bmap, dim_map);
2733 bmap->dim = isl_dim_move(bmap->dim, dst_type, dst_pos,
2734 src_type, src_pos, n);
2738 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
2739 bmap = isl_basic_map_gauss(bmap, NULL);
2740 bmap = isl_basic_map_finalize(bmap);
2744 isl_basic_map_free(bmap);
2748 __isl_give isl_basic_set *isl_basic_set_move_dims(__isl_take isl_basic_set *bset,
2749 enum isl_dim_type dst_type, unsigned dst_pos,
2750 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2752 return (isl_basic_set *)isl_basic_map_move_dims(
2753 (isl_basic_map *)bset, dst_type, dst_pos, src_type, src_pos, n);
2756 __isl_give isl_set *isl_set_move_dims(__isl_take isl_set *set,
2757 enum isl_dim_type dst_type, unsigned dst_pos,
2758 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2762 isl_assert(set->ctx, dst_type != isl_dim_in, goto error);
2763 return (isl_set *)isl_map_move_dims((isl_map *)set, dst_type, dst_pos,
2764 src_type, src_pos, n);
2770 __isl_give isl_map *isl_map_move_dims(__isl_take isl_map *map,
2771 enum isl_dim_type dst_type, unsigned dst_pos,
2772 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2781 isl_assert(map->ctx, src_pos + n <= isl_map_dim(map, src_type),
2784 if (dst_type == src_type && dst_pos == src_pos)
2787 isl_assert(map->ctx, dst_type != src_type, goto error);
2789 map = isl_map_cow(map);
2793 map->dim = isl_dim_move(map->dim, dst_type, dst_pos, src_type, src_pos, n);
2797 for (i = 0; i < map->n; ++i) {
2798 map->p[i] = isl_basic_map_move_dims(map->p[i],
2800 src_type, src_pos, n);
2811 /* Move the specified dimensions to the last columns right before
2812 * the divs. Don't change the dimension specification of bmap.
2813 * That's the responsibility of the caller.
2815 static __isl_give isl_basic_map *move_last(__isl_take isl_basic_map *bmap,
2816 enum isl_dim_type type, unsigned first, unsigned n)
2818 struct isl_dim_map *dim_map;
2819 struct isl_basic_map *res;
2820 enum isl_dim_type t;
2821 unsigned total, off;
2825 if (pos(bmap->dim, type) + first + n == 1 + isl_dim_total(bmap->dim))
2828 total = isl_basic_map_total_dim(bmap);
2829 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2832 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
2833 unsigned size = isl_dim_size(bmap->dim, t);
2835 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2838 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2839 first, n, total - bmap->n_div - n);
2840 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2841 first + n, size - (first + n), off);
2842 off += size - (first + n);
2844 isl_dim_map_dim(dim_map, bmap->dim, t, off);
2848 isl_dim_map_div(dim_map, bmap, off + n);
2850 res = isl_basic_map_alloc_dim(isl_basic_map_get_dim(bmap),
2851 bmap->n_div, bmap->n_eq, bmap->n_ineq);
2852 res = isl_basic_map_add_constraints_dim_map(res, bmap, dim_map);
2856 /* Turn the n dimensions of type type, starting at first
2857 * into existentially quantified variables.
2859 __isl_give isl_basic_map *isl_basic_map_project_out(
2860 __isl_take isl_basic_map *bmap,
2861 enum isl_dim_type type, unsigned first, unsigned n)
2874 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL))
2875 return isl_basic_map_remove_dims(bmap, type, first, n);
2877 isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
2880 bmap = move_last(bmap, type, first, n);
2881 bmap = isl_basic_map_cow(bmap);
2885 row_size = 1 + isl_dim_total(bmap->dim) + bmap->extra;
2886 old = bmap->block2.data;
2887 bmap->block2 = isl_blk_extend(bmap->ctx, bmap->block2,
2888 (bmap->extra + n) * (1 + row_size));
2889 if (!bmap->block2.data)
2891 new_div = isl_alloc_array(bmap->ctx, isl_int *, bmap->extra + n);
2894 for (i = 0; i < n; ++i) {
2895 new_div[i] = bmap->block2.data +
2896 (bmap->extra + i) * (1 + row_size);
2897 isl_seq_clr(new_div[i], 1 + row_size);
2899 for (i = 0; i < bmap->extra; ++i)
2900 new_div[n + i] = bmap->block2.data + (bmap->div[i] - old);
2902 bmap->div = new_div;
2906 bmap->dim = isl_dim_drop(bmap->dim, type, first, n);
2909 bmap = isl_basic_map_simplify(bmap);
2910 bmap = isl_basic_map_drop_redundant_divs(bmap);
2911 return isl_basic_map_finalize(bmap);
2913 isl_basic_map_free(bmap);
2917 /* Turn the n dimensions of type type, starting at first
2918 * into existentially quantified variables.
2920 struct isl_basic_set *isl_basic_set_project_out(struct isl_basic_set *bset,
2921 enum isl_dim_type type, unsigned first, unsigned n)
2923 return (isl_basic_set *)isl_basic_map_project_out(
2924 (isl_basic_map *)bset, type, first, n);
2927 /* Turn the n dimensions of type type, starting at first
2928 * into existentially quantified variables.
2930 __isl_give isl_map *isl_map_project_out(__isl_take isl_map *map,
2931 enum isl_dim_type type, unsigned first, unsigned n)
2941 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
2943 map = isl_map_cow(map);
2947 map->dim = isl_dim_drop(map->dim, type, first, n);
2951 for (i = 0; i < map->n; ++i) {
2952 map->p[i] = isl_basic_map_project_out(map->p[i], type, first, n);
2963 /* Turn the n dimensions of type type, starting at first
2964 * into existentially quantified variables.
2966 __isl_give isl_set *isl_set_project_out(__isl_take isl_set *set,
2967 enum isl_dim_type type, unsigned first, unsigned n)
2969 return (isl_set *)isl_map_project_out((isl_map *)set, type, first, n);
2972 static struct isl_basic_map *add_divs(struct isl_basic_map *bmap, unsigned n)
2976 for (i = 0; i < n; ++i) {
2977 j = isl_basic_map_alloc_div(bmap);
2980 isl_seq_clr(bmap->div[j], 1+1+isl_basic_map_total_dim(bmap));
2984 isl_basic_map_free(bmap);
2988 struct isl_basic_map *isl_basic_map_apply_range(
2989 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2991 struct isl_dim *dim_result = NULL;
2992 struct isl_basic_map *bmap;
2993 unsigned n_in, n_out, n, nparam, total, pos;
2994 struct isl_dim_map *dim_map1, *dim_map2;
2996 if (!bmap1 || !bmap2)
2999 dim_result = isl_dim_join(isl_dim_copy(bmap1->dim),
3000 isl_dim_copy(bmap2->dim));
3002 n_in = isl_basic_map_n_in(bmap1);
3003 n_out = isl_basic_map_n_out(bmap2);
3004 n = isl_basic_map_n_out(bmap1);
3005 nparam = isl_basic_map_n_param(bmap1);
3007 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + n;
3008 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
3009 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
3010 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
3011 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
3012 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
3013 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_in);
3014 isl_dim_map_div(dim_map1, bmap1, pos += n_out);
3015 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
3016 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
3017 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
3019 bmap = isl_basic_map_alloc_dim(dim_result,
3020 bmap1->n_div + bmap2->n_div + n,
3021 bmap1->n_eq + bmap2->n_eq,
3022 bmap1->n_ineq + bmap2->n_ineq);
3023 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap1, dim_map1);
3024 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap2, dim_map2);
3025 bmap = add_divs(bmap, n);
3026 bmap = isl_basic_map_simplify(bmap);
3027 bmap = isl_basic_map_drop_redundant_divs(bmap);
3028 return isl_basic_map_finalize(bmap);
3030 isl_basic_map_free(bmap1);
3031 isl_basic_map_free(bmap2);
3035 struct isl_basic_set *isl_basic_set_apply(
3036 struct isl_basic_set *bset, struct isl_basic_map *bmap)
3041 isl_assert(bset->ctx, isl_basic_map_compatible_domain(bmap, bset),
3044 return (struct isl_basic_set *)
3045 isl_basic_map_apply_range((struct isl_basic_map *)bset, bmap);
3047 isl_basic_set_free(bset);
3048 isl_basic_map_free(bmap);
3052 struct isl_basic_map *isl_basic_map_apply_domain(
3053 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3055 if (!bmap1 || !bmap2)
3058 isl_assert(bmap1->ctx,
3059 isl_basic_map_n_in(bmap1) == isl_basic_map_n_in(bmap2), goto error);
3060 isl_assert(bmap1->ctx,
3061 isl_basic_map_n_param(bmap1) == isl_basic_map_n_param(bmap2),
3064 bmap1 = isl_basic_map_reverse(bmap1);
3065 bmap1 = isl_basic_map_apply_range(bmap1, bmap2);
3066 return isl_basic_map_reverse(bmap1);
3068 isl_basic_map_free(bmap1);
3069 isl_basic_map_free(bmap2);
3073 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
3074 * A \cap B -> f(A) + f(B)
3076 struct isl_basic_map *isl_basic_map_sum(
3077 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3079 unsigned n_in, n_out, nparam, total, pos;
3080 struct isl_basic_map *bmap = NULL;
3081 struct isl_dim_map *dim_map1, *dim_map2;
3084 if (!bmap1 || !bmap2)
3087 isl_assert(bmap1->ctx, isl_dim_equal(bmap1->dim, bmap2->dim),
3090 nparam = isl_basic_map_n_param(bmap1);
3091 n_in = isl_basic_map_n_in(bmap1);
3092 n_out = isl_basic_map_n_out(bmap1);
3094 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + 2 * n_out;
3095 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
3096 dim_map2 = isl_dim_map_alloc(bmap2->ctx, total);
3097 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
3098 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos);
3099 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
3100 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
3101 isl_dim_map_div(dim_map1, bmap1, pos += n_in + n_out);
3102 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
3103 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
3104 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_out);
3106 bmap = isl_basic_map_alloc_dim(isl_dim_copy(bmap1->dim),
3107 bmap1->n_div + bmap2->n_div + 2 * n_out,
3108 bmap1->n_eq + bmap2->n_eq + n_out,
3109 bmap1->n_ineq + bmap2->n_ineq);
3110 for (i = 0; i < n_out; ++i) {
3111 int j = isl_basic_map_alloc_equality(bmap);
3114 isl_seq_clr(bmap->eq[j], 1+total);
3115 isl_int_set_si(bmap->eq[j][1+nparam+n_in+i], -1);
3116 isl_int_set_si(bmap->eq[j][1+pos+i], 1);
3117 isl_int_set_si(bmap->eq[j][1+pos-n_out+i], 1);
3119 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap1, dim_map1);
3120 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap2, dim_map2);
3121 bmap = add_divs(bmap, 2 * n_out);
3123 bmap = isl_basic_map_simplify(bmap);
3124 return isl_basic_map_finalize(bmap);
3126 isl_basic_map_free(bmap);
3127 isl_basic_map_free(bmap1);
3128 isl_basic_map_free(bmap2);
3132 /* Given two maps A -> f(A) and B -> g(B), construct a map
3133 * A \cap B -> f(A) + f(B)
3135 struct isl_map *isl_map_sum(struct isl_map *map1, struct isl_map *map2)
3137 struct isl_map *result;
3143 isl_assert(map1->ctx, isl_dim_equal(map1->dim, map2->dim), goto error);
3145 result = isl_map_alloc_dim(isl_dim_copy(map1->dim),
3146 map1->n * map2->n, 0);
3149 for (i = 0; i < map1->n; ++i)
3150 for (j = 0; j < map2->n; ++j) {
3151 struct isl_basic_map *part;
3152 part = isl_basic_map_sum(
3153 isl_basic_map_copy(map1->p[i]),
3154 isl_basic_map_copy(map2->p[j]));
3155 if (isl_basic_map_is_empty(part))
3156 isl_basic_map_free(part);
3158 result = isl_map_add_basic_map(result, part);
3171 __isl_give isl_set *isl_set_sum(__isl_take isl_set *set1,
3172 __isl_take isl_set *set2)
3174 return (isl_set *)isl_map_sum((isl_map *)set1, (isl_map *)set2);
3177 /* Given a basic map A -> f(A), construct A -> -f(A).
3179 struct isl_basic_map *isl_basic_map_neg(struct isl_basic_map *bmap)
3184 bmap = isl_basic_map_cow(bmap);
3188 n = isl_basic_map_dim(bmap, isl_dim_out);
3189 off = isl_basic_map_offset(bmap, isl_dim_out);
3190 for (i = 0; i < bmap->n_eq; ++i)
3191 for (j = 0; j < n; ++j)
3192 isl_int_neg(bmap->eq[i][off+j], bmap->eq[i][off+j]);
3193 for (i = 0; i < bmap->n_ineq; ++i)
3194 for (j = 0; j < n; ++j)
3195 isl_int_neg(bmap->ineq[i][off+j], bmap->ineq[i][off+j]);
3196 for (i = 0; i < bmap->n_div; ++i)
3197 for (j = 0; j < n; ++j)
3198 isl_int_neg(bmap->div[i][1+off+j], bmap->div[i][1+off+j]);
3199 return isl_basic_map_finalize(bmap);
3202 __isl_give isl_basic_set *isl_basic_set_neg(__isl_take isl_basic_set *bset)
3204 return isl_basic_map_neg(bset);
3207 /* Given a map A -> f(A), construct A -> -f(A).
3209 struct isl_map *isl_map_neg(struct isl_map *map)
3213 map = isl_map_cow(map);
3217 for (i = 0; i < map->n; ++i) {
3218 map->p[i] = isl_basic_map_neg(map->p[i]);
3229 __isl_give isl_set *isl_set_neg(__isl_take isl_set *set)
3231 return (isl_set *)isl_map_neg((isl_map *)set);
3234 /* Given a basic map A -> f(A) and an integer d, construct a basic map
3235 * A -> floor(f(A)/d).
3237 struct isl_basic_map *isl_basic_map_floordiv(struct isl_basic_map *bmap,
3240 unsigned n_in, n_out, nparam, total, pos;
3241 struct isl_basic_map *result = NULL;
3242 struct isl_dim_map *dim_map;
3248 nparam = isl_basic_map_n_param(bmap);
3249 n_in = isl_basic_map_n_in(bmap);
3250 n_out = isl_basic_map_n_out(bmap);
3252 total = nparam + n_in + n_out + bmap->n_div + n_out;
3253 dim_map = isl_dim_map_alloc(bmap->ctx, total);
3254 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_param, pos = 0);
3255 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_in, pos += nparam);
3256 isl_dim_map_div(dim_map, bmap, pos += n_in + n_out);
3257 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_out, pos += bmap->n_div);
3259 result = isl_basic_map_alloc_dim(isl_dim_copy(bmap->dim),
3260 bmap->n_div + n_out,
3261 bmap->n_eq, bmap->n_ineq + 2 * n_out);
3262 result = isl_basic_map_add_constraints_dim_map(result, bmap, dim_map);
3263 result = add_divs(result, n_out);
3264 for (i = 0; i < n_out; ++i) {
3266 j = isl_basic_map_alloc_inequality(result);
3269 isl_seq_clr(result->ineq[j], 1+total);
3270 isl_int_neg(result->ineq[j][1+nparam+n_in+i], d);
3271 isl_int_set_si(result->ineq[j][1+pos+i], 1);
3272 j = isl_basic_map_alloc_inequality(result);
3275 isl_seq_clr(result->ineq[j], 1+total);
3276 isl_int_set(result->ineq[j][1+nparam+n_in+i], d);
3277 isl_int_set_si(result->ineq[j][1+pos+i], -1);
3278 isl_int_sub_ui(result->ineq[j][0], d, 1);
3281 result = isl_basic_map_simplify(result);
3282 return isl_basic_map_finalize(result);
3284 isl_basic_map_free(result);
3288 /* Given a map A -> f(A) and an integer d, construct a map
3289 * A -> floor(f(A)/d).
3291 struct isl_map *isl_map_floordiv(struct isl_map *map, isl_int d)
3295 map = isl_map_cow(map);
3299 ISL_F_CLR(map, ISL_MAP_DISJOINT);
3300 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3301 for (i = 0; i < map->n; ++i) {
3302 map->p[i] = isl_basic_map_floordiv(map->p[i], d);
3313 static struct isl_basic_map *var_equal(struct isl_basic_map *bmap, unsigned pos)
3319 i = isl_basic_map_alloc_equality(bmap);
3322 nparam = isl_basic_map_n_param(bmap);
3323 n_in = isl_basic_map_n_in(bmap);
3324 isl_seq_clr(bmap->eq[i], 1 + isl_basic_map_total_dim(bmap));
3325 isl_int_set_si(bmap->eq[i][1+nparam+pos], -1);
3326 isl_int_set_si(bmap->eq[i][1+nparam+n_in+pos], 1);
3327 return isl_basic_map_finalize(bmap);
3329 isl_basic_map_free(bmap);
3333 /* Add a constraints to "bmap" expressing i_pos < o_pos
3335 static struct isl_basic_map *var_less(struct isl_basic_map *bmap, unsigned pos)
3341 i = isl_basic_map_alloc_inequality(bmap);
3344 nparam = isl_basic_map_n_param(bmap);
3345 n_in = isl_basic_map_n_in(bmap);
3346 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
3347 isl_int_set_si(bmap->ineq[i][0], -1);
3348 isl_int_set_si(bmap->ineq[i][1+nparam+pos], -1);
3349 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], 1);
3350 return isl_basic_map_finalize(bmap);
3352 isl_basic_map_free(bmap);
3356 /* Add a constraint to "bmap" expressing i_pos <= o_pos
3358 static __isl_give isl_basic_map *var_less_or_equal(
3359 __isl_take isl_basic_map *bmap, unsigned pos)
3365 i = isl_basic_map_alloc_inequality(bmap);
3368 nparam = isl_basic_map_n_param(bmap);
3369 n_in = isl_basic_map_n_in(bmap);
3370 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
3371 isl_int_set_si(bmap->ineq[i][1+nparam+pos], -1);
3372 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], 1);
3373 return isl_basic_map_finalize(bmap);
3375 isl_basic_map_free(bmap);
3379 /* Add a constraints to "bmap" expressing i_pos > o_pos
3381 static struct isl_basic_map *var_more(struct isl_basic_map *bmap, unsigned pos)
3387 i = isl_basic_map_alloc_inequality(bmap);
3390 nparam = isl_basic_map_n_param(bmap);
3391 n_in = isl_basic_map_n_in(bmap);
3392 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
3393 isl_int_set_si(bmap->ineq[i][0], -1);
3394 isl_int_set_si(bmap->ineq[i][1+nparam+pos], 1);
3395 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], -1);
3396 return isl_basic_map_finalize(bmap);
3398 isl_basic_map_free(bmap);
3402 /* Add a constraint to "bmap" expressing i_pos >= o_pos
3404 static __isl_give isl_basic_map *var_more_or_equal(
3405 __isl_take isl_basic_map *bmap, unsigned pos)
3411 i = isl_basic_map_alloc_inequality(bmap);
3414 nparam = isl_basic_map_n_param(bmap);
3415 n_in = isl_basic_map_n_in(bmap);
3416 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
3417 isl_int_set_si(bmap->ineq[i][1+nparam+pos], 1);
3418 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], -1);
3419 return isl_basic_map_finalize(bmap);
3421 isl_basic_map_free(bmap);
3425 struct isl_basic_map *isl_basic_map_equal(struct isl_dim *dim, unsigned n_equal)
3428 struct isl_basic_map *bmap;
3429 bmap = isl_basic_map_alloc_dim(dim, 0, n_equal, 0);
3432 for (i = 0; i < n_equal && bmap; ++i)
3433 bmap = var_equal(bmap, i);
3434 return isl_basic_map_finalize(bmap);
3437 /* Return a relation on of dimension "dim" expressing i_[0..pos] << o_[0..pos]
3439 struct isl_basic_map *isl_basic_map_less_at(struct isl_dim *dim, unsigned pos)
3442 struct isl_basic_map *bmap;
3443 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
3446 for (i = 0; i < pos && bmap; ++i)
3447 bmap = var_equal(bmap, i);
3449 bmap = var_less(bmap, pos);
3450 return isl_basic_map_finalize(bmap);
3453 /* Return a relation on of dimension "dim" expressing i_[0..pos] <<= o_[0..pos]
3455 __isl_give isl_basic_map *isl_basic_map_less_or_equal_at(
3456 __isl_take isl_dim *dim, unsigned pos)
3459 isl_basic_map *bmap;
3461 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
3462 for (i = 0; i < pos; ++i)
3463 bmap = var_equal(bmap, i);
3464 bmap = var_less_or_equal(bmap, pos);
3465 return isl_basic_map_finalize(bmap);
3468 /* Return a relation on pairs of sets of dimension "dim" expressing i_pos > o_pos
3470 struct isl_basic_map *isl_basic_map_more_at(struct isl_dim *dim, unsigned pos)
3473 struct isl_basic_map *bmap;
3474 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
3477 for (i = 0; i < pos && bmap; ++i)
3478 bmap = var_equal(bmap, i);
3480 bmap = var_more(bmap, pos);
3481 return isl_basic_map_finalize(bmap);
3484 /* Return a relation on of dimension "dim" expressing i_[0..pos] >>= o_[0..pos]
3486 __isl_give isl_basic_map *isl_basic_map_more_or_equal_at(
3487 __isl_take isl_dim *dim, unsigned pos)
3490 isl_basic_map *bmap;
3492 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
3493 for (i = 0; i < pos; ++i)
3494 bmap = var_equal(bmap, i);
3495 bmap = var_more_or_equal(bmap, pos);
3496 return isl_basic_map_finalize(bmap);
3499 static __isl_give isl_map *map_lex_lte_first(__isl_take isl_dim *dims,
3500 unsigned n, int equal)
3502 struct isl_map *map;
3505 if (n == 0 && equal)
3506 return isl_map_universe(dims);
3508 map = isl_map_alloc_dim(isl_dim_copy(dims), n, ISL_MAP_DISJOINT);
3510 for (i = 0; i + 1 < n; ++i)
3511 map = isl_map_add_basic_map(map,
3512 isl_basic_map_less_at(isl_dim_copy(dims), i));
3515 map = isl_map_add_basic_map(map,
3516 isl_basic_map_less_or_equal_at(dims, n - 1));
3518 map = isl_map_add_basic_map(map,
3519 isl_basic_map_less_at(dims, n - 1));
3526 static __isl_give isl_map *map_lex_lte(__isl_take isl_dim *dims, int equal)
3530 return map_lex_lte_first(dims, dims->n_out, equal);
3533 __isl_give isl_map *isl_map_lex_lt_first(__isl_take isl_dim *dim, unsigned n)
3535 return map_lex_lte_first(dim, n, 0);
3538 __isl_give isl_map *isl_map_lex_le_first(__isl_take isl_dim *dim, unsigned n)
3540 return map_lex_lte_first(dim, n, 1);
3543 __isl_give isl_map *isl_map_lex_lt(__isl_take isl_dim *set_dim)
3545 return map_lex_lte(isl_dim_map_from_set(set_dim), 0);
3548 __isl_give isl_map *isl_map_lex_le(__isl_take isl_dim *set_dim)
3550 return map_lex_lte(isl_dim_map_from_set(set_dim), 1);
3553 static __isl_give isl_map *map_lex_gte_first(__isl_take isl_dim *dims,
3554 unsigned n, int equal)
3556 struct isl_map *map;
3559 if (n == 0 && equal)
3560 return isl_map_universe(dims);
3562 map = isl_map_alloc_dim(isl_dim_copy(dims), n, ISL_MAP_DISJOINT);
3564 for (i = 0; i + 1 < n; ++i)
3565 map = isl_map_add_basic_map(map,
3566 isl_basic_map_more_at(isl_dim_copy(dims), i));
3569 map = isl_map_add_basic_map(map,
3570 isl_basic_map_more_or_equal_at(dims, n - 1));
3572 map = isl_map_add_basic_map(map,
3573 isl_basic_map_more_at(dims, n - 1));
3580 static __isl_give isl_map *map_lex_gte(__isl_take isl_dim *dims, int equal)
3584 return map_lex_gte_first(dims, dims->n_out, equal);
3587 __isl_give isl_map *isl_map_lex_gt_first(__isl_take isl_dim *dim, unsigned n)
3589 return map_lex_gte_first(dim, n, 0);
3592 __isl_give isl_map *isl_map_lex_ge_first(__isl_take isl_dim *dim, unsigned n)
3594 return map_lex_gte_first(dim, n, 1);
3597 __isl_give isl_map *isl_map_lex_gt(__isl_take isl_dim *set_dim)
3599 return map_lex_gte(isl_dim_map_from_set(set_dim), 0);
3602 __isl_give isl_map *isl_map_lex_ge(__isl_take isl_dim *set_dim)
3604 return map_lex_gte(isl_dim_map_from_set(set_dim), 1);
3607 __isl_give isl_map *isl_set_lex_le_set(__isl_take isl_set *set1,
3608 __isl_take isl_set *set2)
3611 map = isl_map_lex_le(isl_set_get_dim(set1));
3612 map = isl_map_intersect_domain(map, set1);
3613 map = isl_map_intersect_range(map, set2);
3617 __isl_give isl_map *isl_set_lex_lt_set(__isl_take isl_set *set1,
3618 __isl_take isl_set *set2)
3621 map = isl_map_lex_lt(isl_set_get_dim(set1));
3622 map = isl_map_intersect_domain(map, set1);
3623 map = isl_map_intersect_range(map, set2);
3627 __isl_give isl_map *isl_set_lex_ge_set(__isl_take isl_set *set1,
3628 __isl_take isl_set *set2)
3631 map = isl_map_lex_ge(isl_set_get_dim(set1));
3632 map = isl_map_intersect_domain(map, set1);
3633 map = isl_map_intersect_range(map, set2);
3637 __isl_give isl_map *isl_set_lex_gt_set(__isl_take isl_set *set1,
3638 __isl_take isl_set *set2)
3641 map = isl_map_lex_gt(isl_set_get_dim(set1));
3642 map = isl_map_intersect_domain(map, set1);
3643 map = isl_map_intersect_range(map, set2);
3647 __isl_give isl_map *isl_map_lex_le_map(__isl_take isl_map *map1,
3648 __isl_take isl_map *map2)
3651 map = isl_map_lex_le(isl_dim_range(isl_map_get_dim(map1)));
3652 map = isl_map_apply_domain(map, isl_map_reverse(map1));
3653 map = isl_map_apply_range(map, isl_map_reverse(map2));
3657 __isl_give isl_map *isl_map_lex_lt_map(__isl_take isl_map *map1,
3658 __isl_take isl_map *map2)
3661 map = isl_map_lex_lt(isl_dim_range(isl_map_get_dim(map1)));
3662 map = isl_map_apply_domain(map, isl_map_reverse(map1));
3663 map = isl_map_apply_range(map, isl_map_reverse(map2));
3667 __isl_give isl_map *isl_map_lex_ge_map(__isl_take isl_map *map1,
3668 __isl_take isl_map *map2)
3671 map = isl_map_lex_ge(isl_dim_range(isl_map_get_dim(map1)));
3672 map = isl_map_apply_domain(map, isl_map_reverse(map1));
3673 map = isl_map_apply_range(map, isl_map_reverse(map2));
3677 __isl_give isl_map *isl_map_lex_gt_map(__isl_take isl_map *map1,
3678 __isl_take isl_map *map2)
3681 map = isl_map_lex_gt(isl_dim_range(isl_map_get_dim(map1)));
3682 map = isl_map_apply_domain(map, isl_map_reverse(map1));
3683 map = isl_map_apply_range(map, isl_map_reverse(map2));
3687 struct isl_basic_map *isl_basic_map_from_basic_set(
3688 struct isl_basic_set *bset, struct isl_dim *dim)
3690 struct isl_basic_map *bmap;
3692 bset = isl_basic_set_cow(bset);
3696 isl_assert(bset->ctx, isl_dim_compatible(bset->dim, dim), goto error);
3697 isl_dim_free(bset->dim);
3698 bmap = (struct isl_basic_map *) bset;
3700 return isl_basic_map_finalize(bmap);
3702 isl_basic_set_free(bset);
3707 struct isl_basic_set *isl_basic_set_from_basic_map(struct isl_basic_map *bmap)
3711 if (bmap->dim->n_in == 0)
3712 return (struct isl_basic_set *)bmap;
3713 bmap = isl_basic_map_cow(bmap);
3716 bmap->dim = isl_dim_as_set_dim(bmap->dim);
3719 bmap = isl_basic_map_finalize(bmap);
3720 return (struct isl_basic_set *)bmap;
3722 isl_basic_map_free(bmap);
3726 /* For a div d = floor(f/m), add the constraints
3729 * -(f-(n-1)) + m d >= 0
3731 * Note that the second constraint is the negation of
3735 int isl_basic_map_add_div_constraints_var(__isl_keep isl_basic_map *bmap,
3736 unsigned pos, isl_int *div)
3739 unsigned total = isl_basic_map_total_dim(bmap);
3741 i = isl_basic_map_alloc_inequality(bmap);
3744 isl_seq_cpy(bmap->ineq[i], div + 1, 1 + total);
3745 isl_int_neg(bmap->ineq[i][1 + pos], div[0]);
3747 j = isl_basic_map_alloc_inequality(bmap);
3750 isl_seq_neg(bmap->ineq[j], bmap->ineq[i], 1 + total);
3751 isl_int_add(bmap->ineq[j][0], bmap->ineq[j][0], bmap->ineq[j][1 + pos]);
3752 isl_int_sub_ui(bmap->ineq[j][0], bmap->ineq[j][0], 1);
3756 int isl_basic_set_add_div_constraints_var(__isl_keep isl_basic_set *bset,
3757 unsigned pos, isl_int *div)
3759 return isl_basic_map_add_div_constraints_var((isl_basic_map *)bset,
3763 int isl_basic_map_add_div_constraints(struct isl_basic_map *bmap, unsigned div)
3765 unsigned total = isl_basic_map_total_dim(bmap);
3766 unsigned div_pos = total - bmap->n_div + div;
3768 return isl_basic_map_add_div_constraints_var(bmap, div_pos,
3772 struct isl_basic_set *isl_basic_map_underlying_set(
3773 struct isl_basic_map *bmap)
3777 if (bmap->dim->nparam == 0 && bmap->dim->n_in == 0 &&
3779 !isl_dim_is_named_or_nested(bmap->dim, isl_dim_in) &&
3780 !isl_dim_is_named_or_nested(bmap->dim, isl_dim_out))
3781 return (struct isl_basic_set *)bmap;
3782 bmap = isl_basic_map_cow(bmap);
3785 bmap->dim = isl_dim_underlying(bmap->dim, bmap->n_div);
3788 bmap->extra -= bmap->n_div;
3790 bmap = isl_basic_map_finalize(bmap);
3791 return (struct isl_basic_set *)bmap;
3796 __isl_give isl_basic_set *isl_basic_set_underlying_set(
3797 __isl_take isl_basic_set *bset)
3799 return isl_basic_map_underlying_set((isl_basic_map *)bset);
3802 struct isl_basic_map *isl_basic_map_overlying_set(
3803 struct isl_basic_set *bset, struct isl_basic_map *like)
3805 struct isl_basic_map *bmap;
3806 struct isl_ctx *ctx;
3813 isl_assert(ctx, bset->n_div == 0, goto error);
3814 isl_assert(ctx, isl_basic_set_n_param(bset) == 0, goto error);
3815 isl_assert(ctx, bset->dim->n_out == isl_basic_map_total_dim(like),
3817 if (isl_dim_equal(bset->dim, like->dim) && like->n_div == 0) {
3818 isl_basic_map_free(like);
3819 return (struct isl_basic_map *)bset;
3821 bset = isl_basic_set_cow(bset);
3824 total = bset->dim->n_out + bset->extra;
3825 bmap = (struct isl_basic_map *)bset;
3826 isl_dim_free(bmap->dim);
3827 bmap->dim = isl_dim_copy(like->dim);
3830 bmap->n_div = like->n_div;
3831 bmap->extra += like->n_div;
3835 ltotal = total - bmap->extra + like->extra;
3838 bmap->block2 = isl_blk_extend(ctx, bmap->block2,
3839 bmap->extra * (1 + 1 + total));
3840 if (isl_blk_is_error(bmap->block2))
3842 div = isl_realloc_array(ctx, bmap->div, isl_int *, bmap->extra);
3846 for (i = 0; i < bmap->extra; ++i)
3847 bmap->div[i] = bmap->block2.data + i * (1 + 1 + total);
3848 for (i = 0; i < like->n_div; ++i) {
3849 isl_seq_cpy(bmap->div[i], like->div[i], 1 + 1 + ltotal);
3850 isl_seq_clr(bmap->div[i]+1+1+ltotal, total - ltotal);
3852 bmap = isl_basic_map_extend_constraints(bmap,
3853 0, 2 * like->n_div);
3854 for (i = 0; i < like->n_div; ++i) {
3855 if (isl_int_is_zero(bmap->div[i][0]))
3857 if (isl_basic_map_add_div_constraints(bmap, i) < 0)
3861 isl_basic_map_free(like);
3862 bmap = isl_basic_map_simplify(bmap);
3863 bmap = isl_basic_map_finalize(bmap);
3866 isl_basic_map_free(like);
3867 isl_basic_set_free(bset);
3871 struct isl_basic_set *isl_basic_set_from_underlying_set(
3872 struct isl_basic_set *bset, struct isl_basic_set *like)
3874 return (struct isl_basic_set *)
3875 isl_basic_map_overlying_set(bset, (struct isl_basic_map *)like);
3878 struct isl_set *isl_set_from_underlying_set(
3879 struct isl_set *set, struct isl_basic_set *like)
3885 isl_assert(set->ctx, set->dim->n_out == isl_basic_set_total_dim(like),
3887 if (isl_dim_equal(set->dim, like->dim) && like->n_div == 0) {
3888 isl_basic_set_free(like);
3891 set = isl_set_cow(set);
3894 for (i = 0; i < set->n; ++i) {
3895 set->p[i] = isl_basic_set_from_underlying_set(set->p[i],
3896 isl_basic_set_copy(like));
3900 isl_dim_free(set->dim);
3901 set->dim = isl_dim_copy(like->dim);
3904 isl_basic_set_free(like);
3907 isl_basic_set_free(like);
3912 struct isl_set *isl_map_underlying_set(struct isl_map *map)
3916 map = isl_map_cow(map);
3919 map->dim = isl_dim_cow(map->dim);
3923 for (i = 1; i < map->n; ++i)
3924 isl_assert(map->ctx, map->p[0]->n_div == map->p[i]->n_div,
3926 for (i = 0; i < map->n; ++i) {
3927 map->p[i] = (struct isl_basic_map *)
3928 isl_basic_map_underlying_set(map->p[i]);
3933 map->dim = isl_dim_underlying(map->dim, 0);
3935 isl_dim_free(map->dim);
3936 map->dim = isl_dim_copy(map->p[0]->dim);
3940 return (struct isl_set *)map;
3946 struct isl_set *isl_set_to_underlying_set(struct isl_set *set)
3948 return (struct isl_set *)isl_map_underlying_set((struct isl_map *)set);
3951 __isl_give isl_basic_map *isl_basic_map_reset_dim(
3952 __isl_take isl_basic_map *bmap, __isl_take isl_dim *dim)
3954 bmap = isl_basic_map_cow(bmap);
3958 isl_dim_free(bmap->dim);
3961 bmap = isl_basic_map_finalize(bmap);
3965 isl_basic_map_free(bmap);
3970 __isl_give isl_basic_set *isl_basic_set_reset_dim(
3971 __isl_take isl_basic_set *bset, __isl_take isl_dim *dim)
3973 return (isl_basic_set *)isl_basic_map_reset_dim((isl_basic_map *)bset,
3977 __isl_give isl_map *isl_map_reset_dim(__isl_take isl_map *map,
3978 __isl_take isl_dim *dim)
3982 map = isl_map_cow(map);
3986 for (i = 0; i < map->n; ++i) {
3987 map->p[i] = isl_basic_map_reset_dim(map->p[i],
3992 isl_dim_free(map->dim);
4002 __isl_give isl_set *isl_set_reset_dim(__isl_take isl_set *set,
4003 __isl_take isl_dim *dim)
4005 return (struct isl_set *) isl_map_reset_dim((struct isl_map *)set, dim);
4008 struct isl_basic_set *isl_basic_map_domain(struct isl_basic_map *bmap)
4011 struct isl_basic_set *domain;
4017 dim = isl_dim_domain(isl_basic_map_get_dim(bmap));
4019 n_in = isl_basic_map_n_in(bmap);
4020 n_out = isl_basic_map_n_out(bmap);
4021 domain = isl_basic_set_from_basic_map(bmap);
4022 domain = isl_basic_set_project_out(domain, isl_dim_set, n_in, n_out);
4024 domain = isl_basic_set_reset_dim(domain, dim);
4029 int isl_basic_map_may_be_set(__isl_keep isl_basic_map *bmap)
4033 return isl_dim_may_be_set(bmap->dim);
4036 struct isl_basic_set *isl_basic_map_range(struct isl_basic_map *bmap)
4040 if (isl_basic_map_may_be_set(bmap))
4042 return isl_basic_map_domain(isl_basic_map_reverse(bmap));
4045 __isl_give isl_basic_map *isl_basic_map_domain_map(
4046 __isl_take isl_basic_map *bmap)
4050 isl_basic_map *domain;
4051 int nparam, n_in, n_out;
4054 nparam = isl_basic_map_dim(bmap, isl_dim_param);
4055 n_in = isl_basic_map_dim(bmap, isl_dim_in);
4056 n_out = isl_basic_map_dim(bmap, isl_dim_out);
4058 dim = isl_dim_from_range(isl_dim_domain(isl_basic_map_get_dim(bmap)));
4059 domain = isl_basic_map_universe(dim);
4061 bmap = isl_basic_map_from_domain(isl_basic_map_wrap(bmap));
4062 bmap = isl_basic_map_apply_range(bmap, domain);
4063 bmap = isl_basic_map_extend_constraints(bmap, n_in, 0);
4065 total = isl_basic_map_total_dim(bmap);
4067 for (i = 0; i < n_in; ++i) {
4068 k = isl_basic_map_alloc_equality(bmap);
4071 isl_seq_clr(bmap->eq[k], 1 + total);
4072 isl_int_set_si(bmap->eq[k][1 + nparam + i], -1);
4073 isl_int_set_si(bmap->eq[k][1 + nparam + n_in + n_out + i], 1);
4076 bmap = isl_basic_map_gauss(bmap, NULL);
4077 return isl_basic_map_finalize(bmap);
4079 isl_basic_map_free(bmap);
4083 __isl_give isl_basic_map *isl_basic_map_range_map(
4084 __isl_take isl_basic_map *bmap)
4088 isl_basic_map *range;
4089 int nparam, n_in, n_out;
4092 nparam = isl_basic_map_dim(bmap, isl_dim_param);
4093 n_in = isl_basic_map_dim(bmap, isl_dim_in);
4094 n_out = isl_basic_map_dim(bmap, isl_dim_out);
4096 dim = isl_dim_from_range(isl_dim_range(isl_basic_map_get_dim(bmap)));
4097 range = isl_basic_map_universe(dim);
4099 bmap = isl_basic_map_from_domain(isl_basic_map_wrap(bmap));
4100 bmap = isl_basic_map_apply_range(bmap, range);
4101 bmap = isl_basic_map_extend_constraints(bmap, n_out, 0);
4103 total = isl_basic_map_total_dim(bmap);
4105 for (i = 0; i < n_out; ++i) {
4106 k = isl_basic_map_alloc_equality(bmap);
4109 isl_seq_clr(bmap->eq[k], 1 + total);
4110 isl_int_set_si(bmap->eq[k][1 + nparam + n_in + i], -1);
4111 isl_int_set_si(bmap->eq[k][1 + nparam + n_in + n_out + i], 1);
4114 bmap = isl_basic_map_gauss(bmap, NULL);
4115 return isl_basic_map_finalize(bmap);
4117 isl_basic_map_free(bmap);
4121 int isl_map_may_be_set(__isl_keep isl_map *map)
4125 return isl_dim_may_be_set(map->dim);
4128 struct isl_set *isl_map_range(struct isl_map *map)
4131 struct isl_set *set;
4135 if (isl_map_may_be_set(map))
4136 return (isl_set *)map;
4138 map = isl_map_cow(map);
4142 set = (struct isl_set *) map;
4143 set->dim = isl_dim_drop_inputs(set->dim, 0, set->dim->n_in);
4146 for (i = 0; i < map->n; ++i) {
4147 set->p[i] = isl_basic_map_range(map->p[i]);
4151 ISL_F_CLR(set, ISL_MAP_DISJOINT);
4152 ISL_F_CLR(set, ISL_SET_NORMALIZED);
4159 __isl_give isl_map *isl_map_domain_map(__isl_take isl_map *map)
4162 isl_dim *domain_dim;
4164 map = isl_map_cow(map);
4168 domain_dim = isl_dim_from_range(isl_dim_domain(isl_map_get_dim(map)));
4169 map->dim = isl_dim_from_domain(isl_dim_wrap(map->dim));
4170 map->dim = isl_dim_join(map->dim, domain_dim);
4173 for (i = 0; i < map->n; ++i) {
4174 map->p[i] = isl_basic_map_domain_map(map->p[i]);
4178 ISL_F_CLR(map, ISL_MAP_DISJOINT);
4179 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4186 __isl_give isl_map *isl_map_range_map(__isl_take isl_map *map)
4191 map = isl_map_cow(map);
4195 range_dim = isl_dim_range(isl_map_get_dim(map));
4196 map->dim = isl_dim_from_domain(isl_dim_wrap(map->dim));
4197 map->dim = isl_dim_join(map->dim, range_dim);
4200 for (i = 0; i < map->n; ++i) {
4201 map->p[i] = isl_basic_map_range_map(map->p[i]);
4205 ISL_F_CLR(map, ISL_MAP_DISJOINT);
4206 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4213 struct isl_map *isl_map_from_set(struct isl_set *set, struct isl_dim *dim)
4216 struct isl_map *map = NULL;
4218 set = isl_set_cow(set);
4221 isl_assert(set->ctx, isl_dim_compatible(set->dim, dim), goto error);
4222 map = (struct isl_map *)set;
4223 for (i = 0; i < set->n; ++i) {
4224 map->p[i] = isl_basic_map_from_basic_set(
4225 set->p[i], isl_dim_copy(dim));
4229 isl_dim_free(map->dim);
4238 __isl_give isl_basic_map *isl_basic_map_from_domain(
4239 __isl_take isl_basic_set *bset)
4241 return isl_basic_map_reverse(isl_basic_map_from_range(bset));
4244 __isl_give isl_basic_map *isl_basic_map_from_range(
4245 __isl_take isl_basic_set *bset)
4247 return (isl_basic_map *)bset;
4250 struct isl_map *isl_map_from_range(struct isl_set *set)
4252 return (struct isl_map *)set;
4255 __isl_give isl_map *isl_map_from_domain(__isl_take isl_set *set)
4257 return isl_map_reverse(isl_map_from_range(set));
4260 __isl_give isl_basic_map *isl_basic_map_from_domain_and_range(
4261 __isl_take isl_basic_set *domain, __isl_take isl_basic_set *range)
4263 return isl_basic_map_apply_range(isl_basic_map_from_domain(domain),
4264 isl_basic_map_from_range(range));
4267 __isl_give isl_map *isl_map_from_domain_and_range(__isl_take isl_set *domain,
4268 __isl_take isl_set *range)
4270 return isl_map_apply_range(isl_map_from_domain(domain),
4271 isl_map_from_range(range));
4274 struct isl_set *isl_set_from_map(struct isl_map *map)
4277 struct isl_set *set = NULL;
4281 map = isl_map_cow(map);
4284 map->dim = isl_dim_as_set_dim(map->dim);
4287 set = (struct isl_set *)map;
4288 for (i = 0; i < map->n; ++i) {
4289 set->p[i] = isl_basic_set_from_basic_map(map->p[i]);
4299 struct isl_map *isl_map_alloc_dim(struct isl_dim *dim, int n, unsigned flags)
4301 struct isl_map *map;
4305 isl_assert(dim->ctx, n >= 0, return NULL);
4306 map = isl_alloc(dim->ctx, struct isl_map,
4307 sizeof(struct isl_map) +
4308 (n - 1) * sizeof(struct isl_basic_map *));
4312 map->ctx = dim->ctx;
4313 isl_ctx_ref(map->ctx);
4325 struct isl_map *isl_map_alloc(struct isl_ctx *ctx,
4326 unsigned nparam, unsigned in, unsigned out, int n,
4329 struct isl_map *map;
4330 struct isl_dim *dims;
4332 dims = isl_dim_alloc(ctx, nparam, in, out);
4336 map = isl_map_alloc_dim(dims, n, flags);
4340 struct isl_basic_map *isl_basic_map_empty(struct isl_dim *dim)
4342 struct isl_basic_map *bmap;
4343 bmap = isl_basic_map_alloc_dim(dim, 0, 1, 0);
4344 bmap = isl_basic_map_set_to_empty(bmap);
4348 struct isl_basic_set *isl_basic_set_empty(struct isl_dim *dim)
4350 struct isl_basic_set *bset;
4351 bset = isl_basic_set_alloc_dim(dim, 0, 1, 0);
4352 bset = isl_basic_set_set_to_empty(bset);
4356 struct isl_basic_map *isl_basic_map_empty_like(struct isl_basic_map *model)
4358 struct isl_basic_map *bmap;
4361 bmap = isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
4362 bmap = isl_basic_map_set_to_empty(bmap);
4366 struct isl_basic_map *isl_basic_map_empty_like_map(struct isl_map *model)
4368 struct isl_basic_map *bmap;
4371 bmap = isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
4372 bmap = isl_basic_map_set_to_empty(bmap);
4376 struct isl_basic_set *isl_basic_set_empty_like(struct isl_basic_set *model)
4378 struct isl_basic_set *bset;
4381 bset = isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
4382 bset = isl_basic_set_set_to_empty(bset);
4386 struct isl_basic_map *isl_basic_map_universe(struct isl_dim *dim)
4388 struct isl_basic_map *bmap;
4389 bmap = isl_basic_map_alloc_dim(dim, 0, 0, 0);
4390 bmap = isl_basic_map_finalize(bmap);
4394 struct isl_basic_set *isl_basic_set_universe(struct isl_dim *dim)
4396 struct isl_basic_set *bset;
4397 bset = isl_basic_set_alloc_dim(dim, 0, 0, 0);
4398 bset = isl_basic_set_finalize(bset);
4402 __isl_give isl_basic_map *isl_basic_map_nat_universe(__isl_take isl_dim *dim)
4405 unsigned total = isl_dim_total(dim);
4406 isl_basic_map *bmap;
4408 bmap= isl_basic_map_alloc_dim(dim, 0, 0, total);
4409 for (i = 0; i < total; ++i) {
4410 int k = isl_basic_map_alloc_inequality(bmap);
4413 isl_seq_clr(bmap->ineq[k], 1 + total);
4414 isl_int_set_si(bmap->ineq[k][1 + i], 1);
4418 isl_basic_map_free(bmap);
4422 __isl_give isl_basic_set *isl_basic_set_nat_universe(__isl_take isl_dim *dim)
4424 return isl_basic_map_nat_universe(dim);
4427 __isl_give isl_map *isl_map_nat_universe(__isl_take isl_dim *dim)
4429 return isl_map_from_basic_map(isl_basic_map_nat_universe(dim));
4432 __isl_give isl_set *isl_set_nat_universe(__isl_take isl_dim *dim)
4434 return isl_map_nat_universe(dim);
4437 __isl_give isl_basic_map *isl_basic_map_universe_like(
4438 __isl_keep isl_basic_map *model)
4442 return isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
4445 struct isl_basic_set *isl_basic_set_universe_like(struct isl_basic_set *model)
4449 return isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
4452 __isl_give isl_basic_set *isl_basic_set_universe_like_set(
4453 __isl_keep isl_set *model)
4457 return isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
4460 struct isl_map *isl_map_empty(struct isl_dim *dim)
4462 return isl_map_alloc_dim(dim, 0, ISL_MAP_DISJOINT);
4465 struct isl_map *isl_map_empty_like(struct isl_map *model)
4469 return isl_map_alloc_dim(isl_dim_copy(model->dim), 0, ISL_MAP_DISJOINT);
4472 struct isl_map *isl_map_empty_like_basic_map(struct isl_basic_map *model)
4476 return isl_map_alloc_dim(isl_dim_copy(model->dim), 0, ISL_MAP_DISJOINT);
4479 struct isl_set *isl_set_empty(struct isl_dim *dim)
4481 return isl_set_alloc_dim(dim, 0, ISL_MAP_DISJOINT);
4484 struct isl_set *isl_set_empty_like(struct isl_set *model)
4488 return isl_set_empty(isl_dim_copy(model->dim));
4491 struct isl_map *isl_map_universe(struct isl_dim *dim)
4493 struct isl_map *map;
4496 map = isl_map_alloc_dim(isl_dim_copy(dim), 1, ISL_MAP_DISJOINT);
4497 map = isl_map_add_basic_map(map, isl_basic_map_universe(dim));
4501 struct isl_set *isl_set_universe(struct isl_dim *dim)
4503 struct isl_set *set;
4506 set = isl_set_alloc_dim(isl_dim_copy(dim), 1, ISL_MAP_DISJOINT);
4507 set = isl_set_add_basic_set(set, isl_basic_set_universe(dim));
4511 __isl_give isl_set *isl_set_universe_like(__isl_keep isl_set *model)
4515 return isl_set_universe(isl_dim_copy(model->dim));
4518 struct isl_map *isl_map_dup(struct isl_map *map)
4521 struct isl_map *dup;
4525 dup = isl_map_alloc_dim(isl_dim_copy(map->dim), map->n, map->flags);
4526 for (i = 0; i < map->n; ++i)
4527 dup = isl_map_add_basic_map(dup, isl_basic_map_copy(map->p[i]));
4531 __isl_give isl_map *isl_map_add_basic_map(__isl_take isl_map *map,
4532 __isl_take isl_basic_map *bmap)
4536 if (isl_basic_map_plain_is_empty(bmap)) {
4537 isl_basic_map_free(bmap);
4540 isl_assert(map->ctx, isl_dim_equal(map->dim, bmap->dim), goto error);
4541 isl_assert(map->ctx, map->n < map->size, goto error);
4542 map->p[map->n] = bmap;
4544 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4550 isl_basic_map_free(bmap);
4554 void isl_map_free(struct isl_map *map)
4564 isl_ctx_deref(map->ctx);
4565 for (i = 0; i < map->n; ++i)
4566 isl_basic_map_free(map->p[i]);
4567 isl_dim_free(map->dim);
4571 struct isl_map *isl_map_extend(struct isl_map *base,
4572 unsigned nparam, unsigned n_in, unsigned n_out)
4576 base = isl_map_cow(base);
4580 base->dim = isl_dim_extend(base->dim, nparam, n_in, n_out);
4583 for (i = 0; i < base->n; ++i) {
4584 base->p[i] = isl_basic_map_extend_dim(base->p[i],
4585 isl_dim_copy(base->dim), 0, 0, 0);
4595 struct isl_set *isl_set_extend(struct isl_set *base,
4596 unsigned nparam, unsigned dim)
4598 return (struct isl_set *)isl_map_extend((struct isl_map *)base,
4602 static struct isl_basic_map *isl_basic_map_fix_pos_si(
4603 struct isl_basic_map *bmap, unsigned pos, int value)
4607 bmap = isl_basic_map_cow(bmap);
4608 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
4609 j = isl_basic_map_alloc_equality(bmap);
4612 isl_seq_clr(bmap->eq[j] + 1, isl_basic_map_total_dim(bmap));
4613 isl_int_set_si(bmap->eq[j][pos], -1);
4614 isl_int_set_si(bmap->eq[j][0], value);
4615 bmap = isl_basic_map_simplify(bmap);
4616 return isl_basic_map_finalize(bmap);
4618 isl_basic_map_free(bmap);
4622 static __isl_give isl_basic_map *isl_basic_map_fix_pos(
4623 __isl_take isl_basic_map *bmap, unsigned pos, isl_int value)
4627 bmap = isl_basic_map_cow(bmap);
4628 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
4629 j = isl_basic_map_alloc_equality(bmap);
4632 isl_seq_clr(bmap->eq[j] + 1, isl_basic_map_total_dim(bmap));
4633 isl_int_set_si(bmap->eq[j][pos], -1);
4634 isl_int_set(bmap->eq[j][0], value);
4635 bmap = isl_basic_map_simplify(bmap);
4636 return isl_basic_map_finalize(bmap);
4638 isl_basic_map_free(bmap);
4642 struct isl_basic_map *isl_basic_map_fix_si(struct isl_basic_map *bmap,
4643 enum isl_dim_type type, unsigned pos, int value)
4647 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
4648 return isl_basic_map_fix_pos_si(bmap,
4649 isl_basic_map_offset(bmap, type) + pos, value);
4651 isl_basic_map_free(bmap);
4655 __isl_give isl_basic_map *isl_basic_map_fix(__isl_take isl_basic_map *bmap,
4656 enum isl_dim_type type, unsigned pos, isl_int value)
4660 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
4661 return isl_basic_map_fix_pos(bmap,
4662 isl_basic_map_offset(bmap, type) + pos, value);
4664 isl_basic_map_free(bmap);
4668 struct isl_basic_set *isl_basic_set_fix_si(struct isl_basic_set *bset,
4669 enum isl_dim_type type, unsigned pos, int value)
4671 return (struct isl_basic_set *)
4672 isl_basic_map_fix_si((struct isl_basic_map *)bset,
4676 __isl_give isl_basic_set *isl_basic_set_fix(__isl_take isl_basic_set *bset,
4677 enum isl_dim_type type, unsigned pos, isl_int value)
4679 return (struct isl_basic_set *)
4680 isl_basic_map_fix((struct isl_basic_map *)bset,
4684 struct isl_basic_map *isl_basic_map_fix_input_si(struct isl_basic_map *bmap,
4685 unsigned input, int value)
4687 return isl_basic_map_fix_si(bmap, isl_dim_in, input, value);
4690 struct isl_basic_set *isl_basic_set_fix_dim_si(struct isl_basic_set *bset,
4691 unsigned dim, int value)
4693 return (struct isl_basic_set *)
4694 isl_basic_map_fix_si((struct isl_basic_map *)bset,
4695 isl_dim_set, dim, value);
4698 struct isl_map *isl_map_fix_si(struct isl_map *map,
4699 enum isl_dim_type type, unsigned pos, int value)
4703 map = isl_map_cow(map);
4707 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
4708 for (i = 0; i < map->n; ++i) {
4709 map->p[i] = isl_basic_map_fix_si(map->p[i], type, pos, value);
4713 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4720 __isl_give isl_set *isl_set_fix_si(__isl_take isl_set *set,
4721 enum isl_dim_type type, unsigned pos, int value)
4723 return (struct isl_set *)
4724 isl_map_fix_si((struct isl_map *)set, type, pos, value);
4727 __isl_give isl_map *isl_map_fix(__isl_take isl_map *map,
4728 enum isl_dim_type type, unsigned pos, isl_int value)
4732 map = isl_map_cow(map);
4736 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
4737 for (i = 0; i < map->n; ++i) {
4738 map->p[i] = isl_basic_map_fix(map->p[i], type, pos, value);
4742 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4749 __isl_give isl_set *isl_set_fix(__isl_take isl_set *set,
4750 enum isl_dim_type type, unsigned pos, isl_int value)
4752 return (struct isl_set *)isl_map_fix((isl_map *)set, type, pos, value);
4755 struct isl_map *isl_map_fix_input_si(struct isl_map *map,
4756 unsigned input, int value)
4758 return isl_map_fix_si(map, isl_dim_in, input, value);
4761 struct isl_set *isl_set_fix_dim_si(struct isl_set *set, unsigned dim, int value)
4763 return (struct isl_set *)
4764 isl_map_fix_si((struct isl_map *)set, isl_dim_set, dim, value);
4767 __isl_give isl_basic_map *isl_basic_map_lower_bound_si(
4768 __isl_take isl_basic_map *bmap,
4769 enum isl_dim_type type, unsigned pos, int value)
4775 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
4776 pos += isl_basic_map_offset(bmap, type);
4777 bmap = isl_basic_map_cow(bmap);
4778 bmap = isl_basic_map_extend_constraints(bmap, 0, 1);
4779 j = isl_basic_map_alloc_inequality(bmap);
4782 isl_seq_clr(bmap->ineq[j], 1 + isl_basic_map_total_dim(bmap));
4783 isl_int_set_si(bmap->ineq[j][pos], 1);
4784 isl_int_set_si(bmap->ineq[j][0], -value);
4785 bmap = isl_basic_map_simplify(bmap);
4786 return isl_basic_map_finalize(bmap);
4788 isl_basic_map_free(bmap);
4792 struct isl_basic_set *isl_basic_set_lower_bound_dim(struct isl_basic_set *bset,
4793 unsigned dim, isl_int value)
4797 bset = isl_basic_set_cow(bset);
4798 bset = isl_basic_set_extend_constraints(bset, 0, 1);
4799 j = isl_basic_set_alloc_inequality(bset);
4802 isl_seq_clr(bset->ineq[j], 1 + isl_basic_set_total_dim(bset));
4803 isl_int_set_si(bset->ineq[j][1 + isl_basic_set_n_param(bset) + dim], 1);
4804 isl_int_neg(bset->ineq[j][0], value);
4805 bset = isl_basic_set_simplify(bset);
4806 return isl_basic_set_finalize(bset);
4808 isl_basic_set_free(bset);
4812 __isl_give isl_map *isl_map_lower_bound_si(__isl_take isl_map *map,
4813 enum isl_dim_type type, unsigned pos, int value)
4817 map = isl_map_cow(map);
4821 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
4822 for (i = 0; i < map->n; ++i) {
4823 map->p[i] = isl_basic_map_lower_bound_si(map->p[i],
4828 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4835 __isl_give isl_set *isl_set_lower_bound_si(__isl_take isl_set *set,
4836 enum isl_dim_type type, unsigned pos, int value)
4838 return (struct isl_set *)
4839 isl_map_lower_bound_si((struct isl_map *)set, type, pos, value);
4842 struct isl_set *isl_set_lower_bound_dim(struct isl_set *set, unsigned dim,
4847 set = isl_set_cow(set);
4851 isl_assert(set->ctx, dim < isl_set_n_dim(set), goto error);
4852 for (i = 0; i < set->n; ++i) {
4853 set->p[i] = isl_basic_set_lower_bound_dim(set->p[i], dim, value);
4863 struct isl_map *isl_map_reverse(struct isl_map *map)
4867 map = isl_map_cow(map);
4871 map->dim = isl_dim_reverse(map->dim);
4874 for (i = 0; i < map->n; ++i) {
4875 map->p[i] = isl_basic_map_reverse(map->p[i]);
4879 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4886 static struct isl_map *isl_basic_map_partial_lexopt(
4887 struct isl_basic_map *bmap, struct isl_basic_set *dom,
4888 struct isl_set **empty, int max)
4892 if (bmap->ctx->opt->pip == ISL_PIP_PIP)
4893 return isl_pip_basic_map_lexopt(bmap, dom, empty, max);
4895 return isl_tab_basic_map_partial_lexopt(bmap, dom, empty, max);
4897 isl_basic_map_free(bmap);
4898 isl_basic_set_free(dom);
4904 struct isl_map *isl_basic_map_partial_lexmax(
4905 struct isl_basic_map *bmap, struct isl_basic_set *dom,
4906 struct isl_set **empty)
4908 return isl_basic_map_partial_lexopt(bmap, dom, empty, 1);
4911 struct isl_map *isl_basic_map_partial_lexmin(
4912 struct isl_basic_map *bmap, struct isl_basic_set *dom,
4913 struct isl_set **empty)
4915 return isl_basic_map_partial_lexopt(bmap, dom, empty, 0);
4918 struct isl_set *isl_basic_set_partial_lexmin(
4919 struct isl_basic_set *bset, struct isl_basic_set *dom,
4920 struct isl_set **empty)
4922 return (struct isl_set *)
4923 isl_basic_map_partial_lexmin((struct isl_basic_map *)bset,
4927 struct isl_set *isl_basic_set_partial_lexmax(
4928 struct isl_basic_set *bset, struct isl_basic_set *dom,
4929 struct isl_set **empty)
4931 return (struct isl_set *)
4932 isl_basic_map_partial_lexmax((struct isl_basic_map *)bset,
4936 /* Given a basic map "bmap", compute the lexicographically minimal
4937 * (or maximal) image element for each domain element in dom.
4938 * Set *empty to those elements in dom that do not have an image element.
4940 * We first make sure the basic sets in dom are disjoint and then
4941 * simply collect the results over each of the basic sets separately.
4942 * We could probably improve the efficiency a bit by moving the union
4943 * domain down into the parametric integer programming.
4945 static __isl_give isl_map *basic_map_partial_lexopt(
4946 __isl_take isl_basic_map *bmap, __isl_take isl_set *dom,
4947 __isl_give isl_set **empty, int max)
4950 struct isl_map *res;
4952 dom = isl_set_make_disjoint(dom);
4956 if (isl_set_plain_is_empty(dom)) {
4957 res = isl_map_empty_like_basic_map(bmap);
4958 *empty = isl_set_empty_like(dom);
4960 isl_basic_map_free(bmap);
4964 res = isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap),
4965 isl_basic_set_copy(dom->p[0]), empty, max);
4967 for (i = 1; i < dom->n; ++i) {
4968 struct isl_map *res_i;
4969 struct isl_set *empty_i;
4971 res_i = isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap),
4972 isl_basic_set_copy(dom->p[i]), &empty_i, max);
4974 res = isl_map_union_disjoint(res, res_i);
4975 *empty = isl_set_union_disjoint(*empty, empty_i);
4979 isl_basic_map_free(bmap);
4984 isl_basic_map_free(bmap);
4988 /* Given a map "map", compute the lexicographically minimal
4989 * (or maximal) image element for each domain element in dom.
4990 * Set *empty to those elements in dom that do not have an image element.
4992 * We first compute the lexicographically minimal or maximal element
4993 * in the first basic map. This results in a partial solution "res"
4994 * and a subset "todo" of dom that still need to be handled.
4995 * We then consider each of the remaining maps in "map" and successively
4996 * improve both "res" and "todo".
4998 * Let res^k and todo^k be the results after k steps and let i = k + 1.
4999 * Assume we are computing the lexicographical maximum.
5000 * We first compute the lexicographically maximal element in basic map i.
5001 * This results in a partial solution res_i and a subset todo_i.
5002 * Then we combine these results with those obtain for the first k basic maps
5003 * to obtain a result that is valid for the first k+1 basic maps.
5004 * In particular, the set where there is no solution is the set where
5005 * there is no solution for the first k basic maps and also no solution
5006 * for the ith basic map, i.e.,
5008 * todo^i = todo^k * todo_i
5010 * On dom(res^k) * dom(res_i), we need to pick the larger of the two
5011 * solutions, arbitrarily breaking ties in favor of res^k.
5012 * That is, when res^k(a) >= res_i(a), we pick res^k and
5013 * when res^k(a) < res_i(a), we pick res_i. (Here, ">=" and "<" denote
5014 * the lexicographic order.)
5015 * In practice, we compute
5017 * res^k * (res_i . "<=")
5021 * res_i * (res^k . "<")
5023 * Finally, we consider the symmetric difference of dom(res^k) and dom(res_i),
5024 * where only one of res^k and res_i provides a solution and we simply pick
5031 * Note that we only compute these intersections when dom(res^k) intersects
5032 * dom(res_i). Otherwise, the only effect of these intersections is to
5033 * potentially break up res^k and res_i into smaller pieces.
5034 * We want to avoid such splintering as much as possible.
5035 * In fact, an earlier implementation of this function would look for
5036 * better results in the domain of res^k and for extra results in todo^k,
5037 * but this would always result in a splintering according to todo^k,
5038 * even when the domain of basic map i is disjoint from the domains of
5039 * the previous basic maps.
5041 static __isl_give isl_map *isl_map_partial_lexopt(
5042 __isl_take isl_map *map, __isl_take isl_set *dom,
5043 __isl_give isl_set **empty, int max)
5046 struct isl_map *res;
5047 struct isl_set *todo;
5052 if (isl_map_plain_is_empty(map)) {
5060 res = basic_map_partial_lexopt(isl_basic_map_copy(map->p[0]),
5061 isl_set_copy(dom), &todo, max);
5063 for (i = 1; i < map->n; ++i) {
5067 isl_dim *dim = isl_dim_range(isl_map_get_dim(res));
5069 res_i = basic_map_partial_lexopt(isl_basic_map_copy(map->p[i]),
5070 isl_set_copy(dom), &todo_i, max);
5073 lt = isl_map_lex_lt(isl_dim_copy(dim));
5074 le = isl_map_lex_le(dim);
5076 lt = isl_map_lex_gt(isl_dim_copy(dim));
5077 le = isl_map_lex_ge(dim);
5079 lt = isl_map_apply_range(isl_map_copy(res), lt);
5080 lt = isl_map_intersect(lt, isl_map_copy(res_i));
5081 le = isl_map_apply_range(isl_map_copy(res_i), le);
5082 le = isl_map_intersect(le, isl_map_copy(res));
5084 if (!isl_map_is_empty(lt) || !isl_map_is_empty(le)) {
5085 res = isl_map_intersect_domain(res,
5086 isl_set_copy(todo_i));
5087 res_i = isl_map_intersect_domain(res_i,
5088 isl_set_copy(todo));
5091 res = isl_map_union_disjoint(res, res_i);
5092 res = isl_map_union_disjoint(res, lt);
5093 res = isl_map_union_disjoint(res, le);
5095 todo = isl_set_intersect(todo, todo_i);
5115 __isl_give isl_map *isl_map_partial_lexmax(
5116 __isl_take isl_map *map, __isl_take isl_set *dom,
5117 __isl_give isl_set **empty)
5119 return isl_map_partial_lexopt(map, dom, empty, 1);
5122 __isl_give isl_map *isl_map_partial_lexmin(
5123 __isl_take isl_map *map, __isl_take isl_set *dom,
5124 __isl_give isl_set **empty)
5126 return isl_map_partial_lexopt(map, dom, empty, 0);
5129 __isl_give isl_set *isl_set_partial_lexmin(
5130 __isl_take isl_set *set, __isl_take isl_set *dom,
5131 __isl_give isl_set **empty)
5133 return (struct isl_set *)
5134 isl_map_partial_lexmin((struct isl_map *)set,
5138 __isl_give isl_set *isl_set_partial_lexmax(
5139 __isl_take isl_set *set, __isl_take isl_set *dom,
5140 __isl_give isl_set **empty)
5142 return (struct isl_set *)
5143 isl_map_partial_lexmax((struct isl_map *)set,
5147 __isl_give isl_map *isl_basic_map_lexopt(__isl_take isl_basic_map *bmap, int max)
5149 struct isl_basic_set *dom = NULL;
5150 struct isl_dim *dom_dim;
5154 dom_dim = isl_dim_domain(isl_dim_copy(bmap->dim));
5155 dom = isl_basic_set_universe(dom_dim);
5156 return isl_basic_map_partial_lexopt(bmap, dom, NULL, max);
5158 isl_basic_map_free(bmap);
5162 __isl_give isl_map *isl_basic_map_lexmin(__isl_take isl_basic_map *bmap)
5164 return isl_basic_map_lexopt(bmap, 0);
5167 __isl_give isl_map *isl_basic_map_lexmax(__isl_take isl_basic_map *bmap)
5169 return isl_basic_map_lexopt(bmap, 1);
5172 __isl_give isl_set *isl_basic_set_lexmin(__isl_take isl_basic_set *bset)
5174 return (isl_set *)isl_basic_map_lexmin((isl_basic_map *)bset);
5177 __isl_give isl_set *isl_basic_set_lexmax(__isl_take isl_basic_set *bset)
5179 return (isl_set *)isl_basic_map_lexmax((isl_basic_map *)bset);
5182 __isl_give isl_map *isl_map_lexopt(__isl_take isl_map *map, int max)
5184 struct isl_set *dom = NULL;
5185 struct isl_dim *dom_dim;
5189 dom_dim = isl_dim_domain(isl_dim_copy(map->dim));
5190 dom = isl_set_universe(dom_dim);
5191 return isl_map_partial_lexopt(map, dom, NULL, max);
5197 __isl_give isl_map *isl_map_lexmin(__isl_take isl_map *map)
5199 return isl_map_lexopt(map, 0);
5202 __isl_give isl_map *isl_map_lexmax(__isl_take isl_map *map)
5204 return isl_map_lexopt(map, 1);
5207 __isl_give isl_set *isl_set_lexmin(__isl_take isl_set *set)
5209 return (isl_set *)isl_map_lexmin((isl_map *)set);
5212 __isl_give isl_set *isl_set_lexmax(__isl_take isl_set *set)
5214 return (isl_set *)isl_map_lexmax((isl_map *)set);
5217 /* Construct a map that equates the two given dimensions in the given space.
5219 static __isl_give isl_map *equate(__isl_take isl_dim *dim,
5220 enum isl_dim_type src_type, int src_pos,
5221 enum isl_dim_type dst_type, int dst_pos)
5223 isl_basic_map *bmap;
5226 bmap = isl_basic_map_alloc_dim(dim, 0, 1, 0);
5227 k = isl_basic_map_alloc_equality(bmap);
5230 isl_seq_clr(bmap->eq[k], 1 + isl_basic_map_total_dim(bmap));
5231 src_pos += isl_basic_map_offset(bmap, src_type);
5232 dst_pos += isl_basic_map_offset(bmap, dst_type);
5233 isl_int_set_si(bmap->eq[k][src_pos], 1);
5234 isl_int_set_si(bmap->eq[k][dst_pos], -1);
5236 return isl_map_from_basic_map(bmap);
5238 isl_basic_map_free(bmap);
5242 /* Extract the first and only affine expression from list
5243 * and then add it to *pwaff with the given dom.
5244 * This domain is known to be disjoint from other domains
5245 * because of the way isl_basic_set_foreach_lexmax works.
5247 static int update_dim_max(__isl_take isl_basic_set *dom,
5248 __isl_take isl_aff_list *list, void *user)
5250 isl_ctx *ctx = isl_basic_set_get_ctx(dom);
5252 isl_pw_aff **pwaff = user;
5253 isl_pw_aff *pwaff_i;
5255 if (isl_aff_list_n_aff(list) != 1)
5256 isl_die(ctx, isl_error_internal,
5257 "expecting single element list", goto error);
5259 aff = isl_aff_list_get_aff(list, 0);
5260 pwaff_i = isl_pw_aff_alloc(isl_set_from_basic_set(dom), aff);
5262 *pwaff = isl_pw_aff_add_disjoint(*pwaff, pwaff_i);
5264 isl_aff_list_free(list);
5268 isl_basic_set_free(dom);
5269 isl_aff_list_free(list);
5273 /* Given a one-dimensional basic set, compute the maximum of that
5274 * dimension as an isl_pw_aff.
5276 * The isl_pw_aff is constructed by having isl_basic_set_foreach_lexmax
5277 * call update_dim_max on each leaf of the result.
5279 static __isl_give isl_pw_aff *basic_set_dim_max(__isl_keep isl_basic_set *bset)
5281 isl_dim *dim = isl_basic_set_get_dim(bset);
5285 dim = isl_dim_domain(isl_dim_from_range(dim));
5286 pwaff = isl_pw_aff_empty(dim);
5288 r = isl_basic_set_foreach_lexmax(bset, &update_dim_max, &pwaff);
5290 return isl_pw_aff_free(pwaff);
5295 /* Compute the maximum of the given set dimension as a function of the
5296 * parameters, but independently of the other set dimensions.
5298 * We first project the set onto the given dimension and then compute
5299 * the "lexicographic" maximum in each basic set, combining the results
5300 * using isl_pw_aff_union_max.
5302 __isl_give isl_pw_aff *isl_set_dim_max(__isl_take isl_set *set, int pos)
5308 map = isl_map_from_domain(set);
5309 map = isl_map_add_dims(map, isl_dim_out, 1);
5310 map = isl_map_intersect(map,
5311 equate(isl_map_get_dim(map), isl_dim_in, pos,
5313 set = isl_map_range(map);
5318 isl_dim *dim = isl_set_get_dim(set);
5319 dim = isl_dim_domain(isl_dim_from_range(dim));
5321 return isl_pw_aff_empty(dim);
5324 pwaff = basic_set_dim_max(set->p[0]);
5325 for (i = 1; i < set->n; ++i) {
5326 isl_pw_aff *pwaff_i;
5328 pwaff_i = basic_set_dim_max(set->p[i]);
5329 pwaff = isl_pw_aff_union_max(pwaff, pwaff_i);
5337 /* Apply a preimage specified by "mat" on the parameters of "bset".
5338 * bset is assumed to have only parameters and divs.
5340 static struct isl_basic_set *basic_set_parameter_preimage(
5341 struct isl_basic_set *bset, struct isl_mat *mat)
5348 bset->dim = isl_dim_cow(bset->dim);
5352 nparam = isl_basic_set_dim(bset, isl_dim_param);
5354 isl_assert(bset->ctx, mat->n_row == 1 + nparam, goto error);
5356 bset->dim->nparam = 0;
5357 bset->dim->n_out = nparam;
5358 bset = isl_basic_set_preimage(bset, mat);
5360 bset->dim->nparam = bset->dim->n_out;
5361 bset->dim->n_out = 0;
5366 isl_basic_set_free(bset);
5370 /* Apply a preimage specified by "mat" on the parameters of "set".
5371 * set is assumed to have only parameters and divs.
5373 static struct isl_set *set_parameter_preimage(
5374 struct isl_set *set, struct isl_mat *mat)
5376 struct isl_dim *dim = NULL;
5382 dim = isl_dim_copy(set->dim);
5383 dim = isl_dim_cow(dim);
5387 nparam = isl_set_dim(set, isl_dim_param);
5389 isl_assert(set->ctx, mat->n_row == 1 + nparam, goto error);
5392 dim->n_out = nparam;
5393 isl_set_reset_dim(set, dim);
5394 set = isl_set_preimage(set, mat);
5397 dim = isl_dim_copy(set->dim);
5398 dim = isl_dim_cow(dim);
5401 dim->nparam = dim->n_out;
5403 isl_set_reset_dim(set, dim);
5413 /* Intersect the basic set "bset" with the affine space specified by the
5414 * equalities in "eq".
5416 static struct isl_basic_set *basic_set_append_equalities(
5417 struct isl_basic_set *bset, struct isl_mat *eq)
5425 bset = isl_basic_set_extend_dim(bset, isl_dim_copy(bset->dim), 0,
5430 len = 1 + isl_dim_total(bset->dim) + bset->extra;
5431 for (i = 0; i < eq->n_row; ++i) {
5432 k = isl_basic_set_alloc_equality(bset);
5435 isl_seq_cpy(bset->eq[k], eq->row[i], eq->n_col);
5436 isl_seq_clr(bset->eq[k] + eq->n_col, len - eq->n_col);
5440 bset = isl_basic_set_gauss(bset, NULL);
5441 bset = isl_basic_set_finalize(bset);
5446 isl_basic_set_free(bset);
5450 /* Intersect the set "set" with the affine space specified by the
5451 * equalities in "eq".
5453 static struct isl_set *set_append_equalities(struct isl_set *set,
5461 for (i = 0; i < set->n; ++i) {
5462 set->p[i] = basic_set_append_equalities(set->p[i],
5475 /* Project the given basic set onto its parameter domain, possibly introducing
5476 * new, explicit, existential variables in the constraints.
5477 * The input has parameters and (possibly implicit) existential variables.
5478 * The output has the same parameters, but only
5479 * explicit existentially quantified variables.
5481 * The actual projection is performed by pip, but pip doesn't seem
5482 * to like equalities very much, so we first remove the equalities
5483 * among the parameters by performing a variable compression on
5484 * the parameters. Afterward, an inverse transformation is performed
5485 * and the equalities among the parameters are inserted back in.
5487 static struct isl_set *parameter_compute_divs(struct isl_basic_set *bset)
5491 struct isl_mat *T, *T2;
5492 struct isl_set *set;
5493 unsigned nparam, n_div;
5495 bset = isl_basic_set_cow(bset);
5499 if (bset->n_eq == 0)
5500 return isl_basic_set_lexmin(bset);
5502 isl_basic_set_gauss(bset, NULL);
5504 nparam = isl_basic_set_dim(bset, isl_dim_param);
5505 n_div = isl_basic_set_dim(bset, isl_dim_div);
5507 for (i = 0, j = n_div - 1; i < bset->n_eq && j >= 0; --j) {
5508 if (!isl_int_is_zero(bset->eq[i][1 + nparam + j]))
5511 if (i == bset->n_eq)
5512 return isl_basic_set_lexmin(bset);
5514 eq = isl_mat_sub_alloc6(bset->ctx, bset->eq, i, bset->n_eq - i,
5516 eq = isl_mat_cow(eq);
5517 T = isl_mat_variable_compression(isl_mat_copy(eq), &T2);
5518 if (T && T->n_col == 0) {
5522 bset = isl_basic_set_set_to_empty(bset);
5523 return isl_set_from_basic_set(bset);
5525 bset = basic_set_parameter_preimage(bset, T);
5527 set = isl_basic_set_lexmin(bset);
5528 set = set_parameter_preimage(set, T2);
5529 set = set_append_equalities(set, eq);
5533 /* Compute an explicit representation for all the existentially
5534 * quantified variables.
5535 * The input and output dimensions are first turned into parameters.
5536 * compute_divs then returns a map with the same parameters and
5537 * no input or output dimensions and the dimension specification
5538 * is reset to that of the input.
5540 static struct isl_map *compute_divs(struct isl_basic_map *bmap)
5542 struct isl_basic_set *bset;
5543 struct isl_set *set;
5544 struct isl_map *map;
5545 struct isl_dim *dim, *orig_dim = NULL;
5550 bmap = isl_basic_map_cow(bmap);
5554 nparam = isl_basic_map_dim(bmap, isl_dim_param);
5555 n_in = isl_basic_map_dim(bmap, isl_dim_in);
5556 n_out = isl_basic_map_dim(bmap, isl_dim_out);
5557 dim = isl_dim_set_alloc(bmap->ctx, nparam + n_in + n_out, 0);
5561 orig_dim = bmap->dim;
5563 bset = (struct isl_basic_set *)bmap;
5565 set = parameter_compute_divs(bset);
5566 map = (struct isl_map *)set;
5567 map = isl_map_reset_dim(map, orig_dim);
5571 isl_basic_map_free(bmap);
5575 int isl_basic_map_divs_known(__isl_keep isl_basic_map *bmap)
5583 off = isl_dim_total(bmap->dim);
5584 for (i = 0; i < bmap->n_div; ++i) {
5585 if (isl_int_is_zero(bmap->div[i][0]))
5587 isl_assert(bmap->ctx, isl_int_is_zero(bmap->div[i][1+1+off+i]),
5593 static int map_divs_known(__isl_keep isl_map *map)
5600 for (i = 0; i < map->n; ++i) {
5601 int known = isl_basic_map_divs_known(map->p[i]);
5609 /* If bmap contains any unknown divs, then compute explicit
5610 * expressions for them. However, this computation may be
5611 * quite expensive, so first try to remove divs that aren't
5614 struct isl_map *isl_basic_map_compute_divs(struct isl_basic_map *bmap)
5617 struct isl_map *map;
5619 known = isl_basic_map_divs_known(bmap);
5623 return isl_map_from_basic_map(bmap);
5625 bmap = isl_basic_map_drop_redundant_divs(bmap);
5627 known = isl_basic_map_divs_known(bmap);
5631 return isl_map_from_basic_map(bmap);
5633 map = compute_divs(bmap);
5636 isl_basic_map_free(bmap);
5640 struct isl_map *isl_map_compute_divs(struct isl_map *map)
5644 struct isl_map *res;
5651 known = map_divs_known(map);
5659 res = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[0]));
5660 for (i = 1 ; i < map->n; ++i) {
5662 r2 = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[i]));
5663 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT))
5664 res = isl_map_union_disjoint(res, r2);
5666 res = isl_map_union(res, r2);
5673 struct isl_set *isl_basic_set_compute_divs(struct isl_basic_set *bset)
5675 return (struct isl_set *)
5676 isl_basic_map_compute_divs((struct isl_basic_map *)bset);
5679 struct isl_set *isl_set_compute_divs(struct isl_set *set)
5681 return (struct isl_set *)
5682 isl_map_compute_divs((struct isl_map *)set);
5685 struct isl_set *isl_map_domain(struct isl_map *map)
5688 struct isl_set *set;
5693 map = isl_map_cow(map);
5697 set = (struct isl_set *)map;
5698 set->dim = isl_dim_domain(set->dim);
5701 for (i = 0; i < map->n; ++i) {
5702 set->p[i] = isl_basic_map_domain(map->p[i]);
5706 ISL_F_CLR(set, ISL_MAP_DISJOINT);
5707 ISL_F_CLR(set, ISL_SET_NORMALIZED);
5714 static __isl_give isl_map *map_union_disjoint(__isl_take isl_map *map1,
5715 __isl_take isl_map *map2)
5719 struct isl_map *map = NULL;
5733 isl_assert(map1->ctx, isl_dim_equal(map1->dim, map2->dim), goto error);
5735 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
5736 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
5737 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
5739 map = isl_map_alloc_dim(isl_dim_copy(map1->dim),
5740 map1->n + map2->n, flags);
5743 for (i = 0; i < map1->n; ++i) {
5744 map = isl_map_add_basic_map(map,
5745 isl_basic_map_copy(map1->p[i]));
5749 for (i = 0; i < map2->n; ++i) {
5750 map = isl_map_add_basic_map(map,
5751 isl_basic_map_copy(map2->p[i]));
5765 __isl_give isl_map *isl_map_union_disjoint(__isl_take isl_map *map1,
5766 __isl_take isl_map *map2)
5768 return isl_map_align_params_map_map_and(map1, map2, &map_union_disjoint);
5771 struct isl_map *isl_map_union(struct isl_map *map1, struct isl_map *map2)
5773 map1 = isl_map_union_disjoint(map1, map2);
5777 ISL_F_CLR(map1, ISL_MAP_DISJOINT);
5781 struct isl_set *isl_set_union_disjoint(
5782 struct isl_set *set1, struct isl_set *set2)
5784 return (struct isl_set *)
5785 isl_map_union_disjoint(
5786 (struct isl_map *)set1, (struct isl_map *)set2);
5789 struct isl_set *isl_set_union(struct isl_set *set1, struct isl_set *set2)
5791 return (struct isl_set *)
5792 isl_map_union((struct isl_map *)set1, (struct isl_map *)set2);
5795 static __isl_give isl_map *map_intersect_range(__isl_take isl_map *map,
5796 __isl_take isl_set *set)
5799 struct isl_map *result;
5805 if (!isl_dim_match(map->dim, isl_dim_param, set->dim, isl_dim_param))
5806 isl_die(set->ctx, isl_error_invalid,
5807 "parameters don't match", goto error);
5809 if (isl_dim_size(set->dim, isl_dim_set) != 0 &&
5810 !isl_map_compatible_range(map, set))
5811 isl_die(set->ctx, isl_error_invalid,
5812 "incompatible spaces", goto error);
5814 if (isl_set_plain_is_universe(set)) {
5819 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT) &&
5820 ISL_F_ISSET(set, ISL_MAP_DISJOINT))
5821 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
5823 result = isl_map_alloc_dim(isl_dim_copy(map->dim),
5824 map->n * set->n, flags);
5827 for (i = 0; i < map->n; ++i)
5828 for (j = 0; j < set->n; ++j) {
5829 result = isl_map_add_basic_map(result,
5830 isl_basic_map_intersect_range(
5831 isl_basic_map_copy(map->p[i]),
5832 isl_basic_set_copy(set->p[j])));
5845 __isl_give isl_map *isl_map_intersect_range(__isl_take isl_map *map,
5846 __isl_take isl_set *set)
5848 return isl_map_align_params_map_map_and(map, set, &map_intersect_range);
5851 struct isl_map *isl_map_intersect_domain(
5852 struct isl_map *map, struct isl_set *set)
5854 return isl_map_reverse(
5855 isl_map_intersect_range(isl_map_reverse(map), set));
5858 static __isl_give isl_map *map_apply_domain(__isl_take isl_map *map1,
5859 __isl_take isl_map *map2)
5863 map1 = isl_map_reverse(map1);
5864 map1 = isl_map_apply_range(map1, map2);
5865 return isl_map_reverse(map1);
5872 __isl_give isl_map *isl_map_apply_domain(__isl_take isl_map *map1,
5873 __isl_take isl_map *map2)
5875 return isl_map_align_params_map_map_and(map1, map2, &map_apply_domain);
5878 static __isl_give isl_map *map_apply_range(__isl_take isl_map *map1,
5879 __isl_take isl_map *map2)
5881 struct isl_dim *dim_result;
5882 struct isl_map *result;
5888 dim_result = isl_dim_join(isl_dim_copy(map1->dim),
5889 isl_dim_copy(map2->dim));
5891 result = isl_map_alloc_dim(dim_result, map1->n * map2->n, 0);
5894 for (i = 0; i < map1->n; ++i)
5895 for (j = 0; j < map2->n; ++j) {
5896 result = isl_map_add_basic_map(result,
5897 isl_basic_map_apply_range(
5898 isl_basic_map_copy(map1->p[i]),
5899 isl_basic_map_copy(map2->p[j])));
5905 if (result && result->n <= 1)
5906 ISL_F_SET(result, ISL_MAP_DISJOINT);
5914 __isl_give isl_map *isl_map_apply_range(__isl_take isl_map *map1,
5915 __isl_take isl_map *map2)
5917 return isl_map_align_params_map_map_and(map1, map2, &map_apply_range);
5921 * returns range - domain
5923 struct isl_basic_set *isl_basic_map_deltas(struct isl_basic_map *bmap)
5925 isl_dim *dims, *target_dim;
5926 struct isl_basic_set *bset;
5933 isl_assert(bmap->ctx, isl_dim_tuple_match(bmap->dim, isl_dim_in,
5934 bmap->dim, isl_dim_out),
5936 target_dim = isl_dim_domain(isl_basic_map_get_dim(bmap));
5937 dim = isl_basic_map_n_in(bmap);
5938 nparam = isl_basic_map_n_param(bmap);
5939 bset = isl_basic_set_from_basic_map(bmap);
5940 bset = isl_basic_set_cow(bset);
5941 dims = isl_basic_set_get_dim(bset);
5942 dims = isl_dim_add(dims, isl_dim_set, dim);
5943 bset = isl_basic_set_extend_dim(bset, dims, 0, dim, 0);
5944 bset = isl_basic_set_swap_vars(bset, 2*dim);
5945 for (i = 0; i < dim; ++i) {
5946 int j = isl_basic_map_alloc_equality(
5947 (struct isl_basic_map *)bset);
5950 isl_seq_clr(bset->eq[j], 1 + isl_basic_set_total_dim(bset));
5951 isl_int_set_si(bset->eq[j][1+nparam+i], 1);
5952 isl_int_set_si(bset->eq[j][1+nparam+dim+i], 1);
5953 isl_int_set_si(bset->eq[j][1+nparam+2*dim+i], -1);
5955 bset = isl_basic_set_project_out(bset, isl_dim_set, dim, 2*dim);
5956 bset = isl_basic_set_reset_dim(bset, target_dim);
5959 isl_basic_map_free(bmap);
5964 * returns range - domain
5966 struct isl_set *isl_map_deltas(struct isl_map *map)
5970 struct isl_set *result;
5975 isl_assert(map->ctx, isl_dim_tuple_match(map->dim, isl_dim_in,
5976 map->dim, isl_dim_out),
5978 dim = isl_map_get_dim(map);
5979 dim = isl_dim_domain(dim);
5980 result = isl_set_alloc_dim(dim, map->n, 0);
5983 for (i = 0; i < map->n; ++i)
5984 result = isl_set_add_basic_set(result,
5985 isl_basic_map_deltas(isl_basic_map_copy(map->p[i])));
5994 * returns [domain -> range] -> range - domain
5996 __isl_give isl_basic_map *isl_basic_map_deltas_map(
5997 __isl_take isl_basic_map *bmap)
6001 isl_basic_map *domain;
6005 if (!isl_dim_tuple_match(bmap->dim, isl_dim_in, bmap->dim, isl_dim_out))
6006 isl_die(bmap->ctx, isl_error_invalid,
6007 "domain and range don't match", goto error);
6009 nparam = isl_basic_map_dim(bmap, isl_dim_param);
6010 n = isl_basic_map_dim(bmap, isl_dim_in);
6012 dim = isl_dim_from_range(isl_dim_domain(isl_basic_map_get_dim(bmap)));
6013 domain = isl_basic_map_universe(dim);
6015 bmap = isl_basic_map_from_domain(isl_basic_map_wrap(bmap));
6016 bmap = isl_basic_map_apply_range(bmap, domain);
6017 bmap = isl_basic_map_extend_constraints(bmap, n, 0);
6019 total = isl_basic_map_total_dim(bmap);
6021 for (i = 0; i < n; ++i) {
6022 k = isl_basic_map_alloc_equality(bmap);
6025 isl_seq_clr(bmap->eq[k], 1 + total);
6026 isl_int_set_si(bmap->eq[k][1 + nparam + i], 1);
6027 isl_int_set_si(bmap->eq[k][1 + nparam + n + i], -1);
6028 isl_int_set_si(bmap->eq[k][1 + nparam + n + n + i], 1);
6031 bmap = isl_basic_map_gauss(bmap, NULL);
6032 return isl_basic_map_finalize(bmap);
6034 isl_basic_map_free(bmap);
6039 * returns [domain -> range] -> range - domain
6041 __isl_give isl_map *isl_map_deltas_map(__isl_take isl_map *map)
6044 isl_dim *domain_dim;
6049 if (!isl_dim_tuple_match(map->dim, isl_dim_in, map->dim, isl_dim_out))
6050 isl_die(map->ctx, isl_error_invalid,
6051 "domain and range don't match", goto error);
6053 map = isl_map_cow(map);
6057 domain_dim = isl_dim_from_range(isl_dim_domain(isl_map_get_dim(map)));
6058 map->dim = isl_dim_from_domain(isl_dim_wrap(map->dim));
6059 map->dim = isl_dim_join(map->dim, domain_dim);
6062 for (i = 0; i < map->n; ++i) {
6063 map->p[i] = isl_basic_map_deltas_map(map->p[i]);
6067 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
6074 static struct isl_basic_map *basic_map_identity(struct isl_dim *dims)
6076 struct isl_basic_map *bmap;
6084 nparam = dims->nparam;
6086 bmap = isl_basic_map_alloc_dim(dims, 0, dim, 0);
6090 for (i = 0; i < dim; ++i) {
6091 int j = isl_basic_map_alloc_equality(bmap);
6094 isl_seq_clr(bmap->eq[j], 1 + isl_basic_map_total_dim(bmap));
6095 isl_int_set_si(bmap->eq[j][1+nparam+i], 1);
6096 isl_int_set_si(bmap->eq[j][1+nparam+dim+i], -1);
6098 return isl_basic_map_finalize(bmap);
6100 isl_basic_map_free(bmap);
6104 __isl_give isl_basic_map *isl_basic_map_identity(__isl_take isl_dim *dim)
6108 if (dim->n_in != dim->n_out)
6109 isl_die(dim->ctx, isl_error_invalid,
6110 "number of input and output dimensions needs to be "
6111 "the same", goto error);
6112 return basic_map_identity(dim);
6118 struct isl_basic_map *isl_basic_map_identity_like(struct isl_basic_map *model)
6120 if (!model || !model->dim)
6122 return isl_basic_map_identity(isl_dim_copy(model->dim));
6125 __isl_give isl_map *isl_map_identity(__isl_take isl_dim *dim)
6127 return isl_map_from_basic_map(isl_basic_map_identity(dim));
6130 struct isl_map *isl_map_identity_like(struct isl_map *model)
6132 if (!model || !model->dim)
6134 return isl_map_identity(isl_dim_copy(model->dim));
6137 struct isl_map *isl_map_identity_like_basic_map(struct isl_basic_map *model)
6139 if (!model || !model->dim)
6141 return isl_map_identity(isl_dim_copy(model->dim));
6144 __isl_give isl_map *isl_set_identity(__isl_take isl_set *set)
6146 isl_dim *dim = isl_set_get_dim(set);
6148 id = isl_map_identity(isl_dim_map_from_set(dim));
6149 return isl_map_intersect_range(id, set);
6152 /* Construct a basic set with all set dimensions having only non-negative
6155 struct isl_basic_set *isl_basic_set_positive_orthant(struct isl_dim *dims)
6160 struct isl_basic_set *bset;
6164 nparam = dims->nparam;
6166 bset = isl_basic_set_alloc_dim(dims, 0, 0, dim);
6169 for (i = 0; i < dim; ++i) {
6170 int k = isl_basic_set_alloc_inequality(bset);
6173 isl_seq_clr(bset->ineq[k], 1 + isl_basic_set_total_dim(bset));
6174 isl_int_set_si(bset->ineq[k][1 + nparam + i], 1);
6178 isl_basic_set_free(bset);
6182 /* Construct the half-space x_pos >= 0.
6184 static __isl_give isl_basic_set *nonneg_halfspace(__isl_take isl_dim *dim,
6188 isl_basic_set *nonneg;
6190 nonneg = isl_basic_set_alloc_dim(dim, 0, 0, 1);
6191 k = isl_basic_set_alloc_inequality(nonneg);
6194 isl_seq_clr(nonneg->ineq[k], 1 + isl_basic_set_total_dim(nonneg));
6195 isl_int_set_si(nonneg->ineq[k][pos], 1);
6197 return isl_basic_set_finalize(nonneg);
6199 isl_basic_set_free(nonneg);
6203 /* Construct the half-space x_pos <= -1.
6205 static __isl_give isl_basic_set *neg_halfspace(__isl_take isl_dim *dim, int pos)
6210 neg = isl_basic_set_alloc_dim(dim, 0, 0, 1);
6211 k = isl_basic_set_alloc_inequality(neg);
6214 isl_seq_clr(neg->ineq[k], 1 + isl_basic_set_total_dim(neg));
6215 isl_int_set_si(neg->ineq[k][0], -1);
6216 isl_int_set_si(neg->ineq[k][pos], -1);
6218 return isl_basic_set_finalize(neg);
6220 isl_basic_set_free(neg);
6224 __isl_give isl_set *isl_set_split_dims(__isl_take isl_set *set,
6225 enum isl_dim_type type, unsigned first, unsigned n)
6228 isl_basic_set *nonneg;
6236 isl_assert(set->ctx, first + n <= isl_set_dim(set, type), goto error);
6238 for (i = 0; i < n; ++i) {
6239 nonneg = nonneg_halfspace(isl_set_get_dim(set),
6240 pos(set->dim, type) + first + i);
6241 neg = neg_halfspace(isl_set_get_dim(set),
6242 pos(set->dim, type) + first + i);
6244 set = isl_set_intersect(set, isl_basic_set_union(nonneg, neg));
6253 static int foreach_orthant(__isl_take isl_set *set, int *signs, int first,
6254 int len, int (*fn)(__isl_take isl_set *orthant, int *signs, void *user),
6261 if (isl_set_plain_is_empty(set)) {
6266 return fn(set, signs, user);
6269 half = isl_set_from_basic_set(nonneg_halfspace(isl_set_get_dim(set),
6271 half = isl_set_intersect(half, isl_set_copy(set));
6272 if (foreach_orthant(half, signs, first + 1, len, fn, user) < 0)
6276 half = isl_set_from_basic_set(neg_halfspace(isl_set_get_dim(set),
6278 half = isl_set_intersect(half, set);
6279 return foreach_orthant(half, signs, first + 1, len, fn, user);
6285 /* Call "fn" on the intersections of "set" with each of the orthants
6286 * (except for obviously empty intersections). The orthant is identified
6287 * by the signs array, with each entry having value 1 or -1 according
6288 * to the sign of the corresponding variable.
6290 int isl_set_foreach_orthant(__isl_keep isl_set *set,
6291 int (*fn)(__isl_take isl_set *orthant, int *signs, void *user),
6301 if (isl_set_plain_is_empty(set))
6304 nparam = isl_set_dim(set, isl_dim_param);
6305 nvar = isl_set_dim(set, isl_dim_set);
6307 signs = isl_alloc_array(set->ctx, int, nparam + nvar);
6309 r = foreach_orthant(isl_set_copy(set), signs, 0, nparam + nvar,
6317 int isl_set_is_equal(struct isl_set *set1, struct isl_set *set2)
6319 return isl_map_is_equal((struct isl_map *)set1, (struct isl_map *)set2);
6322 int isl_basic_map_is_subset(
6323 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
6326 struct isl_map *map1;
6327 struct isl_map *map2;
6329 if (!bmap1 || !bmap2)
6332 map1 = isl_map_from_basic_map(isl_basic_map_copy(bmap1));
6333 map2 = isl_map_from_basic_map(isl_basic_map_copy(bmap2));
6335 is_subset = isl_map_is_subset(map1, map2);
6343 int isl_basic_map_is_equal(
6344 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
6348 if (!bmap1 || !bmap2)
6350 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
6353 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
6357 int isl_basic_set_is_equal(
6358 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
6360 return isl_basic_map_is_equal(
6361 (struct isl_basic_map *)bset1, (struct isl_basic_map *)bset2);
6364 int isl_map_is_empty(struct isl_map *map)
6371 for (i = 0; i < map->n; ++i) {
6372 is_empty = isl_basic_map_is_empty(map->p[i]);
6381 int isl_map_plain_is_empty(__isl_keep isl_map *map)
6383 return map ? map->n == 0 : -1;
6386 int isl_map_fast_is_empty(__isl_keep isl_map *map)
6388 return isl_map_plain_is_empty(map);
6391 int isl_set_plain_is_empty(struct isl_set *set)
6393 return set ? set->n == 0 : -1;
6396 int isl_set_fast_is_empty(__isl_keep isl_set *set)
6398 return isl_set_plain_is_empty(set);
6401 int isl_set_is_empty(struct isl_set *set)
6403 return isl_map_is_empty((struct isl_map *)set);
6406 int isl_map_has_equal_dim(__isl_keep isl_map *map1, __isl_keep isl_map *map2)
6411 return isl_dim_equal(map1->dim, map2->dim);
6414 int isl_set_has_equal_dim(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
6419 return isl_dim_equal(set1->dim, set2->dim);
6422 static int map_is_equal(__isl_keep isl_map *map1, __isl_keep isl_map *map2)
6428 is_subset = isl_map_is_subset(map1, map2);
6431 is_subset = isl_map_is_subset(map2, map1);
6435 int isl_map_is_equal(__isl_keep isl_map *map1, __isl_keep isl_map *map2)
6437 return align_params_map_map_and_test(map1, map2, &map_is_equal);
6440 int isl_basic_map_is_strict_subset(
6441 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
6445 if (!bmap1 || !bmap2)
6447 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
6450 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
6451 if (is_subset == -1)
6456 int isl_map_is_strict_subset(struct isl_map *map1, struct isl_map *map2)
6462 is_subset = isl_map_is_subset(map1, map2);
6465 is_subset = isl_map_is_subset(map2, map1);
6466 if (is_subset == -1)
6471 int isl_set_is_strict_subset(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
6473 return isl_map_is_strict_subset((isl_map *)set1, (isl_map *)set2);
6476 int isl_basic_map_is_universe(struct isl_basic_map *bmap)
6480 return bmap->n_eq == 0 && bmap->n_ineq == 0;
6483 int isl_basic_set_is_universe(struct isl_basic_set *bset)
6487 return bset->n_eq == 0 && bset->n_ineq == 0;
6490 int isl_map_plain_is_universe(__isl_keep isl_map *map)
6497 for (i = 0; i < map->n; ++i) {
6498 int r = isl_basic_map_is_universe(map->p[i]);
6506 int isl_set_plain_is_universe(__isl_keep isl_set *set)
6508 return isl_map_plain_is_universe((isl_map *) set);
6511 int isl_set_fast_is_universe(__isl_keep isl_set *set)
6513 return isl_set_plain_is_universe(set);
6516 int isl_basic_map_is_empty(struct isl_basic_map *bmap)
6518 struct isl_basic_set *bset = NULL;
6519 struct isl_vec *sample = NULL;
6526 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY))
6529 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL)) {
6530 struct isl_basic_map *copy = isl_basic_map_copy(bmap);
6531 copy = isl_basic_map_remove_redundancies(copy);
6532 empty = ISL_F_ISSET(copy, ISL_BASIC_MAP_EMPTY);
6533 isl_basic_map_free(copy);
6537 total = 1 + isl_basic_map_total_dim(bmap);
6538 if (bmap->sample && bmap->sample->size == total) {
6539 int contains = isl_basic_map_contains(bmap, bmap->sample);
6545 isl_vec_free(bmap->sample);
6546 bmap->sample = NULL;
6547 bset = isl_basic_map_underlying_set(isl_basic_map_copy(bmap));
6550 sample = isl_basic_set_sample_vec(bset);
6553 empty = sample->size == 0;
6554 isl_vec_free(bmap->sample);
6555 bmap->sample = sample;
6557 ISL_F_SET(bmap, ISL_BASIC_MAP_EMPTY);
6562 int isl_basic_map_plain_is_empty(__isl_keep isl_basic_map *bmap)
6566 return ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY);
6569 int isl_basic_map_fast_is_empty(__isl_keep isl_basic_map *bmap)
6571 return isl_basic_map_plain_is_empty(bmap);
6574 int isl_basic_set_plain_is_empty(__isl_keep isl_basic_set *bset)
6578 return ISL_F_ISSET(bset, ISL_BASIC_SET_EMPTY);
6581 int isl_basic_set_fast_is_empty(__isl_keep isl_basic_set *bset)
6583 return isl_basic_set_plain_is_empty(bset);
6586 int isl_basic_set_is_empty(struct isl_basic_set *bset)
6588 return isl_basic_map_is_empty((struct isl_basic_map *)bset);
6591 struct isl_map *isl_basic_map_union(
6592 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
6594 struct isl_map *map;
6595 if (!bmap1 || !bmap2)
6598 isl_assert(bmap1->ctx, isl_dim_equal(bmap1->dim, bmap2->dim), goto error);
6600 map = isl_map_alloc_dim(isl_dim_copy(bmap1->dim), 2, 0);
6603 map = isl_map_add_basic_map(map, bmap1);
6604 map = isl_map_add_basic_map(map, bmap2);
6607 isl_basic_map_free(bmap1);
6608 isl_basic_map_free(bmap2);
6612 struct isl_set *isl_basic_set_union(
6613 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
6615 return (struct isl_set *)isl_basic_map_union(
6616 (struct isl_basic_map *)bset1,
6617 (struct isl_basic_map *)bset2);
6620 /* Order divs such that any div only depends on previous divs */
6621 struct isl_basic_map *isl_basic_map_order_divs(struct isl_basic_map *bmap)
6629 off = isl_dim_total(bmap->dim);
6631 for (i = 0; i < bmap->n_div; ++i) {
6633 if (isl_int_is_zero(bmap->div[i][0]))
6635 pos = isl_seq_first_non_zero(bmap->div[i]+1+1+off+i,
6639 isl_basic_map_swap_div(bmap, i, i + pos);
6645 struct isl_basic_set *isl_basic_set_order_divs(struct isl_basic_set *bset)
6647 return (struct isl_basic_set *)
6648 isl_basic_map_order_divs((struct isl_basic_map *)bset);
6651 __isl_give isl_map *isl_map_order_divs(__isl_take isl_map *map)
6658 for (i = 0; i < map->n; ++i) {
6659 map->p[i] = isl_basic_map_order_divs(map->p[i]);
6670 /* Apply the expansion computed by isl_merge_divs.
6671 * The expansion itself is given by "exp" while the resulting
6672 * list of divs is given by "div".
6674 __isl_give isl_basic_set *isl_basic_set_expand_divs(
6675 __isl_take isl_basic_set *bset, __isl_take isl_mat *div, int *exp)
6680 bset = isl_basic_set_cow(bset);
6684 if (div->n_row < bset->n_div)
6685 isl_die(isl_mat_get_ctx(div), isl_error_invalid,
6686 "not an expansion", goto error);
6688 bset = isl_basic_map_extend_dim(bset, isl_dim_copy(bset->dim),
6689 div->n_row - bset->n_div, 0,
6690 2 * (div->n_row - bset->n_div));
6692 n_div = bset->n_div;
6693 for (i = n_div; i < div->n_row; ++i)
6694 if (isl_basic_set_alloc_div(bset) < 0)
6698 for (i = div->n_row - 1; i >= 0; --i) {
6699 if (j >= 0 && exp[j] == i) {
6701 isl_basic_map_swap_div(bset, i, j);
6704 isl_seq_cpy(bset->div[i], div->row[i], div->n_col);
6705 if (isl_basic_map_add_div_constraints(bset, i) < 0)
6713 isl_basic_set_free(bset);
6718 /* Look for a div in dst that corresponds to the div "div" in src.
6719 * The divs before "div" in src and dst are assumed to be the same.
6721 * Returns -1 if no corresponding div was found and the position
6722 * of the corresponding div in dst otherwise.
6724 static int find_div(struct isl_basic_map *dst,
6725 struct isl_basic_map *src, unsigned div)
6729 unsigned total = isl_dim_total(src->dim);
6731 isl_assert(dst->ctx, div <= dst->n_div, return -1);
6732 for (i = div; i < dst->n_div; ++i)
6733 if (isl_seq_eq(dst->div[i], src->div[div], 1+1+total+div) &&
6734 isl_seq_first_non_zero(dst->div[i]+1+1+total+div,
6735 dst->n_div - div) == -1)
6740 struct isl_basic_map *isl_basic_map_align_divs(
6741 struct isl_basic_map *dst, struct isl_basic_map *src)
6744 unsigned total = isl_dim_total(src->dim);
6749 if (src->n_div == 0)
6752 for (i = 0; i < src->n_div; ++i)
6753 isl_assert(src->ctx, !isl_int_is_zero(src->div[i][0]), goto error);
6755 src = isl_basic_map_order_divs(src);
6756 dst = isl_basic_map_cow(dst);
6757 dst = isl_basic_map_extend_dim(dst, isl_dim_copy(dst->dim),
6758 src->n_div, 0, 2 * src->n_div);
6761 for (i = 0; i < src->n_div; ++i) {
6762 int j = find_div(dst, src, i);
6764 j = isl_basic_map_alloc_div(dst);
6767 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total+i);
6768 isl_seq_clr(dst->div[j]+1+1+total+i, dst->n_div - i);
6769 if (isl_basic_map_add_div_constraints(dst, j) < 0)
6773 isl_basic_map_swap_div(dst, i, j);
6777 isl_basic_map_free(dst);
6781 struct isl_basic_set *isl_basic_set_align_divs(
6782 struct isl_basic_set *dst, struct isl_basic_set *src)
6784 return (struct isl_basic_set *)isl_basic_map_align_divs(
6785 (struct isl_basic_map *)dst, (struct isl_basic_map *)src);
6788 struct isl_map *isl_map_align_divs(struct isl_map *map)
6796 map = isl_map_compute_divs(map);
6797 map = isl_map_cow(map);
6801 for (i = 1; i < map->n; ++i)
6802 map->p[0] = isl_basic_map_align_divs(map->p[0], map->p[i]);
6803 for (i = 1; i < map->n; ++i)
6804 map->p[i] = isl_basic_map_align_divs(map->p[i], map->p[0]);
6806 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
6810 struct isl_set *isl_set_align_divs(struct isl_set *set)
6812 return (struct isl_set *)isl_map_align_divs((struct isl_map *)set);
6815 static __isl_give isl_set *set_apply( __isl_take isl_set *set,
6816 __isl_take isl_map *map)
6820 isl_assert(set->ctx, isl_map_compatible_domain(map, set), goto error);
6821 map = isl_map_intersect_domain(map, set);
6822 set = isl_map_range(map);
6830 __isl_give isl_set *isl_set_apply( __isl_take isl_set *set,
6831 __isl_take isl_map *map)
6833 return isl_map_align_params_map_map_and(set, map, &set_apply);
6836 /* There is no need to cow as removing empty parts doesn't change
6837 * the meaning of the set.
6839 struct isl_map *isl_map_remove_empty_parts(struct isl_map *map)
6846 for (i = map->n-1; i >= 0; --i) {
6847 if (!ISL_F_ISSET(map->p[i], ISL_BASIC_MAP_EMPTY))
6849 isl_basic_map_free(map->p[i]);
6850 if (i != map->n-1) {
6851 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
6852 map->p[i] = map->p[map->n-1];
6860 struct isl_set *isl_set_remove_empty_parts(struct isl_set *set)
6862 return (struct isl_set *)
6863 isl_map_remove_empty_parts((struct isl_map *)set);
6866 struct isl_basic_map *isl_map_copy_basic_map(struct isl_map *map)
6868 struct isl_basic_map *bmap;
6869 if (!map || map->n == 0)
6871 bmap = map->p[map->n-1];
6872 isl_assert(map->ctx, ISL_F_ISSET(bmap, ISL_BASIC_SET_FINAL), return NULL);
6873 return isl_basic_map_copy(bmap);
6876 struct isl_basic_set *isl_set_copy_basic_set(struct isl_set *set)
6878 return (struct isl_basic_set *)
6879 isl_map_copy_basic_map((struct isl_map *)set);
6882 __isl_give isl_map *isl_map_drop_basic_map(__isl_take isl_map *map,
6883 __isl_keep isl_basic_map *bmap)
6889 for (i = map->n-1; i >= 0; --i) {
6890 if (map->p[i] != bmap)
6892 map = isl_map_cow(map);
6895 isl_basic_map_free(map->p[i]);
6896 if (i != map->n-1) {
6897 ISL_F_CLR(map, ISL_SET_NORMALIZED);
6898 map->p[i] = map->p[map->n-1];
6909 struct isl_set *isl_set_drop_basic_set(struct isl_set *set,
6910 struct isl_basic_set *bset)
6912 return (struct isl_set *)isl_map_drop_basic_map((struct isl_map *)set,
6913 (struct isl_basic_map *)bset);
6916 /* Given two basic sets bset1 and bset2, compute the maximal difference
6917 * between the values of dimension pos in bset1 and those in bset2
6918 * for any common value of the parameters and dimensions preceding pos.
6920 static enum isl_lp_result basic_set_maximal_difference_at(
6921 __isl_keep isl_basic_set *bset1, __isl_keep isl_basic_set *bset2,
6922 int pos, isl_int *opt)
6924 struct isl_dim *dims;
6925 struct isl_basic_map *bmap1 = NULL;
6926 struct isl_basic_map *bmap2 = NULL;
6927 struct isl_ctx *ctx;
6928 struct isl_vec *obj;
6931 unsigned dim1, dim2;
6932 enum isl_lp_result res;
6934 if (!bset1 || !bset2)
6935 return isl_lp_error;
6937 nparam = isl_basic_set_n_param(bset1);
6938 dim1 = isl_basic_set_n_dim(bset1);
6939 dim2 = isl_basic_set_n_dim(bset2);
6940 dims = isl_dim_alloc(bset1->ctx, nparam, pos, dim1 - pos);
6941 bmap1 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset1), dims);
6942 dims = isl_dim_alloc(bset2->ctx, nparam, pos, dim2 - pos);
6943 bmap2 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset2), dims);
6944 if (!bmap1 || !bmap2)
6946 bmap1 = isl_basic_map_cow(bmap1);
6947 bmap1 = isl_basic_map_extend(bmap1, nparam,
6948 pos, (dim1 - pos) + (dim2 - pos),
6949 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
6950 bmap1 = add_constraints(bmap1, bmap2, 0, dim1 - pos);
6953 total = isl_basic_map_total_dim(bmap1);
6955 obj = isl_vec_alloc(ctx, 1 + total);
6956 isl_seq_clr(obj->block.data, 1 + total);
6957 isl_int_set_si(obj->block.data[1+nparam+pos], 1);
6958 isl_int_set_si(obj->block.data[1+nparam+pos+(dim1-pos)], -1);
6961 res = isl_basic_map_solve_lp(bmap1, 1, obj->block.data, ctx->one,
6963 isl_basic_map_free(bmap1);
6967 isl_basic_map_free(bmap1);
6968 isl_basic_map_free(bmap2);
6969 return isl_lp_error;
6972 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
6973 * for any common value of the parameters and dimensions preceding pos
6974 * in both basic sets, the values of dimension pos in bset1 are
6975 * smaller or larger than those in bset2.
6978 * 1 if bset1 follows bset2
6979 * -1 if bset1 precedes bset2
6980 * 0 if bset1 and bset2 are incomparable
6981 * -2 if some error occurred.
6983 int isl_basic_set_compare_at(struct isl_basic_set *bset1,
6984 struct isl_basic_set *bset2, int pos)
6987 enum isl_lp_result res;
6992 res = basic_set_maximal_difference_at(bset1, bset2, pos, &opt);
6994 if (res == isl_lp_empty)
6996 else if ((res == isl_lp_ok && isl_int_is_pos(opt)) ||
6997 res == isl_lp_unbounded)
6999 else if (res == isl_lp_ok && isl_int_is_neg(opt))
7008 /* Given two basic sets bset1 and bset2, check whether
7009 * for any common value of the parameters and dimensions preceding pos
7010 * there is a value of dimension pos in bset1 that is larger
7011 * than a value of the same dimension in bset2.
7014 * 1 if there exists such a pair
7015 * 0 if there is no such pair, but there is a pair of equal values
7017 * -2 if some error occurred.
7019 int isl_basic_set_follows_at(__isl_keep isl_basic_set *bset1,
7020 __isl_keep isl_basic_set *bset2, int pos)
7023 enum isl_lp_result res;
7028 res = basic_set_maximal_difference_at(bset1, bset2, pos, &opt);
7030 if (res == isl_lp_empty)
7032 else if ((res == isl_lp_ok && isl_int_is_pos(opt)) ||
7033 res == isl_lp_unbounded)
7035 else if (res == isl_lp_ok && isl_int_is_neg(opt))
7037 else if (res == isl_lp_ok)
7046 /* Given two sets set1 and set2, check whether
7047 * for any common value of the parameters and dimensions preceding pos
7048 * there is a value of dimension pos in set1 that is larger
7049 * than a value of the same dimension in set2.
7052 * 1 if there exists such a pair
7053 * 0 if there is no such pair, but there is a pair of equal values
7055 * -2 if some error occurred.
7057 int isl_set_follows_at(__isl_keep isl_set *set1,
7058 __isl_keep isl_set *set2, int pos)
7066 for (i = 0; i < set1->n; ++i)
7067 for (j = 0; j < set2->n; ++j) {
7069 f = isl_basic_set_follows_at(set1->p[i], set2->p[j], pos);
7070 if (f == 1 || f == -2)
7079 static int isl_basic_map_plain_has_fixed_var(__isl_keep isl_basic_map *bmap,
7080 unsigned pos, isl_int *val)
7088 total = isl_basic_map_total_dim(bmap);
7089 for (i = 0, d = total-1; i < bmap->n_eq && d+1 > pos; ++i) {
7090 for (; d+1 > pos; --d)
7091 if (!isl_int_is_zero(bmap->eq[i][1+d]))
7095 if (isl_seq_first_non_zero(bmap->eq[i]+1, d) != -1)
7097 if (isl_seq_first_non_zero(bmap->eq[i]+1+d+1, total-d-1) != -1)
7099 if (!isl_int_is_one(bmap->eq[i][1+d]))
7102 isl_int_neg(*val, bmap->eq[i][0]);
7108 static int isl_map_plain_has_fixed_var(__isl_keep isl_map *map,
7109 unsigned pos, isl_int *val)
7121 return isl_basic_map_plain_has_fixed_var(map->p[0], pos, val);
7124 fixed = isl_basic_map_plain_has_fixed_var(map->p[0], pos, &v);
7125 for (i = 1; fixed == 1 && i < map->n; ++i) {
7126 fixed = isl_basic_map_plain_has_fixed_var(map->p[i], pos, &tmp);
7127 if (fixed == 1 && isl_int_ne(tmp, v))
7131 isl_int_set(*val, v);
7137 static int isl_basic_set_plain_has_fixed_var(__isl_keep isl_basic_set *bset,
7138 unsigned pos, isl_int *val)
7140 return isl_basic_map_plain_has_fixed_var((struct isl_basic_map *)bset,
7144 static int isl_set_plain_has_fixed_var(__isl_keep isl_set *set, unsigned pos,
7147 return isl_map_plain_has_fixed_var((struct isl_map *)set, pos, val);
7150 int isl_basic_map_plain_is_fixed(__isl_keep isl_basic_map *bmap,
7151 enum isl_dim_type type, unsigned pos, isl_int *val)
7153 if (pos >= isl_basic_map_dim(bmap, type))
7155 return isl_basic_map_plain_has_fixed_var(bmap,
7156 isl_basic_map_offset(bmap, type) - 1 + pos, val);
7159 int isl_map_plain_is_fixed(__isl_keep isl_map *map,
7160 enum isl_dim_type type, unsigned pos, isl_int *val)
7162 if (pos >= isl_map_dim(map, type))
7164 return isl_map_plain_has_fixed_var(map,
7165 map_offset(map, type) - 1 + pos, val);
7168 int isl_map_fast_is_fixed(__isl_keep isl_map *map,
7169 enum isl_dim_type type, unsigned pos, isl_int *val)
7171 return isl_map_plain_is_fixed(map, type, pos, val);
7174 /* Check if dimension dim has fixed value and if so and if val is not NULL,
7175 * then return this fixed value in *val.
7177 int isl_basic_set_plain_dim_is_fixed(__isl_keep isl_basic_set *bset,
7178 unsigned dim, isl_int *val)
7180 return isl_basic_set_plain_has_fixed_var(bset,
7181 isl_basic_set_n_param(bset) + dim, val);
7184 /* Check if dimension dim has fixed value and if so and if val is not NULL,
7185 * then return this fixed value in *val.
7187 int isl_set_plain_dim_is_fixed(__isl_keep isl_set *set,
7188 unsigned dim, isl_int *val)
7190 return isl_set_plain_has_fixed_var(set, isl_set_n_param(set) + dim, val);
7193 int isl_set_fast_dim_is_fixed(__isl_keep isl_set *set,
7194 unsigned dim, isl_int *val)
7196 return isl_set_plain_dim_is_fixed(set, dim, val);
7199 /* Check if input variable in has fixed value and if so and if val is not NULL,
7200 * then return this fixed value in *val.
7202 int isl_map_plain_input_is_fixed(__isl_keep isl_map *map,
7203 unsigned in, isl_int *val)
7205 return isl_map_plain_has_fixed_var(map, isl_map_n_param(map) + in, val);
7208 /* Check if dimension dim has an (obvious) fixed lower bound and if so
7209 * and if val is not NULL, then return this lower bound in *val.
7211 int isl_basic_set_plain_dim_has_fixed_lower_bound(
7212 __isl_keep isl_basic_set *bset, unsigned dim, isl_int *val)
7214 int i, i_eq = -1, i_ineq = -1;
7221 total = isl_basic_set_total_dim(bset);
7222 nparam = isl_basic_set_n_param(bset);
7223 for (i = 0; i < bset->n_eq; ++i) {
7224 if (isl_int_is_zero(bset->eq[i][1+nparam+dim]))
7230 for (i = 0; i < bset->n_ineq; ++i) {
7231 if (!isl_int_is_pos(bset->ineq[i][1+nparam+dim]))
7233 if (i_eq != -1 || i_ineq != -1)
7237 if (i_eq == -1 && i_ineq == -1)
7239 c = i_eq != -1 ? bset->eq[i_eq] : bset->ineq[i_ineq];
7240 /* The coefficient should always be one due to normalization. */
7241 if (!isl_int_is_one(c[1+nparam+dim]))
7243 if (isl_seq_first_non_zero(c+1, nparam+dim) != -1)
7245 if (isl_seq_first_non_zero(c+1+nparam+dim+1,
7246 total - nparam - dim - 1) != -1)
7249 isl_int_neg(*val, c[0]);
7253 int isl_set_plain_dim_has_fixed_lower_bound(__isl_keep isl_set *set,
7254 unsigned dim, isl_int *val)
7266 return isl_basic_set_plain_dim_has_fixed_lower_bound(set->p[0],
7270 fixed = isl_basic_set_plain_dim_has_fixed_lower_bound(set->p[0],
7272 for (i = 1; fixed == 1 && i < set->n; ++i) {
7273 fixed = isl_basic_set_plain_dim_has_fixed_lower_bound(set->p[i],
7275 if (fixed == 1 && isl_int_ne(tmp, v))
7279 isl_int_set(*val, v);
7290 /* uset_gist depends on constraints without existentially quantified
7291 * variables sorting first.
7293 static int qsort_constraint_cmp(const void *p1, const void *p2)
7295 const struct constraint *c1 = (const struct constraint *)p1;
7296 const struct constraint *c2 = (const struct constraint *)p2;
7298 unsigned size = isl_min(c1->size, c2->size);
7300 l1 = isl_seq_last_non_zero(c1->c, size);
7301 l2 = isl_seq_last_non_zero(c2->c, size);
7306 return isl_seq_cmp(c1->c, c2->c, size);
7309 static struct isl_basic_map *isl_basic_map_sort_constraints(
7310 struct isl_basic_map *bmap)
7313 struct constraint *c;
7318 total = isl_basic_map_total_dim(bmap);
7319 c = isl_alloc_array(bmap->ctx, struct constraint, bmap->n_ineq);
7322 for (i = 0; i < bmap->n_ineq; ++i) {
7324 c[i].c = bmap->ineq[i];
7326 qsort(c, bmap->n_ineq, sizeof(struct constraint), qsort_constraint_cmp);
7327 for (i = 0; i < bmap->n_ineq; ++i)
7328 bmap->ineq[i] = c[i].c;
7332 isl_basic_map_free(bmap);
7336 __isl_give isl_basic_set *isl_basic_set_sort_constraints(
7337 __isl_take isl_basic_set *bset)
7339 return (struct isl_basic_set *)isl_basic_map_sort_constraints(
7340 (struct isl_basic_map *)bset);
7343 struct isl_basic_map *isl_basic_map_normalize(struct isl_basic_map *bmap)
7347 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_NORMALIZED))
7349 bmap = isl_basic_map_remove_redundancies(bmap);
7350 bmap = isl_basic_map_sort_constraints(bmap);
7351 ISL_F_SET(bmap, ISL_BASIC_MAP_NORMALIZED);
7355 struct isl_basic_set *isl_basic_set_normalize(struct isl_basic_set *bset)
7357 return (struct isl_basic_set *)isl_basic_map_normalize(
7358 (struct isl_basic_map *)bset);
7361 int isl_basic_map_plain_cmp(const __isl_keep isl_basic_map *bmap1,
7362 const __isl_keep isl_basic_map *bmap2)
7369 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_RATIONAL) !=
7370 ISL_F_ISSET(bmap2, ISL_BASIC_MAP_RATIONAL))
7371 return ISL_F_ISSET(bmap1, ISL_BASIC_MAP_RATIONAL) ? -1 : 1;
7372 if (isl_basic_map_n_param(bmap1) != isl_basic_map_n_param(bmap2))
7373 return isl_basic_map_n_param(bmap1) - isl_basic_map_n_param(bmap2);
7374 if (isl_basic_map_n_in(bmap1) != isl_basic_map_n_in(bmap2))
7375 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
7376 if (isl_basic_map_n_out(bmap1) != isl_basic_map_n_out(bmap2))
7377 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
7378 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY) &&
7379 ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
7381 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY))
7383 if (ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
7385 if (bmap1->n_eq != bmap2->n_eq)
7386 return bmap1->n_eq - bmap2->n_eq;
7387 if (bmap1->n_ineq != bmap2->n_ineq)
7388 return bmap1->n_ineq - bmap2->n_ineq;
7389 if (bmap1->n_div != bmap2->n_div)
7390 return bmap1->n_div - bmap2->n_div;
7391 total = isl_basic_map_total_dim(bmap1);
7392 for (i = 0; i < bmap1->n_eq; ++i) {
7393 cmp = isl_seq_cmp(bmap1->eq[i], bmap2->eq[i], 1+total);
7397 for (i = 0; i < bmap1->n_ineq; ++i) {
7398 cmp = isl_seq_cmp(bmap1->ineq[i], bmap2->ineq[i], 1+total);
7402 for (i = 0; i < bmap1->n_div; ++i) {
7403 cmp = isl_seq_cmp(bmap1->div[i], bmap2->div[i], 1+1+total);
7410 int isl_basic_map_plain_is_equal(__isl_keep isl_basic_map *bmap1,
7411 __isl_keep isl_basic_map *bmap2)
7413 return isl_basic_map_plain_cmp(bmap1, bmap2) == 0;
7416 int isl_basic_set_plain_is_equal(__isl_keep isl_basic_set *bset1,
7417 __isl_keep isl_basic_set *bset2)
7419 return isl_basic_map_plain_is_equal((isl_basic_map *)bset1,
7420 (isl_basic_map *)bset2);
7423 static int qsort_bmap_cmp(const void *p1, const void *p2)
7425 const struct isl_basic_map *bmap1 = *(const struct isl_basic_map **)p1;
7426 const struct isl_basic_map *bmap2 = *(const struct isl_basic_map **)p2;
7428 return isl_basic_map_plain_cmp(bmap1, bmap2);
7431 /* We normalize in place, but if anything goes wrong we need
7432 * to return NULL, so we need to make sure we don't change the
7433 * meaning of any possible other copies of map.
7435 struct isl_map *isl_map_normalize(struct isl_map *map)
7438 struct isl_basic_map *bmap;
7442 if (ISL_F_ISSET(map, ISL_MAP_NORMALIZED))
7444 for (i = 0; i < map->n; ++i) {
7445 bmap = isl_basic_map_normalize(isl_basic_map_copy(map->p[i]));
7448 isl_basic_map_free(map->p[i]);
7451 qsort(map->p, map->n, sizeof(struct isl_basic_map *), qsort_bmap_cmp);
7452 ISL_F_SET(map, ISL_MAP_NORMALIZED);
7453 map = isl_map_remove_empty_parts(map);
7456 for (i = map->n - 1; i >= 1; --i) {
7457 if (!isl_basic_map_plain_is_equal(map->p[i-1], map->p[i]))
7459 isl_basic_map_free(map->p[i-1]);
7460 for (j = i; j < map->n; ++j)
7461 map->p[j-1] = map->p[j];
7471 struct isl_set *isl_set_normalize(struct isl_set *set)
7473 return (struct isl_set *)isl_map_normalize((struct isl_map *)set);
7476 int isl_map_plain_is_equal(__isl_keep isl_map *map1, __isl_keep isl_map *map2)
7486 if (!isl_dim_equal(map1->dim, map2->dim))
7489 map1 = isl_map_copy(map1);
7490 map2 = isl_map_copy(map2);
7491 map1 = isl_map_normalize(map1);
7492 map2 = isl_map_normalize(map2);
7495 equal = map1->n == map2->n;
7496 for (i = 0; equal && i < map1->n; ++i) {
7497 equal = isl_basic_map_plain_is_equal(map1->p[i], map2->p[i]);
7510 int isl_map_fast_is_equal(__isl_keep isl_map *map1, __isl_keep isl_map *map2)
7512 return isl_map_plain_is_equal(map1, map2);
7515 int isl_set_plain_is_equal(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
7517 return isl_map_plain_is_equal((struct isl_map *)set1,
7518 (struct isl_map *)set2);
7521 int isl_set_fast_is_equal(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
7523 return isl_set_plain_is_equal(set1, set2);
7526 /* Return an interval that ranges from min to max (inclusive)
7528 struct isl_basic_set *isl_basic_set_interval(struct isl_ctx *ctx,
7529 isl_int min, isl_int max)
7532 struct isl_basic_set *bset = NULL;
7534 bset = isl_basic_set_alloc(ctx, 0, 1, 0, 0, 2);
7538 k = isl_basic_set_alloc_inequality(bset);
7541 isl_int_set_si(bset->ineq[k][1], 1);
7542 isl_int_neg(bset->ineq[k][0], min);
7544 k = isl_basic_set_alloc_inequality(bset);
7547 isl_int_set_si(bset->ineq[k][1], -1);
7548 isl_int_set(bset->ineq[k][0], max);
7552 isl_basic_set_free(bset);
7556 /* Return the Cartesian product of the basic sets in list (in the given order).
7558 __isl_give isl_basic_set *isl_basic_set_list_product(
7559 __isl_take struct isl_basic_set_list *list)
7567 struct isl_basic_set *product = NULL;
7571 isl_assert(list->ctx, list->n > 0, goto error);
7572 isl_assert(list->ctx, list->p[0], goto error);
7573 nparam = isl_basic_set_n_param(list->p[0]);
7574 dim = isl_basic_set_n_dim(list->p[0]);
7575 extra = list->p[0]->n_div;
7576 n_eq = list->p[0]->n_eq;
7577 n_ineq = list->p[0]->n_ineq;
7578 for (i = 1; i < list->n; ++i) {
7579 isl_assert(list->ctx, list->p[i], goto error);
7580 isl_assert(list->ctx,
7581 nparam == isl_basic_set_n_param(list->p[i]), goto error);
7582 dim += isl_basic_set_n_dim(list->p[i]);
7583 extra += list->p[i]->n_div;
7584 n_eq += list->p[i]->n_eq;
7585 n_ineq += list->p[i]->n_ineq;
7587 product = isl_basic_set_alloc(list->ctx, nparam, dim, extra,
7592 for (i = 0; i < list->n; ++i) {
7593 isl_basic_set_add_constraints(product,
7594 isl_basic_set_copy(list->p[i]), dim);
7595 dim += isl_basic_set_n_dim(list->p[i]);
7597 isl_basic_set_list_free(list);
7600 isl_basic_set_free(product);
7601 isl_basic_set_list_free(list);
7605 struct isl_basic_map *isl_basic_map_product(
7606 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
7608 struct isl_dim *dim_result = NULL;
7609 struct isl_basic_map *bmap;
7610 unsigned in1, in2, out1, out2, nparam, total, pos;
7611 struct isl_dim_map *dim_map1, *dim_map2;
7613 if (!bmap1 || !bmap2)
7616 isl_assert(bmap1->ctx, isl_dim_match(bmap1->dim, isl_dim_param,
7617 bmap2->dim, isl_dim_param), goto error);
7618 dim_result = isl_dim_product(isl_dim_copy(bmap1->dim),
7619 isl_dim_copy(bmap2->dim));
7621 in1 = isl_basic_map_n_in(bmap1);
7622 in2 = isl_basic_map_n_in(bmap2);
7623 out1 = isl_basic_map_n_out(bmap1);
7624 out2 = isl_basic_map_n_out(bmap2);
7625 nparam = isl_basic_map_n_param(bmap1);
7627 total = nparam + in1 + in2 + out1 + out2 + bmap1->n_div + bmap2->n_div;
7628 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
7629 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
7630 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
7631 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
7632 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
7633 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos += in1);
7634 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += in2);
7635 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += out1);
7636 isl_dim_map_div(dim_map1, bmap1, pos += out2);
7637 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
7639 bmap = isl_basic_map_alloc_dim(dim_result,
7640 bmap1->n_div + bmap2->n_div,
7641 bmap1->n_eq + bmap2->n_eq,
7642 bmap1->n_ineq + bmap2->n_ineq);
7643 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap1, dim_map1);
7644 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap2, dim_map2);
7645 bmap = isl_basic_map_simplify(bmap);
7646 return isl_basic_map_finalize(bmap);
7648 isl_basic_map_free(bmap1);
7649 isl_basic_map_free(bmap2);
7653 __isl_give isl_basic_map *isl_basic_map_flat_product(
7654 __isl_take isl_basic_map *bmap1, __isl_take isl_basic_map *bmap2)
7656 isl_basic_map *prod;
7658 prod = isl_basic_map_product(bmap1, bmap2);
7659 prod = isl_basic_map_flatten(prod);
7663 __isl_give isl_basic_set *isl_basic_set_flat_product(
7664 __isl_take isl_basic_set *bset1, __isl_take isl_basic_set *bset2)
7666 return isl_basic_map_flat_product(bset1, bset2);
7669 __isl_give isl_basic_map *isl_basic_map_range_product(
7670 __isl_take isl_basic_map *bmap1, __isl_take isl_basic_map *bmap2)
7672 isl_dim *dim_result = NULL;
7673 isl_basic_map *bmap;
7674 unsigned in, out1, out2, nparam, total, pos;
7675 struct isl_dim_map *dim_map1, *dim_map2;
7677 if (!bmap1 || !bmap2)
7680 dim_result = isl_dim_range_product(isl_dim_copy(bmap1->dim),
7681 isl_dim_copy(bmap2->dim));
7683 in = isl_basic_map_dim(bmap1, isl_dim_in);
7684 out1 = isl_basic_map_n_out(bmap1);
7685 out2 = isl_basic_map_n_out(bmap2);
7686 nparam = isl_basic_map_n_param(bmap1);
7688 total = nparam + in + out1 + out2 + bmap1->n_div + bmap2->n_div;
7689 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
7690 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
7691 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
7692 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
7693 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
7694 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
7695 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += in);
7696 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += out1);
7697 isl_dim_map_div(dim_map1, bmap1, pos += out2);
7698 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
7700 bmap = isl_basic_map_alloc_dim(dim_result,
7701 bmap1->n_div + bmap2->n_div,
7702 bmap1->n_eq + bmap2->n_eq,
7703 bmap1->n_ineq + bmap2->n_ineq);
7704 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap1, dim_map1);
7705 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap2, dim_map2);
7706 bmap = isl_basic_map_simplify(bmap);
7707 return isl_basic_map_finalize(bmap);
7709 isl_basic_map_free(bmap1);
7710 isl_basic_map_free(bmap2);
7714 __isl_give isl_basic_map *isl_basic_map_flat_range_product(
7715 __isl_take isl_basic_map *bmap1, __isl_take isl_basic_map *bmap2)
7717 isl_basic_map *prod;
7719 prod = isl_basic_map_range_product(bmap1, bmap2);
7720 prod = isl_basic_map_flatten_range(prod);
7724 static __isl_give isl_map *map_product(__isl_take isl_map *map1,
7725 __isl_take isl_map *map2,
7726 __isl_give isl_dim *(*dim_product)(__isl_take isl_dim *left,
7727 __isl_take isl_dim *right),
7728 __isl_give isl_basic_map *(*basic_map_product)(
7729 __isl_take isl_basic_map *left, __isl_take isl_basic_map *right))
7732 struct isl_map *result;
7738 isl_assert(map1->ctx, isl_dim_match(map1->dim, isl_dim_param,
7739 map2->dim, isl_dim_param), goto error);
7741 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
7742 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
7743 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
7745 result = isl_map_alloc_dim(dim_product(isl_dim_copy(map1->dim),
7746 isl_dim_copy(map2->dim)),
7747 map1->n * map2->n, flags);
7750 for (i = 0; i < map1->n; ++i)
7751 for (j = 0; j < map2->n; ++j) {
7752 struct isl_basic_map *part;
7753 part = basic_map_product(isl_basic_map_copy(map1->p[i]),
7754 isl_basic_map_copy(map2->p[j]));
7755 if (isl_basic_map_is_empty(part))
7756 isl_basic_map_free(part);
7758 result = isl_map_add_basic_map(result, part);
7771 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> [B -> D]
7773 static __isl_give isl_map *map_product_aligned(__isl_take isl_map *map1,
7774 __isl_take isl_map *map2)
7776 return map_product(map1, map2, &isl_dim_product, &isl_basic_map_product);
7779 __isl_give isl_map *isl_map_product(__isl_take isl_map *map1,
7780 __isl_take isl_map *map2)
7782 return isl_map_align_params_map_map_and(map1, map2, &map_product_aligned);
7785 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
7787 __isl_give isl_map *isl_map_flat_product(__isl_take isl_map *map1,
7788 __isl_take isl_map *map2)
7792 prod = isl_map_product(map1, map2);
7793 prod = isl_map_flatten(prod);
7797 /* Given two set A and B, construct its Cartesian product A x B.
7799 struct isl_set *isl_set_product(struct isl_set *set1, struct isl_set *set2)
7801 return isl_map_range_product(set1, set2);
7804 __isl_give isl_set *isl_set_flat_product(__isl_take isl_set *set1,
7805 __isl_take isl_set *set2)
7807 return (isl_set *)isl_map_flat_product((isl_map *)set1, (isl_map *)set2);
7810 /* Given two maps A -> B and C -> D, construct a map (A * C) -> [B -> D]
7812 static __isl_give isl_map *map_range_product_aligned(__isl_take isl_map *map1,
7813 __isl_take isl_map *map2)
7815 return map_product(map1, map2, &isl_dim_range_product,
7816 &isl_basic_map_range_product);
7819 __isl_give isl_map *isl_map_range_product(__isl_take isl_map *map1,
7820 __isl_take isl_map *map2)
7822 return isl_map_align_params_map_map_and(map1, map2,
7823 &map_range_product_aligned);
7826 /* Given two maps A -> B and C -> D, construct a map (A * C) -> (B, D)
7828 __isl_give isl_map *isl_map_flat_range_product(__isl_take isl_map *map1,
7829 __isl_take isl_map *map2)
7833 prod = isl_map_range_product(map1, map2);
7834 prod = isl_map_flatten_range(prod);
7838 uint32_t isl_basic_map_get_hash(__isl_keep isl_basic_map *bmap)
7841 uint32_t hash = isl_hash_init();
7846 bmap = isl_basic_map_copy(bmap);
7847 bmap = isl_basic_map_normalize(bmap);
7850 total = isl_basic_map_total_dim(bmap);
7851 isl_hash_byte(hash, bmap->n_eq & 0xFF);
7852 for (i = 0; i < bmap->n_eq; ++i) {
7854 c_hash = isl_seq_get_hash(bmap->eq[i], 1 + total);
7855 isl_hash_hash(hash, c_hash);
7857 isl_hash_byte(hash, bmap->n_ineq & 0xFF);
7858 for (i = 0; i < bmap->n_ineq; ++i) {
7860 c_hash = isl_seq_get_hash(bmap->ineq[i], 1 + total);
7861 isl_hash_hash(hash, c_hash);
7863 isl_hash_byte(hash, bmap->n_div & 0xFF);
7864 for (i = 0; i < bmap->n_div; ++i) {
7866 if (isl_int_is_zero(bmap->div[i][0]))
7868 isl_hash_byte(hash, i & 0xFF);
7869 c_hash = isl_seq_get_hash(bmap->div[i], 1 + 1 + total);
7870 isl_hash_hash(hash, c_hash);
7872 isl_basic_map_free(bmap);
7876 uint32_t isl_basic_set_get_hash(__isl_keep isl_basic_set *bset)
7878 return isl_basic_map_get_hash((isl_basic_map *)bset);
7881 uint32_t isl_map_get_hash(__isl_keep isl_map *map)
7888 map = isl_map_copy(map);
7889 map = isl_map_normalize(map);
7893 hash = isl_hash_init();
7894 for (i = 0; i < map->n; ++i) {
7896 bmap_hash = isl_basic_map_get_hash(map->p[i]);
7897 isl_hash_hash(hash, bmap_hash);
7905 uint32_t isl_set_get_hash(__isl_keep isl_set *set)
7907 return isl_map_get_hash((isl_map *)set);
7910 /* Check if the value for dimension dim is completely determined
7911 * by the values of the other parameters and variables.
7912 * That is, check if dimension dim is involved in an equality.
7914 int isl_basic_set_dim_is_unique(struct isl_basic_set *bset, unsigned dim)
7921 nparam = isl_basic_set_n_param(bset);
7922 for (i = 0; i < bset->n_eq; ++i)
7923 if (!isl_int_is_zero(bset->eq[i][1 + nparam + dim]))
7928 /* Check if the value for dimension dim is completely determined
7929 * by the values of the other parameters and variables.
7930 * That is, check if dimension dim is involved in an equality
7931 * for each of the subsets.
7933 int isl_set_dim_is_unique(struct isl_set *set, unsigned dim)
7939 for (i = 0; i < set->n; ++i) {
7941 unique = isl_basic_set_dim_is_unique(set->p[i], dim);
7948 int isl_set_n_basic_set(__isl_keep isl_set *set)
7950 return set ? set->n : 0;
7953 int isl_map_foreach_basic_map(__isl_keep isl_map *map,
7954 int (*fn)(__isl_take isl_basic_map *bmap, void *user), void *user)
7961 for (i = 0; i < map->n; ++i)
7962 if (fn(isl_basic_map_copy(map->p[i]), user) < 0)
7968 int isl_set_foreach_basic_set(__isl_keep isl_set *set,
7969 int (*fn)(__isl_take isl_basic_set *bset, void *user), void *user)
7976 for (i = 0; i < set->n; ++i)
7977 if (fn(isl_basic_set_copy(set->p[i]), user) < 0)
7983 __isl_give isl_basic_set *isl_basic_set_lift(__isl_take isl_basic_set *bset)
7985 struct isl_dim *dim;
7990 bset = isl_basic_set_cow(bset);
7994 dim = isl_basic_set_get_dim(bset);
7995 dim = isl_dim_lift(dim, bset->n_div);
7998 isl_dim_free(bset->dim);
8000 bset->extra -= bset->n_div;
8003 bset = isl_basic_set_finalize(bset);
8007 isl_basic_set_free(bset);
8011 __isl_give isl_set *isl_set_lift(__isl_take isl_set *set)
8014 struct isl_dim *dim;
8017 set = isl_set_align_divs(set);
8022 set = isl_set_cow(set);
8026 n_div = set->p[0]->n_div;
8027 dim = isl_set_get_dim(set);
8028 dim = isl_dim_lift(dim, n_div);
8031 isl_dim_free(set->dim);
8034 for (i = 0; i < set->n; ++i) {
8035 set->p[i] = isl_basic_set_lift(set->p[i]);
8046 __isl_give isl_map *isl_set_lifting(__isl_take isl_set *set)
8048 struct isl_dim *dim;
8049 struct isl_basic_map *bmap;
8056 set = isl_set_align_divs(set);
8061 dim = isl_set_get_dim(set);
8062 if (set->n == 0 || set->p[0]->n_div == 0) {
8064 return isl_map_identity(isl_dim_map_from_set(dim));
8067 n_div = set->p[0]->n_div;
8068 dim = isl_dim_map_from_set(dim);
8069 n_param = isl_dim_size(dim, isl_dim_param);
8070 n_set = isl_dim_size(dim, isl_dim_in);
8071 dim = isl_dim_extend(dim, n_param, n_set, n_set + n_div);
8072 bmap = isl_basic_map_alloc_dim(dim, 0, n_set, 2 * n_div);
8073 for (i = 0; i < n_set; ++i)
8074 bmap = var_equal(bmap, i);
8076 total = n_param + n_set + n_set + n_div;
8077 for (i = 0; i < n_div; ++i) {
8078 k = isl_basic_map_alloc_inequality(bmap);
8081 isl_seq_cpy(bmap->ineq[k], set->p[0]->div[i]+1, 1+n_param);
8082 isl_seq_clr(bmap->ineq[k]+1+n_param, n_set);
8083 isl_seq_cpy(bmap->ineq[k]+1+n_param+n_set,
8084 set->p[0]->div[i]+1+1+n_param, n_set + n_div);
8085 isl_int_neg(bmap->ineq[k][1+n_param+n_set+n_set+i],
8086 set->p[0]->div[i][0]);
8088 l = isl_basic_map_alloc_inequality(bmap);
8091 isl_seq_neg(bmap->ineq[l], bmap->ineq[k], 1 + total);
8092 isl_int_add(bmap->ineq[l][0], bmap->ineq[l][0],
8093 set->p[0]->div[i][0]);
8094 isl_int_sub_ui(bmap->ineq[l][0], bmap->ineq[l][0], 1);
8098 bmap = isl_basic_map_simplify(bmap);
8099 bmap = isl_basic_map_finalize(bmap);
8100 return isl_map_from_basic_map(bmap);
8103 isl_basic_map_free(bmap);
8107 int isl_basic_set_size(__isl_keep isl_basic_set *bset)
8115 dim = isl_basic_set_total_dim(bset);
8116 size += bset->n_eq * (1 + dim);
8117 size += bset->n_ineq * (1 + dim);
8118 size += bset->n_div * (2 + dim);
8123 int isl_set_size(__isl_keep isl_set *set)
8131 for (i = 0; i < set->n; ++i)
8132 size += isl_basic_set_size(set->p[i]);
8137 /* Check if there is any lower bound (if lower == 0) and/or upper
8138 * bound (if upper == 0) on the specified dim.
8140 static int basic_map_dim_is_bounded(__isl_keep isl_basic_map *bmap,
8141 enum isl_dim_type type, unsigned pos, int lower, int upper)
8148 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), return -1);
8150 pos += isl_basic_map_offset(bmap, type);
8152 for (i = 0; i < bmap->n_div; ++i) {
8153 if (isl_int_is_zero(bmap->div[i][0]))
8155 if (!isl_int_is_zero(bmap->div[i][1 + pos]))
8159 for (i = 0; i < bmap->n_eq; ++i)
8160 if (!isl_int_is_zero(bmap->eq[i][pos]))
8163 for (i = 0; i < bmap->n_ineq; ++i) {
8164 int sgn = isl_int_sgn(bmap->ineq[i][pos]);
8171 return lower && upper;
8174 int isl_basic_map_dim_is_bounded(__isl_keep isl_basic_map *bmap,
8175 enum isl_dim_type type, unsigned pos)
8177 return basic_map_dim_is_bounded(bmap, type, pos, 0, 0);
8180 int isl_basic_map_dim_has_lower_bound(__isl_keep isl_basic_map *bmap,
8181 enum isl_dim_type type, unsigned pos)
8183 return basic_map_dim_is_bounded(bmap, type, pos, 0, 1);
8186 int isl_basic_map_dim_has_upper_bound(__isl_keep isl_basic_map *bmap,
8187 enum isl_dim_type type, unsigned pos)
8189 return basic_map_dim_is_bounded(bmap, type, pos, 1, 0);
8192 int isl_map_dim_is_bounded(__isl_keep isl_map *map,
8193 enum isl_dim_type type, unsigned pos)
8200 for (i = 0; i < map->n; ++i) {
8202 bounded = isl_basic_map_dim_is_bounded(map->p[i], type, pos);
8203 if (bounded < 0 || !bounded)
8210 /* Return 1 if the specified dim is involved in both an upper bound
8211 * and a lower bound.
8213 int isl_set_dim_is_bounded(__isl_keep isl_set *set,
8214 enum isl_dim_type type, unsigned pos)
8216 return isl_map_dim_is_bounded((isl_map *)set, type, pos);
8219 static int has_bound(__isl_keep isl_map *map,
8220 enum isl_dim_type type, unsigned pos,
8221 int (*fn)(__isl_keep isl_basic_map *bmap,
8222 enum isl_dim_type type, unsigned pos))
8229 for (i = 0; i < map->n; ++i) {
8231 bounded = fn(map->p[i], type, pos);
8232 if (bounded < 0 || bounded)
8239 /* Return 1 if the specified dim is involved in any lower bound.
8241 int isl_set_dim_has_lower_bound(__isl_keep isl_set *set,
8242 enum isl_dim_type type, unsigned pos)
8244 return has_bound(set, type, pos, &isl_basic_map_dim_has_lower_bound);
8247 /* Return 1 if the specified dim is involved in any upper bound.
8249 int isl_set_dim_has_upper_bound(__isl_keep isl_set *set,
8250 enum isl_dim_type type, unsigned pos)
8252 return has_bound(set, type, pos, &isl_basic_map_dim_has_upper_bound);
8255 /* For each of the "n" variables starting at "first", determine
8256 * the sign of the variable and put the results in the first "n"
8257 * elements of the array "signs".
8259 * 1 means that the variable is non-negative
8260 * -1 means that the variable is non-positive
8261 * 0 means the variable attains both positive and negative values.
8263 int isl_basic_set_vars_get_sign(__isl_keep isl_basic_set *bset,
8264 unsigned first, unsigned n, int *signs)
8266 isl_vec *bound = NULL;
8267 struct isl_tab *tab = NULL;
8268 struct isl_tab_undo *snap;
8271 if (!bset || !signs)
8274 bound = isl_vec_alloc(bset->ctx, 1 + isl_basic_set_total_dim(bset));
8275 tab = isl_tab_from_basic_set(bset);
8279 isl_seq_clr(bound->el, bound->size);
8280 isl_int_set_si(bound->el[0], -1);
8282 snap = isl_tab_snap(tab);
8283 for (i = 0; i < n; ++i) {
8286 isl_int_set_si(bound->el[1 + first + i], -1);
8287 if (isl_tab_add_ineq(tab, bound->el) < 0)
8290 isl_int_set_si(bound->el[1 + first + i], 0);
8291 if (isl_tab_rollback(tab, snap) < 0)
8299 isl_int_set_si(bound->el[1 + first + i], 1);
8300 if (isl_tab_add_ineq(tab, bound->el) < 0)
8303 isl_int_set_si(bound->el[1 + first + i], 0);
8304 if (isl_tab_rollback(tab, snap) < 0)
8307 signs[i] = empty ? -1 : 0;
8311 isl_vec_free(bound);
8315 isl_vec_free(bound);
8319 int isl_basic_set_dims_get_sign(__isl_keep isl_basic_set *bset,
8320 enum isl_dim_type type, unsigned first, unsigned n, int *signs)
8322 if (!bset || !signs)
8324 isl_assert(bset->ctx, first + n <= isl_basic_set_dim(bset, type),
8327 first += pos(bset->dim, type) - 1;
8328 return isl_basic_set_vars_get_sign(bset, first, n, signs);
8331 /* Check if the given basic map is obviously single-valued.
8332 * In particular, for each output dimension, check that there is
8333 * an equality that defines the output dimension in terms of
8334 * earlier dimensions.
8336 int isl_basic_map_plain_is_single_valued(__isl_keep isl_basic_map *bmap)
8346 total = 1 + isl_basic_map_total_dim(bmap);
8347 n_out = isl_basic_map_dim(bmap, isl_dim_out);
8348 o_out = isl_basic_map_offset(bmap, isl_dim_out);
8350 for (i = 0; i < n_out; ++i) {
8351 for (j = 0; j < bmap->n_eq; ++j) {
8352 if (isl_int_is_zero(bmap->eq[j][o_out + i]))
8354 if (isl_seq_first_non_zero(bmap->eq[j] + o_out + i + 1,
8355 total - (o_out + i + 1)) == -1)
8358 if (j >= bmap->n_eq)
8365 /* Check if the given map is obviously single-valued.
8367 int isl_map_plain_is_single_valued(__isl_keep isl_map *map)
8376 return isl_basic_map_plain_is_single_valued(map->p[0]);
8379 /* Check if the given map is single-valued.
8384 * and check if the result is a subset of the identity mapping.
8386 int isl_map_is_single_valued(__isl_keep isl_map *map)
8393 sv = isl_map_plain_is_single_valued(map);
8397 test = isl_map_reverse(isl_map_copy(map));
8398 test = isl_map_apply_range(test, isl_map_copy(map));
8400 dim = isl_dim_map_from_set(isl_dim_range(isl_map_get_dim(map)));
8401 id = isl_map_identity(dim);
8403 sv = isl_map_is_subset(test, id);
8411 int isl_map_is_injective(__isl_keep isl_map *map)
8415 map = isl_map_copy(map);
8416 map = isl_map_reverse(map);
8417 in = isl_map_is_single_valued(map);
8423 /* Check if the given map is obviously injective.
8425 int isl_map_plain_is_injective(__isl_keep isl_map *map)
8429 map = isl_map_copy(map);
8430 map = isl_map_reverse(map);
8431 in = isl_map_plain_is_single_valued(map);
8437 int isl_map_is_bijective(__isl_keep isl_map *map)
8441 sv = isl_map_is_single_valued(map);
8445 return isl_map_is_injective(map);
8448 int isl_set_is_singleton(__isl_keep isl_set *set)
8450 return isl_map_is_single_valued((isl_map *)set);
8453 int isl_map_is_translation(__isl_keep isl_map *map)
8458 delta = isl_map_deltas(isl_map_copy(map));
8459 ok = isl_set_is_singleton(delta);
8460 isl_set_free(delta);
8465 static int unique(isl_int *p, unsigned pos, unsigned len)
8467 if (isl_seq_first_non_zero(p, pos) != -1)
8469 if (isl_seq_first_non_zero(p + pos + 1, len - pos - 1) != -1)
8474 int isl_basic_set_is_box(__isl_keep isl_basic_set *bset)
8483 if (isl_basic_set_dim(bset, isl_dim_div) != 0)
8486 nvar = isl_basic_set_dim(bset, isl_dim_set);
8487 ovar = isl_dim_offset(bset->dim, isl_dim_set);
8488 for (j = 0; j < nvar; ++j) {
8489 int lower = 0, upper = 0;
8490 for (i = 0; i < bset->n_eq; ++i) {
8491 if (isl_int_is_zero(bset->eq[i][1 + ovar + j]))
8493 if (!unique(bset->eq[i] + 1 + ovar, j, nvar))
8499 for (i = 0; i < bset->n_ineq; ++i) {
8500 if (isl_int_is_zero(bset->ineq[i][1 + ovar + j]))
8502 if (!unique(bset->ineq[i] + 1 + ovar, j, nvar))
8504 if (isl_int_is_pos(bset->ineq[i][1 + ovar + j]))
8509 if (!lower || !upper)
8516 int isl_set_is_box(__isl_keep isl_set *set)
8523 return isl_basic_set_is_box(set->p[0]);
8526 int isl_basic_set_is_wrapping(__isl_keep isl_basic_set *bset)
8531 return isl_dim_is_wrapping(bset->dim);
8534 int isl_set_is_wrapping(__isl_keep isl_set *set)
8539 return isl_dim_is_wrapping(set->dim);
8542 __isl_give isl_basic_set *isl_basic_map_wrap(__isl_take isl_basic_map *bmap)
8544 bmap = isl_basic_map_cow(bmap);
8548 bmap->dim = isl_dim_wrap(bmap->dim);
8552 bmap = isl_basic_map_finalize(bmap);
8554 return (isl_basic_set *)bmap;
8556 isl_basic_map_free(bmap);
8560 __isl_give isl_set *isl_map_wrap(__isl_take isl_map *map)
8564 map = isl_map_cow(map);
8568 for (i = 0; i < map->n; ++i) {
8569 map->p[i] = (isl_basic_map *)isl_basic_map_wrap(map->p[i]);
8573 map->dim = isl_dim_wrap(map->dim);
8577 return (isl_set *)map;
8583 __isl_give isl_basic_map *isl_basic_set_unwrap(__isl_take isl_basic_set *bset)
8585 bset = isl_basic_set_cow(bset);
8589 bset->dim = isl_dim_unwrap(bset->dim);
8593 bset = isl_basic_set_finalize(bset);
8595 return (isl_basic_map *)bset;
8597 isl_basic_set_free(bset);
8601 __isl_give isl_map *isl_set_unwrap(__isl_take isl_set *set)
8608 if (!isl_set_is_wrapping(set))
8609 isl_die(set->ctx, isl_error_invalid, "not a wrapping set",
8612 set = isl_set_cow(set);
8616 for (i = 0; i < set->n; ++i) {
8617 set->p[i] = (isl_basic_set *)isl_basic_set_unwrap(set->p[i]);
8622 set->dim = isl_dim_unwrap(set->dim);
8626 return (isl_map *)set;
8632 __isl_give isl_basic_map *isl_basic_map_reset(__isl_take isl_basic_map *bmap,
8633 enum isl_dim_type type)
8638 if (!isl_dim_is_named_or_nested(bmap->dim, type))
8641 bmap = isl_basic_map_cow(bmap);
8645 bmap->dim = isl_dim_reset(bmap->dim, type);
8649 bmap = isl_basic_map_finalize(bmap);
8653 isl_basic_map_free(bmap);
8657 __isl_give isl_map *isl_map_reset(__isl_take isl_map *map,
8658 enum isl_dim_type type)
8665 if (!isl_dim_is_named_or_nested(map->dim, type))
8668 map = isl_map_cow(map);
8672 for (i = 0; i < map->n; ++i) {
8673 map->p[i] = isl_basic_map_reset(map->p[i], type);
8677 map->dim = isl_dim_reset(map->dim, type);
8687 __isl_give isl_basic_map *isl_basic_map_flatten(__isl_take isl_basic_map *bmap)
8692 if (!bmap->dim->nested[0] && !bmap->dim->nested[1])
8695 bmap = isl_basic_map_cow(bmap);
8699 bmap->dim = isl_dim_flatten(bmap->dim);
8703 bmap = isl_basic_map_finalize(bmap);
8707 isl_basic_map_free(bmap);
8711 __isl_give isl_basic_set *isl_basic_set_flatten(__isl_take isl_basic_set *bset)
8713 return (isl_basic_set *)isl_basic_map_flatten((isl_basic_map *)bset);
8716 __isl_give isl_basic_map *isl_basic_map_flatten_range(
8717 __isl_take isl_basic_map *bmap)
8722 if (!bmap->dim->nested[1])
8725 bmap = isl_basic_map_cow(bmap);
8729 bmap->dim = isl_dim_flatten_range(bmap->dim);
8733 bmap = isl_basic_map_finalize(bmap);
8737 isl_basic_map_free(bmap);
8741 __isl_give isl_map *isl_map_flatten(__isl_take isl_map *map)
8748 if (!map->dim->nested[0] && !map->dim->nested[1])
8751 map = isl_map_cow(map);
8755 for (i = 0; i < map->n; ++i) {
8756 map->p[i] = isl_basic_map_flatten(map->p[i]);
8760 map->dim = isl_dim_flatten(map->dim);
8770 __isl_give isl_set *isl_set_flatten(__isl_take isl_set *set)
8772 return (isl_set *)isl_map_flatten((isl_map *)set);
8775 __isl_give isl_map *isl_set_flatten_map(__isl_take isl_set *set)
8777 isl_dim *dim, *flat_dim;
8780 dim = isl_set_get_dim(set);
8781 flat_dim = isl_dim_flatten(isl_dim_copy(dim));
8782 map = isl_map_identity(isl_dim_join(isl_dim_reverse(dim), flat_dim));
8783 map = isl_map_intersect_domain(map, set);
8788 __isl_give isl_map *isl_map_flatten_range(__isl_take isl_map *map)
8795 if (!map->dim->nested[1])
8798 map = isl_map_cow(map);
8802 for (i = 0; i < map->n; ++i) {
8803 map->p[i] = isl_basic_map_flatten_range(map->p[i]);
8807 map->dim = isl_dim_flatten_range(map->dim);
8817 /* Reorder the dimensions of "bmap" according to the given dim_map
8818 * and set the dimension specification to "dim".
8820 __isl_give isl_basic_map *isl_basic_map_realign(__isl_take isl_basic_map *bmap,
8821 __isl_take isl_dim *dim, __isl_take struct isl_dim_map *dim_map)
8825 bmap = isl_basic_map_cow(bmap);
8826 if (!bmap || !dim || !dim_map)
8829 res = isl_basic_map_alloc_dim(dim,
8830 bmap->n_div, bmap->n_eq, bmap->n_ineq);
8831 res = isl_basic_map_add_constraints_dim_map(res, bmap, dim_map);
8832 res = isl_basic_map_finalize(res);
8836 isl_basic_map_free(bmap);
8841 /* Reorder the dimensions of "map" according to given reordering.
8843 __isl_give isl_map *isl_map_realign(__isl_take isl_map *map,
8844 __isl_take isl_reordering *r)
8847 struct isl_dim_map *dim_map;
8849 map = isl_map_cow(map);
8850 dim_map = isl_dim_map_from_reordering(r);
8851 if (!map || !r || !dim_map)
8854 for (i = 0; i < map->n; ++i) {
8855 struct isl_dim_map *dim_map_i;
8857 dim_map_i = isl_dim_map_extend(dim_map, map->p[i]);
8859 map->p[i] = isl_basic_map_realign(map->p[i],
8860 isl_dim_copy(r->dim), dim_map_i);
8866 map = isl_map_reset_dim(map, isl_dim_copy(r->dim));
8868 isl_reordering_free(r);
8874 isl_reordering_free(r);
8878 __isl_give isl_set *isl_set_realign(__isl_take isl_set *set,
8879 __isl_take isl_reordering *r)
8881 return (isl_set *)isl_map_realign((isl_map *)set, r);
8884 __isl_give isl_map *isl_map_align_params(__isl_take isl_map *map,
8885 __isl_take isl_dim *model)
8892 ctx = isl_dim_get_ctx(model);
8893 if (!isl_dim_has_named_params(model))
8894 isl_die(ctx, isl_error_invalid,
8895 "model has unnamed parameters", goto error);
8896 if (!isl_dim_has_named_params(map->dim))
8897 isl_die(ctx, isl_error_invalid,
8898 "relation has unnamed parameters", goto error);
8899 if (!isl_dim_match(map->dim, isl_dim_param, model, isl_dim_param)) {
8900 isl_reordering *exp;
8902 model = isl_dim_drop(model, isl_dim_in,
8903 0, isl_dim_size(model, isl_dim_in));
8904 model = isl_dim_drop(model, isl_dim_out,
8905 0, isl_dim_size(model, isl_dim_out));
8906 exp = isl_parameter_alignment_reordering(map->dim, model);
8907 exp = isl_reordering_extend_dim(exp, isl_map_get_dim(map));
8908 map = isl_map_realign(map, exp);
8911 isl_dim_free(model);
8914 isl_dim_free(model);
8919 __isl_give isl_set *isl_set_align_params(__isl_take isl_set *set,
8920 __isl_take isl_dim *model)
8922 return isl_map_align_params(set, model);
8925 __isl_give isl_mat *isl_basic_map_equalities_matrix(
8926 __isl_keep isl_basic_map *bmap, enum isl_dim_type c1,
8927 enum isl_dim_type c2, enum isl_dim_type c3,
8928 enum isl_dim_type c4, enum isl_dim_type c5)
8930 enum isl_dim_type c[5] = { c1, c2, c3, c4, c5 };
8931 struct isl_mat *mat;
8937 mat = isl_mat_alloc(bmap->ctx, bmap->n_eq,
8938 isl_basic_map_total_dim(bmap) + 1);
8941 for (i = 0; i < bmap->n_eq; ++i)
8942 for (j = 0, pos = 0; j < 5; ++j) {
8943 int off = isl_basic_map_offset(bmap, c[j]);
8944 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
8945 isl_int_set(mat->row[i][pos],
8946 bmap->eq[i][off + k]);
8954 __isl_give isl_mat *isl_basic_map_inequalities_matrix(
8955 __isl_keep isl_basic_map *bmap, enum isl_dim_type c1,
8956 enum isl_dim_type c2, enum isl_dim_type c3,
8957 enum isl_dim_type c4, enum isl_dim_type c5)
8959 enum isl_dim_type c[5] = { c1, c2, c3, c4, c5 };
8960 struct isl_mat *mat;
8966 mat = isl_mat_alloc(bmap->ctx, bmap->n_ineq,
8967 isl_basic_map_total_dim(bmap) + 1);
8970 for (i = 0; i < bmap->n_ineq; ++i)
8971 for (j = 0, pos = 0; j < 5; ++j) {
8972 int off = isl_basic_map_offset(bmap, c[j]);
8973 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
8974 isl_int_set(mat->row[i][pos],
8975 bmap->ineq[i][off + k]);
8983 __isl_give isl_basic_map *isl_basic_map_from_constraint_matrices(
8984 __isl_take isl_dim *dim,
8985 __isl_take isl_mat *eq, __isl_take isl_mat *ineq, enum isl_dim_type c1,
8986 enum isl_dim_type c2, enum isl_dim_type c3,
8987 enum isl_dim_type c4, enum isl_dim_type c5)
8989 enum isl_dim_type c[5] = { c1, c2, c3, c4, c5 };
8990 isl_basic_map *bmap;
8996 if (!dim || !eq || !ineq)
8999 if (eq->n_col != ineq->n_col)
9000 isl_die(dim->ctx, isl_error_invalid,
9001 "equalities and inequalities matrices should have "
9002 "same number of columns", goto error);
9004 total = 1 + isl_dim_total(dim);
9006 if (eq->n_col < total)
9007 isl_die(dim->ctx, isl_error_invalid,
9008 "number of columns too small", goto error);
9010 extra = eq->n_col - total;
9012 bmap = isl_basic_map_alloc_dim(isl_dim_copy(dim), extra,
9013 eq->n_row, ineq->n_row);
9016 for (i = 0; i < extra; ++i) {
9017 k = isl_basic_map_alloc_div(bmap);
9020 isl_int_set_si(bmap->div[k][0], 0);
9022 for (i = 0; i < eq->n_row; ++i) {
9023 l = isl_basic_map_alloc_equality(bmap);
9026 for (j = 0, pos = 0; j < 5; ++j) {
9027 int off = isl_basic_map_offset(bmap, c[j]);
9028 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
9029 isl_int_set(bmap->eq[l][off + k],
9035 for (i = 0; i < ineq->n_row; ++i) {
9036 l = isl_basic_map_alloc_inequality(bmap);
9039 for (j = 0, pos = 0; j < 5; ++j) {
9040 int off = isl_basic_map_offset(bmap, c[j]);
9041 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
9042 isl_int_set(bmap->ineq[l][off + k],
9061 __isl_give isl_mat *isl_basic_set_equalities_matrix(
9062 __isl_keep isl_basic_set *bset, enum isl_dim_type c1,
9063 enum isl_dim_type c2, enum isl_dim_type c3, enum isl_dim_type c4)
9065 return isl_basic_map_equalities_matrix((isl_basic_map *)bset,
9066 c1, c2, c3, c4, isl_dim_in);
9069 __isl_give isl_mat *isl_basic_set_inequalities_matrix(
9070 __isl_keep isl_basic_set *bset, enum isl_dim_type c1,
9071 enum isl_dim_type c2, enum isl_dim_type c3, enum isl_dim_type c4)
9073 return isl_basic_map_inequalities_matrix((isl_basic_map *)bset,
9074 c1, c2, c3, c4, isl_dim_in);
9077 __isl_give isl_basic_set *isl_basic_set_from_constraint_matrices(
9078 __isl_take isl_dim *dim,
9079 __isl_take isl_mat *eq, __isl_take isl_mat *ineq, enum isl_dim_type c1,
9080 enum isl_dim_type c2, enum isl_dim_type c3, enum isl_dim_type c4)
9082 return (isl_basic_set*)
9083 isl_basic_map_from_constraint_matrices(dim, eq, ineq,
9084 c1, c2, c3, c4, isl_dim_in);
9087 int isl_basic_map_can_zip(__isl_keep isl_basic_map *bmap)
9092 return isl_dim_can_zip(bmap->dim);
9095 int isl_map_can_zip(__isl_keep isl_map *map)
9100 return isl_dim_can_zip(map->dim);
9103 /* Given a basic map (A -> B) -> (C -> D), return the corresponding basic map
9104 * (A -> C) -> (B -> D).
9106 __isl_give isl_basic_map *isl_basic_map_zip(__isl_take isl_basic_map *bmap)
9115 if (!isl_basic_map_can_zip(bmap))
9116 isl_die(bmap->ctx, isl_error_invalid,
9117 "basic map cannot be zipped", goto error);
9118 pos = isl_basic_map_offset(bmap, isl_dim_in) +
9119 isl_dim_size(bmap->dim->nested[0], isl_dim_in);
9120 n1 = isl_dim_size(bmap->dim->nested[0], isl_dim_out);
9121 n2 = isl_dim_size(bmap->dim->nested[1], isl_dim_in);
9122 bmap = isl_basic_map_swap_vars(bmap, pos, n1, n2);
9125 bmap->dim = isl_dim_zip(bmap->dim);
9130 isl_basic_map_free(bmap);
9134 /* Given a map (A -> B) -> (C -> D), return the corresponding map
9135 * (A -> C) -> (B -> D).
9137 __isl_give isl_map *isl_map_zip(__isl_take isl_map *map)
9144 if (!isl_map_can_zip(map))
9145 isl_die(map->ctx, isl_error_invalid, "map cannot be zipped",
9148 map = isl_map_cow(map);
9152 for (i = 0; i < map->n; ++i) {
9153 map->p[i] = isl_basic_map_zip(map->p[i]);
9158 map->dim = isl_dim_zip(map->dim);
9168 /* Construct a basic map mapping the domain of the affine expression
9169 * to a one-dimensional range prescribed by the affine expression.
9171 __isl_give isl_basic_map *isl_basic_map_from_aff(__isl_take isl_aff *aff)
9175 isl_local_space *ls;
9176 isl_basic_map *bmap;
9181 ls = isl_aff_get_local_space(aff);
9182 ls = isl_local_space_from_domain(ls);
9183 ls = isl_local_space_add_dims(ls, isl_dim_out, 1);
9184 bmap = isl_basic_map_from_local_space(ls);
9185 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
9186 k = isl_basic_map_alloc_equality(bmap);
9190 pos = isl_basic_map_offset(bmap, isl_dim_out);
9191 isl_seq_cpy(bmap->eq[k], aff->v->el + 1, pos);
9192 isl_int_neg(bmap->eq[k][pos], aff->v->el[0]);
9193 isl_seq_cpy(bmap->eq[k] + pos + 1, aff->v->el + 1 + pos,
9194 aff->v->size - (pos + 1));
9197 bmap = isl_basic_map_finalize(bmap);
9201 isl_basic_map_free(bmap);
9205 /* Construct a basic map mapping a domain in the given space to
9206 * to an n-dimensional range, with n the number of elements in the list,
9207 * where each coordinate in the range is prescribed by the
9208 * corresponding affine expression.
9209 * The domains of all affine expressions in the list are assumed to match
9212 __isl_give isl_basic_map *isl_basic_map_from_aff_list(
9213 __isl_take isl_dim *domain_dim, __isl_take isl_aff_list *list)
9217 isl_basic_map *bmap;
9222 dim = isl_dim_from_domain(domain_dim);
9223 bmap = isl_basic_map_universe(dim);
9225 for (i = 0; i < list->n; ++i) {
9227 isl_basic_map *bmap_i;
9229 aff = isl_aff_copy(list->p[i]);
9230 bmap_i = isl_basic_map_from_aff(aff);
9232 bmap = isl_basic_map_flat_range_product(bmap, bmap_i);
9235 isl_aff_list_free(list);
9239 __isl_give isl_set *isl_set_equate(__isl_take isl_set *set,
9240 enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2)
9242 return isl_map_equate(set, type1, pos1, type2, pos2);
9245 /* Add a constraint imposing that the given two dimensions are equal.
9247 __isl_give isl_map *isl_map_equate(__isl_take isl_map *map,
9248 enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2)
9250 isl_basic_map *bmap = NULL;
9256 if (pos1 >= isl_map_dim(map, type1))
9257 isl_die(map->ctx, isl_error_invalid,
9258 "index out of bounds", goto error);
9259 if (pos2 >= isl_map_dim(map, type2))
9260 isl_die(map->ctx, isl_error_invalid,
9261 "index out of bounds", goto error);
9263 bmap = isl_basic_map_alloc_dim(isl_map_get_dim(map), 0, 1, 0);
9264 i = isl_basic_map_alloc_equality(bmap);
9267 isl_seq_clr(bmap->eq[i], 1 + isl_basic_map_total_dim(bmap));
9268 pos1 += isl_basic_map_offset(bmap, type1);
9269 pos2 += isl_basic_map_offset(bmap, type2);
9270 isl_int_set_si(bmap->eq[i][pos1], -1);
9271 isl_int_set_si(bmap->eq[i][pos2], 1);
9272 bmap = isl_basic_map_finalize(bmap);
9274 map = isl_map_intersect(map, isl_map_from_basic_map(bmap));
9278 isl_basic_map_free(bmap);
9283 /* Add a constraint imposing that the given two dimensions have opposite values.
9285 __isl_give isl_map *isl_map_oppose(__isl_take isl_map *map,
9286 enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2)
9288 isl_basic_map *bmap = NULL;
9294 if (pos1 >= isl_map_dim(map, type1))
9295 isl_die(map->ctx, isl_error_invalid,
9296 "index out of bounds", goto error);
9297 if (pos2 >= isl_map_dim(map, type2))
9298 isl_die(map->ctx, isl_error_invalid,
9299 "index out of bounds", goto error);
9301 bmap = isl_basic_map_alloc_dim(isl_map_get_dim(map), 0, 1, 0);
9302 i = isl_basic_map_alloc_equality(bmap);
9305 isl_seq_clr(bmap->eq[i], 1 + isl_basic_map_total_dim(bmap));
9306 pos1 += isl_basic_map_offset(bmap, type1);
9307 pos2 += isl_basic_map_offset(bmap, type2);
9308 isl_int_set_si(bmap->eq[i][pos1], 1);
9309 isl_int_set_si(bmap->eq[i][pos2], 1);
9310 bmap = isl_basic_map_finalize(bmap);
9312 map = isl_map_intersect(map, isl_map_from_basic_map(bmap));
9316 isl_basic_map_free(bmap);