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 int isl_basic_map_alloc_equality(struct isl_basic_map *bmap)
820 isl_assert(ctx, room_for_con(bmap, 1), return -1);
821 isl_assert(ctx, (bmap->eq - bmap->ineq) + bmap->n_eq <= bmap->c_size,
823 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
824 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
825 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_IMPLICIT);
826 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
827 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
828 if ((bmap->eq - bmap->ineq) + bmap->n_eq == bmap->c_size) {
830 int j = isl_basic_map_alloc_inequality(bmap);
834 bmap->ineq[j] = bmap->ineq[bmap->n_ineq - 1];
835 bmap->ineq[bmap->n_ineq - 1] = bmap->eq[-1];
842 isl_seq_clr(bmap->eq[bmap->n_eq] + 1 + isl_basic_map_total_dim(bmap),
843 bmap->extra - bmap->n_div);
847 int isl_basic_set_alloc_equality(struct isl_basic_set *bset)
849 return isl_basic_map_alloc_equality((struct isl_basic_map *)bset);
852 int isl_basic_map_free_equality(struct isl_basic_map *bmap, unsigned n)
856 isl_assert(bmap->ctx, n <= bmap->n_eq, return -1);
861 int isl_basic_set_free_equality(struct isl_basic_set *bset, unsigned n)
863 return isl_basic_map_free_equality((struct isl_basic_map *)bset, n);
866 int isl_basic_map_drop_equality(struct isl_basic_map *bmap, unsigned pos)
871 isl_assert(bmap->ctx, pos < bmap->n_eq, return -1);
873 if (pos != bmap->n_eq - 1) {
875 bmap->eq[pos] = bmap->eq[bmap->n_eq - 1];
876 bmap->eq[bmap->n_eq - 1] = t;
882 int isl_basic_set_drop_equality(struct isl_basic_set *bset, unsigned pos)
884 return isl_basic_map_drop_equality((struct isl_basic_map *)bset, pos);
887 void isl_basic_map_inequality_to_equality(
888 struct isl_basic_map *bmap, unsigned pos)
893 bmap->ineq[pos] = bmap->ineq[bmap->n_ineq - 1];
894 bmap->ineq[bmap->n_ineq - 1] = bmap->eq[-1];
899 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
900 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
901 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
902 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
905 static int room_for_ineq(struct isl_basic_map *bmap, unsigned n)
907 return bmap->n_ineq + n <= bmap->eq - bmap->ineq;
910 int isl_basic_map_alloc_inequality(struct isl_basic_map *bmap)
916 isl_assert(ctx, room_for_ineq(bmap, 1), return -1);
917 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_IMPLICIT);
918 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
919 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
920 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
921 isl_seq_clr(bmap->ineq[bmap->n_ineq] +
922 1 + isl_basic_map_total_dim(bmap),
923 bmap->extra - bmap->n_div);
924 return bmap->n_ineq++;
927 int isl_basic_set_alloc_inequality(struct isl_basic_set *bset)
929 return isl_basic_map_alloc_inequality((struct isl_basic_map *)bset);
932 int isl_basic_map_free_inequality(struct isl_basic_map *bmap, unsigned n)
936 isl_assert(bmap->ctx, n <= bmap->n_ineq, return -1);
941 int isl_basic_set_free_inequality(struct isl_basic_set *bset, unsigned n)
943 return isl_basic_map_free_inequality((struct isl_basic_map *)bset, n);
946 int isl_basic_map_drop_inequality(struct isl_basic_map *bmap, unsigned pos)
951 isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
953 if (pos != bmap->n_ineq - 1) {
955 bmap->ineq[pos] = bmap->ineq[bmap->n_ineq - 1];
956 bmap->ineq[bmap->n_ineq - 1] = t;
957 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
963 int isl_basic_set_drop_inequality(struct isl_basic_set *bset, unsigned pos)
965 return isl_basic_map_drop_inequality((struct isl_basic_map *)bset, pos);
968 __isl_give isl_basic_map *isl_basic_map_add_eq(__isl_take isl_basic_map *bmap,
973 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
976 k = isl_basic_map_alloc_equality(bmap);
979 isl_seq_cpy(bmap->eq[k], eq, 1 + isl_basic_map_total_dim(bmap));
982 isl_basic_map_free(bmap);
986 __isl_give isl_basic_set *isl_basic_set_add_eq(__isl_take isl_basic_set *bset,
989 return (isl_basic_set *)
990 isl_basic_map_add_eq((isl_basic_map *)bset, eq);
993 __isl_give isl_basic_map *isl_basic_map_add_ineq(__isl_take isl_basic_map *bmap,
998 bmap = isl_basic_map_extend_constraints(bmap, 0, 1);
1001 k = isl_basic_map_alloc_inequality(bmap);
1004 isl_seq_cpy(bmap->ineq[k], ineq, 1 + isl_basic_map_total_dim(bmap));
1007 isl_basic_map_free(bmap);
1011 __isl_give isl_basic_set *isl_basic_set_add_ineq(__isl_take isl_basic_set *bset,
1014 return (isl_basic_set *)
1015 isl_basic_map_add_ineq((isl_basic_map *)bset, ineq);
1018 int isl_basic_map_alloc_div(struct isl_basic_map *bmap)
1022 isl_assert(bmap->ctx, bmap->n_div < bmap->extra, return -1);
1023 isl_seq_clr(bmap->div[bmap->n_div] +
1024 1 + 1 + isl_basic_map_total_dim(bmap),
1025 bmap->extra - bmap->n_div);
1026 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
1027 return bmap->n_div++;
1030 int isl_basic_set_alloc_div(struct isl_basic_set *bset)
1032 return isl_basic_map_alloc_div((struct isl_basic_map *)bset);
1035 int isl_basic_map_free_div(struct isl_basic_map *bmap, unsigned n)
1039 isl_assert(bmap->ctx, n <= bmap->n_div, return -1);
1044 int isl_basic_set_free_div(struct isl_basic_set *bset, unsigned n)
1046 return isl_basic_map_free_div((struct isl_basic_map *)bset, n);
1049 /* Copy constraint from src to dst, putting the vars of src at offset
1050 * dim_off in dst and the divs of src at offset div_off in dst.
1051 * If both sets are actually map, then dim_off applies to the input
1054 static void copy_constraint(struct isl_basic_map *dst_map, isl_int *dst,
1055 struct isl_basic_map *src_map, isl_int *src,
1056 unsigned in_off, unsigned out_off, unsigned div_off)
1058 unsigned src_nparam = isl_basic_map_n_param(src_map);
1059 unsigned dst_nparam = isl_basic_map_n_param(dst_map);
1060 unsigned src_in = isl_basic_map_n_in(src_map);
1061 unsigned dst_in = isl_basic_map_n_in(dst_map);
1062 unsigned src_out = isl_basic_map_n_out(src_map);
1063 unsigned dst_out = isl_basic_map_n_out(dst_map);
1064 isl_int_set(dst[0], src[0]);
1065 isl_seq_cpy(dst+1, src+1, isl_min(dst_nparam, src_nparam));
1066 if (dst_nparam > src_nparam)
1067 isl_seq_clr(dst+1+src_nparam,
1068 dst_nparam - src_nparam);
1069 isl_seq_clr(dst+1+dst_nparam, in_off);
1070 isl_seq_cpy(dst+1+dst_nparam+in_off,
1072 isl_min(dst_in-in_off, src_in));
1073 if (dst_in-in_off > src_in)
1074 isl_seq_clr(dst+1+dst_nparam+in_off+src_in,
1075 dst_in - in_off - src_in);
1076 isl_seq_clr(dst+1+dst_nparam+dst_in, out_off);
1077 isl_seq_cpy(dst+1+dst_nparam+dst_in+out_off,
1078 src+1+src_nparam+src_in,
1079 isl_min(dst_out-out_off, src_out));
1080 if (dst_out-out_off > src_out)
1081 isl_seq_clr(dst+1+dst_nparam+dst_in+out_off+src_out,
1082 dst_out - out_off - src_out);
1083 isl_seq_clr(dst+1+dst_nparam+dst_in+dst_out, div_off);
1084 isl_seq_cpy(dst+1+dst_nparam+dst_in+dst_out+div_off,
1085 src+1+src_nparam+src_in+src_out,
1086 isl_min(dst_map->extra-div_off, src_map->n_div));
1087 if (dst_map->n_div-div_off > src_map->n_div)
1088 isl_seq_clr(dst+1+dst_nparam+dst_in+dst_out+
1089 div_off+src_map->n_div,
1090 dst_map->n_div - div_off - src_map->n_div);
1093 static void copy_div(struct isl_basic_map *dst_map, isl_int *dst,
1094 struct isl_basic_map *src_map, isl_int *src,
1095 unsigned in_off, unsigned out_off, unsigned div_off)
1097 isl_int_set(dst[0], src[0]);
1098 copy_constraint(dst_map, dst+1, src_map, src+1, in_off, out_off, div_off);
1101 static struct isl_basic_map *add_constraints(struct isl_basic_map *bmap1,
1102 struct isl_basic_map *bmap2, unsigned i_pos, unsigned o_pos)
1107 if (!bmap1 || !bmap2)
1110 div_off = bmap1->n_div;
1112 for (i = 0; i < bmap2->n_eq; ++i) {
1113 int i1 = isl_basic_map_alloc_equality(bmap1);
1116 copy_constraint(bmap1, bmap1->eq[i1], bmap2, bmap2->eq[i],
1117 i_pos, o_pos, div_off);
1120 for (i = 0; i < bmap2->n_ineq; ++i) {
1121 int i1 = isl_basic_map_alloc_inequality(bmap1);
1124 copy_constraint(bmap1, bmap1->ineq[i1], bmap2, bmap2->ineq[i],
1125 i_pos, o_pos, div_off);
1128 for (i = 0; i < bmap2->n_div; ++i) {
1129 int i1 = isl_basic_map_alloc_div(bmap1);
1132 copy_div(bmap1, bmap1->div[i1], bmap2, bmap2->div[i],
1133 i_pos, o_pos, div_off);
1136 isl_basic_map_free(bmap2);
1141 isl_basic_map_free(bmap1);
1142 isl_basic_map_free(bmap2);
1146 struct isl_basic_set *isl_basic_set_add_constraints(struct isl_basic_set *bset1,
1147 struct isl_basic_set *bset2, unsigned pos)
1149 return (struct isl_basic_set *)
1150 add_constraints((struct isl_basic_map *)bset1,
1151 (struct isl_basic_map *)bset2, 0, pos);
1154 struct isl_basic_map *isl_basic_map_extend_dim(struct isl_basic_map *base,
1155 struct isl_dim *dim, unsigned extra,
1156 unsigned n_eq, unsigned n_ineq)
1158 struct isl_basic_map *ext;
1168 dims_ok = isl_dim_equal(base->dim, dim) &&
1169 base->extra >= base->n_div + extra;
1171 if (dims_ok && room_for_con(base, n_eq + n_ineq) &&
1172 room_for_ineq(base, n_ineq)) {
1177 isl_assert(base->ctx, base->dim->nparam <= dim->nparam, goto error);
1178 isl_assert(base->ctx, base->dim->n_in <= dim->n_in, goto error);
1179 isl_assert(base->ctx, base->dim->n_out <= dim->n_out, goto error);
1180 extra += base->extra;
1182 n_ineq += base->n_ineq;
1184 ext = isl_basic_map_alloc_dim(dim, extra, n_eq, n_ineq);
1190 ext->sample = isl_vec_copy(base->sample);
1191 flags = base->flags;
1192 ext = add_constraints(ext, base, 0, 0);
1195 ISL_F_CLR(ext, ISL_BASIC_SET_FINAL);
1202 isl_basic_map_free(base);
1206 struct isl_basic_set *isl_basic_set_extend_dim(struct isl_basic_set *base,
1207 struct isl_dim *dim, unsigned extra,
1208 unsigned n_eq, unsigned n_ineq)
1210 return (struct isl_basic_set *)
1211 isl_basic_map_extend_dim((struct isl_basic_map *)base, dim,
1212 extra, n_eq, n_ineq);
1215 struct isl_basic_map *isl_basic_map_extend_constraints(
1216 struct isl_basic_map *base, unsigned n_eq, unsigned n_ineq)
1220 return isl_basic_map_extend_dim(base, isl_dim_copy(base->dim),
1224 struct isl_basic_map *isl_basic_map_extend(struct isl_basic_map *base,
1225 unsigned nparam, unsigned n_in, unsigned n_out, unsigned extra,
1226 unsigned n_eq, unsigned n_ineq)
1228 struct isl_basic_map *bmap;
1229 struct isl_dim *dim;
1233 dim = isl_dim_alloc(base->ctx, nparam, n_in, n_out);
1237 bmap = isl_basic_map_extend_dim(base, dim, extra, n_eq, n_ineq);
1240 isl_basic_map_free(base);
1244 struct isl_basic_set *isl_basic_set_extend(struct isl_basic_set *base,
1245 unsigned nparam, unsigned dim, unsigned extra,
1246 unsigned n_eq, unsigned n_ineq)
1248 return (struct isl_basic_set *)
1249 isl_basic_map_extend((struct isl_basic_map *)base,
1250 nparam, 0, dim, extra, n_eq, n_ineq);
1253 struct isl_basic_set *isl_basic_set_extend_constraints(
1254 struct isl_basic_set *base, unsigned n_eq, unsigned n_ineq)
1256 return (struct isl_basic_set *)
1257 isl_basic_map_extend_constraints((struct isl_basic_map *)base,
1261 struct isl_basic_set *isl_basic_set_cow(struct isl_basic_set *bset)
1263 return (struct isl_basic_set *)
1264 isl_basic_map_cow((struct isl_basic_map *)bset);
1267 struct isl_basic_map *isl_basic_map_cow(struct isl_basic_map *bmap)
1272 if (bmap->ref > 1) {
1274 bmap = isl_basic_map_dup(bmap);
1277 ISL_F_CLR(bmap, ISL_BASIC_SET_FINAL);
1281 struct isl_set *isl_set_cow(struct isl_set *set)
1289 return isl_set_dup(set);
1292 struct isl_map *isl_map_cow(struct isl_map *map)
1300 return isl_map_dup(map);
1303 static void swap_vars(struct isl_blk blk, isl_int *a,
1304 unsigned a_len, unsigned b_len)
1306 isl_seq_cpy(blk.data, a+a_len, b_len);
1307 isl_seq_cpy(blk.data+b_len, a, a_len);
1308 isl_seq_cpy(a, blk.data, b_len+a_len);
1311 static __isl_give isl_basic_map *isl_basic_map_swap_vars(
1312 __isl_take isl_basic_map *bmap, unsigned pos, unsigned n1, unsigned n2)
1320 isl_assert(bmap->ctx,
1321 pos + n1 + n2 <= 1 + isl_basic_map_total_dim(bmap), goto error);
1323 if (n1 == 0 || n2 == 0)
1326 bmap = isl_basic_map_cow(bmap);
1330 blk = isl_blk_alloc(bmap->ctx, n1 + n2);
1331 if (isl_blk_is_error(blk))
1334 for (i = 0; i < bmap->n_eq; ++i)
1336 bmap->eq[i] + pos, n1, n2);
1338 for (i = 0; i < bmap->n_ineq; ++i)
1340 bmap->ineq[i] + pos, n1, n2);
1342 for (i = 0; i < bmap->n_div; ++i)
1344 bmap->div[i]+1 + pos, n1, n2);
1346 isl_blk_free(bmap->ctx, blk);
1348 ISL_F_CLR(bmap, ISL_BASIC_SET_NORMALIZED);
1349 bmap = isl_basic_map_gauss(bmap, NULL);
1350 return isl_basic_map_finalize(bmap);
1352 isl_basic_map_free(bmap);
1356 static __isl_give isl_basic_set *isl_basic_set_swap_vars(
1357 __isl_take isl_basic_set *bset, unsigned n)
1362 nparam = isl_basic_set_n_param(bset);
1363 dim = isl_basic_set_n_dim(bset);
1364 isl_assert(bset->ctx, n <= dim, goto error);
1366 return isl_basic_map_swap_vars(bset, 1 + nparam, n, dim - n);
1368 isl_basic_set_free(bset);
1372 struct isl_basic_map *isl_basic_map_set_to_empty(struct isl_basic_map *bmap)
1378 total = isl_basic_map_total_dim(bmap);
1379 isl_basic_map_free_div(bmap, bmap->n_div);
1380 isl_basic_map_free_inequality(bmap, bmap->n_ineq);
1382 isl_basic_map_free_equality(bmap, bmap->n_eq-1);
1384 i = isl_basic_map_alloc_equality(bmap);
1388 isl_int_set_si(bmap->eq[i][0], 1);
1389 isl_seq_clr(bmap->eq[i]+1, total);
1390 ISL_F_SET(bmap, ISL_BASIC_MAP_EMPTY);
1391 isl_vec_free(bmap->sample);
1392 bmap->sample = NULL;
1393 return isl_basic_map_finalize(bmap);
1395 isl_basic_map_free(bmap);
1399 struct isl_basic_set *isl_basic_set_set_to_empty(struct isl_basic_set *bset)
1401 return (struct isl_basic_set *)
1402 isl_basic_map_set_to_empty((struct isl_basic_map *)bset);
1405 void isl_basic_map_swap_div(struct isl_basic_map *bmap, int a, int b)
1408 unsigned off = isl_dim_total(bmap->dim);
1409 isl_int *t = bmap->div[a];
1410 bmap->div[a] = bmap->div[b];
1413 for (i = 0; i < bmap->n_eq; ++i)
1414 isl_int_swap(bmap->eq[i][1+off+a], bmap->eq[i][1+off+b]);
1416 for (i = 0; i < bmap->n_ineq; ++i)
1417 isl_int_swap(bmap->ineq[i][1+off+a], bmap->ineq[i][1+off+b]);
1419 for (i = 0; i < bmap->n_div; ++i)
1420 isl_int_swap(bmap->div[i][1+1+off+a], bmap->div[i][1+1+off+b]);
1421 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1424 /* Eliminate the specified n dimensions starting at first from the
1425 * constraints using Fourier-Motzkin. The dimensions themselves
1428 __isl_give isl_map *isl_map_eliminate(__isl_take isl_map *map,
1429 enum isl_dim_type type, unsigned first, unsigned n)
1438 map = isl_map_cow(map);
1441 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
1442 first += pos(map->dim, type) - 1;
1444 for (i = 0; i < map->n; ++i) {
1445 map->p[i] = isl_basic_map_eliminate_vars(map->p[i], first, n);
1455 /* Eliminate the specified n dimensions starting at first from the
1456 * constraints using Fourier-Motzkin. The dimensions themselves
1459 __isl_give isl_set *isl_set_eliminate(__isl_take isl_set *set,
1460 enum isl_dim_type type, unsigned first, unsigned n)
1462 return (isl_set *)isl_map_eliminate((isl_map *)set, type, first, n);
1465 /* Eliminate the specified n dimensions starting at first from the
1466 * constraints using Fourier-Motzkin. The dimensions themselves
1469 __isl_give isl_set *isl_set_eliminate_dims(__isl_take isl_set *set,
1470 unsigned first, unsigned n)
1472 return isl_set_eliminate(set, isl_dim_set, first, n);
1475 __isl_give isl_basic_map *isl_basic_map_remove_divs(
1476 __isl_take isl_basic_map *bmap)
1478 bmap = isl_basic_map_eliminate_vars(bmap, isl_dim_total(bmap->dim),
1483 return isl_basic_map_finalize(bmap);
1486 __isl_give isl_basic_set *isl_basic_set_remove_divs(
1487 __isl_take isl_basic_set *bset)
1489 return (struct isl_basic_set *)isl_basic_map_remove_divs(
1490 (struct isl_basic_map *)bset);
1493 __isl_give isl_map *isl_map_remove_divs(__isl_take isl_map *map)
1502 map = isl_map_cow(map);
1506 for (i = 0; i < map->n; ++i) {
1507 map->p[i] = isl_basic_map_remove_divs(map->p[i]);
1517 __isl_give isl_set *isl_set_remove_divs(__isl_take isl_set *set)
1519 return isl_map_remove_divs(set);
1522 struct isl_basic_map *isl_basic_map_remove_dims(struct isl_basic_map *bmap,
1523 enum isl_dim_type type, unsigned first, unsigned n)
1527 isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
1531 bmap = isl_basic_map_eliminate_vars(bmap,
1532 isl_basic_map_offset(bmap, type) - 1 + first, n);
1535 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY) && type == isl_dim_div)
1537 bmap = isl_basic_map_drop(bmap, type, first, n);
1540 isl_basic_map_free(bmap);
1544 /* Return true if the definition of the given div (recursively) involves
1545 * any of the given variables.
1547 static int div_involves_vars(__isl_keep isl_basic_map *bmap, int div,
1548 unsigned first, unsigned n)
1551 unsigned div_offset = isl_basic_map_offset(bmap, isl_dim_div);
1553 if (isl_int_is_zero(bmap->div[div][0]))
1555 if (isl_seq_first_non_zero(bmap->div[div] + 1 + first, n) >= 0)
1558 for (i = bmap->n_div - 1; i >= 0; --i) {
1559 if (isl_int_is_zero(bmap->div[div][1 + div_offset + i]))
1561 if (div_involves_vars(bmap, i, first, n))
1568 /* Remove all divs (recursively) involving any of the given dimensions
1569 * in their definitions.
1571 __isl_give isl_basic_map *isl_basic_map_remove_divs_involving_dims(
1572 __isl_take isl_basic_map *bmap,
1573 enum isl_dim_type type, unsigned first, unsigned n)
1579 isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
1581 first += isl_basic_map_offset(bmap, type);
1583 for (i = bmap->n_div - 1; i >= 0; --i) {
1584 if (!div_involves_vars(bmap, i, first, n))
1586 bmap = isl_basic_map_remove_dims(bmap, isl_dim_div, i, 1);
1594 isl_basic_map_free(bmap);
1598 __isl_give isl_map *isl_map_remove_divs_involving_dims(__isl_take isl_map *map,
1599 enum isl_dim_type type, unsigned first, unsigned n)
1608 map = isl_map_cow(map);
1612 for (i = 0; i < map->n; ++i) {
1613 map->p[i] = isl_basic_map_remove_divs_involving_dims(map->p[i],
1624 __isl_give isl_set *isl_set_remove_divs_involving_dims(__isl_take isl_set *set,
1625 enum isl_dim_type type, unsigned first, unsigned n)
1627 return (isl_set *)isl_map_remove_divs_involving_dims((isl_map *)set,
1631 int isl_basic_map_involves_dims(__isl_keep isl_basic_map *bmap,
1632 enum isl_dim_type type, unsigned first, unsigned n)
1639 if (first + n > isl_basic_map_dim(bmap, type))
1640 isl_die(bmap->ctx, isl_error_invalid,
1641 "index out of bounds", return -1);
1643 first += isl_basic_map_offset(bmap, type);
1644 for (i = 0; i < bmap->n_eq; ++i)
1645 if (isl_seq_first_non_zero(bmap->eq[i] + first, n) >= 0)
1647 for (i = 0; i < bmap->n_ineq; ++i)
1648 if (isl_seq_first_non_zero(bmap->ineq[i] + first, n) >= 0)
1654 int isl_map_involves_dims(__isl_keep isl_map *map,
1655 enum isl_dim_type type, unsigned first, unsigned n)
1662 if (first + n > isl_map_dim(map, type))
1663 isl_die(map->ctx, isl_error_invalid,
1664 "index out of bounds", return -1);
1666 for (i = 0; i < map->n; ++i) {
1667 int involves = isl_basic_map_involves_dims(map->p[i],
1669 if (involves < 0 || !involves)
1676 int isl_basic_set_involves_dims(__isl_keep isl_basic_set *bset,
1677 enum isl_dim_type type, unsigned first, unsigned n)
1679 return isl_basic_map_involves_dims(bset, type, first, n);
1682 int isl_set_involves_dims(__isl_keep isl_set *set,
1683 enum isl_dim_type type, unsigned first, unsigned n)
1685 return isl_map_involves_dims(set, type, first, n);
1688 /* Return true if the definition of the given div is unknown or depends
1691 static int div_is_unknown(__isl_keep isl_basic_map *bmap, int div)
1694 unsigned div_offset = isl_basic_map_offset(bmap, isl_dim_div);
1696 if (isl_int_is_zero(bmap->div[div][0]))
1699 for (i = bmap->n_div - 1; i >= 0; --i) {
1700 if (isl_int_is_zero(bmap->div[div][1 + div_offset + i]))
1702 if (div_is_unknown(bmap, i))
1709 /* Remove all divs that are unknown or defined in terms of unknown divs.
1711 __isl_give isl_basic_map *isl_basic_map_remove_unknown_divs(
1712 __isl_take isl_basic_map *bmap)
1719 for (i = bmap->n_div - 1; i >= 0; --i) {
1720 if (!div_is_unknown(bmap, i))
1722 bmap = isl_basic_map_remove_dims(bmap, isl_dim_div, i, 1);
1728 __isl_give isl_map *isl_map_remove_unknown_divs(__isl_take isl_map *map)
1737 map = isl_map_cow(map);
1741 for (i = 0; i < map->n; ++i) {
1742 map->p[i] = isl_basic_map_remove_unknown_divs(map->p[i]);
1752 __isl_give isl_set *isl_set_remove_unknown_divs(__isl_take isl_set *set)
1754 return (isl_set *)isl_map_remove_unknown_divs((isl_map *)set);
1757 __isl_give isl_basic_set *isl_basic_set_remove_dims(
1758 __isl_take isl_basic_set *bset,
1759 enum isl_dim_type type, unsigned first, unsigned n)
1761 return (isl_basic_set *)
1762 isl_basic_map_remove_dims((isl_basic_map *)bset, type, first, n);
1765 struct isl_map *isl_map_remove_dims(struct isl_map *map,
1766 enum isl_dim_type type, unsigned first, unsigned n)
1773 map = isl_map_cow(map);
1776 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
1778 for (i = 0; i < map->n; ++i) {
1779 map->p[i] = isl_basic_map_eliminate_vars(map->p[i],
1780 isl_basic_map_offset(map->p[i], type) - 1 + first, n);
1784 map = isl_map_drop(map, type, first, n);
1791 __isl_give isl_set *isl_set_remove_dims(__isl_take isl_set *bset,
1792 enum isl_dim_type type, unsigned first, unsigned n)
1794 return (isl_set *)isl_map_remove_dims((isl_map *)bset, type, first, n);
1797 /* Project out n inputs starting at first using Fourier-Motzkin */
1798 struct isl_map *isl_map_remove_inputs(struct isl_map *map,
1799 unsigned first, unsigned n)
1801 return isl_map_remove_dims(map, isl_dim_in, first, n);
1804 static void dump_term(struct isl_basic_map *bmap,
1805 isl_int c, int pos, FILE *out)
1808 unsigned in = isl_basic_map_n_in(bmap);
1809 unsigned dim = in + isl_basic_map_n_out(bmap);
1810 unsigned nparam = isl_basic_map_n_param(bmap);
1812 isl_int_print(out, c, 0);
1814 if (!isl_int_is_one(c))
1815 isl_int_print(out, c, 0);
1816 if (pos < 1 + nparam) {
1817 name = isl_dim_get_name(bmap->dim,
1818 isl_dim_param, pos - 1);
1820 fprintf(out, "%s", name);
1822 fprintf(out, "p%d", pos - 1);
1823 } else if (pos < 1 + nparam + in)
1824 fprintf(out, "i%d", pos - 1 - nparam);
1825 else if (pos < 1 + nparam + dim)
1826 fprintf(out, "o%d", pos - 1 - nparam - in);
1828 fprintf(out, "e%d", pos - 1 - nparam - dim);
1832 static void dump_constraint_sign(struct isl_basic_map *bmap, isl_int *c,
1833 int sign, FILE *out)
1837 unsigned len = 1 + isl_basic_map_total_dim(bmap);
1841 for (i = 0, first = 1; i < len; ++i) {
1842 if (isl_int_sgn(c[i]) * sign <= 0)
1845 fprintf(out, " + ");
1847 isl_int_abs(v, c[i]);
1848 dump_term(bmap, v, i, out);
1855 static void dump_constraint(struct isl_basic_map *bmap, isl_int *c,
1856 const char *op, FILE *out, int indent)
1860 fprintf(out, "%*s", indent, "");
1862 dump_constraint_sign(bmap, c, 1, out);
1863 fprintf(out, " %s ", op);
1864 dump_constraint_sign(bmap, c, -1, out);
1868 for (i = bmap->n_div; i < bmap->extra; ++i) {
1869 if (isl_int_is_zero(c[1+isl_dim_total(bmap->dim)+i]))
1871 fprintf(out, "%*s", indent, "");
1872 fprintf(out, "ERROR: unused div coefficient not zero\n");
1877 static void dump_constraints(struct isl_basic_map *bmap,
1878 isl_int **c, unsigned n,
1879 const char *op, FILE *out, int indent)
1883 for (i = 0; i < n; ++i)
1884 dump_constraint(bmap, c[i], op, out, indent);
1887 static void dump_affine(struct isl_basic_map *bmap, isl_int *exp, FILE *out)
1891 unsigned total = isl_basic_map_total_dim(bmap);
1893 for (j = 0; j < 1 + total; ++j) {
1894 if (isl_int_is_zero(exp[j]))
1896 if (!first && isl_int_is_pos(exp[j]))
1898 dump_term(bmap, exp[j], j, out);
1903 static void dump(struct isl_basic_map *bmap, FILE *out, int indent)
1907 dump_constraints(bmap, bmap->eq, bmap->n_eq, "=", out, indent);
1908 dump_constraints(bmap, bmap->ineq, bmap->n_ineq, ">=", out, indent);
1910 for (i = 0; i < bmap->n_div; ++i) {
1911 fprintf(out, "%*s", indent, "");
1912 fprintf(out, "e%d = [(", i);
1913 dump_affine(bmap, bmap->div[i]+1, out);
1915 isl_int_print(out, bmap->div[i][0], 0);
1916 fprintf(out, "]\n");
1920 void isl_basic_set_print_internal(struct isl_basic_set *bset,
1921 FILE *out, int indent)
1924 fprintf(out, "null basic set\n");
1928 fprintf(out, "%*s", indent, "");
1929 fprintf(out, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n",
1930 bset->ref, bset->dim->nparam, bset->dim->n_out,
1931 bset->extra, bset->flags);
1932 dump((struct isl_basic_map *)bset, out, indent);
1935 void isl_basic_map_print_internal(struct isl_basic_map *bmap,
1936 FILE *out, int indent)
1939 fprintf(out, "null basic map\n");
1943 fprintf(out, "%*s", indent, "");
1944 fprintf(out, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, "
1945 "flags: %x, n_name: %d\n",
1947 bmap->dim->nparam, bmap->dim->n_in, bmap->dim->n_out,
1948 bmap->extra, bmap->flags, bmap->dim->n_id);
1949 dump(bmap, out, indent);
1952 int isl_inequality_negate(struct isl_basic_map *bmap, unsigned pos)
1957 total = isl_basic_map_total_dim(bmap);
1958 isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
1959 isl_seq_neg(bmap->ineq[pos], bmap->ineq[pos], 1 + total);
1960 isl_int_sub_ui(bmap->ineq[pos][0], bmap->ineq[pos][0], 1);
1961 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1965 struct isl_set *isl_set_alloc_dim(struct isl_dim *dim, int n, unsigned flags)
1967 struct isl_set *set;
1971 isl_assert(dim->ctx, dim->n_in == 0, goto error);
1972 isl_assert(dim->ctx, n >= 0, goto error);
1973 set = isl_alloc(dim->ctx, struct isl_set,
1974 sizeof(struct isl_set) +
1975 (n - 1) * sizeof(struct isl_basic_set *));
1979 set->ctx = dim->ctx;
1980 isl_ctx_ref(set->ctx);
1992 struct isl_set *isl_set_alloc(struct isl_ctx *ctx,
1993 unsigned nparam, unsigned dim, int n, unsigned flags)
1995 struct isl_set *set;
1996 struct isl_dim *dims;
1998 dims = isl_dim_alloc(ctx, nparam, 0, dim);
2002 set = isl_set_alloc_dim(dims, n, flags);
2006 /* Make sure "map" has room for at least "n" more basic maps.
2008 struct isl_map *isl_map_grow(struct isl_map *map, int n)
2011 struct isl_map *grown = NULL;
2015 isl_assert(map->ctx, n >= 0, goto error);
2016 if (map->n + n <= map->size)
2018 grown = isl_map_alloc_dim(isl_map_get_dim(map), map->n + n, map->flags);
2021 for (i = 0; i < map->n; ++i) {
2022 grown->p[i] = isl_basic_map_copy(map->p[i]);
2030 isl_map_free(grown);
2035 /* Make sure "set" has room for at least "n" more basic sets.
2037 struct isl_set *isl_set_grow(struct isl_set *set, int n)
2039 return (struct isl_set *)isl_map_grow((struct isl_map *)set, n);
2042 struct isl_set *isl_set_dup(struct isl_set *set)
2045 struct isl_set *dup;
2050 dup = isl_set_alloc_dim(isl_dim_copy(set->dim), set->n, set->flags);
2053 for (i = 0; i < set->n; ++i)
2054 dup = isl_set_add_basic_set(dup, isl_basic_set_copy(set->p[i]));
2058 struct isl_set *isl_set_from_basic_set(struct isl_basic_set *bset)
2060 return isl_map_from_basic_map(bset);
2063 struct isl_map *isl_map_from_basic_map(struct isl_basic_map *bmap)
2065 struct isl_map *map;
2070 map = isl_map_alloc_dim(isl_dim_copy(bmap->dim), 1, ISL_MAP_DISJOINT);
2071 return isl_map_add_basic_map(map, bmap);
2074 __isl_give isl_set *isl_set_add_basic_set(__isl_take isl_set *set,
2075 __isl_take isl_basic_set *bset)
2077 return (struct isl_set *)isl_map_add_basic_map((struct isl_map *)set,
2078 (struct isl_basic_map *)bset);
2081 void isl_set_free(struct isl_set *set)
2091 isl_ctx_deref(set->ctx);
2092 for (i = 0; i < set->n; ++i)
2093 isl_basic_set_free(set->p[i]);
2094 isl_dim_free(set->dim);
2098 void isl_set_print_internal(struct isl_set *set, FILE *out, int indent)
2103 fprintf(out, "null set\n");
2107 fprintf(out, "%*s", indent, "");
2108 fprintf(out, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
2109 set->ref, set->n, set->dim->nparam, set->dim->n_out,
2111 for (i = 0; i < set->n; ++i) {
2112 fprintf(out, "%*s", indent, "");
2113 fprintf(out, "basic set %d:\n", i);
2114 isl_basic_set_print_internal(set->p[i], out, indent+4);
2118 void isl_map_print_internal(struct isl_map *map, FILE *out, int indent)
2123 fprintf(out, "null map\n");
2127 fprintf(out, "%*s", indent, "");
2128 fprintf(out, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, "
2129 "flags: %x, n_name: %d\n",
2130 map->ref, map->n, map->dim->nparam, map->dim->n_in,
2131 map->dim->n_out, map->flags, map->dim->n_id);
2132 for (i = 0; i < map->n; ++i) {
2133 fprintf(out, "%*s", indent, "");
2134 fprintf(out, "basic map %d:\n", i);
2135 isl_basic_map_print_internal(map->p[i], out, indent+4);
2139 struct isl_basic_map *isl_basic_map_intersect_domain(
2140 struct isl_basic_map *bmap, struct isl_basic_set *bset)
2142 struct isl_basic_map *bmap_domain;
2147 isl_assert(bset->ctx, isl_dim_match(bmap->dim, isl_dim_param,
2148 bset->dim, isl_dim_param), goto error);
2150 if (isl_dim_size(bset->dim, isl_dim_set) != 0)
2151 isl_assert(bset->ctx,
2152 isl_basic_map_compatible_domain(bmap, bset), goto error);
2154 bmap = isl_basic_map_cow(bmap);
2157 bmap = isl_basic_map_extend_dim(bmap, isl_dim_copy(bmap->dim),
2158 bset->n_div, bset->n_eq, bset->n_ineq);
2159 bmap_domain = isl_basic_map_from_domain(bset);
2160 bmap = add_constraints(bmap, bmap_domain, 0, 0);
2162 bmap = isl_basic_map_simplify(bmap);
2163 return isl_basic_map_finalize(bmap);
2165 isl_basic_map_free(bmap);
2166 isl_basic_set_free(bset);
2170 struct isl_basic_map *isl_basic_map_intersect_range(
2171 struct isl_basic_map *bmap, struct isl_basic_set *bset)
2173 struct isl_basic_map *bmap_range;
2178 isl_assert(bset->ctx, isl_dim_match(bmap->dim, isl_dim_param,
2179 bset->dim, isl_dim_param), goto error);
2181 if (isl_dim_size(bset->dim, isl_dim_set) != 0)
2182 isl_assert(bset->ctx,
2183 isl_basic_map_compatible_range(bmap, bset), goto error);
2185 if (isl_basic_set_is_universe(bset)) {
2186 isl_basic_set_free(bset);
2190 bmap = isl_basic_map_cow(bmap);
2193 bmap = isl_basic_map_extend_dim(bmap, isl_dim_copy(bmap->dim),
2194 bset->n_div, bset->n_eq, bset->n_ineq);
2195 bmap_range = isl_basic_map_from_basic_set(bset, isl_dim_copy(bset->dim));
2196 bmap = add_constraints(bmap, bmap_range, 0, 0);
2198 bmap = isl_basic_map_simplify(bmap);
2199 return isl_basic_map_finalize(bmap);
2201 isl_basic_map_free(bmap);
2202 isl_basic_set_free(bset);
2206 int isl_basic_map_contains(struct isl_basic_map *bmap, struct isl_vec *vec)
2212 total = 1 + isl_basic_map_total_dim(bmap);
2213 if (total != vec->size)
2218 for (i = 0; i < bmap->n_eq; ++i) {
2219 isl_seq_inner_product(vec->el, bmap->eq[i], total, &s);
2220 if (!isl_int_is_zero(s)) {
2226 for (i = 0; i < bmap->n_ineq; ++i) {
2227 isl_seq_inner_product(vec->el, bmap->ineq[i], total, &s);
2228 if (isl_int_is_neg(s)) {
2239 int isl_basic_set_contains(struct isl_basic_set *bset, struct isl_vec *vec)
2241 return isl_basic_map_contains((struct isl_basic_map *)bset, vec);
2244 struct isl_basic_map *isl_basic_map_intersect(
2245 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2247 struct isl_vec *sample = NULL;
2249 if (!bmap1 || !bmap2)
2252 isl_assert(bmap1->ctx, isl_dim_match(bmap1->dim, isl_dim_param,
2253 bmap2->dim, isl_dim_param), goto error);
2254 if (isl_dim_total(bmap1->dim) ==
2255 isl_dim_size(bmap1->dim, isl_dim_param) &&
2256 isl_dim_total(bmap2->dim) !=
2257 isl_dim_size(bmap2->dim, isl_dim_param))
2258 return isl_basic_map_intersect(bmap2, bmap1);
2260 if (isl_dim_total(bmap2->dim) !=
2261 isl_dim_size(bmap2->dim, isl_dim_param))
2262 isl_assert(bmap1->ctx,
2263 isl_dim_equal(bmap1->dim, bmap2->dim), goto error);
2265 if (bmap1->sample &&
2266 isl_basic_map_contains(bmap1, bmap1->sample) > 0 &&
2267 isl_basic_map_contains(bmap2, bmap1->sample) > 0)
2268 sample = isl_vec_copy(bmap1->sample);
2269 else if (bmap2->sample &&
2270 isl_basic_map_contains(bmap1, bmap2->sample) > 0 &&
2271 isl_basic_map_contains(bmap2, bmap2->sample) > 0)
2272 sample = isl_vec_copy(bmap2->sample);
2274 bmap1 = isl_basic_map_cow(bmap1);
2277 bmap1 = isl_basic_map_extend_dim(bmap1, isl_dim_copy(bmap1->dim),
2278 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
2279 bmap1 = add_constraints(bmap1, bmap2, 0, 0);
2282 isl_vec_free(sample);
2284 isl_vec_free(bmap1->sample);
2285 bmap1->sample = sample;
2288 bmap1 = isl_basic_map_simplify(bmap1);
2289 return isl_basic_map_finalize(bmap1);
2292 isl_vec_free(sample);
2293 isl_basic_map_free(bmap1);
2294 isl_basic_map_free(bmap2);
2298 struct isl_basic_set *isl_basic_set_intersect(
2299 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
2301 return (struct isl_basic_set *)
2302 isl_basic_map_intersect(
2303 (struct isl_basic_map *)bset1,
2304 (struct isl_basic_map *)bset2);
2307 /* Special case of isl_map_intersect, where both map1 and map2
2308 * are convex, without any divs and such that either map1 or map2
2309 * contains a single constraint. This constraint is then simply
2310 * added to the other map.
2312 static __isl_give isl_map *map_intersect_add_constraint(
2313 __isl_take isl_map *map1, __isl_take isl_map *map2)
2315 isl_assert(map1->ctx, map1->n == 1, goto error);
2316 isl_assert(map2->ctx, map1->n == 1, goto error);
2317 isl_assert(map1->ctx, map1->p[0]->n_div == 0, goto error);
2318 isl_assert(map2->ctx, map1->p[0]->n_div == 0, goto error);
2320 if (map2->p[0]->n_eq + map2->p[0]->n_ineq != 1)
2321 return isl_map_intersect(map2, map1);
2323 isl_assert(map2->ctx,
2324 map2->p[0]->n_eq + map2->p[0]->n_ineq == 1, goto error);
2326 map1 = isl_map_cow(map1);
2329 if (isl_map_plain_is_empty(map1)) {
2333 map1->p[0] = isl_basic_map_cow(map1->p[0]);
2334 if (map2->p[0]->n_eq == 1)
2335 map1->p[0] = isl_basic_map_add_eq(map1->p[0], map2->p[0]->eq[0]);
2337 map1->p[0] = isl_basic_map_add_ineq(map1->p[0],
2338 map2->p[0]->ineq[0]);
2340 map1->p[0] = isl_basic_map_simplify(map1->p[0]);
2341 map1->p[0] = isl_basic_map_finalize(map1->p[0]);
2345 if (isl_basic_map_plain_is_empty(map1->p[0])) {
2346 isl_basic_map_free(map1->p[0]);
2359 struct isl_map *isl_map_intersect(struct isl_map *map1, struct isl_map *map2)
2362 struct isl_map *result;
2368 if (isl_map_plain_is_empty(map1)) {
2372 if (isl_map_plain_is_empty(map2)) {
2377 if (map1->n == 1 && map2->n == 1 &&
2378 map1->p[0]->n_div == 0 && map2->p[0]->n_div == 0 &&
2379 isl_dim_equal(map1->dim, map2->dim) &&
2380 (map1->p[0]->n_eq + map1->p[0]->n_ineq == 1 ||
2381 map2->p[0]->n_eq + map2->p[0]->n_ineq == 1))
2382 return map_intersect_add_constraint(map1, map2);
2383 isl_assert(map1->ctx, isl_dim_match(map1->dim, isl_dim_param,
2384 map2->dim, isl_dim_param), goto error);
2385 if (isl_dim_total(map1->dim) ==
2386 isl_dim_size(map1->dim, isl_dim_param) &&
2387 isl_dim_total(map2->dim) != isl_dim_size(map2->dim, isl_dim_param))
2388 return isl_map_intersect(map2, map1);
2390 if (isl_dim_total(map2->dim) != isl_dim_size(map2->dim, isl_dim_param))
2391 isl_assert(map1->ctx,
2392 isl_dim_equal(map1->dim, map2->dim), goto error);
2394 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
2395 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
2396 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
2398 result = isl_map_alloc_dim(isl_dim_copy(map1->dim),
2399 map1->n * map2->n, flags);
2402 for (i = 0; i < map1->n; ++i)
2403 for (j = 0; j < map2->n; ++j) {
2404 struct isl_basic_map *part;
2405 part = isl_basic_map_intersect(
2406 isl_basic_map_copy(map1->p[i]),
2407 isl_basic_map_copy(map2->p[j]));
2408 if (isl_basic_map_is_empty(part))
2409 isl_basic_map_free(part);
2411 result = isl_map_add_basic_map(result, part);
2424 struct isl_set *isl_set_intersect(struct isl_set *set1, struct isl_set *set2)
2426 return (struct isl_set *)
2427 isl_map_intersect((struct isl_map *)set1,
2428 (struct isl_map *)set2);
2431 /* The current implementation of isl_map_intersect accepts intersections
2432 * with parameter domains, so we can just call that for now.
2434 __isl_give isl_map *isl_map_intersect_params(__isl_take isl_map *map,
2435 __isl_take isl_set *params)
2437 return isl_map_intersect(map, params);
2440 __isl_give isl_set *isl_set_intersect_params(__isl_take isl_set *set,
2441 __isl_take isl_set *params)
2443 return isl_map_intersect_params(set, params);
2446 struct isl_basic_map *isl_basic_map_reverse(struct isl_basic_map *bmap)
2448 struct isl_dim *dim;
2449 struct isl_basic_set *bset;
2454 bmap = isl_basic_map_cow(bmap);
2457 dim = isl_dim_reverse(isl_dim_copy(bmap->dim));
2458 in = isl_basic_map_n_in(bmap);
2459 bset = isl_basic_set_from_basic_map(bmap);
2460 bset = isl_basic_set_swap_vars(bset, in);
2461 return isl_basic_map_from_basic_set(bset, dim);
2464 __isl_give isl_basic_map *isl_basic_map_insert(__isl_take isl_basic_map *bmap,
2465 enum isl_dim_type type, unsigned pos, unsigned n)
2467 struct isl_dim *res_dim;
2468 struct isl_basic_map *res;
2469 struct isl_dim_map *dim_map;
2470 unsigned total, off;
2471 enum isl_dim_type t;
2479 res_dim = isl_dim_insert(isl_basic_map_get_dim(bmap), type, pos, n);
2481 total = isl_basic_map_total_dim(bmap) + n;
2482 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2484 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
2486 isl_dim_map_dim(dim_map, bmap->dim, t, off);
2488 unsigned size = isl_basic_map_dim(bmap, t);
2489 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2491 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2492 pos, size - pos, off + pos + n);
2494 off += isl_dim_size(res_dim, t);
2496 isl_dim_map_div(dim_map, bmap, off);
2498 res = isl_basic_map_alloc_dim(res_dim,
2499 bmap->n_div, bmap->n_eq, bmap->n_ineq);
2500 if (isl_basic_map_is_rational(bmap))
2501 res = isl_basic_map_set_rational(res);
2502 res = isl_basic_map_add_constraints_dim_map(res, bmap, dim_map);
2503 return isl_basic_map_finalize(res);
2506 __isl_give isl_basic_map *isl_basic_map_add(__isl_take isl_basic_map *bmap,
2507 enum isl_dim_type type, unsigned n)
2511 return isl_basic_map_insert(bmap, type,
2512 isl_basic_map_dim(bmap, type), n);
2515 __isl_give isl_basic_set *isl_basic_set_add(__isl_take isl_basic_set *bset,
2516 enum isl_dim_type type, unsigned n)
2520 isl_assert(bset->ctx, type != isl_dim_in, goto error);
2521 return (isl_basic_set *)isl_basic_map_add((isl_basic_map *)bset, type, n);
2523 isl_basic_set_free(bset);
2527 __isl_give isl_map *isl_map_insert(__isl_take isl_map *map,
2528 enum isl_dim_type type, unsigned pos, unsigned n)
2535 map = isl_map_cow(map);
2539 map->dim = isl_dim_insert(map->dim, type, pos, n);
2543 for (i = 0; i < map->n; ++i) {
2544 map->p[i] = isl_basic_map_insert(map->p[i], type, pos, n);
2555 __isl_give isl_set *isl_set_insert(__isl_take isl_set *set,
2556 enum isl_dim_type type, unsigned pos, unsigned n)
2558 return (isl_set *)isl_map_insert((isl_map *)set, type, pos, n);
2561 __isl_give isl_map *isl_map_add_dims(__isl_take isl_map *map,
2562 enum isl_dim_type type, unsigned n)
2566 return isl_map_insert(map, type, isl_map_dim(map, type), n);
2569 __isl_give isl_set *isl_set_add_dims(__isl_take isl_set *set,
2570 enum isl_dim_type type, unsigned n)
2574 isl_assert(set->ctx, type != isl_dim_in, goto error);
2575 return (isl_set *)isl_map_add_dims((isl_map *)set, type, n);
2581 __isl_give isl_basic_map *isl_basic_map_move_dims(
2582 __isl_take isl_basic_map *bmap,
2583 enum isl_dim_type dst_type, unsigned dst_pos,
2584 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2586 struct isl_dim_map *dim_map;
2587 struct isl_basic_map *res;
2588 enum isl_dim_type t;
2589 unsigned total, off;
2596 isl_assert(bmap->ctx, src_pos + n <= isl_basic_map_dim(bmap, src_type),
2599 if (dst_type == src_type && dst_pos == src_pos)
2602 isl_assert(bmap->ctx, dst_type != src_type, goto error);
2604 if (pos(bmap->dim, dst_type) + dst_pos ==
2605 pos(bmap->dim, src_type) + src_pos +
2606 ((src_type < dst_type) ? n : 0)) {
2607 bmap = isl_basic_map_cow(bmap);
2611 bmap->dim = isl_dim_move(bmap->dim, dst_type, dst_pos,
2612 src_type, src_pos, n);
2616 bmap = isl_basic_map_finalize(bmap);
2621 total = isl_basic_map_total_dim(bmap);
2622 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2625 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
2626 unsigned size = isl_dim_size(bmap->dim, t);
2627 if (t == dst_type) {
2628 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2631 isl_dim_map_dim_range(dim_map, bmap->dim, src_type,
2634 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2635 dst_pos, size - dst_pos, off);
2636 off += size - dst_pos;
2637 } else if (t == src_type) {
2638 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2641 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2642 src_pos + n, size - src_pos - n, off);
2643 off += size - src_pos - n;
2645 isl_dim_map_dim(dim_map, bmap->dim, t, off);
2649 isl_dim_map_div(dim_map, bmap, off);
2651 res = isl_basic_map_alloc_dim(isl_basic_map_get_dim(bmap),
2652 bmap->n_div, bmap->n_eq, bmap->n_ineq);
2653 bmap = isl_basic_map_add_constraints_dim_map(res, bmap, dim_map);
2655 bmap->dim = isl_dim_move(bmap->dim, dst_type, dst_pos,
2656 src_type, src_pos, n);
2660 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
2661 bmap = isl_basic_map_gauss(bmap, NULL);
2662 bmap = isl_basic_map_finalize(bmap);
2666 isl_basic_map_free(bmap);
2670 __isl_give isl_basic_set *isl_basic_set_move_dims(__isl_take isl_basic_set *bset,
2671 enum isl_dim_type dst_type, unsigned dst_pos,
2672 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2674 return (isl_basic_set *)isl_basic_map_move_dims(
2675 (isl_basic_map *)bset, dst_type, dst_pos, src_type, src_pos, n);
2678 __isl_give isl_set *isl_set_move_dims(__isl_take isl_set *set,
2679 enum isl_dim_type dst_type, unsigned dst_pos,
2680 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2684 isl_assert(set->ctx, dst_type != isl_dim_in, goto error);
2685 return (isl_set *)isl_map_move_dims((isl_map *)set, dst_type, dst_pos,
2686 src_type, src_pos, n);
2692 __isl_give isl_map *isl_map_move_dims(__isl_take isl_map *map,
2693 enum isl_dim_type dst_type, unsigned dst_pos,
2694 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2703 isl_assert(map->ctx, src_pos + n <= isl_map_dim(map, src_type),
2706 if (dst_type == src_type && dst_pos == src_pos)
2709 isl_assert(map->ctx, dst_type != src_type, goto error);
2711 map = isl_map_cow(map);
2715 map->dim = isl_dim_move(map->dim, dst_type, dst_pos, src_type, src_pos, n);
2719 for (i = 0; i < map->n; ++i) {
2720 map->p[i] = isl_basic_map_move_dims(map->p[i],
2722 src_type, src_pos, n);
2733 /* Move the specified dimensions to the last columns right before
2734 * the divs. Don't change the dimension specification of bmap.
2735 * That's the responsibility of the caller.
2737 static __isl_give isl_basic_map *move_last(__isl_take isl_basic_map *bmap,
2738 enum isl_dim_type type, unsigned first, unsigned n)
2740 struct isl_dim_map *dim_map;
2741 struct isl_basic_map *res;
2742 enum isl_dim_type t;
2743 unsigned total, off;
2747 if (pos(bmap->dim, type) + first + n == 1 + isl_dim_total(bmap->dim))
2750 total = isl_basic_map_total_dim(bmap);
2751 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2754 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
2755 unsigned size = isl_dim_size(bmap->dim, t);
2757 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2760 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2761 first, n, total - bmap->n_div - n);
2762 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2763 first + n, size - (first + n), off);
2764 off += size - (first + n);
2766 isl_dim_map_dim(dim_map, bmap->dim, t, off);
2770 isl_dim_map_div(dim_map, bmap, off + n);
2772 res = isl_basic_map_alloc_dim(isl_basic_map_get_dim(bmap),
2773 bmap->n_div, bmap->n_eq, bmap->n_ineq);
2774 res = isl_basic_map_add_constraints_dim_map(res, bmap, dim_map);
2778 /* Turn the n dimensions of type type, starting at first
2779 * into existentially quantified variables.
2781 __isl_give isl_basic_map *isl_basic_map_project_out(
2782 __isl_take isl_basic_map *bmap,
2783 enum isl_dim_type type, unsigned first, unsigned n)
2796 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL))
2797 return isl_basic_map_remove_dims(bmap, type, first, n);
2799 isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
2802 bmap = move_last(bmap, type, first, n);
2803 bmap = isl_basic_map_cow(bmap);
2807 row_size = 1 + isl_dim_total(bmap->dim) + bmap->extra;
2808 old = bmap->block2.data;
2809 bmap->block2 = isl_blk_extend(bmap->ctx, bmap->block2,
2810 (bmap->extra + n) * (1 + row_size));
2811 if (!bmap->block2.data)
2813 new_div = isl_alloc_array(bmap->ctx, isl_int *, bmap->extra + n);
2816 for (i = 0; i < n; ++i) {
2817 new_div[i] = bmap->block2.data +
2818 (bmap->extra + i) * (1 + row_size);
2819 isl_seq_clr(new_div[i], 1 + row_size);
2821 for (i = 0; i < bmap->extra; ++i)
2822 new_div[n + i] = bmap->block2.data + (bmap->div[i] - old);
2824 bmap->div = new_div;
2828 bmap->dim = isl_dim_drop(bmap->dim, type, first, n);
2831 bmap = isl_basic_map_simplify(bmap);
2832 bmap = isl_basic_map_drop_redundant_divs(bmap);
2833 return isl_basic_map_finalize(bmap);
2835 isl_basic_map_free(bmap);
2839 /* Turn the n dimensions of type type, starting at first
2840 * into existentially quantified variables.
2842 struct isl_basic_set *isl_basic_set_project_out(struct isl_basic_set *bset,
2843 enum isl_dim_type type, unsigned first, unsigned n)
2845 return (isl_basic_set *)isl_basic_map_project_out(
2846 (isl_basic_map *)bset, type, first, n);
2849 /* Turn the n dimensions of type type, starting at first
2850 * into existentially quantified variables.
2852 __isl_give isl_map *isl_map_project_out(__isl_take isl_map *map,
2853 enum isl_dim_type type, unsigned first, unsigned n)
2863 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
2865 map = isl_map_cow(map);
2869 map->dim = isl_dim_drop(map->dim, type, first, n);
2873 for (i = 0; i < map->n; ++i) {
2874 map->p[i] = isl_basic_map_project_out(map->p[i], type, first, n);
2885 /* Turn the n dimensions of type type, starting at first
2886 * into existentially quantified variables.
2888 __isl_give isl_set *isl_set_project_out(__isl_take isl_set *set,
2889 enum isl_dim_type type, unsigned first, unsigned n)
2891 return (isl_set *)isl_map_project_out((isl_map *)set, type, first, n);
2894 static struct isl_basic_map *add_divs(struct isl_basic_map *bmap, unsigned n)
2898 for (i = 0; i < n; ++i) {
2899 j = isl_basic_map_alloc_div(bmap);
2902 isl_seq_clr(bmap->div[j], 1+1+isl_basic_map_total_dim(bmap));
2906 isl_basic_map_free(bmap);
2910 struct isl_basic_map *isl_basic_map_apply_range(
2911 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2913 struct isl_dim *dim_result = NULL;
2914 struct isl_basic_map *bmap;
2915 unsigned n_in, n_out, n, nparam, total, pos;
2916 struct isl_dim_map *dim_map1, *dim_map2;
2918 if (!bmap1 || !bmap2)
2921 dim_result = isl_dim_join(isl_dim_copy(bmap1->dim),
2922 isl_dim_copy(bmap2->dim));
2924 n_in = isl_basic_map_n_in(bmap1);
2925 n_out = isl_basic_map_n_out(bmap2);
2926 n = isl_basic_map_n_out(bmap1);
2927 nparam = isl_basic_map_n_param(bmap1);
2929 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + n;
2930 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
2931 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
2932 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
2933 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
2934 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
2935 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_in);
2936 isl_dim_map_div(dim_map1, bmap1, pos += n_out);
2937 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
2938 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
2939 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
2941 bmap = isl_basic_map_alloc_dim(dim_result,
2942 bmap1->n_div + bmap2->n_div + n,
2943 bmap1->n_eq + bmap2->n_eq,
2944 bmap1->n_ineq + bmap2->n_ineq);
2945 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap1, dim_map1);
2946 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap2, dim_map2);
2947 bmap = add_divs(bmap, n);
2948 bmap = isl_basic_map_simplify(bmap);
2949 bmap = isl_basic_map_drop_redundant_divs(bmap);
2950 return isl_basic_map_finalize(bmap);
2952 isl_basic_map_free(bmap1);
2953 isl_basic_map_free(bmap2);
2957 struct isl_basic_set *isl_basic_set_apply(
2958 struct isl_basic_set *bset, struct isl_basic_map *bmap)
2963 isl_assert(bset->ctx, isl_basic_map_compatible_domain(bmap, bset),
2966 return (struct isl_basic_set *)
2967 isl_basic_map_apply_range((struct isl_basic_map *)bset, bmap);
2969 isl_basic_set_free(bset);
2970 isl_basic_map_free(bmap);
2974 struct isl_basic_map *isl_basic_map_apply_domain(
2975 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2977 if (!bmap1 || !bmap2)
2980 isl_assert(bmap1->ctx,
2981 isl_basic_map_n_in(bmap1) == isl_basic_map_n_in(bmap2), goto error);
2982 isl_assert(bmap1->ctx,
2983 isl_basic_map_n_param(bmap1) == isl_basic_map_n_param(bmap2),
2986 bmap1 = isl_basic_map_reverse(bmap1);
2987 bmap1 = isl_basic_map_apply_range(bmap1, bmap2);
2988 return isl_basic_map_reverse(bmap1);
2990 isl_basic_map_free(bmap1);
2991 isl_basic_map_free(bmap2);
2995 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
2996 * A \cap B -> f(A) + f(B)
2998 struct isl_basic_map *isl_basic_map_sum(
2999 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3001 unsigned n_in, n_out, nparam, total, pos;
3002 struct isl_basic_map *bmap = NULL;
3003 struct isl_dim_map *dim_map1, *dim_map2;
3006 if (!bmap1 || !bmap2)
3009 isl_assert(bmap1->ctx, isl_dim_equal(bmap1->dim, bmap2->dim),
3012 nparam = isl_basic_map_n_param(bmap1);
3013 n_in = isl_basic_map_n_in(bmap1);
3014 n_out = isl_basic_map_n_out(bmap1);
3016 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + 2 * n_out;
3017 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
3018 dim_map2 = isl_dim_map_alloc(bmap2->ctx, total);
3019 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
3020 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos);
3021 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
3022 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
3023 isl_dim_map_div(dim_map1, bmap1, pos += n_in + n_out);
3024 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
3025 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
3026 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_out);
3028 bmap = isl_basic_map_alloc_dim(isl_dim_copy(bmap1->dim),
3029 bmap1->n_div + bmap2->n_div + 2 * n_out,
3030 bmap1->n_eq + bmap2->n_eq + n_out,
3031 bmap1->n_ineq + bmap2->n_ineq);
3032 for (i = 0; i < n_out; ++i) {
3033 int j = isl_basic_map_alloc_equality(bmap);
3036 isl_seq_clr(bmap->eq[j], 1+total);
3037 isl_int_set_si(bmap->eq[j][1+nparam+n_in+i], -1);
3038 isl_int_set_si(bmap->eq[j][1+pos+i], 1);
3039 isl_int_set_si(bmap->eq[j][1+pos-n_out+i], 1);
3041 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap1, dim_map1);
3042 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap2, dim_map2);
3043 bmap = add_divs(bmap, 2 * n_out);
3045 bmap = isl_basic_map_simplify(bmap);
3046 return isl_basic_map_finalize(bmap);
3048 isl_basic_map_free(bmap);
3049 isl_basic_map_free(bmap1);
3050 isl_basic_map_free(bmap2);
3054 /* Given two maps A -> f(A) and B -> g(B), construct a map
3055 * A \cap B -> f(A) + f(B)
3057 struct isl_map *isl_map_sum(struct isl_map *map1, struct isl_map *map2)
3059 struct isl_map *result;
3065 isl_assert(map1->ctx, isl_dim_equal(map1->dim, map2->dim), goto error);
3067 result = isl_map_alloc_dim(isl_dim_copy(map1->dim),
3068 map1->n * map2->n, 0);
3071 for (i = 0; i < map1->n; ++i)
3072 for (j = 0; j < map2->n; ++j) {
3073 struct isl_basic_map *part;
3074 part = isl_basic_map_sum(
3075 isl_basic_map_copy(map1->p[i]),
3076 isl_basic_map_copy(map2->p[j]));
3077 if (isl_basic_map_is_empty(part))
3078 isl_basic_map_free(part);
3080 result = isl_map_add_basic_map(result, part);
3093 __isl_give isl_set *isl_set_sum(__isl_take isl_set *set1,
3094 __isl_take isl_set *set2)
3096 return (isl_set *)isl_map_sum((isl_map *)set1, (isl_map *)set2);
3099 /* Given a basic map A -> f(A), construct A -> -f(A).
3101 struct isl_basic_map *isl_basic_map_neg(struct isl_basic_map *bmap)
3106 bmap = isl_basic_map_cow(bmap);
3110 n = isl_basic_map_dim(bmap, isl_dim_out);
3111 off = isl_basic_map_offset(bmap, isl_dim_out);
3112 for (i = 0; i < bmap->n_eq; ++i)
3113 for (j = 0; j < n; ++j)
3114 isl_int_neg(bmap->eq[i][off+j], bmap->eq[i][off+j]);
3115 for (i = 0; i < bmap->n_ineq; ++i)
3116 for (j = 0; j < n; ++j)
3117 isl_int_neg(bmap->ineq[i][off+j], bmap->ineq[i][off+j]);
3118 for (i = 0; i < bmap->n_div; ++i)
3119 for (j = 0; j < n; ++j)
3120 isl_int_neg(bmap->div[i][1+off+j], bmap->div[i][1+off+j]);
3121 return isl_basic_map_finalize(bmap);
3124 __isl_give isl_basic_set *isl_basic_set_neg(__isl_take isl_basic_set *bset)
3126 return isl_basic_map_neg(bset);
3129 /* Given a map A -> f(A), construct A -> -f(A).
3131 struct isl_map *isl_map_neg(struct isl_map *map)
3135 map = isl_map_cow(map);
3139 for (i = 0; i < map->n; ++i) {
3140 map->p[i] = isl_basic_map_neg(map->p[i]);
3151 __isl_give isl_set *isl_set_neg(__isl_take isl_set *set)
3153 return (isl_set *)isl_map_neg((isl_map *)set);
3156 /* Given a basic map A -> f(A) and an integer d, construct a basic map
3157 * A -> floor(f(A)/d).
3159 struct isl_basic_map *isl_basic_map_floordiv(struct isl_basic_map *bmap,
3162 unsigned n_in, n_out, nparam, total, pos;
3163 struct isl_basic_map *result = NULL;
3164 struct isl_dim_map *dim_map;
3170 nparam = isl_basic_map_n_param(bmap);
3171 n_in = isl_basic_map_n_in(bmap);
3172 n_out = isl_basic_map_n_out(bmap);
3174 total = nparam + n_in + n_out + bmap->n_div + n_out;
3175 dim_map = isl_dim_map_alloc(bmap->ctx, total);
3176 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_param, pos = 0);
3177 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_in, pos += nparam);
3178 isl_dim_map_div(dim_map, bmap, pos += n_in + n_out);
3179 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_out, pos += bmap->n_div);
3181 result = isl_basic_map_alloc_dim(isl_dim_copy(bmap->dim),
3182 bmap->n_div + n_out,
3183 bmap->n_eq, bmap->n_ineq + 2 * n_out);
3184 result = isl_basic_map_add_constraints_dim_map(result, bmap, dim_map);
3185 result = add_divs(result, n_out);
3186 for (i = 0; i < n_out; ++i) {
3188 j = isl_basic_map_alloc_inequality(result);
3191 isl_seq_clr(result->ineq[j], 1+total);
3192 isl_int_neg(result->ineq[j][1+nparam+n_in+i], d);
3193 isl_int_set_si(result->ineq[j][1+pos+i], 1);
3194 j = isl_basic_map_alloc_inequality(result);
3197 isl_seq_clr(result->ineq[j], 1+total);
3198 isl_int_set(result->ineq[j][1+nparam+n_in+i], d);
3199 isl_int_set_si(result->ineq[j][1+pos+i], -1);
3200 isl_int_sub_ui(result->ineq[j][0], d, 1);
3203 result = isl_basic_map_simplify(result);
3204 return isl_basic_map_finalize(result);
3206 isl_basic_map_free(result);
3210 /* Given a map A -> f(A) and an integer d, construct a map
3211 * A -> floor(f(A)/d).
3213 struct isl_map *isl_map_floordiv(struct isl_map *map, isl_int d)
3217 map = isl_map_cow(map);
3221 ISL_F_CLR(map, ISL_MAP_DISJOINT);
3222 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3223 for (i = 0; i < map->n; ++i) {
3224 map->p[i] = isl_basic_map_floordiv(map->p[i], d);
3235 static struct isl_basic_map *var_equal(struct isl_basic_map *bmap, unsigned pos)
3241 i = isl_basic_map_alloc_equality(bmap);
3244 nparam = isl_basic_map_n_param(bmap);
3245 n_in = isl_basic_map_n_in(bmap);
3246 isl_seq_clr(bmap->eq[i], 1 + isl_basic_map_total_dim(bmap));
3247 isl_int_set_si(bmap->eq[i][1+nparam+pos], -1);
3248 isl_int_set_si(bmap->eq[i][1+nparam+n_in+pos], 1);
3249 return isl_basic_map_finalize(bmap);
3251 isl_basic_map_free(bmap);
3255 /* Add a constraints to "bmap" expressing i_pos < o_pos
3257 static struct isl_basic_map *var_less(struct isl_basic_map *bmap, unsigned pos)
3263 i = isl_basic_map_alloc_inequality(bmap);
3266 nparam = isl_basic_map_n_param(bmap);
3267 n_in = isl_basic_map_n_in(bmap);
3268 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
3269 isl_int_set_si(bmap->ineq[i][0], -1);
3270 isl_int_set_si(bmap->ineq[i][1+nparam+pos], -1);
3271 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], 1);
3272 return isl_basic_map_finalize(bmap);
3274 isl_basic_map_free(bmap);
3278 /* Add a constraint to "bmap" expressing i_pos <= o_pos
3280 static __isl_give isl_basic_map *var_less_or_equal(
3281 __isl_take isl_basic_map *bmap, unsigned pos)
3287 i = isl_basic_map_alloc_inequality(bmap);
3290 nparam = isl_basic_map_n_param(bmap);
3291 n_in = isl_basic_map_n_in(bmap);
3292 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
3293 isl_int_set_si(bmap->ineq[i][1+nparam+pos], -1);
3294 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], 1);
3295 return isl_basic_map_finalize(bmap);
3297 isl_basic_map_free(bmap);
3301 /* Add a constraints to "bmap" expressing i_pos > o_pos
3303 static struct isl_basic_map *var_more(struct isl_basic_map *bmap, unsigned pos)
3309 i = isl_basic_map_alloc_inequality(bmap);
3312 nparam = isl_basic_map_n_param(bmap);
3313 n_in = isl_basic_map_n_in(bmap);
3314 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
3315 isl_int_set_si(bmap->ineq[i][0], -1);
3316 isl_int_set_si(bmap->ineq[i][1+nparam+pos], 1);
3317 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], -1);
3318 return isl_basic_map_finalize(bmap);
3320 isl_basic_map_free(bmap);
3324 /* Add a constraint to "bmap" expressing i_pos >= o_pos
3326 static __isl_give isl_basic_map *var_more_or_equal(
3327 __isl_take isl_basic_map *bmap, unsigned pos)
3333 i = isl_basic_map_alloc_inequality(bmap);
3336 nparam = isl_basic_map_n_param(bmap);
3337 n_in = isl_basic_map_n_in(bmap);
3338 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
3339 isl_int_set_si(bmap->ineq[i][1+nparam+pos], 1);
3340 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], -1);
3341 return isl_basic_map_finalize(bmap);
3343 isl_basic_map_free(bmap);
3347 struct isl_basic_map *isl_basic_map_equal(struct isl_dim *dim, unsigned n_equal)
3350 struct isl_basic_map *bmap;
3351 bmap = isl_basic_map_alloc_dim(dim, 0, n_equal, 0);
3354 for (i = 0; i < n_equal && bmap; ++i)
3355 bmap = var_equal(bmap, i);
3356 return isl_basic_map_finalize(bmap);
3359 /* Return a relation on of dimension "dim" expressing i_[0..pos] << o_[0..pos]
3361 struct isl_basic_map *isl_basic_map_less_at(struct isl_dim *dim, unsigned pos)
3364 struct isl_basic_map *bmap;
3365 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
3368 for (i = 0; i < pos && bmap; ++i)
3369 bmap = var_equal(bmap, i);
3371 bmap = var_less(bmap, pos);
3372 return isl_basic_map_finalize(bmap);
3375 /* Return a relation on of dimension "dim" expressing i_[0..pos] <<= o_[0..pos]
3377 __isl_give isl_basic_map *isl_basic_map_less_or_equal_at(
3378 __isl_take isl_dim *dim, unsigned pos)
3381 isl_basic_map *bmap;
3383 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
3384 for (i = 0; i < pos; ++i)
3385 bmap = var_equal(bmap, i);
3386 bmap = var_less_or_equal(bmap, pos);
3387 return isl_basic_map_finalize(bmap);
3390 /* Return a relation on pairs of sets of dimension "dim" expressing i_pos > o_pos
3392 struct isl_basic_map *isl_basic_map_more_at(struct isl_dim *dim, unsigned pos)
3395 struct isl_basic_map *bmap;
3396 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
3399 for (i = 0; i < pos && bmap; ++i)
3400 bmap = var_equal(bmap, i);
3402 bmap = var_more(bmap, pos);
3403 return isl_basic_map_finalize(bmap);
3406 /* Return a relation on of dimension "dim" expressing i_[0..pos] >>= o_[0..pos]
3408 __isl_give isl_basic_map *isl_basic_map_more_or_equal_at(
3409 __isl_take isl_dim *dim, unsigned pos)
3412 isl_basic_map *bmap;
3414 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
3415 for (i = 0; i < pos; ++i)
3416 bmap = var_equal(bmap, i);
3417 bmap = var_more_or_equal(bmap, pos);
3418 return isl_basic_map_finalize(bmap);
3421 static __isl_give isl_map *map_lex_lte_first(__isl_take isl_dim *dims,
3422 unsigned n, int equal)
3424 struct isl_map *map;
3427 if (n == 0 && equal)
3428 return isl_map_universe(dims);
3430 map = isl_map_alloc_dim(isl_dim_copy(dims), n, ISL_MAP_DISJOINT);
3432 for (i = 0; i + 1 < n; ++i)
3433 map = isl_map_add_basic_map(map,
3434 isl_basic_map_less_at(isl_dim_copy(dims), i));
3437 map = isl_map_add_basic_map(map,
3438 isl_basic_map_less_or_equal_at(dims, n - 1));
3440 map = isl_map_add_basic_map(map,
3441 isl_basic_map_less_at(dims, n - 1));
3448 static __isl_give isl_map *map_lex_lte(__isl_take isl_dim *dims, int equal)
3452 return map_lex_lte_first(dims, dims->n_out, equal);
3455 __isl_give isl_map *isl_map_lex_lt_first(__isl_take isl_dim *dim, unsigned n)
3457 return map_lex_lte_first(dim, n, 0);
3460 __isl_give isl_map *isl_map_lex_le_first(__isl_take isl_dim *dim, unsigned n)
3462 return map_lex_lte_first(dim, n, 1);
3465 __isl_give isl_map *isl_map_lex_lt(__isl_take isl_dim *set_dim)
3467 return map_lex_lte(isl_dim_map_from_set(set_dim), 0);
3470 __isl_give isl_map *isl_map_lex_le(__isl_take isl_dim *set_dim)
3472 return map_lex_lte(isl_dim_map_from_set(set_dim), 1);
3475 static __isl_give isl_map *map_lex_gte_first(__isl_take isl_dim *dims,
3476 unsigned n, int equal)
3478 struct isl_map *map;
3481 if (n == 0 && equal)
3482 return isl_map_universe(dims);
3484 map = isl_map_alloc_dim(isl_dim_copy(dims), n, ISL_MAP_DISJOINT);
3486 for (i = 0; i + 1 < n; ++i)
3487 map = isl_map_add_basic_map(map,
3488 isl_basic_map_more_at(isl_dim_copy(dims), i));
3491 map = isl_map_add_basic_map(map,
3492 isl_basic_map_more_or_equal_at(dims, n - 1));
3494 map = isl_map_add_basic_map(map,
3495 isl_basic_map_more_at(dims, n - 1));
3502 static __isl_give isl_map *map_lex_gte(__isl_take isl_dim *dims, int equal)
3506 return map_lex_gte_first(dims, dims->n_out, equal);
3509 __isl_give isl_map *isl_map_lex_gt_first(__isl_take isl_dim *dim, unsigned n)
3511 return map_lex_gte_first(dim, n, 0);
3514 __isl_give isl_map *isl_map_lex_ge_first(__isl_take isl_dim *dim, unsigned n)
3516 return map_lex_gte_first(dim, n, 1);
3519 __isl_give isl_map *isl_map_lex_gt(__isl_take isl_dim *set_dim)
3521 return map_lex_gte(isl_dim_map_from_set(set_dim), 0);
3524 __isl_give isl_map *isl_map_lex_ge(__isl_take isl_dim *set_dim)
3526 return map_lex_gte(isl_dim_map_from_set(set_dim), 1);
3529 __isl_give isl_map *isl_set_lex_le_set(__isl_take isl_set *set1,
3530 __isl_take isl_set *set2)
3533 map = isl_map_lex_le(isl_set_get_dim(set1));
3534 map = isl_map_intersect_domain(map, set1);
3535 map = isl_map_intersect_range(map, set2);
3539 __isl_give isl_map *isl_set_lex_lt_set(__isl_take isl_set *set1,
3540 __isl_take isl_set *set2)
3543 map = isl_map_lex_lt(isl_set_get_dim(set1));
3544 map = isl_map_intersect_domain(map, set1);
3545 map = isl_map_intersect_range(map, set2);
3549 __isl_give isl_map *isl_set_lex_ge_set(__isl_take isl_set *set1,
3550 __isl_take isl_set *set2)
3553 map = isl_map_lex_ge(isl_set_get_dim(set1));
3554 map = isl_map_intersect_domain(map, set1);
3555 map = isl_map_intersect_range(map, set2);
3559 __isl_give isl_map *isl_set_lex_gt_set(__isl_take isl_set *set1,
3560 __isl_take isl_set *set2)
3563 map = isl_map_lex_gt(isl_set_get_dim(set1));
3564 map = isl_map_intersect_domain(map, set1);
3565 map = isl_map_intersect_range(map, set2);
3569 __isl_give isl_map *isl_map_lex_le_map(__isl_take isl_map *map1,
3570 __isl_take isl_map *map2)
3573 map = isl_map_lex_le(isl_dim_range(isl_map_get_dim(map1)));
3574 map = isl_map_apply_domain(map, isl_map_reverse(map1));
3575 map = isl_map_apply_range(map, isl_map_reverse(map2));
3579 __isl_give isl_map *isl_map_lex_lt_map(__isl_take isl_map *map1,
3580 __isl_take isl_map *map2)
3583 map = isl_map_lex_lt(isl_dim_range(isl_map_get_dim(map1)));
3584 map = isl_map_apply_domain(map, isl_map_reverse(map1));
3585 map = isl_map_apply_range(map, isl_map_reverse(map2));
3589 __isl_give isl_map *isl_map_lex_ge_map(__isl_take isl_map *map1,
3590 __isl_take isl_map *map2)
3593 map = isl_map_lex_ge(isl_dim_range(isl_map_get_dim(map1)));
3594 map = isl_map_apply_domain(map, isl_map_reverse(map1));
3595 map = isl_map_apply_range(map, isl_map_reverse(map2));
3599 __isl_give isl_map *isl_map_lex_gt_map(__isl_take isl_map *map1,
3600 __isl_take isl_map *map2)
3603 map = isl_map_lex_gt(isl_dim_range(isl_map_get_dim(map1)));
3604 map = isl_map_apply_domain(map, isl_map_reverse(map1));
3605 map = isl_map_apply_range(map, isl_map_reverse(map2));
3609 struct isl_basic_map *isl_basic_map_from_basic_set(
3610 struct isl_basic_set *bset, struct isl_dim *dim)
3612 struct isl_basic_map *bmap;
3614 bset = isl_basic_set_cow(bset);
3618 isl_assert(bset->ctx, isl_dim_compatible(bset->dim, dim), goto error);
3619 isl_dim_free(bset->dim);
3620 bmap = (struct isl_basic_map *) bset;
3622 return isl_basic_map_finalize(bmap);
3624 isl_basic_set_free(bset);
3629 struct isl_basic_set *isl_basic_set_from_basic_map(struct isl_basic_map *bmap)
3633 if (bmap->dim->n_in == 0)
3634 return (struct isl_basic_set *)bmap;
3635 bmap = isl_basic_map_cow(bmap);
3638 bmap->dim = isl_dim_as_set_dim(bmap->dim);
3641 bmap = isl_basic_map_finalize(bmap);
3642 return (struct isl_basic_set *)bmap;
3644 isl_basic_map_free(bmap);
3648 /* For a div d = floor(f/m), add the constraints
3651 * -(f-(n-1)) + m d >= 0
3653 * Note that the second constraint is the negation of
3657 int isl_basic_map_add_div_constraints_var(__isl_keep isl_basic_map *bmap,
3658 unsigned pos, isl_int *div)
3661 unsigned total = isl_basic_map_total_dim(bmap);
3663 i = isl_basic_map_alloc_inequality(bmap);
3666 isl_seq_cpy(bmap->ineq[i], div + 1, 1 + total);
3667 isl_int_neg(bmap->ineq[i][1 + pos], div[0]);
3669 j = isl_basic_map_alloc_inequality(bmap);
3672 isl_seq_neg(bmap->ineq[j], bmap->ineq[i], 1 + total);
3673 isl_int_add(bmap->ineq[j][0], bmap->ineq[j][0], bmap->ineq[j][1 + pos]);
3674 isl_int_sub_ui(bmap->ineq[j][0], bmap->ineq[j][0], 1);
3678 int isl_basic_set_add_div_constraints_var(__isl_keep isl_basic_set *bset,
3679 unsigned pos, isl_int *div)
3681 return isl_basic_map_add_div_constraints_var((isl_basic_map *)bset,
3685 int isl_basic_map_add_div_constraints(struct isl_basic_map *bmap, unsigned div)
3687 unsigned total = isl_basic_map_total_dim(bmap);
3688 unsigned div_pos = total - bmap->n_div + div;
3690 return isl_basic_map_add_div_constraints_var(bmap, div_pos,
3694 struct isl_basic_set *isl_basic_map_underlying_set(
3695 struct isl_basic_map *bmap)
3699 if (bmap->dim->nparam == 0 && bmap->dim->n_in == 0 &&
3701 !isl_dim_is_named_or_nested(bmap->dim, isl_dim_in) &&
3702 !isl_dim_is_named_or_nested(bmap->dim, isl_dim_out))
3703 return (struct isl_basic_set *)bmap;
3704 bmap = isl_basic_map_cow(bmap);
3707 bmap->dim = isl_dim_underlying(bmap->dim, bmap->n_div);
3710 bmap->extra -= bmap->n_div;
3712 bmap = isl_basic_map_finalize(bmap);
3713 return (struct isl_basic_set *)bmap;
3718 __isl_give isl_basic_set *isl_basic_set_underlying_set(
3719 __isl_take isl_basic_set *bset)
3721 return isl_basic_map_underlying_set((isl_basic_map *)bset);
3724 struct isl_basic_map *isl_basic_map_overlying_set(
3725 struct isl_basic_set *bset, struct isl_basic_map *like)
3727 struct isl_basic_map *bmap;
3728 struct isl_ctx *ctx;
3735 isl_assert(ctx, bset->n_div == 0, goto error);
3736 isl_assert(ctx, isl_basic_set_n_param(bset) == 0, goto error);
3737 isl_assert(ctx, bset->dim->n_out == isl_basic_map_total_dim(like),
3739 if (isl_dim_equal(bset->dim, like->dim) && like->n_div == 0) {
3740 isl_basic_map_free(like);
3741 return (struct isl_basic_map *)bset;
3743 bset = isl_basic_set_cow(bset);
3746 total = bset->dim->n_out + bset->extra;
3747 bmap = (struct isl_basic_map *)bset;
3748 isl_dim_free(bmap->dim);
3749 bmap->dim = isl_dim_copy(like->dim);
3752 bmap->n_div = like->n_div;
3753 bmap->extra += like->n_div;
3757 ltotal = total - bmap->extra + like->extra;
3760 bmap->block2 = isl_blk_extend(ctx, bmap->block2,
3761 bmap->extra * (1 + 1 + total));
3762 if (isl_blk_is_error(bmap->block2))
3764 div = isl_realloc_array(ctx, bmap->div, isl_int *, bmap->extra);
3768 for (i = 0; i < bmap->extra; ++i)
3769 bmap->div[i] = bmap->block2.data + i * (1 + 1 + total);
3770 for (i = 0; i < like->n_div; ++i) {
3771 isl_seq_cpy(bmap->div[i], like->div[i], 1 + 1 + ltotal);
3772 isl_seq_clr(bmap->div[i]+1+1+ltotal, total - ltotal);
3774 bmap = isl_basic_map_extend_constraints(bmap,
3775 0, 2 * like->n_div);
3776 for (i = 0; i < like->n_div; ++i) {
3777 if (isl_int_is_zero(bmap->div[i][0]))
3779 if (isl_basic_map_add_div_constraints(bmap, i) < 0)
3783 isl_basic_map_free(like);
3784 bmap = isl_basic_map_simplify(bmap);
3785 bmap = isl_basic_map_finalize(bmap);
3788 isl_basic_map_free(like);
3789 isl_basic_set_free(bset);
3793 struct isl_basic_set *isl_basic_set_from_underlying_set(
3794 struct isl_basic_set *bset, struct isl_basic_set *like)
3796 return (struct isl_basic_set *)
3797 isl_basic_map_overlying_set(bset, (struct isl_basic_map *)like);
3800 struct isl_set *isl_set_from_underlying_set(
3801 struct isl_set *set, struct isl_basic_set *like)
3807 isl_assert(set->ctx, set->dim->n_out == isl_basic_set_total_dim(like),
3809 if (isl_dim_equal(set->dim, like->dim) && like->n_div == 0) {
3810 isl_basic_set_free(like);
3813 set = isl_set_cow(set);
3816 for (i = 0; i < set->n; ++i) {
3817 set->p[i] = isl_basic_set_from_underlying_set(set->p[i],
3818 isl_basic_set_copy(like));
3822 isl_dim_free(set->dim);
3823 set->dim = isl_dim_copy(like->dim);
3826 isl_basic_set_free(like);
3829 isl_basic_set_free(like);
3834 struct isl_set *isl_map_underlying_set(struct isl_map *map)
3838 map = isl_map_cow(map);
3841 map->dim = isl_dim_cow(map->dim);
3845 for (i = 1; i < map->n; ++i)
3846 isl_assert(map->ctx, map->p[0]->n_div == map->p[i]->n_div,
3848 for (i = 0; i < map->n; ++i) {
3849 map->p[i] = (struct isl_basic_map *)
3850 isl_basic_map_underlying_set(map->p[i]);
3855 map->dim = isl_dim_underlying(map->dim, 0);
3857 isl_dim_free(map->dim);
3858 map->dim = isl_dim_copy(map->p[0]->dim);
3862 return (struct isl_set *)map;
3868 struct isl_set *isl_set_to_underlying_set(struct isl_set *set)
3870 return (struct isl_set *)isl_map_underlying_set((struct isl_map *)set);
3873 __isl_give isl_basic_map *isl_basic_map_reset_dim(
3874 __isl_take isl_basic_map *bmap, __isl_take isl_dim *dim)
3876 bmap = isl_basic_map_cow(bmap);
3880 isl_dim_free(bmap->dim);
3883 bmap = isl_basic_map_finalize(bmap);
3887 isl_basic_map_free(bmap);
3892 __isl_give isl_basic_set *isl_basic_set_reset_dim(
3893 __isl_take isl_basic_set *bset, __isl_take isl_dim *dim)
3895 return (isl_basic_set *)isl_basic_map_reset_dim((isl_basic_map *)bset,
3899 __isl_give isl_map *isl_map_reset_dim(__isl_take isl_map *map,
3900 __isl_take isl_dim *dim)
3904 map = isl_map_cow(map);
3908 for (i = 0; i < map->n; ++i) {
3909 map->p[i] = isl_basic_map_reset_dim(map->p[i],
3914 isl_dim_free(map->dim);
3924 __isl_give isl_set *isl_set_reset_dim(__isl_take isl_set *set,
3925 __isl_take isl_dim *dim)
3927 return (struct isl_set *) isl_map_reset_dim((struct isl_map *)set, dim);
3930 struct isl_basic_set *isl_basic_map_domain(struct isl_basic_map *bmap)
3933 struct isl_basic_set *domain;
3939 dim = isl_dim_domain(isl_basic_map_get_dim(bmap));
3941 n_in = isl_basic_map_n_in(bmap);
3942 n_out = isl_basic_map_n_out(bmap);
3943 domain = isl_basic_set_from_basic_map(bmap);
3944 domain = isl_basic_set_project_out(domain, isl_dim_set, n_in, n_out);
3946 domain = isl_basic_set_reset_dim(domain, dim);
3951 int isl_basic_map_may_be_set(__isl_keep isl_basic_map *bmap)
3955 return isl_dim_may_be_set(bmap->dim);
3958 struct isl_basic_set *isl_basic_map_range(struct isl_basic_map *bmap)
3962 if (isl_basic_map_may_be_set(bmap))
3964 return isl_basic_map_domain(isl_basic_map_reverse(bmap));
3967 __isl_give isl_basic_map *isl_basic_map_domain_map(
3968 __isl_take isl_basic_map *bmap)
3972 isl_basic_map *domain;
3973 int nparam, n_in, n_out;
3976 nparam = isl_basic_map_dim(bmap, isl_dim_param);
3977 n_in = isl_basic_map_dim(bmap, isl_dim_in);
3978 n_out = isl_basic_map_dim(bmap, isl_dim_out);
3980 dim = isl_dim_from_range(isl_dim_domain(isl_basic_map_get_dim(bmap)));
3981 domain = isl_basic_map_universe(dim);
3983 bmap = isl_basic_map_from_domain(isl_basic_map_wrap(bmap));
3984 bmap = isl_basic_map_apply_range(bmap, domain);
3985 bmap = isl_basic_map_extend_constraints(bmap, n_in, 0);
3987 total = isl_basic_map_total_dim(bmap);
3989 for (i = 0; i < n_in; ++i) {
3990 k = isl_basic_map_alloc_equality(bmap);
3993 isl_seq_clr(bmap->eq[k], 1 + total);
3994 isl_int_set_si(bmap->eq[k][1 + nparam + i], -1);
3995 isl_int_set_si(bmap->eq[k][1 + nparam + n_in + n_out + i], 1);
3998 bmap = isl_basic_map_gauss(bmap, NULL);
3999 return isl_basic_map_finalize(bmap);
4001 isl_basic_map_free(bmap);
4005 __isl_give isl_basic_map *isl_basic_map_range_map(
4006 __isl_take isl_basic_map *bmap)
4010 isl_basic_map *range;
4011 int nparam, n_in, n_out;
4014 nparam = isl_basic_map_dim(bmap, isl_dim_param);
4015 n_in = isl_basic_map_dim(bmap, isl_dim_in);
4016 n_out = isl_basic_map_dim(bmap, isl_dim_out);
4018 dim = isl_dim_from_range(isl_dim_range(isl_basic_map_get_dim(bmap)));
4019 range = isl_basic_map_universe(dim);
4021 bmap = isl_basic_map_from_domain(isl_basic_map_wrap(bmap));
4022 bmap = isl_basic_map_apply_range(bmap, range);
4023 bmap = isl_basic_map_extend_constraints(bmap, n_out, 0);
4025 total = isl_basic_map_total_dim(bmap);
4027 for (i = 0; i < n_out; ++i) {
4028 k = isl_basic_map_alloc_equality(bmap);
4031 isl_seq_clr(bmap->eq[k], 1 + total);
4032 isl_int_set_si(bmap->eq[k][1 + nparam + n_in + i], -1);
4033 isl_int_set_si(bmap->eq[k][1 + nparam + n_in + n_out + i], 1);
4036 bmap = isl_basic_map_gauss(bmap, NULL);
4037 return isl_basic_map_finalize(bmap);
4039 isl_basic_map_free(bmap);
4043 int isl_map_may_be_set(__isl_keep isl_map *map)
4047 return isl_dim_may_be_set(map->dim);
4050 struct isl_set *isl_map_range(struct isl_map *map)
4053 struct isl_set *set;
4057 if (isl_map_may_be_set(map))
4058 return (isl_set *)map;
4060 map = isl_map_cow(map);
4064 set = (struct isl_set *) map;
4065 set->dim = isl_dim_drop_inputs(set->dim, 0, set->dim->n_in);
4068 for (i = 0; i < map->n; ++i) {
4069 set->p[i] = isl_basic_map_range(map->p[i]);
4073 ISL_F_CLR(set, ISL_MAP_DISJOINT);
4074 ISL_F_CLR(set, ISL_SET_NORMALIZED);
4081 __isl_give isl_map *isl_map_domain_map(__isl_take isl_map *map)
4084 isl_dim *domain_dim;
4086 map = isl_map_cow(map);
4090 domain_dim = isl_dim_from_range(isl_dim_domain(isl_map_get_dim(map)));
4091 map->dim = isl_dim_from_domain(isl_dim_wrap(map->dim));
4092 map->dim = isl_dim_join(map->dim, domain_dim);
4095 for (i = 0; i < map->n; ++i) {
4096 map->p[i] = isl_basic_map_domain_map(map->p[i]);
4100 ISL_F_CLR(map, ISL_MAP_DISJOINT);
4101 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4108 __isl_give isl_map *isl_map_range_map(__isl_take isl_map *map)
4113 map = isl_map_cow(map);
4117 range_dim = isl_dim_range(isl_map_get_dim(map));
4118 map->dim = isl_dim_from_domain(isl_dim_wrap(map->dim));
4119 map->dim = isl_dim_join(map->dim, range_dim);
4122 for (i = 0; i < map->n; ++i) {
4123 map->p[i] = isl_basic_map_range_map(map->p[i]);
4127 ISL_F_CLR(map, ISL_MAP_DISJOINT);
4128 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4135 struct isl_map *isl_map_from_set(struct isl_set *set, struct isl_dim *dim)
4138 struct isl_map *map = NULL;
4140 set = isl_set_cow(set);
4143 isl_assert(set->ctx, isl_dim_compatible(set->dim, dim), goto error);
4144 map = (struct isl_map *)set;
4145 for (i = 0; i < set->n; ++i) {
4146 map->p[i] = isl_basic_map_from_basic_set(
4147 set->p[i], isl_dim_copy(dim));
4151 isl_dim_free(map->dim);
4160 __isl_give isl_basic_map *isl_basic_map_from_domain(
4161 __isl_take isl_basic_set *bset)
4163 return isl_basic_map_reverse(isl_basic_map_from_range(bset));
4166 __isl_give isl_basic_map *isl_basic_map_from_range(
4167 __isl_take isl_basic_set *bset)
4169 return (isl_basic_map *)bset;
4172 struct isl_map *isl_map_from_range(struct isl_set *set)
4174 return (struct isl_map *)set;
4177 __isl_give isl_map *isl_map_from_domain(__isl_take isl_set *set)
4179 return isl_map_reverse(isl_map_from_range(set));
4182 __isl_give isl_basic_map *isl_basic_map_from_domain_and_range(
4183 __isl_take isl_basic_set *domain, __isl_take isl_basic_set *range)
4185 return isl_basic_map_apply_range(isl_basic_map_from_domain(domain),
4186 isl_basic_map_from_range(range));
4189 __isl_give isl_map *isl_map_from_domain_and_range(__isl_take isl_set *domain,
4190 __isl_take isl_set *range)
4192 return isl_map_apply_range(isl_map_from_domain(domain),
4193 isl_map_from_range(range));
4196 struct isl_set *isl_set_from_map(struct isl_map *map)
4199 struct isl_set *set = NULL;
4203 map = isl_map_cow(map);
4206 map->dim = isl_dim_as_set_dim(map->dim);
4209 set = (struct isl_set *)map;
4210 for (i = 0; i < map->n; ++i) {
4211 set->p[i] = isl_basic_set_from_basic_map(map->p[i]);
4221 struct isl_map *isl_map_alloc_dim(struct isl_dim *dim, int n, unsigned flags)
4223 struct isl_map *map;
4227 isl_assert(dim->ctx, n >= 0, return NULL);
4228 map = isl_alloc(dim->ctx, struct isl_map,
4229 sizeof(struct isl_map) +
4230 (n - 1) * sizeof(struct isl_basic_map *));
4234 map->ctx = dim->ctx;
4235 isl_ctx_ref(map->ctx);
4247 struct isl_map *isl_map_alloc(struct isl_ctx *ctx,
4248 unsigned nparam, unsigned in, unsigned out, int n,
4251 struct isl_map *map;
4252 struct isl_dim *dims;
4254 dims = isl_dim_alloc(ctx, nparam, in, out);
4258 map = isl_map_alloc_dim(dims, n, flags);
4262 struct isl_basic_map *isl_basic_map_empty(struct isl_dim *dim)
4264 struct isl_basic_map *bmap;
4265 bmap = isl_basic_map_alloc_dim(dim, 0, 1, 0);
4266 bmap = isl_basic_map_set_to_empty(bmap);
4270 struct isl_basic_set *isl_basic_set_empty(struct isl_dim *dim)
4272 struct isl_basic_set *bset;
4273 bset = isl_basic_set_alloc_dim(dim, 0, 1, 0);
4274 bset = isl_basic_set_set_to_empty(bset);
4278 struct isl_basic_map *isl_basic_map_empty_like(struct isl_basic_map *model)
4280 struct isl_basic_map *bmap;
4283 bmap = isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
4284 bmap = isl_basic_map_set_to_empty(bmap);
4288 struct isl_basic_map *isl_basic_map_empty_like_map(struct isl_map *model)
4290 struct isl_basic_map *bmap;
4293 bmap = isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
4294 bmap = isl_basic_map_set_to_empty(bmap);
4298 struct isl_basic_set *isl_basic_set_empty_like(struct isl_basic_set *model)
4300 struct isl_basic_set *bset;
4303 bset = isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
4304 bset = isl_basic_set_set_to_empty(bset);
4308 struct isl_basic_map *isl_basic_map_universe(struct isl_dim *dim)
4310 struct isl_basic_map *bmap;
4311 bmap = isl_basic_map_alloc_dim(dim, 0, 0, 0);
4312 bmap = isl_basic_map_finalize(bmap);
4316 struct isl_basic_set *isl_basic_set_universe(struct isl_dim *dim)
4318 struct isl_basic_set *bset;
4319 bset = isl_basic_set_alloc_dim(dim, 0, 0, 0);
4320 bset = isl_basic_set_finalize(bset);
4324 __isl_give isl_basic_map *isl_basic_map_nat_universe(__isl_take isl_dim *dim)
4327 unsigned total = isl_dim_total(dim);
4328 isl_basic_map *bmap;
4330 bmap= isl_basic_map_alloc_dim(dim, 0, 0, total);
4331 for (i = 0; i < total; ++i) {
4332 int k = isl_basic_map_alloc_inequality(bmap);
4335 isl_seq_clr(bmap->ineq[k], 1 + total);
4336 isl_int_set_si(bmap->ineq[k][1 + i], 1);
4340 isl_basic_map_free(bmap);
4344 __isl_give isl_basic_set *isl_basic_set_nat_universe(__isl_take isl_dim *dim)
4346 return isl_basic_map_nat_universe(dim);
4349 __isl_give isl_map *isl_map_nat_universe(__isl_take isl_dim *dim)
4351 return isl_map_from_basic_map(isl_basic_map_nat_universe(dim));
4354 __isl_give isl_set *isl_set_nat_universe(__isl_take isl_dim *dim)
4356 return isl_map_nat_universe(dim);
4359 __isl_give isl_basic_map *isl_basic_map_universe_like(
4360 __isl_keep isl_basic_map *model)
4364 return isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
4367 struct isl_basic_set *isl_basic_set_universe_like(struct isl_basic_set *model)
4371 return isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
4374 __isl_give isl_basic_set *isl_basic_set_universe_like_set(
4375 __isl_keep isl_set *model)
4379 return isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
4382 struct isl_map *isl_map_empty(struct isl_dim *dim)
4384 return isl_map_alloc_dim(dim, 0, ISL_MAP_DISJOINT);
4387 struct isl_map *isl_map_empty_like(struct isl_map *model)
4391 return isl_map_alloc_dim(isl_dim_copy(model->dim), 0, ISL_MAP_DISJOINT);
4394 struct isl_map *isl_map_empty_like_basic_map(struct isl_basic_map *model)
4398 return isl_map_alloc_dim(isl_dim_copy(model->dim), 0, ISL_MAP_DISJOINT);
4401 struct isl_set *isl_set_empty(struct isl_dim *dim)
4403 return isl_set_alloc_dim(dim, 0, ISL_MAP_DISJOINT);
4406 struct isl_set *isl_set_empty_like(struct isl_set *model)
4410 return isl_set_empty(isl_dim_copy(model->dim));
4413 struct isl_map *isl_map_universe(struct isl_dim *dim)
4415 struct isl_map *map;
4418 map = isl_map_alloc_dim(isl_dim_copy(dim), 1, ISL_MAP_DISJOINT);
4419 map = isl_map_add_basic_map(map, isl_basic_map_universe(dim));
4423 struct isl_set *isl_set_universe(struct isl_dim *dim)
4425 struct isl_set *set;
4428 set = isl_set_alloc_dim(isl_dim_copy(dim), 1, ISL_MAP_DISJOINT);
4429 set = isl_set_add_basic_set(set, isl_basic_set_universe(dim));
4433 __isl_give isl_set *isl_set_universe_like(__isl_keep isl_set *model)
4437 return isl_set_universe(isl_dim_copy(model->dim));
4440 struct isl_map *isl_map_dup(struct isl_map *map)
4443 struct isl_map *dup;
4447 dup = isl_map_alloc_dim(isl_dim_copy(map->dim), map->n, map->flags);
4448 for (i = 0; i < map->n; ++i)
4449 dup = isl_map_add_basic_map(dup, isl_basic_map_copy(map->p[i]));
4453 __isl_give isl_map *isl_map_add_basic_map(__isl_take isl_map *map,
4454 __isl_take isl_basic_map *bmap)
4458 if (isl_basic_map_plain_is_empty(bmap)) {
4459 isl_basic_map_free(bmap);
4462 isl_assert(map->ctx, isl_dim_equal(map->dim, bmap->dim), goto error);
4463 isl_assert(map->ctx, map->n < map->size, goto error);
4464 map->p[map->n] = bmap;
4466 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4472 isl_basic_map_free(bmap);
4476 void isl_map_free(struct isl_map *map)
4486 isl_ctx_deref(map->ctx);
4487 for (i = 0; i < map->n; ++i)
4488 isl_basic_map_free(map->p[i]);
4489 isl_dim_free(map->dim);
4493 struct isl_map *isl_map_extend(struct isl_map *base,
4494 unsigned nparam, unsigned n_in, unsigned n_out)
4498 base = isl_map_cow(base);
4502 base->dim = isl_dim_extend(base->dim, nparam, n_in, n_out);
4505 for (i = 0; i < base->n; ++i) {
4506 base->p[i] = isl_basic_map_extend_dim(base->p[i],
4507 isl_dim_copy(base->dim), 0, 0, 0);
4517 struct isl_set *isl_set_extend(struct isl_set *base,
4518 unsigned nparam, unsigned dim)
4520 return (struct isl_set *)isl_map_extend((struct isl_map *)base,
4524 static struct isl_basic_map *isl_basic_map_fix_pos_si(
4525 struct isl_basic_map *bmap, unsigned pos, int value)
4529 bmap = isl_basic_map_cow(bmap);
4530 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
4531 j = isl_basic_map_alloc_equality(bmap);
4534 isl_seq_clr(bmap->eq[j] + 1, isl_basic_map_total_dim(bmap));
4535 isl_int_set_si(bmap->eq[j][pos], -1);
4536 isl_int_set_si(bmap->eq[j][0], value);
4537 bmap = isl_basic_map_simplify(bmap);
4538 return isl_basic_map_finalize(bmap);
4540 isl_basic_map_free(bmap);
4544 static __isl_give isl_basic_map *isl_basic_map_fix_pos(
4545 __isl_take isl_basic_map *bmap, unsigned pos, isl_int value)
4549 bmap = isl_basic_map_cow(bmap);
4550 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
4551 j = isl_basic_map_alloc_equality(bmap);
4554 isl_seq_clr(bmap->eq[j] + 1, isl_basic_map_total_dim(bmap));
4555 isl_int_set_si(bmap->eq[j][pos], -1);
4556 isl_int_set(bmap->eq[j][0], value);
4557 bmap = isl_basic_map_simplify(bmap);
4558 return isl_basic_map_finalize(bmap);
4560 isl_basic_map_free(bmap);
4564 struct isl_basic_map *isl_basic_map_fix_si(struct isl_basic_map *bmap,
4565 enum isl_dim_type type, unsigned pos, int value)
4569 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
4570 return isl_basic_map_fix_pos_si(bmap,
4571 isl_basic_map_offset(bmap, type) + pos, value);
4573 isl_basic_map_free(bmap);
4577 __isl_give isl_basic_map *isl_basic_map_fix(__isl_take isl_basic_map *bmap,
4578 enum isl_dim_type type, unsigned pos, isl_int value)
4582 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
4583 return isl_basic_map_fix_pos(bmap,
4584 isl_basic_map_offset(bmap, type) + pos, value);
4586 isl_basic_map_free(bmap);
4590 struct isl_basic_set *isl_basic_set_fix_si(struct isl_basic_set *bset,
4591 enum isl_dim_type type, unsigned pos, int value)
4593 return (struct isl_basic_set *)
4594 isl_basic_map_fix_si((struct isl_basic_map *)bset,
4598 __isl_give isl_basic_set *isl_basic_set_fix(__isl_take isl_basic_set *bset,
4599 enum isl_dim_type type, unsigned pos, isl_int value)
4601 return (struct isl_basic_set *)
4602 isl_basic_map_fix((struct isl_basic_map *)bset,
4606 struct isl_basic_map *isl_basic_map_fix_input_si(struct isl_basic_map *bmap,
4607 unsigned input, int value)
4609 return isl_basic_map_fix_si(bmap, isl_dim_in, input, value);
4612 struct isl_basic_set *isl_basic_set_fix_dim_si(struct isl_basic_set *bset,
4613 unsigned dim, int value)
4615 return (struct isl_basic_set *)
4616 isl_basic_map_fix_si((struct isl_basic_map *)bset,
4617 isl_dim_set, dim, value);
4620 struct isl_map *isl_map_fix_si(struct isl_map *map,
4621 enum isl_dim_type type, unsigned pos, int value)
4625 map = isl_map_cow(map);
4629 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
4630 for (i = 0; i < map->n; ++i) {
4631 map->p[i] = isl_basic_map_fix_si(map->p[i], type, pos, value);
4635 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4642 __isl_give isl_set *isl_set_fix_si(__isl_take isl_set *set,
4643 enum isl_dim_type type, unsigned pos, int value)
4645 return (struct isl_set *)
4646 isl_map_fix_si((struct isl_map *)set, type, pos, value);
4649 __isl_give isl_map *isl_map_fix(__isl_take isl_map *map,
4650 enum isl_dim_type type, unsigned pos, isl_int value)
4654 map = isl_map_cow(map);
4658 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
4659 for (i = 0; i < map->n; ++i) {
4660 map->p[i] = isl_basic_map_fix(map->p[i], type, pos, value);
4664 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4671 __isl_give isl_set *isl_set_fix(__isl_take isl_set *set,
4672 enum isl_dim_type type, unsigned pos, isl_int value)
4674 return (struct isl_set *)isl_map_fix((isl_map *)set, type, pos, value);
4677 struct isl_map *isl_map_fix_input_si(struct isl_map *map,
4678 unsigned input, int value)
4680 return isl_map_fix_si(map, isl_dim_in, input, value);
4683 struct isl_set *isl_set_fix_dim_si(struct isl_set *set, unsigned dim, int value)
4685 return (struct isl_set *)
4686 isl_map_fix_si((struct isl_map *)set, isl_dim_set, dim, value);
4689 __isl_give isl_basic_map *isl_basic_map_lower_bound_si(
4690 __isl_take isl_basic_map *bmap,
4691 enum isl_dim_type type, unsigned pos, int value)
4697 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
4698 pos += isl_basic_map_offset(bmap, type);
4699 bmap = isl_basic_map_cow(bmap);
4700 bmap = isl_basic_map_extend_constraints(bmap, 0, 1);
4701 j = isl_basic_map_alloc_inequality(bmap);
4704 isl_seq_clr(bmap->ineq[j], 1 + isl_basic_map_total_dim(bmap));
4705 isl_int_set_si(bmap->ineq[j][pos], 1);
4706 isl_int_set_si(bmap->ineq[j][0], -value);
4707 bmap = isl_basic_map_simplify(bmap);
4708 return isl_basic_map_finalize(bmap);
4710 isl_basic_map_free(bmap);
4714 struct isl_basic_set *isl_basic_set_lower_bound_dim(struct isl_basic_set *bset,
4715 unsigned dim, isl_int value)
4719 bset = isl_basic_set_cow(bset);
4720 bset = isl_basic_set_extend_constraints(bset, 0, 1);
4721 j = isl_basic_set_alloc_inequality(bset);
4724 isl_seq_clr(bset->ineq[j], 1 + isl_basic_set_total_dim(bset));
4725 isl_int_set_si(bset->ineq[j][1 + isl_basic_set_n_param(bset) + dim], 1);
4726 isl_int_neg(bset->ineq[j][0], value);
4727 bset = isl_basic_set_simplify(bset);
4728 return isl_basic_set_finalize(bset);
4730 isl_basic_set_free(bset);
4734 __isl_give isl_map *isl_map_lower_bound_si(__isl_take isl_map *map,
4735 enum isl_dim_type type, unsigned pos, int value)
4739 map = isl_map_cow(map);
4743 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
4744 for (i = 0; i < map->n; ++i) {
4745 map->p[i] = isl_basic_map_lower_bound_si(map->p[i],
4750 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4757 __isl_give isl_set *isl_set_lower_bound_si(__isl_take isl_set *set,
4758 enum isl_dim_type type, unsigned pos, int value)
4760 return (struct isl_set *)
4761 isl_map_lower_bound_si((struct isl_map *)set, type, pos, value);
4764 struct isl_set *isl_set_lower_bound_dim(struct isl_set *set, unsigned dim,
4769 set = isl_set_cow(set);
4773 isl_assert(set->ctx, dim < isl_set_n_dim(set), goto error);
4774 for (i = 0; i < set->n; ++i) {
4775 set->p[i] = isl_basic_set_lower_bound_dim(set->p[i], dim, value);
4785 struct isl_map *isl_map_reverse(struct isl_map *map)
4789 map = isl_map_cow(map);
4793 map->dim = isl_dim_reverse(map->dim);
4796 for (i = 0; i < map->n; ++i) {
4797 map->p[i] = isl_basic_map_reverse(map->p[i]);
4801 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4808 static struct isl_map *isl_basic_map_partial_lexopt(
4809 struct isl_basic_map *bmap, struct isl_basic_set *dom,
4810 struct isl_set **empty, int max)
4814 if (bmap->ctx->opt->pip == ISL_PIP_PIP)
4815 return isl_pip_basic_map_lexopt(bmap, dom, empty, max);
4817 return isl_tab_basic_map_partial_lexopt(bmap, dom, empty, max);
4819 isl_basic_map_free(bmap);
4820 isl_basic_set_free(dom);
4826 struct isl_map *isl_basic_map_partial_lexmax(
4827 struct isl_basic_map *bmap, struct isl_basic_set *dom,
4828 struct isl_set **empty)
4830 return isl_basic_map_partial_lexopt(bmap, dom, empty, 1);
4833 struct isl_map *isl_basic_map_partial_lexmin(
4834 struct isl_basic_map *bmap, struct isl_basic_set *dom,
4835 struct isl_set **empty)
4837 return isl_basic_map_partial_lexopt(bmap, dom, empty, 0);
4840 struct isl_set *isl_basic_set_partial_lexmin(
4841 struct isl_basic_set *bset, struct isl_basic_set *dom,
4842 struct isl_set **empty)
4844 return (struct isl_set *)
4845 isl_basic_map_partial_lexmin((struct isl_basic_map *)bset,
4849 struct isl_set *isl_basic_set_partial_lexmax(
4850 struct isl_basic_set *bset, struct isl_basic_set *dom,
4851 struct isl_set **empty)
4853 return (struct isl_set *)
4854 isl_basic_map_partial_lexmax((struct isl_basic_map *)bset,
4858 /* Given a basic map "bmap", compute the lexicographically minimal
4859 * (or maximal) image element for each domain element in dom.
4860 * Set *empty to those elements in dom that do not have an image element.
4862 * We first make sure the basic sets in dom are disjoint and then
4863 * simply collect the results over each of the basic sets separately.
4864 * We could probably improve the efficiency a bit by moving the union
4865 * domain down into the parametric integer programming.
4867 static __isl_give isl_map *basic_map_partial_lexopt(
4868 __isl_take isl_basic_map *bmap, __isl_take isl_set *dom,
4869 __isl_give isl_set **empty, int max)
4872 struct isl_map *res;
4874 dom = isl_set_make_disjoint(dom);
4878 if (isl_set_plain_is_empty(dom)) {
4879 res = isl_map_empty_like_basic_map(bmap);
4880 *empty = isl_set_empty_like(dom);
4882 isl_basic_map_free(bmap);
4886 res = isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap),
4887 isl_basic_set_copy(dom->p[0]), empty, max);
4889 for (i = 1; i < dom->n; ++i) {
4890 struct isl_map *res_i;
4891 struct isl_set *empty_i;
4893 res_i = isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap),
4894 isl_basic_set_copy(dom->p[i]), &empty_i, max);
4896 res = isl_map_union_disjoint(res, res_i);
4897 *empty = isl_set_union_disjoint(*empty, empty_i);
4901 isl_basic_map_free(bmap);
4906 isl_basic_map_free(bmap);
4910 /* Given a map "map", compute the lexicographically minimal
4911 * (or maximal) image element for each domain element in dom.
4912 * Set *empty to those elements in dom that do not have an image element.
4914 * We first compute the lexicographically minimal or maximal element
4915 * in the first basic map. This results in a partial solution "res"
4916 * and a subset "todo" of dom that still need to be handled.
4917 * We then consider each of the remaining maps in "map" and successively
4918 * improve both "res" and "todo".
4920 * Let res^k and todo^k be the results after k steps and let i = k + 1.
4921 * Assume we are computing the lexicographical maximum.
4922 * We first compute the lexicographically maximal element in basic map i.
4923 * This results in a partial solution res_i and a subset todo_i.
4924 * Then we combine these results with those obtain for the first k basic maps
4925 * to obtain a result that is valid for the first k+1 basic maps.
4926 * In particular, the set where there is no solution is the set where
4927 * there is no solution for the first k basic maps and also no solution
4928 * for the ith basic map, i.e.,
4930 * todo^i = todo^k * todo_i
4932 * On dom(res^k) * dom(res_i), we need to pick the larger of the two
4933 * solutions, arbitrarily breaking ties in favor of res^k.
4934 * That is, when res^k(a) >= res_i(a), we pick res^k and
4935 * when res^k(a) < res_i(a), we pick res_i. (Here, ">=" and "<" denote
4936 * the lexicographic order.)
4937 * In practice, we compute
4939 * res^k * (res_i . "<=")
4943 * res_i * (res^k . "<")
4945 * Finally, we consider the symmetric difference of dom(res^k) and dom(res_i),
4946 * where only one of res^k and res_i provides a solution and we simply pick
4953 * Note that we only compute these intersections when dom(res^k) intersects
4954 * dom(res_i). Otherwise, the only effect of these intersections is to
4955 * potentially break up res^k and res_i into smaller pieces.
4956 * We want to avoid such splintering as much as possible.
4957 * In fact, an earlier implementation of this function would look for
4958 * better results in the domain of res^k and for extra results in todo^k,
4959 * but this would always result in a splintering according to todo^k,
4960 * even when the domain of basic map i is disjoint from the domains of
4961 * the previous basic maps.
4963 static __isl_give isl_map *isl_map_partial_lexopt(
4964 __isl_take isl_map *map, __isl_take isl_set *dom,
4965 __isl_give isl_set **empty, int max)
4968 struct isl_map *res;
4969 struct isl_set *todo;
4974 if (isl_map_plain_is_empty(map)) {
4982 res = basic_map_partial_lexopt(isl_basic_map_copy(map->p[0]),
4983 isl_set_copy(dom), &todo, max);
4985 for (i = 1; i < map->n; ++i) {
4989 isl_dim *dim = isl_dim_range(isl_map_get_dim(res));
4991 res_i = basic_map_partial_lexopt(isl_basic_map_copy(map->p[i]),
4992 isl_set_copy(dom), &todo_i, max);
4995 lt = isl_map_lex_lt(isl_dim_copy(dim));
4996 le = isl_map_lex_le(dim);
4998 lt = isl_map_lex_gt(isl_dim_copy(dim));
4999 le = isl_map_lex_ge(dim);
5001 lt = isl_map_apply_range(isl_map_copy(res), lt);
5002 lt = isl_map_intersect(lt, isl_map_copy(res_i));
5003 le = isl_map_apply_range(isl_map_copy(res_i), le);
5004 le = isl_map_intersect(le, isl_map_copy(res));
5006 if (!isl_map_is_empty(lt) || !isl_map_is_empty(le)) {
5007 res = isl_map_intersect_domain(res,
5008 isl_set_copy(todo_i));
5009 res_i = isl_map_intersect_domain(res_i,
5010 isl_set_copy(todo));
5013 res = isl_map_union_disjoint(res, res_i);
5014 res = isl_map_union_disjoint(res, lt);
5015 res = isl_map_union_disjoint(res, le);
5017 todo = isl_set_intersect(todo, todo_i);
5037 __isl_give isl_map *isl_map_partial_lexmax(
5038 __isl_take isl_map *map, __isl_take isl_set *dom,
5039 __isl_give isl_set **empty)
5041 return isl_map_partial_lexopt(map, dom, empty, 1);
5044 __isl_give isl_map *isl_map_partial_lexmin(
5045 __isl_take isl_map *map, __isl_take isl_set *dom,
5046 __isl_give isl_set **empty)
5048 return isl_map_partial_lexopt(map, dom, empty, 0);
5051 __isl_give isl_set *isl_set_partial_lexmin(
5052 __isl_take isl_set *set, __isl_take isl_set *dom,
5053 __isl_give isl_set **empty)
5055 return (struct isl_set *)
5056 isl_map_partial_lexmin((struct isl_map *)set,
5060 __isl_give isl_set *isl_set_partial_lexmax(
5061 __isl_take isl_set *set, __isl_take isl_set *dom,
5062 __isl_give isl_set **empty)
5064 return (struct isl_set *)
5065 isl_map_partial_lexmax((struct isl_map *)set,
5069 __isl_give isl_map *isl_basic_map_lexopt(__isl_take isl_basic_map *bmap, int max)
5071 struct isl_basic_set *dom = NULL;
5072 struct isl_dim *dom_dim;
5076 dom_dim = isl_dim_domain(isl_dim_copy(bmap->dim));
5077 dom = isl_basic_set_universe(dom_dim);
5078 return isl_basic_map_partial_lexopt(bmap, dom, NULL, max);
5080 isl_basic_map_free(bmap);
5084 __isl_give isl_map *isl_basic_map_lexmin(__isl_take isl_basic_map *bmap)
5086 return isl_basic_map_lexopt(bmap, 0);
5089 __isl_give isl_map *isl_basic_map_lexmax(__isl_take isl_basic_map *bmap)
5091 return isl_basic_map_lexopt(bmap, 1);
5094 __isl_give isl_set *isl_basic_set_lexmin(__isl_take isl_basic_set *bset)
5096 return (isl_set *)isl_basic_map_lexmin((isl_basic_map *)bset);
5099 __isl_give isl_set *isl_basic_set_lexmax(__isl_take isl_basic_set *bset)
5101 return (isl_set *)isl_basic_map_lexmax((isl_basic_map *)bset);
5104 __isl_give isl_map *isl_map_lexopt(__isl_take isl_map *map, int max)
5106 struct isl_set *dom = NULL;
5107 struct isl_dim *dom_dim;
5111 dom_dim = isl_dim_domain(isl_dim_copy(map->dim));
5112 dom = isl_set_universe(dom_dim);
5113 return isl_map_partial_lexopt(map, dom, NULL, max);
5119 __isl_give isl_map *isl_map_lexmin(__isl_take isl_map *map)
5121 return isl_map_lexopt(map, 0);
5124 __isl_give isl_map *isl_map_lexmax(__isl_take isl_map *map)
5126 return isl_map_lexopt(map, 1);
5129 __isl_give isl_set *isl_set_lexmin(__isl_take isl_set *set)
5131 return (isl_set *)isl_map_lexmin((isl_map *)set);
5134 __isl_give isl_set *isl_set_lexmax(__isl_take isl_set *set)
5136 return (isl_set *)isl_map_lexmax((isl_map *)set);
5139 /* Construct a map that equates the two given dimensions in the given space.
5141 static __isl_give isl_map *equate(__isl_take isl_dim *dim,
5142 enum isl_dim_type src_type, int src_pos,
5143 enum isl_dim_type dst_type, int dst_pos)
5145 isl_basic_map *bmap;
5148 bmap = isl_basic_map_alloc_dim(dim, 0, 1, 0);
5149 k = isl_basic_map_alloc_equality(bmap);
5152 isl_seq_clr(bmap->eq[k], 1 + isl_basic_map_total_dim(bmap));
5153 src_pos += isl_basic_map_offset(bmap, src_type);
5154 dst_pos += isl_basic_map_offset(bmap, dst_type);
5155 isl_int_set_si(bmap->eq[k][src_pos], 1);
5156 isl_int_set_si(bmap->eq[k][dst_pos], -1);
5158 return isl_map_from_basic_map(bmap);
5160 isl_basic_map_free(bmap);
5164 /* Extract the first and only affine expression from list
5165 * and then add it to *pwaff with the given dom.
5166 * This domain is known to be disjoint from other domains
5167 * because of the way isl_basic_set_foreach_lexmax works.
5169 static int update_dim_max(__isl_take isl_basic_set *dom,
5170 __isl_take isl_aff_list *list, void *user)
5172 isl_ctx *ctx = isl_basic_set_get_ctx(dom);
5174 isl_pw_aff **pwaff = user;
5175 isl_pw_aff *pwaff_i;
5177 if (isl_aff_list_n_aff(list) != 1)
5178 isl_die(ctx, isl_error_internal,
5179 "expecting single element list", goto error);
5181 aff = isl_aff_list_get_aff(list, 0);
5182 pwaff_i = isl_pw_aff_alloc(isl_set_from_basic_set(dom), aff);
5184 *pwaff = isl_pw_aff_add_disjoint(*pwaff, pwaff_i);
5186 isl_aff_list_free(list);
5190 isl_basic_set_free(dom);
5191 isl_aff_list_free(list);
5195 /* Given a one-dimensional basic set, compute the maximum of that
5196 * dimension as an isl_pw_aff.
5198 * The isl_pw_aff is constructed by having isl_basic_set_foreach_lexmax
5199 * call update_dim_max on each leaf of the result.
5201 static __isl_give isl_pw_aff *basic_set_dim_max(__isl_keep isl_basic_set *bset)
5203 isl_dim *dim = isl_basic_set_get_dim(bset);
5207 dim = isl_dim_domain(isl_dim_from_range(dim));
5208 pwaff = isl_pw_aff_empty(dim);
5210 r = isl_basic_set_foreach_lexmax(bset, &update_dim_max, &pwaff);
5212 return isl_pw_aff_free(pwaff);
5217 /* Compute the maximum of the given set dimension as a function of the
5218 * parameters, but independently of the other set dimensions.
5220 * We first project the set onto the given dimension and then compute
5221 * the "lexicographic" maximum in each basic set, combining the results
5222 * using isl_pw_aff_union_max.
5224 __isl_give isl_pw_aff *isl_set_dim_max(__isl_take isl_set *set, int pos)
5230 map = isl_map_from_domain(set);
5231 map = isl_map_add_dims(map, isl_dim_out, 1);
5232 map = isl_map_intersect(map,
5233 equate(isl_map_get_dim(map), isl_dim_in, pos,
5235 set = isl_map_range(map);
5240 isl_dim *dim = isl_set_get_dim(set);
5241 dim = isl_dim_domain(isl_dim_from_range(dim));
5243 return isl_pw_aff_empty(dim);
5246 pwaff = basic_set_dim_max(set->p[0]);
5247 for (i = 1; i < set->n; ++i) {
5248 isl_pw_aff *pwaff_i;
5250 pwaff_i = basic_set_dim_max(set->p[i]);
5251 pwaff = isl_pw_aff_union_max(pwaff, pwaff_i);
5259 /* Apply a preimage specified by "mat" on the parameters of "bset".
5260 * bset is assumed to have only parameters and divs.
5262 static struct isl_basic_set *basic_set_parameter_preimage(
5263 struct isl_basic_set *bset, struct isl_mat *mat)
5270 bset->dim = isl_dim_cow(bset->dim);
5274 nparam = isl_basic_set_dim(bset, isl_dim_param);
5276 isl_assert(bset->ctx, mat->n_row == 1 + nparam, goto error);
5278 bset->dim->nparam = 0;
5279 bset->dim->n_out = nparam;
5280 bset = isl_basic_set_preimage(bset, mat);
5282 bset->dim->nparam = bset->dim->n_out;
5283 bset->dim->n_out = 0;
5288 isl_basic_set_free(bset);
5292 /* Apply a preimage specified by "mat" on the parameters of "set".
5293 * set is assumed to have only parameters and divs.
5295 static struct isl_set *set_parameter_preimage(
5296 struct isl_set *set, struct isl_mat *mat)
5298 struct isl_dim *dim = NULL;
5304 dim = isl_dim_copy(set->dim);
5305 dim = isl_dim_cow(dim);
5309 nparam = isl_set_dim(set, isl_dim_param);
5311 isl_assert(set->ctx, mat->n_row == 1 + nparam, goto error);
5314 dim->n_out = nparam;
5315 isl_set_reset_dim(set, dim);
5316 set = isl_set_preimage(set, mat);
5319 dim = isl_dim_copy(set->dim);
5320 dim = isl_dim_cow(dim);
5323 dim->nparam = dim->n_out;
5325 isl_set_reset_dim(set, dim);
5335 /* Intersect the basic set "bset" with the affine space specified by the
5336 * equalities in "eq".
5338 static struct isl_basic_set *basic_set_append_equalities(
5339 struct isl_basic_set *bset, struct isl_mat *eq)
5347 bset = isl_basic_set_extend_dim(bset, isl_dim_copy(bset->dim), 0,
5352 len = 1 + isl_dim_total(bset->dim) + bset->extra;
5353 for (i = 0; i < eq->n_row; ++i) {
5354 k = isl_basic_set_alloc_equality(bset);
5357 isl_seq_cpy(bset->eq[k], eq->row[i], eq->n_col);
5358 isl_seq_clr(bset->eq[k] + eq->n_col, len - eq->n_col);
5362 bset = isl_basic_set_gauss(bset, NULL);
5363 bset = isl_basic_set_finalize(bset);
5368 isl_basic_set_free(bset);
5372 /* Intersect the set "set" with the affine space specified by the
5373 * equalities in "eq".
5375 static struct isl_set *set_append_equalities(struct isl_set *set,
5383 for (i = 0; i < set->n; ++i) {
5384 set->p[i] = basic_set_append_equalities(set->p[i],
5397 /* Project the given basic set onto its parameter domain, possibly introducing
5398 * new, explicit, existential variables in the constraints.
5399 * The input has parameters and (possibly implicit) existential variables.
5400 * The output has the same parameters, but only
5401 * explicit existentially quantified variables.
5403 * The actual projection is performed by pip, but pip doesn't seem
5404 * to like equalities very much, so we first remove the equalities
5405 * among the parameters by performing a variable compression on
5406 * the parameters. Afterward, an inverse transformation is performed
5407 * and the equalities among the parameters are inserted back in.
5409 static struct isl_set *parameter_compute_divs(struct isl_basic_set *bset)
5413 struct isl_mat *T, *T2;
5414 struct isl_set *set;
5415 unsigned nparam, n_div;
5417 bset = isl_basic_set_cow(bset);
5421 if (bset->n_eq == 0)
5422 return isl_basic_set_lexmin(bset);
5424 isl_basic_set_gauss(bset, NULL);
5426 nparam = isl_basic_set_dim(bset, isl_dim_param);
5427 n_div = isl_basic_set_dim(bset, isl_dim_div);
5429 for (i = 0, j = n_div - 1; i < bset->n_eq && j >= 0; --j) {
5430 if (!isl_int_is_zero(bset->eq[i][1 + nparam + j]))
5433 if (i == bset->n_eq)
5434 return isl_basic_set_lexmin(bset);
5436 eq = isl_mat_sub_alloc6(bset->ctx, bset->eq, i, bset->n_eq - i,
5438 eq = isl_mat_cow(eq);
5439 T = isl_mat_variable_compression(isl_mat_copy(eq), &T2);
5440 if (T && T->n_col == 0) {
5444 bset = isl_basic_set_set_to_empty(bset);
5445 return isl_set_from_basic_set(bset);
5447 bset = basic_set_parameter_preimage(bset, T);
5449 set = isl_basic_set_lexmin(bset);
5450 set = set_parameter_preimage(set, T2);
5451 set = set_append_equalities(set, eq);
5455 /* Compute an explicit representation for all the existentially
5456 * quantified variables.
5457 * The input and output dimensions are first turned into parameters.
5458 * compute_divs then returns a map with the same parameters and
5459 * no input or output dimensions and the dimension specification
5460 * is reset to that of the input.
5462 static struct isl_map *compute_divs(struct isl_basic_map *bmap)
5464 struct isl_basic_set *bset;
5465 struct isl_set *set;
5466 struct isl_map *map;
5467 struct isl_dim *dim, *orig_dim = NULL;
5472 bmap = isl_basic_map_cow(bmap);
5476 nparam = isl_basic_map_dim(bmap, isl_dim_param);
5477 n_in = isl_basic_map_dim(bmap, isl_dim_in);
5478 n_out = isl_basic_map_dim(bmap, isl_dim_out);
5479 dim = isl_dim_set_alloc(bmap->ctx, nparam + n_in + n_out, 0);
5483 orig_dim = bmap->dim;
5485 bset = (struct isl_basic_set *)bmap;
5487 set = parameter_compute_divs(bset);
5488 map = (struct isl_map *)set;
5489 map = isl_map_reset_dim(map, orig_dim);
5493 isl_basic_map_free(bmap);
5497 int isl_basic_map_divs_known(__isl_keep isl_basic_map *bmap)
5505 off = isl_dim_total(bmap->dim);
5506 for (i = 0; i < bmap->n_div; ++i) {
5507 if (isl_int_is_zero(bmap->div[i][0]))
5509 isl_assert(bmap->ctx, isl_int_is_zero(bmap->div[i][1+1+off+i]),
5515 static int map_divs_known(__isl_keep isl_map *map)
5522 for (i = 0; i < map->n; ++i) {
5523 int known = isl_basic_map_divs_known(map->p[i]);
5531 /* If bmap contains any unknown divs, then compute explicit
5532 * expressions for them. However, this computation may be
5533 * quite expensive, so first try to remove divs that aren't
5536 struct isl_map *isl_basic_map_compute_divs(struct isl_basic_map *bmap)
5539 struct isl_map *map;
5541 known = isl_basic_map_divs_known(bmap);
5545 return isl_map_from_basic_map(bmap);
5547 bmap = isl_basic_map_drop_redundant_divs(bmap);
5549 known = isl_basic_map_divs_known(bmap);
5553 return isl_map_from_basic_map(bmap);
5555 map = compute_divs(bmap);
5558 isl_basic_map_free(bmap);
5562 struct isl_map *isl_map_compute_divs(struct isl_map *map)
5566 struct isl_map *res;
5573 known = map_divs_known(map);
5581 res = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[0]));
5582 for (i = 1 ; i < map->n; ++i) {
5584 r2 = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[i]));
5585 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT))
5586 res = isl_map_union_disjoint(res, r2);
5588 res = isl_map_union(res, r2);
5595 struct isl_set *isl_basic_set_compute_divs(struct isl_basic_set *bset)
5597 return (struct isl_set *)
5598 isl_basic_map_compute_divs((struct isl_basic_map *)bset);
5601 struct isl_set *isl_set_compute_divs(struct isl_set *set)
5603 return (struct isl_set *)
5604 isl_map_compute_divs((struct isl_map *)set);
5607 struct isl_set *isl_map_domain(struct isl_map *map)
5610 struct isl_set *set;
5615 map = isl_map_cow(map);
5619 set = (struct isl_set *)map;
5620 set->dim = isl_dim_domain(set->dim);
5623 for (i = 0; i < map->n; ++i) {
5624 set->p[i] = isl_basic_map_domain(map->p[i]);
5628 ISL_F_CLR(set, ISL_MAP_DISJOINT);
5629 ISL_F_CLR(set, ISL_SET_NORMALIZED);
5636 struct isl_map *isl_map_union_disjoint(
5637 struct isl_map *map1, struct isl_map *map2)
5641 struct isl_map *map = NULL;
5655 isl_assert(map1->ctx, isl_dim_equal(map1->dim, map2->dim), goto error);
5657 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
5658 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
5659 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
5661 map = isl_map_alloc_dim(isl_dim_copy(map1->dim),
5662 map1->n + map2->n, flags);
5665 for (i = 0; i < map1->n; ++i) {
5666 map = isl_map_add_basic_map(map,
5667 isl_basic_map_copy(map1->p[i]));
5671 for (i = 0; i < map2->n; ++i) {
5672 map = isl_map_add_basic_map(map,
5673 isl_basic_map_copy(map2->p[i]));
5687 struct isl_map *isl_map_union(struct isl_map *map1, struct isl_map *map2)
5689 map1 = isl_map_union_disjoint(map1, map2);
5693 ISL_F_CLR(map1, ISL_MAP_DISJOINT);
5697 struct isl_set *isl_set_union_disjoint(
5698 struct isl_set *set1, struct isl_set *set2)
5700 return (struct isl_set *)
5701 isl_map_union_disjoint(
5702 (struct isl_map *)set1, (struct isl_map *)set2);
5705 struct isl_set *isl_set_union(struct isl_set *set1, struct isl_set *set2)
5707 return (struct isl_set *)
5708 isl_map_union((struct isl_map *)set1, (struct isl_map *)set2);
5711 struct isl_map *isl_map_intersect_range(
5712 struct isl_map *map, struct isl_set *set)
5715 struct isl_map *result;
5721 if (!isl_dim_match(map->dim, isl_dim_param, set->dim, isl_dim_param))
5722 isl_die(set->ctx, isl_error_invalid,
5723 "parameters don't match", goto error);
5725 if (isl_dim_size(set->dim, isl_dim_set) != 0 &&
5726 !isl_map_compatible_range(map, set))
5727 isl_die(set->ctx, isl_error_invalid,
5728 "incompatible spaces", goto error);
5730 if (isl_set_plain_is_universe(set)) {
5735 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT) &&
5736 ISL_F_ISSET(set, ISL_MAP_DISJOINT))
5737 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
5739 result = isl_map_alloc_dim(isl_dim_copy(map->dim),
5740 map->n * set->n, flags);
5743 for (i = 0; i < map->n; ++i)
5744 for (j = 0; j < set->n; ++j) {
5745 result = isl_map_add_basic_map(result,
5746 isl_basic_map_intersect_range(
5747 isl_basic_map_copy(map->p[i]),
5748 isl_basic_set_copy(set->p[j])));
5761 struct isl_map *isl_map_intersect_domain(
5762 struct isl_map *map, struct isl_set *set)
5764 return isl_map_reverse(
5765 isl_map_intersect_range(isl_map_reverse(map), set));
5768 struct isl_map *isl_map_apply_domain(
5769 struct isl_map *map1, struct isl_map *map2)
5773 map1 = isl_map_reverse(map1);
5774 map1 = isl_map_apply_range(map1, map2);
5775 return isl_map_reverse(map1);
5782 struct isl_map *isl_map_apply_range(
5783 struct isl_map *map1, struct isl_map *map2)
5785 struct isl_dim *dim_result;
5786 struct isl_map *result;
5792 dim_result = isl_dim_join(isl_dim_copy(map1->dim),
5793 isl_dim_copy(map2->dim));
5795 result = isl_map_alloc_dim(dim_result, map1->n * map2->n, 0);
5798 for (i = 0; i < map1->n; ++i)
5799 for (j = 0; j < map2->n; ++j) {
5800 result = isl_map_add_basic_map(result,
5801 isl_basic_map_apply_range(
5802 isl_basic_map_copy(map1->p[i]),
5803 isl_basic_map_copy(map2->p[j])));
5809 if (result && result->n <= 1)
5810 ISL_F_SET(result, ISL_MAP_DISJOINT);
5819 * returns range - domain
5821 struct isl_basic_set *isl_basic_map_deltas(struct isl_basic_map *bmap)
5823 isl_dim *dims, *target_dim;
5824 struct isl_basic_set *bset;
5831 isl_assert(bmap->ctx, isl_dim_tuple_match(bmap->dim, isl_dim_in,
5832 bmap->dim, isl_dim_out),
5834 target_dim = isl_dim_domain(isl_basic_map_get_dim(bmap));
5835 dim = isl_basic_map_n_in(bmap);
5836 nparam = isl_basic_map_n_param(bmap);
5837 bset = isl_basic_set_from_basic_map(bmap);
5838 bset = isl_basic_set_cow(bset);
5839 dims = isl_basic_set_get_dim(bset);
5840 dims = isl_dim_add(dims, isl_dim_set, dim);
5841 bset = isl_basic_set_extend_dim(bset, dims, 0, dim, 0);
5842 bset = isl_basic_set_swap_vars(bset, 2*dim);
5843 for (i = 0; i < dim; ++i) {
5844 int j = isl_basic_map_alloc_equality(
5845 (struct isl_basic_map *)bset);
5848 isl_seq_clr(bset->eq[j], 1 + isl_basic_set_total_dim(bset));
5849 isl_int_set_si(bset->eq[j][1+nparam+i], 1);
5850 isl_int_set_si(bset->eq[j][1+nparam+dim+i], 1);
5851 isl_int_set_si(bset->eq[j][1+nparam+2*dim+i], -1);
5853 bset = isl_basic_set_project_out(bset, isl_dim_set, dim, 2*dim);
5854 bset = isl_basic_set_reset_dim(bset, target_dim);
5857 isl_basic_map_free(bmap);
5862 * returns range - domain
5864 struct isl_set *isl_map_deltas(struct isl_map *map)
5868 struct isl_set *result;
5873 isl_assert(map->ctx, isl_dim_tuple_match(map->dim, isl_dim_in,
5874 map->dim, isl_dim_out),
5876 dim = isl_map_get_dim(map);
5877 dim = isl_dim_domain(dim);
5878 result = isl_set_alloc_dim(dim, map->n, 0);
5881 for (i = 0; i < map->n; ++i)
5882 result = isl_set_add_basic_set(result,
5883 isl_basic_map_deltas(isl_basic_map_copy(map->p[i])));
5892 * returns [domain -> range] -> range - domain
5894 __isl_give isl_basic_map *isl_basic_map_deltas_map(
5895 __isl_take isl_basic_map *bmap)
5899 isl_basic_map *domain;
5903 if (!isl_dim_tuple_match(bmap->dim, isl_dim_in, bmap->dim, isl_dim_out))
5904 isl_die(bmap->ctx, isl_error_invalid,
5905 "domain and range don't match", goto error);
5907 nparam = isl_basic_map_dim(bmap, isl_dim_param);
5908 n = isl_basic_map_dim(bmap, isl_dim_in);
5910 dim = isl_dim_from_range(isl_dim_domain(isl_basic_map_get_dim(bmap)));
5911 domain = isl_basic_map_universe(dim);
5913 bmap = isl_basic_map_from_domain(isl_basic_map_wrap(bmap));
5914 bmap = isl_basic_map_apply_range(bmap, domain);
5915 bmap = isl_basic_map_extend_constraints(bmap, n, 0);
5917 total = isl_basic_map_total_dim(bmap);
5919 for (i = 0; i < n; ++i) {
5920 k = isl_basic_map_alloc_equality(bmap);
5923 isl_seq_clr(bmap->eq[k], 1 + total);
5924 isl_int_set_si(bmap->eq[k][1 + nparam + i], 1);
5925 isl_int_set_si(bmap->eq[k][1 + nparam + n + i], -1);
5926 isl_int_set_si(bmap->eq[k][1 + nparam + n + n + i], 1);
5929 bmap = isl_basic_map_gauss(bmap, NULL);
5930 return isl_basic_map_finalize(bmap);
5932 isl_basic_map_free(bmap);
5937 * returns [domain -> range] -> range - domain
5939 __isl_give isl_map *isl_map_deltas_map(__isl_take isl_map *map)
5942 isl_dim *domain_dim;
5947 if (!isl_dim_tuple_match(map->dim, isl_dim_in, map->dim, isl_dim_out))
5948 isl_die(map->ctx, isl_error_invalid,
5949 "domain and range don't match", goto error);
5951 map = isl_map_cow(map);
5955 domain_dim = isl_dim_from_range(isl_dim_domain(isl_map_get_dim(map)));
5956 map->dim = isl_dim_from_domain(isl_dim_wrap(map->dim));
5957 map->dim = isl_dim_join(map->dim, domain_dim);
5960 for (i = 0; i < map->n; ++i) {
5961 map->p[i] = isl_basic_map_deltas_map(map->p[i]);
5965 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
5972 static struct isl_basic_map *basic_map_identity(struct isl_dim *dims)
5974 struct isl_basic_map *bmap;
5982 nparam = dims->nparam;
5984 bmap = isl_basic_map_alloc_dim(dims, 0, dim, 0);
5988 for (i = 0; i < dim; ++i) {
5989 int j = isl_basic_map_alloc_equality(bmap);
5992 isl_seq_clr(bmap->eq[j], 1 + isl_basic_map_total_dim(bmap));
5993 isl_int_set_si(bmap->eq[j][1+nparam+i], 1);
5994 isl_int_set_si(bmap->eq[j][1+nparam+dim+i], -1);
5996 return isl_basic_map_finalize(bmap);
5998 isl_basic_map_free(bmap);
6002 __isl_give isl_basic_map *isl_basic_map_identity(__isl_take isl_dim *dim)
6006 if (dim->n_in != dim->n_out)
6007 isl_die(dim->ctx, isl_error_invalid,
6008 "number of input and output dimensions needs to be "
6009 "the same", goto error);
6010 return basic_map_identity(dim);
6016 struct isl_basic_map *isl_basic_map_identity_like(struct isl_basic_map *model)
6018 if (!model || !model->dim)
6020 return isl_basic_map_identity(isl_dim_copy(model->dim));
6023 __isl_give isl_map *isl_map_identity(__isl_take isl_dim *dim)
6025 return isl_map_from_basic_map(isl_basic_map_identity(dim));
6028 struct isl_map *isl_map_identity_like(struct isl_map *model)
6030 if (!model || !model->dim)
6032 return isl_map_identity(isl_dim_copy(model->dim));
6035 struct isl_map *isl_map_identity_like_basic_map(struct isl_basic_map *model)
6037 if (!model || !model->dim)
6039 return isl_map_identity(isl_dim_copy(model->dim));
6042 __isl_give isl_map *isl_set_identity(__isl_take isl_set *set)
6044 isl_dim *dim = isl_set_get_dim(set);
6046 id = isl_map_identity(isl_dim_map_from_set(dim));
6047 return isl_map_intersect_range(id, set);
6050 /* Construct a basic set with all set dimensions having only non-negative
6053 struct isl_basic_set *isl_basic_set_positive_orthant(struct isl_dim *dims)
6058 struct isl_basic_set *bset;
6062 nparam = dims->nparam;
6064 bset = isl_basic_set_alloc_dim(dims, 0, 0, dim);
6067 for (i = 0; i < dim; ++i) {
6068 int k = isl_basic_set_alloc_inequality(bset);
6071 isl_seq_clr(bset->ineq[k], 1 + isl_basic_set_total_dim(bset));
6072 isl_int_set_si(bset->ineq[k][1 + nparam + i], 1);
6076 isl_basic_set_free(bset);
6080 /* Construct the half-space x_pos >= 0.
6082 static __isl_give isl_basic_set *nonneg_halfspace(__isl_take isl_dim *dim,
6086 isl_basic_set *nonneg;
6088 nonneg = isl_basic_set_alloc_dim(dim, 0, 0, 1);
6089 k = isl_basic_set_alloc_inequality(nonneg);
6092 isl_seq_clr(nonneg->ineq[k], 1 + isl_basic_set_total_dim(nonneg));
6093 isl_int_set_si(nonneg->ineq[k][pos], 1);
6095 return isl_basic_set_finalize(nonneg);
6097 isl_basic_set_free(nonneg);
6101 /* Construct the half-space x_pos <= -1.
6103 static __isl_give isl_basic_set *neg_halfspace(__isl_take isl_dim *dim, int pos)
6108 neg = isl_basic_set_alloc_dim(dim, 0, 0, 1);
6109 k = isl_basic_set_alloc_inequality(neg);
6112 isl_seq_clr(neg->ineq[k], 1 + isl_basic_set_total_dim(neg));
6113 isl_int_set_si(neg->ineq[k][0], -1);
6114 isl_int_set_si(neg->ineq[k][pos], -1);
6116 return isl_basic_set_finalize(neg);
6118 isl_basic_set_free(neg);
6122 __isl_give isl_set *isl_set_split_dims(__isl_take isl_set *set,
6123 enum isl_dim_type type, unsigned first, unsigned n)
6126 isl_basic_set *nonneg;
6134 isl_assert(set->ctx, first + n <= isl_set_dim(set, type), goto error);
6136 for (i = 0; i < n; ++i) {
6137 nonneg = nonneg_halfspace(isl_set_get_dim(set),
6138 pos(set->dim, type) + first + i);
6139 neg = neg_halfspace(isl_set_get_dim(set),
6140 pos(set->dim, type) + first + i);
6142 set = isl_set_intersect(set, isl_basic_set_union(nonneg, neg));
6151 static int foreach_orthant(__isl_take isl_set *set, int *signs, int first,
6152 int len, int (*fn)(__isl_take isl_set *orthant, int *signs, void *user),
6159 if (isl_set_plain_is_empty(set)) {
6164 return fn(set, signs, user);
6167 half = isl_set_from_basic_set(nonneg_halfspace(isl_set_get_dim(set),
6169 half = isl_set_intersect(half, isl_set_copy(set));
6170 if (foreach_orthant(half, signs, first + 1, len, fn, user) < 0)
6174 half = isl_set_from_basic_set(neg_halfspace(isl_set_get_dim(set),
6176 half = isl_set_intersect(half, set);
6177 return foreach_orthant(half, signs, first + 1, len, fn, user);
6183 /* Call "fn" on the intersections of "set" with each of the orthants
6184 * (except for obviously empty intersections). The orthant is identified
6185 * by the signs array, with each entry having value 1 or -1 according
6186 * to the sign of the corresponding variable.
6188 int isl_set_foreach_orthant(__isl_keep isl_set *set,
6189 int (*fn)(__isl_take isl_set *orthant, int *signs, void *user),
6199 if (isl_set_plain_is_empty(set))
6202 nparam = isl_set_dim(set, isl_dim_param);
6203 nvar = isl_set_dim(set, isl_dim_set);
6205 signs = isl_alloc_array(set->ctx, int, nparam + nvar);
6207 r = foreach_orthant(isl_set_copy(set), signs, 0, nparam + nvar,
6215 int isl_set_is_equal(struct isl_set *set1, struct isl_set *set2)
6217 return isl_map_is_equal((struct isl_map *)set1, (struct isl_map *)set2);
6220 int isl_basic_map_is_subset(
6221 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
6224 struct isl_map *map1;
6225 struct isl_map *map2;
6227 if (!bmap1 || !bmap2)
6230 map1 = isl_map_from_basic_map(isl_basic_map_copy(bmap1));
6231 map2 = isl_map_from_basic_map(isl_basic_map_copy(bmap2));
6233 is_subset = isl_map_is_subset(map1, map2);
6241 int isl_basic_map_is_equal(
6242 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
6246 if (!bmap1 || !bmap2)
6248 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
6251 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
6255 int isl_basic_set_is_equal(
6256 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
6258 return isl_basic_map_is_equal(
6259 (struct isl_basic_map *)bset1, (struct isl_basic_map *)bset2);
6262 int isl_map_is_empty(struct isl_map *map)
6269 for (i = 0; i < map->n; ++i) {
6270 is_empty = isl_basic_map_is_empty(map->p[i]);
6279 int isl_map_plain_is_empty(__isl_keep isl_map *map)
6281 return map ? map->n == 0 : -1;
6284 int isl_map_fast_is_empty(__isl_keep isl_map *map)
6286 return isl_map_plain_is_empty(map);
6289 int isl_set_plain_is_empty(struct isl_set *set)
6291 return set ? set->n == 0 : -1;
6294 int isl_set_fast_is_empty(__isl_keep isl_set *set)
6296 return isl_set_plain_is_empty(set);
6299 int isl_set_is_empty(struct isl_set *set)
6301 return isl_map_is_empty((struct isl_map *)set);
6304 int isl_map_has_equal_dim(__isl_keep isl_map *map1, __isl_keep isl_map *map2)
6309 return isl_dim_equal(map1->dim, map2->dim);
6312 int isl_set_has_equal_dim(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
6317 return isl_dim_equal(set1->dim, set2->dim);
6320 int isl_map_is_equal(struct isl_map *map1, struct isl_map *map2)
6326 is_subset = isl_map_is_subset(map1, map2);
6329 is_subset = isl_map_is_subset(map2, map1);
6333 int isl_basic_map_is_strict_subset(
6334 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
6338 if (!bmap1 || !bmap2)
6340 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
6343 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
6344 if (is_subset == -1)
6349 int isl_map_is_strict_subset(struct isl_map *map1, struct isl_map *map2)
6355 is_subset = isl_map_is_subset(map1, map2);
6358 is_subset = isl_map_is_subset(map2, map1);
6359 if (is_subset == -1)
6364 int isl_set_is_strict_subset(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
6366 return isl_map_is_strict_subset((isl_map *)set1, (isl_map *)set2);
6369 int isl_basic_map_is_universe(struct isl_basic_map *bmap)
6373 return bmap->n_eq == 0 && bmap->n_ineq == 0;
6376 int isl_basic_set_is_universe(struct isl_basic_set *bset)
6380 return bset->n_eq == 0 && bset->n_ineq == 0;
6383 int isl_map_plain_is_universe(__isl_keep isl_map *map)
6390 for (i = 0; i < map->n; ++i) {
6391 int r = isl_basic_map_is_universe(map->p[i]);
6399 int isl_set_plain_is_universe(__isl_keep isl_set *set)
6401 return isl_map_plain_is_universe((isl_map *) set);
6404 int isl_set_fast_is_universe(__isl_keep isl_set *set)
6406 return isl_set_plain_is_universe(set);
6409 int isl_basic_map_is_empty(struct isl_basic_map *bmap)
6411 struct isl_basic_set *bset = NULL;
6412 struct isl_vec *sample = NULL;
6419 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY))
6422 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL)) {
6423 struct isl_basic_map *copy = isl_basic_map_copy(bmap);
6424 copy = isl_basic_map_remove_redundancies(copy);
6425 empty = ISL_F_ISSET(copy, ISL_BASIC_MAP_EMPTY);
6426 isl_basic_map_free(copy);
6430 total = 1 + isl_basic_map_total_dim(bmap);
6431 if (bmap->sample && bmap->sample->size == total) {
6432 int contains = isl_basic_map_contains(bmap, bmap->sample);
6438 isl_vec_free(bmap->sample);
6439 bmap->sample = NULL;
6440 bset = isl_basic_map_underlying_set(isl_basic_map_copy(bmap));
6443 sample = isl_basic_set_sample_vec(bset);
6446 empty = sample->size == 0;
6447 isl_vec_free(bmap->sample);
6448 bmap->sample = sample;
6450 ISL_F_SET(bmap, ISL_BASIC_MAP_EMPTY);
6455 int isl_basic_map_plain_is_empty(__isl_keep isl_basic_map *bmap)
6459 return ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY);
6462 int isl_basic_map_fast_is_empty(__isl_keep isl_basic_map *bmap)
6464 return isl_basic_map_plain_is_empty(bmap);
6467 int isl_basic_set_plain_is_empty(__isl_keep isl_basic_set *bset)
6471 return ISL_F_ISSET(bset, ISL_BASIC_SET_EMPTY);
6474 int isl_basic_set_fast_is_empty(__isl_keep isl_basic_set *bset)
6476 return isl_basic_set_plain_is_empty(bset);
6479 int isl_basic_set_is_empty(struct isl_basic_set *bset)
6481 return isl_basic_map_is_empty((struct isl_basic_map *)bset);
6484 struct isl_map *isl_basic_map_union(
6485 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
6487 struct isl_map *map;
6488 if (!bmap1 || !bmap2)
6491 isl_assert(bmap1->ctx, isl_dim_equal(bmap1->dim, bmap2->dim), goto error);
6493 map = isl_map_alloc_dim(isl_dim_copy(bmap1->dim), 2, 0);
6496 map = isl_map_add_basic_map(map, bmap1);
6497 map = isl_map_add_basic_map(map, bmap2);
6500 isl_basic_map_free(bmap1);
6501 isl_basic_map_free(bmap2);
6505 struct isl_set *isl_basic_set_union(
6506 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
6508 return (struct isl_set *)isl_basic_map_union(
6509 (struct isl_basic_map *)bset1,
6510 (struct isl_basic_map *)bset2);
6513 /* Order divs such that any div only depends on previous divs */
6514 struct isl_basic_map *isl_basic_map_order_divs(struct isl_basic_map *bmap)
6522 off = isl_dim_total(bmap->dim);
6524 for (i = 0; i < bmap->n_div; ++i) {
6526 if (isl_int_is_zero(bmap->div[i][0]))
6528 pos = isl_seq_first_non_zero(bmap->div[i]+1+1+off+i,
6532 isl_basic_map_swap_div(bmap, i, i + pos);
6538 struct isl_basic_set *isl_basic_set_order_divs(struct isl_basic_set *bset)
6540 return (struct isl_basic_set *)
6541 isl_basic_map_order_divs((struct isl_basic_map *)bset);
6544 __isl_give isl_map *isl_map_order_divs(__isl_take isl_map *map)
6551 for (i = 0; i < map->n; ++i) {
6552 map->p[i] = isl_basic_map_order_divs(map->p[i]);
6563 /* Apply the expansion computed by isl_merge_divs.
6564 * The expansion itself is given by "exp" while the resulting
6565 * list of divs is given by "div".
6567 __isl_give isl_basic_set *isl_basic_set_expand_divs(
6568 __isl_take isl_basic_set *bset, __isl_take isl_mat *div, int *exp)
6573 bset = isl_basic_set_cow(bset);
6577 if (div->n_row < bset->n_div)
6578 isl_die(isl_mat_get_ctx(div), isl_error_invalid,
6579 "not an expansion", goto error);
6581 bset = isl_basic_map_extend_dim(bset, isl_dim_copy(bset->dim),
6582 div->n_row - bset->n_div, 0,
6583 2 * (div->n_row - bset->n_div));
6585 n_div = bset->n_div;
6586 for (i = n_div; i < div->n_row; ++i)
6587 if (isl_basic_set_alloc_div(bset) < 0)
6591 for (i = div->n_row - 1; i >= 0; --i) {
6592 if (j >= 0 && exp[j] == i) {
6594 isl_basic_map_swap_div(bset, i, j);
6597 isl_seq_cpy(bset->div[i], div->row[i], div->n_col);
6598 if (isl_basic_map_add_div_constraints(bset, i) < 0)
6606 isl_basic_set_free(bset);
6611 /* Look for a div in dst that corresponds to the div "div" in src.
6612 * The divs before "div" in src and dst are assumed to be the same.
6614 * Returns -1 if no corresponding div was found and the position
6615 * of the corresponding div in dst otherwise.
6617 static int find_div(struct isl_basic_map *dst,
6618 struct isl_basic_map *src, unsigned div)
6622 unsigned total = isl_dim_total(src->dim);
6624 isl_assert(dst->ctx, div <= dst->n_div, return -1);
6625 for (i = div; i < dst->n_div; ++i)
6626 if (isl_seq_eq(dst->div[i], src->div[div], 1+1+total+div) &&
6627 isl_seq_first_non_zero(dst->div[i]+1+1+total+div,
6628 dst->n_div - div) == -1)
6633 struct isl_basic_map *isl_basic_map_align_divs(
6634 struct isl_basic_map *dst, struct isl_basic_map *src)
6637 unsigned total = isl_dim_total(src->dim);
6642 if (src->n_div == 0)
6645 for (i = 0; i < src->n_div; ++i)
6646 isl_assert(src->ctx, !isl_int_is_zero(src->div[i][0]), goto error);
6648 src = isl_basic_map_order_divs(src);
6649 dst = isl_basic_map_cow(dst);
6650 dst = isl_basic_map_extend_dim(dst, isl_dim_copy(dst->dim),
6651 src->n_div, 0, 2 * src->n_div);
6654 for (i = 0; i < src->n_div; ++i) {
6655 int j = find_div(dst, src, i);
6657 j = isl_basic_map_alloc_div(dst);
6660 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total+i);
6661 isl_seq_clr(dst->div[j]+1+1+total+i, dst->n_div - i);
6662 if (isl_basic_map_add_div_constraints(dst, j) < 0)
6666 isl_basic_map_swap_div(dst, i, j);
6670 isl_basic_map_free(dst);
6674 struct isl_basic_set *isl_basic_set_align_divs(
6675 struct isl_basic_set *dst, struct isl_basic_set *src)
6677 return (struct isl_basic_set *)isl_basic_map_align_divs(
6678 (struct isl_basic_map *)dst, (struct isl_basic_map *)src);
6681 struct isl_map *isl_map_align_divs(struct isl_map *map)
6689 map = isl_map_compute_divs(map);
6690 map = isl_map_cow(map);
6694 for (i = 1; i < map->n; ++i)
6695 map->p[0] = isl_basic_map_align_divs(map->p[0], map->p[i]);
6696 for (i = 1; i < map->n; ++i)
6697 map->p[i] = isl_basic_map_align_divs(map->p[i], map->p[0]);
6699 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
6703 struct isl_set *isl_set_align_divs(struct isl_set *set)
6705 return (struct isl_set *)isl_map_align_divs((struct isl_map *)set);
6708 struct isl_set *isl_set_apply(struct isl_set *set, struct isl_map *map)
6712 isl_assert(set->ctx, isl_map_compatible_domain(map, set), goto error);
6713 map = isl_map_intersect_domain(map, set);
6714 set = isl_map_range(map);
6722 /* There is no need to cow as removing empty parts doesn't change
6723 * the meaning of the set.
6725 struct isl_map *isl_map_remove_empty_parts(struct isl_map *map)
6732 for (i = map->n-1; i >= 0; --i) {
6733 if (!ISL_F_ISSET(map->p[i], ISL_BASIC_MAP_EMPTY))
6735 isl_basic_map_free(map->p[i]);
6736 if (i != map->n-1) {
6737 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
6738 map->p[i] = map->p[map->n-1];
6746 struct isl_set *isl_set_remove_empty_parts(struct isl_set *set)
6748 return (struct isl_set *)
6749 isl_map_remove_empty_parts((struct isl_map *)set);
6752 struct isl_basic_map *isl_map_copy_basic_map(struct isl_map *map)
6754 struct isl_basic_map *bmap;
6755 if (!map || map->n == 0)
6757 bmap = map->p[map->n-1];
6758 isl_assert(map->ctx, ISL_F_ISSET(bmap, ISL_BASIC_SET_FINAL), return NULL);
6759 return isl_basic_map_copy(bmap);
6762 struct isl_basic_set *isl_set_copy_basic_set(struct isl_set *set)
6764 return (struct isl_basic_set *)
6765 isl_map_copy_basic_map((struct isl_map *)set);
6768 __isl_give isl_map *isl_map_drop_basic_map(__isl_take isl_map *map,
6769 __isl_keep isl_basic_map *bmap)
6775 for (i = map->n-1; i >= 0; --i) {
6776 if (map->p[i] != bmap)
6778 map = isl_map_cow(map);
6781 isl_basic_map_free(map->p[i]);
6782 if (i != map->n-1) {
6783 ISL_F_CLR(map, ISL_SET_NORMALIZED);
6784 map->p[i] = map->p[map->n-1];
6795 struct isl_set *isl_set_drop_basic_set(struct isl_set *set,
6796 struct isl_basic_set *bset)
6798 return (struct isl_set *)isl_map_drop_basic_map((struct isl_map *)set,
6799 (struct isl_basic_map *)bset);
6802 /* Given two basic sets bset1 and bset2, compute the maximal difference
6803 * between the values of dimension pos in bset1 and those in bset2
6804 * for any common value of the parameters and dimensions preceding pos.
6806 static enum isl_lp_result basic_set_maximal_difference_at(
6807 __isl_keep isl_basic_set *bset1, __isl_keep isl_basic_set *bset2,
6808 int pos, isl_int *opt)
6810 struct isl_dim *dims;
6811 struct isl_basic_map *bmap1 = NULL;
6812 struct isl_basic_map *bmap2 = NULL;
6813 struct isl_ctx *ctx;
6814 struct isl_vec *obj;
6817 unsigned dim1, dim2;
6818 enum isl_lp_result res;
6820 if (!bset1 || !bset2)
6821 return isl_lp_error;
6823 nparam = isl_basic_set_n_param(bset1);
6824 dim1 = isl_basic_set_n_dim(bset1);
6825 dim2 = isl_basic_set_n_dim(bset2);
6826 dims = isl_dim_alloc(bset1->ctx, nparam, pos, dim1 - pos);
6827 bmap1 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset1), dims);
6828 dims = isl_dim_alloc(bset2->ctx, nparam, pos, dim2 - pos);
6829 bmap2 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset2), dims);
6830 if (!bmap1 || !bmap2)
6832 bmap1 = isl_basic_map_cow(bmap1);
6833 bmap1 = isl_basic_map_extend(bmap1, nparam,
6834 pos, (dim1 - pos) + (dim2 - pos),
6835 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
6836 bmap1 = add_constraints(bmap1, bmap2, 0, dim1 - pos);
6839 total = isl_basic_map_total_dim(bmap1);
6841 obj = isl_vec_alloc(ctx, 1 + total);
6842 isl_seq_clr(obj->block.data, 1 + total);
6843 isl_int_set_si(obj->block.data[1+nparam+pos], 1);
6844 isl_int_set_si(obj->block.data[1+nparam+pos+(dim1-pos)], -1);
6847 res = isl_basic_map_solve_lp(bmap1, 1, obj->block.data, ctx->one,
6849 isl_basic_map_free(bmap1);
6853 isl_basic_map_free(bmap1);
6854 isl_basic_map_free(bmap2);
6855 return isl_lp_error;
6858 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
6859 * for any common value of the parameters and dimensions preceding pos
6860 * in both basic sets, the values of dimension pos in bset1 are
6861 * smaller or larger than those in bset2.
6864 * 1 if bset1 follows bset2
6865 * -1 if bset1 precedes bset2
6866 * 0 if bset1 and bset2 are incomparable
6867 * -2 if some error occurred.
6869 int isl_basic_set_compare_at(struct isl_basic_set *bset1,
6870 struct isl_basic_set *bset2, int pos)
6873 enum isl_lp_result res;
6878 res = basic_set_maximal_difference_at(bset1, bset2, pos, &opt);
6880 if (res == isl_lp_empty)
6882 else if ((res == isl_lp_ok && isl_int_is_pos(opt)) ||
6883 res == isl_lp_unbounded)
6885 else if (res == isl_lp_ok && isl_int_is_neg(opt))
6894 /* Given two basic sets bset1 and bset2, check whether
6895 * for any common value of the parameters and dimensions preceding pos
6896 * there is a value of dimension pos in bset1 that is larger
6897 * than a value of the same dimension in bset2.
6900 * 1 if there exists such a pair
6901 * 0 if there is no such pair, but there is a pair of equal values
6903 * -2 if some error occurred.
6905 int isl_basic_set_follows_at(__isl_keep isl_basic_set *bset1,
6906 __isl_keep isl_basic_set *bset2, int pos)
6909 enum isl_lp_result res;
6914 res = basic_set_maximal_difference_at(bset1, bset2, pos, &opt);
6916 if (res == isl_lp_empty)
6918 else if ((res == isl_lp_ok && isl_int_is_pos(opt)) ||
6919 res == isl_lp_unbounded)
6921 else if (res == isl_lp_ok && isl_int_is_neg(opt))
6923 else if (res == isl_lp_ok)
6932 /* Given two sets set1 and set2, check whether
6933 * for any common value of the parameters and dimensions preceding pos
6934 * there is a value of dimension pos in set1 that is larger
6935 * than a value of the same dimension in set2.
6938 * 1 if there exists such a pair
6939 * 0 if there is no such pair, but there is a pair of equal values
6941 * -2 if some error occurred.
6943 int isl_set_follows_at(__isl_keep isl_set *set1,
6944 __isl_keep isl_set *set2, int pos)
6952 for (i = 0; i < set1->n; ++i)
6953 for (j = 0; j < set2->n; ++j) {
6955 f = isl_basic_set_follows_at(set1->p[i], set2->p[j], pos);
6956 if (f == 1 || f == -2)
6965 static int isl_basic_map_plain_has_fixed_var(__isl_keep isl_basic_map *bmap,
6966 unsigned pos, isl_int *val)
6974 total = isl_basic_map_total_dim(bmap);
6975 for (i = 0, d = total-1; i < bmap->n_eq && d+1 > pos; ++i) {
6976 for (; d+1 > pos; --d)
6977 if (!isl_int_is_zero(bmap->eq[i][1+d]))
6981 if (isl_seq_first_non_zero(bmap->eq[i]+1, d) != -1)
6983 if (isl_seq_first_non_zero(bmap->eq[i]+1+d+1, total-d-1) != -1)
6985 if (!isl_int_is_one(bmap->eq[i][1+d]))
6988 isl_int_neg(*val, bmap->eq[i][0]);
6994 static int isl_map_plain_has_fixed_var(__isl_keep isl_map *map,
6995 unsigned pos, isl_int *val)
7007 return isl_basic_map_plain_has_fixed_var(map->p[0], pos, val);
7010 fixed = isl_basic_map_plain_has_fixed_var(map->p[0], pos, &v);
7011 for (i = 1; fixed == 1 && i < map->n; ++i) {
7012 fixed = isl_basic_map_plain_has_fixed_var(map->p[i], pos, &tmp);
7013 if (fixed == 1 && isl_int_ne(tmp, v))
7017 isl_int_set(*val, v);
7023 static int isl_basic_set_plain_has_fixed_var(__isl_keep isl_basic_set *bset,
7024 unsigned pos, isl_int *val)
7026 return isl_basic_map_plain_has_fixed_var((struct isl_basic_map *)bset,
7030 static int isl_set_plain_has_fixed_var(__isl_keep isl_set *set, unsigned pos,
7033 return isl_map_plain_has_fixed_var((struct isl_map *)set, pos, val);
7036 int isl_basic_map_plain_is_fixed(__isl_keep isl_basic_map *bmap,
7037 enum isl_dim_type type, unsigned pos, isl_int *val)
7039 if (pos >= isl_basic_map_dim(bmap, type))
7041 return isl_basic_map_plain_has_fixed_var(bmap,
7042 isl_basic_map_offset(bmap, type) - 1 + pos, val);
7045 int isl_map_plain_is_fixed(__isl_keep isl_map *map,
7046 enum isl_dim_type type, unsigned pos, isl_int *val)
7048 if (pos >= isl_map_dim(map, type))
7050 return isl_map_plain_has_fixed_var(map,
7051 map_offset(map, type) - 1 + pos, val);
7054 int isl_map_fast_is_fixed(__isl_keep isl_map *map,
7055 enum isl_dim_type type, unsigned pos, isl_int *val)
7057 return isl_map_plain_is_fixed(map, type, pos, val);
7060 /* Check if dimension dim has fixed value and if so and if val is not NULL,
7061 * then return this fixed value in *val.
7063 int isl_basic_set_plain_dim_is_fixed(__isl_keep isl_basic_set *bset,
7064 unsigned dim, isl_int *val)
7066 return isl_basic_set_plain_has_fixed_var(bset,
7067 isl_basic_set_n_param(bset) + dim, val);
7070 /* Check if dimension dim has fixed value and if so and if val is not NULL,
7071 * then return this fixed value in *val.
7073 int isl_set_plain_dim_is_fixed(__isl_keep isl_set *set,
7074 unsigned dim, isl_int *val)
7076 return isl_set_plain_has_fixed_var(set, isl_set_n_param(set) + dim, val);
7079 int isl_set_fast_dim_is_fixed(__isl_keep isl_set *set,
7080 unsigned dim, isl_int *val)
7082 return isl_set_plain_dim_is_fixed(set, dim, val);
7085 /* Check if input variable in has fixed value and if so and if val is not NULL,
7086 * then return this fixed value in *val.
7088 int isl_map_plain_input_is_fixed(__isl_keep isl_map *map,
7089 unsigned in, isl_int *val)
7091 return isl_map_plain_has_fixed_var(map, isl_map_n_param(map) + in, val);
7094 /* Check if dimension dim has an (obvious) fixed lower bound and if so
7095 * and if val is not NULL, then return this lower bound in *val.
7097 int isl_basic_set_plain_dim_has_fixed_lower_bound(
7098 __isl_keep isl_basic_set *bset, unsigned dim, isl_int *val)
7100 int i, i_eq = -1, i_ineq = -1;
7107 total = isl_basic_set_total_dim(bset);
7108 nparam = isl_basic_set_n_param(bset);
7109 for (i = 0; i < bset->n_eq; ++i) {
7110 if (isl_int_is_zero(bset->eq[i][1+nparam+dim]))
7116 for (i = 0; i < bset->n_ineq; ++i) {
7117 if (!isl_int_is_pos(bset->ineq[i][1+nparam+dim]))
7119 if (i_eq != -1 || i_ineq != -1)
7123 if (i_eq == -1 && i_ineq == -1)
7125 c = i_eq != -1 ? bset->eq[i_eq] : bset->ineq[i_ineq];
7126 /* The coefficient should always be one due to normalization. */
7127 if (!isl_int_is_one(c[1+nparam+dim]))
7129 if (isl_seq_first_non_zero(c+1, nparam+dim) != -1)
7131 if (isl_seq_first_non_zero(c+1+nparam+dim+1,
7132 total - nparam - dim - 1) != -1)
7135 isl_int_neg(*val, c[0]);
7139 int isl_set_plain_dim_has_fixed_lower_bound(__isl_keep isl_set *set,
7140 unsigned dim, isl_int *val)
7152 return isl_basic_set_plain_dim_has_fixed_lower_bound(set->p[0],
7156 fixed = isl_basic_set_plain_dim_has_fixed_lower_bound(set->p[0],
7158 for (i = 1; fixed == 1 && i < set->n; ++i) {
7159 fixed = isl_basic_set_plain_dim_has_fixed_lower_bound(set->p[i],
7161 if (fixed == 1 && isl_int_ne(tmp, v))
7165 isl_int_set(*val, v);
7176 /* uset_gist depends on constraints without existentially quantified
7177 * variables sorting first.
7179 static int qsort_constraint_cmp(const void *p1, const void *p2)
7181 const struct constraint *c1 = (const struct constraint *)p1;
7182 const struct constraint *c2 = (const struct constraint *)p2;
7184 unsigned size = isl_min(c1->size, c2->size);
7186 l1 = isl_seq_last_non_zero(c1->c, size);
7187 l2 = isl_seq_last_non_zero(c2->c, size);
7192 return isl_seq_cmp(c1->c, c2->c, size);
7195 static struct isl_basic_map *isl_basic_map_sort_constraints(
7196 struct isl_basic_map *bmap)
7199 struct constraint *c;
7204 total = isl_basic_map_total_dim(bmap);
7205 c = isl_alloc_array(bmap->ctx, struct constraint, bmap->n_ineq);
7208 for (i = 0; i < bmap->n_ineq; ++i) {
7210 c[i].c = bmap->ineq[i];
7212 qsort(c, bmap->n_ineq, sizeof(struct constraint), qsort_constraint_cmp);
7213 for (i = 0; i < bmap->n_ineq; ++i)
7214 bmap->ineq[i] = c[i].c;
7218 isl_basic_map_free(bmap);
7222 __isl_give isl_basic_set *isl_basic_set_sort_constraints(
7223 __isl_take isl_basic_set *bset)
7225 return (struct isl_basic_set *)isl_basic_map_sort_constraints(
7226 (struct isl_basic_map *)bset);
7229 struct isl_basic_map *isl_basic_map_normalize(struct isl_basic_map *bmap)
7233 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_NORMALIZED))
7235 bmap = isl_basic_map_remove_redundancies(bmap);
7236 bmap = isl_basic_map_sort_constraints(bmap);
7237 ISL_F_SET(bmap, ISL_BASIC_MAP_NORMALIZED);
7241 struct isl_basic_set *isl_basic_set_normalize(struct isl_basic_set *bset)
7243 return (struct isl_basic_set *)isl_basic_map_normalize(
7244 (struct isl_basic_map *)bset);
7247 int isl_basic_map_plain_cmp(const __isl_keep isl_basic_map *bmap1,
7248 const __isl_keep isl_basic_map *bmap2)
7255 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_RATIONAL) !=
7256 ISL_F_ISSET(bmap2, ISL_BASIC_MAP_RATIONAL))
7257 return ISL_F_ISSET(bmap1, ISL_BASIC_MAP_RATIONAL) ? -1 : 1;
7258 if (isl_basic_map_n_param(bmap1) != isl_basic_map_n_param(bmap2))
7259 return isl_basic_map_n_param(bmap1) - isl_basic_map_n_param(bmap2);
7260 if (isl_basic_map_n_in(bmap1) != isl_basic_map_n_in(bmap2))
7261 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
7262 if (isl_basic_map_n_out(bmap1) != isl_basic_map_n_out(bmap2))
7263 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
7264 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY) &&
7265 ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
7267 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY))
7269 if (ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
7271 if (bmap1->n_eq != bmap2->n_eq)
7272 return bmap1->n_eq - bmap2->n_eq;
7273 if (bmap1->n_ineq != bmap2->n_ineq)
7274 return bmap1->n_ineq - bmap2->n_ineq;
7275 if (bmap1->n_div != bmap2->n_div)
7276 return bmap1->n_div - bmap2->n_div;
7277 total = isl_basic_map_total_dim(bmap1);
7278 for (i = 0; i < bmap1->n_eq; ++i) {
7279 cmp = isl_seq_cmp(bmap1->eq[i], bmap2->eq[i], 1+total);
7283 for (i = 0; i < bmap1->n_ineq; ++i) {
7284 cmp = isl_seq_cmp(bmap1->ineq[i], bmap2->ineq[i], 1+total);
7288 for (i = 0; i < bmap1->n_div; ++i) {
7289 cmp = isl_seq_cmp(bmap1->div[i], bmap2->div[i], 1+1+total);
7296 int isl_basic_map_plain_is_equal(__isl_keep isl_basic_map *bmap1,
7297 __isl_keep isl_basic_map *bmap2)
7299 return isl_basic_map_plain_cmp(bmap1, bmap2) == 0;
7302 int isl_basic_set_plain_is_equal(__isl_keep isl_basic_set *bset1,
7303 __isl_keep isl_basic_set *bset2)
7305 return isl_basic_map_plain_is_equal((isl_basic_map *)bset1,
7306 (isl_basic_map *)bset2);
7309 static int qsort_bmap_cmp(const void *p1, const void *p2)
7311 const struct isl_basic_map *bmap1 = *(const struct isl_basic_map **)p1;
7312 const struct isl_basic_map *bmap2 = *(const struct isl_basic_map **)p2;
7314 return isl_basic_map_plain_cmp(bmap1, bmap2);
7317 /* We normalize in place, but if anything goes wrong we need
7318 * to return NULL, so we need to make sure we don't change the
7319 * meaning of any possible other copies of map.
7321 struct isl_map *isl_map_normalize(struct isl_map *map)
7324 struct isl_basic_map *bmap;
7328 if (ISL_F_ISSET(map, ISL_MAP_NORMALIZED))
7330 for (i = 0; i < map->n; ++i) {
7331 bmap = isl_basic_map_normalize(isl_basic_map_copy(map->p[i]));
7334 isl_basic_map_free(map->p[i]);
7337 qsort(map->p, map->n, sizeof(struct isl_basic_map *), qsort_bmap_cmp);
7338 ISL_F_SET(map, ISL_MAP_NORMALIZED);
7339 map = isl_map_remove_empty_parts(map);
7342 for (i = map->n - 1; i >= 1; --i) {
7343 if (!isl_basic_map_plain_is_equal(map->p[i-1], map->p[i]))
7345 isl_basic_map_free(map->p[i-1]);
7346 for (j = i; j < map->n; ++j)
7347 map->p[j-1] = map->p[j];
7357 struct isl_set *isl_set_normalize(struct isl_set *set)
7359 return (struct isl_set *)isl_map_normalize((struct isl_map *)set);
7362 int isl_map_plain_is_equal(__isl_keep isl_map *map1, __isl_keep isl_map *map2)
7372 if (!isl_dim_equal(map1->dim, map2->dim))
7375 map1 = isl_map_copy(map1);
7376 map2 = isl_map_copy(map2);
7377 map1 = isl_map_normalize(map1);
7378 map2 = isl_map_normalize(map2);
7381 equal = map1->n == map2->n;
7382 for (i = 0; equal && i < map1->n; ++i) {
7383 equal = isl_basic_map_plain_is_equal(map1->p[i], map2->p[i]);
7396 int isl_map_fast_is_equal(__isl_keep isl_map *map1, __isl_keep isl_map *map2)
7398 return isl_map_plain_is_equal(map1, map2);
7401 int isl_set_plain_is_equal(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
7403 return isl_map_plain_is_equal((struct isl_map *)set1,
7404 (struct isl_map *)set2);
7407 int isl_set_fast_is_equal(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
7409 return isl_set_plain_is_equal(set1, set2);
7412 /* Return an interval that ranges from min to max (inclusive)
7414 struct isl_basic_set *isl_basic_set_interval(struct isl_ctx *ctx,
7415 isl_int min, isl_int max)
7418 struct isl_basic_set *bset = NULL;
7420 bset = isl_basic_set_alloc(ctx, 0, 1, 0, 0, 2);
7424 k = isl_basic_set_alloc_inequality(bset);
7427 isl_int_set_si(bset->ineq[k][1], 1);
7428 isl_int_neg(bset->ineq[k][0], min);
7430 k = isl_basic_set_alloc_inequality(bset);
7433 isl_int_set_si(bset->ineq[k][1], -1);
7434 isl_int_set(bset->ineq[k][0], max);
7438 isl_basic_set_free(bset);
7442 /* Return the Cartesian product of the basic sets in list (in the given order).
7444 __isl_give isl_basic_set *isl_basic_set_list_product(
7445 __isl_take struct isl_basic_set_list *list)
7453 struct isl_basic_set *product = NULL;
7457 isl_assert(list->ctx, list->n > 0, goto error);
7458 isl_assert(list->ctx, list->p[0], goto error);
7459 nparam = isl_basic_set_n_param(list->p[0]);
7460 dim = isl_basic_set_n_dim(list->p[0]);
7461 extra = list->p[0]->n_div;
7462 n_eq = list->p[0]->n_eq;
7463 n_ineq = list->p[0]->n_ineq;
7464 for (i = 1; i < list->n; ++i) {
7465 isl_assert(list->ctx, list->p[i], goto error);
7466 isl_assert(list->ctx,
7467 nparam == isl_basic_set_n_param(list->p[i]), goto error);
7468 dim += isl_basic_set_n_dim(list->p[i]);
7469 extra += list->p[i]->n_div;
7470 n_eq += list->p[i]->n_eq;
7471 n_ineq += list->p[i]->n_ineq;
7473 product = isl_basic_set_alloc(list->ctx, nparam, dim, extra,
7478 for (i = 0; i < list->n; ++i) {
7479 isl_basic_set_add_constraints(product,
7480 isl_basic_set_copy(list->p[i]), dim);
7481 dim += isl_basic_set_n_dim(list->p[i]);
7483 isl_basic_set_list_free(list);
7486 isl_basic_set_free(product);
7487 isl_basic_set_list_free(list);
7491 struct isl_basic_map *isl_basic_map_product(
7492 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
7494 struct isl_dim *dim_result = NULL;
7495 struct isl_basic_map *bmap;
7496 unsigned in1, in2, out1, out2, nparam, total, pos;
7497 struct isl_dim_map *dim_map1, *dim_map2;
7499 if (!bmap1 || !bmap2)
7502 isl_assert(bmap1->ctx, isl_dim_match(bmap1->dim, isl_dim_param,
7503 bmap2->dim, isl_dim_param), goto error);
7504 dim_result = isl_dim_product(isl_dim_copy(bmap1->dim),
7505 isl_dim_copy(bmap2->dim));
7507 in1 = isl_basic_map_n_in(bmap1);
7508 in2 = isl_basic_map_n_in(bmap2);
7509 out1 = isl_basic_map_n_out(bmap1);
7510 out2 = isl_basic_map_n_out(bmap2);
7511 nparam = isl_basic_map_n_param(bmap1);
7513 total = nparam + in1 + in2 + out1 + out2 + bmap1->n_div + bmap2->n_div;
7514 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
7515 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
7516 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
7517 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
7518 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
7519 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos += in1);
7520 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += in2);
7521 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += out1);
7522 isl_dim_map_div(dim_map1, bmap1, pos += out2);
7523 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
7525 bmap = isl_basic_map_alloc_dim(dim_result,
7526 bmap1->n_div + bmap2->n_div,
7527 bmap1->n_eq + bmap2->n_eq,
7528 bmap1->n_ineq + bmap2->n_ineq);
7529 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap1, dim_map1);
7530 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap2, dim_map2);
7531 bmap = isl_basic_map_simplify(bmap);
7532 return isl_basic_map_finalize(bmap);
7534 isl_basic_map_free(bmap1);
7535 isl_basic_map_free(bmap2);
7539 __isl_give isl_basic_map *isl_basic_map_flat_product(
7540 __isl_take isl_basic_map *bmap1, __isl_take isl_basic_map *bmap2)
7542 isl_basic_map *prod;
7544 prod = isl_basic_map_product(bmap1, bmap2);
7545 prod = isl_basic_map_flatten(prod);
7549 __isl_give isl_basic_set *isl_basic_set_flat_product(
7550 __isl_take isl_basic_set *bset1, __isl_take isl_basic_set *bset2)
7552 return isl_basic_map_flat_product(bset1, bset2);
7555 __isl_give isl_basic_map *isl_basic_map_range_product(
7556 __isl_take isl_basic_map *bmap1, __isl_take isl_basic_map *bmap2)
7558 isl_dim *dim_result = NULL;
7559 isl_basic_map *bmap;
7560 unsigned in, out1, out2, nparam, total, pos;
7561 struct isl_dim_map *dim_map1, *dim_map2;
7563 if (!bmap1 || !bmap2)
7566 dim_result = isl_dim_range_product(isl_dim_copy(bmap1->dim),
7567 isl_dim_copy(bmap2->dim));
7569 in = isl_basic_map_dim(bmap1, isl_dim_in);
7570 out1 = isl_basic_map_n_out(bmap1);
7571 out2 = isl_basic_map_n_out(bmap2);
7572 nparam = isl_basic_map_n_param(bmap1);
7574 total = nparam + in + out1 + out2 + bmap1->n_div + bmap2->n_div;
7575 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
7576 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
7577 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
7578 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
7579 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
7580 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
7581 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += in);
7582 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += out1);
7583 isl_dim_map_div(dim_map1, bmap1, pos += out2);
7584 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
7586 bmap = isl_basic_map_alloc_dim(dim_result,
7587 bmap1->n_div + bmap2->n_div,
7588 bmap1->n_eq + bmap2->n_eq,
7589 bmap1->n_ineq + bmap2->n_ineq);
7590 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap1, dim_map1);
7591 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap2, dim_map2);
7592 bmap = isl_basic_map_simplify(bmap);
7593 return isl_basic_map_finalize(bmap);
7595 isl_basic_map_free(bmap1);
7596 isl_basic_map_free(bmap2);
7600 __isl_give isl_basic_map *isl_basic_map_flat_range_product(
7601 __isl_take isl_basic_map *bmap1, __isl_take isl_basic_map *bmap2)
7603 isl_basic_map *prod;
7605 prod = isl_basic_map_range_product(bmap1, bmap2);
7606 prod = isl_basic_map_flatten_range(prod);
7610 static __isl_give isl_map *map_product(__isl_take isl_map *map1,
7611 __isl_take isl_map *map2,
7612 __isl_give isl_dim *(*dim_product)(__isl_take isl_dim *left,
7613 __isl_take isl_dim *right),
7614 __isl_give isl_basic_map *(*basic_map_product)(
7615 __isl_take isl_basic_map *left, __isl_take isl_basic_map *right))
7618 struct isl_map *result;
7624 isl_assert(map1->ctx, isl_dim_match(map1->dim, isl_dim_param,
7625 map2->dim, isl_dim_param), goto error);
7627 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
7628 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
7629 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
7631 result = isl_map_alloc_dim(dim_product(isl_dim_copy(map1->dim),
7632 isl_dim_copy(map2->dim)),
7633 map1->n * map2->n, flags);
7636 for (i = 0; i < map1->n; ++i)
7637 for (j = 0; j < map2->n; ++j) {
7638 struct isl_basic_map *part;
7639 part = basic_map_product(isl_basic_map_copy(map1->p[i]),
7640 isl_basic_map_copy(map2->p[j]));
7641 if (isl_basic_map_is_empty(part))
7642 isl_basic_map_free(part);
7644 result = isl_map_add_basic_map(result, part);
7657 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> [B -> D]
7659 struct isl_map *isl_map_product(struct isl_map *map1, struct isl_map *map2)
7661 return map_product(map1, map2, &isl_dim_product, &isl_basic_map_product);
7664 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
7666 __isl_give isl_map *isl_map_flat_product(__isl_take isl_map *map1,
7667 __isl_take isl_map *map2)
7671 prod = isl_map_product(map1, map2);
7672 prod = isl_map_flatten(prod);
7676 /* Given two set A and B, construct its Cartesian product A x B.
7678 struct isl_set *isl_set_product(struct isl_set *set1, struct isl_set *set2)
7680 return (struct isl_set *)isl_map_product((struct isl_map *)set1,
7681 (struct isl_map *)set2);
7684 __isl_give isl_set *isl_set_flat_product(__isl_take isl_set *set1,
7685 __isl_take isl_set *set2)
7687 return (isl_set *)isl_map_flat_product((isl_map *)set1, (isl_map *)set2);
7690 /* Given two maps A -> B and C -> D, construct a map (A * C) -> [B -> D]
7692 __isl_give isl_map *isl_map_range_product(__isl_take isl_map *map1,
7693 __isl_take isl_map *map2)
7695 return map_product(map1, map2, &isl_dim_range_product,
7696 &isl_basic_map_range_product);
7699 /* Given two maps A -> B and C -> D, construct a map (A * C) -> (B, D)
7701 __isl_give isl_map *isl_map_flat_range_product(__isl_take isl_map *map1,
7702 __isl_take isl_map *map2)
7706 prod = isl_map_range_product(map1, map2);
7707 prod = isl_map_flatten_range(prod);
7711 uint32_t isl_basic_map_get_hash(__isl_keep isl_basic_map *bmap)
7714 uint32_t hash = isl_hash_init();
7719 bmap = isl_basic_map_copy(bmap);
7720 bmap = isl_basic_map_normalize(bmap);
7723 total = isl_basic_map_total_dim(bmap);
7724 isl_hash_byte(hash, bmap->n_eq & 0xFF);
7725 for (i = 0; i < bmap->n_eq; ++i) {
7727 c_hash = isl_seq_get_hash(bmap->eq[i], 1 + total);
7728 isl_hash_hash(hash, c_hash);
7730 isl_hash_byte(hash, bmap->n_ineq & 0xFF);
7731 for (i = 0; i < bmap->n_ineq; ++i) {
7733 c_hash = isl_seq_get_hash(bmap->ineq[i], 1 + total);
7734 isl_hash_hash(hash, c_hash);
7736 isl_hash_byte(hash, bmap->n_div & 0xFF);
7737 for (i = 0; i < bmap->n_div; ++i) {
7739 if (isl_int_is_zero(bmap->div[i][0]))
7741 isl_hash_byte(hash, i & 0xFF);
7742 c_hash = isl_seq_get_hash(bmap->div[i], 1 + 1 + total);
7743 isl_hash_hash(hash, c_hash);
7745 isl_basic_map_free(bmap);
7749 uint32_t isl_basic_set_get_hash(__isl_keep isl_basic_set *bset)
7751 return isl_basic_map_get_hash((isl_basic_map *)bset);
7754 uint32_t isl_map_get_hash(__isl_keep isl_map *map)
7761 map = isl_map_copy(map);
7762 map = isl_map_normalize(map);
7766 hash = isl_hash_init();
7767 for (i = 0; i < map->n; ++i) {
7769 bmap_hash = isl_basic_map_get_hash(map->p[i]);
7770 isl_hash_hash(hash, bmap_hash);
7778 uint32_t isl_set_get_hash(__isl_keep isl_set *set)
7780 return isl_map_get_hash((isl_map *)set);
7783 /* Check if the value for dimension dim is completely determined
7784 * by the values of the other parameters and variables.
7785 * That is, check if dimension dim is involved in an equality.
7787 int isl_basic_set_dim_is_unique(struct isl_basic_set *bset, unsigned dim)
7794 nparam = isl_basic_set_n_param(bset);
7795 for (i = 0; i < bset->n_eq; ++i)
7796 if (!isl_int_is_zero(bset->eq[i][1 + nparam + dim]))
7801 /* Check if the value for dimension dim is completely determined
7802 * by the values of the other parameters and variables.
7803 * That is, check if dimension dim is involved in an equality
7804 * for each of the subsets.
7806 int isl_set_dim_is_unique(struct isl_set *set, unsigned dim)
7812 for (i = 0; i < set->n; ++i) {
7814 unique = isl_basic_set_dim_is_unique(set->p[i], dim);
7821 int isl_set_n_basic_set(__isl_keep isl_set *set)
7823 return set ? set->n : 0;
7826 int isl_map_foreach_basic_map(__isl_keep isl_map *map,
7827 int (*fn)(__isl_take isl_basic_map *bmap, void *user), void *user)
7834 for (i = 0; i < map->n; ++i)
7835 if (fn(isl_basic_map_copy(map->p[i]), user) < 0)
7841 int isl_set_foreach_basic_set(__isl_keep isl_set *set,
7842 int (*fn)(__isl_take isl_basic_set *bset, void *user), void *user)
7849 for (i = 0; i < set->n; ++i)
7850 if (fn(isl_basic_set_copy(set->p[i]), user) < 0)
7856 __isl_give isl_basic_set *isl_basic_set_lift(__isl_take isl_basic_set *bset)
7858 struct isl_dim *dim;
7863 bset = isl_basic_set_cow(bset);
7867 dim = isl_basic_set_get_dim(bset);
7868 dim = isl_dim_lift(dim, bset->n_div);
7871 isl_dim_free(bset->dim);
7873 bset->extra -= bset->n_div;
7876 bset = isl_basic_set_finalize(bset);
7880 isl_basic_set_free(bset);
7884 __isl_give isl_set *isl_set_lift(__isl_take isl_set *set)
7887 struct isl_dim *dim;
7890 set = isl_set_align_divs(set);
7895 set = isl_set_cow(set);
7899 n_div = set->p[0]->n_div;
7900 dim = isl_set_get_dim(set);
7901 dim = isl_dim_lift(dim, n_div);
7904 isl_dim_free(set->dim);
7907 for (i = 0; i < set->n; ++i) {
7908 set->p[i] = isl_basic_set_lift(set->p[i]);
7919 __isl_give isl_map *isl_set_lifting(__isl_take isl_set *set)
7921 struct isl_dim *dim;
7922 struct isl_basic_map *bmap;
7929 set = isl_set_align_divs(set);
7934 dim = isl_set_get_dim(set);
7935 if (set->n == 0 || set->p[0]->n_div == 0) {
7937 return isl_map_identity(isl_dim_map_from_set(dim));
7940 n_div = set->p[0]->n_div;
7941 dim = isl_dim_map_from_set(dim);
7942 n_param = isl_dim_size(dim, isl_dim_param);
7943 n_set = isl_dim_size(dim, isl_dim_in);
7944 dim = isl_dim_extend(dim, n_param, n_set, n_set + n_div);
7945 bmap = isl_basic_map_alloc_dim(dim, 0, n_set, 2 * n_div);
7946 for (i = 0; i < n_set; ++i)
7947 bmap = var_equal(bmap, i);
7949 total = n_param + n_set + n_set + n_div;
7950 for (i = 0; i < n_div; ++i) {
7951 k = isl_basic_map_alloc_inequality(bmap);
7954 isl_seq_cpy(bmap->ineq[k], set->p[0]->div[i]+1, 1+n_param);
7955 isl_seq_clr(bmap->ineq[k]+1+n_param, n_set);
7956 isl_seq_cpy(bmap->ineq[k]+1+n_param+n_set,
7957 set->p[0]->div[i]+1+1+n_param, n_set + n_div);
7958 isl_int_neg(bmap->ineq[k][1+n_param+n_set+n_set+i],
7959 set->p[0]->div[i][0]);
7961 l = isl_basic_map_alloc_inequality(bmap);
7964 isl_seq_neg(bmap->ineq[l], bmap->ineq[k], 1 + total);
7965 isl_int_add(bmap->ineq[l][0], bmap->ineq[l][0],
7966 set->p[0]->div[i][0]);
7967 isl_int_sub_ui(bmap->ineq[l][0], bmap->ineq[l][0], 1);
7971 bmap = isl_basic_map_simplify(bmap);
7972 bmap = isl_basic_map_finalize(bmap);
7973 return isl_map_from_basic_map(bmap);
7976 isl_basic_map_free(bmap);
7980 int isl_basic_set_size(__isl_keep isl_basic_set *bset)
7988 dim = isl_basic_set_total_dim(bset);
7989 size += bset->n_eq * (1 + dim);
7990 size += bset->n_ineq * (1 + dim);
7991 size += bset->n_div * (2 + dim);
7996 int isl_set_size(__isl_keep isl_set *set)
8004 for (i = 0; i < set->n; ++i)
8005 size += isl_basic_set_size(set->p[i]);
8010 int isl_basic_map_dim_is_bounded(__isl_keep isl_basic_map *bmap,
8011 enum isl_dim_type type, unsigned pos)
8019 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), return -1);
8021 pos += isl_basic_map_offset(bmap, type);
8023 for (i = 0; i < bmap->n_eq; ++i)
8024 if (!isl_int_is_zero(bmap->eq[i][pos]))
8028 for (i = 0; i < bmap->n_ineq; ++i) {
8029 int sgn = isl_int_sgn(bmap->ineq[i][pos]);
8036 return lower && upper;
8039 int isl_map_dim_is_bounded(__isl_keep isl_map *map,
8040 enum isl_dim_type type, unsigned pos)
8047 for (i = 0; i < map->n; ++i) {
8049 bounded = isl_basic_map_dim_is_bounded(map->p[i], type, pos);
8050 if (bounded < 0 || !bounded)
8057 /* Return 1 if the specified dim is involved in both an upper bound
8058 * and a lower bound.
8060 int isl_set_dim_is_bounded(__isl_keep isl_set *set,
8061 enum isl_dim_type type, unsigned pos)
8063 return isl_map_dim_is_bounded((isl_map *)set, type, pos);
8066 /* For each of the "n" variables starting at "first", determine
8067 * the sign of the variable and put the results in the first "n"
8068 * elements of the array "signs".
8070 * 1 means that the variable is non-negative
8071 * -1 means that the variable is non-positive
8072 * 0 means the variable attains both positive and negative values.
8074 int isl_basic_set_vars_get_sign(__isl_keep isl_basic_set *bset,
8075 unsigned first, unsigned n, int *signs)
8077 isl_vec *bound = NULL;
8078 struct isl_tab *tab = NULL;
8079 struct isl_tab_undo *snap;
8082 if (!bset || !signs)
8085 bound = isl_vec_alloc(bset->ctx, 1 + isl_basic_set_total_dim(bset));
8086 tab = isl_tab_from_basic_set(bset);
8090 isl_seq_clr(bound->el, bound->size);
8091 isl_int_set_si(bound->el[0], -1);
8093 snap = isl_tab_snap(tab);
8094 for (i = 0; i < n; ++i) {
8097 isl_int_set_si(bound->el[1 + first + i], -1);
8098 if (isl_tab_add_ineq(tab, bound->el) < 0)
8101 isl_int_set_si(bound->el[1 + first + i], 0);
8102 if (isl_tab_rollback(tab, snap) < 0)
8110 isl_int_set_si(bound->el[1 + first + i], 1);
8111 if (isl_tab_add_ineq(tab, bound->el) < 0)
8114 isl_int_set_si(bound->el[1 + first + i], 0);
8115 if (isl_tab_rollback(tab, snap) < 0)
8118 signs[i] = empty ? -1 : 0;
8122 isl_vec_free(bound);
8126 isl_vec_free(bound);
8130 int isl_basic_set_dims_get_sign(__isl_keep isl_basic_set *bset,
8131 enum isl_dim_type type, unsigned first, unsigned n, int *signs)
8133 if (!bset || !signs)
8135 isl_assert(bset->ctx, first + n <= isl_basic_set_dim(bset, type),
8138 first += pos(bset->dim, type) - 1;
8139 return isl_basic_set_vars_get_sign(bset, first, n, signs);
8142 /* Check if the given basic map is obviously single-valued.
8143 * In particular, for each output dimension, check that there is
8144 * an equality that defines the output dimension in terms of
8145 * earlier dimensions.
8147 int isl_basic_map_plain_is_single_valued(__isl_keep isl_basic_map *bmap)
8157 total = 1 + isl_basic_map_total_dim(bmap);
8158 n_out = isl_basic_map_dim(bmap, isl_dim_out);
8159 o_out = isl_basic_map_offset(bmap, isl_dim_out);
8161 for (i = 0; i < n_out; ++i) {
8162 for (j = 0; j < bmap->n_eq; ++j) {
8163 if (isl_int_is_zero(bmap->eq[j][o_out + i]))
8165 if (isl_seq_first_non_zero(bmap->eq[j] + o_out + i + 1,
8166 total - (o_out + i + 1)) == -1)
8169 if (j >= bmap->n_eq)
8176 /* Check if the given map is obviously single-valued.
8178 int isl_map_plain_is_single_valued(__isl_keep isl_map *map)
8187 return isl_basic_map_plain_is_single_valued(map->p[0]);
8190 /* Check if the given map is single-valued.
8195 * and check if the result is a subset of the identity mapping.
8197 int isl_map_is_single_valued(__isl_keep isl_map *map)
8204 sv = isl_map_plain_is_single_valued(map);
8208 test = isl_map_reverse(isl_map_copy(map));
8209 test = isl_map_apply_range(test, isl_map_copy(map));
8211 dim = isl_dim_map_from_set(isl_dim_range(isl_map_get_dim(map)));
8212 id = isl_map_identity(dim);
8214 sv = isl_map_is_subset(test, id);
8222 int isl_map_is_injective(__isl_keep isl_map *map)
8226 map = isl_map_copy(map);
8227 map = isl_map_reverse(map);
8228 in = isl_map_is_single_valued(map);
8234 /* Check if the given map is obviously injective.
8236 int isl_map_plain_is_injective(__isl_keep isl_map *map)
8240 map = isl_map_copy(map);
8241 map = isl_map_reverse(map);
8242 in = isl_map_plain_is_single_valued(map);
8248 int isl_map_is_bijective(__isl_keep isl_map *map)
8252 sv = isl_map_is_single_valued(map);
8256 return isl_map_is_injective(map);
8259 int isl_set_is_singleton(__isl_keep isl_set *set)
8261 return isl_map_is_single_valued((isl_map *)set);
8264 int isl_map_is_translation(__isl_keep isl_map *map)
8269 delta = isl_map_deltas(isl_map_copy(map));
8270 ok = isl_set_is_singleton(delta);
8271 isl_set_free(delta);
8276 static int unique(isl_int *p, unsigned pos, unsigned len)
8278 if (isl_seq_first_non_zero(p, pos) != -1)
8280 if (isl_seq_first_non_zero(p + pos + 1, len - pos - 1) != -1)
8285 int isl_basic_set_is_box(__isl_keep isl_basic_set *bset)
8294 if (isl_basic_set_dim(bset, isl_dim_div) != 0)
8297 nvar = isl_basic_set_dim(bset, isl_dim_set);
8298 ovar = isl_dim_offset(bset->dim, isl_dim_set);
8299 for (j = 0; j < nvar; ++j) {
8300 int lower = 0, upper = 0;
8301 for (i = 0; i < bset->n_eq; ++i) {
8302 if (isl_int_is_zero(bset->eq[i][1 + ovar + j]))
8304 if (!unique(bset->eq[i] + 1 + ovar, j, nvar))
8310 for (i = 0; i < bset->n_ineq; ++i) {
8311 if (isl_int_is_zero(bset->ineq[i][1 + ovar + j]))
8313 if (!unique(bset->ineq[i] + 1 + ovar, j, nvar))
8315 if (isl_int_is_pos(bset->ineq[i][1 + ovar + j]))
8320 if (!lower || !upper)
8327 int isl_set_is_box(__isl_keep isl_set *set)
8334 return isl_basic_set_is_box(set->p[0]);
8337 int isl_basic_set_is_wrapping(__isl_keep isl_basic_set *bset)
8342 return isl_dim_is_wrapping(bset->dim);
8345 int isl_set_is_wrapping(__isl_keep isl_set *set)
8350 return isl_dim_is_wrapping(set->dim);
8353 __isl_give isl_basic_set *isl_basic_map_wrap(__isl_take isl_basic_map *bmap)
8355 bmap = isl_basic_map_cow(bmap);
8359 bmap->dim = isl_dim_wrap(bmap->dim);
8363 bmap = isl_basic_map_finalize(bmap);
8365 return (isl_basic_set *)bmap;
8367 isl_basic_map_free(bmap);
8371 __isl_give isl_set *isl_map_wrap(__isl_take isl_map *map)
8375 map = isl_map_cow(map);
8379 for (i = 0; i < map->n; ++i) {
8380 map->p[i] = (isl_basic_map *)isl_basic_map_wrap(map->p[i]);
8384 map->dim = isl_dim_wrap(map->dim);
8388 return (isl_set *)map;
8394 __isl_give isl_basic_map *isl_basic_set_unwrap(__isl_take isl_basic_set *bset)
8396 bset = isl_basic_set_cow(bset);
8400 bset->dim = isl_dim_unwrap(bset->dim);
8404 bset = isl_basic_set_finalize(bset);
8406 return (isl_basic_map *)bset;
8408 isl_basic_set_free(bset);
8412 __isl_give isl_map *isl_set_unwrap(__isl_take isl_set *set)
8419 if (!isl_set_is_wrapping(set))
8420 isl_die(set->ctx, isl_error_invalid, "not a wrapping set",
8423 set = isl_set_cow(set);
8427 for (i = 0; i < set->n; ++i) {
8428 set->p[i] = (isl_basic_set *)isl_basic_set_unwrap(set->p[i]);
8433 set->dim = isl_dim_unwrap(set->dim);
8437 return (isl_map *)set;
8443 __isl_give isl_basic_map *isl_basic_map_reset(__isl_take isl_basic_map *bmap,
8444 enum isl_dim_type type)
8449 if (!isl_dim_is_named_or_nested(bmap->dim, type))
8452 bmap = isl_basic_map_cow(bmap);
8456 bmap->dim = isl_dim_reset(bmap->dim, type);
8460 bmap = isl_basic_map_finalize(bmap);
8464 isl_basic_map_free(bmap);
8468 __isl_give isl_map *isl_map_reset(__isl_take isl_map *map,
8469 enum isl_dim_type type)
8476 if (!isl_dim_is_named_or_nested(map->dim, type))
8479 map = isl_map_cow(map);
8483 for (i = 0; i < map->n; ++i) {
8484 map->p[i] = isl_basic_map_reset(map->p[i], type);
8488 map->dim = isl_dim_reset(map->dim, type);
8498 __isl_give isl_basic_map *isl_basic_map_flatten(__isl_take isl_basic_map *bmap)
8503 if (!bmap->dim->nested[0] && !bmap->dim->nested[1])
8506 bmap = isl_basic_map_cow(bmap);
8510 bmap->dim = isl_dim_flatten(bmap->dim);
8514 bmap = isl_basic_map_finalize(bmap);
8518 isl_basic_map_free(bmap);
8522 __isl_give isl_basic_set *isl_basic_set_flatten(__isl_take isl_basic_set *bset)
8524 return (isl_basic_set *)isl_basic_map_flatten((isl_basic_map *)bset);
8527 __isl_give isl_basic_map *isl_basic_map_flatten_range(
8528 __isl_take isl_basic_map *bmap)
8533 if (!bmap->dim->nested[1])
8536 bmap = isl_basic_map_cow(bmap);
8540 bmap->dim = isl_dim_flatten_range(bmap->dim);
8544 bmap = isl_basic_map_finalize(bmap);
8548 isl_basic_map_free(bmap);
8552 __isl_give isl_map *isl_map_flatten(__isl_take isl_map *map)
8559 if (!map->dim->nested[0] && !map->dim->nested[1])
8562 map = isl_map_cow(map);
8566 for (i = 0; i < map->n; ++i) {
8567 map->p[i] = isl_basic_map_flatten(map->p[i]);
8571 map->dim = isl_dim_flatten(map->dim);
8581 __isl_give isl_set *isl_set_flatten(__isl_take isl_set *set)
8583 return (isl_set *)isl_map_flatten((isl_map *)set);
8586 __isl_give isl_map *isl_set_flatten_map(__isl_take isl_set *set)
8588 isl_dim *dim, *flat_dim;
8591 dim = isl_set_get_dim(set);
8592 flat_dim = isl_dim_flatten(isl_dim_copy(dim));
8593 map = isl_map_identity(isl_dim_join(isl_dim_reverse(dim), flat_dim));
8594 map = isl_map_intersect_domain(map, set);
8599 __isl_give isl_map *isl_map_flatten_range(__isl_take isl_map *map)
8606 if (!map->dim->nested[1])
8609 map = isl_map_cow(map);
8613 for (i = 0; i < map->n; ++i) {
8614 map->p[i] = isl_basic_map_flatten_range(map->p[i]);
8618 map->dim = isl_dim_flatten_range(map->dim);
8628 /* Reorder the dimensions of "bmap" according to the given dim_map
8629 * and set the dimension specification to "dim".
8631 __isl_give isl_basic_map *isl_basic_map_realign(__isl_take isl_basic_map *bmap,
8632 __isl_take isl_dim *dim, __isl_take struct isl_dim_map *dim_map)
8636 bmap = isl_basic_map_cow(bmap);
8637 if (!bmap || !dim || !dim_map)
8640 res = isl_basic_map_alloc_dim(dim,
8641 bmap->n_div, bmap->n_eq, bmap->n_ineq);
8642 res = isl_basic_map_add_constraints_dim_map(res, bmap, dim_map);
8643 res = isl_basic_map_finalize(res);
8647 isl_basic_map_free(bmap);
8652 /* Reorder the dimensions of "map" according to given reordering.
8654 __isl_give isl_map *isl_map_realign(__isl_take isl_map *map,
8655 __isl_take isl_reordering *r)
8658 struct isl_dim_map *dim_map;
8660 map = isl_map_cow(map);
8661 dim_map = isl_dim_map_from_reordering(r);
8662 if (!map || !r || !dim_map)
8665 for (i = 0; i < map->n; ++i) {
8666 struct isl_dim_map *dim_map_i;
8668 dim_map_i = isl_dim_map_extend(dim_map, map->p[i]);
8670 map->p[i] = isl_basic_map_realign(map->p[i],
8671 isl_dim_copy(r->dim), dim_map_i);
8677 map = isl_map_reset_dim(map, isl_dim_copy(r->dim));
8679 isl_reordering_free(r);
8685 isl_reordering_free(r);
8689 __isl_give isl_set *isl_set_realign(__isl_take isl_set *set,
8690 __isl_take isl_reordering *r)
8692 return (isl_set *)isl_map_realign((isl_map *)set, r);
8695 __isl_give isl_map *isl_map_align_params(__isl_take isl_map *map,
8696 __isl_take isl_dim *model)
8703 ctx = isl_dim_get_ctx(model);
8704 if (!isl_dim_has_named_params(model))
8705 isl_die(ctx, isl_error_invalid,
8706 "model has unnamed parameters", goto error);
8707 if (!isl_dim_has_named_params(map->dim))
8708 isl_die(ctx, isl_error_invalid,
8709 "relation has unnamed parameters", goto error);
8710 if (!isl_dim_match(map->dim, isl_dim_param, model, isl_dim_param)) {
8711 isl_reordering *exp;
8713 model = isl_dim_drop(model, isl_dim_in,
8714 0, isl_dim_size(model, isl_dim_in));
8715 model = isl_dim_drop(model, isl_dim_out,
8716 0, isl_dim_size(model, isl_dim_out));
8717 exp = isl_parameter_alignment_reordering(map->dim, model);
8718 exp = isl_reordering_extend_dim(exp, isl_map_get_dim(map));
8719 map = isl_map_realign(map, exp);
8722 isl_dim_free(model);
8725 isl_dim_free(model);
8730 __isl_give isl_set *isl_set_align_params(__isl_take isl_set *set,
8731 __isl_take isl_dim *model)
8733 return isl_map_align_params(set, model);
8736 __isl_give isl_mat *isl_basic_map_equalities_matrix(
8737 __isl_keep isl_basic_map *bmap, enum isl_dim_type c1,
8738 enum isl_dim_type c2, enum isl_dim_type c3,
8739 enum isl_dim_type c4, enum isl_dim_type c5)
8741 enum isl_dim_type c[5] = { c1, c2, c3, c4, c5 };
8742 struct isl_mat *mat;
8748 mat = isl_mat_alloc(bmap->ctx, bmap->n_eq,
8749 isl_basic_map_total_dim(bmap) + 1);
8752 for (i = 0; i < bmap->n_eq; ++i)
8753 for (j = 0, pos = 0; j < 5; ++j) {
8754 int off = isl_basic_map_offset(bmap, c[j]);
8755 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
8756 isl_int_set(mat->row[i][pos],
8757 bmap->eq[i][off + k]);
8765 __isl_give isl_mat *isl_basic_map_inequalities_matrix(
8766 __isl_keep isl_basic_map *bmap, enum isl_dim_type c1,
8767 enum isl_dim_type c2, enum isl_dim_type c3,
8768 enum isl_dim_type c4, enum isl_dim_type c5)
8770 enum isl_dim_type c[5] = { c1, c2, c3, c4, c5 };
8771 struct isl_mat *mat;
8777 mat = isl_mat_alloc(bmap->ctx, bmap->n_ineq,
8778 isl_basic_map_total_dim(bmap) + 1);
8781 for (i = 0; i < bmap->n_ineq; ++i)
8782 for (j = 0, pos = 0; j < 5; ++j) {
8783 int off = isl_basic_map_offset(bmap, c[j]);
8784 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
8785 isl_int_set(mat->row[i][pos],
8786 bmap->ineq[i][off + k]);
8794 __isl_give isl_basic_map *isl_basic_map_from_constraint_matrices(
8795 __isl_take isl_dim *dim,
8796 __isl_take isl_mat *eq, __isl_take isl_mat *ineq, enum isl_dim_type c1,
8797 enum isl_dim_type c2, enum isl_dim_type c3,
8798 enum isl_dim_type c4, enum isl_dim_type c5)
8800 enum isl_dim_type c[5] = { c1, c2, c3, c4, c5 };
8801 isl_basic_map *bmap;
8807 if (!dim || !eq || !ineq)
8810 if (eq->n_col != ineq->n_col)
8811 isl_die(dim->ctx, isl_error_invalid,
8812 "equalities and inequalities matrices should have "
8813 "same number of columns", goto error);
8815 total = 1 + isl_dim_total(dim);
8817 if (eq->n_col < total)
8818 isl_die(dim->ctx, isl_error_invalid,
8819 "number of columns too small", goto error);
8821 extra = eq->n_col - total;
8823 bmap = isl_basic_map_alloc_dim(isl_dim_copy(dim), extra,
8824 eq->n_row, ineq->n_row);
8827 for (i = 0; i < extra; ++i) {
8828 k = isl_basic_map_alloc_div(bmap);
8831 isl_int_set_si(bmap->div[k][0], 0);
8833 for (i = 0; i < eq->n_row; ++i) {
8834 l = isl_basic_map_alloc_equality(bmap);
8837 for (j = 0, pos = 0; j < 5; ++j) {
8838 int off = isl_basic_map_offset(bmap, c[j]);
8839 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
8840 isl_int_set(bmap->eq[l][off + k],
8846 for (i = 0; i < ineq->n_row; ++i) {
8847 l = isl_basic_map_alloc_inequality(bmap);
8850 for (j = 0, pos = 0; j < 5; ++j) {
8851 int off = isl_basic_map_offset(bmap, c[j]);
8852 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
8853 isl_int_set(bmap->ineq[l][off + k],
8872 __isl_give isl_mat *isl_basic_set_equalities_matrix(
8873 __isl_keep isl_basic_set *bset, enum isl_dim_type c1,
8874 enum isl_dim_type c2, enum isl_dim_type c3, enum isl_dim_type c4)
8876 return isl_basic_map_equalities_matrix((isl_basic_map *)bset,
8877 c1, c2, c3, c4, isl_dim_in);
8880 __isl_give isl_mat *isl_basic_set_inequalities_matrix(
8881 __isl_keep isl_basic_set *bset, enum isl_dim_type c1,
8882 enum isl_dim_type c2, enum isl_dim_type c3, enum isl_dim_type c4)
8884 return isl_basic_map_inequalities_matrix((isl_basic_map *)bset,
8885 c1, c2, c3, c4, isl_dim_in);
8888 __isl_give isl_basic_set *isl_basic_set_from_constraint_matrices(
8889 __isl_take isl_dim *dim,
8890 __isl_take isl_mat *eq, __isl_take isl_mat *ineq, enum isl_dim_type c1,
8891 enum isl_dim_type c2, enum isl_dim_type c3, enum isl_dim_type c4)
8893 return (isl_basic_set*)
8894 isl_basic_map_from_constraint_matrices(dim, eq, ineq,
8895 c1, c2, c3, c4, isl_dim_in);
8898 int isl_basic_map_can_zip(__isl_keep isl_basic_map *bmap)
8903 return isl_dim_can_zip(bmap->dim);
8906 int isl_map_can_zip(__isl_keep isl_map *map)
8911 return isl_dim_can_zip(map->dim);
8914 /* Given a basic map (A -> B) -> (C -> D), return the corresponding basic map
8915 * (A -> C) -> (B -> D).
8917 __isl_give isl_basic_map *isl_basic_map_zip(__isl_take isl_basic_map *bmap)
8926 if (!isl_basic_map_can_zip(bmap))
8927 isl_die(bmap->ctx, isl_error_invalid,
8928 "basic map cannot be zipped", goto error);
8929 pos = isl_basic_map_offset(bmap, isl_dim_in) +
8930 isl_dim_size(bmap->dim->nested[0], isl_dim_in);
8931 n1 = isl_dim_size(bmap->dim->nested[0], isl_dim_out);
8932 n2 = isl_dim_size(bmap->dim->nested[1], isl_dim_in);
8933 bmap = isl_basic_map_swap_vars(bmap, pos, n1, n2);
8936 bmap->dim = isl_dim_zip(bmap->dim);
8941 isl_basic_map_free(bmap);
8945 /* Given a map (A -> B) -> (C -> D), return the corresponding map
8946 * (A -> C) -> (B -> D).
8948 __isl_give isl_map *isl_map_zip(__isl_take isl_map *map)
8955 if (!isl_map_can_zip(map))
8956 isl_die(map->ctx, isl_error_invalid, "map cannot be zipped",
8959 map = isl_map_cow(map);
8963 for (i = 0; i < map->n; ++i) {
8964 map->p[i] = isl_basic_map_zip(map->p[i]);
8969 map->dim = isl_dim_zip(map->dim);
8979 /* Construct a basic map mapping the domain of the affine expression
8980 * to a one-dimensional range prescribed by the affine expression.
8982 __isl_give isl_basic_map *isl_basic_map_from_aff(__isl_take isl_aff *aff)
8986 isl_local_space *ls;
8987 isl_basic_map *bmap;
8992 ls = isl_aff_get_local_space(aff);
8993 ls = isl_local_space_from_domain(ls);
8994 ls = isl_local_space_add_dims(ls, isl_dim_out, 1);
8995 bmap = isl_basic_map_from_local_space(ls);
8996 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
8997 k = isl_basic_map_alloc_equality(bmap);
9001 pos = isl_basic_map_offset(bmap, isl_dim_out);
9002 isl_seq_cpy(bmap->eq[k], aff->v->el + 1, pos);
9003 isl_int_neg(bmap->eq[k][pos], aff->v->el[0]);
9004 isl_seq_cpy(bmap->eq[k] + pos + 1, aff->v->el + 1 + pos,
9005 aff->v->size - (pos + 1));
9008 bmap = isl_basic_map_finalize(bmap);
9012 isl_basic_map_free(bmap);
9016 /* Construct a basic map mapping a domain in the given space to
9017 * to an n-dimensional range, with n the number of elements in the list,
9018 * where each coordinate in the range is prescribed by the
9019 * corresponding affine expression.
9020 * The domains of all affine expressions in the list are assumed to match
9023 __isl_give isl_basic_map *isl_basic_map_from_aff_list(
9024 __isl_take isl_dim *domain_dim, __isl_take isl_aff_list *list)
9028 isl_basic_map *bmap;
9033 dim = isl_dim_from_domain(domain_dim);
9034 bmap = isl_basic_map_universe(dim);
9036 for (i = 0; i < list->n; ++i) {
9038 isl_basic_map *bmap_i;
9040 aff = isl_aff_copy(list->p[i]);
9041 bmap_i = isl_basic_map_from_aff(aff);
9043 bmap = isl_basic_map_flat_range_product(bmap, bmap_i);
9046 isl_aff_list_free(list);
9050 __isl_give isl_set *isl_set_equate(__isl_take isl_set *set,
9051 enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2)
9053 return isl_map_equate(set, type1, pos1, type2, pos2);
9056 /* Add a constraint imposing that the given two dimensions are equal.
9058 __isl_give isl_map *isl_map_equate(__isl_take isl_map *map,
9059 enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2)
9061 isl_basic_map *bmap = NULL;
9067 if (pos1 >= isl_map_dim(map, type1))
9068 isl_die(map->ctx, isl_error_invalid,
9069 "index out of bounds", goto error);
9070 if (pos2 >= isl_map_dim(map, type2))
9071 isl_die(map->ctx, isl_error_invalid,
9072 "index out of bounds", goto error);
9074 bmap = isl_basic_map_alloc_dim(isl_map_get_dim(map), 0, 1, 0);
9075 i = isl_basic_map_alloc_equality(bmap);
9078 isl_seq_clr(bmap->eq[i], 1 + isl_basic_map_total_dim(bmap));
9079 pos1 += isl_basic_map_offset(bmap, type1);
9080 pos2 += isl_basic_map_offset(bmap, type2);
9081 isl_int_set_si(bmap->eq[i][pos1], -1);
9082 isl_int_set_si(bmap->eq[i][pos2], 1);
9083 bmap = isl_basic_map_finalize(bmap);
9085 map = isl_map_intersect(map, isl_map_from_basic_map(bmap));
9089 isl_basic_map_free(bmap);
9094 /* Add a constraint imposing that the given two dimensions have opposite values.
9096 __isl_give isl_map *isl_map_oppose(__isl_take isl_map *map,
9097 enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2)
9099 isl_basic_map *bmap = NULL;
9105 if (pos1 >= isl_map_dim(map, type1))
9106 isl_die(map->ctx, isl_error_invalid,
9107 "index out of bounds", goto error);
9108 if (pos2 >= isl_map_dim(map, type2))
9109 isl_die(map->ctx, isl_error_invalid,
9110 "index out of bounds", goto error);
9112 bmap = isl_basic_map_alloc_dim(isl_map_get_dim(map), 0, 1, 0);
9113 i = isl_basic_map_alloc_equality(bmap);
9116 isl_seq_clr(bmap->eq[i], 1 + isl_basic_map_total_dim(bmap));
9117 pos1 += isl_basic_map_offset(bmap, type1);
9118 pos2 += isl_basic_map_offset(bmap, type2);
9119 isl_int_set_si(bmap->eq[i][pos1], 1);
9120 isl_int_set_si(bmap->eq[i][pos2], 1);
9121 bmap = isl_basic_map_finalize(bmap);
9123 map = isl_map_intersect(map, isl_map_from_basic_map(bmap));
9127 isl_basic_map_free(bmap);