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_space_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(__isl_keep isl_space *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(__isl_keep isl_space *dim, enum isl_dim_type type)
48 case isl_dim_param: return 1;
49 case isl_dim_in: return 1 + dim->nparam;
50 case isl_dim_out: return 1 + dim->nparam + dim->n_in;
55 unsigned isl_basic_map_dim(__isl_keep isl_basic_map *bmap,
56 enum isl_dim_type type)
61 case isl_dim_cst: return 1;
64 case isl_dim_out: return isl_space_dim(bmap->dim, type);
65 case isl_dim_div: return bmap->n_div;
66 case isl_dim_all: return isl_basic_map_total_dim(bmap);
71 unsigned isl_map_dim(__isl_keep isl_map *map, enum isl_dim_type type)
73 return map ? n(map->dim, type) : 0;
76 unsigned isl_set_dim(__isl_keep isl_set *set, enum isl_dim_type type)
78 return set ? n(set->dim, type) : 0;
81 unsigned isl_basic_map_offset(struct isl_basic_map *bmap,
82 enum isl_dim_type type)
84 isl_space *dim = bmap->dim;
86 case isl_dim_cst: return 0;
87 case isl_dim_param: return 1;
88 case isl_dim_in: return 1 + dim->nparam;
89 case isl_dim_out: return 1 + dim->nparam + dim->n_in;
90 case isl_dim_div: return 1 + dim->nparam + dim->n_in + dim->n_out;
95 unsigned isl_basic_set_offset(struct isl_basic_set *bset,
96 enum isl_dim_type type)
98 return isl_basic_map_offset(bset, type);
101 static unsigned map_offset(struct isl_map *map, enum isl_dim_type type)
103 return pos(map->dim, type);
106 unsigned isl_basic_set_dim(__isl_keep isl_basic_set *bset,
107 enum isl_dim_type type)
109 return isl_basic_map_dim(bset, type);
112 unsigned isl_basic_set_n_dim(__isl_keep isl_basic_set *bset)
114 return isl_basic_set_dim(bset, isl_dim_set);
117 unsigned isl_basic_set_n_param(__isl_keep isl_basic_set *bset)
119 return isl_basic_set_dim(bset, isl_dim_param);
122 unsigned isl_basic_set_total_dim(const struct isl_basic_set *bset)
124 return isl_space_dim(bset->dim, isl_dim_all) + bset->n_div;
127 unsigned isl_set_n_dim(__isl_keep isl_set *set)
129 return isl_set_dim(set, isl_dim_set);
132 unsigned isl_set_n_param(__isl_keep isl_set *set)
134 return isl_set_dim(set, isl_dim_param);
137 unsigned isl_basic_map_n_in(const struct isl_basic_map *bmap)
139 return bmap ? bmap->dim->n_in : 0;
142 unsigned isl_basic_map_n_out(const struct isl_basic_map *bmap)
144 return bmap ? bmap->dim->n_out : 0;
147 unsigned isl_basic_map_n_param(const struct isl_basic_map *bmap)
149 return bmap ? bmap->dim->nparam : 0;
152 unsigned isl_basic_map_n_div(const struct isl_basic_map *bmap)
154 return bmap ? bmap->n_div : 0;
157 unsigned isl_basic_map_total_dim(const struct isl_basic_map *bmap)
159 return bmap ? isl_space_dim(bmap->dim, isl_dim_all) + 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_space_match(map->dim, isl_dim_param, set->dim, isl_dim_param);
185 return isl_space_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_space_match(bmap->dim, isl_dim_param, bset->dim, isl_dim_param);
197 return isl_space_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_space_match(map->dim, isl_dim_param, set->dim, isl_dim_param);
208 return isl_space_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_space_match(bmap->dim, isl_dim_param, bset->dim, isl_dim_param);
220 return isl_space_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 __isl_give isl_space *isl_basic_map_get_space(__isl_keep isl_basic_map *bmap)
247 return isl_space_copy(bmap->dim);
250 __isl_give isl_space *isl_basic_set_get_space(__isl_keep isl_basic_set *bset)
254 return isl_space_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_space_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_space(isl_local_space_get_space(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 __isl_give isl_space *isl_map_get_space(__isl_keep isl_map *map)
326 return isl_space_copy(map->dim);
329 __isl_give isl_space *isl_set_get_space(__isl_keep isl_set *set)
333 return isl_space_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_space_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_space_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_space_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_space_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_space_set_tuple_id(map->dim, type, id);
410 return isl_map_reset_space(map, isl_space_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_space_reset_tuple_id(map->dim, type);
428 return isl_map_reset_space(map, isl_space_copy(map->dim));
431 __isl_give isl_set *isl_set_reset_tuple_id(__isl_take isl_set *set)
433 return isl_map_reset_tuple_id(set, isl_dim_set);
436 int isl_map_has_tuple_id(__isl_keep isl_map *map, enum isl_dim_type type)
438 return map ? isl_space_has_tuple_id(map->dim, type) : -1;
441 __isl_give isl_id *isl_map_get_tuple_id(__isl_keep isl_map *map,
442 enum isl_dim_type type)
444 return map ? isl_space_get_tuple_id(map->dim, type) : NULL;
447 int isl_set_has_tuple_id(__isl_keep isl_set *set)
449 return isl_map_has_tuple_id(set, isl_dim_set);
452 __isl_give isl_id *isl_set_get_tuple_id(__isl_keep isl_set *set)
454 return isl_map_get_tuple_id(set, isl_dim_set);
457 const char *isl_basic_set_get_tuple_name(__isl_keep isl_basic_set *bset)
459 return bset ? isl_space_get_tuple_name(bset->dim, isl_dim_set) : NULL;
462 const char *isl_set_get_tuple_name(__isl_keep isl_set *set)
464 return set ? isl_space_get_tuple_name(set->dim, isl_dim_set) : NULL;
467 const char *isl_basic_map_get_dim_name(__isl_keep isl_basic_map *bmap,
468 enum isl_dim_type type, unsigned pos)
470 return bmap ? isl_space_get_dim_name(bmap->dim, type, pos) : NULL;
473 const char *isl_basic_set_get_dim_name(__isl_keep isl_basic_set *bset,
474 enum isl_dim_type type, unsigned pos)
476 return bset ? isl_space_get_dim_name(bset->dim, type, pos) : NULL;
479 const char *isl_map_get_dim_name(__isl_keep isl_map *map,
480 enum isl_dim_type type, unsigned pos)
482 return map ? isl_space_get_dim_name(map->dim, type, pos) : NULL;
485 const char *isl_set_get_dim_name(__isl_keep isl_set *set,
486 enum isl_dim_type type, unsigned pos)
488 return set ? isl_space_get_dim_name(set->dim, type, pos) : NULL;
491 __isl_give isl_basic_map *isl_basic_map_set_dim_name(
492 __isl_take isl_basic_map *bmap,
493 enum isl_dim_type type, unsigned pos, const char *s)
497 bmap->dim = isl_space_set_dim_name(bmap->dim, type, pos, s);
502 isl_basic_map_free(bmap);
506 __isl_give isl_map *isl_map_set_dim_name(__isl_take isl_map *map,
507 enum isl_dim_type type, unsigned pos, const char *s)
514 map->dim = isl_space_set_dim_name(map->dim, type, pos, s);
518 for (i = 0; i < map->n; ++i) {
519 map->p[i] = isl_basic_map_set_dim_name(map->p[i], type, pos, s);
530 __isl_give isl_basic_set *isl_basic_set_set_dim_name(
531 __isl_take isl_basic_set *bset,
532 enum isl_dim_type type, unsigned pos, const char *s)
534 return (isl_basic_set *)isl_basic_map_set_dim_name(
535 (isl_basic_map *)bset, type, pos, s);
538 __isl_give isl_set *isl_set_set_dim_name(__isl_take isl_set *set,
539 enum isl_dim_type type, unsigned pos, const char *s)
541 return (isl_set *)isl_map_set_dim_name((isl_map *)set, type, pos, s);
544 int isl_basic_map_has_dim_id(__isl_keep isl_basic_map *bmap,
545 enum isl_dim_type type, unsigned pos)
547 return bmap ? isl_space_has_dim_id(bmap->dim, type, pos) : -1;
550 int isl_map_has_dim_id(__isl_keep isl_map *map,
551 enum isl_dim_type type, unsigned pos)
553 return map ? isl_space_has_dim_id(map->dim, type, pos) : -1;
556 __isl_give isl_id *isl_map_get_dim_id(__isl_keep isl_map *map,
557 enum isl_dim_type type, unsigned pos)
559 return map ? isl_space_get_dim_id(map->dim, type, pos) : NULL;
562 int isl_set_has_dim_id(__isl_keep isl_set *set,
563 enum isl_dim_type type, unsigned pos)
565 return isl_map_has_dim_id(set, type, pos);
568 __isl_give isl_id *isl_set_get_dim_id(__isl_keep isl_set *set,
569 enum isl_dim_type type, unsigned pos)
571 return isl_map_get_dim_id(set, type, pos);
574 __isl_give isl_map *isl_map_set_dim_id(__isl_take isl_map *map,
575 enum isl_dim_type type, unsigned pos, __isl_take isl_id *id)
577 map = isl_map_cow(map);
579 return isl_id_free(id);
581 map->dim = isl_space_set_dim_id(map->dim, type, pos, id);
583 return isl_map_reset_space(map, isl_space_copy(map->dim));
586 __isl_give isl_set *isl_set_set_dim_id(__isl_take isl_set *set,
587 enum isl_dim_type type, unsigned pos, __isl_take isl_id *id)
589 return isl_map_set_dim_id(set, type, pos, id);
592 int isl_map_find_dim_by_id(__isl_keep isl_map *map, enum isl_dim_type type,
593 __isl_keep isl_id *id)
597 return isl_space_find_dim_by_id(map->dim, type, id);
600 int isl_set_find_dim_by_id(__isl_keep isl_set *set, enum isl_dim_type type,
601 __isl_keep isl_id *id)
603 return isl_map_find_dim_by_id(set, type, id);
606 int isl_map_find_dim_by_name(__isl_keep isl_map *map, enum isl_dim_type type,
611 return isl_space_find_dim_by_name(map->dim, type, name);
614 int isl_basic_map_is_rational(__isl_keep isl_basic_map *bmap)
618 return ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL);
621 int isl_basic_set_is_rational(__isl_keep isl_basic_set *bset)
623 return isl_basic_map_is_rational(bset);
626 /* Is this basic set a parameter domain?
628 int isl_basic_set_is_params(__isl_keep isl_basic_set *bset)
632 return isl_space_is_params(bset->dim);
635 /* Is this set a parameter domain?
637 int isl_set_is_params(__isl_keep isl_set *set)
641 return isl_space_is_params(set->dim);
644 /* Is this map actually a parameter domain?
645 * Users should never call this function. Outside of isl,
646 * a map can never be a parameter domain.
648 int isl_map_is_params(__isl_keep isl_map *map)
652 return isl_space_is_params(map->dim);
655 static struct isl_basic_map *basic_map_init(struct isl_ctx *ctx,
656 struct isl_basic_map *bmap, unsigned extra,
657 unsigned n_eq, unsigned n_ineq)
660 size_t row_size = 1 + isl_space_dim(bmap->dim, isl_dim_all) + extra;
665 bmap->block = isl_blk_alloc(ctx, (n_ineq + n_eq) * row_size);
666 if (isl_blk_is_error(bmap->block))
669 bmap->ineq = isl_alloc_array(ctx, isl_int *, n_ineq + n_eq);
674 bmap->block2 = isl_blk_empty();
677 bmap->block2 = isl_blk_alloc(ctx, extra * (1 + row_size));
678 if (isl_blk_is_error(bmap->block2))
681 bmap->div = isl_alloc_array(ctx, isl_int *, extra);
686 for (i = 0; i < n_ineq + n_eq; ++i)
687 bmap->ineq[i] = bmap->block.data + i * row_size;
689 for (i = 0; i < extra; ++i)
690 bmap->div[i] = bmap->block2.data + i * (1 + row_size);
694 bmap->c_size = n_eq + n_ineq;
695 bmap->eq = bmap->ineq + n_ineq;
704 isl_basic_map_free(bmap);
708 struct isl_basic_set *isl_basic_set_alloc(struct isl_ctx *ctx,
709 unsigned nparam, unsigned dim, unsigned extra,
710 unsigned n_eq, unsigned n_ineq)
712 struct isl_basic_map *bmap;
715 space = isl_space_set_alloc(ctx, nparam, dim);
719 bmap = isl_basic_map_alloc_space(space, extra, n_eq, n_ineq);
720 return (struct isl_basic_set *)bmap;
723 struct isl_basic_set *isl_basic_set_alloc_space(__isl_take isl_space *dim,
724 unsigned extra, unsigned n_eq, unsigned n_ineq)
726 struct isl_basic_map *bmap;
729 isl_assert(dim->ctx, dim->n_in == 0, goto error);
730 bmap = isl_basic_map_alloc_space(dim, extra, n_eq, n_ineq);
731 return (struct isl_basic_set *)bmap;
737 struct isl_basic_map *isl_basic_map_alloc_space(__isl_take isl_space *dim,
738 unsigned extra, unsigned n_eq, unsigned n_ineq)
740 struct isl_basic_map *bmap;
744 bmap = isl_calloc_type(dim->ctx, struct isl_basic_map);
749 return basic_map_init(dim->ctx, bmap, extra, n_eq, n_ineq);
755 struct isl_basic_map *isl_basic_map_alloc(struct isl_ctx *ctx,
756 unsigned nparam, unsigned in, unsigned out, unsigned extra,
757 unsigned n_eq, unsigned n_ineq)
759 struct isl_basic_map *bmap;
762 dim = isl_space_alloc(ctx, nparam, in, out);
766 bmap = isl_basic_map_alloc_space(dim, extra, n_eq, n_ineq);
770 static void dup_constraints(
771 struct isl_basic_map *dst, struct isl_basic_map *src)
774 unsigned total = isl_basic_map_total_dim(src);
776 for (i = 0; i < src->n_eq; ++i) {
777 int j = isl_basic_map_alloc_equality(dst);
778 isl_seq_cpy(dst->eq[j], src->eq[i], 1+total);
781 for (i = 0; i < src->n_ineq; ++i) {
782 int j = isl_basic_map_alloc_inequality(dst);
783 isl_seq_cpy(dst->ineq[j], src->ineq[i], 1+total);
786 for (i = 0; i < src->n_div; ++i) {
787 int j = isl_basic_map_alloc_div(dst);
788 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total);
790 ISL_F_SET(dst, ISL_BASIC_SET_FINAL);
793 struct isl_basic_map *isl_basic_map_dup(struct isl_basic_map *bmap)
795 struct isl_basic_map *dup;
799 dup = isl_basic_map_alloc_space(isl_space_copy(bmap->dim),
800 bmap->n_div, bmap->n_eq, bmap->n_ineq);
803 dup_constraints(dup, bmap);
804 dup->flags = bmap->flags;
805 dup->sample = isl_vec_copy(bmap->sample);
809 struct isl_basic_set *isl_basic_set_dup(struct isl_basic_set *bset)
811 struct isl_basic_map *dup;
813 dup = isl_basic_map_dup((struct isl_basic_map *)bset);
814 return (struct isl_basic_set *)dup;
817 struct isl_basic_set *isl_basic_set_copy(struct isl_basic_set *bset)
822 if (ISL_F_ISSET(bset, ISL_BASIC_SET_FINAL)) {
826 return isl_basic_set_dup(bset);
829 struct isl_set *isl_set_copy(struct isl_set *set)
838 struct isl_basic_map *isl_basic_map_copy(struct isl_basic_map *bmap)
843 if (ISL_F_ISSET(bmap, ISL_BASIC_SET_FINAL)) {
847 bmap = isl_basic_map_dup(bmap);
849 ISL_F_SET(bmap, ISL_BASIC_SET_FINAL);
853 struct isl_map *isl_map_copy(struct isl_map *map)
862 void isl_basic_map_free(struct isl_basic_map *bmap)
870 isl_ctx_deref(bmap->ctx);
872 isl_blk_free(bmap->ctx, bmap->block2);
874 isl_blk_free(bmap->ctx, bmap->block);
875 isl_vec_free(bmap->sample);
876 isl_space_free(bmap->dim);
880 void isl_basic_set_free(struct isl_basic_set *bset)
882 isl_basic_map_free((struct isl_basic_map *)bset);
885 static int room_for_con(struct isl_basic_map *bmap, unsigned n)
887 return bmap->n_eq + bmap->n_ineq + n <= bmap->c_size;
890 __isl_give isl_map *isl_map_align_params_map_map_and(
891 __isl_take isl_map *map1, __isl_take isl_map *map2,
892 __isl_give isl_map *(*fn)(__isl_take isl_map *map1,
893 __isl_take isl_map *map2))
897 if (isl_space_match(map1->dim, isl_dim_param, map2->dim, isl_dim_param))
898 return fn(map1, map2);
899 if (!isl_space_has_named_params(map1->dim) ||
900 !isl_space_has_named_params(map2->dim))
901 isl_die(map1->ctx, isl_error_invalid,
902 "unaligned unnamed parameters", goto error);
903 map1 = isl_map_align_params(map1, isl_map_get_space(map2));
904 map2 = isl_map_align_params(map2, isl_map_get_space(map1));
905 return fn(map1, map2);
912 static int align_params_map_map_and_test(__isl_keep isl_map *map1,
913 __isl_keep isl_map *map2,
914 int (*fn)(__isl_keep isl_map *map1, __isl_keep isl_map *map2))
920 if (isl_space_match(map1->dim, isl_dim_param, map2->dim, isl_dim_param))
921 return fn(map1, map2);
922 if (!isl_space_has_named_params(map1->dim) ||
923 !isl_space_has_named_params(map2->dim))
924 isl_die(map1->ctx, isl_error_invalid,
925 "unaligned unnamed parameters", return -1);
926 map1 = isl_map_copy(map1);
927 map2 = isl_map_copy(map2);
928 map1 = isl_map_align_params(map1, isl_map_get_space(map2));
929 map2 = isl_map_align_params(map2, isl_map_get_space(map1));
936 int isl_basic_map_alloc_equality(struct isl_basic_map *bmap)
942 isl_assert(ctx, room_for_con(bmap, 1), return -1);
943 isl_assert(ctx, (bmap->eq - bmap->ineq) + bmap->n_eq <= bmap->c_size,
945 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
946 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
947 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_IMPLICIT);
948 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
949 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
950 if ((bmap->eq - bmap->ineq) + bmap->n_eq == bmap->c_size) {
952 int j = isl_basic_map_alloc_inequality(bmap);
956 bmap->ineq[j] = bmap->ineq[bmap->n_ineq - 1];
957 bmap->ineq[bmap->n_ineq - 1] = bmap->eq[-1];
964 isl_seq_clr(bmap->eq[bmap->n_eq] + 1 + isl_basic_map_total_dim(bmap),
965 bmap->extra - bmap->n_div);
969 int isl_basic_set_alloc_equality(struct isl_basic_set *bset)
971 return isl_basic_map_alloc_equality((struct isl_basic_map *)bset);
974 int isl_basic_map_free_equality(struct isl_basic_map *bmap, unsigned n)
978 isl_assert(bmap->ctx, n <= bmap->n_eq, return -1);
983 int isl_basic_set_free_equality(struct isl_basic_set *bset, unsigned n)
985 return isl_basic_map_free_equality((struct isl_basic_map *)bset, n);
988 int isl_basic_map_drop_equality(struct isl_basic_map *bmap, unsigned pos)
993 isl_assert(bmap->ctx, pos < bmap->n_eq, return -1);
995 if (pos != bmap->n_eq - 1) {
997 bmap->eq[pos] = bmap->eq[bmap->n_eq - 1];
998 bmap->eq[bmap->n_eq - 1] = t;
1004 int isl_basic_set_drop_equality(struct isl_basic_set *bset, unsigned pos)
1006 return isl_basic_map_drop_equality((struct isl_basic_map *)bset, pos);
1009 void isl_basic_map_inequality_to_equality(
1010 struct isl_basic_map *bmap, unsigned pos)
1014 t = bmap->ineq[pos];
1015 bmap->ineq[pos] = bmap->ineq[bmap->n_ineq - 1];
1016 bmap->ineq[bmap->n_ineq - 1] = bmap->eq[-1];
1021 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
1022 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1023 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
1024 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
1027 static int room_for_ineq(struct isl_basic_map *bmap, unsigned n)
1029 return bmap->n_ineq + n <= bmap->eq - bmap->ineq;
1032 int isl_basic_map_alloc_inequality(struct isl_basic_map *bmap)
1034 struct isl_ctx *ctx;
1038 isl_assert(ctx, room_for_ineq(bmap, 1), return -1);
1039 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_IMPLICIT);
1040 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
1041 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1042 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
1043 isl_seq_clr(bmap->ineq[bmap->n_ineq] +
1044 1 + isl_basic_map_total_dim(bmap),
1045 bmap->extra - bmap->n_div);
1046 return bmap->n_ineq++;
1049 int isl_basic_set_alloc_inequality(struct isl_basic_set *bset)
1051 return isl_basic_map_alloc_inequality((struct isl_basic_map *)bset);
1054 int isl_basic_map_free_inequality(struct isl_basic_map *bmap, unsigned n)
1058 isl_assert(bmap->ctx, n <= bmap->n_ineq, return -1);
1063 int isl_basic_set_free_inequality(struct isl_basic_set *bset, unsigned n)
1065 return isl_basic_map_free_inequality((struct isl_basic_map *)bset, n);
1068 int isl_basic_map_drop_inequality(struct isl_basic_map *bmap, unsigned pos)
1073 isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
1075 if (pos != bmap->n_ineq - 1) {
1076 t = bmap->ineq[pos];
1077 bmap->ineq[pos] = bmap->ineq[bmap->n_ineq - 1];
1078 bmap->ineq[bmap->n_ineq - 1] = t;
1079 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1085 int isl_basic_set_drop_inequality(struct isl_basic_set *bset, unsigned pos)
1087 return isl_basic_map_drop_inequality((struct isl_basic_map *)bset, pos);
1090 __isl_give isl_basic_map *isl_basic_map_add_eq(__isl_take isl_basic_map *bmap,
1095 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
1098 k = isl_basic_map_alloc_equality(bmap);
1101 isl_seq_cpy(bmap->eq[k], eq, 1 + isl_basic_map_total_dim(bmap));
1104 isl_basic_map_free(bmap);
1108 __isl_give isl_basic_set *isl_basic_set_add_eq(__isl_take isl_basic_set *bset,
1111 return (isl_basic_set *)
1112 isl_basic_map_add_eq((isl_basic_map *)bset, eq);
1115 __isl_give isl_basic_map *isl_basic_map_add_ineq(__isl_take isl_basic_map *bmap,
1120 bmap = isl_basic_map_extend_constraints(bmap, 0, 1);
1123 k = isl_basic_map_alloc_inequality(bmap);
1126 isl_seq_cpy(bmap->ineq[k], ineq, 1 + isl_basic_map_total_dim(bmap));
1129 isl_basic_map_free(bmap);
1133 __isl_give isl_basic_set *isl_basic_set_add_ineq(__isl_take isl_basic_set *bset,
1136 return (isl_basic_set *)
1137 isl_basic_map_add_ineq((isl_basic_map *)bset, ineq);
1140 int isl_basic_map_alloc_div(struct isl_basic_map *bmap)
1144 isl_assert(bmap->ctx, bmap->n_div < bmap->extra, return -1);
1145 isl_seq_clr(bmap->div[bmap->n_div] +
1146 1 + 1 + isl_basic_map_total_dim(bmap),
1147 bmap->extra - bmap->n_div);
1148 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
1149 return bmap->n_div++;
1152 int isl_basic_set_alloc_div(struct isl_basic_set *bset)
1154 return isl_basic_map_alloc_div((struct isl_basic_map *)bset);
1157 int isl_basic_map_free_div(struct isl_basic_map *bmap, unsigned n)
1161 isl_assert(bmap->ctx, n <= bmap->n_div, return -1);
1166 int isl_basic_set_free_div(struct isl_basic_set *bset, unsigned n)
1168 return isl_basic_map_free_div((struct isl_basic_map *)bset, n);
1171 /* Copy constraint from src to dst, putting the vars of src at offset
1172 * dim_off in dst and the divs of src at offset div_off in dst.
1173 * If both sets are actually map, then dim_off applies to the input
1176 static void copy_constraint(struct isl_basic_map *dst_map, isl_int *dst,
1177 struct isl_basic_map *src_map, isl_int *src,
1178 unsigned in_off, unsigned out_off, unsigned div_off)
1180 unsigned src_nparam = isl_basic_map_n_param(src_map);
1181 unsigned dst_nparam = isl_basic_map_n_param(dst_map);
1182 unsigned src_in = isl_basic_map_n_in(src_map);
1183 unsigned dst_in = isl_basic_map_n_in(dst_map);
1184 unsigned src_out = isl_basic_map_n_out(src_map);
1185 unsigned dst_out = isl_basic_map_n_out(dst_map);
1186 isl_int_set(dst[0], src[0]);
1187 isl_seq_cpy(dst+1, src+1, isl_min(dst_nparam, src_nparam));
1188 if (dst_nparam > src_nparam)
1189 isl_seq_clr(dst+1+src_nparam,
1190 dst_nparam - src_nparam);
1191 isl_seq_clr(dst+1+dst_nparam, in_off);
1192 isl_seq_cpy(dst+1+dst_nparam+in_off,
1194 isl_min(dst_in-in_off, src_in));
1195 if (dst_in-in_off > src_in)
1196 isl_seq_clr(dst+1+dst_nparam+in_off+src_in,
1197 dst_in - in_off - src_in);
1198 isl_seq_clr(dst+1+dst_nparam+dst_in, out_off);
1199 isl_seq_cpy(dst+1+dst_nparam+dst_in+out_off,
1200 src+1+src_nparam+src_in,
1201 isl_min(dst_out-out_off, src_out));
1202 if (dst_out-out_off > src_out)
1203 isl_seq_clr(dst+1+dst_nparam+dst_in+out_off+src_out,
1204 dst_out - out_off - src_out);
1205 isl_seq_clr(dst+1+dst_nparam+dst_in+dst_out, div_off);
1206 isl_seq_cpy(dst+1+dst_nparam+dst_in+dst_out+div_off,
1207 src+1+src_nparam+src_in+src_out,
1208 isl_min(dst_map->extra-div_off, src_map->n_div));
1209 if (dst_map->n_div-div_off > src_map->n_div)
1210 isl_seq_clr(dst+1+dst_nparam+dst_in+dst_out+
1211 div_off+src_map->n_div,
1212 dst_map->n_div - div_off - src_map->n_div);
1215 static void copy_div(struct isl_basic_map *dst_map, isl_int *dst,
1216 struct isl_basic_map *src_map, isl_int *src,
1217 unsigned in_off, unsigned out_off, unsigned div_off)
1219 isl_int_set(dst[0], src[0]);
1220 copy_constraint(dst_map, dst+1, src_map, src+1, in_off, out_off, div_off);
1223 static struct isl_basic_map *add_constraints(struct isl_basic_map *bmap1,
1224 struct isl_basic_map *bmap2, unsigned i_pos, unsigned o_pos)
1229 if (!bmap1 || !bmap2)
1232 div_off = bmap1->n_div;
1234 for (i = 0; i < bmap2->n_eq; ++i) {
1235 int i1 = isl_basic_map_alloc_equality(bmap1);
1238 copy_constraint(bmap1, bmap1->eq[i1], bmap2, bmap2->eq[i],
1239 i_pos, o_pos, div_off);
1242 for (i = 0; i < bmap2->n_ineq; ++i) {
1243 int i1 = isl_basic_map_alloc_inequality(bmap1);
1246 copy_constraint(bmap1, bmap1->ineq[i1], bmap2, bmap2->ineq[i],
1247 i_pos, o_pos, div_off);
1250 for (i = 0; i < bmap2->n_div; ++i) {
1251 int i1 = isl_basic_map_alloc_div(bmap1);
1254 copy_div(bmap1, bmap1->div[i1], bmap2, bmap2->div[i],
1255 i_pos, o_pos, div_off);
1258 isl_basic_map_free(bmap2);
1263 isl_basic_map_free(bmap1);
1264 isl_basic_map_free(bmap2);
1268 struct isl_basic_set *isl_basic_set_add_constraints(struct isl_basic_set *bset1,
1269 struct isl_basic_set *bset2, unsigned pos)
1271 return (struct isl_basic_set *)
1272 add_constraints((struct isl_basic_map *)bset1,
1273 (struct isl_basic_map *)bset2, 0, pos);
1276 struct isl_basic_map *isl_basic_map_extend_space(struct isl_basic_map *base,
1277 __isl_take isl_space *dim, unsigned extra,
1278 unsigned n_eq, unsigned n_ineq)
1280 struct isl_basic_map *ext;
1290 dims_ok = isl_space_is_equal(base->dim, dim) &&
1291 base->extra >= base->n_div + extra;
1293 if (dims_ok && room_for_con(base, n_eq + n_ineq) &&
1294 room_for_ineq(base, n_ineq)) {
1295 isl_space_free(dim);
1299 isl_assert(base->ctx, base->dim->nparam <= dim->nparam, goto error);
1300 isl_assert(base->ctx, base->dim->n_in <= dim->n_in, goto error);
1301 isl_assert(base->ctx, base->dim->n_out <= dim->n_out, goto error);
1302 extra += base->extra;
1304 n_ineq += base->n_ineq;
1306 ext = isl_basic_map_alloc_space(dim, extra, n_eq, n_ineq);
1312 ext->sample = isl_vec_copy(base->sample);
1313 flags = base->flags;
1314 ext = add_constraints(ext, base, 0, 0);
1317 ISL_F_CLR(ext, ISL_BASIC_SET_FINAL);
1323 isl_space_free(dim);
1324 isl_basic_map_free(base);
1328 struct isl_basic_set *isl_basic_set_extend_space(struct isl_basic_set *base,
1329 __isl_take isl_space *dim, unsigned extra,
1330 unsigned n_eq, unsigned n_ineq)
1332 return (struct isl_basic_set *)
1333 isl_basic_map_extend_space((struct isl_basic_map *)base, dim,
1334 extra, n_eq, n_ineq);
1337 struct isl_basic_map *isl_basic_map_extend_constraints(
1338 struct isl_basic_map *base, unsigned n_eq, unsigned n_ineq)
1342 return isl_basic_map_extend_space(base, isl_space_copy(base->dim),
1346 struct isl_basic_map *isl_basic_map_extend(struct isl_basic_map *base,
1347 unsigned nparam, unsigned n_in, unsigned n_out, unsigned extra,
1348 unsigned n_eq, unsigned n_ineq)
1350 struct isl_basic_map *bmap;
1355 dim = isl_space_alloc(base->ctx, nparam, n_in, n_out);
1359 bmap = isl_basic_map_extend_space(base, dim, extra, n_eq, n_ineq);
1362 isl_basic_map_free(base);
1366 struct isl_basic_set *isl_basic_set_extend(struct isl_basic_set *base,
1367 unsigned nparam, unsigned dim, unsigned extra,
1368 unsigned n_eq, unsigned n_ineq)
1370 return (struct isl_basic_set *)
1371 isl_basic_map_extend((struct isl_basic_map *)base,
1372 nparam, 0, dim, extra, n_eq, n_ineq);
1375 struct isl_basic_set *isl_basic_set_extend_constraints(
1376 struct isl_basic_set *base, unsigned n_eq, unsigned n_ineq)
1378 return (struct isl_basic_set *)
1379 isl_basic_map_extend_constraints((struct isl_basic_map *)base,
1383 struct isl_basic_set *isl_basic_set_cow(struct isl_basic_set *bset)
1385 return (struct isl_basic_set *)
1386 isl_basic_map_cow((struct isl_basic_map *)bset);
1389 struct isl_basic_map *isl_basic_map_cow(struct isl_basic_map *bmap)
1394 if (bmap->ref > 1) {
1396 bmap = isl_basic_map_dup(bmap);
1399 ISL_F_CLR(bmap, ISL_BASIC_SET_FINAL);
1403 struct isl_set *isl_set_cow(struct isl_set *set)
1411 return isl_set_dup(set);
1414 struct isl_map *isl_map_cow(struct isl_map *map)
1422 return isl_map_dup(map);
1425 static void swap_vars(struct isl_blk blk, isl_int *a,
1426 unsigned a_len, unsigned b_len)
1428 isl_seq_cpy(blk.data, a+a_len, b_len);
1429 isl_seq_cpy(blk.data+b_len, a, a_len);
1430 isl_seq_cpy(a, blk.data, b_len+a_len);
1433 static __isl_give isl_basic_map *isl_basic_map_swap_vars(
1434 __isl_take isl_basic_map *bmap, unsigned pos, unsigned n1, unsigned n2)
1442 isl_assert(bmap->ctx,
1443 pos + n1 + n2 <= 1 + isl_basic_map_total_dim(bmap), goto error);
1445 if (n1 == 0 || n2 == 0)
1448 bmap = isl_basic_map_cow(bmap);
1452 blk = isl_blk_alloc(bmap->ctx, n1 + n2);
1453 if (isl_blk_is_error(blk))
1456 for (i = 0; i < bmap->n_eq; ++i)
1458 bmap->eq[i] + pos, n1, n2);
1460 for (i = 0; i < bmap->n_ineq; ++i)
1462 bmap->ineq[i] + pos, n1, n2);
1464 for (i = 0; i < bmap->n_div; ++i)
1466 bmap->div[i]+1 + pos, n1, n2);
1468 isl_blk_free(bmap->ctx, blk);
1470 ISL_F_CLR(bmap, ISL_BASIC_SET_NORMALIZED);
1471 bmap = isl_basic_map_gauss(bmap, NULL);
1472 return isl_basic_map_finalize(bmap);
1474 isl_basic_map_free(bmap);
1478 static __isl_give isl_basic_set *isl_basic_set_swap_vars(
1479 __isl_take isl_basic_set *bset, unsigned n)
1484 nparam = isl_basic_set_n_param(bset);
1485 dim = isl_basic_set_n_dim(bset);
1486 isl_assert(bset->ctx, n <= dim, goto error);
1488 return isl_basic_map_swap_vars(bset, 1 + nparam, n, dim - n);
1490 isl_basic_set_free(bset);
1494 struct isl_basic_map *isl_basic_map_set_to_empty(struct isl_basic_map *bmap)
1500 total = isl_basic_map_total_dim(bmap);
1501 isl_basic_map_free_div(bmap, bmap->n_div);
1502 isl_basic_map_free_inequality(bmap, bmap->n_ineq);
1504 isl_basic_map_free_equality(bmap, bmap->n_eq-1);
1506 i = isl_basic_map_alloc_equality(bmap);
1510 isl_int_set_si(bmap->eq[i][0], 1);
1511 isl_seq_clr(bmap->eq[i]+1, total);
1512 ISL_F_SET(bmap, ISL_BASIC_MAP_EMPTY);
1513 isl_vec_free(bmap->sample);
1514 bmap->sample = NULL;
1515 return isl_basic_map_finalize(bmap);
1517 isl_basic_map_free(bmap);
1521 struct isl_basic_set *isl_basic_set_set_to_empty(struct isl_basic_set *bset)
1523 return (struct isl_basic_set *)
1524 isl_basic_map_set_to_empty((struct isl_basic_map *)bset);
1527 void isl_basic_map_swap_div(struct isl_basic_map *bmap, int a, int b)
1530 unsigned off = isl_space_dim(bmap->dim, isl_dim_all);
1531 isl_int *t = bmap->div[a];
1532 bmap->div[a] = bmap->div[b];
1535 for (i = 0; i < bmap->n_eq; ++i)
1536 isl_int_swap(bmap->eq[i][1+off+a], bmap->eq[i][1+off+b]);
1538 for (i = 0; i < bmap->n_ineq; ++i)
1539 isl_int_swap(bmap->ineq[i][1+off+a], bmap->ineq[i][1+off+b]);
1541 for (i = 0; i < bmap->n_div; ++i)
1542 isl_int_swap(bmap->div[i][1+1+off+a], bmap->div[i][1+1+off+b]);
1543 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1546 /* Eliminate the specified n dimensions starting at first from the
1547 * constraints using Fourier-Motzkin. The dimensions themselves
1550 __isl_give isl_map *isl_map_eliminate(__isl_take isl_map *map,
1551 enum isl_dim_type type, unsigned first, unsigned n)
1560 map = isl_map_cow(map);
1564 for (i = 0; i < map->n; ++i) {
1565 map->p[i] = isl_basic_map_eliminate(map->p[i], type, first, n);
1575 /* Eliminate the specified n dimensions starting at first from the
1576 * constraints using Fourier-Motzkin. The dimensions themselves
1579 __isl_give isl_set *isl_set_eliminate(__isl_take isl_set *set,
1580 enum isl_dim_type type, unsigned first, unsigned n)
1582 return (isl_set *)isl_map_eliminate((isl_map *)set, type, first, n);
1585 /* Eliminate the specified n dimensions starting at first from the
1586 * constraints using Fourier-Motzkin. The dimensions themselves
1589 __isl_give isl_set *isl_set_eliminate_dims(__isl_take isl_set *set,
1590 unsigned first, unsigned n)
1592 return isl_set_eliminate(set, isl_dim_set, first, n);
1595 __isl_give isl_basic_map *isl_basic_map_remove_divs(
1596 __isl_take isl_basic_map *bmap)
1600 bmap = isl_basic_map_eliminate_vars(bmap,
1601 isl_space_dim(bmap->dim, isl_dim_all), bmap->n_div);
1605 return isl_basic_map_finalize(bmap);
1608 __isl_give isl_basic_set *isl_basic_set_remove_divs(
1609 __isl_take isl_basic_set *bset)
1611 return (struct isl_basic_set *)isl_basic_map_remove_divs(
1612 (struct isl_basic_map *)bset);
1615 __isl_give isl_map *isl_map_remove_divs(__isl_take isl_map *map)
1624 map = isl_map_cow(map);
1628 for (i = 0; i < map->n; ++i) {
1629 map->p[i] = isl_basic_map_remove_divs(map->p[i]);
1639 __isl_give isl_set *isl_set_remove_divs(__isl_take isl_set *set)
1641 return isl_map_remove_divs(set);
1644 struct isl_basic_map *isl_basic_map_remove_dims(struct isl_basic_map *bmap,
1645 enum isl_dim_type type, unsigned first, unsigned n)
1649 isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
1651 if (n == 0 && !isl_space_is_named_or_nested(bmap->dim, type))
1653 bmap = isl_basic_map_eliminate_vars(bmap,
1654 isl_basic_map_offset(bmap, type) - 1 + first, n);
1657 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY) && type == isl_dim_div)
1659 bmap = isl_basic_map_drop(bmap, type, first, n);
1662 isl_basic_map_free(bmap);
1666 /* Return true if the definition of the given div (recursively) involves
1667 * any of the given variables.
1669 static int div_involves_vars(__isl_keep isl_basic_map *bmap, int div,
1670 unsigned first, unsigned n)
1673 unsigned div_offset = isl_basic_map_offset(bmap, isl_dim_div);
1675 if (isl_int_is_zero(bmap->div[div][0]))
1677 if (isl_seq_first_non_zero(bmap->div[div] + 1 + first, n) >= 0)
1680 for (i = bmap->n_div - 1; i >= 0; --i) {
1681 if (isl_int_is_zero(bmap->div[div][1 + div_offset + i]))
1683 if (div_involves_vars(bmap, i, first, n))
1690 /* Remove all divs (recursively) involving any of the given dimensions
1691 * in their definitions.
1693 __isl_give isl_basic_map *isl_basic_map_remove_divs_involving_dims(
1694 __isl_take isl_basic_map *bmap,
1695 enum isl_dim_type type, unsigned first, unsigned n)
1701 isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
1703 first += isl_basic_map_offset(bmap, type);
1705 for (i = bmap->n_div - 1; i >= 0; --i) {
1706 if (!div_involves_vars(bmap, i, first, n))
1708 bmap = isl_basic_map_remove_dims(bmap, isl_dim_div, i, 1);
1716 isl_basic_map_free(bmap);
1720 __isl_give isl_map *isl_map_remove_divs_involving_dims(__isl_take isl_map *map,
1721 enum isl_dim_type type, unsigned first, unsigned n)
1730 map = isl_map_cow(map);
1734 for (i = 0; i < map->n; ++i) {
1735 map->p[i] = isl_basic_map_remove_divs_involving_dims(map->p[i],
1746 __isl_give isl_set *isl_set_remove_divs_involving_dims(__isl_take isl_set *set,
1747 enum isl_dim_type type, unsigned first, unsigned n)
1749 return (isl_set *)isl_map_remove_divs_involving_dims((isl_map *)set,
1753 int isl_basic_map_involves_dims(__isl_keep isl_basic_map *bmap,
1754 enum isl_dim_type type, unsigned first, unsigned n)
1761 if (first + n > isl_basic_map_dim(bmap, type))
1762 isl_die(bmap->ctx, isl_error_invalid,
1763 "index out of bounds", return -1);
1765 first += isl_basic_map_offset(bmap, type);
1766 for (i = 0; i < bmap->n_eq; ++i)
1767 if (isl_seq_first_non_zero(bmap->eq[i] + first, n) >= 0)
1769 for (i = 0; i < bmap->n_ineq; ++i)
1770 if (isl_seq_first_non_zero(bmap->ineq[i] + first, n) >= 0)
1776 int isl_map_involves_dims(__isl_keep isl_map *map,
1777 enum isl_dim_type type, unsigned first, unsigned n)
1784 if (first + n > isl_map_dim(map, type))
1785 isl_die(map->ctx, isl_error_invalid,
1786 "index out of bounds", return -1);
1788 for (i = 0; i < map->n; ++i) {
1789 int involves = isl_basic_map_involves_dims(map->p[i],
1791 if (involves < 0 || involves)
1798 int isl_basic_set_involves_dims(__isl_keep isl_basic_set *bset,
1799 enum isl_dim_type type, unsigned first, unsigned n)
1801 return isl_basic_map_involves_dims(bset, type, first, n);
1804 int isl_set_involves_dims(__isl_keep isl_set *set,
1805 enum isl_dim_type type, unsigned first, unsigned n)
1807 return isl_map_involves_dims(set, type, first, n);
1810 /* Return true if the definition of the given div is unknown or depends
1813 static int div_is_unknown(__isl_keep isl_basic_map *bmap, int div)
1816 unsigned div_offset = isl_basic_map_offset(bmap, isl_dim_div);
1818 if (isl_int_is_zero(bmap->div[div][0]))
1821 for (i = bmap->n_div - 1; i >= 0; --i) {
1822 if (isl_int_is_zero(bmap->div[div][1 + div_offset + i]))
1824 if (div_is_unknown(bmap, i))
1831 /* Remove all divs that are unknown or defined in terms of unknown divs.
1833 __isl_give isl_basic_map *isl_basic_map_remove_unknown_divs(
1834 __isl_take isl_basic_map *bmap)
1841 for (i = bmap->n_div - 1; i >= 0; --i) {
1842 if (!div_is_unknown(bmap, i))
1844 bmap = isl_basic_map_remove_dims(bmap, isl_dim_div, i, 1);
1850 __isl_give isl_map *isl_map_remove_unknown_divs(__isl_take isl_map *map)
1859 map = isl_map_cow(map);
1863 for (i = 0; i < map->n; ++i) {
1864 map->p[i] = isl_basic_map_remove_unknown_divs(map->p[i]);
1874 __isl_give isl_set *isl_set_remove_unknown_divs(__isl_take isl_set *set)
1876 return (isl_set *)isl_map_remove_unknown_divs((isl_map *)set);
1879 __isl_give isl_basic_set *isl_basic_set_remove_dims(
1880 __isl_take isl_basic_set *bset,
1881 enum isl_dim_type type, unsigned first, unsigned n)
1883 return (isl_basic_set *)
1884 isl_basic_map_remove_dims((isl_basic_map *)bset, type, first, n);
1887 struct isl_map *isl_map_remove_dims(struct isl_map *map,
1888 enum isl_dim_type type, unsigned first, unsigned n)
1895 map = isl_map_cow(map);
1898 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
1900 for (i = 0; i < map->n; ++i) {
1901 map->p[i] = isl_basic_map_eliminate_vars(map->p[i],
1902 isl_basic_map_offset(map->p[i], type) - 1 + first, n);
1906 map = isl_map_drop(map, type, first, n);
1913 __isl_give isl_set *isl_set_remove_dims(__isl_take isl_set *bset,
1914 enum isl_dim_type type, unsigned first, unsigned n)
1916 return (isl_set *)isl_map_remove_dims((isl_map *)bset, type, first, n);
1919 /* Project out n inputs starting at first using Fourier-Motzkin */
1920 struct isl_map *isl_map_remove_inputs(struct isl_map *map,
1921 unsigned first, unsigned n)
1923 return isl_map_remove_dims(map, isl_dim_in, first, n);
1926 static void dump_term(struct isl_basic_map *bmap,
1927 isl_int c, int pos, FILE *out)
1930 unsigned in = isl_basic_map_n_in(bmap);
1931 unsigned dim = in + isl_basic_map_n_out(bmap);
1932 unsigned nparam = isl_basic_map_n_param(bmap);
1934 isl_int_print(out, c, 0);
1936 if (!isl_int_is_one(c))
1937 isl_int_print(out, c, 0);
1938 if (pos < 1 + nparam) {
1939 name = isl_space_get_dim_name(bmap->dim,
1940 isl_dim_param, pos - 1);
1942 fprintf(out, "%s", name);
1944 fprintf(out, "p%d", pos - 1);
1945 } else if (pos < 1 + nparam + in)
1946 fprintf(out, "i%d", pos - 1 - nparam);
1947 else if (pos < 1 + nparam + dim)
1948 fprintf(out, "o%d", pos - 1 - nparam - in);
1950 fprintf(out, "e%d", pos - 1 - nparam - dim);
1954 static void dump_constraint_sign(struct isl_basic_map *bmap, isl_int *c,
1955 int sign, FILE *out)
1959 unsigned len = 1 + isl_basic_map_total_dim(bmap);
1963 for (i = 0, first = 1; i < len; ++i) {
1964 if (isl_int_sgn(c[i]) * sign <= 0)
1967 fprintf(out, " + ");
1969 isl_int_abs(v, c[i]);
1970 dump_term(bmap, v, i, out);
1977 static void dump_constraint(struct isl_basic_map *bmap, isl_int *c,
1978 const char *op, FILE *out, int indent)
1982 fprintf(out, "%*s", indent, "");
1984 dump_constraint_sign(bmap, c, 1, out);
1985 fprintf(out, " %s ", op);
1986 dump_constraint_sign(bmap, c, -1, out);
1990 for (i = bmap->n_div; i < bmap->extra; ++i) {
1991 if (isl_int_is_zero(c[1+isl_space_dim(bmap->dim, isl_dim_all)+i]))
1993 fprintf(out, "%*s", indent, "");
1994 fprintf(out, "ERROR: unused div coefficient not zero\n");
1999 static void dump_constraints(struct isl_basic_map *bmap,
2000 isl_int **c, unsigned n,
2001 const char *op, FILE *out, int indent)
2005 for (i = 0; i < n; ++i)
2006 dump_constraint(bmap, c[i], op, out, indent);
2009 static void dump_affine(struct isl_basic_map *bmap, isl_int *exp, FILE *out)
2013 unsigned total = isl_basic_map_total_dim(bmap);
2015 for (j = 0; j < 1 + total; ++j) {
2016 if (isl_int_is_zero(exp[j]))
2018 if (!first && isl_int_is_pos(exp[j]))
2020 dump_term(bmap, exp[j], j, out);
2025 static void dump(struct isl_basic_map *bmap, FILE *out, int indent)
2029 dump_constraints(bmap, bmap->eq, bmap->n_eq, "=", out, indent);
2030 dump_constraints(bmap, bmap->ineq, bmap->n_ineq, ">=", out, indent);
2032 for (i = 0; i < bmap->n_div; ++i) {
2033 fprintf(out, "%*s", indent, "");
2034 fprintf(out, "e%d = [(", i);
2035 dump_affine(bmap, bmap->div[i]+1, out);
2037 isl_int_print(out, bmap->div[i][0], 0);
2038 fprintf(out, "]\n");
2042 void isl_basic_set_print_internal(struct isl_basic_set *bset,
2043 FILE *out, int indent)
2046 fprintf(out, "null basic set\n");
2050 fprintf(out, "%*s", indent, "");
2051 fprintf(out, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n",
2052 bset->ref, bset->dim->nparam, bset->dim->n_out,
2053 bset->extra, bset->flags);
2054 dump((struct isl_basic_map *)bset, out, indent);
2057 void isl_basic_map_print_internal(struct isl_basic_map *bmap,
2058 FILE *out, int indent)
2061 fprintf(out, "null basic map\n");
2065 fprintf(out, "%*s", indent, "");
2066 fprintf(out, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, "
2067 "flags: %x, n_name: %d\n",
2069 bmap->dim->nparam, bmap->dim->n_in, bmap->dim->n_out,
2070 bmap->extra, bmap->flags, bmap->dim->n_id);
2071 dump(bmap, out, indent);
2074 int isl_inequality_negate(struct isl_basic_map *bmap, unsigned pos)
2079 total = isl_basic_map_total_dim(bmap);
2080 isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
2081 isl_seq_neg(bmap->ineq[pos], bmap->ineq[pos], 1 + total);
2082 isl_int_sub_ui(bmap->ineq[pos][0], bmap->ineq[pos][0], 1);
2083 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
2087 __isl_give isl_set *isl_set_alloc_space(__isl_take isl_space *dim, int n,
2090 struct isl_set *set;
2094 isl_assert(dim->ctx, dim->n_in == 0, goto error);
2095 isl_assert(dim->ctx, n >= 0, goto error);
2096 set = isl_alloc(dim->ctx, struct isl_set,
2097 sizeof(struct isl_set) +
2098 (n - 1) * sizeof(struct isl_basic_set *));
2102 set->ctx = dim->ctx;
2103 isl_ctx_ref(set->ctx);
2111 isl_space_free(dim);
2115 struct isl_set *isl_set_alloc(struct isl_ctx *ctx,
2116 unsigned nparam, unsigned dim, int n, unsigned flags)
2118 struct isl_set *set;
2121 dims = isl_space_alloc(ctx, nparam, 0, dim);
2125 set = isl_set_alloc_space(dims, n, flags);
2129 /* Make sure "map" has room for at least "n" more basic maps.
2131 struct isl_map *isl_map_grow(struct isl_map *map, int n)
2134 struct isl_map *grown = NULL;
2138 isl_assert(map->ctx, n >= 0, goto error);
2139 if (map->n + n <= map->size)
2141 grown = isl_map_alloc_space(isl_map_get_space(map), map->n + n, map->flags);
2144 for (i = 0; i < map->n; ++i) {
2145 grown->p[i] = isl_basic_map_copy(map->p[i]);
2153 isl_map_free(grown);
2158 /* Make sure "set" has room for at least "n" more basic sets.
2160 struct isl_set *isl_set_grow(struct isl_set *set, int n)
2162 return (struct isl_set *)isl_map_grow((struct isl_map *)set, n);
2165 struct isl_set *isl_set_dup(struct isl_set *set)
2168 struct isl_set *dup;
2173 dup = isl_set_alloc_space(isl_space_copy(set->dim), set->n, set->flags);
2176 for (i = 0; i < set->n; ++i)
2177 dup = isl_set_add_basic_set(dup, isl_basic_set_copy(set->p[i]));
2181 struct isl_set *isl_set_from_basic_set(struct isl_basic_set *bset)
2183 return isl_map_from_basic_map(bset);
2186 struct isl_map *isl_map_from_basic_map(struct isl_basic_map *bmap)
2188 struct isl_map *map;
2193 map = isl_map_alloc_space(isl_space_copy(bmap->dim), 1, ISL_MAP_DISJOINT);
2194 return isl_map_add_basic_map(map, bmap);
2197 __isl_give isl_set *isl_set_add_basic_set(__isl_take isl_set *set,
2198 __isl_take isl_basic_set *bset)
2200 return (struct isl_set *)isl_map_add_basic_map((struct isl_map *)set,
2201 (struct isl_basic_map *)bset);
2204 void isl_set_free(struct isl_set *set)
2214 isl_ctx_deref(set->ctx);
2215 for (i = 0; i < set->n; ++i)
2216 isl_basic_set_free(set->p[i]);
2217 isl_space_free(set->dim);
2221 void isl_set_print_internal(struct isl_set *set, FILE *out, int indent)
2226 fprintf(out, "null set\n");
2230 fprintf(out, "%*s", indent, "");
2231 fprintf(out, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
2232 set->ref, set->n, set->dim->nparam, set->dim->n_out,
2234 for (i = 0; i < set->n; ++i) {
2235 fprintf(out, "%*s", indent, "");
2236 fprintf(out, "basic set %d:\n", i);
2237 isl_basic_set_print_internal(set->p[i], out, indent+4);
2241 void isl_map_print_internal(struct isl_map *map, FILE *out, int indent)
2246 fprintf(out, "null map\n");
2250 fprintf(out, "%*s", indent, "");
2251 fprintf(out, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, "
2252 "flags: %x, n_name: %d\n",
2253 map->ref, map->n, map->dim->nparam, map->dim->n_in,
2254 map->dim->n_out, map->flags, map->dim->n_id);
2255 for (i = 0; i < map->n; ++i) {
2256 fprintf(out, "%*s", indent, "");
2257 fprintf(out, "basic map %d:\n", i);
2258 isl_basic_map_print_internal(map->p[i], out, indent+4);
2262 struct isl_basic_map *isl_basic_map_intersect_domain(
2263 struct isl_basic_map *bmap, struct isl_basic_set *bset)
2265 struct isl_basic_map *bmap_domain;
2270 isl_assert(bset->ctx, isl_space_match(bmap->dim, isl_dim_param,
2271 bset->dim, isl_dim_param), goto error);
2273 if (isl_space_dim(bset->dim, isl_dim_set) != 0)
2274 isl_assert(bset->ctx,
2275 isl_basic_map_compatible_domain(bmap, bset), goto error);
2277 bmap = isl_basic_map_cow(bmap);
2280 bmap = isl_basic_map_extend_space(bmap, isl_space_copy(bmap->dim),
2281 bset->n_div, bset->n_eq, bset->n_ineq);
2282 bmap_domain = isl_basic_map_from_domain(bset);
2283 bmap = add_constraints(bmap, bmap_domain, 0, 0);
2285 bmap = isl_basic_map_simplify(bmap);
2286 return isl_basic_map_finalize(bmap);
2288 isl_basic_map_free(bmap);
2289 isl_basic_set_free(bset);
2293 struct isl_basic_map *isl_basic_map_intersect_range(
2294 struct isl_basic_map *bmap, struct isl_basic_set *bset)
2296 struct isl_basic_map *bmap_range;
2301 isl_assert(bset->ctx, isl_space_match(bmap->dim, isl_dim_param,
2302 bset->dim, isl_dim_param), goto error);
2304 if (isl_space_dim(bset->dim, isl_dim_set) != 0)
2305 isl_assert(bset->ctx,
2306 isl_basic_map_compatible_range(bmap, bset), goto error);
2308 if (isl_basic_set_is_universe(bset)) {
2309 isl_basic_set_free(bset);
2313 bmap = isl_basic_map_cow(bmap);
2316 bmap = isl_basic_map_extend_space(bmap, isl_space_copy(bmap->dim),
2317 bset->n_div, bset->n_eq, bset->n_ineq);
2318 bmap_range = isl_basic_map_from_basic_set(bset, isl_space_copy(bset->dim));
2319 bmap = add_constraints(bmap, bmap_range, 0, 0);
2321 bmap = isl_basic_map_simplify(bmap);
2322 return isl_basic_map_finalize(bmap);
2324 isl_basic_map_free(bmap);
2325 isl_basic_set_free(bset);
2329 int isl_basic_map_contains(struct isl_basic_map *bmap, struct isl_vec *vec)
2335 total = 1 + isl_basic_map_total_dim(bmap);
2336 if (total != vec->size)
2341 for (i = 0; i < bmap->n_eq; ++i) {
2342 isl_seq_inner_product(vec->el, bmap->eq[i], total, &s);
2343 if (!isl_int_is_zero(s)) {
2349 for (i = 0; i < bmap->n_ineq; ++i) {
2350 isl_seq_inner_product(vec->el, bmap->ineq[i], total, &s);
2351 if (isl_int_is_neg(s)) {
2362 int isl_basic_set_contains(struct isl_basic_set *bset, struct isl_vec *vec)
2364 return isl_basic_map_contains((struct isl_basic_map *)bset, vec);
2367 struct isl_basic_map *isl_basic_map_intersect(
2368 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2370 struct isl_vec *sample = NULL;
2372 if (!bmap1 || !bmap2)
2375 isl_assert(bmap1->ctx, isl_space_match(bmap1->dim, isl_dim_param,
2376 bmap2->dim, isl_dim_param), goto error);
2377 if (isl_space_dim(bmap1->dim, isl_dim_all) ==
2378 isl_space_dim(bmap1->dim, isl_dim_param) &&
2379 isl_space_dim(bmap2->dim, isl_dim_all) !=
2380 isl_space_dim(bmap2->dim, isl_dim_param))
2381 return isl_basic_map_intersect(bmap2, bmap1);
2383 if (isl_space_dim(bmap2->dim, isl_dim_all) !=
2384 isl_space_dim(bmap2->dim, isl_dim_param))
2385 isl_assert(bmap1->ctx,
2386 isl_space_is_equal(bmap1->dim, bmap2->dim), goto error);
2388 if (bmap1->sample &&
2389 isl_basic_map_contains(bmap1, bmap1->sample) > 0 &&
2390 isl_basic_map_contains(bmap2, bmap1->sample) > 0)
2391 sample = isl_vec_copy(bmap1->sample);
2392 else if (bmap2->sample &&
2393 isl_basic_map_contains(bmap1, bmap2->sample) > 0 &&
2394 isl_basic_map_contains(bmap2, bmap2->sample) > 0)
2395 sample = isl_vec_copy(bmap2->sample);
2397 bmap1 = isl_basic_map_cow(bmap1);
2400 bmap1 = isl_basic_map_extend_space(bmap1, isl_space_copy(bmap1->dim),
2401 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
2402 bmap1 = add_constraints(bmap1, bmap2, 0, 0);
2405 isl_vec_free(sample);
2407 isl_vec_free(bmap1->sample);
2408 bmap1->sample = sample;
2411 bmap1 = isl_basic_map_simplify(bmap1);
2412 return isl_basic_map_finalize(bmap1);
2415 isl_vec_free(sample);
2416 isl_basic_map_free(bmap1);
2417 isl_basic_map_free(bmap2);
2421 struct isl_basic_set *isl_basic_set_intersect(
2422 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
2424 return (struct isl_basic_set *)
2425 isl_basic_map_intersect(
2426 (struct isl_basic_map *)bset1,
2427 (struct isl_basic_map *)bset2);
2430 /* Special case of isl_map_intersect, where both map1 and map2
2431 * are convex, without any divs and such that either map1 or map2
2432 * contains a single constraint. This constraint is then simply
2433 * added to the other map.
2435 static __isl_give isl_map *map_intersect_add_constraint(
2436 __isl_take isl_map *map1, __isl_take isl_map *map2)
2438 isl_assert(map1->ctx, map1->n == 1, goto error);
2439 isl_assert(map2->ctx, map1->n == 1, goto error);
2440 isl_assert(map1->ctx, map1->p[0]->n_div == 0, goto error);
2441 isl_assert(map2->ctx, map1->p[0]->n_div == 0, goto error);
2443 if (map2->p[0]->n_eq + map2->p[0]->n_ineq != 1)
2444 return isl_map_intersect(map2, map1);
2446 isl_assert(map2->ctx,
2447 map2->p[0]->n_eq + map2->p[0]->n_ineq == 1, goto error);
2449 map1 = isl_map_cow(map1);
2452 if (isl_map_plain_is_empty(map1)) {
2456 map1->p[0] = isl_basic_map_cow(map1->p[0]);
2457 if (map2->p[0]->n_eq == 1)
2458 map1->p[0] = isl_basic_map_add_eq(map1->p[0], map2->p[0]->eq[0]);
2460 map1->p[0] = isl_basic_map_add_ineq(map1->p[0],
2461 map2->p[0]->ineq[0]);
2463 map1->p[0] = isl_basic_map_simplify(map1->p[0]);
2464 map1->p[0] = isl_basic_map_finalize(map1->p[0]);
2468 if (isl_basic_map_plain_is_empty(map1->p[0])) {
2469 isl_basic_map_free(map1->p[0]);
2482 static __isl_give isl_map *map_intersect(__isl_take isl_map *map1,
2483 __isl_take isl_map *map2)
2486 struct isl_map *result;
2492 if (isl_map_plain_is_empty(map1) &&
2493 isl_space_is_equal(map1->dim, map2->dim)) {
2497 if (isl_map_plain_is_empty(map2) &&
2498 isl_space_is_equal(map1->dim, map2->dim)) {
2503 if (map1->n == 1 && map2->n == 1 &&
2504 map1->p[0]->n_div == 0 && map2->p[0]->n_div == 0 &&
2505 isl_space_is_equal(map1->dim, map2->dim) &&
2506 (map1->p[0]->n_eq + map1->p[0]->n_ineq == 1 ||
2507 map2->p[0]->n_eq + map2->p[0]->n_ineq == 1))
2508 return map_intersect_add_constraint(map1, map2);
2509 if (isl_map_is_params(map1) && !isl_map_is_params(map2))
2510 return isl_map_intersect(map2, map1);
2511 if (isl_space_dim(map1->dim, isl_dim_all) ==
2512 isl_space_dim(map1->dim, isl_dim_param) &&
2513 isl_space_dim(map2->dim, isl_dim_all) !=
2514 isl_space_dim(map2->dim, isl_dim_param))
2515 return isl_map_intersect(map2, map1);
2517 if (isl_space_dim(map2->dim, isl_dim_all) !=
2518 isl_space_dim(map2->dim, isl_dim_param))
2519 isl_assert(map1->ctx,
2520 isl_space_is_equal(map1->dim, map2->dim), goto error);
2522 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
2523 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
2524 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
2526 result = isl_map_alloc_space(isl_space_copy(map1->dim),
2527 map1->n * map2->n, flags);
2530 for (i = 0; i < map1->n; ++i)
2531 for (j = 0; j < map2->n; ++j) {
2532 struct isl_basic_map *part;
2533 part = isl_basic_map_intersect(
2534 isl_basic_map_copy(map1->p[i]),
2535 isl_basic_map_copy(map2->p[j]));
2536 if (isl_basic_map_is_empty(part))
2537 isl_basic_map_free(part);
2539 result = isl_map_add_basic_map(result, part);
2552 __isl_give isl_map *isl_map_intersect(__isl_take isl_map *map1,
2553 __isl_take isl_map *map2)
2555 return isl_map_align_params_map_map_and(map1, map2, &map_intersect);
2558 struct isl_set *isl_set_intersect(struct isl_set *set1, struct isl_set *set2)
2560 return (struct isl_set *)
2561 isl_map_intersect((struct isl_map *)set1,
2562 (struct isl_map *)set2);
2565 /* The current implementation of isl_map_intersect accepts intersections
2566 * with parameter domains, so we can just call that for now.
2568 static __isl_give isl_map *map_intersect_params(__isl_take isl_map *map,
2569 __isl_take isl_set *params)
2571 return isl_map_intersect(map, params);
2574 __isl_give isl_map *isl_map_intersect_params(__isl_take isl_map *map1,
2575 __isl_take isl_map *map2)
2577 return isl_map_align_params_map_map_and(map1, map2, &map_intersect_params);
2580 __isl_give isl_set *isl_set_intersect_params(__isl_take isl_set *set,
2581 __isl_take isl_set *params)
2583 return isl_map_intersect_params(set, params);
2586 struct isl_basic_map *isl_basic_map_reverse(struct isl_basic_map *bmap)
2589 struct isl_basic_set *bset;
2594 bmap = isl_basic_map_cow(bmap);
2597 dim = isl_space_reverse(isl_space_copy(bmap->dim));
2598 in = isl_basic_map_n_in(bmap);
2599 bset = isl_basic_set_from_basic_map(bmap);
2600 bset = isl_basic_set_swap_vars(bset, in);
2601 return isl_basic_map_from_basic_set(bset, dim);
2604 static __isl_give isl_basic_map *basic_map_space_reset(
2605 __isl_take isl_basic_map *bmap, enum isl_dim_type type)
2609 if (!isl_space_is_named_or_nested(bmap->dim, type))
2612 space = isl_basic_map_get_space(bmap);
2613 space = isl_space_reset(space, type);
2614 bmap = isl_basic_map_reset_space(bmap, space);
2618 __isl_give isl_basic_map *isl_basic_map_insert(__isl_take isl_basic_map *bmap,
2619 enum isl_dim_type type, unsigned pos, unsigned n)
2622 struct isl_basic_map *res;
2623 struct isl_dim_map *dim_map;
2624 unsigned total, off;
2625 enum isl_dim_type t;
2628 return basic_map_space_reset(bmap, type);
2633 res_dim = isl_space_insert_dims(isl_basic_map_get_space(bmap), type, pos, n);
2635 total = isl_basic_map_total_dim(bmap) + n;
2636 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2638 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
2640 isl_dim_map_dim(dim_map, bmap->dim, t, off);
2642 unsigned size = isl_basic_map_dim(bmap, t);
2643 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2645 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2646 pos, size - pos, off + pos + n);
2648 off += isl_space_dim(res_dim, t);
2650 isl_dim_map_div(dim_map, bmap, off);
2652 res = isl_basic_map_alloc_space(res_dim,
2653 bmap->n_div, bmap->n_eq, bmap->n_ineq);
2654 if (isl_basic_map_is_rational(bmap))
2655 res = isl_basic_map_set_rational(res);
2656 res = isl_basic_map_add_constraints_dim_map(res, bmap, dim_map);
2657 return isl_basic_map_finalize(res);
2660 __isl_give isl_basic_map *isl_basic_map_add(__isl_take isl_basic_map *bmap,
2661 enum isl_dim_type type, unsigned n)
2665 return isl_basic_map_insert(bmap, type,
2666 isl_basic_map_dim(bmap, type), n);
2669 __isl_give isl_basic_set *isl_basic_set_add(__isl_take isl_basic_set *bset,
2670 enum isl_dim_type type, unsigned n)
2674 isl_assert(bset->ctx, type != isl_dim_in, goto error);
2675 return (isl_basic_set *)isl_basic_map_add((isl_basic_map *)bset, type, n);
2677 isl_basic_set_free(bset);
2681 static __isl_give isl_map *map_space_reset(__isl_take isl_map *map,
2682 enum isl_dim_type type)
2686 if (!isl_space_is_named_or_nested(map->dim, type))
2689 space = isl_map_get_space(map);
2690 space = isl_space_reset(space, type);
2691 map = isl_map_reset_space(map, space);
2695 __isl_give isl_map *isl_map_insert_dims(__isl_take isl_map *map,
2696 enum isl_dim_type type, unsigned pos, unsigned n)
2701 return map_space_reset(map, type);
2703 map = isl_map_cow(map);
2707 map->dim = isl_space_insert_dims(map->dim, type, pos, n);
2711 for (i = 0; i < map->n; ++i) {
2712 map->p[i] = isl_basic_map_insert(map->p[i], type, pos, n);
2723 __isl_give isl_set *isl_set_insert_dims(__isl_take isl_set *set,
2724 enum isl_dim_type type, unsigned pos, unsigned n)
2726 return isl_map_insert_dims(set, type, pos, n);
2729 __isl_give isl_map *isl_map_add_dims(__isl_take isl_map *map,
2730 enum isl_dim_type type, unsigned n)
2734 return isl_map_insert_dims(map, type, isl_map_dim(map, type), n);
2737 __isl_give isl_set *isl_set_add_dims(__isl_take isl_set *set,
2738 enum isl_dim_type type, unsigned n)
2742 isl_assert(set->ctx, type != isl_dim_in, goto error);
2743 return (isl_set *)isl_map_add_dims((isl_map *)set, type, n);
2749 __isl_give isl_basic_map *isl_basic_map_move_dims(
2750 __isl_take isl_basic_map *bmap,
2751 enum isl_dim_type dst_type, unsigned dst_pos,
2752 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2754 struct isl_dim_map *dim_map;
2755 struct isl_basic_map *res;
2756 enum isl_dim_type t;
2757 unsigned total, off;
2764 isl_assert(bmap->ctx, src_pos + n <= isl_basic_map_dim(bmap, src_type),
2767 if (dst_type == src_type && dst_pos == src_pos)
2770 isl_assert(bmap->ctx, dst_type != src_type, goto error);
2772 if (pos(bmap->dim, dst_type) + dst_pos ==
2773 pos(bmap->dim, src_type) + src_pos +
2774 ((src_type < dst_type) ? n : 0)) {
2775 bmap = isl_basic_map_cow(bmap);
2779 bmap->dim = isl_space_move_dims(bmap->dim, dst_type, dst_pos,
2780 src_type, src_pos, n);
2784 bmap = isl_basic_map_finalize(bmap);
2789 total = isl_basic_map_total_dim(bmap);
2790 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2793 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
2794 unsigned size = isl_space_dim(bmap->dim, t);
2795 if (t == dst_type) {
2796 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2799 isl_dim_map_dim_range(dim_map, bmap->dim, src_type,
2802 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2803 dst_pos, size - dst_pos, off);
2804 off += size - dst_pos;
2805 } else if (t == src_type) {
2806 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2809 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2810 src_pos + n, size - src_pos - n, off);
2811 off += size - src_pos - n;
2813 isl_dim_map_dim(dim_map, bmap->dim, t, off);
2817 isl_dim_map_div(dim_map, bmap, off);
2819 res = isl_basic_map_alloc_space(isl_basic_map_get_space(bmap),
2820 bmap->n_div, bmap->n_eq, bmap->n_ineq);
2821 bmap = isl_basic_map_add_constraints_dim_map(res, bmap, dim_map);
2823 bmap->dim = isl_space_move_dims(bmap->dim, dst_type, dst_pos,
2824 src_type, src_pos, n);
2828 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
2829 bmap = isl_basic_map_gauss(bmap, NULL);
2830 bmap = isl_basic_map_finalize(bmap);
2834 isl_basic_map_free(bmap);
2838 __isl_give isl_basic_set *isl_basic_set_move_dims(__isl_take isl_basic_set *bset,
2839 enum isl_dim_type dst_type, unsigned dst_pos,
2840 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2842 return (isl_basic_set *)isl_basic_map_move_dims(
2843 (isl_basic_map *)bset, dst_type, dst_pos, src_type, src_pos, n);
2846 __isl_give isl_set *isl_set_move_dims(__isl_take isl_set *set,
2847 enum isl_dim_type dst_type, unsigned dst_pos,
2848 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2852 isl_assert(set->ctx, dst_type != isl_dim_in, goto error);
2853 return (isl_set *)isl_map_move_dims((isl_map *)set, dst_type, dst_pos,
2854 src_type, src_pos, n);
2860 __isl_give isl_map *isl_map_move_dims(__isl_take isl_map *map,
2861 enum isl_dim_type dst_type, unsigned dst_pos,
2862 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2871 isl_assert(map->ctx, src_pos + n <= isl_map_dim(map, src_type),
2874 if (dst_type == src_type && dst_pos == src_pos)
2877 isl_assert(map->ctx, dst_type != src_type, goto error);
2879 map = isl_map_cow(map);
2883 map->dim = isl_space_move_dims(map->dim, dst_type, dst_pos, src_type, src_pos, n);
2887 for (i = 0; i < map->n; ++i) {
2888 map->p[i] = isl_basic_map_move_dims(map->p[i],
2890 src_type, src_pos, n);
2901 /* Move the specified dimensions to the last columns right before
2902 * the divs. Don't change the dimension specification of bmap.
2903 * That's the responsibility of the caller.
2905 static __isl_give isl_basic_map *move_last(__isl_take isl_basic_map *bmap,
2906 enum isl_dim_type type, unsigned first, unsigned n)
2908 struct isl_dim_map *dim_map;
2909 struct isl_basic_map *res;
2910 enum isl_dim_type t;
2911 unsigned total, off;
2915 if (pos(bmap->dim, type) + first + n ==
2916 1 + isl_space_dim(bmap->dim, isl_dim_all))
2919 total = isl_basic_map_total_dim(bmap);
2920 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2923 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
2924 unsigned size = isl_space_dim(bmap->dim, t);
2926 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2929 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2930 first, n, total - bmap->n_div - n);
2931 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2932 first + n, size - (first + n), off);
2933 off += size - (first + n);
2935 isl_dim_map_dim(dim_map, bmap->dim, t, off);
2939 isl_dim_map_div(dim_map, bmap, off + n);
2941 res = isl_basic_map_alloc_space(isl_basic_map_get_space(bmap),
2942 bmap->n_div, bmap->n_eq, bmap->n_ineq);
2943 res = isl_basic_map_add_constraints_dim_map(res, bmap, dim_map);
2947 /* Turn the n dimensions of type type, starting at first
2948 * into existentially quantified variables.
2950 __isl_give isl_basic_map *isl_basic_map_project_out(
2951 __isl_take isl_basic_map *bmap,
2952 enum isl_dim_type type, unsigned first, unsigned n)
2965 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL))
2966 return isl_basic_map_remove_dims(bmap, type, first, n);
2968 isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
2971 bmap = move_last(bmap, type, first, n);
2972 bmap = isl_basic_map_cow(bmap);
2976 row_size = 1 + isl_space_dim(bmap->dim, isl_dim_all) + bmap->extra;
2977 old = bmap->block2.data;
2978 bmap->block2 = isl_blk_extend(bmap->ctx, bmap->block2,
2979 (bmap->extra + n) * (1 + row_size));
2980 if (!bmap->block2.data)
2982 new_div = isl_alloc_array(bmap->ctx, isl_int *, bmap->extra + n);
2985 for (i = 0; i < n; ++i) {
2986 new_div[i] = bmap->block2.data +
2987 (bmap->extra + i) * (1 + row_size);
2988 isl_seq_clr(new_div[i], 1 + row_size);
2990 for (i = 0; i < bmap->extra; ++i)
2991 new_div[n + i] = bmap->block2.data + (bmap->div[i] - old);
2993 bmap->div = new_div;
2997 bmap->dim = isl_space_drop_dims(bmap->dim, type, first, n);
3000 bmap = isl_basic_map_simplify(bmap);
3001 bmap = isl_basic_map_drop_redundant_divs(bmap);
3002 return isl_basic_map_finalize(bmap);
3004 isl_basic_map_free(bmap);
3008 /* Turn the n dimensions of type type, starting at first
3009 * into existentially quantified variables.
3011 struct isl_basic_set *isl_basic_set_project_out(struct isl_basic_set *bset,
3012 enum isl_dim_type type, unsigned first, unsigned n)
3014 return (isl_basic_set *)isl_basic_map_project_out(
3015 (isl_basic_map *)bset, type, first, n);
3018 /* Turn the n dimensions of type type, starting at first
3019 * into existentially quantified variables.
3021 __isl_give isl_map *isl_map_project_out(__isl_take isl_map *map,
3022 enum isl_dim_type type, unsigned first, unsigned n)
3032 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
3034 map = isl_map_cow(map);
3038 map->dim = isl_space_drop_dims(map->dim, type, first, n);
3042 for (i = 0; i < map->n; ++i) {
3043 map->p[i] = isl_basic_map_project_out(map->p[i], type, first, n);
3054 /* Turn the n dimensions of type type, starting at first
3055 * into existentially quantified variables.
3057 __isl_give isl_set *isl_set_project_out(__isl_take isl_set *set,
3058 enum isl_dim_type type, unsigned first, unsigned n)
3060 return (isl_set *)isl_map_project_out((isl_map *)set, type, first, n);
3063 static struct isl_basic_map *add_divs(struct isl_basic_map *bmap, unsigned n)
3067 for (i = 0; i < n; ++i) {
3068 j = isl_basic_map_alloc_div(bmap);
3071 isl_seq_clr(bmap->div[j], 1+1+isl_basic_map_total_dim(bmap));
3075 isl_basic_map_free(bmap);
3079 struct isl_basic_map *isl_basic_map_apply_range(
3080 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3082 isl_space *dim_result = NULL;
3083 struct isl_basic_map *bmap;
3084 unsigned n_in, n_out, n, nparam, total, pos;
3085 struct isl_dim_map *dim_map1, *dim_map2;
3087 if (!bmap1 || !bmap2)
3090 dim_result = isl_space_join(isl_space_copy(bmap1->dim),
3091 isl_space_copy(bmap2->dim));
3093 n_in = isl_basic_map_n_in(bmap1);
3094 n_out = isl_basic_map_n_out(bmap2);
3095 n = isl_basic_map_n_out(bmap1);
3096 nparam = isl_basic_map_n_param(bmap1);
3098 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + n;
3099 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
3100 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
3101 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
3102 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
3103 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
3104 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_in);
3105 isl_dim_map_div(dim_map1, bmap1, pos += n_out);
3106 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
3107 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
3108 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
3110 bmap = isl_basic_map_alloc_space(dim_result,
3111 bmap1->n_div + bmap2->n_div + n,
3112 bmap1->n_eq + bmap2->n_eq,
3113 bmap1->n_ineq + bmap2->n_ineq);
3114 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap1, dim_map1);
3115 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap2, dim_map2);
3116 bmap = add_divs(bmap, n);
3117 bmap = isl_basic_map_simplify(bmap);
3118 bmap = isl_basic_map_drop_redundant_divs(bmap);
3119 return isl_basic_map_finalize(bmap);
3121 isl_basic_map_free(bmap1);
3122 isl_basic_map_free(bmap2);
3126 struct isl_basic_set *isl_basic_set_apply(
3127 struct isl_basic_set *bset, struct isl_basic_map *bmap)
3132 isl_assert(bset->ctx, isl_basic_map_compatible_domain(bmap, bset),
3135 return (struct isl_basic_set *)
3136 isl_basic_map_apply_range((struct isl_basic_map *)bset, bmap);
3138 isl_basic_set_free(bset);
3139 isl_basic_map_free(bmap);
3143 struct isl_basic_map *isl_basic_map_apply_domain(
3144 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3146 if (!bmap1 || !bmap2)
3149 isl_assert(bmap1->ctx,
3150 isl_basic_map_n_in(bmap1) == isl_basic_map_n_in(bmap2), goto error);
3151 isl_assert(bmap1->ctx,
3152 isl_basic_map_n_param(bmap1) == isl_basic_map_n_param(bmap2),
3155 bmap1 = isl_basic_map_reverse(bmap1);
3156 bmap1 = isl_basic_map_apply_range(bmap1, bmap2);
3157 return isl_basic_map_reverse(bmap1);
3159 isl_basic_map_free(bmap1);
3160 isl_basic_map_free(bmap2);
3164 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
3165 * A \cap B -> f(A) + f(B)
3167 struct isl_basic_map *isl_basic_map_sum(
3168 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3170 unsigned n_in, n_out, nparam, total, pos;
3171 struct isl_basic_map *bmap = NULL;
3172 struct isl_dim_map *dim_map1, *dim_map2;
3175 if (!bmap1 || !bmap2)
3178 isl_assert(bmap1->ctx, isl_space_is_equal(bmap1->dim, bmap2->dim),
3181 nparam = isl_basic_map_n_param(bmap1);
3182 n_in = isl_basic_map_n_in(bmap1);
3183 n_out = isl_basic_map_n_out(bmap1);
3185 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + 2 * n_out;
3186 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
3187 dim_map2 = isl_dim_map_alloc(bmap2->ctx, total);
3188 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
3189 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos);
3190 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
3191 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
3192 isl_dim_map_div(dim_map1, bmap1, pos += n_in + n_out);
3193 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
3194 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
3195 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_out);
3197 bmap = isl_basic_map_alloc_space(isl_space_copy(bmap1->dim),
3198 bmap1->n_div + bmap2->n_div + 2 * n_out,
3199 bmap1->n_eq + bmap2->n_eq + n_out,
3200 bmap1->n_ineq + bmap2->n_ineq);
3201 for (i = 0; i < n_out; ++i) {
3202 int j = isl_basic_map_alloc_equality(bmap);
3205 isl_seq_clr(bmap->eq[j], 1+total);
3206 isl_int_set_si(bmap->eq[j][1+nparam+n_in+i], -1);
3207 isl_int_set_si(bmap->eq[j][1+pos+i], 1);
3208 isl_int_set_si(bmap->eq[j][1+pos-n_out+i], 1);
3210 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap1, dim_map1);
3211 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap2, dim_map2);
3212 bmap = add_divs(bmap, 2 * n_out);
3214 bmap = isl_basic_map_simplify(bmap);
3215 return isl_basic_map_finalize(bmap);
3217 isl_basic_map_free(bmap);
3218 isl_basic_map_free(bmap1);
3219 isl_basic_map_free(bmap2);
3223 /* Given two maps A -> f(A) and B -> g(B), construct a map
3224 * A \cap B -> f(A) + f(B)
3226 struct isl_map *isl_map_sum(struct isl_map *map1, struct isl_map *map2)
3228 struct isl_map *result;
3234 isl_assert(map1->ctx, isl_space_is_equal(map1->dim, map2->dim), goto error);
3236 result = isl_map_alloc_space(isl_space_copy(map1->dim),
3237 map1->n * map2->n, 0);
3240 for (i = 0; i < map1->n; ++i)
3241 for (j = 0; j < map2->n; ++j) {
3242 struct isl_basic_map *part;
3243 part = isl_basic_map_sum(
3244 isl_basic_map_copy(map1->p[i]),
3245 isl_basic_map_copy(map2->p[j]));
3246 if (isl_basic_map_is_empty(part))
3247 isl_basic_map_free(part);
3249 result = isl_map_add_basic_map(result, part);
3262 __isl_give isl_set *isl_set_sum(__isl_take isl_set *set1,
3263 __isl_take isl_set *set2)
3265 return (isl_set *)isl_map_sum((isl_map *)set1, (isl_map *)set2);
3268 /* Given a basic map A -> f(A), construct A -> -f(A).
3270 struct isl_basic_map *isl_basic_map_neg(struct isl_basic_map *bmap)
3275 bmap = isl_basic_map_cow(bmap);
3279 n = isl_basic_map_dim(bmap, isl_dim_out);
3280 off = isl_basic_map_offset(bmap, isl_dim_out);
3281 for (i = 0; i < bmap->n_eq; ++i)
3282 for (j = 0; j < n; ++j)
3283 isl_int_neg(bmap->eq[i][off+j], bmap->eq[i][off+j]);
3284 for (i = 0; i < bmap->n_ineq; ++i)
3285 for (j = 0; j < n; ++j)
3286 isl_int_neg(bmap->ineq[i][off+j], bmap->ineq[i][off+j]);
3287 for (i = 0; i < bmap->n_div; ++i)
3288 for (j = 0; j < n; ++j)
3289 isl_int_neg(bmap->div[i][1+off+j], bmap->div[i][1+off+j]);
3290 bmap = isl_basic_map_gauss(bmap, NULL);
3291 return isl_basic_map_finalize(bmap);
3294 __isl_give isl_basic_set *isl_basic_set_neg(__isl_take isl_basic_set *bset)
3296 return isl_basic_map_neg(bset);
3299 /* Given a map A -> f(A), construct A -> -f(A).
3301 struct isl_map *isl_map_neg(struct isl_map *map)
3305 map = isl_map_cow(map);
3309 for (i = 0; i < map->n; ++i) {
3310 map->p[i] = isl_basic_map_neg(map->p[i]);
3321 __isl_give isl_set *isl_set_neg(__isl_take isl_set *set)
3323 return (isl_set *)isl_map_neg((isl_map *)set);
3326 /* Given a basic map A -> f(A) and an integer d, construct a basic map
3327 * A -> floor(f(A)/d).
3329 struct isl_basic_map *isl_basic_map_floordiv(struct isl_basic_map *bmap,
3332 unsigned n_in, n_out, nparam, total, pos;
3333 struct isl_basic_map *result = NULL;
3334 struct isl_dim_map *dim_map;
3340 nparam = isl_basic_map_n_param(bmap);
3341 n_in = isl_basic_map_n_in(bmap);
3342 n_out = isl_basic_map_n_out(bmap);
3344 total = nparam + n_in + n_out + bmap->n_div + n_out;
3345 dim_map = isl_dim_map_alloc(bmap->ctx, total);
3346 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_param, pos = 0);
3347 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_in, pos += nparam);
3348 isl_dim_map_div(dim_map, bmap, pos += n_in + n_out);
3349 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_out, pos += bmap->n_div);
3351 result = isl_basic_map_alloc_space(isl_space_copy(bmap->dim),
3352 bmap->n_div + n_out,
3353 bmap->n_eq, bmap->n_ineq + 2 * n_out);
3354 result = isl_basic_map_add_constraints_dim_map(result, bmap, dim_map);
3355 result = add_divs(result, n_out);
3356 for (i = 0; i < n_out; ++i) {
3358 j = isl_basic_map_alloc_inequality(result);
3361 isl_seq_clr(result->ineq[j], 1+total);
3362 isl_int_neg(result->ineq[j][1+nparam+n_in+i], d);
3363 isl_int_set_si(result->ineq[j][1+pos+i], 1);
3364 j = isl_basic_map_alloc_inequality(result);
3367 isl_seq_clr(result->ineq[j], 1+total);
3368 isl_int_set(result->ineq[j][1+nparam+n_in+i], d);
3369 isl_int_set_si(result->ineq[j][1+pos+i], -1);
3370 isl_int_sub_ui(result->ineq[j][0], d, 1);
3373 result = isl_basic_map_simplify(result);
3374 return isl_basic_map_finalize(result);
3376 isl_basic_map_free(result);
3380 /* Given a map A -> f(A) and an integer d, construct a map
3381 * A -> floor(f(A)/d).
3383 struct isl_map *isl_map_floordiv(struct isl_map *map, isl_int d)
3387 map = isl_map_cow(map);
3391 ISL_F_CLR(map, ISL_MAP_DISJOINT);
3392 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3393 for (i = 0; i < map->n; ++i) {
3394 map->p[i] = isl_basic_map_floordiv(map->p[i], d);
3405 static struct isl_basic_map *var_equal(struct isl_basic_map *bmap, unsigned pos)
3411 i = isl_basic_map_alloc_equality(bmap);
3414 nparam = isl_basic_map_n_param(bmap);
3415 n_in = isl_basic_map_n_in(bmap);
3416 isl_seq_clr(bmap->eq[i], 1 + isl_basic_map_total_dim(bmap));
3417 isl_int_set_si(bmap->eq[i][1+nparam+pos], -1);
3418 isl_int_set_si(bmap->eq[i][1+nparam+n_in+pos], 1);
3419 return isl_basic_map_finalize(bmap);
3421 isl_basic_map_free(bmap);
3425 /* Add a constraints to "bmap" expressing i_pos < o_pos
3427 static struct isl_basic_map *var_less(struct isl_basic_map *bmap, unsigned pos)
3433 i = isl_basic_map_alloc_inequality(bmap);
3436 nparam = isl_basic_map_n_param(bmap);
3437 n_in = isl_basic_map_n_in(bmap);
3438 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
3439 isl_int_set_si(bmap->ineq[i][0], -1);
3440 isl_int_set_si(bmap->ineq[i][1+nparam+pos], -1);
3441 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], 1);
3442 return isl_basic_map_finalize(bmap);
3444 isl_basic_map_free(bmap);
3448 /* Add a constraint to "bmap" expressing i_pos <= o_pos
3450 static __isl_give isl_basic_map *var_less_or_equal(
3451 __isl_take isl_basic_map *bmap, unsigned pos)
3457 i = isl_basic_map_alloc_inequality(bmap);
3460 nparam = isl_basic_map_n_param(bmap);
3461 n_in = isl_basic_map_n_in(bmap);
3462 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
3463 isl_int_set_si(bmap->ineq[i][1+nparam+pos], -1);
3464 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], 1);
3465 return isl_basic_map_finalize(bmap);
3467 isl_basic_map_free(bmap);
3471 /* Add a constraints to "bmap" expressing i_pos > o_pos
3473 static struct isl_basic_map *var_more(struct isl_basic_map *bmap, unsigned pos)
3479 i = isl_basic_map_alloc_inequality(bmap);
3482 nparam = isl_basic_map_n_param(bmap);
3483 n_in = isl_basic_map_n_in(bmap);
3484 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
3485 isl_int_set_si(bmap->ineq[i][0], -1);
3486 isl_int_set_si(bmap->ineq[i][1+nparam+pos], 1);
3487 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], -1);
3488 return isl_basic_map_finalize(bmap);
3490 isl_basic_map_free(bmap);
3494 /* Add a constraint to "bmap" expressing i_pos >= o_pos
3496 static __isl_give isl_basic_map *var_more_or_equal(
3497 __isl_take isl_basic_map *bmap, unsigned pos)
3503 i = isl_basic_map_alloc_inequality(bmap);
3506 nparam = isl_basic_map_n_param(bmap);
3507 n_in = isl_basic_map_n_in(bmap);
3508 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
3509 isl_int_set_si(bmap->ineq[i][1+nparam+pos], 1);
3510 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], -1);
3511 return isl_basic_map_finalize(bmap);
3513 isl_basic_map_free(bmap);
3517 __isl_give isl_basic_map *isl_basic_map_equal(
3518 __isl_take isl_space *dim, unsigned n_equal)
3521 struct isl_basic_map *bmap;
3522 bmap = isl_basic_map_alloc_space(dim, 0, n_equal, 0);
3525 for (i = 0; i < n_equal && bmap; ++i)
3526 bmap = var_equal(bmap, i);
3527 return isl_basic_map_finalize(bmap);
3530 /* Return a relation on of dimension "dim" expressing i_[0..pos] << o_[0..pos]
3532 __isl_give isl_basic_map *isl_basic_map_less_at(__isl_take isl_space *dim,
3536 struct isl_basic_map *bmap;
3537 bmap = isl_basic_map_alloc_space(dim, 0, pos, 1);
3540 for (i = 0; i < pos && bmap; ++i)
3541 bmap = var_equal(bmap, i);
3543 bmap = var_less(bmap, pos);
3544 return isl_basic_map_finalize(bmap);
3547 /* Return a relation on of dimension "dim" expressing i_[0..pos] <<= o_[0..pos]
3549 __isl_give isl_basic_map *isl_basic_map_less_or_equal_at(
3550 __isl_take isl_space *dim, unsigned pos)
3553 isl_basic_map *bmap;
3555 bmap = isl_basic_map_alloc_space(dim, 0, pos, 1);
3556 for (i = 0; i < pos; ++i)
3557 bmap = var_equal(bmap, i);
3558 bmap = var_less_or_equal(bmap, pos);
3559 return isl_basic_map_finalize(bmap);
3562 /* Return a relation on pairs of sets of dimension "dim" expressing i_pos > o_pos
3564 __isl_give isl_basic_map *isl_basic_map_more_at(__isl_take isl_space *dim,
3568 struct isl_basic_map *bmap;
3569 bmap = isl_basic_map_alloc_space(dim, 0, pos, 1);
3572 for (i = 0; i < pos && bmap; ++i)
3573 bmap = var_equal(bmap, i);
3575 bmap = var_more(bmap, pos);
3576 return isl_basic_map_finalize(bmap);
3579 /* Return a relation on of dimension "dim" expressing i_[0..pos] >>= o_[0..pos]
3581 __isl_give isl_basic_map *isl_basic_map_more_or_equal_at(
3582 __isl_take isl_space *dim, unsigned pos)
3585 isl_basic_map *bmap;
3587 bmap = isl_basic_map_alloc_space(dim, 0, pos, 1);
3588 for (i = 0; i < pos; ++i)
3589 bmap = var_equal(bmap, i);
3590 bmap = var_more_or_equal(bmap, pos);
3591 return isl_basic_map_finalize(bmap);
3594 static __isl_give isl_map *map_lex_lte_first(__isl_take isl_space *dims,
3595 unsigned n, int equal)
3597 struct isl_map *map;
3600 if (n == 0 && equal)
3601 return isl_map_universe(dims);
3603 map = isl_map_alloc_space(isl_space_copy(dims), n, ISL_MAP_DISJOINT);
3605 for (i = 0; i + 1 < n; ++i)
3606 map = isl_map_add_basic_map(map,
3607 isl_basic_map_less_at(isl_space_copy(dims), i));
3610 map = isl_map_add_basic_map(map,
3611 isl_basic_map_less_or_equal_at(dims, n - 1));
3613 map = isl_map_add_basic_map(map,
3614 isl_basic_map_less_at(dims, n - 1));
3616 isl_space_free(dims);
3621 static __isl_give isl_map *map_lex_lte(__isl_take isl_space *dims, int equal)
3625 return map_lex_lte_first(dims, dims->n_out, equal);
3628 __isl_give isl_map *isl_map_lex_lt_first(__isl_take isl_space *dim, unsigned n)
3630 return map_lex_lte_first(dim, n, 0);
3633 __isl_give isl_map *isl_map_lex_le_first(__isl_take isl_space *dim, unsigned n)
3635 return map_lex_lte_first(dim, n, 1);
3638 __isl_give isl_map *isl_map_lex_lt(__isl_take isl_space *set_dim)
3640 return map_lex_lte(isl_space_map_from_set(set_dim), 0);
3643 __isl_give isl_map *isl_map_lex_le(__isl_take isl_space *set_dim)
3645 return map_lex_lte(isl_space_map_from_set(set_dim), 1);
3648 static __isl_give isl_map *map_lex_gte_first(__isl_take isl_space *dims,
3649 unsigned n, int equal)
3651 struct isl_map *map;
3654 if (n == 0 && equal)
3655 return isl_map_universe(dims);
3657 map = isl_map_alloc_space(isl_space_copy(dims), n, ISL_MAP_DISJOINT);
3659 for (i = 0; i + 1 < n; ++i)
3660 map = isl_map_add_basic_map(map,
3661 isl_basic_map_more_at(isl_space_copy(dims), i));
3664 map = isl_map_add_basic_map(map,
3665 isl_basic_map_more_or_equal_at(dims, n - 1));
3667 map = isl_map_add_basic_map(map,
3668 isl_basic_map_more_at(dims, n - 1));
3670 isl_space_free(dims);
3675 static __isl_give isl_map *map_lex_gte(__isl_take isl_space *dims, int equal)
3679 return map_lex_gte_first(dims, dims->n_out, equal);
3682 __isl_give isl_map *isl_map_lex_gt_first(__isl_take isl_space *dim, unsigned n)
3684 return map_lex_gte_first(dim, n, 0);
3687 __isl_give isl_map *isl_map_lex_ge_first(__isl_take isl_space *dim, unsigned n)
3689 return map_lex_gte_first(dim, n, 1);
3692 __isl_give isl_map *isl_map_lex_gt(__isl_take isl_space *set_dim)
3694 return map_lex_gte(isl_space_map_from_set(set_dim), 0);
3697 __isl_give isl_map *isl_map_lex_ge(__isl_take isl_space *set_dim)
3699 return map_lex_gte(isl_space_map_from_set(set_dim), 1);
3702 __isl_give isl_map *isl_set_lex_le_set(__isl_take isl_set *set1,
3703 __isl_take isl_set *set2)
3706 map = isl_map_lex_le(isl_set_get_space(set1));
3707 map = isl_map_intersect_domain(map, set1);
3708 map = isl_map_intersect_range(map, set2);
3712 __isl_give isl_map *isl_set_lex_lt_set(__isl_take isl_set *set1,
3713 __isl_take isl_set *set2)
3716 map = isl_map_lex_lt(isl_set_get_space(set1));
3717 map = isl_map_intersect_domain(map, set1);
3718 map = isl_map_intersect_range(map, set2);
3722 __isl_give isl_map *isl_set_lex_ge_set(__isl_take isl_set *set1,
3723 __isl_take isl_set *set2)
3726 map = isl_map_lex_ge(isl_set_get_space(set1));
3727 map = isl_map_intersect_domain(map, set1);
3728 map = isl_map_intersect_range(map, set2);
3732 __isl_give isl_map *isl_set_lex_gt_set(__isl_take isl_set *set1,
3733 __isl_take isl_set *set2)
3736 map = isl_map_lex_gt(isl_set_get_space(set1));
3737 map = isl_map_intersect_domain(map, set1);
3738 map = isl_map_intersect_range(map, set2);
3742 __isl_give isl_map *isl_map_lex_le_map(__isl_take isl_map *map1,
3743 __isl_take isl_map *map2)
3746 map = isl_map_lex_le(isl_space_range(isl_map_get_space(map1)));
3747 map = isl_map_apply_domain(map, isl_map_reverse(map1));
3748 map = isl_map_apply_range(map, isl_map_reverse(map2));
3752 __isl_give isl_map *isl_map_lex_lt_map(__isl_take isl_map *map1,
3753 __isl_take isl_map *map2)
3756 map = isl_map_lex_lt(isl_space_range(isl_map_get_space(map1)));
3757 map = isl_map_apply_domain(map, isl_map_reverse(map1));
3758 map = isl_map_apply_range(map, isl_map_reverse(map2));
3762 __isl_give isl_map *isl_map_lex_ge_map(__isl_take isl_map *map1,
3763 __isl_take isl_map *map2)
3766 map = isl_map_lex_ge(isl_space_range(isl_map_get_space(map1)));
3767 map = isl_map_apply_domain(map, isl_map_reverse(map1));
3768 map = isl_map_apply_range(map, isl_map_reverse(map2));
3772 __isl_give isl_map *isl_map_lex_gt_map(__isl_take isl_map *map1,
3773 __isl_take isl_map *map2)
3776 map = isl_map_lex_gt(isl_space_range(isl_map_get_space(map1)));
3777 map = isl_map_apply_domain(map, isl_map_reverse(map1));
3778 map = isl_map_apply_range(map, isl_map_reverse(map2));
3782 __isl_give isl_basic_map *isl_basic_map_from_basic_set(
3783 __isl_take isl_basic_set *bset, __isl_take isl_space *dim)
3785 struct isl_basic_map *bmap;
3787 bset = isl_basic_set_cow(bset);
3791 isl_assert(bset->ctx, isl_space_compatible(bset->dim, dim), goto error);
3792 isl_space_free(bset->dim);
3793 bmap = (struct isl_basic_map *) bset;
3795 return isl_basic_map_finalize(bmap);
3797 isl_basic_set_free(bset);
3798 isl_space_free(dim);
3802 struct isl_basic_set *isl_basic_set_from_basic_map(struct isl_basic_map *bmap)
3806 if (bmap->dim->n_in == 0)
3807 return (struct isl_basic_set *)bmap;
3808 bmap = isl_basic_map_cow(bmap);
3811 bmap->dim = isl_space_as_set_space(bmap->dim);
3814 bmap = isl_basic_map_finalize(bmap);
3815 return (struct isl_basic_set *)bmap;
3817 isl_basic_map_free(bmap);
3821 /* For a div d = floor(f/m), add the constraints
3824 * -(f-(n-1)) + m d >= 0
3826 * Note that the second constraint is the negation of
3830 int isl_basic_map_add_div_constraints_var(__isl_keep isl_basic_map *bmap,
3831 unsigned pos, isl_int *div)
3834 unsigned total = isl_basic_map_total_dim(bmap);
3836 i = isl_basic_map_alloc_inequality(bmap);
3839 isl_seq_cpy(bmap->ineq[i], div + 1, 1 + total);
3840 isl_int_neg(bmap->ineq[i][1 + pos], div[0]);
3842 j = isl_basic_map_alloc_inequality(bmap);
3845 isl_seq_neg(bmap->ineq[j], bmap->ineq[i], 1 + total);
3846 isl_int_add(bmap->ineq[j][0], bmap->ineq[j][0], bmap->ineq[j][1 + pos]);
3847 isl_int_sub_ui(bmap->ineq[j][0], bmap->ineq[j][0], 1);
3851 int isl_basic_set_add_div_constraints_var(__isl_keep isl_basic_set *bset,
3852 unsigned pos, isl_int *div)
3854 return isl_basic_map_add_div_constraints_var((isl_basic_map *)bset,
3858 int isl_basic_map_add_div_constraints(struct isl_basic_map *bmap, unsigned div)
3860 unsigned total = isl_basic_map_total_dim(bmap);
3861 unsigned div_pos = total - bmap->n_div + div;
3863 return isl_basic_map_add_div_constraints_var(bmap, div_pos,
3867 struct isl_basic_set *isl_basic_map_underlying_set(
3868 struct isl_basic_map *bmap)
3872 if (bmap->dim->nparam == 0 && bmap->dim->n_in == 0 &&
3874 !isl_space_is_named_or_nested(bmap->dim, isl_dim_in) &&
3875 !isl_space_is_named_or_nested(bmap->dim, isl_dim_out))
3876 return (struct isl_basic_set *)bmap;
3877 bmap = isl_basic_map_cow(bmap);
3880 bmap->dim = isl_space_underlying(bmap->dim, bmap->n_div);
3883 bmap->extra -= bmap->n_div;
3885 bmap = isl_basic_map_finalize(bmap);
3886 return (struct isl_basic_set *)bmap;
3891 __isl_give isl_basic_set *isl_basic_set_underlying_set(
3892 __isl_take isl_basic_set *bset)
3894 return isl_basic_map_underlying_set((isl_basic_map *)bset);
3897 struct isl_basic_map *isl_basic_map_overlying_set(
3898 struct isl_basic_set *bset, struct isl_basic_map *like)
3900 struct isl_basic_map *bmap;
3901 struct isl_ctx *ctx;
3908 isl_assert(ctx, bset->n_div == 0, goto error);
3909 isl_assert(ctx, isl_basic_set_n_param(bset) == 0, goto error);
3910 isl_assert(ctx, bset->dim->n_out == isl_basic_map_total_dim(like),
3912 if (isl_space_is_equal(bset->dim, like->dim) && like->n_div == 0) {
3913 isl_basic_map_free(like);
3914 return (struct isl_basic_map *)bset;
3916 bset = isl_basic_set_cow(bset);
3919 total = bset->dim->n_out + bset->extra;
3920 bmap = (struct isl_basic_map *)bset;
3921 isl_space_free(bmap->dim);
3922 bmap->dim = isl_space_copy(like->dim);
3925 bmap->n_div = like->n_div;
3926 bmap->extra += like->n_div;
3930 ltotal = total - bmap->extra + like->extra;
3933 bmap->block2 = isl_blk_extend(ctx, bmap->block2,
3934 bmap->extra * (1 + 1 + total));
3935 if (isl_blk_is_error(bmap->block2))
3937 div = isl_realloc_array(ctx, bmap->div, isl_int *, bmap->extra);
3941 for (i = 0; i < bmap->extra; ++i)
3942 bmap->div[i] = bmap->block2.data + i * (1 + 1 + total);
3943 for (i = 0; i < like->n_div; ++i) {
3944 isl_seq_cpy(bmap->div[i], like->div[i], 1 + 1 + ltotal);
3945 isl_seq_clr(bmap->div[i]+1+1+ltotal, total - ltotal);
3947 bmap = isl_basic_map_extend_constraints(bmap,
3948 0, 2 * like->n_div);
3949 for (i = 0; i < like->n_div; ++i) {
3950 if (isl_int_is_zero(bmap->div[i][0]))
3952 if (isl_basic_map_add_div_constraints(bmap, i) < 0)
3956 isl_basic_map_free(like);
3957 bmap = isl_basic_map_simplify(bmap);
3958 bmap = isl_basic_map_finalize(bmap);
3961 isl_basic_map_free(like);
3962 isl_basic_set_free(bset);
3966 struct isl_basic_set *isl_basic_set_from_underlying_set(
3967 struct isl_basic_set *bset, struct isl_basic_set *like)
3969 return (struct isl_basic_set *)
3970 isl_basic_map_overlying_set(bset, (struct isl_basic_map *)like);
3973 struct isl_set *isl_set_from_underlying_set(
3974 struct isl_set *set, struct isl_basic_set *like)
3980 isl_assert(set->ctx, set->dim->n_out == isl_basic_set_total_dim(like),
3982 if (isl_space_is_equal(set->dim, like->dim) && like->n_div == 0) {
3983 isl_basic_set_free(like);
3986 set = isl_set_cow(set);
3989 for (i = 0; i < set->n; ++i) {
3990 set->p[i] = isl_basic_set_from_underlying_set(set->p[i],
3991 isl_basic_set_copy(like));
3995 isl_space_free(set->dim);
3996 set->dim = isl_space_copy(like->dim);
3999 isl_basic_set_free(like);
4002 isl_basic_set_free(like);
4007 struct isl_set *isl_map_underlying_set(struct isl_map *map)
4011 map = isl_map_cow(map);
4014 map->dim = isl_space_cow(map->dim);
4018 for (i = 1; i < map->n; ++i)
4019 isl_assert(map->ctx, map->p[0]->n_div == map->p[i]->n_div,
4021 for (i = 0; i < map->n; ++i) {
4022 map->p[i] = (struct isl_basic_map *)
4023 isl_basic_map_underlying_set(map->p[i]);
4028 map->dim = isl_space_underlying(map->dim, 0);
4030 isl_space_free(map->dim);
4031 map->dim = isl_space_copy(map->p[0]->dim);
4035 return (struct isl_set *)map;
4041 struct isl_set *isl_set_to_underlying_set(struct isl_set *set)
4043 return (struct isl_set *)isl_map_underlying_set((struct isl_map *)set);
4046 __isl_give isl_basic_map *isl_basic_map_reset_space(
4047 __isl_take isl_basic_map *bmap, __isl_take isl_space *dim)
4049 bmap = isl_basic_map_cow(bmap);
4053 isl_space_free(bmap->dim);
4056 bmap = isl_basic_map_finalize(bmap);
4060 isl_basic_map_free(bmap);
4061 isl_space_free(dim);
4065 __isl_give isl_basic_set *isl_basic_set_reset_space(
4066 __isl_take isl_basic_set *bset, __isl_take isl_space *dim)
4068 return (isl_basic_set *)isl_basic_map_reset_space((isl_basic_map *)bset,
4072 __isl_give isl_map *isl_map_reset_space(__isl_take isl_map *map,
4073 __isl_take isl_space *dim)
4077 map = isl_map_cow(map);
4081 for (i = 0; i < map->n; ++i) {
4082 map->p[i] = isl_basic_map_reset_space(map->p[i],
4083 isl_space_copy(dim));
4087 isl_space_free(map->dim);
4093 isl_space_free(dim);
4097 __isl_give isl_set *isl_set_reset_space(__isl_take isl_set *set,
4098 __isl_take isl_space *dim)
4100 return (struct isl_set *) isl_map_reset_space((struct isl_map *)set, dim);
4103 /* Compute the parameter domain of the given basic set.
4105 __isl_give isl_basic_set *isl_basic_set_params(__isl_take isl_basic_set *bset)
4110 if (isl_basic_set_is_params(bset))
4113 n = isl_basic_set_dim(bset, isl_dim_set);
4114 bset = isl_basic_set_project_out(bset, isl_dim_set, 0, n);
4115 space = isl_basic_set_get_space(bset);
4116 space = isl_space_params(space);
4117 bset = isl_basic_set_reset_space(bset, space);
4121 /* Compute the parameter domain of the given set.
4123 __isl_give isl_set *isl_set_params(__isl_take isl_set *set)
4128 if (isl_set_is_params(set))
4131 n = isl_set_dim(set, isl_dim_set);
4132 set = isl_set_project_out(set, isl_dim_set, 0, n);
4133 space = isl_set_get_space(set);
4134 space = isl_space_params(space);
4135 set = isl_set_reset_space(set, space);
4139 /* Construct a zero-dimensional set with the given parameter domain.
4141 __isl_give isl_set *isl_set_from_params(__isl_take isl_set *set)
4144 space = isl_set_get_space(set);
4145 space = isl_space_set_from_params(space);
4146 set = isl_set_reset_space(set, space);
4150 /* Compute the parameter domain of the given map.
4152 __isl_give isl_set *isl_map_params(__isl_take isl_map *map)
4157 n = isl_map_dim(map, isl_dim_in);
4158 map = isl_map_project_out(map, isl_dim_in, 0, n);
4159 n = isl_map_dim(map, isl_dim_out);
4160 map = isl_map_project_out(map, isl_dim_out, 0, n);
4161 space = isl_map_get_space(map);
4162 space = isl_space_params(space);
4163 map = isl_map_reset_space(map, space);
4167 struct isl_basic_set *isl_basic_map_domain(struct isl_basic_map *bmap)
4170 struct isl_basic_set *domain;
4176 dim = isl_space_domain(isl_basic_map_get_space(bmap));
4178 n_in = isl_basic_map_n_in(bmap);
4179 n_out = isl_basic_map_n_out(bmap);
4180 domain = isl_basic_set_from_basic_map(bmap);
4181 domain = isl_basic_set_project_out(domain, isl_dim_set, n_in, n_out);
4183 domain = isl_basic_set_reset_space(domain, dim);
4188 int isl_basic_map_may_be_set(__isl_keep isl_basic_map *bmap)
4192 return isl_space_may_be_set(bmap->dim);
4195 /* Is this basic map actually a set?
4196 * Users should never call this function. Outside of isl,
4197 * the type should indicate whether something is a set or a map.
4199 int isl_basic_map_is_set(__isl_keep isl_basic_map *bmap)
4203 return isl_space_is_set(bmap->dim);
4206 struct isl_basic_set *isl_basic_map_range(struct isl_basic_map *bmap)
4210 if (isl_basic_map_is_set(bmap))
4212 return isl_basic_map_domain(isl_basic_map_reverse(bmap));
4215 __isl_give isl_basic_map *isl_basic_map_domain_map(
4216 __isl_take isl_basic_map *bmap)
4220 isl_basic_map *domain;
4221 int nparam, n_in, n_out;
4224 nparam = isl_basic_map_dim(bmap, isl_dim_param);
4225 n_in = isl_basic_map_dim(bmap, isl_dim_in);
4226 n_out = isl_basic_map_dim(bmap, isl_dim_out);
4228 dim = isl_space_from_range(isl_space_domain(isl_basic_map_get_space(bmap)));
4229 domain = isl_basic_map_universe(dim);
4231 bmap = isl_basic_map_from_domain(isl_basic_map_wrap(bmap));
4232 bmap = isl_basic_map_apply_range(bmap, domain);
4233 bmap = isl_basic_map_extend_constraints(bmap, n_in, 0);
4235 total = isl_basic_map_total_dim(bmap);
4237 for (i = 0; i < n_in; ++i) {
4238 k = isl_basic_map_alloc_equality(bmap);
4241 isl_seq_clr(bmap->eq[k], 1 + total);
4242 isl_int_set_si(bmap->eq[k][1 + nparam + i], -1);
4243 isl_int_set_si(bmap->eq[k][1 + nparam + n_in + n_out + i], 1);
4246 bmap = isl_basic_map_gauss(bmap, NULL);
4247 return isl_basic_map_finalize(bmap);
4249 isl_basic_map_free(bmap);
4253 __isl_give isl_basic_map *isl_basic_map_range_map(
4254 __isl_take isl_basic_map *bmap)
4258 isl_basic_map *range;
4259 int nparam, n_in, n_out;
4262 nparam = isl_basic_map_dim(bmap, isl_dim_param);
4263 n_in = isl_basic_map_dim(bmap, isl_dim_in);
4264 n_out = isl_basic_map_dim(bmap, isl_dim_out);
4266 dim = isl_space_from_range(isl_space_range(isl_basic_map_get_space(bmap)));
4267 range = isl_basic_map_universe(dim);
4269 bmap = isl_basic_map_from_domain(isl_basic_map_wrap(bmap));
4270 bmap = isl_basic_map_apply_range(bmap, range);
4271 bmap = isl_basic_map_extend_constraints(bmap, n_out, 0);
4273 total = isl_basic_map_total_dim(bmap);
4275 for (i = 0; i < n_out; ++i) {
4276 k = isl_basic_map_alloc_equality(bmap);
4279 isl_seq_clr(bmap->eq[k], 1 + total);
4280 isl_int_set_si(bmap->eq[k][1 + nparam + n_in + i], -1);
4281 isl_int_set_si(bmap->eq[k][1 + nparam + n_in + n_out + i], 1);
4284 bmap = isl_basic_map_gauss(bmap, NULL);
4285 return isl_basic_map_finalize(bmap);
4287 isl_basic_map_free(bmap);
4291 int isl_map_may_be_set(__isl_keep isl_map *map)
4295 return isl_space_may_be_set(map->dim);
4298 /* Is this map actually a set?
4299 * Users should never call this function. Outside of isl,
4300 * the type should indicate whether something is a set or a map.
4302 int isl_map_is_set(__isl_keep isl_map *map)
4306 return isl_space_is_set(map->dim);
4309 struct isl_set *isl_map_range(struct isl_map *map)
4312 struct isl_set *set;
4316 if (isl_map_is_set(map))
4317 return (isl_set *)map;
4319 map = isl_map_cow(map);
4323 set = (struct isl_set *) map;
4324 set->dim = isl_space_range(set->dim);
4327 for (i = 0; i < map->n; ++i) {
4328 set->p[i] = isl_basic_map_range(map->p[i]);
4332 ISL_F_CLR(set, ISL_MAP_DISJOINT);
4333 ISL_F_CLR(set, ISL_SET_NORMALIZED);
4340 __isl_give isl_map *isl_map_domain_map(__isl_take isl_map *map)
4343 isl_space *domain_dim;
4345 map = isl_map_cow(map);
4349 domain_dim = isl_space_from_range(isl_space_domain(isl_map_get_space(map)));
4350 map->dim = isl_space_from_domain(isl_space_wrap(map->dim));
4351 map->dim = isl_space_join(map->dim, domain_dim);
4354 for (i = 0; i < map->n; ++i) {
4355 map->p[i] = isl_basic_map_domain_map(map->p[i]);
4359 ISL_F_CLR(map, ISL_MAP_DISJOINT);
4360 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4367 __isl_give isl_map *isl_map_range_map(__isl_take isl_map *map)
4370 isl_space *range_dim;
4372 map = isl_map_cow(map);
4376 range_dim = isl_space_range(isl_map_get_space(map));
4377 range_dim = isl_space_from_range(range_dim);
4378 map->dim = isl_space_from_domain(isl_space_wrap(map->dim));
4379 map->dim = isl_space_join(map->dim, range_dim);
4382 for (i = 0; i < map->n; ++i) {
4383 map->p[i] = isl_basic_map_range_map(map->p[i]);
4387 ISL_F_CLR(map, ISL_MAP_DISJOINT);
4388 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4395 __isl_give isl_map *isl_map_from_set(__isl_take isl_set *set,
4396 __isl_take isl_space *dim)
4399 struct isl_map *map = NULL;
4401 set = isl_set_cow(set);
4404 isl_assert(set->ctx, isl_space_compatible(set->dim, dim), goto error);
4405 map = (struct isl_map *)set;
4406 for (i = 0; i < set->n; ++i) {
4407 map->p[i] = isl_basic_map_from_basic_set(
4408 set->p[i], isl_space_copy(dim));
4412 isl_space_free(map->dim);
4416 isl_space_free(dim);
4421 __isl_give isl_basic_map *isl_basic_map_from_domain(
4422 __isl_take isl_basic_set *bset)
4424 return isl_basic_map_reverse(isl_basic_map_from_range(bset));
4427 __isl_give isl_basic_map *isl_basic_map_from_range(
4428 __isl_take isl_basic_set *bset)
4431 space = isl_basic_set_get_space(bset);
4432 space = isl_space_from_range(space);
4433 bset = isl_basic_set_reset_space(bset, space);
4434 return (isl_basic_map *)bset;
4437 struct isl_map *isl_map_from_range(struct isl_set *set)
4440 space = isl_set_get_space(set);
4441 space = isl_space_from_range(space);
4442 set = isl_set_reset_space(set, space);
4443 return (struct isl_map *)set;
4446 __isl_give isl_map *isl_map_from_domain(__isl_take isl_set *set)
4448 return isl_map_reverse(isl_map_from_range(set));
4451 __isl_give isl_basic_map *isl_basic_map_from_domain_and_range(
4452 __isl_take isl_basic_set *domain, __isl_take isl_basic_set *range)
4454 return isl_basic_map_apply_range(isl_basic_map_reverse(domain), range);
4457 __isl_give isl_map *isl_map_from_domain_and_range(__isl_take isl_set *domain,
4458 __isl_take isl_set *range)
4460 return isl_map_apply_range(isl_map_reverse(domain), range);
4463 struct isl_set *isl_set_from_map(struct isl_map *map)
4466 struct isl_set *set = NULL;
4470 map = isl_map_cow(map);
4473 map->dim = isl_space_as_set_space(map->dim);
4476 set = (struct isl_set *)map;
4477 for (i = 0; i < map->n; ++i) {
4478 set->p[i] = isl_basic_set_from_basic_map(map->p[i]);
4488 __isl_give isl_map *isl_map_alloc_space(__isl_take isl_space *dim, int n,
4491 struct isl_map *map;
4495 isl_assert(dim->ctx, n >= 0, return NULL);
4496 map = isl_alloc(dim->ctx, struct isl_map,
4497 sizeof(struct isl_map) +
4498 (n - 1) * sizeof(struct isl_basic_map *));
4502 map->ctx = dim->ctx;
4503 isl_ctx_ref(map->ctx);
4511 isl_space_free(dim);
4515 struct isl_map *isl_map_alloc(struct isl_ctx *ctx,
4516 unsigned nparam, unsigned in, unsigned out, int n,
4519 struct isl_map *map;
4522 dims = isl_space_alloc(ctx, nparam, in, out);
4526 map = isl_map_alloc_space(dims, n, flags);
4530 __isl_give isl_basic_map *isl_basic_map_empty(__isl_take isl_space *dim)
4532 struct isl_basic_map *bmap;
4533 bmap = isl_basic_map_alloc_space(dim, 0, 1, 0);
4534 bmap = isl_basic_map_set_to_empty(bmap);
4538 __isl_give isl_basic_set *isl_basic_set_empty(__isl_take isl_space *dim)
4540 struct isl_basic_set *bset;
4541 bset = isl_basic_set_alloc_space(dim, 0, 1, 0);
4542 bset = isl_basic_set_set_to_empty(bset);
4546 struct isl_basic_map *isl_basic_map_empty_like(struct isl_basic_map *model)
4548 struct isl_basic_map *bmap;
4551 bmap = isl_basic_map_alloc_space(isl_space_copy(model->dim), 0, 1, 0);
4552 bmap = isl_basic_map_set_to_empty(bmap);
4556 struct isl_basic_map *isl_basic_map_empty_like_map(struct isl_map *model)
4558 struct isl_basic_map *bmap;
4561 bmap = isl_basic_map_alloc_space(isl_space_copy(model->dim), 0, 1, 0);
4562 bmap = isl_basic_map_set_to_empty(bmap);
4566 struct isl_basic_set *isl_basic_set_empty_like(struct isl_basic_set *model)
4568 struct isl_basic_set *bset;
4571 bset = isl_basic_set_alloc_space(isl_space_copy(model->dim), 0, 1, 0);
4572 bset = isl_basic_set_set_to_empty(bset);
4576 __isl_give isl_basic_map *isl_basic_map_universe(__isl_take isl_space *dim)
4578 struct isl_basic_map *bmap;
4579 bmap = isl_basic_map_alloc_space(dim, 0, 0, 0);
4580 bmap = isl_basic_map_finalize(bmap);
4584 __isl_give isl_basic_set *isl_basic_set_universe(__isl_take isl_space *dim)
4586 struct isl_basic_set *bset;
4587 bset = isl_basic_set_alloc_space(dim, 0, 0, 0);
4588 bset = isl_basic_set_finalize(bset);
4592 __isl_give isl_basic_map *isl_basic_map_nat_universe(__isl_take isl_space *dim)
4595 unsigned total = isl_space_dim(dim, isl_dim_all);
4596 isl_basic_map *bmap;
4598 bmap= isl_basic_map_alloc_space(dim, 0, 0, total);
4599 for (i = 0; i < total; ++i) {
4600 int k = isl_basic_map_alloc_inequality(bmap);
4603 isl_seq_clr(bmap->ineq[k], 1 + total);
4604 isl_int_set_si(bmap->ineq[k][1 + i], 1);
4608 isl_basic_map_free(bmap);
4612 __isl_give isl_basic_set *isl_basic_set_nat_universe(__isl_take isl_space *dim)
4614 return isl_basic_map_nat_universe(dim);
4617 __isl_give isl_map *isl_map_nat_universe(__isl_take isl_space *dim)
4619 return isl_map_from_basic_map(isl_basic_map_nat_universe(dim));
4622 __isl_give isl_set *isl_set_nat_universe(__isl_take isl_space *dim)
4624 return isl_map_nat_universe(dim);
4627 __isl_give isl_basic_map *isl_basic_map_universe_like(
4628 __isl_keep isl_basic_map *model)
4632 return isl_basic_map_alloc_space(isl_space_copy(model->dim), 0, 0, 0);
4635 struct isl_basic_set *isl_basic_set_universe_like(struct isl_basic_set *model)
4639 return isl_basic_set_alloc_space(isl_space_copy(model->dim), 0, 0, 0);
4642 __isl_give isl_basic_set *isl_basic_set_universe_like_set(
4643 __isl_keep isl_set *model)
4647 return isl_basic_set_alloc_space(isl_space_copy(model->dim), 0, 0, 0);
4650 __isl_give isl_map *isl_map_empty(__isl_take isl_space *dim)
4652 return isl_map_alloc_space(dim, 0, ISL_MAP_DISJOINT);
4655 struct isl_map *isl_map_empty_like(struct isl_map *model)
4659 return isl_map_alloc_space(isl_space_copy(model->dim), 0, ISL_MAP_DISJOINT);
4662 struct isl_map *isl_map_empty_like_basic_map(struct isl_basic_map *model)
4666 return isl_map_alloc_space(isl_space_copy(model->dim), 0, ISL_MAP_DISJOINT);
4669 __isl_give isl_set *isl_set_empty(__isl_take isl_space *dim)
4671 return isl_set_alloc_space(dim, 0, ISL_MAP_DISJOINT);
4674 struct isl_set *isl_set_empty_like(struct isl_set *model)
4678 return isl_set_empty(isl_space_copy(model->dim));
4681 __isl_give isl_map *isl_map_universe(__isl_take isl_space *dim)
4683 struct isl_map *map;
4686 map = isl_map_alloc_space(isl_space_copy(dim), 1, ISL_MAP_DISJOINT);
4687 map = isl_map_add_basic_map(map, isl_basic_map_universe(dim));
4691 __isl_give isl_set *isl_set_universe(__isl_take isl_space *dim)
4693 struct isl_set *set;
4696 set = isl_set_alloc_space(isl_space_copy(dim), 1, ISL_MAP_DISJOINT);
4697 set = isl_set_add_basic_set(set, isl_basic_set_universe(dim));
4701 __isl_give isl_set *isl_set_universe_like(__isl_keep isl_set *model)
4705 return isl_set_universe(isl_space_copy(model->dim));
4708 struct isl_map *isl_map_dup(struct isl_map *map)
4711 struct isl_map *dup;
4715 dup = isl_map_alloc_space(isl_space_copy(map->dim), map->n, map->flags);
4716 for (i = 0; i < map->n; ++i)
4717 dup = isl_map_add_basic_map(dup, isl_basic_map_copy(map->p[i]));
4721 __isl_give isl_map *isl_map_add_basic_map(__isl_take isl_map *map,
4722 __isl_take isl_basic_map *bmap)
4726 if (isl_basic_map_plain_is_empty(bmap)) {
4727 isl_basic_map_free(bmap);
4730 isl_assert(map->ctx, isl_space_is_equal(map->dim, bmap->dim), goto error);
4731 isl_assert(map->ctx, map->n < map->size, goto error);
4732 map->p[map->n] = bmap;
4734 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4740 isl_basic_map_free(bmap);
4744 void isl_map_free(struct isl_map *map)
4754 isl_ctx_deref(map->ctx);
4755 for (i = 0; i < map->n; ++i)
4756 isl_basic_map_free(map->p[i]);
4757 isl_space_free(map->dim);
4761 struct isl_map *isl_map_extend(struct isl_map *base,
4762 unsigned nparam, unsigned n_in, unsigned n_out)
4766 base = isl_map_cow(base);
4770 base->dim = isl_space_extend(base->dim, nparam, n_in, n_out);
4773 for (i = 0; i < base->n; ++i) {
4774 base->p[i] = isl_basic_map_extend_space(base->p[i],
4775 isl_space_copy(base->dim), 0, 0, 0);
4785 struct isl_set *isl_set_extend(struct isl_set *base,
4786 unsigned nparam, unsigned dim)
4788 return (struct isl_set *)isl_map_extend((struct isl_map *)base,
4792 static struct isl_basic_map *isl_basic_map_fix_pos_si(
4793 struct isl_basic_map *bmap, unsigned pos, int value)
4797 bmap = isl_basic_map_cow(bmap);
4798 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
4799 j = isl_basic_map_alloc_equality(bmap);
4802 isl_seq_clr(bmap->eq[j] + 1, isl_basic_map_total_dim(bmap));
4803 isl_int_set_si(bmap->eq[j][pos], -1);
4804 isl_int_set_si(bmap->eq[j][0], value);
4805 bmap = isl_basic_map_simplify(bmap);
4806 return isl_basic_map_finalize(bmap);
4808 isl_basic_map_free(bmap);
4812 static __isl_give isl_basic_map *isl_basic_map_fix_pos(
4813 __isl_take isl_basic_map *bmap, unsigned pos, isl_int value)
4817 bmap = isl_basic_map_cow(bmap);
4818 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
4819 j = isl_basic_map_alloc_equality(bmap);
4822 isl_seq_clr(bmap->eq[j] + 1, isl_basic_map_total_dim(bmap));
4823 isl_int_set_si(bmap->eq[j][pos], -1);
4824 isl_int_set(bmap->eq[j][0], value);
4825 bmap = isl_basic_map_simplify(bmap);
4826 return isl_basic_map_finalize(bmap);
4828 isl_basic_map_free(bmap);
4832 struct isl_basic_map *isl_basic_map_fix_si(struct isl_basic_map *bmap,
4833 enum isl_dim_type type, unsigned pos, int value)
4837 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
4838 return isl_basic_map_fix_pos_si(bmap,
4839 isl_basic_map_offset(bmap, type) + pos, value);
4841 isl_basic_map_free(bmap);
4845 __isl_give isl_basic_map *isl_basic_map_fix(__isl_take isl_basic_map *bmap,
4846 enum isl_dim_type type, unsigned pos, isl_int value)
4850 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
4851 return isl_basic_map_fix_pos(bmap,
4852 isl_basic_map_offset(bmap, type) + pos, value);
4854 isl_basic_map_free(bmap);
4858 struct isl_basic_set *isl_basic_set_fix_si(struct isl_basic_set *bset,
4859 enum isl_dim_type type, unsigned pos, int value)
4861 return (struct isl_basic_set *)
4862 isl_basic_map_fix_si((struct isl_basic_map *)bset,
4866 __isl_give isl_basic_set *isl_basic_set_fix(__isl_take isl_basic_set *bset,
4867 enum isl_dim_type type, unsigned pos, isl_int value)
4869 return (struct isl_basic_set *)
4870 isl_basic_map_fix((struct isl_basic_map *)bset,
4874 struct isl_basic_map *isl_basic_map_fix_input_si(struct isl_basic_map *bmap,
4875 unsigned input, int value)
4877 return isl_basic_map_fix_si(bmap, isl_dim_in, input, value);
4880 struct isl_basic_set *isl_basic_set_fix_dim_si(struct isl_basic_set *bset,
4881 unsigned dim, int value)
4883 return (struct isl_basic_set *)
4884 isl_basic_map_fix_si((struct isl_basic_map *)bset,
4885 isl_dim_set, dim, value);
4888 struct isl_map *isl_map_fix_si(struct isl_map *map,
4889 enum isl_dim_type type, unsigned pos, int value)
4893 map = isl_map_cow(map);
4897 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
4898 for (i = 0; i < map->n; ++i) {
4899 map->p[i] = isl_basic_map_fix_si(map->p[i], type, pos, value);
4903 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4910 __isl_give isl_set *isl_set_fix_si(__isl_take isl_set *set,
4911 enum isl_dim_type type, unsigned pos, int value)
4913 return (struct isl_set *)
4914 isl_map_fix_si((struct isl_map *)set, type, pos, value);
4917 __isl_give isl_map *isl_map_fix(__isl_take isl_map *map,
4918 enum isl_dim_type type, unsigned pos, isl_int value)
4922 map = isl_map_cow(map);
4926 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
4927 for (i = 0; i < map->n; ++i) {
4928 map->p[i] = isl_basic_map_fix(map->p[i], type, pos, value);
4932 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4939 __isl_give isl_set *isl_set_fix(__isl_take isl_set *set,
4940 enum isl_dim_type type, unsigned pos, isl_int value)
4942 return (struct isl_set *)isl_map_fix((isl_map *)set, type, pos, value);
4945 struct isl_map *isl_map_fix_input_si(struct isl_map *map,
4946 unsigned input, int value)
4948 return isl_map_fix_si(map, isl_dim_in, input, value);
4951 struct isl_set *isl_set_fix_dim_si(struct isl_set *set, unsigned dim, int value)
4953 return (struct isl_set *)
4954 isl_map_fix_si((struct isl_map *)set, isl_dim_set, dim, value);
4957 __isl_give isl_basic_map *isl_basic_map_lower_bound_si(
4958 __isl_take isl_basic_map *bmap,
4959 enum isl_dim_type type, unsigned pos, int value)
4965 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
4966 pos += isl_basic_map_offset(bmap, type);
4967 bmap = isl_basic_map_cow(bmap);
4968 bmap = isl_basic_map_extend_constraints(bmap, 0, 1);
4969 j = isl_basic_map_alloc_inequality(bmap);
4972 isl_seq_clr(bmap->ineq[j], 1 + isl_basic_map_total_dim(bmap));
4973 isl_int_set_si(bmap->ineq[j][pos], 1);
4974 isl_int_set_si(bmap->ineq[j][0], -value);
4975 bmap = isl_basic_map_simplify(bmap);
4976 return isl_basic_map_finalize(bmap);
4978 isl_basic_map_free(bmap);
4982 struct isl_basic_set *isl_basic_set_lower_bound_dim(struct isl_basic_set *bset,
4983 unsigned dim, isl_int value)
4987 bset = isl_basic_set_cow(bset);
4988 bset = isl_basic_set_extend_constraints(bset, 0, 1);
4989 j = isl_basic_set_alloc_inequality(bset);
4992 isl_seq_clr(bset->ineq[j], 1 + isl_basic_set_total_dim(bset));
4993 isl_int_set_si(bset->ineq[j][1 + isl_basic_set_n_param(bset) + dim], 1);
4994 isl_int_neg(bset->ineq[j][0], value);
4995 bset = isl_basic_set_simplify(bset);
4996 return isl_basic_set_finalize(bset);
4998 isl_basic_set_free(bset);
5002 __isl_give isl_map *isl_map_lower_bound_si(__isl_take isl_map *map,
5003 enum isl_dim_type type, unsigned pos, int value)
5007 map = isl_map_cow(map);
5011 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
5012 for (i = 0; i < map->n; ++i) {
5013 map->p[i] = isl_basic_map_lower_bound_si(map->p[i],
5018 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
5025 __isl_give isl_set *isl_set_lower_bound_si(__isl_take isl_set *set,
5026 enum isl_dim_type type, unsigned pos, int value)
5028 return (struct isl_set *)
5029 isl_map_lower_bound_si((struct isl_map *)set, type, pos, value);
5032 struct isl_set *isl_set_lower_bound_dim(struct isl_set *set, unsigned dim,
5037 set = isl_set_cow(set);
5041 isl_assert(set->ctx, dim < isl_set_n_dim(set), goto error);
5042 for (i = 0; i < set->n; ++i) {
5043 set->p[i] = isl_basic_set_lower_bound_dim(set->p[i], dim, value);
5053 struct isl_map *isl_map_reverse(struct isl_map *map)
5057 map = isl_map_cow(map);
5061 map->dim = isl_space_reverse(map->dim);
5064 for (i = 0; i < map->n; ++i) {
5065 map->p[i] = isl_basic_map_reverse(map->p[i]);
5069 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
5076 static struct isl_map *isl_basic_map_partial_lexopt(
5077 struct isl_basic_map *bmap, struct isl_basic_set *dom,
5078 struct isl_set **empty, int max)
5082 if (bmap->ctx->opt->pip == ISL_PIP_PIP)
5083 return isl_pip_basic_map_lexopt(bmap, dom, empty, max);
5085 return isl_tab_basic_map_partial_lexopt(bmap, dom, empty, max);
5087 isl_basic_map_free(bmap);
5088 isl_basic_set_free(dom);
5094 struct isl_map *isl_basic_map_partial_lexmax(
5095 struct isl_basic_map *bmap, struct isl_basic_set *dom,
5096 struct isl_set **empty)
5098 return isl_basic_map_partial_lexopt(bmap, dom, empty, 1);
5101 struct isl_map *isl_basic_map_partial_lexmin(
5102 struct isl_basic_map *bmap, struct isl_basic_set *dom,
5103 struct isl_set **empty)
5105 return isl_basic_map_partial_lexopt(bmap, dom, empty, 0);
5108 struct isl_set *isl_basic_set_partial_lexmin(
5109 struct isl_basic_set *bset, struct isl_basic_set *dom,
5110 struct isl_set **empty)
5112 return (struct isl_set *)
5113 isl_basic_map_partial_lexmin((struct isl_basic_map *)bset,
5117 struct isl_set *isl_basic_set_partial_lexmax(
5118 struct isl_basic_set *bset, struct isl_basic_set *dom,
5119 struct isl_set **empty)
5121 return (struct isl_set *)
5122 isl_basic_map_partial_lexmax((struct isl_basic_map *)bset,
5126 __isl_give isl_pw_multi_aff *isl_basic_map_partial_lexmin_pw_multi_aff(
5127 __isl_take isl_basic_map *bmap, __isl_take isl_basic_set *dom,
5128 __isl_give isl_set **empty)
5130 return isl_basic_map_partial_lexopt_pw_multi_aff(bmap, dom, empty, 0);
5133 __isl_give isl_pw_multi_aff *isl_basic_map_partial_lexmax_pw_multi_aff(
5134 __isl_take isl_basic_map *bmap, __isl_take isl_basic_set *dom,
5135 __isl_give isl_set **empty)
5137 return isl_basic_map_partial_lexopt_pw_multi_aff(bmap, dom, empty, 1);
5140 __isl_give isl_pw_multi_aff *isl_basic_set_partial_lexmin_pw_multi_aff(
5141 __isl_take isl_basic_set *bset, __isl_take isl_basic_set *dom,
5142 __isl_give isl_set **empty)
5144 return isl_basic_map_partial_lexmin_pw_multi_aff(bset, dom, empty);
5147 __isl_give isl_pw_multi_aff *isl_basic_set_partial_lexmax_pw_multi_aff(
5148 __isl_take isl_basic_set *bset, __isl_take isl_basic_set *dom,
5149 __isl_give isl_set **empty)
5151 return isl_basic_map_partial_lexmax_pw_multi_aff(bset, dom, empty);
5154 __isl_give isl_pw_multi_aff *isl_basic_map_lexopt_pw_multi_aff(
5155 __isl_take isl_basic_map *bmap, int max)
5157 isl_basic_set *dom = NULL;
5158 isl_space *dom_space;
5162 dom_space = isl_space_domain(isl_space_copy(bmap->dim));
5163 dom = isl_basic_set_universe(dom_space);
5164 return isl_basic_map_partial_lexopt_pw_multi_aff(bmap, dom, NULL, max);
5166 isl_basic_map_free(bmap);
5170 __isl_give isl_pw_multi_aff *isl_basic_map_lexmin_pw_multi_aff(
5171 __isl_take isl_basic_map *bmap)
5173 return isl_basic_map_lexopt_pw_multi_aff(bmap, 0);
5176 /* Given a basic map "bmap", compute the lexicographically minimal
5177 * (or maximal) image element for each domain element in dom.
5178 * Set *empty to those elements in dom that do not have an image element.
5180 * We first make sure the basic sets in dom are disjoint and then
5181 * simply collect the results over each of the basic sets separately.
5182 * We could probably improve the efficiency a bit by moving the union
5183 * domain down into the parametric integer programming.
5185 static __isl_give isl_map *basic_map_partial_lexopt(
5186 __isl_take isl_basic_map *bmap, __isl_take isl_set *dom,
5187 __isl_give isl_set **empty, int max)
5190 struct isl_map *res;
5192 dom = isl_set_make_disjoint(dom);
5196 if (isl_set_plain_is_empty(dom)) {
5197 res = isl_map_empty_like_basic_map(bmap);
5198 *empty = isl_set_empty_like(dom);
5200 isl_basic_map_free(bmap);
5204 res = isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap),
5205 isl_basic_set_copy(dom->p[0]), empty, max);
5207 for (i = 1; i < dom->n; ++i) {
5208 struct isl_map *res_i;
5209 struct isl_set *empty_i;
5211 res_i = isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap),
5212 isl_basic_set_copy(dom->p[i]), &empty_i, max);
5214 res = isl_map_union_disjoint(res, res_i);
5215 *empty = isl_set_union_disjoint(*empty, empty_i);
5219 isl_basic_map_free(bmap);
5224 isl_basic_map_free(bmap);
5228 /* Given a map "map", compute the lexicographically minimal
5229 * (or maximal) image element for each domain element in dom.
5230 * Set *empty to those elements in dom that do not have an image element.
5232 * We first compute the lexicographically minimal or maximal element
5233 * in the first basic map. This results in a partial solution "res"
5234 * and a subset "todo" of dom that still need to be handled.
5235 * We then consider each of the remaining maps in "map" and successively
5236 * improve both "res" and "todo".
5238 * Let res^k and todo^k be the results after k steps and let i = k + 1.
5239 * Assume we are computing the lexicographical maximum.
5240 * We first compute the lexicographically maximal element in basic map i.
5241 * This results in a partial solution res_i and a subset todo_i.
5242 * Then we combine these results with those obtain for the first k basic maps
5243 * to obtain a result that is valid for the first k+1 basic maps.
5244 * In particular, the set where there is no solution is the set where
5245 * there is no solution for the first k basic maps and also no solution
5246 * for the ith basic map, i.e.,
5248 * todo^i = todo^k * todo_i
5250 * On dom(res^k) * dom(res_i), we need to pick the larger of the two
5251 * solutions, arbitrarily breaking ties in favor of res^k.
5252 * That is, when res^k(a) >= res_i(a), we pick res^k and
5253 * when res^k(a) < res_i(a), we pick res_i. (Here, ">=" and "<" denote
5254 * the lexicographic order.)
5255 * In practice, we compute
5257 * res^k * (res_i . "<=")
5261 * res_i * (res^k . "<")
5263 * Finally, we consider the symmetric difference of dom(res^k) and dom(res_i),
5264 * where only one of res^k and res_i provides a solution and we simply pick
5271 * Note that we only compute these intersections when dom(res^k) intersects
5272 * dom(res_i). Otherwise, the only effect of these intersections is to
5273 * potentially break up res^k and res_i into smaller pieces.
5274 * We want to avoid such splintering as much as possible.
5275 * In fact, an earlier implementation of this function would look for
5276 * better results in the domain of res^k and for extra results in todo^k,
5277 * but this would always result in a splintering according to todo^k,
5278 * even when the domain of basic map i is disjoint from the domains of
5279 * the previous basic maps.
5281 static __isl_give isl_map *isl_map_partial_lexopt_aligned(
5282 __isl_take isl_map *map, __isl_take isl_set *dom,
5283 __isl_give isl_set **empty, int max)
5286 struct isl_map *res;
5287 struct isl_set *todo;
5292 if (isl_map_plain_is_empty(map)) {
5300 res = basic_map_partial_lexopt(isl_basic_map_copy(map->p[0]),
5301 isl_set_copy(dom), &todo, max);
5303 for (i = 1; i < map->n; ++i) {
5307 isl_space *dim = isl_space_range(isl_map_get_space(res));
5309 res_i = basic_map_partial_lexopt(isl_basic_map_copy(map->p[i]),
5310 isl_set_copy(dom), &todo_i, max);
5313 lt = isl_map_lex_lt(isl_space_copy(dim));
5314 le = isl_map_lex_le(dim);
5316 lt = isl_map_lex_gt(isl_space_copy(dim));
5317 le = isl_map_lex_ge(dim);
5319 lt = isl_map_apply_range(isl_map_copy(res), lt);
5320 lt = isl_map_intersect(lt, isl_map_copy(res_i));
5321 le = isl_map_apply_range(isl_map_copy(res_i), le);
5322 le = isl_map_intersect(le, isl_map_copy(res));
5324 if (!isl_map_is_empty(lt) || !isl_map_is_empty(le)) {
5325 res = isl_map_intersect_domain(res,
5326 isl_set_copy(todo_i));
5327 res_i = isl_map_intersect_domain(res_i,
5328 isl_set_copy(todo));
5331 res = isl_map_union_disjoint(res, res_i);
5332 res = isl_map_union_disjoint(res, lt);
5333 res = isl_map_union_disjoint(res, le);
5335 todo = isl_set_intersect(todo, todo_i);
5355 /* Given a map "map", compute the lexicographically minimal
5356 * (or maximal) image element for each domain element in dom.
5357 * Set *empty to those elements in dom that do not have an image element.
5359 * Align parameters if needed and then call isl_map_partial_lexopt_aligned.
5361 static __isl_give isl_map *isl_map_partial_lexopt(
5362 __isl_take isl_map *map, __isl_take isl_set *dom,
5363 __isl_give isl_set **empty, int max)
5367 if (isl_space_match(map->dim, isl_dim_param, dom->dim, isl_dim_param))
5368 return isl_map_partial_lexopt_aligned(map, dom, empty, max);
5369 if (!isl_space_has_named_params(map->dim) ||
5370 !isl_space_has_named_params(dom->dim))
5371 isl_die(map->ctx, isl_error_invalid,
5372 "unaligned unnamed parameters", goto error);
5373 map = isl_map_align_params(map, isl_map_get_space(dom));
5374 dom = isl_map_align_params(dom, isl_map_get_space(map));
5375 return isl_map_partial_lexopt_aligned(map, dom, empty, max);
5384 __isl_give isl_map *isl_map_partial_lexmax(
5385 __isl_take isl_map *map, __isl_take isl_set *dom,
5386 __isl_give isl_set **empty)
5388 return isl_map_partial_lexopt(map, dom, empty, 1);
5391 __isl_give isl_map *isl_map_partial_lexmin(
5392 __isl_take isl_map *map, __isl_take isl_set *dom,
5393 __isl_give isl_set **empty)
5395 return isl_map_partial_lexopt(map, dom, empty, 0);
5398 __isl_give isl_set *isl_set_partial_lexmin(
5399 __isl_take isl_set *set, __isl_take isl_set *dom,
5400 __isl_give isl_set **empty)
5402 return (struct isl_set *)
5403 isl_map_partial_lexmin((struct isl_map *)set,
5407 __isl_give isl_set *isl_set_partial_lexmax(
5408 __isl_take isl_set *set, __isl_take isl_set *dom,
5409 __isl_give isl_set **empty)
5411 return (struct isl_set *)
5412 isl_map_partial_lexmax((struct isl_map *)set,
5416 __isl_give isl_map *isl_basic_map_lexopt(__isl_take isl_basic_map *bmap, int max)
5418 struct isl_basic_set *dom = NULL;
5423 dom_dim = isl_space_domain(isl_space_copy(bmap->dim));
5424 dom = isl_basic_set_universe(dom_dim);
5425 return isl_basic_map_partial_lexopt(bmap, dom, NULL, max);
5427 isl_basic_map_free(bmap);
5431 __isl_give isl_map *isl_basic_map_lexmin(__isl_take isl_basic_map *bmap)
5433 return isl_basic_map_lexopt(bmap, 0);
5436 __isl_give isl_map *isl_basic_map_lexmax(__isl_take isl_basic_map *bmap)
5438 return isl_basic_map_lexopt(bmap, 1);
5441 __isl_give isl_set *isl_basic_set_lexmin(__isl_take isl_basic_set *bset)
5443 return (isl_set *)isl_basic_map_lexmin((isl_basic_map *)bset);
5446 __isl_give isl_set *isl_basic_set_lexmax(__isl_take isl_basic_set *bset)
5448 return (isl_set *)isl_basic_map_lexmax((isl_basic_map *)bset);
5451 __isl_give isl_map *isl_map_lexopt(__isl_take isl_map *map, int max)
5453 struct isl_set *dom = NULL;
5458 dom_dim = isl_space_domain(isl_space_copy(map->dim));
5459 dom = isl_set_universe(dom_dim);
5460 return isl_map_partial_lexopt(map, dom, NULL, max);
5466 __isl_give isl_map *isl_map_lexmin(__isl_take isl_map *map)
5468 return isl_map_lexopt(map, 0);
5471 __isl_give isl_map *isl_map_lexmax(__isl_take isl_map *map)
5473 return isl_map_lexopt(map, 1);
5476 __isl_give isl_set *isl_set_lexmin(__isl_take isl_set *set)
5478 return (isl_set *)isl_map_lexmin((isl_map *)set);
5481 __isl_give isl_set *isl_set_lexmax(__isl_take isl_set *set)
5483 return (isl_set *)isl_map_lexmax((isl_map *)set);
5486 /* Extract the first and only affine expression from list
5487 * and then add it to *pwaff with the given dom.
5488 * This domain is known to be disjoint from other domains
5489 * because of the way isl_basic_map_foreach_lexmax works.
5491 static int update_dim_opt(__isl_take isl_basic_set *dom,
5492 __isl_take isl_aff_list *list, void *user)
5494 isl_ctx *ctx = isl_basic_set_get_ctx(dom);
5496 isl_pw_aff **pwaff = user;
5497 isl_pw_aff *pwaff_i;
5499 if (isl_aff_list_n_aff(list) != 1)
5500 isl_die(ctx, isl_error_internal,
5501 "expecting single element list", goto error);
5503 aff = isl_aff_list_get_aff(list, 0);
5504 pwaff_i = isl_pw_aff_alloc(isl_set_from_basic_set(dom), aff);
5506 *pwaff = isl_pw_aff_add_disjoint(*pwaff, pwaff_i);
5508 isl_aff_list_free(list);
5512 isl_basic_set_free(dom);
5513 isl_aff_list_free(list);
5517 /* Given a basic map with one output dimension, compute the minimum or
5518 * maximum of that dimension as an isl_pw_aff.
5520 * The isl_pw_aff is constructed by having isl_basic_map_foreach_lexopt
5521 * call update_dim_opt on each leaf of the result.
5523 static __isl_give isl_pw_aff *basic_map_dim_opt(__isl_keep isl_basic_map *bmap,
5526 isl_space *dim = isl_basic_map_get_space(bmap);
5530 dim = isl_space_from_domain(isl_space_domain(dim));
5531 dim = isl_space_add_dims(dim, isl_dim_out, 1);
5532 pwaff = isl_pw_aff_empty(dim);
5534 r = isl_basic_map_foreach_lexopt(bmap, max, &update_dim_opt, &pwaff);
5536 return isl_pw_aff_free(pwaff);
5541 /* Compute the minimum or maximum of the given output dimension
5542 * as a function of the parameters and the input dimensions,
5543 * but independently of the other output dimensions.
5545 * We first project out the other output dimension and then compute
5546 * the "lexicographic" maximum in each basic map, combining the results
5547 * using isl_pw_aff_union_max.
5549 static __isl_give isl_pw_aff *map_dim_opt(__isl_take isl_map *map, int pos,
5556 n_out = isl_map_dim(map, isl_dim_out);
5557 map = isl_map_project_out(map, isl_dim_out, pos + 1, n_out - (pos + 1));
5558 map = isl_map_project_out(map, isl_dim_out, 0, pos);
5563 isl_space *dim = isl_map_get_space(map);
5564 dim = isl_space_domain(isl_space_from_range(dim));
5566 return isl_pw_aff_empty(dim);
5569 pwaff = basic_map_dim_opt(map->p[0], max);
5570 for (i = 1; i < map->n; ++i) {
5571 isl_pw_aff *pwaff_i;
5573 pwaff_i = basic_map_dim_opt(map->p[i], max);
5574 pwaff = isl_pw_aff_union_opt(pwaff, pwaff_i, max);
5582 /* Compute the maximum of the given output dimension as a function of the
5583 * parameters and input dimensions, but independently of
5584 * the other output dimensions.
5586 __isl_give isl_pw_aff *isl_map_dim_max(__isl_take isl_map *map, int pos)
5588 return map_dim_opt(map, pos, 1);
5591 /* Compute the minimum or maximum of the given set dimension
5592 * as a function of the parameters,
5593 * but independently of the other set dimensions.
5595 static __isl_give isl_pw_aff *set_dim_opt(__isl_take isl_set *set, int pos,
5598 return map_dim_opt(set, pos, max);
5601 /* Compute the maximum of the given set dimension as a function of the
5602 * parameters, but independently of the other set dimensions.
5604 __isl_give isl_pw_aff *isl_set_dim_max(__isl_take isl_set *set, int pos)
5606 return set_dim_opt(set, pos, 1);
5609 /* Compute the minimum of the given set dimension as a function of the
5610 * parameters, but independently of the other set dimensions.
5612 __isl_give isl_pw_aff *isl_set_dim_min(__isl_take isl_set *set, int pos)
5614 return set_dim_opt(set, pos, 0);
5617 /* Apply a preimage specified by "mat" on the parameters of "bset".
5618 * bset is assumed to have only parameters and divs.
5620 static struct isl_basic_set *basic_set_parameter_preimage(
5621 struct isl_basic_set *bset, struct isl_mat *mat)
5628 bset->dim = isl_space_cow(bset->dim);
5632 nparam = isl_basic_set_dim(bset, isl_dim_param);
5634 isl_assert(bset->ctx, mat->n_row == 1 + nparam, goto error);
5636 bset->dim->nparam = 0;
5637 bset->dim->n_out = nparam;
5638 bset = isl_basic_set_preimage(bset, mat);
5640 bset->dim->nparam = bset->dim->n_out;
5641 bset->dim->n_out = 0;
5646 isl_basic_set_free(bset);
5650 /* Apply a preimage specified by "mat" on the parameters of "set".
5651 * set is assumed to have only parameters and divs.
5653 static struct isl_set *set_parameter_preimage(
5654 struct isl_set *set, struct isl_mat *mat)
5656 isl_space *dim = NULL;
5662 dim = isl_space_copy(set->dim);
5663 dim = isl_space_cow(dim);
5667 nparam = isl_set_dim(set, isl_dim_param);
5669 isl_assert(set->ctx, mat->n_row == 1 + nparam, goto error);
5672 dim->n_out = nparam;
5673 isl_set_reset_space(set, dim);
5674 set = isl_set_preimage(set, mat);
5677 dim = isl_space_copy(set->dim);
5678 dim = isl_space_cow(dim);
5681 dim->nparam = dim->n_out;
5683 isl_set_reset_space(set, dim);
5686 isl_space_free(dim);
5693 /* Intersect the basic set "bset" with the affine space specified by the
5694 * equalities in "eq".
5696 static struct isl_basic_set *basic_set_append_equalities(
5697 struct isl_basic_set *bset, struct isl_mat *eq)
5705 bset = isl_basic_set_extend_space(bset, isl_space_copy(bset->dim), 0,
5710 len = 1 + isl_space_dim(bset->dim, isl_dim_all) + bset->extra;
5711 for (i = 0; i < eq->n_row; ++i) {
5712 k = isl_basic_set_alloc_equality(bset);
5715 isl_seq_cpy(bset->eq[k], eq->row[i], eq->n_col);
5716 isl_seq_clr(bset->eq[k] + eq->n_col, len - eq->n_col);
5720 bset = isl_basic_set_gauss(bset, NULL);
5721 bset = isl_basic_set_finalize(bset);
5726 isl_basic_set_free(bset);
5730 /* Intersect the set "set" with the affine space specified by the
5731 * equalities in "eq".
5733 static struct isl_set *set_append_equalities(struct isl_set *set,
5741 for (i = 0; i < set->n; ++i) {
5742 set->p[i] = basic_set_append_equalities(set->p[i],
5755 /* Project the given basic set onto its parameter domain, possibly introducing
5756 * new, explicit, existential variables in the constraints.
5757 * The input has parameters and (possibly implicit) existential variables.
5758 * The output has the same parameters, but only
5759 * explicit existentially quantified variables.
5761 * The actual projection is performed by pip, but pip doesn't seem
5762 * to like equalities very much, so we first remove the equalities
5763 * among the parameters by performing a variable compression on
5764 * the parameters. Afterward, an inverse transformation is performed
5765 * and the equalities among the parameters are inserted back in.
5767 static struct isl_set *parameter_compute_divs(struct isl_basic_set *bset)
5771 struct isl_mat *T, *T2;
5772 struct isl_set *set;
5773 unsigned nparam, n_div;
5775 bset = isl_basic_set_cow(bset);
5779 if (bset->n_eq == 0)
5780 return isl_basic_set_lexmin(bset);
5782 isl_basic_set_gauss(bset, NULL);
5784 nparam = isl_basic_set_dim(bset, isl_dim_param);
5785 n_div = isl_basic_set_dim(bset, isl_dim_div);
5787 for (i = 0, j = n_div - 1; i < bset->n_eq && j >= 0; --j) {
5788 if (!isl_int_is_zero(bset->eq[i][1 + nparam + j]))
5791 if (i == bset->n_eq)
5792 return isl_basic_set_lexmin(bset);
5794 eq = isl_mat_sub_alloc6(bset->ctx, bset->eq, i, bset->n_eq - i,
5796 eq = isl_mat_cow(eq);
5797 T = isl_mat_variable_compression(isl_mat_copy(eq), &T2);
5798 if (T && T->n_col == 0) {
5802 bset = isl_basic_set_set_to_empty(bset);
5803 return isl_set_from_basic_set(bset);
5805 bset = basic_set_parameter_preimage(bset, T);
5807 set = isl_basic_set_lexmin(bset);
5808 set = set_parameter_preimage(set, T2);
5809 set = set_append_equalities(set, eq);
5813 /* Compute an explicit representation for all the existentially
5814 * quantified variables.
5815 * The input and output dimensions are first turned into parameters.
5816 * compute_divs then returns a map with the same parameters and
5817 * no input or output dimensions and the dimension specification
5818 * is reset to that of the input.
5820 static struct isl_map *compute_divs(struct isl_basic_map *bmap)
5822 struct isl_basic_set *bset;
5823 struct isl_set *set;
5824 struct isl_map *map;
5825 isl_space *dim, *orig_dim = NULL;
5830 bmap = isl_basic_map_cow(bmap);
5834 nparam = isl_basic_map_dim(bmap, isl_dim_param);
5835 n_in = isl_basic_map_dim(bmap, isl_dim_in);
5836 n_out = isl_basic_map_dim(bmap, isl_dim_out);
5837 dim = isl_space_set_alloc(bmap->ctx, nparam + n_in + n_out, 0);
5841 orig_dim = bmap->dim;
5843 bset = (struct isl_basic_set *)bmap;
5845 set = parameter_compute_divs(bset);
5846 map = (struct isl_map *)set;
5847 map = isl_map_reset_space(map, orig_dim);
5851 isl_basic_map_free(bmap);
5855 int isl_basic_map_divs_known(__isl_keep isl_basic_map *bmap)
5863 off = isl_space_dim(bmap->dim, isl_dim_all);
5864 for (i = 0; i < bmap->n_div; ++i) {
5865 if (isl_int_is_zero(bmap->div[i][0]))
5867 isl_assert(bmap->ctx, isl_int_is_zero(bmap->div[i][1+1+off+i]),
5873 static int map_divs_known(__isl_keep isl_map *map)
5880 for (i = 0; i < map->n; ++i) {
5881 int known = isl_basic_map_divs_known(map->p[i]);
5889 /* If bmap contains any unknown divs, then compute explicit
5890 * expressions for them. However, this computation may be
5891 * quite expensive, so first try to remove divs that aren't
5894 struct isl_map *isl_basic_map_compute_divs(struct isl_basic_map *bmap)
5897 struct isl_map *map;
5899 known = isl_basic_map_divs_known(bmap);
5903 return isl_map_from_basic_map(bmap);
5905 bmap = isl_basic_map_drop_redundant_divs(bmap);
5907 known = isl_basic_map_divs_known(bmap);
5911 return isl_map_from_basic_map(bmap);
5913 map = compute_divs(bmap);
5916 isl_basic_map_free(bmap);
5920 struct isl_map *isl_map_compute_divs(struct isl_map *map)
5924 struct isl_map *res;
5931 known = map_divs_known(map);
5939 res = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[0]));
5940 for (i = 1 ; i < map->n; ++i) {
5942 r2 = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[i]));
5943 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT))
5944 res = isl_map_union_disjoint(res, r2);
5946 res = isl_map_union(res, r2);
5953 struct isl_set *isl_basic_set_compute_divs(struct isl_basic_set *bset)
5955 return (struct isl_set *)
5956 isl_basic_map_compute_divs((struct isl_basic_map *)bset);
5959 struct isl_set *isl_set_compute_divs(struct isl_set *set)
5961 return (struct isl_set *)
5962 isl_map_compute_divs((struct isl_map *)set);
5965 struct isl_set *isl_map_domain(struct isl_map *map)
5968 struct isl_set *set;
5973 map = isl_map_cow(map);
5977 set = (struct isl_set *)map;
5978 set->dim = isl_space_domain(set->dim);
5981 for (i = 0; i < map->n; ++i) {
5982 set->p[i] = isl_basic_map_domain(map->p[i]);
5986 ISL_F_CLR(set, ISL_MAP_DISJOINT);
5987 ISL_F_CLR(set, ISL_SET_NORMALIZED);
5994 static __isl_give isl_map *map_union_disjoint(__isl_take isl_map *map1,
5995 __isl_take isl_map *map2)
5999 struct isl_map *map = NULL;
6013 isl_assert(map1->ctx, isl_space_is_equal(map1->dim, map2->dim), goto error);
6015 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
6016 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
6017 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
6019 map = isl_map_alloc_space(isl_space_copy(map1->dim),
6020 map1->n + map2->n, flags);
6023 for (i = 0; i < map1->n; ++i) {
6024 map = isl_map_add_basic_map(map,
6025 isl_basic_map_copy(map1->p[i]));
6029 for (i = 0; i < map2->n; ++i) {
6030 map = isl_map_add_basic_map(map,
6031 isl_basic_map_copy(map2->p[i]));
6045 __isl_give isl_map *isl_map_union_disjoint(__isl_take isl_map *map1,
6046 __isl_take isl_map *map2)
6048 return isl_map_align_params_map_map_and(map1, map2, &map_union_disjoint);
6051 struct isl_map *isl_map_union(struct isl_map *map1, struct isl_map *map2)
6053 map1 = isl_map_union_disjoint(map1, map2);
6057 ISL_F_CLR(map1, ISL_MAP_DISJOINT);
6061 struct isl_set *isl_set_union_disjoint(
6062 struct isl_set *set1, struct isl_set *set2)
6064 return (struct isl_set *)
6065 isl_map_union_disjoint(
6066 (struct isl_map *)set1, (struct isl_map *)set2);
6069 struct isl_set *isl_set_union(struct isl_set *set1, struct isl_set *set2)
6071 return (struct isl_set *)
6072 isl_map_union((struct isl_map *)set1, (struct isl_map *)set2);
6075 static __isl_give isl_map *map_intersect_range(__isl_take isl_map *map,
6076 __isl_take isl_set *set)
6079 struct isl_map *result;
6085 if (!isl_space_match(map->dim, isl_dim_param, set->dim, isl_dim_param))
6086 isl_die(set->ctx, isl_error_invalid,
6087 "parameters don't match", goto error);
6089 if (isl_space_dim(set->dim, isl_dim_set) != 0 &&
6090 !isl_map_compatible_range(map, set))
6091 isl_die(set->ctx, isl_error_invalid,
6092 "incompatible spaces", goto error);
6094 if (isl_set_plain_is_universe(set)) {
6099 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT) &&
6100 ISL_F_ISSET(set, ISL_MAP_DISJOINT))
6101 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
6103 result = isl_map_alloc_space(isl_space_copy(map->dim),
6104 map->n * set->n, flags);
6107 for (i = 0; i < map->n; ++i)
6108 for (j = 0; j < set->n; ++j) {
6109 result = isl_map_add_basic_map(result,
6110 isl_basic_map_intersect_range(
6111 isl_basic_map_copy(map->p[i]),
6112 isl_basic_set_copy(set->p[j])));
6125 __isl_give isl_map *isl_map_intersect_range(__isl_take isl_map *map,
6126 __isl_take isl_set *set)
6128 return isl_map_align_params_map_map_and(map, set, &map_intersect_range);
6131 struct isl_map *isl_map_intersect_domain(
6132 struct isl_map *map, struct isl_set *set)
6134 return isl_map_reverse(
6135 isl_map_intersect_range(isl_map_reverse(map), set));
6138 static __isl_give isl_map *map_apply_domain(__isl_take isl_map *map1,
6139 __isl_take isl_map *map2)
6143 map1 = isl_map_reverse(map1);
6144 map1 = isl_map_apply_range(map1, map2);
6145 return isl_map_reverse(map1);
6152 __isl_give isl_map *isl_map_apply_domain(__isl_take isl_map *map1,
6153 __isl_take isl_map *map2)
6155 return isl_map_align_params_map_map_and(map1, map2, &map_apply_domain);
6158 static __isl_give isl_map *map_apply_range(__isl_take isl_map *map1,
6159 __isl_take isl_map *map2)
6161 isl_space *dim_result;
6162 struct isl_map *result;
6168 dim_result = isl_space_join(isl_space_copy(map1->dim),
6169 isl_space_copy(map2->dim));
6171 result = isl_map_alloc_space(dim_result, map1->n * map2->n, 0);
6174 for (i = 0; i < map1->n; ++i)
6175 for (j = 0; j < map2->n; ++j) {
6176 result = isl_map_add_basic_map(result,
6177 isl_basic_map_apply_range(
6178 isl_basic_map_copy(map1->p[i]),
6179 isl_basic_map_copy(map2->p[j])));
6185 if (result && result->n <= 1)
6186 ISL_F_SET(result, ISL_MAP_DISJOINT);
6194 __isl_give isl_map *isl_map_apply_range(__isl_take isl_map *map1,
6195 __isl_take isl_map *map2)
6197 return isl_map_align_params_map_map_and(map1, map2, &map_apply_range);
6201 * returns range - domain
6203 struct isl_basic_set *isl_basic_map_deltas(struct isl_basic_map *bmap)
6205 isl_space *dims, *target_dim;
6206 struct isl_basic_set *bset;
6213 isl_assert(bmap->ctx, isl_space_tuple_match(bmap->dim, isl_dim_in,
6214 bmap->dim, isl_dim_out),
6216 target_dim = isl_space_domain(isl_basic_map_get_space(bmap));
6217 dim = isl_basic_map_n_in(bmap);
6218 nparam = isl_basic_map_n_param(bmap);
6219 bset = isl_basic_set_from_basic_map(bmap);
6220 bset = isl_basic_set_cow(bset);
6221 dims = isl_basic_set_get_space(bset);
6222 dims = isl_space_add_dims(dims, isl_dim_set, dim);
6223 bset = isl_basic_set_extend_space(bset, dims, 0, dim, 0);
6224 bset = isl_basic_set_swap_vars(bset, 2*dim);
6225 for (i = 0; i < dim; ++i) {
6226 int j = isl_basic_map_alloc_equality(
6227 (struct isl_basic_map *)bset);
6230 isl_seq_clr(bset->eq[j], 1 + isl_basic_set_total_dim(bset));
6231 isl_int_set_si(bset->eq[j][1+nparam+i], 1);
6232 isl_int_set_si(bset->eq[j][1+nparam+dim+i], 1);
6233 isl_int_set_si(bset->eq[j][1+nparam+2*dim+i], -1);
6235 bset = isl_basic_set_project_out(bset, isl_dim_set, dim, 2*dim);
6236 bset = isl_basic_set_reset_space(bset, target_dim);
6239 isl_basic_map_free(bmap);
6244 * returns range - domain
6246 struct isl_set *isl_map_deltas(struct isl_map *map)
6250 struct isl_set *result;
6255 isl_assert(map->ctx, isl_space_tuple_match(map->dim, isl_dim_in,
6256 map->dim, isl_dim_out),
6258 dim = isl_map_get_space(map);
6259 dim = isl_space_domain(dim);
6260 result = isl_set_alloc_space(dim, map->n, 0);
6263 for (i = 0; i < map->n; ++i)
6264 result = isl_set_add_basic_set(result,
6265 isl_basic_map_deltas(isl_basic_map_copy(map->p[i])));
6274 * returns [domain -> range] -> range - domain
6276 __isl_give isl_basic_map *isl_basic_map_deltas_map(
6277 __isl_take isl_basic_map *bmap)
6281 isl_basic_map *domain;
6285 if (!isl_space_tuple_match(bmap->dim, isl_dim_in, bmap->dim, isl_dim_out))
6286 isl_die(bmap->ctx, isl_error_invalid,
6287 "domain and range don't match", goto error);
6289 nparam = isl_basic_map_dim(bmap, isl_dim_param);
6290 n = isl_basic_map_dim(bmap, isl_dim_in);
6292 dim = isl_space_from_range(isl_space_domain(isl_basic_map_get_space(bmap)));
6293 domain = isl_basic_map_universe(dim);
6295 bmap = isl_basic_map_from_domain(isl_basic_map_wrap(bmap));
6296 bmap = isl_basic_map_apply_range(bmap, domain);
6297 bmap = isl_basic_map_extend_constraints(bmap, n, 0);
6299 total = isl_basic_map_total_dim(bmap);
6301 for (i = 0; i < n; ++i) {
6302 k = isl_basic_map_alloc_equality(bmap);
6305 isl_seq_clr(bmap->eq[k], 1 + total);
6306 isl_int_set_si(bmap->eq[k][1 + nparam + i], 1);
6307 isl_int_set_si(bmap->eq[k][1 + nparam + n + i], -1);
6308 isl_int_set_si(bmap->eq[k][1 + nparam + n + n + i], 1);
6311 bmap = isl_basic_map_gauss(bmap, NULL);
6312 return isl_basic_map_finalize(bmap);
6314 isl_basic_map_free(bmap);
6319 * returns [domain -> range] -> range - domain
6321 __isl_give isl_map *isl_map_deltas_map(__isl_take isl_map *map)
6324 isl_space *domain_dim;
6329 if (!isl_space_tuple_match(map->dim, isl_dim_in, map->dim, isl_dim_out))
6330 isl_die(map->ctx, isl_error_invalid,
6331 "domain and range don't match", goto error);
6333 map = isl_map_cow(map);
6337 domain_dim = isl_space_from_range(isl_space_domain(isl_map_get_space(map)));
6338 map->dim = isl_space_from_domain(isl_space_wrap(map->dim));
6339 map->dim = isl_space_join(map->dim, domain_dim);
6342 for (i = 0; i < map->n; ++i) {
6343 map->p[i] = isl_basic_map_deltas_map(map->p[i]);
6347 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
6354 __isl_give struct isl_basic_map *basic_map_identity(__isl_take isl_space *dims)
6356 struct isl_basic_map *bmap;
6364 nparam = dims->nparam;
6366 bmap = isl_basic_map_alloc_space(dims, 0, dim, 0);
6370 for (i = 0; i < dim; ++i) {
6371 int j = isl_basic_map_alloc_equality(bmap);
6374 isl_seq_clr(bmap->eq[j], 1 + isl_basic_map_total_dim(bmap));
6375 isl_int_set_si(bmap->eq[j][1+nparam+i], 1);
6376 isl_int_set_si(bmap->eq[j][1+nparam+dim+i], -1);
6378 return isl_basic_map_finalize(bmap);
6380 isl_basic_map_free(bmap);
6384 __isl_give isl_basic_map *isl_basic_map_identity(__isl_take isl_space *dim)
6388 if (dim->n_in != dim->n_out)
6389 isl_die(dim->ctx, isl_error_invalid,
6390 "number of input and output dimensions needs to be "
6391 "the same", goto error);
6392 return basic_map_identity(dim);
6394 isl_space_free(dim);
6398 struct isl_basic_map *isl_basic_map_identity_like(struct isl_basic_map *model)
6400 if (!model || !model->dim)
6402 return isl_basic_map_identity(isl_space_copy(model->dim));
6405 __isl_give isl_map *isl_map_identity(__isl_take isl_space *dim)
6407 return isl_map_from_basic_map(isl_basic_map_identity(dim));
6410 struct isl_map *isl_map_identity_like(struct isl_map *model)
6412 if (!model || !model->dim)
6414 return isl_map_identity(isl_space_copy(model->dim));
6417 struct isl_map *isl_map_identity_like_basic_map(struct isl_basic_map *model)
6419 if (!model || !model->dim)
6421 return isl_map_identity(isl_space_copy(model->dim));
6424 __isl_give isl_map *isl_set_identity(__isl_take isl_set *set)
6426 isl_space *dim = isl_set_get_space(set);
6428 id = isl_map_identity(isl_space_map_from_set(dim));
6429 return isl_map_intersect_range(id, set);
6432 /* Construct a basic set with all set dimensions having only non-negative
6435 __isl_give isl_basic_set *isl_basic_set_positive_orthant(
6436 __isl_take isl_space *space)
6441 struct isl_basic_set *bset;
6445 nparam = space->nparam;
6447 bset = isl_basic_set_alloc_space(space, 0, 0, dim);
6450 for (i = 0; i < dim; ++i) {
6451 int k = isl_basic_set_alloc_inequality(bset);
6454 isl_seq_clr(bset->ineq[k], 1 + isl_basic_set_total_dim(bset));
6455 isl_int_set_si(bset->ineq[k][1 + nparam + i], 1);
6459 isl_basic_set_free(bset);
6463 /* Construct the half-space x_pos >= 0.
6465 static __isl_give isl_basic_set *nonneg_halfspace(__isl_take isl_space *dim,
6469 isl_basic_set *nonneg;
6471 nonneg = isl_basic_set_alloc_space(dim, 0, 0, 1);
6472 k = isl_basic_set_alloc_inequality(nonneg);
6475 isl_seq_clr(nonneg->ineq[k], 1 + isl_basic_set_total_dim(nonneg));
6476 isl_int_set_si(nonneg->ineq[k][pos], 1);
6478 return isl_basic_set_finalize(nonneg);
6480 isl_basic_set_free(nonneg);
6484 /* Construct the half-space x_pos <= -1.
6486 static __isl_give isl_basic_set *neg_halfspace(__isl_take isl_space *dim, int pos)
6491 neg = isl_basic_set_alloc_space(dim, 0, 0, 1);
6492 k = isl_basic_set_alloc_inequality(neg);
6495 isl_seq_clr(neg->ineq[k], 1 + isl_basic_set_total_dim(neg));
6496 isl_int_set_si(neg->ineq[k][0], -1);
6497 isl_int_set_si(neg->ineq[k][pos], -1);
6499 return isl_basic_set_finalize(neg);
6501 isl_basic_set_free(neg);
6505 __isl_give isl_set *isl_set_split_dims(__isl_take isl_set *set,
6506 enum isl_dim_type type, unsigned first, unsigned n)
6509 isl_basic_set *nonneg;
6517 isl_assert(set->ctx, first + n <= isl_set_dim(set, type), goto error);
6519 for (i = 0; i < n; ++i) {
6520 nonneg = nonneg_halfspace(isl_set_get_space(set),
6521 pos(set->dim, type) + first + i);
6522 neg = neg_halfspace(isl_set_get_space(set),
6523 pos(set->dim, type) + first + i);
6525 set = isl_set_intersect(set, isl_basic_set_union(nonneg, neg));
6534 static int foreach_orthant(__isl_take isl_set *set, int *signs, int first,
6535 int len, int (*fn)(__isl_take isl_set *orthant, int *signs, void *user),
6542 if (isl_set_plain_is_empty(set)) {
6547 return fn(set, signs, user);
6550 half = isl_set_from_basic_set(nonneg_halfspace(isl_set_get_space(set),
6552 half = isl_set_intersect(half, isl_set_copy(set));
6553 if (foreach_orthant(half, signs, first + 1, len, fn, user) < 0)
6557 half = isl_set_from_basic_set(neg_halfspace(isl_set_get_space(set),
6559 half = isl_set_intersect(half, set);
6560 return foreach_orthant(half, signs, first + 1, len, fn, user);
6566 /* Call "fn" on the intersections of "set" with each of the orthants
6567 * (except for obviously empty intersections). The orthant is identified
6568 * by the signs array, with each entry having value 1 or -1 according
6569 * to the sign of the corresponding variable.
6571 int isl_set_foreach_orthant(__isl_keep isl_set *set,
6572 int (*fn)(__isl_take isl_set *orthant, int *signs, void *user),
6582 if (isl_set_plain_is_empty(set))
6585 nparam = isl_set_dim(set, isl_dim_param);
6586 nvar = isl_set_dim(set, isl_dim_set);
6588 signs = isl_alloc_array(set->ctx, int, nparam + nvar);
6590 r = foreach_orthant(isl_set_copy(set), signs, 0, nparam + nvar,
6598 int isl_set_is_equal(struct isl_set *set1, struct isl_set *set2)
6600 return isl_map_is_equal((struct isl_map *)set1, (struct isl_map *)set2);
6603 int isl_basic_map_is_subset(
6604 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
6607 struct isl_map *map1;
6608 struct isl_map *map2;
6610 if (!bmap1 || !bmap2)
6613 map1 = isl_map_from_basic_map(isl_basic_map_copy(bmap1));
6614 map2 = isl_map_from_basic_map(isl_basic_map_copy(bmap2));
6616 is_subset = isl_map_is_subset(map1, map2);
6624 int isl_basic_map_is_equal(
6625 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
6629 if (!bmap1 || !bmap2)
6631 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
6634 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
6638 int isl_basic_set_is_equal(
6639 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
6641 return isl_basic_map_is_equal(
6642 (struct isl_basic_map *)bset1, (struct isl_basic_map *)bset2);
6645 int isl_map_is_empty(struct isl_map *map)
6652 for (i = 0; i < map->n; ++i) {
6653 is_empty = isl_basic_map_is_empty(map->p[i]);
6662 int isl_map_plain_is_empty(__isl_keep isl_map *map)
6664 return map ? map->n == 0 : -1;
6667 int isl_map_fast_is_empty(__isl_keep isl_map *map)
6669 return isl_map_plain_is_empty(map);
6672 int isl_set_plain_is_empty(struct isl_set *set)
6674 return set ? set->n == 0 : -1;
6677 int isl_set_fast_is_empty(__isl_keep isl_set *set)
6679 return isl_set_plain_is_empty(set);
6682 int isl_set_is_empty(struct isl_set *set)
6684 return isl_map_is_empty((struct isl_map *)set);
6687 int isl_map_has_equal_space(__isl_keep isl_map *map1, __isl_keep isl_map *map2)
6692 return isl_space_is_equal(map1->dim, map2->dim);
6695 int isl_set_has_equal_space(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
6700 return isl_space_is_equal(set1->dim, set2->dim);
6703 static int map_is_equal(__isl_keep isl_map *map1, __isl_keep isl_map *map2)
6709 is_subset = isl_map_is_subset(map1, map2);
6712 is_subset = isl_map_is_subset(map2, map1);
6716 int isl_map_is_equal(__isl_keep isl_map *map1, __isl_keep isl_map *map2)
6718 return align_params_map_map_and_test(map1, map2, &map_is_equal);
6721 int isl_basic_map_is_strict_subset(
6722 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
6726 if (!bmap1 || !bmap2)
6728 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
6731 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
6732 if (is_subset == -1)
6737 int isl_map_is_strict_subset(struct isl_map *map1, struct isl_map *map2)
6743 is_subset = isl_map_is_subset(map1, map2);
6746 is_subset = isl_map_is_subset(map2, map1);
6747 if (is_subset == -1)
6752 int isl_set_is_strict_subset(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
6754 return isl_map_is_strict_subset((isl_map *)set1, (isl_map *)set2);
6757 int isl_basic_map_is_universe(struct isl_basic_map *bmap)
6761 return bmap->n_eq == 0 && bmap->n_ineq == 0;
6764 int isl_basic_set_is_universe(struct isl_basic_set *bset)
6768 return bset->n_eq == 0 && bset->n_ineq == 0;
6771 int isl_map_plain_is_universe(__isl_keep isl_map *map)
6778 for (i = 0; i < map->n; ++i) {
6779 int r = isl_basic_map_is_universe(map->p[i]);
6787 int isl_set_plain_is_universe(__isl_keep isl_set *set)
6789 return isl_map_plain_is_universe((isl_map *) set);
6792 int isl_set_fast_is_universe(__isl_keep isl_set *set)
6794 return isl_set_plain_is_universe(set);
6797 int isl_basic_map_is_empty(struct isl_basic_map *bmap)
6799 struct isl_basic_set *bset = NULL;
6800 struct isl_vec *sample = NULL;
6807 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY))
6810 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL)) {
6811 struct isl_basic_map *copy = isl_basic_map_copy(bmap);
6812 copy = isl_basic_map_remove_redundancies(copy);
6813 empty = ISL_F_ISSET(copy, ISL_BASIC_MAP_EMPTY);
6814 isl_basic_map_free(copy);
6818 total = 1 + isl_basic_map_total_dim(bmap);
6819 if (bmap->sample && bmap->sample->size == total) {
6820 int contains = isl_basic_map_contains(bmap, bmap->sample);
6826 isl_vec_free(bmap->sample);
6827 bmap->sample = NULL;
6828 bset = isl_basic_map_underlying_set(isl_basic_map_copy(bmap));
6831 sample = isl_basic_set_sample_vec(bset);
6834 empty = sample->size == 0;
6835 isl_vec_free(bmap->sample);
6836 bmap->sample = sample;
6838 ISL_F_SET(bmap, ISL_BASIC_MAP_EMPTY);
6843 int isl_basic_map_plain_is_empty(__isl_keep isl_basic_map *bmap)
6847 return ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY);
6850 int isl_basic_map_fast_is_empty(__isl_keep isl_basic_map *bmap)
6852 return isl_basic_map_plain_is_empty(bmap);
6855 int isl_basic_set_plain_is_empty(__isl_keep isl_basic_set *bset)
6859 return ISL_F_ISSET(bset, ISL_BASIC_SET_EMPTY);
6862 int isl_basic_set_fast_is_empty(__isl_keep isl_basic_set *bset)
6864 return isl_basic_set_plain_is_empty(bset);
6867 int isl_basic_set_is_empty(struct isl_basic_set *bset)
6869 return isl_basic_map_is_empty((struct isl_basic_map *)bset);
6872 struct isl_map *isl_basic_map_union(
6873 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
6875 struct isl_map *map;
6876 if (!bmap1 || !bmap2)
6879 isl_assert(bmap1->ctx, isl_space_is_equal(bmap1->dim, bmap2->dim), goto error);
6881 map = isl_map_alloc_space(isl_space_copy(bmap1->dim), 2, 0);
6884 map = isl_map_add_basic_map(map, bmap1);
6885 map = isl_map_add_basic_map(map, bmap2);
6888 isl_basic_map_free(bmap1);
6889 isl_basic_map_free(bmap2);
6893 struct isl_set *isl_basic_set_union(
6894 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
6896 return (struct isl_set *)isl_basic_map_union(
6897 (struct isl_basic_map *)bset1,
6898 (struct isl_basic_map *)bset2);
6901 /* Order divs such that any div only depends on previous divs */
6902 struct isl_basic_map *isl_basic_map_order_divs(struct isl_basic_map *bmap)
6910 off = isl_space_dim(bmap->dim, isl_dim_all);
6912 for (i = 0; i < bmap->n_div; ++i) {
6914 if (isl_int_is_zero(bmap->div[i][0]))
6916 pos = isl_seq_first_non_zero(bmap->div[i]+1+1+off+i,
6920 isl_basic_map_swap_div(bmap, i, i + pos);
6926 struct isl_basic_set *isl_basic_set_order_divs(struct isl_basic_set *bset)
6928 return (struct isl_basic_set *)
6929 isl_basic_map_order_divs((struct isl_basic_map *)bset);
6932 __isl_give isl_map *isl_map_order_divs(__isl_take isl_map *map)
6939 for (i = 0; i < map->n; ++i) {
6940 map->p[i] = isl_basic_map_order_divs(map->p[i]);
6951 /* Apply the expansion computed by isl_merge_divs.
6952 * The expansion itself is given by "exp" while the resulting
6953 * list of divs is given by "div".
6955 __isl_give isl_basic_set *isl_basic_set_expand_divs(
6956 __isl_take isl_basic_set *bset, __isl_take isl_mat *div, int *exp)
6961 bset = isl_basic_set_cow(bset);
6965 if (div->n_row < bset->n_div)
6966 isl_die(isl_mat_get_ctx(div), isl_error_invalid,
6967 "not an expansion", goto error);
6969 bset = isl_basic_map_extend_space(bset, isl_space_copy(bset->dim),
6970 div->n_row - bset->n_div, 0,
6971 2 * (div->n_row - bset->n_div));
6973 n_div = bset->n_div;
6974 for (i = n_div; i < div->n_row; ++i)
6975 if (isl_basic_set_alloc_div(bset) < 0)
6979 for (i = div->n_row - 1; i >= 0; --i) {
6980 if (j >= 0 && exp[j] == i) {
6982 isl_basic_map_swap_div(bset, i, j);
6985 isl_seq_cpy(bset->div[i], div->row[i], div->n_col);
6986 if (isl_basic_map_add_div_constraints(bset, i) < 0)
6994 isl_basic_set_free(bset);
6999 /* Look for a div in dst that corresponds to the div "div" in src.
7000 * The divs before "div" in src and dst are assumed to be the same.
7002 * Returns -1 if no corresponding div was found and the position
7003 * of the corresponding div in dst otherwise.
7005 static int find_div(struct isl_basic_map *dst,
7006 struct isl_basic_map *src, unsigned div)
7010 unsigned total = isl_space_dim(src->dim, isl_dim_all);
7012 isl_assert(dst->ctx, div <= dst->n_div, return -1);
7013 for (i = div; i < dst->n_div; ++i)
7014 if (isl_seq_eq(dst->div[i], src->div[div], 1+1+total+div) &&
7015 isl_seq_first_non_zero(dst->div[i]+1+1+total+div,
7016 dst->n_div - div) == -1)
7021 struct isl_basic_map *isl_basic_map_align_divs(
7022 struct isl_basic_map *dst, struct isl_basic_map *src)
7025 unsigned total = isl_space_dim(src->dim, isl_dim_all);
7030 if (src->n_div == 0)
7033 for (i = 0; i < src->n_div; ++i)
7034 isl_assert(src->ctx, !isl_int_is_zero(src->div[i][0]), goto error);
7036 src = isl_basic_map_order_divs(src);
7037 dst = isl_basic_map_cow(dst);
7038 dst = isl_basic_map_extend_space(dst, isl_space_copy(dst->dim),
7039 src->n_div, 0, 2 * src->n_div);
7042 for (i = 0; i < src->n_div; ++i) {
7043 int j = find_div(dst, src, i);
7045 j = isl_basic_map_alloc_div(dst);
7048 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total+i);
7049 isl_seq_clr(dst->div[j]+1+1+total+i, dst->n_div - i);
7050 if (isl_basic_map_add_div_constraints(dst, j) < 0)
7054 isl_basic_map_swap_div(dst, i, j);
7058 isl_basic_map_free(dst);
7062 struct isl_basic_set *isl_basic_set_align_divs(
7063 struct isl_basic_set *dst, struct isl_basic_set *src)
7065 return (struct isl_basic_set *)isl_basic_map_align_divs(
7066 (struct isl_basic_map *)dst, (struct isl_basic_map *)src);
7069 struct isl_map *isl_map_align_divs(struct isl_map *map)
7077 map = isl_map_compute_divs(map);
7078 map = isl_map_cow(map);
7082 for (i = 1; i < map->n; ++i)
7083 map->p[0] = isl_basic_map_align_divs(map->p[0], map->p[i]);
7084 for (i = 1; i < map->n; ++i)
7085 map->p[i] = isl_basic_map_align_divs(map->p[i], map->p[0]);
7087 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
7091 struct isl_set *isl_set_align_divs(struct isl_set *set)
7093 return (struct isl_set *)isl_map_align_divs((struct isl_map *)set);
7096 static __isl_give isl_set *set_apply( __isl_take isl_set *set,
7097 __isl_take isl_map *map)
7101 isl_assert(set->ctx, isl_map_compatible_domain(map, set), goto error);
7102 map = isl_map_intersect_domain(map, set);
7103 set = isl_map_range(map);
7111 __isl_give isl_set *isl_set_apply( __isl_take isl_set *set,
7112 __isl_take isl_map *map)
7114 return isl_map_align_params_map_map_and(set, map, &set_apply);
7117 /* There is no need to cow as removing empty parts doesn't change
7118 * the meaning of the set.
7120 struct isl_map *isl_map_remove_empty_parts(struct isl_map *map)
7127 for (i = map->n-1; i >= 0; --i) {
7128 if (!ISL_F_ISSET(map->p[i], ISL_BASIC_MAP_EMPTY))
7130 isl_basic_map_free(map->p[i]);
7131 if (i != map->n-1) {
7132 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
7133 map->p[i] = map->p[map->n-1];
7141 struct isl_set *isl_set_remove_empty_parts(struct isl_set *set)
7143 return (struct isl_set *)
7144 isl_map_remove_empty_parts((struct isl_map *)set);
7147 struct isl_basic_map *isl_map_copy_basic_map(struct isl_map *map)
7149 struct isl_basic_map *bmap;
7150 if (!map || map->n == 0)
7152 bmap = map->p[map->n-1];
7153 isl_assert(map->ctx, ISL_F_ISSET(bmap, ISL_BASIC_SET_FINAL), return NULL);
7154 return isl_basic_map_copy(bmap);
7157 struct isl_basic_set *isl_set_copy_basic_set(struct isl_set *set)
7159 return (struct isl_basic_set *)
7160 isl_map_copy_basic_map((struct isl_map *)set);
7163 __isl_give isl_map *isl_map_drop_basic_map(__isl_take isl_map *map,
7164 __isl_keep isl_basic_map *bmap)
7170 for (i = map->n-1; i >= 0; --i) {
7171 if (map->p[i] != bmap)
7173 map = isl_map_cow(map);
7176 isl_basic_map_free(map->p[i]);
7177 if (i != map->n-1) {
7178 ISL_F_CLR(map, ISL_SET_NORMALIZED);
7179 map->p[i] = map->p[map->n-1];
7190 struct isl_set *isl_set_drop_basic_set(struct isl_set *set,
7191 struct isl_basic_set *bset)
7193 return (struct isl_set *)isl_map_drop_basic_map((struct isl_map *)set,
7194 (struct isl_basic_map *)bset);
7197 /* Given two basic sets bset1 and bset2, compute the maximal difference
7198 * between the values of dimension pos in bset1 and those in bset2
7199 * for any common value of the parameters and dimensions preceding pos.
7201 static enum isl_lp_result basic_set_maximal_difference_at(
7202 __isl_keep isl_basic_set *bset1, __isl_keep isl_basic_set *bset2,
7203 int pos, isl_int *opt)
7206 struct isl_basic_map *bmap1 = NULL;
7207 struct isl_basic_map *bmap2 = NULL;
7208 struct isl_ctx *ctx;
7209 struct isl_vec *obj;
7212 unsigned dim1, dim2;
7213 enum isl_lp_result res;
7215 if (!bset1 || !bset2)
7216 return isl_lp_error;
7218 nparam = isl_basic_set_n_param(bset1);
7219 dim1 = isl_basic_set_n_dim(bset1);
7220 dim2 = isl_basic_set_n_dim(bset2);
7221 dims = isl_space_alloc(bset1->ctx, nparam, pos, dim1 - pos);
7222 bmap1 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset1), dims);
7223 dims = isl_space_alloc(bset2->ctx, nparam, pos, dim2 - pos);
7224 bmap2 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset2), dims);
7225 if (!bmap1 || !bmap2)
7227 bmap1 = isl_basic_map_cow(bmap1);
7228 bmap1 = isl_basic_map_extend(bmap1, nparam,
7229 pos, (dim1 - pos) + (dim2 - pos),
7230 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
7231 bmap1 = add_constraints(bmap1, bmap2, 0, dim1 - pos);
7234 total = isl_basic_map_total_dim(bmap1);
7236 obj = isl_vec_alloc(ctx, 1 + total);
7237 isl_seq_clr(obj->block.data, 1 + total);
7238 isl_int_set_si(obj->block.data[1+nparam+pos], 1);
7239 isl_int_set_si(obj->block.data[1+nparam+pos+(dim1-pos)], -1);
7242 res = isl_basic_map_solve_lp(bmap1, 1, obj->block.data, ctx->one,
7244 isl_basic_map_free(bmap1);
7248 isl_basic_map_free(bmap1);
7249 isl_basic_map_free(bmap2);
7250 return isl_lp_error;
7253 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
7254 * for any common value of the parameters and dimensions preceding pos
7255 * in both basic sets, the values of dimension pos in bset1 are
7256 * smaller or larger than those in bset2.
7259 * 1 if bset1 follows bset2
7260 * -1 if bset1 precedes bset2
7261 * 0 if bset1 and bset2 are incomparable
7262 * -2 if some error occurred.
7264 int isl_basic_set_compare_at(struct isl_basic_set *bset1,
7265 struct isl_basic_set *bset2, int pos)
7268 enum isl_lp_result res;
7273 res = basic_set_maximal_difference_at(bset1, bset2, pos, &opt);
7275 if (res == isl_lp_empty)
7277 else if ((res == isl_lp_ok && isl_int_is_pos(opt)) ||
7278 res == isl_lp_unbounded)
7280 else if (res == isl_lp_ok && isl_int_is_neg(opt))
7289 /* Given two basic sets bset1 and bset2, check whether
7290 * for any common value of the parameters and dimensions preceding pos
7291 * there is a value of dimension pos in bset1 that is larger
7292 * than a value of the same dimension in bset2.
7295 * 1 if there exists such a pair
7296 * 0 if there is no such pair, but there is a pair of equal values
7298 * -2 if some error occurred.
7300 int isl_basic_set_follows_at(__isl_keep isl_basic_set *bset1,
7301 __isl_keep isl_basic_set *bset2, int pos)
7304 enum isl_lp_result res;
7309 res = basic_set_maximal_difference_at(bset1, bset2, pos, &opt);
7311 if (res == isl_lp_empty)
7313 else if ((res == isl_lp_ok && isl_int_is_pos(opt)) ||
7314 res == isl_lp_unbounded)
7316 else if (res == isl_lp_ok && isl_int_is_neg(opt))
7318 else if (res == isl_lp_ok)
7327 /* Given two sets set1 and set2, check whether
7328 * for any common value of the parameters and dimensions preceding pos
7329 * there is a value of dimension pos in set1 that is larger
7330 * than a value of the same dimension in set2.
7333 * 1 if there exists such a pair
7334 * 0 if there is no such pair, but there is a pair of equal values
7336 * -2 if some error occurred.
7338 int isl_set_follows_at(__isl_keep isl_set *set1,
7339 __isl_keep isl_set *set2, int pos)
7347 for (i = 0; i < set1->n; ++i)
7348 for (j = 0; j < set2->n; ++j) {
7350 f = isl_basic_set_follows_at(set1->p[i], set2->p[j], pos);
7351 if (f == 1 || f == -2)
7360 static int isl_basic_map_plain_has_fixed_var(__isl_keep isl_basic_map *bmap,
7361 unsigned pos, isl_int *val)
7369 total = isl_basic_map_total_dim(bmap);
7370 for (i = 0, d = total-1; i < bmap->n_eq && d+1 > pos; ++i) {
7371 for (; d+1 > pos; --d)
7372 if (!isl_int_is_zero(bmap->eq[i][1+d]))
7376 if (isl_seq_first_non_zero(bmap->eq[i]+1, d) != -1)
7378 if (isl_seq_first_non_zero(bmap->eq[i]+1+d+1, total-d-1) != -1)
7380 if (!isl_int_is_one(bmap->eq[i][1+d]))
7383 isl_int_neg(*val, bmap->eq[i][0]);
7389 static int isl_map_plain_has_fixed_var(__isl_keep isl_map *map,
7390 unsigned pos, isl_int *val)
7402 return isl_basic_map_plain_has_fixed_var(map->p[0], pos, val);
7405 fixed = isl_basic_map_plain_has_fixed_var(map->p[0], pos, &v);
7406 for (i = 1; fixed == 1 && i < map->n; ++i) {
7407 fixed = isl_basic_map_plain_has_fixed_var(map->p[i], pos, &tmp);
7408 if (fixed == 1 && isl_int_ne(tmp, v))
7412 isl_int_set(*val, v);
7418 static int isl_basic_set_plain_has_fixed_var(__isl_keep isl_basic_set *bset,
7419 unsigned pos, isl_int *val)
7421 return isl_basic_map_plain_has_fixed_var((struct isl_basic_map *)bset,
7425 static int isl_set_plain_has_fixed_var(__isl_keep isl_set *set, unsigned pos,
7428 return isl_map_plain_has_fixed_var((struct isl_map *)set, pos, val);
7431 int isl_basic_map_plain_is_fixed(__isl_keep isl_basic_map *bmap,
7432 enum isl_dim_type type, unsigned pos, isl_int *val)
7434 if (pos >= isl_basic_map_dim(bmap, type))
7436 return isl_basic_map_plain_has_fixed_var(bmap,
7437 isl_basic_map_offset(bmap, type) - 1 + pos, val);
7440 int isl_map_plain_is_fixed(__isl_keep isl_map *map,
7441 enum isl_dim_type type, unsigned pos, isl_int *val)
7443 if (pos >= isl_map_dim(map, type))
7445 return isl_map_plain_has_fixed_var(map,
7446 map_offset(map, type) - 1 + pos, val);
7449 int isl_set_plain_is_fixed(__isl_keep isl_set *set,
7450 enum isl_dim_type type, unsigned pos, isl_int *val)
7452 return isl_map_plain_is_fixed(set, type, pos, val);
7455 int isl_map_fast_is_fixed(__isl_keep isl_map *map,
7456 enum isl_dim_type type, unsigned pos, isl_int *val)
7458 return isl_map_plain_is_fixed(map, type, pos, val);
7461 /* Check if dimension dim has fixed value and if so and if val is not NULL,
7462 * then return this fixed value in *val.
7464 int isl_basic_set_plain_dim_is_fixed(__isl_keep isl_basic_set *bset,
7465 unsigned dim, isl_int *val)
7467 return isl_basic_set_plain_has_fixed_var(bset,
7468 isl_basic_set_n_param(bset) + dim, val);
7471 /* Check if dimension dim has fixed value and if so and if val is not NULL,
7472 * then return this fixed value in *val.
7474 int isl_set_plain_dim_is_fixed(__isl_keep isl_set *set,
7475 unsigned dim, isl_int *val)
7477 return isl_set_plain_has_fixed_var(set, isl_set_n_param(set) + dim, val);
7480 int isl_set_fast_dim_is_fixed(__isl_keep isl_set *set,
7481 unsigned dim, isl_int *val)
7483 return isl_set_plain_dim_is_fixed(set, dim, val);
7486 /* Check if input variable in has fixed value and if so and if val is not NULL,
7487 * then return this fixed value in *val.
7489 int isl_map_plain_input_is_fixed(__isl_keep isl_map *map,
7490 unsigned in, isl_int *val)
7492 return isl_map_plain_has_fixed_var(map, isl_map_n_param(map) + in, val);
7495 /* Check if dimension dim has an (obvious) fixed lower bound and if so
7496 * and if val is not NULL, then return this lower bound in *val.
7498 int isl_basic_set_plain_dim_has_fixed_lower_bound(
7499 __isl_keep isl_basic_set *bset, unsigned dim, isl_int *val)
7501 int i, i_eq = -1, i_ineq = -1;
7508 total = isl_basic_set_total_dim(bset);
7509 nparam = isl_basic_set_n_param(bset);
7510 for (i = 0; i < bset->n_eq; ++i) {
7511 if (isl_int_is_zero(bset->eq[i][1+nparam+dim]))
7517 for (i = 0; i < bset->n_ineq; ++i) {
7518 if (!isl_int_is_pos(bset->ineq[i][1+nparam+dim]))
7520 if (i_eq != -1 || i_ineq != -1)
7524 if (i_eq == -1 && i_ineq == -1)
7526 c = i_eq != -1 ? bset->eq[i_eq] : bset->ineq[i_ineq];
7527 /* The coefficient should always be one due to normalization. */
7528 if (!isl_int_is_one(c[1+nparam+dim]))
7530 if (isl_seq_first_non_zero(c+1, nparam+dim) != -1)
7532 if (isl_seq_first_non_zero(c+1+nparam+dim+1,
7533 total - nparam - dim - 1) != -1)
7536 isl_int_neg(*val, c[0]);
7540 int isl_set_plain_dim_has_fixed_lower_bound(__isl_keep isl_set *set,
7541 unsigned dim, isl_int *val)
7553 return isl_basic_set_plain_dim_has_fixed_lower_bound(set->p[0],
7557 fixed = isl_basic_set_plain_dim_has_fixed_lower_bound(set->p[0],
7559 for (i = 1; fixed == 1 && i < set->n; ++i) {
7560 fixed = isl_basic_set_plain_dim_has_fixed_lower_bound(set->p[i],
7562 if (fixed == 1 && isl_int_ne(tmp, v))
7566 isl_int_set(*val, v);
7577 /* uset_gist depends on constraints without existentially quantified
7578 * variables sorting first.
7580 static int qsort_constraint_cmp(const void *p1, const void *p2)
7582 const struct constraint *c1 = (const struct constraint *)p1;
7583 const struct constraint *c2 = (const struct constraint *)p2;
7585 unsigned size = isl_min(c1->size, c2->size);
7587 l1 = isl_seq_last_non_zero(c1->c, size);
7588 l2 = isl_seq_last_non_zero(c2->c, size);
7593 return isl_seq_cmp(c1->c, c2->c, size);
7596 static struct isl_basic_map *isl_basic_map_sort_constraints(
7597 struct isl_basic_map *bmap)
7600 struct constraint *c;
7605 total = isl_basic_map_total_dim(bmap);
7606 c = isl_alloc_array(bmap->ctx, struct constraint, bmap->n_ineq);
7609 for (i = 0; i < bmap->n_ineq; ++i) {
7611 c[i].c = bmap->ineq[i];
7613 qsort(c, bmap->n_ineq, sizeof(struct constraint), qsort_constraint_cmp);
7614 for (i = 0; i < bmap->n_ineq; ++i)
7615 bmap->ineq[i] = c[i].c;
7619 isl_basic_map_free(bmap);
7623 __isl_give isl_basic_set *isl_basic_set_sort_constraints(
7624 __isl_take isl_basic_set *bset)
7626 return (struct isl_basic_set *)isl_basic_map_sort_constraints(
7627 (struct isl_basic_map *)bset);
7630 struct isl_basic_map *isl_basic_map_normalize(struct isl_basic_map *bmap)
7634 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_NORMALIZED))
7636 bmap = isl_basic_map_remove_redundancies(bmap);
7637 bmap = isl_basic_map_sort_constraints(bmap);
7638 ISL_F_SET(bmap, ISL_BASIC_MAP_NORMALIZED);
7642 struct isl_basic_set *isl_basic_set_normalize(struct isl_basic_set *bset)
7644 return (struct isl_basic_set *)isl_basic_map_normalize(
7645 (struct isl_basic_map *)bset);
7648 int isl_basic_map_plain_cmp(const __isl_keep isl_basic_map *bmap1,
7649 const __isl_keep isl_basic_map *bmap2)
7656 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_RATIONAL) !=
7657 ISL_F_ISSET(bmap2, ISL_BASIC_MAP_RATIONAL))
7658 return ISL_F_ISSET(bmap1, ISL_BASIC_MAP_RATIONAL) ? -1 : 1;
7659 if (isl_basic_map_n_param(bmap1) != isl_basic_map_n_param(bmap2))
7660 return isl_basic_map_n_param(bmap1) - isl_basic_map_n_param(bmap2);
7661 if (isl_basic_map_n_in(bmap1) != isl_basic_map_n_in(bmap2))
7662 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
7663 if (isl_basic_map_n_out(bmap1) != isl_basic_map_n_out(bmap2))
7664 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
7665 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY) &&
7666 ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
7668 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY))
7670 if (ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
7672 if (bmap1->n_eq != bmap2->n_eq)
7673 return bmap1->n_eq - bmap2->n_eq;
7674 if (bmap1->n_ineq != bmap2->n_ineq)
7675 return bmap1->n_ineq - bmap2->n_ineq;
7676 if (bmap1->n_div != bmap2->n_div)
7677 return bmap1->n_div - bmap2->n_div;
7678 total = isl_basic_map_total_dim(bmap1);
7679 for (i = 0; i < bmap1->n_eq; ++i) {
7680 cmp = isl_seq_cmp(bmap1->eq[i], bmap2->eq[i], 1+total);
7684 for (i = 0; i < bmap1->n_ineq; ++i) {
7685 cmp = isl_seq_cmp(bmap1->ineq[i], bmap2->ineq[i], 1+total);
7689 for (i = 0; i < bmap1->n_div; ++i) {
7690 cmp = isl_seq_cmp(bmap1->div[i], bmap2->div[i], 1+1+total);
7697 int isl_basic_set_plain_cmp(const __isl_keep isl_basic_set *bset1,
7698 const __isl_keep isl_basic_set *bset2)
7700 return isl_basic_map_plain_cmp(bset1, bset2);
7703 int isl_set_plain_cmp(const __isl_keep isl_set *set1,
7704 const __isl_keep isl_set *set2)
7710 if (set1->n != set2->n)
7711 return set1->n - set2->n;
7713 for (i = 0; i < set1->n; ++i) {
7714 cmp = isl_basic_set_plain_cmp(set1->p[i], set2->p[i]);
7722 int isl_basic_map_plain_is_equal(__isl_keep isl_basic_map *bmap1,
7723 __isl_keep isl_basic_map *bmap2)
7725 return isl_basic_map_plain_cmp(bmap1, bmap2) == 0;
7728 int isl_basic_set_plain_is_equal(__isl_keep isl_basic_set *bset1,
7729 __isl_keep isl_basic_set *bset2)
7731 return isl_basic_map_plain_is_equal((isl_basic_map *)bset1,
7732 (isl_basic_map *)bset2);
7735 static int qsort_bmap_cmp(const void *p1, const void *p2)
7737 const struct isl_basic_map *bmap1 = *(const struct isl_basic_map **)p1;
7738 const struct isl_basic_map *bmap2 = *(const struct isl_basic_map **)p2;
7740 return isl_basic_map_plain_cmp(bmap1, bmap2);
7743 /* We normalize in place, but if anything goes wrong we need
7744 * to return NULL, so we need to make sure we don't change the
7745 * meaning of any possible other copies of map.
7747 struct isl_map *isl_map_normalize(struct isl_map *map)
7750 struct isl_basic_map *bmap;
7754 if (ISL_F_ISSET(map, ISL_MAP_NORMALIZED))
7756 for (i = 0; i < map->n; ++i) {
7757 bmap = isl_basic_map_normalize(isl_basic_map_copy(map->p[i]));
7760 isl_basic_map_free(map->p[i]);
7763 qsort(map->p, map->n, sizeof(struct isl_basic_map *), qsort_bmap_cmp);
7764 ISL_F_SET(map, ISL_MAP_NORMALIZED);
7765 map = isl_map_remove_empty_parts(map);
7768 for (i = map->n - 1; i >= 1; --i) {
7769 if (!isl_basic_map_plain_is_equal(map->p[i-1], map->p[i]))
7771 isl_basic_map_free(map->p[i-1]);
7772 for (j = i; j < map->n; ++j)
7773 map->p[j-1] = map->p[j];
7783 struct isl_set *isl_set_normalize(struct isl_set *set)
7785 return (struct isl_set *)isl_map_normalize((struct isl_map *)set);
7788 int isl_map_plain_is_equal(__isl_keep isl_map *map1, __isl_keep isl_map *map2)
7798 if (!isl_space_is_equal(map1->dim, map2->dim))
7801 map1 = isl_map_copy(map1);
7802 map2 = isl_map_copy(map2);
7803 map1 = isl_map_normalize(map1);
7804 map2 = isl_map_normalize(map2);
7807 equal = map1->n == map2->n;
7808 for (i = 0; equal && i < map1->n; ++i) {
7809 equal = isl_basic_map_plain_is_equal(map1->p[i], map2->p[i]);
7822 int isl_map_fast_is_equal(__isl_keep isl_map *map1, __isl_keep isl_map *map2)
7824 return isl_map_plain_is_equal(map1, map2);
7827 int isl_set_plain_is_equal(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
7829 return isl_map_plain_is_equal((struct isl_map *)set1,
7830 (struct isl_map *)set2);
7833 int isl_set_fast_is_equal(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
7835 return isl_set_plain_is_equal(set1, set2);
7838 /* Return an interval that ranges from min to max (inclusive)
7840 struct isl_basic_set *isl_basic_set_interval(struct isl_ctx *ctx,
7841 isl_int min, isl_int max)
7844 struct isl_basic_set *bset = NULL;
7846 bset = isl_basic_set_alloc(ctx, 0, 1, 0, 0, 2);
7850 k = isl_basic_set_alloc_inequality(bset);
7853 isl_int_set_si(bset->ineq[k][1], 1);
7854 isl_int_neg(bset->ineq[k][0], min);
7856 k = isl_basic_set_alloc_inequality(bset);
7859 isl_int_set_si(bset->ineq[k][1], -1);
7860 isl_int_set(bset->ineq[k][0], max);
7864 isl_basic_set_free(bset);
7868 /* Return the Cartesian product of the basic sets in list (in the given order).
7870 __isl_give isl_basic_set *isl_basic_set_list_product(
7871 __isl_take struct isl_basic_set_list *list)
7879 struct isl_basic_set *product = NULL;
7883 isl_assert(list->ctx, list->n > 0, goto error);
7884 isl_assert(list->ctx, list->p[0], goto error);
7885 nparam = isl_basic_set_n_param(list->p[0]);
7886 dim = isl_basic_set_n_dim(list->p[0]);
7887 extra = list->p[0]->n_div;
7888 n_eq = list->p[0]->n_eq;
7889 n_ineq = list->p[0]->n_ineq;
7890 for (i = 1; i < list->n; ++i) {
7891 isl_assert(list->ctx, list->p[i], goto error);
7892 isl_assert(list->ctx,
7893 nparam == isl_basic_set_n_param(list->p[i]), goto error);
7894 dim += isl_basic_set_n_dim(list->p[i]);
7895 extra += list->p[i]->n_div;
7896 n_eq += list->p[i]->n_eq;
7897 n_ineq += list->p[i]->n_ineq;
7899 product = isl_basic_set_alloc(list->ctx, nparam, dim, extra,
7904 for (i = 0; i < list->n; ++i) {
7905 isl_basic_set_add_constraints(product,
7906 isl_basic_set_copy(list->p[i]), dim);
7907 dim += isl_basic_set_n_dim(list->p[i]);
7909 isl_basic_set_list_free(list);
7912 isl_basic_set_free(product);
7913 isl_basic_set_list_free(list);
7917 struct isl_basic_map *isl_basic_map_product(
7918 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
7920 isl_space *dim_result = NULL;
7921 struct isl_basic_map *bmap;
7922 unsigned in1, in2, out1, out2, nparam, total, pos;
7923 struct isl_dim_map *dim_map1, *dim_map2;
7925 if (!bmap1 || !bmap2)
7928 isl_assert(bmap1->ctx, isl_space_match(bmap1->dim, isl_dim_param,
7929 bmap2->dim, isl_dim_param), goto error);
7930 dim_result = isl_space_product(isl_space_copy(bmap1->dim),
7931 isl_space_copy(bmap2->dim));
7933 in1 = isl_basic_map_n_in(bmap1);
7934 in2 = isl_basic_map_n_in(bmap2);
7935 out1 = isl_basic_map_n_out(bmap1);
7936 out2 = isl_basic_map_n_out(bmap2);
7937 nparam = isl_basic_map_n_param(bmap1);
7939 total = nparam + in1 + in2 + out1 + out2 + bmap1->n_div + bmap2->n_div;
7940 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
7941 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
7942 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
7943 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
7944 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
7945 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos += in1);
7946 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += in2);
7947 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += out1);
7948 isl_dim_map_div(dim_map1, bmap1, pos += out2);
7949 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
7951 bmap = isl_basic_map_alloc_space(dim_result,
7952 bmap1->n_div + bmap2->n_div,
7953 bmap1->n_eq + bmap2->n_eq,
7954 bmap1->n_ineq + bmap2->n_ineq);
7955 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap1, dim_map1);
7956 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap2, dim_map2);
7957 bmap = isl_basic_map_simplify(bmap);
7958 return isl_basic_map_finalize(bmap);
7960 isl_basic_map_free(bmap1);
7961 isl_basic_map_free(bmap2);
7965 __isl_give isl_basic_map *isl_basic_map_flat_product(
7966 __isl_take isl_basic_map *bmap1, __isl_take isl_basic_map *bmap2)
7968 isl_basic_map *prod;
7970 prod = isl_basic_map_product(bmap1, bmap2);
7971 prod = isl_basic_map_flatten(prod);
7975 __isl_give isl_basic_set *isl_basic_set_flat_product(
7976 __isl_take isl_basic_set *bset1, __isl_take isl_basic_set *bset2)
7978 return isl_basic_map_flat_range_product(bset1, bset2);
7981 __isl_give isl_basic_map *isl_basic_map_domain_product(
7982 __isl_take isl_basic_map *bmap1, __isl_take isl_basic_map *bmap2)
7984 isl_space *space_result = NULL;
7985 isl_basic_map *bmap;
7986 unsigned in1, in2, out, nparam, total, pos;
7987 struct isl_dim_map *dim_map1, *dim_map2;
7989 if (!bmap1 || !bmap2)
7992 space_result = isl_space_domain_product(isl_space_copy(bmap1->dim),
7993 isl_space_copy(bmap2->dim));
7995 in1 = isl_basic_map_dim(bmap1, isl_dim_in);
7996 in2 = isl_basic_map_dim(bmap2, isl_dim_in);
7997 out = isl_basic_map_dim(bmap1, isl_dim_out);
7998 nparam = isl_basic_map_dim(bmap1, isl_dim_param);
8000 total = nparam + in1 + in2 + out + bmap1->n_div + bmap2->n_div;
8001 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
8002 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
8003 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
8004 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
8005 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
8006 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos += in1);
8007 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += in2);
8008 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos);
8009 isl_dim_map_div(dim_map1, bmap1, pos += out);
8010 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
8012 bmap = isl_basic_map_alloc_space(space_result,
8013 bmap1->n_div + bmap2->n_div,
8014 bmap1->n_eq + bmap2->n_eq,
8015 bmap1->n_ineq + bmap2->n_ineq);
8016 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap1, dim_map1);
8017 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap2, dim_map2);
8018 bmap = isl_basic_map_simplify(bmap);
8019 return isl_basic_map_finalize(bmap);
8021 isl_basic_map_free(bmap1);
8022 isl_basic_map_free(bmap2);
8026 __isl_give isl_basic_map *isl_basic_map_range_product(
8027 __isl_take isl_basic_map *bmap1, __isl_take isl_basic_map *bmap2)
8029 isl_space *dim_result = NULL;
8030 isl_basic_map *bmap;
8031 unsigned in, out1, out2, nparam, total, pos;
8032 struct isl_dim_map *dim_map1, *dim_map2;
8034 if (!bmap1 || !bmap2)
8037 dim_result = isl_space_range_product(isl_space_copy(bmap1->dim),
8038 isl_space_copy(bmap2->dim));
8040 in = isl_basic_map_dim(bmap1, isl_dim_in);
8041 out1 = isl_basic_map_n_out(bmap1);
8042 out2 = isl_basic_map_n_out(bmap2);
8043 nparam = isl_basic_map_n_param(bmap1);
8045 total = nparam + in + out1 + out2 + bmap1->n_div + bmap2->n_div;
8046 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
8047 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
8048 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
8049 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
8050 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
8051 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
8052 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += in);
8053 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += out1);
8054 isl_dim_map_div(dim_map1, bmap1, pos += out2);
8055 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
8057 bmap = isl_basic_map_alloc_space(dim_result,
8058 bmap1->n_div + bmap2->n_div,
8059 bmap1->n_eq + bmap2->n_eq,
8060 bmap1->n_ineq + bmap2->n_ineq);
8061 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap1, dim_map1);
8062 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap2, dim_map2);
8063 bmap = isl_basic_map_simplify(bmap);
8064 return isl_basic_map_finalize(bmap);
8066 isl_basic_map_free(bmap1);
8067 isl_basic_map_free(bmap2);
8071 __isl_give isl_basic_map *isl_basic_map_flat_range_product(
8072 __isl_take isl_basic_map *bmap1, __isl_take isl_basic_map *bmap2)
8074 isl_basic_map *prod;
8076 prod = isl_basic_map_range_product(bmap1, bmap2);
8077 prod = isl_basic_map_flatten_range(prod);
8081 static __isl_give isl_map *map_product(__isl_take isl_map *map1,
8082 __isl_take isl_map *map2,
8083 __isl_give isl_space *(*dim_product)(__isl_take isl_space *left,
8084 __isl_take isl_space *right),
8085 __isl_give isl_basic_map *(*basic_map_product)(
8086 __isl_take isl_basic_map *left, __isl_take isl_basic_map *right))
8089 struct isl_map *result;
8095 isl_assert(map1->ctx, isl_space_match(map1->dim, isl_dim_param,
8096 map2->dim, isl_dim_param), goto error);
8098 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
8099 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
8100 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
8102 result = isl_map_alloc_space(dim_product(isl_space_copy(map1->dim),
8103 isl_space_copy(map2->dim)),
8104 map1->n * map2->n, flags);
8107 for (i = 0; i < map1->n; ++i)
8108 for (j = 0; j < map2->n; ++j) {
8109 struct isl_basic_map *part;
8110 part = basic_map_product(isl_basic_map_copy(map1->p[i]),
8111 isl_basic_map_copy(map2->p[j]));
8112 if (isl_basic_map_is_empty(part))
8113 isl_basic_map_free(part);
8115 result = isl_map_add_basic_map(result, part);
8128 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> [B -> D]
8130 static __isl_give isl_map *map_product_aligned(__isl_take isl_map *map1,
8131 __isl_take isl_map *map2)
8133 return map_product(map1, map2, &isl_space_product, &isl_basic_map_product);
8136 __isl_give isl_map *isl_map_product(__isl_take isl_map *map1,
8137 __isl_take isl_map *map2)
8139 return isl_map_align_params_map_map_and(map1, map2, &map_product_aligned);
8142 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
8144 __isl_give isl_map *isl_map_flat_product(__isl_take isl_map *map1,
8145 __isl_take isl_map *map2)
8149 prod = isl_map_product(map1, map2);
8150 prod = isl_map_flatten(prod);
8154 /* Given two set A and B, construct its Cartesian product A x B.
8156 struct isl_set *isl_set_product(struct isl_set *set1, struct isl_set *set2)
8158 return isl_map_range_product(set1, set2);
8161 __isl_give isl_set *isl_set_flat_product(__isl_take isl_set *set1,
8162 __isl_take isl_set *set2)
8164 return isl_map_flat_range_product(set1, set2);
8167 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> (B * D)
8169 static __isl_give isl_map *map_domain_product_aligned(__isl_take isl_map *map1,
8170 __isl_take isl_map *map2)
8172 return map_product(map1, map2, &isl_space_domain_product,
8173 &isl_basic_map_domain_product);
8176 /* Given two maps A -> B and C -> D, construct a map (A * C) -> [B -> D]
8178 static __isl_give isl_map *map_range_product_aligned(__isl_take isl_map *map1,
8179 __isl_take isl_map *map2)
8181 return map_product(map1, map2, &isl_space_range_product,
8182 &isl_basic_map_range_product);
8185 __isl_give isl_map *isl_map_domain_product(__isl_take isl_map *map1,
8186 __isl_take isl_map *map2)
8188 return isl_map_align_params_map_map_and(map1, map2,
8189 &map_domain_product_aligned);
8192 __isl_give isl_map *isl_map_range_product(__isl_take isl_map *map1,
8193 __isl_take isl_map *map2)
8195 return isl_map_align_params_map_map_and(map1, map2,
8196 &map_range_product_aligned);
8199 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B * D)
8201 __isl_give isl_map *isl_map_flat_domain_product(__isl_take isl_map *map1,
8202 __isl_take isl_map *map2)
8206 prod = isl_map_domain_product(map1, map2);
8207 prod = isl_map_flatten_domain(prod);
8211 /* Given two maps A -> B and C -> D, construct a map (A * C) -> (B, D)
8213 __isl_give isl_map *isl_map_flat_range_product(__isl_take isl_map *map1,
8214 __isl_take isl_map *map2)
8218 prod = isl_map_range_product(map1, map2);
8219 prod = isl_map_flatten_range(prod);
8223 uint32_t isl_basic_map_get_hash(__isl_keep isl_basic_map *bmap)
8226 uint32_t hash = isl_hash_init();
8231 bmap = isl_basic_map_copy(bmap);
8232 bmap = isl_basic_map_normalize(bmap);
8235 total = isl_basic_map_total_dim(bmap);
8236 isl_hash_byte(hash, bmap->n_eq & 0xFF);
8237 for (i = 0; i < bmap->n_eq; ++i) {
8239 c_hash = isl_seq_get_hash(bmap->eq[i], 1 + total);
8240 isl_hash_hash(hash, c_hash);
8242 isl_hash_byte(hash, bmap->n_ineq & 0xFF);
8243 for (i = 0; i < bmap->n_ineq; ++i) {
8245 c_hash = isl_seq_get_hash(bmap->ineq[i], 1 + total);
8246 isl_hash_hash(hash, c_hash);
8248 isl_hash_byte(hash, bmap->n_div & 0xFF);
8249 for (i = 0; i < bmap->n_div; ++i) {
8251 if (isl_int_is_zero(bmap->div[i][0]))
8253 isl_hash_byte(hash, i & 0xFF);
8254 c_hash = isl_seq_get_hash(bmap->div[i], 1 + 1 + total);
8255 isl_hash_hash(hash, c_hash);
8257 isl_basic_map_free(bmap);
8261 uint32_t isl_basic_set_get_hash(__isl_keep isl_basic_set *bset)
8263 return isl_basic_map_get_hash((isl_basic_map *)bset);
8266 uint32_t isl_map_get_hash(__isl_keep isl_map *map)
8273 map = isl_map_copy(map);
8274 map = isl_map_normalize(map);
8278 hash = isl_hash_init();
8279 for (i = 0; i < map->n; ++i) {
8281 bmap_hash = isl_basic_map_get_hash(map->p[i]);
8282 isl_hash_hash(hash, bmap_hash);
8290 uint32_t isl_set_get_hash(__isl_keep isl_set *set)
8292 return isl_map_get_hash((isl_map *)set);
8295 /* Check if the value for dimension dim is completely determined
8296 * by the values of the other parameters and variables.
8297 * That is, check if dimension dim is involved in an equality.
8299 int isl_basic_set_dim_is_unique(struct isl_basic_set *bset, unsigned dim)
8306 nparam = isl_basic_set_n_param(bset);
8307 for (i = 0; i < bset->n_eq; ++i)
8308 if (!isl_int_is_zero(bset->eq[i][1 + nparam + dim]))
8313 /* Check if the value for dimension dim is completely determined
8314 * by the values of the other parameters and variables.
8315 * That is, check if dimension dim is involved in an equality
8316 * for each of the subsets.
8318 int isl_set_dim_is_unique(struct isl_set *set, unsigned dim)
8324 for (i = 0; i < set->n; ++i) {
8326 unique = isl_basic_set_dim_is_unique(set->p[i], dim);
8333 int isl_set_n_basic_set(__isl_keep isl_set *set)
8335 return set ? set->n : 0;
8338 int isl_map_foreach_basic_map(__isl_keep isl_map *map,
8339 int (*fn)(__isl_take isl_basic_map *bmap, void *user), void *user)
8346 for (i = 0; i < map->n; ++i)
8347 if (fn(isl_basic_map_copy(map->p[i]), user) < 0)
8353 int isl_set_foreach_basic_set(__isl_keep isl_set *set,
8354 int (*fn)(__isl_take isl_basic_set *bset, void *user), void *user)
8361 for (i = 0; i < set->n; ++i)
8362 if (fn(isl_basic_set_copy(set->p[i]), user) < 0)
8368 __isl_give isl_basic_set *isl_basic_set_lift(__isl_take isl_basic_set *bset)
8375 bset = isl_basic_set_cow(bset);
8379 dim = isl_basic_set_get_space(bset);
8380 dim = isl_space_lift(dim, bset->n_div);
8383 isl_space_free(bset->dim);
8385 bset->extra -= bset->n_div;
8388 bset = isl_basic_set_finalize(bset);
8392 isl_basic_set_free(bset);
8396 __isl_give isl_set *isl_set_lift(__isl_take isl_set *set)
8402 set = isl_set_align_divs(set);
8407 set = isl_set_cow(set);
8411 n_div = set->p[0]->n_div;
8412 dim = isl_set_get_space(set);
8413 dim = isl_space_lift(dim, n_div);
8416 isl_space_free(set->dim);
8419 for (i = 0; i < set->n; ++i) {
8420 set->p[i] = isl_basic_set_lift(set->p[i]);
8431 __isl_give isl_map *isl_set_lifting(__isl_take isl_set *set)
8434 struct isl_basic_map *bmap;
8441 set = isl_set_align_divs(set);
8446 dim = isl_set_get_space(set);
8447 if (set->n == 0 || set->p[0]->n_div == 0) {
8449 return isl_map_identity(isl_space_map_from_set(dim));
8452 n_div = set->p[0]->n_div;
8453 dim = isl_space_map_from_set(dim);
8454 n_param = isl_space_dim(dim, isl_dim_param);
8455 n_set = isl_space_dim(dim, isl_dim_in);
8456 dim = isl_space_extend(dim, n_param, n_set, n_set + n_div);
8457 bmap = isl_basic_map_alloc_space(dim, 0, n_set, 2 * n_div);
8458 for (i = 0; i < n_set; ++i)
8459 bmap = var_equal(bmap, i);
8461 total = n_param + n_set + n_set + n_div;
8462 for (i = 0; i < n_div; ++i) {
8463 k = isl_basic_map_alloc_inequality(bmap);
8466 isl_seq_cpy(bmap->ineq[k], set->p[0]->div[i]+1, 1+n_param);
8467 isl_seq_clr(bmap->ineq[k]+1+n_param, n_set);
8468 isl_seq_cpy(bmap->ineq[k]+1+n_param+n_set,
8469 set->p[0]->div[i]+1+1+n_param, n_set + n_div);
8470 isl_int_neg(bmap->ineq[k][1+n_param+n_set+n_set+i],
8471 set->p[0]->div[i][0]);
8473 l = isl_basic_map_alloc_inequality(bmap);
8476 isl_seq_neg(bmap->ineq[l], bmap->ineq[k], 1 + total);
8477 isl_int_add(bmap->ineq[l][0], bmap->ineq[l][0],
8478 set->p[0]->div[i][0]);
8479 isl_int_sub_ui(bmap->ineq[l][0], bmap->ineq[l][0], 1);
8483 bmap = isl_basic_map_simplify(bmap);
8484 bmap = isl_basic_map_finalize(bmap);
8485 return isl_map_from_basic_map(bmap);
8488 isl_basic_map_free(bmap);
8492 int isl_basic_set_size(__isl_keep isl_basic_set *bset)
8500 dim = isl_basic_set_total_dim(bset);
8501 size += bset->n_eq * (1 + dim);
8502 size += bset->n_ineq * (1 + dim);
8503 size += bset->n_div * (2 + dim);
8508 int isl_set_size(__isl_keep isl_set *set)
8516 for (i = 0; i < set->n; ++i)
8517 size += isl_basic_set_size(set->p[i]);
8522 /* Check if there is any lower bound (if lower == 0) and/or upper
8523 * bound (if upper == 0) on the specified dim.
8525 static int basic_map_dim_is_bounded(__isl_keep isl_basic_map *bmap,
8526 enum isl_dim_type type, unsigned pos, int lower, int upper)
8533 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), return -1);
8535 pos += isl_basic_map_offset(bmap, type);
8537 for (i = 0; i < bmap->n_div; ++i) {
8538 if (isl_int_is_zero(bmap->div[i][0]))
8540 if (!isl_int_is_zero(bmap->div[i][1 + pos]))
8544 for (i = 0; i < bmap->n_eq; ++i)
8545 if (!isl_int_is_zero(bmap->eq[i][pos]))
8548 for (i = 0; i < bmap->n_ineq; ++i) {
8549 int sgn = isl_int_sgn(bmap->ineq[i][pos]);
8556 return lower && upper;
8559 int isl_basic_map_dim_is_bounded(__isl_keep isl_basic_map *bmap,
8560 enum isl_dim_type type, unsigned pos)
8562 return basic_map_dim_is_bounded(bmap, type, pos, 0, 0);
8565 int isl_basic_map_dim_has_lower_bound(__isl_keep isl_basic_map *bmap,
8566 enum isl_dim_type type, unsigned pos)
8568 return basic_map_dim_is_bounded(bmap, type, pos, 0, 1);
8571 int isl_basic_map_dim_has_upper_bound(__isl_keep isl_basic_map *bmap,
8572 enum isl_dim_type type, unsigned pos)
8574 return basic_map_dim_is_bounded(bmap, type, pos, 1, 0);
8577 int isl_map_dim_is_bounded(__isl_keep isl_map *map,
8578 enum isl_dim_type type, unsigned pos)
8585 for (i = 0; i < map->n; ++i) {
8587 bounded = isl_basic_map_dim_is_bounded(map->p[i], type, pos);
8588 if (bounded < 0 || !bounded)
8595 /* Return 1 if the specified dim is involved in both an upper bound
8596 * and a lower bound.
8598 int isl_set_dim_is_bounded(__isl_keep isl_set *set,
8599 enum isl_dim_type type, unsigned pos)
8601 return isl_map_dim_is_bounded((isl_map *)set, type, pos);
8604 static int has_bound(__isl_keep isl_map *map,
8605 enum isl_dim_type type, unsigned pos,
8606 int (*fn)(__isl_keep isl_basic_map *bmap,
8607 enum isl_dim_type type, unsigned pos))
8614 for (i = 0; i < map->n; ++i) {
8616 bounded = fn(map->p[i], type, pos);
8617 if (bounded < 0 || bounded)
8624 /* Return 1 if the specified dim is involved in any lower bound.
8626 int isl_set_dim_has_lower_bound(__isl_keep isl_set *set,
8627 enum isl_dim_type type, unsigned pos)
8629 return has_bound(set, type, pos, &isl_basic_map_dim_has_lower_bound);
8632 /* Return 1 if the specified dim is involved in any upper bound.
8634 int isl_set_dim_has_upper_bound(__isl_keep isl_set *set,
8635 enum isl_dim_type type, unsigned pos)
8637 return has_bound(set, type, pos, &isl_basic_map_dim_has_upper_bound);
8640 /* For each of the "n" variables starting at "first", determine
8641 * the sign of the variable and put the results in the first "n"
8642 * elements of the array "signs".
8644 * 1 means that the variable is non-negative
8645 * -1 means that the variable is non-positive
8646 * 0 means the variable attains both positive and negative values.
8648 int isl_basic_set_vars_get_sign(__isl_keep isl_basic_set *bset,
8649 unsigned first, unsigned n, int *signs)
8651 isl_vec *bound = NULL;
8652 struct isl_tab *tab = NULL;
8653 struct isl_tab_undo *snap;
8656 if (!bset || !signs)
8659 bound = isl_vec_alloc(bset->ctx, 1 + isl_basic_set_total_dim(bset));
8660 tab = isl_tab_from_basic_set(bset);
8664 isl_seq_clr(bound->el, bound->size);
8665 isl_int_set_si(bound->el[0], -1);
8667 snap = isl_tab_snap(tab);
8668 for (i = 0; i < n; ++i) {
8671 isl_int_set_si(bound->el[1 + first + i], -1);
8672 if (isl_tab_add_ineq(tab, bound->el) < 0)
8675 isl_int_set_si(bound->el[1 + first + i], 0);
8676 if (isl_tab_rollback(tab, snap) < 0)
8684 isl_int_set_si(bound->el[1 + first + i], 1);
8685 if (isl_tab_add_ineq(tab, bound->el) < 0)
8688 isl_int_set_si(bound->el[1 + first + i], 0);
8689 if (isl_tab_rollback(tab, snap) < 0)
8692 signs[i] = empty ? -1 : 0;
8696 isl_vec_free(bound);
8700 isl_vec_free(bound);
8704 int isl_basic_set_dims_get_sign(__isl_keep isl_basic_set *bset,
8705 enum isl_dim_type type, unsigned first, unsigned n, int *signs)
8707 if (!bset || !signs)
8709 isl_assert(bset->ctx, first + n <= isl_basic_set_dim(bset, type),
8712 first += pos(bset->dim, type) - 1;
8713 return isl_basic_set_vars_get_sign(bset, first, n, signs);
8716 /* Check if the given basic map is obviously single-valued.
8717 * In particular, for each output dimension, check that there is
8718 * an equality that defines the output dimension in terms of
8719 * earlier dimensions.
8721 int isl_basic_map_plain_is_single_valued(__isl_keep isl_basic_map *bmap)
8731 total = 1 + isl_basic_map_total_dim(bmap);
8732 n_out = isl_basic_map_dim(bmap, isl_dim_out);
8733 o_out = isl_basic_map_offset(bmap, isl_dim_out);
8735 for (i = 0; i < n_out; ++i) {
8736 for (j = 0; j < bmap->n_eq; ++j) {
8737 if (isl_int_is_zero(bmap->eq[j][o_out + i]))
8739 if (isl_seq_first_non_zero(bmap->eq[j] + o_out + i + 1,
8740 total - (o_out + i + 1)) == -1)
8743 if (j >= bmap->n_eq)
8750 /* Check if the given map is obviously single-valued.
8752 int isl_map_plain_is_single_valued(__isl_keep isl_map *map)
8761 return isl_basic_map_plain_is_single_valued(map->p[0]);
8764 /* Check if the given map is single-valued.
8769 * and check if the result is a subset of the identity mapping.
8771 int isl_map_is_single_valued(__isl_keep isl_map *map)
8778 sv = isl_map_plain_is_single_valued(map);
8782 test = isl_map_reverse(isl_map_copy(map));
8783 test = isl_map_apply_range(test, isl_map_copy(map));
8785 dim = isl_space_map_from_set(isl_space_range(isl_map_get_space(map)));
8786 id = isl_map_identity(dim);
8788 sv = isl_map_is_subset(test, id);
8796 int isl_map_is_injective(__isl_keep isl_map *map)
8800 map = isl_map_copy(map);
8801 map = isl_map_reverse(map);
8802 in = isl_map_is_single_valued(map);
8808 /* Check if the given map is obviously injective.
8810 int isl_map_plain_is_injective(__isl_keep isl_map *map)
8814 map = isl_map_copy(map);
8815 map = isl_map_reverse(map);
8816 in = isl_map_plain_is_single_valued(map);
8822 int isl_map_is_bijective(__isl_keep isl_map *map)
8826 sv = isl_map_is_single_valued(map);
8830 return isl_map_is_injective(map);
8833 int isl_set_is_singleton(__isl_keep isl_set *set)
8835 return isl_map_is_single_valued((isl_map *)set);
8838 int isl_map_is_translation(__isl_keep isl_map *map)
8843 delta = isl_map_deltas(isl_map_copy(map));
8844 ok = isl_set_is_singleton(delta);
8845 isl_set_free(delta);
8850 static int unique(isl_int *p, unsigned pos, unsigned len)
8852 if (isl_seq_first_non_zero(p, pos) != -1)
8854 if (isl_seq_first_non_zero(p + pos + 1, len - pos - 1) != -1)
8859 int isl_basic_set_is_box(__isl_keep isl_basic_set *bset)
8868 if (isl_basic_set_dim(bset, isl_dim_div) != 0)
8871 nvar = isl_basic_set_dim(bset, isl_dim_set);
8872 ovar = isl_space_offset(bset->dim, isl_dim_set);
8873 for (j = 0; j < nvar; ++j) {
8874 int lower = 0, upper = 0;
8875 for (i = 0; i < bset->n_eq; ++i) {
8876 if (isl_int_is_zero(bset->eq[i][1 + ovar + j]))
8878 if (!unique(bset->eq[i] + 1 + ovar, j, nvar))
8884 for (i = 0; i < bset->n_ineq; ++i) {
8885 if (isl_int_is_zero(bset->ineq[i][1 + ovar + j]))
8887 if (!unique(bset->ineq[i] + 1 + ovar, j, nvar))
8889 if (isl_int_is_pos(bset->ineq[i][1 + ovar + j]))
8894 if (!lower || !upper)
8901 int isl_set_is_box(__isl_keep isl_set *set)
8908 return isl_basic_set_is_box(set->p[0]);
8911 int isl_basic_set_is_wrapping(__isl_keep isl_basic_set *bset)
8916 return isl_space_is_wrapping(bset->dim);
8919 int isl_set_is_wrapping(__isl_keep isl_set *set)
8924 return isl_space_is_wrapping(set->dim);
8927 __isl_give isl_basic_set *isl_basic_map_wrap(__isl_take isl_basic_map *bmap)
8929 bmap = isl_basic_map_cow(bmap);
8933 bmap->dim = isl_space_wrap(bmap->dim);
8937 bmap = isl_basic_map_finalize(bmap);
8939 return (isl_basic_set *)bmap;
8941 isl_basic_map_free(bmap);
8945 __isl_give isl_set *isl_map_wrap(__isl_take isl_map *map)
8949 map = isl_map_cow(map);
8953 for (i = 0; i < map->n; ++i) {
8954 map->p[i] = (isl_basic_map *)isl_basic_map_wrap(map->p[i]);
8958 map->dim = isl_space_wrap(map->dim);
8962 return (isl_set *)map;
8968 __isl_give isl_basic_map *isl_basic_set_unwrap(__isl_take isl_basic_set *bset)
8970 bset = isl_basic_set_cow(bset);
8974 bset->dim = isl_space_unwrap(bset->dim);
8978 bset = isl_basic_set_finalize(bset);
8980 return (isl_basic_map *)bset;
8982 isl_basic_set_free(bset);
8986 __isl_give isl_map *isl_set_unwrap(__isl_take isl_set *set)
8993 if (!isl_set_is_wrapping(set))
8994 isl_die(set->ctx, isl_error_invalid, "not a wrapping set",
8997 set = isl_set_cow(set);
9001 for (i = 0; i < set->n; ++i) {
9002 set->p[i] = (isl_basic_set *)isl_basic_set_unwrap(set->p[i]);
9007 set->dim = isl_space_unwrap(set->dim);
9011 return (isl_map *)set;
9017 __isl_give isl_basic_map *isl_basic_map_reset(__isl_take isl_basic_map *bmap,
9018 enum isl_dim_type type)
9023 if (!isl_space_is_named_or_nested(bmap->dim, type))
9026 bmap = isl_basic_map_cow(bmap);
9030 bmap->dim = isl_space_reset(bmap->dim, type);
9034 bmap = isl_basic_map_finalize(bmap);
9038 isl_basic_map_free(bmap);
9042 __isl_give isl_map *isl_map_reset(__isl_take isl_map *map,
9043 enum isl_dim_type type)
9050 if (!isl_space_is_named_or_nested(map->dim, type))
9053 map = isl_map_cow(map);
9057 for (i = 0; i < map->n; ++i) {
9058 map->p[i] = isl_basic_map_reset(map->p[i], type);
9062 map->dim = isl_space_reset(map->dim, type);
9072 __isl_give isl_basic_map *isl_basic_map_flatten(__isl_take isl_basic_map *bmap)
9077 if (!bmap->dim->nested[0] && !bmap->dim->nested[1])
9080 bmap = isl_basic_map_cow(bmap);
9084 bmap->dim = isl_space_flatten(bmap->dim);
9088 bmap = isl_basic_map_finalize(bmap);
9092 isl_basic_map_free(bmap);
9096 __isl_give isl_basic_set *isl_basic_set_flatten(__isl_take isl_basic_set *bset)
9098 return (isl_basic_set *)isl_basic_map_flatten((isl_basic_map *)bset);
9101 __isl_give isl_basic_map *isl_basic_map_flatten_domain(
9102 __isl_take isl_basic_map *bmap)
9107 if (!bmap->dim->nested[0])
9110 bmap = isl_basic_map_cow(bmap);
9114 bmap->dim = isl_space_flatten_domain(bmap->dim);
9118 bmap = isl_basic_map_finalize(bmap);
9122 isl_basic_map_free(bmap);
9126 __isl_give isl_basic_map *isl_basic_map_flatten_range(
9127 __isl_take isl_basic_map *bmap)
9132 if (!bmap->dim->nested[1])
9135 bmap = isl_basic_map_cow(bmap);
9139 bmap->dim = isl_space_flatten_range(bmap->dim);
9143 bmap = isl_basic_map_finalize(bmap);
9147 isl_basic_map_free(bmap);
9151 __isl_give isl_map *isl_map_flatten(__isl_take isl_map *map)
9158 if (!map->dim->nested[0] && !map->dim->nested[1])
9161 map = isl_map_cow(map);
9165 for (i = 0; i < map->n; ++i) {
9166 map->p[i] = isl_basic_map_flatten(map->p[i]);
9170 map->dim = isl_space_flatten(map->dim);
9180 __isl_give isl_set *isl_set_flatten(__isl_take isl_set *set)
9182 return (isl_set *)isl_map_flatten((isl_map *)set);
9185 __isl_give isl_map *isl_set_flatten_map(__isl_take isl_set *set)
9187 isl_space *dim, *flat_dim;
9190 dim = isl_set_get_space(set);
9191 flat_dim = isl_space_flatten(isl_space_copy(dim));
9192 map = isl_map_identity(isl_space_join(isl_space_reverse(dim), flat_dim));
9193 map = isl_map_intersect_domain(map, set);
9198 __isl_give isl_map *isl_map_flatten_domain(__isl_take isl_map *map)
9205 if (!map->dim->nested[0])
9208 map = isl_map_cow(map);
9212 for (i = 0; i < map->n; ++i) {
9213 map->p[i] = isl_basic_map_flatten_domain(map->p[i]);
9217 map->dim = isl_space_flatten_domain(map->dim);
9227 __isl_give isl_map *isl_map_flatten_range(__isl_take isl_map *map)
9234 if (!map->dim->nested[1])
9237 map = isl_map_cow(map);
9241 for (i = 0; i < map->n; ++i) {
9242 map->p[i] = isl_basic_map_flatten_range(map->p[i]);
9246 map->dim = isl_space_flatten_range(map->dim);
9256 /* Reorder the dimensions of "bmap" according to the given dim_map
9257 * and set the dimension specification to "dim".
9259 __isl_give isl_basic_map *isl_basic_map_realign(__isl_take isl_basic_map *bmap,
9260 __isl_take isl_space *dim, __isl_take struct isl_dim_map *dim_map)
9264 bmap = isl_basic_map_cow(bmap);
9265 if (!bmap || !dim || !dim_map)
9268 res = isl_basic_map_alloc_space(dim,
9269 bmap->n_div, bmap->n_eq, bmap->n_ineq);
9270 res = isl_basic_map_add_constraints_dim_map(res, bmap, dim_map);
9271 res = isl_basic_map_finalize(res);
9275 isl_basic_map_free(bmap);
9276 isl_space_free(dim);
9280 /* Reorder the dimensions of "map" according to given reordering.
9282 __isl_give isl_map *isl_map_realign(__isl_take isl_map *map,
9283 __isl_take isl_reordering *r)
9286 struct isl_dim_map *dim_map;
9288 map = isl_map_cow(map);
9289 dim_map = isl_dim_map_from_reordering(r);
9290 if (!map || !r || !dim_map)
9293 for (i = 0; i < map->n; ++i) {
9294 struct isl_dim_map *dim_map_i;
9296 dim_map_i = isl_dim_map_extend(dim_map, map->p[i]);
9298 map->p[i] = isl_basic_map_realign(map->p[i],
9299 isl_space_copy(r->dim), dim_map_i);
9305 map = isl_map_reset_space(map, isl_space_copy(r->dim));
9307 isl_reordering_free(r);
9313 isl_reordering_free(r);
9317 __isl_give isl_set *isl_set_realign(__isl_take isl_set *set,
9318 __isl_take isl_reordering *r)
9320 return (isl_set *)isl_map_realign((isl_map *)set, r);
9323 __isl_give isl_map *isl_map_align_params(__isl_take isl_map *map,
9324 __isl_take isl_space *model)
9331 ctx = isl_space_get_ctx(model);
9332 if (!isl_space_has_named_params(model))
9333 isl_die(ctx, isl_error_invalid,
9334 "model has unnamed parameters", goto error);
9335 if (!isl_space_has_named_params(map->dim))
9336 isl_die(ctx, isl_error_invalid,
9337 "relation has unnamed parameters", goto error);
9338 if (!isl_space_match(map->dim, isl_dim_param, model, isl_dim_param)) {
9339 isl_reordering *exp;
9341 model = isl_space_drop_dims(model, isl_dim_in,
9342 0, isl_space_dim(model, isl_dim_in));
9343 model = isl_space_drop_dims(model, isl_dim_out,
9344 0, isl_space_dim(model, isl_dim_out));
9345 exp = isl_parameter_alignment_reordering(map->dim, model);
9346 exp = isl_reordering_extend_space(exp, isl_map_get_space(map));
9347 map = isl_map_realign(map, exp);
9350 isl_space_free(model);
9353 isl_space_free(model);
9358 __isl_give isl_set *isl_set_align_params(__isl_take isl_set *set,
9359 __isl_take isl_space *model)
9361 return isl_map_align_params(set, model);
9364 __isl_give isl_mat *isl_basic_map_equalities_matrix(
9365 __isl_keep isl_basic_map *bmap, enum isl_dim_type c1,
9366 enum isl_dim_type c2, enum isl_dim_type c3,
9367 enum isl_dim_type c4, enum isl_dim_type c5)
9369 enum isl_dim_type c[5] = { c1, c2, c3, c4, c5 };
9370 struct isl_mat *mat;
9376 mat = isl_mat_alloc(bmap->ctx, bmap->n_eq,
9377 isl_basic_map_total_dim(bmap) + 1);
9380 for (i = 0; i < bmap->n_eq; ++i)
9381 for (j = 0, pos = 0; j < 5; ++j) {
9382 int off = isl_basic_map_offset(bmap, c[j]);
9383 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
9384 isl_int_set(mat->row[i][pos],
9385 bmap->eq[i][off + k]);
9393 __isl_give isl_mat *isl_basic_map_inequalities_matrix(
9394 __isl_keep isl_basic_map *bmap, enum isl_dim_type c1,
9395 enum isl_dim_type c2, enum isl_dim_type c3,
9396 enum isl_dim_type c4, enum isl_dim_type c5)
9398 enum isl_dim_type c[5] = { c1, c2, c3, c4, c5 };
9399 struct isl_mat *mat;
9405 mat = isl_mat_alloc(bmap->ctx, bmap->n_ineq,
9406 isl_basic_map_total_dim(bmap) + 1);
9409 for (i = 0; i < bmap->n_ineq; ++i)
9410 for (j = 0, pos = 0; j < 5; ++j) {
9411 int off = isl_basic_map_offset(bmap, c[j]);
9412 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
9413 isl_int_set(mat->row[i][pos],
9414 bmap->ineq[i][off + k]);
9422 __isl_give isl_basic_map *isl_basic_map_from_constraint_matrices(
9423 __isl_take isl_space *dim,
9424 __isl_take isl_mat *eq, __isl_take isl_mat *ineq, enum isl_dim_type c1,
9425 enum isl_dim_type c2, enum isl_dim_type c3,
9426 enum isl_dim_type c4, enum isl_dim_type c5)
9428 enum isl_dim_type c[5] = { c1, c2, c3, c4, c5 };
9429 isl_basic_map *bmap;
9435 if (!dim || !eq || !ineq)
9438 if (eq->n_col != ineq->n_col)
9439 isl_die(dim->ctx, isl_error_invalid,
9440 "equalities and inequalities matrices should have "
9441 "same number of columns", goto error);
9443 total = 1 + isl_space_dim(dim, isl_dim_all);
9445 if (eq->n_col < total)
9446 isl_die(dim->ctx, isl_error_invalid,
9447 "number of columns too small", goto error);
9449 extra = eq->n_col - total;
9451 bmap = isl_basic_map_alloc_space(isl_space_copy(dim), extra,
9452 eq->n_row, ineq->n_row);
9455 for (i = 0; i < extra; ++i) {
9456 k = isl_basic_map_alloc_div(bmap);
9459 isl_int_set_si(bmap->div[k][0], 0);
9461 for (i = 0; i < eq->n_row; ++i) {
9462 l = isl_basic_map_alloc_equality(bmap);
9465 for (j = 0, pos = 0; j < 5; ++j) {
9466 int off = isl_basic_map_offset(bmap, c[j]);
9467 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
9468 isl_int_set(bmap->eq[l][off + k],
9474 for (i = 0; i < ineq->n_row; ++i) {
9475 l = isl_basic_map_alloc_inequality(bmap);
9478 for (j = 0, pos = 0; j < 5; ++j) {
9479 int off = isl_basic_map_offset(bmap, c[j]);
9480 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
9481 isl_int_set(bmap->ineq[l][off + k],
9488 isl_space_free(dim);
9494 isl_space_free(dim);
9500 __isl_give isl_mat *isl_basic_set_equalities_matrix(
9501 __isl_keep isl_basic_set *bset, enum isl_dim_type c1,
9502 enum isl_dim_type c2, enum isl_dim_type c3, enum isl_dim_type c4)
9504 return isl_basic_map_equalities_matrix((isl_basic_map *)bset,
9505 c1, c2, c3, c4, isl_dim_in);
9508 __isl_give isl_mat *isl_basic_set_inequalities_matrix(
9509 __isl_keep isl_basic_set *bset, enum isl_dim_type c1,
9510 enum isl_dim_type c2, enum isl_dim_type c3, enum isl_dim_type c4)
9512 return isl_basic_map_inequalities_matrix((isl_basic_map *)bset,
9513 c1, c2, c3, c4, isl_dim_in);
9516 __isl_give isl_basic_set *isl_basic_set_from_constraint_matrices(
9517 __isl_take isl_space *dim,
9518 __isl_take isl_mat *eq, __isl_take isl_mat *ineq, enum isl_dim_type c1,
9519 enum isl_dim_type c2, enum isl_dim_type c3, enum isl_dim_type c4)
9521 return (isl_basic_set*)
9522 isl_basic_map_from_constraint_matrices(dim, eq, ineq,
9523 c1, c2, c3, c4, isl_dim_in);
9526 int isl_basic_map_can_zip(__isl_keep isl_basic_map *bmap)
9531 return isl_space_can_zip(bmap->dim);
9534 int isl_map_can_zip(__isl_keep isl_map *map)
9539 return isl_space_can_zip(map->dim);
9542 /* Given a basic map (A -> B) -> (C -> D), return the corresponding basic map
9543 * (A -> C) -> (B -> D).
9545 __isl_give isl_basic_map *isl_basic_map_zip(__isl_take isl_basic_map *bmap)
9554 if (!isl_basic_map_can_zip(bmap))
9555 isl_die(bmap->ctx, isl_error_invalid,
9556 "basic map cannot be zipped", goto error);
9557 pos = isl_basic_map_offset(bmap, isl_dim_in) +
9558 isl_space_dim(bmap->dim->nested[0], isl_dim_in);
9559 n1 = isl_space_dim(bmap->dim->nested[0], isl_dim_out);
9560 n2 = isl_space_dim(bmap->dim->nested[1], isl_dim_in);
9561 bmap = isl_basic_map_swap_vars(bmap, pos, n1, n2);
9564 bmap->dim = isl_space_zip(bmap->dim);
9569 isl_basic_map_free(bmap);
9573 /* Given a map (A -> B) -> (C -> D), return the corresponding map
9574 * (A -> C) -> (B -> D).
9576 __isl_give isl_map *isl_map_zip(__isl_take isl_map *map)
9583 if (!isl_map_can_zip(map))
9584 isl_die(map->ctx, isl_error_invalid, "map cannot be zipped",
9587 map = isl_map_cow(map);
9591 for (i = 0; i < map->n; ++i) {
9592 map->p[i] = isl_basic_map_zip(map->p[i]);
9597 map->dim = isl_space_zip(map->dim);
9607 /* Construct a basic map mapping the domain of the affine expression
9608 * to a one-dimensional range prescribed by the affine expression.
9610 __isl_give isl_basic_map *isl_basic_map_from_aff(__isl_take isl_aff *aff)
9614 isl_local_space *ls;
9615 isl_basic_map *bmap;
9620 ls = isl_aff_get_local_space(aff);
9621 bmap = isl_basic_map_from_local_space(ls);
9622 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
9623 k = isl_basic_map_alloc_equality(bmap);
9627 pos = isl_basic_map_offset(bmap, isl_dim_out);
9628 isl_seq_cpy(bmap->eq[k], aff->v->el + 1, pos);
9629 isl_int_neg(bmap->eq[k][pos], aff->v->el[0]);
9630 isl_seq_cpy(bmap->eq[k] + pos + 1, aff->v->el + 1 + pos,
9631 aff->v->size - (pos + 1));
9634 bmap = isl_basic_map_finalize(bmap);
9638 isl_basic_map_free(bmap);
9642 /* Construct a basic map mapping the domain the multi-affine expression
9643 * to its range, with each dimension in the range equated to the
9644 * corresponding affine expression.
9646 __isl_give isl_basic_map *isl_basic_map_from_multi_aff(
9647 __isl_take isl_multi_aff *maff)
9651 isl_basic_map *bmap;
9656 if (isl_space_dim(maff->space, isl_dim_out) != maff->n)
9657 isl_die(isl_multi_aff_get_ctx(maff), isl_error_internal,
9658 "invalid space", return isl_multi_aff_free(maff));
9660 space = isl_space_domain(isl_multi_aff_get_space(maff));
9661 bmap = isl_basic_map_universe(isl_space_from_domain(space));
9663 for (i = 0; i < maff->n; ++i) {
9665 isl_basic_map *bmap_i;
9667 aff = isl_aff_copy(maff->p[i]);
9668 bmap_i = isl_basic_map_from_aff(aff);
9670 bmap = isl_basic_map_flat_range_product(bmap, bmap_i);
9673 bmap = isl_basic_map_reset_space(bmap, isl_multi_aff_get_space(maff));
9675 isl_multi_aff_free(maff);
9679 /* Construct a basic map mapping a domain in the given space to
9680 * to an n-dimensional range, with n the number of elements in the list,
9681 * where each coordinate in the range is prescribed by the
9682 * corresponding affine expression.
9683 * The domains of all affine expressions in the list are assumed to match
9686 __isl_give isl_basic_map *isl_basic_map_from_aff_list(
9687 __isl_take isl_space *domain_dim, __isl_take isl_aff_list *list)
9691 isl_basic_map *bmap;
9696 dim = isl_space_from_domain(domain_dim);
9697 bmap = isl_basic_map_universe(dim);
9699 for (i = 0; i < list->n; ++i) {
9701 isl_basic_map *bmap_i;
9703 aff = isl_aff_copy(list->p[i]);
9704 bmap_i = isl_basic_map_from_aff(aff);
9706 bmap = isl_basic_map_flat_range_product(bmap, bmap_i);
9709 isl_aff_list_free(list);
9713 __isl_give isl_set *isl_set_equate(__isl_take isl_set *set,
9714 enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2)
9716 return isl_map_equate(set, type1, pos1, type2, pos2);
9719 /* Add a constraint imposing that the given two dimensions are equal.
9721 __isl_give isl_map *isl_map_equate(__isl_take isl_map *map,
9722 enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2)
9724 isl_basic_map *bmap = NULL;
9730 if (pos1 >= isl_map_dim(map, type1))
9731 isl_die(map->ctx, isl_error_invalid,
9732 "index out of bounds", goto error);
9733 if (pos2 >= isl_map_dim(map, type2))
9734 isl_die(map->ctx, isl_error_invalid,
9735 "index out of bounds", goto error);
9737 bmap = isl_basic_map_alloc_space(isl_map_get_space(map), 0, 1, 0);
9738 i = isl_basic_map_alloc_equality(bmap);
9741 isl_seq_clr(bmap->eq[i], 1 + isl_basic_map_total_dim(bmap));
9742 pos1 += isl_basic_map_offset(bmap, type1);
9743 pos2 += isl_basic_map_offset(bmap, type2);
9744 isl_int_set_si(bmap->eq[i][pos1], -1);
9745 isl_int_set_si(bmap->eq[i][pos2], 1);
9746 bmap = isl_basic_map_finalize(bmap);
9748 map = isl_map_intersect(map, isl_map_from_basic_map(bmap));
9752 isl_basic_map_free(bmap);
9757 /* Add a constraint imposing that the given two dimensions have opposite values.
9759 __isl_give isl_map *isl_map_oppose(__isl_take isl_map *map,
9760 enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2)
9762 isl_basic_map *bmap = NULL;
9768 if (pos1 >= isl_map_dim(map, type1))
9769 isl_die(map->ctx, isl_error_invalid,
9770 "index out of bounds", goto error);
9771 if (pos2 >= isl_map_dim(map, type2))
9772 isl_die(map->ctx, isl_error_invalid,
9773 "index out of bounds", goto error);
9775 bmap = isl_basic_map_alloc_space(isl_map_get_space(map), 0, 1, 0);
9776 i = isl_basic_map_alloc_equality(bmap);
9779 isl_seq_clr(bmap->eq[i], 1 + isl_basic_map_total_dim(bmap));
9780 pos1 += isl_basic_map_offset(bmap, type1);
9781 pos2 += isl_basic_map_offset(bmap, type2);
9782 isl_int_set_si(bmap->eq[i][pos1], 1);
9783 isl_int_set_si(bmap->eq[i][pos2], 1);
9784 bmap = isl_basic_map_finalize(bmap);
9786 map = isl_map_intersect(map, isl_map_from_basic_map(bmap));
9790 isl_basic_map_free(bmap);
9795 __isl_give isl_aff *isl_basic_map_get_div(__isl_keep isl_basic_map *bmap,
9799 isl_local_space *ls;
9804 if (!isl_basic_map_divs_known(bmap))
9805 isl_die(isl_basic_map_get_ctx(bmap), isl_error_invalid,
9806 "some divs are unknown", return NULL);
9808 ls = isl_basic_map_get_local_space(bmap);
9809 div = isl_local_space_get_div(ls, pos);
9810 isl_local_space_free(ls);
9815 __isl_give isl_aff *isl_basic_set_get_div(__isl_keep isl_basic_set *bset,
9818 return isl_basic_map_get_div(bset, pos);
9821 /* Plug in "subs" for dimension "type", "pos" of "bset".
9823 * Let i be the dimension to replace and let "subs" be of the form
9827 * Any integer division with a non-zero coefficient for i,
9829 * floor((a i + g)/m)
9833 * floor((a f + d g)/(m d))
9835 * Constraints of the form
9843 __isl_give isl_basic_set *isl_basic_set_substitute(
9844 __isl_take isl_basic_set *bset,
9845 enum isl_dim_type type, unsigned pos, __isl_keep isl_aff *subs)
9851 if (bset && isl_basic_set_plain_is_empty(bset))
9854 bset = isl_basic_set_cow(bset);
9858 ctx = isl_basic_set_get_ctx(bset);
9859 if (!isl_space_is_equal(bset->dim, subs->ls->dim))
9860 isl_die(ctx, isl_error_invalid,
9861 "spaces don't match", goto error);
9862 if (isl_local_space_dim(subs->ls, isl_dim_div) != 0)
9863 isl_die(ctx, isl_error_unsupported,
9864 "cannot handle divs yet", goto error);
9866 pos += isl_basic_set_offset(bset, type);
9870 for (i = 0; i < bset->n_eq; ++i) {
9871 if (isl_int_is_zero(bset->eq[i][pos]))
9873 isl_int_set(v, bset->eq[i][pos]);
9874 isl_int_set_si(bset->eq[i][pos], 0);
9875 isl_seq_combine(bset->eq[i], subs->v->el[0], bset->eq[i],
9876 v, subs->v->el + 1, subs->v->size - 1);
9879 for (i = 0; i < bset->n_ineq; ++i) {
9880 if (isl_int_is_zero(bset->ineq[i][pos]))
9882 isl_int_set(v, bset->ineq[i][pos]);
9883 isl_int_set_si(bset->ineq[i][pos], 0);
9884 isl_seq_combine(bset->ineq[i], subs->v->el[0], bset->ineq[i],
9885 v, subs->v->el + 1, subs->v->size - 1);
9888 for (i = 0; i < bset->n_div; ++i) {
9889 if (isl_int_is_zero(bset->div[i][1 + pos]))
9891 isl_int_set(v, bset->div[i][1 + pos]);
9892 isl_int_set_si(bset->div[i][1 + pos], 0);
9893 isl_seq_combine(bset->div[i] + 1,
9894 subs->v->el[0], bset->div[i] + 1,
9895 v, subs->v->el + 1, subs->v->size - 1);
9896 isl_int_mul(bset->div[i][0], bset->div[i][0], subs->v->el[0]);
9901 bset = isl_basic_set_simplify(bset);
9902 return isl_basic_set_finalize(bset);
9904 isl_basic_set_free(bset);
9908 /* Plug in "subs" for dimension "type", "pos" of "set".
9910 __isl_give isl_set *isl_set_substitute(__isl_take isl_set *set,
9911 enum isl_dim_type type, unsigned pos, __isl_keep isl_aff *subs)
9915 if (set && isl_set_plain_is_empty(set))
9918 set = isl_set_cow(set);
9922 for (i = set->n - 1; i >= 0; --i) {
9923 set->p[i] = isl_basic_set_substitute(set->p[i], type, pos, subs);
9926 if (isl_basic_set_plain_is_empty(set->p[i])) {
9927 isl_basic_set_free(set->p[i]);
9928 if (i != set->n - 1)
9929 set->p[i] = set->p[set->n - 1];