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(const struct 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(const struct isl_map *map, enum isl_dim_type type)
73 return map ? n(map->dim, type) : 0;
76 unsigned isl_set_dim(const struct 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(const struct isl_basic_set *bset,
107 enum isl_dim_type type)
109 return isl_basic_map_dim((const struct isl_basic_map*)bset, type);
112 unsigned isl_basic_set_n_dim(const struct isl_basic_set *bset)
114 return isl_basic_set_dim(bset, isl_dim_set);
117 unsigned isl_basic_set_n_param(const struct 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(const struct isl_set *set)
129 return isl_set_dim(set, isl_dim_set);
132 unsigned isl_set_n_param(const struct 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 __isl_give isl_id *isl_map_get_dim_id(__isl_keep isl_map *map,
535 enum isl_dim_type type, unsigned pos)
537 return map ? isl_dim_get_dim_id(map->dim, type, pos) : NULL;
540 __isl_give isl_id *isl_set_get_dim_id(__isl_keep isl_set *set,
541 enum isl_dim_type type, unsigned pos)
543 return isl_map_get_dim_id(set, type, pos);
546 __isl_give isl_map *isl_map_set_dim_id(__isl_take isl_map *map,
547 enum isl_dim_type type, unsigned pos, __isl_take isl_id *id)
549 map = isl_map_cow(map);
551 return isl_id_free(id);
553 map->dim = isl_dim_set_dim_id(map->dim, type, pos, id);
555 return isl_map_reset_dim(map, isl_dim_copy(map->dim));
558 __isl_give isl_set *isl_set_set_dim_id(__isl_take isl_set *set,
559 enum isl_dim_type type, unsigned pos, __isl_take isl_id *id)
561 return isl_map_set_dim_id(set, type, pos, id);
564 int isl_map_find_dim_by_id(__isl_keep isl_map *map, enum isl_dim_type type,
565 __isl_keep isl_id *id)
569 return isl_dim_find_dim_by_id(map->dim, type, id);
572 int isl_set_find_dim_by_id(__isl_keep isl_set *set, enum isl_dim_type type,
573 __isl_keep isl_id *id)
575 return isl_map_find_dim_by_id(set, type, id);
578 int isl_basic_map_is_rational(__isl_keep isl_basic_map *bmap)
582 return ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL);
585 int isl_basic_set_is_rational(__isl_keep isl_basic_set *bset)
587 return isl_basic_map_is_rational(bset);
590 static struct isl_basic_map *basic_map_init(struct isl_ctx *ctx,
591 struct isl_basic_map *bmap, unsigned extra,
592 unsigned n_eq, unsigned n_ineq)
595 size_t row_size = 1 + isl_dim_total(bmap->dim) + extra;
600 bmap->block = isl_blk_alloc(ctx, (n_ineq + n_eq) * row_size);
601 if (isl_blk_is_error(bmap->block))
604 bmap->ineq = isl_alloc_array(ctx, isl_int *, n_ineq + n_eq);
609 bmap->block2 = isl_blk_empty();
612 bmap->block2 = isl_blk_alloc(ctx, extra * (1 + row_size));
613 if (isl_blk_is_error(bmap->block2))
616 bmap->div = isl_alloc_array(ctx, isl_int *, extra);
621 for (i = 0; i < n_ineq + n_eq; ++i)
622 bmap->ineq[i] = bmap->block.data + i * row_size;
624 for (i = 0; i < extra; ++i)
625 bmap->div[i] = bmap->block2.data + i * (1 + row_size);
629 bmap->c_size = n_eq + n_ineq;
630 bmap->eq = bmap->ineq + n_ineq;
639 isl_basic_map_free(bmap);
643 struct isl_basic_set *isl_basic_set_alloc(struct isl_ctx *ctx,
644 unsigned nparam, unsigned dim, unsigned extra,
645 unsigned n_eq, unsigned n_ineq)
647 struct isl_basic_map *bmap;
648 bmap = isl_basic_map_alloc(ctx, nparam, 0, dim, extra, n_eq, n_ineq);
649 return (struct isl_basic_set *)bmap;
652 struct isl_basic_set *isl_basic_set_alloc_dim(struct isl_dim *dim,
653 unsigned extra, unsigned n_eq, unsigned n_ineq)
655 struct isl_basic_map *bmap;
658 isl_assert(dim->ctx, dim->n_in == 0, goto error);
659 bmap = isl_basic_map_alloc_dim(dim, extra, n_eq, n_ineq);
660 return (struct isl_basic_set *)bmap;
666 struct isl_basic_map *isl_basic_map_alloc_dim(struct isl_dim *dim,
667 unsigned extra, unsigned n_eq, unsigned n_ineq)
669 struct isl_basic_map *bmap;
673 bmap = isl_calloc_type(dim->ctx, struct isl_basic_map);
678 return basic_map_init(dim->ctx, bmap, extra, n_eq, n_ineq);
684 struct isl_basic_map *isl_basic_map_alloc(struct isl_ctx *ctx,
685 unsigned nparam, unsigned in, unsigned out, unsigned extra,
686 unsigned n_eq, unsigned n_ineq)
688 struct isl_basic_map *bmap;
691 dim = isl_dim_alloc(ctx, nparam, in, out);
695 bmap = isl_basic_map_alloc_dim(dim, extra, n_eq, n_ineq);
699 static void dup_constraints(
700 struct isl_basic_map *dst, struct isl_basic_map *src)
703 unsigned total = isl_basic_map_total_dim(src);
705 for (i = 0; i < src->n_eq; ++i) {
706 int j = isl_basic_map_alloc_equality(dst);
707 isl_seq_cpy(dst->eq[j], src->eq[i], 1+total);
710 for (i = 0; i < src->n_ineq; ++i) {
711 int j = isl_basic_map_alloc_inequality(dst);
712 isl_seq_cpy(dst->ineq[j], src->ineq[i], 1+total);
715 for (i = 0; i < src->n_div; ++i) {
716 int j = isl_basic_map_alloc_div(dst);
717 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total);
719 ISL_F_SET(dst, ISL_BASIC_SET_FINAL);
722 struct isl_basic_map *isl_basic_map_dup(struct isl_basic_map *bmap)
724 struct isl_basic_map *dup;
728 dup = isl_basic_map_alloc_dim(isl_dim_copy(bmap->dim),
729 bmap->n_div, bmap->n_eq, bmap->n_ineq);
732 dup_constraints(dup, bmap);
733 dup->flags = bmap->flags;
734 dup->sample = isl_vec_copy(bmap->sample);
738 struct isl_basic_set *isl_basic_set_dup(struct isl_basic_set *bset)
740 struct isl_basic_map *dup;
742 dup = isl_basic_map_dup((struct isl_basic_map *)bset);
743 return (struct isl_basic_set *)dup;
746 struct isl_basic_set *isl_basic_set_copy(struct isl_basic_set *bset)
751 if (ISL_F_ISSET(bset, ISL_BASIC_SET_FINAL)) {
755 return isl_basic_set_dup(bset);
758 struct isl_set *isl_set_copy(struct isl_set *set)
767 struct isl_basic_map *isl_basic_map_copy(struct isl_basic_map *bmap)
772 if (ISL_F_ISSET(bmap, ISL_BASIC_SET_FINAL)) {
776 bmap = isl_basic_map_dup(bmap);
778 ISL_F_SET(bmap, ISL_BASIC_SET_FINAL);
782 struct isl_map *isl_map_copy(struct isl_map *map)
791 void isl_basic_map_free(struct isl_basic_map *bmap)
799 isl_ctx_deref(bmap->ctx);
801 isl_blk_free(bmap->ctx, bmap->block2);
803 isl_blk_free(bmap->ctx, bmap->block);
804 isl_vec_free(bmap->sample);
805 isl_dim_free(bmap->dim);
809 void isl_basic_set_free(struct isl_basic_set *bset)
811 isl_basic_map_free((struct isl_basic_map *)bset);
814 static int room_for_con(struct isl_basic_map *bmap, unsigned n)
816 return bmap->n_eq + bmap->n_ineq + n <= bmap->c_size;
819 __isl_give isl_map *isl_map_align_params_map_map_and(
820 __isl_take isl_map *map1, __isl_take isl_map *map2,
821 __isl_give isl_map *(*fn)(__isl_take isl_map *map1,
822 __isl_take isl_map *map2))
826 if (isl_dim_match(map1->dim, isl_dim_param, map2->dim, isl_dim_param))
827 return fn(map1, map2);
828 if (!isl_dim_has_named_params(map1->dim) ||
829 !isl_dim_has_named_params(map2->dim))
830 isl_die(map1->ctx, isl_error_invalid,
831 "unaligned unnamed parameters", goto error);
832 map1 = isl_map_align_params(map1, isl_map_get_dim(map2));
833 map2 = isl_map_align_params(map2, isl_map_get_dim(map1));
834 return fn(map1, map2);
841 static int align_params_map_map_and_test(__isl_keep isl_map *map1,
842 __isl_keep isl_map *map2,
843 int (*fn)(__isl_keep isl_map *map1, __isl_keep isl_map *map2))
849 if (isl_dim_match(map1->dim, isl_dim_param, map2->dim, isl_dim_param))
850 return fn(map1, map2);
851 if (!isl_dim_has_named_params(map1->dim) ||
852 !isl_dim_has_named_params(map2->dim))
853 isl_die(map1->ctx, isl_error_invalid,
854 "unaligned unnamed parameters", return -1);
855 map1 = isl_map_copy(map1);
856 map2 = isl_map_copy(map2);
857 map1 = isl_map_align_params(map1, isl_map_get_dim(map2));
858 map2 = isl_map_align_params(map2, isl_map_get_dim(map1));
865 int isl_basic_map_alloc_equality(struct isl_basic_map *bmap)
871 isl_assert(ctx, room_for_con(bmap, 1), return -1);
872 isl_assert(ctx, (bmap->eq - bmap->ineq) + bmap->n_eq <= bmap->c_size,
874 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
875 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
876 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_IMPLICIT);
877 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
878 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
879 if ((bmap->eq - bmap->ineq) + bmap->n_eq == bmap->c_size) {
881 int j = isl_basic_map_alloc_inequality(bmap);
885 bmap->ineq[j] = bmap->ineq[bmap->n_ineq - 1];
886 bmap->ineq[bmap->n_ineq - 1] = bmap->eq[-1];
893 isl_seq_clr(bmap->eq[bmap->n_eq] + 1 + isl_basic_map_total_dim(bmap),
894 bmap->extra - bmap->n_div);
898 int isl_basic_set_alloc_equality(struct isl_basic_set *bset)
900 return isl_basic_map_alloc_equality((struct isl_basic_map *)bset);
903 int isl_basic_map_free_equality(struct isl_basic_map *bmap, unsigned n)
907 isl_assert(bmap->ctx, n <= bmap->n_eq, return -1);
912 int isl_basic_set_free_equality(struct isl_basic_set *bset, unsigned n)
914 return isl_basic_map_free_equality((struct isl_basic_map *)bset, n);
917 int isl_basic_map_drop_equality(struct isl_basic_map *bmap, unsigned pos)
922 isl_assert(bmap->ctx, pos < bmap->n_eq, return -1);
924 if (pos != bmap->n_eq - 1) {
926 bmap->eq[pos] = bmap->eq[bmap->n_eq - 1];
927 bmap->eq[bmap->n_eq - 1] = t;
933 int isl_basic_set_drop_equality(struct isl_basic_set *bset, unsigned pos)
935 return isl_basic_map_drop_equality((struct isl_basic_map *)bset, pos);
938 void isl_basic_map_inequality_to_equality(
939 struct isl_basic_map *bmap, unsigned pos)
944 bmap->ineq[pos] = bmap->ineq[bmap->n_ineq - 1];
945 bmap->ineq[bmap->n_ineq - 1] = bmap->eq[-1];
950 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
951 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
952 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
953 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
956 static int room_for_ineq(struct isl_basic_map *bmap, unsigned n)
958 return bmap->n_ineq + n <= bmap->eq - bmap->ineq;
961 int isl_basic_map_alloc_inequality(struct isl_basic_map *bmap)
967 isl_assert(ctx, room_for_ineq(bmap, 1), return -1);
968 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_IMPLICIT);
969 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
970 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
971 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
972 isl_seq_clr(bmap->ineq[bmap->n_ineq] +
973 1 + isl_basic_map_total_dim(bmap),
974 bmap->extra - bmap->n_div);
975 return bmap->n_ineq++;
978 int isl_basic_set_alloc_inequality(struct isl_basic_set *bset)
980 return isl_basic_map_alloc_inequality((struct isl_basic_map *)bset);
983 int isl_basic_map_free_inequality(struct isl_basic_map *bmap, unsigned n)
987 isl_assert(bmap->ctx, n <= bmap->n_ineq, return -1);
992 int isl_basic_set_free_inequality(struct isl_basic_set *bset, unsigned n)
994 return isl_basic_map_free_inequality((struct isl_basic_map *)bset, n);
997 int isl_basic_map_drop_inequality(struct isl_basic_map *bmap, unsigned pos)
1002 isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
1004 if (pos != bmap->n_ineq - 1) {
1005 t = bmap->ineq[pos];
1006 bmap->ineq[pos] = bmap->ineq[bmap->n_ineq - 1];
1007 bmap->ineq[bmap->n_ineq - 1] = t;
1008 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1014 int isl_basic_set_drop_inequality(struct isl_basic_set *bset, unsigned pos)
1016 return isl_basic_map_drop_inequality((struct isl_basic_map *)bset, pos);
1019 __isl_give isl_basic_map *isl_basic_map_add_eq(__isl_take isl_basic_map *bmap,
1024 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
1027 k = isl_basic_map_alloc_equality(bmap);
1030 isl_seq_cpy(bmap->eq[k], eq, 1 + isl_basic_map_total_dim(bmap));
1033 isl_basic_map_free(bmap);
1037 __isl_give isl_basic_set *isl_basic_set_add_eq(__isl_take isl_basic_set *bset,
1040 return (isl_basic_set *)
1041 isl_basic_map_add_eq((isl_basic_map *)bset, eq);
1044 __isl_give isl_basic_map *isl_basic_map_add_ineq(__isl_take isl_basic_map *bmap,
1049 bmap = isl_basic_map_extend_constraints(bmap, 0, 1);
1052 k = isl_basic_map_alloc_inequality(bmap);
1055 isl_seq_cpy(bmap->ineq[k], ineq, 1 + isl_basic_map_total_dim(bmap));
1058 isl_basic_map_free(bmap);
1062 __isl_give isl_basic_set *isl_basic_set_add_ineq(__isl_take isl_basic_set *bset,
1065 return (isl_basic_set *)
1066 isl_basic_map_add_ineq((isl_basic_map *)bset, ineq);
1069 int isl_basic_map_alloc_div(struct isl_basic_map *bmap)
1073 isl_assert(bmap->ctx, bmap->n_div < bmap->extra, return -1);
1074 isl_seq_clr(bmap->div[bmap->n_div] +
1075 1 + 1 + isl_basic_map_total_dim(bmap),
1076 bmap->extra - bmap->n_div);
1077 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
1078 return bmap->n_div++;
1081 int isl_basic_set_alloc_div(struct isl_basic_set *bset)
1083 return isl_basic_map_alloc_div((struct isl_basic_map *)bset);
1086 int isl_basic_map_free_div(struct isl_basic_map *bmap, unsigned n)
1090 isl_assert(bmap->ctx, n <= bmap->n_div, return -1);
1095 int isl_basic_set_free_div(struct isl_basic_set *bset, unsigned n)
1097 return isl_basic_map_free_div((struct isl_basic_map *)bset, n);
1100 /* Copy constraint from src to dst, putting the vars of src at offset
1101 * dim_off in dst and the divs of src at offset div_off in dst.
1102 * If both sets are actually map, then dim_off applies to the input
1105 static void copy_constraint(struct isl_basic_map *dst_map, isl_int *dst,
1106 struct isl_basic_map *src_map, isl_int *src,
1107 unsigned in_off, unsigned out_off, unsigned div_off)
1109 unsigned src_nparam = isl_basic_map_n_param(src_map);
1110 unsigned dst_nparam = isl_basic_map_n_param(dst_map);
1111 unsigned src_in = isl_basic_map_n_in(src_map);
1112 unsigned dst_in = isl_basic_map_n_in(dst_map);
1113 unsigned src_out = isl_basic_map_n_out(src_map);
1114 unsigned dst_out = isl_basic_map_n_out(dst_map);
1115 isl_int_set(dst[0], src[0]);
1116 isl_seq_cpy(dst+1, src+1, isl_min(dst_nparam, src_nparam));
1117 if (dst_nparam > src_nparam)
1118 isl_seq_clr(dst+1+src_nparam,
1119 dst_nparam - src_nparam);
1120 isl_seq_clr(dst+1+dst_nparam, in_off);
1121 isl_seq_cpy(dst+1+dst_nparam+in_off,
1123 isl_min(dst_in-in_off, src_in));
1124 if (dst_in-in_off > src_in)
1125 isl_seq_clr(dst+1+dst_nparam+in_off+src_in,
1126 dst_in - in_off - src_in);
1127 isl_seq_clr(dst+1+dst_nparam+dst_in, out_off);
1128 isl_seq_cpy(dst+1+dst_nparam+dst_in+out_off,
1129 src+1+src_nparam+src_in,
1130 isl_min(dst_out-out_off, src_out));
1131 if (dst_out-out_off > src_out)
1132 isl_seq_clr(dst+1+dst_nparam+dst_in+out_off+src_out,
1133 dst_out - out_off - src_out);
1134 isl_seq_clr(dst+1+dst_nparam+dst_in+dst_out, div_off);
1135 isl_seq_cpy(dst+1+dst_nparam+dst_in+dst_out+div_off,
1136 src+1+src_nparam+src_in+src_out,
1137 isl_min(dst_map->extra-div_off, src_map->n_div));
1138 if (dst_map->n_div-div_off > src_map->n_div)
1139 isl_seq_clr(dst+1+dst_nparam+dst_in+dst_out+
1140 div_off+src_map->n_div,
1141 dst_map->n_div - div_off - src_map->n_div);
1144 static void copy_div(struct isl_basic_map *dst_map, isl_int *dst,
1145 struct isl_basic_map *src_map, isl_int *src,
1146 unsigned in_off, unsigned out_off, unsigned div_off)
1148 isl_int_set(dst[0], src[0]);
1149 copy_constraint(dst_map, dst+1, src_map, src+1, in_off, out_off, div_off);
1152 static struct isl_basic_map *add_constraints(struct isl_basic_map *bmap1,
1153 struct isl_basic_map *bmap2, unsigned i_pos, unsigned o_pos)
1158 if (!bmap1 || !bmap2)
1161 div_off = bmap1->n_div;
1163 for (i = 0; i < bmap2->n_eq; ++i) {
1164 int i1 = isl_basic_map_alloc_equality(bmap1);
1167 copy_constraint(bmap1, bmap1->eq[i1], bmap2, bmap2->eq[i],
1168 i_pos, o_pos, div_off);
1171 for (i = 0; i < bmap2->n_ineq; ++i) {
1172 int i1 = isl_basic_map_alloc_inequality(bmap1);
1175 copy_constraint(bmap1, bmap1->ineq[i1], bmap2, bmap2->ineq[i],
1176 i_pos, o_pos, div_off);
1179 for (i = 0; i < bmap2->n_div; ++i) {
1180 int i1 = isl_basic_map_alloc_div(bmap1);
1183 copy_div(bmap1, bmap1->div[i1], bmap2, bmap2->div[i],
1184 i_pos, o_pos, div_off);
1187 isl_basic_map_free(bmap2);
1192 isl_basic_map_free(bmap1);
1193 isl_basic_map_free(bmap2);
1197 struct isl_basic_set *isl_basic_set_add_constraints(struct isl_basic_set *bset1,
1198 struct isl_basic_set *bset2, unsigned pos)
1200 return (struct isl_basic_set *)
1201 add_constraints((struct isl_basic_map *)bset1,
1202 (struct isl_basic_map *)bset2, 0, pos);
1205 struct isl_basic_map *isl_basic_map_extend_dim(struct isl_basic_map *base,
1206 struct isl_dim *dim, unsigned extra,
1207 unsigned n_eq, unsigned n_ineq)
1209 struct isl_basic_map *ext;
1219 dims_ok = isl_dim_equal(base->dim, dim) &&
1220 base->extra >= base->n_div + extra;
1222 if (dims_ok && room_for_con(base, n_eq + n_ineq) &&
1223 room_for_ineq(base, n_ineq)) {
1228 isl_assert(base->ctx, base->dim->nparam <= dim->nparam, goto error);
1229 isl_assert(base->ctx, base->dim->n_in <= dim->n_in, goto error);
1230 isl_assert(base->ctx, base->dim->n_out <= dim->n_out, goto error);
1231 extra += base->extra;
1233 n_ineq += base->n_ineq;
1235 ext = isl_basic_map_alloc_dim(dim, extra, n_eq, n_ineq);
1241 ext->sample = isl_vec_copy(base->sample);
1242 flags = base->flags;
1243 ext = add_constraints(ext, base, 0, 0);
1246 ISL_F_CLR(ext, ISL_BASIC_SET_FINAL);
1253 isl_basic_map_free(base);
1257 struct isl_basic_set *isl_basic_set_extend_dim(struct isl_basic_set *base,
1258 struct isl_dim *dim, unsigned extra,
1259 unsigned n_eq, unsigned n_ineq)
1261 return (struct isl_basic_set *)
1262 isl_basic_map_extend_dim((struct isl_basic_map *)base, dim,
1263 extra, n_eq, n_ineq);
1266 struct isl_basic_map *isl_basic_map_extend_constraints(
1267 struct isl_basic_map *base, unsigned n_eq, unsigned n_ineq)
1271 return isl_basic_map_extend_dim(base, isl_dim_copy(base->dim),
1275 struct isl_basic_map *isl_basic_map_extend(struct isl_basic_map *base,
1276 unsigned nparam, unsigned n_in, unsigned n_out, unsigned extra,
1277 unsigned n_eq, unsigned n_ineq)
1279 struct isl_basic_map *bmap;
1280 struct isl_dim *dim;
1284 dim = isl_dim_alloc(base->ctx, nparam, n_in, n_out);
1288 bmap = isl_basic_map_extend_dim(base, dim, extra, n_eq, n_ineq);
1291 isl_basic_map_free(base);
1295 struct isl_basic_set *isl_basic_set_extend(struct isl_basic_set *base,
1296 unsigned nparam, unsigned dim, unsigned extra,
1297 unsigned n_eq, unsigned n_ineq)
1299 return (struct isl_basic_set *)
1300 isl_basic_map_extend((struct isl_basic_map *)base,
1301 nparam, 0, dim, extra, n_eq, n_ineq);
1304 struct isl_basic_set *isl_basic_set_extend_constraints(
1305 struct isl_basic_set *base, unsigned n_eq, unsigned n_ineq)
1307 return (struct isl_basic_set *)
1308 isl_basic_map_extend_constraints((struct isl_basic_map *)base,
1312 struct isl_basic_set *isl_basic_set_cow(struct isl_basic_set *bset)
1314 return (struct isl_basic_set *)
1315 isl_basic_map_cow((struct isl_basic_map *)bset);
1318 struct isl_basic_map *isl_basic_map_cow(struct isl_basic_map *bmap)
1323 if (bmap->ref > 1) {
1325 bmap = isl_basic_map_dup(bmap);
1328 ISL_F_CLR(bmap, ISL_BASIC_SET_FINAL);
1332 struct isl_set *isl_set_cow(struct isl_set *set)
1340 return isl_set_dup(set);
1343 struct isl_map *isl_map_cow(struct isl_map *map)
1351 return isl_map_dup(map);
1354 static void swap_vars(struct isl_blk blk, isl_int *a,
1355 unsigned a_len, unsigned b_len)
1357 isl_seq_cpy(blk.data, a+a_len, b_len);
1358 isl_seq_cpy(blk.data+b_len, a, a_len);
1359 isl_seq_cpy(a, blk.data, b_len+a_len);
1362 static __isl_give isl_basic_map *isl_basic_map_swap_vars(
1363 __isl_take isl_basic_map *bmap, unsigned pos, unsigned n1, unsigned n2)
1371 isl_assert(bmap->ctx,
1372 pos + n1 + n2 <= 1 + isl_basic_map_total_dim(bmap), goto error);
1374 if (n1 == 0 || n2 == 0)
1377 bmap = isl_basic_map_cow(bmap);
1381 blk = isl_blk_alloc(bmap->ctx, n1 + n2);
1382 if (isl_blk_is_error(blk))
1385 for (i = 0; i < bmap->n_eq; ++i)
1387 bmap->eq[i] + pos, n1, n2);
1389 for (i = 0; i < bmap->n_ineq; ++i)
1391 bmap->ineq[i] + pos, n1, n2);
1393 for (i = 0; i < bmap->n_div; ++i)
1395 bmap->div[i]+1 + pos, n1, n2);
1397 isl_blk_free(bmap->ctx, blk);
1399 ISL_F_CLR(bmap, ISL_BASIC_SET_NORMALIZED);
1400 bmap = isl_basic_map_gauss(bmap, NULL);
1401 return isl_basic_map_finalize(bmap);
1403 isl_basic_map_free(bmap);
1407 static __isl_give isl_basic_set *isl_basic_set_swap_vars(
1408 __isl_take isl_basic_set *bset, unsigned n)
1413 nparam = isl_basic_set_n_param(bset);
1414 dim = isl_basic_set_n_dim(bset);
1415 isl_assert(bset->ctx, n <= dim, goto error);
1417 return isl_basic_map_swap_vars(bset, 1 + nparam, n, dim - n);
1419 isl_basic_set_free(bset);
1423 struct isl_basic_map *isl_basic_map_set_to_empty(struct isl_basic_map *bmap)
1429 total = isl_basic_map_total_dim(bmap);
1430 isl_basic_map_free_div(bmap, bmap->n_div);
1431 isl_basic_map_free_inequality(bmap, bmap->n_ineq);
1433 isl_basic_map_free_equality(bmap, bmap->n_eq-1);
1435 i = isl_basic_map_alloc_equality(bmap);
1439 isl_int_set_si(bmap->eq[i][0], 1);
1440 isl_seq_clr(bmap->eq[i]+1, total);
1441 ISL_F_SET(bmap, ISL_BASIC_MAP_EMPTY);
1442 isl_vec_free(bmap->sample);
1443 bmap->sample = NULL;
1444 return isl_basic_map_finalize(bmap);
1446 isl_basic_map_free(bmap);
1450 struct isl_basic_set *isl_basic_set_set_to_empty(struct isl_basic_set *bset)
1452 return (struct isl_basic_set *)
1453 isl_basic_map_set_to_empty((struct isl_basic_map *)bset);
1456 void isl_basic_map_swap_div(struct isl_basic_map *bmap, int a, int b)
1459 unsigned off = isl_dim_total(bmap->dim);
1460 isl_int *t = bmap->div[a];
1461 bmap->div[a] = bmap->div[b];
1464 for (i = 0; i < bmap->n_eq; ++i)
1465 isl_int_swap(bmap->eq[i][1+off+a], bmap->eq[i][1+off+b]);
1467 for (i = 0; i < bmap->n_ineq; ++i)
1468 isl_int_swap(bmap->ineq[i][1+off+a], bmap->ineq[i][1+off+b]);
1470 for (i = 0; i < bmap->n_div; ++i)
1471 isl_int_swap(bmap->div[i][1+1+off+a], bmap->div[i][1+1+off+b]);
1472 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1475 /* Eliminate the specified n dimensions starting at first from the
1476 * constraints using Fourier-Motzkin. The dimensions themselves
1479 __isl_give isl_map *isl_map_eliminate(__isl_take isl_map *map,
1480 enum isl_dim_type type, unsigned first, unsigned n)
1489 map = isl_map_cow(map);
1492 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
1493 first += pos(map->dim, type) - 1;
1495 for (i = 0; i < map->n; ++i) {
1496 map->p[i] = isl_basic_map_eliminate_vars(map->p[i], first, n);
1506 /* Eliminate the specified n dimensions starting at first from the
1507 * constraints using Fourier-Motzkin. The dimensions themselves
1510 __isl_give isl_set *isl_set_eliminate(__isl_take isl_set *set,
1511 enum isl_dim_type type, unsigned first, unsigned n)
1513 return (isl_set *)isl_map_eliminate((isl_map *)set, type, first, n);
1516 /* Eliminate the specified n dimensions starting at first from the
1517 * constraints using Fourier-Motzkin. The dimensions themselves
1520 __isl_give isl_set *isl_set_eliminate_dims(__isl_take isl_set *set,
1521 unsigned first, unsigned n)
1523 return isl_set_eliminate(set, isl_dim_set, first, n);
1526 __isl_give isl_basic_map *isl_basic_map_remove_divs(
1527 __isl_take isl_basic_map *bmap)
1531 bmap = isl_basic_map_eliminate_vars(bmap, isl_dim_total(bmap->dim),
1536 return isl_basic_map_finalize(bmap);
1539 __isl_give isl_basic_set *isl_basic_set_remove_divs(
1540 __isl_take isl_basic_set *bset)
1542 return (struct isl_basic_set *)isl_basic_map_remove_divs(
1543 (struct isl_basic_map *)bset);
1546 __isl_give isl_map *isl_map_remove_divs(__isl_take isl_map *map)
1555 map = isl_map_cow(map);
1559 for (i = 0; i < map->n; ++i) {
1560 map->p[i] = isl_basic_map_remove_divs(map->p[i]);
1570 __isl_give isl_set *isl_set_remove_divs(__isl_take isl_set *set)
1572 return isl_map_remove_divs(set);
1575 struct isl_basic_map *isl_basic_map_remove_dims(struct isl_basic_map *bmap,
1576 enum isl_dim_type type, unsigned first, unsigned n)
1580 isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
1582 if (n == 0 && !isl_dim_is_named_or_nested(bmap->dim, type))
1584 bmap = isl_basic_map_eliminate_vars(bmap,
1585 isl_basic_map_offset(bmap, type) - 1 + first, n);
1588 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY) && type == isl_dim_div)
1590 bmap = isl_basic_map_drop(bmap, type, first, n);
1593 isl_basic_map_free(bmap);
1597 /* Return true if the definition of the given div (recursively) involves
1598 * any of the given variables.
1600 static int div_involves_vars(__isl_keep isl_basic_map *bmap, int div,
1601 unsigned first, unsigned n)
1604 unsigned div_offset = isl_basic_map_offset(bmap, isl_dim_div);
1606 if (isl_int_is_zero(bmap->div[div][0]))
1608 if (isl_seq_first_non_zero(bmap->div[div] + 1 + first, n) >= 0)
1611 for (i = bmap->n_div - 1; i >= 0; --i) {
1612 if (isl_int_is_zero(bmap->div[div][1 + div_offset + i]))
1614 if (div_involves_vars(bmap, i, first, n))
1621 /* Remove all divs (recursively) involving any of the given dimensions
1622 * in their definitions.
1624 __isl_give isl_basic_map *isl_basic_map_remove_divs_involving_dims(
1625 __isl_take isl_basic_map *bmap,
1626 enum isl_dim_type type, unsigned first, unsigned n)
1632 isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
1634 first += isl_basic_map_offset(bmap, type);
1636 for (i = bmap->n_div - 1; i >= 0; --i) {
1637 if (!div_involves_vars(bmap, i, first, n))
1639 bmap = isl_basic_map_remove_dims(bmap, isl_dim_div, i, 1);
1647 isl_basic_map_free(bmap);
1651 __isl_give isl_map *isl_map_remove_divs_involving_dims(__isl_take isl_map *map,
1652 enum isl_dim_type type, unsigned first, unsigned n)
1661 map = isl_map_cow(map);
1665 for (i = 0; i < map->n; ++i) {
1666 map->p[i] = isl_basic_map_remove_divs_involving_dims(map->p[i],
1677 __isl_give isl_set *isl_set_remove_divs_involving_dims(__isl_take isl_set *set,
1678 enum isl_dim_type type, unsigned first, unsigned n)
1680 return (isl_set *)isl_map_remove_divs_involving_dims((isl_map *)set,
1684 int isl_basic_map_involves_dims(__isl_keep isl_basic_map *bmap,
1685 enum isl_dim_type type, unsigned first, unsigned n)
1692 if (first + n > isl_basic_map_dim(bmap, type))
1693 isl_die(bmap->ctx, isl_error_invalid,
1694 "index out of bounds", return -1);
1696 first += isl_basic_map_offset(bmap, type);
1697 for (i = 0; i < bmap->n_eq; ++i)
1698 if (isl_seq_first_non_zero(bmap->eq[i] + first, n) >= 0)
1700 for (i = 0; i < bmap->n_ineq; ++i)
1701 if (isl_seq_first_non_zero(bmap->ineq[i] + first, n) >= 0)
1707 int isl_map_involves_dims(__isl_keep isl_map *map,
1708 enum isl_dim_type type, unsigned first, unsigned n)
1715 if (first + n > isl_map_dim(map, type))
1716 isl_die(map->ctx, isl_error_invalid,
1717 "index out of bounds", return -1);
1719 for (i = 0; i < map->n; ++i) {
1720 int involves = isl_basic_map_involves_dims(map->p[i],
1722 if (involves < 0 || !involves)
1729 int isl_basic_set_involves_dims(__isl_keep isl_basic_set *bset,
1730 enum isl_dim_type type, unsigned first, unsigned n)
1732 return isl_basic_map_involves_dims(bset, type, first, n);
1735 int isl_set_involves_dims(__isl_keep isl_set *set,
1736 enum isl_dim_type type, unsigned first, unsigned n)
1738 return isl_map_involves_dims(set, type, first, n);
1741 /* Return true if the definition of the given div is unknown or depends
1744 static int div_is_unknown(__isl_keep isl_basic_map *bmap, int div)
1747 unsigned div_offset = isl_basic_map_offset(bmap, isl_dim_div);
1749 if (isl_int_is_zero(bmap->div[div][0]))
1752 for (i = bmap->n_div - 1; i >= 0; --i) {
1753 if (isl_int_is_zero(bmap->div[div][1 + div_offset + i]))
1755 if (div_is_unknown(bmap, i))
1762 /* Remove all divs that are unknown or defined in terms of unknown divs.
1764 __isl_give isl_basic_map *isl_basic_map_remove_unknown_divs(
1765 __isl_take isl_basic_map *bmap)
1772 for (i = bmap->n_div - 1; i >= 0; --i) {
1773 if (!div_is_unknown(bmap, i))
1775 bmap = isl_basic_map_remove_dims(bmap, isl_dim_div, i, 1);
1781 __isl_give isl_map *isl_map_remove_unknown_divs(__isl_take isl_map *map)
1790 map = isl_map_cow(map);
1794 for (i = 0; i < map->n; ++i) {
1795 map->p[i] = isl_basic_map_remove_unknown_divs(map->p[i]);
1805 __isl_give isl_set *isl_set_remove_unknown_divs(__isl_take isl_set *set)
1807 return (isl_set *)isl_map_remove_unknown_divs((isl_map *)set);
1810 __isl_give isl_basic_set *isl_basic_set_remove_dims(
1811 __isl_take isl_basic_set *bset,
1812 enum isl_dim_type type, unsigned first, unsigned n)
1814 return (isl_basic_set *)
1815 isl_basic_map_remove_dims((isl_basic_map *)bset, type, first, n);
1818 struct isl_map *isl_map_remove_dims(struct isl_map *map,
1819 enum isl_dim_type type, unsigned first, unsigned n)
1826 map = isl_map_cow(map);
1829 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
1831 for (i = 0; i < map->n; ++i) {
1832 map->p[i] = isl_basic_map_eliminate_vars(map->p[i],
1833 isl_basic_map_offset(map->p[i], type) - 1 + first, n);
1837 map = isl_map_drop(map, type, first, n);
1844 __isl_give isl_set *isl_set_remove_dims(__isl_take isl_set *bset,
1845 enum isl_dim_type type, unsigned first, unsigned n)
1847 return (isl_set *)isl_map_remove_dims((isl_map *)bset, type, first, n);
1850 /* Project out n inputs starting at first using Fourier-Motzkin */
1851 struct isl_map *isl_map_remove_inputs(struct isl_map *map,
1852 unsigned first, unsigned n)
1854 return isl_map_remove_dims(map, isl_dim_in, first, n);
1857 static void dump_term(struct isl_basic_map *bmap,
1858 isl_int c, int pos, FILE *out)
1861 unsigned in = isl_basic_map_n_in(bmap);
1862 unsigned dim = in + isl_basic_map_n_out(bmap);
1863 unsigned nparam = isl_basic_map_n_param(bmap);
1865 isl_int_print(out, c, 0);
1867 if (!isl_int_is_one(c))
1868 isl_int_print(out, c, 0);
1869 if (pos < 1 + nparam) {
1870 name = isl_dim_get_name(bmap->dim,
1871 isl_dim_param, pos - 1);
1873 fprintf(out, "%s", name);
1875 fprintf(out, "p%d", pos - 1);
1876 } else if (pos < 1 + nparam + in)
1877 fprintf(out, "i%d", pos - 1 - nparam);
1878 else if (pos < 1 + nparam + dim)
1879 fprintf(out, "o%d", pos - 1 - nparam - in);
1881 fprintf(out, "e%d", pos - 1 - nparam - dim);
1885 static void dump_constraint_sign(struct isl_basic_map *bmap, isl_int *c,
1886 int sign, FILE *out)
1890 unsigned len = 1 + isl_basic_map_total_dim(bmap);
1894 for (i = 0, first = 1; i < len; ++i) {
1895 if (isl_int_sgn(c[i]) * sign <= 0)
1898 fprintf(out, " + ");
1900 isl_int_abs(v, c[i]);
1901 dump_term(bmap, v, i, out);
1908 static void dump_constraint(struct isl_basic_map *bmap, isl_int *c,
1909 const char *op, FILE *out, int indent)
1913 fprintf(out, "%*s", indent, "");
1915 dump_constraint_sign(bmap, c, 1, out);
1916 fprintf(out, " %s ", op);
1917 dump_constraint_sign(bmap, c, -1, out);
1921 for (i = bmap->n_div; i < bmap->extra; ++i) {
1922 if (isl_int_is_zero(c[1+isl_dim_total(bmap->dim)+i]))
1924 fprintf(out, "%*s", indent, "");
1925 fprintf(out, "ERROR: unused div coefficient not zero\n");
1930 static void dump_constraints(struct isl_basic_map *bmap,
1931 isl_int **c, unsigned n,
1932 const char *op, FILE *out, int indent)
1936 for (i = 0; i < n; ++i)
1937 dump_constraint(bmap, c[i], op, out, indent);
1940 static void dump_affine(struct isl_basic_map *bmap, isl_int *exp, FILE *out)
1944 unsigned total = isl_basic_map_total_dim(bmap);
1946 for (j = 0; j < 1 + total; ++j) {
1947 if (isl_int_is_zero(exp[j]))
1949 if (!first && isl_int_is_pos(exp[j]))
1951 dump_term(bmap, exp[j], j, out);
1956 static void dump(struct isl_basic_map *bmap, FILE *out, int indent)
1960 dump_constraints(bmap, bmap->eq, bmap->n_eq, "=", out, indent);
1961 dump_constraints(bmap, bmap->ineq, bmap->n_ineq, ">=", out, indent);
1963 for (i = 0; i < bmap->n_div; ++i) {
1964 fprintf(out, "%*s", indent, "");
1965 fprintf(out, "e%d = [(", i);
1966 dump_affine(bmap, bmap->div[i]+1, out);
1968 isl_int_print(out, bmap->div[i][0], 0);
1969 fprintf(out, "]\n");
1973 void isl_basic_set_print_internal(struct isl_basic_set *bset,
1974 FILE *out, int indent)
1977 fprintf(out, "null basic set\n");
1981 fprintf(out, "%*s", indent, "");
1982 fprintf(out, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n",
1983 bset->ref, bset->dim->nparam, bset->dim->n_out,
1984 bset->extra, bset->flags);
1985 dump((struct isl_basic_map *)bset, out, indent);
1988 void isl_basic_map_print_internal(struct isl_basic_map *bmap,
1989 FILE *out, int indent)
1992 fprintf(out, "null basic map\n");
1996 fprintf(out, "%*s", indent, "");
1997 fprintf(out, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, "
1998 "flags: %x, n_name: %d\n",
2000 bmap->dim->nparam, bmap->dim->n_in, bmap->dim->n_out,
2001 bmap->extra, bmap->flags, bmap->dim->n_id);
2002 dump(bmap, out, indent);
2005 int isl_inequality_negate(struct isl_basic_map *bmap, unsigned pos)
2010 total = isl_basic_map_total_dim(bmap);
2011 isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
2012 isl_seq_neg(bmap->ineq[pos], bmap->ineq[pos], 1 + total);
2013 isl_int_sub_ui(bmap->ineq[pos][0], bmap->ineq[pos][0], 1);
2014 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
2018 struct isl_set *isl_set_alloc_dim(struct isl_dim *dim, int n, unsigned flags)
2020 struct isl_set *set;
2024 isl_assert(dim->ctx, dim->n_in == 0, goto error);
2025 isl_assert(dim->ctx, n >= 0, goto error);
2026 set = isl_alloc(dim->ctx, struct isl_set,
2027 sizeof(struct isl_set) +
2028 (n - 1) * sizeof(struct isl_basic_set *));
2032 set->ctx = dim->ctx;
2033 isl_ctx_ref(set->ctx);
2045 struct isl_set *isl_set_alloc(struct isl_ctx *ctx,
2046 unsigned nparam, unsigned dim, int n, unsigned flags)
2048 struct isl_set *set;
2049 struct isl_dim *dims;
2051 dims = isl_dim_alloc(ctx, nparam, 0, dim);
2055 set = isl_set_alloc_dim(dims, n, flags);
2059 /* Make sure "map" has room for at least "n" more basic maps.
2061 struct isl_map *isl_map_grow(struct isl_map *map, int n)
2064 struct isl_map *grown = NULL;
2068 isl_assert(map->ctx, n >= 0, goto error);
2069 if (map->n + n <= map->size)
2071 grown = isl_map_alloc_dim(isl_map_get_dim(map), map->n + n, map->flags);
2074 for (i = 0; i < map->n; ++i) {
2075 grown->p[i] = isl_basic_map_copy(map->p[i]);
2083 isl_map_free(grown);
2088 /* Make sure "set" has room for at least "n" more basic sets.
2090 struct isl_set *isl_set_grow(struct isl_set *set, int n)
2092 return (struct isl_set *)isl_map_grow((struct isl_map *)set, n);
2095 struct isl_set *isl_set_dup(struct isl_set *set)
2098 struct isl_set *dup;
2103 dup = isl_set_alloc_dim(isl_dim_copy(set->dim), set->n, set->flags);
2106 for (i = 0; i < set->n; ++i)
2107 dup = isl_set_add_basic_set(dup, isl_basic_set_copy(set->p[i]));
2111 struct isl_set *isl_set_from_basic_set(struct isl_basic_set *bset)
2113 return isl_map_from_basic_map(bset);
2116 struct isl_map *isl_map_from_basic_map(struct isl_basic_map *bmap)
2118 struct isl_map *map;
2123 map = isl_map_alloc_dim(isl_dim_copy(bmap->dim), 1, ISL_MAP_DISJOINT);
2124 return isl_map_add_basic_map(map, bmap);
2127 __isl_give isl_set *isl_set_add_basic_set(__isl_take isl_set *set,
2128 __isl_take isl_basic_set *bset)
2130 return (struct isl_set *)isl_map_add_basic_map((struct isl_map *)set,
2131 (struct isl_basic_map *)bset);
2134 void isl_set_free(struct isl_set *set)
2144 isl_ctx_deref(set->ctx);
2145 for (i = 0; i < set->n; ++i)
2146 isl_basic_set_free(set->p[i]);
2147 isl_dim_free(set->dim);
2151 void isl_set_print_internal(struct isl_set *set, FILE *out, int indent)
2156 fprintf(out, "null set\n");
2160 fprintf(out, "%*s", indent, "");
2161 fprintf(out, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
2162 set->ref, set->n, set->dim->nparam, set->dim->n_out,
2164 for (i = 0; i < set->n; ++i) {
2165 fprintf(out, "%*s", indent, "");
2166 fprintf(out, "basic set %d:\n", i);
2167 isl_basic_set_print_internal(set->p[i], out, indent+4);
2171 void isl_map_print_internal(struct isl_map *map, FILE *out, int indent)
2176 fprintf(out, "null map\n");
2180 fprintf(out, "%*s", indent, "");
2181 fprintf(out, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, "
2182 "flags: %x, n_name: %d\n",
2183 map->ref, map->n, map->dim->nparam, map->dim->n_in,
2184 map->dim->n_out, map->flags, map->dim->n_id);
2185 for (i = 0; i < map->n; ++i) {
2186 fprintf(out, "%*s", indent, "");
2187 fprintf(out, "basic map %d:\n", i);
2188 isl_basic_map_print_internal(map->p[i], out, indent+4);
2192 struct isl_basic_map *isl_basic_map_intersect_domain(
2193 struct isl_basic_map *bmap, struct isl_basic_set *bset)
2195 struct isl_basic_map *bmap_domain;
2200 isl_assert(bset->ctx, isl_dim_match(bmap->dim, isl_dim_param,
2201 bset->dim, isl_dim_param), goto error);
2203 if (isl_dim_size(bset->dim, isl_dim_set) != 0)
2204 isl_assert(bset->ctx,
2205 isl_basic_map_compatible_domain(bmap, bset), goto error);
2207 bmap = isl_basic_map_cow(bmap);
2210 bmap = isl_basic_map_extend_dim(bmap, isl_dim_copy(bmap->dim),
2211 bset->n_div, bset->n_eq, bset->n_ineq);
2212 bmap_domain = isl_basic_map_from_domain(bset);
2213 bmap = add_constraints(bmap, bmap_domain, 0, 0);
2215 bmap = isl_basic_map_simplify(bmap);
2216 return isl_basic_map_finalize(bmap);
2218 isl_basic_map_free(bmap);
2219 isl_basic_set_free(bset);
2223 struct isl_basic_map *isl_basic_map_intersect_range(
2224 struct isl_basic_map *bmap, struct isl_basic_set *bset)
2226 struct isl_basic_map *bmap_range;
2231 isl_assert(bset->ctx, isl_dim_match(bmap->dim, isl_dim_param,
2232 bset->dim, isl_dim_param), goto error);
2234 if (isl_dim_size(bset->dim, isl_dim_set) != 0)
2235 isl_assert(bset->ctx,
2236 isl_basic_map_compatible_range(bmap, bset), goto error);
2238 if (isl_basic_set_is_universe(bset)) {
2239 isl_basic_set_free(bset);
2243 bmap = isl_basic_map_cow(bmap);
2246 bmap = isl_basic_map_extend_dim(bmap, isl_dim_copy(bmap->dim),
2247 bset->n_div, bset->n_eq, bset->n_ineq);
2248 bmap_range = isl_basic_map_from_basic_set(bset, isl_dim_copy(bset->dim));
2249 bmap = add_constraints(bmap, bmap_range, 0, 0);
2251 bmap = isl_basic_map_simplify(bmap);
2252 return isl_basic_map_finalize(bmap);
2254 isl_basic_map_free(bmap);
2255 isl_basic_set_free(bset);
2259 int isl_basic_map_contains(struct isl_basic_map *bmap, struct isl_vec *vec)
2265 total = 1 + isl_basic_map_total_dim(bmap);
2266 if (total != vec->size)
2271 for (i = 0; i < bmap->n_eq; ++i) {
2272 isl_seq_inner_product(vec->el, bmap->eq[i], total, &s);
2273 if (!isl_int_is_zero(s)) {
2279 for (i = 0; i < bmap->n_ineq; ++i) {
2280 isl_seq_inner_product(vec->el, bmap->ineq[i], total, &s);
2281 if (isl_int_is_neg(s)) {
2292 int isl_basic_set_contains(struct isl_basic_set *bset, struct isl_vec *vec)
2294 return isl_basic_map_contains((struct isl_basic_map *)bset, vec);
2297 struct isl_basic_map *isl_basic_map_intersect(
2298 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2300 struct isl_vec *sample = NULL;
2302 if (!bmap1 || !bmap2)
2305 isl_assert(bmap1->ctx, isl_dim_match(bmap1->dim, isl_dim_param,
2306 bmap2->dim, isl_dim_param), goto error);
2307 if (isl_dim_total(bmap1->dim) ==
2308 isl_dim_size(bmap1->dim, isl_dim_param) &&
2309 isl_dim_total(bmap2->dim) !=
2310 isl_dim_size(bmap2->dim, isl_dim_param))
2311 return isl_basic_map_intersect(bmap2, bmap1);
2313 if (isl_dim_total(bmap2->dim) !=
2314 isl_dim_size(bmap2->dim, isl_dim_param))
2315 isl_assert(bmap1->ctx,
2316 isl_dim_equal(bmap1->dim, bmap2->dim), goto error);
2318 if (bmap1->sample &&
2319 isl_basic_map_contains(bmap1, bmap1->sample) > 0 &&
2320 isl_basic_map_contains(bmap2, bmap1->sample) > 0)
2321 sample = isl_vec_copy(bmap1->sample);
2322 else if (bmap2->sample &&
2323 isl_basic_map_contains(bmap1, bmap2->sample) > 0 &&
2324 isl_basic_map_contains(bmap2, bmap2->sample) > 0)
2325 sample = isl_vec_copy(bmap2->sample);
2327 bmap1 = isl_basic_map_cow(bmap1);
2330 bmap1 = isl_basic_map_extend_dim(bmap1, isl_dim_copy(bmap1->dim),
2331 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
2332 bmap1 = add_constraints(bmap1, bmap2, 0, 0);
2335 isl_vec_free(sample);
2337 isl_vec_free(bmap1->sample);
2338 bmap1->sample = sample;
2341 bmap1 = isl_basic_map_simplify(bmap1);
2342 return isl_basic_map_finalize(bmap1);
2345 isl_vec_free(sample);
2346 isl_basic_map_free(bmap1);
2347 isl_basic_map_free(bmap2);
2351 struct isl_basic_set *isl_basic_set_intersect(
2352 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
2354 return (struct isl_basic_set *)
2355 isl_basic_map_intersect(
2356 (struct isl_basic_map *)bset1,
2357 (struct isl_basic_map *)bset2);
2360 /* Special case of isl_map_intersect, where both map1 and map2
2361 * are convex, without any divs and such that either map1 or map2
2362 * contains a single constraint. This constraint is then simply
2363 * added to the other map.
2365 static __isl_give isl_map *map_intersect_add_constraint(
2366 __isl_take isl_map *map1, __isl_take isl_map *map2)
2368 isl_assert(map1->ctx, map1->n == 1, goto error);
2369 isl_assert(map2->ctx, map1->n == 1, goto error);
2370 isl_assert(map1->ctx, map1->p[0]->n_div == 0, goto error);
2371 isl_assert(map2->ctx, map1->p[0]->n_div == 0, goto error);
2373 if (map2->p[0]->n_eq + map2->p[0]->n_ineq != 1)
2374 return isl_map_intersect(map2, map1);
2376 isl_assert(map2->ctx,
2377 map2->p[0]->n_eq + map2->p[0]->n_ineq == 1, goto error);
2379 map1 = isl_map_cow(map1);
2382 if (isl_map_plain_is_empty(map1)) {
2386 map1->p[0] = isl_basic_map_cow(map1->p[0]);
2387 if (map2->p[0]->n_eq == 1)
2388 map1->p[0] = isl_basic_map_add_eq(map1->p[0], map2->p[0]->eq[0]);
2390 map1->p[0] = isl_basic_map_add_ineq(map1->p[0],
2391 map2->p[0]->ineq[0]);
2393 map1->p[0] = isl_basic_map_simplify(map1->p[0]);
2394 map1->p[0] = isl_basic_map_finalize(map1->p[0]);
2398 if (isl_basic_map_plain_is_empty(map1->p[0])) {
2399 isl_basic_map_free(map1->p[0]);
2412 static __isl_give isl_map *map_intersect(__isl_take isl_map *map1,
2413 __isl_take isl_map *map2)
2416 struct isl_map *result;
2422 if (isl_map_plain_is_empty(map1) &&
2423 isl_dim_equal(map1->dim, map2->dim)) {
2427 if (isl_map_plain_is_empty(map2) &&
2428 isl_dim_equal(map1->dim, map2->dim)) {
2433 if (map1->n == 1 && map2->n == 1 &&
2434 map1->p[0]->n_div == 0 && map2->p[0]->n_div == 0 &&
2435 isl_dim_equal(map1->dim, map2->dim) &&
2436 (map1->p[0]->n_eq + map1->p[0]->n_ineq == 1 ||
2437 map2->p[0]->n_eq + map2->p[0]->n_ineq == 1))
2438 return map_intersect_add_constraint(map1, map2);
2439 if (isl_dim_total(map1->dim) ==
2440 isl_dim_size(map1->dim, isl_dim_param) &&
2441 isl_dim_total(map2->dim) != isl_dim_size(map2->dim, isl_dim_param))
2442 return isl_map_intersect(map2, map1);
2444 if (isl_dim_total(map2->dim) != isl_dim_size(map2->dim, isl_dim_param))
2445 isl_assert(map1->ctx,
2446 isl_dim_equal(map1->dim, map2->dim), goto error);
2448 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
2449 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
2450 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
2452 result = isl_map_alloc_dim(isl_dim_copy(map1->dim),
2453 map1->n * map2->n, flags);
2456 for (i = 0; i < map1->n; ++i)
2457 for (j = 0; j < map2->n; ++j) {
2458 struct isl_basic_map *part;
2459 part = isl_basic_map_intersect(
2460 isl_basic_map_copy(map1->p[i]),
2461 isl_basic_map_copy(map2->p[j]));
2462 if (isl_basic_map_is_empty(part))
2463 isl_basic_map_free(part);
2465 result = isl_map_add_basic_map(result, part);
2478 __isl_give isl_map *isl_map_intersect(__isl_take isl_map *map1,
2479 __isl_take isl_map *map2)
2481 return isl_map_align_params_map_map_and(map1, map2, &map_intersect);
2484 struct isl_set *isl_set_intersect(struct isl_set *set1, struct isl_set *set2)
2486 return (struct isl_set *)
2487 isl_map_intersect((struct isl_map *)set1,
2488 (struct isl_map *)set2);
2491 /* The current implementation of isl_map_intersect accepts intersections
2492 * with parameter domains, so we can just call that for now.
2494 static __isl_give isl_map *map_intersect_params(__isl_take isl_map *map,
2495 __isl_take isl_set *params)
2497 return isl_map_intersect(map, params);
2500 __isl_give isl_map *isl_map_intersect_params(__isl_take isl_map *map1,
2501 __isl_take isl_map *map2)
2503 return isl_map_align_params_map_map_and(map1, map2, &map_intersect_params);
2506 __isl_give isl_set *isl_set_intersect_params(__isl_take isl_set *set,
2507 __isl_take isl_set *params)
2509 return isl_map_intersect_params(set, params);
2512 struct isl_basic_map *isl_basic_map_reverse(struct isl_basic_map *bmap)
2514 struct isl_dim *dim;
2515 struct isl_basic_set *bset;
2520 bmap = isl_basic_map_cow(bmap);
2523 dim = isl_dim_reverse(isl_dim_copy(bmap->dim));
2524 in = isl_basic_map_n_in(bmap);
2525 bset = isl_basic_set_from_basic_map(bmap);
2526 bset = isl_basic_set_swap_vars(bset, in);
2527 return isl_basic_map_from_basic_set(bset, dim);
2530 __isl_give isl_basic_map *isl_basic_map_insert(__isl_take isl_basic_map *bmap,
2531 enum isl_dim_type type, unsigned pos, unsigned n)
2533 struct isl_dim *res_dim;
2534 struct isl_basic_map *res;
2535 struct isl_dim_map *dim_map;
2536 unsigned total, off;
2537 enum isl_dim_type t;
2545 res_dim = isl_dim_insert(isl_basic_map_get_dim(bmap), type, pos, n);
2547 total = isl_basic_map_total_dim(bmap) + n;
2548 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2550 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
2552 isl_dim_map_dim(dim_map, bmap->dim, t, off);
2554 unsigned size = isl_basic_map_dim(bmap, t);
2555 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2557 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2558 pos, size - pos, off + pos + n);
2560 off += isl_dim_size(res_dim, t);
2562 isl_dim_map_div(dim_map, bmap, off);
2564 res = isl_basic_map_alloc_dim(res_dim,
2565 bmap->n_div, bmap->n_eq, bmap->n_ineq);
2566 if (isl_basic_map_is_rational(bmap))
2567 res = isl_basic_map_set_rational(res);
2568 res = isl_basic_map_add_constraints_dim_map(res, bmap, dim_map);
2569 return isl_basic_map_finalize(res);
2572 __isl_give isl_basic_map *isl_basic_map_add(__isl_take isl_basic_map *bmap,
2573 enum isl_dim_type type, unsigned n)
2577 return isl_basic_map_insert(bmap, type,
2578 isl_basic_map_dim(bmap, type), n);
2581 __isl_give isl_basic_set *isl_basic_set_add(__isl_take isl_basic_set *bset,
2582 enum isl_dim_type type, unsigned n)
2586 isl_assert(bset->ctx, type != isl_dim_in, goto error);
2587 return (isl_basic_set *)isl_basic_map_add((isl_basic_map *)bset, type, n);
2589 isl_basic_set_free(bset);
2593 __isl_give isl_map *isl_map_insert(__isl_take isl_map *map,
2594 enum isl_dim_type type, unsigned pos, unsigned n)
2601 map = isl_map_cow(map);
2605 map->dim = isl_dim_insert(map->dim, type, pos, n);
2609 for (i = 0; i < map->n; ++i) {
2610 map->p[i] = isl_basic_map_insert(map->p[i], type, pos, n);
2621 __isl_give isl_set *isl_set_insert(__isl_take isl_set *set,
2622 enum isl_dim_type type, unsigned pos, unsigned n)
2624 return (isl_set *)isl_map_insert((isl_map *)set, type, pos, n);
2627 __isl_give isl_map *isl_map_add_dims(__isl_take isl_map *map,
2628 enum isl_dim_type type, unsigned n)
2632 return isl_map_insert(map, type, isl_map_dim(map, type), n);
2635 __isl_give isl_set *isl_set_add_dims(__isl_take isl_set *set,
2636 enum isl_dim_type type, unsigned n)
2640 isl_assert(set->ctx, type != isl_dim_in, goto error);
2641 return (isl_set *)isl_map_add_dims((isl_map *)set, type, n);
2647 __isl_give isl_basic_map *isl_basic_map_move_dims(
2648 __isl_take isl_basic_map *bmap,
2649 enum isl_dim_type dst_type, unsigned dst_pos,
2650 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2652 struct isl_dim_map *dim_map;
2653 struct isl_basic_map *res;
2654 enum isl_dim_type t;
2655 unsigned total, off;
2662 isl_assert(bmap->ctx, src_pos + n <= isl_basic_map_dim(bmap, src_type),
2665 if (dst_type == src_type && dst_pos == src_pos)
2668 isl_assert(bmap->ctx, dst_type != src_type, goto error);
2670 if (pos(bmap->dim, dst_type) + dst_pos ==
2671 pos(bmap->dim, src_type) + src_pos +
2672 ((src_type < dst_type) ? n : 0)) {
2673 bmap = isl_basic_map_cow(bmap);
2677 bmap->dim = isl_dim_move(bmap->dim, dst_type, dst_pos,
2678 src_type, src_pos, n);
2682 bmap = isl_basic_map_finalize(bmap);
2687 total = isl_basic_map_total_dim(bmap);
2688 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2691 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
2692 unsigned size = isl_dim_size(bmap->dim, t);
2693 if (t == dst_type) {
2694 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2697 isl_dim_map_dim_range(dim_map, bmap->dim, src_type,
2700 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2701 dst_pos, size - dst_pos, off);
2702 off += size - dst_pos;
2703 } else if (t == src_type) {
2704 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2707 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2708 src_pos + n, size - src_pos - n, off);
2709 off += size - src_pos - n;
2711 isl_dim_map_dim(dim_map, bmap->dim, t, off);
2715 isl_dim_map_div(dim_map, bmap, off);
2717 res = isl_basic_map_alloc_dim(isl_basic_map_get_dim(bmap),
2718 bmap->n_div, bmap->n_eq, bmap->n_ineq);
2719 bmap = isl_basic_map_add_constraints_dim_map(res, bmap, dim_map);
2721 bmap->dim = isl_dim_move(bmap->dim, dst_type, dst_pos,
2722 src_type, src_pos, n);
2726 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
2727 bmap = isl_basic_map_gauss(bmap, NULL);
2728 bmap = isl_basic_map_finalize(bmap);
2732 isl_basic_map_free(bmap);
2736 __isl_give isl_basic_set *isl_basic_set_move_dims(__isl_take isl_basic_set *bset,
2737 enum isl_dim_type dst_type, unsigned dst_pos,
2738 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2740 return (isl_basic_set *)isl_basic_map_move_dims(
2741 (isl_basic_map *)bset, dst_type, dst_pos, src_type, src_pos, n);
2744 __isl_give isl_set *isl_set_move_dims(__isl_take isl_set *set,
2745 enum isl_dim_type dst_type, unsigned dst_pos,
2746 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2750 isl_assert(set->ctx, dst_type != isl_dim_in, goto error);
2751 return (isl_set *)isl_map_move_dims((isl_map *)set, dst_type, dst_pos,
2752 src_type, src_pos, n);
2758 __isl_give isl_map *isl_map_move_dims(__isl_take isl_map *map,
2759 enum isl_dim_type dst_type, unsigned dst_pos,
2760 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2769 isl_assert(map->ctx, src_pos + n <= isl_map_dim(map, src_type),
2772 if (dst_type == src_type && dst_pos == src_pos)
2775 isl_assert(map->ctx, dst_type != src_type, goto error);
2777 map = isl_map_cow(map);
2781 map->dim = isl_dim_move(map->dim, dst_type, dst_pos, src_type, src_pos, n);
2785 for (i = 0; i < map->n; ++i) {
2786 map->p[i] = isl_basic_map_move_dims(map->p[i],
2788 src_type, src_pos, n);
2799 /* Move the specified dimensions to the last columns right before
2800 * the divs. Don't change the dimension specification of bmap.
2801 * That's the responsibility of the caller.
2803 static __isl_give isl_basic_map *move_last(__isl_take isl_basic_map *bmap,
2804 enum isl_dim_type type, unsigned first, unsigned n)
2806 struct isl_dim_map *dim_map;
2807 struct isl_basic_map *res;
2808 enum isl_dim_type t;
2809 unsigned total, off;
2813 if (pos(bmap->dim, type) + first + n == 1 + isl_dim_total(bmap->dim))
2816 total = isl_basic_map_total_dim(bmap);
2817 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2820 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
2821 unsigned size = isl_dim_size(bmap->dim, t);
2823 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2826 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2827 first, n, total - bmap->n_div - n);
2828 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2829 first + n, size - (first + n), off);
2830 off += size - (first + n);
2832 isl_dim_map_dim(dim_map, bmap->dim, t, off);
2836 isl_dim_map_div(dim_map, bmap, off + n);
2838 res = isl_basic_map_alloc_dim(isl_basic_map_get_dim(bmap),
2839 bmap->n_div, bmap->n_eq, bmap->n_ineq);
2840 res = isl_basic_map_add_constraints_dim_map(res, bmap, dim_map);
2844 /* Turn the n dimensions of type type, starting at first
2845 * into existentially quantified variables.
2847 __isl_give isl_basic_map *isl_basic_map_project_out(
2848 __isl_take isl_basic_map *bmap,
2849 enum isl_dim_type type, unsigned first, unsigned n)
2862 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL))
2863 return isl_basic_map_remove_dims(bmap, type, first, n);
2865 isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
2868 bmap = move_last(bmap, type, first, n);
2869 bmap = isl_basic_map_cow(bmap);
2873 row_size = 1 + isl_dim_total(bmap->dim) + bmap->extra;
2874 old = bmap->block2.data;
2875 bmap->block2 = isl_blk_extend(bmap->ctx, bmap->block2,
2876 (bmap->extra + n) * (1 + row_size));
2877 if (!bmap->block2.data)
2879 new_div = isl_alloc_array(bmap->ctx, isl_int *, bmap->extra + n);
2882 for (i = 0; i < n; ++i) {
2883 new_div[i] = bmap->block2.data +
2884 (bmap->extra + i) * (1 + row_size);
2885 isl_seq_clr(new_div[i], 1 + row_size);
2887 for (i = 0; i < bmap->extra; ++i)
2888 new_div[n + i] = bmap->block2.data + (bmap->div[i] - old);
2890 bmap->div = new_div;
2894 bmap->dim = isl_dim_drop(bmap->dim, type, first, n);
2897 bmap = isl_basic_map_simplify(bmap);
2898 bmap = isl_basic_map_drop_redundant_divs(bmap);
2899 return isl_basic_map_finalize(bmap);
2901 isl_basic_map_free(bmap);
2905 /* Turn the n dimensions of type type, starting at first
2906 * into existentially quantified variables.
2908 struct isl_basic_set *isl_basic_set_project_out(struct isl_basic_set *bset,
2909 enum isl_dim_type type, unsigned first, unsigned n)
2911 return (isl_basic_set *)isl_basic_map_project_out(
2912 (isl_basic_map *)bset, type, first, n);
2915 /* Turn the n dimensions of type type, starting at first
2916 * into existentially quantified variables.
2918 __isl_give isl_map *isl_map_project_out(__isl_take isl_map *map,
2919 enum isl_dim_type type, unsigned first, unsigned n)
2929 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
2931 map = isl_map_cow(map);
2935 map->dim = isl_dim_drop(map->dim, type, first, n);
2939 for (i = 0; i < map->n; ++i) {
2940 map->p[i] = isl_basic_map_project_out(map->p[i], type, first, n);
2951 /* Turn the n dimensions of type type, starting at first
2952 * into existentially quantified variables.
2954 __isl_give isl_set *isl_set_project_out(__isl_take isl_set *set,
2955 enum isl_dim_type type, unsigned first, unsigned n)
2957 return (isl_set *)isl_map_project_out((isl_map *)set, type, first, n);
2960 static struct isl_basic_map *add_divs(struct isl_basic_map *bmap, unsigned n)
2964 for (i = 0; i < n; ++i) {
2965 j = isl_basic_map_alloc_div(bmap);
2968 isl_seq_clr(bmap->div[j], 1+1+isl_basic_map_total_dim(bmap));
2972 isl_basic_map_free(bmap);
2976 struct isl_basic_map *isl_basic_map_apply_range(
2977 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2979 struct isl_dim *dim_result = NULL;
2980 struct isl_basic_map *bmap;
2981 unsigned n_in, n_out, n, nparam, total, pos;
2982 struct isl_dim_map *dim_map1, *dim_map2;
2984 if (!bmap1 || !bmap2)
2987 dim_result = isl_dim_join(isl_dim_copy(bmap1->dim),
2988 isl_dim_copy(bmap2->dim));
2990 n_in = isl_basic_map_n_in(bmap1);
2991 n_out = isl_basic_map_n_out(bmap2);
2992 n = isl_basic_map_n_out(bmap1);
2993 nparam = isl_basic_map_n_param(bmap1);
2995 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + n;
2996 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
2997 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
2998 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
2999 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
3000 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
3001 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_in);
3002 isl_dim_map_div(dim_map1, bmap1, pos += n_out);
3003 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
3004 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
3005 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
3007 bmap = isl_basic_map_alloc_dim(dim_result,
3008 bmap1->n_div + bmap2->n_div + n,
3009 bmap1->n_eq + bmap2->n_eq,
3010 bmap1->n_ineq + bmap2->n_ineq);
3011 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap1, dim_map1);
3012 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap2, dim_map2);
3013 bmap = add_divs(bmap, n);
3014 bmap = isl_basic_map_simplify(bmap);
3015 bmap = isl_basic_map_drop_redundant_divs(bmap);
3016 return isl_basic_map_finalize(bmap);
3018 isl_basic_map_free(bmap1);
3019 isl_basic_map_free(bmap2);
3023 struct isl_basic_set *isl_basic_set_apply(
3024 struct isl_basic_set *bset, struct isl_basic_map *bmap)
3029 isl_assert(bset->ctx, isl_basic_map_compatible_domain(bmap, bset),
3032 return (struct isl_basic_set *)
3033 isl_basic_map_apply_range((struct isl_basic_map *)bset, bmap);
3035 isl_basic_set_free(bset);
3036 isl_basic_map_free(bmap);
3040 struct isl_basic_map *isl_basic_map_apply_domain(
3041 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3043 if (!bmap1 || !bmap2)
3046 isl_assert(bmap1->ctx,
3047 isl_basic_map_n_in(bmap1) == isl_basic_map_n_in(bmap2), goto error);
3048 isl_assert(bmap1->ctx,
3049 isl_basic_map_n_param(bmap1) == isl_basic_map_n_param(bmap2),
3052 bmap1 = isl_basic_map_reverse(bmap1);
3053 bmap1 = isl_basic_map_apply_range(bmap1, bmap2);
3054 return isl_basic_map_reverse(bmap1);
3056 isl_basic_map_free(bmap1);
3057 isl_basic_map_free(bmap2);
3061 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
3062 * A \cap B -> f(A) + f(B)
3064 struct isl_basic_map *isl_basic_map_sum(
3065 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3067 unsigned n_in, n_out, nparam, total, pos;
3068 struct isl_basic_map *bmap = NULL;
3069 struct isl_dim_map *dim_map1, *dim_map2;
3072 if (!bmap1 || !bmap2)
3075 isl_assert(bmap1->ctx, isl_dim_equal(bmap1->dim, bmap2->dim),
3078 nparam = isl_basic_map_n_param(bmap1);
3079 n_in = isl_basic_map_n_in(bmap1);
3080 n_out = isl_basic_map_n_out(bmap1);
3082 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + 2 * n_out;
3083 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
3084 dim_map2 = isl_dim_map_alloc(bmap2->ctx, total);
3085 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
3086 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos);
3087 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
3088 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
3089 isl_dim_map_div(dim_map1, bmap1, pos += n_in + n_out);
3090 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
3091 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
3092 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_out);
3094 bmap = isl_basic_map_alloc_dim(isl_dim_copy(bmap1->dim),
3095 bmap1->n_div + bmap2->n_div + 2 * n_out,
3096 bmap1->n_eq + bmap2->n_eq + n_out,
3097 bmap1->n_ineq + bmap2->n_ineq);
3098 for (i = 0; i < n_out; ++i) {
3099 int j = isl_basic_map_alloc_equality(bmap);
3102 isl_seq_clr(bmap->eq[j], 1+total);
3103 isl_int_set_si(bmap->eq[j][1+nparam+n_in+i], -1);
3104 isl_int_set_si(bmap->eq[j][1+pos+i], 1);
3105 isl_int_set_si(bmap->eq[j][1+pos-n_out+i], 1);
3107 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap1, dim_map1);
3108 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap2, dim_map2);
3109 bmap = add_divs(bmap, 2 * n_out);
3111 bmap = isl_basic_map_simplify(bmap);
3112 return isl_basic_map_finalize(bmap);
3114 isl_basic_map_free(bmap);
3115 isl_basic_map_free(bmap1);
3116 isl_basic_map_free(bmap2);
3120 /* Given two maps A -> f(A) and B -> g(B), construct a map
3121 * A \cap B -> f(A) + f(B)
3123 struct isl_map *isl_map_sum(struct isl_map *map1, struct isl_map *map2)
3125 struct isl_map *result;
3131 isl_assert(map1->ctx, isl_dim_equal(map1->dim, map2->dim), goto error);
3133 result = isl_map_alloc_dim(isl_dim_copy(map1->dim),
3134 map1->n * map2->n, 0);
3137 for (i = 0; i < map1->n; ++i)
3138 for (j = 0; j < map2->n; ++j) {
3139 struct isl_basic_map *part;
3140 part = isl_basic_map_sum(
3141 isl_basic_map_copy(map1->p[i]),
3142 isl_basic_map_copy(map2->p[j]));
3143 if (isl_basic_map_is_empty(part))
3144 isl_basic_map_free(part);
3146 result = isl_map_add_basic_map(result, part);
3159 __isl_give isl_set *isl_set_sum(__isl_take isl_set *set1,
3160 __isl_take isl_set *set2)
3162 return (isl_set *)isl_map_sum((isl_map *)set1, (isl_map *)set2);
3165 /* Given a basic map A -> f(A), construct A -> -f(A).
3167 struct isl_basic_map *isl_basic_map_neg(struct isl_basic_map *bmap)
3172 bmap = isl_basic_map_cow(bmap);
3176 n = isl_basic_map_dim(bmap, isl_dim_out);
3177 off = isl_basic_map_offset(bmap, isl_dim_out);
3178 for (i = 0; i < bmap->n_eq; ++i)
3179 for (j = 0; j < n; ++j)
3180 isl_int_neg(bmap->eq[i][off+j], bmap->eq[i][off+j]);
3181 for (i = 0; i < bmap->n_ineq; ++i)
3182 for (j = 0; j < n; ++j)
3183 isl_int_neg(bmap->ineq[i][off+j], bmap->ineq[i][off+j]);
3184 for (i = 0; i < bmap->n_div; ++i)
3185 for (j = 0; j < n; ++j)
3186 isl_int_neg(bmap->div[i][1+off+j], bmap->div[i][1+off+j]);
3187 return isl_basic_map_finalize(bmap);
3190 __isl_give isl_basic_set *isl_basic_set_neg(__isl_take isl_basic_set *bset)
3192 return isl_basic_map_neg(bset);
3195 /* Given a map A -> f(A), construct A -> -f(A).
3197 struct isl_map *isl_map_neg(struct isl_map *map)
3201 map = isl_map_cow(map);
3205 for (i = 0; i < map->n; ++i) {
3206 map->p[i] = isl_basic_map_neg(map->p[i]);
3217 __isl_give isl_set *isl_set_neg(__isl_take isl_set *set)
3219 return (isl_set *)isl_map_neg((isl_map *)set);
3222 /* Given a basic map A -> f(A) and an integer d, construct a basic map
3223 * A -> floor(f(A)/d).
3225 struct isl_basic_map *isl_basic_map_floordiv(struct isl_basic_map *bmap,
3228 unsigned n_in, n_out, nparam, total, pos;
3229 struct isl_basic_map *result = NULL;
3230 struct isl_dim_map *dim_map;
3236 nparam = isl_basic_map_n_param(bmap);
3237 n_in = isl_basic_map_n_in(bmap);
3238 n_out = isl_basic_map_n_out(bmap);
3240 total = nparam + n_in + n_out + bmap->n_div + n_out;
3241 dim_map = isl_dim_map_alloc(bmap->ctx, total);
3242 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_param, pos = 0);
3243 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_in, pos += nparam);
3244 isl_dim_map_div(dim_map, bmap, pos += n_in + n_out);
3245 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_out, pos += bmap->n_div);
3247 result = isl_basic_map_alloc_dim(isl_dim_copy(bmap->dim),
3248 bmap->n_div + n_out,
3249 bmap->n_eq, bmap->n_ineq + 2 * n_out);
3250 result = isl_basic_map_add_constraints_dim_map(result, bmap, dim_map);
3251 result = add_divs(result, n_out);
3252 for (i = 0; i < n_out; ++i) {
3254 j = isl_basic_map_alloc_inequality(result);
3257 isl_seq_clr(result->ineq[j], 1+total);
3258 isl_int_neg(result->ineq[j][1+nparam+n_in+i], d);
3259 isl_int_set_si(result->ineq[j][1+pos+i], 1);
3260 j = isl_basic_map_alloc_inequality(result);
3263 isl_seq_clr(result->ineq[j], 1+total);
3264 isl_int_set(result->ineq[j][1+nparam+n_in+i], d);
3265 isl_int_set_si(result->ineq[j][1+pos+i], -1);
3266 isl_int_sub_ui(result->ineq[j][0], d, 1);
3269 result = isl_basic_map_simplify(result);
3270 return isl_basic_map_finalize(result);
3272 isl_basic_map_free(result);
3276 /* Given a map A -> f(A) and an integer d, construct a map
3277 * A -> floor(f(A)/d).
3279 struct isl_map *isl_map_floordiv(struct isl_map *map, isl_int d)
3283 map = isl_map_cow(map);
3287 ISL_F_CLR(map, ISL_MAP_DISJOINT);
3288 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3289 for (i = 0; i < map->n; ++i) {
3290 map->p[i] = isl_basic_map_floordiv(map->p[i], d);
3301 static struct isl_basic_map *var_equal(struct isl_basic_map *bmap, unsigned pos)
3307 i = isl_basic_map_alloc_equality(bmap);
3310 nparam = isl_basic_map_n_param(bmap);
3311 n_in = isl_basic_map_n_in(bmap);
3312 isl_seq_clr(bmap->eq[i], 1 + isl_basic_map_total_dim(bmap));
3313 isl_int_set_si(bmap->eq[i][1+nparam+pos], -1);
3314 isl_int_set_si(bmap->eq[i][1+nparam+n_in+pos], 1);
3315 return isl_basic_map_finalize(bmap);
3317 isl_basic_map_free(bmap);
3321 /* Add a constraints to "bmap" expressing i_pos < o_pos
3323 static struct isl_basic_map *var_less(struct isl_basic_map *bmap, unsigned pos)
3329 i = isl_basic_map_alloc_inequality(bmap);
3332 nparam = isl_basic_map_n_param(bmap);
3333 n_in = isl_basic_map_n_in(bmap);
3334 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
3335 isl_int_set_si(bmap->ineq[i][0], -1);
3336 isl_int_set_si(bmap->ineq[i][1+nparam+pos], -1);
3337 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], 1);
3338 return isl_basic_map_finalize(bmap);
3340 isl_basic_map_free(bmap);
3344 /* Add a constraint to "bmap" expressing i_pos <= o_pos
3346 static __isl_give isl_basic_map *var_less_or_equal(
3347 __isl_take isl_basic_map *bmap, unsigned pos)
3353 i = isl_basic_map_alloc_inequality(bmap);
3356 nparam = isl_basic_map_n_param(bmap);
3357 n_in = isl_basic_map_n_in(bmap);
3358 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
3359 isl_int_set_si(bmap->ineq[i][1+nparam+pos], -1);
3360 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], 1);
3361 return isl_basic_map_finalize(bmap);
3363 isl_basic_map_free(bmap);
3367 /* Add a constraints to "bmap" expressing i_pos > o_pos
3369 static struct isl_basic_map *var_more(struct isl_basic_map *bmap, unsigned pos)
3375 i = isl_basic_map_alloc_inequality(bmap);
3378 nparam = isl_basic_map_n_param(bmap);
3379 n_in = isl_basic_map_n_in(bmap);
3380 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
3381 isl_int_set_si(bmap->ineq[i][0], -1);
3382 isl_int_set_si(bmap->ineq[i][1+nparam+pos], 1);
3383 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], -1);
3384 return isl_basic_map_finalize(bmap);
3386 isl_basic_map_free(bmap);
3390 /* Add a constraint to "bmap" expressing i_pos >= o_pos
3392 static __isl_give isl_basic_map *var_more_or_equal(
3393 __isl_take isl_basic_map *bmap, unsigned pos)
3399 i = isl_basic_map_alloc_inequality(bmap);
3402 nparam = isl_basic_map_n_param(bmap);
3403 n_in = isl_basic_map_n_in(bmap);
3404 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
3405 isl_int_set_si(bmap->ineq[i][1+nparam+pos], 1);
3406 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], -1);
3407 return isl_basic_map_finalize(bmap);
3409 isl_basic_map_free(bmap);
3413 struct isl_basic_map *isl_basic_map_equal(struct isl_dim *dim, unsigned n_equal)
3416 struct isl_basic_map *bmap;
3417 bmap = isl_basic_map_alloc_dim(dim, 0, n_equal, 0);
3420 for (i = 0; i < n_equal && bmap; ++i)
3421 bmap = var_equal(bmap, i);
3422 return isl_basic_map_finalize(bmap);
3425 /* Return a relation on of dimension "dim" expressing i_[0..pos] << o_[0..pos]
3427 struct isl_basic_map *isl_basic_map_less_at(struct isl_dim *dim, unsigned pos)
3430 struct isl_basic_map *bmap;
3431 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
3434 for (i = 0; i < pos && bmap; ++i)
3435 bmap = var_equal(bmap, i);
3437 bmap = var_less(bmap, pos);
3438 return isl_basic_map_finalize(bmap);
3441 /* Return a relation on of dimension "dim" expressing i_[0..pos] <<= o_[0..pos]
3443 __isl_give isl_basic_map *isl_basic_map_less_or_equal_at(
3444 __isl_take isl_dim *dim, unsigned pos)
3447 isl_basic_map *bmap;
3449 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
3450 for (i = 0; i < pos; ++i)
3451 bmap = var_equal(bmap, i);
3452 bmap = var_less_or_equal(bmap, pos);
3453 return isl_basic_map_finalize(bmap);
3456 /* Return a relation on pairs of sets of dimension "dim" expressing i_pos > o_pos
3458 struct isl_basic_map *isl_basic_map_more_at(struct isl_dim *dim, unsigned pos)
3461 struct isl_basic_map *bmap;
3462 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
3465 for (i = 0; i < pos && bmap; ++i)
3466 bmap = var_equal(bmap, i);
3468 bmap = var_more(bmap, pos);
3469 return isl_basic_map_finalize(bmap);
3472 /* Return a relation on of dimension "dim" expressing i_[0..pos] >>= o_[0..pos]
3474 __isl_give isl_basic_map *isl_basic_map_more_or_equal_at(
3475 __isl_take isl_dim *dim, unsigned pos)
3478 isl_basic_map *bmap;
3480 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
3481 for (i = 0; i < pos; ++i)
3482 bmap = var_equal(bmap, i);
3483 bmap = var_more_or_equal(bmap, pos);
3484 return isl_basic_map_finalize(bmap);
3487 static __isl_give isl_map *map_lex_lte_first(__isl_take isl_dim *dims,
3488 unsigned n, int equal)
3490 struct isl_map *map;
3493 if (n == 0 && equal)
3494 return isl_map_universe(dims);
3496 map = isl_map_alloc_dim(isl_dim_copy(dims), n, ISL_MAP_DISJOINT);
3498 for (i = 0; i + 1 < n; ++i)
3499 map = isl_map_add_basic_map(map,
3500 isl_basic_map_less_at(isl_dim_copy(dims), i));
3503 map = isl_map_add_basic_map(map,
3504 isl_basic_map_less_or_equal_at(dims, n - 1));
3506 map = isl_map_add_basic_map(map,
3507 isl_basic_map_less_at(dims, n - 1));
3514 static __isl_give isl_map *map_lex_lte(__isl_take isl_dim *dims, int equal)
3518 return map_lex_lte_first(dims, dims->n_out, equal);
3521 __isl_give isl_map *isl_map_lex_lt_first(__isl_take isl_dim *dim, unsigned n)
3523 return map_lex_lte_first(dim, n, 0);
3526 __isl_give isl_map *isl_map_lex_le_first(__isl_take isl_dim *dim, unsigned n)
3528 return map_lex_lte_first(dim, n, 1);
3531 __isl_give isl_map *isl_map_lex_lt(__isl_take isl_dim *set_dim)
3533 return map_lex_lte(isl_dim_map_from_set(set_dim), 0);
3536 __isl_give isl_map *isl_map_lex_le(__isl_take isl_dim *set_dim)
3538 return map_lex_lte(isl_dim_map_from_set(set_dim), 1);
3541 static __isl_give isl_map *map_lex_gte_first(__isl_take isl_dim *dims,
3542 unsigned n, int equal)
3544 struct isl_map *map;
3547 if (n == 0 && equal)
3548 return isl_map_universe(dims);
3550 map = isl_map_alloc_dim(isl_dim_copy(dims), n, ISL_MAP_DISJOINT);
3552 for (i = 0; i + 1 < n; ++i)
3553 map = isl_map_add_basic_map(map,
3554 isl_basic_map_more_at(isl_dim_copy(dims), i));
3557 map = isl_map_add_basic_map(map,
3558 isl_basic_map_more_or_equal_at(dims, n - 1));
3560 map = isl_map_add_basic_map(map,
3561 isl_basic_map_more_at(dims, n - 1));
3568 static __isl_give isl_map *map_lex_gte(__isl_take isl_dim *dims, int equal)
3572 return map_lex_gte_first(dims, dims->n_out, equal);
3575 __isl_give isl_map *isl_map_lex_gt_first(__isl_take isl_dim *dim, unsigned n)
3577 return map_lex_gte_first(dim, n, 0);
3580 __isl_give isl_map *isl_map_lex_ge_first(__isl_take isl_dim *dim, unsigned n)
3582 return map_lex_gte_first(dim, n, 1);
3585 __isl_give isl_map *isl_map_lex_gt(__isl_take isl_dim *set_dim)
3587 return map_lex_gte(isl_dim_map_from_set(set_dim), 0);
3590 __isl_give isl_map *isl_map_lex_ge(__isl_take isl_dim *set_dim)
3592 return map_lex_gte(isl_dim_map_from_set(set_dim), 1);
3595 __isl_give isl_map *isl_set_lex_le_set(__isl_take isl_set *set1,
3596 __isl_take isl_set *set2)
3599 map = isl_map_lex_le(isl_set_get_dim(set1));
3600 map = isl_map_intersect_domain(map, set1);
3601 map = isl_map_intersect_range(map, set2);
3605 __isl_give isl_map *isl_set_lex_lt_set(__isl_take isl_set *set1,
3606 __isl_take isl_set *set2)
3609 map = isl_map_lex_lt(isl_set_get_dim(set1));
3610 map = isl_map_intersect_domain(map, set1);
3611 map = isl_map_intersect_range(map, set2);
3615 __isl_give isl_map *isl_set_lex_ge_set(__isl_take isl_set *set1,
3616 __isl_take isl_set *set2)
3619 map = isl_map_lex_ge(isl_set_get_dim(set1));
3620 map = isl_map_intersect_domain(map, set1);
3621 map = isl_map_intersect_range(map, set2);
3625 __isl_give isl_map *isl_set_lex_gt_set(__isl_take isl_set *set1,
3626 __isl_take isl_set *set2)
3629 map = isl_map_lex_gt(isl_set_get_dim(set1));
3630 map = isl_map_intersect_domain(map, set1);
3631 map = isl_map_intersect_range(map, set2);
3635 __isl_give isl_map *isl_map_lex_le_map(__isl_take isl_map *map1,
3636 __isl_take isl_map *map2)
3639 map = isl_map_lex_le(isl_dim_range(isl_map_get_dim(map1)));
3640 map = isl_map_apply_domain(map, isl_map_reverse(map1));
3641 map = isl_map_apply_range(map, isl_map_reverse(map2));
3645 __isl_give isl_map *isl_map_lex_lt_map(__isl_take isl_map *map1,
3646 __isl_take isl_map *map2)
3649 map = isl_map_lex_lt(isl_dim_range(isl_map_get_dim(map1)));
3650 map = isl_map_apply_domain(map, isl_map_reverse(map1));
3651 map = isl_map_apply_range(map, isl_map_reverse(map2));
3655 __isl_give isl_map *isl_map_lex_ge_map(__isl_take isl_map *map1,
3656 __isl_take isl_map *map2)
3659 map = isl_map_lex_ge(isl_dim_range(isl_map_get_dim(map1)));
3660 map = isl_map_apply_domain(map, isl_map_reverse(map1));
3661 map = isl_map_apply_range(map, isl_map_reverse(map2));
3665 __isl_give isl_map *isl_map_lex_gt_map(__isl_take isl_map *map1,
3666 __isl_take isl_map *map2)
3669 map = isl_map_lex_gt(isl_dim_range(isl_map_get_dim(map1)));
3670 map = isl_map_apply_domain(map, isl_map_reverse(map1));
3671 map = isl_map_apply_range(map, isl_map_reverse(map2));
3675 struct isl_basic_map *isl_basic_map_from_basic_set(
3676 struct isl_basic_set *bset, struct isl_dim *dim)
3678 struct isl_basic_map *bmap;
3680 bset = isl_basic_set_cow(bset);
3684 isl_assert(bset->ctx, isl_dim_compatible(bset->dim, dim), goto error);
3685 isl_dim_free(bset->dim);
3686 bmap = (struct isl_basic_map *) bset;
3688 return isl_basic_map_finalize(bmap);
3690 isl_basic_set_free(bset);
3695 struct isl_basic_set *isl_basic_set_from_basic_map(struct isl_basic_map *bmap)
3699 if (bmap->dim->n_in == 0)
3700 return (struct isl_basic_set *)bmap;
3701 bmap = isl_basic_map_cow(bmap);
3704 bmap->dim = isl_dim_as_set_dim(bmap->dim);
3707 bmap = isl_basic_map_finalize(bmap);
3708 return (struct isl_basic_set *)bmap;
3710 isl_basic_map_free(bmap);
3714 /* For a div d = floor(f/m), add the constraints
3717 * -(f-(n-1)) + m d >= 0
3719 * Note that the second constraint is the negation of
3723 int isl_basic_map_add_div_constraints_var(__isl_keep isl_basic_map *bmap,
3724 unsigned pos, isl_int *div)
3727 unsigned total = isl_basic_map_total_dim(bmap);
3729 i = isl_basic_map_alloc_inequality(bmap);
3732 isl_seq_cpy(bmap->ineq[i], div + 1, 1 + total);
3733 isl_int_neg(bmap->ineq[i][1 + pos], div[0]);
3735 j = isl_basic_map_alloc_inequality(bmap);
3738 isl_seq_neg(bmap->ineq[j], bmap->ineq[i], 1 + total);
3739 isl_int_add(bmap->ineq[j][0], bmap->ineq[j][0], bmap->ineq[j][1 + pos]);
3740 isl_int_sub_ui(bmap->ineq[j][0], bmap->ineq[j][0], 1);
3744 int isl_basic_set_add_div_constraints_var(__isl_keep isl_basic_set *bset,
3745 unsigned pos, isl_int *div)
3747 return isl_basic_map_add_div_constraints_var((isl_basic_map *)bset,
3751 int isl_basic_map_add_div_constraints(struct isl_basic_map *bmap, unsigned div)
3753 unsigned total = isl_basic_map_total_dim(bmap);
3754 unsigned div_pos = total - bmap->n_div + div;
3756 return isl_basic_map_add_div_constraints_var(bmap, div_pos,
3760 struct isl_basic_set *isl_basic_map_underlying_set(
3761 struct isl_basic_map *bmap)
3765 if (bmap->dim->nparam == 0 && bmap->dim->n_in == 0 &&
3767 !isl_dim_is_named_or_nested(bmap->dim, isl_dim_in) &&
3768 !isl_dim_is_named_or_nested(bmap->dim, isl_dim_out))
3769 return (struct isl_basic_set *)bmap;
3770 bmap = isl_basic_map_cow(bmap);
3773 bmap->dim = isl_dim_underlying(bmap->dim, bmap->n_div);
3776 bmap->extra -= bmap->n_div;
3778 bmap = isl_basic_map_finalize(bmap);
3779 return (struct isl_basic_set *)bmap;
3784 __isl_give isl_basic_set *isl_basic_set_underlying_set(
3785 __isl_take isl_basic_set *bset)
3787 return isl_basic_map_underlying_set((isl_basic_map *)bset);
3790 struct isl_basic_map *isl_basic_map_overlying_set(
3791 struct isl_basic_set *bset, struct isl_basic_map *like)
3793 struct isl_basic_map *bmap;
3794 struct isl_ctx *ctx;
3801 isl_assert(ctx, bset->n_div == 0, goto error);
3802 isl_assert(ctx, isl_basic_set_n_param(bset) == 0, goto error);
3803 isl_assert(ctx, bset->dim->n_out == isl_basic_map_total_dim(like),
3805 if (isl_dim_equal(bset->dim, like->dim) && like->n_div == 0) {
3806 isl_basic_map_free(like);
3807 return (struct isl_basic_map *)bset;
3809 bset = isl_basic_set_cow(bset);
3812 total = bset->dim->n_out + bset->extra;
3813 bmap = (struct isl_basic_map *)bset;
3814 isl_dim_free(bmap->dim);
3815 bmap->dim = isl_dim_copy(like->dim);
3818 bmap->n_div = like->n_div;
3819 bmap->extra += like->n_div;
3823 ltotal = total - bmap->extra + like->extra;
3826 bmap->block2 = isl_blk_extend(ctx, bmap->block2,
3827 bmap->extra * (1 + 1 + total));
3828 if (isl_blk_is_error(bmap->block2))
3830 div = isl_realloc_array(ctx, bmap->div, isl_int *, bmap->extra);
3834 for (i = 0; i < bmap->extra; ++i)
3835 bmap->div[i] = bmap->block2.data + i * (1 + 1 + total);
3836 for (i = 0; i < like->n_div; ++i) {
3837 isl_seq_cpy(bmap->div[i], like->div[i], 1 + 1 + ltotal);
3838 isl_seq_clr(bmap->div[i]+1+1+ltotal, total - ltotal);
3840 bmap = isl_basic_map_extend_constraints(bmap,
3841 0, 2 * like->n_div);
3842 for (i = 0; i < like->n_div; ++i) {
3843 if (isl_int_is_zero(bmap->div[i][0]))
3845 if (isl_basic_map_add_div_constraints(bmap, i) < 0)
3849 isl_basic_map_free(like);
3850 bmap = isl_basic_map_simplify(bmap);
3851 bmap = isl_basic_map_finalize(bmap);
3854 isl_basic_map_free(like);
3855 isl_basic_set_free(bset);
3859 struct isl_basic_set *isl_basic_set_from_underlying_set(
3860 struct isl_basic_set *bset, struct isl_basic_set *like)
3862 return (struct isl_basic_set *)
3863 isl_basic_map_overlying_set(bset, (struct isl_basic_map *)like);
3866 struct isl_set *isl_set_from_underlying_set(
3867 struct isl_set *set, struct isl_basic_set *like)
3873 isl_assert(set->ctx, set->dim->n_out == isl_basic_set_total_dim(like),
3875 if (isl_dim_equal(set->dim, like->dim) && like->n_div == 0) {
3876 isl_basic_set_free(like);
3879 set = isl_set_cow(set);
3882 for (i = 0; i < set->n; ++i) {
3883 set->p[i] = isl_basic_set_from_underlying_set(set->p[i],
3884 isl_basic_set_copy(like));
3888 isl_dim_free(set->dim);
3889 set->dim = isl_dim_copy(like->dim);
3892 isl_basic_set_free(like);
3895 isl_basic_set_free(like);
3900 struct isl_set *isl_map_underlying_set(struct isl_map *map)
3904 map = isl_map_cow(map);
3907 map->dim = isl_dim_cow(map->dim);
3911 for (i = 1; i < map->n; ++i)
3912 isl_assert(map->ctx, map->p[0]->n_div == map->p[i]->n_div,
3914 for (i = 0; i < map->n; ++i) {
3915 map->p[i] = (struct isl_basic_map *)
3916 isl_basic_map_underlying_set(map->p[i]);
3921 map->dim = isl_dim_underlying(map->dim, 0);
3923 isl_dim_free(map->dim);
3924 map->dim = isl_dim_copy(map->p[0]->dim);
3928 return (struct isl_set *)map;
3934 struct isl_set *isl_set_to_underlying_set(struct isl_set *set)
3936 return (struct isl_set *)isl_map_underlying_set((struct isl_map *)set);
3939 __isl_give isl_basic_map *isl_basic_map_reset_dim(
3940 __isl_take isl_basic_map *bmap, __isl_take isl_dim *dim)
3942 bmap = isl_basic_map_cow(bmap);
3946 isl_dim_free(bmap->dim);
3949 bmap = isl_basic_map_finalize(bmap);
3953 isl_basic_map_free(bmap);
3958 __isl_give isl_basic_set *isl_basic_set_reset_dim(
3959 __isl_take isl_basic_set *bset, __isl_take isl_dim *dim)
3961 return (isl_basic_set *)isl_basic_map_reset_dim((isl_basic_map *)bset,
3965 __isl_give isl_map *isl_map_reset_dim(__isl_take isl_map *map,
3966 __isl_take isl_dim *dim)
3970 map = isl_map_cow(map);
3974 for (i = 0; i < map->n; ++i) {
3975 map->p[i] = isl_basic_map_reset_dim(map->p[i],
3980 isl_dim_free(map->dim);
3990 __isl_give isl_set *isl_set_reset_dim(__isl_take isl_set *set,
3991 __isl_take isl_dim *dim)
3993 return (struct isl_set *) isl_map_reset_dim((struct isl_map *)set, dim);
3996 struct isl_basic_set *isl_basic_map_domain(struct isl_basic_map *bmap)
3999 struct isl_basic_set *domain;
4005 dim = isl_dim_domain(isl_basic_map_get_dim(bmap));
4007 n_in = isl_basic_map_n_in(bmap);
4008 n_out = isl_basic_map_n_out(bmap);
4009 domain = isl_basic_set_from_basic_map(bmap);
4010 domain = isl_basic_set_project_out(domain, isl_dim_set, n_in, n_out);
4012 domain = isl_basic_set_reset_dim(domain, dim);
4017 int isl_basic_map_may_be_set(__isl_keep isl_basic_map *bmap)
4021 return isl_dim_may_be_set(bmap->dim);
4024 struct isl_basic_set *isl_basic_map_range(struct isl_basic_map *bmap)
4028 if (isl_basic_map_may_be_set(bmap))
4030 return isl_basic_map_domain(isl_basic_map_reverse(bmap));
4033 __isl_give isl_basic_map *isl_basic_map_domain_map(
4034 __isl_take isl_basic_map *bmap)
4038 isl_basic_map *domain;
4039 int nparam, n_in, n_out;
4042 nparam = isl_basic_map_dim(bmap, isl_dim_param);
4043 n_in = isl_basic_map_dim(bmap, isl_dim_in);
4044 n_out = isl_basic_map_dim(bmap, isl_dim_out);
4046 dim = isl_dim_from_range(isl_dim_domain(isl_basic_map_get_dim(bmap)));
4047 domain = isl_basic_map_universe(dim);
4049 bmap = isl_basic_map_from_domain(isl_basic_map_wrap(bmap));
4050 bmap = isl_basic_map_apply_range(bmap, domain);
4051 bmap = isl_basic_map_extend_constraints(bmap, n_in, 0);
4053 total = isl_basic_map_total_dim(bmap);
4055 for (i = 0; i < n_in; ++i) {
4056 k = isl_basic_map_alloc_equality(bmap);
4059 isl_seq_clr(bmap->eq[k], 1 + total);
4060 isl_int_set_si(bmap->eq[k][1 + nparam + i], -1);
4061 isl_int_set_si(bmap->eq[k][1 + nparam + n_in + n_out + i], 1);
4064 bmap = isl_basic_map_gauss(bmap, NULL);
4065 return isl_basic_map_finalize(bmap);
4067 isl_basic_map_free(bmap);
4071 __isl_give isl_basic_map *isl_basic_map_range_map(
4072 __isl_take isl_basic_map *bmap)
4076 isl_basic_map *range;
4077 int nparam, n_in, n_out;
4080 nparam = isl_basic_map_dim(bmap, isl_dim_param);
4081 n_in = isl_basic_map_dim(bmap, isl_dim_in);
4082 n_out = isl_basic_map_dim(bmap, isl_dim_out);
4084 dim = isl_dim_from_range(isl_dim_range(isl_basic_map_get_dim(bmap)));
4085 range = isl_basic_map_universe(dim);
4087 bmap = isl_basic_map_from_domain(isl_basic_map_wrap(bmap));
4088 bmap = isl_basic_map_apply_range(bmap, range);
4089 bmap = isl_basic_map_extend_constraints(bmap, n_out, 0);
4091 total = isl_basic_map_total_dim(bmap);
4093 for (i = 0; i < n_out; ++i) {
4094 k = isl_basic_map_alloc_equality(bmap);
4097 isl_seq_clr(bmap->eq[k], 1 + total);
4098 isl_int_set_si(bmap->eq[k][1 + nparam + n_in + i], -1);
4099 isl_int_set_si(bmap->eq[k][1 + nparam + n_in + n_out + i], 1);
4102 bmap = isl_basic_map_gauss(bmap, NULL);
4103 return isl_basic_map_finalize(bmap);
4105 isl_basic_map_free(bmap);
4109 int isl_map_may_be_set(__isl_keep isl_map *map)
4113 return isl_dim_may_be_set(map->dim);
4116 struct isl_set *isl_map_range(struct isl_map *map)
4119 struct isl_set *set;
4123 if (isl_map_may_be_set(map))
4124 return (isl_set *)map;
4126 map = isl_map_cow(map);
4130 set = (struct isl_set *) map;
4131 set->dim = isl_dim_drop_inputs(set->dim, 0, set->dim->n_in);
4134 for (i = 0; i < map->n; ++i) {
4135 set->p[i] = isl_basic_map_range(map->p[i]);
4139 ISL_F_CLR(set, ISL_MAP_DISJOINT);
4140 ISL_F_CLR(set, ISL_SET_NORMALIZED);
4147 __isl_give isl_map *isl_map_domain_map(__isl_take isl_map *map)
4150 isl_dim *domain_dim;
4152 map = isl_map_cow(map);
4156 domain_dim = isl_dim_from_range(isl_dim_domain(isl_map_get_dim(map)));
4157 map->dim = isl_dim_from_domain(isl_dim_wrap(map->dim));
4158 map->dim = isl_dim_join(map->dim, domain_dim);
4161 for (i = 0; i < map->n; ++i) {
4162 map->p[i] = isl_basic_map_domain_map(map->p[i]);
4166 ISL_F_CLR(map, ISL_MAP_DISJOINT);
4167 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4174 __isl_give isl_map *isl_map_range_map(__isl_take isl_map *map)
4179 map = isl_map_cow(map);
4183 range_dim = isl_dim_range(isl_map_get_dim(map));
4184 map->dim = isl_dim_from_domain(isl_dim_wrap(map->dim));
4185 map->dim = isl_dim_join(map->dim, range_dim);
4188 for (i = 0; i < map->n; ++i) {
4189 map->p[i] = isl_basic_map_range_map(map->p[i]);
4193 ISL_F_CLR(map, ISL_MAP_DISJOINT);
4194 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4201 struct isl_map *isl_map_from_set(struct isl_set *set, struct isl_dim *dim)
4204 struct isl_map *map = NULL;
4206 set = isl_set_cow(set);
4209 isl_assert(set->ctx, isl_dim_compatible(set->dim, dim), goto error);
4210 map = (struct isl_map *)set;
4211 for (i = 0; i < set->n; ++i) {
4212 map->p[i] = isl_basic_map_from_basic_set(
4213 set->p[i], isl_dim_copy(dim));
4217 isl_dim_free(map->dim);
4226 __isl_give isl_basic_map *isl_basic_map_from_domain(
4227 __isl_take isl_basic_set *bset)
4229 return isl_basic_map_reverse(isl_basic_map_from_range(bset));
4232 __isl_give isl_basic_map *isl_basic_map_from_range(
4233 __isl_take isl_basic_set *bset)
4235 return (isl_basic_map *)bset;
4238 struct isl_map *isl_map_from_range(struct isl_set *set)
4240 return (struct isl_map *)set;
4243 __isl_give isl_map *isl_map_from_domain(__isl_take isl_set *set)
4245 return isl_map_reverse(isl_map_from_range(set));
4248 __isl_give isl_basic_map *isl_basic_map_from_domain_and_range(
4249 __isl_take isl_basic_set *domain, __isl_take isl_basic_set *range)
4251 return isl_basic_map_apply_range(isl_basic_map_from_domain(domain),
4252 isl_basic_map_from_range(range));
4255 __isl_give isl_map *isl_map_from_domain_and_range(__isl_take isl_set *domain,
4256 __isl_take isl_set *range)
4258 return isl_map_apply_range(isl_map_from_domain(domain),
4259 isl_map_from_range(range));
4262 struct isl_set *isl_set_from_map(struct isl_map *map)
4265 struct isl_set *set = NULL;
4269 map = isl_map_cow(map);
4272 map->dim = isl_dim_as_set_dim(map->dim);
4275 set = (struct isl_set *)map;
4276 for (i = 0; i < map->n; ++i) {
4277 set->p[i] = isl_basic_set_from_basic_map(map->p[i]);
4287 struct isl_map *isl_map_alloc_dim(struct isl_dim *dim, int n, unsigned flags)
4289 struct isl_map *map;
4293 isl_assert(dim->ctx, n >= 0, return NULL);
4294 map = isl_alloc(dim->ctx, struct isl_map,
4295 sizeof(struct isl_map) +
4296 (n - 1) * sizeof(struct isl_basic_map *));
4300 map->ctx = dim->ctx;
4301 isl_ctx_ref(map->ctx);
4313 struct isl_map *isl_map_alloc(struct isl_ctx *ctx,
4314 unsigned nparam, unsigned in, unsigned out, int n,
4317 struct isl_map *map;
4318 struct isl_dim *dims;
4320 dims = isl_dim_alloc(ctx, nparam, in, out);
4324 map = isl_map_alloc_dim(dims, n, flags);
4328 struct isl_basic_map *isl_basic_map_empty(struct isl_dim *dim)
4330 struct isl_basic_map *bmap;
4331 bmap = isl_basic_map_alloc_dim(dim, 0, 1, 0);
4332 bmap = isl_basic_map_set_to_empty(bmap);
4336 struct isl_basic_set *isl_basic_set_empty(struct isl_dim *dim)
4338 struct isl_basic_set *bset;
4339 bset = isl_basic_set_alloc_dim(dim, 0, 1, 0);
4340 bset = isl_basic_set_set_to_empty(bset);
4344 struct isl_basic_map *isl_basic_map_empty_like(struct isl_basic_map *model)
4346 struct isl_basic_map *bmap;
4349 bmap = isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
4350 bmap = isl_basic_map_set_to_empty(bmap);
4354 struct isl_basic_map *isl_basic_map_empty_like_map(struct isl_map *model)
4356 struct isl_basic_map *bmap;
4359 bmap = isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
4360 bmap = isl_basic_map_set_to_empty(bmap);
4364 struct isl_basic_set *isl_basic_set_empty_like(struct isl_basic_set *model)
4366 struct isl_basic_set *bset;
4369 bset = isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
4370 bset = isl_basic_set_set_to_empty(bset);
4374 struct isl_basic_map *isl_basic_map_universe(struct isl_dim *dim)
4376 struct isl_basic_map *bmap;
4377 bmap = isl_basic_map_alloc_dim(dim, 0, 0, 0);
4378 bmap = isl_basic_map_finalize(bmap);
4382 struct isl_basic_set *isl_basic_set_universe(struct isl_dim *dim)
4384 struct isl_basic_set *bset;
4385 bset = isl_basic_set_alloc_dim(dim, 0, 0, 0);
4386 bset = isl_basic_set_finalize(bset);
4390 __isl_give isl_basic_map *isl_basic_map_nat_universe(__isl_take isl_dim *dim)
4393 unsigned total = isl_dim_total(dim);
4394 isl_basic_map *bmap;
4396 bmap= isl_basic_map_alloc_dim(dim, 0, 0, total);
4397 for (i = 0; i < total; ++i) {
4398 int k = isl_basic_map_alloc_inequality(bmap);
4401 isl_seq_clr(bmap->ineq[k], 1 + total);
4402 isl_int_set_si(bmap->ineq[k][1 + i], 1);
4406 isl_basic_map_free(bmap);
4410 __isl_give isl_basic_set *isl_basic_set_nat_universe(__isl_take isl_dim *dim)
4412 return isl_basic_map_nat_universe(dim);
4415 __isl_give isl_map *isl_map_nat_universe(__isl_take isl_dim *dim)
4417 return isl_map_from_basic_map(isl_basic_map_nat_universe(dim));
4420 __isl_give isl_set *isl_set_nat_universe(__isl_take isl_dim *dim)
4422 return isl_map_nat_universe(dim);
4425 __isl_give isl_basic_map *isl_basic_map_universe_like(
4426 __isl_keep isl_basic_map *model)
4430 return isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
4433 struct isl_basic_set *isl_basic_set_universe_like(struct isl_basic_set *model)
4437 return isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
4440 __isl_give isl_basic_set *isl_basic_set_universe_like_set(
4441 __isl_keep isl_set *model)
4445 return isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
4448 struct isl_map *isl_map_empty(struct isl_dim *dim)
4450 return isl_map_alloc_dim(dim, 0, ISL_MAP_DISJOINT);
4453 struct isl_map *isl_map_empty_like(struct isl_map *model)
4457 return isl_map_alloc_dim(isl_dim_copy(model->dim), 0, ISL_MAP_DISJOINT);
4460 struct isl_map *isl_map_empty_like_basic_map(struct isl_basic_map *model)
4464 return isl_map_alloc_dim(isl_dim_copy(model->dim), 0, ISL_MAP_DISJOINT);
4467 struct isl_set *isl_set_empty(struct isl_dim *dim)
4469 return isl_set_alloc_dim(dim, 0, ISL_MAP_DISJOINT);
4472 struct isl_set *isl_set_empty_like(struct isl_set *model)
4476 return isl_set_empty(isl_dim_copy(model->dim));
4479 struct isl_map *isl_map_universe(struct isl_dim *dim)
4481 struct isl_map *map;
4484 map = isl_map_alloc_dim(isl_dim_copy(dim), 1, ISL_MAP_DISJOINT);
4485 map = isl_map_add_basic_map(map, isl_basic_map_universe(dim));
4489 struct isl_set *isl_set_universe(struct isl_dim *dim)
4491 struct isl_set *set;
4494 set = isl_set_alloc_dim(isl_dim_copy(dim), 1, ISL_MAP_DISJOINT);
4495 set = isl_set_add_basic_set(set, isl_basic_set_universe(dim));
4499 __isl_give isl_set *isl_set_universe_like(__isl_keep isl_set *model)
4503 return isl_set_universe(isl_dim_copy(model->dim));
4506 struct isl_map *isl_map_dup(struct isl_map *map)
4509 struct isl_map *dup;
4513 dup = isl_map_alloc_dim(isl_dim_copy(map->dim), map->n, map->flags);
4514 for (i = 0; i < map->n; ++i)
4515 dup = isl_map_add_basic_map(dup, isl_basic_map_copy(map->p[i]));
4519 __isl_give isl_map *isl_map_add_basic_map(__isl_take isl_map *map,
4520 __isl_take isl_basic_map *bmap)
4524 if (isl_basic_map_plain_is_empty(bmap)) {
4525 isl_basic_map_free(bmap);
4528 isl_assert(map->ctx, isl_dim_equal(map->dim, bmap->dim), goto error);
4529 isl_assert(map->ctx, map->n < map->size, goto error);
4530 map->p[map->n] = bmap;
4532 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4538 isl_basic_map_free(bmap);
4542 void isl_map_free(struct isl_map *map)
4552 isl_ctx_deref(map->ctx);
4553 for (i = 0; i < map->n; ++i)
4554 isl_basic_map_free(map->p[i]);
4555 isl_dim_free(map->dim);
4559 struct isl_map *isl_map_extend(struct isl_map *base,
4560 unsigned nparam, unsigned n_in, unsigned n_out)
4564 base = isl_map_cow(base);
4568 base->dim = isl_dim_extend(base->dim, nparam, n_in, n_out);
4571 for (i = 0; i < base->n; ++i) {
4572 base->p[i] = isl_basic_map_extend_dim(base->p[i],
4573 isl_dim_copy(base->dim), 0, 0, 0);
4583 struct isl_set *isl_set_extend(struct isl_set *base,
4584 unsigned nparam, unsigned dim)
4586 return (struct isl_set *)isl_map_extend((struct isl_map *)base,
4590 static struct isl_basic_map *isl_basic_map_fix_pos_si(
4591 struct isl_basic_map *bmap, unsigned pos, int value)
4595 bmap = isl_basic_map_cow(bmap);
4596 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
4597 j = isl_basic_map_alloc_equality(bmap);
4600 isl_seq_clr(bmap->eq[j] + 1, isl_basic_map_total_dim(bmap));
4601 isl_int_set_si(bmap->eq[j][pos], -1);
4602 isl_int_set_si(bmap->eq[j][0], value);
4603 bmap = isl_basic_map_simplify(bmap);
4604 return isl_basic_map_finalize(bmap);
4606 isl_basic_map_free(bmap);
4610 static __isl_give isl_basic_map *isl_basic_map_fix_pos(
4611 __isl_take isl_basic_map *bmap, unsigned pos, isl_int value)
4615 bmap = isl_basic_map_cow(bmap);
4616 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
4617 j = isl_basic_map_alloc_equality(bmap);
4620 isl_seq_clr(bmap->eq[j] + 1, isl_basic_map_total_dim(bmap));
4621 isl_int_set_si(bmap->eq[j][pos], -1);
4622 isl_int_set(bmap->eq[j][0], value);
4623 bmap = isl_basic_map_simplify(bmap);
4624 return isl_basic_map_finalize(bmap);
4626 isl_basic_map_free(bmap);
4630 struct isl_basic_map *isl_basic_map_fix_si(struct isl_basic_map *bmap,
4631 enum isl_dim_type type, unsigned pos, int value)
4635 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
4636 return isl_basic_map_fix_pos_si(bmap,
4637 isl_basic_map_offset(bmap, type) + pos, value);
4639 isl_basic_map_free(bmap);
4643 __isl_give isl_basic_map *isl_basic_map_fix(__isl_take isl_basic_map *bmap,
4644 enum isl_dim_type type, unsigned pos, isl_int value)
4648 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
4649 return isl_basic_map_fix_pos(bmap,
4650 isl_basic_map_offset(bmap, type) + pos, value);
4652 isl_basic_map_free(bmap);
4656 struct isl_basic_set *isl_basic_set_fix_si(struct isl_basic_set *bset,
4657 enum isl_dim_type type, unsigned pos, int value)
4659 return (struct isl_basic_set *)
4660 isl_basic_map_fix_si((struct isl_basic_map *)bset,
4664 __isl_give isl_basic_set *isl_basic_set_fix(__isl_take isl_basic_set *bset,
4665 enum isl_dim_type type, unsigned pos, isl_int value)
4667 return (struct isl_basic_set *)
4668 isl_basic_map_fix((struct isl_basic_map *)bset,
4672 struct isl_basic_map *isl_basic_map_fix_input_si(struct isl_basic_map *bmap,
4673 unsigned input, int value)
4675 return isl_basic_map_fix_si(bmap, isl_dim_in, input, value);
4678 struct isl_basic_set *isl_basic_set_fix_dim_si(struct isl_basic_set *bset,
4679 unsigned dim, int value)
4681 return (struct isl_basic_set *)
4682 isl_basic_map_fix_si((struct isl_basic_map *)bset,
4683 isl_dim_set, dim, value);
4686 struct isl_map *isl_map_fix_si(struct isl_map *map,
4687 enum isl_dim_type type, unsigned pos, int value)
4691 map = isl_map_cow(map);
4695 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
4696 for (i = 0; i < map->n; ++i) {
4697 map->p[i] = isl_basic_map_fix_si(map->p[i], type, pos, value);
4701 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4708 __isl_give isl_set *isl_set_fix_si(__isl_take isl_set *set,
4709 enum isl_dim_type type, unsigned pos, int value)
4711 return (struct isl_set *)
4712 isl_map_fix_si((struct isl_map *)set, type, pos, value);
4715 __isl_give isl_map *isl_map_fix(__isl_take isl_map *map,
4716 enum isl_dim_type type, unsigned pos, isl_int value)
4720 map = isl_map_cow(map);
4724 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
4725 for (i = 0; i < map->n; ++i) {
4726 map->p[i] = isl_basic_map_fix(map->p[i], type, pos, value);
4730 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4737 __isl_give isl_set *isl_set_fix(__isl_take isl_set *set,
4738 enum isl_dim_type type, unsigned pos, isl_int value)
4740 return (struct isl_set *)isl_map_fix((isl_map *)set, type, pos, value);
4743 struct isl_map *isl_map_fix_input_si(struct isl_map *map,
4744 unsigned input, int value)
4746 return isl_map_fix_si(map, isl_dim_in, input, value);
4749 struct isl_set *isl_set_fix_dim_si(struct isl_set *set, unsigned dim, int value)
4751 return (struct isl_set *)
4752 isl_map_fix_si((struct isl_map *)set, isl_dim_set, dim, value);
4755 __isl_give isl_basic_map *isl_basic_map_lower_bound_si(
4756 __isl_take isl_basic_map *bmap,
4757 enum isl_dim_type type, unsigned pos, int value)
4763 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
4764 pos += isl_basic_map_offset(bmap, type);
4765 bmap = isl_basic_map_cow(bmap);
4766 bmap = isl_basic_map_extend_constraints(bmap, 0, 1);
4767 j = isl_basic_map_alloc_inequality(bmap);
4770 isl_seq_clr(bmap->ineq[j], 1 + isl_basic_map_total_dim(bmap));
4771 isl_int_set_si(bmap->ineq[j][pos], 1);
4772 isl_int_set_si(bmap->ineq[j][0], -value);
4773 bmap = isl_basic_map_simplify(bmap);
4774 return isl_basic_map_finalize(bmap);
4776 isl_basic_map_free(bmap);
4780 struct isl_basic_set *isl_basic_set_lower_bound_dim(struct isl_basic_set *bset,
4781 unsigned dim, isl_int value)
4785 bset = isl_basic_set_cow(bset);
4786 bset = isl_basic_set_extend_constraints(bset, 0, 1);
4787 j = isl_basic_set_alloc_inequality(bset);
4790 isl_seq_clr(bset->ineq[j], 1 + isl_basic_set_total_dim(bset));
4791 isl_int_set_si(bset->ineq[j][1 + isl_basic_set_n_param(bset) + dim], 1);
4792 isl_int_neg(bset->ineq[j][0], value);
4793 bset = isl_basic_set_simplify(bset);
4794 return isl_basic_set_finalize(bset);
4796 isl_basic_set_free(bset);
4800 __isl_give isl_map *isl_map_lower_bound_si(__isl_take isl_map *map,
4801 enum isl_dim_type type, unsigned pos, int value)
4805 map = isl_map_cow(map);
4809 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
4810 for (i = 0; i < map->n; ++i) {
4811 map->p[i] = isl_basic_map_lower_bound_si(map->p[i],
4816 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4823 __isl_give isl_set *isl_set_lower_bound_si(__isl_take isl_set *set,
4824 enum isl_dim_type type, unsigned pos, int value)
4826 return (struct isl_set *)
4827 isl_map_lower_bound_si((struct isl_map *)set, type, pos, value);
4830 struct isl_set *isl_set_lower_bound_dim(struct isl_set *set, unsigned dim,
4835 set = isl_set_cow(set);
4839 isl_assert(set->ctx, dim < isl_set_n_dim(set), goto error);
4840 for (i = 0; i < set->n; ++i) {
4841 set->p[i] = isl_basic_set_lower_bound_dim(set->p[i], dim, value);
4851 struct isl_map *isl_map_reverse(struct isl_map *map)
4855 map = isl_map_cow(map);
4859 map->dim = isl_dim_reverse(map->dim);
4862 for (i = 0; i < map->n; ++i) {
4863 map->p[i] = isl_basic_map_reverse(map->p[i]);
4867 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4874 static struct isl_map *isl_basic_map_partial_lexopt(
4875 struct isl_basic_map *bmap, struct isl_basic_set *dom,
4876 struct isl_set **empty, int max)
4880 if (bmap->ctx->opt->pip == ISL_PIP_PIP)
4881 return isl_pip_basic_map_lexopt(bmap, dom, empty, max);
4883 return isl_tab_basic_map_partial_lexopt(bmap, dom, empty, max);
4885 isl_basic_map_free(bmap);
4886 isl_basic_set_free(dom);
4892 struct isl_map *isl_basic_map_partial_lexmax(
4893 struct isl_basic_map *bmap, struct isl_basic_set *dom,
4894 struct isl_set **empty)
4896 return isl_basic_map_partial_lexopt(bmap, dom, empty, 1);
4899 struct isl_map *isl_basic_map_partial_lexmin(
4900 struct isl_basic_map *bmap, struct isl_basic_set *dom,
4901 struct isl_set **empty)
4903 return isl_basic_map_partial_lexopt(bmap, dom, empty, 0);
4906 struct isl_set *isl_basic_set_partial_lexmin(
4907 struct isl_basic_set *bset, struct isl_basic_set *dom,
4908 struct isl_set **empty)
4910 return (struct isl_set *)
4911 isl_basic_map_partial_lexmin((struct isl_basic_map *)bset,
4915 struct isl_set *isl_basic_set_partial_lexmax(
4916 struct isl_basic_set *bset, struct isl_basic_set *dom,
4917 struct isl_set **empty)
4919 return (struct isl_set *)
4920 isl_basic_map_partial_lexmax((struct isl_basic_map *)bset,
4924 /* Given a basic map "bmap", compute the lexicographically minimal
4925 * (or maximal) image element for each domain element in dom.
4926 * Set *empty to those elements in dom that do not have an image element.
4928 * We first make sure the basic sets in dom are disjoint and then
4929 * simply collect the results over each of the basic sets separately.
4930 * We could probably improve the efficiency a bit by moving the union
4931 * domain down into the parametric integer programming.
4933 static __isl_give isl_map *basic_map_partial_lexopt(
4934 __isl_take isl_basic_map *bmap, __isl_take isl_set *dom,
4935 __isl_give isl_set **empty, int max)
4938 struct isl_map *res;
4940 dom = isl_set_make_disjoint(dom);
4944 if (isl_set_plain_is_empty(dom)) {
4945 res = isl_map_empty_like_basic_map(bmap);
4946 *empty = isl_set_empty_like(dom);
4948 isl_basic_map_free(bmap);
4952 res = isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap),
4953 isl_basic_set_copy(dom->p[0]), empty, max);
4955 for (i = 1; i < dom->n; ++i) {
4956 struct isl_map *res_i;
4957 struct isl_set *empty_i;
4959 res_i = isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap),
4960 isl_basic_set_copy(dom->p[i]), &empty_i, max);
4962 res = isl_map_union_disjoint(res, res_i);
4963 *empty = isl_set_union_disjoint(*empty, empty_i);
4967 isl_basic_map_free(bmap);
4972 isl_basic_map_free(bmap);
4976 /* Given a map "map", compute the lexicographically minimal
4977 * (or maximal) image element for each domain element in dom.
4978 * Set *empty to those elements in dom that do not have an image element.
4980 * We first compute the lexicographically minimal or maximal element
4981 * in the first basic map. This results in a partial solution "res"
4982 * and a subset "todo" of dom that still need to be handled.
4983 * We then consider each of the remaining maps in "map" and successively
4984 * improve both "res" and "todo".
4986 * Let res^k and todo^k be the results after k steps and let i = k + 1.
4987 * Assume we are computing the lexicographical maximum.
4988 * We first compute the lexicographically maximal element in basic map i.
4989 * This results in a partial solution res_i and a subset todo_i.
4990 * Then we combine these results with those obtain for the first k basic maps
4991 * to obtain a result that is valid for the first k+1 basic maps.
4992 * In particular, the set where there is no solution is the set where
4993 * there is no solution for the first k basic maps and also no solution
4994 * for the ith basic map, i.e.,
4996 * todo^i = todo^k * todo_i
4998 * On dom(res^k) * dom(res_i), we need to pick the larger of the two
4999 * solutions, arbitrarily breaking ties in favor of res^k.
5000 * That is, when res^k(a) >= res_i(a), we pick res^k and
5001 * when res^k(a) < res_i(a), we pick res_i. (Here, ">=" and "<" denote
5002 * the lexicographic order.)
5003 * In practice, we compute
5005 * res^k * (res_i . "<=")
5009 * res_i * (res^k . "<")
5011 * Finally, we consider the symmetric difference of dom(res^k) and dom(res_i),
5012 * where only one of res^k and res_i provides a solution and we simply pick
5019 * Note that we only compute these intersections when dom(res^k) intersects
5020 * dom(res_i). Otherwise, the only effect of these intersections is to
5021 * potentially break up res^k and res_i into smaller pieces.
5022 * We want to avoid such splintering as much as possible.
5023 * In fact, an earlier implementation of this function would look for
5024 * better results in the domain of res^k and for extra results in todo^k,
5025 * but this would always result in a splintering according to todo^k,
5026 * even when the domain of basic map i is disjoint from the domains of
5027 * the previous basic maps.
5029 static __isl_give isl_map *isl_map_partial_lexopt(
5030 __isl_take isl_map *map, __isl_take isl_set *dom,
5031 __isl_give isl_set **empty, int max)
5034 struct isl_map *res;
5035 struct isl_set *todo;
5040 if (isl_map_plain_is_empty(map)) {
5048 res = basic_map_partial_lexopt(isl_basic_map_copy(map->p[0]),
5049 isl_set_copy(dom), &todo, max);
5051 for (i = 1; i < map->n; ++i) {
5055 isl_dim *dim = isl_dim_range(isl_map_get_dim(res));
5057 res_i = basic_map_partial_lexopt(isl_basic_map_copy(map->p[i]),
5058 isl_set_copy(dom), &todo_i, max);
5061 lt = isl_map_lex_lt(isl_dim_copy(dim));
5062 le = isl_map_lex_le(dim);
5064 lt = isl_map_lex_gt(isl_dim_copy(dim));
5065 le = isl_map_lex_ge(dim);
5067 lt = isl_map_apply_range(isl_map_copy(res), lt);
5068 lt = isl_map_intersect(lt, isl_map_copy(res_i));
5069 le = isl_map_apply_range(isl_map_copy(res_i), le);
5070 le = isl_map_intersect(le, isl_map_copy(res));
5072 if (!isl_map_is_empty(lt) || !isl_map_is_empty(le)) {
5073 res = isl_map_intersect_domain(res,
5074 isl_set_copy(todo_i));
5075 res_i = isl_map_intersect_domain(res_i,
5076 isl_set_copy(todo));
5079 res = isl_map_union_disjoint(res, res_i);
5080 res = isl_map_union_disjoint(res, lt);
5081 res = isl_map_union_disjoint(res, le);
5083 todo = isl_set_intersect(todo, todo_i);
5103 __isl_give isl_map *isl_map_partial_lexmax(
5104 __isl_take isl_map *map, __isl_take isl_set *dom,
5105 __isl_give isl_set **empty)
5107 return isl_map_partial_lexopt(map, dom, empty, 1);
5110 __isl_give isl_map *isl_map_partial_lexmin(
5111 __isl_take isl_map *map, __isl_take isl_set *dom,
5112 __isl_give isl_set **empty)
5114 return isl_map_partial_lexopt(map, dom, empty, 0);
5117 __isl_give isl_set *isl_set_partial_lexmin(
5118 __isl_take isl_set *set, __isl_take isl_set *dom,
5119 __isl_give isl_set **empty)
5121 return (struct isl_set *)
5122 isl_map_partial_lexmin((struct isl_map *)set,
5126 __isl_give isl_set *isl_set_partial_lexmax(
5127 __isl_take isl_set *set, __isl_take isl_set *dom,
5128 __isl_give isl_set **empty)
5130 return (struct isl_set *)
5131 isl_map_partial_lexmax((struct isl_map *)set,
5135 __isl_give isl_map *isl_basic_map_lexopt(__isl_take isl_basic_map *bmap, int max)
5137 struct isl_basic_set *dom = NULL;
5138 struct isl_dim *dom_dim;
5142 dom_dim = isl_dim_domain(isl_dim_copy(bmap->dim));
5143 dom = isl_basic_set_universe(dom_dim);
5144 return isl_basic_map_partial_lexopt(bmap, dom, NULL, max);
5146 isl_basic_map_free(bmap);
5150 __isl_give isl_map *isl_basic_map_lexmin(__isl_take isl_basic_map *bmap)
5152 return isl_basic_map_lexopt(bmap, 0);
5155 __isl_give isl_map *isl_basic_map_lexmax(__isl_take isl_basic_map *bmap)
5157 return isl_basic_map_lexopt(bmap, 1);
5160 __isl_give isl_set *isl_basic_set_lexmin(__isl_take isl_basic_set *bset)
5162 return (isl_set *)isl_basic_map_lexmin((isl_basic_map *)bset);
5165 __isl_give isl_set *isl_basic_set_lexmax(__isl_take isl_basic_set *bset)
5167 return (isl_set *)isl_basic_map_lexmax((isl_basic_map *)bset);
5170 __isl_give isl_map *isl_map_lexopt(__isl_take isl_map *map, int max)
5172 struct isl_set *dom = NULL;
5173 struct isl_dim *dom_dim;
5177 dom_dim = isl_dim_domain(isl_dim_copy(map->dim));
5178 dom = isl_set_universe(dom_dim);
5179 return isl_map_partial_lexopt(map, dom, NULL, max);
5185 __isl_give isl_map *isl_map_lexmin(__isl_take isl_map *map)
5187 return isl_map_lexopt(map, 0);
5190 __isl_give isl_map *isl_map_lexmax(__isl_take isl_map *map)
5192 return isl_map_lexopt(map, 1);
5195 __isl_give isl_set *isl_set_lexmin(__isl_take isl_set *set)
5197 return (isl_set *)isl_map_lexmin((isl_map *)set);
5200 __isl_give isl_set *isl_set_lexmax(__isl_take isl_set *set)
5202 return (isl_set *)isl_map_lexmax((isl_map *)set);
5205 /* Construct a map that equates the two given dimensions in the given space.
5207 static __isl_give isl_map *equate(__isl_take isl_dim *dim,
5208 enum isl_dim_type src_type, int src_pos,
5209 enum isl_dim_type dst_type, int dst_pos)
5211 isl_basic_map *bmap;
5214 bmap = isl_basic_map_alloc_dim(dim, 0, 1, 0);
5215 k = isl_basic_map_alloc_equality(bmap);
5218 isl_seq_clr(bmap->eq[k], 1 + isl_basic_map_total_dim(bmap));
5219 src_pos += isl_basic_map_offset(bmap, src_type);
5220 dst_pos += isl_basic_map_offset(bmap, dst_type);
5221 isl_int_set_si(bmap->eq[k][src_pos], 1);
5222 isl_int_set_si(bmap->eq[k][dst_pos], -1);
5224 return isl_map_from_basic_map(bmap);
5226 isl_basic_map_free(bmap);
5230 /* Extract the first and only affine expression from list
5231 * and then add it to *pwaff with the given dom.
5232 * This domain is known to be disjoint from other domains
5233 * because of the way isl_basic_set_foreach_lexmax works.
5235 static int update_dim_max(__isl_take isl_basic_set *dom,
5236 __isl_take isl_aff_list *list, void *user)
5238 isl_ctx *ctx = isl_basic_set_get_ctx(dom);
5240 isl_pw_aff **pwaff = user;
5241 isl_pw_aff *pwaff_i;
5243 if (isl_aff_list_n_aff(list) != 1)
5244 isl_die(ctx, isl_error_internal,
5245 "expecting single element list", goto error);
5247 aff = isl_aff_list_get_aff(list, 0);
5248 pwaff_i = isl_pw_aff_alloc(isl_set_from_basic_set(dom), aff);
5250 *pwaff = isl_pw_aff_add_disjoint(*pwaff, pwaff_i);
5252 isl_aff_list_free(list);
5256 isl_basic_set_free(dom);
5257 isl_aff_list_free(list);
5261 /* Given a one-dimensional basic set, compute the maximum of that
5262 * dimension as an isl_pw_aff.
5264 * The isl_pw_aff is constructed by having isl_basic_set_foreach_lexmax
5265 * call update_dim_max on each leaf of the result.
5267 static __isl_give isl_pw_aff *basic_set_dim_max(__isl_keep isl_basic_set *bset)
5269 isl_dim *dim = isl_basic_set_get_dim(bset);
5273 dim = isl_dim_domain(isl_dim_from_range(dim));
5274 pwaff = isl_pw_aff_empty(dim);
5276 r = isl_basic_set_foreach_lexmax(bset, &update_dim_max, &pwaff);
5278 return isl_pw_aff_free(pwaff);
5283 /* Compute the maximum of the given set dimension as a function of the
5284 * parameters, but independently of the other set dimensions.
5286 * We first project the set onto the given dimension and then compute
5287 * the "lexicographic" maximum in each basic set, combining the results
5288 * using isl_pw_aff_union_max.
5290 __isl_give isl_pw_aff *isl_set_dim_max(__isl_take isl_set *set, int pos)
5296 map = isl_map_from_domain(set);
5297 map = isl_map_add_dims(map, isl_dim_out, 1);
5298 map = isl_map_intersect(map,
5299 equate(isl_map_get_dim(map), isl_dim_in, pos,
5301 set = isl_map_range(map);
5306 isl_dim *dim = isl_set_get_dim(set);
5307 dim = isl_dim_domain(isl_dim_from_range(dim));
5309 return isl_pw_aff_empty(dim);
5312 pwaff = basic_set_dim_max(set->p[0]);
5313 for (i = 1; i < set->n; ++i) {
5314 isl_pw_aff *pwaff_i;
5316 pwaff_i = basic_set_dim_max(set->p[i]);
5317 pwaff = isl_pw_aff_union_max(pwaff, pwaff_i);
5325 /* Apply a preimage specified by "mat" on the parameters of "bset".
5326 * bset is assumed to have only parameters and divs.
5328 static struct isl_basic_set *basic_set_parameter_preimage(
5329 struct isl_basic_set *bset, struct isl_mat *mat)
5336 bset->dim = isl_dim_cow(bset->dim);
5340 nparam = isl_basic_set_dim(bset, isl_dim_param);
5342 isl_assert(bset->ctx, mat->n_row == 1 + nparam, goto error);
5344 bset->dim->nparam = 0;
5345 bset->dim->n_out = nparam;
5346 bset = isl_basic_set_preimage(bset, mat);
5348 bset->dim->nparam = bset->dim->n_out;
5349 bset->dim->n_out = 0;
5354 isl_basic_set_free(bset);
5358 /* Apply a preimage specified by "mat" on the parameters of "set".
5359 * set is assumed to have only parameters and divs.
5361 static struct isl_set *set_parameter_preimage(
5362 struct isl_set *set, struct isl_mat *mat)
5364 struct isl_dim *dim = NULL;
5370 dim = isl_dim_copy(set->dim);
5371 dim = isl_dim_cow(dim);
5375 nparam = isl_set_dim(set, isl_dim_param);
5377 isl_assert(set->ctx, mat->n_row == 1 + nparam, goto error);
5380 dim->n_out = nparam;
5381 isl_set_reset_dim(set, dim);
5382 set = isl_set_preimage(set, mat);
5385 dim = isl_dim_copy(set->dim);
5386 dim = isl_dim_cow(dim);
5389 dim->nparam = dim->n_out;
5391 isl_set_reset_dim(set, dim);
5401 /* Intersect the basic set "bset" with the affine space specified by the
5402 * equalities in "eq".
5404 static struct isl_basic_set *basic_set_append_equalities(
5405 struct isl_basic_set *bset, struct isl_mat *eq)
5413 bset = isl_basic_set_extend_dim(bset, isl_dim_copy(bset->dim), 0,
5418 len = 1 + isl_dim_total(bset->dim) + bset->extra;
5419 for (i = 0; i < eq->n_row; ++i) {
5420 k = isl_basic_set_alloc_equality(bset);
5423 isl_seq_cpy(bset->eq[k], eq->row[i], eq->n_col);
5424 isl_seq_clr(bset->eq[k] + eq->n_col, len - eq->n_col);
5428 bset = isl_basic_set_gauss(bset, NULL);
5429 bset = isl_basic_set_finalize(bset);
5434 isl_basic_set_free(bset);
5438 /* Intersect the set "set" with the affine space specified by the
5439 * equalities in "eq".
5441 static struct isl_set *set_append_equalities(struct isl_set *set,
5449 for (i = 0; i < set->n; ++i) {
5450 set->p[i] = basic_set_append_equalities(set->p[i],
5463 /* Project the given basic set onto its parameter domain, possibly introducing
5464 * new, explicit, existential variables in the constraints.
5465 * The input has parameters and (possibly implicit) existential variables.
5466 * The output has the same parameters, but only
5467 * explicit existentially quantified variables.
5469 * The actual projection is performed by pip, but pip doesn't seem
5470 * to like equalities very much, so we first remove the equalities
5471 * among the parameters by performing a variable compression on
5472 * the parameters. Afterward, an inverse transformation is performed
5473 * and the equalities among the parameters are inserted back in.
5475 static struct isl_set *parameter_compute_divs(struct isl_basic_set *bset)
5479 struct isl_mat *T, *T2;
5480 struct isl_set *set;
5481 unsigned nparam, n_div;
5483 bset = isl_basic_set_cow(bset);
5487 if (bset->n_eq == 0)
5488 return isl_basic_set_lexmin(bset);
5490 isl_basic_set_gauss(bset, NULL);
5492 nparam = isl_basic_set_dim(bset, isl_dim_param);
5493 n_div = isl_basic_set_dim(bset, isl_dim_div);
5495 for (i = 0, j = n_div - 1; i < bset->n_eq && j >= 0; --j) {
5496 if (!isl_int_is_zero(bset->eq[i][1 + nparam + j]))
5499 if (i == bset->n_eq)
5500 return isl_basic_set_lexmin(bset);
5502 eq = isl_mat_sub_alloc6(bset->ctx, bset->eq, i, bset->n_eq - i,
5504 eq = isl_mat_cow(eq);
5505 T = isl_mat_variable_compression(isl_mat_copy(eq), &T2);
5506 if (T && T->n_col == 0) {
5510 bset = isl_basic_set_set_to_empty(bset);
5511 return isl_set_from_basic_set(bset);
5513 bset = basic_set_parameter_preimage(bset, T);
5515 set = isl_basic_set_lexmin(bset);
5516 set = set_parameter_preimage(set, T2);
5517 set = set_append_equalities(set, eq);
5521 /* Compute an explicit representation for all the existentially
5522 * quantified variables.
5523 * The input and output dimensions are first turned into parameters.
5524 * compute_divs then returns a map with the same parameters and
5525 * no input or output dimensions and the dimension specification
5526 * is reset to that of the input.
5528 static struct isl_map *compute_divs(struct isl_basic_map *bmap)
5530 struct isl_basic_set *bset;
5531 struct isl_set *set;
5532 struct isl_map *map;
5533 struct isl_dim *dim, *orig_dim = NULL;
5538 bmap = isl_basic_map_cow(bmap);
5542 nparam = isl_basic_map_dim(bmap, isl_dim_param);
5543 n_in = isl_basic_map_dim(bmap, isl_dim_in);
5544 n_out = isl_basic_map_dim(bmap, isl_dim_out);
5545 dim = isl_dim_set_alloc(bmap->ctx, nparam + n_in + n_out, 0);
5549 orig_dim = bmap->dim;
5551 bset = (struct isl_basic_set *)bmap;
5553 set = parameter_compute_divs(bset);
5554 map = (struct isl_map *)set;
5555 map = isl_map_reset_dim(map, orig_dim);
5559 isl_basic_map_free(bmap);
5563 int isl_basic_map_divs_known(__isl_keep isl_basic_map *bmap)
5571 off = isl_dim_total(bmap->dim);
5572 for (i = 0; i < bmap->n_div; ++i) {
5573 if (isl_int_is_zero(bmap->div[i][0]))
5575 isl_assert(bmap->ctx, isl_int_is_zero(bmap->div[i][1+1+off+i]),
5581 static int map_divs_known(__isl_keep isl_map *map)
5588 for (i = 0; i < map->n; ++i) {
5589 int known = isl_basic_map_divs_known(map->p[i]);
5597 /* If bmap contains any unknown divs, then compute explicit
5598 * expressions for them. However, this computation may be
5599 * quite expensive, so first try to remove divs that aren't
5602 struct isl_map *isl_basic_map_compute_divs(struct isl_basic_map *bmap)
5605 struct isl_map *map;
5607 known = isl_basic_map_divs_known(bmap);
5611 return isl_map_from_basic_map(bmap);
5613 bmap = isl_basic_map_drop_redundant_divs(bmap);
5615 known = isl_basic_map_divs_known(bmap);
5619 return isl_map_from_basic_map(bmap);
5621 map = compute_divs(bmap);
5624 isl_basic_map_free(bmap);
5628 struct isl_map *isl_map_compute_divs(struct isl_map *map)
5632 struct isl_map *res;
5639 known = map_divs_known(map);
5647 res = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[0]));
5648 for (i = 1 ; i < map->n; ++i) {
5650 r2 = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[i]));
5651 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT))
5652 res = isl_map_union_disjoint(res, r2);
5654 res = isl_map_union(res, r2);
5661 struct isl_set *isl_basic_set_compute_divs(struct isl_basic_set *bset)
5663 return (struct isl_set *)
5664 isl_basic_map_compute_divs((struct isl_basic_map *)bset);
5667 struct isl_set *isl_set_compute_divs(struct isl_set *set)
5669 return (struct isl_set *)
5670 isl_map_compute_divs((struct isl_map *)set);
5673 struct isl_set *isl_map_domain(struct isl_map *map)
5676 struct isl_set *set;
5681 map = isl_map_cow(map);
5685 set = (struct isl_set *)map;
5686 set->dim = isl_dim_domain(set->dim);
5689 for (i = 0; i < map->n; ++i) {
5690 set->p[i] = isl_basic_map_domain(map->p[i]);
5694 ISL_F_CLR(set, ISL_MAP_DISJOINT);
5695 ISL_F_CLR(set, ISL_SET_NORMALIZED);
5702 static __isl_give isl_map *map_union_disjoint(__isl_take isl_map *map1,
5703 __isl_take isl_map *map2)
5707 struct isl_map *map = NULL;
5721 isl_assert(map1->ctx, isl_dim_equal(map1->dim, map2->dim), goto error);
5723 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
5724 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
5725 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
5727 map = isl_map_alloc_dim(isl_dim_copy(map1->dim),
5728 map1->n + map2->n, flags);
5731 for (i = 0; i < map1->n; ++i) {
5732 map = isl_map_add_basic_map(map,
5733 isl_basic_map_copy(map1->p[i]));
5737 for (i = 0; i < map2->n; ++i) {
5738 map = isl_map_add_basic_map(map,
5739 isl_basic_map_copy(map2->p[i]));
5753 __isl_give isl_map *isl_map_union_disjoint(__isl_take isl_map *map1,
5754 __isl_take isl_map *map2)
5756 return isl_map_align_params_map_map_and(map1, map2, &map_union_disjoint);
5759 struct isl_map *isl_map_union(struct isl_map *map1, struct isl_map *map2)
5761 map1 = isl_map_union_disjoint(map1, map2);
5765 ISL_F_CLR(map1, ISL_MAP_DISJOINT);
5769 struct isl_set *isl_set_union_disjoint(
5770 struct isl_set *set1, struct isl_set *set2)
5772 return (struct isl_set *)
5773 isl_map_union_disjoint(
5774 (struct isl_map *)set1, (struct isl_map *)set2);
5777 struct isl_set *isl_set_union(struct isl_set *set1, struct isl_set *set2)
5779 return (struct isl_set *)
5780 isl_map_union((struct isl_map *)set1, (struct isl_map *)set2);
5783 static __isl_give isl_map *map_intersect_range(__isl_take isl_map *map,
5784 __isl_take isl_set *set)
5787 struct isl_map *result;
5793 if (!isl_dim_match(map->dim, isl_dim_param, set->dim, isl_dim_param))
5794 isl_die(set->ctx, isl_error_invalid,
5795 "parameters don't match", goto error);
5797 if (isl_dim_size(set->dim, isl_dim_set) != 0 &&
5798 !isl_map_compatible_range(map, set))
5799 isl_die(set->ctx, isl_error_invalid,
5800 "incompatible spaces", goto error);
5802 if (isl_set_plain_is_universe(set)) {
5807 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT) &&
5808 ISL_F_ISSET(set, ISL_MAP_DISJOINT))
5809 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
5811 result = isl_map_alloc_dim(isl_dim_copy(map->dim),
5812 map->n * set->n, flags);
5815 for (i = 0; i < map->n; ++i)
5816 for (j = 0; j < set->n; ++j) {
5817 result = isl_map_add_basic_map(result,
5818 isl_basic_map_intersect_range(
5819 isl_basic_map_copy(map->p[i]),
5820 isl_basic_set_copy(set->p[j])));
5833 __isl_give isl_map *isl_map_intersect_range(__isl_take isl_map *map,
5834 __isl_take isl_set *set)
5836 return isl_map_align_params_map_map_and(map, set, &map_intersect_range);
5839 struct isl_map *isl_map_intersect_domain(
5840 struct isl_map *map, struct isl_set *set)
5842 return isl_map_reverse(
5843 isl_map_intersect_range(isl_map_reverse(map), set));
5846 static __isl_give isl_map *map_apply_domain(__isl_take isl_map *map1,
5847 __isl_take isl_map *map2)
5851 map1 = isl_map_reverse(map1);
5852 map1 = isl_map_apply_range(map1, map2);
5853 return isl_map_reverse(map1);
5860 __isl_give isl_map *isl_map_apply_domain(__isl_take isl_map *map1,
5861 __isl_take isl_map *map2)
5863 return isl_map_align_params_map_map_and(map1, map2, &map_apply_domain);
5866 static __isl_give isl_map *map_apply_range(__isl_take isl_map *map1,
5867 __isl_take isl_map *map2)
5869 struct isl_dim *dim_result;
5870 struct isl_map *result;
5876 dim_result = isl_dim_join(isl_dim_copy(map1->dim),
5877 isl_dim_copy(map2->dim));
5879 result = isl_map_alloc_dim(dim_result, map1->n * map2->n, 0);
5882 for (i = 0; i < map1->n; ++i)
5883 for (j = 0; j < map2->n; ++j) {
5884 result = isl_map_add_basic_map(result,
5885 isl_basic_map_apply_range(
5886 isl_basic_map_copy(map1->p[i]),
5887 isl_basic_map_copy(map2->p[j])));
5893 if (result && result->n <= 1)
5894 ISL_F_SET(result, ISL_MAP_DISJOINT);
5902 __isl_give isl_map *isl_map_apply_range(__isl_take isl_map *map1,
5903 __isl_take isl_map *map2)
5905 return isl_map_align_params_map_map_and(map1, map2, &map_apply_range);
5909 * returns range - domain
5911 struct isl_basic_set *isl_basic_map_deltas(struct isl_basic_map *bmap)
5913 isl_dim *dims, *target_dim;
5914 struct isl_basic_set *bset;
5921 isl_assert(bmap->ctx, isl_dim_tuple_match(bmap->dim, isl_dim_in,
5922 bmap->dim, isl_dim_out),
5924 target_dim = isl_dim_domain(isl_basic_map_get_dim(bmap));
5925 dim = isl_basic_map_n_in(bmap);
5926 nparam = isl_basic_map_n_param(bmap);
5927 bset = isl_basic_set_from_basic_map(bmap);
5928 bset = isl_basic_set_cow(bset);
5929 dims = isl_basic_set_get_dim(bset);
5930 dims = isl_dim_add(dims, isl_dim_set, dim);
5931 bset = isl_basic_set_extend_dim(bset, dims, 0, dim, 0);
5932 bset = isl_basic_set_swap_vars(bset, 2*dim);
5933 for (i = 0; i < dim; ++i) {
5934 int j = isl_basic_map_alloc_equality(
5935 (struct isl_basic_map *)bset);
5938 isl_seq_clr(bset->eq[j], 1 + isl_basic_set_total_dim(bset));
5939 isl_int_set_si(bset->eq[j][1+nparam+i], 1);
5940 isl_int_set_si(bset->eq[j][1+nparam+dim+i], 1);
5941 isl_int_set_si(bset->eq[j][1+nparam+2*dim+i], -1);
5943 bset = isl_basic_set_project_out(bset, isl_dim_set, dim, 2*dim);
5944 bset = isl_basic_set_reset_dim(bset, target_dim);
5947 isl_basic_map_free(bmap);
5952 * returns range - domain
5954 struct isl_set *isl_map_deltas(struct isl_map *map)
5958 struct isl_set *result;
5963 isl_assert(map->ctx, isl_dim_tuple_match(map->dim, isl_dim_in,
5964 map->dim, isl_dim_out),
5966 dim = isl_map_get_dim(map);
5967 dim = isl_dim_domain(dim);
5968 result = isl_set_alloc_dim(dim, map->n, 0);
5971 for (i = 0; i < map->n; ++i)
5972 result = isl_set_add_basic_set(result,
5973 isl_basic_map_deltas(isl_basic_map_copy(map->p[i])));
5982 * returns [domain -> range] -> range - domain
5984 __isl_give isl_basic_map *isl_basic_map_deltas_map(
5985 __isl_take isl_basic_map *bmap)
5989 isl_basic_map *domain;
5993 if (!isl_dim_tuple_match(bmap->dim, isl_dim_in, bmap->dim, isl_dim_out))
5994 isl_die(bmap->ctx, isl_error_invalid,
5995 "domain and range don't match", goto error);
5997 nparam = isl_basic_map_dim(bmap, isl_dim_param);
5998 n = isl_basic_map_dim(bmap, isl_dim_in);
6000 dim = isl_dim_from_range(isl_dim_domain(isl_basic_map_get_dim(bmap)));
6001 domain = isl_basic_map_universe(dim);
6003 bmap = isl_basic_map_from_domain(isl_basic_map_wrap(bmap));
6004 bmap = isl_basic_map_apply_range(bmap, domain);
6005 bmap = isl_basic_map_extend_constraints(bmap, n, 0);
6007 total = isl_basic_map_total_dim(bmap);
6009 for (i = 0; i < n; ++i) {
6010 k = isl_basic_map_alloc_equality(bmap);
6013 isl_seq_clr(bmap->eq[k], 1 + total);
6014 isl_int_set_si(bmap->eq[k][1 + nparam + i], 1);
6015 isl_int_set_si(bmap->eq[k][1 + nparam + n + i], -1);
6016 isl_int_set_si(bmap->eq[k][1 + nparam + n + n + i], 1);
6019 bmap = isl_basic_map_gauss(bmap, NULL);
6020 return isl_basic_map_finalize(bmap);
6022 isl_basic_map_free(bmap);
6027 * returns [domain -> range] -> range - domain
6029 __isl_give isl_map *isl_map_deltas_map(__isl_take isl_map *map)
6032 isl_dim *domain_dim;
6037 if (!isl_dim_tuple_match(map->dim, isl_dim_in, map->dim, isl_dim_out))
6038 isl_die(map->ctx, isl_error_invalid,
6039 "domain and range don't match", goto error);
6041 map = isl_map_cow(map);
6045 domain_dim = isl_dim_from_range(isl_dim_domain(isl_map_get_dim(map)));
6046 map->dim = isl_dim_from_domain(isl_dim_wrap(map->dim));
6047 map->dim = isl_dim_join(map->dim, domain_dim);
6050 for (i = 0; i < map->n; ++i) {
6051 map->p[i] = isl_basic_map_deltas_map(map->p[i]);
6055 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
6062 static struct isl_basic_map *basic_map_identity(struct isl_dim *dims)
6064 struct isl_basic_map *bmap;
6072 nparam = dims->nparam;
6074 bmap = isl_basic_map_alloc_dim(dims, 0, dim, 0);
6078 for (i = 0; i < dim; ++i) {
6079 int j = isl_basic_map_alloc_equality(bmap);
6082 isl_seq_clr(bmap->eq[j], 1 + isl_basic_map_total_dim(bmap));
6083 isl_int_set_si(bmap->eq[j][1+nparam+i], 1);
6084 isl_int_set_si(bmap->eq[j][1+nparam+dim+i], -1);
6086 return isl_basic_map_finalize(bmap);
6088 isl_basic_map_free(bmap);
6092 __isl_give isl_basic_map *isl_basic_map_identity(__isl_take isl_dim *dim)
6096 if (dim->n_in != dim->n_out)
6097 isl_die(dim->ctx, isl_error_invalid,
6098 "number of input and output dimensions needs to be "
6099 "the same", goto error);
6100 return basic_map_identity(dim);
6106 struct isl_basic_map *isl_basic_map_identity_like(struct isl_basic_map *model)
6108 if (!model || !model->dim)
6110 return isl_basic_map_identity(isl_dim_copy(model->dim));
6113 __isl_give isl_map *isl_map_identity(__isl_take isl_dim *dim)
6115 return isl_map_from_basic_map(isl_basic_map_identity(dim));
6118 struct isl_map *isl_map_identity_like(struct isl_map *model)
6120 if (!model || !model->dim)
6122 return isl_map_identity(isl_dim_copy(model->dim));
6125 struct isl_map *isl_map_identity_like_basic_map(struct isl_basic_map *model)
6127 if (!model || !model->dim)
6129 return isl_map_identity(isl_dim_copy(model->dim));
6132 __isl_give isl_map *isl_set_identity(__isl_take isl_set *set)
6134 isl_dim *dim = isl_set_get_dim(set);
6136 id = isl_map_identity(isl_dim_map_from_set(dim));
6137 return isl_map_intersect_range(id, set);
6140 /* Construct a basic set with all set dimensions having only non-negative
6143 struct isl_basic_set *isl_basic_set_positive_orthant(struct isl_dim *dims)
6148 struct isl_basic_set *bset;
6152 nparam = dims->nparam;
6154 bset = isl_basic_set_alloc_dim(dims, 0, 0, dim);
6157 for (i = 0; i < dim; ++i) {
6158 int k = isl_basic_set_alloc_inequality(bset);
6161 isl_seq_clr(bset->ineq[k], 1 + isl_basic_set_total_dim(bset));
6162 isl_int_set_si(bset->ineq[k][1 + nparam + i], 1);
6166 isl_basic_set_free(bset);
6170 /* Construct the half-space x_pos >= 0.
6172 static __isl_give isl_basic_set *nonneg_halfspace(__isl_take isl_dim *dim,
6176 isl_basic_set *nonneg;
6178 nonneg = isl_basic_set_alloc_dim(dim, 0, 0, 1);
6179 k = isl_basic_set_alloc_inequality(nonneg);
6182 isl_seq_clr(nonneg->ineq[k], 1 + isl_basic_set_total_dim(nonneg));
6183 isl_int_set_si(nonneg->ineq[k][pos], 1);
6185 return isl_basic_set_finalize(nonneg);
6187 isl_basic_set_free(nonneg);
6191 /* Construct the half-space x_pos <= -1.
6193 static __isl_give isl_basic_set *neg_halfspace(__isl_take isl_dim *dim, int pos)
6198 neg = isl_basic_set_alloc_dim(dim, 0, 0, 1);
6199 k = isl_basic_set_alloc_inequality(neg);
6202 isl_seq_clr(neg->ineq[k], 1 + isl_basic_set_total_dim(neg));
6203 isl_int_set_si(neg->ineq[k][0], -1);
6204 isl_int_set_si(neg->ineq[k][pos], -1);
6206 return isl_basic_set_finalize(neg);
6208 isl_basic_set_free(neg);
6212 __isl_give isl_set *isl_set_split_dims(__isl_take isl_set *set,
6213 enum isl_dim_type type, unsigned first, unsigned n)
6216 isl_basic_set *nonneg;
6224 isl_assert(set->ctx, first + n <= isl_set_dim(set, type), goto error);
6226 for (i = 0; i < n; ++i) {
6227 nonneg = nonneg_halfspace(isl_set_get_dim(set),
6228 pos(set->dim, type) + first + i);
6229 neg = neg_halfspace(isl_set_get_dim(set),
6230 pos(set->dim, type) + first + i);
6232 set = isl_set_intersect(set, isl_basic_set_union(nonneg, neg));
6241 static int foreach_orthant(__isl_take isl_set *set, int *signs, int first,
6242 int len, int (*fn)(__isl_take isl_set *orthant, int *signs, void *user),
6249 if (isl_set_plain_is_empty(set)) {
6254 return fn(set, signs, user);
6257 half = isl_set_from_basic_set(nonneg_halfspace(isl_set_get_dim(set),
6259 half = isl_set_intersect(half, isl_set_copy(set));
6260 if (foreach_orthant(half, signs, first + 1, len, fn, user) < 0)
6264 half = isl_set_from_basic_set(neg_halfspace(isl_set_get_dim(set),
6266 half = isl_set_intersect(half, set);
6267 return foreach_orthant(half, signs, first + 1, len, fn, user);
6273 /* Call "fn" on the intersections of "set" with each of the orthants
6274 * (except for obviously empty intersections). The orthant is identified
6275 * by the signs array, with each entry having value 1 or -1 according
6276 * to the sign of the corresponding variable.
6278 int isl_set_foreach_orthant(__isl_keep isl_set *set,
6279 int (*fn)(__isl_take isl_set *orthant, int *signs, void *user),
6289 if (isl_set_plain_is_empty(set))
6292 nparam = isl_set_dim(set, isl_dim_param);
6293 nvar = isl_set_dim(set, isl_dim_set);
6295 signs = isl_alloc_array(set->ctx, int, nparam + nvar);
6297 r = foreach_orthant(isl_set_copy(set), signs, 0, nparam + nvar,
6305 int isl_set_is_equal(struct isl_set *set1, struct isl_set *set2)
6307 return isl_map_is_equal((struct isl_map *)set1, (struct isl_map *)set2);
6310 int isl_basic_map_is_subset(
6311 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
6314 struct isl_map *map1;
6315 struct isl_map *map2;
6317 if (!bmap1 || !bmap2)
6320 map1 = isl_map_from_basic_map(isl_basic_map_copy(bmap1));
6321 map2 = isl_map_from_basic_map(isl_basic_map_copy(bmap2));
6323 is_subset = isl_map_is_subset(map1, map2);
6331 int isl_basic_map_is_equal(
6332 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
6336 if (!bmap1 || !bmap2)
6338 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
6341 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
6345 int isl_basic_set_is_equal(
6346 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
6348 return isl_basic_map_is_equal(
6349 (struct isl_basic_map *)bset1, (struct isl_basic_map *)bset2);
6352 int isl_map_is_empty(struct isl_map *map)
6359 for (i = 0; i < map->n; ++i) {
6360 is_empty = isl_basic_map_is_empty(map->p[i]);
6369 int isl_map_plain_is_empty(__isl_keep isl_map *map)
6371 return map ? map->n == 0 : -1;
6374 int isl_map_fast_is_empty(__isl_keep isl_map *map)
6376 return isl_map_plain_is_empty(map);
6379 int isl_set_plain_is_empty(struct isl_set *set)
6381 return set ? set->n == 0 : -1;
6384 int isl_set_fast_is_empty(__isl_keep isl_set *set)
6386 return isl_set_plain_is_empty(set);
6389 int isl_set_is_empty(struct isl_set *set)
6391 return isl_map_is_empty((struct isl_map *)set);
6394 int isl_map_has_equal_dim(__isl_keep isl_map *map1, __isl_keep isl_map *map2)
6399 return isl_dim_equal(map1->dim, map2->dim);
6402 int isl_set_has_equal_dim(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
6407 return isl_dim_equal(set1->dim, set2->dim);
6410 static int map_is_equal(__isl_keep isl_map *map1, __isl_keep isl_map *map2)
6416 is_subset = isl_map_is_subset(map1, map2);
6419 is_subset = isl_map_is_subset(map2, map1);
6423 int isl_map_is_equal(__isl_keep isl_map *map1, __isl_keep isl_map *map2)
6425 return align_params_map_map_and_test(map1, map2, &map_is_equal);
6428 int isl_basic_map_is_strict_subset(
6429 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
6433 if (!bmap1 || !bmap2)
6435 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
6438 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
6439 if (is_subset == -1)
6444 int isl_map_is_strict_subset(struct isl_map *map1, struct isl_map *map2)
6450 is_subset = isl_map_is_subset(map1, map2);
6453 is_subset = isl_map_is_subset(map2, map1);
6454 if (is_subset == -1)
6459 int isl_set_is_strict_subset(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
6461 return isl_map_is_strict_subset((isl_map *)set1, (isl_map *)set2);
6464 int isl_basic_map_is_universe(struct isl_basic_map *bmap)
6468 return bmap->n_eq == 0 && bmap->n_ineq == 0;
6471 int isl_basic_set_is_universe(struct isl_basic_set *bset)
6475 return bset->n_eq == 0 && bset->n_ineq == 0;
6478 int isl_map_plain_is_universe(__isl_keep isl_map *map)
6485 for (i = 0; i < map->n; ++i) {
6486 int r = isl_basic_map_is_universe(map->p[i]);
6494 int isl_set_plain_is_universe(__isl_keep isl_set *set)
6496 return isl_map_plain_is_universe((isl_map *) set);
6499 int isl_set_fast_is_universe(__isl_keep isl_set *set)
6501 return isl_set_plain_is_universe(set);
6504 int isl_basic_map_is_empty(struct isl_basic_map *bmap)
6506 struct isl_basic_set *bset = NULL;
6507 struct isl_vec *sample = NULL;
6514 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY))
6517 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL)) {
6518 struct isl_basic_map *copy = isl_basic_map_copy(bmap);
6519 copy = isl_basic_map_remove_redundancies(copy);
6520 empty = ISL_F_ISSET(copy, ISL_BASIC_MAP_EMPTY);
6521 isl_basic_map_free(copy);
6525 total = 1 + isl_basic_map_total_dim(bmap);
6526 if (bmap->sample && bmap->sample->size == total) {
6527 int contains = isl_basic_map_contains(bmap, bmap->sample);
6533 isl_vec_free(bmap->sample);
6534 bmap->sample = NULL;
6535 bset = isl_basic_map_underlying_set(isl_basic_map_copy(bmap));
6538 sample = isl_basic_set_sample_vec(bset);
6541 empty = sample->size == 0;
6542 isl_vec_free(bmap->sample);
6543 bmap->sample = sample;
6545 ISL_F_SET(bmap, ISL_BASIC_MAP_EMPTY);
6550 int isl_basic_map_plain_is_empty(__isl_keep isl_basic_map *bmap)
6554 return ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY);
6557 int isl_basic_map_fast_is_empty(__isl_keep isl_basic_map *bmap)
6559 return isl_basic_map_plain_is_empty(bmap);
6562 int isl_basic_set_plain_is_empty(__isl_keep isl_basic_set *bset)
6566 return ISL_F_ISSET(bset, ISL_BASIC_SET_EMPTY);
6569 int isl_basic_set_fast_is_empty(__isl_keep isl_basic_set *bset)
6571 return isl_basic_set_plain_is_empty(bset);
6574 int isl_basic_set_is_empty(struct isl_basic_set *bset)
6576 return isl_basic_map_is_empty((struct isl_basic_map *)bset);
6579 struct isl_map *isl_basic_map_union(
6580 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
6582 struct isl_map *map;
6583 if (!bmap1 || !bmap2)
6586 isl_assert(bmap1->ctx, isl_dim_equal(bmap1->dim, bmap2->dim), goto error);
6588 map = isl_map_alloc_dim(isl_dim_copy(bmap1->dim), 2, 0);
6591 map = isl_map_add_basic_map(map, bmap1);
6592 map = isl_map_add_basic_map(map, bmap2);
6595 isl_basic_map_free(bmap1);
6596 isl_basic_map_free(bmap2);
6600 struct isl_set *isl_basic_set_union(
6601 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
6603 return (struct isl_set *)isl_basic_map_union(
6604 (struct isl_basic_map *)bset1,
6605 (struct isl_basic_map *)bset2);
6608 /* Order divs such that any div only depends on previous divs */
6609 struct isl_basic_map *isl_basic_map_order_divs(struct isl_basic_map *bmap)
6617 off = isl_dim_total(bmap->dim);
6619 for (i = 0; i < bmap->n_div; ++i) {
6621 if (isl_int_is_zero(bmap->div[i][0]))
6623 pos = isl_seq_first_non_zero(bmap->div[i]+1+1+off+i,
6627 isl_basic_map_swap_div(bmap, i, i + pos);
6633 struct isl_basic_set *isl_basic_set_order_divs(struct isl_basic_set *bset)
6635 return (struct isl_basic_set *)
6636 isl_basic_map_order_divs((struct isl_basic_map *)bset);
6639 __isl_give isl_map *isl_map_order_divs(__isl_take isl_map *map)
6646 for (i = 0; i < map->n; ++i) {
6647 map->p[i] = isl_basic_map_order_divs(map->p[i]);
6658 /* Apply the expansion computed by isl_merge_divs.
6659 * The expansion itself is given by "exp" while the resulting
6660 * list of divs is given by "div".
6662 __isl_give isl_basic_set *isl_basic_set_expand_divs(
6663 __isl_take isl_basic_set *bset, __isl_take isl_mat *div, int *exp)
6668 bset = isl_basic_set_cow(bset);
6672 if (div->n_row < bset->n_div)
6673 isl_die(isl_mat_get_ctx(div), isl_error_invalid,
6674 "not an expansion", goto error);
6676 bset = isl_basic_map_extend_dim(bset, isl_dim_copy(bset->dim),
6677 div->n_row - bset->n_div, 0,
6678 2 * (div->n_row - bset->n_div));
6680 n_div = bset->n_div;
6681 for (i = n_div; i < div->n_row; ++i)
6682 if (isl_basic_set_alloc_div(bset) < 0)
6686 for (i = div->n_row - 1; i >= 0; --i) {
6687 if (j >= 0 && exp[j] == i) {
6689 isl_basic_map_swap_div(bset, i, j);
6692 isl_seq_cpy(bset->div[i], div->row[i], div->n_col);
6693 if (isl_basic_map_add_div_constraints(bset, i) < 0)
6701 isl_basic_set_free(bset);
6706 /* Look for a div in dst that corresponds to the div "div" in src.
6707 * The divs before "div" in src and dst are assumed to be the same.
6709 * Returns -1 if no corresponding div was found and the position
6710 * of the corresponding div in dst otherwise.
6712 static int find_div(struct isl_basic_map *dst,
6713 struct isl_basic_map *src, unsigned div)
6717 unsigned total = isl_dim_total(src->dim);
6719 isl_assert(dst->ctx, div <= dst->n_div, return -1);
6720 for (i = div; i < dst->n_div; ++i)
6721 if (isl_seq_eq(dst->div[i], src->div[div], 1+1+total+div) &&
6722 isl_seq_first_non_zero(dst->div[i]+1+1+total+div,
6723 dst->n_div - div) == -1)
6728 struct isl_basic_map *isl_basic_map_align_divs(
6729 struct isl_basic_map *dst, struct isl_basic_map *src)
6732 unsigned total = isl_dim_total(src->dim);
6737 if (src->n_div == 0)
6740 for (i = 0; i < src->n_div; ++i)
6741 isl_assert(src->ctx, !isl_int_is_zero(src->div[i][0]), goto error);
6743 src = isl_basic_map_order_divs(src);
6744 dst = isl_basic_map_cow(dst);
6745 dst = isl_basic_map_extend_dim(dst, isl_dim_copy(dst->dim),
6746 src->n_div, 0, 2 * src->n_div);
6749 for (i = 0; i < src->n_div; ++i) {
6750 int j = find_div(dst, src, i);
6752 j = isl_basic_map_alloc_div(dst);
6755 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total+i);
6756 isl_seq_clr(dst->div[j]+1+1+total+i, dst->n_div - i);
6757 if (isl_basic_map_add_div_constraints(dst, j) < 0)
6761 isl_basic_map_swap_div(dst, i, j);
6765 isl_basic_map_free(dst);
6769 struct isl_basic_set *isl_basic_set_align_divs(
6770 struct isl_basic_set *dst, struct isl_basic_set *src)
6772 return (struct isl_basic_set *)isl_basic_map_align_divs(
6773 (struct isl_basic_map *)dst, (struct isl_basic_map *)src);
6776 struct isl_map *isl_map_align_divs(struct isl_map *map)
6784 map = isl_map_compute_divs(map);
6785 map = isl_map_cow(map);
6789 for (i = 1; i < map->n; ++i)
6790 map->p[0] = isl_basic_map_align_divs(map->p[0], map->p[i]);
6791 for (i = 1; i < map->n; ++i)
6792 map->p[i] = isl_basic_map_align_divs(map->p[i], map->p[0]);
6794 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
6798 struct isl_set *isl_set_align_divs(struct isl_set *set)
6800 return (struct isl_set *)isl_map_align_divs((struct isl_map *)set);
6803 static __isl_give isl_set *set_apply( __isl_take isl_set *set,
6804 __isl_take isl_map *map)
6808 isl_assert(set->ctx, isl_map_compatible_domain(map, set), goto error);
6809 map = isl_map_intersect_domain(map, set);
6810 set = isl_map_range(map);
6818 __isl_give isl_set *isl_set_apply( __isl_take isl_set *set,
6819 __isl_take isl_map *map)
6821 return isl_map_align_params_map_map_and(set, map, &set_apply);
6824 /* There is no need to cow as removing empty parts doesn't change
6825 * the meaning of the set.
6827 struct isl_map *isl_map_remove_empty_parts(struct isl_map *map)
6834 for (i = map->n-1; i >= 0; --i) {
6835 if (!ISL_F_ISSET(map->p[i], ISL_BASIC_MAP_EMPTY))
6837 isl_basic_map_free(map->p[i]);
6838 if (i != map->n-1) {
6839 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
6840 map->p[i] = map->p[map->n-1];
6848 struct isl_set *isl_set_remove_empty_parts(struct isl_set *set)
6850 return (struct isl_set *)
6851 isl_map_remove_empty_parts((struct isl_map *)set);
6854 struct isl_basic_map *isl_map_copy_basic_map(struct isl_map *map)
6856 struct isl_basic_map *bmap;
6857 if (!map || map->n == 0)
6859 bmap = map->p[map->n-1];
6860 isl_assert(map->ctx, ISL_F_ISSET(bmap, ISL_BASIC_SET_FINAL), return NULL);
6861 return isl_basic_map_copy(bmap);
6864 struct isl_basic_set *isl_set_copy_basic_set(struct isl_set *set)
6866 return (struct isl_basic_set *)
6867 isl_map_copy_basic_map((struct isl_map *)set);
6870 __isl_give isl_map *isl_map_drop_basic_map(__isl_take isl_map *map,
6871 __isl_keep isl_basic_map *bmap)
6877 for (i = map->n-1; i >= 0; --i) {
6878 if (map->p[i] != bmap)
6880 map = isl_map_cow(map);
6883 isl_basic_map_free(map->p[i]);
6884 if (i != map->n-1) {
6885 ISL_F_CLR(map, ISL_SET_NORMALIZED);
6886 map->p[i] = map->p[map->n-1];
6897 struct isl_set *isl_set_drop_basic_set(struct isl_set *set,
6898 struct isl_basic_set *bset)
6900 return (struct isl_set *)isl_map_drop_basic_map((struct isl_map *)set,
6901 (struct isl_basic_map *)bset);
6904 /* Given two basic sets bset1 and bset2, compute the maximal difference
6905 * between the values of dimension pos in bset1 and those in bset2
6906 * for any common value of the parameters and dimensions preceding pos.
6908 static enum isl_lp_result basic_set_maximal_difference_at(
6909 __isl_keep isl_basic_set *bset1, __isl_keep isl_basic_set *bset2,
6910 int pos, isl_int *opt)
6912 struct isl_dim *dims;
6913 struct isl_basic_map *bmap1 = NULL;
6914 struct isl_basic_map *bmap2 = NULL;
6915 struct isl_ctx *ctx;
6916 struct isl_vec *obj;
6919 unsigned dim1, dim2;
6920 enum isl_lp_result res;
6922 if (!bset1 || !bset2)
6923 return isl_lp_error;
6925 nparam = isl_basic_set_n_param(bset1);
6926 dim1 = isl_basic_set_n_dim(bset1);
6927 dim2 = isl_basic_set_n_dim(bset2);
6928 dims = isl_dim_alloc(bset1->ctx, nparam, pos, dim1 - pos);
6929 bmap1 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset1), dims);
6930 dims = isl_dim_alloc(bset2->ctx, nparam, pos, dim2 - pos);
6931 bmap2 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset2), dims);
6932 if (!bmap1 || !bmap2)
6934 bmap1 = isl_basic_map_cow(bmap1);
6935 bmap1 = isl_basic_map_extend(bmap1, nparam,
6936 pos, (dim1 - pos) + (dim2 - pos),
6937 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
6938 bmap1 = add_constraints(bmap1, bmap2, 0, dim1 - pos);
6941 total = isl_basic_map_total_dim(bmap1);
6943 obj = isl_vec_alloc(ctx, 1 + total);
6944 isl_seq_clr(obj->block.data, 1 + total);
6945 isl_int_set_si(obj->block.data[1+nparam+pos], 1);
6946 isl_int_set_si(obj->block.data[1+nparam+pos+(dim1-pos)], -1);
6949 res = isl_basic_map_solve_lp(bmap1, 1, obj->block.data, ctx->one,
6951 isl_basic_map_free(bmap1);
6955 isl_basic_map_free(bmap1);
6956 isl_basic_map_free(bmap2);
6957 return isl_lp_error;
6960 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
6961 * for any common value of the parameters and dimensions preceding pos
6962 * in both basic sets, the values of dimension pos in bset1 are
6963 * smaller or larger than those in bset2.
6966 * 1 if bset1 follows bset2
6967 * -1 if bset1 precedes bset2
6968 * 0 if bset1 and bset2 are incomparable
6969 * -2 if some error occurred.
6971 int isl_basic_set_compare_at(struct isl_basic_set *bset1,
6972 struct isl_basic_set *bset2, int pos)
6975 enum isl_lp_result res;
6980 res = basic_set_maximal_difference_at(bset1, bset2, pos, &opt);
6982 if (res == isl_lp_empty)
6984 else if ((res == isl_lp_ok && isl_int_is_pos(opt)) ||
6985 res == isl_lp_unbounded)
6987 else if (res == isl_lp_ok && isl_int_is_neg(opt))
6996 /* Given two basic sets bset1 and bset2, check whether
6997 * for any common value of the parameters and dimensions preceding pos
6998 * there is a value of dimension pos in bset1 that is larger
6999 * than a value of the same dimension in bset2.
7002 * 1 if there exists such a pair
7003 * 0 if there is no such pair, but there is a pair of equal values
7005 * -2 if some error occurred.
7007 int isl_basic_set_follows_at(__isl_keep isl_basic_set *bset1,
7008 __isl_keep isl_basic_set *bset2, int pos)
7011 enum isl_lp_result res;
7016 res = basic_set_maximal_difference_at(bset1, bset2, pos, &opt);
7018 if (res == isl_lp_empty)
7020 else if ((res == isl_lp_ok && isl_int_is_pos(opt)) ||
7021 res == isl_lp_unbounded)
7023 else if (res == isl_lp_ok && isl_int_is_neg(opt))
7025 else if (res == isl_lp_ok)
7034 /* Given two sets set1 and set2, check whether
7035 * for any common value of the parameters and dimensions preceding pos
7036 * there is a value of dimension pos in set1 that is larger
7037 * than a value of the same dimension in set2.
7040 * 1 if there exists such a pair
7041 * 0 if there is no such pair, but there is a pair of equal values
7043 * -2 if some error occurred.
7045 int isl_set_follows_at(__isl_keep isl_set *set1,
7046 __isl_keep isl_set *set2, int pos)
7054 for (i = 0; i < set1->n; ++i)
7055 for (j = 0; j < set2->n; ++j) {
7057 f = isl_basic_set_follows_at(set1->p[i], set2->p[j], pos);
7058 if (f == 1 || f == -2)
7067 static int isl_basic_map_plain_has_fixed_var(__isl_keep isl_basic_map *bmap,
7068 unsigned pos, isl_int *val)
7076 total = isl_basic_map_total_dim(bmap);
7077 for (i = 0, d = total-1; i < bmap->n_eq && d+1 > pos; ++i) {
7078 for (; d+1 > pos; --d)
7079 if (!isl_int_is_zero(bmap->eq[i][1+d]))
7083 if (isl_seq_first_non_zero(bmap->eq[i]+1, d) != -1)
7085 if (isl_seq_first_non_zero(bmap->eq[i]+1+d+1, total-d-1) != -1)
7087 if (!isl_int_is_one(bmap->eq[i][1+d]))
7090 isl_int_neg(*val, bmap->eq[i][0]);
7096 static int isl_map_plain_has_fixed_var(__isl_keep isl_map *map,
7097 unsigned pos, isl_int *val)
7109 return isl_basic_map_plain_has_fixed_var(map->p[0], pos, val);
7112 fixed = isl_basic_map_plain_has_fixed_var(map->p[0], pos, &v);
7113 for (i = 1; fixed == 1 && i < map->n; ++i) {
7114 fixed = isl_basic_map_plain_has_fixed_var(map->p[i], pos, &tmp);
7115 if (fixed == 1 && isl_int_ne(tmp, v))
7119 isl_int_set(*val, v);
7125 static int isl_basic_set_plain_has_fixed_var(__isl_keep isl_basic_set *bset,
7126 unsigned pos, isl_int *val)
7128 return isl_basic_map_plain_has_fixed_var((struct isl_basic_map *)bset,
7132 static int isl_set_plain_has_fixed_var(__isl_keep isl_set *set, unsigned pos,
7135 return isl_map_plain_has_fixed_var((struct isl_map *)set, pos, val);
7138 int isl_basic_map_plain_is_fixed(__isl_keep isl_basic_map *bmap,
7139 enum isl_dim_type type, unsigned pos, isl_int *val)
7141 if (pos >= isl_basic_map_dim(bmap, type))
7143 return isl_basic_map_plain_has_fixed_var(bmap,
7144 isl_basic_map_offset(bmap, type) - 1 + pos, val);
7147 int isl_map_plain_is_fixed(__isl_keep isl_map *map,
7148 enum isl_dim_type type, unsigned pos, isl_int *val)
7150 if (pos >= isl_map_dim(map, type))
7152 return isl_map_plain_has_fixed_var(map,
7153 map_offset(map, type) - 1 + pos, val);
7156 int isl_map_fast_is_fixed(__isl_keep isl_map *map,
7157 enum isl_dim_type type, unsigned pos, isl_int *val)
7159 return isl_map_plain_is_fixed(map, type, pos, val);
7162 /* Check if dimension dim has fixed value and if so and if val is not NULL,
7163 * then return this fixed value in *val.
7165 int isl_basic_set_plain_dim_is_fixed(__isl_keep isl_basic_set *bset,
7166 unsigned dim, isl_int *val)
7168 return isl_basic_set_plain_has_fixed_var(bset,
7169 isl_basic_set_n_param(bset) + dim, val);
7172 /* Check if dimension dim has fixed value and if so and if val is not NULL,
7173 * then return this fixed value in *val.
7175 int isl_set_plain_dim_is_fixed(__isl_keep isl_set *set,
7176 unsigned dim, isl_int *val)
7178 return isl_set_plain_has_fixed_var(set, isl_set_n_param(set) + dim, val);
7181 int isl_set_fast_dim_is_fixed(__isl_keep isl_set *set,
7182 unsigned dim, isl_int *val)
7184 return isl_set_plain_dim_is_fixed(set, dim, val);
7187 /* Check if input variable in has fixed value and if so and if val is not NULL,
7188 * then return this fixed value in *val.
7190 int isl_map_plain_input_is_fixed(__isl_keep isl_map *map,
7191 unsigned in, isl_int *val)
7193 return isl_map_plain_has_fixed_var(map, isl_map_n_param(map) + in, val);
7196 /* Check if dimension dim has an (obvious) fixed lower bound and if so
7197 * and if val is not NULL, then return this lower bound in *val.
7199 int isl_basic_set_plain_dim_has_fixed_lower_bound(
7200 __isl_keep isl_basic_set *bset, unsigned dim, isl_int *val)
7202 int i, i_eq = -1, i_ineq = -1;
7209 total = isl_basic_set_total_dim(bset);
7210 nparam = isl_basic_set_n_param(bset);
7211 for (i = 0; i < bset->n_eq; ++i) {
7212 if (isl_int_is_zero(bset->eq[i][1+nparam+dim]))
7218 for (i = 0; i < bset->n_ineq; ++i) {
7219 if (!isl_int_is_pos(bset->ineq[i][1+nparam+dim]))
7221 if (i_eq != -1 || i_ineq != -1)
7225 if (i_eq == -1 && i_ineq == -1)
7227 c = i_eq != -1 ? bset->eq[i_eq] : bset->ineq[i_ineq];
7228 /* The coefficient should always be one due to normalization. */
7229 if (!isl_int_is_one(c[1+nparam+dim]))
7231 if (isl_seq_first_non_zero(c+1, nparam+dim) != -1)
7233 if (isl_seq_first_non_zero(c+1+nparam+dim+1,
7234 total - nparam - dim - 1) != -1)
7237 isl_int_neg(*val, c[0]);
7241 int isl_set_plain_dim_has_fixed_lower_bound(__isl_keep isl_set *set,
7242 unsigned dim, isl_int *val)
7254 return isl_basic_set_plain_dim_has_fixed_lower_bound(set->p[0],
7258 fixed = isl_basic_set_plain_dim_has_fixed_lower_bound(set->p[0],
7260 for (i = 1; fixed == 1 && i < set->n; ++i) {
7261 fixed = isl_basic_set_plain_dim_has_fixed_lower_bound(set->p[i],
7263 if (fixed == 1 && isl_int_ne(tmp, v))
7267 isl_int_set(*val, v);
7278 /* uset_gist depends on constraints without existentially quantified
7279 * variables sorting first.
7281 static int qsort_constraint_cmp(const void *p1, const void *p2)
7283 const struct constraint *c1 = (const struct constraint *)p1;
7284 const struct constraint *c2 = (const struct constraint *)p2;
7286 unsigned size = isl_min(c1->size, c2->size);
7288 l1 = isl_seq_last_non_zero(c1->c, size);
7289 l2 = isl_seq_last_non_zero(c2->c, size);
7294 return isl_seq_cmp(c1->c, c2->c, size);
7297 static struct isl_basic_map *isl_basic_map_sort_constraints(
7298 struct isl_basic_map *bmap)
7301 struct constraint *c;
7306 total = isl_basic_map_total_dim(bmap);
7307 c = isl_alloc_array(bmap->ctx, struct constraint, bmap->n_ineq);
7310 for (i = 0; i < bmap->n_ineq; ++i) {
7312 c[i].c = bmap->ineq[i];
7314 qsort(c, bmap->n_ineq, sizeof(struct constraint), qsort_constraint_cmp);
7315 for (i = 0; i < bmap->n_ineq; ++i)
7316 bmap->ineq[i] = c[i].c;
7320 isl_basic_map_free(bmap);
7324 __isl_give isl_basic_set *isl_basic_set_sort_constraints(
7325 __isl_take isl_basic_set *bset)
7327 return (struct isl_basic_set *)isl_basic_map_sort_constraints(
7328 (struct isl_basic_map *)bset);
7331 struct isl_basic_map *isl_basic_map_normalize(struct isl_basic_map *bmap)
7335 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_NORMALIZED))
7337 bmap = isl_basic_map_remove_redundancies(bmap);
7338 bmap = isl_basic_map_sort_constraints(bmap);
7339 ISL_F_SET(bmap, ISL_BASIC_MAP_NORMALIZED);
7343 struct isl_basic_set *isl_basic_set_normalize(struct isl_basic_set *bset)
7345 return (struct isl_basic_set *)isl_basic_map_normalize(
7346 (struct isl_basic_map *)bset);
7349 int isl_basic_map_plain_cmp(const __isl_keep isl_basic_map *bmap1,
7350 const __isl_keep isl_basic_map *bmap2)
7357 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_RATIONAL) !=
7358 ISL_F_ISSET(bmap2, ISL_BASIC_MAP_RATIONAL))
7359 return ISL_F_ISSET(bmap1, ISL_BASIC_MAP_RATIONAL) ? -1 : 1;
7360 if (isl_basic_map_n_param(bmap1) != isl_basic_map_n_param(bmap2))
7361 return isl_basic_map_n_param(bmap1) - isl_basic_map_n_param(bmap2);
7362 if (isl_basic_map_n_in(bmap1) != isl_basic_map_n_in(bmap2))
7363 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
7364 if (isl_basic_map_n_out(bmap1) != isl_basic_map_n_out(bmap2))
7365 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
7366 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY) &&
7367 ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
7369 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY))
7371 if (ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
7373 if (bmap1->n_eq != bmap2->n_eq)
7374 return bmap1->n_eq - bmap2->n_eq;
7375 if (bmap1->n_ineq != bmap2->n_ineq)
7376 return bmap1->n_ineq - bmap2->n_ineq;
7377 if (bmap1->n_div != bmap2->n_div)
7378 return bmap1->n_div - bmap2->n_div;
7379 total = isl_basic_map_total_dim(bmap1);
7380 for (i = 0; i < bmap1->n_eq; ++i) {
7381 cmp = isl_seq_cmp(bmap1->eq[i], bmap2->eq[i], 1+total);
7385 for (i = 0; i < bmap1->n_ineq; ++i) {
7386 cmp = isl_seq_cmp(bmap1->ineq[i], bmap2->ineq[i], 1+total);
7390 for (i = 0; i < bmap1->n_div; ++i) {
7391 cmp = isl_seq_cmp(bmap1->div[i], bmap2->div[i], 1+1+total);
7398 int isl_basic_map_plain_is_equal(__isl_keep isl_basic_map *bmap1,
7399 __isl_keep isl_basic_map *bmap2)
7401 return isl_basic_map_plain_cmp(bmap1, bmap2) == 0;
7404 int isl_basic_set_plain_is_equal(__isl_keep isl_basic_set *bset1,
7405 __isl_keep isl_basic_set *bset2)
7407 return isl_basic_map_plain_is_equal((isl_basic_map *)bset1,
7408 (isl_basic_map *)bset2);
7411 static int qsort_bmap_cmp(const void *p1, const void *p2)
7413 const struct isl_basic_map *bmap1 = *(const struct isl_basic_map **)p1;
7414 const struct isl_basic_map *bmap2 = *(const struct isl_basic_map **)p2;
7416 return isl_basic_map_plain_cmp(bmap1, bmap2);
7419 /* We normalize in place, but if anything goes wrong we need
7420 * to return NULL, so we need to make sure we don't change the
7421 * meaning of any possible other copies of map.
7423 struct isl_map *isl_map_normalize(struct isl_map *map)
7426 struct isl_basic_map *bmap;
7430 if (ISL_F_ISSET(map, ISL_MAP_NORMALIZED))
7432 for (i = 0; i < map->n; ++i) {
7433 bmap = isl_basic_map_normalize(isl_basic_map_copy(map->p[i]));
7436 isl_basic_map_free(map->p[i]);
7439 qsort(map->p, map->n, sizeof(struct isl_basic_map *), qsort_bmap_cmp);
7440 ISL_F_SET(map, ISL_MAP_NORMALIZED);
7441 map = isl_map_remove_empty_parts(map);
7444 for (i = map->n - 1; i >= 1; --i) {
7445 if (!isl_basic_map_plain_is_equal(map->p[i-1], map->p[i]))
7447 isl_basic_map_free(map->p[i-1]);
7448 for (j = i; j < map->n; ++j)
7449 map->p[j-1] = map->p[j];
7459 struct isl_set *isl_set_normalize(struct isl_set *set)
7461 return (struct isl_set *)isl_map_normalize((struct isl_map *)set);
7464 int isl_map_plain_is_equal(__isl_keep isl_map *map1, __isl_keep isl_map *map2)
7474 if (!isl_dim_equal(map1->dim, map2->dim))
7477 map1 = isl_map_copy(map1);
7478 map2 = isl_map_copy(map2);
7479 map1 = isl_map_normalize(map1);
7480 map2 = isl_map_normalize(map2);
7483 equal = map1->n == map2->n;
7484 for (i = 0; equal && i < map1->n; ++i) {
7485 equal = isl_basic_map_plain_is_equal(map1->p[i], map2->p[i]);
7498 int isl_map_fast_is_equal(__isl_keep isl_map *map1, __isl_keep isl_map *map2)
7500 return isl_map_plain_is_equal(map1, map2);
7503 int isl_set_plain_is_equal(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
7505 return isl_map_plain_is_equal((struct isl_map *)set1,
7506 (struct isl_map *)set2);
7509 int isl_set_fast_is_equal(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
7511 return isl_set_plain_is_equal(set1, set2);
7514 /* Return an interval that ranges from min to max (inclusive)
7516 struct isl_basic_set *isl_basic_set_interval(struct isl_ctx *ctx,
7517 isl_int min, isl_int max)
7520 struct isl_basic_set *bset = NULL;
7522 bset = isl_basic_set_alloc(ctx, 0, 1, 0, 0, 2);
7526 k = isl_basic_set_alloc_inequality(bset);
7529 isl_int_set_si(bset->ineq[k][1], 1);
7530 isl_int_neg(bset->ineq[k][0], min);
7532 k = isl_basic_set_alloc_inequality(bset);
7535 isl_int_set_si(bset->ineq[k][1], -1);
7536 isl_int_set(bset->ineq[k][0], max);
7540 isl_basic_set_free(bset);
7544 /* Return the Cartesian product of the basic sets in list (in the given order).
7546 __isl_give isl_basic_set *isl_basic_set_list_product(
7547 __isl_take struct isl_basic_set_list *list)
7555 struct isl_basic_set *product = NULL;
7559 isl_assert(list->ctx, list->n > 0, goto error);
7560 isl_assert(list->ctx, list->p[0], goto error);
7561 nparam = isl_basic_set_n_param(list->p[0]);
7562 dim = isl_basic_set_n_dim(list->p[0]);
7563 extra = list->p[0]->n_div;
7564 n_eq = list->p[0]->n_eq;
7565 n_ineq = list->p[0]->n_ineq;
7566 for (i = 1; i < list->n; ++i) {
7567 isl_assert(list->ctx, list->p[i], goto error);
7568 isl_assert(list->ctx,
7569 nparam == isl_basic_set_n_param(list->p[i]), goto error);
7570 dim += isl_basic_set_n_dim(list->p[i]);
7571 extra += list->p[i]->n_div;
7572 n_eq += list->p[i]->n_eq;
7573 n_ineq += list->p[i]->n_ineq;
7575 product = isl_basic_set_alloc(list->ctx, nparam, dim, extra,
7580 for (i = 0; i < list->n; ++i) {
7581 isl_basic_set_add_constraints(product,
7582 isl_basic_set_copy(list->p[i]), dim);
7583 dim += isl_basic_set_n_dim(list->p[i]);
7585 isl_basic_set_list_free(list);
7588 isl_basic_set_free(product);
7589 isl_basic_set_list_free(list);
7593 struct isl_basic_map *isl_basic_map_product(
7594 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
7596 struct isl_dim *dim_result = NULL;
7597 struct isl_basic_map *bmap;
7598 unsigned in1, in2, out1, out2, nparam, total, pos;
7599 struct isl_dim_map *dim_map1, *dim_map2;
7601 if (!bmap1 || !bmap2)
7604 isl_assert(bmap1->ctx, isl_dim_match(bmap1->dim, isl_dim_param,
7605 bmap2->dim, isl_dim_param), goto error);
7606 dim_result = isl_dim_product(isl_dim_copy(bmap1->dim),
7607 isl_dim_copy(bmap2->dim));
7609 in1 = isl_basic_map_n_in(bmap1);
7610 in2 = isl_basic_map_n_in(bmap2);
7611 out1 = isl_basic_map_n_out(bmap1);
7612 out2 = isl_basic_map_n_out(bmap2);
7613 nparam = isl_basic_map_n_param(bmap1);
7615 total = nparam + in1 + in2 + out1 + out2 + bmap1->n_div + bmap2->n_div;
7616 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
7617 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
7618 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
7619 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
7620 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
7621 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos += in1);
7622 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += in2);
7623 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += out1);
7624 isl_dim_map_div(dim_map1, bmap1, pos += out2);
7625 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
7627 bmap = isl_basic_map_alloc_dim(dim_result,
7628 bmap1->n_div + bmap2->n_div,
7629 bmap1->n_eq + bmap2->n_eq,
7630 bmap1->n_ineq + bmap2->n_ineq);
7631 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap1, dim_map1);
7632 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap2, dim_map2);
7633 bmap = isl_basic_map_simplify(bmap);
7634 return isl_basic_map_finalize(bmap);
7636 isl_basic_map_free(bmap1);
7637 isl_basic_map_free(bmap2);
7641 __isl_give isl_basic_map *isl_basic_map_flat_product(
7642 __isl_take isl_basic_map *bmap1, __isl_take isl_basic_map *bmap2)
7644 isl_basic_map *prod;
7646 prod = isl_basic_map_product(bmap1, bmap2);
7647 prod = isl_basic_map_flatten(prod);
7651 __isl_give isl_basic_set *isl_basic_set_flat_product(
7652 __isl_take isl_basic_set *bset1, __isl_take isl_basic_set *bset2)
7654 return isl_basic_map_flat_product(bset1, bset2);
7657 __isl_give isl_basic_map *isl_basic_map_range_product(
7658 __isl_take isl_basic_map *bmap1, __isl_take isl_basic_map *bmap2)
7660 isl_dim *dim_result = NULL;
7661 isl_basic_map *bmap;
7662 unsigned in, out1, out2, nparam, total, pos;
7663 struct isl_dim_map *dim_map1, *dim_map2;
7665 if (!bmap1 || !bmap2)
7668 dim_result = isl_dim_range_product(isl_dim_copy(bmap1->dim),
7669 isl_dim_copy(bmap2->dim));
7671 in = isl_basic_map_dim(bmap1, isl_dim_in);
7672 out1 = isl_basic_map_n_out(bmap1);
7673 out2 = isl_basic_map_n_out(bmap2);
7674 nparam = isl_basic_map_n_param(bmap1);
7676 total = nparam + in + out1 + out2 + bmap1->n_div + bmap2->n_div;
7677 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
7678 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
7679 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
7680 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
7681 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
7682 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
7683 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += in);
7684 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += out1);
7685 isl_dim_map_div(dim_map1, bmap1, pos += out2);
7686 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
7688 bmap = isl_basic_map_alloc_dim(dim_result,
7689 bmap1->n_div + bmap2->n_div,
7690 bmap1->n_eq + bmap2->n_eq,
7691 bmap1->n_ineq + bmap2->n_ineq);
7692 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap1, dim_map1);
7693 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap2, dim_map2);
7694 bmap = isl_basic_map_simplify(bmap);
7695 return isl_basic_map_finalize(bmap);
7697 isl_basic_map_free(bmap1);
7698 isl_basic_map_free(bmap2);
7702 __isl_give isl_basic_map *isl_basic_map_flat_range_product(
7703 __isl_take isl_basic_map *bmap1, __isl_take isl_basic_map *bmap2)
7705 isl_basic_map *prod;
7707 prod = isl_basic_map_range_product(bmap1, bmap2);
7708 prod = isl_basic_map_flatten_range(prod);
7712 static __isl_give isl_map *map_product(__isl_take isl_map *map1,
7713 __isl_take isl_map *map2,
7714 __isl_give isl_dim *(*dim_product)(__isl_take isl_dim *left,
7715 __isl_take isl_dim *right),
7716 __isl_give isl_basic_map *(*basic_map_product)(
7717 __isl_take isl_basic_map *left, __isl_take isl_basic_map *right))
7720 struct isl_map *result;
7726 isl_assert(map1->ctx, isl_dim_match(map1->dim, isl_dim_param,
7727 map2->dim, isl_dim_param), goto error);
7729 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
7730 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
7731 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
7733 result = isl_map_alloc_dim(dim_product(isl_dim_copy(map1->dim),
7734 isl_dim_copy(map2->dim)),
7735 map1->n * map2->n, flags);
7738 for (i = 0; i < map1->n; ++i)
7739 for (j = 0; j < map2->n; ++j) {
7740 struct isl_basic_map *part;
7741 part = basic_map_product(isl_basic_map_copy(map1->p[i]),
7742 isl_basic_map_copy(map2->p[j]));
7743 if (isl_basic_map_is_empty(part))
7744 isl_basic_map_free(part);
7746 result = isl_map_add_basic_map(result, part);
7759 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> [B -> D]
7761 static __isl_give isl_map *map_product_aligned(__isl_take isl_map *map1,
7762 __isl_take isl_map *map2)
7764 return map_product(map1, map2, &isl_dim_product, &isl_basic_map_product);
7767 __isl_give isl_map *isl_map_product(__isl_take isl_map *map1,
7768 __isl_take isl_map *map2)
7770 return isl_map_align_params_map_map_and(map1, map2, &map_product_aligned);
7773 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
7775 __isl_give isl_map *isl_map_flat_product(__isl_take isl_map *map1,
7776 __isl_take isl_map *map2)
7780 prod = isl_map_product(map1, map2);
7781 prod = isl_map_flatten(prod);
7785 /* Given two set A and B, construct its Cartesian product A x B.
7787 struct isl_set *isl_set_product(struct isl_set *set1, struct isl_set *set2)
7789 return isl_map_range_product(set1, set2);
7792 __isl_give isl_set *isl_set_flat_product(__isl_take isl_set *set1,
7793 __isl_take isl_set *set2)
7795 return (isl_set *)isl_map_flat_product((isl_map *)set1, (isl_map *)set2);
7798 /* Given two maps A -> B and C -> D, construct a map (A * C) -> [B -> D]
7800 static __isl_give isl_map *map_range_product_aligned(__isl_take isl_map *map1,
7801 __isl_take isl_map *map2)
7803 return map_product(map1, map2, &isl_dim_range_product,
7804 &isl_basic_map_range_product);
7807 __isl_give isl_map *isl_map_range_product(__isl_take isl_map *map1,
7808 __isl_take isl_map *map2)
7810 return isl_map_align_params_map_map_and(map1, map2,
7811 &map_range_product_aligned);
7814 /* Given two maps A -> B and C -> D, construct a map (A * C) -> (B, D)
7816 __isl_give isl_map *isl_map_flat_range_product(__isl_take isl_map *map1,
7817 __isl_take isl_map *map2)
7821 prod = isl_map_range_product(map1, map2);
7822 prod = isl_map_flatten_range(prod);
7826 uint32_t isl_basic_map_get_hash(__isl_keep isl_basic_map *bmap)
7829 uint32_t hash = isl_hash_init();
7834 bmap = isl_basic_map_copy(bmap);
7835 bmap = isl_basic_map_normalize(bmap);
7838 total = isl_basic_map_total_dim(bmap);
7839 isl_hash_byte(hash, bmap->n_eq & 0xFF);
7840 for (i = 0; i < bmap->n_eq; ++i) {
7842 c_hash = isl_seq_get_hash(bmap->eq[i], 1 + total);
7843 isl_hash_hash(hash, c_hash);
7845 isl_hash_byte(hash, bmap->n_ineq & 0xFF);
7846 for (i = 0; i < bmap->n_ineq; ++i) {
7848 c_hash = isl_seq_get_hash(bmap->ineq[i], 1 + total);
7849 isl_hash_hash(hash, c_hash);
7851 isl_hash_byte(hash, bmap->n_div & 0xFF);
7852 for (i = 0; i < bmap->n_div; ++i) {
7854 if (isl_int_is_zero(bmap->div[i][0]))
7856 isl_hash_byte(hash, i & 0xFF);
7857 c_hash = isl_seq_get_hash(bmap->div[i], 1 + 1 + total);
7858 isl_hash_hash(hash, c_hash);
7860 isl_basic_map_free(bmap);
7864 uint32_t isl_basic_set_get_hash(__isl_keep isl_basic_set *bset)
7866 return isl_basic_map_get_hash((isl_basic_map *)bset);
7869 uint32_t isl_map_get_hash(__isl_keep isl_map *map)
7876 map = isl_map_copy(map);
7877 map = isl_map_normalize(map);
7881 hash = isl_hash_init();
7882 for (i = 0; i < map->n; ++i) {
7884 bmap_hash = isl_basic_map_get_hash(map->p[i]);
7885 isl_hash_hash(hash, bmap_hash);
7893 uint32_t isl_set_get_hash(__isl_keep isl_set *set)
7895 return isl_map_get_hash((isl_map *)set);
7898 /* Check if the value for dimension dim is completely determined
7899 * by the values of the other parameters and variables.
7900 * That is, check if dimension dim is involved in an equality.
7902 int isl_basic_set_dim_is_unique(struct isl_basic_set *bset, unsigned dim)
7909 nparam = isl_basic_set_n_param(bset);
7910 for (i = 0; i < bset->n_eq; ++i)
7911 if (!isl_int_is_zero(bset->eq[i][1 + nparam + dim]))
7916 /* Check if the value for dimension dim is completely determined
7917 * by the values of the other parameters and variables.
7918 * That is, check if dimension dim is involved in an equality
7919 * for each of the subsets.
7921 int isl_set_dim_is_unique(struct isl_set *set, unsigned dim)
7927 for (i = 0; i < set->n; ++i) {
7929 unique = isl_basic_set_dim_is_unique(set->p[i], dim);
7936 int isl_set_n_basic_set(__isl_keep isl_set *set)
7938 return set ? set->n : 0;
7941 int isl_map_foreach_basic_map(__isl_keep isl_map *map,
7942 int (*fn)(__isl_take isl_basic_map *bmap, void *user), void *user)
7949 for (i = 0; i < map->n; ++i)
7950 if (fn(isl_basic_map_copy(map->p[i]), user) < 0)
7956 int isl_set_foreach_basic_set(__isl_keep isl_set *set,
7957 int (*fn)(__isl_take isl_basic_set *bset, void *user), void *user)
7964 for (i = 0; i < set->n; ++i)
7965 if (fn(isl_basic_set_copy(set->p[i]), user) < 0)
7971 __isl_give isl_basic_set *isl_basic_set_lift(__isl_take isl_basic_set *bset)
7973 struct isl_dim *dim;
7978 bset = isl_basic_set_cow(bset);
7982 dim = isl_basic_set_get_dim(bset);
7983 dim = isl_dim_lift(dim, bset->n_div);
7986 isl_dim_free(bset->dim);
7988 bset->extra -= bset->n_div;
7991 bset = isl_basic_set_finalize(bset);
7995 isl_basic_set_free(bset);
7999 __isl_give isl_set *isl_set_lift(__isl_take isl_set *set)
8002 struct isl_dim *dim;
8005 set = isl_set_align_divs(set);
8010 set = isl_set_cow(set);
8014 n_div = set->p[0]->n_div;
8015 dim = isl_set_get_dim(set);
8016 dim = isl_dim_lift(dim, n_div);
8019 isl_dim_free(set->dim);
8022 for (i = 0; i < set->n; ++i) {
8023 set->p[i] = isl_basic_set_lift(set->p[i]);
8034 __isl_give isl_map *isl_set_lifting(__isl_take isl_set *set)
8036 struct isl_dim *dim;
8037 struct isl_basic_map *bmap;
8044 set = isl_set_align_divs(set);
8049 dim = isl_set_get_dim(set);
8050 if (set->n == 0 || set->p[0]->n_div == 0) {
8052 return isl_map_identity(isl_dim_map_from_set(dim));
8055 n_div = set->p[0]->n_div;
8056 dim = isl_dim_map_from_set(dim);
8057 n_param = isl_dim_size(dim, isl_dim_param);
8058 n_set = isl_dim_size(dim, isl_dim_in);
8059 dim = isl_dim_extend(dim, n_param, n_set, n_set + n_div);
8060 bmap = isl_basic_map_alloc_dim(dim, 0, n_set, 2 * n_div);
8061 for (i = 0; i < n_set; ++i)
8062 bmap = var_equal(bmap, i);
8064 total = n_param + n_set + n_set + n_div;
8065 for (i = 0; i < n_div; ++i) {
8066 k = isl_basic_map_alloc_inequality(bmap);
8069 isl_seq_cpy(bmap->ineq[k], set->p[0]->div[i]+1, 1+n_param);
8070 isl_seq_clr(bmap->ineq[k]+1+n_param, n_set);
8071 isl_seq_cpy(bmap->ineq[k]+1+n_param+n_set,
8072 set->p[0]->div[i]+1+1+n_param, n_set + n_div);
8073 isl_int_neg(bmap->ineq[k][1+n_param+n_set+n_set+i],
8074 set->p[0]->div[i][0]);
8076 l = isl_basic_map_alloc_inequality(bmap);
8079 isl_seq_neg(bmap->ineq[l], bmap->ineq[k], 1 + total);
8080 isl_int_add(bmap->ineq[l][0], bmap->ineq[l][0],
8081 set->p[0]->div[i][0]);
8082 isl_int_sub_ui(bmap->ineq[l][0], bmap->ineq[l][0], 1);
8086 bmap = isl_basic_map_simplify(bmap);
8087 bmap = isl_basic_map_finalize(bmap);
8088 return isl_map_from_basic_map(bmap);
8091 isl_basic_map_free(bmap);
8095 int isl_basic_set_size(__isl_keep isl_basic_set *bset)
8103 dim = isl_basic_set_total_dim(bset);
8104 size += bset->n_eq * (1 + dim);
8105 size += bset->n_ineq * (1 + dim);
8106 size += bset->n_div * (2 + dim);
8111 int isl_set_size(__isl_keep isl_set *set)
8119 for (i = 0; i < set->n; ++i)
8120 size += isl_basic_set_size(set->p[i]);
8125 /* Check if there is any lower bound (if lower == 0) and/or upper
8126 * bound (if upper == 0) on the specified dim.
8128 static int basic_map_dim_is_bounded(__isl_keep isl_basic_map *bmap,
8129 enum isl_dim_type type, unsigned pos, int lower, int upper)
8136 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), return -1);
8138 pos += isl_basic_map_offset(bmap, type);
8140 for (i = 0; i < bmap->n_div; ++i) {
8141 if (isl_int_is_zero(bmap->div[i][0]))
8143 if (!isl_int_is_zero(bmap->div[i][1 + pos]))
8147 for (i = 0; i < bmap->n_eq; ++i)
8148 if (!isl_int_is_zero(bmap->eq[i][pos]))
8151 for (i = 0; i < bmap->n_ineq; ++i) {
8152 int sgn = isl_int_sgn(bmap->ineq[i][pos]);
8159 return lower && upper;
8162 int isl_basic_map_dim_is_bounded(__isl_keep isl_basic_map *bmap,
8163 enum isl_dim_type type, unsigned pos)
8165 return basic_map_dim_is_bounded(bmap, type, pos, 0, 0);
8168 int isl_basic_map_dim_has_lower_bound(__isl_keep isl_basic_map *bmap,
8169 enum isl_dim_type type, unsigned pos)
8171 return basic_map_dim_is_bounded(bmap, type, pos, 0, 1);
8174 int isl_basic_map_dim_has_upper_bound(__isl_keep isl_basic_map *bmap,
8175 enum isl_dim_type type, unsigned pos)
8177 return basic_map_dim_is_bounded(bmap, type, pos, 1, 0);
8180 int isl_map_dim_is_bounded(__isl_keep isl_map *map,
8181 enum isl_dim_type type, unsigned pos)
8188 for (i = 0; i < map->n; ++i) {
8190 bounded = isl_basic_map_dim_is_bounded(map->p[i], type, pos);
8191 if (bounded < 0 || !bounded)
8198 /* Return 1 if the specified dim is involved in both an upper bound
8199 * and a lower bound.
8201 int isl_set_dim_is_bounded(__isl_keep isl_set *set,
8202 enum isl_dim_type type, unsigned pos)
8204 return isl_map_dim_is_bounded((isl_map *)set, type, pos);
8207 static int has_bound(__isl_keep isl_map *map,
8208 enum isl_dim_type type, unsigned pos,
8209 int (*fn)(__isl_keep isl_basic_map *bmap,
8210 enum isl_dim_type type, unsigned pos))
8217 for (i = 0; i < map->n; ++i) {
8219 bounded = fn(map->p[i], type, pos);
8220 if (bounded < 0 || bounded)
8227 /* Return 1 if the specified dim is involved in any lower bound.
8229 int isl_set_dim_has_lower_bound(__isl_keep isl_set *set,
8230 enum isl_dim_type type, unsigned pos)
8232 return has_bound(set, type, pos, &isl_basic_map_dim_has_lower_bound);
8235 /* Return 1 if the specified dim is involved in any upper bound.
8237 int isl_set_dim_has_upper_bound(__isl_keep isl_set *set,
8238 enum isl_dim_type type, unsigned pos)
8240 return has_bound(set, type, pos, &isl_basic_map_dim_has_upper_bound);
8243 /* For each of the "n" variables starting at "first", determine
8244 * the sign of the variable and put the results in the first "n"
8245 * elements of the array "signs".
8247 * 1 means that the variable is non-negative
8248 * -1 means that the variable is non-positive
8249 * 0 means the variable attains both positive and negative values.
8251 int isl_basic_set_vars_get_sign(__isl_keep isl_basic_set *bset,
8252 unsigned first, unsigned n, int *signs)
8254 isl_vec *bound = NULL;
8255 struct isl_tab *tab = NULL;
8256 struct isl_tab_undo *snap;
8259 if (!bset || !signs)
8262 bound = isl_vec_alloc(bset->ctx, 1 + isl_basic_set_total_dim(bset));
8263 tab = isl_tab_from_basic_set(bset);
8267 isl_seq_clr(bound->el, bound->size);
8268 isl_int_set_si(bound->el[0], -1);
8270 snap = isl_tab_snap(tab);
8271 for (i = 0; i < n; ++i) {
8274 isl_int_set_si(bound->el[1 + first + i], -1);
8275 if (isl_tab_add_ineq(tab, bound->el) < 0)
8278 isl_int_set_si(bound->el[1 + first + i], 0);
8279 if (isl_tab_rollback(tab, snap) < 0)
8287 isl_int_set_si(bound->el[1 + first + i], 1);
8288 if (isl_tab_add_ineq(tab, bound->el) < 0)
8291 isl_int_set_si(bound->el[1 + first + i], 0);
8292 if (isl_tab_rollback(tab, snap) < 0)
8295 signs[i] = empty ? -1 : 0;
8299 isl_vec_free(bound);
8303 isl_vec_free(bound);
8307 int isl_basic_set_dims_get_sign(__isl_keep isl_basic_set *bset,
8308 enum isl_dim_type type, unsigned first, unsigned n, int *signs)
8310 if (!bset || !signs)
8312 isl_assert(bset->ctx, first + n <= isl_basic_set_dim(bset, type),
8315 first += pos(bset->dim, type) - 1;
8316 return isl_basic_set_vars_get_sign(bset, first, n, signs);
8319 /* Check if the given basic map is obviously single-valued.
8320 * In particular, for each output dimension, check that there is
8321 * an equality that defines the output dimension in terms of
8322 * earlier dimensions.
8324 int isl_basic_map_plain_is_single_valued(__isl_keep isl_basic_map *bmap)
8334 total = 1 + isl_basic_map_total_dim(bmap);
8335 n_out = isl_basic_map_dim(bmap, isl_dim_out);
8336 o_out = isl_basic_map_offset(bmap, isl_dim_out);
8338 for (i = 0; i < n_out; ++i) {
8339 for (j = 0; j < bmap->n_eq; ++j) {
8340 if (isl_int_is_zero(bmap->eq[j][o_out + i]))
8342 if (isl_seq_first_non_zero(bmap->eq[j] + o_out + i + 1,
8343 total - (o_out + i + 1)) == -1)
8346 if (j >= bmap->n_eq)
8353 /* Check if the given map is obviously single-valued.
8355 int isl_map_plain_is_single_valued(__isl_keep isl_map *map)
8364 return isl_basic_map_plain_is_single_valued(map->p[0]);
8367 /* Check if the given map is single-valued.
8372 * and check if the result is a subset of the identity mapping.
8374 int isl_map_is_single_valued(__isl_keep isl_map *map)
8381 sv = isl_map_plain_is_single_valued(map);
8385 test = isl_map_reverse(isl_map_copy(map));
8386 test = isl_map_apply_range(test, isl_map_copy(map));
8388 dim = isl_dim_map_from_set(isl_dim_range(isl_map_get_dim(map)));
8389 id = isl_map_identity(dim);
8391 sv = isl_map_is_subset(test, id);
8399 int isl_map_is_injective(__isl_keep isl_map *map)
8403 map = isl_map_copy(map);
8404 map = isl_map_reverse(map);
8405 in = isl_map_is_single_valued(map);
8411 /* Check if the given map is obviously injective.
8413 int isl_map_plain_is_injective(__isl_keep isl_map *map)
8417 map = isl_map_copy(map);
8418 map = isl_map_reverse(map);
8419 in = isl_map_plain_is_single_valued(map);
8425 int isl_map_is_bijective(__isl_keep isl_map *map)
8429 sv = isl_map_is_single_valued(map);
8433 return isl_map_is_injective(map);
8436 int isl_set_is_singleton(__isl_keep isl_set *set)
8438 return isl_map_is_single_valued((isl_map *)set);
8441 int isl_map_is_translation(__isl_keep isl_map *map)
8446 delta = isl_map_deltas(isl_map_copy(map));
8447 ok = isl_set_is_singleton(delta);
8448 isl_set_free(delta);
8453 static int unique(isl_int *p, unsigned pos, unsigned len)
8455 if (isl_seq_first_non_zero(p, pos) != -1)
8457 if (isl_seq_first_non_zero(p + pos + 1, len - pos - 1) != -1)
8462 int isl_basic_set_is_box(__isl_keep isl_basic_set *bset)
8471 if (isl_basic_set_dim(bset, isl_dim_div) != 0)
8474 nvar = isl_basic_set_dim(bset, isl_dim_set);
8475 ovar = isl_dim_offset(bset->dim, isl_dim_set);
8476 for (j = 0; j < nvar; ++j) {
8477 int lower = 0, upper = 0;
8478 for (i = 0; i < bset->n_eq; ++i) {
8479 if (isl_int_is_zero(bset->eq[i][1 + ovar + j]))
8481 if (!unique(bset->eq[i] + 1 + ovar, j, nvar))
8487 for (i = 0; i < bset->n_ineq; ++i) {
8488 if (isl_int_is_zero(bset->ineq[i][1 + ovar + j]))
8490 if (!unique(bset->ineq[i] + 1 + ovar, j, nvar))
8492 if (isl_int_is_pos(bset->ineq[i][1 + ovar + j]))
8497 if (!lower || !upper)
8504 int isl_set_is_box(__isl_keep isl_set *set)
8511 return isl_basic_set_is_box(set->p[0]);
8514 int isl_basic_set_is_wrapping(__isl_keep isl_basic_set *bset)
8519 return isl_dim_is_wrapping(bset->dim);
8522 int isl_set_is_wrapping(__isl_keep isl_set *set)
8527 return isl_dim_is_wrapping(set->dim);
8530 __isl_give isl_basic_set *isl_basic_map_wrap(__isl_take isl_basic_map *bmap)
8532 bmap = isl_basic_map_cow(bmap);
8536 bmap->dim = isl_dim_wrap(bmap->dim);
8540 bmap = isl_basic_map_finalize(bmap);
8542 return (isl_basic_set *)bmap;
8544 isl_basic_map_free(bmap);
8548 __isl_give isl_set *isl_map_wrap(__isl_take isl_map *map)
8552 map = isl_map_cow(map);
8556 for (i = 0; i < map->n; ++i) {
8557 map->p[i] = (isl_basic_map *)isl_basic_map_wrap(map->p[i]);
8561 map->dim = isl_dim_wrap(map->dim);
8565 return (isl_set *)map;
8571 __isl_give isl_basic_map *isl_basic_set_unwrap(__isl_take isl_basic_set *bset)
8573 bset = isl_basic_set_cow(bset);
8577 bset->dim = isl_dim_unwrap(bset->dim);
8581 bset = isl_basic_set_finalize(bset);
8583 return (isl_basic_map *)bset;
8585 isl_basic_set_free(bset);
8589 __isl_give isl_map *isl_set_unwrap(__isl_take isl_set *set)
8596 if (!isl_set_is_wrapping(set))
8597 isl_die(set->ctx, isl_error_invalid, "not a wrapping set",
8600 set = isl_set_cow(set);
8604 for (i = 0; i < set->n; ++i) {
8605 set->p[i] = (isl_basic_set *)isl_basic_set_unwrap(set->p[i]);
8610 set->dim = isl_dim_unwrap(set->dim);
8614 return (isl_map *)set;
8620 __isl_give isl_basic_map *isl_basic_map_reset(__isl_take isl_basic_map *bmap,
8621 enum isl_dim_type type)
8626 if (!isl_dim_is_named_or_nested(bmap->dim, type))
8629 bmap = isl_basic_map_cow(bmap);
8633 bmap->dim = isl_dim_reset(bmap->dim, type);
8637 bmap = isl_basic_map_finalize(bmap);
8641 isl_basic_map_free(bmap);
8645 __isl_give isl_map *isl_map_reset(__isl_take isl_map *map,
8646 enum isl_dim_type type)
8653 if (!isl_dim_is_named_or_nested(map->dim, type))
8656 map = isl_map_cow(map);
8660 for (i = 0; i < map->n; ++i) {
8661 map->p[i] = isl_basic_map_reset(map->p[i], type);
8665 map->dim = isl_dim_reset(map->dim, type);
8675 __isl_give isl_basic_map *isl_basic_map_flatten(__isl_take isl_basic_map *bmap)
8680 if (!bmap->dim->nested[0] && !bmap->dim->nested[1])
8683 bmap = isl_basic_map_cow(bmap);
8687 bmap->dim = isl_dim_flatten(bmap->dim);
8691 bmap = isl_basic_map_finalize(bmap);
8695 isl_basic_map_free(bmap);
8699 __isl_give isl_basic_set *isl_basic_set_flatten(__isl_take isl_basic_set *bset)
8701 return (isl_basic_set *)isl_basic_map_flatten((isl_basic_map *)bset);
8704 __isl_give isl_basic_map *isl_basic_map_flatten_range(
8705 __isl_take isl_basic_map *bmap)
8710 if (!bmap->dim->nested[1])
8713 bmap = isl_basic_map_cow(bmap);
8717 bmap->dim = isl_dim_flatten_range(bmap->dim);
8721 bmap = isl_basic_map_finalize(bmap);
8725 isl_basic_map_free(bmap);
8729 __isl_give isl_map *isl_map_flatten(__isl_take isl_map *map)
8736 if (!map->dim->nested[0] && !map->dim->nested[1])
8739 map = isl_map_cow(map);
8743 for (i = 0; i < map->n; ++i) {
8744 map->p[i] = isl_basic_map_flatten(map->p[i]);
8748 map->dim = isl_dim_flatten(map->dim);
8758 __isl_give isl_set *isl_set_flatten(__isl_take isl_set *set)
8760 return (isl_set *)isl_map_flatten((isl_map *)set);
8763 __isl_give isl_map *isl_set_flatten_map(__isl_take isl_set *set)
8765 isl_dim *dim, *flat_dim;
8768 dim = isl_set_get_dim(set);
8769 flat_dim = isl_dim_flatten(isl_dim_copy(dim));
8770 map = isl_map_identity(isl_dim_join(isl_dim_reverse(dim), flat_dim));
8771 map = isl_map_intersect_domain(map, set);
8776 __isl_give isl_map *isl_map_flatten_range(__isl_take isl_map *map)
8783 if (!map->dim->nested[1])
8786 map = isl_map_cow(map);
8790 for (i = 0; i < map->n; ++i) {
8791 map->p[i] = isl_basic_map_flatten_range(map->p[i]);
8795 map->dim = isl_dim_flatten_range(map->dim);
8805 /* Reorder the dimensions of "bmap" according to the given dim_map
8806 * and set the dimension specification to "dim".
8808 __isl_give isl_basic_map *isl_basic_map_realign(__isl_take isl_basic_map *bmap,
8809 __isl_take isl_dim *dim, __isl_take struct isl_dim_map *dim_map)
8813 bmap = isl_basic_map_cow(bmap);
8814 if (!bmap || !dim || !dim_map)
8817 res = isl_basic_map_alloc_dim(dim,
8818 bmap->n_div, bmap->n_eq, bmap->n_ineq);
8819 res = isl_basic_map_add_constraints_dim_map(res, bmap, dim_map);
8820 res = isl_basic_map_finalize(res);
8824 isl_basic_map_free(bmap);
8829 /* Reorder the dimensions of "map" according to given reordering.
8831 __isl_give isl_map *isl_map_realign(__isl_take isl_map *map,
8832 __isl_take isl_reordering *r)
8835 struct isl_dim_map *dim_map;
8837 map = isl_map_cow(map);
8838 dim_map = isl_dim_map_from_reordering(r);
8839 if (!map || !r || !dim_map)
8842 for (i = 0; i < map->n; ++i) {
8843 struct isl_dim_map *dim_map_i;
8845 dim_map_i = isl_dim_map_extend(dim_map, map->p[i]);
8847 map->p[i] = isl_basic_map_realign(map->p[i],
8848 isl_dim_copy(r->dim), dim_map_i);
8854 map = isl_map_reset_dim(map, isl_dim_copy(r->dim));
8856 isl_reordering_free(r);
8862 isl_reordering_free(r);
8866 __isl_give isl_set *isl_set_realign(__isl_take isl_set *set,
8867 __isl_take isl_reordering *r)
8869 return (isl_set *)isl_map_realign((isl_map *)set, r);
8872 __isl_give isl_map *isl_map_align_params(__isl_take isl_map *map,
8873 __isl_take isl_dim *model)
8880 ctx = isl_dim_get_ctx(model);
8881 if (!isl_dim_has_named_params(model))
8882 isl_die(ctx, isl_error_invalid,
8883 "model has unnamed parameters", goto error);
8884 if (!isl_dim_has_named_params(map->dim))
8885 isl_die(ctx, isl_error_invalid,
8886 "relation has unnamed parameters", goto error);
8887 if (!isl_dim_match(map->dim, isl_dim_param, model, isl_dim_param)) {
8888 isl_reordering *exp;
8890 model = isl_dim_drop(model, isl_dim_in,
8891 0, isl_dim_size(model, isl_dim_in));
8892 model = isl_dim_drop(model, isl_dim_out,
8893 0, isl_dim_size(model, isl_dim_out));
8894 exp = isl_parameter_alignment_reordering(map->dim, model);
8895 exp = isl_reordering_extend_dim(exp, isl_map_get_dim(map));
8896 map = isl_map_realign(map, exp);
8899 isl_dim_free(model);
8902 isl_dim_free(model);
8907 __isl_give isl_set *isl_set_align_params(__isl_take isl_set *set,
8908 __isl_take isl_dim *model)
8910 return isl_map_align_params(set, model);
8913 __isl_give isl_mat *isl_basic_map_equalities_matrix(
8914 __isl_keep isl_basic_map *bmap, enum isl_dim_type c1,
8915 enum isl_dim_type c2, enum isl_dim_type c3,
8916 enum isl_dim_type c4, enum isl_dim_type c5)
8918 enum isl_dim_type c[5] = { c1, c2, c3, c4, c5 };
8919 struct isl_mat *mat;
8925 mat = isl_mat_alloc(bmap->ctx, bmap->n_eq,
8926 isl_basic_map_total_dim(bmap) + 1);
8929 for (i = 0; i < bmap->n_eq; ++i)
8930 for (j = 0, pos = 0; j < 5; ++j) {
8931 int off = isl_basic_map_offset(bmap, c[j]);
8932 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
8933 isl_int_set(mat->row[i][pos],
8934 bmap->eq[i][off + k]);
8942 __isl_give isl_mat *isl_basic_map_inequalities_matrix(
8943 __isl_keep isl_basic_map *bmap, enum isl_dim_type c1,
8944 enum isl_dim_type c2, enum isl_dim_type c3,
8945 enum isl_dim_type c4, enum isl_dim_type c5)
8947 enum isl_dim_type c[5] = { c1, c2, c3, c4, c5 };
8948 struct isl_mat *mat;
8954 mat = isl_mat_alloc(bmap->ctx, bmap->n_ineq,
8955 isl_basic_map_total_dim(bmap) + 1);
8958 for (i = 0; i < bmap->n_ineq; ++i)
8959 for (j = 0, pos = 0; j < 5; ++j) {
8960 int off = isl_basic_map_offset(bmap, c[j]);
8961 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
8962 isl_int_set(mat->row[i][pos],
8963 bmap->ineq[i][off + k]);
8971 __isl_give isl_basic_map *isl_basic_map_from_constraint_matrices(
8972 __isl_take isl_dim *dim,
8973 __isl_take isl_mat *eq, __isl_take isl_mat *ineq, enum isl_dim_type c1,
8974 enum isl_dim_type c2, enum isl_dim_type c3,
8975 enum isl_dim_type c4, enum isl_dim_type c5)
8977 enum isl_dim_type c[5] = { c1, c2, c3, c4, c5 };
8978 isl_basic_map *bmap;
8984 if (!dim || !eq || !ineq)
8987 if (eq->n_col != ineq->n_col)
8988 isl_die(dim->ctx, isl_error_invalid,
8989 "equalities and inequalities matrices should have "
8990 "same number of columns", goto error);
8992 total = 1 + isl_dim_total(dim);
8994 if (eq->n_col < total)
8995 isl_die(dim->ctx, isl_error_invalid,
8996 "number of columns too small", goto error);
8998 extra = eq->n_col - total;
9000 bmap = isl_basic_map_alloc_dim(isl_dim_copy(dim), extra,
9001 eq->n_row, ineq->n_row);
9004 for (i = 0; i < extra; ++i) {
9005 k = isl_basic_map_alloc_div(bmap);
9008 isl_int_set_si(bmap->div[k][0], 0);
9010 for (i = 0; i < eq->n_row; ++i) {
9011 l = isl_basic_map_alloc_equality(bmap);
9014 for (j = 0, pos = 0; j < 5; ++j) {
9015 int off = isl_basic_map_offset(bmap, c[j]);
9016 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
9017 isl_int_set(bmap->eq[l][off + k],
9023 for (i = 0; i < ineq->n_row; ++i) {
9024 l = isl_basic_map_alloc_inequality(bmap);
9027 for (j = 0, pos = 0; j < 5; ++j) {
9028 int off = isl_basic_map_offset(bmap, c[j]);
9029 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
9030 isl_int_set(bmap->ineq[l][off + k],
9049 __isl_give isl_mat *isl_basic_set_equalities_matrix(
9050 __isl_keep isl_basic_set *bset, enum isl_dim_type c1,
9051 enum isl_dim_type c2, enum isl_dim_type c3, enum isl_dim_type c4)
9053 return isl_basic_map_equalities_matrix((isl_basic_map *)bset,
9054 c1, c2, c3, c4, isl_dim_in);
9057 __isl_give isl_mat *isl_basic_set_inequalities_matrix(
9058 __isl_keep isl_basic_set *bset, enum isl_dim_type c1,
9059 enum isl_dim_type c2, enum isl_dim_type c3, enum isl_dim_type c4)
9061 return isl_basic_map_inequalities_matrix((isl_basic_map *)bset,
9062 c1, c2, c3, c4, isl_dim_in);
9065 __isl_give isl_basic_set *isl_basic_set_from_constraint_matrices(
9066 __isl_take isl_dim *dim,
9067 __isl_take isl_mat *eq, __isl_take isl_mat *ineq, enum isl_dim_type c1,
9068 enum isl_dim_type c2, enum isl_dim_type c3, enum isl_dim_type c4)
9070 return (isl_basic_set*)
9071 isl_basic_map_from_constraint_matrices(dim, eq, ineq,
9072 c1, c2, c3, c4, isl_dim_in);
9075 int isl_basic_map_can_zip(__isl_keep isl_basic_map *bmap)
9080 return isl_dim_can_zip(bmap->dim);
9083 int isl_map_can_zip(__isl_keep isl_map *map)
9088 return isl_dim_can_zip(map->dim);
9091 /* Given a basic map (A -> B) -> (C -> D), return the corresponding basic map
9092 * (A -> C) -> (B -> D).
9094 __isl_give isl_basic_map *isl_basic_map_zip(__isl_take isl_basic_map *bmap)
9103 if (!isl_basic_map_can_zip(bmap))
9104 isl_die(bmap->ctx, isl_error_invalid,
9105 "basic map cannot be zipped", goto error);
9106 pos = isl_basic_map_offset(bmap, isl_dim_in) +
9107 isl_dim_size(bmap->dim->nested[0], isl_dim_in);
9108 n1 = isl_dim_size(bmap->dim->nested[0], isl_dim_out);
9109 n2 = isl_dim_size(bmap->dim->nested[1], isl_dim_in);
9110 bmap = isl_basic_map_swap_vars(bmap, pos, n1, n2);
9113 bmap->dim = isl_dim_zip(bmap->dim);
9118 isl_basic_map_free(bmap);
9122 /* Given a map (A -> B) -> (C -> D), return the corresponding map
9123 * (A -> C) -> (B -> D).
9125 __isl_give isl_map *isl_map_zip(__isl_take isl_map *map)
9132 if (!isl_map_can_zip(map))
9133 isl_die(map->ctx, isl_error_invalid, "map cannot be zipped",
9136 map = isl_map_cow(map);
9140 for (i = 0; i < map->n; ++i) {
9141 map->p[i] = isl_basic_map_zip(map->p[i]);
9146 map->dim = isl_dim_zip(map->dim);
9156 /* Construct a basic map mapping the domain of the affine expression
9157 * to a one-dimensional range prescribed by the affine expression.
9159 __isl_give isl_basic_map *isl_basic_map_from_aff(__isl_take isl_aff *aff)
9163 isl_local_space *ls;
9164 isl_basic_map *bmap;
9169 ls = isl_aff_get_local_space(aff);
9170 ls = isl_local_space_from_domain(ls);
9171 ls = isl_local_space_add_dims(ls, isl_dim_out, 1);
9172 bmap = isl_basic_map_from_local_space(ls);
9173 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
9174 k = isl_basic_map_alloc_equality(bmap);
9178 pos = isl_basic_map_offset(bmap, isl_dim_out);
9179 isl_seq_cpy(bmap->eq[k], aff->v->el + 1, pos);
9180 isl_int_neg(bmap->eq[k][pos], aff->v->el[0]);
9181 isl_seq_cpy(bmap->eq[k] + pos + 1, aff->v->el + 1 + pos,
9182 aff->v->size - (pos + 1));
9185 bmap = isl_basic_map_finalize(bmap);
9189 isl_basic_map_free(bmap);
9193 /* Construct a basic map mapping a domain in the given space to
9194 * to an n-dimensional range, with n the number of elements in the list,
9195 * where each coordinate in the range is prescribed by the
9196 * corresponding affine expression.
9197 * The domains of all affine expressions in the list are assumed to match
9200 __isl_give isl_basic_map *isl_basic_map_from_aff_list(
9201 __isl_take isl_dim *domain_dim, __isl_take isl_aff_list *list)
9205 isl_basic_map *bmap;
9210 dim = isl_dim_from_domain(domain_dim);
9211 bmap = isl_basic_map_universe(dim);
9213 for (i = 0; i < list->n; ++i) {
9215 isl_basic_map *bmap_i;
9217 aff = isl_aff_copy(list->p[i]);
9218 bmap_i = isl_basic_map_from_aff(aff);
9220 bmap = isl_basic_map_flat_range_product(bmap, bmap_i);
9223 isl_aff_list_free(list);
9227 __isl_give isl_set *isl_set_equate(__isl_take isl_set *set,
9228 enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2)
9230 return isl_map_equate(set, type1, pos1, type2, pos2);
9233 /* Add a constraint imposing that the given two dimensions are equal.
9235 __isl_give isl_map *isl_map_equate(__isl_take isl_map *map,
9236 enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2)
9238 isl_basic_map *bmap = NULL;
9244 if (pos1 >= isl_map_dim(map, type1))
9245 isl_die(map->ctx, isl_error_invalid,
9246 "index out of bounds", goto error);
9247 if (pos2 >= isl_map_dim(map, type2))
9248 isl_die(map->ctx, isl_error_invalid,
9249 "index out of bounds", goto error);
9251 bmap = isl_basic_map_alloc_dim(isl_map_get_dim(map), 0, 1, 0);
9252 i = isl_basic_map_alloc_equality(bmap);
9255 isl_seq_clr(bmap->eq[i], 1 + isl_basic_map_total_dim(bmap));
9256 pos1 += isl_basic_map_offset(bmap, type1);
9257 pos2 += isl_basic_map_offset(bmap, type2);
9258 isl_int_set_si(bmap->eq[i][pos1], -1);
9259 isl_int_set_si(bmap->eq[i][pos2], 1);
9260 bmap = isl_basic_map_finalize(bmap);
9262 map = isl_map_intersect(map, isl_map_from_basic_map(bmap));
9266 isl_basic_map_free(bmap);
9271 /* Add a constraint imposing that the given two dimensions have opposite values.
9273 __isl_give isl_map *isl_map_oppose(__isl_take isl_map *map,
9274 enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2)
9276 isl_basic_map *bmap = NULL;
9282 if (pos1 >= isl_map_dim(map, type1))
9283 isl_die(map->ctx, isl_error_invalid,
9284 "index out of bounds", goto error);
9285 if (pos2 >= isl_map_dim(map, type2))
9286 isl_die(map->ctx, isl_error_invalid,
9287 "index out of bounds", goto error);
9289 bmap = isl_basic_map_alloc_dim(isl_map_get_dim(map), 0, 1, 0);
9290 i = isl_basic_map_alloc_equality(bmap);
9293 isl_seq_clr(bmap->eq[i], 1 + isl_basic_map_total_dim(bmap));
9294 pos1 += isl_basic_map_offset(bmap, type1);
9295 pos2 += isl_basic_map_offset(bmap, type2);
9296 isl_int_set_si(bmap->eq[i][pos1], 1);
9297 isl_int_set_si(bmap->eq[i][pos2], 1);
9298 bmap = isl_basic_map_finalize(bmap);
9300 map = isl_map_intersect(map, isl_map_from_basic_map(bmap));
9304 isl_basic_map_free(bmap);