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_id *isl_map_get_tuple_id(__isl_keep isl_map *map,
432 enum isl_dim_type type)
434 return map ? isl_dim_get_tuple_id(map->dim, type) : NULL;
437 __isl_give isl_id *isl_set_get_tuple_id(__isl_keep isl_set *set)
439 return isl_map_get_tuple_id(set, isl_dim_set);
442 const char *isl_basic_set_get_tuple_name(__isl_keep isl_basic_set *bset)
444 return bset ? isl_dim_get_tuple_name(bset->dim, isl_dim_set) : NULL;
447 const char *isl_set_get_tuple_name(__isl_keep isl_set *set)
449 return set ? isl_dim_get_tuple_name(set->dim, isl_dim_set) : NULL;
452 const char *isl_basic_map_get_dim_name(__isl_keep isl_basic_map *bmap,
453 enum isl_dim_type type, unsigned pos)
455 return bmap ? isl_dim_get_name(bmap->dim, type, pos) : NULL;
458 const char *isl_basic_set_get_dim_name(__isl_keep isl_basic_set *bset,
459 enum isl_dim_type type, unsigned pos)
461 return bset ? isl_dim_get_name(bset->dim, type, pos) : NULL;
464 const char *isl_map_get_dim_name(__isl_keep isl_map *map,
465 enum isl_dim_type type, unsigned pos)
467 return map ? isl_dim_get_name(map->dim, type, pos) : NULL;
470 const char *isl_set_get_dim_name(__isl_keep isl_set *set,
471 enum isl_dim_type type, unsigned pos)
473 return set ? isl_dim_get_name(set->dim, type, pos) : NULL;
476 __isl_give isl_basic_map *isl_basic_map_set_dim_name(
477 __isl_take isl_basic_map *bmap,
478 enum isl_dim_type type, unsigned pos, const char *s)
482 bmap->dim = isl_dim_set_name(bmap->dim, type, pos, s);
487 isl_basic_map_free(bmap);
491 __isl_give isl_map *isl_map_set_dim_name(__isl_take isl_map *map,
492 enum isl_dim_type type, unsigned pos, const char *s)
499 map->dim = isl_dim_set_name(map->dim, type, pos, s);
503 for (i = 0; i < map->n; ++i) {
504 map->p[i] = isl_basic_map_set_dim_name(map->p[i], type, pos, s);
515 __isl_give isl_basic_set *isl_basic_set_set_dim_name(
516 __isl_take isl_basic_set *bset,
517 enum isl_dim_type type, unsigned pos, const char *s)
519 return (isl_basic_set *)isl_basic_map_set_dim_name(
520 (isl_basic_map *)bset, type, pos, s);
523 __isl_give isl_set *isl_set_set_dim_name(__isl_take isl_set *set,
524 enum isl_dim_type type, unsigned pos, const char *s)
526 return (isl_set *)isl_map_set_dim_name((isl_map *)set, type, pos, s);
529 __isl_give isl_id *isl_map_get_dim_id(__isl_keep isl_map *map,
530 enum isl_dim_type type, unsigned pos)
532 return map ? isl_dim_get_dim_id(map->dim, type, pos) : NULL;
535 __isl_give isl_id *isl_set_get_dim_id(__isl_keep isl_set *set,
536 enum isl_dim_type type, unsigned pos)
538 return isl_map_get_dim_id(set, type, pos);
541 __isl_give isl_map *isl_map_set_dim_id(__isl_take isl_map *map,
542 enum isl_dim_type type, unsigned pos, __isl_take isl_id *id)
544 map = isl_map_cow(map);
546 return isl_id_free(id);
548 map->dim = isl_dim_set_dim_id(map->dim, type, pos, id);
550 return isl_map_reset_dim(map, isl_dim_copy(map->dim));
553 __isl_give isl_set *isl_set_set_dim_id(__isl_take isl_set *set,
554 enum isl_dim_type type, unsigned pos, __isl_take isl_id *id)
556 return isl_map_set_dim_id(set, type, pos, id);
559 int isl_map_find_dim_by_id(__isl_keep isl_map *map, enum isl_dim_type type,
560 __isl_keep isl_id *id)
564 return isl_dim_find_dim_by_id(map->dim, type, id);
567 int isl_set_find_dim_by_id(__isl_keep isl_set *set, enum isl_dim_type type,
568 __isl_keep isl_id *id)
570 return isl_map_find_dim_by_id(set, type, id);
573 int isl_basic_map_is_rational(__isl_keep isl_basic_map *bmap)
577 return ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL);
580 int isl_basic_set_is_rational(__isl_keep isl_basic_set *bset)
582 return isl_basic_map_is_rational(bset);
585 static struct isl_basic_map *basic_map_init(struct isl_ctx *ctx,
586 struct isl_basic_map *bmap, unsigned extra,
587 unsigned n_eq, unsigned n_ineq)
590 size_t row_size = 1 + isl_dim_total(bmap->dim) + extra;
595 bmap->block = isl_blk_alloc(ctx, (n_ineq + n_eq) * row_size);
596 if (isl_blk_is_error(bmap->block))
599 bmap->ineq = isl_alloc_array(ctx, isl_int *, n_ineq + n_eq);
604 bmap->block2 = isl_blk_empty();
607 bmap->block2 = isl_blk_alloc(ctx, extra * (1 + row_size));
608 if (isl_blk_is_error(bmap->block2))
611 bmap->div = isl_alloc_array(ctx, isl_int *, extra);
616 for (i = 0; i < n_ineq + n_eq; ++i)
617 bmap->ineq[i] = bmap->block.data + i * row_size;
619 for (i = 0; i < extra; ++i)
620 bmap->div[i] = bmap->block2.data + i * (1 + row_size);
624 bmap->c_size = n_eq + n_ineq;
625 bmap->eq = bmap->ineq + n_ineq;
634 isl_basic_map_free(bmap);
638 struct isl_basic_set *isl_basic_set_alloc(struct isl_ctx *ctx,
639 unsigned nparam, unsigned dim, unsigned extra,
640 unsigned n_eq, unsigned n_ineq)
642 struct isl_basic_map *bmap;
643 bmap = isl_basic_map_alloc(ctx, nparam, 0, dim, extra, n_eq, n_ineq);
644 return (struct isl_basic_set *)bmap;
647 struct isl_basic_set *isl_basic_set_alloc_dim(struct isl_dim *dim,
648 unsigned extra, unsigned n_eq, unsigned n_ineq)
650 struct isl_basic_map *bmap;
653 isl_assert(dim->ctx, dim->n_in == 0, goto error);
654 bmap = isl_basic_map_alloc_dim(dim, extra, n_eq, n_ineq);
655 return (struct isl_basic_set *)bmap;
661 struct isl_basic_map *isl_basic_map_alloc_dim(struct isl_dim *dim,
662 unsigned extra, unsigned n_eq, unsigned n_ineq)
664 struct isl_basic_map *bmap;
668 bmap = isl_calloc_type(dim->ctx, struct isl_basic_map);
673 return basic_map_init(dim->ctx, bmap, extra, n_eq, n_ineq);
679 struct isl_basic_map *isl_basic_map_alloc(struct isl_ctx *ctx,
680 unsigned nparam, unsigned in, unsigned out, unsigned extra,
681 unsigned n_eq, unsigned n_ineq)
683 struct isl_basic_map *bmap;
686 dim = isl_dim_alloc(ctx, nparam, in, out);
690 bmap = isl_basic_map_alloc_dim(dim, extra, n_eq, n_ineq);
694 static void dup_constraints(
695 struct isl_basic_map *dst, struct isl_basic_map *src)
698 unsigned total = isl_basic_map_total_dim(src);
700 for (i = 0; i < src->n_eq; ++i) {
701 int j = isl_basic_map_alloc_equality(dst);
702 isl_seq_cpy(dst->eq[j], src->eq[i], 1+total);
705 for (i = 0; i < src->n_ineq; ++i) {
706 int j = isl_basic_map_alloc_inequality(dst);
707 isl_seq_cpy(dst->ineq[j], src->ineq[i], 1+total);
710 for (i = 0; i < src->n_div; ++i) {
711 int j = isl_basic_map_alloc_div(dst);
712 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total);
714 ISL_F_SET(dst, ISL_BASIC_SET_FINAL);
717 struct isl_basic_map *isl_basic_map_dup(struct isl_basic_map *bmap)
719 struct isl_basic_map *dup;
723 dup = isl_basic_map_alloc_dim(isl_dim_copy(bmap->dim),
724 bmap->n_div, bmap->n_eq, bmap->n_ineq);
727 dup_constraints(dup, bmap);
728 dup->flags = bmap->flags;
729 dup->sample = isl_vec_copy(bmap->sample);
733 struct isl_basic_set *isl_basic_set_dup(struct isl_basic_set *bset)
735 struct isl_basic_map *dup;
737 dup = isl_basic_map_dup((struct isl_basic_map *)bset);
738 return (struct isl_basic_set *)dup;
741 struct isl_basic_set *isl_basic_set_copy(struct isl_basic_set *bset)
746 if (ISL_F_ISSET(bset, ISL_BASIC_SET_FINAL)) {
750 return isl_basic_set_dup(bset);
753 struct isl_set *isl_set_copy(struct isl_set *set)
762 struct isl_basic_map *isl_basic_map_copy(struct isl_basic_map *bmap)
767 if (ISL_F_ISSET(bmap, ISL_BASIC_SET_FINAL)) {
771 bmap = isl_basic_map_dup(bmap);
773 ISL_F_SET(bmap, ISL_BASIC_SET_FINAL);
777 struct isl_map *isl_map_copy(struct isl_map *map)
786 void isl_basic_map_free(struct isl_basic_map *bmap)
794 isl_ctx_deref(bmap->ctx);
796 isl_blk_free(bmap->ctx, bmap->block2);
798 isl_blk_free(bmap->ctx, bmap->block);
799 isl_vec_free(bmap->sample);
800 isl_dim_free(bmap->dim);
804 void isl_basic_set_free(struct isl_basic_set *bset)
806 isl_basic_map_free((struct isl_basic_map *)bset);
809 static int room_for_con(struct isl_basic_map *bmap, unsigned n)
811 return bmap->n_eq + bmap->n_ineq + n <= bmap->c_size;
814 __isl_give isl_map *isl_map_align_params_map_map_and(
815 __isl_take isl_map *map1, __isl_take isl_map *map2,
816 __isl_give isl_map *(*fn)(__isl_take isl_map *map1,
817 __isl_take isl_map *map2))
821 if (isl_dim_match(map1->dim, isl_dim_param, map2->dim, isl_dim_param))
822 return fn(map1, map2);
823 if (!isl_dim_has_named_params(map1->dim) ||
824 !isl_dim_has_named_params(map2->dim))
825 isl_die(map1->ctx, isl_error_invalid,
826 "unaligned unnamed parameters", goto error);
827 map1 = isl_map_align_params(map1, isl_map_get_dim(map2));
828 map2 = isl_map_align_params(map2, isl_map_get_dim(map1));
829 return fn(map1, map2);
836 static int align_params_map_map_and_test(__isl_keep isl_map *map1,
837 __isl_keep isl_map *map2,
838 int (*fn)(__isl_keep isl_map *map1, __isl_keep isl_map *map2))
844 if (isl_dim_match(map1->dim, isl_dim_param, map2->dim, isl_dim_param))
845 return fn(map1, map2);
846 if (!isl_dim_has_named_params(map1->dim) ||
847 !isl_dim_has_named_params(map2->dim))
848 isl_die(map1->ctx, isl_error_invalid,
849 "unaligned unnamed parameters", return -1);
850 map1 = isl_map_copy(map1);
851 map2 = isl_map_copy(map2);
852 map1 = isl_map_align_params(map1, isl_map_get_dim(map2));
853 map2 = isl_map_align_params(map2, isl_map_get_dim(map1));
860 int isl_basic_map_alloc_equality(struct isl_basic_map *bmap)
866 isl_assert(ctx, room_for_con(bmap, 1), return -1);
867 isl_assert(ctx, (bmap->eq - bmap->ineq) + bmap->n_eq <= bmap->c_size,
869 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
870 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
871 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_IMPLICIT);
872 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
873 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
874 if ((bmap->eq - bmap->ineq) + bmap->n_eq == bmap->c_size) {
876 int j = isl_basic_map_alloc_inequality(bmap);
880 bmap->ineq[j] = bmap->ineq[bmap->n_ineq - 1];
881 bmap->ineq[bmap->n_ineq - 1] = bmap->eq[-1];
888 isl_seq_clr(bmap->eq[bmap->n_eq] + 1 + isl_basic_map_total_dim(bmap),
889 bmap->extra - bmap->n_div);
893 int isl_basic_set_alloc_equality(struct isl_basic_set *bset)
895 return isl_basic_map_alloc_equality((struct isl_basic_map *)bset);
898 int isl_basic_map_free_equality(struct isl_basic_map *bmap, unsigned n)
902 isl_assert(bmap->ctx, n <= bmap->n_eq, return -1);
907 int isl_basic_set_free_equality(struct isl_basic_set *bset, unsigned n)
909 return isl_basic_map_free_equality((struct isl_basic_map *)bset, n);
912 int isl_basic_map_drop_equality(struct isl_basic_map *bmap, unsigned pos)
917 isl_assert(bmap->ctx, pos < bmap->n_eq, return -1);
919 if (pos != bmap->n_eq - 1) {
921 bmap->eq[pos] = bmap->eq[bmap->n_eq - 1];
922 bmap->eq[bmap->n_eq - 1] = t;
928 int isl_basic_set_drop_equality(struct isl_basic_set *bset, unsigned pos)
930 return isl_basic_map_drop_equality((struct isl_basic_map *)bset, pos);
933 void isl_basic_map_inequality_to_equality(
934 struct isl_basic_map *bmap, unsigned pos)
939 bmap->ineq[pos] = bmap->ineq[bmap->n_ineq - 1];
940 bmap->ineq[bmap->n_ineq - 1] = bmap->eq[-1];
945 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
946 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
947 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
948 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
951 static int room_for_ineq(struct isl_basic_map *bmap, unsigned n)
953 return bmap->n_ineq + n <= bmap->eq - bmap->ineq;
956 int isl_basic_map_alloc_inequality(struct isl_basic_map *bmap)
962 isl_assert(ctx, room_for_ineq(bmap, 1), return -1);
963 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_IMPLICIT);
964 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
965 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
966 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
967 isl_seq_clr(bmap->ineq[bmap->n_ineq] +
968 1 + isl_basic_map_total_dim(bmap),
969 bmap->extra - bmap->n_div);
970 return bmap->n_ineq++;
973 int isl_basic_set_alloc_inequality(struct isl_basic_set *bset)
975 return isl_basic_map_alloc_inequality((struct isl_basic_map *)bset);
978 int isl_basic_map_free_inequality(struct isl_basic_map *bmap, unsigned n)
982 isl_assert(bmap->ctx, n <= bmap->n_ineq, return -1);
987 int isl_basic_set_free_inequality(struct isl_basic_set *bset, unsigned n)
989 return isl_basic_map_free_inequality((struct isl_basic_map *)bset, n);
992 int isl_basic_map_drop_inequality(struct isl_basic_map *bmap, unsigned pos)
997 isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
999 if (pos != bmap->n_ineq - 1) {
1000 t = bmap->ineq[pos];
1001 bmap->ineq[pos] = bmap->ineq[bmap->n_ineq - 1];
1002 bmap->ineq[bmap->n_ineq - 1] = t;
1003 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1009 int isl_basic_set_drop_inequality(struct isl_basic_set *bset, unsigned pos)
1011 return isl_basic_map_drop_inequality((struct isl_basic_map *)bset, pos);
1014 __isl_give isl_basic_map *isl_basic_map_add_eq(__isl_take isl_basic_map *bmap,
1019 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
1022 k = isl_basic_map_alloc_equality(bmap);
1025 isl_seq_cpy(bmap->eq[k], eq, 1 + isl_basic_map_total_dim(bmap));
1028 isl_basic_map_free(bmap);
1032 __isl_give isl_basic_set *isl_basic_set_add_eq(__isl_take isl_basic_set *bset,
1035 return (isl_basic_set *)
1036 isl_basic_map_add_eq((isl_basic_map *)bset, eq);
1039 __isl_give isl_basic_map *isl_basic_map_add_ineq(__isl_take isl_basic_map *bmap,
1044 bmap = isl_basic_map_extend_constraints(bmap, 0, 1);
1047 k = isl_basic_map_alloc_inequality(bmap);
1050 isl_seq_cpy(bmap->ineq[k], ineq, 1 + isl_basic_map_total_dim(bmap));
1053 isl_basic_map_free(bmap);
1057 __isl_give isl_basic_set *isl_basic_set_add_ineq(__isl_take isl_basic_set *bset,
1060 return (isl_basic_set *)
1061 isl_basic_map_add_ineq((isl_basic_map *)bset, ineq);
1064 int isl_basic_map_alloc_div(struct isl_basic_map *bmap)
1068 isl_assert(bmap->ctx, bmap->n_div < bmap->extra, return -1);
1069 isl_seq_clr(bmap->div[bmap->n_div] +
1070 1 + 1 + isl_basic_map_total_dim(bmap),
1071 bmap->extra - bmap->n_div);
1072 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
1073 return bmap->n_div++;
1076 int isl_basic_set_alloc_div(struct isl_basic_set *bset)
1078 return isl_basic_map_alloc_div((struct isl_basic_map *)bset);
1081 int isl_basic_map_free_div(struct isl_basic_map *bmap, unsigned n)
1085 isl_assert(bmap->ctx, n <= bmap->n_div, return -1);
1090 int isl_basic_set_free_div(struct isl_basic_set *bset, unsigned n)
1092 return isl_basic_map_free_div((struct isl_basic_map *)bset, n);
1095 /* Copy constraint from src to dst, putting the vars of src at offset
1096 * dim_off in dst and the divs of src at offset div_off in dst.
1097 * If both sets are actually map, then dim_off applies to the input
1100 static void copy_constraint(struct isl_basic_map *dst_map, isl_int *dst,
1101 struct isl_basic_map *src_map, isl_int *src,
1102 unsigned in_off, unsigned out_off, unsigned div_off)
1104 unsigned src_nparam = isl_basic_map_n_param(src_map);
1105 unsigned dst_nparam = isl_basic_map_n_param(dst_map);
1106 unsigned src_in = isl_basic_map_n_in(src_map);
1107 unsigned dst_in = isl_basic_map_n_in(dst_map);
1108 unsigned src_out = isl_basic_map_n_out(src_map);
1109 unsigned dst_out = isl_basic_map_n_out(dst_map);
1110 isl_int_set(dst[0], src[0]);
1111 isl_seq_cpy(dst+1, src+1, isl_min(dst_nparam, src_nparam));
1112 if (dst_nparam > src_nparam)
1113 isl_seq_clr(dst+1+src_nparam,
1114 dst_nparam - src_nparam);
1115 isl_seq_clr(dst+1+dst_nparam, in_off);
1116 isl_seq_cpy(dst+1+dst_nparam+in_off,
1118 isl_min(dst_in-in_off, src_in));
1119 if (dst_in-in_off > src_in)
1120 isl_seq_clr(dst+1+dst_nparam+in_off+src_in,
1121 dst_in - in_off - src_in);
1122 isl_seq_clr(dst+1+dst_nparam+dst_in, out_off);
1123 isl_seq_cpy(dst+1+dst_nparam+dst_in+out_off,
1124 src+1+src_nparam+src_in,
1125 isl_min(dst_out-out_off, src_out));
1126 if (dst_out-out_off > src_out)
1127 isl_seq_clr(dst+1+dst_nparam+dst_in+out_off+src_out,
1128 dst_out - out_off - src_out);
1129 isl_seq_clr(dst+1+dst_nparam+dst_in+dst_out, div_off);
1130 isl_seq_cpy(dst+1+dst_nparam+dst_in+dst_out+div_off,
1131 src+1+src_nparam+src_in+src_out,
1132 isl_min(dst_map->extra-div_off, src_map->n_div));
1133 if (dst_map->n_div-div_off > src_map->n_div)
1134 isl_seq_clr(dst+1+dst_nparam+dst_in+dst_out+
1135 div_off+src_map->n_div,
1136 dst_map->n_div - div_off - src_map->n_div);
1139 static void copy_div(struct isl_basic_map *dst_map, isl_int *dst,
1140 struct isl_basic_map *src_map, isl_int *src,
1141 unsigned in_off, unsigned out_off, unsigned div_off)
1143 isl_int_set(dst[0], src[0]);
1144 copy_constraint(dst_map, dst+1, src_map, src+1, in_off, out_off, div_off);
1147 static struct isl_basic_map *add_constraints(struct isl_basic_map *bmap1,
1148 struct isl_basic_map *bmap2, unsigned i_pos, unsigned o_pos)
1153 if (!bmap1 || !bmap2)
1156 div_off = bmap1->n_div;
1158 for (i = 0; i < bmap2->n_eq; ++i) {
1159 int i1 = isl_basic_map_alloc_equality(bmap1);
1162 copy_constraint(bmap1, bmap1->eq[i1], bmap2, bmap2->eq[i],
1163 i_pos, o_pos, div_off);
1166 for (i = 0; i < bmap2->n_ineq; ++i) {
1167 int i1 = isl_basic_map_alloc_inequality(bmap1);
1170 copy_constraint(bmap1, bmap1->ineq[i1], bmap2, bmap2->ineq[i],
1171 i_pos, o_pos, div_off);
1174 for (i = 0; i < bmap2->n_div; ++i) {
1175 int i1 = isl_basic_map_alloc_div(bmap1);
1178 copy_div(bmap1, bmap1->div[i1], bmap2, bmap2->div[i],
1179 i_pos, o_pos, div_off);
1182 isl_basic_map_free(bmap2);
1187 isl_basic_map_free(bmap1);
1188 isl_basic_map_free(bmap2);
1192 struct isl_basic_set *isl_basic_set_add_constraints(struct isl_basic_set *bset1,
1193 struct isl_basic_set *bset2, unsigned pos)
1195 return (struct isl_basic_set *)
1196 add_constraints((struct isl_basic_map *)bset1,
1197 (struct isl_basic_map *)bset2, 0, pos);
1200 struct isl_basic_map *isl_basic_map_extend_dim(struct isl_basic_map *base,
1201 struct isl_dim *dim, unsigned extra,
1202 unsigned n_eq, unsigned n_ineq)
1204 struct isl_basic_map *ext;
1214 dims_ok = isl_dim_equal(base->dim, dim) &&
1215 base->extra >= base->n_div + extra;
1217 if (dims_ok && room_for_con(base, n_eq + n_ineq) &&
1218 room_for_ineq(base, n_ineq)) {
1223 isl_assert(base->ctx, base->dim->nparam <= dim->nparam, goto error);
1224 isl_assert(base->ctx, base->dim->n_in <= dim->n_in, goto error);
1225 isl_assert(base->ctx, base->dim->n_out <= dim->n_out, goto error);
1226 extra += base->extra;
1228 n_ineq += base->n_ineq;
1230 ext = isl_basic_map_alloc_dim(dim, extra, n_eq, n_ineq);
1236 ext->sample = isl_vec_copy(base->sample);
1237 flags = base->flags;
1238 ext = add_constraints(ext, base, 0, 0);
1241 ISL_F_CLR(ext, ISL_BASIC_SET_FINAL);
1248 isl_basic_map_free(base);
1252 struct isl_basic_set *isl_basic_set_extend_dim(struct isl_basic_set *base,
1253 struct isl_dim *dim, unsigned extra,
1254 unsigned n_eq, unsigned n_ineq)
1256 return (struct isl_basic_set *)
1257 isl_basic_map_extend_dim((struct isl_basic_map *)base, dim,
1258 extra, n_eq, n_ineq);
1261 struct isl_basic_map *isl_basic_map_extend_constraints(
1262 struct isl_basic_map *base, unsigned n_eq, unsigned n_ineq)
1266 return isl_basic_map_extend_dim(base, isl_dim_copy(base->dim),
1270 struct isl_basic_map *isl_basic_map_extend(struct isl_basic_map *base,
1271 unsigned nparam, unsigned n_in, unsigned n_out, unsigned extra,
1272 unsigned n_eq, unsigned n_ineq)
1274 struct isl_basic_map *bmap;
1275 struct isl_dim *dim;
1279 dim = isl_dim_alloc(base->ctx, nparam, n_in, n_out);
1283 bmap = isl_basic_map_extend_dim(base, dim, extra, n_eq, n_ineq);
1286 isl_basic_map_free(base);
1290 struct isl_basic_set *isl_basic_set_extend(struct isl_basic_set *base,
1291 unsigned nparam, unsigned dim, unsigned extra,
1292 unsigned n_eq, unsigned n_ineq)
1294 return (struct isl_basic_set *)
1295 isl_basic_map_extend((struct isl_basic_map *)base,
1296 nparam, 0, dim, extra, n_eq, n_ineq);
1299 struct isl_basic_set *isl_basic_set_extend_constraints(
1300 struct isl_basic_set *base, unsigned n_eq, unsigned n_ineq)
1302 return (struct isl_basic_set *)
1303 isl_basic_map_extend_constraints((struct isl_basic_map *)base,
1307 struct isl_basic_set *isl_basic_set_cow(struct isl_basic_set *bset)
1309 return (struct isl_basic_set *)
1310 isl_basic_map_cow((struct isl_basic_map *)bset);
1313 struct isl_basic_map *isl_basic_map_cow(struct isl_basic_map *bmap)
1318 if (bmap->ref > 1) {
1320 bmap = isl_basic_map_dup(bmap);
1323 ISL_F_CLR(bmap, ISL_BASIC_SET_FINAL);
1327 struct isl_set *isl_set_cow(struct isl_set *set)
1335 return isl_set_dup(set);
1338 struct isl_map *isl_map_cow(struct isl_map *map)
1346 return isl_map_dup(map);
1349 static void swap_vars(struct isl_blk blk, isl_int *a,
1350 unsigned a_len, unsigned b_len)
1352 isl_seq_cpy(blk.data, a+a_len, b_len);
1353 isl_seq_cpy(blk.data+b_len, a, a_len);
1354 isl_seq_cpy(a, blk.data, b_len+a_len);
1357 static __isl_give isl_basic_map *isl_basic_map_swap_vars(
1358 __isl_take isl_basic_map *bmap, unsigned pos, unsigned n1, unsigned n2)
1366 isl_assert(bmap->ctx,
1367 pos + n1 + n2 <= 1 + isl_basic_map_total_dim(bmap), goto error);
1369 if (n1 == 0 || n2 == 0)
1372 bmap = isl_basic_map_cow(bmap);
1376 blk = isl_blk_alloc(bmap->ctx, n1 + n2);
1377 if (isl_blk_is_error(blk))
1380 for (i = 0; i < bmap->n_eq; ++i)
1382 bmap->eq[i] + pos, n1, n2);
1384 for (i = 0; i < bmap->n_ineq; ++i)
1386 bmap->ineq[i] + pos, n1, n2);
1388 for (i = 0; i < bmap->n_div; ++i)
1390 bmap->div[i]+1 + pos, n1, n2);
1392 isl_blk_free(bmap->ctx, blk);
1394 ISL_F_CLR(bmap, ISL_BASIC_SET_NORMALIZED);
1395 bmap = isl_basic_map_gauss(bmap, NULL);
1396 return isl_basic_map_finalize(bmap);
1398 isl_basic_map_free(bmap);
1402 static __isl_give isl_basic_set *isl_basic_set_swap_vars(
1403 __isl_take isl_basic_set *bset, unsigned n)
1408 nparam = isl_basic_set_n_param(bset);
1409 dim = isl_basic_set_n_dim(bset);
1410 isl_assert(bset->ctx, n <= dim, goto error);
1412 return isl_basic_map_swap_vars(bset, 1 + nparam, n, dim - n);
1414 isl_basic_set_free(bset);
1418 struct isl_basic_map *isl_basic_map_set_to_empty(struct isl_basic_map *bmap)
1424 total = isl_basic_map_total_dim(bmap);
1425 isl_basic_map_free_div(bmap, bmap->n_div);
1426 isl_basic_map_free_inequality(bmap, bmap->n_ineq);
1428 isl_basic_map_free_equality(bmap, bmap->n_eq-1);
1430 i = isl_basic_map_alloc_equality(bmap);
1434 isl_int_set_si(bmap->eq[i][0], 1);
1435 isl_seq_clr(bmap->eq[i]+1, total);
1436 ISL_F_SET(bmap, ISL_BASIC_MAP_EMPTY);
1437 isl_vec_free(bmap->sample);
1438 bmap->sample = NULL;
1439 return isl_basic_map_finalize(bmap);
1441 isl_basic_map_free(bmap);
1445 struct isl_basic_set *isl_basic_set_set_to_empty(struct isl_basic_set *bset)
1447 return (struct isl_basic_set *)
1448 isl_basic_map_set_to_empty((struct isl_basic_map *)bset);
1451 void isl_basic_map_swap_div(struct isl_basic_map *bmap, int a, int b)
1454 unsigned off = isl_dim_total(bmap->dim);
1455 isl_int *t = bmap->div[a];
1456 bmap->div[a] = bmap->div[b];
1459 for (i = 0; i < bmap->n_eq; ++i)
1460 isl_int_swap(bmap->eq[i][1+off+a], bmap->eq[i][1+off+b]);
1462 for (i = 0; i < bmap->n_ineq; ++i)
1463 isl_int_swap(bmap->ineq[i][1+off+a], bmap->ineq[i][1+off+b]);
1465 for (i = 0; i < bmap->n_div; ++i)
1466 isl_int_swap(bmap->div[i][1+1+off+a], bmap->div[i][1+1+off+b]);
1467 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1470 /* Eliminate the specified n dimensions starting at first from the
1471 * constraints using Fourier-Motzkin. The dimensions themselves
1474 __isl_give isl_map *isl_map_eliminate(__isl_take isl_map *map,
1475 enum isl_dim_type type, unsigned first, unsigned n)
1484 map = isl_map_cow(map);
1487 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
1488 first += pos(map->dim, type) - 1;
1490 for (i = 0; i < map->n; ++i) {
1491 map->p[i] = isl_basic_map_eliminate_vars(map->p[i], first, n);
1501 /* Eliminate the specified n dimensions starting at first from the
1502 * constraints using Fourier-Motzkin. The dimensions themselves
1505 __isl_give isl_set *isl_set_eliminate(__isl_take isl_set *set,
1506 enum isl_dim_type type, unsigned first, unsigned n)
1508 return (isl_set *)isl_map_eliminate((isl_map *)set, type, first, n);
1511 /* Eliminate the specified n dimensions starting at first from the
1512 * constraints using Fourier-Motzkin. The dimensions themselves
1515 __isl_give isl_set *isl_set_eliminate_dims(__isl_take isl_set *set,
1516 unsigned first, unsigned n)
1518 return isl_set_eliminate(set, isl_dim_set, first, n);
1521 __isl_give isl_basic_map *isl_basic_map_remove_divs(
1522 __isl_take isl_basic_map *bmap)
1524 bmap = isl_basic_map_eliminate_vars(bmap, isl_dim_total(bmap->dim),
1529 return isl_basic_map_finalize(bmap);
1532 __isl_give isl_basic_set *isl_basic_set_remove_divs(
1533 __isl_take isl_basic_set *bset)
1535 return (struct isl_basic_set *)isl_basic_map_remove_divs(
1536 (struct isl_basic_map *)bset);
1539 __isl_give isl_map *isl_map_remove_divs(__isl_take isl_map *map)
1548 map = isl_map_cow(map);
1552 for (i = 0; i < map->n; ++i) {
1553 map->p[i] = isl_basic_map_remove_divs(map->p[i]);
1563 __isl_give isl_set *isl_set_remove_divs(__isl_take isl_set *set)
1565 return isl_map_remove_divs(set);
1568 struct isl_basic_map *isl_basic_map_remove_dims(struct isl_basic_map *bmap,
1569 enum isl_dim_type type, unsigned first, unsigned n)
1573 isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
1577 bmap = isl_basic_map_eliminate_vars(bmap,
1578 isl_basic_map_offset(bmap, type) - 1 + first, n);
1581 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY) && type == isl_dim_div)
1583 bmap = isl_basic_map_drop(bmap, type, first, n);
1586 isl_basic_map_free(bmap);
1590 /* Return true if the definition of the given div (recursively) involves
1591 * any of the given variables.
1593 static int div_involves_vars(__isl_keep isl_basic_map *bmap, int div,
1594 unsigned first, unsigned n)
1597 unsigned div_offset = isl_basic_map_offset(bmap, isl_dim_div);
1599 if (isl_int_is_zero(bmap->div[div][0]))
1601 if (isl_seq_first_non_zero(bmap->div[div] + 1 + first, n) >= 0)
1604 for (i = bmap->n_div - 1; i >= 0; --i) {
1605 if (isl_int_is_zero(bmap->div[div][1 + div_offset + i]))
1607 if (div_involves_vars(bmap, i, first, n))
1614 /* Remove all divs (recursively) involving any of the given dimensions
1615 * in their definitions.
1617 __isl_give isl_basic_map *isl_basic_map_remove_divs_involving_dims(
1618 __isl_take isl_basic_map *bmap,
1619 enum isl_dim_type type, unsigned first, unsigned n)
1625 isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
1627 first += isl_basic_map_offset(bmap, type);
1629 for (i = bmap->n_div - 1; i >= 0; --i) {
1630 if (!div_involves_vars(bmap, i, first, n))
1632 bmap = isl_basic_map_remove_dims(bmap, isl_dim_div, i, 1);
1640 isl_basic_map_free(bmap);
1644 __isl_give isl_map *isl_map_remove_divs_involving_dims(__isl_take isl_map *map,
1645 enum isl_dim_type type, unsigned first, unsigned n)
1654 map = isl_map_cow(map);
1658 for (i = 0; i < map->n; ++i) {
1659 map->p[i] = isl_basic_map_remove_divs_involving_dims(map->p[i],
1670 __isl_give isl_set *isl_set_remove_divs_involving_dims(__isl_take isl_set *set,
1671 enum isl_dim_type type, unsigned first, unsigned n)
1673 return (isl_set *)isl_map_remove_divs_involving_dims((isl_map *)set,
1677 int isl_basic_map_involves_dims(__isl_keep isl_basic_map *bmap,
1678 enum isl_dim_type type, unsigned first, unsigned n)
1685 if (first + n > isl_basic_map_dim(bmap, type))
1686 isl_die(bmap->ctx, isl_error_invalid,
1687 "index out of bounds", return -1);
1689 first += isl_basic_map_offset(bmap, type);
1690 for (i = 0; i < bmap->n_eq; ++i)
1691 if (isl_seq_first_non_zero(bmap->eq[i] + first, n) >= 0)
1693 for (i = 0; i < bmap->n_ineq; ++i)
1694 if (isl_seq_first_non_zero(bmap->ineq[i] + first, n) >= 0)
1700 int isl_map_involves_dims(__isl_keep isl_map *map,
1701 enum isl_dim_type type, unsigned first, unsigned n)
1708 if (first + n > isl_map_dim(map, type))
1709 isl_die(map->ctx, isl_error_invalid,
1710 "index out of bounds", return -1);
1712 for (i = 0; i < map->n; ++i) {
1713 int involves = isl_basic_map_involves_dims(map->p[i],
1715 if (involves < 0 || !involves)
1722 int isl_basic_set_involves_dims(__isl_keep isl_basic_set *bset,
1723 enum isl_dim_type type, unsigned first, unsigned n)
1725 return isl_basic_map_involves_dims(bset, type, first, n);
1728 int isl_set_involves_dims(__isl_keep isl_set *set,
1729 enum isl_dim_type type, unsigned first, unsigned n)
1731 return isl_map_involves_dims(set, type, first, n);
1734 /* Return true if the definition of the given div is unknown or depends
1737 static int div_is_unknown(__isl_keep isl_basic_map *bmap, int div)
1740 unsigned div_offset = isl_basic_map_offset(bmap, isl_dim_div);
1742 if (isl_int_is_zero(bmap->div[div][0]))
1745 for (i = bmap->n_div - 1; i >= 0; --i) {
1746 if (isl_int_is_zero(bmap->div[div][1 + div_offset + i]))
1748 if (div_is_unknown(bmap, i))
1755 /* Remove all divs that are unknown or defined in terms of unknown divs.
1757 __isl_give isl_basic_map *isl_basic_map_remove_unknown_divs(
1758 __isl_take isl_basic_map *bmap)
1765 for (i = bmap->n_div - 1; i >= 0; --i) {
1766 if (!div_is_unknown(bmap, i))
1768 bmap = isl_basic_map_remove_dims(bmap, isl_dim_div, i, 1);
1774 __isl_give isl_map *isl_map_remove_unknown_divs(__isl_take isl_map *map)
1783 map = isl_map_cow(map);
1787 for (i = 0; i < map->n; ++i) {
1788 map->p[i] = isl_basic_map_remove_unknown_divs(map->p[i]);
1798 __isl_give isl_set *isl_set_remove_unknown_divs(__isl_take isl_set *set)
1800 return (isl_set *)isl_map_remove_unknown_divs((isl_map *)set);
1803 __isl_give isl_basic_set *isl_basic_set_remove_dims(
1804 __isl_take isl_basic_set *bset,
1805 enum isl_dim_type type, unsigned first, unsigned n)
1807 return (isl_basic_set *)
1808 isl_basic_map_remove_dims((isl_basic_map *)bset, type, first, n);
1811 struct isl_map *isl_map_remove_dims(struct isl_map *map,
1812 enum isl_dim_type type, unsigned first, unsigned n)
1819 map = isl_map_cow(map);
1822 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
1824 for (i = 0; i < map->n; ++i) {
1825 map->p[i] = isl_basic_map_eliminate_vars(map->p[i],
1826 isl_basic_map_offset(map->p[i], type) - 1 + first, n);
1830 map = isl_map_drop(map, type, first, n);
1837 __isl_give isl_set *isl_set_remove_dims(__isl_take isl_set *bset,
1838 enum isl_dim_type type, unsigned first, unsigned n)
1840 return (isl_set *)isl_map_remove_dims((isl_map *)bset, type, first, n);
1843 /* Project out n inputs starting at first using Fourier-Motzkin */
1844 struct isl_map *isl_map_remove_inputs(struct isl_map *map,
1845 unsigned first, unsigned n)
1847 return isl_map_remove_dims(map, isl_dim_in, first, n);
1850 static void dump_term(struct isl_basic_map *bmap,
1851 isl_int c, int pos, FILE *out)
1854 unsigned in = isl_basic_map_n_in(bmap);
1855 unsigned dim = in + isl_basic_map_n_out(bmap);
1856 unsigned nparam = isl_basic_map_n_param(bmap);
1858 isl_int_print(out, c, 0);
1860 if (!isl_int_is_one(c))
1861 isl_int_print(out, c, 0);
1862 if (pos < 1 + nparam) {
1863 name = isl_dim_get_name(bmap->dim,
1864 isl_dim_param, pos - 1);
1866 fprintf(out, "%s", name);
1868 fprintf(out, "p%d", pos - 1);
1869 } else if (pos < 1 + nparam + in)
1870 fprintf(out, "i%d", pos - 1 - nparam);
1871 else if (pos < 1 + nparam + dim)
1872 fprintf(out, "o%d", pos - 1 - nparam - in);
1874 fprintf(out, "e%d", pos - 1 - nparam - dim);
1878 static void dump_constraint_sign(struct isl_basic_map *bmap, isl_int *c,
1879 int sign, FILE *out)
1883 unsigned len = 1 + isl_basic_map_total_dim(bmap);
1887 for (i = 0, first = 1; i < len; ++i) {
1888 if (isl_int_sgn(c[i]) * sign <= 0)
1891 fprintf(out, " + ");
1893 isl_int_abs(v, c[i]);
1894 dump_term(bmap, v, i, out);
1901 static void dump_constraint(struct isl_basic_map *bmap, isl_int *c,
1902 const char *op, FILE *out, int indent)
1906 fprintf(out, "%*s", indent, "");
1908 dump_constraint_sign(bmap, c, 1, out);
1909 fprintf(out, " %s ", op);
1910 dump_constraint_sign(bmap, c, -1, out);
1914 for (i = bmap->n_div; i < bmap->extra; ++i) {
1915 if (isl_int_is_zero(c[1+isl_dim_total(bmap->dim)+i]))
1917 fprintf(out, "%*s", indent, "");
1918 fprintf(out, "ERROR: unused div coefficient not zero\n");
1923 static void dump_constraints(struct isl_basic_map *bmap,
1924 isl_int **c, unsigned n,
1925 const char *op, FILE *out, int indent)
1929 for (i = 0; i < n; ++i)
1930 dump_constraint(bmap, c[i], op, out, indent);
1933 static void dump_affine(struct isl_basic_map *bmap, isl_int *exp, FILE *out)
1937 unsigned total = isl_basic_map_total_dim(bmap);
1939 for (j = 0; j < 1 + total; ++j) {
1940 if (isl_int_is_zero(exp[j]))
1942 if (!first && isl_int_is_pos(exp[j]))
1944 dump_term(bmap, exp[j], j, out);
1949 static void dump(struct isl_basic_map *bmap, FILE *out, int indent)
1953 dump_constraints(bmap, bmap->eq, bmap->n_eq, "=", out, indent);
1954 dump_constraints(bmap, bmap->ineq, bmap->n_ineq, ">=", out, indent);
1956 for (i = 0; i < bmap->n_div; ++i) {
1957 fprintf(out, "%*s", indent, "");
1958 fprintf(out, "e%d = [(", i);
1959 dump_affine(bmap, bmap->div[i]+1, out);
1961 isl_int_print(out, bmap->div[i][0], 0);
1962 fprintf(out, "]\n");
1966 void isl_basic_set_print_internal(struct isl_basic_set *bset,
1967 FILE *out, int indent)
1970 fprintf(out, "null basic set\n");
1974 fprintf(out, "%*s", indent, "");
1975 fprintf(out, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n",
1976 bset->ref, bset->dim->nparam, bset->dim->n_out,
1977 bset->extra, bset->flags);
1978 dump((struct isl_basic_map *)bset, out, indent);
1981 void isl_basic_map_print_internal(struct isl_basic_map *bmap,
1982 FILE *out, int indent)
1985 fprintf(out, "null basic map\n");
1989 fprintf(out, "%*s", indent, "");
1990 fprintf(out, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, "
1991 "flags: %x, n_name: %d\n",
1993 bmap->dim->nparam, bmap->dim->n_in, bmap->dim->n_out,
1994 bmap->extra, bmap->flags, bmap->dim->n_id);
1995 dump(bmap, out, indent);
1998 int isl_inequality_negate(struct isl_basic_map *bmap, unsigned pos)
2003 total = isl_basic_map_total_dim(bmap);
2004 isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
2005 isl_seq_neg(bmap->ineq[pos], bmap->ineq[pos], 1 + total);
2006 isl_int_sub_ui(bmap->ineq[pos][0], bmap->ineq[pos][0], 1);
2007 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
2011 struct isl_set *isl_set_alloc_dim(struct isl_dim *dim, int n, unsigned flags)
2013 struct isl_set *set;
2017 isl_assert(dim->ctx, dim->n_in == 0, goto error);
2018 isl_assert(dim->ctx, n >= 0, goto error);
2019 set = isl_alloc(dim->ctx, struct isl_set,
2020 sizeof(struct isl_set) +
2021 (n - 1) * sizeof(struct isl_basic_set *));
2025 set->ctx = dim->ctx;
2026 isl_ctx_ref(set->ctx);
2038 struct isl_set *isl_set_alloc(struct isl_ctx *ctx,
2039 unsigned nparam, unsigned dim, int n, unsigned flags)
2041 struct isl_set *set;
2042 struct isl_dim *dims;
2044 dims = isl_dim_alloc(ctx, nparam, 0, dim);
2048 set = isl_set_alloc_dim(dims, n, flags);
2052 /* Make sure "map" has room for at least "n" more basic maps.
2054 struct isl_map *isl_map_grow(struct isl_map *map, int n)
2057 struct isl_map *grown = NULL;
2061 isl_assert(map->ctx, n >= 0, goto error);
2062 if (map->n + n <= map->size)
2064 grown = isl_map_alloc_dim(isl_map_get_dim(map), map->n + n, map->flags);
2067 for (i = 0; i < map->n; ++i) {
2068 grown->p[i] = isl_basic_map_copy(map->p[i]);
2076 isl_map_free(grown);
2081 /* Make sure "set" has room for at least "n" more basic sets.
2083 struct isl_set *isl_set_grow(struct isl_set *set, int n)
2085 return (struct isl_set *)isl_map_grow((struct isl_map *)set, n);
2088 struct isl_set *isl_set_dup(struct isl_set *set)
2091 struct isl_set *dup;
2096 dup = isl_set_alloc_dim(isl_dim_copy(set->dim), set->n, set->flags);
2099 for (i = 0; i < set->n; ++i)
2100 dup = isl_set_add_basic_set(dup, isl_basic_set_copy(set->p[i]));
2104 struct isl_set *isl_set_from_basic_set(struct isl_basic_set *bset)
2106 return isl_map_from_basic_map(bset);
2109 struct isl_map *isl_map_from_basic_map(struct isl_basic_map *bmap)
2111 struct isl_map *map;
2116 map = isl_map_alloc_dim(isl_dim_copy(bmap->dim), 1, ISL_MAP_DISJOINT);
2117 return isl_map_add_basic_map(map, bmap);
2120 __isl_give isl_set *isl_set_add_basic_set(__isl_take isl_set *set,
2121 __isl_take isl_basic_set *bset)
2123 return (struct isl_set *)isl_map_add_basic_map((struct isl_map *)set,
2124 (struct isl_basic_map *)bset);
2127 void isl_set_free(struct isl_set *set)
2137 isl_ctx_deref(set->ctx);
2138 for (i = 0; i < set->n; ++i)
2139 isl_basic_set_free(set->p[i]);
2140 isl_dim_free(set->dim);
2144 void isl_set_print_internal(struct isl_set *set, FILE *out, int indent)
2149 fprintf(out, "null set\n");
2153 fprintf(out, "%*s", indent, "");
2154 fprintf(out, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
2155 set->ref, set->n, set->dim->nparam, set->dim->n_out,
2157 for (i = 0; i < set->n; ++i) {
2158 fprintf(out, "%*s", indent, "");
2159 fprintf(out, "basic set %d:\n", i);
2160 isl_basic_set_print_internal(set->p[i], out, indent+4);
2164 void isl_map_print_internal(struct isl_map *map, FILE *out, int indent)
2169 fprintf(out, "null map\n");
2173 fprintf(out, "%*s", indent, "");
2174 fprintf(out, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, "
2175 "flags: %x, n_name: %d\n",
2176 map->ref, map->n, map->dim->nparam, map->dim->n_in,
2177 map->dim->n_out, map->flags, map->dim->n_id);
2178 for (i = 0; i < map->n; ++i) {
2179 fprintf(out, "%*s", indent, "");
2180 fprintf(out, "basic map %d:\n", i);
2181 isl_basic_map_print_internal(map->p[i], out, indent+4);
2185 struct isl_basic_map *isl_basic_map_intersect_domain(
2186 struct isl_basic_map *bmap, struct isl_basic_set *bset)
2188 struct isl_basic_map *bmap_domain;
2193 isl_assert(bset->ctx, isl_dim_match(bmap->dim, isl_dim_param,
2194 bset->dim, isl_dim_param), goto error);
2196 if (isl_dim_size(bset->dim, isl_dim_set) != 0)
2197 isl_assert(bset->ctx,
2198 isl_basic_map_compatible_domain(bmap, bset), goto error);
2200 bmap = isl_basic_map_cow(bmap);
2203 bmap = isl_basic_map_extend_dim(bmap, isl_dim_copy(bmap->dim),
2204 bset->n_div, bset->n_eq, bset->n_ineq);
2205 bmap_domain = isl_basic_map_from_domain(bset);
2206 bmap = add_constraints(bmap, bmap_domain, 0, 0);
2208 bmap = isl_basic_map_simplify(bmap);
2209 return isl_basic_map_finalize(bmap);
2211 isl_basic_map_free(bmap);
2212 isl_basic_set_free(bset);
2216 struct isl_basic_map *isl_basic_map_intersect_range(
2217 struct isl_basic_map *bmap, struct isl_basic_set *bset)
2219 struct isl_basic_map *bmap_range;
2224 isl_assert(bset->ctx, isl_dim_match(bmap->dim, isl_dim_param,
2225 bset->dim, isl_dim_param), goto error);
2227 if (isl_dim_size(bset->dim, isl_dim_set) != 0)
2228 isl_assert(bset->ctx,
2229 isl_basic_map_compatible_range(bmap, bset), goto error);
2231 if (isl_basic_set_is_universe(bset)) {
2232 isl_basic_set_free(bset);
2236 bmap = isl_basic_map_cow(bmap);
2239 bmap = isl_basic_map_extend_dim(bmap, isl_dim_copy(bmap->dim),
2240 bset->n_div, bset->n_eq, bset->n_ineq);
2241 bmap_range = isl_basic_map_from_basic_set(bset, isl_dim_copy(bset->dim));
2242 bmap = add_constraints(bmap, bmap_range, 0, 0);
2244 bmap = isl_basic_map_simplify(bmap);
2245 return isl_basic_map_finalize(bmap);
2247 isl_basic_map_free(bmap);
2248 isl_basic_set_free(bset);
2252 int isl_basic_map_contains(struct isl_basic_map *bmap, struct isl_vec *vec)
2258 total = 1 + isl_basic_map_total_dim(bmap);
2259 if (total != vec->size)
2264 for (i = 0; i < bmap->n_eq; ++i) {
2265 isl_seq_inner_product(vec->el, bmap->eq[i], total, &s);
2266 if (!isl_int_is_zero(s)) {
2272 for (i = 0; i < bmap->n_ineq; ++i) {
2273 isl_seq_inner_product(vec->el, bmap->ineq[i], total, &s);
2274 if (isl_int_is_neg(s)) {
2285 int isl_basic_set_contains(struct isl_basic_set *bset, struct isl_vec *vec)
2287 return isl_basic_map_contains((struct isl_basic_map *)bset, vec);
2290 struct isl_basic_map *isl_basic_map_intersect(
2291 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2293 struct isl_vec *sample = NULL;
2295 if (!bmap1 || !bmap2)
2298 isl_assert(bmap1->ctx, isl_dim_match(bmap1->dim, isl_dim_param,
2299 bmap2->dim, isl_dim_param), goto error);
2300 if (isl_dim_total(bmap1->dim) ==
2301 isl_dim_size(bmap1->dim, isl_dim_param) &&
2302 isl_dim_total(bmap2->dim) !=
2303 isl_dim_size(bmap2->dim, isl_dim_param))
2304 return isl_basic_map_intersect(bmap2, bmap1);
2306 if (isl_dim_total(bmap2->dim) !=
2307 isl_dim_size(bmap2->dim, isl_dim_param))
2308 isl_assert(bmap1->ctx,
2309 isl_dim_equal(bmap1->dim, bmap2->dim), goto error);
2311 if (bmap1->sample &&
2312 isl_basic_map_contains(bmap1, bmap1->sample) > 0 &&
2313 isl_basic_map_contains(bmap2, bmap1->sample) > 0)
2314 sample = isl_vec_copy(bmap1->sample);
2315 else if (bmap2->sample &&
2316 isl_basic_map_contains(bmap1, bmap2->sample) > 0 &&
2317 isl_basic_map_contains(bmap2, bmap2->sample) > 0)
2318 sample = isl_vec_copy(bmap2->sample);
2320 bmap1 = isl_basic_map_cow(bmap1);
2323 bmap1 = isl_basic_map_extend_dim(bmap1, isl_dim_copy(bmap1->dim),
2324 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
2325 bmap1 = add_constraints(bmap1, bmap2, 0, 0);
2328 isl_vec_free(sample);
2330 isl_vec_free(bmap1->sample);
2331 bmap1->sample = sample;
2334 bmap1 = isl_basic_map_simplify(bmap1);
2335 return isl_basic_map_finalize(bmap1);
2338 isl_vec_free(sample);
2339 isl_basic_map_free(bmap1);
2340 isl_basic_map_free(bmap2);
2344 struct isl_basic_set *isl_basic_set_intersect(
2345 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
2347 return (struct isl_basic_set *)
2348 isl_basic_map_intersect(
2349 (struct isl_basic_map *)bset1,
2350 (struct isl_basic_map *)bset2);
2353 /* Special case of isl_map_intersect, where both map1 and map2
2354 * are convex, without any divs and such that either map1 or map2
2355 * contains a single constraint. This constraint is then simply
2356 * added to the other map.
2358 static __isl_give isl_map *map_intersect_add_constraint(
2359 __isl_take isl_map *map1, __isl_take isl_map *map2)
2361 isl_assert(map1->ctx, map1->n == 1, goto error);
2362 isl_assert(map2->ctx, map1->n == 1, goto error);
2363 isl_assert(map1->ctx, map1->p[0]->n_div == 0, goto error);
2364 isl_assert(map2->ctx, map1->p[0]->n_div == 0, goto error);
2366 if (map2->p[0]->n_eq + map2->p[0]->n_ineq != 1)
2367 return isl_map_intersect(map2, map1);
2369 isl_assert(map2->ctx,
2370 map2->p[0]->n_eq + map2->p[0]->n_ineq == 1, goto error);
2372 map1 = isl_map_cow(map1);
2375 if (isl_map_plain_is_empty(map1)) {
2379 map1->p[0] = isl_basic_map_cow(map1->p[0]);
2380 if (map2->p[0]->n_eq == 1)
2381 map1->p[0] = isl_basic_map_add_eq(map1->p[0], map2->p[0]->eq[0]);
2383 map1->p[0] = isl_basic_map_add_ineq(map1->p[0],
2384 map2->p[0]->ineq[0]);
2386 map1->p[0] = isl_basic_map_simplify(map1->p[0]);
2387 map1->p[0] = isl_basic_map_finalize(map1->p[0]);
2391 if (isl_basic_map_plain_is_empty(map1->p[0])) {
2392 isl_basic_map_free(map1->p[0]);
2405 static __isl_give isl_map *map_intersect(__isl_take isl_map *map1,
2406 __isl_take isl_map *map2)
2409 struct isl_map *result;
2415 if (isl_map_plain_is_empty(map1)) {
2419 if (isl_map_plain_is_empty(map2)) {
2424 if (map1->n == 1 && map2->n == 1 &&
2425 map1->p[0]->n_div == 0 && map2->p[0]->n_div == 0 &&
2426 isl_dim_equal(map1->dim, map2->dim) &&
2427 (map1->p[0]->n_eq + map1->p[0]->n_ineq == 1 ||
2428 map2->p[0]->n_eq + map2->p[0]->n_ineq == 1))
2429 return map_intersect_add_constraint(map1, map2);
2430 if (isl_dim_total(map1->dim) ==
2431 isl_dim_size(map1->dim, isl_dim_param) &&
2432 isl_dim_total(map2->dim) != isl_dim_size(map2->dim, isl_dim_param))
2433 return isl_map_intersect(map2, map1);
2435 if (isl_dim_total(map2->dim) != isl_dim_size(map2->dim, isl_dim_param))
2436 isl_assert(map1->ctx,
2437 isl_dim_equal(map1->dim, map2->dim), goto error);
2439 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
2440 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
2441 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
2443 result = isl_map_alloc_dim(isl_dim_copy(map1->dim),
2444 map1->n * map2->n, flags);
2447 for (i = 0; i < map1->n; ++i)
2448 for (j = 0; j < map2->n; ++j) {
2449 struct isl_basic_map *part;
2450 part = isl_basic_map_intersect(
2451 isl_basic_map_copy(map1->p[i]),
2452 isl_basic_map_copy(map2->p[j]));
2453 if (isl_basic_map_is_empty(part))
2454 isl_basic_map_free(part);
2456 result = isl_map_add_basic_map(result, part);
2469 __isl_give isl_map *isl_map_intersect(__isl_take isl_map *map1,
2470 __isl_take isl_map *map2)
2472 return isl_map_align_params_map_map_and(map1, map2, &map_intersect);
2475 struct isl_set *isl_set_intersect(struct isl_set *set1, struct isl_set *set2)
2477 return (struct isl_set *)
2478 isl_map_intersect((struct isl_map *)set1,
2479 (struct isl_map *)set2);
2482 /* The current implementation of isl_map_intersect accepts intersections
2483 * with parameter domains, so we can just call that for now.
2485 static __isl_give isl_map *map_intersect_params(__isl_take isl_map *map,
2486 __isl_take isl_set *params)
2488 return isl_map_intersect(map, params);
2491 __isl_give isl_map *isl_map_intersect_params(__isl_take isl_map *map1,
2492 __isl_take isl_map *map2)
2494 return isl_map_align_params_map_map_and(map1, map2, &map_intersect_params);
2497 __isl_give isl_set *isl_set_intersect_params(__isl_take isl_set *set,
2498 __isl_take isl_set *params)
2500 return isl_map_intersect_params(set, params);
2503 struct isl_basic_map *isl_basic_map_reverse(struct isl_basic_map *bmap)
2505 struct isl_dim *dim;
2506 struct isl_basic_set *bset;
2511 bmap = isl_basic_map_cow(bmap);
2514 dim = isl_dim_reverse(isl_dim_copy(bmap->dim));
2515 in = isl_basic_map_n_in(bmap);
2516 bset = isl_basic_set_from_basic_map(bmap);
2517 bset = isl_basic_set_swap_vars(bset, in);
2518 return isl_basic_map_from_basic_set(bset, dim);
2521 __isl_give isl_basic_map *isl_basic_map_insert(__isl_take isl_basic_map *bmap,
2522 enum isl_dim_type type, unsigned pos, unsigned n)
2524 struct isl_dim *res_dim;
2525 struct isl_basic_map *res;
2526 struct isl_dim_map *dim_map;
2527 unsigned total, off;
2528 enum isl_dim_type t;
2536 res_dim = isl_dim_insert(isl_basic_map_get_dim(bmap), type, pos, n);
2538 total = isl_basic_map_total_dim(bmap) + n;
2539 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2541 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
2543 isl_dim_map_dim(dim_map, bmap->dim, t, off);
2545 unsigned size = isl_basic_map_dim(bmap, t);
2546 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2548 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2549 pos, size - pos, off + pos + n);
2551 off += isl_dim_size(res_dim, t);
2553 isl_dim_map_div(dim_map, bmap, off);
2555 res = isl_basic_map_alloc_dim(res_dim,
2556 bmap->n_div, bmap->n_eq, bmap->n_ineq);
2557 if (isl_basic_map_is_rational(bmap))
2558 res = isl_basic_map_set_rational(res);
2559 res = isl_basic_map_add_constraints_dim_map(res, bmap, dim_map);
2560 return isl_basic_map_finalize(res);
2563 __isl_give isl_basic_map *isl_basic_map_add(__isl_take isl_basic_map *bmap,
2564 enum isl_dim_type type, unsigned n)
2568 return isl_basic_map_insert(bmap, type,
2569 isl_basic_map_dim(bmap, type), n);
2572 __isl_give isl_basic_set *isl_basic_set_add(__isl_take isl_basic_set *bset,
2573 enum isl_dim_type type, unsigned n)
2577 isl_assert(bset->ctx, type != isl_dim_in, goto error);
2578 return (isl_basic_set *)isl_basic_map_add((isl_basic_map *)bset, type, n);
2580 isl_basic_set_free(bset);
2584 __isl_give isl_map *isl_map_insert(__isl_take isl_map *map,
2585 enum isl_dim_type type, unsigned pos, unsigned n)
2592 map = isl_map_cow(map);
2596 map->dim = isl_dim_insert(map->dim, type, pos, n);
2600 for (i = 0; i < map->n; ++i) {
2601 map->p[i] = isl_basic_map_insert(map->p[i], type, pos, n);
2612 __isl_give isl_set *isl_set_insert(__isl_take isl_set *set,
2613 enum isl_dim_type type, unsigned pos, unsigned n)
2615 return (isl_set *)isl_map_insert((isl_map *)set, type, pos, n);
2618 __isl_give isl_map *isl_map_add_dims(__isl_take isl_map *map,
2619 enum isl_dim_type type, unsigned n)
2623 return isl_map_insert(map, type, isl_map_dim(map, type), n);
2626 __isl_give isl_set *isl_set_add_dims(__isl_take isl_set *set,
2627 enum isl_dim_type type, unsigned n)
2631 isl_assert(set->ctx, type != isl_dim_in, goto error);
2632 return (isl_set *)isl_map_add_dims((isl_map *)set, type, n);
2638 __isl_give isl_basic_map *isl_basic_map_move_dims(
2639 __isl_take isl_basic_map *bmap,
2640 enum isl_dim_type dst_type, unsigned dst_pos,
2641 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2643 struct isl_dim_map *dim_map;
2644 struct isl_basic_map *res;
2645 enum isl_dim_type t;
2646 unsigned total, off;
2653 isl_assert(bmap->ctx, src_pos + n <= isl_basic_map_dim(bmap, src_type),
2656 if (dst_type == src_type && dst_pos == src_pos)
2659 isl_assert(bmap->ctx, dst_type != src_type, goto error);
2661 if (pos(bmap->dim, dst_type) + dst_pos ==
2662 pos(bmap->dim, src_type) + src_pos +
2663 ((src_type < dst_type) ? n : 0)) {
2664 bmap = isl_basic_map_cow(bmap);
2668 bmap->dim = isl_dim_move(bmap->dim, dst_type, dst_pos,
2669 src_type, src_pos, n);
2673 bmap = isl_basic_map_finalize(bmap);
2678 total = isl_basic_map_total_dim(bmap);
2679 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2682 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
2683 unsigned size = isl_dim_size(bmap->dim, t);
2684 if (t == dst_type) {
2685 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2688 isl_dim_map_dim_range(dim_map, bmap->dim, src_type,
2691 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2692 dst_pos, size - dst_pos, off);
2693 off += size - dst_pos;
2694 } else if (t == src_type) {
2695 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2698 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2699 src_pos + n, size - src_pos - n, off);
2700 off += size - src_pos - n;
2702 isl_dim_map_dim(dim_map, bmap->dim, t, off);
2706 isl_dim_map_div(dim_map, bmap, off);
2708 res = isl_basic_map_alloc_dim(isl_basic_map_get_dim(bmap),
2709 bmap->n_div, bmap->n_eq, bmap->n_ineq);
2710 bmap = isl_basic_map_add_constraints_dim_map(res, bmap, dim_map);
2712 bmap->dim = isl_dim_move(bmap->dim, dst_type, dst_pos,
2713 src_type, src_pos, n);
2717 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
2718 bmap = isl_basic_map_gauss(bmap, NULL);
2719 bmap = isl_basic_map_finalize(bmap);
2723 isl_basic_map_free(bmap);
2727 __isl_give isl_basic_set *isl_basic_set_move_dims(__isl_take isl_basic_set *bset,
2728 enum isl_dim_type dst_type, unsigned dst_pos,
2729 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2731 return (isl_basic_set *)isl_basic_map_move_dims(
2732 (isl_basic_map *)bset, dst_type, dst_pos, src_type, src_pos, n);
2735 __isl_give isl_set *isl_set_move_dims(__isl_take isl_set *set,
2736 enum isl_dim_type dst_type, unsigned dst_pos,
2737 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2741 isl_assert(set->ctx, dst_type != isl_dim_in, goto error);
2742 return (isl_set *)isl_map_move_dims((isl_map *)set, dst_type, dst_pos,
2743 src_type, src_pos, n);
2749 __isl_give isl_map *isl_map_move_dims(__isl_take isl_map *map,
2750 enum isl_dim_type dst_type, unsigned dst_pos,
2751 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2760 isl_assert(map->ctx, src_pos + n <= isl_map_dim(map, src_type),
2763 if (dst_type == src_type && dst_pos == src_pos)
2766 isl_assert(map->ctx, dst_type != src_type, goto error);
2768 map = isl_map_cow(map);
2772 map->dim = isl_dim_move(map->dim, dst_type, dst_pos, src_type, src_pos, n);
2776 for (i = 0; i < map->n; ++i) {
2777 map->p[i] = isl_basic_map_move_dims(map->p[i],
2779 src_type, src_pos, n);
2790 /* Move the specified dimensions to the last columns right before
2791 * the divs. Don't change the dimension specification of bmap.
2792 * That's the responsibility of the caller.
2794 static __isl_give isl_basic_map *move_last(__isl_take isl_basic_map *bmap,
2795 enum isl_dim_type type, unsigned first, unsigned n)
2797 struct isl_dim_map *dim_map;
2798 struct isl_basic_map *res;
2799 enum isl_dim_type t;
2800 unsigned total, off;
2804 if (pos(bmap->dim, type) + first + n == 1 + isl_dim_total(bmap->dim))
2807 total = isl_basic_map_total_dim(bmap);
2808 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2811 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
2812 unsigned size = isl_dim_size(bmap->dim, t);
2814 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2817 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2818 first, n, total - bmap->n_div - n);
2819 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2820 first + n, size - (first + n), off);
2821 off += size - (first + n);
2823 isl_dim_map_dim(dim_map, bmap->dim, t, off);
2827 isl_dim_map_div(dim_map, bmap, off + n);
2829 res = isl_basic_map_alloc_dim(isl_basic_map_get_dim(bmap),
2830 bmap->n_div, bmap->n_eq, bmap->n_ineq);
2831 res = isl_basic_map_add_constraints_dim_map(res, bmap, dim_map);
2835 /* Turn the n dimensions of type type, starting at first
2836 * into existentially quantified variables.
2838 __isl_give isl_basic_map *isl_basic_map_project_out(
2839 __isl_take isl_basic_map *bmap,
2840 enum isl_dim_type type, unsigned first, unsigned n)
2853 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL))
2854 return isl_basic_map_remove_dims(bmap, type, first, n);
2856 isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
2859 bmap = move_last(bmap, type, first, n);
2860 bmap = isl_basic_map_cow(bmap);
2864 row_size = 1 + isl_dim_total(bmap->dim) + bmap->extra;
2865 old = bmap->block2.data;
2866 bmap->block2 = isl_blk_extend(bmap->ctx, bmap->block2,
2867 (bmap->extra + n) * (1 + row_size));
2868 if (!bmap->block2.data)
2870 new_div = isl_alloc_array(bmap->ctx, isl_int *, bmap->extra + n);
2873 for (i = 0; i < n; ++i) {
2874 new_div[i] = bmap->block2.data +
2875 (bmap->extra + i) * (1 + row_size);
2876 isl_seq_clr(new_div[i], 1 + row_size);
2878 for (i = 0; i < bmap->extra; ++i)
2879 new_div[n + i] = bmap->block2.data + (bmap->div[i] - old);
2881 bmap->div = new_div;
2885 bmap->dim = isl_dim_drop(bmap->dim, type, first, n);
2888 bmap = isl_basic_map_simplify(bmap);
2889 bmap = isl_basic_map_drop_redundant_divs(bmap);
2890 return isl_basic_map_finalize(bmap);
2892 isl_basic_map_free(bmap);
2896 /* Turn the n dimensions of type type, starting at first
2897 * into existentially quantified variables.
2899 struct isl_basic_set *isl_basic_set_project_out(struct isl_basic_set *bset,
2900 enum isl_dim_type type, unsigned first, unsigned n)
2902 return (isl_basic_set *)isl_basic_map_project_out(
2903 (isl_basic_map *)bset, type, first, n);
2906 /* Turn the n dimensions of type type, starting at first
2907 * into existentially quantified variables.
2909 __isl_give isl_map *isl_map_project_out(__isl_take isl_map *map,
2910 enum isl_dim_type type, unsigned first, unsigned n)
2920 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
2922 map = isl_map_cow(map);
2926 map->dim = isl_dim_drop(map->dim, type, first, n);
2930 for (i = 0; i < map->n; ++i) {
2931 map->p[i] = isl_basic_map_project_out(map->p[i], type, first, n);
2942 /* Turn the n dimensions of type type, starting at first
2943 * into existentially quantified variables.
2945 __isl_give isl_set *isl_set_project_out(__isl_take isl_set *set,
2946 enum isl_dim_type type, unsigned first, unsigned n)
2948 return (isl_set *)isl_map_project_out((isl_map *)set, type, first, n);
2951 static struct isl_basic_map *add_divs(struct isl_basic_map *bmap, unsigned n)
2955 for (i = 0; i < n; ++i) {
2956 j = isl_basic_map_alloc_div(bmap);
2959 isl_seq_clr(bmap->div[j], 1+1+isl_basic_map_total_dim(bmap));
2963 isl_basic_map_free(bmap);
2967 struct isl_basic_map *isl_basic_map_apply_range(
2968 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2970 struct isl_dim *dim_result = NULL;
2971 struct isl_basic_map *bmap;
2972 unsigned n_in, n_out, n, nparam, total, pos;
2973 struct isl_dim_map *dim_map1, *dim_map2;
2975 if (!bmap1 || !bmap2)
2978 dim_result = isl_dim_join(isl_dim_copy(bmap1->dim),
2979 isl_dim_copy(bmap2->dim));
2981 n_in = isl_basic_map_n_in(bmap1);
2982 n_out = isl_basic_map_n_out(bmap2);
2983 n = isl_basic_map_n_out(bmap1);
2984 nparam = isl_basic_map_n_param(bmap1);
2986 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + n;
2987 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
2988 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
2989 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
2990 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
2991 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
2992 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_in);
2993 isl_dim_map_div(dim_map1, bmap1, pos += n_out);
2994 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
2995 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
2996 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
2998 bmap = isl_basic_map_alloc_dim(dim_result,
2999 bmap1->n_div + bmap2->n_div + n,
3000 bmap1->n_eq + bmap2->n_eq,
3001 bmap1->n_ineq + bmap2->n_ineq);
3002 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap1, dim_map1);
3003 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap2, dim_map2);
3004 bmap = add_divs(bmap, n);
3005 bmap = isl_basic_map_simplify(bmap);
3006 bmap = isl_basic_map_drop_redundant_divs(bmap);
3007 return isl_basic_map_finalize(bmap);
3009 isl_basic_map_free(bmap1);
3010 isl_basic_map_free(bmap2);
3014 struct isl_basic_set *isl_basic_set_apply(
3015 struct isl_basic_set *bset, struct isl_basic_map *bmap)
3020 isl_assert(bset->ctx, isl_basic_map_compatible_domain(bmap, bset),
3023 return (struct isl_basic_set *)
3024 isl_basic_map_apply_range((struct isl_basic_map *)bset, bmap);
3026 isl_basic_set_free(bset);
3027 isl_basic_map_free(bmap);
3031 struct isl_basic_map *isl_basic_map_apply_domain(
3032 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3034 if (!bmap1 || !bmap2)
3037 isl_assert(bmap1->ctx,
3038 isl_basic_map_n_in(bmap1) == isl_basic_map_n_in(bmap2), goto error);
3039 isl_assert(bmap1->ctx,
3040 isl_basic_map_n_param(bmap1) == isl_basic_map_n_param(bmap2),
3043 bmap1 = isl_basic_map_reverse(bmap1);
3044 bmap1 = isl_basic_map_apply_range(bmap1, bmap2);
3045 return isl_basic_map_reverse(bmap1);
3047 isl_basic_map_free(bmap1);
3048 isl_basic_map_free(bmap2);
3052 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
3053 * A \cap B -> f(A) + f(B)
3055 struct isl_basic_map *isl_basic_map_sum(
3056 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3058 unsigned n_in, n_out, nparam, total, pos;
3059 struct isl_basic_map *bmap = NULL;
3060 struct isl_dim_map *dim_map1, *dim_map2;
3063 if (!bmap1 || !bmap2)
3066 isl_assert(bmap1->ctx, isl_dim_equal(bmap1->dim, bmap2->dim),
3069 nparam = isl_basic_map_n_param(bmap1);
3070 n_in = isl_basic_map_n_in(bmap1);
3071 n_out = isl_basic_map_n_out(bmap1);
3073 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + 2 * n_out;
3074 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
3075 dim_map2 = isl_dim_map_alloc(bmap2->ctx, total);
3076 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
3077 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos);
3078 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
3079 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
3080 isl_dim_map_div(dim_map1, bmap1, pos += n_in + n_out);
3081 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
3082 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
3083 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_out);
3085 bmap = isl_basic_map_alloc_dim(isl_dim_copy(bmap1->dim),
3086 bmap1->n_div + bmap2->n_div + 2 * n_out,
3087 bmap1->n_eq + bmap2->n_eq + n_out,
3088 bmap1->n_ineq + bmap2->n_ineq);
3089 for (i = 0; i < n_out; ++i) {
3090 int j = isl_basic_map_alloc_equality(bmap);
3093 isl_seq_clr(bmap->eq[j], 1+total);
3094 isl_int_set_si(bmap->eq[j][1+nparam+n_in+i], -1);
3095 isl_int_set_si(bmap->eq[j][1+pos+i], 1);
3096 isl_int_set_si(bmap->eq[j][1+pos-n_out+i], 1);
3098 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap1, dim_map1);
3099 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap2, dim_map2);
3100 bmap = add_divs(bmap, 2 * n_out);
3102 bmap = isl_basic_map_simplify(bmap);
3103 return isl_basic_map_finalize(bmap);
3105 isl_basic_map_free(bmap);
3106 isl_basic_map_free(bmap1);
3107 isl_basic_map_free(bmap2);
3111 /* Given two maps A -> f(A) and B -> g(B), construct a map
3112 * A \cap B -> f(A) + f(B)
3114 struct isl_map *isl_map_sum(struct isl_map *map1, struct isl_map *map2)
3116 struct isl_map *result;
3122 isl_assert(map1->ctx, isl_dim_equal(map1->dim, map2->dim), goto error);
3124 result = isl_map_alloc_dim(isl_dim_copy(map1->dim),
3125 map1->n * map2->n, 0);
3128 for (i = 0; i < map1->n; ++i)
3129 for (j = 0; j < map2->n; ++j) {
3130 struct isl_basic_map *part;
3131 part = isl_basic_map_sum(
3132 isl_basic_map_copy(map1->p[i]),
3133 isl_basic_map_copy(map2->p[j]));
3134 if (isl_basic_map_is_empty(part))
3135 isl_basic_map_free(part);
3137 result = isl_map_add_basic_map(result, part);
3150 __isl_give isl_set *isl_set_sum(__isl_take isl_set *set1,
3151 __isl_take isl_set *set2)
3153 return (isl_set *)isl_map_sum((isl_map *)set1, (isl_map *)set2);
3156 /* Given a basic map A -> f(A), construct A -> -f(A).
3158 struct isl_basic_map *isl_basic_map_neg(struct isl_basic_map *bmap)
3163 bmap = isl_basic_map_cow(bmap);
3167 n = isl_basic_map_dim(bmap, isl_dim_out);
3168 off = isl_basic_map_offset(bmap, isl_dim_out);
3169 for (i = 0; i < bmap->n_eq; ++i)
3170 for (j = 0; j < n; ++j)
3171 isl_int_neg(bmap->eq[i][off+j], bmap->eq[i][off+j]);
3172 for (i = 0; i < bmap->n_ineq; ++i)
3173 for (j = 0; j < n; ++j)
3174 isl_int_neg(bmap->ineq[i][off+j], bmap->ineq[i][off+j]);
3175 for (i = 0; i < bmap->n_div; ++i)
3176 for (j = 0; j < n; ++j)
3177 isl_int_neg(bmap->div[i][1+off+j], bmap->div[i][1+off+j]);
3178 return isl_basic_map_finalize(bmap);
3181 __isl_give isl_basic_set *isl_basic_set_neg(__isl_take isl_basic_set *bset)
3183 return isl_basic_map_neg(bset);
3186 /* Given a map A -> f(A), construct A -> -f(A).
3188 struct isl_map *isl_map_neg(struct isl_map *map)
3192 map = isl_map_cow(map);
3196 for (i = 0; i < map->n; ++i) {
3197 map->p[i] = isl_basic_map_neg(map->p[i]);
3208 __isl_give isl_set *isl_set_neg(__isl_take isl_set *set)
3210 return (isl_set *)isl_map_neg((isl_map *)set);
3213 /* Given a basic map A -> f(A) and an integer d, construct a basic map
3214 * A -> floor(f(A)/d).
3216 struct isl_basic_map *isl_basic_map_floordiv(struct isl_basic_map *bmap,
3219 unsigned n_in, n_out, nparam, total, pos;
3220 struct isl_basic_map *result = NULL;
3221 struct isl_dim_map *dim_map;
3227 nparam = isl_basic_map_n_param(bmap);
3228 n_in = isl_basic_map_n_in(bmap);
3229 n_out = isl_basic_map_n_out(bmap);
3231 total = nparam + n_in + n_out + bmap->n_div + n_out;
3232 dim_map = isl_dim_map_alloc(bmap->ctx, total);
3233 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_param, pos = 0);
3234 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_in, pos += nparam);
3235 isl_dim_map_div(dim_map, bmap, pos += n_in + n_out);
3236 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_out, pos += bmap->n_div);
3238 result = isl_basic_map_alloc_dim(isl_dim_copy(bmap->dim),
3239 bmap->n_div + n_out,
3240 bmap->n_eq, bmap->n_ineq + 2 * n_out);
3241 result = isl_basic_map_add_constraints_dim_map(result, bmap, dim_map);
3242 result = add_divs(result, n_out);
3243 for (i = 0; i < n_out; ++i) {
3245 j = isl_basic_map_alloc_inequality(result);
3248 isl_seq_clr(result->ineq[j], 1+total);
3249 isl_int_neg(result->ineq[j][1+nparam+n_in+i], d);
3250 isl_int_set_si(result->ineq[j][1+pos+i], 1);
3251 j = isl_basic_map_alloc_inequality(result);
3254 isl_seq_clr(result->ineq[j], 1+total);
3255 isl_int_set(result->ineq[j][1+nparam+n_in+i], d);
3256 isl_int_set_si(result->ineq[j][1+pos+i], -1);
3257 isl_int_sub_ui(result->ineq[j][0], d, 1);
3260 result = isl_basic_map_simplify(result);
3261 return isl_basic_map_finalize(result);
3263 isl_basic_map_free(result);
3267 /* Given a map A -> f(A) and an integer d, construct a map
3268 * A -> floor(f(A)/d).
3270 struct isl_map *isl_map_floordiv(struct isl_map *map, isl_int d)
3274 map = isl_map_cow(map);
3278 ISL_F_CLR(map, ISL_MAP_DISJOINT);
3279 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3280 for (i = 0; i < map->n; ++i) {
3281 map->p[i] = isl_basic_map_floordiv(map->p[i], d);
3292 static struct isl_basic_map *var_equal(struct isl_basic_map *bmap, unsigned pos)
3298 i = isl_basic_map_alloc_equality(bmap);
3301 nparam = isl_basic_map_n_param(bmap);
3302 n_in = isl_basic_map_n_in(bmap);
3303 isl_seq_clr(bmap->eq[i], 1 + isl_basic_map_total_dim(bmap));
3304 isl_int_set_si(bmap->eq[i][1+nparam+pos], -1);
3305 isl_int_set_si(bmap->eq[i][1+nparam+n_in+pos], 1);
3306 return isl_basic_map_finalize(bmap);
3308 isl_basic_map_free(bmap);
3312 /* Add a constraints to "bmap" expressing i_pos < o_pos
3314 static struct isl_basic_map *var_less(struct isl_basic_map *bmap, unsigned pos)
3320 i = isl_basic_map_alloc_inequality(bmap);
3323 nparam = isl_basic_map_n_param(bmap);
3324 n_in = isl_basic_map_n_in(bmap);
3325 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
3326 isl_int_set_si(bmap->ineq[i][0], -1);
3327 isl_int_set_si(bmap->ineq[i][1+nparam+pos], -1);
3328 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], 1);
3329 return isl_basic_map_finalize(bmap);
3331 isl_basic_map_free(bmap);
3335 /* Add a constraint to "bmap" expressing i_pos <= o_pos
3337 static __isl_give isl_basic_map *var_less_or_equal(
3338 __isl_take isl_basic_map *bmap, unsigned pos)
3344 i = isl_basic_map_alloc_inequality(bmap);
3347 nparam = isl_basic_map_n_param(bmap);
3348 n_in = isl_basic_map_n_in(bmap);
3349 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
3350 isl_int_set_si(bmap->ineq[i][1+nparam+pos], -1);
3351 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], 1);
3352 return isl_basic_map_finalize(bmap);
3354 isl_basic_map_free(bmap);
3358 /* Add a constraints to "bmap" expressing i_pos > o_pos
3360 static struct isl_basic_map *var_more(struct isl_basic_map *bmap, unsigned pos)
3366 i = isl_basic_map_alloc_inequality(bmap);
3369 nparam = isl_basic_map_n_param(bmap);
3370 n_in = isl_basic_map_n_in(bmap);
3371 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
3372 isl_int_set_si(bmap->ineq[i][0], -1);
3373 isl_int_set_si(bmap->ineq[i][1+nparam+pos], 1);
3374 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], -1);
3375 return isl_basic_map_finalize(bmap);
3377 isl_basic_map_free(bmap);
3381 /* Add a constraint to "bmap" expressing i_pos >= o_pos
3383 static __isl_give isl_basic_map *var_more_or_equal(
3384 __isl_take isl_basic_map *bmap, unsigned pos)
3390 i = isl_basic_map_alloc_inequality(bmap);
3393 nparam = isl_basic_map_n_param(bmap);
3394 n_in = isl_basic_map_n_in(bmap);
3395 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
3396 isl_int_set_si(bmap->ineq[i][1+nparam+pos], 1);
3397 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], -1);
3398 return isl_basic_map_finalize(bmap);
3400 isl_basic_map_free(bmap);
3404 struct isl_basic_map *isl_basic_map_equal(struct isl_dim *dim, unsigned n_equal)
3407 struct isl_basic_map *bmap;
3408 bmap = isl_basic_map_alloc_dim(dim, 0, n_equal, 0);
3411 for (i = 0; i < n_equal && bmap; ++i)
3412 bmap = var_equal(bmap, i);
3413 return isl_basic_map_finalize(bmap);
3416 /* Return a relation on of dimension "dim" expressing i_[0..pos] << o_[0..pos]
3418 struct isl_basic_map *isl_basic_map_less_at(struct isl_dim *dim, unsigned pos)
3421 struct isl_basic_map *bmap;
3422 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
3425 for (i = 0; i < pos && bmap; ++i)
3426 bmap = var_equal(bmap, i);
3428 bmap = var_less(bmap, pos);
3429 return isl_basic_map_finalize(bmap);
3432 /* Return a relation on of dimension "dim" expressing i_[0..pos] <<= o_[0..pos]
3434 __isl_give isl_basic_map *isl_basic_map_less_or_equal_at(
3435 __isl_take isl_dim *dim, unsigned pos)
3438 isl_basic_map *bmap;
3440 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
3441 for (i = 0; i < pos; ++i)
3442 bmap = var_equal(bmap, i);
3443 bmap = var_less_or_equal(bmap, pos);
3444 return isl_basic_map_finalize(bmap);
3447 /* Return a relation on pairs of sets of dimension "dim" expressing i_pos > o_pos
3449 struct isl_basic_map *isl_basic_map_more_at(struct isl_dim *dim, unsigned pos)
3452 struct isl_basic_map *bmap;
3453 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
3456 for (i = 0; i < pos && bmap; ++i)
3457 bmap = var_equal(bmap, i);
3459 bmap = var_more(bmap, pos);
3460 return isl_basic_map_finalize(bmap);
3463 /* Return a relation on of dimension "dim" expressing i_[0..pos] >>= o_[0..pos]
3465 __isl_give isl_basic_map *isl_basic_map_more_or_equal_at(
3466 __isl_take isl_dim *dim, unsigned pos)
3469 isl_basic_map *bmap;
3471 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
3472 for (i = 0; i < pos; ++i)
3473 bmap = var_equal(bmap, i);
3474 bmap = var_more_or_equal(bmap, pos);
3475 return isl_basic_map_finalize(bmap);
3478 static __isl_give isl_map *map_lex_lte_first(__isl_take isl_dim *dims,
3479 unsigned n, int equal)
3481 struct isl_map *map;
3484 if (n == 0 && equal)
3485 return isl_map_universe(dims);
3487 map = isl_map_alloc_dim(isl_dim_copy(dims), n, ISL_MAP_DISJOINT);
3489 for (i = 0; i + 1 < n; ++i)
3490 map = isl_map_add_basic_map(map,
3491 isl_basic_map_less_at(isl_dim_copy(dims), i));
3494 map = isl_map_add_basic_map(map,
3495 isl_basic_map_less_or_equal_at(dims, n - 1));
3497 map = isl_map_add_basic_map(map,
3498 isl_basic_map_less_at(dims, n - 1));
3505 static __isl_give isl_map *map_lex_lte(__isl_take isl_dim *dims, int equal)
3509 return map_lex_lte_first(dims, dims->n_out, equal);
3512 __isl_give isl_map *isl_map_lex_lt_first(__isl_take isl_dim *dim, unsigned n)
3514 return map_lex_lte_first(dim, n, 0);
3517 __isl_give isl_map *isl_map_lex_le_first(__isl_take isl_dim *dim, unsigned n)
3519 return map_lex_lte_first(dim, n, 1);
3522 __isl_give isl_map *isl_map_lex_lt(__isl_take isl_dim *set_dim)
3524 return map_lex_lte(isl_dim_map_from_set(set_dim), 0);
3527 __isl_give isl_map *isl_map_lex_le(__isl_take isl_dim *set_dim)
3529 return map_lex_lte(isl_dim_map_from_set(set_dim), 1);
3532 static __isl_give isl_map *map_lex_gte_first(__isl_take isl_dim *dims,
3533 unsigned n, int equal)
3535 struct isl_map *map;
3538 if (n == 0 && equal)
3539 return isl_map_universe(dims);
3541 map = isl_map_alloc_dim(isl_dim_copy(dims), n, ISL_MAP_DISJOINT);
3543 for (i = 0; i + 1 < n; ++i)
3544 map = isl_map_add_basic_map(map,
3545 isl_basic_map_more_at(isl_dim_copy(dims), i));
3548 map = isl_map_add_basic_map(map,
3549 isl_basic_map_more_or_equal_at(dims, n - 1));
3551 map = isl_map_add_basic_map(map,
3552 isl_basic_map_more_at(dims, n - 1));
3559 static __isl_give isl_map *map_lex_gte(__isl_take isl_dim *dims, int equal)
3563 return map_lex_gte_first(dims, dims->n_out, equal);
3566 __isl_give isl_map *isl_map_lex_gt_first(__isl_take isl_dim *dim, unsigned n)
3568 return map_lex_gte_first(dim, n, 0);
3571 __isl_give isl_map *isl_map_lex_ge_first(__isl_take isl_dim *dim, unsigned n)
3573 return map_lex_gte_first(dim, n, 1);
3576 __isl_give isl_map *isl_map_lex_gt(__isl_take isl_dim *set_dim)
3578 return map_lex_gte(isl_dim_map_from_set(set_dim), 0);
3581 __isl_give isl_map *isl_map_lex_ge(__isl_take isl_dim *set_dim)
3583 return map_lex_gte(isl_dim_map_from_set(set_dim), 1);
3586 __isl_give isl_map *isl_set_lex_le_set(__isl_take isl_set *set1,
3587 __isl_take isl_set *set2)
3590 map = isl_map_lex_le(isl_set_get_dim(set1));
3591 map = isl_map_intersect_domain(map, set1);
3592 map = isl_map_intersect_range(map, set2);
3596 __isl_give isl_map *isl_set_lex_lt_set(__isl_take isl_set *set1,
3597 __isl_take isl_set *set2)
3600 map = isl_map_lex_lt(isl_set_get_dim(set1));
3601 map = isl_map_intersect_domain(map, set1);
3602 map = isl_map_intersect_range(map, set2);
3606 __isl_give isl_map *isl_set_lex_ge_set(__isl_take isl_set *set1,
3607 __isl_take isl_set *set2)
3610 map = isl_map_lex_ge(isl_set_get_dim(set1));
3611 map = isl_map_intersect_domain(map, set1);
3612 map = isl_map_intersect_range(map, set2);
3616 __isl_give isl_map *isl_set_lex_gt_set(__isl_take isl_set *set1,
3617 __isl_take isl_set *set2)
3620 map = isl_map_lex_gt(isl_set_get_dim(set1));
3621 map = isl_map_intersect_domain(map, set1);
3622 map = isl_map_intersect_range(map, set2);
3626 __isl_give isl_map *isl_map_lex_le_map(__isl_take isl_map *map1,
3627 __isl_take isl_map *map2)
3630 map = isl_map_lex_le(isl_dim_range(isl_map_get_dim(map1)));
3631 map = isl_map_apply_domain(map, isl_map_reverse(map1));
3632 map = isl_map_apply_range(map, isl_map_reverse(map2));
3636 __isl_give isl_map *isl_map_lex_lt_map(__isl_take isl_map *map1,
3637 __isl_take isl_map *map2)
3640 map = isl_map_lex_lt(isl_dim_range(isl_map_get_dim(map1)));
3641 map = isl_map_apply_domain(map, isl_map_reverse(map1));
3642 map = isl_map_apply_range(map, isl_map_reverse(map2));
3646 __isl_give isl_map *isl_map_lex_ge_map(__isl_take isl_map *map1,
3647 __isl_take isl_map *map2)
3650 map = isl_map_lex_ge(isl_dim_range(isl_map_get_dim(map1)));
3651 map = isl_map_apply_domain(map, isl_map_reverse(map1));
3652 map = isl_map_apply_range(map, isl_map_reverse(map2));
3656 __isl_give isl_map *isl_map_lex_gt_map(__isl_take isl_map *map1,
3657 __isl_take isl_map *map2)
3660 map = isl_map_lex_gt(isl_dim_range(isl_map_get_dim(map1)));
3661 map = isl_map_apply_domain(map, isl_map_reverse(map1));
3662 map = isl_map_apply_range(map, isl_map_reverse(map2));
3666 struct isl_basic_map *isl_basic_map_from_basic_set(
3667 struct isl_basic_set *bset, struct isl_dim *dim)
3669 struct isl_basic_map *bmap;
3671 bset = isl_basic_set_cow(bset);
3675 isl_assert(bset->ctx, isl_dim_compatible(bset->dim, dim), goto error);
3676 isl_dim_free(bset->dim);
3677 bmap = (struct isl_basic_map *) bset;
3679 return isl_basic_map_finalize(bmap);
3681 isl_basic_set_free(bset);
3686 struct isl_basic_set *isl_basic_set_from_basic_map(struct isl_basic_map *bmap)
3690 if (bmap->dim->n_in == 0)
3691 return (struct isl_basic_set *)bmap;
3692 bmap = isl_basic_map_cow(bmap);
3695 bmap->dim = isl_dim_as_set_dim(bmap->dim);
3698 bmap = isl_basic_map_finalize(bmap);
3699 return (struct isl_basic_set *)bmap;
3701 isl_basic_map_free(bmap);
3705 /* For a div d = floor(f/m), add the constraints
3708 * -(f-(n-1)) + m d >= 0
3710 * Note that the second constraint is the negation of
3714 int isl_basic_map_add_div_constraints_var(__isl_keep isl_basic_map *bmap,
3715 unsigned pos, isl_int *div)
3718 unsigned total = isl_basic_map_total_dim(bmap);
3720 i = isl_basic_map_alloc_inequality(bmap);
3723 isl_seq_cpy(bmap->ineq[i], div + 1, 1 + total);
3724 isl_int_neg(bmap->ineq[i][1 + pos], div[0]);
3726 j = isl_basic_map_alloc_inequality(bmap);
3729 isl_seq_neg(bmap->ineq[j], bmap->ineq[i], 1 + total);
3730 isl_int_add(bmap->ineq[j][0], bmap->ineq[j][0], bmap->ineq[j][1 + pos]);
3731 isl_int_sub_ui(bmap->ineq[j][0], bmap->ineq[j][0], 1);
3735 int isl_basic_set_add_div_constraints_var(__isl_keep isl_basic_set *bset,
3736 unsigned pos, isl_int *div)
3738 return isl_basic_map_add_div_constraints_var((isl_basic_map *)bset,
3742 int isl_basic_map_add_div_constraints(struct isl_basic_map *bmap, unsigned div)
3744 unsigned total = isl_basic_map_total_dim(bmap);
3745 unsigned div_pos = total - bmap->n_div + div;
3747 return isl_basic_map_add_div_constraints_var(bmap, div_pos,
3751 struct isl_basic_set *isl_basic_map_underlying_set(
3752 struct isl_basic_map *bmap)
3756 if (bmap->dim->nparam == 0 && bmap->dim->n_in == 0 &&
3758 !isl_dim_is_named_or_nested(bmap->dim, isl_dim_in) &&
3759 !isl_dim_is_named_or_nested(bmap->dim, isl_dim_out))
3760 return (struct isl_basic_set *)bmap;
3761 bmap = isl_basic_map_cow(bmap);
3764 bmap->dim = isl_dim_underlying(bmap->dim, bmap->n_div);
3767 bmap->extra -= bmap->n_div;
3769 bmap = isl_basic_map_finalize(bmap);
3770 return (struct isl_basic_set *)bmap;
3775 __isl_give isl_basic_set *isl_basic_set_underlying_set(
3776 __isl_take isl_basic_set *bset)
3778 return isl_basic_map_underlying_set((isl_basic_map *)bset);
3781 struct isl_basic_map *isl_basic_map_overlying_set(
3782 struct isl_basic_set *bset, struct isl_basic_map *like)
3784 struct isl_basic_map *bmap;
3785 struct isl_ctx *ctx;
3792 isl_assert(ctx, bset->n_div == 0, goto error);
3793 isl_assert(ctx, isl_basic_set_n_param(bset) == 0, goto error);
3794 isl_assert(ctx, bset->dim->n_out == isl_basic_map_total_dim(like),
3796 if (isl_dim_equal(bset->dim, like->dim) && like->n_div == 0) {
3797 isl_basic_map_free(like);
3798 return (struct isl_basic_map *)bset;
3800 bset = isl_basic_set_cow(bset);
3803 total = bset->dim->n_out + bset->extra;
3804 bmap = (struct isl_basic_map *)bset;
3805 isl_dim_free(bmap->dim);
3806 bmap->dim = isl_dim_copy(like->dim);
3809 bmap->n_div = like->n_div;
3810 bmap->extra += like->n_div;
3814 ltotal = total - bmap->extra + like->extra;
3817 bmap->block2 = isl_blk_extend(ctx, bmap->block2,
3818 bmap->extra * (1 + 1 + total));
3819 if (isl_blk_is_error(bmap->block2))
3821 div = isl_realloc_array(ctx, bmap->div, isl_int *, bmap->extra);
3825 for (i = 0; i < bmap->extra; ++i)
3826 bmap->div[i] = bmap->block2.data + i * (1 + 1 + total);
3827 for (i = 0; i < like->n_div; ++i) {
3828 isl_seq_cpy(bmap->div[i], like->div[i], 1 + 1 + ltotal);
3829 isl_seq_clr(bmap->div[i]+1+1+ltotal, total - ltotal);
3831 bmap = isl_basic_map_extend_constraints(bmap,
3832 0, 2 * like->n_div);
3833 for (i = 0; i < like->n_div; ++i) {
3834 if (isl_int_is_zero(bmap->div[i][0]))
3836 if (isl_basic_map_add_div_constraints(bmap, i) < 0)
3840 isl_basic_map_free(like);
3841 bmap = isl_basic_map_simplify(bmap);
3842 bmap = isl_basic_map_finalize(bmap);
3845 isl_basic_map_free(like);
3846 isl_basic_set_free(bset);
3850 struct isl_basic_set *isl_basic_set_from_underlying_set(
3851 struct isl_basic_set *bset, struct isl_basic_set *like)
3853 return (struct isl_basic_set *)
3854 isl_basic_map_overlying_set(bset, (struct isl_basic_map *)like);
3857 struct isl_set *isl_set_from_underlying_set(
3858 struct isl_set *set, struct isl_basic_set *like)
3864 isl_assert(set->ctx, set->dim->n_out == isl_basic_set_total_dim(like),
3866 if (isl_dim_equal(set->dim, like->dim) && like->n_div == 0) {
3867 isl_basic_set_free(like);
3870 set = isl_set_cow(set);
3873 for (i = 0; i < set->n; ++i) {
3874 set->p[i] = isl_basic_set_from_underlying_set(set->p[i],
3875 isl_basic_set_copy(like));
3879 isl_dim_free(set->dim);
3880 set->dim = isl_dim_copy(like->dim);
3883 isl_basic_set_free(like);
3886 isl_basic_set_free(like);
3891 struct isl_set *isl_map_underlying_set(struct isl_map *map)
3895 map = isl_map_cow(map);
3898 map->dim = isl_dim_cow(map->dim);
3902 for (i = 1; i < map->n; ++i)
3903 isl_assert(map->ctx, map->p[0]->n_div == map->p[i]->n_div,
3905 for (i = 0; i < map->n; ++i) {
3906 map->p[i] = (struct isl_basic_map *)
3907 isl_basic_map_underlying_set(map->p[i]);
3912 map->dim = isl_dim_underlying(map->dim, 0);
3914 isl_dim_free(map->dim);
3915 map->dim = isl_dim_copy(map->p[0]->dim);
3919 return (struct isl_set *)map;
3925 struct isl_set *isl_set_to_underlying_set(struct isl_set *set)
3927 return (struct isl_set *)isl_map_underlying_set((struct isl_map *)set);
3930 __isl_give isl_basic_map *isl_basic_map_reset_dim(
3931 __isl_take isl_basic_map *bmap, __isl_take isl_dim *dim)
3933 bmap = isl_basic_map_cow(bmap);
3937 isl_dim_free(bmap->dim);
3940 bmap = isl_basic_map_finalize(bmap);
3944 isl_basic_map_free(bmap);
3949 __isl_give isl_basic_set *isl_basic_set_reset_dim(
3950 __isl_take isl_basic_set *bset, __isl_take isl_dim *dim)
3952 return (isl_basic_set *)isl_basic_map_reset_dim((isl_basic_map *)bset,
3956 __isl_give isl_map *isl_map_reset_dim(__isl_take isl_map *map,
3957 __isl_take isl_dim *dim)
3961 map = isl_map_cow(map);
3965 for (i = 0; i < map->n; ++i) {
3966 map->p[i] = isl_basic_map_reset_dim(map->p[i],
3971 isl_dim_free(map->dim);
3981 __isl_give isl_set *isl_set_reset_dim(__isl_take isl_set *set,
3982 __isl_take isl_dim *dim)
3984 return (struct isl_set *) isl_map_reset_dim((struct isl_map *)set, dim);
3987 struct isl_basic_set *isl_basic_map_domain(struct isl_basic_map *bmap)
3990 struct isl_basic_set *domain;
3996 dim = isl_dim_domain(isl_basic_map_get_dim(bmap));
3998 n_in = isl_basic_map_n_in(bmap);
3999 n_out = isl_basic_map_n_out(bmap);
4000 domain = isl_basic_set_from_basic_map(bmap);
4001 domain = isl_basic_set_project_out(domain, isl_dim_set, n_in, n_out);
4003 domain = isl_basic_set_reset_dim(domain, dim);
4008 int isl_basic_map_may_be_set(__isl_keep isl_basic_map *bmap)
4012 return isl_dim_may_be_set(bmap->dim);
4015 struct isl_basic_set *isl_basic_map_range(struct isl_basic_map *bmap)
4019 if (isl_basic_map_may_be_set(bmap))
4021 return isl_basic_map_domain(isl_basic_map_reverse(bmap));
4024 __isl_give isl_basic_map *isl_basic_map_domain_map(
4025 __isl_take isl_basic_map *bmap)
4029 isl_basic_map *domain;
4030 int nparam, n_in, n_out;
4033 nparam = isl_basic_map_dim(bmap, isl_dim_param);
4034 n_in = isl_basic_map_dim(bmap, isl_dim_in);
4035 n_out = isl_basic_map_dim(bmap, isl_dim_out);
4037 dim = isl_dim_from_range(isl_dim_domain(isl_basic_map_get_dim(bmap)));
4038 domain = isl_basic_map_universe(dim);
4040 bmap = isl_basic_map_from_domain(isl_basic_map_wrap(bmap));
4041 bmap = isl_basic_map_apply_range(bmap, domain);
4042 bmap = isl_basic_map_extend_constraints(bmap, n_in, 0);
4044 total = isl_basic_map_total_dim(bmap);
4046 for (i = 0; i < n_in; ++i) {
4047 k = isl_basic_map_alloc_equality(bmap);
4050 isl_seq_clr(bmap->eq[k], 1 + total);
4051 isl_int_set_si(bmap->eq[k][1 + nparam + i], -1);
4052 isl_int_set_si(bmap->eq[k][1 + nparam + n_in + n_out + i], 1);
4055 bmap = isl_basic_map_gauss(bmap, NULL);
4056 return isl_basic_map_finalize(bmap);
4058 isl_basic_map_free(bmap);
4062 __isl_give isl_basic_map *isl_basic_map_range_map(
4063 __isl_take isl_basic_map *bmap)
4067 isl_basic_map *range;
4068 int nparam, n_in, n_out;
4071 nparam = isl_basic_map_dim(bmap, isl_dim_param);
4072 n_in = isl_basic_map_dim(bmap, isl_dim_in);
4073 n_out = isl_basic_map_dim(bmap, isl_dim_out);
4075 dim = isl_dim_from_range(isl_dim_range(isl_basic_map_get_dim(bmap)));
4076 range = isl_basic_map_universe(dim);
4078 bmap = isl_basic_map_from_domain(isl_basic_map_wrap(bmap));
4079 bmap = isl_basic_map_apply_range(bmap, range);
4080 bmap = isl_basic_map_extend_constraints(bmap, n_out, 0);
4082 total = isl_basic_map_total_dim(bmap);
4084 for (i = 0; i < n_out; ++i) {
4085 k = isl_basic_map_alloc_equality(bmap);
4088 isl_seq_clr(bmap->eq[k], 1 + total);
4089 isl_int_set_si(bmap->eq[k][1 + nparam + n_in + i], -1);
4090 isl_int_set_si(bmap->eq[k][1 + nparam + n_in + n_out + i], 1);
4093 bmap = isl_basic_map_gauss(bmap, NULL);
4094 return isl_basic_map_finalize(bmap);
4096 isl_basic_map_free(bmap);
4100 int isl_map_may_be_set(__isl_keep isl_map *map)
4104 return isl_dim_may_be_set(map->dim);
4107 struct isl_set *isl_map_range(struct isl_map *map)
4110 struct isl_set *set;
4114 if (isl_map_may_be_set(map))
4115 return (isl_set *)map;
4117 map = isl_map_cow(map);
4121 set = (struct isl_set *) map;
4122 set->dim = isl_dim_drop_inputs(set->dim, 0, set->dim->n_in);
4125 for (i = 0; i < map->n; ++i) {
4126 set->p[i] = isl_basic_map_range(map->p[i]);
4130 ISL_F_CLR(set, ISL_MAP_DISJOINT);
4131 ISL_F_CLR(set, ISL_SET_NORMALIZED);
4138 __isl_give isl_map *isl_map_domain_map(__isl_take isl_map *map)
4141 isl_dim *domain_dim;
4143 map = isl_map_cow(map);
4147 domain_dim = isl_dim_from_range(isl_dim_domain(isl_map_get_dim(map)));
4148 map->dim = isl_dim_from_domain(isl_dim_wrap(map->dim));
4149 map->dim = isl_dim_join(map->dim, domain_dim);
4152 for (i = 0; i < map->n; ++i) {
4153 map->p[i] = isl_basic_map_domain_map(map->p[i]);
4157 ISL_F_CLR(map, ISL_MAP_DISJOINT);
4158 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4165 __isl_give isl_map *isl_map_range_map(__isl_take isl_map *map)
4170 map = isl_map_cow(map);
4174 range_dim = isl_dim_range(isl_map_get_dim(map));
4175 map->dim = isl_dim_from_domain(isl_dim_wrap(map->dim));
4176 map->dim = isl_dim_join(map->dim, range_dim);
4179 for (i = 0; i < map->n; ++i) {
4180 map->p[i] = isl_basic_map_range_map(map->p[i]);
4184 ISL_F_CLR(map, ISL_MAP_DISJOINT);
4185 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4192 struct isl_map *isl_map_from_set(struct isl_set *set, struct isl_dim *dim)
4195 struct isl_map *map = NULL;
4197 set = isl_set_cow(set);
4200 isl_assert(set->ctx, isl_dim_compatible(set->dim, dim), goto error);
4201 map = (struct isl_map *)set;
4202 for (i = 0; i < set->n; ++i) {
4203 map->p[i] = isl_basic_map_from_basic_set(
4204 set->p[i], isl_dim_copy(dim));
4208 isl_dim_free(map->dim);
4217 __isl_give isl_basic_map *isl_basic_map_from_domain(
4218 __isl_take isl_basic_set *bset)
4220 return isl_basic_map_reverse(isl_basic_map_from_range(bset));
4223 __isl_give isl_basic_map *isl_basic_map_from_range(
4224 __isl_take isl_basic_set *bset)
4226 return (isl_basic_map *)bset;
4229 struct isl_map *isl_map_from_range(struct isl_set *set)
4231 return (struct isl_map *)set;
4234 __isl_give isl_map *isl_map_from_domain(__isl_take isl_set *set)
4236 return isl_map_reverse(isl_map_from_range(set));
4239 __isl_give isl_basic_map *isl_basic_map_from_domain_and_range(
4240 __isl_take isl_basic_set *domain, __isl_take isl_basic_set *range)
4242 return isl_basic_map_apply_range(isl_basic_map_from_domain(domain),
4243 isl_basic_map_from_range(range));
4246 __isl_give isl_map *isl_map_from_domain_and_range(__isl_take isl_set *domain,
4247 __isl_take isl_set *range)
4249 return isl_map_apply_range(isl_map_from_domain(domain),
4250 isl_map_from_range(range));
4253 struct isl_set *isl_set_from_map(struct isl_map *map)
4256 struct isl_set *set = NULL;
4260 map = isl_map_cow(map);
4263 map->dim = isl_dim_as_set_dim(map->dim);
4266 set = (struct isl_set *)map;
4267 for (i = 0; i < map->n; ++i) {
4268 set->p[i] = isl_basic_set_from_basic_map(map->p[i]);
4278 struct isl_map *isl_map_alloc_dim(struct isl_dim *dim, int n, unsigned flags)
4280 struct isl_map *map;
4284 isl_assert(dim->ctx, n >= 0, return NULL);
4285 map = isl_alloc(dim->ctx, struct isl_map,
4286 sizeof(struct isl_map) +
4287 (n - 1) * sizeof(struct isl_basic_map *));
4291 map->ctx = dim->ctx;
4292 isl_ctx_ref(map->ctx);
4304 struct isl_map *isl_map_alloc(struct isl_ctx *ctx,
4305 unsigned nparam, unsigned in, unsigned out, int n,
4308 struct isl_map *map;
4309 struct isl_dim *dims;
4311 dims = isl_dim_alloc(ctx, nparam, in, out);
4315 map = isl_map_alloc_dim(dims, n, flags);
4319 struct isl_basic_map *isl_basic_map_empty(struct isl_dim *dim)
4321 struct isl_basic_map *bmap;
4322 bmap = isl_basic_map_alloc_dim(dim, 0, 1, 0);
4323 bmap = isl_basic_map_set_to_empty(bmap);
4327 struct isl_basic_set *isl_basic_set_empty(struct isl_dim *dim)
4329 struct isl_basic_set *bset;
4330 bset = isl_basic_set_alloc_dim(dim, 0, 1, 0);
4331 bset = isl_basic_set_set_to_empty(bset);
4335 struct isl_basic_map *isl_basic_map_empty_like(struct isl_basic_map *model)
4337 struct isl_basic_map *bmap;
4340 bmap = isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
4341 bmap = isl_basic_map_set_to_empty(bmap);
4345 struct isl_basic_map *isl_basic_map_empty_like_map(struct isl_map *model)
4347 struct isl_basic_map *bmap;
4350 bmap = isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
4351 bmap = isl_basic_map_set_to_empty(bmap);
4355 struct isl_basic_set *isl_basic_set_empty_like(struct isl_basic_set *model)
4357 struct isl_basic_set *bset;
4360 bset = isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
4361 bset = isl_basic_set_set_to_empty(bset);
4365 struct isl_basic_map *isl_basic_map_universe(struct isl_dim *dim)
4367 struct isl_basic_map *bmap;
4368 bmap = isl_basic_map_alloc_dim(dim, 0, 0, 0);
4369 bmap = isl_basic_map_finalize(bmap);
4373 struct isl_basic_set *isl_basic_set_universe(struct isl_dim *dim)
4375 struct isl_basic_set *bset;
4376 bset = isl_basic_set_alloc_dim(dim, 0, 0, 0);
4377 bset = isl_basic_set_finalize(bset);
4381 __isl_give isl_basic_map *isl_basic_map_nat_universe(__isl_take isl_dim *dim)
4384 unsigned total = isl_dim_total(dim);
4385 isl_basic_map *bmap;
4387 bmap= isl_basic_map_alloc_dim(dim, 0, 0, total);
4388 for (i = 0; i < total; ++i) {
4389 int k = isl_basic_map_alloc_inequality(bmap);
4392 isl_seq_clr(bmap->ineq[k], 1 + total);
4393 isl_int_set_si(bmap->ineq[k][1 + i], 1);
4397 isl_basic_map_free(bmap);
4401 __isl_give isl_basic_set *isl_basic_set_nat_universe(__isl_take isl_dim *dim)
4403 return isl_basic_map_nat_universe(dim);
4406 __isl_give isl_map *isl_map_nat_universe(__isl_take isl_dim *dim)
4408 return isl_map_from_basic_map(isl_basic_map_nat_universe(dim));
4411 __isl_give isl_set *isl_set_nat_universe(__isl_take isl_dim *dim)
4413 return isl_map_nat_universe(dim);
4416 __isl_give isl_basic_map *isl_basic_map_universe_like(
4417 __isl_keep isl_basic_map *model)
4421 return isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
4424 struct isl_basic_set *isl_basic_set_universe_like(struct isl_basic_set *model)
4428 return isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
4431 __isl_give isl_basic_set *isl_basic_set_universe_like_set(
4432 __isl_keep isl_set *model)
4436 return isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
4439 struct isl_map *isl_map_empty(struct isl_dim *dim)
4441 return isl_map_alloc_dim(dim, 0, ISL_MAP_DISJOINT);
4444 struct isl_map *isl_map_empty_like(struct isl_map *model)
4448 return isl_map_alloc_dim(isl_dim_copy(model->dim), 0, ISL_MAP_DISJOINT);
4451 struct isl_map *isl_map_empty_like_basic_map(struct isl_basic_map *model)
4455 return isl_map_alloc_dim(isl_dim_copy(model->dim), 0, ISL_MAP_DISJOINT);
4458 struct isl_set *isl_set_empty(struct isl_dim *dim)
4460 return isl_set_alloc_dim(dim, 0, ISL_MAP_DISJOINT);
4463 struct isl_set *isl_set_empty_like(struct isl_set *model)
4467 return isl_set_empty(isl_dim_copy(model->dim));
4470 struct isl_map *isl_map_universe(struct isl_dim *dim)
4472 struct isl_map *map;
4475 map = isl_map_alloc_dim(isl_dim_copy(dim), 1, ISL_MAP_DISJOINT);
4476 map = isl_map_add_basic_map(map, isl_basic_map_universe(dim));
4480 struct isl_set *isl_set_universe(struct isl_dim *dim)
4482 struct isl_set *set;
4485 set = isl_set_alloc_dim(isl_dim_copy(dim), 1, ISL_MAP_DISJOINT);
4486 set = isl_set_add_basic_set(set, isl_basic_set_universe(dim));
4490 __isl_give isl_set *isl_set_universe_like(__isl_keep isl_set *model)
4494 return isl_set_universe(isl_dim_copy(model->dim));
4497 struct isl_map *isl_map_dup(struct isl_map *map)
4500 struct isl_map *dup;
4504 dup = isl_map_alloc_dim(isl_dim_copy(map->dim), map->n, map->flags);
4505 for (i = 0; i < map->n; ++i)
4506 dup = isl_map_add_basic_map(dup, isl_basic_map_copy(map->p[i]));
4510 __isl_give isl_map *isl_map_add_basic_map(__isl_take isl_map *map,
4511 __isl_take isl_basic_map *bmap)
4515 if (isl_basic_map_plain_is_empty(bmap)) {
4516 isl_basic_map_free(bmap);
4519 isl_assert(map->ctx, isl_dim_equal(map->dim, bmap->dim), goto error);
4520 isl_assert(map->ctx, map->n < map->size, goto error);
4521 map->p[map->n] = bmap;
4523 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4529 isl_basic_map_free(bmap);
4533 void isl_map_free(struct isl_map *map)
4543 isl_ctx_deref(map->ctx);
4544 for (i = 0; i < map->n; ++i)
4545 isl_basic_map_free(map->p[i]);
4546 isl_dim_free(map->dim);
4550 struct isl_map *isl_map_extend(struct isl_map *base,
4551 unsigned nparam, unsigned n_in, unsigned n_out)
4555 base = isl_map_cow(base);
4559 base->dim = isl_dim_extend(base->dim, nparam, n_in, n_out);
4562 for (i = 0; i < base->n; ++i) {
4563 base->p[i] = isl_basic_map_extend_dim(base->p[i],
4564 isl_dim_copy(base->dim), 0, 0, 0);
4574 struct isl_set *isl_set_extend(struct isl_set *base,
4575 unsigned nparam, unsigned dim)
4577 return (struct isl_set *)isl_map_extend((struct isl_map *)base,
4581 static struct isl_basic_map *isl_basic_map_fix_pos_si(
4582 struct isl_basic_map *bmap, unsigned pos, int value)
4586 bmap = isl_basic_map_cow(bmap);
4587 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
4588 j = isl_basic_map_alloc_equality(bmap);
4591 isl_seq_clr(bmap->eq[j] + 1, isl_basic_map_total_dim(bmap));
4592 isl_int_set_si(bmap->eq[j][pos], -1);
4593 isl_int_set_si(bmap->eq[j][0], value);
4594 bmap = isl_basic_map_simplify(bmap);
4595 return isl_basic_map_finalize(bmap);
4597 isl_basic_map_free(bmap);
4601 static __isl_give isl_basic_map *isl_basic_map_fix_pos(
4602 __isl_take isl_basic_map *bmap, unsigned pos, isl_int value)
4606 bmap = isl_basic_map_cow(bmap);
4607 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
4608 j = isl_basic_map_alloc_equality(bmap);
4611 isl_seq_clr(bmap->eq[j] + 1, isl_basic_map_total_dim(bmap));
4612 isl_int_set_si(bmap->eq[j][pos], -1);
4613 isl_int_set(bmap->eq[j][0], value);
4614 bmap = isl_basic_map_simplify(bmap);
4615 return isl_basic_map_finalize(bmap);
4617 isl_basic_map_free(bmap);
4621 struct isl_basic_map *isl_basic_map_fix_si(struct isl_basic_map *bmap,
4622 enum isl_dim_type type, unsigned pos, int value)
4626 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
4627 return isl_basic_map_fix_pos_si(bmap,
4628 isl_basic_map_offset(bmap, type) + pos, value);
4630 isl_basic_map_free(bmap);
4634 __isl_give isl_basic_map *isl_basic_map_fix(__isl_take isl_basic_map *bmap,
4635 enum isl_dim_type type, unsigned pos, isl_int value)
4639 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
4640 return isl_basic_map_fix_pos(bmap,
4641 isl_basic_map_offset(bmap, type) + pos, value);
4643 isl_basic_map_free(bmap);
4647 struct isl_basic_set *isl_basic_set_fix_si(struct isl_basic_set *bset,
4648 enum isl_dim_type type, unsigned pos, int value)
4650 return (struct isl_basic_set *)
4651 isl_basic_map_fix_si((struct isl_basic_map *)bset,
4655 __isl_give isl_basic_set *isl_basic_set_fix(__isl_take isl_basic_set *bset,
4656 enum isl_dim_type type, unsigned pos, isl_int value)
4658 return (struct isl_basic_set *)
4659 isl_basic_map_fix((struct isl_basic_map *)bset,
4663 struct isl_basic_map *isl_basic_map_fix_input_si(struct isl_basic_map *bmap,
4664 unsigned input, int value)
4666 return isl_basic_map_fix_si(bmap, isl_dim_in, input, value);
4669 struct isl_basic_set *isl_basic_set_fix_dim_si(struct isl_basic_set *bset,
4670 unsigned dim, int value)
4672 return (struct isl_basic_set *)
4673 isl_basic_map_fix_si((struct isl_basic_map *)bset,
4674 isl_dim_set, dim, value);
4677 struct isl_map *isl_map_fix_si(struct isl_map *map,
4678 enum isl_dim_type type, unsigned pos, int value)
4682 map = isl_map_cow(map);
4686 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
4687 for (i = 0; i < map->n; ++i) {
4688 map->p[i] = isl_basic_map_fix_si(map->p[i], type, pos, value);
4692 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4699 __isl_give isl_set *isl_set_fix_si(__isl_take isl_set *set,
4700 enum isl_dim_type type, unsigned pos, int value)
4702 return (struct isl_set *)
4703 isl_map_fix_si((struct isl_map *)set, type, pos, value);
4706 __isl_give isl_map *isl_map_fix(__isl_take isl_map *map,
4707 enum isl_dim_type type, unsigned pos, isl_int value)
4711 map = isl_map_cow(map);
4715 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
4716 for (i = 0; i < map->n; ++i) {
4717 map->p[i] = isl_basic_map_fix(map->p[i], type, pos, value);
4721 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4728 __isl_give isl_set *isl_set_fix(__isl_take isl_set *set,
4729 enum isl_dim_type type, unsigned pos, isl_int value)
4731 return (struct isl_set *)isl_map_fix((isl_map *)set, type, pos, value);
4734 struct isl_map *isl_map_fix_input_si(struct isl_map *map,
4735 unsigned input, int value)
4737 return isl_map_fix_si(map, isl_dim_in, input, value);
4740 struct isl_set *isl_set_fix_dim_si(struct isl_set *set, unsigned dim, int value)
4742 return (struct isl_set *)
4743 isl_map_fix_si((struct isl_map *)set, isl_dim_set, dim, value);
4746 __isl_give isl_basic_map *isl_basic_map_lower_bound_si(
4747 __isl_take isl_basic_map *bmap,
4748 enum isl_dim_type type, unsigned pos, int value)
4754 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
4755 pos += isl_basic_map_offset(bmap, type);
4756 bmap = isl_basic_map_cow(bmap);
4757 bmap = isl_basic_map_extend_constraints(bmap, 0, 1);
4758 j = isl_basic_map_alloc_inequality(bmap);
4761 isl_seq_clr(bmap->ineq[j], 1 + isl_basic_map_total_dim(bmap));
4762 isl_int_set_si(bmap->ineq[j][pos], 1);
4763 isl_int_set_si(bmap->ineq[j][0], -value);
4764 bmap = isl_basic_map_simplify(bmap);
4765 return isl_basic_map_finalize(bmap);
4767 isl_basic_map_free(bmap);
4771 struct isl_basic_set *isl_basic_set_lower_bound_dim(struct isl_basic_set *bset,
4772 unsigned dim, isl_int value)
4776 bset = isl_basic_set_cow(bset);
4777 bset = isl_basic_set_extend_constraints(bset, 0, 1);
4778 j = isl_basic_set_alloc_inequality(bset);
4781 isl_seq_clr(bset->ineq[j], 1 + isl_basic_set_total_dim(bset));
4782 isl_int_set_si(bset->ineq[j][1 + isl_basic_set_n_param(bset) + dim], 1);
4783 isl_int_neg(bset->ineq[j][0], value);
4784 bset = isl_basic_set_simplify(bset);
4785 return isl_basic_set_finalize(bset);
4787 isl_basic_set_free(bset);
4791 __isl_give isl_map *isl_map_lower_bound_si(__isl_take isl_map *map,
4792 enum isl_dim_type type, unsigned pos, int value)
4796 map = isl_map_cow(map);
4800 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
4801 for (i = 0; i < map->n; ++i) {
4802 map->p[i] = isl_basic_map_lower_bound_si(map->p[i],
4807 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4814 __isl_give isl_set *isl_set_lower_bound_si(__isl_take isl_set *set,
4815 enum isl_dim_type type, unsigned pos, int value)
4817 return (struct isl_set *)
4818 isl_map_lower_bound_si((struct isl_map *)set, type, pos, value);
4821 struct isl_set *isl_set_lower_bound_dim(struct isl_set *set, unsigned dim,
4826 set = isl_set_cow(set);
4830 isl_assert(set->ctx, dim < isl_set_n_dim(set), goto error);
4831 for (i = 0; i < set->n; ++i) {
4832 set->p[i] = isl_basic_set_lower_bound_dim(set->p[i], dim, value);
4842 struct isl_map *isl_map_reverse(struct isl_map *map)
4846 map = isl_map_cow(map);
4850 map->dim = isl_dim_reverse(map->dim);
4853 for (i = 0; i < map->n; ++i) {
4854 map->p[i] = isl_basic_map_reverse(map->p[i]);
4858 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4865 static struct isl_map *isl_basic_map_partial_lexopt(
4866 struct isl_basic_map *bmap, struct isl_basic_set *dom,
4867 struct isl_set **empty, int max)
4871 if (bmap->ctx->opt->pip == ISL_PIP_PIP)
4872 return isl_pip_basic_map_lexopt(bmap, dom, empty, max);
4874 return isl_tab_basic_map_partial_lexopt(bmap, dom, empty, max);
4876 isl_basic_map_free(bmap);
4877 isl_basic_set_free(dom);
4883 struct isl_map *isl_basic_map_partial_lexmax(
4884 struct isl_basic_map *bmap, struct isl_basic_set *dom,
4885 struct isl_set **empty)
4887 return isl_basic_map_partial_lexopt(bmap, dom, empty, 1);
4890 struct isl_map *isl_basic_map_partial_lexmin(
4891 struct isl_basic_map *bmap, struct isl_basic_set *dom,
4892 struct isl_set **empty)
4894 return isl_basic_map_partial_lexopt(bmap, dom, empty, 0);
4897 struct isl_set *isl_basic_set_partial_lexmin(
4898 struct isl_basic_set *bset, struct isl_basic_set *dom,
4899 struct isl_set **empty)
4901 return (struct isl_set *)
4902 isl_basic_map_partial_lexmin((struct isl_basic_map *)bset,
4906 struct isl_set *isl_basic_set_partial_lexmax(
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_lexmax((struct isl_basic_map *)bset,
4915 /* Given a basic map "bmap", compute the lexicographically minimal
4916 * (or maximal) image element for each domain element in dom.
4917 * Set *empty to those elements in dom that do not have an image element.
4919 * We first make sure the basic sets in dom are disjoint and then
4920 * simply collect the results over each of the basic sets separately.
4921 * We could probably improve the efficiency a bit by moving the union
4922 * domain down into the parametric integer programming.
4924 static __isl_give isl_map *basic_map_partial_lexopt(
4925 __isl_take isl_basic_map *bmap, __isl_take isl_set *dom,
4926 __isl_give isl_set **empty, int max)
4929 struct isl_map *res;
4931 dom = isl_set_make_disjoint(dom);
4935 if (isl_set_plain_is_empty(dom)) {
4936 res = isl_map_empty_like_basic_map(bmap);
4937 *empty = isl_set_empty_like(dom);
4939 isl_basic_map_free(bmap);
4943 res = isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap),
4944 isl_basic_set_copy(dom->p[0]), empty, max);
4946 for (i = 1; i < dom->n; ++i) {
4947 struct isl_map *res_i;
4948 struct isl_set *empty_i;
4950 res_i = isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap),
4951 isl_basic_set_copy(dom->p[i]), &empty_i, max);
4953 res = isl_map_union_disjoint(res, res_i);
4954 *empty = isl_set_union_disjoint(*empty, empty_i);
4958 isl_basic_map_free(bmap);
4963 isl_basic_map_free(bmap);
4967 /* Given a map "map", compute the lexicographically minimal
4968 * (or maximal) image element for each domain element in dom.
4969 * Set *empty to those elements in dom that do not have an image element.
4971 * We first compute the lexicographically minimal or maximal element
4972 * in the first basic map. This results in a partial solution "res"
4973 * and a subset "todo" of dom that still need to be handled.
4974 * We then consider each of the remaining maps in "map" and successively
4975 * improve both "res" and "todo".
4977 * Let res^k and todo^k be the results after k steps and let i = k + 1.
4978 * Assume we are computing the lexicographical maximum.
4979 * We first compute the lexicographically maximal element in basic map i.
4980 * This results in a partial solution res_i and a subset todo_i.
4981 * Then we combine these results with those obtain for the first k basic maps
4982 * to obtain a result that is valid for the first k+1 basic maps.
4983 * In particular, the set where there is no solution is the set where
4984 * there is no solution for the first k basic maps and also no solution
4985 * for the ith basic map, i.e.,
4987 * todo^i = todo^k * todo_i
4989 * On dom(res^k) * dom(res_i), we need to pick the larger of the two
4990 * solutions, arbitrarily breaking ties in favor of res^k.
4991 * That is, when res^k(a) >= res_i(a), we pick res^k and
4992 * when res^k(a) < res_i(a), we pick res_i. (Here, ">=" and "<" denote
4993 * the lexicographic order.)
4994 * In practice, we compute
4996 * res^k * (res_i . "<=")
5000 * res_i * (res^k . "<")
5002 * Finally, we consider the symmetric difference of dom(res^k) and dom(res_i),
5003 * where only one of res^k and res_i provides a solution and we simply pick
5010 * Note that we only compute these intersections when dom(res^k) intersects
5011 * dom(res_i). Otherwise, the only effect of these intersections is to
5012 * potentially break up res^k and res_i into smaller pieces.
5013 * We want to avoid such splintering as much as possible.
5014 * In fact, an earlier implementation of this function would look for
5015 * better results in the domain of res^k and for extra results in todo^k,
5016 * but this would always result in a splintering according to todo^k,
5017 * even when the domain of basic map i is disjoint from the domains of
5018 * the previous basic maps.
5020 static __isl_give isl_map *isl_map_partial_lexopt(
5021 __isl_take isl_map *map, __isl_take isl_set *dom,
5022 __isl_give isl_set **empty, int max)
5025 struct isl_map *res;
5026 struct isl_set *todo;
5031 if (isl_map_plain_is_empty(map)) {
5039 res = basic_map_partial_lexopt(isl_basic_map_copy(map->p[0]),
5040 isl_set_copy(dom), &todo, max);
5042 for (i = 1; i < map->n; ++i) {
5046 isl_dim *dim = isl_dim_range(isl_map_get_dim(res));
5048 res_i = basic_map_partial_lexopt(isl_basic_map_copy(map->p[i]),
5049 isl_set_copy(dom), &todo_i, max);
5052 lt = isl_map_lex_lt(isl_dim_copy(dim));
5053 le = isl_map_lex_le(dim);
5055 lt = isl_map_lex_gt(isl_dim_copy(dim));
5056 le = isl_map_lex_ge(dim);
5058 lt = isl_map_apply_range(isl_map_copy(res), lt);
5059 lt = isl_map_intersect(lt, isl_map_copy(res_i));
5060 le = isl_map_apply_range(isl_map_copy(res_i), le);
5061 le = isl_map_intersect(le, isl_map_copy(res));
5063 if (!isl_map_is_empty(lt) || !isl_map_is_empty(le)) {
5064 res = isl_map_intersect_domain(res,
5065 isl_set_copy(todo_i));
5066 res_i = isl_map_intersect_domain(res_i,
5067 isl_set_copy(todo));
5070 res = isl_map_union_disjoint(res, res_i);
5071 res = isl_map_union_disjoint(res, lt);
5072 res = isl_map_union_disjoint(res, le);
5074 todo = isl_set_intersect(todo, todo_i);
5094 __isl_give isl_map *isl_map_partial_lexmax(
5095 __isl_take isl_map *map, __isl_take isl_set *dom,
5096 __isl_give isl_set **empty)
5098 return isl_map_partial_lexopt(map, dom, empty, 1);
5101 __isl_give isl_map *isl_map_partial_lexmin(
5102 __isl_take isl_map *map, __isl_take isl_set *dom,
5103 __isl_give isl_set **empty)
5105 return isl_map_partial_lexopt(map, dom, empty, 0);
5108 __isl_give isl_set *isl_set_partial_lexmin(
5109 __isl_take isl_set *set, __isl_take isl_set *dom,
5110 __isl_give isl_set **empty)
5112 return (struct isl_set *)
5113 isl_map_partial_lexmin((struct isl_map *)set,
5117 __isl_give isl_set *isl_set_partial_lexmax(
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_lexmax((struct isl_map *)set,
5126 __isl_give isl_map *isl_basic_map_lexopt(__isl_take isl_basic_map *bmap, int max)
5128 struct isl_basic_set *dom = NULL;
5129 struct isl_dim *dom_dim;
5133 dom_dim = isl_dim_domain(isl_dim_copy(bmap->dim));
5134 dom = isl_basic_set_universe(dom_dim);
5135 return isl_basic_map_partial_lexopt(bmap, dom, NULL, max);
5137 isl_basic_map_free(bmap);
5141 __isl_give isl_map *isl_basic_map_lexmin(__isl_take isl_basic_map *bmap)
5143 return isl_basic_map_lexopt(bmap, 0);
5146 __isl_give isl_map *isl_basic_map_lexmax(__isl_take isl_basic_map *bmap)
5148 return isl_basic_map_lexopt(bmap, 1);
5151 __isl_give isl_set *isl_basic_set_lexmin(__isl_take isl_basic_set *bset)
5153 return (isl_set *)isl_basic_map_lexmin((isl_basic_map *)bset);
5156 __isl_give isl_set *isl_basic_set_lexmax(__isl_take isl_basic_set *bset)
5158 return (isl_set *)isl_basic_map_lexmax((isl_basic_map *)bset);
5161 __isl_give isl_map *isl_map_lexopt(__isl_take isl_map *map, int max)
5163 struct isl_set *dom = NULL;
5164 struct isl_dim *dom_dim;
5168 dom_dim = isl_dim_domain(isl_dim_copy(map->dim));
5169 dom = isl_set_universe(dom_dim);
5170 return isl_map_partial_lexopt(map, dom, NULL, max);
5176 __isl_give isl_map *isl_map_lexmin(__isl_take isl_map *map)
5178 return isl_map_lexopt(map, 0);
5181 __isl_give isl_map *isl_map_lexmax(__isl_take isl_map *map)
5183 return isl_map_lexopt(map, 1);
5186 __isl_give isl_set *isl_set_lexmin(__isl_take isl_set *set)
5188 return (isl_set *)isl_map_lexmin((isl_map *)set);
5191 __isl_give isl_set *isl_set_lexmax(__isl_take isl_set *set)
5193 return (isl_set *)isl_map_lexmax((isl_map *)set);
5196 /* Construct a map that equates the two given dimensions in the given space.
5198 static __isl_give isl_map *equate(__isl_take isl_dim *dim,
5199 enum isl_dim_type src_type, int src_pos,
5200 enum isl_dim_type dst_type, int dst_pos)
5202 isl_basic_map *bmap;
5205 bmap = isl_basic_map_alloc_dim(dim, 0, 1, 0);
5206 k = isl_basic_map_alloc_equality(bmap);
5209 isl_seq_clr(bmap->eq[k], 1 + isl_basic_map_total_dim(bmap));
5210 src_pos += isl_basic_map_offset(bmap, src_type);
5211 dst_pos += isl_basic_map_offset(bmap, dst_type);
5212 isl_int_set_si(bmap->eq[k][src_pos], 1);
5213 isl_int_set_si(bmap->eq[k][dst_pos], -1);
5215 return isl_map_from_basic_map(bmap);
5217 isl_basic_map_free(bmap);
5221 /* Extract the first and only affine expression from list
5222 * and then add it to *pwaff with the given dom.
5223 * This domain is known to be disjoint from other domains
5224 * because of the way isl_basic_set_foreach_lexmax works.
5226 static int update_dim_max(__isl_take isl_basic_set *dom,
5227 __isl_take isl_aff_list *list, void *user)
5229 isl_ctx *ctx = isl_basic_set_get_ctx(dom);
5231 isl_pw_aff **pwaff = user;
5232 isl_pw_aff *pwaff_i;
5234 if (isl_aff_list_n_aff(list) != 1)
5235 isl_die(ctx, isl_error_internal,
5236 "expecting single element list", goto error);
5238 aff = isl_aff_list_get_aff(list, 0);
5239 pwaff_i = isl_pw_aff_alloc(isl_set_from_basic_set(dom), aff);
5241 *pwaff = isl_pw_aff_add_disjoint(*pwaff, pwaff_i);
5243 isl_aff_list_free(list);
5247 isl_basic_set_free(dom);
5248 isl_aff_list_free(list);
5252 /* Given a one-dimensional basic set, compute the maximum of that
5253 * dimension as an isl_pw_aff.
5255 * The isl_pw_aff is constructed by having isl_basic_set_foreach_lexmax
5256 * call update_dim_max on each leaf of the result.
5258 static __isl_give isl_pw_aff *basic_set_dim_max(__isl_keep isl_basic_set *bset)
5260 isl_dim *dim = isl_basic_set_get_dim(bset);
5264 dim = isl_dim_domain(isl_dim_from_range(dim));
5265 pwaff = isl_pw_aff_empty(dim);
5267 r = isl_basic_set_foreach_lexmax(bset, &update_dim_max, &pwaff);
5269 return isl_pw_aff_free(pwaff);
5274 /* Compute the maximum of the given set dimension as a function of the
5275 * parameters, but independently of the other set dimensions.
5277 * We first project the set onto the given dimension and then compute
5278 * the "lexicographic" maximum in each basic set, combining the results
5279 * using isl_pw_aff_union_max.
5281 __isl_give isl_pw_aff *isl_set_dim_max(__isl_take isl_set *set, int pos)
5287 map = isl_map_from_domain(set);
5288 map = isl_map_add_dims(map, isl_dim_out, 1);
5289 map = isl_map_intersect(map,
5290 equate(isl_map_get_dim(map), isl_dim_in, pos,
5292 set = isl_map_range(map);
5297 isl_dim *dim = isl_set_get_dim(set);
5298 dim = isl_dim_domain(isl_dim_from_range(dim));
5300 return isl_pw_aff_empty(dim);
5303 pwaff = basic_set_dim_max(set->p[0]);
5304 for (i = 1; i < set->n; ++i) {
5305 isl_pw_aff *pwaff_i;
5307 pwaff_i = basic_set_dim_max(set->p[i]);
5308 pwaff = isl_pw_aff_union_max(pwaff, pwaff_i);
5316 /* Apply a preimage specified by "mat" on the parameters of "bset".
5317 * bset is assumed to have only parameters and divs.
5319 static struct isl_basic_set *basic_set_parameter_preimage(
5320 struct isl_basic_set *bset, struct isl_mat *mat)
5327 bset->dim = isl_dim_cow(bset->dim);
5331 nparam = isl_basic_set_dim(bset, isl_dim_param);
5333 isl_assert(bset->ctx, mat->n_row == 1 + nparam, goto error);
5335 bset->dim->nparam = 0;
5336 bset->dim->n_out = nparam;
5337 bset = isl_basic_set_preimage(bset, mat);
5339 bset->dim->nparam = bset->dim->n_out;
5340 bset->dim->n_out = 0;
5345 isl_basic_set_free(bset);
5349 /* Apply a preimage specified by "mat" on the parameters of "set".
5350 * set is assumed to have only parameters and divs.
5352 static struct isl_set *set_parameter_preimage(
5353 struct isl_set *set, struct isl_mat *mat)
5355 struct isl_dim *dim = NULL;
5361 dim = isl_dim_copy(set->dim);
5362 dim = isl_dim_cow(dim);
5366 nparam = isl_set_dim(set, isl_dim_param);
5368 isl_assert(set->ctx, mat->n_row == 1 + nparam, goto error);
5371 dim->n_out = nparam;
5372 isl_set_reset_dim(set, dim);
5373 set = isl_set_preimage(set, mat);
5376 dim = isl_dim_copy(set->dim);
5377 dim = isl_dim_cow(dim);
5380 dim->nparam = dim->n_out;
5382 isl_set_reset_dim(set, dim);
5392 /* Intersect the basic set "bset" with the affine space specified by the
5393 * equalities in "eq".
5395 static struct isl_basic_set *basic_set_append_equalities(
5396 struct isl_basic_set *bset, struct isl_mat *eq)
5404 bset = isl_basic_set_extend_dim(bset, isl_dim_copy(bset->dim), 0,
5409 len = 1 + isl_dim_total(bset->dim) + bset->extra;
5410 for (i = 0; i < eq->n_row; ++i) {
5411 k = isl_basic_set_alloc_equality(bset);
5414 isl_seq_cpy(bset->eq[k], eq->row[i], eq->n_col);
5415 isl_seq_clr(bset->eq[k] + eq->n_col, len - eq->n_col);
5419 bset = isl_basic_set_gauss(bset, NULL);
5420 bset = isl_basic_set_finalize(bset);
5425 isl_basic_set_free(bset);
5429 /* Intersect the set "set" with the affine space specified by the
5430 * equalities in "eq".
5432 static struct isl_set *set_append_equalities(struct isl_set *set,
5440 for (i = 0; i < set->n; ++i) {
5441 set->p[i] = basic_set_append_equalities(set->p[i],
5454 /* Project the given basic set onto its parameter domain, possibly introducing
5455 * new, explicit, existential variables in the constraints.
5456 * The input has parameters and (possibly implicit) existential variables.
5457 * The output has the same parameters, but only
5458 * explicit existentially quantified variables.
5460 * The actual projection is performed by pip, but pip doesn't seem
5461 * to like equalities very much, so we first remove the equalities
5462 * among the parameters by performing a variable compression on
5463 * the parameters. Afterward, an inverse transformation is performed
5464 * and the equalities among the parameters are inserted back in.
5466 static struct isl_set *parameter_compute_divs(struct isl_basic_set *bset)
5470 struct isl_mat *T, *T2;
5471 struct isl_set *set;
5472 unsigned nparam, n_div;
5474 bset = isl_basic_set_cow(bset);
5478 if (bset->n_eq == 0)
5479 return isl_basic_set_lexmin(bset);
5481 isl_basic_set_gauss(bset, NULL);
5483 nparam = isl_basic_set_dim(bset, isl_dim_param);
5484 n_div = isl_basic_set_dim(bset, isl_dim_div);
5486 for (i = 0, j = n_div - 1; i < bset->n_eq && j >= 0; --j) {
5487 if (!isl_int_is_zero(bset->eq[i][1 + nparam + j]))
5490 if (i == bset->n_eq)
5491 return isl_basic_set_lexmin(bset);
5493 eq = isl_mat_sub_alloc6(bset->ctx, bset->eq, i, bset->n_eq - i,
5495 eq = isl_mat_cow(eq);
5496 T = isl_mat_variable_compression(isl_mat_copy(eq), &T2);
5497 if (T && T->n_col == 0) {
5501 bset = isl_basic_set_set_to_empty(bset);
5502 return isl_set_from_basic_set(bset);
5504 bset = basic_set_parameter_preimage(bset, T);
5506 set = isl_basic_set_lexmin(bset);
5507 set = set_parameter_preimage(set, T2);
5508 set = set_append_equalities(set, eq);
5512 /* Compute an explicit representation for all the existentially
5513 * quantified variables.
5514 * The input and output dimensions are first turned into parameters.
5515 * compute_divs then returns a map with the same parameters and
5516 * no input or output dimensions and the dimension specification
5517 * is reset to that of the input.
5519 static struct isl_map *compute_divs(struct isl_basic_map *bmap)
5521 struct isl_basic_set *bset;
5522 struct isl_set *set;
5523 struct isl_map *map;
5524 struct isl_dim *dim, *orig_dim = NULL;
5529 bmap = isl_basic_map_cow(bmap);
5533 nparam = isl_basic_map_dim(bmap, isl_dim_param);
5534 n_in = isl_basic_map_dim(bmap, isl_dim_in);
5535 n_out = isl_basic_map_dim(bmap, isl_dim_out);
5536 dim = isl_dim_set_alloc(bmap->ctx, nparam + n_in + n_out, 0);
5540 orig_dim = bmap->dim;
5542 bset = (struct isl_basic_set *)bmap;
5544 set = parameter_compute_divs(bset);
5545 map = (struct isl_map *)set;
5546 map = isl_map_reset_dim(map, orig_dim);
5550 isl_basic_map_free(bmap);
5554 int isl_basic_map_divs_known(__isl_keep isl_basic_map *bmap)
5562 off = isl_dim_total(bmap->dim);
5563 for (i = 0; i < bmap->n_div; ++i) {
5564 if (isl_int_is_zero(bmap->div[i][0]))
5566 isl_assert(bmap->ctx, isl_int_is_zero(bmap->div[i][1+1+off+i]),
5572 static int map_divs_known(__isl_keep isl_map *map)
5579 for (i = 0; i < map->n; ++i) {
5580 int known = isl_basic_map_divs_known(map->p[i]);
5588 /* If bmap contains any unknown divs, then compute explicit
5589 * expressions for them. However, this computation may be
5590 * quite expensive, so first try to remove divs that aren't
5593 struct isl_map *isl_basic_map_compute_divs(struct isl_basic_map *bmap)
5596 struct isl_map *map;
5598 known = isl_basic_map_divs_known(bmap);
5602 return isl_map_from_basic_map(bmap);
5604 bmap = isl_basic_map_drop_redundant_divs(bmap);
5606 known = isl_basic_map_divs_known(bmap);
5610 return isl_map_from_basic_map(bmap);
5612 map = compute_divs(bmap);
5615 isl_basic_map_free(bmap);
5619 struct isl_map *isl_map_compute_divs(struct isl_map *map)
5623 struct isl_map *res;
5630 known = map_divs_known(map);
5638 res = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[0]));
5639 for (i = 1 ; i < map->n; ++i) {
5641 r2 = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[i]));
5642 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT))
5643 res = isl_map_union_disjoint(res, r2);
5645 res = isl_map_union(res, r2);
5652 struct isl_set *isl_basic_set_compute_divs(struct isl_basic_set *bset)
5654 return (struct isl_set *)
5655 isl_basic_map_compute_divs((struct isl_basic_map *)bset);
5658 struct isl_set *isl_set_compute_divs(struct isl_set *set)
5660 return (struct isl_set *)
5661 isl_map_compute_divs((struct isl_map *)set);
5664 struct isl_set *isl_map_domain(struct isl_map *map)
5667 struct isl_set *set;
5672 map = isl_map_cow(map);
5676 set = (struct isl_set *)map;
5677 set->dim = isl_dim_domain(set->dim);
5680 for (i = 0; i < map->n; ++i) {
5681 set->p[i] = isl_basic_map_domain(map->p[i]);
5685 ISL_F_CLR(set, ISL_MAP_DISJOINT);
5686 ISL_F_CLR(set, ISL_SET_NORMALIZED);
5693 static __isl_give isl_map *map_union_disjoint(__isl_take isl_map *map1,
5694 __isl_take isl_map *map2)
5698 struct isl_map *map = NULL;
5712 isl_assert(map1->ctx, isl_dim_equal(map1->dim, map2->dim), goto error);
5714 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
5715 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
5716 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
5718 map = isl_map_alloc_dim(isl_dim_copy(map1->dim),
5719 map1->n + map2->n, flags);
5722 for (i = 0; i < map1->n; ++i) {
5723 map = isl_map_add_basic_map(map,
5724 isl_basic_map_copy(map1->p[i]));
5728 for (i = 0; i < map2->n; ++i) {
5729 map = isl_map_add_basic_map(map,
5730 isl_basic_map_copy(map2->p[i]));
5744 __isl_give isl_map *isl_map_union_disjoint(__isl_take isl_map *map1,
5745 __isl_take isl_map *map2)
5747 return isl_map_align_params_map_map_and(map1, map2, &map_union_disjoint);
5750 struct isl_map *isl_map_union(struct isl_map *map1, struct isl_map *map2)
5752 map1 = isl_map_union_disjoint(map1, map2);
5756 ISL_F_CLR(map1, ISL_MAP_DISJOINT);
5760 struct isl_set *isl_set_union_disjoint(
5761 struct isl_set *set1, struct isl_set *set2)
5763 return (struct isl_set *)
5764 isl_map_union_disjoint(
5765 (struct isl_map *)set1, (struct isl_map *)set2);
5768 struct isl_set *isl_set_union(struct isl_set *set1, struct isl_set *set2)
5770 return (struct isl_set *)
5771 isl_map_union((struct isl_map *)set1, (struct isl_map *)set2);
5774 static __isl_give isl_map *map_intersect_range(__isl_take isl_map *map,
5775 __isl_take isl_set *set)
5778 struct isl_map *result;
5784 if (!isl_dim_match(map->dim, isl_dim_param, set->dim, isl_dim_param))
5785 isl_die(set->ctx, isl_error_invalid,
5786 "parameters don't match", goto error);
5788 if (isl_dim_size(set->dim, isl_dim_set) != 0 &&
5789 !isl_map_compatible_range(map, set))
5790 isl_die(set->ctx, isl_error_invalid,
5791 "incompatible spaces", goto error);
5793 if (isl_set_plain_is_universe(set)) {
5798 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT) &&
5799 ISL_F_ISSET(set, ISL_MAP_DISJOINT))
5800 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
5802 result = isl_map_alloc_dim(isl_dim_copy(map->dim),
5803 map->n * set->n, flags);
5806 for (i = 0; i < map->n; ++i)
5807 for (j = 0; j < set->n; ++j) {
5808 result = isl_map_add_basic_map(result,
5809 isl_basic_map_intersect_range(
5810 isl_basic_map_copy(map->p[i]),
5811 isl_basic_set_copy(set->p[j])));
5824 __isl_give isl_map *isl_map_intersect_range(__isl_take isl_map *map,
5825 __isl_take isl_set *set)
5827 return isl_map_align_params_map_map_and(map, set, &map_intersect_range);
5830 struct isl_map *isl_map_intersect_domain(
5831 struct isl_map *map, struct isl_set *set)
5833 return isl_map_reverse(
5834 isl_map_intersect_range(isl_map_reverse(map), set));
5837 static __isl_give isl_map *map_apply_domain(__isl_take isl_map *map1,
5838 __isl_take isl_map *map2)
5842 map1 = isl_map_reverse(map1);
5843 map1 = isl_map_apply_range(map1, map2);
5844 return isl_map_reverse(map1);
5851 __isl_give isl_map *isl_map_apply_domain(__isl_take isl_map *map1,
5852 __isl_take isl_map *map2)
5854 return isl_map_align_params_map_map_and(map1, map2, &map_apply_domain);
5857 static __isl_give isl_map *map_apply_range(__isl_take isl_map *map1,
5858 __isl_take isl_map *map2)
5860 struct isl_dim *dim_result;
5861 struct isl_map *result;
5867 dim_result = isl_dim_join(isl_dim_copy(map1->dim),
5868 isl_dim_copy(map2->dim));
5870 result = isl_map_alloc_dim(dim_result, map1->n * map2->n, 0);
5873 for (i = 0; i < map1->n; ++i)
5874 for (j = 0; j < map2->n; ++j) {
5875 result = isl_map_add_basic_map(result,
5876 isl_basic_map_apply_range(
5877 isl_basic_map_copy(map1->p[i]),
5878 isl_basic_map_copy(map2->p[j])));
5884 if (result && result->n <= 1)
5885 ISL_F_SET(result, ISL_MAP_DISJOINT);
5893 __isl_give isl_map *isl_map_apply_range(__isl_take isl_map *map1,
5894 __isl_take isl_map *map2)
5896 return isl_map_align_params_map_map_and(map1, map2, &map_apply_range);
5900 * returns range - domain
5902 struct isl_basic_set *isl_basic_map_deltas(struct isl_basic_map *bmap)
5904 isl_dim *dims, *target_dim;
5905 struct isl_basic_set *bset;
5912 isl_assert(bmap->ctx, isl_dim_tuple_match(bmap->dim, isl_dim_in,
5913 bmap->dim, isl_dim_out),
5915 target_dim = isl_dim_domain(isl_basic_map_get_dim(bmap));
5916 dim = isl_basic_map_n_in(bmap);
5917 nparam = isl_basic_map_n_param(bmap);
5918 bset = isl_basic_set_from_basic_map(bmap);
5919 bset = isl_basic_set_cow(bset);
5920 dims = isl_basic_set_get_dim(bset);
5921 dims = isl_dim_add(dims, isl_dim_set, dim);
5922 bset = isl_basic_set_extend_dim(bset, dims, 0, dim, 0);
5923 bset = isl_basic_set_swap_vars(bset, 2*dim);
5924 for (i = 0; i < dim; ++i) {
5925 int j = isl_basic_map_alloc_equality(
5926 (struct isl_basic_map *)bset);
5929 isl_seq_clr(bset->eq[j], 1 + isl_basic_set_total_dim(bset));
5930 isl_int_set_si(bset->eq[j][1+nparam+i], 1);
5931 isl_int_set_si(bset->eq[j][1+nparam+dim+i], 1);
5932 isl_int_set_si(bset->eq[j][1+nparam+2*dim+i], -1);
5934 bset = isl_basic_set_project_out(bset, isl_dim_set, dim, 2*dim);
5935 bset = isl_basic_set_reset_dim(bset, target_dim);
5938 isl_basic_map_free(bmap);
5943 * returns range - domain
5945 struct isl_set *isl_map_deltas(struct isl_map *map)
5949 struct isl_set *result;
5954 isl_assert(map->ctx, isl_dim_tuple_match(map->dim, isl_dim_in,
5955 map->dim, isl_dim_out),
5957 dim = isl_map_get_dim(map);
5958 dim = isl_dim_domain(dim);
5959 result = isl_set_alloc_dim(dim, map->n, 0);
5962 for (i = 0; i < map->n; ++i)
5963 result = isl_set_add_basic_set(result,
5964 isl_basic_map_deltas(isl_basic_map_copy(map->p[i])));
5973 * returns [domain -> range] -> range - domain
5975 __isl_give isl_basic_map *isl_basic_map_deltas_map(
5976 __isl_take isl_basic_map *bmap)
5980 isl_basic_map *domain;
5984 if (!isl_dim_tuple_match(bmap->dim, isl_dim_in, bmap->dim, isl_dim_out))
5985 isl_die(bmap->ctx, isl_error_invalid,
5986 "domain and range don't match", goto error);
5988 nparam = isl_basic_map_dim(bmap, isl_dim_param);
5989 n = isl_basic_map_dim(bmap, isl_dim_in);
5991 dim = isl_dim_from_range(isl_dim_domain(isl_basic_map_get_dim(bmap)));
5992 domain = isl_basic_map_universe(dim);
5994 bmap = isl_basic_map_from_domain(isl_basic_map_wrap(bmap));
5995 bmap = isl_basic_map_apply_range(bmap, domain);
5996 bmap = isl_basic_map_extend_constraints(bmap, n, 0);
5998 total = isl_basic_map_total_dim(bmap);
6000 for (i = 0; i < n; ++i) {
6001 k = isl_basic_map_alloc_equality(bmap);
6004 isl_seq_clr(bmap->eq[k], 1 + total);
6005 isl_int_set_si(bmap->eq[k][1 + nparam + i], 1);
6006 isl_int_set_si(bmap->eq[k][1 + nparam + n + i], -1);
6007 isl_int_set_si(bmap->eq[k][1 + nparam + n + n + i], 1);
6010 bmap = isl_basic_map_gauss(bmap, NULL);
6011 return isl_basic_map_finalize(bmap);
6013 isl_basic_map_free(bmap);
6018 * returns [domain -> range] -> range - domain
6020 __isl_give isl_map *isl_map_deltas_map(__isl_take isl_map *map)
6023 isl_dim *domain_dim;
6028 if (!isl_dim_tuple_match(map->dim, isl_dim_in, map->dim, isl_dim_out))
6029 isl_die(map->ctx, isl_error_invalid,
6030 "domain and range don't match", goto error);
6032 map = isl_map_cow(map);
6036 domain_dim = isl_dim_from_range(isl_dim_domain(isl_map_get_dim(map)));
6037 map->dim = isl_dim_from_domain(isl_dim_wrap(map->dim));
6038 map->dim = isl_dim_join(map->dim, domain_dim);
6041 for (i = 0; i < map->n; ++i) {
6042 map->p[i] = isl_basic_map_deltas_map(map->p[i]);
6046 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
6053 static struct isl_basic_map *basic_map_identity(struct isl_dim *dims)
6055 struct isl_basic_map *bmap;
6063 nparam = dims->nparam;
6065 bmap = isl_basic_map_alloc_dim(dims, 0, dim, 0);
6069 for (i = 0; i < dim; ++i) {
6070 int j = isl_basic_map_alloc_equality(bmap);
6073 isl_seq_clr(bmap->eq[j], 1 + isl_basic_map_total_dim(bmap));
6074 isl_int_set_si(bmap->eq[j][1+nparam+i], 1);
6075 isl_int_set_si(bmap->eq[j][1+nparam+dim+i], -1);
6077 return isl_basic_map_finalize(bmap);
6079 isl_basic_map_free(bmap);
6083 __isl_give isl_basic_map *isl_basic_map_identity(__isl_take isl_dim *dim)
6087 if (dim->n_in != dim->n_out)
6088 isl_die(dim->ctx, isl_error_invalid,
6089 "number of input and output dimensions needs to be "
6090 "the same", goto error);
6091 return basic_map_identity(dim);
6097 struct isl_basic_map *isl_basic_map_identity_like(struct isl_basic_map *model)
6099 if (!model || !model->dim)
6101 return isl_basic_map_identity(isl_dim_copy(model->dim));
6104 __isl_give isl_map *isl_map_identity(__isl_take isl_dim *dim)
6106 return isl_map_from_basic_map(isl_basic_map_identity(dim));
6109 struct isl_map *isl_map_identity_like(struct isl_map *model)
6111 if (!model || !model->dim)
6113 return isl_map_identity(isl_dim_copy(model->dim));
6116 struct isl_map *isl_map_identity_like_basic_map(struct isl_basic_map *model)
6118 if (!model || !model->dim)
6120 return isl_map_identity(isl_dim_copy(model->dim));
6123 __isl_give isl_map *isl_set_identity(__isl_take isl_set *set)
6125 isl_dim *dim = isl_set_get_dim(set);
6127 id = isl_map_identity(isl_dim_map_from_set(dim));
6128 return isl_map_intersect_range(id, set);
6131 /* Construct a basic set with all set dimensions having only non-negative
6134 struct isl_basic_set *isl_basic_set_positive_orthant(struct isl_dim *dims)
6139 struct isl_basic_set *bset;
6143 nparam = dims->nparam;
6145 bset = isl_basic_set_alloc_dim(dims, 0, 0, dim);
6148 for (i = 0; i < dim; ++i) {
6149 int k = isl_basic_set_alloc_inequality(bset);
6152 isl_seq_clr(bset->ineq[k], 1 + isl_basic_set_total_dim(bset));
6153 isl_int_set_si(bset->ineq[k][1 + nparam + i], 1);
6157 isl_basic_set_free(bset);
6161 /* Construct the half-space x_pos >= 0.
6163 static __isl_give isl_basic_set *nonneg_halfspace(__isl_take isl_dim *dim,
6167 isl_basic_set *nonneg;
6169 nonneg = isl_basic_set_alloc_dim(dim, 0, 0, 1);
6170 k = isl_basic_set_alloc_inequality(nonneg);
6173 isl_seq_clr(nonneg->ineq[k], 1 + isl_basic_set_total_dim(nonneg));
6174 isl_int_set_si(nonneg->ineq[k][pos], 1);
6176 return isl_basic_set_finalize(nonneg);
6178 isl_basic_set_free(nonneg);
6182 /* Construct the half-space x_pos <= -1.
6184 static __isl_give isl_basic_set *neg_halfspace(__isl_take isl_dim *dim, int pos)
6189 neg = isl_basic_set_alloc_dim(dim, 0, 0, 1);
6190 k = isl_basic_set_alloc_inequality(neg);
6193 isl_seq_clr(neg->ineq[k], 1 + isl_basic_set_total_dim(neg));
6194 isl_int_set_si(neg->ineq[k][0], -1);
6195 isl_int_set_si(neg->ineq[k][pos], -1);
6197 return isl_basic_set_finalize(neg);
6199 isl_basic_set_free(neg);
6203 __isl_give isl_set *isl_set_split_dims(__isl_take isl_set *set,
6204 enum isl_dim_type type, unsigned first, unsigned n)
6207 isl_basic_set *nonneg;
6215 isl_assert(set->ctx, first + n <= isl_set_dim(set, type), goto error);
6217 for (i = 0; i < n; ++i) {
6218 nonneg = nonneg_halfspace(isl_set_get_dim(set),
6219 pos(set->dim, type) + first + i);
6220 neg = neg_halfspace(isl_set_get_dim(set),
6221 pos(set->dim, type) + first + i);
6223 set = isl_set_intersect(set, isl_basic_set_union(nonneg, neg));
6232 static int foreach_orthant(__isl_take isl_set *set, int *signs, int first,
6233 int len, int (*fn)(__isl_take isl_set *orthant, int *signs, void *user),
6240 if (isl_set_plain_is_empty(set)) {
6245 return fn(set, signs, user);
6248 half = isl_set_from_basic_set(nonneg_halfspace(isl_set_get_dim(set),
6250 half = isl_set_intersect(half, isl_set_copy(set));
6251 if (foreach_orthant(half, signs, first + 1, len, fn, user) < 0)
6255 half = isl_set_from_basic_set(neg_halfspace(isl_set_get_dim(set),
6257 half = isl_set_intersect(half, set);
6258 return foreach_orthant(half, signs, first + 1, len, fn, user);
6264 /* Call "fn" on the intersections of "set" with each of the orthants
6265 * (except for obviously empty intersections). The orthant is identified
6266 * by the signs array, with each entry having value 1 or -1 according
6267 * to the sign of the corresponding variable.
6269 int isl_set_foreach_orthant(__isl_keep isl_set *set,
6270 int (*fn)(__isl_take isl_set *orthant, int *signs, void *user),
6280 if (isl_set_plain_is_empty(set))
6283 nparam = isl_set_dim(set, isl_dim_param);
6284 nvar = isl_set_dim(set, isl_dim_set);
6286 signs = isl_alloc_array(set->ctx, int, nparam + nvar);
6288 r = foreach_orthant(isl_set_copy(set), signs, 0, nparam + nvar,
6296 int isl_set_is_equal(struct isl_set *set1, struct isl_set *set2)
6298 return isl_map_is_equal((struct isl_map *)set1, (struct isl_map *)set2);
6301 int isl_basic_map_is_subset(
6302 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
6305 struct isl_map *map1;
6306 struct isl_map *map2;
6308 if (!bmap1 || !bmap2)
6311 map1 = isl_map_from_basic_map(isl_basic_map_copy(bmap1));
6312 map2 = isl_map_from_basic_map(isl_basic_map_copy(bmap2));
6314 is_subset = isl_map_is_subset(map1, map2);
6322 int isl_basic_map_is_equal(
6323 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
6327 if (!bmap1 || !bmap2)
6329 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
6332 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
6336 int isl_basic_set_is_equal(
6337 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
6339 return isl_basic_map_is_equal(
6340 (struct isl_basic_map *)bset1, (struct isl_basic_map *)bset2);
6343 int isl_map_is_empty(struct isl_map *map)
6350 for (i = 0; i < map->n; ++i) {
6351 is_empty = isl_basic_map_is_empty(map->p[i]);
6360 int isl_map_plain_is_empty(__isl_keep isl_map *map)
6362 return map ? map->n == 0 : -1;
6365 int isl_map_fast_is_empty(__isl_keep isl_map *map)
6367 return isl_map_plain_is_empty(map);
6370 int isl_set_plain_is_empty(struct isl_set *set)
6372 return set ? set->n == 0 : -1;
6375 int isl_set_fast_is_empty(__isl_keep isl_set *set)
6377 return isl_set_plain_is_empty(set);
6380 int isl_set_is_empty(struct isl_set *set)
6382 return isl_map_is_empty((struct isl_map *)set);
6385 int isl_map_has_equal_dim(__isl_keep isl_map *map1, __isl_keep isl_map *map2)
6390 return isl_dim_equal(map1->dim, map2->dim);
6393 int isl_set_has_equal_dim(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
6398 return isl_dim_equal(set1->dim, set2->dim);
6401 static int map_is_equal(__isl_keep isl_map *map1, __isl_keep isl_map *map2)
6407 is_subset = isl_map_is_subset(map1, map2);
6410 is_subset = isl_map_is_subset(map2, map1);
6414 int isl_map_is_equal(__isl_keep isl_map *map1, __isl_keep isl_map *map2)
6416 return align_params_map_map_and_test(map1, map2, &map_is_equal);
6419 int isl_basic_map_is_strict_subset(
6420 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
6424 if (!bmap1 || !bmap2)
6426 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
6429 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
6430 if (is_subset == -1)
6435 int isl_map_is_strict_subset(struct isl_map *map1, struct isl_map *map2)
6441 is_subset = isl_map_is_subset(map1, map2);
6444 is_subset = isl_map_is_subset(map2, map1);
6445 if (is_subset == -1)
6450 int isl_set_is_strict_subset(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
6452 return isl_map_is_strict_subset((isl_map *)set1, (isl_map *)set2);
6455 int isl_basic_map_is_universe(struct isl_basic_map *bmap)
6459 return bmap->n_eq == 0 && bmap->n_ineq == 0;
6462 int isl_basic_set_is_universe(struct isl_basic_set *bset)
6466 return bset->n_eq == 0 && bset->n_ineq == 0;
6469 int isl_map_plain_is_universe(__isl_keep isl_map *map)
6476 for (i = 0; i < map->n; ++i) {
6477 int r = isl_basic_map_is_universe(map->p[i]);
6485 int isl_set_plain_is_universe(__isl_keep isl_set *set)
6487 return isl_map_plain_is_universe((isl_map *) set);
6490 int isl_set_fast_is_universe(__isl_keep isl_set *set)
6492 return isl_set_plain_is_universe(set);
6495 int isl_basic_map_is_empty(struct isl_basic_map *bmap)
6497 struct isl_basic_set *bset = NULL;
6498 struct isl_vec *sample = NULL;
6505 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY))
6508 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL)) {
6509 struct isl_basic_map *copy = isl_basic_map_copy(bmap);
6510 copy = isl_basic_map_remove_redundancies(copy);
6511 empty = ISL_F_ISSET(copy, ISL_BASIC_MAP_EMPTY);
6512 isl_basic_map_free(copy);
6516 total = 1 + isl_basic_map_total_dim(bmap);
6517 if (bmap->sample && bmap->sample->size == total) {
6518 int contains = isl_basic_map_contains(bmap, bmap->sample);
6524 isl_vec_free(bmap->sample);
6525 bmap->sample = NULL;
6526 bset = isl_basic_map_underlying_set(isl_basic_map_copy(bmap));
6529 sample = isl_basic_set_sample_vec(bset);
6532 empty = sample->size == 0;
6533 isl_vec_free(bmap->sample);
6534 bmap->sample = sample;
6536 ISL_F_SET(bmap, ISL_BASIC_MAP_EMPTY);
6541 int isl_basic_map_plain_is_empty(__isl_keep isl_basic_map *bmap)
6545 return ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY);
6548 int isl_basic_map_fast_is_empty(__isl_keep isl_basic_map *bmap)
6550 return isl_basic_map_plain_is_empty(bmap);
6553 int isl_basic_set_plain_is_empty(__isl_keep isl_basic_set *bset)
6557 return ISL_F_ISSET(bset, ISL_BASIC_SET_EMPTY);
6560 int isl_basic_set_fast_is_empty(__isl_keep isl_basic_set *bset)
6562 return isl_basic_set_plain_is_empty(bset);
6565 int isl_basic_set_is_empty(struct isl_basic_set *bset)
6567 return isl_basic_map_is_empty((struct isl_basic_map *)bset);
6570 struct isl_map *isl_basic_map_union(
6571 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
6573 struct isl_map *map;
6574 if (!bmap1 || !bmap2)
6577 isl_assert(bmap1->ctx, isl_dim_equal(bmap1->dim, bmap2->dim), goto error);
6579 map = isl_map_alloc_dim(isl_dim_copy(bmap1->dim), 2, 0);
6582 map = isl_map_add_basic_map(map, bmap1);
6583 map = isl_map_add_basic_map(map, bmap2);
6586 isl_basic_map_free(bmap1);
6587 isl_basic_map_free(bmap2);
6591 struct isl_set *isl_basic_set_union(
6592 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
6594 return (struct isl_set *)isl_basic_map_union(
6595 (struct isl_basic_map *)bset1,
6596 (struct isl_basic_map *)bset2);
6599 /* Order divs such that any div only depends on previous divs */
6600 struct isl_basic_map *isl_basic_map_order_divs(struct isl_basic_map *bmap)
6608 off = isl_dim_total(bmap->dim);
6610 for (i = 0; i < bmap->n_div; ++i) {
6612 if (isl_int_is_zero(bmap->div[i][0]))
6614 pos = isl_seq_first_non_zero(bmap->div[i]+1+1+off+i,
6618 isl_basic_map_swap_div(bmap, i, i + pos);
6624 struct isl_basic_set *isl_basic_set_order_divs(struct isl_basic_set *bset)
6626 return (struct isl_basic_set *)
6627 isl_basic_map_order_divs((struct isl_basic_map *)bset);
6630 __isl_give isl_map *isl_map_order_divs(__isl_take isl_map *map)
6637 for (i = 0; i < map->n; ++i) {
6638 map->p[i] = isl_basic_map_order_divs(map->p[i]);
6649 /* Apply the expansion computed by isl_merge_divs.
6650 * The expansion itself is given by "exp" while the resulting
6651 * list of divs is given by "div".
6653 __isl_give isl_basic_set *isl_basic_set_expand_divs(
6654 __isl_take isl_basic_set *bset, __isl_take isl_mat *div, int *exp)
6659 bset = isl_basic_set_cow(bset);
6663 if (div->n_row < bset->n_div)
6664 isl_die(isl_mat_get_ctx(div), isl_error_invalid,
6665 "not an expansion", goto error);
6667 bset = isl_basic_map_extend_dim(bset, isl_dim_copy(bset->dim),
6668 div->n_row - bset->n_div, 0,
6669 2 * (div->n_row - bset->n_div));
6671 n_div = bset->n_div;
6672 for (i = n_div; i < div->n_row; ++i)
6673 if (isl_basic_set_alloc_div(bset) < 0)
6677 for (i = div->n_row - 1; i >= 0; --i) {
6678 if (j >= 0 && exp[j] == i) {
6680 isl_basic_map_swap_div(bset, i, j);
6683 isl_seq_cpy(bset->div[i], div->row[i], div->n_col);
6684 if (isl_basic_map_add_div_constraints(bset, i) < 0)
6692 isl_basic_set_free(bset);
6697 /* Look for a div in dst that corresponds to the div "div" in src.
6698 * The divs before "div" in src and dst are assumed to be the same.
6700 * Returns -1 if no corresponding div was found and the position
6701 * of the corresponding div in dst otherwise.
6703 static int find_div(struct isl_basic_map *dst,
6704 struct isl_basic_map *src, unsigned div)
6708 unsigned total = isl_dim_total(src->dim);
6710 isl_assert(dst->ctx, div <= dst->n_div, return -1);
6711 for (i = div; i < dst->n_div; ++i)
6712 if (isl_seq_eq(dst->div[i], src->div[div], 1+1+total+div) &&
6713 isl_seq_first_non_zero(dst->div[i]+1+1+total+div,
6714 dst->n_div - div) == -1)
6719 struct isl_basic_map *isl_basic_map_align_divs(
6720 struct isl_basic_map *dst, struct isl_basic_map *src)
6723 unsigned total = isl_dim_total(src->dim);
6728 if (src->n_div == 0)
6731 for (i = 0; i < src->n_div; ++i)
6732 isl_assert(src->ctx, !isl_int_is_zero(src->div[i][0]), goto error);
6734 src = isl_basic_map_order_divs(src);
6735 dst = isl_basic_map_cow(dst);
6736 dst = isl_basic_map_extend_dim(dst, isl_dim_copy(dst->dim),
6737 src->n_div, 0, 2 * src->n_div);
6740 for (i = 0; i < src->n_div; ++i) {
6741 int j = find_div(dst, src, i);
6743 j = isl_basic_map_alloc_div(dst);
6746 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total+i);
6747 isl_seq_clr(dst->div[j]+1+1+total+i, dst->n_div - i);
6748 if (isl_basic_map_add_div_constraints(dst, j) < 0)
6752 isl_basic_map_swap_div(dst, i, j);
6756 isl_basic_map_free(dst);
6760 struct isl_basic_set *isl_basic_set_align_divs(
6761 struct isl_basic_set *dst, struct isl_basic_set *src)
6763 return (struct isl_basic_set *)isl_basic_map_align_divs(
6764 (struct isl_basic_map *)dst, (struct isl_basic_map *)src);
6767 struct isl_map *isl_map_align_divs(struct isl_map *map)
6775 map = isl_map_compute_divs(map);
6776 map = isl_map_cow(map);
6780 for (i = 1; i < map->n; ++i)
6781 map->p[0] = isl_basic_map_align_divs(map->p[0], map->p[i]);
6782 for (i = 1; i < map->n; ++i)
6783 map->p[i] = isl_basic_map_align_divs(map->p[i], map->p[0]);
6785 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
6789 struct isl_set *isl_set_align_divs(struct isl_set *set)
6791 return (struct isl_set *)isl_map_align_divs((struct isl_map *)set);
6794 static __isl_give isl_set *set_apply( __isl_take isl_set *set,
6795 __isl_take isl_map *map)
6799 isl_assert(set->ctx, isl_map_compatible_domain(map, set), goto error);
6800 map = isl_map_intersect_domain(map, set);
6801 set = isl_map_range(map);
6809 __isl_give isl_set *isl_set_apply( __isl_take isl_set *set,
6810 __isl_take isl_map *map)
6812 return isl_map_align_params_map_map_and(set, map, &set_apply);
6815 /* There is no need to cow as removing empty parts doesn't change
6816 * the meaning of the set.
6818 struct isl_map *isl_map_remove_empty_parts(struct isl_map *map)
6825 for (i = map->n-1; i >= 0; --i) {
6826 if (!ISL_F_ISSET(map->p[i], ISL_BASIC_MAP_EMPTY))
6828 isl_basic_map_free(map->p[i]);
6829 if (i != map->n-1) {
6830 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
6831 map->p[i] = map->p[map->n-1];
6839 struct isl_set *isl_set_remove_empty_parts(struct isl_set *set)
6841 return (struct isl_set *)
6842 isl_map_remove_empty_parts((struct isl_map *)set);
6845 struct isl_basic_map *isl_map_copy_basic_map(struct isl_map *map)
6847 struct isl_basic_map *bmap;
6848 if (!map || map->n == 0)
6850 bmap = map->p[map->n-1];
6851 isl_assert(map->ctx, ISL_F_ISSET(bmap, ISL_BASIC_SET_FINAL), return NULL);
6852 return isl_basic_map_copy(bmap);
6855 struct isl_basic_set *isl_set_copy_basic_set(struct isl_set *set)
6857 return (struct isl_basic_set *)
6858 isl_map_copy_basic_map((struct isl_map *)set);
6861 __isl_give isl_map *isl_map_drop_basic_map(__isl_take isl_map *map,
6862 __isl_keep isl_basic_map *bmap)
6868 for (i = map->n-1; i >= 0; --i) {
6869 if (map->p[i] != bmap)
6871 map = isl_map_cow(map);
6874 isl_basic_map_free(map->p[i]);
6875 if (i != map->n-1) {
6876 ISL_F_CLR(map, ISL_SET_NORMALIZED);
6877 map->p[i] = map->p[map->n-1];
6888 struct isl_set *isl_set_drop_basic_set(struct isl_set *set,
6889 struct isl_basic_set *bset)
6891 return (struct isl_set *)isl_map_drop_basic_map((struct isl_map *)set,
6892 (struct isl_basic_map *)bset);
6895 /* Given two basic sets bset1 and bset2, compute the maximal difference
6896 * between the values of dimension pos in bset1 and those in bset2
6897 * for any common value of the parameters and dimensions preceding pos.
6899 static enum isl_lp_result basic_set_maximal_difference_at(
6900 __isl_keep isl_basic_set *bset1, __isl_keep isl_basic_set *bset2,
6901 int pos, isl_int *opt)
6903 struct isl_dim *dims;
6904 struct isl_basic_map *bmap1 = NULL;
6905 struct isl_basic_map *bmap2 = NULL;
6906 struct isl_ctx *ctx;
6907 struct isl_vec *obj;
6910 unsigned dim1, dim2;
6911 enum isl_lp_result res;
6913 if (!bset1 || !bset2)
6914 return isl_lp_error;
6916 nparam = isl_basic_set_n_param(bset1);
6917 dim1 = isl_basic_set_n_dim(bset1);
6918 dim2 = isl_basic_set_n_dim(bset2);
6919 dims = isl_dim_alloc(bset1->ctx, nparam, pos, dim1 - pos);
6920 bmap1 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset1), dims);
6921 dims = isl_dim_alloc(bset2->ctx, nparam, pos, dim2 - pos);
6922 bmap2 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset2), dims);
6923 if (!bmap1 || !bmap2)
6925 bmap1 = isl_basic_map_cow(bmap1);
6926 bmap1 = isl_basic_map_extend(bmap1, nparam,
6927 pos, (dim1 - pos) + (dim2 - pos),
6928 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
6929 bmap1 = add_constraints(bmap1, bmap2, 0, dim1 - pos);
6932 total = isl_basic_map_total_dim(bmap1);
6934 obj = isl_vec_alloc(ctx, 1 + total);
6935 isl_seq_clr(obj->block.data, 1 + total);
6936 isl_int_set_si(obj->block.data[1+nparam+pos], 1);
6937 isl_int_set_si(obj->block.data[1+nparam+pos+(dim1-pos)], -1);
6940 res = isl_basic_map_solve_lp(bmap1, 1, obj->block.data, ctx->one,
6942 isl_basic_map_free(bmap1);
6946 isl_basic_map_free(bmap1);
6947 isl_basic_map_free(bmap2);
6948 return isl_lp_error;
6951 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
6952 * for any common value of the parameters and dimensions preceding pos
6953 * in both basic sets, the values of dimension pos in bset1 are
6954 * smaller or larger than those in bset2.
6957 * 1 if bset1 follows bset2
6958 * -1 if bset1 precedes bset2
6959 * 0 if bset1 and bset2 are incomparable
6960 * -2 if some error occurred.
6962 int isl_basic_set_compare_at(struct isl_basic_set *bset1,
6963 struct isl_basic_set *bset2, int pos)
6966 enum isl_lp_result res;
6971 res = basic_set_maximal_difference_at(bset1, bset2, pos, &opt);
6973 if (res == isl_lp_empty)
6975 else if ((res == isl_lp_ok && isl_int_is_pos(opt)) ||
6976 res == isl_lp_unbounded)
6978 else if (res == isl_lp_ok && isl_int_is_neg(opt))
6987 /* Given two basic sets bset1 and bset2, check whether
6988 * for any common value of the parameters and dimensions preceding pos
6989 * there is a value of dimension pos in bset1 that is larger
6990 * than a value of the same dimension in bset2.
6993 * 1 if there exists such a pair
6994 * 0 if there is no such pair, but there is a pair of equal values
6996 * -2 if some error occurred.
6998 int isl_basic_set_follows_at(__isl_keep isl_basic_set *bset1,
6999 __isl_keep isl_basic_set *bset2, int pos)
7002 enum isl_lp_result res;
7007 res = basic_set_maximal_difference_at(bset1, bset2, pos, &opt);
7009 if (res == isl_lp_empty)
7011 else if ((res == isl_lp_ok && isl_int_is_pos(opt)) ||
7012 res == isl_lp_unbounded)
7014 else if (res == isl_lp_ok && isl_int_is_neg(opt))
7016 else if (res == isl_lp_ok)
7025 /* Given two sets set1 and set2, check whether
7026 * for any common value of the parameters and dimensions preceding pos
7027 * there is a value of dimension pos in set1 that is larger
7028 * than a value of the same dimension in set2.
7031 * 1 if there exists such a pair
7032 * 0 if there is no such pair, but there is a pair of equal values
7034 * -2 if some error occurred.
7036 int isl_set_follows_at(__isl_keep isl_set *set1,
7037 __isl_keep isl_set *set2, int pos)
7045 for (i = 0; i < set1->n; ++i)
7046 for (j = 0; j < set2->n; ++j) {
7048 f = isl_basic_set_follows_at(set1->p[i], set2->p[j], pos);
7049 if (f == 1 || f == -2)
7058 static int isl_basic_map_plain_has_fixed_var(__isl_keep isl_basic_map *bmap,
7059 unsigned pos, isl_int *val)
7067 total = isl_basic_map_total_dim(bmap);
7068 for (i = 0, d = total-1; i < bmap->n_eq && d+1 > pos; ++i) {
7069 for (; d+1 > pos; --d)
7070 if (!isl_int_is_zero(bmap->eq[i][1+d]))
7074 if (isl_seq_first_non_zero(bmap->eq[i]+1, d) != -1)
7076 if (isl_seq_first_non_zero(bmap->eq[i]+1+d+1, total-d-1) != -1)
7078 if (!isl_int_is_one(bmap->eq[i][1+d]))
7081 isl_int_neg(*val, bmap->eq[i][0]);
7087 static int isl_map_plain_has_fixed_var(__isl_keep isl_map *map,
7088 unsigned pos, isl_int *val)
7100 return isl_basic_map_plain_has_fixed_var(map->p[0], pos, val);
7103 fixed = isl_basic_map_plain_has_fixed_var(map->p[0], pos, &v);
7104 for (i = 1; fixed == 1 && i < map->n; ++i) {
7105 fixed = isl_basic_map_plain_has_fixed_var(map->p[i], pos, &tmp);
7106 if (fixed == 1 && isl_int_ne(tmp, v))
7110 isl_int_set(*val, v);
7116 static int isl_basic_set_plain_has_fixed_var(__isl_keep isl_basic_set *bset,
7117 unsigned pos, isl_int *val)
7119 return isl_basic_map_plain_has_fixed_var((struct isl_basic_map *)bset,
7123 static int isl_set_plain_has_fixed_var(__isl_keep isl_set *set, unsigned pos,
7126 return isl_map_plain_has_fixed_var((struct isl_map *)set, pos, val);
7129 int isl_basic_map_plain_is_fixed(__isl_keep isl_basic_map *bmap,
7130 enum isl_dim_type type, unsigned pos, isl_int *val)
7132 if (pos >= isl_basic_map_dim(bmap, type))
7134 return isl_basic_map_plain_has_fixed_var(bmap,
7135 isl_basic_map_offset(bmap, type) - 1 + pos, val);
7138 int isl_map_plain_is_fixed(__isl_keep isl_map *map,
7139 enum isl_dim_type type, unsigned pos, isl_int *val)
7141 if (pos >= isl_map_dim(map, type))
7143 return isl_map_plain_has_fixed_var(map,
7144 map_offset(map, type) - 1 + pos, val);
7147 int isl_map_fast_is_fixed(__isl_keep isl_map *map,
7148 enum isl_dim_type type, unsigned pos, isl_int *val)
7150 return isl_map_plain_is_fixed(map, type, pos, val);
7153 /* Check if dimension dim has fixed value and if so and if val is not NULL,
7154 * then return this fixed value in *val.
7156 int isl_basic_set_plain_dim_is_fixed(__isl_keep isl_basic_set *bset,
7157 unsigned dim, isl_int *val)
7159 return isl_basic_set_plain_has_fixed_var(bset,
7160 isl_basic_set_n_param(bset) + dim, val);
7163 /* Check if dimension dim has fixed value and if so and if val is not NULL,
7164 * then return this fixed value in *val.
7166 int isl_set_plain_dim_is_fixed(__isl_keep isl_set *set,
7167 unsigned dim, isl_int *val)
7169 return isl_set_plain_has_fixed_var(set, isl_set_n_param(set) + dim, val);
7172 int isl_set_fast_dim_is_fixed(__isl_keep isl_set *set,
7173 unsigned dim, isl_int *val)
7175 return isl_set_plain_dim_is_fixed(set, dim, val);
7178 /* Check if input variable in has fixed value and if so and if val is not NULL,
7179 * then return this fixed value in *val.
7181 int isl_map_plain_input_is_fixed(__isl_keep isl_map *map,
7182 unsigned in, isl_int *val)
7184 return isl_map_plain_has_fixed_var(map, isl_map_n_param(map) + in, val);
7187 /* Check if dimension dim has an (obvious) fixed lower bound and if so
7188 * and if val is not NULL, then return this lower bound in *val.
7190 int isl_basic_set_plain_dim_has_fixed_lower_bound(
7191 __isl_keep isl_basic_set *bset, unsigned dim, isl_int *val)
7193 int i, i_eq = -1, i_ineq = -1;
7200 total = isl_basic_set_total_dim(bset);
7201 nparam = isl_basic_set_n_param(bset);
7202 for (i = 0; i < bset->n_eq; ++i) {
7203 if (isl_int_is_zero(bset->eq[i][1+nparam+dim]))
7209 for (i = 0; i < bset->n_ineq; ++i) {
7210 if (!isl_int_is_pos(bset->ineq[i][1+nparam+dim]))
7212 if (i_eq != -1 || i_ineq != -1)
7216 if (i_eq == -1 && i_ineq == -1)
7218 c = i_eq != -1 ? bset->eq[i_eq] : bset->ineq[i_ineq];
7219 /* The coefficient should always be one due to normalization. */
7220 if (!isl_int_is_one(c[1+nparam+dim]))
7222 if (isl_seq_first_non_zero(c+1, nparam+dim) != -1)
7224 if (isl_seq_first_non_zero(c+1+nparam+dim+1,
7225 total - nparam - dim - 1) != -1)
7228 isl_int_neg(*val, c[0]);
7232 int isl_set_plain_dim_has_fixed_lower_bound(__isl_keep isl_set *set,
7233 unsigned dim, isl_int *val)
7245 return isl_basic_set_plain_dim_has_fixed_lower_bound(set->p[0],
7249 fixed = isl_basic_set_plain_dim_has_fixed_lower_bound(set->p[0],
7251 for (i = 1; fixed == 1 && i < set->n; ++i) {
7252 fixed = isl_basic_set_plain_dim_has_fixed_lower_bound(set->p[i],
7254 if (fixed == 1 && isl_int_ne(tmp, v))
7258 isl_int_set(*val, v);
7269 /* uset_gist depends on constraints without existentially quantified
7270 * variables sorting first.
7272 static int qsort_constraint_cmp(const void *p1, const void *p2)
7274 const struct constraint *c1 = (const struct constraint *)p1;
7275 const struct constraint *c2 = (const struct constraint *)p2;
7277 unsigned size = isl_min(c1->size, c2->size);
7279 l1 = isl_seq_last_non_zero(c1->c, size);
7280 l2 = isl_seq_last_non_zero(c2->c, size);
7285 return isl_seq_cmp(c1->c, c2->c, size);
7288 static struct isl_basic_map *isl_basic_map_sort_constraints(
7289 struct isl_basic_map *bmap)
7292 struct constraint *c;
7297 total = isl_basic_map_total_dim(bmap);
7298 c = isl_alloc_array(bmap->ctx, struct constraint, bmap->n_ineq);
7301 for (i = 0; i < bmap->n_ineq; ++i) {
7303 c[i].c = bmap->ineq[i];
7305 qsort(c, bmap->n_ineq, sizeof(struct constraint), qsort_constraint_cmp);
7306 for (i = 0; i < bmap->n_ineq; ++i)
7307 bmap->ineq[i] = c[i].c;
7311 isl_basic_map_free(bmap);
7315 __isl_give isl_basic_set *isl_basic_set_sort_constraints(
7316 __isl_take isl_basic_set *bset)
7318 return (struct isl_basic_set *)isl_basic_map_sort_constraints(
7319 (struct isl_basic_map *)bset);
7322 struct isl_basic_map *isl_basic_map_normalize(struct isl_basic_map *bmap)
7326 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_NORMALIZED))
7328 bmap = isl_basic_map_remove_redundancies(bmap);
7329 bmap = isl_basic_map_sort_constraints(bmap);
7330 ISL_F_SET(bmap, ISL_BASIC_MAP_NORMALIZED);
7334 struct isl_basic_set *isl_basic_set_normalize(struct isl_basic_set *bset)
7336 return (struct isl_basic_set *)isl_basic_map_normalize(
7337 (struct isl_basic_map *)bset);
7340 int isl_basic_map_plain_cmp(const __isl_keep isl_basic_map *bmap1,
7341 const __isl_keep isl_basic_map *bmap2)
7348 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_RATIONAL) !=
7349 ISL_F_ISSET(bmap2, ISL_BASIC_MAP_RATIONAL))
7350 return ISL_F_ISSET(bmap1, ISL_BASIC_MAP_RATIONAL) ? -1 : 1;
7351 if (isl_basic_map_n_param(bmap1) != isl_basic_map_n_param(bmap2))
7352 return isl_basic_map_n_param(bmap1) - isl_basic_map_n_param(bmap2);
7353 if (isl_basic_map_n_in(bmap1) != isl_basic_map_n_in(bmap2))
7354 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
7355 if (isl_basic_map_n_out(bmap1) != isl_basic_map_n_out(bmap2))
7356 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
7357 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY) &&
7358 ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
7360 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY))
7362 if (ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
7364 if (bmap1->n_eq != bmap2->n_eq)
7365 return bmap1->n_eq - bmap2->n_eq;
7366 if (bmap1->n_ineq != bmap2->n_ineq)
7367 return bmap1->n_ineq - bmap2->n_ineq;
7368 if (bmap1->n_div != bmap2->n_div)
7369 return bmap1->n_div - bmap2->n_div;
7370 total = isl_basic_map_total_dim(bmap1);
7371 for (i = 0; i < bmap1->n_eq; ++i) {
7372 cmp = isl_seq_cmp(bmap1->eq[i], bmap2->eq[i], 1+total);
7376 for (i = 0; i < bmap1->n_ineq; ++i) {
7377 cmp = isl_seq_cmp(bmap1->ineq[i], bmap2->ineq[i], 1+total);
7381 for (i = 0; i < bmap1->n_div; ++i) {
7382 cmp = isl_seq_cmp(bmap1->div[i], bmap2->div[i], 1+1+total);
7389 int isl_basic_map_plain_is_equal(__isl_keep isl_basic_map *bmap1,
7390 __isl_keep isl_basic_map *bmap2)
7392 return isl_basic_map_plain_cmp(bmap1, bmap2) == 0;
7395 int isl_basic_set_plain_is_equal(__isl_keep isl_basic_set *bset1,
7396 __isl_keep isl_basic_set *bset2)
7398 return isl_basic_map_plain_is_equal((isl_basic_map *)bset1,
7399 (isl_basic_map *)bset2);
7402 static int qsort_bmap_cmp(const void *p1, const void *p2)
7404 const struct isl_basic_map *bmap1 = *(const struct isl_basic_map **)p1;
7405 const struct isl_basic_map *bmap2 = *(const struct isl_basic_map **)p2;
7407 return isl_basic_map_plain_cmp(bmap1, bmap2);
7410 /* We normalize in place, but if anything goes wrong we need
7411 * to return NULL, so we need to make sure we don't change the
7412 * meaning of any possible other copies of map.
7414 struct isl_map *isl_map_normalize(struct isl_map *map)
7417 struct isl_basic_map *bmap;
7421 if (ISL_F_ISSET(map, ISL_MAP_NORMALIZED))
7423 for (i = 0; i < map->n; ++i) {
7424 bmap = isl_basic_map_normalize(isl_basic_map_copy(map->p[i]));
7427 isl_basic_map_free(map->p[i]);
7430 qsort(map->p, map->n, sizeof(struct isl_basic_map *), qsort_bmap_cmp);
7431 ISL_F_SET(map, ISL_MAP_NORMALIZED);
7432 map = isl_map_remove_empty_parts(map);
7435 for (i = map->n - 1; i >= 1; --i) {
7436 if (!isl_basic_map_plain_is_equal(map->p[i-1], map->p[i]))
7438 isl_basic_map_free(map->p[i-1]);
7439 for (j = i; j < map->n; ++j)
7440 map->p[j-1] = map->p[j];
7450 struct isl_set *isl_set_normalize(struct isl_set *set)
7452 return (struct isl_set *)isl_map_normalize((struct isl_map *)set);
7455 int isl_map_plain_is_equal(__isl_keep isl_map *map1, __isl_keep isl_map *map2)
7465 if (!isl_dim_equal(map1->dim, map2->dim))
7468 map1 = isl_map_copy(map1);
7469 map2 = isl_map_copy(map2);
7470 map1 = isl_map_normalize(map1);
7471 map2 = isl_map_normalize(map2);
7474 equal = map1->n == map2->n;
7475 for (i = 0; equal && i < map1->n; ++i) {
7476 equal = isl_basic_map_plain_is_equal(map1->p[i], map2->p[i]);
7489 int isl_map_fast_is_equal(__isl_keep isl_map *map1, __isl_keep isl_map *map2)
7491 return isl_map_plain_is_equal(map1, map2);
7494 int isl_set_plain_is_equal(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
7496 return isl_map_plain_is_equal((struct isl_map *)set1,
7497 (struct isl_map *)set2);
7500 int isl_set_fast_is_equal(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
7502 return isl_set_plain_is_equal(set1, set2);
7505 /* Return an interval that ranges from min to max (inclusive)
7507 struct isl_basic_set *isl_basic_set_interval(struct isl_ctx *ctx,
7508 isl_int min, isl_int max)
7511 struct isl_basic_set *bset = NULL;
7513 bset = isl_basic_set_alloc(ctx, 0, 1, 0, 0, 2);
7517 k = isl_basic_set_alloc_inequality(bset);
7520 isl_int_set_si(bset->ineq[k][1], 1);
7521 isl_int_neg(bset->ineq[k][0], min);
7523 k = isl_basic_set_alloc_inequality(bset);
7526 isl_int_set_si(bset->ineq[k][1], -1);
7527 isl_int_set(bset->ineq[k][0], max);
7531 isl_basic_set_free(bset);
7535 /* Return the Cartesian product of the basic sets in list (in the given order).
7537 __isl_give isl_basic_set *isl_basic_set_list_product(
7538 __isl_take struct isl_basic_set_list *list)
7546 struct isl_basic_set *product = NULL;
7550 isl_assert(list->ctx, list->n > 0, goto error);
7551 isl_assert(list->ctx, list->p[0], goto error);
7552 nparam = isl_basic_set_n_param(list->p[0]);
7553 dim = isl_basic_set_n_dim(list->p[0]);
7554 extra = list->p[0]->n_div;
7555 n_eq = list->p[0]->n_eq;
7556 n_ineq = list->p[0]->n_ineq;
7557 for (i = 1; i < list->n; ++i) {
7558 isl_assert(list->ctx, list->p[i], goto error);
7559 isl_assert(list->ctx,
7560 nparam == isl_basic_set_n_param(list->p[i]), goto error);
7561 dim += isl_basic_set_n_dim(list->p[i]);
7562 extra += list->p[i]->n_div;
7563 n_eq += list->p[i]->n_eq;
7564 n_ineq += list->p[i]->n_ineq;
7566 product = isl_basic_set_alloc(list->ctx, nparam, dim, extra,
7571 for (i = 0; i < list->n; ++i) {
7572 isl_basic_set_add_constraints(product,
7573 isl_basic_set_copy(list->p[i]), dim);
7574 dim += isl_basic_set_n_dim(list->p[i]);
7576 isl_basic_set_list_free(list);
7579 isl_basic_set_free(product);
7580 isl_basic_set_list_free(list);
7584 struct isl_basic_map *isl_basic_map_product(
7585 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
7587 struct isl_dim *dim_result = NULL;
7588 struct isl_basic_map *bmap;
7589 unsigned in1, in2, out1, out2, nparam, total, pos;
7590 struct isl_dim_map *dim_map1, *dim_map2;
7592 if (!bmap1 || !bmap2)
7595 isl_assert(bmap1->ctx, isl_dim_match(bmap1->dim, isl_dim_param,
7596 bmap2->dim, isl_dim_param), goto error);
7597 dim_result = isl_dim_product(isl_dim_copy(bmap1->dim),
7598 isl_dim_copy(bmap2->dim));
7600 in1 = isl_basic_map_n_in(bmap1);
7601 in2 = isl_basic_map_n_in(bmap2);
7602 out1 = isl_basic_map_n_out(bmap1);
7603 out2 = isl_basic_map_n_out(bmap2);
7604 nparam = isl_basic_map_n_param(bmap1);
7606 total = nparam + in1 + in2 + out1 + out2 + bmap1->n_div + bmap2->n_div;
7607 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
7608 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
7609 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
7610 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
7611 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
7612 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos += in1);
7613 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += in2);
7614 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += out1);
7615 isl_dim_map_div(dim_map1, bmap1, pos += out2);
7616 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
7618 bmap = isl_basic_map_alloc_dim(dim_result,
7619 bmap1->n_div + bmap2->n_div,
7620 bmap1->n_eq + bmap2->n_eq,
7621 bmap1->n_ineq + bmap2->n_ineq);
7622 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap1, dim_map1);
7623 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap2, dim_map2);
7624 bmap = isl_basic_map_simplify(bmap);
7625 return isl_basic_map_finalize(bmap);
7627 isl_basic_map_free(bmap1);
7628 isl_basic_map_free(bmap2);
7632 __isl_give isl_basic_map *isl_basic_map_flat_product(
7633 __isl_take isl_basic_map *bmap1, __isl_take isl_basic_map *bmap2)
7635 isl_basic_map *prod;
7637 prod = isl_basic_map_product(bmap1, bmap2);
7638 prod = isl_basic_map_flatten(prod);
7642 __isl_give isl_basic_set *isl_basic_set_flat_product(
7643 __isl_take isl_basic_set *bset1, __isl_take isl_basic_set *bset2)
7645 return isl_basic_map_flat_product(bset1, bset2);
7648 __isl_give isl_basic_map *isl_basic_map_range_product(
7649 __isl_take isl_basic_map *bmap1, __isl_take isl_basic_map *bmap2)
7651 isl_dim *dim_result = NULL;
7652 isl_basic_map *bmap;
7653 unsigned in, out1, out2, nparam, total, pos;
7654 struct isl_dim_map *dim_map1, *dim_map2;
7656 if (!bmap1 || !bmap2)
7659 dim_result = isl_dim_range_product(isl_dim_copy(bmap1->dim),
7660 isl_dim_copy(bmap2->dim));
7662 in = isl_basic_map_dim(bmap1, isl_dim_in);
7663 out1 = isl_basic_map_n_out(bmap1);
7664 out2 = isl_basic_map_n_out(bmap2);
7665 nparam = isl_basic_map_n_param(bmap1);
7667 total = nparam + in + out1 + out2 + bmap1->n_div + bmap2->n_div;
7668 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
7669 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
7670 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
7671 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
7672 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
7673 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
7674 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += in);
7675 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += out1);
7676 isl_dim_map_div(dim_map1, bmap1, pos += out2);
7677 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
7679 bmap = isl_basic_map_alloc_dim(dim_result,
7680 bmap1->n_div + bmap2->n_div,
7681 bmap1->n_eq + bmap2->n_eq,
7682 bmap1->n_ineq + bmap2->n_ineq);
7683 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap1, dim_map1);
7684 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap2, dim_map2);
7685 bmap = isl_basic_map_simplify(bmap);
7686 return isl_basic_map_finalize(bmap);
7688 isl_basic_map_free(bmap1);
7689 isl_basic_map_free(bmap2);
7693 __isl_give isl_basic_map *isl_basic_map_flat_range_product(
7694 __isl_take isl_basic_map *bmap1, __isl_take isl_basic_map *bmap2)
7696 isl_basic_map *prod;
7698 prod = isl_basic_map_range_product(bmap1, bmap2);
7699 prod = isl_basic_map_flatten_range(prod);
7703 static __isl_give isl_map *map_product(__isl_take isl_map *map1,
7704 __isl_take isl_map *map2,
7705 __isl_give isl_dim *(*dim_product)(__isl_take isl_dim *left,
7706 __isl_take isl_dim *right),
7707 __isl_give isl_basic_map *(*basic_map_product)(
7708 __isl_take isl_basic_map *left, __isl_take isl_basic_map *right))
7711 struct isl_map *result;
7717 isl_assert(map1->ctx, isl_dim_match(map1->dim, isl_dim_param,
7718 map2->dim, isl_dim_param), goto error);
7720 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
7721 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
7722 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
7724 result = isl_map_alloc_dim(dim_product(isl_dim_copy(map1->dim),
7725 isl_dim_copy(map2->dim)),
7726 map1->n * map2->n, flags);
7729 for (i = 0; i < map1->n; ++i)
7730 for (j = 0; j < map2->n; ++j) {
7731 struct isl_basic_map *part;
7732 part = basic_map_product(isl_basic_map_copy(map1->p[i]),
7733 isl_basic_map_copy(map2->p[j]));
7734 if (isl_basic_map_is_empty(part))
7735 isl_basic_map_free(part);
7737 result = isl_map_add_basic_map(result, part);
7750 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> [B -> D]
7752 static __isl_give isl_map *map_product_aligned(__isl_take isl_map *map1,
7753 __isl_take isl_map *map2)
7755 return map_product(map1, map2, &isl_dim_product, &isl_basic_map_product);
7758 __isl_give isl_map *isl_map_product(__isl_take isl_map *map1,
7759 __isl_take isl_map *map2)
7761 return isl_map_align_params_map_map_and(map1, map2, &map_product_aligned);
7764 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
7766 __isl_give isl_map *isl_map_flat_product(__isl_take isl_map *map1,
7767 __isl_take isl_map *map2)
7771 prod = isl_map_product(map1, map2);
7772 prod = isl_map_flatten(prod);
7776 /* Given two set A and B, construct its Cartesian product A x B.
7778 struct isl_set *isl_set_product(struct isl_set *set1, struct isl_set *set2)
7780 return (struct isl_set *)isl_map_product((struct isl_map *)set1,
7781 (struct isl_map *)set2);
7784 __isl_give isl_set *isl_set_flat_product(__isl_take isl_set *set1,
7785 __isl_take isl_set *set2)
7787 return (isl_set *)isl_map_flat_product((isl_map *)set1, (isl_map *)set2);
7790 /* Given two maps A -> B and C -> D, construct a map (A * C) -> [B -> D]
7792 static __isl_give isl_map *map_range_product_aligned(__isl_take isl_map *map1,
7793 __isl_take isl_map *map2)
7795 return map_product(map1, map2, &isl_dim_range_product,
7796 &isl_basic_map_range_product);
7799 __isl_give isl_map *isl_map_range_product(__isl_take isl_map *map1,
7800 __isl_take isl_map *map2)
7802 return isl_map_align_params_map_map_and(map1, map2,
7803 &map_range_product_aligned);
7806 /* Given two maps A -> B and C -> D, construct a map (A * C) -> (B, D)
7808 __isl_give isl_map *isl_map_flat_range_product(__isl_take isl_map *map1,
7809 __isl_take isl_map *map2)
7813 prod = isl_map_range_product(map1, map2);
7814 prod = isl_map_flatten_range(prod);
7818 uint32_t isl_basic_map_get_hash(__isl_keep isl_basic_map *bmap)
7821 uint32_t hash = isl_hash_init();
7826 bmap = isl_basic_map_copy(bmap);
7827 bmap = isl_basic_map_normalize(bmap);
7830 total = isl_basic_map_total_dim(bmap);
7831 isl_hash_byte(hash, bmap->n_eq & 0xFF);
7832 for (i = 0; i < bmap->n_eq; ++i) {
7834 c_hash = isl_seq_get_hash(bmap->eq[i], 1 + total);
7835 isl_hash_hash(hash, c_hash);
7837 isl_hash_byte(hash, bmap->n_ineq & 0xFF);
7838 for (i = 0; i < bmap->n_ineq; ++i) {
7840 c_hash = isl_seq_get_hash(bmap->ineq[i], 1 + total);
7841 isl_hash_hash(hash, c_hash);
7843 isl_hash_byte(hash, bmap->n_div & 0xFF);
7844 for (i = 0; i < bmap->n_div; ++i) {
7846 if (isl_int_is_zero(bmap->div[i][0]))
7848 isl_hash_byte(hash, i & 0xFF);
7849 c_hash = isl_seq_get_hash(bmap->div[i], 1 + 1 + total);
7850 isl_hash_hash(hash, c_hash);
7852 isl_basic_map_free(bmap);
7856 uint32_t isl_basic_set_get_hash(__isl_keep isl_basic_set *bset)
7858 return isl_basic_map_get_hash((isl_basic_map *)bset);
7861 uint32_t isl_map_get_hash(__isl_keep isl_map *map)
7868 map = isl_map_copy(map);
7869 map = isl_map_normalize(map);
7873 hash = isl_hash_init();
7874 for (i = 0; i < map->n; ++i) {
7876 bmap_hash = isl_basic_map_get_hash(map->p[i]);
7877 isl_hash_hash(hash, bmap_hash);
7885 uint32_t isl_set_get_hash(__isl_keep isl_set *set)
7887 return isl_map_get_hash((isl_map *)set);
7890 /* Check if the value for dimension dim is completely determined
7891 * by the values of the other parameters and variables.
7892 * That is, check if dimension dim is involved in an equality.
7894 int isl_basic_set_dim_is_unique(struct isl_basic_set *bset, unsigned dim)
7901 nparam = isl_basic_set_n_param(bset);
7902 for (i = 0; i < bset->n_eq; ++i)
7903 if (!isl_int_is_zero(bset->eq[i][1 + nparam + dim]))
7908 /* Check if the value for dimension dim is completely determined
7909 * by the values of the other parameters and variables.
7910 * That is, check if dimension dim is involved in an equality
7911 * for each of the subsets.
7913 int isl_set_dim_is_unique(struct isl_set *set, unsigned dim)
7919 for (i = 0; i < set->n; ++i) {
7921 unique = isl_basic_set_dim_is_unique(set->p[i], dim);
7928 int isl_set_n_basic_set(__isl_keep isl_set *set)
7930 return set ? set->n : 0;
7933 int isl_map_foreach_basic_map(__isl_keep isl_map *map,
7934 int (*fn)(__isl_take isl_basic_map *bmap, void *user), void *user)
7941 for (i = 0; i < map->n; ++i)
7942 if (fn(isl_basic_map_copy(map->p[i]), user) < 0)
7948 int isl_set_foreach_basic_set(__isl_keep isl_set *set,
7949 int (*fn)(__isl_take isl_basic_set *bset, void *user), void *user)
7956 for (i = 0; i < set->n; ++i)
7957 if (fn(isl_basic_set_copy(set->p[i]), user) < 0)
7963 __isl_give isl_basic_set *isl_basic_set_lift(__isl_take isl_basic_set *bset)
7965 struct isl_dim *dim;
7970 bset = isl_basic_set_cow(bset);
7974 dim = isl_basic_set_get_dim(bset);
7975 dim = isl_dim_lift(dim, bset->n_div);
7978 isl_dim_free(bset->dim);
7980 bset->extra -= bset->n_div;
7983 bset = isl_basic_set_finalize(bset);
7987 isl_basic_set_free(bset);
7991 __isl_give isl_set *isl_set_lift(__isl_take isl_set *set)
7994 struct isl_dim *dim;
7997 set = isl_set_align_divs(set);
8002 set = isl_set_cow(set);
8006 n_div = set->p[0]->n_div;
8007 dim = isl_set_get_dim(set);
8008 dim = isl_dim_lift(dim, n_div);
8011 isl_dim_free(set->dim);
8014 for (i = 0; i < set->n; ++i) {
8015 set->p[i] = isl_basic_set_lift(set->p[i]);
8026 __isl_give isl_map *isl_set_lifting(__isl_take isl_set *set)
8028 struct isl_dim *dim;
8029 struct isl_basic_map *bmap;
8036 set = isl_set_align_divs(set);
8041 dim = isl_set_get_dim(set);
8042 if (set->n == 0 || set->p[0]->n_div == 0) {
8044 return isl_map_identity(isl_dim_map_from_set(dim));
8047 n_div = set->p[0]->n_div;
8048 dim = isl_dim_map_from_set(dim);
8049 n_param = isl_dim_size(dim, isl_dim_param);
8050 n_set = isl_dim_size(dim, isl_dim_in);
8051 dim = isl_dim_extend(dim, n_param, n_set, n_set + n_div);
8052 bmap = isl_basic_map_alloc_dim(dim, 0, n_set, 2 * n_div);
8053 for (i = 0; i < n_set; ++i)
8054 bmap = var_equal(bmap, i);
8056 total = n_param + n_set + n_set + n_div;
8057 for (i = 0; i < n_div; ++i) {
8058 k = isl_basic_map_alloc_inequality(bmap);
8061 isl_seq_cpy(bmap->ineq[k], set->p[0]->div[i]+1, 1+n_param);
8062 isl_seq_clr(bmap->ineq[k]+1+n_param, n_set);
8063 isl_seq_cpy(bmap->ineq[k]+1+n_param+n_set,
8064 set->p[0]->div[i]+1+1+n_param, n_set + n_div);
8065 isl_int_neg(bmap->ineq[k][1+n_param+n_set+n_set+i],
8066 set->p[0]->div[i][0]);
8068 l = isl_basic_map_alloc_inequality(bmap);
8071 isl_seq_neg(bmap->ineq[l], bmap->ineq[k], 1 + total);
8072 isl_int_add(bmap->ineq[l][0], bmap->ineq[l][0],
8073 set->p[0]->div[i][0]);
8074 isl_int_sub_ui(bmap->ineq[l][0], bmap->ineq[l][0], 1);
8078 bmap = isl_basic_map_simplify(bmap);
8079 bmap = isl_basic_map_finalize(bmap);
8080 return isl_map_from_basic_map(bmap);
8083 isl_basic_map_free(bmap);
8087 int isl_basic_set_size(__isl_keep isl_basic_set *bset)
8095 dim = isl_basic_set_total_dim(bset);
8096 size += bset->n_eq * (1 + dim);
8097 size += bset->n_ineq * (1 + dim);
8098 size += bset->n_div * (2 + dim);
8103 int isl_set_size(__isl_keep isl_set *set)
8111 for (i = 0; i < set->n; ++i)
8112 size += isl_basic_set_size(set->p[i]);
8117 int isl_basic_map_dim_is_bounded(__isl_keep isl_basic_map *bmap,
8118 enum isl_dim_type type, unsigned pos)
8126 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), return -1);
8128 pos += isl_basic_map_offset(bmap, type);
8130 for (i = 0; i < bmap->n_eq; ++i)
8131 if (!isl_int_is_zero(bmap->eq[i][pos]))
8135 for (i = 0; i < bmap->n_ineq; ++i) {
8136 int sgn = isl_int_sgn(bmap->ineq[i][pos]);
8143 return lower && upper;
8146 int isl_map_dim_is_bounded(__isl_keep isl_map *map,
8147 enum isl_dim_type type, unsigned pos)
8154 for (i = 0; i < map->n; ++i) {
8156 bounded = isl_basic_map_dim_is_bounded(map->p[i], type, pos);
8157 if (bounded < 0 || !bounded)
8164 /* Return 1 if the specified dim is involved in both an upper bound
8165 * and a lower bound.
8167 int isl_set_dim_is_bounded(__isl_keep isl_set *set,
8168 enum isl_dim_type type, unsigned pos)
8170 return isl_map_dim_is_bounded((isl_map *)set, type, pos);
8173 /* For each of the "n" variables starting at "first", determine
8174 * the sign of the variable and put the results in the first "n"
8175 * elements of the array "signs".
8177 * 1 means that the variable is non-negative
8178 * -1 means that the variable is non-positive
8179 * 0 means the variable attains both positive and negative values.
8181 int isl_basic_set_vars_get_sign(__isl_keep isl_basic_set *bset,
8182 unsigned first, unsigned n, int *signs)
8184 isl_vec *bound = NULL;
8185 struct isl_tab *tab = NULL;
8186 struct isl_tab_undo *snap;
8189 if (!bset || !signs)
8192 bound = isl_vec_alloc(bset->ctx, 1 + isl_basic_set_total_dim(bset));
8193 tab = isl_tab_from_basic_set(bset);
8197 isl_seq_clr(bound->el, bound->size);
8198 isl_int_set_si(bound->el[0], -1);
8200 snap = isl_tab_snap(tab);
8201 for (i = 0; i < n; ++i) {
8204 isl_int_set_si(bound->el[1 + first + i], -1);
8205 if (isl_tab_add_ineq(tab, bound->el) < 0)
8208 isl_int_set_si(bound->el[1 + first + i], 0);
8209 if (isl_tab_rollback(tab, snap) < 0)
8217 isl_int_set_si(bound->el[1 + first + i], 1);
8218 if (isl_tab_add_ineq(tab, bound->el) < 0)
8221 isl_int_set_si(bound->el[1 + first + i], 0);
8222 if (isl_tab_rollback(tab, snap) < 0)
8225 signs[i] = empty ? -1 : 0;
8229 isl_vec_free(bound);
8233 isl_vec_free(bound);
8237 int isl_basic_set_dims_get_sign(__isl_keep isl_basic_set *bset,
8238 enum isl_dim_type type, unsigned first, unsigned n, int *signs)
8240 if (!bset || !signs)
8242 isl_assert(bset->ctx, first + n <= isl_basic_set_dim(bset, type),
8245 first += pos(bset->dim, type) - 1;
8246 return isl_basic_set_vars_get_sign(bset, first, n, signs);
8249 /* Check if the given basic map is obviously single-valued.
8250 * In particular, for each output dimension, check that there is
8251 * an equality that defines the output dimension in terms of
8252 * earlier dimensions.
8254 int isl_basic_map_plain_is_single_valued(__isl_keep isl_basic_map *bmap)
8264 total = 1 + isl_basic_map_total_dim(bmap);
8265 n_out = isl_basic_map_dim(bmap, isl_dim_out);
8266 o_out = isl_basic_map_offset(bmap, isl_dim_out);
8268 for (i = 0; i < n_out; ++i) {
8269 for (j = 0; j < bmap->n_eq; ++j) {
8270 if (isl_int_is_zero(bmap->eq[j][o_out + i]))
8272 if (isl_seq_first_non_zero(bmap->eq[j] + o_out + i + 1,
8273 total - (o_out + i + 1)) == -1)
8276 if (j >= bmap->n_eq)
8283 /* Check if the given map is obviously single-valued.
8285 int isl_map_plain_is_single_valued(__isl_keep isl_map *map)
8294 return isl_basic_map_plain_is_single_valued(map->p[0]);
8297 /* Check if the given map is single-valued.
8302 * and check if the result is a subset of the identity mapping.
8304 int isl_map_is_single_valued(__isl_keep isl_map *map)
8311 sv = isl_map_plain_is_single_valued(map);
8315 test = isl_map_reverse(isl_map_copy(map));
8316 test = isl_map_apply_range(test, isl_map_copy(map));
8318 dim = isl_dim_map_from_set(isl_dim_range(isl_map_get_dim(map)));
8319 id = isl_map_identity(dim);
8321 sv = isl_map_is_subset(test, id);
8329 int isl_map_is_injective(__isl_keep isl_map *map)
8333 map = isl_map_copy(map);
8334 map = isl_map_reverse(map);
8335 in = isl_map_is_single_valued(map);
8341 /* Check if the given map is obviously injective.
8343 int isl_map_plain_is_injective(__isl_keep isl_map *map)
8347 map = isl_map_copy(map);
8348 map = isl_map_reverse(map);
8349 in = isl_map_plain_is_single_valued(map);
8355 int isl_map_is_bijective(__isl_keep isl_map *map)
8359 sv = isl_map_is_single_valued(map);
8363 return isl_map_is_injective(map);
8366 int isl_set_is_singleton(__isl_keep isl_set *set)
8368 return isl_map_is_single_valued((isl_map *)set);
8371 int isl_map_is_translation(__isl_keep isl_map *map)
8376 delta = isl_map_deltas(isl_map_copy(map));
8377 ok = isl_set_is_singleton(delta);
8378 isl_set_free(delta);
8383 static int unique(isl_int *p, unsigned pos, unsigned len)
8385 if (isl_seq_first_non_zero(p, pos) != -1)
8387 if (isl_seq_first_non_zero(p + pos + 1, len - pos - 1) != -1)
8392 int isl_basic_set_is_box(__isl_keep isl_basic_set *bset)
8401 if (isl_basic_set_dim(bset, isl_dim_div) != 0)
8404 nvar = isl_basic_set_dim(bset, isl_dim_set);
8405 ovar = isl_dim_offset(bset->dim, isl_dim_set);
8406 for (j = 0; j < nvar; ++j) {
8407 int lower = 0, upper = 0;
8408 for (i = 0; i < bset->n_eq; ++i) {
8409 if (isl_int_is_zero(bset->eq[i][1 + ovar + j]))
8411 if (!unique(bset->eq[i] + 1 + ovar, j, nvar))
8417 for (i = 0; i < bset->n_ineq; ++i) {
8418 if (isl_int_is_zero(bset->ineq[i][1 + ovar + j]))
8420 if (!unique(bset->ineq[i] + 1 + ovar, j, nvar))
8422 if (isl_int_is_pos(bset->ineq[i][1 + ovar + j]))
8427 if (!lower || !upper)
8434 int isl_set_is_box(__isl_keep isl_set *set)
8441 return isl_basic_set_is_box(set->p[0]);
8444 int isl_basic_set_is_wrapping(__isl_keep isl_basic_set *bset)
8449 return isl_dim_is_wrapping(bset->dim);
8452 int isl_set_is_wrapping(__isl_keep isl_set *set)
8457 return isl_dim_is_wrapping(set->dim);
8460 __isl_give isl_basic_set *isl_basic_map_wrap(__isl_take isl_basic_map *bmap)
8462 bmap = isl_basic_map_cow(bmap);
8466 bmap->dim = isl_dim_wrap(bmap->dim);
8470 bmap = isl_basic_map_finalize(bmap);
8472 return (isl_basic_set *)bmap;
8474 isl_basic_map_free(bmap);
8478 __isl_give isl_set *isl_map_wrap(__isl_take isl_map *map)
8482 map = isl_map_cow(map);
8486 for (i = 0; i < map->n; ++i) {
8487 map->p[i] = (isl_basic_map *)isl_basic_map_wrap(map->p[i]);
8491 map->dim = isl_dim_wrap(map->dim);
8495 return (isl_set *)map;
8501 __isl_give isl_basic_map *isl_basic_set_unwrap(__isl_take isl_basic_set *bset)
8503 bset = isl_basic_set_cow(bset);
8507 bset->dim = isl_dim_unwrap(bset->dim);
8511 bset = isl_basic_set_finalize(bset);
8513 return (isl_basic_map *)bset;
8515 isl_basic_set_free(bset);
8519 __isl_give isl_map *isl_set_unwrap(__isl_take isl_set *set)
8526 if (!isl_set_is_wrapping(set))
8527 isl_die(set->ctx, isl_error_invalid, "not a wrapping set",
8530 set = isl_set_cow(set);
8534 for (i = 0; i < set->n; ++i) {
8535 set->p[i] = (isl_basic_set *)isl_basic_set_unwrap(set->p[i]);
8540 set->dim = isl_dim_unwrap(set->dim);
8544 return (isl_map *)set;
8550 __isl_give isl_basic_map *isl_basic_map_reset(__isl_take isl_basic_map *bmap,
8551 enum isl_dim_type type)
8556 if (!isl_dim_is_named_or_nested(bmap->dim, type))
8559 bmap = isl_basic_map_cow(bmap);
8563 bmap->dim = isl_dim_reset(bmap->dim, type);
8567 bmap = isl_basic_map_finalize(bmap);
8571 isl_basic_map_free(bmap);
8575 __isl_give isl_map *isl_map_reset(__isl_take isl_map *map,
8576 enum isl_dim_type type)
8583 if (!isl_dim_is_named_or_nested(map->dim, type))
8586 map = isl_map_cow(map);
8590 for (i = 0; i < map->n; ++i) {
8591 map->p[i] = isl_basic_map_reset(map->p[i], type);
8595 map->dim = isl_dim_reset(map->dim, type);
8605 __isl_give isl_basic_map *isl_basic_map_flatten(__isl_take isl_basic_map *bmap)
8610 if (!bmap->dim->nested[0] && !bmap->dim->nested[1])
8613 bmap = isl_basic_map_cow(bmap);
8617 bmap->dim = isl_dim_flatten(bmap->dim);
8621 bmap = isl_basic_map_finalize(bmap);
8625 isl_basic_map_free(bmap);
8629 __isl_give isl_basic_set *isl_basic_set_flatten(__isl_take isl_basic_set *bset)
8631 return (isl_basic_set *)isl_basic_map_flatten((isl_basic_map *)bset);
8634 __isl_give isl_basic_map *isl_basic_map_flatten_range(
8635 __isl_take isl_basic_map *bmap)
8640 if (!bmap->dim->nested[1])
8643 bmap = isl_basic_map_cow(bmap);
8647 bmap->dim = isl_dim_flatten_range(bmap->dim);
8651 bmap = isl_basic_map_finalize(bmap);
8655 isl_basic_map_free(bmap);
8659 __isl_give isl_map *isl_map_flatten(__isl_take isl_map *map)
8666 if (!map->dim->nested[0] && !map->dim->nested[1])
8669 map = isl_map_cow(map);
8673 for (i = 0; i < map->n; ++i) {
8674 map->p[i] = isl_basic_map_flatten(map->p[i]);
8678 map->dim = isl_dim_flatten(map->dim);
8688 __isl_give isl_set *isl_set_flatten(__isl_take isl_set *set)
8690 return (isl_set *)isl_map_flatten((isl_map *)set);
8693 __isl_give isl_map *isl_set_flatten_map(__isl_take isl_set *set)
8695 isl_dim *dim, *flat_dim;
8698 dim = isl_set_get_dim(set);
8699 flat_dim = isl_dim_flatten(isl_dim_copy(dim));
8700 map = isl_map_identity(isl_dim_join(isl_dim_reverse(dim), flat_dim));
8701 map = isl_map_intersect_domain(map, set);
8706 __isl_give isl_map *isl_map_flatten_range(__isl_take isl_map *map)
8713 if (!map->dim->nested[1])
8716 map = isl_map_cow(map);
8720 for (i = 0; i < map->n; ++i) {
8721 map->p[i] = isl_basic_map_flatten_range(map->p[i]);
8725 map->dim = isl_dim_flatten_range(map->dim);
8735 /* Reorder the dimensions of "bmap" according to the given dim_map
8736 * and set the dimension specification to "dim".
8738 __isl_give isl_basic_map *isl_basic_map_realign(__isl_take isl_basic_map *bmap,
8739 __isl_take isl_dim *dim, __isl_take struct isl_dim_map *dim_map)
8743 bmap = isl_basic_map_cow(bmap);
8744 if (!bmap || !dim || !dim_map)
8747 res = isl_basic_map_alloc_dim(dim,
8748 bmap->n_div, bmap->n_eq, bmap->n_ineq);
8749 res = isl_basic_map_add_constraints_dim_map(res, bmap, dim_map);
8750 res = isl_basic_map_finalize(res);
8754 isl_basic_map_free(bmap);
8759 /* Reorder the dimensions of "map" according to given reordering.
8761 __isl_give isl_map *isl_map_realign(__isl_take isl_map *map,
8762 __isl_take isl_reordering *r)
8765 struct isl_dim_map *dim_map;
8767 map = isl_map_cow(map);
8768 dim_map = isl_dim_map_from_reordering(r);
8769 if (!map || !r || !dim_map)
8772 for (i = 0; i < map->n; ++i) {
8773 struct isl_dim_map *dim_map_i;
8775 dim_map_i = isl_dim_map_extend(dim_map, map->p[i]);
8777 map->p[i] = isl_basic_map_realign(map->p[i],
8778 isl_dim_copy(r->dim), dim_map_i);
8784 map = isl_map_reset_dim(map, isl_dim_copy(r->dim));
8786 isl_reordering_free(r);
8792 isl_reordering_free(r);
8796 __isl_give isl_set *isl_set_realign(__isl_take isl_set *set,
8797 __isl_take isl_reordering *r)
8799 return (isl_set *)isl_map_realign((isl_map *)set, r);
8802 __isl_give isl_map *isl_map_align_params(__isl_take isl_map *map,
8803 __isl_take isl_dim *model)
8810 ctx = isl_dim_get_ctx(model);
8811 if (!isl_dim_has_named_params(model))
8812 isl_die(ctx, isl_error_invalid,
8813 "model has unnamed parameters", goto error);
8814 if (!isl_dim_has_named_params(map->dim))
8815 isl_die(ctx, isl_error_invalid,
8816 "relation has unnamed parameters", goto error);
8817 if (!isl_dim_match(map->dim, isl_dim_param, model, isl_dim_param)) {
8818 isl_reordering *exp;
8820 model = isl_dim_drop(model, isl_dim_in,
8821 0, isl_dim_size(model, isl_dim_in));
8822 model = isl_dim_drop(model, isl_dim_out,
8823 0, isl_dim_size(model, isl_dim_out));
8824 exp = isl_parameter_alignment_reordering(map->dim, model);
8825 exp = isl_reordering_extend_dim(exp, isl_map_get_dim(map));
8826 map = isl_map_realign(map, exp);
8829 isl_dim_free(model);
8832 isl_dim_free(model);
8837 __isl_give isl_set *isl_set_align_params(__isl_take isl_set *set,
8838 __isl_take isl_dim *model)
8840 return isl_map_align_params(set, model);
8843 __isl_give isl_mat *isl_basic_map_equalities_matrix(
8844 __isl_keep isl_basic_map *bmap, enum isl_dim_type c1,
8845 enum isl_dim_type c2, enum isl_dim_type c3,
8846 enum isl_dim_type c4, enum isl_dim_type c5)
8848 enum isl_dim_type c[5] = { c1, c2, c3, c4, c5 };
8849 struct isl_mat *mat;
8855 mat = isl_mat_alloc(bmap->ctx, bmap->n_eq,
8856 isl_basic_map_total_dim(bmap) + 1);
8859 for (i = 0; i < bmap->n_eq; ++i)
8860 for (j = 0, pos = 0; j < 5; ++j) {
8861 int off = isl_basic_map_offset(bmap, c[j]);
8862 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
8863 isl_int_set(mat->row[i][pos],
8864 bmap->eq[i][off + k]);
8872 __isl_give isl_mat *isl_basic_map_inequalities_matrix(
8873 __isl_keep isl_basic_map *bmap, enum isl_dim_type c1,
8874 enum isl_dim_type c2, enum isl_dim_type c3,
8875 enum isl_dim_type c4, enum isl_dim_type c5)
8877 enum isl_dim_type c[5] = { c1, c2, c3, c4, c5 };
8878 struct isl_mat *mat;
8884 mat = isl_mat_alloc(bmap->ctx, bmap->n_ineq,
8885 isl_basic_map_total_dim(bmap) + 1);
8888 for (i = 0; i < bmap->n_ineq; ++i)
8889 for (j = 0, pos = 0; j < 5; ++j) {
8890 int off = isl_basic_map_offset(bmap, c[j]);
8891 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
8892 isl_int_set(mat->row[i][pos],
8893 bmap->ineq[i][off + k]);
8901 __isl_give isl_basic_map *isl_basic_map_from_constraint_matrices(
8902 __isl_take isl_dim *dim,
8903 __isl_take isl_mat *eq, __isl_take isl_mat *ineq, enum isl_dim_type c1,
8904 enum isl_dim_type c2, enum isl_dim_type c3,
8905 enum isl_dim_type c4, enum isl_dim_type c5)
8907 enum isl_dim_type c[5] = { c1, c2, c3, c4, c5 };
8908 isl_basic_map *bmap;
8914 if (!dim || !eq || !ineq)
8917 if (eq->n_col != ineq->n_col)
8918 isl_die(dim->ctx, isl_error_invalid,
8919 "equalities and inequalities matrices should have "
8920 "same number of columns", goto error);
8922 total = 1 + isl_dim_total(dim);
8924 if (eq->n_col < total)
8925 isl_die(dim->ctx, isl_error_invalid,
8926 "number of columns too small", goto error);
8928 extra = eq->n_col - total;
8930 bmap = isl_basic_map_alloc_dim(isl_dim_copy(dim), extra,
8931 eq->n_row, ineq->n_row);
8934 for (i = 0; i < extra; ++i) {
8935 k = isl_basic_map_alloc_div(bmap);
8938 isl_int_set_si(bmap->div[k][0], 0);
8940 for (i = 0; i < eq->n_row; ++i) {
8941 l = isl_basic_map_alloc_equality(bmap);
8944 for (j = 0, pos = 0; j < 5; ++j) {
8945 int off = isl_basic_map_offset(bmap, c[j]);
8946 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
8947 isl_int_set(bmap->eq[l][off + k],
8953 for (i = 0; i < ineq->n_row; ++i) {
8954 l = isl_basic_map_alloc_inequality(bmap);
8957 for (j = 0, pos = 0; j < 5; ++j) {
8958 int off = isl_basic_map_offset(bmap, c[j]);
8959 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
8960 isl_int_set(bmap->ineq[l][off + k],
8979 __isl_give isl_mat *isl_basic_set_equalities_matrix(
8980 __isl_keep isl_basic_set *bset, enum isl_dim_type c1,
8981 enum isl_dim_type c2, enum isl_dim_type c3, enum isl_dim_type c4)
8983 return isl_basic_map_equalities_matrix((isl_basic_map *)bset,
8984 c1, c2, c3, c4, isl_dim_in);
8987 __isl_give isl_mat *isl_basic_set_inequalities_matrix(
8988 __isl_keep isl_basic_set *bset, enum isl_dim_type c1,
8989 enum isl_dim_type c2, enum isl_dim_type c3, enum isl_dim_type c4)
8991 return isl_basic_map_inequalities_matrix((isl_basic_map *)bset,
8992 c1, c2, c3, c4, isl_dim_in);
8995 __isl_give isl_basic_set *isl_basic_set_from_constraint_matrices(
8996 __isl_take isl_dim *dim,
8997 __isl_take isl_mat *eq, __isl_take isl_mat *ineq, enum isl_dim_type c1,
8998 enum isl_dim_type c2, enum isl_dim_type c3, enum isl_dim_type c4)
9000 return (isl_basic_set*)
9001 isl_basic_map_from_constraint_matrices(dim, eq, ineq,
9002 c1, c2, c3, c4, isl_dim_in);
9005 int isl_basic_map_can_zip(__isl_keep isl_basic_map *bmap)
9010 return isl_dim_can_zip(bmap->dim);
9013 int isl_map_can_zip(__isl_keep isl_map *map)
9018 return isl_dim_can_zip(map->dim);
9021 /* Given a basic map (A -> B) -> (C -> D), return the corresponding basic map
9022 * (A -> C) -> (B -> D).
9024 __isl_give isl_basic_map *isl_basic_map_zip(__isl_take isl_basic_map *bmap)
9033 if (!isl_basic_map_can_zip(bmap))
9034 isl_die(bmap->ctx, isl_error_invalid,
9035 "basic map cannot be zipped", goto error);
9036 pos = isl_basic_map_offset(bmap, isl_dim_in) +
9037 isl_dim_size(bmap->dim->nested[0], isl_dim_in);
9038 n1 = isl_dim_size(bmap->dim->nested[0], isl_dim_out);
9039 n2 = isl_dim_size(bmap->dim->nested[1], isl_dim_in);
9040 bmap = isl_basic_map_swap_vars(bmap, pos, n1, n2);
9043 bmap->dim = isl_dim_zip(bmap->dim);
9048 isl_basic_map_free(bmap);
9052 /* Given a map (A -> B) -> (C -> D), return the corresponding map
9053 * (A -> C) -> (B -> D).
9055 __isl_give isl_map *isl_map_zip(__isl_take isl_map *map)
9062 if (!isl_map_can_zip(map))
9063 isl_die(map->ctx, isl_error_invalid, "map cannot be zipped",
9066 map = isl_map_cow(map);
9070 for (i = 0; i < map->n; ++i) {
9071 map->p[i] = isl_basic_map_zip(map->p[i]);
9076 map->dim = isl_dim_zip(map->dim);
9086 /* Construct a basic map mapping the domain of the affine expression
9087 * to a one-dimensional range prescribed by the affine expression.
9089 __isl_give isl_basic_map *isl_basic_map_from_aff(__isl_take isl_aff *aff)
9093 isl_local_space *ls;
9094 isl_basic_map *bmap;
9099 ls = isl_aff_get_local_space(aff);
9100 ls = isl_local_space_from_domain(ls);
9101 ls = isl_local_space_add_dims(ls, isl_dim_out, 1);
9102 bmap = isl_basic_map_from_local_space(ls);
9103 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
9104 k = isl_basic_map_alloc_equality(bmap);
9108 pos = isl_basic_map_offset(bmap, isl_dim_out);
9109 isl_seq_cpy(bmap->eq[k], aff->v->el + 1, pos);
9110 isl_int_neg(bmap->eq[k][pos], aff->v->el[0]);
9111 isl_seq_cpy(bmap->eq[k] + pos + 1, aff->v->el + 1 + pos,
9112 aff->v->size - (pos + 1));
9115 bmap = isl_basic_map_finalize(bmap);
9119 isl_basic_map_free(bmap);
9123 /* Construct a basic map mapping a domain in the given space to
9124 * to an n-dimensional range, with n the number of elements in the list,
9125 * where each coordinate in the range is prescribed by the
9126 * corresponding affine expression.
9127 * The domains of all affine expressions in the list are assumed to match
9130 __isl_give isl_basic_map *isl_basic_map_from_aff_list(
9131 __isl_take isl_dim *domain_dim, __isl_take isl_aff_list *list)
9135 isl_basic_map *bmap;
9140 dim = isl_dim_from_domain(domain_dim);
9141 bmap = isl_basic_map_universe(dim);
9143 for (i = 0; i < list->n; ++i) {
9145 isl_basic_map *bmap_i;
9147 aff = isl_aff_copy(list->p[i]);
9148 bmap_i = isl_basic_map_from_aff(aff);
9150 bmap = isl_basic_map_flat_range_product(bmap, bmap_i);
9153 isl_aff_list_free(list);
9157 __isl_give isl_set *isl_set_equate(__isl_take isl_set *set,
9158 enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2)
9160 return isl_map_equate(set, type1, pos1, type2, pos2);
9163 /* Add a constraint imposing that the given two dimensions are equal.
9165 __isl_give isl_map *isl_map_equate(__isl_take isl_map *map,
9166 enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2)
9168 isl_basic_map *bmap = NULL;
9174 if (pos1 >= isl_map_dim(map, type1))
9175 isl_die(map->ctx, isl_error_invalid,
9176 "index out of bounds", goto error);
9177 if (pos2 >= isl_map_dim(map, type2))
9178 isl_die(map->ctx, isl_error_invalid,
9179 "index out of bounds", goto error);
9181 bmap = isl_basic_map_alloc_dim(isl_map_get_dim(map), 0, 1, 0);
9182 i = isl_basic_map_alloc_equality(bmap);
9185 isl_seq_clr(bmap->eq[i], 1 + isl_basic_map_total_dim(bmap));
9186 pos1 += isl_basic_map_offset(bmap, type1);
9187 pos2 += isl_basic_map_offset(bmap, type2);
9188 isl_int_set_si(bmap->eq[i][pos1], -1);
9189 isl_int_set_si(bmap->eq[i][pos2], 1);
9190 bmap = isl_basic_map_finalize(bmap);
9192 map = isl_map_intersect(map, isl_map_from_basic_map(bmap));
9196 isl_basic_map_free(bmap);
9201 /* Add a constraint imposing that the given two dimensions have opposite values.
9203 __isl_give isl_map *isl_map_oppose(__isl_take isl_map *map,
9204 enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2)
9206 isl_basic_map *bmap = NULL;
9212 if (pos1 >= isl_map_dim(map, type1))
9213 isl_die(map->ctx, isl_error_invalid,
9214 "index out of bounds", goto error);
9215 if (pos2 >= isl_map_dim(map, type2))
9216 isl_die(map->ctx, isl_error_invalid,
9217 "index out of bounds", goto error);
9219 bmap = isl_basic_map_alloc_dim(isl_map_get_dim(map), 0, 1, 0);
9220 i = isl_basic_map_alloc_equality(bmap);
9223 isl_seq_clr(bmap->eq[i], 1 + isl_basic_map_total_dim(bmap));
9224 pos1 += isl_basic_map_offset(bmap, type1);
9225 pos2 += isl_basic_map_offset(bmap, type2);
9226 isl_int_set_si(bmap->eq[i][pos1], 1);
9227 isl_int_set_si(bmap->eq[i][pos2], 1);
9228 bmap = isl_basic_map_finalize(bmap);
9230 map = isl_map_intersect(map, isl_map_from_basic_map(bmap));
9234 isl_basic_map_free(bmap);